1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
44 #include "filenames.h"
47 #include "common/common-target.h"
48 #include "langhooks.h"
49 #include "tree-inline.h"
50 #include "tree-iterator.h"
51 #include "basic-block.h"
52 #include "tree-flow.h"
54 #include "pointer-set.h"
55 #include "tree-pass.h"
56 #include "langhooks-def.h"
57 #include "diagnostic.h"
58 #include "tree-diagnostic.h"
59 #include "tree-pretty-print.h"
66 /* Tree code classes. */
68 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
69 #define END_OF_BASE_TREE_CODES tcc_exceptional,
71 const enum tree_code_class tree_code_type
[] = {
72 #include "all-tree.def"
76 #undef END_OF_BASE_TREE_CODES
78 /* Table indexed by tree code giving number of expression
79 operands beyond the fixed part of the node structure.
80 Not used for types or decls. */
82 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
83 #define END_OF_BASE_TREE_CODES 0,
85 const unsigned char tree_code_length
[] = {
86 #include "all-tree.def"
90 #undef END_OF_BASE_TREE_CODES
92 /* Names of tree components.
93 Used for printing out the tree and error messages. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
95 #define END_OF_BASE_TREE_CODES "@dummy",
97 const char *const tree_code_name
[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Each tree code class has an associated string representation.
105 These must correspond to the tree_code_class entries. */
107 const char *const tree_code_class_strings
[] =
122 /* obstack.[ch] explicitly declined to prototype this. */
123 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
125 #ifdef GATHER_STATISTICS
126 /* Statistics-gathering stuff. */
128 static int tree_code_counts
[MAX_TREE_CODES
];
129 int tree_node_counts
[(int) all_kinds
];
130 int tree_node_sizes
[(int) all_kinds
];
132 /* Keep in sync with tree.h:enum tree_node_kind. */
133 static const char * const tree_node_kind_names
[] = {
151 #endif /* GATHER_STATISTICS */
153 /* Unique id for next decl created. */
154 static GTY(()) int next_decl_uid
;
155 /* Unique id for next type created. */
156 static GTY(()) int next_type_uid
= 1;
157 /* Unique id for next debug decl created. Use negative numbers,
158 to catch erroneous uses. */
159 static GTY(()) int next_debug_decl_uid
;
161 /* Since we cannot rehash a type after it is in the table, we have to
162 keep the hash code. */
164 struct GTY(()) type_hash
{
169 /* Initial size of the hash table (rounded to next prime). */
170 #define TYPE_HASH_INITIAL_SIZE 1000
172 /* Now here is the hash table. When recording a type, it is added to
173 the slot whose index is the hash code. Note that the hash table is
174 used for several kinds of types (function types, array types and
175 array index range types, for now). While all these live in the
176 same table, they are completely independent, and the hash code is
177 computed differently for each of these. */
179 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
180 htab_t type_hash_table
;
182 /* Hash table and temporary node for larger integer const values. */
183 static GTY (()) tree int_cst_node
;
184 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
185 htab_t int_cst_hash_table
;
187 /* Hash table for optimization flags and target option flags. Use the same
188 hash table for both sets of options. Nodes for building the current
189 optimization and target option nodes. The assumption is most of the time
190 the options created will already be in the hash table, so we avoid
191 allocating and freeing up a node repeatably. */
192 static GTY (()) tree cl_optimization_node
;
193 static GTY (()) tree cl_target_option_node
;
194 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
195 htab_t cl_option_hash_table
;
197 /* General tree->tree mapping structure for use in hash tables. */
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
201 htab_t debug_expr_for_decl
;
203 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
204 htab_t value_expr_for_decl
;
206 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
207 htab_t debug_args_for_decl
;
209 static GTY ((if_marked ("tree_priority_map_marked_p"),
210 param_is (struct tree_priority_map
)))
211 htab_t init_priority_for_decl
;
213 static void set_type_quals (tree
, int);
214 static int type_hash_eq (const void *, const void *);
215 static hashval_t
type_hash_hash (const void *);
216 static hashval_t
int_cst_hash_hash (const void *);
217 static int int_cst_hash_eq (const void *, const void *);
218 static hashval_t
cl_option_hash_hash (const void *);
219 static int cl_option_hash_eq (const void *, const void *);
220 static void print_type_hash_statistics (void);
221 static void print_debug_expr_statistics (void);
222 static void print_value_expr_statistics (void);
223 static int type_hash_marked_p (const void *);
224 static unsigned int type_hash_list (const_tree
, hashval_t
);
225 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
227 tree global_trees
[TI_MAX
];
228 tree integer_types
[itk_none
];
230 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
232 /* Number of operands for each OpenMP clause. */
233 unsigned const char omp_clause_num_ops
[] =
235 0, /* OMP_CLAUSE_ERROR */
236 1, /* OMP_CLAUSE_PRIVATE */
237 1, /* OMP_CLAUSE_SHARED */
238 1, /* OMP_CLAUSE_FIRSTPRIVATE */
239 2, /* OMP_CLAUSE_LASTPRIVATE */
240 4, /* OMP_CLAUSE_REDUCTION */
241 1, /* OMP_CLAUSE_COPYIN */
242 1, /* OMP_CLAUSE_COPYPRIVATE */
243 1, /* OMP_CLAUSE_IF */
244 1, /* OMP_CLAUSE_NUM_THREADS */
245 1, /* OMP_CLAUSE_SCHEDULE */
246 0, /* OMP_CLAUSE_NOWAIT */
247 0, /* OMP_CLAUSE_ORDERED */
248 0, /* OMP_CLAUSE_DEFAULT */
249 3, /* OMP_CLAUSE_COLLAPSE */
250 0, /* OMP_CLAUSE_UNTIED */
251 1, /* OMP_CLAUSE_FINAL */
252 0 /* OMP_CLAUSE_MERGEABLE */
255 const char * const omp_clause_code_name
[] =
278 /* Return the tree node structure used by tree code CODE. */
280 static inline enum tree_node_structure_enum
281 tree_node_structure_for_code (enum tree_code code
)
283 switch (TREE_CODE_CLASS (code
))
285 case tcc_declaration
:
290 return TS_FIELD_DECL
;
296 return TS_LABEL_DECL
;
298 return TS_RESULT_DECL
;
299 case DEBUG_EXPR_DECL
:
302 return TS_CONST_DECL
;
306 return TS_FUNCTION_DECL
;
307 case TRANSLATION_UNIT_DECL
:
308 return TS_TRANSLATION_UNIT_DECL
;
310 return TS_DECL_NON_COMMON
;
314 return TS_TYPE_NON_COMMON
;
323 default: /* tcc_constant and tcc_exceptional */
328 /* tcc_constant cases. */
329 case INTEGER_CST
: return TS_INT_CST
;
330 case REAL_CST
: return TS_REAL_CST
;
331 case FIXED_CST
: return TS_FIXED_CST
;
332 case COMPLEX_CST
: return TS_COMPLEX
;
333 case VECTOR_CST
: return TS_VECTOR
;
334 case STRING_CST
: return TS_STRING
;
335 /* tcc_exceptional cases. */
336 case ERROR_MARK
: return TS_COMMON
;
337 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
338 case TREE_LIST
: return TS_LIST
;
339 case TREE_VEC
: return TS_VEC
;
340 case SSA_NAME
: return TS_SSA_NAME
;
341 case PLACEHOLDER_EXPR
: return TS_COMMON
;
342 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
343 case BLOCK
: return TS_BLOCK
;
344 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
345 case TREE_BINFO
: return TS_BINFO
;
346 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
347 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
348 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
356 /* Initialize tree_contains_struct to describe the hierarchy of tree
360 initialize_tree_contains_struct (void)
364 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
367 enum tree_node_structure_enum ts_code
;
369 code
= (enum tree_code
) i
;
370 ts_code
= tree_node_structure_for_code (code
);
372 /* Mark the TS structure itself. */
373 tree_contains_struct
[code
][ts_code
] = 1;
375 /* Mark all the structures that TS is derived from. */
393 case TS_STATEMENT_LIST
:
394 MARK_TS_TYPED (code
);
398 case TS_DECL_MINIMAL
:
404 case TS_OPTIMIZATION
:
405 case TS_TARGET_OPTION
:
406 MARK_TS_COMMON (code
);
409 case TS_TYPE_WITH_LANG_SPECIFIC
:
410 MARK_TS_TYPE_COMMON (code
);
413 case TS_TYPE_NON_COMMON
:
414 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
418 MARK_TS_DECL_MINIMAL (code
);
423 MARK_TS_DECL_COMMON (code
);
426 case TS_DECL_NON_COMMON
:
427 MARK_TS_DECL_WITH_VIS (code
);
430 case TS_DECL_WITH_VIS
:
434 MARK_TS_DECL_WRTL (code
);
438 MARK_TS_DECL_COMMON (code
);
442 MARK_TS_DECL_WITH_VIS (code
);
446 case TS_FUNCTION_DECL
:
447 MARK_TS_DECL_NON_COMMON (code
);
450 case TS_TRANSLATION_UNIT_DECL
:
451 MARK_TS_DECL_COMMON (code
);
459 /* Basic consistency checks for attributes used in fold. */
460 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
461 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
462 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
463 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
464 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
465 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
466 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
467 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
468 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
469 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
470 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
471 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
472 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
473 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
474 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
475 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
476 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
477 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
478 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
479 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
480 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
481 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
482 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
483 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
484 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
485 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
486 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
487 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
488 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
489 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
490 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
491 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
492 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
493 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
494 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
495 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
496 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
497 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
506 /* Initialize the hash table of types. */
507 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
510 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
511 tree_decl_map_eq
, 0);
513 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
514 tree_decl_map_eq
, 0);
515 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
516 tree_priority_map_eq
, 0);
518 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
519 int_cst_hash_eq
, NULL
);
521 int_cst_node
= make_node (INTEGER_CST
);
523 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
524 cl_option_hash_eq
, NULL
);
526 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
527 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
529 /* Initialize the tree_contains_struct array. */
530 initialize_tree_contains_struct ();
531 lang_hooks
.init_ts ();
535 /* The name of the object as the assembler will see it (but before any
536 translations made by ASM_OUTPUT_LABELREF). Often this is the same
537 as DECL_NAME. It is an IDENTIFIER_NODE. */
539 decl_assembler_name (tree decl
)
541 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
542 lang_hooks
.set_decl_assembler_name (decl
);
543 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
546 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
549 decl_assembler_name_equal (tree decl
, const_tree asmname
)
551 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
552 const char *decl_str
;
553 const char *asmname_str
;
556 if (decl_asmname
== asmname
)
559 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
560 asmname_str
= IDENTIFIER_POINTER (asmname
);
563 /* If the target assembler name was set by the user, things are trickier.
564 We have a leading '*' to begin with. After that, it's arguable what
565 is the correct thing to do with -fleading-underscore. Arguably, we've
566 historically been doing the wrong thing in assemble_alias by always
567 printing the leading underscore. Since we're not changing that, make
568 sure user_label_prefix follows the '*' before matching. */
569 if (decl_str
[0] == '*')
571 size_t ulp_len
= strlen (user_label_prefix
);
577 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
578 decl_str
+= ulp_len
, test
=true;
582 if (asmname_str
[0] == '*')
584 size_t ulp_len
= strlen (user_label_prefix
);
590 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
591 asmname_str
+= ulp_len
, test
=true;
598 return strcmp (decl_str
, asmname_str
) == 0;
601 /* Hash asmnames ignoring the user specified marks. */
604 decl_assembler_name_hash (const_tree asmname
)
606 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
608 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
609 size_t ulp_len
= strlen (user_label_prefix
);
613 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
616 return htab_hash_string (decl_str
);
619 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
622 /* Compute the number of bytes occupied by a tree with code CODE.
623 This function cannot be used for nodes that have variable sizes,
624 including TREE_VEC, STRING_CST, and CALL_EXPR. */
626 tree_code_size (enum tree_code code
)
628 switch (TREE_CODE_CLASS (code
))
630 case tcc_declaration
: /* A decl node */
635 return sizeof (struct tree_field_decl
);
637 return sizeof (struct tree_parm_decl
);
639 return sizeof (struct tree_var_decl
);
641 return sizeof (struct tree_label_decl
);
643 return sizeof (struct tree_result_decl
);
645 return sizeof (struct tree_const_decl
);
647 return sizeof (struct tree_type_decl
);
649 return sizeof (struct tree_function_decl
);
650 case DEBUG_EXPR_DECL
:
651 return sizeof (struct tree_decl_with_rtl
);
653 return sizeof (struct tree_decl_non_common
);
657 case tcc_type
: /* a type node */
658 return sizeof (struct tree_type_non_common
);
660 case tcc_reference
: /* a reference */
661 case tcc_expression
: /* an expression */
662 case tcc_statement
: /* an expression with side effects */
663 case tcc_comparison
: /* a comparison expression */
664 case tcc_unary
: /* a unary arithmetic expression */
665 case tcc_binary
: /* a binary arithmetic expression */
666 return (sizeof (struct tree_exp
)
667 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
669 case tcc_constant
: /* a constant */
672 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
673 case REAL_CST
: return sizeof (struct tree_real_cst
);
674 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
675 case COMPLEX_CST
: return sizeof (struct tree_complex
);
676 case VECTOR_CST
: return sizeof (struct tree_vector
);
677 case STRING_CST
: gcc_unreachable ();
679 return lang_hooks
.tree_size (code
);
682 case tcc_exceptional
: /* something random, like an identifier. */
685 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
686 case TREE_LIST
: return sizeof (struct tree_list
);
689 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
692 case OMP_CLAUSE
: gcc_unreachable ();
694 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
696 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
697 case BLOCK
: return sizeof (struct tree_block
);
698 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
699 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
700 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
703 return lang_hooks
.tree_size (code
);
711 /* Compute the number of bytes occupied by NODE. This routine only
712 looks at TREE_CODE, except for those nodes that have variable sizes. */
714 tree_size (const_tree node
)
716 const enum tree_code code
= TREE_CODE (node
);
720 return (offsetof (struct tree_binfo
, base_binfos
)
721 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
724 return (sizeof (struct tree_vec
)
725 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
728 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
731 return (sizeof (struct tree_omp_clause
)
732 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
736 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
737 return (sizeof (struct tree_exp
)
738 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
740 return tree_code_size (code
);
744 /* Record interesting allocation statistics for a tree node with CODE
748 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
749 size_t length ATTRIBUTE_UNUSED
)
751 #ifdef GATHER_STATISTICS
752 enum tree_code_class type
= TREE_CODE_CLASS (code
);
757 case tcc_declaration
: /* A decl node */
761 case tcc_type
: /* a type node */
765 case tcc_statement
: /* an expression with side effects */
769 case tcc_reference
: /* a reference */
773 case tcc_expression
: /* an expression */
774 case tcc_comparison
: /* a comparison expression */
775 case tcc_unary
: /* a unary arithmetic expression */
776 case tcc_binary
: /* a binary arithmetic expression */
780 case tcc_constant
: /* a constant */
784 case tcc_exceptional
: /* something random, like an identifier. */
787 case IDENTIFIER_NODE
:
800 kind
= ssa_name_kind
;
812 kind
= omp_clause_kind
;
829 tree_code_counts
[(int) code
]++;
830 tree_node_counts
[(int) kind
]++;
831 tree_node_sizes
[(int) kind
] += length
;
835 /* Allocate and return a new UID from the DECL_UID namespace. */
838 allocate_decl_uid (void)
840 return next_decl_uid
++;
843 /* Return a newly allocated node of code CODE. For decl and type
844 nodes, some other fields are initialized. The rest of the node is
845 initialized to zero. This function cannot be used for TREE_VEC or
846 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
848 Achoo! I got a code in the node. */
851 make_node_stat (enum tree_code code MEM_STAT_DECL
)
854 enum tree_code_class type
= TREE_CODE_CLASS (code
);
855 size_t length
= tree_code_size (code
);
857 record_node_allocation_statistics (code
, length
);
859 t
= ggc_alloc_zone_cleared_tree_node_stat (
860 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
861 length PASS_MEM_STAT
);
862 TREE_SET_CODE (t
, code
);
867 TREE_SIDE_EFFECTS (t
) = 1;
870 case tcc_declaration
:
871 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
873 if (code
== FUNCTION_DECL
)
875 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
876 DECL_MODE (t
) = FUNCTION_MODE
;
881 DECL_SOURCE_LOCATION (t
) = input_location
;
882 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
883 DECL_UID (t
) = --next_debug_decl_uid
;
886 DECL_UID (t
) = allocate_decl_uid ();
887 SET_DECL_PT_UID (t
, -1);
889 if (TREE_CODE (t
) == LABEL_DECL
)
890 LABEL_DECL_UID (t
) = -1;
895 TYPE_UID (t
) = next_type_uid
++;
896 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
897 TYPE_USER_ALIGN (t
) = 0;
898 TYPE_MAIN_VARIANT (t
) = t
;
899 TYPE_CANONICAL (t
) = t
;
901 /* Default to no attributes for type, but let target change that. */
902 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
903 targetm
.set_default_type_attributes (t
);
905 /* We have not yet computed the alias set for this type. */
906 TYPE_ALIAS_SET (t
) = -1;
910 TREE_CONSTANT (t
) = 1;
919 case PREDECREMENT_EXPR
:
920 case PREINCREMENT_EXPR
:
921 case POSTDECREMENT_EXPR
:
922 case POSTINCREMENT_EXPR
:
923 /* All of these have side-effects, no matter what their
925 TREE_SIDE_EFFECTS (t
) = 1;
934 /* Other classes need no special treatment. */
941 /* Return a new node with the same contents as NODE except that its
942 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
945 copy_node_stat (tree node MEM_STAT_DECL
)
948 enum tree_code code
= TREE_CODE (node
);
951 gcc_assert (code
!= STATEMENT_LIST
);
953 length
= tree_size (node
);
954 record_node_allocation_statistics (code
, length
);
955 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
956 memcpy (t
, node
, length
);
958 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
960 TREE_ASM_WRITTEN (t
) = 0;
961 TREE_VISITED (t
) = 0;
962 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
963 *DECL_VAR_ANN_PTR (t
) = 0;
965 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
967 if (code
== DEBUG_EXPR_DECL
)
968 DECL_UID (t
) = --next_debug_decl_uid
;
971 DECL_UID (t
) = allocate_decl_uid ();
972 if (DECL_PT_UID_SET_P (node
))
973 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
975 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
976 && DECL_HAS_VALUE_EXPR_P (node
))
978 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
979 DECL_HAS_VALUE_EXPR_P (t
) = 1;
981 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
983 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
984 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
987 else if (TREE_CODE_CLASS (code
) == tcc_type
)
989 TYPE_UID (t
) = next_type_uid
++;
990 /* The following is so that the debug code for
991 the copy is different from the original type.
992 The two statements usually duplicate each other
993 (because they clear fields of the same union),
994 but the optimizer should catch that. */
995 TYPE_SYMTAB_POINTER (t
) = 0;
996 TYPE_SYMTAB_ADDRESS (t
) = 0;
998 /* Do not copy the values cache. */
999 if (TYPE_CACHED_VALUES_P(t
))
1001 TYPE_CACHED_VALUES_P (t
) = 0;
1002 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1009 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1010 For example, this can copy a list made of TREE_LIST nodes. */
1013 copy_list (tree list
)
1021 head
= prev
= copy_node (list
);
1022 next
= TREE_CHAIN (list
);
1025 TREE_CHAIN (prev
) = copy_node (next
);
1026 prev
= TREE_CHAIN (prev
);
1027 next
= TREE_CHAIN (next
);
1033 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1036 build_int_cst (tree type
, HOST_WIDE_INT low
)
1038 /* Support legacy code. */
1040 type
= integer_type_node
;
1042 return double_int_to_tree (type
, shwi_to_double_int (low
));
1045 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1048 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1052 return double_int_to_tree (type
, shwi_to_double_int (low
));
1055 /* Constructs tree in type TYPE from with value given by CST. Signedness
1056 of CST is assumed to be the same as the signedness of TYPE. */
1059 double_int_to_tree (tree type
, double_int cst
)
1061 /* Size types *are* sign extended. */
1062 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1063 || (TREE_CODE (type
) == INTEGER_TYPE
1064 && TYPE_IS_SIZETYPE (type
)));
1066 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1068 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1071 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1072 to be the same as the signedness of TYPE. */
1075 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1077 /* Size types *are* sign extended. */
1078 bool sign_extended_type
= (!TYPE_UNSIGNED (type
)
1079 || (TREE_CODE (type
) == INTEGER_TYPE
1080 && TYPE_IS_SIZETYPE (type
)));
1083 = double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1085 return double_int_equal_p (cst
, ext
);
1088 /* We force the double_int CST to the range of the type TYPE by sign or
1089 zero extending it. OVERFLOWABLE indicates if we are interested in
1090 overflow of the value, when >0 we are only interested in signed
1091 overflow, for <0 we are interested in any overflow. OVERFLOWED
1092 indicates whether overflow has already occurred. CONST_OVERFLOWED
1093 indicates whether constant overflow has already occurred. We force
1094 T's value to be within range of T's type (by setting to 0 or 1 all
1095 the bits outside the type's range). We set TREE_OVERFLOWED if,
1096 OVERFLOWED is nonzero,
1097 or OVERFLOWABLE is >0 and signed overflow occurs
1098 or OVERFLOWABLE is <0 and any overflow occurs
1099 We return a new tree node for the extended double_int. The node
1100 is shared if no overflow flags are set. */
1104 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1107 bool sign_extended_type
;
1109 /* Size types *are* sign extended. */
1110 sign_extended_type
= (!TYPE_UNSIGNED (type
)
1111 || (TREE_CODE (type
) == INTEGER_TYPE
1112 && TYPE_IS_SIZETYPE (type
)));
1114 /* If we need to set overflow flags, return a new unshared node. */
1115 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1119 || (overflowable
> 0 && sign_extended_type
))
1121 tree t
= make_node (INTEGER_CST
);
1122 TREE_INT_CST (t
) = double_int_ext (cst
, TYPE_PRECISION (type
),
1123 !sign_extended_type
);
1124 TREE_TYPE (t
) = type
;
1125 TREE_OVERFLOW (t
) = 1;
1130 /* Else build a shared node. */
1131 return double_int_to_tree (type
, cst
);
1134 /* These are the hash table functions for the hash table of INTEGER_CST
1135 nodes of a sizetype. */
1137 /* Return the hash code code X, an INTEGER_CST. */
1140 int_cst_hash_hash (const void *x
)
1142 const_tree
const t
= (const_tree
) x
;
1144 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1145 ^ htab_hash_pointer (TREE_TYPE (t
)));
1148 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1149 is the same as that given by *Y, which is the same. */
1152 int_cst_hash_eq (const void *x
, const void *y
)
1154 const_tree
const xt
= (const_tree
) x
;
1155 const_tree
const yt
= (const_tree
) y
;
1157 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1158 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1159 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1162 /* Create an INT_CST node of TYPE and value HI:LOW.
1163 The returned node is always shared. For small integers we use a
1164 per-type vector cache, for larger ones we use a single hash table. */
1167 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1175 switch (TREE_CODE (type
))
1178 gcc_assert (hi
== 0 && low
== 0);
1182 case REFERENCE_TYPE
:
1183 /* Cache NULL pointer. */
1192 /* Cache false or true. */
1200 if (TYPE_UNSIGNED (type
))
1203 limit
= INTEGER_SHARE_LIMIT
;
1204 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1210 limit
= INTEGER_SHARE_LIMIT
+ 1;
1211 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1213 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1227 /* Look for it in the type's vector of small shared ints. */
1228 if (!TYPE_CACHED_VALUES_P (type
))
1230 TYPE_CACHED_VALUES_P (type
) = 1;
1231 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1234 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1237 /* Make sure no one is clobbering the shared constant. */
1238 gcc_assert (TREE_TYPE (t
) == type
);
1239 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1240 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1244 /* Create a new shared int. */
1245 t
= make_node (INTEGER_CST
);
1247 TREE_INT_CST_LOW (t
) = low
;
1248 TREE_INT_CST_HIGH (t
) = hi
;
1249 TREE_TYPE (t
) = type
;
1251 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1256 /* Use the cache of larger shared ints. */
1259 TREE_INT_CST_LOW (int_cst_node
) = low
;
1260 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1261 TREE_TYPE (int_cst_node
) = type
;
1263 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1267 /* Insert this one into the hash table. */
1270 /* Make a new node for next time round. */
1271 int_cst_node
= make_node (INTEGER_CST
);
1278 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1279 and the rest are zeros. */
1282 build_low_bits_mask (tree type
, unsigned bits
)
1286 gcc_assert (bits
<= TYPE_PRECISION (type
));
1288 if (bits
== TYPE_PRECISION (type
)
1289 && !TYPE_UNSIGNED (type
))
1290 /* Sign extended all-ones mask. */
1291 mask
= double_int_minus_one
;
1293 mask
= double_int_mask (bits
);
1295 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1298 /* Checks that X is integer constant that can be expressed in (unsigned)
1299 HOST_WIDE_INT without loss of precision. */
1302 cst_and_fits_in_hwi (const_tree x
)
1304 if (TREE_CODE (x
) != INTEGER_CST
)
1307 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1310 return (TREE_INT_CST_HIGH (x
) == 0
1311 || TREE_INT_CST_HIGH (x
) == -1);
1314 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1315 are in a list pointed to by VALS. */
1318 build_vector (tree type
, tree vals
)
1320 tree v
= make_node (VECTOR_CST
);
1325 TREE_VECTOR_CST_ELTS (v
) = vals
;
1326 TREE_TYPE (v
) = type
;
1328 /* Iterate through elements and check for overflow. */
1329 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1331 tree value
= TREE_VALUE (link
);
1334 /* Don't crash if we get an address constant. */
1335 if (!CONSTANT_CLASS_P (value
))
1338 over
|= TREE_OVERFLOW (value
);
1341 gcc_assert (cnt
== TYPE_VECTOR_SUBPARTS (type
));
1343 TREE_OVERFLOW (v
) = over
;
1347 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1348 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1351 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1353 tree list
= NULL_TREE
;
1354 unsigned HOST_WIDE_INT idx
;
1357 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1358 list
= tree_cons (NULL_TREE
, value
, list
);
1359 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1360 list
= tree_cons (NULL_TREE
,
1361 build_zero_cst (TREE_TYPE (type
)), list
);
1362 return build_vector (type
, nreverse (list
));
1365 /* Build a vector of type VECTYPE where all the elements are SCs. */
1367 build_vector_from_val (tree vectype
, tree sc
)
1369 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1370 VEC(constructor_elt
, gc
) *v
= NULL
;
1372 if (sc
== error_mark_node
)
1375 /* Verify that the vector type is suitable for SC. Note that there
1376 is some inconsistency in the type-system with respect to restrict
1377 qualifications of pointers. Vector types always have a main-variant
1378 element type and the qualification is applied to the vector-type.
1379 So TREE_TYPE (vector-type) does not return a properly qualified
1380 vector element-type. */
1381 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1382 TREE_TYPE (vectype
)));
1384 v
= VEC_alloc (constructor_elt
, gc
, nunits
);
1385 for (i
= 0; i
< nunits
; ++i
)
1386 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1388 if (CONSTANT_CLASS_P (sc
))
1389 return build_vector_from_ctor (vectype
, v
);
1391 return build_constructor (vectype
, v
);
1394 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1395 are in the VEC pointed to by VALS. */
1397 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1399 tree c
= make_node (CONSTRUCTOR
);
1401 constructor_elt
*elt
;
1402 bool constant_p
= true;
1404 TREE_TYPE (c
) = type
;
1405 CONSTRUCTOR_ELTS (c
) = vals
;
1407 FOR_EACH_VEC_ELT (constructor_elt
, vals
, i
, elt
)
1408 if (!TREE_CONSTANT (elt
->value
))
1414 TREE_CONSTANT (c
) = constant_p
;
1419 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1422 build_constructor_single (tree type
, tree index
, tree value
)
1424 VEC(constructor_elt
,gc
) *v
;
1425 constructor_elt
*elt
;
1427 v
= VEC_alloc (constructor_elt
, gc
, 1);
1428 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1432 return build_constructor (type
, v
);
1436 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1437 are in a list pointed to by VALS. */
1439 build_constructor_from_list (tree type
, tree vals
)
1442 VEC(constructor_elt
,gc
) *v
= NULL
;
1446 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1447 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1448 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1451 return build_constructor (type
, v
);
1454 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1457 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1460 FIXED_VALUE_TYPE
*fp
;
1462 v
= make_node (FIXED_CST
);
1463 fp
= ggc_alloc_fixed_value ();
1464 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1466 TREE_TYPE (v
) = type
;
1467 TREE_FIXED_CST_PTR (v
) = fp
;
1471 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1474 build_real (tree type
, REAL_VALUE_TYPE d
)
1477 REAL_VALUE_TYPE
*dp
;
1480 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1481 Consider doing it via real_convert now. */
1483 v
= make_node (REAL_CST
);
1484 dp
= ggc_alloc_real_value ();
1485 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1487 TREE_TYPE (v
) = type
;
1488 TREE_REAL_CST_PTR (v
) = dp
;
1489 TREE_OVERFLOW (v
) = overflow
;
1493 /* Return a new REAL_CST node whose type is TYPE
1494 and whose value is the integer value of the INTEGER_CST node I. */
1497 real_value_from_int_cst (const_tree type
, const_tree i
)
1501 /* Clear all bits of the real value type so that we can later do
1502 bitwise comparisons to see if two values are the same. */
1503 memset (&d
, 0, sizeof d
);
1505 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1506 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1507 TYPE_UNSIGNED (TREE_TYPE (i
)));
1511 /* Given a tree representing an integer constant I, return a tree
1512 representing the same value as a floating-point constant of type TYPE. */
1515 build_real_from_int_cst (tree type
, const_tree i
)
1518 int overflow
= TREE_OVERFLOW (i
);
1520 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1522 TREE_OVERFLOW (v
) |= overflow
;
1526 /* Return a newly constructed STRING_CST node whose value is
1527 the LEN characters at STR.
1528 Note that for a C string literal, LEN should include the trailing NUL.
1529 The TREE_TYPE is not initialized. */
1532 build_string (int len
, const char *str
)
1537 /* Do not waste bytes provided by padding of struct tree_string. */
1538 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1540 record_node_allocation_statistics (STRING_CST
, length
);
1542 s
= ggc_alloc_tree_node (length
);
1544 memset (s
, 0, sizeof (struct tree_typed
));
1545 TREE_SET_CODE (s
, STRING_CST
);
1546 TREE_CONSTANT (s
) = 1;
1547 TREE_STRING_LENGTH (s
) = len
;
1548 memcpy (s
->string
.str
, str
, len
);
1549 s
->string
.str
[len
] = '\0';
1554 /* Return a newly constructed COMPLEX_CST node whose value is
1555 specified by the real and imaginary parts REAL and IMAG.
1556 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1557 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1560 build_complex (tree type
, tree real
, tree imag
)
1562 tree t
= make_node (COMPLEX_CST
);
1564 TREE_REALPART (t
) = real
;
1565 TREE_IMAGPART (t
) = imag
;
1566 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1567 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1571 /* Return a constant of arithmetic type TYPE which is the
1572 multiplicative identity of the set TYPE. */
1575 build_one_cst (tree type
)
1577 switch (TREE_CODE (type
))
1579 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1580 case POINTER_TYPE
: case REFERENCE_TYPE
:
1582 return build_int_cst (type
, 1);
1585 return build_real (type
, dconst1
);
1587 case FIXED_POINT_TYPE
:
1588 /* We can only generate 1 for accum types. */
1589 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1590 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1594 tree scalar
= build_one_cst (TREE_TYPE (type
));
1596 return build_vector_from_val (type
, scalar
);
1600 return build_complex (type
,
1601 build_one_cst (TREE_TYPE (type
)),
1602 build_zero_cst (TREE_TYPE (type
)));
1609 /* Build 0 constant of type TYPE. This is used by constructor folding
1610 and thus the constant should be represented in memory by
1614 build_zero_cst (tree type
)
1616 switch (TREE_CODE (type
))
1618 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1619 case POINTER_TYPE
: case REFERENCE_TYPE
:
1621 return build_int_cst (type
, 0);
1624 return build_real (type
, dconst0
);
1626 case FIXED_POINT_TYPE
:
1627 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1631 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1633 return build_vector_from_val (type
, scalar
);
1638 tree zero
= build_zero_cst (TREE_TYPE (type
));
1640 return build_complex (type
, zero
, zero
);
1644 if (!AGGREGATE_TYPE_P (type
))
1645 return fold_convert (type
, integer_zero_node
);
1646 return build_constructor (type
, NULL
);
1651 /* Build a BINFO with LEN language slots. */
1654 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1657 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1658 + VEC_embedded_size (tree
, base_binfos
));
1660 record_node_allocation_statistics (TREE_BINFO
, length
);
1662 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1664 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1666 TREE_SET_CODE (t
, TREE_BINFO
);
1668 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1673 /* Create a CASE_LABEL_EXPR tree node and return it. */
1676 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1678 tree t
= make_node (CASE_LABEL_EXPR
);
1680 TREE_TYPE (t
) = void_type_node
;
1681 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1683 CASE_LOW (t
) = low_value
;
1684 CASE_HIGH (t
) = high_value
;
1685 CASE_LABEL (t
) = label_decl
;
1686 CASE_CHAIN (t
) = NULL_TREE
;
1691 /* Build a newly constructed TREE_VEC node of length LEN. */
1694 make_tree_vec_stat (int len MEM_STAT_DECL
)
1697 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1699 record_node_allocation_statistics (TREE_VEC
, length
);
1701 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1703 TREE_SET_CODE (t
, TREE_VEC
);
1704 TREE_VEC_LENGTH (t
) = len
;
1709 /* Return 1 if EXPR is the integer constant zero or a complex constant
1713 integer_zerop (const_tree expr
)
1717 return ((TREE_CODE (expr
) == INTEGER_CST
1718 && TREE_INT_CST_LOW (expr
) == 0
1719 && TREE_INT_CST_HIGH (expr
) == 0)
1720 || (TREE_CODE (expr
) == COMPLEX_CST
1721 && integer_zerop (TREE_REALPART (expr
))
1722 && integer_zerop (TREE_IMAGPART (expr
))));
1725 /* Return 1 if EXPR is the integer constant one or the corresponding
1726 complex constant. */
1729 integer_onep (const_tree expr
)
1733 return ((TREE_CODE (expr
) == INTEGER_CST
1734 && TREE_INT_CST_LOW (expr
) == 1
1735 && TREE_INT_CST_HIGH (expr
) == 0)
1736 || (TREE_CODE (expr
) == COMPLEX_CST
1737 && integer_onep (TREE_REALPART (expr
))
1738 && integer_zerop (TREE_IMAGPART (expr
))));
1741 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1742 it contains. Likewise for the corresponding complex constant. */
1745 integer_all_onesp (const_tree expr
)
1752 if (TREE_CODE (expr
) == COMPLEX_CST
1753 && integer_all_onesp (TREE_REALPART (expr
))
1754 && integer_zerop (TREE_IMAGPART (expr
)))
1757 else if (TREE_CODE (expr
) != INTEGER_CST
)
1760 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1761 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1762 && TREE_INT_CST_HIGH (expr
) == -1)
1767 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1768 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1770 HOST_WIDE_INT high_value
;
1773 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1775 /* Can not handle precisions greater than twice the host int size. */
1776 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1777 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1778 /* Shifting by the host word size is undefined according to the ANSI
1779 standard, so we must handle this as a special case. */
1782 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1784 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1785 && TREE_INT_CST_HIGH (expr
) == high_value
);
1788 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1791 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1795 integer_pow2p (const_tree expr
)
1798 HOST_WIDE_INT high
, low
;
1802 if (TREE_CODE (expr
) == COMPLEX_CST
1803 && integer_pow2p (TREE_REALPART (expr
))
1804 && integer_zerop (TREE_IMAGPART (expr
)))
1807 if (TREE_CODE (expr
) != INTEGER_CST
)
1810 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1811 high
= TREE_INT_CST_HIGH (expr
);
1812 low
= TREE_INT_CST_LOW (expr
);
1814 /* First clear all bits that are beyond the type's precision in case
1815 we've been sign extended. */
1817 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1819 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1820 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1824 if (prec
< HOST_BITS_PER_WIDE_INT
)
1825 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1828 if (high
== 0 && low
== 0)
1831 return ((high
== 0 && (low
& (low
- 1)) == 0)
1832 || (low
== 0 && (high
& (high
- 1)) == 0));
1835 /* Return 1 if EXPR is an integer constant other than zero or a
1836 complex constant other than zero. */
1839 integer_nonzerop (const_tree expr
)
1843 return ((TREE_CODE (expr
) == INTEGER_CST
1844 && (TREE_INT_CST_LOW (expr
) != 0
1845 || TREE_INT_CST_HIGH (expr
) != 0))
1846 || (TREE_CODE (expr
) == COMPLEX_CST
1847 && (integer_nonzerop (TREE_REALPART (expr
))
1848 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1851 /* Return 1 if EXPR is the fixed-point constant zero. */
1854 fixed_zerop (const_tree expr
)
1856 return (TREE_CODE (expr
) == FIXED_CST
1857 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1860 /* Return the power of two represented by a tree node known to be a
1864 tree_log2 (const_tree expr
)
1867 HOST_WIDE_INT high
, low
;
1871 if (TREE_CODE (expr
) == COMPLEX_CST
)
1872 return tree_log2 (TREE_REALPART (expr
));
1874 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1875 high
= TREE_INT_CST_HIGH (expr
);
1876 low
= TREE_INT_CST_LOW (expr
);
1878 /* First clear all bits that are beyond the type's precision in case
1879 we've been sign extended. */
1881 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1883 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1884 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1888 if (prec
< HOST_BITS_PER_WIDE_INT
)
1889 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1892 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1893 : exact_log2 (low
));
1896 /* Similar, but return the largest integer Y such that 2 ** Y is less
1897 than or equal to EXPR. */
1900 tree_floor_log2 (const_tree expr
)
1903 HOST_WIDE_INT high
, low
;
1907 if (TREE_CODE (expr
) == COMPLEX_CST
)
1908 return tree_log2 (TREE_REALPART (expr
));
1910 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1911 high
= TREE_INT_CST_HIGH (expr
);
1912 low
= TREE_INT_CST_LOW (expr
);
1914 /* First clear all bits that are beyond the type's precision in case
1915 we've been sign extended. Ignore if type's precision hasn't been set
1916 since what we are doing is setting it. */
1918 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1920 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1921 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1925 if (prec
< HOST_BITS_PER_WIDE_INT
)
1926 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1929 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1930 : floor_log2 (low
));
1933 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1934 decimal float constants, so don't return 1 for them. */
1937 real_zerop (const_tree expr
)
1941 return ((TREE_CODE (expr
) == REAL_CST
1942 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1943 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1944 || (TREE_CODE (expr
) == COMPLEX_CST
1945 && real_zerop (TREE_REALPART (expr
))
1946 && real_zerop (TREE_IMAGPART (expr
))));
1949 /* Return 1 if EXPR is the real constant one in real or complex form.
1950 Trailing zeroes matter for decimal float constants, so don't return
1954 real_onep (const_tree expr
)
1958 return ((TREE_CODE (expr
) == REAL_CST
1959 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
1960 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1961 || (TREE_CODE (expr
) == COMPLEX_CST
1962 && real_onep (TREE_REALPART (expr
))
1963 && real_zerop (TREE_IMAGPART (expr
))));
1966 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
1967 for decimal float constants, so don't return 1 for them. */
1970 real_twop (const_tree expr
)
1974 return ((TREE_CODE (expr
) == REAL_CST
1975 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
1976 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1977 || (TREE_CODE (expr
) == COMPLEX_CST
1978 && real_twop (TREE_REALPART (expr
))
1979 && real_zerop (TREE_IMAGPART (expr
))));
1982 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
1983 matter for decimal float constants, so don't return 1 for them. */
1986 real_minus_onep (const_tree expr
)
1990 return ((TREE_CODE (expr
) == REAL_CST
1991 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
1992 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1993 || (TREE_CODE (expr
) == COMPLEX_CST
1994 && real_minus_onep (TREE_REALPART (expr
))
1995 && real_zerop (TREE_IMAGPART (expr
))));
1998 /* Nonzero if EXP is a constant or a cast of a constant. */
2001 really_constant_p (const_tree exp
)
2003 /* This is not quite the same as STRIP_NOPS. It does more. */
2004 while (CONVERT_EXPR_P (exp
)
2005 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2006 exp
= TREE_OPERAND (exp
, 0);
2007 return TREE_CONSTANT (exp
);
2010 /* Return first list element whose TREE_VALUE is ELEM.
2011 Return 0 if ELEM is not in LIST. */
2014 value_member (tree elem
, tree list
)
2018 if (elem
== TREE_VALUE (list
))
2020 list
= TREE_CHAIN (list
);
2025 /* Return first list element whose TREE_PURPOSE is ELEM.
2026 Return 0 if ELEM is not in LIST. */
2029 purpose_member (const_tree elem
, tree list
)
2033 if (elem
== TREE_PURPOSE (list
))
2035 list
= TREE_CHAIN (list
);
2040 /* Return true if ELEM is in V. */
2043 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
2047 FOR_EACH_VEC_ELT (tree
, v
, ix
, t
)
2053 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2057 chain_index (int idx
, tree chain
)
2059 for (; chain
&& idx
> 0; --idx
)
2060 chain
= TREE_CHAIN (chain
);
2064 /* Return nonzero if ELEM is part of the chain CHAIN. */
2067 chain_member (const_tree elem
, const_tree chain
)
2073 chain
= DECL_CHAIN (chain
);
2079 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2080 We expect a null pointer to mark the end of the chain.
2081 This is the Lisp primitive `length'. */
2084 list_length (const_tree t
)
2087 #ifdef ENABLE_TREE_CHECKING
2095 #ifdef ENABLE_TREE_CHECKING
2098 gcc_assert (p
!= q
);
2106 /* Returns the number of FIELD_DECLs in TYPE. */
2109 fields_length (const_tree type
)
2111 tree t
= TYPE_FIELDS (type
);
2114 for (; t
; t
= DECL_CHAIN (t
))
2115 if (TREE_CODE (t
) == FIELD_DECL
)
2121 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2122 UNION_TYPE TYPE, or NULL_TREE if none. */
2125 first_field (const_tree type
)
2127 tree t
= TYPE_FIELDS (type
);
2128 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2133 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2134 by modifying the last node in chain 1 to point to chain 2.
2135 This is the Lisp primitive `nconc'. */
2138 chainon (tree op1
, tree op2
)
2147 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2149 TREE_CHAIN (t1
) = op2
;
2151 #ifdef ENABLE_TREE_CHECKING
2154 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2155 gcc_assert (t2
!= t1
);
2162 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2165 tree_last (tree chain
)
2169 while ((next
= TREE_CHAIN (chain
)))
2174 /* Reverse the order of elements in the chain T,
2175 and return the new head of the chain (old last element). */
2180 tree prev
= 0, decl
, next
;
2181 for (decl
= t
; decl
; decl
= next
)
2183 /* We shouldn't be using this function to reverse BLOCK chains; we
2184 have blocks_nreverse for that. */
2185 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2186 next
= TREE_CHAIN (decl
);
2187 TREE_CHAIN (decl
) = prev
;
2193 /* Return a newly created TREE_LIST node whose
2194 purpose and value fields are PARM and VALUE. */
2197 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2199 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2200 TREE_PURPOSE (t
) = parm
;
2201 TREE_VALUE (t
) = value
;
2205 /* Build a chain of TREE_LIST nodes from a vector. */
2208 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2210 tree ret
= NULL_TREE
;
2214 FOR_EACH_VEC_ELT (tree
, vec
, i
, t
)
2216 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2217 pp
= &TREE_CHAIN (*pp
);
2222 /* Return a newly created TREE_LIST node whose
2223 purpose and value fields are PURPOSE and VALUE
2224 and whose TREE_CHAIN is CHAIN. */
2227 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2231 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2233 memset (node
, 0, sizeof (struct tree_common
));
2235 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2237 TREE_SET_CODE (node
, TREE_LIST
);
2238 TREE_CHAIN (node
) = chain
;
2239 TREE_PURPOSE (node
) = purpose
;
2240 TREE_VALUE (node
) = value
;
2244 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2248 ctor_to_vec (tree ctor
)
2250 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2254 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2255 VEC_quick_push (tree
, vec
, val
);
2260 /* Return the size nominally occupied by an object of type TYPE
2261 when it resides in memory. The value is measured in units of bytes,
2262 and its data type is that normally used for type sizes
2263 (which is the first type created by make_signed_type or
2264 make_unsigned_type). */
2267 size_in_bytes (const_tree type
)
2271 if (type
== error_mark_node
)
2272 return integer_zero_node
;
2274 type
= TYPE_MAIN_VARIANT (type
);
2275 t
= TYPE_SIZE_UNIT (type
);
2279 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2280 return size_zero_node
;
2286 /* Return the size of TYPE (in bytes) as a wide integer
2287 or return -1 if the size can vary or is larger than an integer. */
2290 int_size_in_bytes (const_tree type
)
2294 if (type
== error_mark_node
)
2297 type
= TYPE_MAIN_VARIANT (type
);
2298 t
= TYPE_SIZE_UNIT (type
);
2300 || TREE_CODE (t
) != INTEGER_CST
2301 || TREE_INT_CST_HIGH (t
) != 0
2302 /* If the result would appear negative, it's too big to represent. */
2303 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2306 return TREE_INT_CST_LOW (t
);
2309 /* Return the maximum size of TYPE (in bytes) as a wide integer
2310 or return -1 if the size can vary or is larger than an integer. */
2313 max_int_size_in_bytes (const_tree type
)
2315 HOST_WIDE_INT size
= -1;
2318 /* If this is an array type, check for a possible MAX_SIZE attached. */
2320 if (TREE_CODE (type
) == ARRAY_TYPE
)
2322 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2324 if (size_tree
&& host_integerp (size_tree
, 1))
2325 size
= tree_low_cst (size_tree
, 1);
2328 /* If we still haven't been able to get a size, see if the language
2329 can compute a maximum size. */
2333 size_tree
= lang_hooks
.types
.max_size (type
);
2335 if (size_tree
&& host_integerp (size_tree
, 1))
2336 size
= tree_low_cst (size_tree
, 1);
2342 /* Returns a tree for the size of EXP in bytes. */
2345 tree_expr_size (const_tree exp
)
2348 && DECL_SIZE_UNIT (exp
) != 0)
2349 return DECL_SIZE_UNIT (exp
);
2351 return size_in_bytes (TREE_TYPE (exp
));
2354 /* Return the bit position of FIELD, in bits from the start of the record.
2355 This is a tree of type bitsizetype. */
2358 bit_position (const_tree field
)
2360 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2361 DECL_FIELD_BIT_OFFSET (field
));
2364 /* Likewise, but return as an integer. It must be representable in
2365 that way (since it could be a signed value, we don't have the
2366 option of returning -1 like int_size_in_byte can. */
2369 int_bit_position (const_tree field
)
2371 return tree_low_cst (bit_position (field
), 0);
2374 /* Return the byte position of FIELD, in bytes from the start of the record.
2375 This is a tree of type sizetype. */
2378 byte_position (const_tree field
)
2380 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2381 DECL_FIELD_BIT_OFFSET (field
));
2384 /* Likewise, but return as an integer. It must be representable in
2385 that way (since it could be a signed value, we don't have the
2386 option of returning -1 like int_size_in_byte can. */
2389 int_byte_position (const_tree field
)
2391 return tree_low_cst (byte_position (field
), 0);
2394 /* Return the strictest alignment, in bits, that T is known to have. */
2397 expr_align (const_tree t
)
2399 unsigned int align0
, align1
;
2401 switch (TREE_CODE (t
))
2403 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2404 /* If we have conversions, we know that the alignment of the
2405 object must meet each of the alignments of the types. */
2406 align0
= expr_align (TREE_OPERAND (t
, 0));
2407 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2408 return MAX (align0
, align1
);
2410 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2411 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2412 case CLEANUP_POINT_EXPR
:
2413 /* These don't change the alignment of an object. */
2414 return expr_align (TREE_OPERAND (t
, 0));
2417 /* The best we can do is say that the alignment is the least aligned
2419 align0
= expr_align (TREE_OPERAND (t
, 1));
2420 align1
= expr_align (TREE_OPERAND (t
, 2));
2421 return MIN (align0
, align1
);
2423 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2424 meaningfully, it's always 1. */
2425 case LABEL_DECL
: case CONST_DECL
:
2426 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2428 gcc_assert (DECL_ALIGN (t
) != 0);
2429 return DECL_ALIGN (t
);
2435 /* Otherwise take the alignment from that of the type. */
2436 return TYPE_ALIGN (TREE_TYPE (t
));
2439 /* Return, as a tree node, the number of elements for TYPE (which is an
2440 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2443 array_type_nelts (const_tree type
)
2445 tree index_type
, min
, max
;
2447 /* If they did it with unspecified bounds, then we should have already
2448 given an error about it before we got here. */
2449 if (! TYPE_DOMAIN (type
))
2450 return error_mark_node
;
2452 index_type
= TYPE_DOMAIN (type
);
2453 min
= TYPE_MIN_VALUE (index_type
);
2454 max
= TYPE_MAX_VALUE (index_type
);
2456 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2458 return error_mark_node
;
2460 return (integer_zerop (min
)
2462 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2465 /* If arg is static -- a reference to an object in static storage -- then
2466 return the object. This is not the same as the C meaning of `static'.
2467 If arg isn't static, return NULL. */
2472 switch (TREE_CODE (arg
))
2475 /* Nested functions are static, even though taking their address will
2476 involve a trampoline as we unnest the nested function and create
2477 the trampoline on the tree level. */
2481 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2482 && ! DECL_THREAD_LOCAL_P (arg
)
2483 && ! DECL_DLLIMPORT_P (arg
)
2487 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2491 return TREE_STATIC (arg
) ? arg
: NULL
;
2498 /* If the thing being referenced is not a field, then it is
2499 something language specific. */
2500 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2502 /* If we are referencing a bitfield, we can't evaluate an
2503 ADDR_EXPR at compile time and so it isn't a constant. */
2504 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2507 return staticp (TREE_OPERAND (arg
, 0));
2513 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2516 case ARRAY_RANGE_REF
:
2517 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2518 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2519 return staticp (TREE_OPERAND (arg
, 0));
2523 case COMPOUND_LITERAL_EXPR
:
2524 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2534 /* Return whether OP is a DECL whose address is function-invariant. */
2537 decl_address_invariant_p (const_tree op
)
2539 /* The conditions below are slightly less strict than the one in
2542 switch (TREE_CODE (op
))
2551 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2552 || DECL_THREAD_LOCAL_P (op
)
2553 || DECL_CONTEXT (op
) == current_function_decl
2554 || decl_function_context (op
) == current_function_decl
)
2559 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2560 || decl_function_context (op
) == current_function_decl
)
2571 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2574 decl_address_ip_invariant_p (const_tree op
)
2576 /* The conditions below are slightly less strict than the one in
2579 switch (TREE_CODE (op
))
2587 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2588 && !DECL_DLLIMPORT_P (op
))
2589 || DECL_THREAD_LOCAL_P (op
))
2594 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2606 /* Return true if T is function-invariant (internal function, does
2607 not handle arithmetic; that's handled in skip_simple_arithmetic and
2608 tree_invariant_p). */
2610 static bool tree_invariant_p (tree t
);
2613 tree_invariant_p_1 (tree t
)
2617 if (TREE_CONSTANT (t
)
2618 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2621 switch (TREE_CODE (t
))
2627 op
= TREE_OPERAND (t
, 0);
2628 while (handled_component_p (op
))
2630 switch (TREE_CODE (op
))
2633 case ARRAY_RANGE_REF
:
2634 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2635 || TREE_OPERAND (op
, 2) != NULL_TREE
2636 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2641 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2647 op
= TREE_OPERAND (op
, 0);
2650 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2659 /* Return true if T is function-invariant. */
2662 tree_invariant_p (tree t
)
2664 tree inner
= skip_simple_arithmetic (t
);
2665 return tree_invariant_p_1 (inner
);
2668 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2669 Do this to any expression which may be used in more than one place,
2670 but must be evaluated only once.
2672 Normally, expand_expr would reevaluate the expression each time.
2673 Calling save_expr produces something that is evaluated and recorded
2674 the first time expand_expr is called on it. Subsequent calls to
2675 expand_expr just reuse the recorded value.
2677 The call to expand_expr that generates code that actually computes
2678 the value is the first call *at compile time*. Subsequent calls
2679 *at compile time* generate code to use the saved value.
2680 This produces correct result provided that *at run time* control
2681 always flows through the insns made by the first expand_expr
2682 before reaching the other places where the save_expr was evaluated.
2683 You, the caller of save_expr, must make sure this is so.
2685 Constants, and certain read-only nodes, are returned with no
2686 SAVE_EXPR because that is safe. Expressions containing placeholders
2687 are not touched; see tree.def for an explanation of what these
2691 save_expr (tree expr
)
2693 tree t
= fold (expr
);
2696 /* If the tree evaluates to a constant, then we don't want to hide that
2697 fact (i.e. this allows further folding, and direct checks for constants).
2698 However, a read-only object that has side effects cannot be bypassed.
2699 Since it is no problem to reevaluate literals, we just return the
2701 inner
= skip_simple_arithmetic (t
);
2702 if (TREE_CODE (inner
) == ERROR_MARK
)
2705 if (tree_invariant_p_1 (inner
))
2708 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2709 it means that the size or offset of some field of an object depends on
2710 the value within another field.
2712 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2713 and some variable since it would then need to be both evaluated once and
2714 evaluated more than once. Front-ends must assure this case cannot
2715 happen by surrounding any such subexpressions in their own SAVE_EXPR
2716 and forcing evaluation at the proper time. */
2717 if (contains_placeholder_p (inner
))
2720 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2721 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2723 /* This expression might be placed ahead of a jump to ensure that the
2724 value was computed on both sides of the jump. So make sure it isn't
2725 eliminated as dead. */
2726 TREE_SIDE_EFFECTS (t
) = 1;
2730 /* Look inside EXPR and into any simple arithmetic operations. Return
2731 the innermost non-arithmetic node. */
2734 skip_simple_arithmetic (tree expr
)
2738 /* We don't care about whether this can be used as an lvalue in this
2740 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2741 expr
= TREE_OPERAND (expr
, 0);
2743 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2744 a constant, it will be more efficient to not make another SAVE_EXPR since
2745 it will allow better simplification and GCSE will be able to merge the
2746 computations if they actually occur. */
2750 if (UNARY_CLASS_P (inner
))
2751 inner
= TREE_OPERAND (inner
, 0);
2752 else if (BINARY_CLASS_P (inner
))
2754 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2755 inner
= TREE_OPERAND (inner
, 0);
2756 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2757 inner
= TREE_OPERAND (inner
, 1);
2769 /* Return which tree structure is used by T. */
2771 enum tree_node_structure_enum
2772 tree_node_structure (const_tree t
)
2774 const enum tree_code code
= TREE_CODE (t
);
2775 return tree_node_structure_for_code (code
);
2778 /* Set various status flags when building a CALL_EXPR object T. */
2781 process_call_operands (tree t
)
2783 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2784 bool read_only
= false;
2785 int i
= call_expr_flags (t
);
2787 /* Calls have side-effects, except those to const or pure functions. */
2788 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2789 side_effects
= true;
2790 /* Propagate TREE_READONLY of arguments for const functions. */
2794 if (!side_effects
|| read_only
)
2795 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2797 tree op
= TREE_OPERAND (t
, i
);
2798 if (op
&& TREE_SIDE_EFFECTS (op
))
2799 side_effects
= true;
2800 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2804 TREE_SIDE_EFFECTS (t
) = side_effects
;
2805 TREE_READONLY (t
) = read_only
;
2808 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2809 size or offset that depends on a field within a record. */
2812 contains_placeholder_p (const_tree exp
)
2814 enum tree_code code
;
2819 code
= TREE_CODE (exp
);
2820 if (code
== PLACEHOLDER_EXPR
)
2823 switch (TREE_CODE_CLASS (code
))
2826 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2827 position computations since they will be converted into a
2828 WITH_RECORD_EXPR involving the reference, which will assume
2829 here will be valid. */
2830 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2832 case tcc_exceptional
:
2833 if (code
== TREE_LIST
)
2834 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2835 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2840 case tcc_comparison
:
2841 case tcc_expression
:
2845 /* Ignoring the first operand isn't quite right, but works best. */
2846 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2849 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2850 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2851 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2854 /* The save_expr function never wraps anything containing
2855 a PLACEHOLDER_EXPR. */
2862 switch (TREE_CODE_LENGTH (code
))
2865 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2867 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2868 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2879 const_call_expr_arg_iterator iter
;
2880 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2881 if (CONTAINS_PLACEHOLDER_P (arg
))
2895 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2896 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2900 type_contains_placeholder_1 (const_tree type
)
2902 /* If the size contains a placeholder or the parent type (component type in
2903 the case of arrays) type involves a placeholder, this type does. */
2904 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2905 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2906 || (!POINTER_TYPE_P (type
)
2908 && type_contains_placeholder_p (TREE_TYPE (type
))))
2911 /* Now do type-specific checks. Note that the last part of the check above
2912 greatly limits what we have to do below. */
2913 switch (TREE_CODE (type
))
2921 case REFERENCE_TYPE
:
2929 case FIXED_POINT_TYPE
:
2930 /* Here we just check the bounds. */
2931 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2932 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2935 /* We have already checked the component type above, so just check the
2937 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2941 case QUAL_UNION_TYPE
:
2945 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2946 if (TREE_CODE (field
) == FIELD_DECL
2947 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2948 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2949 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2950 || type_contains_placeholder_p (TREE_TYPE (field
))))
2961 /* Wrapper around above function used to cache its result. */
2964 type_contains_placeholder_p (tree type
)
2968 /* If the contains_placeholder_bits field has been initialized,
2969 then we know the answer. */
2970 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2971 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2973 /* Indicate that we've seen this type node, and the answer is false.
2974 This is what we want to return if we run into recursion via fields. */
2975 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2977 /* Compute the real value. */
2978 result
= type_contains_placeholder_1 (type
);
2980 /* Store the real value. */
2981 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2986 /* Push tree EXP onto vector QUEUE if it is not already present. */
2989 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
2994 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
2995 if (simple_cst_equal (iter
, exp
) == 1)
2999 VEC_safe_push (tree
, heap
, *queue
, exp
);
3002 /* Given a tree EXP, find all occurences of references to fields
3003 in a PLACEHOLDER_EXPR and place them in vector REFS without
3004 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3005 we assume here that EXP contains only arithmetic expressions
3006 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3010 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3012 enum tree_code code
= TREE_CODE (exp
);
3016 /* We handle TREE_LIST and COMPONENT_REF separately. */
3017 if (code
== TREE_LIST
)
3019 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3020 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3022 else if (code
== COMPONENT_REF
)
3024 for (inner
= TREE_OPERAND (exp
, 0);
3025 REFERENCE_CLASS_P (inner
);
3026 inner
= TREE_OPERAND (inner
, 0))
3029 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3030 push_without_duplicates (exp
, refs
);
3032 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3035 switch (TREE_CODE_CLASS (code
))
3040 case tcc_declaration
:
3041 /* Variables allocated to static storage can stay. */
3042 if (!TREE_STATIC (exp
))
3043 push_without_duplicates (exp
, refs
);
3046 case tcc_expression
:
3047 /* This is the pattern built in ada/make_aligning_type. */
3048 if (code
== ADDR_EXPR
3049 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3051 push_without_duplicates (exp
, refs
);
3055 /* Fall through... */
3057 case tcc_exceptional
:
3060 case tcc_comparison
:
3062 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3063 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3067 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3068 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3076 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3077 return a tree with all occurrences of references to F in a
3078 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3079 CONST_DECLs. Note that we assume here that EXP contains only
3080 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3081 occurring only in their argument list. */
3084 substitute_in_expr (tree exp
, tree f
, tree r
)
3086 enum tree_code code
= TREE_CODE (exp
);
3087 tree op0
, op1
, op2
, op3
;
3090 /* We handle TREE_LIST and COMPONENT_REF separately. */
3091 if (code
== TREE_LIST
)
3093 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3094 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3095 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3098 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3100 else if (code
== COMPONENT_REF
)
3104 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3105 and it is the right field, replace it with R. */
3106 for (inner
= TREE_OPERAND (exp
, 0);
3107 REFERENCE_CLASS_P (inner
);
3108 inner
= TREE_OPERAND (inner
, 0))
3112 op1
= TREE_OPERAND (exp
, 1);
3114 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3117 /* If this expression hasn't been completed let, leave it alone. */
3118 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3121 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3122 if (op0
== TREE_OPERAND (exp
, 0))
3126 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3129 switch (TREE_CODE_CLASS (code
))
3134 case tcc_declaration
:
3140 case tcc_expression
:
3144 /* Fall through... */
3146 case tcc_exceptional
:
3149 case tcc_comparison
:
3151 switch (TREE_CODE_LENGTH (code
))
3157 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3158 if (op0
== TREE_OPERAND (exp
, 0))
3161 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3165 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3166 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3168 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3171 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3175 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3176 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3177 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3179 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3180 && op2
== TREE_OPERAND (exp
, 2))
3183 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3187 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3188 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3189 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3190 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3192 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3193 && op2
== TREE_OPERAND (exp
, 2)
3194 && op3
== TREE_OPERAND (exp
, 3))
3198 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3210 new_tree
= NULL_TREE
;
3212 /* If we are trying to replace F with a constant, inline back
3213 functions which do nothing else than computing a value from
3214 the arguments they are passed. This makes it possible to
3215 fold partially or entirely the replacement expression. */
3216 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3218 tree t
= maybe_inline_call_in_expr (exp
);
3220 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3223 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3225 tree op
= TREE_OPERAND (exp
, i
);
3226 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3230 new_tree
= copy_node (exp
);
3231 TREE_OPERAND (new_tree
, i
) = new_op
;
3237 new_tree
= fold (new_tree
);
3238 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3239 process_call_operands (new_tree
);
3250 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3252 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3253 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3258 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3259 for it within OBJ, a tree that is an object or a chain of references. */
3262 substitute_placeholder_in_expr (tree exp
, tree obj
)
3264 enum tree_code code
= TREE_CODE (exp
);
3265 tree op0
, op1
, op2
, op3
;
3268 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3269 in the chain of OBJ. */
3270 if (code
== PLACEHOLDER_EXPR
)
3272 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3275 for (elt
= obj
; elt
!= 0;
3276 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3277 || TREE_CODE (elt
) == COND_EXPR
)
3278 ? TREE_OPERAND (elt
, 1)
3279 : (REFERENCE_CLASS_P (elt
)
3280 || UNARY_CLASS_P (elt
)
3281 || BINARY_CLASS_P (elt
)
3282 || VL_EXP_CLASS_P (elt
)
3283 || EXPRESSION_CLASS_P (elt
))
3284 ? TREE_OPERAND (elt
, 0) : 0))
3285 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3288 for (elt
= obj
; elt
!= 0;
3289 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3290 || TREE_CODE (elt
) == COND_EXPR
)
3291 ? TREE_OPERAND (elt
, 1)
3292 : (REFERENCE_CLASS_P (elt
)
3293 || UNARY_CLASS_P (elt
)
3294 || BINARY_CLASS_P (elt
)
3295 || VL_EXP_CLASS_P (elt
)
3296 || EXPRESSION_CLASS_P (elt
))
3297 ? TREE_OPERAND (elt
, 0) : 0))
3298 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3299 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3301 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3303 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3304 survives until RTL generation, there will be an error. */
3308 /* TREE_LIST is special because we need to look at TREE_VALUE
3309 and TREE_CHAIN, not TREE_OPERANDS. */
3310 else if (code
== TREE_LIST
)
3312 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3313 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3314 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3317 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3320 switch (TREE_CODE_CLASS (code
))
3323 case tcc_declaration
:
3326 case tcc_exceptional
:
3329 case tcc_comparison
:
3330 case tcc_expression
:
3333 switch (TREE_CODE_LENGTH (code
))
3339 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3340 if (op0
== TREE_OPERAND (exp
, 0))
3343 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3347 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3348 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3350 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3353 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3357 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3358 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3359 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3361 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3362 && op2
== TREE_OPERAND (exp
, 2))
3365 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3369 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3370 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3371 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3372 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3374 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3375 && op2
== TREE_OPERAND (exp
, 2)
3376 && op3
== TREE_OPERAND (exp
, 3))
3380 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3392 new_tree
= NULL_TREE
;
3394 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3396 tree op
= TREE_OPERAND (exp
, i
);
3397 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3401 new_tree
= copy_node (exp
);
3402 TREE_OPERAND (new_tree
, i
) = new_op
;
3408 new_tree
= fold (new_tree
);
3409 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3410 process_call_operands (new_tree
);
3421 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3423 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3424 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3429 /* Stabilize a reference so that we can use it any number of times
3430 without causing its operands to be evaluated more than once.
3431 Returns the stabilized reference. This works by means of save_expr,
3432 so see the caveats in the comments about save_expr.
3434 Also allows conversion expressions whose operands are references.
3435 Any other kind of expression is returned unchanged. */
3438 stabilize_reference (tree ref
)
3441 enum tree_code code
= TREE_CODE (ref
);
3448 /* No action is needed in this case. */
3453 case FIX_TRUNC_EXPR
:
3454 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3458 result
= build_nt (INDIRECT_REF
,
3459 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3463 result
= build_nt (COMPONENT_REF
,
3464 stabilize_reference (TREE_OPERAND (ref
, 0)),
3465 TREE_OPERAND (ref
, 1), NULL_TREE
);
3469 result
= build_nt (BIT_FIELD_REF
,
3470 stabilize_reference (TREE_OPERAND (ref
, 0)),
3471 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3472 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3476 result
= build_nt (ARRAY_REF
,
3477 stabilize_reference (TREE_OPERAND (ref
, 0)),
3478 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3479 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3482 case ARRAY_RANGE_REF
:
3483 result
= build_nt (ARRAY_RANGE_REF
,
3484 stabilize_reference (TREE_OPERAND (ref
, 0)),
3485 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3486 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3490 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3491 it wouldn't be ignored. This matters when dealing with
3493 return stabilize_reference_1 (ref
);
3495 /* If arg isn't a kind of lvalue we recognize, make no change.
3496 Caller should recognize the error for an invalid lvalue. */
3501 return error_mark_node
;
3504 TREE_TYPE (result
) = TREE_TYPE (ref
);
3505 TREE_READONLY (result
) = TREE_READONLY (ref
);
3506 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3507 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3512 /* Subroutine of stabilize_reference; this is called for subtrees of
3513 references. Any expression with side-effects must be put in a SAVE_EXPR
3514 to ensure that it is only evaluated once.
3516 We don't put SAVE_EXPR nodes around everything, because assigning very
3517 simple expressions to temporaries causes us to miss good opportunities
3518 for optimizations. Among other things, the opportunity to fold in the
3519 addition of a constant into an addressing mode often gets lost, e.g.
3520 "y[i+1] += x;". In general, we take the approach that we should not make
3521 an assignment unless we are forced into it - i.e., that any non-side effect
3522 operator should be allowed, and that cse should take care of coalescing
3523 multiple utterances of the same expression should that prove fruitful. */
3526 stabilize_reference_1 (tree e
)
3529 enum tree_code code
= TREE_CODE (e
);
3531 /* We cannot ignore const expressions because it might be a reference
3532 to a const array but whose index contains side-effects. But we can
3533 ignore things that are actual constant or that already have been
3534 handled by this function. */
3536 if (tree_invariant_p (e
))
3539 switch (TREE_CODE_CLASS (code
))
3541 case tcc_exceptional
:
3543 case tcc_declaration
:
3544 case tcc_comparison
:
3546 case tcc_expression
:
3549 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3550 so that it will only be evaluated once. */
3551 /* The reference (r) and comparison (<) classes could be handled as
3552 below, but it is generally faster to only evaluate them once. */
3553 if (TREE_SIDE_EFFECTS (e
))
3554 return save_expr (e
);
3558 /* Constants need no processing. In fact, we should never reach
3563 /* Division is slow and tends to be compiled with jumps,
3564 especially the division by powers of 2 that is often
3565 found inside of an array reference. So do it just once. */
3566 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3567 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3568 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3569 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3570 return save_expr (e
);
3571 /* Recursively stabilize each operand. */
3572 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3573 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3577 /* Recursively stabilize each operand. */
3578 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3585 TREE_TYPE (result
) = TREE_TYPE (e
);
3586 TREE_READONLY (result
) = TREE_READONLY (e
);
3587 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3588 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3593 /* Low-level constructors for expressions. */
3595 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3596 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3599 recompute_tree_invariant_for_addr_expr (tree t
)
3602 bool tc
= true, se
= false;
3604 /* We started out assuming this address is both invariant and constant, but
3605 does not have side effects. Now go down any handled components and see if
3606 any of them involve offsets that are either non-constant or non-invariant.
3607 Also check for side-effects.
3609 ??? Note that this code makes no attempt to deal with the case where
3610 taking the address of something causes a copy due to misalignment. */
3612 #define UPDATE_FLAGS(NODE) \
3613 do { tree _node = (NODE); \
3614 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3615 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3617 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3618 node
= TREE_OPERAND (node
, 0))
3620 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3621 array reference (probably made temporarily by the G++ front end),
3622 so ignore all the operands. */
3623 if ((TREE_CODE (node
) == ARRAY_REF
3624 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3625 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3627 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3628 if (TREE_OPERAND (node
, 2))
3629 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3630 if (TREE_OPERAND (node
, 3))
3631 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3633 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3634 FIELD_DECL, apparently. The G++ front end can put something else
3635 there, at least temporarily. */
3636 else if (TREE_CODE (node
) == COMPONENT_REF
3637 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3639 if (TREE_OPERAND (node
, 2))
3640 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3642 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3643 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3646 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3648 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3649 the address, since &(*a)->b is a form of addition. If it's a constant, the
3650 address is constant too. If it's a decl, its address is constant if the
3651 decl is static. Everything else is not constant and, furthermore,
3652 taking the address of a volatile variable is not volatile. */
3653 if (TREE_CODE (node
) == INDIRECT_REF
3654 || TREE_CODE (node
) == MEM_REF
)
3655 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3656 else if (CONSTANT_CLASS_P (node
))
3658 else if (DECL_P (node
))
3659 tc
&= (staticp (node
) != NULL_TREE
);
3663 se
|= TREE_SIDE_EFFECTS (node
);
3667 TREE_CONSTANT (t
) = tc
;
3668 TREE_SIDE_EFFECTS (t
) = se
;
3672 /* Build an expression of code CODE, data type TYPE, and operands as
3673 specified. Expressions and reference nodes can be created this way.
3674 Constants, decls, types and misc nodes cannot be.
3676 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3677 enough for all extant tree codes. */
3680 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3684 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3686 t
= make_node_stat (code PASS_MEM_STAT
);
3693 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3695 int length
= sizeof (struct tree_exp
);
3698 record_node_allocation_statistics (code
, length
);
3700 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3702 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3704 memset (t
, 0, sizeof (struct tree_common
));
3706 TREE_SET_CODE (t
, code
);
3708 TREE_TYPE (t
) = type
;
3709 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3710 TREE_OPERAND (t
, 0) = node
;
3711 TREE_BLOCK (t
) = NULL_TREE
;
3712 if (node
&& !TYPE_P (node
))
3714 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3715 TREE_READONLY (t
) = TREE_READONLY (node
);
3718 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3719 TREE_SIDE_EFFECTS (t
) = 1;
3723 /* All of these have side-effects, no matter what their
3725 TREE_SIDE_EFFECTS (t
) = 1;
3726 TREE_READONLY (t
) = 0;
3730 /* Whether a dereference is readonly has nothing to do with whether
3731 its operand is readonly. */
3732 TREE_READONLY (t
) = 0;
3737 recompute_tree_invariant_for_addr_expr (t
);
3741 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3742 && node
&& !TYPE_P (node
)
3743 && TREE_CONSTANT (node
))
3744 TREE_CONSTANT (t
) = 1;
3745 if (TREE_CODE_CLASS (code
) == tcc_reference
3746 && node
&& TREE_THIS_VOLATILE (node
))
3747 TREE_THIS_VOLATILE (t
) = 1;
3754 #define PROCESS_ARG(N) \
3756 TREE_OPERAND (t, N) = arg##N; \
3757 if (arg##N &&!TYPE_P (arg##N)) \
3759 if (TREE_SIDE_EFFECTS (arg##N)) \
3761 if (!TREE_READONLY (arg##N) \
3762 && !CONSTANT_CLASS_P (arg##N)) \
3763 (void) (read_only = 0); \
3764 if (!TREE_CONSTANT (arg##N)) \
3765 (void) (constant = 0); \
3770 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3772 bool constant
, read_only
, side_effects
;
3775 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3777 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3778 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3779 /* When sizetype precision doesn't match that of pointers
3780 we need to be able to build explicit extensions or truncations
3781 of the offset argument. */
3782 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3783 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3784 && TREE_CODE (arg1
) == INTEGER_CST
);
3786 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3787 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3788 && ptrofftype_p (TREE_TYPE (arg1
)));
3790 t
= make_node_stat (code PASS_MEM_STAT
);
3793 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3794 result based on those same flags for the arguments. But if the
3795 arguments aren't really even `tree' expressions, we shouldn't be trying
3798 /* Expressions without side effects may be constant if their
3799 arguments are as well. */
3800 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3801 || TREE_CODE_CLASS (code
) == tcc_binary
);
3803 side_effects
= TREE_SIDE_EFFECTS (t
);
3808 TREE_READONLY (t
) = read_only
;
3809 TREE_CONSTANT (t
) = constant
;
3810 TREE_SIDE_EFFECTS (t
) = side_effects
;
3811 TREE_THIS_VOLATILE (t
)
3812 = (TREE_CODE_CLASS (code
) == tcc_reference
3813 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3820 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3821 tree arg2 MEM_STAT_DECL
)
3823 bool constant
, read_only
, side_effects
;
3826 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3827 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3829 t
= make_node_stat (code PASS_MEM_STAT
);
3834 /* As a special exception, if COND_EXPR has NULL branches, we
3835 assume that it is a gimple statement and always consider
3836 it to have side effects. */
3837 if (code
== COND_EXPR
3838 && tt
== void_type_node
3839 && arg1
== NULL_TREE
3840 && arg2
== NULL_TREE
)
3841 side_effects
= true;
3843 side_effects
= TREE_SIDE_EFFECTS (t
);
3849 if (code
== COND_EXPR
)
3850 TREE_READONLY (t
) = read_only
;
3852 TREE_SIDE_EFFECTS (t
) = side_effects
;
3853 TREE_THIS_VOLATILE (t
)
3854 = (TREE_CODE_CLASS (code
) == tcc_reference
3855 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3861 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3862 tree arg2
, tree arg3 MEM_STAT_DECL
)
3864 bool constant
, read_only
, side_effects
;
3867 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3869 t
= make_node_stat (code PASS_MEM_STAT
);
3872 side_effects
= TREE_SIDE_EFFECTS (t
);
3879 TREE_SIDE_EFFECTS (t
) = side_effects
;
3880 TREE_THIS_VOLATILE (t
)
3881 = (TREE_CODE_CLASS (code
) == tcc_reference
3882 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3888 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3889 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3891 bool constant
, read_only
, side_effects
;
3894 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3896 t
= make_node_stat (code PASS_MEM_STAT
);
3899 side_effects
= TREE_SIDE_EFFECTS (t
);
3907 TREE_SIDE_EFFECTS (t
) = side_effects
;
3908 TREE_THIS_VOLATILE (t
)
3909 = (TREE_CODE_CLASS (code
) == tcc_reference
3910 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3916 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3917 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3919 bool constant
, read_only
, side_effects
;
3922 gcc_assert (code
== TARGET_MEM_REF
);
3924 t
= make_node_stat (code PASS_MEM_STAT
);
3927 side_effects
= TREE_SIDE_EFFECTS (t
);
3934 if (code
== TARGET_MEM_REF
)
3938 TREE_SIDE_EFFECTS (t
) = side_effects
;
3939 TREE_THIS_VOLATILE (t
)
3940 = (code
== TARGET_MEM_REF
3941 && arg5
&& TREE_THIS_VOLATILE (arg5
));
3946 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3947 on the pointer PTR. */
3950 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
3952 HOST_WIDE_INT offset
= 0;
3953 tree ptype
= TREE_TYPE (ptr
);
3955 /* For convenience allow addresses that collapse to a simple base
3957 if (TREE_CODE (ptr
) == ADDR_EXPR
3958 && (handled_component_p (TREE_OPERAND (ptr
, 0))
3959 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
3961 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
3963 ptr
= build_fold_addr_expr (ptr
);
3964 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
3966 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
3967 ptr
, build_int_cst (ptype
, offset
));
3968 SET_EXPR_LOCATION (tem
, loc
);
3972 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3975 mem_ref_offset (const_tree t
)
3977 tree toff
= TREE_OPERAND (t
, 1);
3978 return double_int_sext (tree_to_double_int (toff
),
3979 TYPE_PRECISION (TREE_TYPE (toff
)));
3982 /* Return the pointer-type relevant for TBAA purposes from the
3983 gimple memory reference tree T. This is the type to be used for
3984 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
3987 reference_alias_ptr_type (const_tree t
)
3989 const_tree base
= t
;
3990 while (handled_component_p (base
))
3991 base
= TREE_OPERAND (base
, 0);
3992 if (TREE_CODE (base
) == MEM_REF
)
3993 return TREE_TYPE (TREE_OPERAND (base
, 1));
3994 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
3995 return TREE_TYPE (TMR_OFFSET (base
));
3997 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4000 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4001 offsetted by OFFSET units. */
4004 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4006 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4007 build_fold_addr_expr (base
),
4008 build_int_cst (ptr_type_node
, offset
));
4009 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4010 recompute_tree_invariant_for_addr_expr (addr
);
4014 /* Similar except don't specify the TREE_TYPE
4015 and leave the TREE_SIDE_EFFECTS as 0.
4016 It is permissible for arguments to be null,
4017 or even garbage if their values do not matter. */
4020 build_nt (enum tree_code code
, ...)
4027 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4031 t
= make_node (code
);
4032 length
= TREE_CODE_LENGTH (code
);
4034 for (i
= 0; i
< length
; i
++)
4035 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4041 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4045 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4050 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4051 CALL_EXPR_FN (ret
) = fn
;
4052 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4053 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4054 CALL_EXPR_ARG (ret
, ix
) = t
;
4058 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4059 We do NOT enter this node in any sort of symbol table.
4061 LOC is the location of the decl.
4063 layout_decl is used to set up the decl's storage layout.
4064 Other slots are initialized to 0 or null pointers. */
4067 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4068 tree type MEM_STAT_DECL
)
4072 t
= make_node_stat (code PASS_MEM_STAT
);
4073 DECL_SOURCE_LOCATION (t
) = loc
;
4075 /* if (type == error_mark_node)
4076 type = integer_type_node; */
4077 /* That is not done, deliberately, so that having error_mark_node
4078 as the type can suppress useless errors in the use of this variable. */
4080 DECL_NAME (t
) = name
;
4081 TREE_TYPE (t
) = type
;
4083 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4089 /* Builds and returns function declaration with NAME and TYPE. */
4092 build_fn_decl (const char *name
, tree type
)
4094 tree id
= get_identifier (name
);
4095 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4097 DECL_EXTERNAL (decl
) = 1;
4098 TREE_PUBLIC (decl
) = 1;
4099 DECL_ARTIFICIAL (decl
) = 1;
4100 TREE_NOTHROW (decl
) = 1;
4105 VEC(tree
,gc
) *all_translation_units
;
4107 /* Builds a new translation-unit decl with name NAME, queues it in the
4108 global list of translation-unit decls and returns it. */
4111 build_translation_unit_decl (tree name
)
4113 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4115 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4116 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4121 /* BLOCK nodes are used to represent the structure of binding contours
4122 and declarations, once those contours have been exited and their contents
4123 compiled. This information is used for outputting debugging info. */
4126 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4128 tree block
= make_node (BLOCK
);
4130 BLOCK_VARS (block
) = vars
;
4131 BLOCK_SUBBLOCKS (block
) = subblocks
;
4132 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4133 BLOCK_CHAIN (block
) = chain
;
4138 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4140 LOC is the location to use in tree T. */
4143 protected_set_expr_location (tree t
, location_t loc
)
4145 if (t
&& CAN_HAVE_LOCATION_P (t
))
4146 SET_EXPR_LOCATION (t
, loc
);
4149 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4153 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4155 DECL_ATTRIBUTES (ddecl
) = attribute
;
4159 /* Borrowed from hashtab.c iterative_hash implementation. */
4160 #define mix(a,b,c) \
4162 a -= b; a -= c; a ^= (c>>13); \
4163 b -= c; b -= a; b ^= (a<< 8); \
4164 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4165 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4166 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4167 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4168 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4169 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4170 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4174 /* Produce good hash value combining VAL and VAL2. */
4176 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4178 /* the golden ratio; an arbitrary value. */
4179 hashval_t a
= 0x9e3779b9;
4185 /* Produce good hash value combining VAL and VAL2. */
4187 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4189 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4190 return iterative_hash_hashval_t (val
, val2
);
4193 hashval_t a
= (hashval_t
) val
;
4194 /* Avoid warnings about shifting of more than the width of the type on
4195 hosts that won't execute this path. */
4197 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4199 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4201 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4202 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4209 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4210 is ATTRIBUTE and its qualifiers are QUALS.
4212 Record such modified types already made so we don't make duplicates. */
4215 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4217 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4219 hashval_t hashcode
= 0;
4221 enum tree_code code
= TREE_CODE (ttype
);
4223 /* Building a distinct copy of a tagged type is inappropriate; it
4224 causes breakage in code that expects there to be a one-to-one
4225 relationship between a struct and its fields.
4226 build_duplicate_type is another solution (as used in
4227 handle_transparent_union_attribute), but that doesn't play well
4228 with the stronger C++ type identity model. */
4229 if (TREE_CODE (ttype
) == RECORD_TYPE
4230 || TREE_CODE (ttype
) == UNION_TYPE
4231 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4232 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4234 warning (OPT_Wattributes
,
4235 "ignoring attributes applied to %qT after definition",
4236 TYPE_MAIN_VARIANT (ttype
));
4237 return build_qualified_type (ttype
, quals
);
4240 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4241 ntype
= build_distinct_type_copy (ttype
);
4243 TYPE_ATTRIBUTES (ntype
) = attribute
;
4245 hashcode
= iterative_hash_object (code
, hashcode
);
4246 if (TREE_TYPE (ntype
))
4247 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4249 hashcode
= attribute_hash_list (attribute
, hashcode
);
4251 switch (TREE_CODE (ntype
))
4254 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4257 if (TYPE_DOMAIN (ntype
))
4258 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4262 hashcode
= iterative_hash_object
4263 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4264 hashcode
= iterative_hash_object
4265 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4268 case FIXED_POINT_TYPE
:
4270 unsigned int precision
= TYPE_PRECISION (ntype
);
4271 hashcode
= iterative_hash_object (precision
, hashcode
);
4278 ntype
= type_hash_canon (hashcode
, ntype
);
4280 /* If the target-dependent attributes make NTYPE different from
4281 its canonical type, we will need to use structural equality
4282 checks for this type. */
4283 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4284 || !comp_type_attributes (ntype
, ttype
))
4285 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4286 else if (TYPE_CANONICAL (ntype
) == ntype
)
4287 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4289 ttype
= build_qualified_type (ntype
, quals
);
4291 else if (TYPE_QUALS (ttype
) != quals
)
4292 ttype
= build_qualified_type (ttype
, quals
);
4297 /* Compare two attributes for their value identity. Return true if the
4298 attribute values are known to be equal; otherwise return false.
4302 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4304 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4307 if (TREE_VALUE (attr1
) != NULL_TREE
4308 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4309 && TREE_VALUE (attr2
) != NULL
4310 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4311 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4312 TREE_VALUE (attr2
)) == 1);
4314 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4317 /* Return 0 if the attributes for two types are incompatible, 1 if they
4318 are compatible, and 2 if they are nearly compatible (which causes a
4319 warning to be generated). */
4321 comp_type_attributes (const_tree type1
, const_tree type2
)
4323 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4324 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4329 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4331 const struct attribute_spec
*as
;
4334 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4335 if (!as
|| as
->affects_type_identity
== false)
4338 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4339 if (!attr
|| !attribute_value_equal (a
, attr
))
4344 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4346 const struct attribute_spec
*as
;
4348 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4349 if (!as
|| as
->affects_type_identity
== false)
4352 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4354 /* We don't need to compare trees again, as we did this
4355 already in first loop. */
4357 /* All types - affecting identity - are equal, so
4358 there is no need to call target hook for comparison. */
4362 /* As some type combinations - like default calling-convention - might
4363 be compatible, we have to call the target hook to get the final result. */
4364 return targetm
.comp_type_attributes (type1
, type2
);
4367 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4370 Record such modified types already made so we don't make duplicates. */
4373 build_type_attribute_variant (tree ttype
, tree attribute
)
4375 return build_type_attribute_qual_variant (ttype
, attribute
,
4376 TYPE_QUALS (ttype
));
4380 /* Reset the expression *EXPR_P, a size or position.
4382 ??? We could reset all non-constant sizes or positions. But it's cheap
4383 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4385 We need to reset self-referential sizes or positions because they cannot
4386 be gimplified and thus can contain a CALL_EXPR after the gimplification
4387 is finished, which will run afoul of LTO streaming. And they need to be
4388 reset to something essentially dummy but not constant, so as to preserve
4389 the properties of the object they are attached to. */
4392 free_lang_data_in_one_sizepos (tree
*expr_p
)
4394 tree expr
= *expr_p
;
4395 if (CONTAINS_PLACEHOLDER_P (expr
))
4396 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4400 /* Reset all the fields in a binfo node BINFO. We only keep
4401 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4404 free_lang_data_in_binfo (tree binfo
)
4409 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4411 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4412 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4413 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4414 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4416 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4417 free_lang_data_in_binfo (t
);
4421 /* Reset all language specific information still present in TYPE. */
4424 free_lang_data_in_type (tree type
)
4426 gcc_assert (TYPE_P (type
));
4428 /* Give the FE a chance to remove its own data first. */
4429 lang_hooks
.free_lang_data (type
);
4431 TREE_LANG_FLAG_0 (type
) = 0;
4432 TREE_LANG_FLAG_1 (type
) = 0;
4433 TREE_LANG_FLAG_2 (type
) = 0;
4434 TREE_LANG_FLAG_3 (type
) = 0;
4435 TREE_LANG_FLAG_4 (type
) = 0;
4436 TREE_LANG_FLAG_5 (type
) = 0;
4437 TREE_LANG_FLAG_6 (type
) = 0;
4439 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4441 /* Remove the const and volatile qualifiers from arguments. The
4442 C++ front end removes them, but the C front end does not,
4443 leading to false ODR violation errors when merging two
4444 instances of the same function signature compiled by
4445 different front ends. */
4448 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4450 tree arg_type
= TREE_VALUE (p
);
4452 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4454 int quals
= TYPE_QUALS (arg_type
)
4456 & ~TYPE_QUAL_VOLATILE
;
4457 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4458 free_lang_data_in_type (TREE_VALUE (p
));
4463 /* Remove members that are not actually FIELD_DECLs from the field
4464 list of an aggregate. These occur in C++. */
4465 if (RECORD_OR_UNION_TYPE_P (type
))
4469 /* Note that TYPE_FIELDS can be shared across distinct
4470 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4471 to be removed, we cannot set its TREE_CHAIN to NULL.
4472 Otherwise, we would not be able to find all the other fields
4473 in the other instances of this TREE_TYPE.
4475 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4477 member
= TYPE_FIELDS (type
);
4480 if (TREE_CODE (member
) == FIELD_DECL
)
4483 TREE_CHAIN (prev
) = member
;
4485 TYPE_FIELDS (type
) = member
;
4489 member
= TREE_CHAIN (member
);
4493 TREE_CHAIN (prev
) = NULL_TREE
;
4495 TYPE_FIELDS (type
) = NULL_TREE
;
4497 TYPE_METHODS (type
) = NULL_TREE
;
4498 if (TYPE_BINFO (type
))
4499 free_lang_data_in_binfo (TYPE_BINFO (type
));
4503 /* For non-aggregate types, clear out the language slot (which
4504 overloads TYPE_BINFO). */
4505 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4507 if (INTEGRAL_TYPE_P (type
)
4508 || SCALAR_FLOAT_TYPE_P (type
)
4509 || FIXED_POINT_TYPE_P (type
))
4511 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4512 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4516 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4517 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4519 if (debug_info_level
< DINFO_LEVEL_TERSE
4520 || (TYPE_CONTEXT (type
)
4521 && TREE_CODE (TYPE_CONTEXT (type
)) != FUNCTION_DECL
4522 && TREE_CODE (TYPE_CONTEXT (type
)) != NAMESPACE_DECL
))
4523 TYPE_CONTEXT (type
) = NULL_TREE
;
4527 /* Return true if DECL may need an assembler name to be set. */
4530 need_assembler_name_p (tree decl
)
4532 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4533 if (TREE_CODE (decl
) != FUNCTION_DECL
4534 && TREE_CODE (decl
) != VAR_DECL
)
4537 /* If DECL already has its assembler name set, it does not need a
4539 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4540 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4543 /* Abstract decls do not need an assembler name. */
4544 if (DECL_ABSTRACT (decl
))
4547 /* For VAR_DECLs, only static, public and external symbols need an
4549 if (TREE_CODE (decl
) == VAR_DECL
4550 && !TREE_STATIC (decl
)
4551 && !TREE_PUBLIC (decl
)
4552 && !DECL_EXTERNAL (decl
))
4555 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4557 /* Do not set assembler name on builtins. Allow RTL expansion to
4558 decide whether to expand inline or via a regular call. */
4559 if (DECL_BUILT_IN (decl
)
4560 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4563 /* Functions represented in the callgraph need an assembler name. */
4564 if (cgraph_get_node (decl
) != NULL
)
4567 /* Unused and not public functions don't need an assembler name. */
4568 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4576 /* Reset all language specific information still present in symbol
4580 free_lang_data_in_decl (tree decl
)
4582 gcc_assert (DECL_P (decl
));
4584 /* Give the FE a chance to remove its own data first. */
4585 lang_hooks
.free_lang_data (decl
);
4587 TREE_LANG_FLAG_0 (decl
) = 0;
4588 TREE_LANG_FLAG_1 (decl
) = 0;
4589 TREE_LANG_FLAG_2 (decl
) = 0;
4590 TREE_LANG_FLAG_3 (decl
) = 0;
4591 TREE_LANG_FLAG_4 (decl
) = 0;
4592 TREE_LANG_FLAG_5 (decl
) = 0;
4593 TREE_LANG_FLAG_6 (decl
) = 0;
4595 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4596 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4597 if (TREE_CODE (decl
) == FIELD_DECL
)
4598 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4600 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4602 if (gimple_has_body_p (decl
))
4606 /* If DECL has a gimple body, then the context for its
4607 arguments must be DECL. Otherwise, it doesn't really
4608 matter, as we will not be emitting any code for DECL. In
4609 general, there may be other instances of DECL created by
4610 the front end and since PARM_DECLs are generally shared,
4611 their DECL_CONTEXT changes as the replicas of DECL are
4612 created. The only time where DECL_CONTEXT is important
4613 is for the FUNCTION_DECLs that have a gimple body (since
4614 the PARM_DECL will be used in the function's body). */
4615 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4616 DECL_CONTEXT (t
) = decl
;
4619 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4620 At this point, it is not needed anymore. */
4621 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4623 /* Clear the abstract origin if it refers to a method. Otherwise
4624 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4625 origin will not be output correctly. */
4626 if (DECL_ABSTRACT_ORIGIN (decl
)
4627 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4628 && RECORD_OR_UNION_TYPE_P
4629 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4630 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4632 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4633 DECL_VINDEX referring to itself into a vtable slot number as it
4634 should. Happens with functions that are copied and then forgotten
4635 about. Just clear it, it won't matter anymore. */
4636 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4637 DECL_VINDEX (decl
) = NULL_TREE
;
4639 else if (TREE_CODE (decl
) == VAR_DECL
)
4641 if ((DECL_EXTERNAL (decl
)
4642 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4643 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4644 DECL_INITIAL (decl
) = NULL_TREE
;
4646 else if (TREE_CODE (decl
) == TYPE_DECL
4647 || TREE_CODE (decl
) == FIELD_DECL
)
4648 DECL_INITIAL (decl
) = NULL_TREE
;
4649 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4650 && DECL_INITIAL (decl
)
4651 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4653 /* Strip builtins from the translation-unit BLOCK. We still have targets
4654 without builtin_decl_explicit support and also builtins are shared
4655 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4656 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4660 if (TREE_CODE (var
) == FUNCTION_DECL
4661 && DECL_BUILT_IN (var
))
4662 *nextp
= TREE_CHAIN (var
);
4664 nextp
= &TREE_CHAIN (var
);
4670 /* Data used when collecting DECLs and TYPEs for language data removal. */
4672 struct free_lang_data_d
4674 /* Worklist to avoid excessive recursion. */
4675 VEC(tree
,heap
) *worklist
;
4677 /* Set of traversed objects. Used to avoid duplicate visits. */
4678 struct pointer_set_t
*pset
;
4680 /* Array of symbols to process with free_lang_data_in_decl. */
4681 VEC(tree
,heap
) *decls
;
4683 /* Array of types to process with free_lang_data_in_type. */
4684 VEC(tree
,heap
) *types
;
4688 /* Save all language fields needed to generate proper debug information
4689 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4692 save_debug_info_for_decl (tree t
)
4694 /*struct saved_debug_info_d *sdi;*/
4696 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4698 /* FIXME. Partial implementation for saving debug info removed. */
4702 /* Save all language fields needed to generate proper debug information
4703 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4706 save_debug_info_for_type (tree t
)
4708 /*struct saved_debug_info_d *sdi;*/
4710 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4712 /* FIXME. Partial implementation for saving debug info removed. */
4716 /* Add type or decl T to one of the list of tree nodes that need their
4717 language data removed. The lists are held inside FLD. */
4720 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4724 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4725 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4726 save_debug_info_for_decl (t
);
4728 else if (TYPE_P (t
))
4730 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4731 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4732 save_debug_info_for_type (t
);
4738 /* Push tree node T into FLD->WORKLIST. */
4741 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4743 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4744 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4748 /* Operand callback helper for free_lang_data_in_node. *TP is the
4749 subtree operand being considered. */
4752 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4755 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4757 if (TREE_CODE (t
) == TREE_LIST
)
4760 /* Language specific nodes will be removed, so there is no need
4761 to gather anything under them. */
4762 if (is_lang_specific (t
))
4770 /* Note that walk_tree does not traverse every possible field in
4771 decls, so we have to do our own traversals here. */
4772 add_tree_to_fld_list (t
, fld
);
4774 fld_worklist_push (DECL_NAME (t
), fld
);
4775 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4776 fld_worklist_push (DECL_SIZE (t
), fld
);
4777 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4779 /* We are going to remove everything under DECL_INITIAL for
4780 TYPE_DECLs. No point walking them. */
4781 if (TREE_CODE (t
) != TYPE_DECL
)
4782 fld_worklist_push (DECL_INITIAL (t
), fld
);
4784 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4785 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4787 if (TREE_CODE (t
) == FUNCTION_DECL
)
4789 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4790 fld_worklist_push (DECL_RESULT (t
), fld
);
4792 else if (TREE_CODE (t
) == TYPE_DECL
)
4794 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4795 fld_worklist_push (DECL_VINDEX (t
), fld
);
4796 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
4798 else if (TREE_CODE (t
) == FIELD_DECL
)
4800 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4801 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4802 fld_worklist_push (DECL_QUALIFIER (t
), fld
);
4803 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4804 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4806 else if (TREE_CODE (t
) == VAR_DECL
)
4808 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4809 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4812 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4813 && DECL_HAS_VALUE_EXPR_P (t
))
4814 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4816 if (TREE_CODE (t
) != FIELD_DECL
4817 && TREE_CODE (t
) != TYPE_DECL
)
4818 fld_worklist_push (TREE_CHAIN (t
), fld
);
4821 else if (TYPE_P (t
))
4823 /* Note that walk_tree does not traverse every possible field in
4824 types, so we have to do our own traversals here. */
4825 add_tree_to_fld_list (t
, fld
);
4827 if (!RECORD_OR_UNION_TYPE_P (t
))
4828 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4829 fld_worklist_push (TYPE_SIZE (t
), fld
);
4830 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4831 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4832 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4833 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4834 fld_worklist_push (TYPE_NAME (t
), fld
);
4835 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4836 them and thus do not and want not to reach unused pointer types
4838 if (!POINTER_TYPE_P (t
))
4839 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4840 if (!RECORD_OR_UNION_TYPE_P (t
))
4841 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4842 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4843 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4844 do not and want not to reach unused variants this way. */
4845 fld_worklist_push (TYPE_CONTEXT (t
), fld
);
4846 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4847 and want not to reach unused types this way. */
4849 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4853 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4855 fld_worklist_push (TREE_TYPE (tem
), fld
);
4856 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4858 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4859 && TREE_CODE (tem
) == TREE_LIST
)
4862 fld_worklist_push (TREE_VALUE (tem
), fld
);
4863 tem
= TREE_CHAIN (tem
);
4867 if (RECORD_OR_UNION_TYPE_P (t
))
4870 /* Push all TYPE_FIELDS - there can be interleaving interesting
4871 and non-interesting things. */
4872 tem
= TYPE_FIELDS (t
);
4875 if (TREE_CODE (tem
) == FIELD_DECL
)
4876 fld_worklist_push (tem
, fld
);
4877 tem
= TREE_CHAIN (tem
);
4881 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
4884 else if (TREE_CODE (t
) == BLOCK
)
4887 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4888 fld_worklist_push (tem
, fld
);
4889 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4890 fld_worklist_push (tem
, fld
);
4891 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4894 if (TREE_CODE (t
) != IDENTIFIER_NODE
4895 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
4896 fld_worklist_push (TREE_TYPE (t
), fld
);
4902 /* Find decls and types in T. */
4905 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4909 if (!pointer_set_contains (fld
->pset
, t
))
4910 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4911 if (VEC_empty (tree
, fld
->worklist
))
4913 t
= VEC_pop (tree
, fld
->worklist
);
4917 /* Translate all the types in LIST with the corresponding runtime
4921 get_eh_types_for_runtime (tree list
)
4925 if (list
== NULL_TREE
)
4928 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4930 list
= TREE_CHAIN (list
);
4933 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4934 TREE_CHAIN (prev
) = n
;
4935 prev
= TREE_CHAIN (prev
);
4936 list
= TREE_CHAIN (list
);
4943 /* Find decls and types referenced in EH region R and store them in
4944 FLD->DECLS and FLD->TYPES. */
4947 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4958 /* The types referenced in each catch must first be changed to the
4959 EH types used at runtime. This removes references to FE types
4961 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
4963 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
4964 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
4969 case ERT_ALLOWED_EXCEPTIONS
:
4970 r
->u
.allowed
.type_list
4971 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
4972 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
4975 case ERT_MUST_NOT_THROW
:
4976 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
4977 find_decls_types_r
, fld
, fld
->pset
);
4983 /* Find decls and types referenced in cgraph node N and store them in
4984 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
4985 look for *every* kind of DECL and TYPE node reachable from N,
4986 including those embedded inside types and decls (i.e,, TYPE_DECLs,
4987 NAMESPACE_DECLs, etc). */
4990 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
4993 struct function
*fn
;
4997 find_decls_types (n
->decl
, fld
);
4999 if (!gimple_has_body_p (n
->decl
))
5002 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5004 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5006 /* Traverse locals. */
5007 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5008 find_decls_types (t
, fld
);
5010 /* Traverse EH regions in FN. */
5013 FOR_ALL_EH_REGION_FN (r
, fn
)
5014 find_decls_types_in_eh_region (r
, fld
);
5017 /* Traverse every statement in FN. */
5018 FOR_EACH_BB_FN (bb
, fn
)
5020 gimple_stmt_iterator si
;
5023 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5025 gimple phi
= gsi_stmt (si
);
5027 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5029 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5030 find_decls_types (*arg_p
, fld
);
5034 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5036 gimple stmt
= gsi_stmt (si
);
5038 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5040 tree arg
= gimple_op (stmt
, i
);
5041 find_decls_types (arg
, fld
);
5048 /* Find decls and types referenced in varpool node N and store them in
5049 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5050 look for *every* kind of DECL and TYPE node reachable from N,
5051 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5052 NAMESPACE_DECLs, etc). */
5055 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5057 find_decls_types (v
->decl
, fld
);
5060 /* If T needs an assembler name, have one created for it. */
5063 assign_assembler_name_if_neeeded (tree t
)
5065 if (need_assembler_name_p (t
))
5067 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5068 diagnostics that use input_location to show locus
5069 information. The problem here is that, at this point,
5070 input_location is generally anchored to the end of the file
5071 (since the parser is long gone), so we don't have a good
5072 position to pin it to.
5074 To alleviate this problem, this uses the location of T's
5075 declaration. Examples of this are
5076 testsuite/g++.dg/template/cond2.C and
5077 testsuite/g++.dg/template/pr35240.C. */
5078 location_t saved_location
= input_location
;
5079 input_location
= DECL_SOURCE_LOCATION (t
);
5081 decl_assembler_name (t
);
5083 input_location
= saved_location
;
5088 /* Free language specific information for every operand and expression
5089 in every node of the call graph. This process operates in three stages:
5091 1- Every callgraph node and varpool node is traversed looking for
5092 decls and types embedded in them. This is a more exhaustive
5093 search than that done by find_referenced_vars, because it will
5094 also collect individual fields, decls embedded in types, etc.
5096 2- All the decls found are sent to free_lang_data_in_decl.
5098 3- All the types found are sent to free_lang_data_in_type.
5100 The ordering between decls and types is important because
5101 free_lang_data_in_decl sets assembler names, which includes
5102 mangling. So types cannot be freed up until assembler names have
5106 free_lang_data_in_cgraph (void)
5108 struct cgraph_node
*n
;
5109 struct varpool_node
*v
;
5110 struct free_lang_data_d fld
;
5115 /* Initialize sets and arrays to store referenced decls and types. */
5116 fld
.pset
= pointer_set_create ();
5117 fld
.worklist
= NULL
;
5118 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5119 fld
.types
= VEC_alloc (tree
, heap
, 100);
5121 /* Find decls and types in the body of every function in the callgraph. */
5122 for (n
= cgraph_nodes
; n
; n
= n
->next
)
5123 find_decls_types_in_node (n
, &fld
);
5125 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5126 find_decls_types (p
->decl
, &fld
);
5128 /* Find decls and types in every varpool symbol. */
5129 for (v
= varpool_nodes
; v
; v
= v
->next
)
5130 find_decls_types_in_var (v
, &fld
);
5132 /* Set the assembler name on every decl found. We need to do this
5133 now because free_lang_data_in_decl will invalidate data needed
5134 for mangling. This breaks mangling on interdependent decls. */
5135 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5136 assign_assembler_name_if_neeeded (t
);
5138 /* Traverse every decl found freeing its language data. */
5139 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5140 free_lang_data_in_decl (t
);
5142 /* Traverse every type found freeing its language data. */
5143 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5144 free_lang_data_in_type (t
);
5146 pointer_set_destroy (fld
.pset
);
5147 VEC_free (tree
, heap
, fld
.worklist
);
5148 VEC_free (tree
, heap
, fld
.decls
);
5149 VEC_free (tree
, heap
, fld
.types
);
5153 /* Free resources that are used by FE but are not needed once they are done. */
5156 free_lang_data (void)
5160 /* If we are the LTO frontend we have freed lang-specific data already. */
5162 || !flag_generate_lto
)
5165 /* Allocate and assign alias sets to the standard integer types
5166 while the slots are still in the way the frontends generated them. */
5167 for (i
= 0; i
< itk_none
; ++i
)
5168 if (integer_types
[i
])
5169 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5171 /* Traverse the IL resetting language specific information for
5172 operands, expressions, etc. */
5173 free_lang_data_in_cgraph ();
5175 /* Create gimple variants for common types. */
5176 ptrdiff_type_node
= integer_type_node
;
5177 fileptr_type_node
= ptr_type_node
;
5179 /* Reset some langhooks. Do not reset types_compatible_p, it may
5180 still be used indirectly via the get_alias_set langhook. */
5181 lang_hooks
.callgraph
.analyze_expr
= NULL
;
5182 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5183 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5184 /* We do not want the default decl_assembler_name implementation,
5185 rather if we have fixed everything we want a wrapper around it
5186 asserting that all non-local symbols already got their assembler
5187 name and only produce assembler names for local symbols. Or rather
5188 make sure we never call decl_assembler_name on local symbols and
5189 devise a separate, middle-end private scheme for it. */
5191 /* Reset diagnostic machinery. */
5192 diagnostic_starter (global_dc
) = default_tree_diagnostic_starter
;
5193 diagnostic_finalizer (global_dc
) = default_diagnostic_finalizer
;
5194 diagnostic_format_decoder (global_dc
) = default_tree_printer
;
5200 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5204 "*free_lang_data", /* name */
5206 free_lang_data
, /* execute */
5209 0, /* static_pass_number */
5210 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5211 0, /* properties_required */
5212 0, /* properties_provided */
5213 0, /* properties_destroyed */
5214 0, /* todo_flags_start */
5215 TODO_ggc_collect
/* todo_flags_finish */
5219 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5220 ATTR_NAME. Also used internally by remove_attribute(). */
5222 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5224 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5226 if (ident_len
== attr_len
)
5228 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5231 else if (ident_len
== attr_len
+ 4)
5233 /* There is the possibility that ATTR is 'text' and IDENT is
5235 const char *p
= IDENTIFIER_POINTER (ident
);
5236 if (p
[0] == '_' && p
[1] == '_'
5237 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5238 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5245 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5246 of ATTR_NAME, and LIST is not NULL_TREE. */
5248 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5252 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5254 if (ident_len
== attr_len
)
5256 if (strcmp (attr_name
, IDENTIFIER_POINTER (TREE_PURPOSE (list
))) == 0)
5259 /* TODO: If we made sure that attributes were stored in the
5260 canonical form without '__...__' (ie, as in 'text' as opposed
5261 to '__text__') then we could avoid the following case. */
5262 else if (ident_len
== attr_len
+ 4)
5264 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5265 if (p
[0] == '_' && p
[1] == '_'
5266 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5267 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5270 list
= TREE_CHAIN (list
);
5276 /* A variant of lookup_attribute() that can be used with an identifier
5277 as the first argument, and where the identifier can be either
5278 'text' or '__text__'.
5280 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5281 return a pointer to the attribute's list element if the attribute
5282 is part of the list, or NULL_TREE if not found. If the attribute
5283 appears more than once, this only returns the first occurrence; the
5284 TREE_CHAIN of the return value should be passed back in if further
5285 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5286 can be in the form 'text' or '__text__'. */
5288 lookup_ident_attribute (tree attr_identifier
, tree list
)
5290 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5294 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list
)) == IDENTIFIER_NODE
);
5296 /* Identifiers can be compared directly for equality. */
5297 if (attr_identifier
== TREE_PURPOSE (list
))
5300 /* If they are not equal, they may still be one in the form
5301 'text' while the other one is in the form '__text__'. TODO:
5302 If we were storing attributes in normalized 'text' form, then
5303 this could all go away and we could take full advantage of
5304 the fact that we're comparing identifiers. :-) */
5306 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5307 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5309 if (ident_len
== attr_len
+ 4)
5311 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5312 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5313 if (p
[0] == '_' && p
[1] == '_'
5314 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5315 && strncmp (q
, p
+ 2, attr_len
) == 0)
5318 else if (ident_len
+ 4 == attr_len
)
5320 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5321 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5322 if (q
[0] == '_' && q
[1] == '_'
5323 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5324 && strncmp (q
+ 2, p
, ident_len
) == 0)
5328 list
= TREE_CHAIN (list
);
5334 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5338 remove_attribute (const char *attr_name
, tree list
)
5341 size_t attr_len
= strlen (attr_name
);
5343 gcc_checking_assert (attr_name
[0] != '_');
5345 for (p
= &list
; *p
; )
5348 /* TODO: If we were storing attributes in normalized form, here
5349 we could use a simple strcmp(). */
5350 if (private_is_attribute_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5351 *p
= TREE_CHAIN (l
);
5353 p
= &TREE_CHAIN (l
);
5359 /* Return an attribute list that is the union of a1 and a2. */
5362 merge_attributes (tree a1
, tree a2
)
5366 /* Either one unset? Take the set one. */
5368 if ((attributes
= a1
) == 0)
5371 /* One that completely contains the other? Take it. */
5373 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5375 if (attribute_list_contained (a2
, a1
))
5379 /* Pick the longest list, and hang on the other list. */
5381 if (list_length (a1
) < list_length (a2
))
5382 attributes
= a2
, a2
= a1
;
5384 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5387 for (a
= lookup_ident_attribute (TREE_PURPOSE (a2
), attributes
);
5388 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5389 a
= lookup_ident_attribute (TREE_PURPOSE (a2
), TREE_CHAIN (a
)))
5393 a1
= copy_node (a2
);
5394 TREE_CHAIN (a1
) = attributes
;
5403 /* Given types T1 and T2, merge their attributes and return
5407 merge_type_attributes (tree t1
, tree t2
)
5409 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5410 TYPE_ATTRIBUTES (t2
));
5413 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5417 merge_decl_attributes (tree olddecl
, tree newdecl
)
5419 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5420 DECL_ATTRIBUTES (newdecl
));
5423 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5425 /* Specialization of merge_decl_attributes for various Windows targets.
5427 This handles the following situation:
5429 __declspec (dllimport) int foo;
5432 The second instance of `foo' nullifies the dllimport. */
5435 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5438 int delete_dllimport_p
= 1;
5440 /* What we need to do here is remove from `old' dllimport if it doesn't
5441 appear in `new'. dllimport behaves like extern: if a declaration is
5442 marked dllimport and a definition appears later, then the object
5443 is not dllimport'd. We also remove a `new' dllimport if the old list
5444 contains dllexport: dllexport always overrides dllimport, regardless
5445 of the order of declaration. */
5446 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5447 delete_dllimport_p
= 0;
5448 else if (DECL_DLLIMPORT_P (new_tree
)
5449 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5451 DECL_DLLIMPORT_P (new_tree
) = 0;
5452 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5453 "dllimport ignored", new_tree
);
5455 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5457 /* Warn about overriding a symbol that has already been used, e.g.:
5458 extern int __attribute__ ((dllimport)) foo;
5459 int* bar () {return &foo;}
5462 if (TREE_USED (old
))
5464 warning (0, "%q+D redeclared without dllimport attribute "
5465 "after being referenced with dll linkage", new_tree
);
5466 /* If we have used a variable's address with dllimport linkage,
5467 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5468 decl may already have had TREE_CONSTANT computed.
5469 We still remove the attribute so that assembler code refers
5470 to '&foo rather than '_imp__foo'. */
5471 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5472 DECL_DLLIMPORT_P (new_tree
) = 1;
5475 /* Let an inline definition silently override the external reference,
5476 but otherwise warn about attribute inconsistency. */
5477 else if (TREE_CODE (new_tree
) == VAR_DECL
5478 || !DECL_DECLARED_INLINE_P (new_tree
))
5479 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5480 "previous dllimport ignored", new_tree
);
5483 delete_dllimport_p
= 0;
5485 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5487 if (delete_dllimport_p
)
5488 a
= remove_attribute ("dllimport", a
);
5493 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5494 struct attribute_spec.handler. */
5497 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5503 /* These attributes may apply to structure and union types being created,
5504 but otherwise should pass to the declaration involved. */
5507 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5508 | (int) ATTR_FLAG_ARRAY_NEXT
))
5510 *no_add_attrs
= true;
5511 return tree_cons (name
, args
, NULL_TREE
);
5513 if (TREE_CODE (node
) == RECORD_TYPE
5514 || TREE_CODE (node
) == UNION_TYPE
)
5516 node
= TYPE_NAME (node
);
5522 warning (OPT_Wattributes
, "%qE attribute ignored",
5524 *no_add_attrs
= true;
5529 if (TREE_CODE (node
) != FUNCTION_DECL
5530 && TREE_CODE (node
) != VAR_DECL
5531 && TREE_CODE (node
) != TYPE_DECL
)
5533 *no_add_attrs
= true;
5534 warning (OPT_Wattributes
, "%qE attribute ignored",
5539 if (TREE_CODE (node
) == TYPE_DECL
5540 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5541 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5543 *no_add_attrs
= true;
5544 warning (OPT_Wattributes
, "%qE attribute ignored",
5549 is_dllimport
= is_attribute_p ("dllimport", name
);
5551 /* Report error on dllimport ambiguities seen now before they cause
5555 /* Honor any target-specific overrides. */
5556 if (!targetm
.valid_dllimport_attribute_p (node
))
5557 *no_add_attrs
= true;
5559 else if (TREE_CODE (node
) == FUNCTION_DECL
5560 && DECL_DECLARED_INLINE_P (node
))
5562 warning (OPT_Wattributes
, "inline function %q+D declared as "
5563 " dllimport: attribute ignored", node
);
5564 *no_add_attrs
= true;
5566 /* Like MS, treat definition of dllimported variables and
5567 non-inlined functions on declaration as syntax errors. */
5568 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5570 error ("function %q+D definition is marked dllimport", node
);
5571 *no_add_attrs
= true;
5574 else if (TREE_CODE (node
) == VAR_DECL
)
5576 if (DECL_INITIAL (node
))
5578 error ("variable %q+D definition is marked dllimport",
5580 *no_add_attrs
= true;
5583 /* `extern' needn't be specified with dllimport.
5584 Specify `extern' now and hope for the best. Sigh. */
5585 DECL_EXTERNAL (node
) = 1;
5586 /* Also, implicitly give dllimport'd variables declared within
5587 a function global scope, unless declared static. */
5588 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5589 TREE_PUBLIC (node
) = 1;
5592 if (*no_add_attrs
== false)
5593 DECL_DLLIMPORT_P (node
) = 1;
5595 else if (TREE_CODE (node
) == FUNCTION_DECL
5596 && DECL_DECLARED_INLINE_P (node
)
5597 && flag_keep_inline_dllexport
)
5598 /* An exported function, even if inline, must be emitted. */
5599 DECL_EXTERNAL (node
) = 0;
5601 /* Report error if symbol is not accessible at global scope. */
5602 if (!TREE_PUBLIC (node
)
5603 && (TREE_CODE (node
) == VAR_DECL
5604 || TREE_CODE (node
) == FUNCTION_DECL
))
5606 error ("external linkage required for symbol %q+D because of "
5607 "%qE attribute", node
, name
);
5608 *no_add_attrs
= true;
5611 /* A dllexport'd entity must have default visibility so that other
5612 program units (shared libraries or the main executable) can see
5613 it. A dllimport'd entity must have default visibility so that
5614 the linker knows that undefined references within this program
5615 unit can be resolved by the dynamic linker. */
5618 if (DECL_VISIBILITY_SPECIFIED (node
)
5619 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5620 error ("%qE implies default visibility, but %qD has already "
5621 "been declared with a different visibility",
5623 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5624 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5630 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5632 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5633 of the various TYPE_QUAL values. */
5636 set_type_quals (tree type
, int type_quals
)
5638 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5639 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5640 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5641 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5644 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5647 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5649 return (TYPE_QUALS (cand
) == type_quals
5650 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5651 /* Apparently this is needed for Objective-C. */
5652 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5653 /* Check alignment. */
5654 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5655 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5656 TYPE_ATTRIBUTES (base
)));
5659 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5662 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5664 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5665 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5666 /* Apparently this is needed for Objective-C. */
5667 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5668 /* Check alignment. */
5669 && TYPE_ALIGN (cand
) == align
5670 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5671 TYPE_ATTRIBUTES (base
)));
5674 /* Return a version of the TYPE, qualified as indicated by the
5675 TYPE_QUALS, if one exists. If no qualified version exists yet,
5676 return NULL_TREE. */
5679 get_qualified_type (tree type
, int type_quals
)
5683 if (TYPE_QUALS (type
) == type_quals
)
5686 /* Search the chain of variants to see if there is already one there just
5687 like the one we need to have. If so, use that existing one. We must
5688 preserve the TYPE_NAME, since there is code that depends on this. */
5689 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5690 if (check_qualified_type (t
, type
, type_quals
))
5696 /* Like get_qualified_type, but creates the type if it does not
5697 exist. This function never returns NULL_TREE. */
5700 build_qualified_type (tree type
, int type_quals
)
5704 /* See if we already have the appropriate qualified variant. */
5705 t
= get_qualified_type (type
, type_quals
);
5707 /* If not, build it. */
5710 t
= build_variant_type_copy (type
);
5711 set_type_quals (t
, type_quals
);
5713 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5714 /* Propagate structural equality. */
5715 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5716 else if (TYPE_CANONICAL (type
) != type
)
5717 /* Build the underlying canonical type, since it is different
5719 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5722 /* T is its own canonical type. */
5723 TYPE_CANONICAL (t
) = t
;
5730 /* Create a variant of type T with alignment ALIGN. */
5733 build_aligned_type (tree type
, unsigned int align
)
5737 if (TYPE_PACKED (type
)
5738 || TYPE_ALIGN (type
) == align
)
5741 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5742 if (check_aligned_type (t
, type
, align
))
5745 t
= build_variant_type_copy (type
);
5746 TYPE_ALIGN (t
) = align
;
5751 /* Create a new distinct copy of TYPE. The new type is made its own
5752 MAIN_VARIANT. If TYPE requires structural equality checks, the
5753 resulting type requires structural equality checks; otherwise, its
5754 TYPE_CANONICAL points to itself. */
5757 build_distinct_type_copy (tree type
)
5759 tree t
= copy_node (type
);
5761 TYPE_POINTER_TO (t
) = 0;
5762 TYPE_REFERENCE_TO (t
) = 0;
5764 /* Set the canonical type either to a new equivalence class, or
5765 propagate the need for structural equality checks. */
5766 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5767 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5769 TYPE_CANONICAL (t
) = t
;
5771 /* Make it its own variant. */
5772 TYPE_MAIN_VARIANT (t
) = t
;
5773 TYPE_NEXT_VARIANT (t
) = 0;
5775 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5776 whose TREE_TYPE is not t. This can also happen in the Ada
5777 frontend when using subtypes. */
5782 /* Create a new variant of TYPE, equivalent but distinct. This is so
5783 the caller can modify it. TYPE_CANONICAL for the return type will
5784 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5785 are considered equal by the language itself (or that both types
5786 require structural equality checks). */
5789 build_variant_type_copy (tree type
)
5791 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5793 t
= build_distinct_type_copy (type
);
5795 /* Since we're building a variant, assume that it is a non-semantic
5796 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5797 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5799 /* Add the new type to the chain of variants of TYPE. */
5800 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5801 TYPE_NEXT_VARIANT (m
) = t
;
5802 TYPE_MAIN_VARIANT (t
) = m
;
5807 /* Return true if the from tree in both tree maps are equal. */
5810 tree_map_base_eq (const void *va
, const void *vb
)
5812 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5813 *const b
= (const struct tree_map_base
*) vb
;
5814 return (a
->from
== b
->from
);
5817 /* Hash a from tree in a tree_base_map. */
5820 tree_map_base_hash (const void *item
)
5822 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5825 /* Return true if this tree map structure is marked for garbage collection
5826 purposes. We simply return true if the from tree is marked, so that this
5827 structure goes away when the from tree goes away. */
5830 tree_map_base_marked_p (const void *p
)
5832 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5835 /* Hash a from tree in a tree_map. */
5838 tree_map_hash (const void *item
)
5840 return (((const struct tree_map
*) item
)->hash
);
5843 /* Hash a from tree in a tree_decl_map. */
5846 tree_decl_map_hash (const void *item
)
5848 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5851 /* Return the initialization priority for DECL. */
5854 decl_init_priority_lookup (tree decl
)
5856 struct tree_priority_map
*h
;
5857 struct tree_map_base in
;
5859 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5861 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5862 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5865 /* Return the finalization priority for DECL. */
5868 decl_fini_priority_lookup (tree decl
)
5870 struct tree_priority_map
*h
;
5871 struct tree_map_base in
;
5873 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5875 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5876 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5879 /* Return the initialization and finalization priority information for
5880 DECL. If there is no previous priority information, a freshly
5881 allocated structure is returned. */
5883 static struct tree_priority_map
*
5884 decl_priority_info (tree decl
)
5886 struct tree_priority_map in
;
5887 struct tree_priority_map
*h
;
5890 in
.base
.from
= decl
;
5891 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5892 h
= (struct tree_priority_map
*) *loc
;
5895 h
= ggc_alloc_cleared_tree_priority_map ();
5897 h
->base
.from
= decl
;
5898 h
->init
= DEFAULT_INIT_PRIORITY
;
5899 h
->fini
= DEFAULT_INIT_PRIORITY
;
5905 /* Set the initialization priority for DECL to PRIORITY. */
5908 decl_init_priority_insert (tree decl
, priority_type priority
)
5910 struct tree_priority_map
*h
;
5912 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5913 if (priority
== DEFAULT_INIT_PRIORITY
)
5915 h
= decl_priority_info (decl
);
5919 /* Set the finalization priority for DECL to PRIORITY. */
5922 decl_fini_priority_insert (tree decl
, priority_type priority
)
5924 struct tree_priority_map
*h
;
5926 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5927 if (priority
== DEFAULT_INIT_PRIORITY
)
5929 h
= decl_priority_info (decl
);
5933 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5936 print_debug_expr_statistics (void)
5938 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5939 (long) htab_size (debug_expr_for_decl
),
5940 (long) htab_elements (debug_expr_for_decl
),
5941 htab_collisions (debug_expr_for_decl
));
5944 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5947 print_value_expr_statistics (void)
5949 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5950 (long) htab_size (value_expr_for_decl
),
5951 (long) htab_elements (value_expr_for_decl
),
5952 htab_collisions (value_expr_for_decl
));
5955 /* Lookup a debug expression for FROM, and return it if we find one. */
5958 decl_debug_expr_lookup (tree from
)
5960 struct tree_decl_map
*h
, in
;
5961 in
.base
.from
= from
;
5963 h
= (struct tree_decl_map
*)
5964 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
5970 /* Insert a mapping FROM->TO in the debug expression hashtable. */
5973 decl_debug_expr_insert (tree from
, tree to
)
5975 struct tree_decl_map
*h
;
5978 h
= ggc_alloc_tree_decl_map ();
5979 h
->base
.from
= from
;
5981 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
5983 *(struct tree_decl_map
**) loc
= h
;
5986 /* Lookup a value expression for FROM, and return it if we find one. */
5989 decl_value_expr_lookup (tree from
)
5991 struct tree_decl_map
*h
, in
;
5992 in
.base
.from
= from
;
5994 h
= (struct tree_decl_map
*)
5995 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6001 /* Insert a mapping FROM->TO in the value expression hashtable. */
6004 decl_value_expr_insert (tree from
, tree to
)
6006 struct tree_decl_map
*h
;
6009 h
= ggc_alloc_tree_decl_map ();
6010 h
->base
.from
= from
;
6012 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6014 *(struct tree_decl_map
**) loc
= h
;
6017 /* Lookup a vector of debug arguments for FROM, and return it if we
6021 decl_debug_args_lookup (tree from
)
6023 struct tree_vec_map
*h
, in
;
6025 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6027 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6028 in
.base
.from
= from
;
6029 h
= (struct tree_vec_map
*)
6030 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6036 /* Insert a mapping FROM->empty vector of debug arguments in the value
6037 expression hashtable. */
6040 decl_debug_args_insert (tree from
)
6042 struct tree_vec_map
*h
;
6045 if (DECL_HAS_DEBUG_ARGS_P (from
))
6046 return decl_debug_args_lookup (from
);
6047 if (debug_args_for_decl
== NULL
)
6048 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6049 tree_vec_map_eq
, 0);
6050 h
= ggc_alloc_tree_vec_map ();
6051 h
->base
.from
= from
;
6053 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6055 *(struct tree_vec_map
**) loc
= h
;
6056 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6060 /* Hashing of types so that we don't make duplicates.
6061 The entry point is `type_hash_canon'. */
6063 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6064 with types in the TREE_VALUE slots), by adding the hash codes
6065 of the individual types. */
6068 type_hash_list (const_tree list
, hashval_t hashcode
)
6072 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6073 if (TREE_VALUE (tail
) != error_mark_node
)
6074 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6080 /* These are the Hashtable callback functions. */
6082 /* Returns true iff the types are equivalent. */
6085 type_hash_eq (const void *va
, const void *vb
)
6087 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6088 *const b
= (const struct type_hash
*) vb
;
6090 /* First test the things that are the same for all types. */
6091 if (a
->hash
!= b
->hash
6092 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6093 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6094 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6095 TYPE_ATTRIBUTES (b
->type
))
6096 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6097 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6100 /* Be careful about comparing arrays before and after the element type
6101 has been completed; don't compare TYPE_ALIGN unless both types are
6103 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6104 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6105 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6108 switch (TREE_CODE (a
->type
))
6113 case REFERENCE_TYPE
:
6117 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6120 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6121 && !(TYPE_VALUES (a
->type
)
6122 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6123 && TYPE_VALUES (b
->type
)
6124 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6125 && type_list_equal (TYPE_VALUES (a
->type
),
6126 TYPE_VALUES (b
->type
))))
6129 /* ... fall through ... */
6134 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6135 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6136 TYPE_MAX_VALUE (b
->type
)))
6137 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6138 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6139 TYPE_MIN_VALUE (b
->type
))));
6141 case FIXED_POINT_TYPE
:
6142 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6145 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6148 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6149 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6150 || (TYPE_ARG_TYPES (a
->type
)
6151 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6152 && TYPE_ARG_TYPES (b
->type
)
6153 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6154 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6155 TYPE_ARG_TYPES (b
->type
)))))
6159 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6163 case QUAL_UNION_TYPE
:
6164 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6165 || (TYPE_FIELDS (a
->type
)
6166 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6167 && TYPE_FIELDS (b
->type
)
6168 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6169 && type_list_equal (TYPE_FIELDS (a
->type
),
6170 TYPE_FIELDS (b
->type
))));
6173 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6174 || (TYPE_ARG_TYPES (a
->type
)
6175 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6176 && TYPE_ARG_TYPES (b
->type
)
6177 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6178 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6179 TYPE_ARG_TYPES (b
->type
))))
6187 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6188 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6193 /* Return the cached hash value. */
6196 type_hash_hash (const void *item
)
6198 return ((const struct type_hash
*) item
)->hash
;
6201 /* Look in the type hash table for a type isomorphic to TYPE.
6202 If one is found, return it. Otherwise return 0. */
6205 type_hash_lookup (hashval_t hashcode
, tree type
)
6207 struct type_hash
*h
, in
;
6209 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6210 must call that routine before comparing TYPE_ALIGNs. */
6216 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6223 /* Add an entry to the type-hash-table
6224 for a type TYPE whose hash code is HASHCODE. */
6227 type_hash_add (hashval_t hashcode
, tree type
)
6229 struct type_hash
*h
;
6232 h
= ggc_alloc_type_hash ();
6235 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6239 /* Given TYPE, and HASHCODE its hash code, return the canonical
6240 object for an identical type if one already exists.
6241 Otherwise, return TYPE, and record it as the canonical object.
6243 To use this function, first create a type of the sort you want.
6244 Then compute its hash code from the fields of the type that
6245 make it different from other similar types.
6246 Then call this function and use the value. */
6249 type_hash_canon (unsigned int hashcode
, tree type
)
6253 /* The hash table only contains main variants, so ensure that's what we're
6255 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6257 /* See if the type is in the hash table already. If so, return it.
6258 Otherwise, add the type. */
6259 t1
= type_hash_lookup (hashcode
, type
);
6262 #ifdef GATHER_STATISTICS
6263 tree_code_counts
[(int) TREE_CODE (type
)]--;
6264 tree_node_counts
[(int) t_kind
]--;
6265 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6271 type_hash_add (hashcode
, type
);
6276 /* See if the data pointed to by the type hash table is marked. We consider
6277 it marked if the type is marked or if a debug type number or symbol
6278 table entry has been made for the type. */
6281 type_hash_marked_p (const void *p
)
6283 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6285 return ggc_marked_p (type
);
6289 print_type_hash_statistics (void)
6291 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6292 (long) htab_size (type_hash_table
),
6293 (long) htab_elements (type_hash_table
),
6294 htab_collisions (type_hash_table
));
6297 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6298 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6299 by adding the hash codes of the individual attributes. */
6302 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6306 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6307 /* ??? Do we want to add in TREE_VALUE too? */
6308 hashcode
= iterative_hash_object
6309 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6313 /* Given two lists of attributes, return true if list l2 is
6314 equivalent to l1. */
6317 attribute_list_equal (const_tree l1
, const_tree l2
)
6322 return attribute_list_contained (l1
, l2
)
6323 && attribute_list_contained (l2
, l1
);
6326 /* Given two lists of attributes, return true if list L2 is
6327 completely contained within L1. */
6328 /* ??? This would be faster if attribute names were stored in a canonicalized
6329 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6330 must be used to show these elements are equivalent (which they are). */
6331 /* ??? It's not clear that attributes with arguments will always be handled
6335 attribute_list_contained (const_tree l1
, const_tree l2
)
6339 /* First check the obvious, maybe the lists are identical. */
6343 /* Maybe the lists are similar. */
6344 for (t1
= l1
, t2
= l2
;
6346 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6347 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6348 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6351 /* Maybe the lists are equal. */
6352 if (t1
== 0 && t2
== 0)
6355 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6358 /* This CONST_CAST is okay because lookup_attribute does not
6359 modify its argument and the return value is assigned to a
6361 for (attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), CONST_CAST_TREE(l1
));
6362 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6363 attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), TREE_CHAIN (attr
)))
6366 if (attr
== NULL_TREE
)
6373 /* Given two lists of types
6374 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6375 return 1 if the lists contain the same types in the same order.
6376 Also, the TREE_PURPOSEs must match. */
6379 type_list_equal (const_tree l1
, const_tree l2
)
6383 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6384 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6385 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6386 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6387 && (TREE_TYPE (TREE_PURPOSE (t1
))
6388 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6394 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6395 given by TYPE. If the argument list accepts variable arguments,
6396 then this function counts only the ordinary arguments. */
6399 type_num_arguments (const_tree type
)
6404 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6405 /* If the function does not take a variable number of arguments,
6406 the last element in the list will have type `void'. */
6407 if (VOID_TYPE_P (TREE_VALUE (t
)))
6415 /* Nonzero if integer constants T1 and T2
6416 represent the same constant value. */
6419 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6424 if (t1
== 0 || t2
== 0)
6427 if (TREE_CODE (t1
) == INTEGER_CST
6428 && TREE_CODE (t2
) == INTEGER_CST
6429 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6430 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6436 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6437 The precise way of comparison depends on their data type. */
6440 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6445 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6447 int t1_sgn
= tree_int_cst_sgn (t1
);
6448 int t2_sgn
= tree_int_cst_sgn (t2
);
6450 if (t1_sgn
< t2_sgn
)
6452 else if (t1_sgn
> t2_sgn
)
6454 /* Otherwise, both are non-negative, so we compare them as
6455 unsigned just in case one of them would overflow a signed
6458 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6459 return INT_CST_LT (t1
, t2
);
6461 return INT_CST_LT_UNSIGNED (t1
, t2
);
6464 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6467 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6469 if (tree_int_cst_lt (t1
, t2
))
6471 else if (tree_int_cst_lt (t2
, t1
))
6477 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6478 the host. If POS is zero, the value can be represented in a single
6479 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6480 be represented in a single unsigned HOST_WIDE_INT. */
6483 host_integerp (const_tree t
, int pos
)
6488 return (TREE_CODE (t
) == INTEGER_CST
6489 && ((TREE_INT_CST_HIGH (t
) == 0
6490 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6491 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6492 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6493 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
6494 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
6495 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
6496 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6499 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6500 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6501 be non-negative. We must be able to satisfy the above conditions. */
6504 tree_low_cst (const_tree t
, int pos
)
6506 gcc_assert (host_integerp (t
, pos
));
6507 return TREE_INT_CST_LOW (t
);
6510 /* Return the most significant (sign) bit of T. */
6513 tree_int_cst_sign_bit (const_tree t
)
6515 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6516 unsigned HOST_WIDE_INT w
;
6518 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6519 w
= TREE_INT_CST_LOW (t
);
6522 w
= TREE_INT_CST_HIGH (t
);
6523 bitno
-= HOST_BITS_PER_WIDE_INT
;
6526 return (w
>> bitno
) & 1;
6529 /* Return an indication of the sign of the integer constant T.
6530 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6531 Note that -1 will never be returned if T's type is unsigned. */
6534 tree_int_cst_sgn (const_tree t
)
6536 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6538 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6540 else if (TREE_INT_CST_HIGH (t
) < 0)
6546 /* Return the minimum number of bits needed to represent VALUE in a
6547 signed or unsigned type, UNSIGNEDP says which. */
6550 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6554 /* If the value is negative, compute its negative minus 1. The latter
6555 adjustment is because the absolute value of the largest negative value
6556 is one larger than the largest positive value. This is equivalent to
6557 a bit-wise negation, so use that operation instead. */
6559 if (tree_int_cst_sgn (value
) < 0)
6560 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6562 /* Return the number of bits needed, taking into account the fact
6563 that we need one more bit for a signed than unsigned type. */
6565 if (integer_zerop (value
))
6568 log
= tree_floor_log2 (value
);
6570 return log
+ 1 + !unsignedp
;
6573 /* Compare two constructor-element-type constants. Return 1 if the lists
6574 are known to be equal; otherwise return 0. */
6577 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6579 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6581 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6584 l1
= TREE_CHAIN (l1
);
6585 l2
= TREE_CHAIN (l2
);
6591 /* Return truthvalue of whether T1 is the same tree structure as T2.
6592 Return 1 if they are the same.
6593 Return 0 if they are understandably different.
6594 Return -1 if either contains tree structure not understood by
6598 simple_cst_equal (const_tree t1
, const_tree t2
)
6600 enum tree_code code1
, code2
;
6606 if (t1
== 0 || t2
== 0)
6609 code1
= TREE_CODE (t1
);
6610 code2
= TREE_CODE (t2
);
6612 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6614 if (CONVERT_EXPR_CODE_P (code2
)
6615 || code2
== NON_LVALUE_EXPR
)
6616 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6618 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6621 else if (CONVERT_EXPR_CODE_P (code2
)
6622 || code2
== NON_LVALUE_EXPR
)
6623 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6631 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6632 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6635 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6638 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6641 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6642 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6643 TREE_STRING_LENGTH (t1
)));
6647 unsigned HOST_WIDE_INT idx
;
6648 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6649 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6651 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6654 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6655 /* ??? Should we handle also fields here? */
6656 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6657 VEC_index (constructor_elt
, v2
, idx
)->value
))
6663 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6666 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6669 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6672 const_tree arg1
, arg2
;
6673 const_call_expr_arg_iterator iter1
, iter2
;
6674 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6675 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6677 arg1
= next_const_call_expr_arg (&iter1
),
6678 arg2
= next_const_call_expr_arg (&iter2
))
6680 cmp
= simple_cst_equal (arg1
, arg2
);
6684 return arg1
== arg2
;
6688 /* Special case: if either target is an unallocated VAR_DECL,
6689 it means that it's going to be unified with whatever the
6690 TARGET_EXPR is really supposed to initialize, so treat it
6691 as being equivalent to anything. */
6692 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6693 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6694 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6695 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6696 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6697 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6700 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6705 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6707 case WITH_CLEANUP_EXPR
:
6708 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6712 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6715 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6716 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6730 /* This general rule works for most tree codes. All exceptions should be
6731 handled above. If this is a language-specific tree code, we can't
6732 trust what might be in the operand, so say we don't know
6734 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6737 switch (TREE_CODE_CLASS (code1
))
6741 case tcc_comparison
:
6742 case tcc_expression
:
6746 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6748 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6760 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6761 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6762 than U, respectively. */
6765 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6767 if (tree_int_cst_sgn (t
) < 0)
6769 else if (TREE_INT_CST_HIGH (t
) != 0)
6771 else if (TREE_INT_CST_LOW (t
) == u
)
6773 else if (TREE_INT_CST_LOW (t
) < u
)
6779 /* Return true if CODE represents an associative tree code. Otherwise
6782 associative_tree_code (enum tree_code code
)
6801 /* Return true if CODE represents a commutative tree code. Otherwise
6804 commutative_tree_code (enum tree_code code
)
6817 case UNORDERED_EXPR
:
6821 case TRUTH_AND_EXPR
:
6822 case TRUTH_XOR_EXPR
:
6832 /* Return true if CODE represents a ternary tree code for which the
6833 first two operands are commutative. Otherwise return false. */
6835 commutative_ternary_tree_code (enum tree_code code
)
6839 case WIDEN_MULT_PLUS_EXPR
:
6840 case WIDEN_MULT_MINUS_EXPR
:
6849 /* Generate a hash value for an expression. This can be used iteratively
6850 by passing a previous result as the VAL argument.
6852 This function is intended to produce the same hash for expressions which
6853 would compare equal using operand_equal_p. */
6856 iterative_hash_expr (const_tree t
, hashval_t val
)
6859 enum tree_code code
;
6863 return iterative_hash_hashval_t (0, val
);
6865 code
= TREE_CODE (t
);
6869 /* Alas, constants aren't shared, so we can't rely on pointer
6872 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6873 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6876 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6878 return iterative_hash_hashval_t (val2
, val
);
6882 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6884 return iterative_hash_hashval_t (val2
, val
);
6887 return iterative_hash (TREE_STRING_POINTER (t
),
6888 TREE_STRING_LENGTH (t
), val
);
6890 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6891 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6893 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
6895 /* We can just compare by pointer. */
6896 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6897 case PLACEHOLDER_EXPR
:
6898 /* The node itself doesn't matter. */
6901 /* A list of expressions, for a CALL_EXPR or as the elements of a
6903 for (; t
; t
= TREE_CHAIN (t
))
6904 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6908 unsigned HOST_WIDE_INT idx
;
6910 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6912 val
= iterative_hash_expr (field
, val
);
6913 val
= iterative_hash_expr (value
, val
);
6919 /* The type of the second operand is relevant, except for
6920 its top-level qualifiers. */
6921 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
6923 val
= iterative_hash_object (TYPE_HASH (type
), val
);
6925 /* We could use the standard hash computation from this point
6927 val
= iterative_hash_object (code
, val
);
6928 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
6929 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6933 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
6934 Otherwise nodes that compare equal according to operand_equal_p might
6935 get different hash codes. However, don't do this for machine specific
6936 or front end builtins, since the function code is overloaded in those
6938 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
6939 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
6941 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
6942 code
= TREE_CODE (t
);
6946 tclass
= TREE_CODE_CLASS (code
);
6948 if (tclass
== tcc_declaration
)
6950 /* DECL's have a unique ID */
6951 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
6955 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
6957 val
= iterative_hash_object (code
, val
);
6959 /* Don't hash the type, that can lead to having nodes which
6960 compare equal according to operand_equal_p, but which
6961 have different hash codes. */
6962 if (CONVERT_EXPR_CODE_P (code
)
6963 || code
== NON_LVALUE_EXPR
)
6965 /* Make sure to include signness in the hash computation. */
6966 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
6967 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
6970 else if (commutative_tree_code (code
))
6972 /* It's a commutative expression. We want to hash it the same
6973 however it appears. We do this by first hashing both operands
6974 and then rehashing based on the order of their independent
6976 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
6977 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
6981 t
= one
, one
= two
, two
= t
;
6983 val
= iterative_hash_hashval_t (one
, val
);
6984 val
= iterative_hash_hashval_t (two
, val
);
6987 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
6988 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
6994 /* Generate a hash value for a pair of expressions. This can be used
6995 iteratively by passing a previous result as the VAL argument.
6997 The same hash value is always returned for a given pair of expressions,
6998 regardless of the order in which they are presented. This is useful in
6999 hashing the operands of commutative functions. */
7002 iterative_hash_exprs_commutative (const_tree t1
,
7003 const_tree t2
, hashval_t val
)
7005 hashval_t one
= iterative_hash_expr (t1
, 0);
7006 hashval_t two
= iterative_hash_expr (t2
, 0);
7010 t
= one
, one
= two
, two
= t
;
7011 val
= iterative_hash_hashval_t (one
, val
);
7012 val
= iterative_hash_hashval_t (two
, val
);
7017 /* Constructors for pointer, array and function types.
7018 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7019 constructed by language-dependent code, not here.) */
7021 /* Construct, lay out and return the type of pointers to TO_TYPE with
7022 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7023 reference all of memory. If such a type has already been
7024 constructed, reuse it. */
7027 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7032 if (to_type
== error_mark_node
)
7033 return error_mark_node
;
7035 /* If the pointed-to type has the may_alias attribute set, force
7036 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7037 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7038 can_alias_all
= true;
7040 /* In some cases, languages will have things that aren't a POINTER_TYPE
7041 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7042 In that case, return that type without regard to the rest of our
7045 ??? This is a kludge, but consistent with the way this function has
7046 always operated and there doesn't seem to be a good way to avoid this
7048 if (TYPE_POINTER_TO (to_type
) != 0
7049 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7050 return TYPE_POINTER_TO (to_type
);
7052 /* First, if we already have a type for pointers to TO_TYPE and it's
7053 the proper mode, use it. */
7054 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7055 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7058 t
= make_node (POINTER_TYPE
);
7060 TREE_TYPE (t
) = to_type
;
7061 SET_TYPE_MODE (t
, mode
);
7062 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7063 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7064 TYPE_POINTER_TO (to_type
) = t
;
7066 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7067 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7068 else if (TYPE_CANONICAL (to_type
) != to_type
)
7070 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7071 mode
, can_alias_all
);
7073 /* Lay out the type. This function has many callers that are concerned
7074 with expression-construction, and this simplifies them all. */
7080 /* By default build pointers in ptr_mode. */
7083 build_pointer_type (tree to_type
)
7085 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7086 : TYPE_ADDR_SPACE (to_type
);
7087 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7088 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7091 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7094 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7099 if (to_type
== error_mark_node
)
7100 return error_mark_node
;
7102 /* If the pointed-to type has the may_alias attribute set, force
7103 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7104 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7105 can_alias_all
= true;
7107 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7108 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7109 In that case, return that type without regard to the rest of our
7112 ??? This is a kludge, but consistent with the way this function has
7113 always operated and there doesn't seem to be a good way to avoid this
7115 if (TYPE_REFERENCE_TO (to_type
) != 0
7116 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7117 return TYPE_REFERENCE_TO (to_type
);
7119 /* First, if we already have a type for pointers to TO_TYPE and it's
7120 the proper mode, use it. */
7121 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7122 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7125 t
= make_node (REFERENCE_TYPE
);
7127 TREE_TYPE (t
) = to_type
;
7128 SET_TYPE_MODE (t
, mode
);
7129 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7130 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7131 TYPE_REFERENCE_TO (to_type
) = t
;
7133 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7134 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7135 else if (TYPE_CANONICAL (to_type
) != to_type
)
7137 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7138 mode
, can_alias_all
);
7146 /* Build the node for the type of references-to-TO_TYPE by default
7150 build_reference_type (tree to_type
)
7152 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7153 : TYPE_ADDR_SPACE (to_type
);
7154 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7155 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7158 /* Build a type that is compatible with t but has no cv quals anywhere
7161 const char *const *const * -> char ***. */
7164 build_type_no_quals (tree t
)
7166 switch (TREE_CODE (t
))
7169 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7171 TYPE_REF_CAN_ALIAS_ALL (t
));
7172 case REFERENCE_TYPE
:
7174 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7176 TYPE_REF_CAN_ALIAS_ALL (t
));
7178 return TYPE_MAIN_VARIANT (t
);
7182 #define MAX_INT_CACHED_PREC \
7183 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7184 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7186 /* Builds a signed or unsigned integer type of precision PRECISION.
7187 Used for C bitfields whose precision does not match that of
7188 built-in target types. */
7190 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7196 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7198 if (precision
<= MAX_INT_CACHED_PREC
)
7200 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7205 itype
= make_node (INTEGER_TYPE
);
7206 TYPE_PRECISION (itype
) = precision
;
7209 fixup_unsigned_type (itype
);
7211 fixup_signed_type (itype
);
7214 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7215 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7216 if (precision
<= MAX_INT_CACHED_PREC
)
7217 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7222 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7223 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7224 is true, reuse such a type that has already been constructed. */
7227 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7229 tree itype
= make_node (INTEGER_TYPE
);
7230 hashval_t hashcode
= 0;
7232 TREE_TYPE (itype
) = type
;
7234 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7235 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7237 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7238 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7239 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7240 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7241 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7242 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7247 if ((TYPE_MIN_VALUE (itype
)
7248 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7249 || (TYPE_MAX_VALUE (itype
)
7250 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7252 /* Since we cannot reliably merge this type, we need to compare it using
7253 structural equality checks. */
7254 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7258 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7259 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7260 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7261 itype
= type_hash_canon (hashcode
, itype
);
7266 /* Wrapper around build_range_type_1 with SHARED set to true. */
7269 build_range_type (tree type
, tree lowval
, tree highval
)
7271 return build_range_type_1 (type
, lowval
, highval
, true);
7274 /* Wrapper around build_range_type_1 with SHARED set to false. */
7277 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7279 return build_range_type_1 (type
, lowval
, highval
, false);
7282 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7283 MAXVAL should be the maximum value in the domain
7284 (one less than the length of the array).
7286 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7287 We don't enforce this limit, that is up to caller (e.g. language front end).
7288 The limit exists because the result is a signed type and we don't handle
7289 sizes that use more than one HOST_WIDE_INT. */
7292 build_index_type (tree maxval
)
7294 return build_range_type (sizetype
, size_zero_node
, maxval
);
7297 /* Return true if the debug information for TYPE, a subtype, should be emitted
7298 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7299 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7300 debug info and doesn't reflect the source code. */
7303 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7305 tree base_type
= TREE_TYPE (type
), low
, high
;
7307 /* Subrange types have a base type which is an integral type. */
7308 if (!INTEGRAL_TYPE_P (base_type
))
7311 /* Get the real bounds of the subtype. */
7312 if (lang_hooks
.types
.get_subrange_bounds
)
7313 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7316 low
= TYPE_MIN_VALUE (type
);
7317 high
= TYPE_MAX_VALUE (type
);
7320 /* If the type and its base type have the same representation and the same
7321 name, then the type is not a subrange but a copy of the base type. */
7322 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7323 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7324 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7325 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7326 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7328 tree type_name
= TYPE_NAME (type
);
7329 tree base_type_name
= TYPE_NAME (base_type
);
7331 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7332 type_name
= DECL_NAME (type_name
);
7334 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7335 base_type_name
= DECL_NAME (base_type_name
);
7337 if (type_name
== base_type_name
)
7348 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7349 and number of elements specified by the range of values of INDEX_TYPE.
7350 If SHARED is true, reuse such a type that has already been constructed. */
7353 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7357 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7359 error ("arrays of functions are not meaningful");
7360 elt_type
= integer_type_node
;
7363 t
= make_node (ARRAY_TYPE
);
7364 TREE_TYPE (t
) = elt_type
;
7365 TYPE_DOMAIN (t
) = index_type
;
7366 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7369 /* If the element type is incomplete at this point we get marked for
7370 structural equality. Do not record these types in the canonical
7372 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7377 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7379 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7380 t
= type_hash_canon (hashcode
, t
);
7383 if (TYPE_CANONICAL (t
) == t
)
7385 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7386 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7387 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7388 else if (TYPE_CANONICAL (elt_type
) != elt_type
7389 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7391 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7393 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7400 /* Wrapper around build_array_type_1 with SHARED set to true. */
7403 build_array_type (tree elt_type
, tree index_type
)
7405 return build_array_type_1 (elt_type
, index_type
, true);
7408 /* Wrapper around build_array_type_1 with SHARED set to false. */
7411 build_nonshared_array_type (tree elt_type
, tree index_type
)
7413 return build_array_type_1 (elt_type
, index_type
, false);
7416 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7420 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7422 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7425 /* Recursively examines the array elements of TYPE, until a non-array
7426 element type is found. */
7429 strip_array_types (tree type
)
7431 while (TREE_CODE (type
) == ARRAY_TYPE
)
7432 type
= TREE_TYPE (type
);
7437 /* Computes the canonical argument types from the argument type list
7440 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7441 on entry to this function, or if any of the ARGTYPES are
7444 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7445 true on entry to this function, or if any of the ARGTYPES are
7448 Returns a canonical argument list, which may be ARGTYPES when the
7449 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7450 true) or would not differ from ARGTYPES. */
7453 maybe_canonicalize_argtypes(tree argtypes
,
7454 bool *any_structural_p
,
7455 bool *any_noncanonical_p
)
7458 bool any_noncanonical_argtypes_p
= false;
7460 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7462 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7463 /* Fail gracefully by stating that the type is structural. */
7464 *any_structural_p
= true;
7465 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7466 *any_structural_p
= true;
7467 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7468 || TREE_PURPOSE (arg
))
7469 /* If the argument has a default argument, we consider it
7470 non-canonical even though the type itself is canonical.
7471 That way, different variants of function and method types
7472 with default arguments will all point to the variant with
7473 no defaults as their canonical type. */
7474 any_noncanonical_argtypes_p
= true;
7477 if (*any_structural_p
)
7480 if (any_noncanonical_argtypes_p
)
7482 /* Build the canonical list of argument types. */
7483 tree canon_argtypes
= NULL_TREE
;
7484 bool is_void
= false;
7486 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7488 if (arg
== void_list_node
)
7491 canon_argtypes
= tree_cons (NULL_TREE
,
7492 TYPE_CANONICAL (TREE_VALUE (arg
)),
7496 canon_argtypes
= nreverse (canon_argtypes
);
7498 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7500 /* There is a non-canonical type. */
7501 *any_noncanonical_p
= true;
7502 return canon_argtypes
;
7505 /* The canonical argument types are the same as ARGTYPES. */
7509 /* Construct, lay out and return
7510 the type of functions returning type VALUE_TYPE
7511 given arguments of types ARG_TYPES.
7512 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7513 are data type nodes for the arguments of the function.
7514 If such a type has already been constructed, reuse it. */
7517 build_function_type (tree value_type
, tree arg_types
)
7520 hashval_t hashcode
= 0;
7521 bool any_structural_p
, any_noncanonical_p
;
7522 tree canon_argtypes
;
7524 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7526 error ("function return type cannot be function");
7527 value_type
= integer_type_node
;
7530 /* Make a node of the sort we want. */
7531 t
= make_node (FUNCTION_TYPE
);
7532 TREE_TYPE (t
) = value_type
;
7533 TYPE_ARG_TYPES (t
) = arg_types
;
7535 /* If we already have such a type, use the old one. */
7536 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7537 hashcode
= type_hash_list (arg_types
, hashcode
);
7538 t
= type_hash_canon (hashcode
, t
);
7540 /* Set up the canonical type. */
7541 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7542 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7543 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7545 &any_noncanonical_p
);
7546 if (any_structural_p
)
7547 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7548 else if (any_noncanonical_p
)
7549 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7552 if (!COMPLETE_TYPE_P (t
))
7557 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
7560 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
7562 tree new_type
= NULL
;
7563 tree args
, new_args
= NULL
, t
;
7567 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7568 args
= TREE_CHAIN (args
), i
++)
7569 if (!bitmap_bit_p (args_to_skip
, i
))
7570 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7572 new_reversed
= nreverse (new_args
);
7576 TREE_CHAIN (new_args
) = void_list_node
;
7578 new_reversed
= void_list_node
;
7581 /* Use copy_node to preserve as much as possible from original type
7582 (debug info, attribute lists etc.)
7583 Exception is METHOD_TYPEs must have THIS argument.
7584 When we are asked to remove it, we need to build new FUNCTION_TYPE
7586 if (TREE_CODE (orig_type
) != METHOD_TYPE
7587 || !bitmap_bit_p (args_to_skip
, 0))
7589 new_type
= build_distinct_type_copy (orig_type
);
7590 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7595 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7597 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7600 /* This is a new type, not a copy of an old type. Need to reassociate
7601 variants. We can handle everything except the main variant lazily. */
7602 t
= TYPE_MAIN_VARIANT (orig_type
);
7605 TYPE_MAIN_VARIANT (new_type
) = t
;
7606 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7607 TYPE_NEXT_VARIANT (t
) = new_type
;
7611 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7612 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7617 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
7619 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7620 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7621 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7624 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
7626 tree new_decl
= copy_node (orig_decl
);
7629 new_type
= TREE_TYPE (orig_decl
);
7630 if (prototype_p (new_type
))
7631 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
7632 TREE_TYPE (new_decl
) = new_type
;
7634 /* For declarations setting DECL_VINDEX (i.e. methods)
7635 we expect first argument to be THIS pointer. */
7636 if (bitmap_bit_p (args_to_skip
, 0))
7637 DECL_VINDEX (new_decl
) = NULL_TREE
;
7639 /* When signature changes, we need to clear builtin info. */
7640 if (DECL_BUILT_IN (new_decl
) && !bitmap_empty_p (args_to_skip
))
7642 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7643 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7648 /* Build a function type. The RETURN_TYPE is the type returned by the
7649 function. If VAARGS is set, no void_type_node is appended to the
7650 the list. ARGP must be always be terminated be a NULL_TREE. */
7653 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7657 t
= va_arg (argp
, tree
);
7658 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7659 args
= tree_cons (NULL_TREE
, t
, args
);
7664 if (args
!= NULL_TREE
)
7665 args
= nreverse (args
);
7666 gcc_assert (last
!= void_list_node
);
7668 else if (args
== NULL_TREE
)
7669 args
= void_list_node
;
7673 args
= nreverse (args
);
7674 TREE_CHAIN (last
) = void_list_node
;
7676 args
= build_function_type (return_type
, args
);
7681 /* Build a function type. The RETURN_TYPE is the type returned by the
7682 function. If additional arguments are provided, they are
7683 additional argument types. The list of argument types must always
7684 be terminated by NULL_TREE. */
7687 build_function_type_list (tree return_type
, ...)
7692 va_start (p
, return_type
);
7693 args
= build_function_type_list_1 (false, return_type
, p
);
7698 /* Build a variable argument function type. The RETURN_TYPE is the
7699 type returned by the function. If additional arguments are provided,
7700 they are additional argument types. The list of argument types must
7701 always be terminated by NULL_TREE. */
7704 build_varargs_function_type_list (tree return_type
, ...)
7709 va_start (p
, return_type
);
7710 args
= build_function_type_list_1 (true, return_type
, p
);
7716 /* Build a function type. RETURN_TYPE is the type returned by the
7717 function; VAARGS indicates whether the function takes varargs. The
7718 function takes N named arguments, the types of which are provided in
7722 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7726 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7728 for (i
= n
- 1; i
>= 0; i
--)
7729 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7731 return build_function_type (return_type
, t
);
7734 /* Build a function type. RETURN_TYPE is the type returned by the
7735 function. The function takes N named arguments, the types of which
7736 are provided in ARG_TYPES. */
7739 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7741 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7744 /* Build a variable argument function type. RETURN_TYPE is the type
7745 returned by the function. The function takes N named arguments, the
7746 types of which are provided in ARG_TYPES. */
7749 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7751 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7754 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7755 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7756 for the method. An implicit additional parameter (of type
7757 pointer-to-BASETYPE) is added to the ARGTYPES. */
7760 build_method_type_directly (tree basetype
,
7767 bool any_structural_p
, any_noncanonical_p
;
7768 tree canon_argtypes
;
7770 /* Make a node of the sort we want. */
7771 t
= make_node (METHOD_TYPE
);
7773 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7774 TREE_TYPE (t
) = rettype
;
7775 ptype
= build_pointer_type (basetype
);
7777 /* The actual arglist for this function includes a "hidden" argument
7778 which is "this". Put it into the list of argument types. */
7779 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7780 TYPE_ARG_TYPES (t
) = argtypes
;
7782 /* If we already have such a type, use the old one. */
7783 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7784 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7785 hashcode
= type_hash_list (argtypes
, hashcode
);
7786 t
= type_hash_canon (hashcode
, t
);
7788 /* Set up the canonical type. */
7790 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7791 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7793 = (TYPE_CANONICAL (basetype
) != basetype
7794 || TYPE_CANONICAL (rettype
) != rettype
);
7795 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7797 &any_noncanonical_p
);
7798 if (any_structural_p
)
7799 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7800 else if (any_noncanonical_p
)
7802 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7803 TYPE_CANONICAL (rettype
),
7805 if (!COMPLETE_TYPE_P (t
))
7811 /* Construct, lay out and return the type of methods belonging to class
7812 BASETYPE and whose arguments and values are described by TYPE.
7813 If that type exists already, reuse it.
7814 TYPE must be a FUNCTION_TYPE node. */
7817 build_method_type (tree basetype
, tree type
)
7819 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7821 return build_method_type_directly (basetype
,
7823 TYPE_ARG_TYPES (type
));
7826 /* Construct, lay out and return the type of offsets to a value
7827 of type TYPE, within an object of type BASETYPE.
7828 If a suitable offset type exists already, reuse it. */
7831 build_offset_type (tree basetype
, tree type
)
7834 hashval_t hashcode
= 0;
7836 /* Make a node of the sort we want. */
7837 t
= make_node (OFFSET_TYPE
);
7839 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7840 TREE_TYPE (t
) = type
;
7842 /* If we already have such a type, use the old one. */
7843 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7844 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7845 t
= type_hash_canon (hashcode
, t
);
7847 if (!COMPLETE_TYPE_P (t
))
7850 if (TYPE_CANONICAL (t
) == t
)
7852 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7853 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7854 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7855 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7856 || TYPE_CANONICAL (type
) != type
)
7858 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7859 TYPE_CANONICAL (type
));
7865 /* Create a complex type whose components are COMPONENT_TYPE. */
7868 build_complex_type (tree component_type
)
7873 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7874 || SCALAR_FLOAT_TYPE_P (component_type
)
7875 || FIXED_POINT_TYPE_P (component_type
));
7877 /* Make a node of the sort we want. */
7878 t
= make_node (COMPLEX_TYPE
);
7880 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7882 /* If we already have such a type, use the old one. */
7883 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7884 t
= type_hash_canon (hashcode
, t
);
7886 if (!COMPLETE_TYPE_P (t
))
7889 if (TYPE_CANONICAL (t
) == t
)
7891 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7892 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7893 else if (TYPE_CANONICAL (component_type
) != component_type
)
7895 = build_complex_type (TYPE_CANONICAL (component_type
));
7898 /* We need to create a name, since complex is a fundamental type. */
7899 if (! TYPE_NAME (t
))
7902 if (component_type
== char_type_node
)
7903 name
= "complex char";
7904 else if (component_type
== signed_char_type_node
)
7905 name
= "complex signed char";
7906 else if (component_type
== unsigned_char_type_node
)
7907 name
= "complex unsigned char";
7908 else if (component_type
== short_integer_type_node
)
7909 name
= "complex short int";
7910 else if (component_type
== short_unsigned_type_node
)
7911 name
= "complex short unsigned int";
7912 else if (component_type
== integer_type_node
)
7913 name
= "complex int";
7914 else if (component_type
== unsigned_type_node
)
7915 name
= "complex unsigned int";
7916 else if (component_type
== long_integer_type_node
)
7917 name
= "complex long int";
7918 else if (component_type
== long_unsigned_type_node
)
7919 name
= "complex long unsigned int";
7920 else if (component_type
== long_long_integer_type_node
)
7921 name
= "complex long long int";
7922 else if (component_type
== long_long_unsigned_type_node
)
7923 name
= "complex long long unsigned int";
7928 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
7929 get_identifier (name
), t
);
7932 return build_qualified_type (t
, TYPE_QUALS (component_type
));
7935 /* If TYPE is a real or complex floating-point type and the target
7936 does not directly support arithmetic on TYPE then return the wider
7937 type to be used for arithmetic on TYPE. Otherwise, return
7941 excess_precision_type (tree type
)
7943 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
7945 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
7946 switch (TREE_CODE (type
))
7949 switch (flt_eval_method
)
7952 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
7953 return double_type_node
;
7956 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
7957 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
7958 return long_double_type_node
;
7965 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
7967 switch (flt_eval_method
)
7970 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
7971 return complex_double_type_node
;
7974 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
7975 || (TYPE_MODE (TREE_TYPE (type
))
7976 == TYPE_MODE (double_type_node
)))
7977 return complex_long_double_type_node
;
7990 /* Return OP, stripped of any conversions to wider types as much as is safe.
7991 Converting the value back to OP's type makes a value equivalent to OP.
7993 If FOR_TYPE is nonzero, we return a value which, if converted to
7994 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
7996 OP must have integer, real or enumeral type. Pointers are not allowed!
7998 There are some cases where the obvious value we could return
7999 would regenerate to OP if converted to OP's type,
8000 but would not extend like OP to wider types.
8001 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8002 For example, if OP is (unsigned short)(signed char)-1,
8003 we avoid returning (signed char)-1 if FOR_TYPE is int,
8004 even though extending that to an unsigned short would regenerate OP,
8005 since the result of extending (signed char)-1 to (int)
8006 is different from (int) OP. */
8009 get_unwidened (tree op
, tree for_type
)
8011 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8012 tree type
= TREE_TYPE (op
);
8014 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8016 = (for_type
!= 0 && for_type
!= type
8017 && final_prec
> TYPE_PRECISION (type
)
8018 && TYPE_UNSIGNED (type
));
8021 while (CONVERT_EXPR_P (op
))
8025 /* TYPE_PRECISION on vector types has different meaning
8026 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8027 so avoid them here. */
8028 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8031 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8032 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8034 /* Truncations are many-one so cannot be removed.
8035 Unless we are later going to truncate down even farther. */
8037 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8040 /* See what's inside this conversion. If we decide to strip it,
8042 op
= TREE_OPERAND (op
, 0);
8044 /* If we have not stripped any zero-extensions (uns is 0),
8045 we can strip any kind of extension.
8046 If we have previously stripped a zero-extension,
8047 only zero-extensions can safely be stripped.
8048 Any extension can be stripped if the bits it would produce
8049 are all going to be discarded later by truncating to FOR_TYPE. */
8053 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8055 /* TYPE_UNSIGNED says whether this is a zero-extension.
8056 Let's avoid computing it if it does not affect WIN
8057 and if UNS will not be needed again. */
8059 || CONVERT_EXPR_P (op
))
8060 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8068 /* If we finally reach a constant see if it fits in for_type and
8069 in that case convert it. */
8071 && TREE_CODE (win
) == INTEGER_CST
8072 && TREE_TYPE (win
) != for_type
8073 && int_fits_type_p (win
, for_type
))
8074 win
= fold_convert (for_type
, win
);
8079 /* Return OP or a simpler expression for a narrower value
8080 which can be sign-extended or zero-extended to give back OP.
8081 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8082 or 0 if the value should be sign-extended. */
8085 get_narrower (tree op
, int *unsignedp_ptr
)
8090 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8092 while (TREE_CODE (op
) == NOP_EXPR
)
8095 = (TYPE_PRECISION (TREE_TYPE (op
))
8096 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8098 /* Truncations are many-one so cannot be removed. */
8102 /* See what's inside this conversion. If we decide to strip it,
8107 op
= TREE_OPERAND (op
, 0);
8108 /* An extension: the outermost one can be stripped,
8109 but remember whether it is zero or sign extension. */
8111 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8112 /* Otherwise, if a sign extension has been stripped,
8113 only sign extensions can now be stripped;
8114 if a zero extension has been stripped, only zero-extensions. */
8115 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8119 else /* bitschange == 0 */
8121 /* A change in nominal type can always be stripped, but we must
8122 preserve the unsignedness. */
8124 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8126 op
= TREE_OPERAND (op
, 0);
8127 /* Keep trying to narrow, but don't assign op to win if it
8128 would turn an integral type into something else. */
8129 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8136 if (TREE_CODE (op
) == COMPONENT_REF
8137 /* Since type_for_size always gives an integer type. */
8138 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8139 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8140 /* Ensure field is laid out already. */
8141 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8142 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8144 unsigned HOST_WIDE_INT innerprec
8145 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8146 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8147 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8148 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8150 /* We can get this structure field in a narrower type that fits it,
8151 but the resulting extension to its nominal type (a fullword type)
8152 must satisfy the same conditions as for other extensions.
8154 Do this only for fields that are aligned (not bit-fields),
8155 because when bit-field insns will be used there is no
8156 advantage in doing this. */
8158 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8159 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8160 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8164 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8165 win
= fold_convert (type
, op
);
8169 *unsignedp_ptr
= uns
;
8173 /* Returns true if integer constant C has a value that is permissible
8174 for type TYPE (an INTEGER_TYPE). */
8177 int_fits_type_p (const_tree c
, const_tree type
)
8179 tree type_low_bound
, type_high_bound
;
8180 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8183 dc
= tree_to_double_int (c
);
8184 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8186 if (TREE_CODE (TREE_TYPE (c
)) == INTEGER_TYPE
8187 && TYPE_IS_SIZETYPE (TREE_TYPE (c
))
8189 /* So c is an unsigned integer whose type is sizetype and type is not.
8190 sizetype'd integers are sign extended even though they are
8191 unsigned. If the integer value fits in the lower end word of c,
8192 and if the higher end word has all its bits set to 1, that
8193 means the higher end bits are set to 1 only for sign extension.
8194 So let's convert c into an equivalent zero extended unsigned
8196 dc
= double_int_zext (dc
, TYPE_PRECISION (TREE_TYPE (c
)));
8199 type_low_bound
= TYPE_MIN_VALUE (type
);
8200 type_high_bound
= TYPE_MAX_VALUE (type
);
8202 /* If at least one bound of the type is a constant integer, we can check
8203 ourselves and maybe make a decision. If no such decision is possible, but
8204 this type is a subtype, try checking against that. Otherwise, use
8205 double_int_fits_to_tree_p, which checks against the precision.
8207 Compute the status for each possibly constant bound, and return if we see
8208 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8209 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8210 for "constant known to fit". */
8212 /* Check if c >= type_low_bound. */
8213 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8215 dd
= tree_to_double_int (type_low_bound
);
8216 if (TREE_CODE (type
) == INTEGER_TYPE
8217 && TYPE_IS_SIZETYPE (type
)
8218 && TYPE_UNSIGNED (type
))
8219 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8220 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8222 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8223 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8225 if (c_neg
&& !t_neg
)
8227 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8230 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8232 ok_for_low_bound
= true;
8235 ok_for_low_bound
= false;
8237 /* Check if c <= type_high_bound. */
8238 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8240 dd
= tree_to_double_int (type_high_bound
);
8241 if (TREE_CODE (type
) == INTEGER_TYPE
8242 && TYPE_IS_SIZETYPE (type
)
8243 && TYPE_UNSIGNED (type
))
8244 dd
= double_int_zext (dd
, TYPE_PRECISION (type
));
8245 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8247 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8248 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8250 if (t_neg
&& !c_neg
)
8252 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8255 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8257 ok_for_high_bound
= true;
8260 ok_for_high_bound
= false;
8262 /* If the constant fits both bounds, the result is known. */
8263 if (ok_for_low_bound
&& ok_for_high_bound
)
8266 /* Perform some generic filtering which may allow making a decision
8267 even if the bounds are not constant. First, negative integers
8268 never fit in unsigned types, */
8269 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8272 /* Second, narrower types always fit in wider ones. */
8273 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8276 /* Third, unsigned integers with top bit set never fit signed types. */
8277 if (! TYPE_UNSIGNED (type
) && unsc
)
8279 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8280 if (prec
< HOST_BITS_PER_WIDE_INT
)
8282 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8285 else if (((((unsigned HOST_WIDE_INT
) 1)
8286 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8290 /* If we haven't been able to decide at this point, there nothing more we
8291 can check ourselves here. Look at the base type if we have one and it
8292 has the same precision. */
8293 if (TREE_CODE (type
) == INTEGER_TYPE
8294 && TREE_TYPE (type
) != 0
8295 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8297 type
= TREE_TYPE (type
);
8301 /* Or to double_int_fits_to_tree_p, if nothing else. */
8302 return double_int_fits_to_tree_p (type
, dc
);
8305 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8306 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8307 represented (assuming two's-complement arithmetic) within the bit
8308 precision of the type are returned instead. */
8311 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8313 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8314 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8315 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8316 TYPE_UNSIGNED (type
));
8319 if (TYPE_UNSIGNED (type
))
8320 mpz_set_ui (min
, 0);
8324 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8325 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8326 TYPE_PRECISION (type
));
8327 mpz_set_double_int (min
, mn
, false);
8331 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8332 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8333 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8334 TYPE_UNSIGNED (type
));
8337 if (TYPE_UNSIGNED (type
))
8338 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8341 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8346 /* Return true if VAR is an automatic variable defined in function FN. */
8349 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8351 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8352 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8353 || TREE_CODE (var
) == PARM_DECL
)
8354 && ! TREE_STATIC (var
))
8355 || TREE_CODE (var
) == LABEL_DECL
8356 || TREE_CODE (var
) == RESULT_DECL
));
8359 /* Subprogram of following function. Called by walk_tree.
8361 Return *TP if it is an automatic variable or parameter of the
8362 function passed in as DATA. */
8365 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8367 tree fn
= (tree
) data
;
8372 else if (DECL_P (*tp
)
8373 && auto_var_in_fn_p (*tp
, fn
))
8379 /* Returns true if T is, contains, or refers to a type with variable
8380 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8381 arguments, but not the return type. If FN is nonzero, only return
8382 true if a modifier of the type or position of FN is a variable or
8383 parameter inside FN.
8385 This concept is more general than that of C99 'variably modified types':
8386 in C99, a struct type is never variably modified because a VLA may not
8387 appear as a structure member. However, in GNU C code like:
8389 struct S { int i[f()]; };
8391 is valid, and other languages may define similar constructs. */
8394 variably_modified_type_p (tree type
, tree fn
)
8398 /* Test if T is either variable (if FN is zero) or an expression containing
8399 a variable in FN. */
8400 #define RETURN_TRUE_IF_VAR(T) \
8401 do { tree _t = (T); \
8402 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
8403 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8404 return true; } while (0)
8406 if (type
== error_mark_node
)
8409 /* If TYPE itself has variable size, it is variably modified. */
8410 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8411 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8413 switch (TREE_CODE (type
))
8416 case REFERENCE_TYPE
:
8418 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8424 /* If TYPE is a function type, it is variably modified if the
8425 return type is variably modified. */
8426 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8432 case FIXED_POINT_TYPE
:
8435 /* Scalar types are variably modified if their end points
8437 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8438 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8443 case QUAL_UNION_TYPE
:
8444 /* We can't see if any of the fields are variably-modified by the
8445 definition we normally use, since that would produce infinite
8446 recursion via pointers. */
8447 /* This is variably modified if some field's type is. */
8448 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8449 if (TREE_CODE (t
) == FIELD_DECL
)
8451 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8452 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8453 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8455 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8456 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8461 /* Do not call ourselves to avoid infinite recursion. This is
8462 variably modified if the element type is. */
8463 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8464 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8471 /* The current language may have other cases to check, but in general,
8472 all other types are not variably modified. */
8473 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8475 #undef RETURN_TRUE_IF_VAR
8478 /* Given a DECL or TYPE, return the scope in which it was declared, or
8479 NULL_TREE if there is no containing scope. */
8482 get_containing_scope (const_tree t
)
8484 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8487 /* Return the innermost context enclosing DECL that is
8488 a FUNCTION_DECL, or zero if none. */
8491 decl_function_context (const_tree decl
)
8495 if (TREE_CODE (decl
) == ERROR_MARK
)
8498 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8499 where we look up the function at runtime. Such functions always take
8500 a first argument of type 'pointer to real context'.
8502 C++ should really be fixed to use DECL_CONTEXT for the real context,
8503 and use something else for the "virtual context". */
8504 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8507 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8509 context
= DECL_CONTEXT (decl
);
8511 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8513 if (TREE_CODE (context
) == BLOCK
)
8514 context
= BLOCK_SUPERCONTEXT (context
);
8516 context
= get_containing_scope (context
);
8522 /* Return the innermost context enclosing DECL that is
8523 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8524 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8527 decl_type_context (const_tree decl
)
8529 tree context
= DECL_CONTEXT (decl
);
8532 switch (TREE_CODE (context
))
8534 case NAMESPACE_DECL
:
8535 case TRANSLATION_UNIT_DECL
:
8540 case QUAL_UNION_TYPE
:
8545 context
= DECL_CONTEXT (context
);
8549 context
= BLOCK_SUPERCONTEXT (context
);
8559 /* CALL is a CALL_EXPR. Return the declaration for the function
8560 called, or NULL_TREE if the called function cannot be
8564 get_callee_fndecl (const_tree call
)
8568 if (call
== error_mark_node
)
8569 return error_mark_node
;
8571 /* It's invalid to call this function with anything but a
8573 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8575 /* The first operand to the CALL is the address of the function
8577 addr
= CALL_EXPR_FN (call
);
8581 /* If this is a readonly function pointer, extract its initial value. */
8582 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8583 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8584 && DECL_INITIAL (addr
))
8585 addr
= DECL_INITIAL (addr
);
8587 /* If the address is just `&f' for some function `f', then we know
8588 that `f' is being called. */
8589 if (TREE_CODE (addr
) == ADDR_EXPR
8590 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8591 return TREE_OPERAND (addr
, 0);
8593 /* We couldn't figure out what was being called. */
8597 /* Print debugging information about tree nodes generated during the compile,
8598 and any language-specific information. */
8601 dump_tree_statistics (void)
8603 #ifdef GATHER_STATISTICS
8605 int total_nodes
, total_bytes
;
8608 fprintf (stderr
, "\n??? tree nodes created\n\n");
8609 #ifdef GATHER_STATISTICS
8610 fprintf (stderr
, "Kind Nodes Bytes\n");
8611 fprintf (stderr
, "---------------------------------------\n");
8612 total_nodes
= total_bytes
= 0;
8613 for (i
= 0; i
< (int) all_kinds
; i
++)
8615 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8616 tree_node_counts
[i
], tree_node_sizes
[i
]);
8617 total_nodes
+= tree_node_counts
[i
];
8618 total_bytes
+= tree_node_sizes
[i
];
8620 fprintf (stderr
, "---------------------------------------\n");
8621 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8622 fprintf (stderr
, "---------------------------------------\n");
8623 fprintf (stderr
, "Code Nodes\n");
8624 fprintf (stderr
, "----------------------------\n");
8625 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8626 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8627 fprintf (stderr
, "----------------------------\n");
8628 ssanames_print_statistics ();
8629 phinodes_print_statistics ();
8631 fprintf (stderr
, "(No per-node statistics)\n");
8633 print_type_hash_statistics ();
8634 print_debug_expr_statistics ();
8635 print_value_expr_statistics ();
8636 lang_hooks
.print_statistics ();
8639 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8641 /* Generate a crc32 of a byte. */
8644 crc32_byte (unsigned chksum
, char byte
)
8646 unsigned value
= (unsigned) byte
<< 24;
8649 for (ix
= 8; ix
--; value
<<= 1)
8653 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8661 /* Generate a crc32 of a string. */
8664 crc32_string (unsigned chksum
, const char *string
)
8668 chksum
= crc32_byte (chksum
, *string
);
8674 /* P is a string that will be used in a symbol. Mask out any characters
8675 that are not valid in that context. */
8678 clean_symbol_name (char *p
)
8682 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8685 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8692 /* Generate a name for a special-purpose function.
8693 The generated name may need to be unique across the whole link.
8694 Changes to this function may also require corresponding changes to
8695 xstrdup_mask_random.
8696 TYPE is some string to identify the purpose of this function to the
8697 linker or collect2; it must start with an uppercase letter,
8699 I - for constructors
8701 N - for C++ anonymous namespaces
8702 F - for DWARF unwind frame information. */
8705 get_file_function_name (const char *type
)
8711 /* If we already have a name we know to be unique, just use that. */
8712 if (first_global_object_name
)
8713 p
= q
= ASTRDUP (first_global_object_name
);
8714 /* If the target is handling the constructors/destructors, they
8715 will be local to this file and the name is only necessary for
8717 We also assign sub_I and sub_D sufixes to constructors called from
8718 the global static constructors. These are always local. */
8719 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8720 || (strncmp (type
, "sub_", 4) == 0
8721 && (type
[4] == 'I' || type
[4] == 'D')))
8723 const char *file
= main_input_filename
;
8725 file
= input_filename
;
8726 /* Just use the file's basename, because the full pathname
8727 might be quite long. */
8728 p
= q
= ASTRDUP (lbasename (file
));
8732 /* Otherwise, the name must be unique across the entire link.
8733 We don't have anything that we know to be unique to this translation
8734 unit, so use what we do have and throw in some randomness. */
8736 const char *name
= weak_global_object_name
;
8737 const char *file
= main_input_filename
;
8742 file
= input_filename
;
8744 len
= strlen (file
);
8745 q
= (char *) alloca (9 + 17 + len
+ 1);
8746 memcpy (q
, file
, len
+ 1);
8748 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8749 crc32_string (0, name
), get_random_seed (false));
8754 clean_symbol_name (q
);
8755 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8758 /* Set up the name of the file-level functions we may need.
8759 Use a global object (which is already required to be unique over
8760 the program) rather than the file name (which imposes extra
8762 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8764 return get_identifier (buf
);
8767 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8769 /* Complain that the tree code of NODE does not match the expected 0
8770 terminated list of trailing codes. The trailing code list can be
8771 empty, for a more vague error message. FILE, LINE, and FUNCTION
8772 are of the caller. */
8775 tree_check_failed (const_tree node
, const char *file
,
8776 int line
, const char *function
, ...)
8780 unsigned length
= 0;
8783 va_start (args
, function
);
8784 while ((code
= va_arg (args
, int)))
8785 length
+= 4 + strlen (tree_code_name
[code
]);
8790 va_start (args
, function
);
8791 length
+= strlen ("expected ");
8792 buffer
= tmp
= (char *) alloca (length
);
8794 while ((code
= va_arg (args
, int)))
8796 const char *prefix
= length
? " or " : "expected ";
8798 strcpy (tmp
+ length
, prefix
);
8799 length
+= strlen (prefix
);
8800 strcpy (tmp
+ length
, tree_code_name
[code
]);
8801 length
+= strlen (tree_code_name
[code
]);
8806 buffer
= "unexpected node";
8808 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8809 buffer
, tree_code_name
[TREE_CODE (node
)],
8810 function
, trim_filename (file
), line
);
8813 /* Complain that the tree code of NODE does match the expected 0
8814 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8818 tree_not_check_failed (const_tree node
, const char *file
,
8819 int line
, const char *function
, ...)
8823 unsigned length
= 0;
8826 va_start (args
, function
);
8827 while ((code
= va_arg (args
, int)))
8828 length
+= 4 + strlen (tree_code_name
[code
]);
8830 va_start (args
, function
);
8831 buffer
= (char *) alloca (length
);
8833 while ((code
= va_arg (args
, int)))
8837 strcpy (buffer
+ length
, " or ");
8840 strcpy (buffer
+ length
, tree_code_name
[code
]);
8841 length
+= strlen (tree_code_name
[code
]);
8845 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8846 buffer
, tree_code_name
[TREE_CODE (node
)],
8847 function
, trim_filename (file
), line
);
8850 /* Similar to tree_check_failed, except that we check for a class of tree
8851 code, given in CL. */
8854 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8855 const char *file
, int line
, const char *function
)
8858 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8859 TREE_CODE_CLASS_STRING (cl
),
8860 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8861 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8864 /* Similar to tree_check_failed, except that instead of specifying a
8865 dozen codes, use the knowledge that they're all sequential. */
8868 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8869 const char *function
, enum tree_code c1
,
8873 unsigned length
= 0;
8876 for (c
= c1
; c
<= c2
; ++c
)
8877 length
+= 4 + strlen (tree_code_name
[c
]);
8879 length
+= strlen ("expected ");
8880 buffer
= (char *) alloca (length
);
8883 for (c
= c1
; c
<= c2
; ++c
)
8885 const char *prefix
= length
? " or " : "expected ";
8887 strcpy (buffer
+ length
, prefix
);
8888 length
+= strlen (prefix
);
8889 strcpy (buffer
+ length
, tree_code_name
[c
]);
8890 length
+= strlen (tree_code_name
[c
]);
8893 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8894 buffer
, tree_code_name
[TREE_CODE (node
)],
8895 function
, trim_filename (file
), line
);
8899 /* Similar to tree_check_failed, except that we check that a tree does
8900 not have the specified code, given in CL. */
8903 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8904 const char *file
, int line
, const char *function
)
8907 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8908 TREE_CODE_CLASS_STRING (cl
),
8909 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8910 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8914 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
8917 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
8918 const char *function
, enum omp_clause_code code
)
8920 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
8921 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
8922 function
, trim_filename (file
), line
);
8926 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
8929 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
8930 const char *function
, enum omp_clause_code c1
,
8931 enum omp_clause_code c2
)
8934 unsigned length
= 0;
8937 for (c
= c1
; c
<= c2
; ++c
)
8938 length
+= 4 + strlen (omp_clause_code_name
[c
]);
8940 length
+= strlen ("expected ");
8941 buffer
= (char *) alloca (length
);
8944 for (c
= c1
; c
<= c2
; ++c
)
8946 const char *prefix
= length
? " or " : "expected ";
8948 strcpy (buffer
+ length
, prefix
);
8949 length
+= strlen (prefix
);
8950 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
8951 length
+= strlen (omp_clause_code_name
[c
]);
8954 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8955 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
8956 function
, trim_filename (file
), line
);
8960 #undef DEFTREESTRUCT
8961 #define DEFTREESTRUCT(VAL, NAME) NAME,
8963 static const char *ts_enum_names
[] = {
8964 #include "treestruct.def"
8966 #undef DEFTREESTRUCT
8968 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
8970 /* Similar to tree_class_check_failed, except that we check for
8971 whether CODE contains the tree structure identified by EN. */
8974 tree_contains_struct_check_failed (const_tree node
,
8975 const enum tree_node_structure_enum en
,
8976 const char *file
, int line
,
8977 const char *function
)
8980 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
8982 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8986 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
8987 (dynamically sized) vector. */
8990 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
8991 const char *function
)
8994 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
8995 idx
+ 1, len
, function
, trim_filename (file
), line
);
8998 /* Similar to above, except that the check is for the bounds of the operand
8999 vector of an expression node EXP. */
9002 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9003 int line
, const char *function
)
9005 int code
= TREE_CODE (exp
);
9007 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9008 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9009 function
, trim_filename (file
), line
);
9012 /* Similar to above, except that the check is for the number of
9013 operands of an OMP_CLAUSE node. */
9016 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9017 int line
, const char *function
)
9020 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9021 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9022 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9023 trim_filename (file
), line
);
9025 #endif /* ENABLE_TREE_CHECKING */
9027 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9028 and mapped to the machine mode MODE. Initialize its fields and build
9029 the information necessary for debugging output. */
9032 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9035 hashval_t hashcode
= 0;
9037 t
= make_node (VECTOR_TYPE
);
9038 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9039 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9040 SET_TYPE_MODE (t
, mode
);
9042 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9043 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9044 else if (TYPE_CANONICAL (innertype
) != innertype
9045 || mode
!= VOIDmode
)
9047 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9051 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9052 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9053 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9054 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9055 t
= type_hash_canon (hashcode
, t
);
9057 /* We have built a main variant, based on the main variant of the
9058 inner type. Use it to build the variant we return. */
9059 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9060 && TREE_TYPE (t
) != innertype
)
9061 return build_type_attribute_qual_variant (t
,
9062 TYPE_ATTRIBUTES (innertype
),
9063 TYPE_QUALS (innertype
));
9069 make_or_reuse_type (unsigned size
, int unsignedp
)
9071 if (size
== INT_TYPE_SIZE
)
9072 return unsignedp
? unsigned_type_node
: integer_type_node
;
9073 if (size
== CHAR_TYPE_SIZE
)
9074 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9075 if (size
== SHORT_TYPE_SIZE
)
9076 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9077 if (size
== LONG_TYPE_SIZE
)
9078 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9079 if (size
== LONG_LONG_TYPE_SIZE
)
9080 return (unsignedp
? long_long_unsigned_type_node
9081 : long_long_integer_type_node
);
9082 if (size
== 128 && int128_integer_type_node
)
9083 return (unsignedp
? int128_unsigned_type_node
9084 : int128_integer_type_node
);
9087 return make_unsigned_type (size
);
9089 return make_signed_type (size
);
9092 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9095 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9099 if (size
== SHORT_FRACT_TYPE_SIZE
)
9100 return unsignedp
? sat_unsigned_short_fract_type_node
9101 : sat_short_fract_type_node
;
9102 if (size
== FRACT_TYPE_SIZE
)
9103 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9104 if (size
== LONG_FRACT_TYPE_SIZE
)
9105 return unsignedp
? sat_unsigned_long_fract_type_node
9106 : sat_long_fract_type_node
;
9107 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9108 return unsignedp
? sat_unsigned_long_long_fract_type_node
9109 : sat_long_long_fract_type_node
;
9113 if (size
== SHORT_FRACT_TYPE_SIZE
)
9114 return unsignedp
? unsigned_short_fract_type_node
9115 : short_fract_type_node
;
9116 if (size
== FRACT_TYPE_SIZE
)
9117 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9118 if (size
== LONG_FRACT_TYPE_SIZE
)
9119 return unsignedp
? unsigned_long_fract_type_node
9120 : long_fract_type_node
;
9121 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9122 return unsignedp
? unsigned_long_long_fract_type_node
9123 : long_long_fract_type_node
;
9126 return make_fract_type (size
, unsignedp
, satp
);
9129 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9132 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9136 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9137 return unsignedp
? sat_unsigned_short_accum_type_node
9138 : sat_short_accum_type_node
;
9139 if (size
== ACCUM_TYPE_SIZE
)
9140 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9141 if (size
== LONG_ACCUM_TYPE_SIZE
)
9142 return unsignedp
? sat_unsigned_long_accum_type_node
9143 : sat_long_accum_type_node
;
9144 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9145 return unsignedp
? sat_unsigned_long_long_accum_type_node
9146 : sat_long_long_accum_type_node
;
9150 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9151 return unsignedp
? unsigned_short_accum_type_node
9152 : short_accum_type_node
;
9153 if (size
== ACCUM_TYPE_SIZE
)
9154 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9155 if (size
== LONG_ACCUM_TYPE_SIZE
)
9156 return unsignedp
? unsigned_long_accum_type_node
9157 : long_accum_type_node
;
9158 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9159 return unsignedp
? unsigned_long_long_accum_type_node
9160 : long_long_accum_type_node
;
9163 return make_accum_type (size
, unsignedp
, satp
);
9166 /* Create nodes for all integer types (and error_mark_node) using the sizes
9167 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9168 SHORT_DOUBLE specifies whether double should be of the same precision
9172 build_common_tree_nodes (bool signed_char
, bool short_double
)
9174 error_mark_node
= make_node (ERROR_MARK
);
9175 TREE_TYPE (error_mark_node
) = error_mark_node
;
9177 initialize_sizetypes ();
9179 /* Define both `signed char' and `unsigned char'. */
9180 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9181 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9182 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9183 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9185 /* Define `char', which is like either `signed char' or `unsigned char'
9186 but not the same as either. */
9189 ? make_signed_type (CHAR_TYPE_SIZE
)
9190 : make_unsigned_type (CHAR_TYPE_SIZE
));
9191 TYPE_STRING_FLAG (char_type_node
) = 1;
9193 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9194 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9195 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9196 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9197 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9198 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9199 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9200 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9201 #if HOST_BITS_PER_WIDE_INT >= 64
9202 /* TODO: This isn't correct, but as logic depends at the moment on
9203 host's instead of target's wide-integer.
9204 If there is a target not supporting TImode, but has an 128-bit
9205 integer-scalar register, this target check needs to be adjusted. */
9206 if (targetm
.scalar_mode_supported_p (TImode
))
9208 int128_integer_type_node
= make_signed_type (128);
9209 int128_unsigned_type_node
= make_unsigned_type (128);
9213 /* Define a boolean type. This type only represents boolean values but
9214 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9215 Front ends which want to override this size (i.e. Java) can redefine
9216 boolean_type_node before calling build_common_tree_nodes_2. */
9217 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9218 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9219 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9220 TYPE_PRECISION (boolean_type_node
) = 1;
9222 /* Define what type to use for size_t. */
9223 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9224 size_type_node
= unsigned_type_node
;
9225 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9226 size_type_node
= long_unsigned_type_node
;
9227 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9228 size_type_node
= long_long_unsigned_type_node
;
9229 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9230 size_type_node
= short_unsigned_type_node
;
9234 /* Fill in the rest of the sized types. Reuse existing type nodes
9236 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9237 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9238 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9239 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9240 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9242 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9243 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9244 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9245 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9246 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9248 access_public_node
= get_identifier ("public");
9249 access_protected_node
= get_identifier ("protected");
9250 access_private_node
= get_identifier ("private");
9252 /* Define these next since types below may used them. */
9253 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9254 integer_one_node
= build_int_cst (integer_type_node
, 1);
9255 integer_three_node
= build_int_cst (integer_type_node
, 3);
9256 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9258 size_zero_node
= size_int (0);
9259 size_one_node
= size_int (1);
9260 bitsize_zero_node
= bitsize_int (0);
9261 bitsize_one_node
= bitsize_int (1);
9262 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9264 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9265 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9267 void_type_node
= make_node (VOID_TYPE
);
9268 layout_type (void_type_node
);
9270 /* We are not going to have real types in C with less than byte alignment,
9271 so we might as well not have any types that claim to have it. */
9272 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9273 TYPE_USER_ALIGN (void_type_node
) = 0;
9275 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9276 layout_type (TREE_TYPE (null_pointer_node
));
9278 ptr_type_node
= build_pointer_type (void_type_node
);
9280 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9281 fileptr_type_node
= ptr_type_node
;
9283 float_type_node
= make_node (REAL_TYPE
);
9284 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9285 layout_type (float_type_node
);
9287 double_type_node
= make_node (REAL_TYPE
);
9289 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9291 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9292 layout_type (double_type_node
);
9294 long_double_type_node
= make_node (REAL_TYPE
);
9295 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9296 layout_type (long_double_type_node
);
9298 float_ptr_type_node
= build_pointer_type (float_type_node
);
9299 double_ptr_type_node
= build_pointer_type (double_type_node
);
9300 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9301 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9303 /* Fixed size integer types. */
9304 uint32_type_node
= build_nonstandard_integer_type (32, true);
9305 uint64_type_node
= build_nonstandard_integer_type (64, true);
9307 /* Decimal float types. */
9308 dfloat32_type_node
= make_node (REAL_TYPE
);
9309 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9310 layout_type (dfloat32_type_node
);
9311 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9312 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9314 dfloat64_type_node
= make_node (REAL_TYPE
);
9315 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9316 layout_type (dfloat64_type_node
);
9317 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9318 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9320 dfloat128_type_node
= make_node (REAL_TYPE
);
9321 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9322 layout_type (dfloat128_type_node
);
9323 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9324 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9326 complex_integer_type_node
= build_complex_type (integer_type_node
);
9327 complex_float_type_node
= build_complex_type (float_type_node
);
9328 complex_double_type_node
= build_complex_type (double_type_node
);
9329 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9331 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9332 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9333 sat_ ## KIND ## _type_node = \
9334 make_sat_signed_ ## KIND ## _type (SIZE); \
9335 sat_unsigned_ ## KIND ## _type_node = \
9336 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9337 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9338 unsigned_ ## KIND ## _type_node = \
9339 make_unsigned_ ## KIND ## _type (SIZE);
9341 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9342 sat_ ## WIDTH ## KIND ## _type_node = \
9343 make_sat_signed_ ## KIND ## _type (SIZE); \
9344 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9345 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9346 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9347 unsigned_ ## WIDTH ## KIND ## _type_node = \
9348 make_unsigned_ ## KIND ## _type (SIZE);
9350 /* Make fixed-point type nodes based on four different widths. */
9351 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9352 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9353 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9354 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9355 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9357 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9358 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9359 NAME ## _type_node = \
9360 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9361 u ## NAME ## _type_node = \
9362 make_or_reuse_unsigned_ ## KIND ## _type \
9363 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9364 sat_ ## NAME ## _type_node = \
9365 make_or_reuse_sat_signed_ ## KIND ## _type \
9366 (GET_MODE_BITSIZE (MODE ## mode)); \
9367 sat_u ## NAME ## _type_node = \
9368 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9369 (GET_MODE_BITSIZE (U ## MODE ## mode));
9371 /* Fixed-point type and mode nodes. */
9372 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9373 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9374 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9375 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9376 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9377 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9378 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9379 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9380 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9381 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9382 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9385 tree t
= targetm
.build_builtin_va_list ();
9387 /* Many back-ends define record types without setting TYPE_NAME.
9388 If we copied the record type here, we'd keep the original
9389 record type without a name. This breaks name mangling. So,
9390 don't copy record types and let c_common_nodes_and_builtins()
9391 declare the type to be __builtin_va_list. */
9392 if (TREE_CODE (t
) != RECORD_TYPE
)
9393 t
= build_variant_type_copy (t
);
9395 va_list_type_node
= t
;
9399 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9402 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9403 const char *library_name
, int ecf_flags
)
9407 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9408 library_name
, NULL_TREE
);
9409 if (ecf_flags
& ECF_CONST
)
9410 TREE_READONLY (decl
) = 1;
9411 if (ecf_flags
& ECF_PURE
)
9412 DECL_PURE_P (decl
) = 1;
9413 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9414 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9415 if (ecf_flags
& ECF_NORETURN
)
9416 TREE_THIS_VOLATILE (decl
) = 1;
9417 if (ecf_flags
& ECF_NOTHROW
)
9418 TREE_NOTHROW (decl
) = 1;
9419 if (ecf_flags
& ECF_MALLOC
)
9420 DECL_IS_MALLOC (decl
) = 1;
9421 if (ecf_flags
& ECF_LEAF
)
9422 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9423 NULL
, DECL_ATTRIBUTES (decl
));
9424 if ((ecf_flags
& ECF_TM_PURE
) && flag_tm
)
9425 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9427 set_builtin_decl (code
, decl
, true);
9430 /* Call this function after instantiating all builtins that the language
9431 front end cares about. This will build the rest of the builtins that
9432 are relied upon by the tree optimizers and the middle-end. */
9435 build_common_builtin_nodes (void)
9440 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9441 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9443 ftype
= build_function_type_list (ptr_type_node
,
9444 ptr_type_node
, const_ptr_type_node
,
9445 size_type_node
, NULL_TREE
);
9447 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9448 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9449 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9450 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9451 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9452 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9455 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9457 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9458 const_ptr_type_node
, size_type_node
,
9460 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9461 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9464 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9466 ftype
= build_function_type_list (ptr_type_node
,
9467 ptr_type_node
, integer_type_node
,
9468 size_type_node
, NULL_TREE
);
9469 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9470 "memset", ECF_NOTHROW
| ECF_LEAF
);
9473 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9475 ftype
= build_function_type_list (ptr_type_node
,
9476 size_type_node
, NULL_TREE
);
9477 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9478 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9481 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9482 size_type_node
, NULL_TREE
);
9483 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9484 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9485 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9487 /* If we're checking the stack, `alloca' can throw. */
9488 if (flag_stack_check
)
9490 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9491 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9494 ftype
= build_function_type_list (void_type_node
,
9495 ptr_type_node
, ptr_type_node
,
9496 ptr_type_node
, NULL_TREE
);
9497 local_define_builtin ("__builtin_init_trampoline", ftype
,
9498 BUILT_IN_INIT_TRAMPOLINE
,
9499 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9501 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9502 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9503 BUILT_IN_ADJUST_TRAMPOLINE
,
9504 "__builtin_adjust_trampoline",
9505 ECF_CONST
| ECF_NOTHROW
);
9507 ftype
= build_function_type_list (void_type_node
,
9508 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9509 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9510 BUILT_IN_NONLOCAL_GOTO
,
9511 "__builtin_nonlocal_goto",
9512 ECF_NORETURN
| ECF_NOTHROW
);
9514 ftype
= build_function_type_list (void_type_node
,
9515 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9516 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9517 BUILT_IN_SETJMP_SETUP
,
9518 "__builtin_setjmp_setup", ECF_NOTHROW
);
9520 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9521 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9522 BUILT_IN_SETJMP_DISPATCHER
,
9523 "__builtin_setjmp_dispatcher",
9524 ECF_PURE
| ECF_NOTHROW
);
9526 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9527 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9528 BUILT_IN_SETJMP_RECEIVER
,
9529 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9531 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9532 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9533 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9535 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9536 local_define_builtin ("__builtin_stack_restore", ftype
,
9537 BUILT_IN_STACK_RESTORE
,
9538 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9540 /* If there's a possibility that we might use the ARM EABI, build the
9541 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9542 if (targetm
.arm_eabi_unwinder
)
9544 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9545 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9546 BUILT_IN_CXA_END_CLEANUP
,
9547 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9550 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9551 local_define_builtin ("__builtin_unwind_resume", ftype
,
9552 BUILT_IN_UNWIND_RESUME
,
9553 ((targetm_common
.except_unwind_info (&global_options
)
9555 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9558 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9560 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9562 local_define_builtin ("__builtin_return_address", ftype
,
9563 BUILT_IN_RETURN_ADDRESS
,
9564 "__builtin_return_address",
9568 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9569 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9571 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9572 ptr_type_node
, NULL_TREE
);
9573 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9574 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9575 BUILT_IN_PROFILE_FUNC_ENTER
,
9576 "__cyg_profile_func_enter", 0);
9577 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9578 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9579 BUILT_IN_PROFILE_FUNC_EXIT
,
9580 "__cyg_profile_func_exit", 0);
9583 /* The exception object and filter values from the runtime. The argument
9584 must be zero before exception lowering, i.e. from the front end. After
9585 exception lowering, it will be the region number for the exception
9586 landing pad. These functions are PURE instead of CONST to prevent
9587 them from being hoisted past the exception edge that will initialize
9588 its value in the landing pad. */
9589 ftype
= build_function_type_list (ptr_type_node
,
9590 integer_type_node
, NULL_TREE
);
9591 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9592 /* Only use TM_PURE if we we have TM language support. */
9593 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9594 ecf_flags
|= ECF_TM_PURE
;
9595 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9596 "__builtin_eh_pointer", ecf_flags
);
9598 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9599 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9600 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9601 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9603 ftype
= build_function_type_list (void_type_node
,
9604 integer_type_node
, integer_type_node
,
9606 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9607 BUILT_IN_EH_COPY_VALUES
,
9608 "__builtin_eh_copy_values", ECF_NOTHROW
);
9610 /* Complex multiplication and division. These are handled as builtins
9611 rather than optabs because emit_library_call_value doesn't support
9612 complex. Further, we can do slightly better with folding these
9613 beasties if the real and complex parts of the arguments are separate. */
9617 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9619 char mode_name_buf
[4], *q
;
9621 enum built_in_function mcode
, dcode
;
9622 tree type
, inner_type
;
9623 const char *prefix
= "__";
9625 if (targetm
.libfunc_gnu_prefix
)
9628 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9631 inner_type
= TREE_TYPE (type
);
9633 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9634 inner_type
, inner_type
, NULL_TREE
);
9636 mcode
= ((enum built_in_function
)
9637 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9638 dcode
= ((enum built_in_function
)
9639 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9641 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9645 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9647 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9648 built_in_names
[mcode
],
9649 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9651 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9653 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9654 built_in_names
[dcode
],
9655 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9660 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9663 If we requested a pointer to a vector, build up the pointers that
9664 we stripped off while looking for the inner type. Similarly for
9665 return values from functions.
9667 The argument TYPE is the top of the chain, and BOTTOM is the
9668 new type which we will point to. */
9671 reconstruct_complex_type (tree type
, tree bottom
)
9675 if (TREE_CODE (type
) == POINTER_TYPE
)
9677 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9678 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9679 TYPE_REF_CAN_ALIAS_ALL (type
));
9681 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9683 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9684 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9685 TYPE_REF_CAN_ALIAS_ALL (type
));
9687 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9689 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9690 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9692 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9694 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9695 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9697 else if (TREE_CODE (type
) == METHOD_TYPE
)
9699 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9700 /* The build_method_type_directly() routine prepends 'this' to argument list,
9701 so we must compensate by getting rid of it. */
9703 = build_method_type_directly
9704 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9706 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9708 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9710 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9711 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9716 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9720 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9723 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9727 switch (GET_MODE_CLASS (mode
))
9729 case MODE_VECTOR_INT
:
9730 case MODE_VECTOR_FLOAT
:
9731 case MODE_VECTOR_FRACT
:
9732 case MODE_VECTOR_UFRACT
:
9733 case MODE_VECTOR_ACCUM
:
9734 case MODE_VECTOR_UACCUM
:
9735 nunits
= GET_MODE_NUNITS (mode
);
9739 /* Check that there are no leftover bits. */
9740 gcc_assert (GET_MODE_BITSIZE (mode
)
9741 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9743 nunits
= GET_MODE_BITSIZE (mode
)
9744 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9751 return make_vector_type (innertype
, nunits
, mode
);
9754 /* Similarly, but takes the inner type and number of units, which must be
9758 build_vector_type (tree innertype
, int nunits
)
9760 return make_vector_type (innertype
, nunits
, VOIDmode
);
9763 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9766 build_opaque_vector_type (tree innertype
, int nunits
)
9768 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9770 /* We always build the non-opaque variant before the opaque one,
9771 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9772 cand
= TYPE_NEXT_VARIANT (t
);
9774 && TYPE_VECTOR_OPAQUE (cand
)
9775 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
9777 /* Othewise build a variant type and make sure to queue it after
9778 the non-opaque type. */
9779 cand
= build_distinct_type_copy (t
);
9780 TYPE_VECTOR_OPAQUE (cand
) = true;
9781 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
9782 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
9783 TYPE_NEXT_VARIANT (t
) = cand
;
9784 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
9789 /* Given an initializer INIT, return TRUE if INIT is zero or some
9790 aggregate of zeros. Otherwise return FALSE. */
9792 initializer_zerop (const_tree init
)
9798 switch (TREE_CODE (init
))
9801 return integer_zerop (init
);
9804 /* ??? Note that this is not correct for C4X float formats. There,
9805 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9806 negative exponent. */
9807 return real_zerop (init
)
9808 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9811 return fixed_zerop (init
);
9814 return integer_zerop (init
)
9815 || (real_zerop (init
)
9816 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9817 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9820 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
9821 if (!initializer_zerop (TREE_VALUE (elt
)))
9827 unsigned HOST_WIDE_INT idx
;
9829 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9830 if (!initializer_zerop (elt
))
9839 /* We need to loop through all elements to handle cases like
9840 "\0" and "\0foobar". */
9841 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9842 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9853 /* Build an empty statement at location LOC. */
9856 build_empty_stmt (location_t loc
)
9858 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9859 SET_EXPR_LOCATION (t
, loc
);
9864 /* Build an OpenMP clause with code CODE. LOC is the location of the
9868 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9873 length
= omp_clause_num_ops
[code
];
9874 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9876 record_node_allocation_statistics (OMP_CLAUSE
, size
);
9878 t
= ggc_alloc_tree_node (size
);
9879 memset (t
, 0, size
);
9880 TREE_SET_CODE (t
, OMP_CLAUSE
);
9881 OMP_CLAUSE_SET_CODE (t
, code
);
9882 OMP_CLAUSE_LOCATION (t
) = loc
;
9887 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9888 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9889 Except for the CODE and operand count field, other storage for the
9890 object is initialized to zeros. */
9893 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
9896 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
9898 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
9899 gcc_assert (len
>= 1);
9901 record_node_allocation_statistics (code
, length
);
9903 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
9905 TREE_SET_CODE (t
, code
);
9907 /* Can't use TREE_OPERAND to store the length because if checking is
9908 enabled, it will try to check the length before we store it. :-P */
9909 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
9914 /* Helper function for build_call_* functions; build a CALL_EXPR with
9915 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
9916 the argument slots. */
9919 build_call_1 (tree return_type
, tree fn
, int nargs
)
9923 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
9924 TREE_TYPE (t
) = return_type
;
9925 CALL_EXPR_FN (t
) = fn
;
9926 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
9931 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9932 FN and a null static chain slot. NARGS is the number of call arguments
9933 which are specified as "..." arguments. */
9936 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
9940 va_start (args
, nargs
);
9941 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
9946 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9947 FN and a null static chain slot. NARGS is the number of call arguments
9948 which are specified as a va_list ARGS. */
9951 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
9956 t
= build_call_1 (return_type
, fn
, nargs
);
9957 for (i
= 0; i
< nargs
; i
++)
9958 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
9959 process_call_operands (t
);
9963 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
9964 FN and a null static chain slot. NARGS is the number of call arguments
9965 which are specified as a tree array ARGS. */
9968 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
9969 int nargs
, const tree
*args
)
9974 t
= build_call_1 (return_type
, fn
, nargs
);
9975 for (i
= 0; i
< nargs
; i
++)
9976 CALL_EXPR_ARG (t
, i
) = args
[i
];
9977 process_call_operands (t
);
9978 SET_EXPR_LOCATION (t
, loc
);
9982 /* Like build_call_array, but takes a VEC. */
9985 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
9990 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
9991 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
9992 CALL_EXPR_ARG (ret
, ix
) = t
;
9993 process_call_operands (ret
);
9998 /* Returns true if it is possible to prove that the index of
9999 an array access REF (an ARRAY_REF expression) falls into the
10003 in_array_bounds_p (tree ref
)
10005 tree idx
= TREE_OPERAND (ref
, 1);
10008 if (TREE_CODE (idx
) != INTEGER_CST
)
10011 min
= array_ref_low_bound (ref
);
10012 max
= array_ref_up_bound (ref
);
10015 || TREE_CODE (min
) != INTEGER_CST
10016 || TREE_CODE (max
) != INTEGER_CST
)
10019 if (tree_int_cst_lt (idx
, min
)
10020 || tree_int_cst_lt (max
, idx
))
10026 /* Returns true if it is possible to prove that the range of
10027 an array access REF (an ARRAY_RANGE_REF expression) falls
10028 into the array bounds. */
10031 range_in_array_bounds_p (tree ref
)
10033 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10034 tree range_min
, range_max
, min
, max
;
10036 range_min
= TYPE_MIN_VALUE (domain_type
);
10037 range_max
= TYPE_MAX_VALUE (domain_type
);
10040 || TREE_CODE (range_min
) != INTEGER_CST
10041 || TREE_CODE (range_max
) != INTEGER_CST
)
10044 min
= array_ref_low_bound (ref
);
10045 max
= array_ref_up_bound (ref
);
10048 || TREE_CODE (min
) != INTEGER_CST
10049 || TREE_CODE (max
) != INTEGER_CST
)
10052 if (tree_int_cst_lt (range_min
, min
)
10053 || tree_int_cst_lt (max
, range_max
))
10059 /* Return true if T (assumed to be a DECL) must be assigned a memory
10063 needs_to_live_in_memory (const_tree t
)
10065 if (TREE_CODE (t
) == SSA_NAME
)
10066 t
= SSA_NAME_VAR (t
);
10068 return (TREE_ADDRESSABLE (t
)
10069 || is_global_var (t
)
10070 || (TREE_CODE (t
) == RESULT_DECL
10071 && !DECL_BY_REFERENCE (t
)
10072 && aggregate_value_p (t
, current_function_decl
)));
10075 /* Return value of a constant X and sign-extend it. */
10078 int_cst_value (const_tree x
)
10080 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10081 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10083 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10084 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10085 || TREE_INT_CST_HIGH (x
) == -1);
10087 if (bits
< HOST_BITS_PER_WIDE_INT
)
10089 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10091 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10093 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10099 /* Return value of a constant X and sign-extend it. */
10102 widest_int_cst_value (const_tree x
)
10104 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10105 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10107 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10108 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= 2 * HOST_BITS_PER_WIDE_INT
);
10109 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10110 << HOST_BITS_PER_WIDE_INT
);
10112 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10113 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10114 || TREE_INT_CST_HIGH (x
) == -1);
10117 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10119 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10121 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10123 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10129 /* If TYPE is an integral type, return an equivalent type which is
10130 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
10131 return TYPE itself. */
10134 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10137 if (POINTER_TYPE_P (type
))
10139 /* If the pointer points to the normal address space, use the
10140 size_type_node. Otherwise use an appropriate size for the pointer
10141 based on the named address space it points to. */
10142 if (!TYPE_ADDR_SPACE (TREE_TYPE (t
)))
10143 t
= size_type_node
;
10145 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
10148 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
10151 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
10154 /* Returns unsigned variant of TYPE. */
10157 unsigned_type_for (tree type
)
10159 return signed_or_unsigned_type_for (1, type
);
10162 /* Returns signed variant of TYPE. */
10165 signed_type_for (tree type
)
10167 return signed_or_unsigned_type_for (0, type
);
10170 /* Returns the largest value obtainable by casting something in INNER type to
10174 upper_bound_in_type (tree outer
, tree inner
)
10177 unsigned int det
= 0;
10178 unsigned oprec
= TYPE_PRECISION (outer
);
10179 unsigned iprec
= TYPE_PRECISION (inner
);
10182 /* Compute a unique number for every combination. */
10183 det
|= (oprec
> iprec
) ? 4 : 0;
10184 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10185 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10187 /* Determine the exponent to use. */
10192 /* oprec <= iprec, outer: signed, inner: don't care. */
10197 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10201 /* oprec > iprec, outer: signed, inner: signed. */
10205 /* oprec > iprec, outer: signed, inner: unsigned. */
10209 /* oprec > iprec, outer: unsigned, inner: signed. */
10213 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10217 gcc_unreachable ();
10220 /* Compute 2^^prec - 1. */
10221 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10224 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10225 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10229 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10230 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
10231 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10234 return double_int_to_tree (outer
, high
);
10237 /* Returns the smallest value obtainable by casting something in INNER type to
10241 lower_bound_in_type (tree outer
, tree inner
)
10244 unsigned oprec
= TYPE_PRECISION (outer
);
10245 unsigned iprec
= TYPE_PRECISION (inner
);
10247 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10249 if (TYPE_UNSIGNED (outer
)
10250 /* If we are widening something of an unsigned type, OUTER type
10251 contains all values of INNER type. In particular, both INNER
10252 and OUTER types have zero in common. */
10253 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10254 low
.low
= low
.high
= 0;
10257 /* If we are widening a signed type to another signed type, we
10258 want to obtain -2^^(iprec-1). If we are keeping the
10259 precision or narrowing to a signed type, we want to obtain
10261 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10263 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10265 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10266 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10270 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10271 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10276 return double_int_to_tree (outer
, low
);
10279 /* Return nonzero if two operands that are suitable for PHI nodes are
10280 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10281 SSA_NAME or invariant. Note that this is strictly an optimization.
10282 That is, callers of this function can directly call operand_equal_p
10283 and get the same result, only slower. */
10286 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10290 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10292 return operand_equal_p (arg0
, arg1
, 0);
10295 /* Returns number of zeros at the end of binary representation of X.
10297 ??? Use ffs if available? */
10300 num_ending_zeros (const_tree x
)
10302 unsigned HOST_WIDE_INT fr
, nfr
;
10303 unsigned num
, abits
;
10304 tree type
= TREE_TYPE (x
);
10306 if (TREE_INT_CST_LOW (x
) == 0)
10308 num
= HOST_BITS_PER_WIDE_INT
;
10309 fr
= TREE_INT_CST_HIGH (x
);
10314 fr
= TREE_INT_CST_LOW (x
);
10317 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10320 if (nfr
<< abits
== fr
)
10327 if (num
> TYPE_PRECISION (type
))
10328 num
= TYPE_PRECISION (type
);
10330 return build_int_cst_type (type
, num
);
10334 #define WALK_SUBTREE(NODE) \
10337 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10343 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10344 be walked whenever a type is seen in the tree. Rest of operands and return
10345 value are as for walk_tree. */
10348 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10349 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10351 tree result
= NULL_TREE
;
10353 switch (TREE_CODE (type
))
10356 case REFERENCE_TYPE
:
10357 /* We have to worry about mutually recursive pointers. These can't
10358 be written in C. They can in Ada. It's pathological, but
10359 there's an ACATS test (c38102a) that checks it. Deal with this
10360 by checking if we're pointing to another pointer, that one
10361 points to another pointer, that one does too, and we have no htab.
10362 If so, get a hash table. We check three levels deep to avoid
10363 the cost of the hash table if we don't need one. */
10364 if (POINTER_TYPE_P (TREE_TYPE (type
))
10365 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10366 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10369 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10377 /* ... fall through ... */
10380 WALK_SUBTREE (TREE_TYPE (type
));
10384 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10386 /* Fall through. */
10388 case FUNCTION_TYPE
:
10389 WALK_SUBTREE (TREE_TYPE (type
));
10393 /* We never want to walk into default arguments. */
10394 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10395 WALK_SUBTREE (TREE_VALUE (arg
));
10400 /* Don't follow this nodes's type if a pointer for fear that
10401 we'll have infinite recursion. If we have a PSET, then we
10404 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10405 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10406 WALK_SUBTREE (TREE_TYPE (type
));
10407 WALK_SUBTREE (TYPE_DOMAIN (type
));
10411 WALK_SUBTREE (TREE_TYPE (type
));
10412 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10422 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10423 called with the DATA and the address of each sub-tree. If FUNC returns a
10424 non-NULL value, the traversal is stopped, and the value returned by FUNC
10425 is returned. If PSET is non-NULL it is used to record the nodes visited,
10426 and to avoid visiting a node more than once. */
10429 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10430 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10432 enum tree_code code
;
10436 #define WALK_SUBTREE_TAIL(NODE) \
10440 goto tail_recurse; \
10445 /* Skip empty subtrees. */
10449 /* Don't walk the same tree twice, if the user has requested
10450 that we avoid doing so. */
10451 if (pset
&& pointer_set_insert (pset
, *tp
))
10454 /* Call the function. */
10456 result
= (*func
) (tp
, &walk_subtrees
, data
);
10458 /* If we found something, return it. */
10462 code
= TREE_CODE (*tp
);
10464 /* Even if we didn't, FUNC may have decided that there was nothing
10465 interesting below this point in the tree. */
10466 if (!walk_subtrees
)
10468 /* But we still need to check our siblings. */
10469 if (code
== TREE_LIST
)
10470 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10471 else if (code
== OMP_CLAUSE
)
10472 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10479 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10480 if (result
|| !walk_subtrees
)
10487 case IDENTIFIER_NODE
:
10494 case PLACEHOLDER_EXPR
:
10498 /* None of these have subtrees other than those already walked
10503 WALK_SUBTREE (TREE_VALUE (*tp
));
10504 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10509 int len
= TREE_VEC_LENGTH (*tp
);
10514 /* Walk all elements but the first. */
10516 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10518 /* Now walk the first one as a tail call. */
10519 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10523 WALK_SUBTREE (TREE_REALPART (*tp
));
10524 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10528 unsigned HOST_WIDE_INT idx
;
10529 constructor_elt
*ce
;
10532 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10534 WALK_SUBTREE (ce
->value
);
10539 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10544 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10546 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10547 into declarations that are just mentioned, rather than
10548 declared; they don't really belong to this part of the tree.
10549 And, we can see cycles: the initializer for a declaration
10550 can refer to the declaration itself. */
10551 WALK_SUBTREE (DECL_INITIAL (decl
));
10552 WALK_SUBTREE (DECL_SIZE (decl
));
10553 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10555 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10558 case STATEMENT_LIST
:
10560 tree_stmt_iterator i
;
10561 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10562 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10567 switch (OMP_CLAUSE_CODE (*tp
))
10569 case OMP_CLAUSE_PRIVATE
:
10570 case OMP_CLAUSE_SHARED
:
10571 case OMP_CLAUSE_FIRSTPRIVATE
:
10572 case OMP_CLAUSE_COPYIN
:
10573 case OMP_CLAUSE_COPYPRIVATE
:
10574 case OMP_CLAUSE_FINAL
:
10575 case OMP_CLAUSE_IF
:
10576 case OMP_CLAUSE_NUM_THREADS
:
10577 case OMP_CLAUSE_SCHEDULE
:
10578 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10581 case OMP_CLAUSE_NOWAIT
:
10582 case OMP_CLAUSE_ORDERED
:
10583 case OMP_CLAUSE_DEFAULT
:
10584 case OMP_CLAUSE_UNTIED
:
10585 case OMP_CLAUSE_MERGEABLE
:
10586 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10588 case OMP_CLAUSE_LASTPRIVATE
:
10589 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10590 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10591 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10593 case OMP_CLAUSE_COLLAPSE
:
10596 for (i
= 0; i
< 3; i
++)
10597 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10598 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10601 case OMP_CLAUSE_REDUCTION
:
10604 for (i
= 0; i
< 4; i
++)
10605 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10606 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10610 gcc_unreachable ();
10618 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10619 But, we only want to walk once. */
10620 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10621 for (i
= 0; i
< len
; ++i
)
10622 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10623 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10627 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10628 defining. We only want to walk into these fields of a type in this
10629 case and not in the general case of a mere reference to the type.
10631 The criterion is as follows: if the field can be an expression, it
10632 must be walked only here. This should be in keeping with the fields
10633 that are directly gimplified in gimplify_type_sizes in order for the
10634 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10635 variable-sized types.
10637 Note that DECLs get walked as part of processing the BIND_EXPR. */
10638 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10640 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10641 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10644 /* Call the function for the type. See if it returns anything or
10645 doesn't want us to continue. If we are to continue, walk both
10646 the normal fields and those for the declaration case. */
10647 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10648 if (result
|| !walk_subtrees
)
10651 /* But do not walk a pointed-to type since it may itself need to
10652 be walked in the declaration case if it isn't anonymous. */
10653 if (!POINTER_TYPE_P (*type_p
))
10655 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10660 /* If this is a record type, also walk the fields. */
10661 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10665 for (field
= TYPE_FIELDS (*type_p
); field
;
10666 field
= DECL_CHAIN (field
))
10668 /* We'd like to look at the type of the field, but we can
10669 easily get infinite recursion. So assume it's pointed
10670 to elsewhere in the tree. Also, ignore things that
10672 if (TREE_CODE (field
) != FIELD_DECL
)
10675 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10676 WALK_SUBTREE (DECL_SIZE (field
));
10677 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10678 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10679 WALK_SUBTREE (DECL_QUALIFIER (field
));
10683 /* Same for scalar types. */
10684 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10685 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10686 || TREE_CODE (*type_p
) == INTEGER_TYPE
10687 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10688 || TREE_CODE (*type_p
) == REAL_TYPE
)
10690 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10691 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10694 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10695 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10700 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10704 /* Walk over all the sub-trees of this operand. */
10705 len
= TREE_OPERAND_LENGTH (*tp
);
10707 /* Go through the subtrees. We need to do this in forward order so
10708 that the scope of a FOR_EXPR is handled properly. */
10711 for (i
= 0; i
< len
- 1; ++i
)
10712 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10713 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10716 /* If this is a type, walk the needed fields in the type. */
10717 else if (TYPE_P (*tp
))
10718 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10722 /* We didn't find what we were looking for. */
10725 #undef WALK_SUBTREE_TAIL
10727 #undef WALK_SUBTREE
10729 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10732 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10736 struct pointer_set_t
*pset
;
10738 pset
= pointer_set_create ();
10739 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10740 pointer_set_destroy (pset
);
10746 tree_block (tree t
)
10748 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10750 if (IS_EXPR_CODE_CLASS (c
))
10751 return &t
->exp
.block
;
10752 gcc_unreachable ();
10756 /* Create a nameless artificial label and put it in the current
10757 function context. The label has a location of LOC. Returns the
10758 newly created label. */
10761 create_artificial_label (location_t loc
)
10763 tree lab
= build_decl (loc
,
10764 LABEL_DECL
, NULL_TREE
, void_type_node
);
10766 DECL_ARTIFICIAL (lab
) = 1;
10767 DECL_IGNORED_P (lab
) = 1;
10768 DECL_CONTEXT (lab
) = current_function_decl
;
10772 /* Given a tree, try to return a useful variable name that we can use
10773 to prefix a temporary that is being assigned the value of the tree.
10774 I.E. given <temp> = &A, return A. */
10779 tree stripped_decl
;
10782 STRIP_NOPS (stripped_decl
);
10783 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10784 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10787 switch (TREE_CODE (stripped_decl
))
10790 return get_name (TREE_OPERAND (stripped_decl
, 0));
10797 /* Return true if TYPE has a variable argument list. */
10800 stdarg_p (const_tree fntype
)
10802 function_args_iterator args_iter
;
10803 tree n
= NULL_TREE
, t
;
10808 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10813 return n
!= NULL_TREE
&& n
!= void_type_node
;
10816 /* Return true if TYPE has a prototype. */
10819 prototype_p (tree fntype
)
10823 gcc_assert (fntype
!= NULL_TREE
);
10825 t
= TYPE_ARG_TYPES (fntype
);
10826 return (t
!= NULL_TREE
);
10829 /* If BLOCK is inlined from an __attribute__((__artificial__))
10830 routine, return pointer to location from where it has been
10833 block_nonartificial_location (tree block
)
10835 location_t
*ret
= NULL
;
10837 while (block
&& TREE_CODE (block
) == BLOCK
10838 && BLOCK_ABSTRACT_ORIGIN (block
))
10840 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10842 while (TREE_CODE (ao
) == BLOCK
10843 && BLOCK_ABSTRACT_ORIGIN (ao
)
10844 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10845 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10847 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10849 /* If AO is an artificial inline, point RET to the
10850 call site locus at which it has been inlined and continue
10851 the loop, in case AO's caller is also an artificial
10853 if (DECL_DECLARED_INLINE_P (ao
)
10854 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10855 ret
= &BLOCK_SOURCE_LOCATION (block
);
10859 else if (TREE_CODE (ao
) != BLOCK
)
10862 block
= BLOCK_SUPERCONTEXT (block
);
10868 /* If EXP is inlined from an __attribute__((__artificial__))
10869 function, return the location of the original call expression. */
10872 tree_nonartificial_location (tree exp
)
10874 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
10879 return EXPR_LOCATION (exp
);
10883 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
10886 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
10889 cl_option_hash_hash (const void *x
)
10891 const_tree
const t
= (const_tree
) x
;
10895 hashval_t hash
= 0;
10897 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
10899 p
= (const char *)TREE_OPTIMIZATION (t
);
10900 len
= sizeof (struct cl_optimization
);
10903 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
10905 p
= (const char *)TREE_TARGET_OPTION (t
);
10906 len
= sizeof (struct cl_target_option
);
10910 gcc_unreachable ();
10912 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
10914 for (i
= 0; i
< len
; i
++)
10916 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
10921 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
10922 TARGET_OPTION tree node) is the same as that given by *Y, which is the
10926 cl_option_hash_eq (const void *x
, const void *y
)
10928 const_tree
const xt
= (const_tree
) x
;
10929 const_tree
const yt
= (const_tree
) y
;
10934 if (TREE_CODE (xt
) != TREE_CODE (yt
))
10937 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
10939 xp
= (const char *)TREE_OPTIMIZATION (xt
);
10940 yp
= (const char *)TREE_OPTIMIZATION (yt
);
10941 len
= sizeof (struct cl_optimization
);
10944 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
10946 xp
= (const char *)TREE_TARGET_OPTION (xt
);
10947 yp
= (const char *)TREE_TARGET_OPTION (yt
);
10948 len
= sizeof (struct cl_target_option
);
10952 gcc_unreachable ();
10954 return (memcmp (xp
, yp
, len
) == 0);
10957 /* Build an OPTIMIZATION_NODE based on the current options. */
10960 build_optimization_node (void)
10965 /* Use the cache of optimization nodes. */
10967 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
10970 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
10974 /* Insert this one into the hash table. */
10975 t
= cl_optimization_node
;
10978 /* Make a new node for next time round. */
10979 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
10985 /* Build a TARGET_OPTION_NODE based on the current options. */
10988 build_target_option_node (void)
10993 /* Use the cache of optimization nodes. */
10995 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
10998 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11002 /* Insert this one into the hash table. */
11003 t
= cl_target_option_node
;
11006 /* Make a new node for next time round. */
11007 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11013 /* Determine the "ultimate origin" of a block. The block may be an inlined
11014 instance of an inlined instance of a block which is local to an inline
11015 function, so we have to trace all of the way back through the origin chain
11016 to find out what sort of node actually served as the original seed for the
11020 block_ultimate_origin (const_tree block
)
11022 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11024 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11025 nodes in the function to point to themselves; ignore that if
11026 we're trying to output the abstract instance of this function. */
11027 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11030 if (immediate_origin
== NULL_TREE
)
11035 tree lookahead
= immediate_origin
;
11039 ret_val
= lookahead
;
11040 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11041 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11043 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11045 /* The block's abstract origin chain may not be the *ultimate* origin of
11046 the block. It could lead to a DECL that has an abstract origin set.
11047 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11048 will give us if it has one). Note that DECL's abstract origins are
11049 supposed to be the most distant ancestor (or so decl_ultimate_origin
11050 claims), so we don't need to loop following the DECL origins. */
11051 if (DECL_P (ret_val
))
11052 return DECL_ORIGIN (ret_val
);
11058 /* Return true if T1 and T2 are equivalent lists. */
11061 list_equal_p (const_tree t1
, const_tree t2
)
11063 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11064 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11069 /* Return true iff conversion in EXP generates no instruction. Mark
11070 it inline so that we fully inline into the stripping functions even
11071 though we have two uses of this function. */
11074 tree_nop_conversion (const_tree exp
)
11076 tree outer_type
, inner_type
;
11078 if (!CONVERT_EXPR_P (exp
)
11079 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11081 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11084 outer_type
= TREE_TYPE (exp
);
11085 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11090 /* Use precision rather then machine mode when we can, which gives
11091 the correct answer even for submode (bit-field) types. */
11092 if ((INTEGRAL_TYPE_P (outer_type
)
11093 || POINTER_TYPE_P (outer_type
)
11094 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11095 && (INTEGRAL_TYPE_P (inner_type
)
11096 || POINTER_TYPE_P (inner_type
)
11097 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11098 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11100 /* Otherwise fall back on comparing machine modes (e.g. for
11101 aggregate types, floats). */
11102 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11105 /* Return true iff conversion in EXP generates no instruction. Don't
11106 consider conversions changing the signedness. */
11109 tree_sign_nop_conversion (const_tree exp
)
11111 tree outer_type
, inner_type
;
11113 if (!tree_nop_conversion (exp
))
11116 outer_type
= TREE_TYPE (exp
);
11117 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11119 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11120 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11123 /* Strip conversions from EXP according to tree_nop_conversion and
11124 return the resulting expression. */
11127 tree_strip_nop_conversions (tree exp
)
11129 while (tree_nop_conversion (exp
))
11130 exp
= TREE_OPERAND (exp
, 0);
11134 /* Strip conversions from EXP according to tree_sign_nop_conversion
11135 and return the resulting expression. */
11138 tree_strip_sign_nop_conversions (tree exp
)
11140 while (tree_sign_nop_conversion (exp
))
11141 exp
= TREE_OPERAND (exp
, 0);
11145 /* Strip out all handled components that produce invariant
11149 strip_invariant_refs (const_tree op
)
11151 while (handled_component_p (op
))
11153 switch (TREE_CODE (op
))
11156 case ARRAY_RANGE_REF
:
11157 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11158 || TREE_OPERAND (op
, 2) != NULL_TREE
11159 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11163 case COMPONENT_REF
:
11164 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11170 op
= TREE_OPERAND (op
, 0);
11176 static GTY(()) tree gcc_eh_personality_decl
;
11178 /* Return the GCC personality function decl. */
11181 lhd_gcc_personality (void)
11183 if (!gcc_eh_personality_decl
)
11184 gcc_eh_personality_decl
= build_personality_function ("gcc");
11185 return gcc_eh_personality_decl
;
11188 /* Try to find a base info of BINFO that would have its field decl at offset
11189 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11190 found, return, otherwise return NULL_TREE. */
11193 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11195 tree type
= BINFO_TYPE (binfo
);
11199 HOST_WIDE_INT pos
, size
;
11203 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11208 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11210 if (TREE_CODE (fld
) != FIELD_DECL
)
11213 pos
= int_bit_position (fld
);
11214 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11215 if (pos
<= offset
&& (pos
+ size
) > offset
)
11218 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11221 if (!DECL_ARTIFICIAL (fld
))
11223 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11227 /* Offset 0 indicates the primary base, whose vtable contents are
11228 represented in the binfo for the derived class. */
11229 else if (offset
!= 0)
11231 tree base_binfo
, found_binfo
= NULL_TREE
;
11232 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11233 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11235 found_binfo
= base_binfo
;
11240 binfo
= found_binfo
;
11243 type
= TREE_TYPE (fld
);
11248 /* Returns true if X is a typedef decl. */
11251 is_typedef_decl (tree x
)
11253 return (x
&& TREE_CODE (x
) == TYPE_DECL
11254 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11257 /* Returns true iff TYPE is a type variant created for a typedef. */
11260 typedef_variant_p (tree type
)
11262 return is_typedef_decl (TYPE_NAME (type
));
11265 /* Warn about a use of an identifier which was marked deprecated. */
11267 warn_deprecated_use (tree node
, tree attr
)
11271 if (node
== 0 || !warn_deprecated_decl
)
11277 attr
= DECL_ATTRIBUTES (node
);
11278 else if (TYPE_P (node
))
11280 tree decl
= TYPE_STUB_DECL (node
);
11282 attr
= lookup_attribute ("deprecated",
11283 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11288 attr
= lookup_attribute ("deprecated", attr
);
11291 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11297 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11299 warning (OPT_Wdeprecated_declarations
,
11300 "%qD is deprecated (declared at %s:%d): %s",
11301 node
, xloc
.file
, xloc
.line
, msg
);
11303 warning (OPT_Wdeprecated_declarations
,
11304 "%qD is deprecated (declared at %s:%d)",
11305 node
, xloc
.file
, xloc
.line
);
11307 else if (TYPE_P (node
))
11309 tree what
= NULL_TREE
;
11310 tree decl
= TYPE_STUB_DECL (node
);
11312 if (TYPE_NAME (node
))
11314 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11315 what
= TYPE_NAME (node
);
11316 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11317 && DECL_NAME (TYPE_NAME (node
)))
11318 what
= DECL_NAME (TYPE_NAME (node
));
11323 expanded_location xloc
11324 = expand_location (DECL_SOURCE_LOCATION (decl
));
11328 warning (OPT_Wdeprecated_declarations
,
11329 "%qE is deprecated (declared at %s:%d): %s",
11330 what
, xloc
.file
, xloc
.line
, msg
);
11332 warning (OPT_Wdeprecated_declarations
,
11333 "%qE is deprecated (declared at %s:%d)", what
,
11334 xloc
.file
, xloc
.line
);
11339 warning (OPT_Wdeprecated_declarations
,
11340 "type is deprecated (declared at %s:%d): %s",
11341 xloc
.file
, xloc
.line
, msg
);
11343 warning (OPT_Wdeprecated_declarations
,
11344 "type is deprecated (declared at %s:%d)",
11345 xloc
.file
, xloc
.line
);
11353 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11356 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11361 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11364 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11370 #include "gt-tree.h"