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, 2012 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"
41 #include "toplev.h" /* get_random_seed */
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"
65 /* Tree code classes. */
67 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
68 #define END_OF_BASE_TREE_CODES tcc_exceptional,
70 const enum tree_code_class tree_code_type
[] = {
71 #include "all-tree.def"
75 #undef END_OF_BASE_TREE_CODES
77 /* Table indexed by tree code giving number of expression
78 operands beyond the fixed part of the node structure.
79 Not used for types or decls. */
81 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
82 #define END_OF_BASE_TREE_CODES 0,
84 const unsigned char tree_code_length
[] = {
85 #include "all-tree.def"
89 #undef END_OF_BASE_TREE_CODES
91 /* Names of tree components.
92 Used for printing out the tree and error messages. */
93 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
94 #define END_OF_BASE_TREE_CODES "@dummy",
96 const char *const tree_code_name
[] = {
97 #include "all-tree.def"
101 #undef END_OF_BASE_TREE_CODES
103 /* Each tree code class has an associated string representation.
104 These must correspond to the tree_code_class entries. */
106 const char *const tree_code_class_strings
[] =
121 /* obstack.[ch] explicitly declined to prototype this. */
122 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
124 /* Statistics-gathering stuff. */
126 static int tree_code_counts
[MAX_TREE_CODES
];
127 int tree_node_counts
[(int) all_kinds
];
128 int tree_node_sizes
[(int) all_kinds
];
130 /* Keep in sync with tree.h:enum tree_node_kind. */
131 static const char * const tree_node_kind_names
[] = {
150 /* Unique id for next decl created. */
151 static GTY(()) int next_decl_uid
;
152 /* Unique id for next type created. */
153 static GTY(()) int next_type_uid
= 1;
154 /* Unique id for next debug decl created. Use negative numbers,
155 to catch erroneous uses. */
156 static GTY(()) int next_debug_decl_uid
;
158 /* Since we cannot rehash a type after it is in the table, we have to
159 keep the hash code. */
161 struct GTY(()) type_hash
{
166 /* Initial size of the hash table (rounded to next prime). */
167 #define TYPE_HASH_INITIAL_SIZE 1000
169 /* Now here is the hash table. When recording a type, it is added to
170 the slot whose index is the hash code. Note that the hash table is
171 used for several kinds of types (function types, array types and
172 array index range types, for now). While all these live in the
173 same table, they are completely independent, and the hash code is
174 computed differently for each of these. */
176 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
177 htab_t type_hash_table
;
179 /* Hash table and temporary node for larger integer const values. */
180 static GTY (()) tree int_cst_node
;
181 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
182 htab_t int_cst_hash_table
;
184 /* Hash table for optimization flags and target option flags. Use the same
185 hash table for both sets of options. Nodes for building the current
186 optimization and target option nodes. The assumption is most of the time
187 the options created will already be in the hash table, so we avoid
188 allocating and freeing up a node repeatably. */
189 static GTY (()) tree cl_optimization_node
;
190 static GTY (()) tree cl_target_option_node
;
191 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
192 htab_t cl_option_hash_table
;
194 /* General tree->tree mapping structure for use in hash tables. */
197 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
198 htab_t debug_expr_for_decl
;
200 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
201 htab_t value_expr_for_decl
;
203 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
204 htab_t debug_args_for_decl
;
206 static GTY ((if_marked ("tree_priority_map_marked_p"),
207 param_is (struct tree_priority_map
)))
208 htab_t init_priority_for_decl
;
210 static void set_type_quals (tree
, int);
211 static int type_hash_eq (const void *, const void *);
212 static hashval_t
type_hash_hash (const void *);
213 static hashval_t
int_cst_hash_hash (const void *);
214 static int int_cst_hash_eq (const void *, const void *);
215 static hashval_t
cl_option_hash_hash (const void *);
216 static int cl_option_hash_eq (const void *, const void *);
217 static void print_type_hash_statistics (void);
218 static void print_debug_expr_statistics (void);
219 static void print_value_expr_statistics (void);
220 static int type_hash_marked_p (const void *);
221 static unsigned int type_hash_list (const_tree
, hashval_t
);
222 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
224 tree global_trees
[TI_MAX
];
225 tree integer_types
[itk_none
];
227 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
229 /* Number of operands for each OpenMP clause. */
230 unsigned const char omp_clause_num_ops
[] =
232 0, /* OMP_CLAUSE_ERROR */
233 1, /* OMP_CLAUSE_PRIVATE */
234 1, /* OMP_CLAUSE_SHARED */
235 1, /* OMP_CLAUSE_FIRSTPRIVATE */
236 2, /* OMP_CLAUSE_LASTPRIVATE */
237 4, /* OMP_CLAUSE_REDUCTION */
238 1, /* OMP_CLAUSE_COPYIN */
239 1, /* OMP_CLAUSE_COPYPRIVATE */
240 1, /* OMP_CLAUSE_IF */
241 1, /* OMP_CLAUSE_NUM_THREADS */
242 1, /* OMP_CLAUSE_SCHEDULE */
243 0, /* OMP_CLAUSE_NOWAIT */
244 0, /* OMP_CLAUSE_ORDERED */
245 0, /* OMP_CLAUSE_DEFAULT */
246 3, /* OMP_CLAUSE_COLLAPSE */
247 0, /* OMP_CLAUSE_UNTIED */
248 1, /* OMP_CLAUSE_FINAL */
249 0 /* OMP_CLAUSE_MERGEABLE */
252 const char * const omp_clause_code_name
[] =
275 /* Return the tree node structure used by tree code CODE. */
277 static inline enum tree_node_structure_enum
278 tree_node_structure_for_code (enum tree_code code
)
280 switch (TREE_CODE_CLASS (code
))
282 case tcc_declaration
:
287 return TS_FIELD_DECL
;
293 return TS_LABEL_DECL
;
295 return TS_RESULT_DECL
;
296 case DEBUG_EXPR_DECL
:
299 return TS_CONST_DECL
;
303 return TS_FUNCTION_DECL
;
304 case TRANSLATION_UNIT_DECL
:
305 return TS_TRANSLATION_UNIT_DECL
;
307 return TS_DECL_NON_COMMON
;
311 return TS_TYPE_NON_COMMON
;
320 default: /* tcc_constant and tcc_exceptional */
325 /* tcc_constant cases. */
326 case INTEGER_CST
: return TS_INT_CST
;
327 case REAL_CST
: return TS_REAL_CST
;
328 case FIXED_CST
: return TS_FIXED_CST
;
329 case COMPLEX_CST
: return TS_COMPLEX
;
330 case VECTOR_CST
: return TS_VECTOR
;
331 case STRING_CST
: return TS_STRING
;
332 /* tcc_exceptional cases. */
333 case ERROR_MARK
: return TS_COMMON
;
334 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
335 case TREE_LIST
: return TS_LIST
;
336 case TREE_VEC
: return TS_VEC
;
337 case SSA_NAME
: return TS_SSA_NAME
;
338 case PLACEHOLDER_EXPR
: return TS_COMMON
;
339 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
340 case BLOCK
: return TS_BLOCK
;
341 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
342 case TREE_BINFO
: return TS_BINFO
;
343 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
344 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
345 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
353 /* Initialize tree_contains_struct to describe the hierarchy of tree
357 initialize_tree_contains_struct (void)
361 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
364 enum tree_node_structure_enum ts_code
;
366 code
= (enum tree_code
) i
;
367 ts_code
= tree_node_structure_for_code (code
);
369 /* Mark the TS structure itself. */
370 tree_contains_struct
[code
][ts_code
] = 1;
372 /* Mark all the structures that TS is derived from. */
390 case TS_STATEMENT_LIST
:
391 MARK_TS_TYPED (code
);
395 case TS_DECL_MINIMAL
:
401 case TS_OPTIMIZATION
:
402 case TS_TARGET_OPTION
:
403 MARK_TS_COMMON (code
);
406 case TS_TYPE_WITH_LANG_SPECIFIC
:
407 MARK_TS_TYPE_COMMON (code
);
410 case TS_TYPE_NON_COMMON
:
411 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
415 MARK_TS_DECL_MINIMAL (code
);
420 MARK_TS_DECL_COMMON (code
);
423 case TS_DECL_NON_COMMON
:
424 MARK_TS_DECL_WITH_VIS (code
);
427 case TS_DECL_WITH_VIS
:
431 MARK_TS_DECL_WRTL (code
);
435 MARK_TS_DECL_COMMON (code
);
439 MARK_TS_DECL_WITH_VIS (code
);
443 case TS_FUNCTION_DECL
:
444 MARK_TS_DECL_NON_COMMON (code
);
447 case TS_TRANSLATION_UNIT_DECL
:
448 MARK_TS_DECL_COMMON (code
);
456 /* Basic consistency checks for attributes used in fold. */
457 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
458 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
459 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
460 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
461 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
462 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
463 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
464 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
465 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
466 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
467 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
468 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
469 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
470 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
471 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
472 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
473 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
474 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
475 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
476 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
477 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
478 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
479 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
480 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
481 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
482 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
483 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
484 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
485 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
486 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
487 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
488 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
489 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
490 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
491 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
492 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
493 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
494 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
503 /* Initialize the hash table of types. */
504 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
507 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
508 tree_decl_map_eq
, 0);
510 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
511 tree_decl_map_eq
, 0);
512 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
513 tree_priority_map_eq
, 0);
515 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
516 int_cst_hash_eq
, NULL
);
518 int_cst_node
= make_node (INTEGER_CST
);
520 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
521 cl_option_hash_eq
, NULL
);
523 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
524 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
526 /* Initialize the tree_contains_struct array. */
527 initialize_tree_contains_struct ();
528 lang_hooks
.init_ts ();
532 /* The name of the object as the assembler will see it (but before any
533 translations made by ASM_OUTPUT_LABELREF). Often this is the same
534 as DECL_NAME. It is an IDENTIFIER_NODE. */
536 decl_assembler_name (tree decl
)
538 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
539 lang_hooks
.set_decl_assembler_name (decl
);
540 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
543 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
546 decl_assembler_name_equal (tree decl
, const_tree asmname
)
548 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
549 const char *decl_str
;
550 const char *asmname_str
;
553 if (decl_asmname
== asmname
)
556 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
557 asmname_str
= IDENTIFIER_POINTER (asmname
);
560 /* If the target assembler name was set by the user, things are trickier.
561 We have a leading '*' to begin with. After that, it's arguable what
562 is the correct thing to do with -fleading-underscore. Arguably, we've
563 historically been doing the wrong thing in assemble_alias by always
564 printing the leading underscore. Since we're not changing that, make
565 sure user_label_prefix follows the '*' before matching. */
566 if (decl_str
[0] == '*')
568 size_t ulp_len
= strlen (user_label_prefix
);
574 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
575 decl_str
+= ulp_len
, test
=true;
579 if (asmname_str
[0] == '*')
581 size_t ulp_len
= strlen (user_label_prefix
);
587 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
588 asmname_str
+= ulp_len
, test
=true;
595 return strcmp (decl_str
, asmname_str
) == 0;
598 /* Hash asmnames ignoring the user specified marks. */
601 decl_assembler_name_hash (const_tree asmname
)
603 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
605 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
606 size_t ulp_len
= strlen (user_label_prefix
);
610 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
613 return htab_hash_string (decl_str
);
616 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
619 /* Compute the number of bytes occupied by a tree with code CODE.
620 This function cannot be used for nodes that have variable sizes,
621 including TREE_VEC, STRING_CST, and CALL_EXPR. */
623 tree_code_size (enum tree_code code
)
625 switch (TREE_CODE_CLASS (code
))
627 case tcc_declaration
: /* A decl node */
632 return sizeof (struct tree_field_decl
);
634 return sizeof (struct tree_parm_decl
);
636 return sizeof (struct tree_var_decl
);
638 return sizeof (struct tree_label_decl
);
640 return sizeof (struct tree_result_decl
);
642 return sizeof (struct tree_const_decl
);
644 return sizeof (struct tree_type_decl
);
646 return sizeof (struct tree_function_decl
);
647 case DEBUG_EXPR_DECL
:
648 return sizeof (struct tree_decl_with_rtl
);
650 return sizeof (struct tree_decl_non_common
);
654 case tcc_type
: /* a type node */
655 return sizeof (struct tree_type_non_common
);
657 case tcc_reference
: /* a reference */
658 case tcc_expression
: /* an expression */
659 case tcc_statement
: /* an expression with side effects */
660 case tcc_comparison
: /* a comparison expression */
661 case tcc_unary
: /* a unary arithmetic expression */
662 case tcc_binary
: /* a binary arithmetic expression */
663 return (sizeof (struct tree_exp
)
664 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
666 case tcc_constant
: /* a constant */
669 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
670 case REAL_CST
: return sizeof (struct tree_real_cst
);
671 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
672 case COMPLEX_CST
: return sizeof (struct tree_complex
);
673 case VECTOR_CST
: return sizeof (struct tree_vector
);
674 case STRING_CST
: gcc_unreachable ();
676 return lang_hooks
.tree_size (code
);
679 case tcc_exceptional
: /* something random, like an identifier. */
682 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
683 case TREE_LIST
: return sizeof (struct tree_list
);
686 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
689 case OMP_CLAUSE
: gcc_unreachable ();
691 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
693 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
694 case BLOCK
: return sizeof (struct tree_block
);
695 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
696 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
697 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
700 return lang_hooks
.tree_size (code
);
708 /* Compute the number of bytes occupied by NODE. This routine only
709 looks at TREE_CODE, except for those nodes that have variable sizes. */
711 tree_size (const_tree node
)
713 const enum tree_code code
= TREE_CODE (node
);
717 return (offsetof (struct tree_binfo
, base_binfos
)
718 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
721 return (sizeof (struct tree_vec
)
722 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
725 return (sizeof (struct tree_vector
)
726 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
729 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
732 return (sizeof (struct tree_omp_clause
)
733 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
737 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
738 return (sizeof (struct tree_exp
)
739 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
741 return tree_code_size (code
);
745 /* Record interesting allocation statistics for a tree node with CODE
749 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
750 size_t length ATTRIBUTE_UNUSED
)
752 enum tree_code_class type
= TREE_CODE_CLASS (code
);
755 if (!GATHER_STATISTICS
)
760 case tcc_declaration
: /* A decl node */
764 case tcc_type
: /* a type node */
768 case tcc_statement
: /* an expression with side effects */
772 case tcc_reference
: /* a reference */
776 case tcc_expression
: /* an expression */
777 case tcc_comparison
: /* a comparison expression */
778 case tcc_unary
: /* a unary arithmetic expression */
779 case tcc_binary
: /* a binary arithmetic expression */
783 case tcc_constant
: /* a constant */
787 case tcc_exceptional
: /* something random, like an identifier. */
790 case IDENTIFIER_NODE
:
803 kind
= ssa_name_kind
;
815 kind
= omp_clause_kind
;
832 tree_code_counts
[(int) code
]++;
833 tree_node_counts
[(int) kind
]++;
834 tree_node_sizes
[(int) kind
] += length
;
837 /* Allocate and return a new UID from the DECL_UID namespace. */
840 allocate_decl_uid (void)
842 return next_decl_uid
++;
845 /* Return a newly allocated node of code CODE. For decl and type
846 nodes, some other fields are initialized. The rest of the node is
847 initialized to zero. This function cannot be used for TREE_VEC or
848 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
850 Achoo! I got a code in the node. */
853 make_node_stat (enum tree_code code MEM_STAT_DECL
)
856 enum tree_code_class type
= TREE_CODE_CLASS (code
);
857 size_t length
= tree_code_size (code
);
859 record_node_allocation_statistics (code
, length
);
861 t
= ggc_alloc_zone_cleared_tree_node_stat (
862 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
863 length PASS_MEM_STAT
);
864 TREE_SET_CODE (t
, code
);
869 TREE_SIDE_EFFECTS (t
) = 1;
872 case tcc_declaration
:
873 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
875 if (code
== FUNCTION_DECL
)
877 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
878 DECL_MODE (t
) = FUNCTION_MODE
;
883 DECL_SOURCE_LOCATION (t
) = input_location
;
884 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
885 DECL_UID (t
) = --next_debug_decl_uid
;
888 DECL_UID (t
) = allocate_decl_uid ();
889 SET_DECL_PT_UID (t
, -1);
891 if (TREE_CODE (t
) == LABEL_DECL
)
892 LABEL_DECL_UID (t
) = -1;
897 TYPE_UID (t
) = next_type_uid
++;
898 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
899 TYPE_USER_ALIGN (t
) = 0;
900 TYPE_MAIN_VARIANT (t
) = t
;
901 TYPE_CANONICAL (t
) = t
;
903 /* Default to no attributes for type, but let target change that. */
904 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
905 targetm
.set_default_type_attributes (t
);
907 /* We have not yet computed the alias set for this type. */
908 TYPE_ALIAS_SET (t
) = -1;
912 TREE_CONSTANT (t
) = 1;
921 case PREDECREMENT_EXPR
:
922 case PREINCREMENT_EXPR
:
923 case POSTDECREMENT_EXPR
:
924 case POSTINCREMENT_EXPR
:
925 /* All of these have side-effects, no matter what their
927 TREE_SIDE_EFFECTS (t
) = 1;
936 /* Other classes need no special treatment. */
943 /* Return a new node with the same contents as NODE except that its
944 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
947 copy_node_stat (tree node MEM_STAT_DECL
)
950 enum tree_code code
= TREE_CODE (node
);
953 gcc_assert (code
!= STATEMENT_LIST
);
955 length
= tree_size (node
);
956 record_node_allocation_statistics (code
, length
);
957 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
958 memcpy (t
, node
, length
);
960 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
962 TREE_ASM_WRITTEN (t
) = 0;
963 TREE_VISITED (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;
986 if (TREE_CODE (node
) == FUNCTION_DECL
)
987 DECL_STRUCT_FUNCTION (t
) = NULL
;
989 else if (TREE_CODE_CLASS (code
) == tcc_type
)
991 TYPE_UID (t
) = next_type_uid
++;
992 /* The following is so that the debug code for
993 the copy is different from the original type.
994 The two statements usually duplicate each other
995 (because they clear fields of the same union),
996 but the optimizer should catch that. */
997 TYPE_SYMTAB_POINTER (t
) = 0;
998 TYPE_SYMTAB_ADDRESS (t
) = 0;
1000 /* Do not copy the values cache. */
1001 if (TYPE_CACHED_VALUES_P(t
))
1003 TYPE_CACHED_VALUES_P (t
) = 0;
1004 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1011 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1012 For example, this can copy a list made of TREE_LIST nodes. */
1015 copy_list (tree list
)
1023 head
= prev
= copy_node (list
);
1024 next
= TREE_CHAIN (list
);
1027 TREE_CHAIN (prev
) = copy_node (next
);
1028 prev
= TREE_CHAIN (prev
);
1029 next
= TREE_CHAIN (next
);
1035 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1038 build_int_cst (tree type
, HOST_WIDE_INT low
)
1040 /* Support legacy code. */
1042 type
= integer_type_node
;
1044 return double_int_to_tree (type
, double_int::from_shwi (low
));
1047 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1050 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1054 return double_int_to_tree (type
, double_int::from_shwi (low
));
1057 /* Constructs tree in type TYPE from with value given by CST. Signedness
1058 of CST is assumed to be the same as the signedness of TYPE. */
1061 double_int_to_tree (tree type
, double_int cst
)
1063 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1065 cst
= cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1067 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1070 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1071 to be the same as the signedness of TYPE. */
1074 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1076 /* Size types *are* sign extended. */
1077 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1080 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1085 /* We force the double_int CST to the range of the type TYPE by sign or
1086 zero extending it. OVERFLOWABLE indicates if we are interested in
1087 overflow of the value, when >0 we are only interested in signed
1088 overflow, for <0 we are interested in any overflow. OVERFLOWED
1089 indicates whether overflow has already occurred. CONST_OVERFLOWED
1090 indicates whether constant overflow has already occurred. We force
1091 T's value to be within range of T's type (by setting to 0 or 1 all
1092 the bits outside the type's range). We set TREE_OVERFLOWED if,
1093 OVERFLOWED is nonzero,
1094 or OVERFLOWABLE is >0 and signed overflow occurs
1095 or OVERFLOWABLE is <0 and any overflow occurs
1096 We return a new tree node for the extended double_int. The node
1097 is shared if no overflow flags are set. */
1101 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1104 bool sign_extended_type
;
1106 /* Size types *are* sign extended. */
1107 sign_extended_type
= !TYPE_UNSIGNED (type
);
1109 /* If we need to set overflow flags, return a new unshared node. */
1110 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1114 || (overflowable
> 0 && sign_extended_type
))
1116 tree t
= make_node (INTEGER_CST
);
1117 TREE_INT_CST (t
) = cst
.ext (TYPE_PRECISION (type
),
1118 !sign_extended_type
);
1119 TREE_TYPE (t
) = type
;
1120 TREE_OVERFLOW (t
) = 1;
1125 /* Else build a shared node. */
1126 return double_int_to_tree (type
, cst
);
1129 /* These are the hash table functions for the hash table of INTEGER_CST
1130 nodes of a sizetype. */
1132 /* Return the hash code code X, an INTEGER_CST. */
1135 int_cst_hash_hash (const void *x
)
1137 const_tree
const t
= (const_tree
) x
;
1139 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1140 ^ htab_hash_pointer (TREE_TYPE (t
)));
1143 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1144 is the same as that given by *Y, which is the same. */
1147 int_cst_hash_eq (const void *x
, const void *y
)
1149 const_tree
const xt
= (const_tree
) x
;
1150 const_tree
const yt
= (const_tree
) y
;
1152 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1153 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1154 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1157 /* Create an INT_CST node of TYPE and value HI:LOW.
1158 The returned node is always shared. For small integers we use a
1159 per-type vector cache, for larger ones we use a single hash table. */
1162 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1170 switch (TREE_CODE (type
))
1173 gcc_assert (hi
== 0 && low
== 0);
1177 case REFERENCE_TYPE
:
1178 /* Cache NULL pointer. */
1187 /* Cache false or true. */
1195 if (TYPE_UNSIGNED (type
))
1198 limit
= INTEGER_SHARE_LIMIT
;
1199 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1205 limit
= INTEGER_SHARE_LIMIT
+ 1;
1206 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1208 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1222 /* Look for it in the type's vector of small shared ints. */
1223 if (!TYPE_CACHED_VALUES_P (type
))
1225 TYPE_CACHED_VALUES_P (type
) = 1;
1226 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1229 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1232 /* Make sure no one is clobbering the shared constant. */
1233 gcc_assert (TREE_TYPE (t
) == type
);
1234 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1235 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1239 /* Create a new shared int. */
1240 t
= make_node (INTEGER_CST
);
1242 TREE_INT_CST_LOW (t
) = low
;
1243 TREE_INT_CST_HIGH (t
) = hi
;
1244 TREE_TYPE (t
) = type
;
1246 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1251 /* Use the cache of larger shared ints. */
1254 TREE_INT_CST_LOW (int_cst_node
) = low
;
1255 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1256 TREE_TYPE (int_cst_node
) = type
;
1258 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1262 /* Insert this one into the hash table. */
1265 /* Make a new node for next time round. */
1266 int_cst_node
= make_node (INTEGER_CST
);
1273 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1274 and the rest are zeros. */
1277 build_low_bits_mask (tree type
, unsigned bits
)
1281 gcc_assert (bits
<= TYPE_PRECISION (type
));
1283 if (bits
== TYPE_PRECISION (type
)
1284 && !TYPE_UNSIGNED (type
))
1285 /* Sign extended all-ones mask. */
1286 mask
= double_int_minus_one
;
1288 mask
= double_int::mask (bits
);
1290 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1293 /* Checks that X is integer constant that can be expressed in (unsigned)
1294 HOST_WIDE_INT without loss of precision. */
1297 cst_and_fits_in_hwi (const_tree x
)
1299 if (TREE_CODE (x
) != INTEGER_CST
)
1302 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1305 return (TREE_INT_CST_HIGH (x
) == 0
1306 || TREE_INT_CST_HIGH (x
) == -1);
1309 /* Build a newly constructed TREE_VEC node of length LEN. */
1312 make_vector_stat (unsigned len MEM_STAT_DECL
)
1315 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1317 record_node_allocation_statistics (VECTOR_CST
, length
);
1319 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1321 TREE_SET_CODE (t
, VECTOR_CST
);
1322 TREE_CONSTANT (t
) = 1;
1327 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1328 are in a list pointed to by VALS. */
1331 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1335 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1336 TREE_TYPE (v
) = type
;
1338 /* Iterate through elements and check for overflow. */
1339 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1341 tree value
= vals
[cnt
];
1343 VECTOR_CST_ELT (v
, cnt
) = value
;
1345 /* Don't crash if we get an address constant. */
1346 if (!CONSTANT_CLASS_P (value
))
1349 over
|= TREE_OVERFLOW (value
);
1352 TREE_OVERFLOW (v
) = over
;
1356 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1357 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1360 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1362 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1363 unsigned HOST_WIDE_INT idx
;
1366 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1368 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1369 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1371 return build_vector (type
, vec
);
1374 /* Build a vector of type VECTYPE where all the elements are SCs. */
1376 build_vector_from_val (tree vectype
, tree sc
)
1378 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1380 if (sc
== error_mark_node
)
1383 /* Verify that the vector type is suitable for SC. Note that there
1384 is some inconsistency in the type-system with respect to restrict
1385 qualifications of pointers. Vector types always have a main-variant
1386 element type and the qualification is applied to the vector-type.
1387 So TREE_TYPE (vector-type) does not return a properly qualified
1388 vector element-type. */
1389 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1390 TREE_TYPE (vectype
)));
1392 if (CONSTANT_CLASS_P (sc
))
1394 tree
*v
= XALLOCAVEC (tree
, nunits
);
1395 for (i
= 0; i
< nunits
; ++i
)
1397 return build_vector (vectype
, v
);
1401 VEC(constructor_elt
, gc
) *v
= VEC_alloc (constructor_elt
, gc
, nunits
);
1402 for (i
= 0; i
< nunits
; ++i
)
1403 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1404 return build_constructor (vectype
, v
);
1408 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1409 are in the VEC pointed to by VALS. */
1411 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1413 tree c
= make_node (CONSTRUCTOR
);
1415 constructor_elt
*elt
;
1416 bool constant_p
= true;
1417 bool side_effects_p
= false;
1419 TREE_TYPE (c
) = type
;
1420 CONSTRUCTOR_ELTS (c
) = vals
;
1422 FOR_EACH_VEC_ELT (constructor_elt
, vals
, i
, elt
)
1424 /* Mostly ctors will have elts that don't have side-effects, so
1425 the usual case is to scan all the elements. Hence a single
1426 loop for both const and side effects, rather than one loop
1427 each (with early outs). */
1428 if (!TREE_CONSTANT (elt
->value
))
1430 if (TREE_SIDE_EFFECTS (elt
->value
))
1431 side_effects_p
= true;
1434 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1435 TREE_CONSTANT (c
) = constant_p
;
1440 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1443 build_constructor_single (tree type
, tree index
, tree value
)
1445 VEC(constructor_elt
,gc
) *v
;
1446 constructor_elt elt
= {index
, value
};
1448 v
= VEC_alloc (constructor_elt
, gc
, 1);
1449 VEC_quick_push (constructor_elt
, v
, elt
);
1451 return build_constructor (type
, v
);
1455 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1456 are in a list pointed to by VALS. */
1458 build_constructor_from_list (tree type
, tree vals
)
1461 VEC(constructor_elt
,gc
) *v
= NULL
;
1465 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1466 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1467 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1470 return build_constructor (type
, v
);
1473 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1476 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1479 FIXED_VALUE_TYPE
*fp
;
1481 v
= make_node (FIXED_CST
);
1482 fp
= ggc_alloc_fixed_value ();
1483 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1485 TREE_TYPE (v
) = type
;
1486 TREE_FIXED_CST_PTR (v
) = fp
;
1490 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1493 build_real (tree type
, REAL_VALUE_TYPE d
)
1496 REAL_VALUE_TYPE
*dp
;
1499 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1500 Consider doing it via real_convert now. */
1502 v
= make_node (REAL_CST
);
1503 dp
= ggc_alloc_real_value ();
1504 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1506 TREE_TYPE (v
) = type
;
1507 TREE_REAL_CST_PTR (v
) = dp
;
1508 TREE_OVERFLOW (v
) = overflow
;
1512 /* Return a new REAL_CST node whose type is TYPE
1513 and whose value is the integer value of the INTEGER_CST node I. */
1516 real_value_from_int_cst (const_tree type
, const_tree i
)
1520 /* Clear all bits of the real value type so that we can later do
1521 bitwise comparisons to see if two values are the same. */
1522 memset (&d
, 0, sizeof d
);
1524 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1525 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1526 TYPE_UNSIGNED (TREE_TYPE (i
)));
1530 /* Given a tree representing an integer constant I, return a tree
1531 representing the same value as a floating-point constant of type TYPE. */
1534 build_real_from_int_cst (tree type
, const_tree i
)
1537 int overflow
= TREE_OVERFLOW (i
);
1539 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1541 TREE_OVERFLOW (v
) |= overflow
;
1545 /* Return a newly constructed STRING_CST node whose value is
1546 the LEN characters at STR.
1547 Note that for a C string literal, LEN should include the trailing NUL.
1548 The TREE_TYPE is not initialized. */
1551 build_string (int len
, const char *str
)
1556 /* Do not waste bytes provided by padding of struct tree_string. */
1557 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1559 record_node_allocation_statistics (STRING_CST
, length
);
1561 s
= ggc_alloc_tree_node (length
);
1563 memset (s
, 0, sizeof (struct tree_typed
));
1564 TREE_SET_CODE (s
, STRING_CST
);
1565 TREE_CONSTANT (s
) = 1;
1566 TREE_STRING_LENGTH (s
) = len
;
1567 memcpy (s
->string
.str
, str
, len
);
1568 s
->string
.str
[len
] = '\0';
1573 /* Return a newly constructed COMPLEX_CST node whose value is
1574 specified by the real and imaginary parts REAL and IMAG.
1575 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1576 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1579 build_complex (tree type
, tree real
, tree imag
)
1581 tree t
= make_node (COMPLEX_CST
);
1583 TREE_REALPART (t
) = real
;
1584 TREE_IMAGPART (t
) = imag
;
1585 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1586 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1590 /* Return a constant of arithmetic type TYPE which is the
1591 multiplicative identity of the set TYPE. */
1594 build_one_cst (tree type
)
1596 switch (TREE_CODE (type
))
1598 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1599 case POINTER_TYPE
: case REFERENCE_TYPE
:
1601 return build_int_cst (type
, 1);
1604 return build_real (type
, dconst1
);
1606 case FIXED_POINT_TYPE
:
1607 /* We can only generate 1 for accum types. */
1608 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1609 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1613 tree scalar
= build_one_cst (TREE_TYPE (type
));
1615 return build_vector_from_val (type
, scalar
);
1619 return build_complex (type
,
1620 build_one_cst (TREE_TYPE (type
)),
1621 build_zero_cst (TREE_TYPE (type
)));
1628 /* Build 0 constant of type TYPE. This is used by constructor folding
1629 and thus the constant should be represented in memory by
1633 build_zero_cst (tree type
)
1635 switch (TREE_CODE (type
))
1637 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1638 case POINTER_TYPE
: case REFERENCE_TYPE
:
1639 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1640 return build_int_cst (type
, 0);
1643 return build_real (type
, dconst0
);
1645 case FIXED_POINT_TYPE
:
1646 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1650 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1652 return build_vector_from_val (type
, scalar
);
1657 tree zero
= build_zero_cst (TREE_TYPE (type
));
1659 return build_complex (type
, zero
, zero
);
1663 if (!AGGREGATE_TYPE_P (type
))
1664 return fold_convert (type
, integer_zero_node
);
1665 return build_constructor (type
, NULL
);
1670 /* Build a BINFO with LEN language slots. */
1673 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1676 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1677 + VEC_embedded_size (tree
, base_binfos
));
1679 record_node_allocation_statistics (TREE_BINFO
, length
);
1681 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1683 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1685 TREE_SET_CODE (t
, TREE_BINFO
);
1687 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1692 /* Create a CASE_LABEL_EXPR tree node and return it. */
1695 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1697 tree t
= make_node (CASE_LABEL_EXPR
);
1699 TREE_TYPE (t
) = void_type_node
;
1700 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1702 CASE_LOW (t
) = low_value
;
1703 CASE_HIGH (t
) = high_value
;
1704 CASE_LABEL (t
) = label_decl
;
1705 CASE_CHAIN (t
) = NULL_TREE
;
1710 /* Build a newly constructed TREE_VEC node of length LEN. */
1713 make_tree_vec_stat (int len MEM_STAT_DECL
)
1716 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1718 record_node_allocation_statistics (TREE_VEC
, length
);
1720 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1722 TREE_SET_CODE (t
, TREE_VEC
);
1723 TREE_VEC_LENGTH (t
) = len
;
1728 /* Return 1 if EXPR is the integer constant zero or a complex constant
1732 integer_zerop (const_tree expr
)
1736 switch (TREE_CODE (expr
))
1739 return (TREE_INT_CST_LOW (expr
) == 0
1740 && TREE_INT_CST_HIGH (expr
) == 0);
1742 return (integer_zerop (TREE_REALPART (expr
))
1743 && integer_zerop (TREE_IMAGPART (expr
)));
1747 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1748 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
1757 /* Return 1 if EXPR is the integer constant one or the corresponding
1758 complex constant. */
1761 integer_onep (const_tree expr
)
1765 switch (TREE_CODE (expr
))
1768 return (TREE_INT_CST_LOW (expr
) == 1
1769 && TREE_INT_CST_HIGH (expr
) == 0);
1771 return (integer_onep (TREE_REALPART (expr
))
1772 && integer_zerop (TREE_IMAGPART (expr
)));
1776 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1777 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
1786 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1787 it contains. Likewise for the corresponding complex constant. */
1790 integer_all_onesp (const_tree expr
)
1797 if (TREE_CODE (expr
) == COMPLEX_CST
1798 && integer_all_onesp (TREE_REALPART (expr
))
1799 && integer_zerop (TREE_IMAGPART (expr
)))
1802 else if (TREE_CODE (expr
) == VECTOR_CST
)
1805 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1806 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
1811 else if (TREE_CODE (expr
) != INTEGER_CST
)
1814 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1815 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1816 && TREE_INT_CST_HIGH (expr
) == -1)
1821 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1822 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1824 HOST_WIDE_INT high_value
;
1827 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1829 /* Can not handle precisions greater than twice the host int size. */
1830 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1831 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1832 /* Shifting by the host word size is undefined according to the ANSI
1833 standard, so we must handle this as a special case. */
1836 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1838 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1839 && TREE_INT_CST_HIGH (expr
) == high_value
);
1842 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1845 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1849 integer_pow2p (const_tree expr
)
1852 unsigned HOST_WIDE_INT high
, low
;
1856 if (TREE_CODE (expr
) == COMPLEX_CST
1857 && integer_pow2p (TREE_REALPART (expr
))
1858 && integer_zerop (TREE_IMAGPART (expr
)))
1861 if (TREE_CODE (expr
) != INTEGER_CST
)
1864 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1865 high
= TREE_INT_CST_HIGH (expr
);
1866 low
= TREE_INT_CST_LOW (expr
);
1868 /* First clear all bits that are beyond the type's precision in case
1869 we've been sign extended. */
1871 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1873 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1874 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1878 if (prec
< HOST_BITS_PER_WIDE_INT
)
1879 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1882 if (high
== 0 && low
== 0)
1885 return ((high
== 0 && (low
& (low
- 1)) == 0)
1886 || (low
== 0 && (high
& (high
- 1)) == 0));
1889 /* Return 1 if EXPR is an integer constant other than zero or a
1890 complex constant other than zero. */
1893 integer_nonzerop (const_tree expr
)
1897 return ((TREE_CODE (expr
) == INTEGER_CST
1898 && (TREE_INT_CST_LOW (expr
) != 0
1899 || TREE_INT_CST_HIGH (expr
) != 0))
1900 || (TREE_CODE (expr
) == COMPLEX_CST
1901 && (integer_nonzerop (TREE_REALPART (expr
))
1902 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1905 /* Return 1 if EXPR is the fixed-point constant zero. */
1908 fixed_zerop (const_tree expr
)
1910 return (TREE_CODE (expr
) == FIXED_CST
1911 && TREE_FIXED_CST (expr
).data
.is_zero ());
1914 /* Return the power of two represented by a tree node known to be a
1918 tree_log2 (const_tree expr
)
1921 HOST_WIDE_INT high
, low
;
1925 if (TREE_CODE (expr
) == COMPLEX_CST
)
1926 return tree_log2 (TREE_REALPART (expr
));
1928 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1929 high
= TREE_INT_CST_HIGH (expr
);
1930 low
= TREE_INT_CST_LOW (expr
);
1932 /* First clear all bits that are beyond the type's precision in case
1933 we've been sign extended. */
1935 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1937 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1938 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1942 if (prec
< HOST_BITS_PER_WIDE_INT
)
1943 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1946 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1947 : exact_log2 (low
));
1950 /* Similar, but return the largest integer Y such that 2 ** Y is less
1951 than or equal to EXPR. */
1954 tree_floor_log2 (const_tree expr
)
1957 HOST_WIDE_INT high
, low
;
1961 if (TREE_CODE (expr
) == COMPLEX_CST
)
1962 return tree_log2 (TREE_REALPART (expr
));
1964 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1965 high
= TREE_INT_CST_HIGH (expr
);
1966 low
= TREE_INT_CST_LOW (expr
);
1968 /* First clear all bits that are beyond the type's precision in case
1969 we've been sign extended. Ignore if type's precision hasn't been set
1970 since what we are doing is setting it. */
1972 if (prec
== HOST_BITS_PER_DOUBLE_INT
|| prec
== 0)
1974 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1975 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1979 if (prec
< HOST_BITS_PER_WIDE_INT
)
1980 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1983 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1984 : floor_log2 (low
));
1987 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1988 decimal float constants, so don't return 1 for them. */
1991 real_zerop (const_tree expr
)
1995 return ((TREE_CODE (expr
) == REAL_CST
1996 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
1997 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
1998 || (TREE_CODE (expr
) == COMPLEX_CST
1999 && real_zerop (TREE_REALPART (expr
))
2000 && real_zerop (TREE_IMAGPART (expr
))));
2003 /* Return 1 if EXPR is the real constant one in real or complex form.
2004 Trailing zeroes matter for decimal float constants, so don't return
2008 real_onep (const_tree expr
)
2012 return ((TREE_CODE (expr
) == REAL_CST
2013 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2014 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2015 || (TREE_CODE (expr
) == COMPLEX_CST
2016 && real_onep (TREE_REALPART (expr
))
2017 && real_zerop (TREE_IMAGPART (expr
))));
2020 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
2021 for decimal float constants, so don't return 1 for them. */
2024 real_twop (const_tree expr
)
2028 return ((TREE_CODE (expr
) == REAL_CST
2029 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
2030 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2031 || (TREE_CODE (expr
) == COMPLEX_CST
2032 && real_twop (TREE_REALPART (expr
))
2033 && real_zerop (TREE_IMAGPART (expr
))));
2036 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2037 matter for decimal float constants, so don't return 1 for them. */
2040 real_minus_onep (const_tree expr
)
2044 return ((TREE_CODE (expr
) == REAL_CST
2045 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2046 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2047 || (TREE_CODE (expr
) == COMPLEX_CST
2048 && real_minus_onep (TREE_REALPART (expr
))
2049 && real_zerop (TREE_IMAGPART (expr
))));
2052 /* Nonzero if EXP is a constant or a cast of a constant. */
2055 really_constant_p (const_tree exp
)
2057 /* This is not quite the same as STRIP_NOPS. It does more. */
2058 while (CONVERT_EXPR_P (exp
)
2059 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2060 exp
= TREE_OPERAND (exp
, 0);
2061 return TREE_CONSTANT (exp
);
2064 /* Return first list element whose TREE_VALUE is ELEM.
2065 Return 0 if ELEM is not in LIST. */
2068 value_member (tree elem
, tree list
)
2072 if (elem
== TREE_VALUE (list
))
2074 list
= TREE_CHAIN (list
);
2079 /* Return first list element whose TREE_PURPOSE is ELEM.
2080 Return 0 if ELEM is not in LIST. */
2083 purpose_member (const_tree elem
, tree list
)
2087 if (elem
== TREE_PURPOSE (list
))
2089 list
= TREE_CHAIN (list
);
2094 /* Return true if ELEM is in V. */
2097 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
2101 FOR_EACH_VEC_ELT (tree
, v
, ix
, t
)
2107 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2111 chain_index (int idx
, tree chain
)
2113 for (; chain
&& idx
> 0; --idx
)
2114 chain
= TREE_CHAIN (chain
);
2118 /* Return nonzero if ELEM is part of the chain CHAIN. */
2121 chain_member (const_tree elem
, const_tree chain
)
2127 chain
= DECL_CHAIN (chain
);
2133 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2134 We expect a null pointer to mark the end of the chain.
2135 This is the Lisp primitive `length'. */
2138 list_length (const_tree t
)
2141 #ifdef ENABLE_TREE_CHECKING
2149 #ifdef ENABLE_TREE_CHECKING
2152 gcc_assert (p
!= q
);
2160 /* Returns the number of FIELD_DECLs in TYPE. */
2163 fields_length (const_tree type
)
2165 tree t
= TYPE_FIELDS (type
);
2168 for (; t
; t
= DECL_CHAIN (t
))
2169 if (TREE_CODE (t
) == FIELD_DECL
)
2175 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2176 UNION_TYPE TYPE, or NULL_TREE if none. */
2179 first_field (const_tree type
)
2181 tree t
= TYPE_FIELDS (type
);
2182 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2187 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2188 by modifying the last node in chain 1 to point to chain 2.
2189 This is the Lisp primitive `nconc'. */
2192 chainon (tree op1
, tree op2
)
2201 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2203 TREE_CHAIN (t1
) = op2
;
2205 #ifdef ENABLE_TREE_CHECKING
2208 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2209 gcc_assert (t2
!= t1
);
2216 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2219 tree_last (tree chain
)
2223 while ((next
= TREE_CHAIN (chain
)))
2228 /* Reverse the order of elements in the chain T,
2229 and return the new head of the chain (old last element). */
2234 tree prev
= 0, decl
, next
;
2235 for (decl
= t
; decl
; decl
= next
)
2237 /* We shouldn't be using this function to reverse BLOCK chains; we
2238 have blocks_nreverse for that. */
2239 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2240 next
= TREE_CHAIN (decl
);
2241 TREE_CHAIN (decl
) = prev
;
2247 /* Return a newly created TREE_LIST node whose
2248 purpose and value fields are PARM and VALUE. */
2251 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2253 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2254 TREE_PURPOSE (t
) = parm
;
2255 TREE_VALUE (t
) = value
;
2259 /* Build a chain of TREE_LIST nodes from a vector. */
2262 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2264 tree ret
= NULL_TREE
;
2268 FOR_EACH_VEC_ELT (tree
, vec
, i
, t
)
2270 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2271 pp
= &TREE_CHAIN (*pp
);
2276 /* Return a newly created TREE_LIST node whose
2277 purpose and value fields are PURPOSE and VALUE
2278 and whose TREE_CHAIN is CHAIN. */
2281 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2285 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2287 memset (node
, 0, sizeof (struct tree_common
));
2289 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2291 TREE_SET_CODE (node
, TREE_LIST
);
2292 TREE_CHAIN (node
) = chain
;
2293 TREE_PURPOSE (node
) = purpose
;
2294 TREE_VALUE (node
) = value
;
2298 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2302 ctor_to_vec (tree ctor
)
2304 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2308 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2309 VEC_quick_push (tree
, vec
, val
);
2314 /* Return the size nominally occupied by an object of type TYPE
2315 when it resides in memory. The value is measured in units of bytes,
2316 and its data type is that normally used for type sizes
2317 (which is the first type created by make_signed_type or
2318 make_unsigned_type). */
2321 size_in_bytes (const_tree type
)
2325 if (type
== error_mark_node
)
2326 return integer_zero_node
;
2328 type
= TYPE_MAIN_VARIANT (type
);
2329 t
= TYPE_SIZE_UNIT (type
);
2333 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2334 return size_zero_node
;
2340 /* Return the size of TYPE (in bytes) as a wide integer
2341 or return -1 if the size can vary or is larger than an integer. */
2344 int_size_in_bytes (const_tree type
)
2348 if (type
== error_mark_node
)
2351 type
= TYPE_MAIN_VARIANT (type
);
2352 t
= TYPE_SIZE_UNIT (type
);
2354 || TREE_CODE (t
) != INTEGER_CST
2355 || TREE_INT_CST_HIGH (t
) != 0
2356 /* If the result would appear negative, it's too big to represent. */
2357 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2360 return TREE_INT_CST_LOW (t
);
2363 /* Return the maximum size of TYPE (in bytes) as a wide integer
2364 or return -1 if the size can vary or is larger than an integer. */
2367 max_int_size_in_bytes (const_tree type
)
2369 HOST_WIDE_INT size
= -1;
2372 /* If this is an array type, check for a possible MAX_SIZE attached. */
2374 if (TREE_CODE (type
) == ARRAY_TYPE
)
2376 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2378 if (size_tree
&& host_integerp (size_tree
, 1))
2379 size
= tree_low_cst (size_tree
, 1);
2382 /* If we still haven't been able to get a size, see if the language
2383 can compute a maximum size. */
2387 size_tree
= lang_hooks
.types
.max_size (type
);
2389 if (size_tree
&& host_integerp (size_tree
, 1))
2390 size
= tree_low_cst (size_tree
, 1);
2396 /* Returns a tree for the size of EXP in bytes. */
2399 tree_expr_size (const_tree exp
)
2402 && DECL_SIZE_UNIT (exp
) != 0)
2403 return DECL_SIZE_UNIT (exp
);
2405 return size_in_bytes (TREE_TYPE (exp
));
2408 /* Return the bit position of FIELD, in bits from the start of the record.
2409 This is a tree of type bitsizetype. */
2412 bit_position (const_tree field
)
2414 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2415 DECL_FIELD_BIT_OFFSET (field
));
2418 /* Likewise, but return as an integer. It must be representable in
2419 that way (since it could be a signed value, we don't have the
2420 option of returning -1 like int_size_in_byte can. */
2423 int_bit_position (const_tree field
)
2425 return tree_low_cst (bit_position (field
), 0);
2428 /* Return the byte position of FIELD, in bytes from the start of the record.
2429 This is a tree of type sizetype. */
2432 byte_position (const_tree field
)
2434 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2435 DECL_FIELD_BIT_OFFSET (field
));
2438 /* Likewise, but return as an integer. It must be representable in
2439 that way (since it could be a signed value, we don't have the
2440 option of returning -1 like int_size_in_byte can. */
2443 int_byte_position (const_tree field
)
2445 return tree_low_cst (byte_position (field
), 0);
2448 /* Return the strictest alignment, in bits, that T is known to have. */
2451 expr_align (const_tree t
)
2453 unsigned int align0
, align1
;
2455 switch (TREE_CODE (t
))
2457 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2458 /* If we have conversions, we know that the alignment of the
2459 object must meet each of the alignments of the types. */
2460 align0
= expr_align (TREE_OPERAND (t
, 0));
2461 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2462 return MAX (align0
, align1
);
2464 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2465 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2466 case CLEANUP_POINT_EXPR
:
2467 /* These don't change the alignment of an object. */
2468 return expr_align (TREE_OPERAND (t
, 0));
2471 /* The best we can do is say that the alignment is the least aligned
2473 align0
= expr_align (TREE_OPERAND (t
, 1));
2474 align1
= expr_align (TREE_OPERAND (t
, 2));
2475 return MIN (align0
, align1
);
2477 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2478 meaningfully, it's always 1. */
2479 case LABEL_DECL
: case CONST_DECL
:
2480 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2482 gcc_assert (DECL_ALIGN (t
) != 0);
2483 return DECL_ALIGN (t
);
2489 /* Otherwise take the alignment from that of the type. */
2490 return TYPE_ALIGN (TREE_TYPE (t
));
2493 /* Return, as a tree node, the number of elements for TYPE (which is an
2494 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2497 array_type_nelts (const_tree type
)
2499 tree index_type
, min
, max
;
2501 /* If they did it with unspecified bounds, then we should have already
2502 given an error about it before we got here. */
2503 if (! TYPE_DOMAIN (type
))
2504 return error_mark_node
;
2506 index_type
= TYPE_DOMAIN (type
);
2507 min
= TYPE_MIN_VALUE (index_type
);
2508 max
= TYPE_MAX_VALUE (index_type
);
2510 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2512 return error_mark_node
;
2514 return (integer_zerop (min
)
2516 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2519 /* If arg is static -- a reference to an object in static storage -- then
2520 return the object. This is not the same as the C meaning of `static'.
2521 If arg isn't static, return NULL. */
2526 switch (TREE_CODE (arg
))
2529 /* Nested functions are static, even though taking their address will
2530 involve a trampoline as we unnest the nested function and create
2531 the trampoline on the tree level. */
2535 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2536 && ! DECL_THREAD_LOCAL_P (arg
)
2537 && ! DECL_DLLIMPORT_P (arg
)
2541 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2545 return TREE_STATIC (arg
) ? arg
: NULL
;
2552 /* If the thing being referenced is not a field, then it is
2553 something language specific. */
2554 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2556 /* If we are referencing a bitfield, we can't evaluate an
2557 ADDR_EXPR at compile time and so it isn't a constant. */
2558 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2561 return staticp (TREE_OPERAND (arg
, 0));
2567 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2570 case ARRAY_RANGE_REF
:
2571 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2572 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2573 return staticp (TREE_OPERAND (arg
, 0));
2577 case COMPOUND_LITERAL_EXPR
:
2578 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2588 /* Return whether OP is a DECL whose address is function-invariant. */
2591 decl_address_invariant_p (const_tree op
)
2593 /* The conditions below are slightly less strict than the one in
2596 switch (TREE_CODE (op
))
2605 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2606 || DECL_THREAD_LOCAL_P (op
)
2607 || DECL_CONTEXT (op
) == current_function_decl
2608 || decl_function_context (op
) == current_function_decl
)
2613 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2614 || decl_function_context (op
) == current_function_decl
)
2625 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2628 decl_address_ip_invariant_p (const_tree op
)
2630 /* The conditions below are slightly less strict than the one in
2633 switch (TREE_CODE (op
))
2641 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2642 && !DECL_DLLIMPORT_P (op
))
2643 || DECL_THREAD_LOCAL_P (op
))
2648 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2660 /* Return true if T is function-invariant (internal function, does
2661 not handle arithmetic; that's handled in skip_simple_arithmetic and
2662 tree_invariant_p). */
2664 static bool tree_invariant_p (tree t
);
2667 tree_invariant_p_1 (tree t
)
2671 if (TREE_CONSTANT (t
)
2672 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2675 switch (TREE_CODE (t
))
2681 op
= TREE_OPERAND (t
, 0);
2682 while (handled_component_p (op
))
2684 switch (TREE_CODE (op
))
2687 case ARRAY_RANGE_REF
:
2688 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2689 || TREE_OPERAND (op
, 2) != NULL_TREE
2690 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2695 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2701 op
= TREE_OPERAND (op
, 0);
2704 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2713 /* Return true if T is function-invariant. */
2716 tree_invariant_p (tree t
)
2718 tree inner
= skip_simple_arithmetic (t
);
2719 return tree_invariant_p_1 (inner
);
2722 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2723 Do this to any expression which may be used in more than one place,
2724 but must be evaluated only once.
2726 Normally, expand_expr would reevaluate the expression each time.
2727 Calling save_expr produces something that is evaluated and recorded
2728 the first time expand_expr is called on it. Subsequent calls to
2729 expand_expr just reuse the recorded value.
2731 The call to expand_expr that generates code that actually computes
2732 the value is the first call *at compile time*. Subsequent calls
2733 *at compile time* generate code to use the saved value.
2734 This produces correct result provided that *at run time* control
2735 always flows through the insns made by the first expand_expr
2736 before reaching the other places where the save_expr was evaluated.
2737 You, the caller of save_expr, must make sure this is so.
2739 Constants, and certain read-only nodes, are returned with no
2740 SAVE_EXPR because that is safe. Expressions containing placeholders
2741 are not touched; see tree.def for an explanation of what these
2745 save_expr (tree expr
)
2747 tree t
= fold (expr
);
2750 /* If the tree evaluates to a constant, then we don't want to hide that
2751 fact (i.e. this allows further folding, and direct checks for constants).
2752 However, a read-only object that has side effects cannot be bypassed.
2753 Since it is no problem to reevaluate literals, we just return the
2755 inner
= skip_simple_arithmetic (t
);
2756 if (TREE_CODE (inner
) == ERROR_MARK
)
2759 if (tree_invariant_p_1 (inner
))
2762 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2763 it means that the size or offset of some field of an object depends on
2764 the value within another field.
2766 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2767 and some variable since it would then need to be both evaluated once and
2768 evaluated more than once. Front-ends must assure this case cannot
2769 happen by surrounding any such subexpressions in their own SAVE_EXPR
2770 and forcing evaluation at the proper time. */
2771 if (contains_placeholder_p (inner
))
2774 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2775 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2777 /* This expression might be placed ahead of a jump to ensure that the
2778 value was computed on both sides of the jump. So make sure it isn't
2779 eliminated as dead. */
2780 TREE_SIDE_EFFECTS (t
) = 1;
2784 /* Look inside EXPR and into any simple arithmetic operations. Return
2785 the innermost non-arithmetic node. */
2788 skip_simple_arithmetic (tree expr
)
2792 /* We don't care about whether this can be used as an lvalue in this
2794 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2795 expr
= TREE_OPERAND (expr
, 0);
2797 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2798 a constant, it will be more efficient to not make another SAVE_EXPR since
2799 it will allow better simplification and GCSE will be able to merge the
2800 computations if they actually occur. */
2804 if (UNARY_CLASS_P (inner
))
2805 inner
= TREE_OPERAND (inner
, 0);
2806 else if (BINARY_CLASS_P (inner
))
2808 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2809 inner
= TREE_OPERAND (inner
, 0);
2810 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2811 inner
= TREE_OPERAND (inner
, 1);
2823 /* Return which tree structure is used by T. */
2825 enum tree_node_structure_enum
2826 tree_node_structure (const_tree t
)
2828 const enum tree_code code
= TREE_CODE (t
);
2829 return tree_node_structure_for_code (code
);
2832 /* Set various status flags when building a CALL_EXPR object T. */
2835 process_call_operands (tree t
)
2837 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2838 bool read_only
= false;
2839 int i
= call_expr_flags (t
);
2841 /* Calls have side-effects, except those to const or pure functions. */
2842 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2843 side_effects
= true;
2844 /* Propagate TREE_READONLY of arguments for const functions. */
2848 if (!side_effects
|| read_only
)
2849 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2851 tree op
= TREE_OPERAND (t
, i
);
2852 if (op
&& TREE_SIDE_EFFECTS (op
))
2853 side_effects
= true;
2854 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2858 TREE_SIDE_EFFECTS (t
) = side_effects
;
2859 TREE_READONLY (t
) = read_only
;
2862 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2863 size or offset that depends on a field within a record. */
2866 contains_placeholder_p (const_tree exp
)
2868 enum tree_code code
;
2873 code
= TREE_CODE (exp
);
2874 if (code
== PLACEHOLDER_EXPR
)
2877 switch (TREE_CODE_CLASS (code
))
2880 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2881 position computations since they will be converted into a
2882 WITH_RECORD_EXPR involving the reference, which will assume
2883 here will be valid. */
2884 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2886 case tcc_exceptional
:
2887 if (code
== TREE_LIST
)
2888 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2889 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2894 case tcc_comparison
:
2895 case tcc_expression
:
2899 /* Ignoring the first operand isn't quite right, but works best. */
2900 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2903 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2904 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2905 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2908 /* The save_expr function never wraps anything containing
2909 a PLACEHOLDER_EXPR. */
2916 switch (TREE_CODE_LENGTH (code
))
2919 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2921 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2922 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2933 const_call_expr_arg_iterator iter
;
2934 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2935 if (CONTAINS_PLACEHOLDER_P (arg
))
2949 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2950 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2954 type_contains_placeholder_1 (const_tree type
)
2956 /* If the size contains a placeholder or the parent type (component type in
2957 the case of arrays) type involves a placeholder, this type does. */
2958 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2959 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2960 || (!POINTER_TYPE_P (type
)
2962 && type_contains_placeholder_p (TREE_TYPE (type
))))
2965 /* Now do type-specific checks. Note that the last part of the check above
2966 greatly limits what we have to do below. */
2967 switch (TREE_CODE (type
))
2975 case REFERENCE_TYPE
:
2984 case FIXED_POINT_TYPE
:
2985 /* Here we just check the bounds. */
2986 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2987 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2990 /* We have already checked the component type above, so just check the
2992 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2996 case QUAL_UNION_TYPE
:
3000 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3001 if (TREE_CODE (field
) == FIELD_DECL
3002 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3003 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3004 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3005 || type_contains_placeholder_p (TREE_TYPE (field
))))
3016 /* Wrapper around above function used to cache its result. */
3019 type_contains_placeholder_p (tree type
)
3023 /* If the contains_placeholder_bits field has been initialized,
3024 then we know the answer. */
3025 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3026 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3028 /* Indicate that we've seen this type node, and the answer is false.
3029 This is what we want to return if we run into recursion via fields. */
3030 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3032 /* Compute the real value. */
3033 result
= type_contains_placeholder_1 (type
);
3035 /* Store the real value. */
3036 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3041 /* Push tree EXP onto vector QUEUE if it is not already present. */
3044 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
3049 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
3050 if (simple_cst_equal (iter
, exp
) == 1)
3054 VEC_safe_push (tree
, heap
, *queue
, exp
);
3057 /* Given a tree EXP, find all occurrences of references to fields
3058 in a PLACEHOLDER_EXPR and place them in vector REFS without
3059 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3060 we assume here that EXP contains only arithmetic expressions
3061 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3065 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3067 enum tree_code code
= TREE_CODE (exp
);
3071 /* We handle TREE_LIST and COMPONENT_REF separately. */
3072 if (code
== TREE_LIST
)
3074 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3075 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3077 else if (code
== COMPONENT_REF
)
3079 for (inner
= TREE_OPERAND (exp
, 0);
3080 REFERENCE_CLASS_P (inner
);
3081 inner
= TREE_OPERAND (inner
, 0))
3084 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3085 push_without_duplicates (exp
, refs
);
3087 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3090 switch (TREE_CODE_CLASS (code
))
3095 case tcc_declaration
:
3096 /* Variables allocated to static storage can stay. */
3097 if (!TREE_STATIC (exp
))
3098 push_without_duplicates (exp
, refs
);
3101 case tcc_expression
:
3102 /* This is the pattern built in ada/make_aligning_type. */
3103 if (code
== ADDR_EXPR
3104 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3106 push_without_duplicates (exp
, refs
);
3110 /* Fall through... */
3112 case tcc_exceptional
:
3115 case tcc_comparison
:
3117 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3118 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3122 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3123 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3131 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3132 return a tree with all occurrences of references to F in a
3133 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3134 CONST_DECLs. Note that we assume here that EXP contains only
3135 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3136 occurring only in their argument list. */
3139 substitute_in_expr (tree exp
, tree f
, tree r
)
3141 enum tree_code code
= TREE_CODE (exp
);
3142 tree op0
, op1
, op2
, op3
;
3145 /* We handle TREE_LIST and COMPONENT_REF separately. */
3146 if (code
== TREE_LIST
)
3148 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3149 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3150 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3153 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3155 else if (code
== COMPONENT_REF
)
3159 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3160 and it is the right field, replace it with R. */
3161 for (inner
= TREE_OPERAND (exp
, 0);
3162 REFERENCE_CLASS_P (inner
);
3163 inner
= TREE_OPERAND (inner
, 0))
3167 op1
= TREE_OPERAND (exp
, 1);
3169 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3172 /* If this expression hasn't been completed let, leave it alone. */
3173 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3176 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3177 if (op0
== TREE_OPERAND (exp
, 0))
3181 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3184 switch (TREE_CODE_CLASS (code
))
3189 case tcc_declaration
:
3195 case tcc_expression
:
3199 /* Fall through... */
3201 case tcc_exceptional
:
3204 case tcc_comparison
:
3206 switch (TREE_CODE_LENGTH (code
))
3212 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3213 if (op0
== TREE_OPERAND (exp
, 0))
3216 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3220 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3221 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3223 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3226 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3230 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3231 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3232 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3234 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3235 && op2
== TREE_OPERAND (exp
, 2))
3238 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3242 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3243 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3244 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3245 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3247 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3248 && op2
== TREE_OPERAND (exp
, 2)
3249 && op3
== TREE_OPERAND (exp
, 3))
3253 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3265 new_tree
= NULL_TREE
;
3267 /* If we are trying to replace F with a constant, inline back
3268 functions which do nothing else than computing a value from
3269 the arguments they are passed. This makes it possible to
3270 fold partially or entirely the replacement expression. */
3271 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3273 tree t
= maybe_inline_call_in_expr (exp
);
3275 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3278 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3280 tree op
= TREE_OPERAND (exp
, i
);
3281 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3285 new_tree
= copy_node (exp
);
3286 TREE_OPERAND (new_tree
, i
) = new_op
;
3292 new_tree
= fold (new_tree
);
3293 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3294 process_call_operands (new_tree
);
3305 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3307 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3308 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3313 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3314 for it within OBJ, a tree that is an object or a chain of references. */
3317 substitute_placeholder_in_expr (tree exp
, tree obj
)
3319 enum tree_code code
= TREE_CODE (exp
);
3320 tree op0
, op1
, op2
, op3
;
3323 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3324 in the chain of OBJ. */
3325 if (code
== PLACEHOLDER_EXPR
)
3327 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3330 for (elt
= obj
; elt
!= 0;
3331 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3332 || TREE_CODE (elt
) == COND_EXPR
)
3333 ? TREE_OPERAND (elt
, 1)
3334 : (REFERENCE_CLASS_P (elt
)
3335 || UNARY_CLASS_P (elt
)
3336 || BINARY_CLASS_P (elt
)
3337 || VL_EXP_CLASS_P (elt
)
3338 || EXPRESSION_CLASS_P (elt
))
3339 ? TREE_OPERAND (elt
, 0) : 0))
3340 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3343 for (elt
= obj
; elt
!= 0;
3344 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3345 || TREE_CODE (elt
) == COND_EXPR
)
3346 ? TREE_OPERAND (elt
, 1)
3347 : (REFERENCE_CLASS_P (elt
)
3348 || UNARY_CLASS_P (elt
)
3349 || BINARY_CLASS_P (elt
)
3350 || VL_EXP_CLASS_P (elt
)
3351 || EXPRESSION_CLASS_P (elt
))
3352 ? TREE_OPERAND (elt
, 0) : 0))
3353 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3354 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3356 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3358 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3359 survives until RTL generation, there will be an error. */
3363 /* TREE_LIST is special because we need to look at TREE_VALUE
3364 and TREE_CHAIN, not TREE_OPERANDS. */
3365 else if (code
== TREE_LIST
)
3367 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3368 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3369 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3372 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3375 switch (TREE_CODE_CLASS (code
))
3378 case tcc_declaration
:
3381 case tcc_exceptional
:
3384 case tcc_comparison
:
3385 case tcc_expression
:
3388 switch (TREE_CODE_LENGTH (code
))
3394 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3395 if (op0
== TREE_OPERAND (exp
, 0))
3398 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3402 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3403 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3405 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3408 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3412 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3413 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3414 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3416 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3417 && op2
== TREE_OPERAND (exp
, 2))
3420 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3424 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3425 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3426 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3427 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3429 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3430 && op2
== TREE_OPERAND (exp
, 2)
3431 && op3
== TREE_OPERAND (exp
, 3))
3435 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3447 new_tree
= NULL_TREE
;
3449 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3451 tree op
= TREE_OPERAND (exp
, i
);
3452 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3456 new_tree
= copy_node (exp
);
3457 TREE_OPERAND (new_tree
, i
) = new_op
;
3463 new_tree
= fold (new_tree
);
3464 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3465 process_call_operands (new_tree
);
3476 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3478 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3479 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3484 /* Stabilize a reference so that we can use it any number of times
3485 without causing its operands to be evaluated more than once.
3486 Returns the stabilized reference. This works by means of save_expr,
3487 so see the caveats in the comments about save_expr.
3489 Also allows conversion expressions whose operands are references.
3490 Any other kind of expression is returned unchanged. */
3493 stabilize_reference (tree ref
)
3496 enum tree_code code
= TREE_CODE (ref
);
3503 /* No action is needed in this case. */
3508 case FIX_TRUNC_EXPR
:
3509 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3513 result
= build_nt (INDIRECT_REF
,
3514 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3518 result
= build_nt (COMPONENT_REF
,
3519 stabilize_reference (TREE_OPERAND (ref
, 0)),
3520 TREE_OPERAND (ref
, 1), NULL_TREE
);
3524 result
= build_nt (BIT_FIELD_REF
,
3525 stabilize_reference (TREE_OPERAND (ref
, 0)),
3526 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3530 result
= build_nt (ARRAY_REF
,
3531 stabilize_reference (TREE_OPERAND (ref
, 0)),
3532 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3533 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3536 case ARRAY_RANGE_REF
:
3537 result
= build_nt (ARRAY_RANGE_REF
,
3538 stabilize_reference (TREE_OPERAND (ref
, 0)),
3539 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3540 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3544 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3545 it wouldn't be ignored. This matters when dealing with
3547 return stabilize_reference_1 (ref
);
3549 /* If arg isn't a kind of lvalue we recognize, make no change.
3550 Caller should recognize the error for an invalid lvalue. */
3555 return error_mark_node
;
3558 TREE_TYPE (result
) = TREE_TYPE (ref
);
3559 TREE_READONLY (result
) = TREE_READONLY (ref
);
3560 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3561 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3566 /* Subroutine of stabilize_reference; this is called for subtrees of
3567 references. Any expression with side-effects must be put in a SAVE_EXPR
3568 to ensure that it is only evaluated once.
3570 We don't put SAVE_EXPR nodes around everything, because assigning very
3571 simple expressions to temporaries causes us to miss good opportunities
3572 for optimizations. Among other things, the opportunity to fold in the
3573 addition of a constant into an addressing mode often gets lost, e.g.
3574 "y[i+1] += x;". In general, we take the approach that we should not make
3575 an assignment unless we are forced into it - i.e., that any non-side effect
3576 operator should be allowed, and that cse should take care of coalescing
3577 multiple utterances of the same expression should that prove fruitful. */
3580 stabilize_reference_1 (tree e
)
3583 enum tree_code code
= TREE_CODE (e
);
3585 /* We cannot ignore const expressions because it might be a reference
3586 to a const array but whose index contains side-effects. But we can
3587 ignore things that are actual constant or that already have been
3588 handled by this function. */
3590 if (tree_invariant_p (e
))
3593 switch (TREE_CODE_CLASS (code
))
3595 case tcc_exceptional
:
3597 case tcc_declaration
:
3598 case tcc_comparison
:
3600 case tcc_expression
:
3603 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3604 so that it will only be evaluated once. */
3605 /* The reference (r) and comparison (<) classes could be handled as
3606 below, but it is generally faster to only evaluate them once. */
3607 if (TREE_SIDE_EFFECTS (e
))
3608 return save_expr (e
);
3612 /* Constants need no processing. In fact, we should never reach
3617 /* Division is slow and tends to be compiled with jumps,
3618 especially the division by powers of 2 that is often
3619 found inside of an array reference. So do it just once. */
3620 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3621 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3622 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3623 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3624 return save_expr (e
);
3625 /* Recursively stabilize each operand. */
3626 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3627 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3631 /* Recursively stabilize each operand. */
3632 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3639 TREE_TYPE (result
) = TREE_TYPE (e
);
3640 TREE_READONLY (result
) = TREE_READONLY (e
);
3641 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3642 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3647 /* Low-level constructors for expressions. */
3649 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3650 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3653 recompute_tree_invariant_for_addr_expr (tree t
)
3656 bool tc
= true, se
= false;
3658 /* We started out assuming this address is both invariant and constant, but
3659 does not have side effects. Now go down any handled components and see if
3660 any of them involve offsets that are either non-constant or non-invariant.
3661 Also check for side-effects.
3663 ??? Note that this code makes no attempt to deal with the case where
3664 taking the address of something causes a copy due to misalignment. */
3666 #define UPDATE_FLAGS(NODE) \
3667 do { tree _node = (NODE); \
3668 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3669 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3671 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3672 node
= TREE_OPERAND (node
, 0))
3674 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3675 array reference (probably made temporarily by the G++ front end),
3676 so ignore all the operands. */
3677 if ((TREE_CODE (node
) == ARRAY_REF
3678 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3679 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3681 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3682 if (TREE_OPERAND (node
, 2))
3683 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3684 if (TREE_OPERAND (node
, 3))
3685 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3687 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3688 FIELD_DECL, apparently. The G++ front end can put something else
3689 there, at least temporarily. */
3690 else if (TREE_CODE (node
) == COMPONENT_REF
3691 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3693 if (TREE_OPERAND (node
, 2))
3694 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3698 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3700 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3701 the address, since &(*a)->b is a form of addition. If it's a constant, the
3702 address is constant too. If it's a decl, its address is constant if the
3703 decl is static. Everything else is not constant and, furthermore,
3704 taking the address of a volatile variable is not volatile. */
3705 if (TREE_CODE (node
) == INDIRECT_REF
3706 || TREE_CODE (node
) == MEM_REF
)
3707 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3708 else if (CONSTANT_CLASS_P (node
))
3710 else if (DECL_P (node
))
3711 tc
&= (staticp (node
) != NULL_TREE
);
3715 se
|= TREE_SIDE_EFFECTS (node
);
3719 TREE_CONSTANT (t
) = tc
;
3720 TREE_SIDE_EFFECTS (t
) = se
;
3724 /* Build an expression of code CODE, data type TYPE, and operands as
3725 specified. Expressions and reference nodes can be created this way.
3726 Constants, decls, types and misc nodes cannot be.
3728 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3729 enough for all extant tree codes. */
3732 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3736 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3738 t
= make_node_stat (code PASS_MEM_STAT
);
3745 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3747 int length
= sizeof (struct tree_exp
);
3750 record_node_allocation_statistics (code
, length
);
3752 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3754 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3756 memset (t
, 0, sizeof (struct tree_common
));
3758 TREE_SET_CODE (t
, code
);
3760 TREE_TYPE (t
) = type
;
3761 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3762 TREE_OPERAND (t
, 0) = node
;
3763 if (node
&& !TYPE_P (node
))
3765 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3766 TREE_READONLY (t
) = TREE_READONLY (node
);
3769 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3770 TREE_SIDE_EFFECTS (t
) = 1;
3774 /* All of these have side-effects, no matter what their
3776 TREE_SIDE_EFFECTS (t
) = 1;
3777 TREE_READONLY (t
) = 0;
3781 /* Whether a dereference is readonly has nothing to do with whether
3782 its operand is readonly. */
3783 TREE_READONLY (t
) = 0;
3788 recompute_tree_invariant_for_addr_expr (t
);
3792 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3793 && node
&& !TYPE_P (node
)
3794 && TREE_CONSTANT (node
))
3795 TREE_CONSTANT (t
) = 1;
3796 if (TREE_CODE_CLASS (code
) == tcc_reference
3797 && node
&& TREE_THIS_VOLATILE (node
))
3798 TREE_THIS_VOLATILE (t
) = 1;
3805 #define PROCESS_ARG(N) \
3807 TREE_OPERAND (t, N) = arg##N; \
3808 if (arg##N &&!TYPE_P (arg##N)) \
3810 if (TREE_SIDE_EFFECTS (arg##N)) \
3812 if (!TREE_READONLY (arg##N) \
3813 && !CONSTANT_CLASS_P (arg##N)) \
3814 (void) (read_only = 0); \
3815 if (!TREE_CONSTANT (arg##N)) \
3816 (void) (constant = 0); \
3821 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3823 bool constant
, read_only
, side_effects
;
3826 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3828 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3829 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3830 /* When sizetype precision doesn't match that of pointers
3831 we need to be able to build explicit extensions or truncations
3832 of the offset argument. */
3833 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3834 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3835 && TREE_CODE (arg1
) == INTEGER_CST
);
3837 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3838 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3839 && ptrofftype_p (TREE_TYPE (arg1
)));
3841 t
= make_node_stat (code PASS_MEM_STAT
);
3844 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3845 result based on those same flags for the arguments. But if the
3846 arguments aren't really even `tree' expressions, we shouldn't be trying
3849 /* Expressions without side effects may be constant if their
3850 arguments are as well. */
3851 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3852 || TREE_CODE_CLASS (code
) == tcc_binary
);
3854 side_effects
= TREE_SIDE_EFFECTS (t
);
3859 TREE_READONLY (t
) = read_only
;
3860 TREE_CONSTANT (t
) = constant
;
3861 TREE_SIDE_EFFECTS (t
) = side_effects
;
3862 TREE_THIS_VOLATILE (t
)
3863 = (TREE_CODE_CLASS (code
) == tcc_reference
3864 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3871 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3872 tree arg2 MEM_STAT_DECL
)
3874 bool constant
, read_only
, side_effects
;
3877 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3878 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3880 t
= make_node_stat (code PASS_MEM_STAT
);
3885 /* As a special exception, if COND_EXPR has NULL branches, we
3886 assume that it is a gimple statement and always consider
3887 it to have side effects. */
3888 if (code
== COND_EXPR
3889 && tt
== void_type_node
3890 && arg1
== NULL_TREE
3891 && arg2
== NULL_TREE
)
3892 side_effects
= true;
3894 side_effects
= TREE_SIDE_EFFECTS (t
);
3900 if (code
== COND_EXPR
)
3901 TREE_READONLY (t
) = read_only
;
3903 TREE_SIDE_EFFECTS (t
) = side_effects
;
3904 TREE_THIS_VOLATILE (t
)
3905 = (TREE_CODE_CLASS (code
) == tcc_reference
3906 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3912 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3913 tree arg2
, tree arg3 MEM_STAT_DECL
)
3915 bool constant
, read_only
, side_effects
;
3918 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3920 t
= make_node_stat (code PASS_MEM_STAT
);
3923 side_effects
= TREE_SIDE_EFFECTS (t
);
3930 TREE_SIDE_EFFECTS (t
) = side_effects
;
3931 TREE_THIS_VOLATILE (t
)
3932 = (TREE_CODE_CLASS (code
) == tcc_reference
3933 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3939 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3940 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3942 bool constant
, read_only
, side_effects
;
3945 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3947 t
= make_node_stat (code PASS_MEM_STAT
);
3950 side_effects
= TREE_SIDE_EFFECTS (t
);
3958 TREE_SIDE_EFFECTS (t
) = side_effects
;
3959 TREE_THIS_VOLATILE (t
)
3960 = (TREE_CODE_CLASS (code
) == tcc_reference
3961 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3966 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
3967 on the pointer PTR. */
3970 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
3972 HOST_WIDE_INT offset
= 0;
3973 tree ptype
= TREE_TYPE (ptr
);
3975 /* For convenience allow addresses that collapse to a simple base
3977 if (TREE_CODE (ptr
) == ADDR_EXPR
3978 && (handled_component_p (TREE_OPERAND (ptr
, 0))
3979 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
3981 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
3983 ptr
= build_fold_addr_expr (ptr
);
3984 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
3986 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
3987 ptr
, build_int_cst (ptype
, offset
));
3988 SET_EXPR_LOCATION (tem
, loc
);
3992 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
3995 mem_ref_offset (const_tree t
)
3997 tree toff
= TREE_OPERAND (t
, 1);
3998 return tree_to_double_int (toff
).sext (TYPE_PRECISION (TREE_TYPE (toff
)));
4001 /* Return the pointer-type relevant for TBAA purposes from the
4002 gimple memory reference tree T. This is the type to be used for
4003 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4006 reference_alias_ptr_type (const_tree t
)
4008 const_tree base
= t
;
4009 while (handled_component_p (base
))
4010 base
= TREE_OPERAND (base
, 0);
4011 if (TREE_CODE (base
) == MEM_REF
)
4012 return TREE_TYPE (TREE_OPERAND (base
, 1));
4013 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4014 return TREE_TYPE (TMR_OFFSET (base
));
4016 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4019 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4020 offsetted by OFFSET units. */
4023 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4025 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4026 build_fold_addr_expr (base
),
4027 build_int_cst (ptr_type_node
, offset
));
4028 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4029 recompute_tree_invariant_for_addr_expr (addr
);
4033 /* Similar except don't specify the TREE_TYPE
4034 and leave the TREE_SIDE_EFFECTS as 0.
4035 It is permissible for arguments to be null,
4036 or even garbage if their values do not matter. */
4039 build_nt (enum tree_code code
, ...)
4046 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4050 t
= make_node (code
);
4051 length
= TREE_CODE_LENGTH (code
);
4053 for (i
= 0; i
< length
; i
++)
4054 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4060 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4064 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4069 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4070 CALL_EXPR_FN (ret
) = fn
;
4071 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4072 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4073 CALL_EXPR_ARG (ret
, ix
) = t
;
4077 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4078 We do NOT enter this node in any sort of symbol table.
4080 LOC is the location of the decl.
4082 layout_decl is used to set up the decl's storage layout.
4083 Other slots are initialized to 0 or null pointers. */
4086 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4087 tree type MEM_STAT_DECL
)
4091 t
= make_node_stat (code PASS_MEM_STAT
);
4092 DECL_SOURCE_LOCATION (t
) = loc
;
4094 /* if (type == error_mark_node)
4095 type = integer_type_node; */
4096 /* That is not done, deliberately, so that having error_mark_node
4097 as the type can suppress useless errors in the use of this variable. */
4099 DECL_NAME (t
) = name
;
4100 TREE_TYPE (t
) = type
;
4102 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4108 /* Builds and returns function declaration with NAME and TYPE. */
4111 build_fn_decl (const char *name
, tree type
)
4113 tree id
= get_identifier (name
);
4114 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4116 DECL_EXTERNAL (decl
) = 1;
4117 TREE_PUBLIC (decl
) = 1;
4118 DECL_ARTIFICIAL (decl
) = 1;
4119 TREE_NOTHROW (decl
) = 1;
4124 VEC(tree
,gc
) *all_translation_units
;
4126 /* Builds a new translation-unit decl with name NAME, queues it in the
4127 global list of translation-unit decls and returns it. */
4130 build_translation_unit_decl (tree name
)
4132 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4134 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4135 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4140 /* BLOCK nodes are used to represent the structure of binding contours
4141 and declarations, once those contours have been exited and their contents
4142 compiled. This information is used for outputting debugging info. */
4145 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4147 tree block
= make_node (BLOCK
);
4149 BLOCK_VARS (block
) = vars
;
4150 BLOCK_SUBBLOCKS (block
) = subblocks
;
4151 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4152 BLOCK_CHAIN (block
) = chain
;
4157 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4159 LOC is the location to use in tree T. */
4162 protected_set_expr_location (tree t
, location_t loc
)
4164 if (t
&& CAN_HAVE_LOCATION_P (t
))
4165 SET_EXPR_LOCATION (t
, loc
);
4168 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4172 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4174 DECL_ATTRIBUTES (ddecl
) = attribute
;
4178 /* Borrowed from hashtab.c iterative_hash implementation. */
4179 #define mix(a,b,c) \
4181 a -= b; a -= c; a ^= (c>>13); \
4182 b -= c; b -= a; b ^= (a<< 8); \
4183 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4184 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4185 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4186 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4187 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4188 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4189 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4193 /* Produce good hash value combining VAL and VAL2. */
4195 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4197 /* the golden ratio; an arbitrary value. */
4198 hashval_t a
= 0x9e3779b9;
4204 /* Produce good hash value combining VAL and VAL2. */
4206 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4208 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4209 return iterative_hash_hashval_t (val
, val2
);
4212 hashval_t a
= (hashval_t
) val
;
4213 /* Avoid warnings about shifting of more than the width of the type on
4214 hosts that won't execute this path. */
4216 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4218 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4220 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4221 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4228 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4229 is ATTRIBUTE and its qualifiers are QUALS.
4231 Record such modified types already made so we don't make duplicates. */
4234 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4236 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4238 hashval_t hashcode
= 0;
4240 enum tree_code code
= TREE_CODE (ttype
);
4242 /* Building a distinct copy of a tagged type is inappropriate; it
4243 causes breakage in code that expects there to be a one-to-one
4244 relationship between a struct and its fields.
4245 build_duplicate_type is another solution (as used in
4246 handle_transparent_union_attribute), but that doesn't play well
4247 with the stronger C++ type identity model. */
4248 if (TREE_CODE (ttype
) == RECORD_TYPE
4249 || TREE_CODE (ttype
) == UNION_TYPE
4250 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4251 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4253 warning (OPT_Wattributes
,
4254 "ignoring attributes applied to %qT after definition",
4255 TYPE_MAIN_VARIANT (ttype
));
4256 return build_qualified_type (ttype
, quals
);
4259 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4260 ntype
= build_distinct_type_copy (ttype
);
4262 TYPE_ATTRIBUTES (ntype
) = attribute
;
4264 hashcode
= iterative_hash_object (code
, hashcode
);
4265 if (TREE_TYPE (ntype
))
4266 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4268 hashcode
= attribute_hash_list (attribute
, hashcode
);
4270 switch (TREE_CODE (ntype
))
4273 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4276 if (TYPE_DOMAIN (ntype
))
4277 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4281 hashcode
= iterative_hash_object
4282 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4283 hashcode
= iterative_hash_object
4284 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4287 case FIXED_POINT_TYPE
:
4289 unsigned int precision
= TYPE_PRECISION (ntype
);
4290 hashcode
= iterative_hash_object (precision
, hashcode
);
4297 ntype
= type_hash_canon (hashcode
, ntype
);
4299 /* If the target-dependent attributes make NTYPE different from
4300 its canonical type, we will need to use structural equality
4301 checks for this type. */
4302 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4303 || !comp_type_attributes (ntype
, ttype
))
4304 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4305 else if (TYPE_CANONICAL (ntype
) == ntype
)
4306 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4308 ttype
= build_qualified_type (ntype
, quals
);
4310 else if (TYPE_QUALS (ttype
) != quals
)
4311 ttype
= build_qualified_type (ttype
, quals
);
4316 /* Compare two attributes for their value identity. Return true if the
4317 attribute values are known to be equal; otherwise return false.
4321 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4323 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4326 if (TREE_VALUE (attr1
) != NULL_TREE
4327 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4328 && TREE_VALUE (attr2
) != NULL
4329 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4330 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4331 TREE_VALUE (attr2
)) == 1);
4333 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4336 /* Return 0 if the attributes for two types are incompatible, 1 if they
4337 are compatible, and 2 if they are nearly compatible (which causes a
4338 warning to be generated). */
4340 comp_type_attributes (const_tree type1
, const_tree type2
)
4342 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4343 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4348 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4350 const struct attribute_spec
*as
;
4353 as
= lookup_attribute_spec (get_attribute_name (a
));
4354 if (!as
|| as
->affects_type_identity
== false)
4357 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4358 if (!attr
|| !attribute_value_equal (a
, attr
))
4363 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4365 const struct attribute_spec
*as
;
4367 as
= lookup_attribute_spec (get_attribute_name (a
));
4368 if (!as
|| as
->affects_type_identity
== false)
4371 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4373 /* We don't need to compare trees again, as we did this
4374 already in first loop. */
4376 /* All types - affecting identity - are equal, so
4377 there is no need to call target hook for comparison. */
4381 /* As some type combinations - like default calling-convention - might
4382 be compatible, we have to call the target hook to get the final result. */
4383 return targetm
.comp_type_attributes (type1
, type2
);
4386 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4389 Record such modified types already made so we don't make duplicates. */
4392 build_type_attribute_variant (tree ttype
, tree attribute
)
4394 return build_type_attribute_qual_variant (ttype
, attribute
,
4395 TYPE_QUALS (ttype
));
4399 /* Reset the expression *EXPR_P, a size or position.
4401 ??? We could reset all non-constant sizes or positions. But it's cheap
4402 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4404 We need to reset self-referential sizes or positions because they cannot
4405 be gimplified and thus can contain a CALL_EXPR after the gimplification
4406 is finished, which will run afoul of LTO streaming. And they need to be
4407 reset to something essentially dummy but not constant, so as to preserve
4408 the properties of the object they are attached to. */
4411 free_lang_data_in_one_sizepos (tree
*expr_p
)
4413 tree expr
= *expr_p
;
4414 if (CONTAINS_PLACEHOLDER_P (expr
))
4415 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4419 /* Reset all the fields in a binfo node BINFO. We only keep
4420 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4423 free_lang_data_in_binfo (tree binfo
)
4428 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4430 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4431 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4432 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4433 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4435 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4436 free_lang_data_in_binfo (t
);
4440 /* Reset all language specific information still present in TYPE. */
4443 free_lang_data_in_type (tree type
)
4445 gcc_assert (TYPE_P (type
));
4447 /* Give the FE a chance to remove its own data first. */
4448 lang_hooks
.free_lang_data (type
);
4450 TREE_LANG_FLAG_0 (type
) = 0;
4451 TREE_LANG_FLAG_1 (type
) = 0;
4452 TREE_LANG_FLAG_2 (type
) = 0;
4453 TREE_LANG_FLAG_3 (type
) = 0;
4454 TREE_LANG_FLAG_4 (type
) = 0;
4455 TREE_LANG_FLAG_5 (type
) = 0;
4456 TREE_LANG_FLAG_6 (type
) = 0;
4458 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4460 /* Remove the const and volatile qualifiers from arguments. The
4461 C++ front end removes them, but the C front end does not,
4462 leading to false ODR violation errors when merging two
4463 instances of the same function signature compiled by
4464 different front ends. */
4467 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4469 tree arg_type
= TREE_VALUE (p
);
4471 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4473 int quals
= TYPE_QUALS (arg_type
)
4475 & ~TYPE_QUAL_VOLATILE
;
4476 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4477 free_lang_data_in_type (TREE_VALUE (p
));
4482 /* Remove members that are not actually FIELD_DECLs from the field
4483 list of an aggregate. These occur in C++. */
4484 if (RECORD_OR_UNION_TYPE_P (type
))
4488 /* Note that TYPE_FIELDS can be shared across distinct
4489 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4490 to be removed, we cannot set its TREE_CHAIN to NULL.
4491 Otherwise, we would not be able to find all the other fields
4492 in the other instances of this TREE_TYPE.
4494 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4496 member
= TYPE_FIELDS (type
);
4499 if (TREE_CODE (member
) == FIELD_DECL
4500 || TREE_CODE (member
) == TYPE_DECL
)
4503 TREE_CHAIN (prev
) = member
;
4505 TYPE_FIELDS (type
) = member
;
4509 member
= TREE_CHAIN (member
);
4513 TREE_CHAIN (prev
) = NULL_TREE
;
4515 TYPE_FIELDS (type
) = NULL_TREE
;
4517 TYPE_METHODS (type
) = NULL_TREE
;
4518 if (TYPE_BINFO (type
))
4519 free_lang_data_in_binfo (TYPE_BINFO (type
));
4523 /* For non-aggregate types, clear out the language slot (which
4524 overloads TYPE_BINFO). */
4525 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4527 if (INTEGRAL_TYPE_P (type
)
4528 || SCALAR_FLOAT_TYPE_P (type
)
4529 || FIXED_POINT_TYPE_P (type
))
4531 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4532 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4536 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4537 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4539 if (TYPE_CONTEXT (type
)
4540 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4542 tree ctx
= TYPE_CONTEXT (type
);
4545 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4547 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4548 TYPE_CONTEXT (type
) = ctx
;
4553 /* Return true if DECL may need an assembler name to be set. */
4556 need_assembler_name_p (tree decl
)
4558 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4559 if (TREE_CODE (decl
) != FUNCTION_DECL
4560 && TREE_CODE (decl
) != VAR_DECL
)
4563 /* If DECL already has its assembler name set, it does not need a
4565 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4566 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4569 /* Abstract decls do not need an assembler name. */
4570 if (DECL_ABSTRACT (decl
))
4573 /* For VAR_DECLs, only static, public and external symbols need an
4575 if (TREE_CODE (decl
) == VAR_DECL
4576 && !TREE_STATIC (decl
)
4577 && !TREE_PUBLIC (decl
)
4578 && !DECL_EXTERNAL (decl
))
4581 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4583 /* Do not set assembler name on builtins. Allow RTL expansion to
4584 decide whether to expand inline or via a regular call. */
4585 if (DECL_BUILT_IN (decl
)
4586 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4589 /* Functions represented in the callgraph need an assembler name. */
4590 if (cgraph_get_node (decl
) != NULL
)
4593 /* Unused and not public functions don't need an assembler name. */
4594 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4602 /* Reset all language specific information still present in symbol
4606 free_lang_data_in_decl (tree decl
)
4608 gcc_assert (DECL_P (decl
));
4610 /* Give the FE a chance to remove its own data first. */
4611 lang_hooks
.free_lang_data (decl
);
4613 TREE_LANG_FLAG_0 (decl
) = 0;
4614 TREE_LANG_FLAG_1 (decl
) = 0;
4615 TREE_LANG_FLAG_2 (decl
) = 0;
4616 TREE_LANG_FLAG_3 (decl
) = 0;
4617 TREE_LANG_FLAG_4 (decl
) = 0;
4618 TREE_LANG_FLAG_5 (decl
) = 0;
4619 TREE_LANG_FLAG_6 (decl
) = 0;
4621 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4622 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4623 if (TREE_CODE (decl
) == FIELD_DECL
)
4625 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4626 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4627 DECL_QUALIFIER (decl
) = NULL_TREE
;
4630 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4632 if (gimple_has_body_p (decl
))
4636 /* If DECL has a gimple body, then the context for its
4637 arguments must be DECL. Otherwise, it doesn't really
4638 matter, as we will not be emitting any code for DECL. In
4639 general, there may be other instances of DECL created by
4640 the front end and since PARM_DECLs are generally shared,
4641 their DECL_CONTEXT changes as the replicas of DECL are
4642 created. The only time where DECL_CONTEXT is important
4643 is for the FUNCTION_DECLs that have a gimple body (since
4644 the PARM_DECL will be used in the function's body). */
4645 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4646 DECL_CONTEXT (t
) = decl
;
4649 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4650 At this point, it is not needed anymore. */
4651 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4653 /* Clear the abstract origin if it refers to a method. Otherwise
4654 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4655 origin will not be output correctly. */
4656 if (DECL_ABSTRACT_ORIGIN (decl
)
4657 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4658 && RECORD_OR_UNION_TYPE_P
4659 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4660 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4662 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4663 DECL_VINDEX referring to itself into a vtable slot number as it
4664 should. Happens with functions that are copied and then forgotten
4665 about. Just clear it, it won't matter anymore. */
4666 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4667 DECL_VINDEX (decl
) = NULL_TREE
;
4669 else if (TREE_CODE (decl
) == VAR_DECL
)
4671 if ((DECL_EXTERNAL (decl
)
4672 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4673 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4674 DECL_INITIAL (decl
) = NULL_TREE
;
4676 else if (TREE_CODE (decl
) == TYPE_DECL
4677 || TREE_CODE (decl
) == FIELD_DECL
)
4678 DECL_INITIAL (decl
) = NULL_TREE
;
4679 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4680 && DECL_INITIAL (decl
)
4681 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4683 /* Strip builtins from the translation-unit BLOCK. We still have targets
4684 without builtin_decl_explicit support and also builtins are shared
4685 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4686 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4690 if (TREE_CODE (var
) == FUNCTION_DECL
4691 && DECL_BUILT_IN (var
))
4692 *nextp
= TREE_CHAIN (var
);
4694 nextp
= &TREE_CHAIN (var
);
4700 /* Data used when collecting DECLs and TYPEs for language data removal. */
4702 struct free_lang_data_d
4704 /* Worklist to avoid excessive recursion. */
4705 VEC(tree
,heap
) *worklist
;
4707 /* Set of traversed objects. Used to avoid duplicate visits. */
4708 struct pointer_set_t
*pset
;
4710 /* Array of symbols to process with free_lang_data_in_decl. */
4711 VEC(tree
,heap
) *decls
;
4713 /* Array of types to process with free_lang_data_in_type. */
4714 VEC(tree
,heap
) *types
;
4718 /* Save all language fields needed to generate proper debug information
4719 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4722 save_debug_info_for_decl (tree t
)
4724 /*struct saved_debug_info_d *sdi;*/
4726 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4728 /* FIXME. Partial implementation for saving debug info removed. */
4732 /* Save all language fields needed to generate proper debug information
4733 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4736 save_debug_info_for_type (tree t
)
4738 /*struct saved_debug_info_d *sdi;*/
4740 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4742 /* FIXME. Partial implementation for saving debug info removed. */
4746 /* Add type or decl T to one of the list of tree nodes that need their
4747 language data removed. The lists are held inside FLD. */
4750 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4754 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4755 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4756 save_debug_info_for_decl (t
);
4758 else if (TYPE_P (t
))
4760 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4761 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4762 save_debug_info_for_type (t
);
4768 /* Push tree node T into FLD->WORKLIST. */
4771 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4773 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4774 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4778 /* Operand callback helper for free_lang_data_in_node. *TP is the
4779 subtree operand being considered. */
4782 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4785 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4787 if (TREE_CODE (t
) == TREE_LIST
)
4790 /* Language specific nodes will be removed, so there is no need
4791 to gather anything under them. */
4792 if (is_lang_specific (t
))
4800 /* Note that walk_tree does not traverse every possible field in
4801 decls, so we have to do our own traversals here. */
4802 add_tree_to_fld_list (t
, fld
);
4804 fld_worklist_push (DECL_NAME (t
), fld
);
4805 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4806 fld_worklist_push (DECL_SIZE (t
), fld
);
4807 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4809 /* We are going to remove everything under DECL_INITIAL for
4810 TYPE_DECLs. No point walking them. */
4811 if (TREE_CODE (t
) != TYPE_DECL
)
4812 fld_worklist_push (DECL_INITIAL (t
), fld
);
4814 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4815 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4817 if (TREE_CODE (t
) == FUNCTION_DECL
)
4819 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4820 fld_worklist_push (DECL_RESULT (t
), fld
);
4822 else if (TREE_CODE (t
) == TYPE_DECL
)
4824 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4825 fld_worklist_push (DECL_VINDEX (t
), fld
);
4826 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
4828 else if (TREE_CODE (t
) == FIELD_DECL
)
4830 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4831 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4832 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4833 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4835 else if (TREE_CODE (t
) == VAR_DECL
)
4837 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4838 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4841 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4842 && DECL_HAS_VALUE_EXPR_P (t
))
4843 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4845 if (TREE_CODE (t
) != FIELD_DECL
4846 && TREE_CODE (t
) != TYPE_DECL
)
4847 fld_worklist_push (TREE_CHAIN (t
), fld
);
4850 else if (TYPE_P (t
))
4852 /* Note that walk_tree does not traverse every possible field in
4853 types, so we have to do our own traversals here. */
4854 add_tree_to_fld_list (t
, fld
);
4856 if (!RECORD_OR_UNION_TYPE_P (t
))
4857 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4858 fld_worklist_push (TYPE_SIZE (t
), fld
);
4859 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4860 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4861 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4862 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4863 fld_worklist_push (TYPE_NAME (t
), fld
);
4864 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4865 them and thus do not and want not to reach unused pointer types
4867 if (!POINTER_TYPE_P (t
))
4868 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4869 if (!RECORD_OR_UNION_TYPE_P (t
))
4870 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4871 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4872 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4873 do not and want not to reach unused variants this way. */
4874 if (TYPE_CONTEXT (t
))
4876 tree ctx
= TYPE_CONTEXT (t
);
4877 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
4878 So push that instead. */
4879 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
4880 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4881 fld_worklist_push (ctx
, fld
);
4883 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4884 and want not to reach unused types this way. */
4886 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4890 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4892 fld_worklist_push (TREE_TYPE (tem
), fld
);
4893 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4895 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4896 && TREE_CODE (tem
) == TREE_LIST
)
4899 fld_worklist_push (TREE_VALUE (tem
), fld
);
4900 tem
= TREE_CHAIN (tem
);
4904 if (RECORD_OR_UNION_TYPE_P (t
))
4907 /* Push all TYPE_FIELDS - there can be interleaving interesting
4908 and non-interesting things. */
4909 tem
= TYPE_FIELDS (t
);
4912 if (TREE_CODE (tem
) == FIELD_DECL
4913 || TREE_CODE (tem
) == TYPE_DECL
)
4914 fld_worklist_push (tem
, fld
);
4915 tem
= TREE_CHAIN (tem
);
4919 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
4922 else if (TREE_CODE (t
) == BLOCK
)
4925 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4926 fld_worklist_push (tem
, fld
);
4927 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4928 fld_worklist_push (tem
, fld
);
4929 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4932 if (TREE_CODE (t
) != IDENTIFIER_NODE
4933 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
4934 fld_worklist_push (TREE_TYPE (t
), fld
);
4940 /* Find decls and types in T. */
4943 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4947 if (!pointer_set_contains (fld
->pset
, t
))
4948 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4949 if (VEC_empty (tree
, fld
->worklist
))
4951 t
= VEC_pop (tree
, fld
->worklist
);
4955 /* Translate all the types in LIST with the corresponding runtime
4959 get_eh_types_for_runtime (tree list
)
4963 if (list
== NULL_TREE
)
4966 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4968 list
= TREE_CHAIN (list
);
4971 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
4972 TREE_CHAIN (prev
) = n
;
4973 prev
= TREE_CHAIN (prev
);
4974 list
= TREE_CHAIN (list
);
4981 /* Find decls and types referenced in EH region R and store them in
4982 FLD->DECLS and FLD->TYPES. */
4985 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
4996 /* The types referenced in each catch must first be changed to the
4997 EH types used at runtime. This removes references to FE types
4999 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5001 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5002 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5007 case ERT_ALLOWED_EXCEPTIONS
:
5008 r
->u
.allowed
.type_list
5009 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5010 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5013 case ERT_MUST_NOT_THROW
:
5014 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5015 find_decls_types_r
, fld
, fld
->pset
);
5021 /* Find decls and types referenced in cgraph node N and store them in
5022 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5023 look for *every* kind of DECL and TYPE node reachable from N,
5024 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5025 NAMESPACE_DECLs, etc). */
5028 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5031 struct function
*fn
;
5035 find_decls_types (n
->symbol
.decl
, fld
);
5037 if (!gimple_has_body_p (n
->symbol
.decl
))
5040 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5042 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5044 /* Traverse locals. */
5045 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5046 find_decls_types (t
, fld
);
5048 /* Traverse EH regions in FN. */
5051 FOR_ALL_EH_REGION_FN (r
, fn
)
5052 find_decls_types_in_eh_region (r
, fld
);
5055 /* Traverse every statement in FN. */
5056 FOR_EACH_BB_FN (bb
, fn
)
5058 gimple_stmt_iterator si
;
5061 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5063 gimple phi
= gsi_stmt (si
);
5065 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5067 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5068 find_decls_types (*arg_p
, fld
);
5072 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5074 gimple stmt
= gsi_stmt (si
);
5076 if (is_gimple_call (stmt
))
5077 find_decls_types (gimple_call_fntype (stmt
), fld
);
5079 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5081 tree arg
= gimple_op (stmt
, i
);
5082 find_decls_types (arg
, fld
);
5089 /* Find decls and types referenced in varpool node N and store them in
5090 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5091 look for *every* kind of DECL and TYPE node reachable from N,
5092 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5093 NAMESPACE_DECLs, etc). */
5096 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5098 find_decls_types (v
->symbol
.decl
, fld
);
5101 /* If T needs an assembler name, have one created for it. */
5104 assign_assembler_name_if_neeeded (tree t
)
5106 if (need_assembler_name_p (t
))
5108 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5109 diagnostics that use input_location to show locus
5110 information. The problem here is that, at this point,
5111 input_location is generally anchored to the end of the file
5112 (since the parser is long gone), so we don't have a good
5113 position to pin it to.
5115 To alleviate this problem, this uses the location of T's
5116 declaration. Examples of this are
5117 testsuite/g++.dg/template/cond2.C and
5118 testsuite/g++.dg/template/pr35240.C. */
5119 location_t saved_location
= input_location
;
5120 input_location
= DECL_SOURCE_LOCATION (t
);
5122 decl_assembler_name (t
);
5124 input_location
= saved_location
;
5129 /* Free language specific information for every operand and expression
5130 in every node of the call graph. This process operates in three stages:
5132 1- Every callgraph node and varpool node is traversed looking for
5133 decls and types embedded in them. This is a more exhaustive
5134 search than that done by find_referenced_vars, because it will
5135 also collect individual fields, decls embedded in types, etc.
5137 2- All the decls found are sent to free_lang_data_in_decl.
5139 3- All the types found are sent to free_lang_data_in_type.
5141 The ordering between decls and types is important because
5142 free_lang_data_in_decl sets assembler names, which includes
5143 mangling. So types cannot be freed up until assembler names have
5147 free_lang_data_in_cgraph (void)
5149 struct cgraph_node
*n
;
5150 struct varpool_node
*v
;
5151 struct free_lang_data_d fld
;
5156 /* Initialize sets and arrays to store referenced decls and types. */
5157 fld
.pset
= pointer_set_create ();
5158 fld
.worklist
= NULL
;
5159 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5160 fld
.types
= VEC_alloc (tree
, heap
, 100);
5162 /* Find decls and types in the body of every function in the callgraph. */
5163 FOR_EACH_FUNCTION (n
)
5164 find_decls_types_in_node (n
, &fld
);
5166 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5167 find_decls_types (p
->decl
, &fld
);
5169 /* Find decls and types in every varpool symbol. */
5170 FOR_EACH_VARIABLE (v
)
5171 find_decls_types_in_var (v
, &fld
);
5173 /* Set the assembler name on every decl found. We need to do this
5174 now because free_lang_data_in_decl will invalidate data needed
5175 for mangling. This breaks mangling on interdependent decls. */
5176 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5177 assign_assembler_name_if_neeeded (t
);
5179 /* Traverse every decl found freeing its language data. */
5180 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5181 free_lang_data_in_decl (t
);
5183 /* Traverse every type found freeing its language data. */
5184 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5185 free_lang_data_in_type (t
);
5187 pointer_set_destroy (fld
.pset
);
5188 VEC_free (tree
, heap
, fld
.worklist
);
5189 VEC_free (tree
, heap
, fld
.decls
);
5190 VEC_free (tree
, heap
, fld
.types
);
5194 /* Free resources that are used by FE but are not needed once they are done. */
5197 free_lang_data (void)
5201 /* If we are the LTO frontend we have freed lang-specific data already. */
5203 || !flag_generate_lto
)
5206 /* Allocate and assign alias sets to the standard integer types
5207 while the slots are still in the way the frontends generated them. */
5208 for (i
= 0; i
< itk_none
; ++i
)
5209 if (integer_types
[i
])
5210 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5212 /* Traverse the IL resetting language specific information for
5213 operands, expressions, etc. */
5214 free_lang_data_in_cgraph ();
5216 /* Create gimple variants for common types. */
5217 ptrdiff_type_node
= integer_type_node
;
5218 fileptr_type_node
= ptr_type_node
;
5220 /* Reset some langhooks. Do not reset types_compatible_p, it may
5221 still be used indirectly via the get_alias_set langhook. */
5222 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5223 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5224 /* We do not want the default decl_assembler_name implementation,
5225 rather if we have fixed everything we want a wrapper around it
5226 asserting that all non-local symbols already got their assembler
5227 name and only produce assembler names for local symbols. Or rather
5228 make sure we never call decl_assembler_name on local symbols and
5229 devise a separate, middle-end private scheme for it. */
5231 /* Reset diagnostic machinery. */
5232 tree_diagnostics_defaults (global_dc
);
5238 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5242 "*free_lang_data", /* name */
5244 free_lang_data
, /* execute */
5247 0, /* static_pass_number */
5248 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5249 0, /* properties_required */
5250 0, /* properties_provided */
5251 0, /* properties_destroyed */
5252 0, /* todo_flags_start */
5253 TODO_ggc_collect
/* todo_flags_finish */
5257 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5258 ATTR_NAME. Also used internally by remove_attribute(). */
5260 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5262 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5264 if (ident_len
== attr_len
)
5266 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5269 else if (ident_len
== attr_len
+ 4)
5271 /* There is the possibility that ATTR is 'text' and IDENT is
5273 const char *p
= IDENTIFIER_POINTER (ident
);
5274 if (p
[0] == '_' && p
[1] == '_'
5275 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5276 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5283 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5284 of ATTR_NAME, and LIST is not NULL_TREE. */
5286 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5290 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5292 if (ident_len
== attr_len
)
5294 if (!strcmp (attr_name
,
5295 IDENTIFIER_POINTER (get_attribute_name (list
))))
5298 /* TODO: If we made sure that attributes were stored in the
5299 canonical form without '__...__' (ie, as in 'text' as opposed
5300 to '__text__') then we could avoid the following case. */
5301 else if (ident_len
== attr_len
+ 4)
5303 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5304 if (p
[0] == '_' && p
[1] == '_'
5305 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5306 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5309 list
= TREE_CHAIN (list
);
5315 /* A variant of lookup_attribute() that can be used with an identifier
5316 as the first argument, and where the identifier can be either
5317 'text' or '__text__'.
5319 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5320 return a pointer to the attribute's list element if the attribute
5321 is part of the list, or NULL_TREE if not found. If the attribute
5322 appears more than once, this only returns the first occurrence; the
5323 TREE_CHAIN of the return value should be passed back in if further
5324 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5325 can be in the form 'text' or '__text__'. */
5327 lookup_ident_attribute (tree attr_identifier
, tree list
)
5329 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5333 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5334 == IDENTIFIER_NODE
);
5336 /* Identifiers can be compared directly for equality. */
5337 if (attr_identifier
== get_attribute_name (list
))
5340 /* If they are not equal, they may still be one in the form
5341 'text' while the other one is in the form '__text__'. TODO:
5342 If we were storing attributes in normalized 'text' form, then
5343 this could all go away and we could take full advantage of
5344 the fact that we're comparing identifiers. :-) */
5346 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5347 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5349 if (ident_len
== attr_len
+ 4)
5351 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5352 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5353 if (p
[0] == '_' && p
[1] == '_'
5354 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5355 && strncmp (q
, p
+ 2, attr_len
) == 0)
5358 else if (ident_len
+ 4 == attr_len
)
5360 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5361 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5362 if (q
[0] == '_' && q
[1] == '_'
5363 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5364 && strncmp (q
+ 2, p
, ident_len
) == 0)
5368 list
= TREE_CHAIN (list
);
5374 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5378 remove_attribute (const char *attr_name
, tree list
)
5381 size_t attr_len
= strlen (attr_name
);
5383 gcc_checking_assert (attr_name
[0] != '_');
5385 for (p
= &list
; *p
; )
5388 /* TODO: If we were storing attributes in normalized form, here
5389 we could use a simple strcmp(). */
5390 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5391 *p
= TREE_CHAIN (l
);
5393 p
= &TREE_CHAIN (l
);
5399 /* Return an attribute list that is the union of a1 and a2. */
5402 merge_attributes (tree a1
, tree a2
)
5406 /* Either one unset? Take the set one. */
5408 if ((attributes
= a1
) == 0)
5411 /* One that completely contains the other? Take it. */
5413 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5415 if (attribute_list_contained (a2
, a1
))
5419 /* Pick the longest list, and hang on the other list. */
5421 if (list_length (a1
) < list_length (a2
))
5422 attributes
= a2
, a2
= a1
;
5424 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5427 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5429 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5430 a
= lookup_ident_attribute (get_attribute_name (a2
),
5435 a1
= copy_node (a2
);
5436 TREE_CHAIN (a1
) = attributes
;
5445 /* Given types T1 and T2, merge their attributes and return
5449 merge_type_attributes (tree t1
, tree t2
)
5451 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5452 TYPE_ATTRIBUTES (t2
));
5455 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5459 merge_decl_attributes (tree olddecl
, tree newdecl
)
5461 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5462 DECL_ATTRIBUTES (newdecl
));
5465 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5467 /* Specialization of merge_decl_attributes for various Windows targets.
5469 This handles the following situation:
5471 __declspec (dllimport) int foo;
5474 The second instance of `foo' nullifies the dllimport. */
5477 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5480 int delete_dllimport_p
= 1;
5482 /* What we need to do here is remove from `old' dllimport if it doesn't
5483 appear in `new'. dllimport behaves like extern: if a declaration is
5484 marked dllimport and a definition appears later, then the object
5485 is not dllimport'd. We also remove a `new' dllimport if the old list
5486 contains dllexport: dllexport always overrides dllimport, regardless
5487 of the order of declaration. */
5488 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5489 delete_dllimport_p
= 0;
5490 else if (DECL_DLLIMPORT_P (new_tree
)
5491 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5493 DECL_DLLIMPORT_P (new_tree
) = 0;
5494 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5495 "dllimport ignored", new_tree
);
5497 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5499 /* Warn about overriding a symbol that has already been used, e.g.:
5500 extern int __attribute__ ((dllimport)) foo;
5501 int* bar () {return &foo;}
5504 if (TREE_USED (old
))
5506 warning (0, "%q+D redeclared without dllimport attribute "
5507 "after being referenced with dll linkage", new_tree
);
5508 /* If we have used a variable's address with dllimport linkage,
5509 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5510 decl may already have had TREE_CONSTANT computed.
5511 We still remove the attribute so that assembler code refers
5512 to '&foo rather than '_imp__foo'. */
5513 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5514 DECL_DLLIMPORT_P (new_tree
) = 1;
5517 /* Let an inline definition silently override the external reference,
5518 but otherwise warn about attribute inconsistency. */
5519 else if (TREE_CODE (new_tree
) == VAR_DECL
5520 || !DECL_DECLARED_INLINE_P (new_tree
))
5521 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5522 "previous dllimport ignored", new_tree
);
5525 delete_dllimport_p
= 0;
5527 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5529 if (delete_dllimport_p
)
5530 a
= remove_attribute ("dllimport", a
);
5535 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5536 struct attribute_spec.handler. */
5539 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5545 /* These attributes may apply to structure and union types being created,
5546 but otherwise should pass to the declaration involved. */
5549 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5550 | (int) ATTR_FLAG_ARRAY_NEXT
))
5552 *no_add_attrs
= true;
5553 return tree_cons (name
, args
, NULL_TREE
);
5555 if (TREE_CODE (node
) == RECORD_TYPE
5556 || TREE_CODE (node
) == UNION_TYPE
)
5558 node
= TYPE_NAME (node
);
5564 warning (OPT_Wattributes
, "%qE attribute ignored",
5566 *no_add_attrs
= true;
5571 if (TREE_CODE (node
) != FUNCTION_DECL
5572 && TREE_CODE (node
) != VAR_DECL
5573 && TREE_CODE (node
) != TYPE_DECL
)
5575 *no_add_attrs
= true;
5576 warning (OPT_Wattributes
, "%qE attribute ignored",
5581 if (TREE_CODE (node
) == TYPE_DECL
5582 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5583 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5585 *no_add_attrs
= true;
5586 warning (OPT_Wattributes
, "%qE attribute ignored",
5591 is_dllimport
= is_attribute_p ("dllimport", name
);
5593 /* Report error on dllimport ambiguities seen now before they cause
5597 /* Honor any target-specific overrides. */
5598 if (!targetm
.valid_dllimport_attribute_p (node
))
5599 *no_add_attrs
= true;
5601 else if (TREE_CODE (node
) == FUNCTION_DECL
5602 && DECL_DECLARED_INLINE_P (node
))
5604 warning (OPT_Wattributes
, "inline function %q+D declared as "
5605 " dllimport: attribute ignored", node
);
5606 *no_add_attrs
= true;
5608 /* Like MS, treat definition of dllimported variables and
5609 non-inlined functions on declaration as syntax errors. */
5610 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5612 error ("function %q+D definition is marked dllimport", node
);
5613 *no_add_attrs
= true;
5616 else if (TREE_CODE (node
) == VAR_DECL
)
5618 if (DECL_INITIAL (node
))
5620 error ("variable %q+D definition is marked dllimport",
5622 *no_add_attrs
= true;
5625 /* `extern' needn't be specified with dllimport.
5626 Specify `extern' now and hope for the best. Sigh. */
5627 DECL_EXTERNAL (node
) = 1;
5628 /* Also, implicitly give dllimport'd variables declared within
5629 a function global scope, unless declared static. */
5630 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5631 TREE_PUBLIC (node
) = 1;
5634 if (*no_add_attrs
== false)
5635 DECL_DLLIMPORT_P (node
) = 1;
5637 else if (TREE_CODE (node
) == FUNCTION_DECL
5638 && DECL_DECLARED_INLINE_P (node
)
5639 && flag_keep_inline_dllexport
)
5640 /* An exported function, even if inline, must be emitted. */
5641 DECL_EXTERNAL (node
) = 0;
5643 /* Report error if symbol is not accessible at global scope. */
5644 if (!TREE_PUBLIC (node
)
5645 && (TREE_CODE (node
) == VAR_DECL
5646 || TREE_CODE (node
) == FUNCTION_DECL
))
5648 error ("external linkage required for symbol %q+D because of "
5649 "%qE attribute", node
, name
);
5650 *no_add_attrs
= true;
5653 /* A dllexport'd entity must have default visibility so that other
5654 program units (shared libraries or the main executable) can see
5655 it. A dllimport'd entity must have default visibility so that
5656 the linker knows that undefined references within this program
5657 unit can be resolved by the dynamic linker. */
5660 if (DECL_VISIBILITY_SPECIFIED (node
)
5661 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5662 error ("%qE implies default visibility, but %qD has already "
5663 "been declared with a different visibility",
5665 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5666 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5672 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5674 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5675 of the various TYPE_QUAL values. */
5678 set_type_quals (tree type
, int type_quals
)
5680 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5681 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5682 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5683 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5686 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5689 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5691 return (TYPE_QUALS (cand
) == type_quals
5692 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5693 /* Apparently this is needed for Objective-C. */
5694 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5695 /* Check alignment. */
5696 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5697 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5698 TYPE_ATTRIBUTES (base
)));
5701 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5704 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5706 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5707 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5708 /* Apparently this is needed for Objective-C. */
5709 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5710 /* Check alignment. */
5711 && TYPE_ALIGN (cand
) == align
5712 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5713 TYPE_ATTRIBUTES (base
)));
5716 /* Return a version of the TYPE, qualified as indicated by the
5717 TYPE_QUALS, if one exists. If no qualified version exists yet,
5718 return NULL_TREE. */
5721 get_qualified_type (tree type
, int type_quals
)
5725 if (TYPE_QUALS (type
) == type_quals
)
5728 /* Search the chain of variants to see if there is already one there just
5729 like the one we need to have. If so, use that existing one. We must
5730 preserve the TYPE_NAME, since there is code that depends on this. */
5731 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5732 if (check_qualified_type (t
, type
, type_quals
))
5738 /* Like get_qualified_type, but creates the type if it does not
5739 exist. This function never returns NULL_TREE. */
5742 build_qualified_type (tree type
, int type_quals
)
5746 /* See if we already have the appropriate qualified variant. */
5747 t
= get_qualified_type (type
, type_quals
);
5749 /* If not, build it. */
5752 t
= build_variant_type_copy (type
);
5753 set_type_quals (t
, type_quals
);
5755 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5756 /* Propagate structural equality. */
5757 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5758 else if (TYPE_CANONICAL (type
) != type
)
5759 /* Build the underlying canonical type, since it is different
5761 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5764 /* T is its own canonical type. */
5765 TYPE_CANONICAL (t
) = t
;
5772 /* Create a variant of type T with alignment ALIGN. */
5775 build_aligned_type (tree type
, unsigned int align
)
5779 if (TYPE_PACKED (type
)
5780 || TYPE_ALIGN (type
) == align
)
5783 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5784 if (check_aligned_type (t
, type
, align
))
5787 t
= build_variant_type_copy (type
);
5788 TYPE_ALIGN (t
) = align
;
5793 /* Create a new distinct copy of TYPE. The new type is made its own
5794 MAIN_VARIANT. If TYPE requires structural equality checks, the
5795 resulting type requires structural equality checks; otherwise, its
5796 TYPE_CANONICAL points to itself. */
5799 build_distinct_type_copy (tree type
)
5801 tree t
= copy_node (type
);
5803 TYPE_POINTER_TO (t
) = 0;
5804 TYPE_REFERENCE_TO (t
) = 0;
5806 /* Set the canonical type either to a new equivalence class, or
5807 propagate the need for structural equality checks. */
5808 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5809 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5811 TYPE_CANONICAL (t
) = t
;
5813 /* Make it its own variant. */
5814 TYPE_MAIN_VARIANT (t
) = t
;
5815 TYPE_NEXT_VARIANT (t
) = 0;
5817 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5818 whose TREE_TYPE is not t. This can also happen in the Ada
5819 frontend when using subtypes. */
5824 /* Create a new variant of TYPE, equivalent but distinct. This is so
5825 the caller can modify it. TYPE_CANONICAL for the return type will
5826 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5827 are considered equal by the language itself (or that both types
5828 require structural equality checks). */
5831 build_variant_type_copy (tree type
)
5833 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5835 t
= build_distinct_type_copy (type
);
5837 /* Since we're building a variant, assume that it is a non-semantic
5838 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5839 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5841 /* Add the new type to the chain of variants of TYPE. */
5842 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5843 TYPE_NEXT_VARIANT (m
) = t
;
5844 TYPE_MAIN_VARIANT (t
) = m
;
5849 /* Return true if the from tree in both tree maps are equal. */
5852 tree_map_base_eq (const void *va
, const void *vb
)
5854 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5855 *const b
= (const struct tree_map_base
*) vb
;
5856 return (a
->from
== b
->from
);
5859 /* Hash a from tree in a tree_base_map. */
5862 tree_map_base_hash (const void *item
)
5864 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5867 /* Return true if this tree map structure is marked for garbage collection
5868 purposes. We simply return true if the from tree is marked, so that this
5869 structure goes away when the from tree goes away. */
5872 tree_map_base_marked_p (const void *p
)
5874 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5877 /* Hash a from tree in a tree_map. */
5880 tree_map_hash (const void *item
)
5882 return (((const struct tree_map
*) item
)->hash
);
5885 /* Hash a from tree in a tree_decl_map. */
5888 tree_decl_map_hash (const void *item
)
5890 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5893 /* Return the initialization priority for DECL. */
5896 decl_init_priority_lookup (tree decl
)
5898 struct tree_priority_map
*h
;
5899 struct tree_map_base in
;
5901 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5903 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5904 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5907 /* Return the finalization priority for DECL. */
5910 decl_fini_priority_lookup (tree decl
)
5912 struct tree_priority_map
*h
;
5913 struct tree_map_base in
;
5915 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5917 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5918 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5921 /* Return the initialization and finalization priority information for
5922 DECL. If there is no previous priority information, a freshly
5923 allocated structure is returned. */
5925 static struct tree_priority_map
*
5926 decl_priority_info (tree decl
)
5928 struct tree_priority_map in
;
5929 struct tree_priority_map
*h
;
5932 in
.base
.from
= decl
;
5933 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5934 h
= (struct tree_priority_map
*) *loc
;
5937 h
= ggc_alloc_cleared_tree_priority_map ();
5939 h
->base
.from
= decl
;
5940 h
->init
= DEFAULT_INIT_PRIORITY
;
5941 h
->fini
= DEFAULT_INIT_PRIORITY
;
5947 /* Set the initialization priority for DECL to PRIORITY. */
5950 decl_init_priority_insert (tree decl
, priority_type priority
)
5952 struct tree_priority_map
*h
;
5954 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5955 if (priority
== DEFAULT_INIT_PRIORITY
)
5957 h
= decl_priority_info (decl
);
5961 /* Set the finalization priority for DECL to PRIORITY. */
5964 decl_fini_priority_insert (tree decl
, priority_type priority
)
5966 struct tree_priority_map
*h
;
5968 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5969 if (priority
== DEFAULT_INIT_PRIORITY
)
5971 h
= decl_priority_info (decl
);
5975 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
5978 print_debug_expr_statistics (void)
5980 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
5981 (long) htab_size (debug_expr_for_decl
),
5982 (long) htab_elements (debug_expr_for_decl
),
5983 htab_collisions (debug_expr_for_decl
));
5986 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
5989 print_value_expr_statistics (void)
5991 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
5992 (long) htab_size (value_expr_for_decl
),
5993 (long) htab_elements (value_expr_for_decl
),
5994 htab_collisions (value_expr_for_decl
));
5997 /* Lookup a debug expression for FROM, and return it if we find one. */
6000 decl_debug_expr_lookup (tree from
)
6002 struct tree_decl_map
*h
, in
;
6003 in
.base
.from
= from
;
6005 h
= (struct tree_decl_map
*)
6006 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6012 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6015 decl_debug_expr_insert (tree from
, tree to
)
6017 struct tree_decl_map
*h
;
6020 h
= ggc_alloc_tree_decl_map ();
6021 h
->base
.from
= from
;
6023 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6025 *(struct tree_decl_map
**) loc
= h
;
6028 /* Lookup a value expression for FROM, and return it if we find one. */
6031 decl_value_expr_lookup (tree from
)
6033 struct tree_decl_map
*h
, in
;
6034 in
.base
.from
= from
;
6036 h
= (struct tree_decl_map
*)
6037 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6043 /* Insert a mapping FROM->TO in the value expression hashtable. */
6046 decl_value_expr_insert (tree from
, tree to
)
6048 struct tree_decl_map
*h
;
6051 h
= ggc_alloc_tree_decl_map ();
6052 h
->base
.from
= from
;
6054 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6056 *(struct tree_decl_map
**) loc
= h
;
6059 /* Lookup a vector of debug arguments for FROM, and return it if we
6063 decl_debug_args_lookup (tree from
)
6065 struct tree_vec_map
*h
, in
;
6067 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6069 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6070 in
.base
.from
= from
;
6071 h
= (struct tree_vec_map
*)
6072 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6078 /* Insert a mapping FROM->empty vector of debug arguments in the value
6079 expression hashtable. */
6082 decl_debug_args_insert (tree from
)
6084 struct tree_vec_map
*h
;
6087 if (DECL_HAS_DEBUG_ARGS_P (from
))
6088 return decl_debug_args_lookup (from
);
6089 if (debug_args_for_decl
== NULL
)
6090 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6091 tree_vec_map_eq
, 0);
6092 h
= ggc_alloc_tree_vec_map ();
6093 h
->base
.from
= from
;
6095 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6097 *(struct tree_vec_map
**) loc
= h
;
6098 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6102 /* Hashing of types so that we don't make duplicates.
6103 The entry point is `type_hash_canon'. */
6105 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6106 with types in the TREE_VALUE slots), by adding the hash codes
6107 of the individual types. */
6110 type_hash_list (const_tree list
, hashval_t hashcode
)
6114 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6115 if (TREE_VALUE (tail
) != error_mark_node
)
6116 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6122 /* These are the Hashtable callback functions. */
6124 /* Returns true iff the types are equivalent. */
6127 type_hash_eq (const void *va
, const void *vb
)
6129 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6130 *const b
= (const struct type_hash
*) vb
;
6132 /* First test the things that are the same for all types. */
6133 if (a
->hash
!= b
->hash
6134 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6135 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6136 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6137 TYPE_ATTRIBUTES (b
->type
))
6138 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6139 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6142 /* Be careful about comparing arrays before and after the element type
6143 has been completed; don't compare TYPE_ALIGN unless both types are
6145 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6146 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6147 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6150 switch (TREE_CODE (a
->type
))
6155 case REFERENCE_TYPE
:
6160 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6163 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6164 && !(TYPE_VALUES (a
->type
)
6165 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6166 && TYPE_VALUES (b
->type
)
6167 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6168 && type_list_equal (TYPE_VALUES (a
->type
),
6169 TYPE_VALUES (b
->type
))))
6172 /* ... fall through ... */
6177 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6178 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6179 TYPE_MAX_VALUE (b
->type
)))
6180 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6181 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6182 TYPE_MIN_VALUE (b
->type
))));
6184 case FIXED_POINT_TYPE
:
6185 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6188 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6191 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6192 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6193 || (TYPE_ARG_TYPES (a
->type
)
6194 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6195 && TYPE_ARG_TYPES (b
->type
)
6196 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6197 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6198 TYPE_ARG_TYPES (b
->type
)))))
6202 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6206 case QUAL_UNION_TYPE
:
6207 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6208 || (TYPE_FIELDS (a
->type
)
6209 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6210 && TYPE_FIELDS (b
->type
)
6211 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6212 && type_list_equal (TYPE_FIELDS (a
->type
),
6213 TYPE_FIELDS (b
->type
))));
6216 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6217 || (TYPE_ARG_TYPES (a
->type
)
6218 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6219 && TYPE_ARG_TYPES (b
->type
)
6220 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6221 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6222 TYPE_ARG_TYPES (b
->type
))))
6230 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6231 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6236 /* Return the cached hash value. */
6239 type_hash_hash (const void *item
)
6241 return ((const struct type_hash
*) item
)->hash
;
6244 /* Look in the type hash table for a type isomorphic to TYPE.
6245 If one is found, return it. Otherwise return 0. */
6248 type_hash_lookup (hashval_t hashcode
, tree type
)
6250 struct type_hash
*h
, in
;
6252 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6253 must call that routine before comparing TYPE_ALIGNs. */
6259 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6266 /* Add an entry to the type-hash-table
6267 for a type TYPE whose hash code is HASHCODE. */
6270 type_hash_add (hashval_t hashcode
, tree type
)
6272 struct type_hash
*h
;
6275 h
= ggc_alloc_type_hash ();
6278 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6282 /* Given TYPE, and HASHCODE its hash code, return the canonical
6283 object for an identical type if one already exists.
6284 Otherwise, return TYPE, and record it as the canonical object.
6286 To use this function, first create a type of the sort you want.
6287 Then compute its hash code from the fields of the type that
6288 make it different from other similar types.
6289 Then call this function and use the value. */
6292 type_hash_canon (unsigned int hashcode
, tree type
)
6296 /* The hash table only contains main variants, so ensure that's what we're
6298 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6300 /* See if the type is in the hash table already. If so, return it.
6301 Otherwise, add the type. */
6302 t1
= type_hash_lookup (hashcode
, type
);
6305 if (GATHER_STATISTICS
)
6307 tree_code_counts
[(int) TREE_CODE (type
)]--;
6308 tree_node_counts
[(int) t_kind
]--;
6309 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6315 type_hash_add (hashcode
, type
);
6320 /* See if the data pointed to by the type hash table is marked. We consider
6321 it marked if the type is marked or if a debug type number or symbol
6322 table entry has been made for the type. */
6325 type_hash_marked_p (const void *p
)
6327 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6329 return ggc_marked_p (type
);
6333 print_type_hash_statistics (void)
6335 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6336 (long) htab_size (type_hash_table
),
6337 (long) htab_elements (type_hash_table
),
6338 htab_collisions (type_hash_table
));
6341 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6342 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6343 by adding the hash codes of the individual attributes. */
6346 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6350 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6351 /* ??? Do we want to add in TREE_VALUE too? */
6352 hashcode
= iterative_hash_object
6353 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6357 /* Given two lists of attributes, return true if list l2 is
6358 equivalent to l1. */
6361 attribute_list_equal (const_tree l1
, const_tree l2
)
6366 return attribute_list_contained (l1
, l2
)
6367 && attribute_list_contained (l2
, l1
);
6370 /* Given two lists of attributes, return true if list L2 is
6371 completely contained within L1. */
6372 /* ??? This would be faster if attribute names were stored in a canonicalized
6373 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6374 must be used to show these elements are equivalent (which they are). */
6375 /* ??? It's not clear that attributes with arguments will always be handled
6379 attribute_list_contained (const_tree l1
, const_tree l2
)
6383 /* First check the obvious, maybe the lists are identical. */
6387 /* Maybe the lists are similar. */
6388 for (t1
= l1
, t2
= l2
;
6390 && get_attribute_name (t1
) == get_attribute_name (t2
)
6391 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6392 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6395 /* Maybe the lists are equal. */
6396 if (t1
== 0 && t2
== 0)
6399 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6402 /* This CONST_CAST is okay because lookup_attribute does not
6403 modify its argument and the return value is assigned to a
6405 for (attr
= lookup_ident_attribute (get_attribute_name (t2
), CONST_CAST_TREE(l1
));
6406 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6407 attr
= lookup_ident_attribute (get_attribute_name (t2
), TREE_CHAIN (attr
)))
6410 if (attr
== NULL_TREE
)
6417 /* Given two lists of types
6418 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6419 return 1 if the lists contain the same types in the same order.
6420 Also, the TREE_PURPOSEs must match. */
6423 type_list_equal (const_tree l1
, const_tree l2
)
6427 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6428 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6429 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6430 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6431 && (TREE_TYPE (TREE_PURPOSE (t1
))
6432 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6438 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6439 given by TYPE. If the argument list accepts variable arguments,
6440 then this function counts only the ordinary arguments. */
6443 type_num_arguments (const_tree type
)
6448 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6449 /* If the function does not take a variable number of arguments,
6450 the last element in the list will have type `void'. */
6451 if (VOID_TYPE_P (TREE_VALUE (t
)))
6459 /* Nonzero if integer constants T1 and T2
6460 represent the same constant value. */
6463 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6468 if (t1
== 0 || t2
== 0)
6471 if (TREE_CODE (t1
) == INTEGER_CST
6472 && TREE_CODE (t2
) == INTEGER_CST
6473 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6474 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6480 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6481 The precise way of comparison depends on their data type. */
6484 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6489 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6491 int t1_sgn
= tree_int_cst_sgn (t1
);
6492 int t2_sgn
= tree_int_cst_sgn (t2
);
6494 if (t1_sgn
< t2_sgn
)
6496 else if (t1_sgn
> t2_sgn
)
6498 /* Otherwise, both are non-negative, so we compare them as
6499 unsigned just in case one of them would overflow a signed
6502 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6503 return INT_CST_LT (t1
, t2
);
6505 return INT_CST_LT_UNSIGNED (t1
, t2
);
6508 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6511 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6513 if (tree_int_cst_lt (t1
, t2
))
6515 else if (tree_int_cst_lt (t2
, t1
))
6521 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6522 the host. If POS is zero, the value can be represented in a single
6523 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6524 be represented in a single unsigned HOST_WIDE_INT. */
6527 host_integerp (const_tree t
, int pos
)
6532 return (TREE_CODE (t
) == INTEGER_CST
6533 && ((TREE_INT_CST_HIGH (t
) == 0
6534 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6535 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6536 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6537 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6538 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6541 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6542 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6543 be non-negative. We must be able to satisfy the above conditions. */
6546 tree_low_cst (const_tree t
, int pos
)
6548 gcc_assert (host_integerp (t
, pos
));
6549 return TREE_INT_CST_LOW (t
);
6552 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6553 kind INTEGER_CST. This makes sure to properly sign-extend the
6557 size_low_cst (const_tree t
)
6559 double_int d
= tree_to_double_int (t
);
6560 return d
.sext (TYPE_PRECISION (TREE_TYPE (t
))).low
;
6563 /* Return the most significant (sign) bit of T. */
6566 tree_int_cst_sign_bit (const_tree t
)
6568 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6569 unsigned HOST_WIDE_INT w
;
6571 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6572 w
= TREE_INT_CST_LOW (t
);
6575 w
= TREE_INT_CST_HIGH (t
);
6576 bitno
-= HOST_BITS_PER_WIDE_INT
;
6579 return (w
>> bitno
) & 1;
6582 /* Return an indication of the sign of the integer constant T.
6583 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6584 Note that -1 will never be returned if T's type is unsigned. */
6587 tree_int_cst_sgn (const_tree t
)
6589 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6591 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6593 else if (TREE_INT_CST_HIGH (t
) < 0)
6599 /* Return the minimum number of bits needed to represent VALUE in a
6600 signed or unsigned type, UNSIGNEDP says which. */
6603 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6607 /* If the value is negative, compute its negative minus 1. The latter
6608 adjustment is because the absolute value of the largest negative value
6609 is one larger than the largest positive value. This is equivalent to
6610 a bit-wise negation, so use that operation instead. */
6612 if (tree_int_cst_sgn (value
) < 0)
6613 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6615 /* Return the number of bits needed, taking into account the fact
6616 that we need one more bit for a signed than unsigned type. */
6618 if (integer_zerop (value
))
6621 log
= tree_floor_log2 (value
);
6623 return log
+ 1 + !unsignedp
;
6626 /* Compare two constructor-element-type constants. Return 1 if the lists
6627 are known to be equal; otherwise return 0. */
6630 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6632 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6634 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6637 l1
= TREE_CHAIN (l1
);
6638 l2
= TREE_CHAIN (l2
);
6644 /* Return truthvalue of whether T1 is the same tree structure as T2.
6645 Return 1 if they are the same.
6646 Return 0 if they are understandably different.
6647 Return -1 if either contains tree structure not understood by
6651 simple_cst_equal (const_tree t1
, const_tree t2
)
6653 enum tree_code code1
, code2
;
6659 if (t1
== 0 || t2
== 0)
6662 code1
= TREE_CODE (t1
);
6663 code2
= TREE_CODE (t2
);
6665 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6667 if (CONVERT_EXPR_CODE_P (code2
)
6668 || code2
== NON_LVALUE_EXPR
)
6669 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6671 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6674 else if (CONVERT_EXPR_CODE_P (code2
)
6675 || code2
== NON_LVALUE_EXPR
)
6676 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6684 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6685 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6688 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6691 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6694 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6695 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6696 TREE_STRING_LENGTH (t1
)));
6700 unsigned HOST_WIDE_INT idx
;
6701 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6702 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6704 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6707 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6708 /* ??? Should we handle also fields here? */
6709 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
).value
,
6710 VEC_index (constructor_elt
, v2
, idx
).value
))
6716 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6719 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6722 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6725 const_tree arg1
, arg2
;
6726 const_call_expr_arg_iterator iter1
, iter2
;
6727 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6728 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6730 arg1
= next_const_call_expr_arg (&iter1
),
6731 arg2
= next_const_call_expr_arg (&iter2
))
6733 cmp
= simple_cst_equal (arg1
, arg2
);
6737 return arg1
== arg2
;
6741 /* Special case: if either target is an unallocated VAR_DECL,
6742 it means that it's going to be unified with whatever the
6743 TARGET_EXPR is really supposed to initialize, so treat it
6744 as being equivalent to anything. */
6745 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6746 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6747 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6748 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6749 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6750 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6753 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6758 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6760 case WITH_CLEANUP_EXPR
:
6761 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6765 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6768 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6769 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6783 /* This general rule works for most tree codes. All exceptions should be
6784 handled above. If this is a language-specific tree code, we can't
6785 trust what might be in the operand, so say we don't know
6787 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6790 switch (TREE_CODE_CLASS (code1
))
6794 case tcc_comparison
:
6795 case tcc_expression
:
6799 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6801 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6813 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6814 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6815 than U, respectively. */
6818 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6820 if (tree_int_cst_sgn (t
) < 0)
6822 else if (TREE_INT_CST_HIGH (t
) != 0)
6824 else if (TREE_INT_CST_LOW (t
) == u
)
6826 else if (TREE_INT_CST_LOW (t
) < u
)
6832 /* Return true if SIZE represents a constant size that is in bounds of
6833 what the middle-end and the backend accepts (covering not more than
6834 half of the address-space). */
6837 valid_constant_size_p (const_tree size
)
6839 if (! host_integerp (size
, 1)
6840 || TREE_OVERFLOW (size
)
6841 || tree_int_cst_sign_bit (size
) != 0)
6846 /* Return true if CODE represents an associative tree code. Otherwise
6849 associative_tree_code (enum tree_code code
)
6868 /* Return true if CODE represents a commutative tree code. Otherwise
6871 commutative_tree_code (enum tree_code code
)
6877 case MULT_HIGHPART_EXPR
:
6885 case UNORDERED_EXPR
:
6889 case TRUTH_AND_EXPR
:
6890 case TRUTH_XOR_EXPR
:
6892 case WIDEN_MULT_EXPR
:
6893 case VEC_WIDEN_MULT_HI_EXPR
:
6894 case VEC_WIDEN_MULT_LO_EXPR
:
6895 case VEC_WIDEN_MULT_EVEN_EXPR
:
6896 case VEC_WIDEN_MULT_ODD_EXPR
:
6905 /* Return true if CODE represents a ternary tree code for which the
6906 first two operands are commutative. Otherwise return false. */
6908 commutative_ternary_tree_code (enum tree_code code
)
6912 case WIDEN_MULT_PLUS_EXPR
:
6913 case WIDEN_MULT_MINUS_EXPR
:
6922 /* Generate a hash value for an expression. This can be used iteratively
6923 by passing a previous result as the VAL argument.
6925 This function is intended to produce the same hash for expressions which
6926 would compare equal using operand_equal_p. */
6929 iterative_hash_expr (const_tree t
, hashval_t val
)
6932 enum tree_code code
;
6936 return iterative_hash_hashval_t (0, val
);
6938 code
= TREE_CODE (t
);
6942 /* Alas, constants aren't shared, so we can't rely on pointer
6945 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6946 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6949 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6951 return iterative_hash_hashval_t (val2
, val
);
6955 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6957 return iterative_hash_hashval_t (val2
, val
);
6960 return iterative_hash (TREE_STRING_POINTER (t
),
6961 TREE_STRING_LENGTH (t
), val
);
6963 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6964 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
6968 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
6969 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
6973 /* We can just compare by pointer. */
6974 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
6975 case PLACEHOLDER_EXPR
:
6976 /* The node itself doesn't matter. */
6979 /* A list of expressions, for a CALL_EXPR or as the elements of a
6981 for (; t
; t
= TREE_CHAIN (t
))
6982 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
6986 unsigned HOST_WIDE_INT idx
;
6988 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
6990 val
= iterative_hash_expr (field
, val
);
6991 val
= iterative_hash_expr (value
, val
);
6997 /* The type of the second operand is relevant, except for
6998 its top-level qualifiers. */
6999 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7001 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7003 /* We could use the standard hash computation from this point
7005 val
= iterative_hash_object (code
, val
);
7006 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7007 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7011 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7012 Otherwise nodes that compare equal according to operand_equal_p might
7013 get different hash codes. However, don't do this for machine specific
7014 or front end builtins, since the function code is overloaded in those
7016 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7017 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7019 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7020 code
= TREE_CODE (t
);
7024 tclass
= TREE_CODE_CLASS (code
);
7026 if (tclass
== tcc_declaration
)
7028 /* DECL's have a unique ID */
7029 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7033 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7035 val
= iterative_hash_object (code
, val
);
7037 /* Don't hash the type, that can lead to having nodes which
7038 compare equal according to operand_equal_p, but which
7039 have different hash codes. */
7040 if (CONVERT_EXPR_CODE_P (code
)
7041 || code
== NON_LVALUE_EXPR
)
7043 /* Make sure to include signness in the hash computation. */
7044 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7045 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7048 else if (commutative_tree_code (code
))
7050 /* It's a commutative expression. We want to hash it the same
7051 however it appears. We do this by first hashing both operands
7052 and then rehashing based on the order of their independent
7054 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7055 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7059 t
= one
, one
= two
, two
= t
;
7061 val
= iterative_hash_hashval_t (one
, val
);
7062 val
= iterative_hash_hashval_t (two
, val
);
7065 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7066 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7072 /* Generate a hash value for a pair of expressions. This can be used
7073 iteratively by passing a previous result as the VAL argument.
7075 The same hash value is always returned for a given pair of expressions,
7076 regardless of the order in which they are presented. This is useful in
7077 hashing the operands of commutative functions. */
7080 iterative_hash_exprs_commutative (const_tree t1
,
7081 const_tree t2
, hashval_t val
)
7083 hashval_t one
= iterative_hash_expr (t1
, 0);
7084 hashval_t two
= iterative_hash_expr (t2
, 0);
7088 t
= one
, one
= two
, two
= t
;
7089 val
= iterative_hash_hashval_t (one
, val
);
7090 val
= iterative_hash_hashval_t (two
, val
);
7095 /* Constructors for pointer, array and function types.
7096 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7097 constructed by language-dependent code, not here.) */
7099 /* Construct, lay out and return the type of pointers to TO_TYPE with
7100 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7101 reference all of memory. If such a type has already been
7102 constructed, reuse it. */
7105 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7110 if (to_type
== error_mark_node
)
7111 return error_mark_node
;
7113 /* If the pointed-to type has the may_alias attribute set, force
7114 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7115 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7116 can_alias_all
= true;
7118 /* In some cases, languages will have things that aren't a POINTER_TYPE
7119 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7120 In that case, return that type without regard to the rest of our
7123 ??? This is a kludge, but consistent with the way this function has
7124 always operated and there doesn't seem to be a good way to avoid this
7126 if (TYPE_POINTER_TO (to_type
) != 0
7127 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7128 return TYPE_POINTER_TO (to_type
);
7130 /* First, if we already have a type for pointers to TO_TYPE and it's
7131 the proper mode, use it. */
7132 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7133 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7136 t
= make_node (POINTER_TYPE
);
7138 TREE_TYPE (t
) = to_type
;
7139 SET_TYPE_MODE (t
, mode
);
7140 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7141 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7142 TYPE_POINTER_TO (to_type
) = t
;
7144 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7145 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7146 else if (TYPE_CANONICAL (to_type
) != to_type
)
7148 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7149 mode
, can_alias_all
);
7151 /* Lay out the type. This function has many callers that are concerned
7152 with expression-construction, and this simplifies them all. */
7158 /* By default build pointers in ptr_mode. */
7161 build_pointer_type (tree to_type
)
7163 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7164 : TYPE_ADDR_SPACE (to_type
);
7165 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7166 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7169 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7172 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7177 if (to_type
== error_mark_node
)
7178 return error_mark_node
;
7180 /* If the pointed-to type has the may_alias attribute set, force
7181 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7182 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7183 can_alias_all
= true;
7185 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7186 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7187 In that case, return that type without regard to the rest of our
7190 ??? This is a kludge, but consistent with the way this function has
7191 always operated and there doesn't seem to be a good way to avoid this
7193 if (TYPE_REFERENCE_TO (to_type
) != 0
7194 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7195 return TYPE_REFERENCE_TO (to_type
);
7197 /* First, if we already have a type for pointers to TO_TYPE and it's
7198 the proper mode, use it. */
7199 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7200 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7203 t
= make_node (REFERENCE_TYPE
);
7205 TREE_TYPE (t
) = to_type
;
7206 SET_TYPE_MODE (t
, mode
);
7207 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7208 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7209 TYPE_REFERENCE_TO (to_type
) = t
;
7211 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7212 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7213 else if (TYPE_CANONICAL (to_type
) != to_type
)
7215 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7216 mode
, can_alias_all
);
7224 /* Build the node for the type of references-to-TO_TYPE by default
7228 build_reference_type (tree to_type
)
7230 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7231 : TYPE_ADDR_SPACE (to_type
);
7232 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7233 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7236 /* Build a type that is compatible with t but has no cv quals anywhere
7239 const char *const *const * -> char ***. */
7242 build_type_no_quals (tree t
)
7244 switch (TREE_CODE (t
))
7247 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7249 TYPE_REF_CAN_ALIAS_ALL (t
));
7250 case REFERENCE_TYPE
:
7252 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7254 TYPE_REF_CAN_ALIAS_ALL (t
));
7256 return TYPE_MAIN_VARIANT (t
);
7260 #define MAX_INT_CACHED_PREC \
7261 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7262 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7264 /* Builds a signed or unsigned integer type of precision PRECISION.
7265 Used for C bitfields whose precision does not match that of
7266 built-in target types. */
7268 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7274 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7276 if (precision
<= MAX_INT_CACHED_PREC
)
7278 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7283 itype
= make_node (INTEGER_TYPE
);
7284 TYPE_PRECISION (itype
) = precision
;
7287 fixup_unsigned_type (itype
);
7289 fixup_signed_type (itype
);
7292 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7293 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7294 if (precision
<= MAX_INT_CACHED_PREC
)
7295 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7300 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7301 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7302 is true, reuse such a type that has already been constructed. */
7305 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7307 tree itype
= make_node (INTEGER_TYPE
);
7308 hashval_t hashcode
= 0;
7310 TREE_TYPE (itype
) = type
;
7312 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7313 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7315 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7316 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7317 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7318 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7319 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7320 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7325 if ((TYPE_MIN_VALUE (itype
)
7326 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7327 || (TYPE_MAX_VALUE (itype
)
7328 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7330 /* Since we cannot reliably merge this type, we need to compare it using
7331 structural equality checks. */
7332 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7336 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7337 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7338 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7339 itype
= type_hash_canon (hashcode
, itype
);
7344 /* Wrapper around build_range_type_1 with SHARED set to true. */
7347 build_range_type (tree type
, tree lowval
, tree highval
)
7349 return build_range_type_1 (type
, lowval
, highval
, true);
7352 /* Wrapper around build_range_type_1 with SHARED set to false. */
7355 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7357 return build_range_type_1 (type
, lowval
, highval
, false);
7360 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7361 MAXVAL should be the maximum value in the domain
7362 (one less than the length of the array).
7364 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7365 We don't enforce this limit, that is up to caller (e.g. language front end).
7366 The limit exists because the result is a signed type and we don't handle
7367 sizes that use more than one HOST_WIDE_INT. */
7370 build_index_type (tree maxval
)
7372 return build_range_type (sizetype
, size_zero_node
, maxval
);
7375 /* Return true if the debug information for TYPE, a subtype, should be emitted
7376 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7377 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7378 debug info and doesn't reflect the source code. */
7381 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7383 tree base_type
= TREE_TYPE (type
), low
, high
;
7385 /* Subrange types have a base type which is an integral type. */
7386 if (!INTEGRAL_TYPE_P (base_type
))
7389 /* Get the real bounds of the subtype. */
7390 if (lang_hooks
.types
.get_subrange_bounds
)
7391 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7394 low
= TYPE_MIN_VALUE (type
);
7395 high
= TYPE_MAX_VALUE (type
);
7398 /* If the type and its base type have the same representation and the same
7399 name, then the type is not a subrange but a copy of the base type. */
7400 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7401 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7402 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7403 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7404 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7406 tree type_name
= TYPE_NAME (type
);
7407 tree base_type_name
= TYPE_NAME (base_type
);
7409 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7410 type_name
= DECL_NAME (type_name
);
7412 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7413 base_type_name
= DECL_NAME (base_type_name
);
7415 if (type_name
== base_type_name
)
7426 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7427 and number of elements specified by the range of values of INDEX_TYPE.
7428 If SHARED is true, reuse such a type that has already been constructed. */
7431 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7435 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7437 error ("arrays of functions are not meaningful");
7438 elt_type
= integer_type_node
;
7441 t
= make_node (ARRAY_TYPE
);
7442 TREE_TYPE (t
) = elt_type
;
7443 TYPE_DOMAIN (t
) = index_type
;
7444 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7447 /* If the element type is incomplete at this point we get marked for
7448 structural equality. Do not record these types in the canonical
7450 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7455 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7457 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7458 t
= type_hash_canon (hashcode
, t
);
7461 if (TYPE_CANONICAL (t
) == t
)
7463 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7464 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7465 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7466 else if (TYPE_CANONICAL (elt_type
) != elt_type
7467 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7469 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7471 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7478 /* Wrapper around build_array_type_1 with SHARED set to true. */
7481 build_array_type (tree elt_type
, tree index_type
)
7483 return build_array_type_1 (elt_type
, index_type
, true);
7486 /* Wrapper around build_array_type_1 with SHARED set to false. */
7489 build_nonshared_array_type (tree elt_type
, tree index_type
)
7491 return build_array_type_1 (elt_type
, index_type
, false);
7494 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7498 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7500 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7503 /* Recursively examines the array elements of TYPE, until a non-array
7504 element type is found. */
7507 strip_array_types (tree type
)
7509 while (TREE_CODE (type
) == ARRAY_TYPE
)
7510 type
= TREE_TYPE (type
);
7515 /* Computes the canonical argument types from the argument type list
7518 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7519 on entry to this function, or if any of the ARGTYPES are
7522 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7523 true on entry to this function, or if any of the ARGTYPES are
7526 Returns a canonical argument list, which may be ARGTYPES when the
7527 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7528 true) or would not differ from ARGTYPES. */
7531 maybe_canonicalize_argtypes(tree argtypes
,
7532 bool *any_structural_p
,
7533 bool *any_noncanonical_p
)
7536 bool any_noncanonical_argtypes_p
= false;
7538 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7540 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7541 /* Fail gracefully by stating that the type is structural. */
7542 *any_structural_p
= true;
7543 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7544 *any_structural_p
= true;
7545 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7546 || TREE_PURPOSE (arg
))
7547 /* If the argument has a default argument, we consider it
7548 non-canonical even though the type itself is canonical.
7549 That way, different variants of function and method types
7550 with default arguments will all point to the variant with
7551 no defaults as their canonical type. */
7552 any_noncanonical_argtypes_p
= true;
7555 if (*any_structural_p
)
7558 if (any_noncanonical_argtypes_p
)
7560 /* Build the canonical list of argument types. */
7561 tree canon_argtypes
= NULL_TREE
;
7562 bool is_void
= false;
7564 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7566 if (arg
== void_list_node
)
7569 canon_argtypes
= tree_cons (NULL_TREE
,
7570 TYPE_CANONICAL (TREE_VALUE (arg
)),
7574 canon_argtypes
= nreverse (canon_argtypes
);
7576 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7578 /* There is a non-canonical type. */
7579 *any_noncanonical_p
= true;
7580 return canon_argtypes
;
7583 /* The canonical argument types are the same as ARGTYPES. */
7587 /* Construct, lay out and return
7588 the type of functions returning type VALUE_TYPE
7589 given arguments of types ARG_TYPES.
7590 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7591 are data type nodes for the arguments of the function.
7592 If such a type has already been constructed, reuse it. */
7595 build_function_type (tree value_type
, tree arg_types
)
7598 hashval_t hashcode
= 0;
7599 bool any_structural_p
, any_noncanonical_p
;
7600 tree canon_argtypes
;
7602 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7604 error ("function return type cannot be function");
7605 value_type
= integer_type_node
;
7608 /* Make a node of the sort we want. */
7609 t
= make_node (FUNCTION_TYPE
);
7610 TREE_TYPE (t
) = value_type
;
7611 TYPE_ARG_TYPES (t
) = arg_types
;
7613 /* If we already have such a type, use the old one. */
7614 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7615 hashcode
= type_hash_list (arg_types
, hashcode
);
7616 t
= type_hash_canon (hashcode
, t
);
7618 /* Set up the canonical type. */
7619 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7620 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7621 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7623 &any_noncanonical_p
);
7624 if (any_structural_p
)
7625 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7626 else if (any_noncanonical_p
)
7627 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7630 if (!COMPLETE_TYPE_P (t
))
7635 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7636 return value if SKIP_RETURN is true. */
7639 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7642 tree new_type
= NULL
;
7643 tree args
, new_args
= NULL
, t
;
7647 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7648 args
= TREE_CHAIN (args
), i
++)
7649 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7650 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7652 new_reversed
= nreverse (new_args
);
7656 TREE_CHAIN (new_args
) = void_list_node
;
7658 new_reversed
= void_list_node
;
7661 /* Use copy_node to preserve as much as possible from original type
7662 (debug info, attribute lists etc.)
7663 Exception is METHOD_TYPEs must have THIS argument.
7664 When we are asked to remove it, we need to build new FUNCTION_TYPE
7666 if (TREE_CODE (orig_type
) != METHOD_TYPE
7668 || !bitmap_bit_p (args_to_skip
, 0))
7670 new_type
= build_distinct_type_copy (orig_type
);
7671 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7676 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7678 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7682 TREE_TYPE (new_type
) = void_type_node
;
7684 /* This is a new type, not a copy of an old type. Need to reassociate
7685 variants. We can handle everything except the main variant lazily. */
7686 t
= TYPE_MAIN_VARIANT (orig_type
);
7689 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7690 TYPE_MAIN_VARIANT (new_type
) = t
;
7691 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7692 TYPE_NEXT_VARIANT (t
) = new_type
;
7696 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7697 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7703 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7704 return value if SKIP_RETURN is true.
7706 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7707 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7708 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7711 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
7714 tree new_decl
= copy_node (orig_decl
);
7717 new_type
= TREE_TYPE (orig_decl
);
7718 if (prototype_p (new_type
)
7719 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
7721 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
7722 TREE_TYPE (new_decl
) = new_type
;
7724 /* For declarations setting DECL_VINDEX (i.e. methods)
7725 we expect first argument to be THIS pointer. */
7726 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
7727 DECL_VINDEX (new_decl
) = NULL_TREE
;
7729 /* When signature changes, we need to clear builtin info. */
7730 if (DECL_BUILT_IN (new_decl
)
7732 && !bitmap_empty_p (args_to_skip
))
7734 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7735 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7740 /* Build a function type. The RETURN_TYPE is the type returned by the
7741 function. If VAARGS is set, no void_type_node is appended to the
7742 the list. ARGP must be always be terminated be a NULL_TREE. */
7745 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7749 t
= va_arg (argp
, tree
);
7750 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7751 args
= tree_cons (NULL_TREE
, t
, args
);
7756 if (args
!= NULL_TREE
)
7757 args
= nreverse (args
);
7758 gcc_assert (last
!= void_list_node
);
7760 else if (args
== NULL_TREE
)
7761 args
= void_list_node
;
7765 args
= nreverse (args
);
7766 TREE_CHAIN (last
) = void_list_node
;
7768 args
= build_function_type (return_type
, args
);
7773 /* Build a function type. The RETURN_TYPE is the type returned by the
7774 function. If additional arguments are provided, they are
7775 additional argument types. The list of argument types must always
7776 be terminated by NULL_TREE. */
7779 build_function_type_list (tree return_type
, ...)
7784 va_start (p
, return_type
);
7785 args
= build_function_type_list_1 (false, return_type
, p
);
7790 /* Build a variable argument function type. The RETURN_TYPE is the
7791 type returned by the function. If additional arguments are provided,
7792 they are additional argument types. The list of argument types must
7793 always be terminated by NULL_TREE. */
7796 build_varargs_function_type_list (tree return_type
, ...)
7801 va_start (p
, return_type
);
7802 args
= build_function_type_list_1 (true, return_type
, p
);
7808 /* Build a function type. RETURN_TYPE is the type returned by the
7809 function; VAARGS indicates whether the function takes varargs. The
7810 function takes N named arguments, the types of which are provided in
7814 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7818 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7820 for (i
= n
- 1; i
>= 0; i
--)
7821 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7823 return build_function_type (return_type
, t
);
7826 /* Build a function type. RETURN_TYPE is the type returned by the
7827 function. The function takes N named arguments, the types of which
7828 are provided in ARG_TYPES. */
7831 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7833 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7836 /* Build a variable argument function type. RETURN_TYPE is the type
7837 returned by the function. The function takes N named arguments, the
7838 types of which are provided in ARG_TYPES. */
7841 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7843 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7846 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7847 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7848 for the method. An implicit additional parameter (of type
7849 pointer-to-BASETYPE) is added to the ARGTYPES. */
7852 build_method_type_directly (tree basetype
,
7859 bool any_structural_p
, any_noncanonical_p
;
7860 tree canon_argtypes
;
7862 /* Make a node of the sort we want. */
7863 t
= make_node (METHOD_TYPE
);
7865 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7866 TREE_TYPE (t
) = rettype
;
7867 ptype
= build_pointer_type (basetype
);
7869 /* The actual arglist for this function includes a "hidden" argument
7870 which is "this". Put it into the list of argument types. */
7871 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7872 TYPE_ARG_TYPES (t
) = argtypes
;
7874 /* If we already have such a type, use the old one. */
7875 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7876 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7877 hashcode
= type_hash_list (argtypes
, hashcode
);
7878 t
= type_hash_canon (hashcode
, t
);
7880 /* Set up the canonical type. */
7882 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7883 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7885 = (TYPE_CANONICAL (basetype
) != basetype
7886 || TYPE_CANONICAL (rettype
) != rettype
);
7887 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7889 &any_noncanonical_p
);
7890 if (any_structural_p
)
7891 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7892 else if (any_noncanonical_p
)
7894 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7895 TYPE_CANONICAL (rettype
),
7897 if (!COMPLETE_TYPE_P (t
))
7903 /* Construct, lay out and return the type of methods belonging to class
7904 BASETYPE and whose arguments and values are described by TYPE.
7905 If that type exists already, reuse it.
7906 TYPE must be a FUNCTION_TYPE node. */
7909 build_method_type (tree basetype
, tree type
)
7911 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7913 return build_method_type_directly (basetype
,
7915 TYPE_ARG_TYPES (type
));
7918 /* Construct, lay out and return the type of offsets to a value
7919 of type TYPE, within an object of type BASETYPE.
7920 If a suitable offset type exists already, reuse it. */
7923 build_offset_type (tree basetype
, tree type
)
7926 hashval_t hashcode
= 0;
7928 /* Make a node of the sort we want. */
7929 t
= make_node (OFFSET_TYPE
);
7931 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7932 TREE_TYPE (t
) = type
;
7934 /* If we already have such a type, use the old one. */
7935 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7936 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7937 t
= type_hash_canon (hashcode
, t
);
7939 if (!COMPLETE_TYPE_P (t
))
7942 if (TYPE_CANONICAL (t
) == t
)
7944 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7945 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7946 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7947 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7948 || TYPE_CANONICAL (type
) != type
)
7950 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7951 TYPE_CANONICAL (type
));
7957 /* Create a complex type whose components are COMPONENT_TYPE. */
7960 build_complex_type (tree component_type
)
7965 gcc_assert (INTEGRAL_TYPE_P (component_type
)
7966 || SCALAR_FLOAT_TYPE_P (component_type
)
7967 || FIXED_POINT_TYPE_P (component_type
));
7969 /* Make a node of the sort we want. */
7970 t
= make_node (COMPLEX_TYPE
);
7972 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
7974 /* If we already have such a type, use the old one. */
7975 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
7976 t
= type_hash_canon (hashcode
, t
);
7978 if (!COMPLETE_TYPE_P (t
))
7981 if (TYPE_CANONICAL (t
) == t
)
7983 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
7984 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7985 else if (TYPE_CANONICAL (component_type
) != component_type
)
7987 = build_complex_type (TYPE_CANONICAL (component_type
));
7990 /* We need to create a name, since complex is a fundamental type. */
7991 if (! TYPE_NAME (t
))
7994 if (component_type
== char_type_node
)
7995 name
= "complex char";
7996 else if (component_type
== signed_char_type_node
)
7997 name
= "complex signed char";
7998 else if (component_type
== unsigned_char_type_node
)
7999 name
= "complex unsigned char";
8000 else if (component_type
== short_integer_type_node
)
8001 name
= "complex short int";
8002 else if (component_type
== short_unsigned_type_node
)
8003 name
= "complex short unsigned int";
8004 else if (component_type
== integer_type_node
)
8005 name
= "complex int";
8006 else if (component_type
== unsigned_type_node
)
8007 name
= "complex unsigned int";
8008 else if (component_type
== long_integer_type_node
)
8009 name
= "complex long int";
8010 else if (component_type
== long_unsigned_type_node
)
8011 name
= "complex long unsigned int";
8012 else if (component_type
== long_long_integer_type_node
)
8013 name
= "complex long long int";
8014 else if (component_type
== long_long_unsigned_type_node
)
8015 name
= "complex long long unsigned int";
8020 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8021 get_identifier (name
), t
);
8024 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8027 /* If TYPE is a real or complex floating-point type and the target
8028 does not directly support arithmetic on TYPE then return the wider
8029 type to be used for arithmetic on TYPE. Otherwise, return
8033 excess_precision_type (tree type
)
8035 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8037 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8038 switch (TREE_CODE (type
))
8041 switch (flt_eval_method
)
8044 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8045 return double_type_node
;
8048 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8049 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8050 return long_double_type_node
;
8057 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8059 switch (flt_eval_method
)
8062 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8063 return complex_double_type_node
;
8066 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8067 || (TYPE_MODE (TREE_TYPE (type
))
8068 == TYPE_MODE (double_type_node
)))
8069 return complex_long_double_type_node
;
8082 /* Return OP, stripped of any conversions to wider types as much as is safe.
8083 Converting the value back to OP's type makes a value equivalent to OP.
8085 If FOR_TYPE is nonzero, we return a value which, if converted to
8086 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8088 OP must have integer, real or enumeral type. Pointers are not allowed!
8090 There are some cases where the obvious value we could return
8091 would regenerate to OP if converted to OP's type,
8092 but would not extend like OP to wider types.
8093 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8094 For example, if OP is (unsigned short)(signed char)-1,
8095 we avoid returning (signed char)-1 if FOR_TYPE is int,
8096 even though extending that to an unsigned short would regenerate OP,
8097 since the result of extending (signed char)-1 to (int)
8098 is different from (int) OP. */
8101 get_unwidened (tree op
, tree for_type
)
8103 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8104 tree type
= TREE_TYPE (op
);
8106 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8108 = (for_type
!= 0 && for_type
!= type
8109 && final_prec
> TYPE_PRECISION (type
)
8110 && TYPE_UNSIGNED (type
));
8113 while (CONVERT_EXPR_P (op
))
8117 /* TYPE_PRECISION on vector types has different meaning
8118 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8119 so avoid them here. */
8120 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8123 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8124 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8126 /* Truncations are many-one so cannot be removed.
8127 Unless we are later going to truncate down even farther. */
8129 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8132 /* See what's inside this conversion. If we decide to strip it,
8134 op
= TREE_OPERAND (op
, 0);
8136 /* If we have not stripped any zero-extensions (uns is 0),
8137 we can strip any kind of extension.
8138 If we have previously stripped a zero-extension,
8139 only zero-extensions can safely be stripped.
8140 Any extension can be stripped if the bits it would produce
8141 are all going to be discarded later by truncating to FOR_TYPE. */
8145 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8147 /* TYPE_UNSIGNED says whether this is a zero-extension.
8148 Let's avoid computing it if it does not affect WIN
8149 and if UNS will not be needed again. */
8151 || CONVERT_EXPR_P (op
))
8152 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8160 /* If we finally reach a constant see if it fits in for_type and
8161 in that case convert it. */
8163 && TREE_CODE (win
) == INTEGER_CST
8164 && TREE_TYPE (win
) != for_type
8165 && int_fits_type_p (win
, for_type
))
8166 win
= fold_convert (for_type
, win
);
8171 /* Return OP or a simpler expression for a narrower value
8172 which can be sign-extended or zero-extended to give back OP.
8173 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8174 or 0 if the value should be sign-extended. */
8177 get_narrower (tree op
, int *unsignedp_ptr
)
8182 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8184 while (TREE_CODE (op
) == NOP_EXPR
)
8187 = (TYPE_PRECISION (TREE_TYPE (op
))
8188 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8190 /* Truncations are many-one so cannot be removed. */
8194 /* See what's inside this conversion. If we decide to strip it,
8199 op
= TREE_OPERAND (op
, 0);
8200 /* An extension: the outermost one can be stripped,
8201 but remember whether it is zero or sign extension. */
8203 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8204 /* Otherwise, if a sign extension has been stripped,
8205 only sign extensions can now be stripped;
8206 if a zero extension has been stripped, only zero-extensions. */
8207 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8211 else /* bitschange == 0 */
8213 /* A change in nominal type can always be stripped, but we must
8214 preserve the unsignedness. */
8216 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8218 op
= TREE_OPERAND (op
, 0);
8219 /* Keep trying to narrow, but don't assign op to win if it
8220 would turn an integral type into something else. */
8221 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8228 if (TREE_CODE (op
) == COMPONENT_REF
8229 /* Since type_for_size always gives an integer type. */
8230 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8231 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8232 /* Ensure field is laid out already. */
8233 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8234 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8236 unsigned HOST_WIDE_INT innerprec
8237 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8238 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8239 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8240 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8242 /* We can get this structure field in a narrower type that fits it,
8243 but the resulting extension to its nominal type (a fullword type)
8244 must satisfy the same conditions as for other extensions.
8246 Do this only for fields that are aligned (not bit-fields),
8247 because when bit-field insns will be used there is no
8248 advantage in doing this. */
8250 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8251 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8252 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8256 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8257 win
= fold_convert (type
, op
);
8261 *unsignedp_ptr
= uns
;
8265 /* Returns true if integer constant C has a value that is permissible
8266 for type TYPE (an INTEGER_TYPE). */
8269 int_fits_type_p (const_tree c
, const_tree type
)
8271 tree type_low_bound
, type_high_bound
;
8272 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8275 dc
= tree_to_double_int (c
);
8276 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8279 type_low_bound
= TYPE_MIN_VALUE (type
);
8280 type_high_bound
= TYPE_MAX_VALUE (type
);
8282 /* If at least one bound of the type is a constant integer, we can check
8283 ourselves and maybe make a decision. If no such decision is possible, but
8284 this type is a subtype, try checking against that. Otherwise, use
8285 double_int_fits_to_tree_p, which checks against the precision.
8287 Compute the status for each possibly constant bound, and return if we see
8288 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8289 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8290 for "constant known to fit". */
8292 /* Check if c >= type_low_bound. */
8293 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8295 dd
= tree_to_double_int (type_low_bound
);
8296 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8298 int c_neg
= (!unsc
&& dc
.is_negative ());
8299 int t_neg
= (unsc
&& dd
.is_negative ());
8301 if (c_neg
&& !t_neg
)
8303 if ((c_neg
|| !t_neg
) && dc
.ult (dd
))
8306 else if (dc
.cmp (dd
, unsc
) < 0)
8308 ok_for_low_bound
= true;
8311 ok_for_low_bound
= false;
8313 /* Check if c <= type_high_bound. */
8314 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8316 dd
= tree_to_double_int (type_high_bound
);
8317 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8319 int c_neg
= (!unsc
&& dc
.is_negative ());
8320 int t_neg
= (unsc
&& dd
.is_negative ());
8322 if (t_neg
&& !c_neg
)
8324 if ((t_neg
|| !c_neg
) && dc
.ugt (dd
))
8327 else if (dc
.cmp (dd
, unsc
) > 0)
8329 ok_for_high_bound
= true;
8332 ok_for_high_bound
= false;
8334 /* If the constant fits both bounds, the result is known. */
8335 if (ok_for_low_bound
&& ok_for_high_bound
)
8338 /* Perform some generic filtering which may allow making a decision
8339 even if the bounds are not constant. First, negative integers
8340 never fit in unsigned types, */
8341 if (TYPE_UNSIGNED (type
) && !unsc
&& dc
.is_negative ())
8344 /* Second, narrower types always fit in wider ones. */
8345 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8348 /* Third, unsigned integers with top bit set never fit signed types. */
8349 if (! TYPE_UNSIGNED (type
) && unsc
)
8351 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8352 if (prec
< HOST_BITS_PER_WIDE_INT
)
8354 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8357 else if (((((unsigned HOST_WIDE_INT
) 1)
8358 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8362 /* If we haven't been able to decide at this point, there nothing more we
8363 can check ourselves here. Look at the base type if we have one and it
8364 has the same precision. */
8365 if (TREE_CODE (type
) == INTEGER_TYPE
8366 && TREE_TYPE (type
) != 0
8367 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8369 type
= TREE_TYPE (type
);
8373 /* Or to double_int_fits_to_tree_p, if nothing else. */
8374 return double_int_fits_to_tree_p (type
, dc
);
8377 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8378 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8379 represented (assuming two's-complement arithmetic) within the bit
8380 precision of the type are returned instead. */
8383 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8385 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8386 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8387 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8388 TYPE_UNSIGNED (type
));
8391 if (TYPE_UNSIGNED (type
))
8392 mpz_set_ui (min
, 0);
8396 mn
= double_int::mask (TYPE_PRECISION (type
) - 1);
8397 mn
= (mn
+ double_int_one
).sext (TYPE_PRECISION (type
));
8398 mpz_set_double_int (min
, mn
, false);
8402 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8403 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8404 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8405 TYPE_UNSIGNED (type
));
8408 if (TYPE_UNSIGNED (type
))
8409 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
)),
8412 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
) - 1),
8417 /* Return true if VAR is an automatic variable defined in function FN. */
8420 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8422 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8423 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8424 || TREE_CODE (var
) == PARM_DECL
)
8425 && ! TREE_STATIC (var
))
8426 || TREE_CODE (var
) == LABEL_DECL
8427 || TREE_CODE (var
) == RESULT_DECL
));
8430 /* Subprogram of following function. Called by walk_tree.
8432 Return *TP if it is an automatic variable or parameter of the
8433 function passed in as DATA. */
8436 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8438 tree fn
= (tree
) data
;
8443 else if (DECL_P (*tp
)
8444 && auto_var_in_fn_p (*tp
, fn
))
8450 /* Returns true if T is, contains, or refers to a type with variable
8451 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8452 arguments, but not the return type. If FN is nonzero, only return
8453 true if a modifier of the type or position of FN is a variable or
8454 parameter inside FN.
8456 This concept is more general than that of C99 'variably modified types':
8457 in C99, a struct type is never variably modified because a VLA may not
8458 appear as a structure member. However, in GNU C code like:
8460 struct S { int i[f()]; };
8462 is valid, and other languages may define similar constructs. */
8465 variably_modified_type_p (tree type
, tree fn
)
8469 /* Test if T is either variable (if FN is zero) or an expression containing
8470 a variable in FN. If TYPE isn't gimplified, return true also if
8471 gimplify_one_sizepos would gimplify the expression into a local
8473 #define RETURN_TRUE_IF_VAR(T) \
8474 do { tree _t = (T); \
8475 if (_t != NULL_TREE \
8476 && _t != error_mark_node \
8477 && TREE_CODE (_t) != INTEGER_CST \
8478 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8480 || (!TYPE_SIZES_GIMPLIFIED (type) \
8481 && !is_gimple_sizepos (_t)) \
8482 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8483 return true; } while (0)
8485 if (type
== error_mark_node
)
8488 /* If TYPE itself has variable size, it is variably modified. */
8489 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8490 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8492 switch (TREE_CODE (type
))
8495 case REFERENCE_TYPE
:
8497 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8503 /* If TYPE is a function type, it is variably modified if the
8504 return type is variably modified. */
8505 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8511 case FIXED_POINT_TYPE
:
8514 /* Scalar types are variably modified if their end points
8516 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8517 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8522 case QUAL_UNION_TYPE
:
8523 /* We can't see if any of the fields are variably-modified by the
8524 definition we normally use, since that would produce infinite
8525 recursion via pointers. */
8526 /* This is variably modified if some field's type is. */
8527 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8528 if (TREE_CODE (t
) == FIELD_DECL
)
8530 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8531 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8532 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8534 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8535 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8540 /* Do not call ourselves to avoid infinite recursion. This is
8541 variably modified if the element type is. */
8542 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8543 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8550 /* The current language may have other cases to check, but in general,
8551 all other types are not variably modified. */
8552 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8554 #undef RETURN_TRUE_IF_VAR
8557 /* Given a DECL or TYPE, return the scope in which it was declared, or
8558 NULL_TREE if there is no containing scope. */
8561 get_containing_scope (const_tree t
)
8563 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8566 /* Return the innermost context enclosing DECL that is
8567 a FUNCTION_DECL, or zero if none. */
8570 decl_function_context (const_tree decl
)
8574 if (TREE_CODE (decl
) == ERROR_MARK
)
8577 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8578 where we look up the function at runtime. Such functions always take
8579 a first argument of type 'pointer to real context'.
8581 C++ should really be fixed to use DECL_CONTEXT for the real context,
8582 and use something else for the "virtual context". */
8583 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8586 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8588 context
= DECL_CONTEXT (decl
);
8590 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8592 if (TREE_CODE (context
) == BLOCK
)
8593 context
= BLOCK_SUPERCONTEXT (context
);
8595 context
= get_containing_scope (context
);
8601 /* Return the innermost context enclosing DECL that is
8602 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8603 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8606 decl_type_context (const_tree decl
)
8608 tree context
= DECL_CONTEXT (decl
);
8611 switch (TREE_CODE (context
))
8613 case NAMESPACE_DECL
:
8614 case TRANSLATION_UNIT_DECL
:
8619 case QUAL_UNION_TYPE
:
8624 context
= DECL_CONTEXT (context
);
8628 context
= BLOCK_SUPERCONTEXT (context
);
8638 /* CALL is a CALL_EXPR. Return the declaration for the function
8639 called, or NULL_TREE if the called function cannot be
8643 get_callee_fndecl (const_tree call
)
8647 if (call
== error_mark_node
)
8648 return error_mark_node
;
8650 /* It's invalid to call this function with anything but a
8652 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8654 /* The first operand to the CALL is the address of the function
8656 addr
= CALL_EXPR_FN (call
);
8660 /* If this is a readonly function pointer, extract its initial value. */
8661 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8662 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8663 && DECL_INITIAL (addr
))
8664 addr
= DECL_INITIAL (addr
);
8666 /* If the address is just `&f' for some function `f', then we know
8667 that `f' is being called. */
8668 if (TREE_CODE (addr
) == ADDR_EXPR
8669 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8670 return TREE_OPERAND (addr
, 0);
8672 /* We couldn't figure out what was being called. */
8676 /* Print debugging information about tree nodes generated during the compile,
8677 and any language-specific information. */
8680 dump_tree_statistics (void)
8682 if (GATHER_STATISTICS
)
8685 int total_nodes
, total_bytes
;
8686 fprintf (stderr
, "Kind Nodes Bytes\n");
8687 fprintf (stderr
, "---------------------------------------\n");
8688 total_nodes
= total_bytes
= 0;
8689 for (i
= 0; i
< (int) all_kinds
; i
++)
8691 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8692 tree_node_counts
[i
], tree_node_sizes
[i
]);
8693 total_nodes
+= tree_node_counts
[i
];
8694 total_bytes
+= tree_node_sizes
[i
];
8696 fprintf (stderr
, "---------------------------------------\n");
8697 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8698 fprintf (stderr
, "---------------------------------------\n");
8699 fprintf (stderr
, "Code Nodes\n");
8700 fprintf (stderr
, "----------------------------\n");
8701 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8702 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8703 fprintf (stderr
, "----------------------------\n");
8704 ssanames_print_statistics ();
8705 phinodes_print_statistics ();
8708 fprintf (stderr
, "(No per-node statistics)\n");
8710 print_type_hash_statistics ();
8711 print_debug_expr_statistics ();
8712 print_value_expr_statistics ();
8713 lang_hooks
.print_statistics ();
8716 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8718 /* Generate a crc32 of a byte. */
8721 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8725 for (ix
= bits
; ix
--; value
<<= 1)
8729 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8736 /* Generate a crc32 of a 32-bit unsigned. */
8739 crc32_unsigned (unsigned chksum
, unsigned value
)
8741 return crc32_unsigned_bits (chksum
, value
, 32);
8744 /* Generate a crc32 of a byte. */
8747 crc32_byte (unsigned chksum
, char byte
)
8749 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8752 /* Generate a crc32 of a string. */
8755 crc32_string (unsigned chksum
, const char *string
)
8759 chksum
= crc32_byte (chksum
, *string
);
8765 /* P is a string that will be used in a symbol. Mask out any characters
8766 that are not valid in that context. */
8769 clean_symbol_name (char *p
)
8773 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8776 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8783 /* Generate a name for a special-purpose function.
8784 The generated name may need to be unique across the whole link.
8785 Changes to this function may also require corresponding changes to
8786 xstrdup_mask_random.
8787 TYPE is some string to identify the purpose of this function to the
8788 linker or collect2; it must start with an uppercase letter,
8790 I - for constructors
8792 N - for C++ anonymous namespaces
8793 F - for DWARF unwind frame information. */
8796 get_file_function_name (const char *type
)
8802 /* If we already have a name we know to be unique, just use that. */
8803 if (first_global_object_name
)
8804 p
= q
= ASTRDUP (first_global_object_name
);
8805 /* If the target is handling the constructors/destructors, they
8806 will be local to this file and the name is only necessary for
8808 We also assign sub_I and sub_D sufixes to constructors called from
8809 the global static constructors. These are always local. */
8810 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8811 || (strncmp (type
, "sub_", 4) == 0
8812 && (type
[4] == 'I' || type
[4] == 'D')))
8814 const char *file
= main_input_filename
;
8816 file
= input_filename
;
8817 /* Just use the file's basename, because the full pathname
8818 might be quite long. */
8819 p
= q
= ASTRDUP (lbasename (file
));
8823 /* Otherwise, the name must be unique across the entire link.
8824 We don't have anything that we know to be unique to this translation
8825 unit, so use what we do have and throw in some randomness. */
8827 const char *name
= weak_global_object_name
;
8828 const char *file
= main_input_filename
;
8833 file
= input_filename
;
8835 len
= strlen (file
);
8836 q
= (char *) alloca (9 + 17 + len
+ 1);
8837 memcpy (q
, file
, len
+ 1);
8839 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8840 crc32_string (0, name
), get_random_seed (false));
8845 clean_symbol_name (q
);
8846 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8849 /* Set up the name of the file-level functions we may need.
8850 Use a global object (which is already required to be unique over
8851 the program) rather than the file name (which imposes extra
8853 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8855 return get_identifier (buf
);
8858 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8860 /* Complain that the tree code of NODE does not match the expected 0
8861 terminated list of trailing codes. The trailing code list can be
8862 empty, for a more vague error message. FILE, LINE, and FUNCTION
8863 are of the caller. */
8866 tree_check_failed (const_tree node
, const char *file
,
8867 int line
, const char *function
, ...)
8871 unsigned length
= 0;
8874 va_start (args
, function
);
8875 while ((code
= va_arg (args
, int)))
8876 length
+= 4 + strlen (tree_code_name
[code
]);
8881 va_start (args
, function
);
8882 length
+= strlen ("expected ");
8883 buffer
= tmp
= (char *) alloca (length
);
8885 while ((code
= va_arg (args
, int)))
8887 const char *prefix
= length
? " or " : "expected ";
8889 strcpy (tmp
+ length
, prefix
);
8890 length
+= strlen (prefix
);
8891 strcpy (tmp
+ length
, tree_code_name
[code
]);
8892 length
+= strlen (tree_code_name
[code
]);
8897 buffer
= "unexpected node";
8899 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8900 buffer
, tree_code_name
[TREE_CODE (node
)],
8901 function
, trim_filename (file
), line
);
8904 /* Complain that the tree code of NODE does match the expected 0
8905 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8909 tree_not_check_failed (const_tree node
, const char *file
,
8910 int line
, const char *function
, ...)
8914 unsigned length
= 0;
8917 va_start (args
, function
);
8918 while ((code
= va_arg (args
, int)))
8919 length
+= 4 + strlen (tree_code_name
[code
]);
8921 va_start (args
, function
);
8922 buffer
= (char *) alloca (length
);
8924 while ((code
= va_arg (args
, int)))
8928 strcpy (buffer
+ length
, " or ");
8931 strcpy (buffer
+ length
, tree_code_name
[code
]);
8932 length
+= strlen (tree_code_name
[code
]);
8936 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8937 buffer
, tree_code_name
[TREE_CODE (node
)],
8938 function
, trim_filename (file
), line
);
8941 /* Similar to tree_check_failed, except that we check for a class of tree
8942 code, given in CL. */
8945 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8946 const char *file
, int line
, const char *function
)
8949 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8950 TREE_CODE_CLASS_STRING (cl
),
8951 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8952 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8955 /* Similar to tree_check_failed, except that instead of specifying a
8956 dozen codes, use the knowledge that they're all sequential. */
8959 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8960 const char *function
, enum tree_code c1
,
8964 unsigned length
= 0;
8967 for (c
= c1
; c
<= c2
; ++c
)
8968 length
+= 4 + strlen (tree_code_name
[c
]);
8970 length
+= strlen ("expected ");
8971 buffer
= (char *) alloca (length
);
8974 for (c
= c1
; c
<= c2
; ++c
)
8976 const char *prefix
= length
? " or " : "expected ";
8978 strcpy (buffer
+ length
, prefix
);
8979 length
+= strlen (prefix
);
8980 strcpy (buffer
+ length
, tree_code_name
[c
]);
8981 length
+= strlen (tree_code_name
[c
]);
8984 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8985 buffer
, tree_code_name
[TREE_CODE (node
)],
8986 function
, trim_filename (file
), line
);
8990 /* Similar to tree_check_failed, except that we check that a tree does
8991 not have the specified code, given in CL. */
8994 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8995 const char *file
, int line
, const char *function
)
8998 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
8999 TREE_CODE_CLASS_STRING (cl
),
9000 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9001 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9005 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9008 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9009 const char *function
, enum omp_clause_code code
)
9011 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9012 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9013 function
, trim_filename (file
), line
);
9017 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9020 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9021 const char *function
, enum omp_clause_code c1
,
9022 enum omp_clause_code c2
)
9025 unsigned length
= 0;
9028 for (c
= c1
; c
<= c2
; ++c
)
9029 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9031 length
+= strlen ("expected ");
9032 buffer
= (char *) alloca (length
);
9035 for (c
= c1
; c
<= c2
; ++c
)
9037 const char *prefix
= length
? " or " : "expected ";
9039 strcpy (buffer
+ length
, prefix
);
9040 length
+= strlen (prefix
);
9041 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9042 length
+= strlen (omp_clause_code_name
[c
]);
9045 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9046 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9047 function
, trim_filename (file
), line
);
9051 #undef DEFTREESTRUCT
9052 #define DEFTREESTRUCT(VAL, NAME) NAME,
9054 static const char *ts_enum_names
[] = {
9055 #include "treestruct.def"
9057 #undef DEFTREESTRUCT
9059 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9061 /* Similar to tree_class_check_failed, except that we check for
9062 whether CODE contains the tree structure identified by EN. */
9065 tree_contains_struct_check_failed (const_tree node
,
9066 const enum tree_node_structure_enum en
,
9067 const char *file
, int line
,
9068 const char *function
)
9071 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9073 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9077 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9078 (dynamically sized) vector. */
9081 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9082 const char *function
)
9085 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9086 idx
+ 1, len
, function
, trim_filename (file
), line
);
9089 /* Similar to above, except that the check is for the bounds of the operand
9090 vector of an expression node EXP. */
9093 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9094 int line
, const char *function
)
9096 int code
= TREE_CODE (exp
);
9098 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9099 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9100 function
, trim_filename (file
), line
);
9103 /* Similar to above, except that the check is for the number of
9104 operands of an OMP_CLAUSE node. */
9107 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9108 int line
, const char *function
)
9111 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9112 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9113 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9114 trim_filename (file
), line
);
9116 #endif /* ENABLE_TREE_CHECKING */
9118 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9119 and mapped to the machine mode MODE. Initialize its fields and build
9120 the information necessary for debugging output. */
9123 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9126 hashval_t hashcode
= 0;
9128 t
= make_node (VECTOR_TYPE
);
9129 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9130 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9131 SET_TYPE_MODE (t
, mode
);
9133 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9134 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9135 else if (TYPE_CANONICAL (innertype
) != innertype
9136 || mode
!= VOIDmode
)
9138 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9142 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9143 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9144 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9145 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9146 t
= type_hash_canon (hashcode
, t
);
9148 /* We have built a main variant, based on the main variant of the
9149 inner type. Use it to build the variant we return. */
9150 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9151 && TREE_TYPE (t
) != innertype
)
9152 return build_type_attribute_qual_variant (t
,
9153 TYPE_ATTRIBUTES (innertype
),
9154 TYPE_QUALS (innertype
));
9160 make_or_reuse_type (unsigned size
, int unsignedp
)
9162 if (size
== INT_TYPE_SIZE
)
9163 return unsignedp
? unsigned_type_node
: integer_type_node
;
9164 if (size
== CHAR_TYPE_SIZE
)
9165 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9166 if (size
== SHORT_TYPE_SIZE
)
9167 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9168 if (size
== LONG_TYPE_SIZE
)
9169 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9170 if (size
== LONG_LONG_TYPE_SIZE
)
9171 return (unsignedp
? long_long_unsigned_type_node
9172 : long_long_integer_type_node
);
9173 if (size
== 128 && int128_integer_type_node
)
9174 return (unsignedp
? int128_unsigned_type_node
9175 : int128_integer_type_node
);
9178 return make_unsigned_type (size
);
9180 return make_signed_type (size
);
9183 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9186 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9190 if (size
== SHORT_FRACT_TYPE_SIZE
)
9191 return unsignedp
? sat_unsigned_short_fract_type_node
9192 : sat_short_fract_type_node
;
9193 if (size
== FRACT_TYPE_SIZE
)
9194 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9195 if (size
== LONG_FRACT_TYPE_SIZE
)
9196 return unsignedp
? sat_unsigned_long_fract_type_node
9197 : sat_long_fract_type_node
;
9198 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9199 return unsignedp
? sat_unsigned_long_long_fract_type_node
9200 : sat_long_long_fract_type_node
;
9204 if (size
== SHORT_FRACT_TYPE_SIZE
)
9205 return unsignedp
? unsigned_short_fract_type_node
9206 : short_fract_type_node
;
9207 if (size
== FRACT_TYPE_SIZE
)
9208 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9209 if (size
== LONG_FRACT_TYPE_SIZE
)
9210 return unsignedp
? unsigned_long_fract_type_node
9211 : long_fract_type_node
;
9212 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9213 return unsignedp
? unsigned_long_long_fract_type_node
9214 : long_long_fract_type_node
;
9217 return make_fract_type (size
, unsignedp
, satp
);
9220 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9223 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9227 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9228 return unsignedp
? sat_unsigned_short_accum_type_node
9229 : sat_short_accum_type_node
;
9230 if (size
== ACCUM_TYPE_SIZE
)
9231 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9232 if (size
== LONG_ACCUM_TYPE_SIZE
)
9233 return unsignedp
? sat_unsigned_long_accum_type_node
9234 : sat_long_accum_type_node
;
9235 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9236 return unsignedp
? sat_unsigned_long_long_accum_type_node
9237 : sat_long_long_accum_type_node
;
9241 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9242 return unsignedp
? unsigned_short_accum_type_node
9243 : short_accum_type_node
;
9244 if (size
== ACCUM_TYPE_SIZE
)
9245 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9246 if (size
== LONG_ACCUM_TYPE_SIZE
)
9247 return unsignedp
? unsigned_long_accum_type_node
9248 : long_accum_type_node
;
9249 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9250 return unsignedp
? unsigned_long_long_accum_type_node
9251 : long_long_accum_type_node
;
9254 return make_accum_type (size
, unsignedp
, satp
);
9257 /* Create nodes for all integer types (and error_mark_node) using the sizes
9258 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9259 SHORT_DOUBLE specifies whether double should be of the same precision
9263 build_common_tree_nodes (bool signed_char
, bool short_double
)
9265 error_mark_node
= make_node (ERROR_MARK
);
9266 TREE_TYPE (error_mark_node
) = error_mark_node
;
9268 initialize_sizetypes ();
9270 /* Define both `signed char' and `unsigned char'. */
9271 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9272 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9273 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9274 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9276 /* Define `char', which is like either `signed char' or `unsigned char'
9277 but not the same as either. */
9280 ? make_signed_type (CHAR_TYPE_SIZE
)
9281 : make_unsigned_type (CHAR_TYPE_SIZE
));
9282 TYPE_STRING_FLAG (char_type_node
) = 1;
9284 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9285 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9286 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9287 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9288 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9289 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9290 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9291 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9292 #if HOST_BITS_PER_WIDE_INT >= 64
9293 /* TODO: This isn't correct, but as logic depends at the moment on
9294 host's instead of target's wide-integer.
9295 If there is a target not supporting TImode, but has an 128-bit
9296 integer-scalar register, this target check needs to be adjusted. */
9297 if (targetm
.scalar_mode_supported_p (TImode
))
9299 int128_integer_type_node
= make_signed_type (128);
9300 int128_unsigned_type_node
= make_unsigned_type (128);
9304 /* Define a boolean type. This type only represents boolean values but
9305 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9306 Front ends which want to override this size (i.e. Java) can redefine
9307 boolean_type_node before calling build_common_tree_nodes_2. */
9308 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9309 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9310 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9311 TYPE_PRECISION (boolean_type_node
) = 1;
9313 /* Define what type to use for size_t. */
9314 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9315 size_type_node
= unsigned_type_node
;
9316 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9317 size_type_node
= long_unsigned_type_node
;
9318 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9319 size_type_node
= long_long_unsigned_type_node
;
9320 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9321 size_type_node
= short_unsigned_type_node
;
9325 /* Fill in the rest of the sized types. Reuse existing type nodes
9327 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9328 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9329 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9330 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9331 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9333 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9334 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9335 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9336 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9337 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9339 access_public_node
= get_identifier ("public");
9340 access_protected_node
= get_identifier ("protected");
9341 access_private_node
= get_identifier ("private");
9343 /* Define these next since types below may used them. */
9344 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9345 integer_one_node
= build_int_cst (integer_type_node
, 1);
9346 integer_three_node
= build_int_cst (integer_type_node
, 3);
9347 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9349 size_zero_node
= size_int (0);
9350 size_one_node
= size_int (1);
9351 bitsize_zero_node
= bitsize_int (0);
9352 bitsize_one_node
= bitsize_int (1);
9353 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9355 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9356 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9358 void_type_node
= make_node (VOID_TYPE
);
9359 layout_type (void_type_node
);
9361 /* We are not going to have real types in C with less than byte alignment,
9362 so we might as well not have any types that claim to have it. */
9363 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9364 TYPE_USER_ALIGN (void_type_node
) = 0;
9366 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9367 layout_type (TREE_TYPE (null_pointer_node
));
9369 ptr_type_node
= build_pointer_type (void_type_node
);
9371 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9372 fileptr_type_node
= ptr_type_node
;
9374 float_type_node
= make_node (REAL_TYPE
);
9375 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9376 layout_type (float_type_node
);
9378 double_type_node
= make_node (REAL_TYPE
);
9380 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9382 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9383 layout_type (double_type_node
);
9385 long_double_type_node
= make_node (REAL_TYPE
);
9386 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9387 layout_type (long_double_type_node
);
9389 float_ptr_type_node
= build_pointer_type (float_type_node
);
9390 double_ptr_type_node
= build_pointer_type (double_type_node
);
9391 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9392 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9394 /* Fixed size integer types. */
9395 uint16_type_node
= build_nonstandard_integer_type (16, true);
9396 uint32_type_node
= build_nonstandard_integer_type (32, true);
9397 uint64_type_node
= build_nonstandard_integer_type (64, true);
9399 /* Decimal float types. */
9400 dfloat32_type_node
= make_node (REAL_TYPE
);
9401 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9402 layout_type (dfloat32_type_node
);
9403 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9404 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9406 dfloat64_type_node
= make_node (REAL_TYPE
);
9407 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9408 layout_type (dfloat64_type_node
);
9409 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9410 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9412 dfloat128_type_node
= make_node (REAL_TYPE
);
9413 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9414 layout_type (dfloat128_type_node
);
9415 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9416 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9418 complex_integer_type_node
= build_complex_type (integer_type_node
);
9419 complex_float_type_node
= build_complex_type (float_type_node
);
9420 complex_double_type_node
= build_complex_type (double_type_node
);
9421 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9423 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9424 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9425 sat_ ## KIND ## _type_node = \
9426 make_sat_signed_ ## KIND ## _type (SIZE); \
9427 sat_unsigned_ ## KIND ## _type_node = \
9428 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9429 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9430 unsigned_ ## KIND ## _type_node = \
9431 make_unsigned_ ## KIND ## _type (SIZE);
9433 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9434 sat_ ## WIDTH ## KIND ## _type_node = \
9435 make_sat_signed_ ## KIND ## _type (SIZE); \
9436 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9437 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9438 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9439 unsigned_ ## WIDTH ## KIND ## _type_node = \
9440 make_unsigned_ ## KIND ## _type (SIZE);
9442 /* Make fixed-point type nodes based on four different widths. */
9443 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9444 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9445 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9446 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9447 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9449 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9450 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9451 NAME ## _type_node = \
9452 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9453 u ## NAME ## _type_node = \
9454 make_or_reuse_unsigned_ ## KIND ## _type \
9455 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9456 sat_ ## NAME ## _type_node = \
9457 make_or_reuse_sat_signed_ ## KIND ## _type \
9458 (GET_MODE_BITSIZE (MODE ## mode)); \
9459 sat_u ## NAME ## _type_node = \
9460 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9461 (GET_MODE_BITSIZE (U ## MODE ## mode));
9463 /* Fixed-point type and mode nodes. */
9464 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9465 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9466 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9467 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9468 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9469 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9470 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9471 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9472 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9473 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9474 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9477 tree t
= targetm
.build_builtin_va_list ();
9479 /* Many back-ends define record types without setting TYPE_NAME.
9480 If we copied the record type here, we'd keep the original
9481 record type without a name. This breaks name mangling. So,
9482 don't copy record types and let c_common_nodes_and_builtins()
9483 declare the type to be __builtin_va_list. */
9484 if (TREE_CODE (t
) != RECORD_TYPE
)
9485 t
= build_variant_type_copy (t
);
9487 va_list_type_node
= t
;
9491 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9494 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9495 const char *library_name
, int ecf_flags
)
9499 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9500 library_name
, NULL_TREE
);
9501 if (ecf_flags
& ECF_CONST
)
9502 TREE_READONLY (decl
) = 1;
9503 if (ecf_flags
& ECF_PURE
)
9504 DECL_PURE_P (decl
) = 1;
9505 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9506 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9507 if (ecf_flags
& ECF_NORETURN
)
9508 TREE_THIS_VOLATILE (decl
) = 1;
9509 if (ecf_flags
& ECF_NOTHROW
)
9510 TREE_NOTHROW (decl
) = 1;
9511 if (ecf_flags
& ECF_MALLOC
)
9512 DECL_IS_MALLOC (decl
) = 1;
9513 if (ecf_flags
& ECF_LEAF
)
9514 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9515 NULL
, DECL_ATTRIBUTES (decl
));
9516 if ((ecf_flags
& ECF_TM_PURE
) && flag_tm
)
9517 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9519 set_builtin_decl (code
, decl
, true);
9522 /* Call this function after instantiating all builtins that the language
9523 front end cares about. This will build the rest of the builtins that
9524 are relied upon by the tree optimizers and the middle-end. */
9527 build_common_builtin_nodes (void)
9532 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9534 ftype
= build_function_type (void_type_node
, void_list_node
);
9535 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9536 "__builtin_unreachable",
9537 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9538 | ECF_CONST
| ECF_LEAF
);
9541 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9542 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9544 ftype
= build_function_type_list (ptr_type_node
,
9545 ptr_type_node
, const_ptr_type_node
,
9546 size_type_node
, NULL_TREE
);
9548 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9549 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9550 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9551 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9552 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9553 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9556 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9558 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9559 const_ptr_type_node
, size_type_node
,
9561 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9562 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9565 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9567 ftype
= build_function_type_list (ptr_type_node
,
9568 ptr_type_node
, integer_type_node
,
9569 size_type_node
, NULL_TREE
);
9570 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9571 "memset", ECF_NOTHROW
| ECF_LEAF
);
9574 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9576 ftype
= build_function_type_list (ptr_type_node
,
9577 size_type_node
, NULL_TREE
);
9578 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9579 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9582 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9583 size_type_node
, NULL_TREE
);
9584 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9585 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9586 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9588 /* If we're checking the stack, `alloca' can throw. */
9589 if (flag_stack_check
)
9591 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9592 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9595 ftype
= build_function_type_list (void_type_node
,
9596 ptr_type_node
, ptr_type_node
,
9597 ptr_type_node
, NULL_TREE
);
9598 local_define_builtin ("__builtin_init_trampoline", ftype
,
9599 BUILT_IN_INIT_TRAMPOLINE
,
9600 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9601 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9602 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9603 "__builtin_init_heap_trampoline",
9604 ECF_NOTHROW
| ECF_LEAF
);
9606 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9607 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9608 BUILT_IN_ADJUST_TRAMPOLINE
,
9609 "__builtin_adjust_trampoline",
9610 ECF_CONST
| ECF_NOTHROW
);
9612 ftype
= build_function_type_list (void_type_node
,
9613 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9614 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9615 BUILT_IN_NONLOCAL_GOTO
,
9616 "__builtin_nonlocal_goto",
9617 ECF_NORETURN
| ECF_NOTHROW
);
9619 ftype
= build_function_type_list (void_type_node
,
9620 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9621 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9622 BUILT_IN_SETJMP_SETUP
,
9623 "__builtin_setjmp_setup", ECF_NOTHROW
);
9625 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9626 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9627 BUILT_IN_SETJMP_DISPATCHER
,
9628 "__builtin_setjmp_dispatcher",
9629 ECF_PURE
| ECF_NOTHROW
);
9631 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9632 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9633 BUILT_IN_SETJMP_RECEIVER
,
9634 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9636 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9637 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9638 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9640 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9641 local_define_builtin ("__builtin_stack_restore", ftype
,
9642 BUILT_IN_STACK_RESTORE
,
9643 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9645 /* If there's a possibility that we might use the ARM EABI, build the
9646 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9647 if (targetm
.arm_eabi_unwinder
)
9649 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9650 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9651 BUILT_IN_CXA_END_CLEANUP
,
9652 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9655 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9656 local_define_builtin ("__builtin_unwind_resume", ftype
,
9657 BUILT_IN_UNWIND_RESUME
,
9658 ((targetm_common
.except_unwind_info (&global_options
)
9660 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9663 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9665 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9667 local_define_builtin ("__builtin_return_address", ftype
,
9668 BUILT_IN_RETURN_ADDRESS
,
9669 "__builtin_return_address",
9673 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9674 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9676 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9677 ptr_type_node
, NULL_TREE
);
9678 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9679 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9680 BUILT_IN_PROFILE_FUNC_ENTER
,
9681 "__cyg_profile_func_enter", 0);
9682 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9683 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9684 BUILT_IN_PROFILE_FUNC_EXIT
,
9685 "__cyg_profile_func_exit", 0);
9688 /* The exception object and filter values from the runtime. The argument
9689 must be zero before exception lowering, i.e. from the front end. After
9690 exception lowering, it will be the region number for the exception
9691 landing pad. These functions are PURE instead of CONST to prevent
9692 them from being hoisted past the exception edge that will initialize
9693 its value in the landing pad. */
9694 ftype
= build_function_type_list (ptr_type_node
,
9695 integer_type_node
, NULL_TREE
);
9696 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9697 /* Only use TM_PURE if we we have TM language support. */
9698 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9699 ecf_flags
|= ECF_TM_PURE
;
9700 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9701 "__builtin_eh_pointer", ecf_flags
);
9703 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9704 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9705 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9706 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9708 ftype
= build_function_type_list (void_type_node
,
9709 integer_type_node
, integer_type_node
,
9711 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9712 BUILT_IN_EH_COPY_VALUES
,
9713 "__builtin_eh_copy_values", ECF_NOTHROW
);
9715 /* Complex multiplication and division. These are handled as builtins
9716 rather than optabs because emit_library_call_value doesn't support
9717 complex. Further, we can do slightly better with folding these
9718 beasties if the real and complex parts of the arguments are separate. */
9722 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9724 char mode_name_buf
[4], *q
;
9726 enum built_in_function mcode
, dcode
;
9727 tree type
, inner_type
;
9728 const char *prefix
= "__";
9730 if (targetm
.libfunc_gnu_prefix
)
9733 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9736 inner_type
= TREE_TYPE (type
);
9738 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9739 inner_type
, inner_type
, NULL_TREE
);
9741 mcode
= ((enum built_in_function
)
9742 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9743 dcode
= ((enum built_in_function
)
9744 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9746 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9750 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9752 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9753 built_in_names
[mcode
],
9754 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9756 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9758 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9759 built_in_names
[dcode
],
9760 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9765 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9768 If we requested a pointer to a vector, build up the pointers that
9769 we stripped off while looking for the inner type. Similarly for
9770 return values from functions.
9772 The argument TYPE is the top of the chain, and BOTTOM is the
9773 new type which we will point to. */
9776 reconstruct_complex_type (tree type
, tree bottom
)
9780 if (TREE_CODE (type
) == POINTER_TYPE
)
9782 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9783 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9784 TYPE_REF_CAN_ALIAS_ALL (type
));
9786 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9788 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9789 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9790 TYPE_REF_CAN_ALIAS_ALL (type
));
9792 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9794 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9795 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9797 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9799 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9800 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9802 else if (TREE_CODE (type
) == METHOD_TYPE
)
9804 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9805 /* The build_method_type_directly() routine prepends 'this' to argument list,
9806 so we must compensate by getting rid of it. */
9808 = build_method_type_directly
9809 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9811 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9813 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9815 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9816 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9821 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9825 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9828 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9832 switch (GET_MODE_CLASS (mode
))
9834 case MODE_VECTOR_INT
:
9835 case MODE_VECTOR_FLOAT
:
9836 case MODE_VECTOR_FRACT
:
9837 case MODE_VECTOR_UFRACT
:
9838 case MODE_VECTOR_ACCUM
:
9839 case MODE_VECTOR_UACCUM
:
9840 nunits
= GET_MODE_NUNITS (mode
);
9844 /* Check that there are no leftover bits. */
9845 gcc_assert (GET_MODE_BITSIZE (mode
)
9846 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9848 nunits
= GET_MODE_BITSIZE (mode
)
9849 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9856 return make_vector_type (innertype
, nunits
, mode
);
9859 /* Similarly, but takes the inner type and number of units, which must be
9863 build_vector_type (tree innertype
, int nunits
)
9865 return make_vector_type (innertype
, nunits
, VOIDmode
);
9868 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9871 build_opaque_vector_type (tree innertype
, int nunits
)
9873 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9875 /* We always build the non-opaque variant before the opaque one,
9876 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9877 cand
= TYPE_NEXT_VARIANT (t
);
9879 && TYPE_VECTOR_OPAQUE (cand
)
9880 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
9882 /* Othewise build a variant type and make sure to queue it after
9883 the non-opaque type. */
9884 cand
= build_distinct_type_copy (t
);
9885 TYPE_VECTOR_OPAQUE (cand
) = true;
9886 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
9887 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
9888 TYPE_NEXT_VARIANT (t
) = cand
;
9889 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
9894 /* Given an initializer INIT, return TRUE if INIT is zero or some
9895 aggregate of zeros. Otherwise return FALSE. */
9897 initializer_zerop (const_tree init
)
9903 switch (TREE_CODE (init
))
9906 return integer_zerop (init
);
9909 /* ??? Note that this is not correct for C4X float formats. There,
9910 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9911 negative exponent. */
9912 return real_zerop (init
)
9913 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9916 return fixed_zerop (init
);
9919 return integer_zerop (init
)
9920 || (real_zerop (init
)
9921 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9922 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9927 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
9928 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
9935 unsigned HOST_WIDE_INT idx
;
9937 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9938 if (!initializer_zerop (elt
))
9947 /* We need to loop through all elements to handle cases like
9948 "\0" and "\0foobar". */
9949 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9950 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9961 /* Build an empty statement at location LOC. */
9964 build_empty_stmt (location_t loc
)
9966 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9967 SET_EXPR_LOCATION (t
, loc
);
9972 /* Build an OpenMP clause with code CODE. LOC is the location of the
9976 build_omp_clause (location_t loc
, enum omp_clause_code code
)
9981 length
= omp_clause_num_ops
[code
];
9982 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
9984 record_node_allocation_statistics (OMP_CLAUSE
, size
);
9986 t
= ggc_alloc_tree_node (size
);
9987 memset (t
, 0, size
);
9988 TREE_SET_CODE (t
, OMP_CLAUSE
);
9989 OMP_CLAUSE_SET_CODE (t
, code
);
9990 OMP_CLAUSE_LOCATION (t
) = loc
;
9995 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
9996 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
9997 Except for the CODE and operand count field, other storage for the
9998 object is initialized to zeros. */
10001 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10004 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10006 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10007 gcc_assert (len
>= 1);
10009 record_node_allocation_statistics (code
, length
);
10011 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
10013 TREE_SET_CODE (t
, code
);
10015 /* Can't use TREE_OPERAND to store the length because if checking is
10016 enabled, it will try to check the length before we store it. :-P */
10017 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10022 /* Helper function for build_call_* functions; build a CALL_EXPR with
10023 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10024 the argument slots. */
10027 build_call_1 (tree return_type
, tree fn
, int nargs
)
10031 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10032 TREE_TYPE (t
) = return_type
;
10033 CALL_EXPR_FN (t
) = fn
;
10034 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10039 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10040 FN and a null static chain slot. NARGS is the number of call arguments
10041 which are specified as "..." arguments. */
10044 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10048 va_start (args
, nargs
);
10049 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10054 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10055 FN and a null static chain slot. NARGS is the number of call arguments
10056 which are specified as a va_list ARGS. */
10059 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10064 t
= build_call_1 (return_type
, fn
, nargs
);
10065 for (i
= 0; i
< nargs
; i
++)
10066 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10067 process_call_operands (t
);
10071 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10072 FN and a null static chain slot. NARGS is the number of call arguments
10073 which are specified as a tree array ARGS. */
10076 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10077 int nargs
, const tree
*args
)
10082 t
= build_call_1 (return_type
, fn
, nargs
);
10083 for (i
= 0; i
< nargs
; i
++)
10084 CALL_EXPR_ARG (t
, i
) = args
[i
];
10085 process_call_operands (t
);
10086 SET_EXPR_LOCATION (t
, loc
);
10090 /* Like build_call_array, but takes a VEC. */
10093 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
10098 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
10099 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
10100 CALL_EXPR_ARG (ret
, ix
) = t
;
10101 process_call_operands (ret
);
10106 /* Returns true if it is possible to prove that the index of
10107 an array access REF (an ARRAY_REF expression) falls into the
10111 in_array_bounds_p (tree ref
)
10113 tree idx
= TREE_OPERAND (ref
, 1);
10116 if (TREE_CODE (idx
) != INTEGER_CST
)
10119 min
= array_ref_low_bound (ref
);
10120 max
= array_ref_up_bound (ref
);
10123 || TREE_CODE (min
) != INTEGER_CST
10124 || TREE_CODE (max
) != INTEGER_CST
)
10127 if (tree_int_cst_lt (idx
, min
)
10128 || tree_int_cst_lt (max
, idx
))
10134 /* Returns true if it is possible to prove that the range of
10135 an array access REF (an ARRAY_RANGE_REF expression) falls
10136 into the array bounds. */
10139 range_in_array_bounds_p (tree ref
)
10141 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10142 tree range_min
, range_max
, min
, max
;
10144 range_min
= TYPE_MIN_VALUE (domain_type
);
10145 range_max
= TYPE_MAX_VALUE (domain_type
);
10148 || TREE_CODE (range_min
) != INTEGER_CST
10149 || TREE_CODE (range_max
) != INTEGER_CST
)
10152 min
= array_ref_low_bound (ref
);
10153 max
= array_ref_up_bound (ref
);
10156 || TREE_CODE (min
) != INTEGER_CST
10157 || TREE_CODE (max
) != INTEGER_CST
)
10160 if (tree_int_cst_lt (range_min
, min
)
10161 || tree_int_cst_lt (max
, range_max
))
10167 /* Return true if T (assumed to be a DECL) must be assigned a memory
10171 needs_to_live_in_memory (const_tree t
)
10173 return (TREE_ADDRESSABLE (t
)
10174 || is_global_var (t
)
10175 || (TREE_CODE (t
) == RESULT_DECL
10176 && !DECL_BY_REFERENCE (t
)
10177 && aggregate_value_p (t
, current_function_decl
)));
10180 /* Return value of a constant X and sign-extend it. */
10183 int_cst_value (const_tree x
)
10185 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10186 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10188 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10189 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10190 || TREE_INT_CST_HIGH (x
) == -1);
10192 if (bits
< HOST_BITS_PER_WIDE_INT
)
10194 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10196 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10198 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10204 /* Return value of a constant X and sign-extend it. */
10207 widest_int_cst_value (const_tree x
)
10209 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10210 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10212 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10213 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10214 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10215 << HOST_BITS_PER_WIDE_INT
);
10217 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10218 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10219 || TREE_INT_CST_HIGH (x
) == -1);
10222 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10224 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10226 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10228 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10234 /* If TYPE is an integral or pointer type, return an integer type with
10235 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10236 if TYPE is already an integer type of signedness UNSIGNEDP. */
10239 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10241 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10244 if (TREE_CODE (type
) == VECTOR_TYPE
)
10246 tree inner
= TREE_TYPE (type
);
10247 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10250 if (inner
== inner2
)
10252 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10255 if (!INTEGRAL_TYPE_P (type
)
10256 && !POINTER_TYPE_P (type
))
10259 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10262 /* If TYPE is an integral or pointer type, return an integer type with
10263 the same precision which is unsigned, or itself if TYPE is already an
10264 unsigned integer type. */
10267 unsigned_type_for (tree type
)
10269 return signed_or_unsigned_type_for (1, type
);
10272 /* If TYPE is an integral or pointer type, return an integer type with
10273 the same precision which is signed, or itself if TYPE is already a
10274 signed integer type. */
10277 signed_type_for (tree type
)
10279 return signed_or_unsigned_type_for (0, type
);
10282 /* If TYPE is a vector type, return a signed integer vector type with the
10283 same width and number of subparts. Otherwise return boolean_type_node. */
10286 truth_type_for (tree type
)
10288 if (TREE_CODE (type
) == VECTOR_TYPE
)
10290 tree elem
= lang_hooks
.types
.type_for_size
10291 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10292 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10295 return boolean_type_node
;
10298 /* Returns the largest value obtainable by casting something in INNER type to
10302 upper_bound_in_type (tree outer
, tree inner
)
10305 unsigned int det
= 0;
10306 unsigned oprec
= TYPE_PRECISION (outer
);
10307 unsigned iprec
= TYPE_PRECISION (inner
);
10310 /* Compute a unique number for every combination. */
10311 det
|= (oprec
> iprec
) ? 4 : 0;
10312 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10313 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10315 /* Determine the exponent to use. */
10320 /* oprec <= iprec, outer: signed, inner: don't care. */
10325 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10329 /* oprec > iprec, outer: signed, inner: signed. */
10333 /* oprec > iprec, outer: signed, inner: unsigned. */
10337 /* oprec > iprec, outer: unsigned, inner: signed. */
10341 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10345 gcc_unreachable ();
10348 /* Compute 2^^prec - 1. */
10349 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10352 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10353 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10357 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10358 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10359 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10362 return double_int_to_tree (outer
, high
);
10365 /* Returns the smallest value obtainable by casting something in INNER type to
10369 lower_bound_in_type (tree outer
, tree inner
)
10372 unsigned oprec
= TYPE_PRECISION (outer
);
10373 unsigned iprec
= TYPE_PRECISION (inner
);
10375 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10377 if (TYPE_UNSIGNED (outer
)
10378 /* If we are widening something of an unsigned type, OUTER type
10379 contains all values of INNER type. In particular, both INNER
10380 and OUTER types have zero in common. */
10381 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10382 low
.low
= low
.high
= 0;
10385 /* If we are widening a signed type to another signed type, we
10386 want to obtain -2^^(iprec-1). If we are keeping the
10387 precision or narrowing to a signed type, we want to obtain
10389 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10391 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10393 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10394 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10398 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10399 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10404 return double_int_to_tree (outer
, low
);
10407 /* Return nonzero if two operands that are suitable for PHI nodes are
10408 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10409 SSA_NAME or invariant. Note that this is strictly an optimization.
10410 That is, callers of this function can directly call operand_equal_p
10411 and get the same result, only slower. */
10414 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10418 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10420 return operand_equal_p (arg0
, arg1
, 0);
10423 /* Returns number of zeros at the end of binary representation of X.
10425 ??? Use ffs if available? */
10428 num_ending_zeros (const_tree x
)
10430 unsigned HOST_WIDE_INT fr
, nfr
;
10431 unsigned num
, abits
;
10432 tree type
= TREE_TYPE (x
);
10434 if (TREE_INT_CST_LOW (x
) == 0)
10436 num
= HOST_BITS_PER_WIDE_INT
;
10437 fr
= TREE_INT_CST_HIGH (x
);
10442 fr
= TREE_INT_CST_LOW (x
);
10445 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10448 if (nfr
<< abits
== fr
)
10455 if (num
> TYPE_PRECISION (type
))
10456 num
= TYPE_PRECISION (type
);
10458 return build_int_cst_type (type
, num
);
10462 #define WALK_SUBTREE(NODE) \
10465 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10471 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10472 be walked whenever a type is seen in the tree. Rest of operands and return
10473 value are as for walk_tree. */
10476 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10477 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10479 tree result
= NULL_TREE
;
10481 switch (TREE_CODE (type
))
10484 case REFERENCE_TYPE
:
10485 /* We have to worry about mutually recursive pointers. These can't
10486 be written in C. They can in Ada. It's pathological, but
10487 there's an ACATS test (c38102a) that checks it. Deal with this
10488 by checking if we're pointing to another pointer, that one
10489 points to another pointer, that one does too, and we have no htab.
10490 If so, get a hash table. We check three levels deep to avoid
10491 the cost of the hash table if we don't need one. */
10492 if (POINTER_TYPE_P (TREE_TYPE (type
))
10493 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10494 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10497 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10505 /* ... fall through ... */
10508 WALK_SUBTREE (TREE_TYPE (type
));
10512 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10514 /* Fall through. */
10516 case FUNCTION_TYPE
:
10517 WALK_SUBTREE (TREE_TYPE (type
));
10521 /* We never want to walk into default arguments. */
10522 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10523 WALK_SUBTREE (TREE_VALUE (arg
));
10528 /* Don't follow this nodes's type if a pointer for fear that
10529 we'll have infinite recursion. If we have a PSET, then we
10532 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10533 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10534 WALK_SUBTREE (TREE_TYPE (type
));
10535 WALK_SUBTREE (TYPE_DOMAIN (type
));
10539 WALK_SUBTREE (TREE_TYPE (type
));
10540 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10550 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10551 called with the DATA and the address of each sub-tree. If FUNC returns a
10552 non-NULL value, the traversal is stopped, and the value returned by FUNC
10553 is returned. If PSET is non-NULL it is used to record the nodes visited,
10554 and to avoid visiting a node more than once. */
10557 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10558 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10560 enum tree_code code
;
10564 #define WALK_SUBTREE_TAIL(NODE) \
10568 goto tail_recurse; \
10573 /* Skip empty subtrees. */
10577 /* Don't walk the same tree twice, if the user has requested
10578 that we avoid doing so. */
10579 if (pset
&& pointer_set_insert (pset
, *tp
))
10582 /* Call the function. */
10584 result
= (*func
) (tp
, &walk_subtrees
, data
);
10586 /* If we found something, return it. */
10590 code
= TREE_CODE (*tp
);
10592 /* Even if we didn't, FUNC may have decided that there was nothing
10593 interesting below this point in the tree. */
10594 if (!walk_subtrees
)
10596 /* But we still need to check our siblings. */
10597 if (code
== TREE_LIST
)
10598 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10599 else if (code
== OMP_CLAUSE
)
10600 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10607 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10608 if (result
|| !walk_subtrees
)
10615 case IDENTIFIER_NODE
:
10622 case PLACEHOLDER_EXPR
:
10626 /* None of these have subtrees other than those already walked
10631 WALK_SUBTREE (TREE_VALUE (*tp
));
10632 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10637 int len
= TREE_VEC_LENGTH (*tp
);
10642 /* Walk all elements but the first. */
10644 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10646 /* Now walk the first one as a tail call. */
10647 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10651 WALK_SUBTREE (TREE_REALPART (*tp
));
10652 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10656 unsigned HOST_WIDE_INT idx
;
10657 constructor_elt
*ce
;
10660 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10662 WALK_SUBTREE (ce
->value
);
10667 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10672 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10674 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10675 into declarations that are just mentioned, rather than
10676 declared; they don't really belong to this part of the tree.
10677 And, we can see cycles: the initializer for a declaration
10678 can refer to the declaration itself. */
10679 WALK_SUBTREE (DECL_INITIAL (decl
));
10680 WALK_SUBTREE (DECL_SIZE (decl
));
10681 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10683 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10686 case STATEMENT_LIST
:
10688 tree_stmt_iterator i
;
10689 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10690 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10695 switch (OMP_CLAUSE_CODE (*tp
))
10697 case OMP_CLAUSE_PRIVATE
:
10698 case OMP_CLAUSE_SHARED
:
10699 case OMP_CLAUSE_FIRSTPRIVATE
:
10700 case OMP_CLAUSE_COPYIN
:
10701 case OMP_CLAUSE_COPYPRIVATE
:
10702 case OMP_CLAUSE_FINAL
:
10703 case OMP_CLAUSE_IF
:
10704 case OMP_CLAUSE_NUM_THREADS
:
10705 case OMP_CLAUSE_SCHEDULE
:
10706 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10709 case OMP_CLAUSE_NOWAIT
:
10710 case OMP_CLAUSE_ORDERED
:
10711 case OMP_CLAUSE_DEFAULT
:
10712 case OMP_CLAUSE_UNTIED
:
10713 case OMP_CLAUSE_MERGEABLE
:
10714 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10716 case OMP_CLAUSE_LASTPRIVATE
:
10717 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10718 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10719 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10721 case OMP_CLAUSE_COLLAPSE
:
10724 for (i
= 0; i
< 3; i
++)
10725 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10726 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10729 case OMP_CLAUSE_REDUCTION
:
10732 for (i
= 0; i
< 4; i
++)
10733 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10734 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10738 gcc_unreachable ();
10746 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10747 But, we only want to walk once. */
10748 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10749 for (i
= 0; i
< len
; ++i
)
10750 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10751 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10755 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10756 defining. We only want to walk into these fields of a type in this
10757 case and not in the general case of a mere reference to the type.
10759 The criterion is as follows: if the field can be an expression, it
10760 must be walked only here. This should be in keeping with the fields
10761 that are directly gimplified in gimplify_type_sizes in order for the
10762 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10763 variable-sized types.
10765 Note that DECLs get walked as part of processing the BIND_EXPR. */
10766 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10768 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10769 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10772 /* Call the function for the type. See if it returns anything or
10773 doesn't want us to continue. If we are to continue, walk both
10774 the normal fields and those for the declaration case. */
10775 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10776 if (result
|| !walk_subtrees
)
10779 /* But do not walk a pointed-to type since it may itself need to
10780 be walked in the declaration case if it isn't anonymous. */
10781 if (!POINTER_TYPE_P (*type_p
))
10783 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10788 /* If this is a record type, also walk the fields. */
10789 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10793 for (field
= TYPE_FIELDS (*type_p
); field
;
10794 field
= DECL_CHAIN (field
))
10796 /* We'd like to look at the type of the field, but we can
10797 easily get infinite recursion. So assume it's pointed
10798 to elsewhere in the tree. Also, ignore things that
10800 if (TREE_CODE (field
) != FIELD_DECL
)
10803 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10804 WALK_SUBTREE (DECL_SIZE (field
));
10805 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10806 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10807 WALK_SUBTREE (DECL_QUALIFIER (field
));
10811 /* Same for scalar types. */
10812 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10813 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10814 || TREE_CODE (*type_p
) == INTEGER_TYPE
10815 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10816 || TREE_CODE (*type_p
) == REAL_TYPE
)
10818 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10819 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10822 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10823 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10828 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10832 /* Walk over all the sub-trees of this operand. */
10833 len
= TREE_OPERAND_LENGTH (*tp
);
10835 /* Go through the subtrees. We need to do this in forward order so
10836 that the scope of a FOR_EXPR is handled properly. */
10839 for (i
= 0; i
< len
- 1; ++i
)
10840 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10841 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10844 /* If this is a type, walk the needed fields in the type. */
10845 else if (TYPE_P (*tp
))
10846 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10850 /* We didn't find what we were looking for. */
10853 #undef WALK_SUBTREE_TAIL
10855 #undef WALK_SUBTREE
10857 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10860 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10864 struct pointer_set_t
*pset
;
10866 pset
= pointer_set_create ();
10867 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10868 pointer_set_destroy (pset
);
10874 tree_block (tree t
)
10876 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10878 if (IS_EXPR_CODE_CLASS (c
))
10879 return LOCATION_BLOCK (t
->exp
.locus
);
10880 gcc_unreachable ();
10885 tree_set_block (tree t
, tree b
)
10887 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10889 if (IS_EXPR_CODE_CLASS (c
))
10892 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
10894 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
10897 gcc_unreachable ();
10900 /* Create a nameless artificial label and put it in the current
10901 function context. The label has a location of LOC. Returns the
10902 newly created label. */
10905 create_artificial_label (location_t loc
)
10907 tree lab
= build_decl (loc
,
10908 LABEL_DECL
, NULL_TREE
, void_type_node
);
10910 DECL_ARTIFICIAL (lab
) = 1;
10911 DECL_IGNORED_P (lab
) = 1;
10912 DECL_CONTEXT (lab
) = current_function_decl
;
10916 /* Given a tree, try to return a useful variable name that we can use
10917 to prefix a temporary that is being assigned the value of the tree.
10918 I.E. given <temp> = &A, return A. */
10923 tree stripped_decl
;
10926 STRIP_NOPS (stripped_decl
);
10927 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10928 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10929 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
10931 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
10934 return IDENTIFIER_POINTER (name
);
10938 switch (TREE_CODE (stripped_decl
))
10941 return get_name (TREE_OPERAND (stripped_decl
, 0));
10948 /* Return true if TYPE has a variable argument list. */
10951 stdarg_p (const_tree fntype
)
10953 function_args_iterator args_iter
;
10954 tree n
= NULL_TREE
, t
;
10959 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10964 return n
!= NULL_TREE
&& n
!= void_type_node
;
10967 /* Return true if TYPE has a prototype. */
10970 prototype_p (tree fntype
)
10974 gcc_assert (fntype
!= NULL_TREE
);
10976 t
= TYPE_ARG_TYPES (fntype
);
10977 return (t
!= NULL_TREE
);
10980 /* If BLOCK is inlined from an __attribute__((__artificial__))
10981 routine, return pointer to location from where it has been
10984 block_nonartificial_location (tree block
)
10986 location_t
*ret
= NULL
;
10988 while (block
&& TREE_CODE (block
) == BLOCK
10989 && BLOCK_ABSTRACT_ORIGIN (block
))
10991 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10993 while (TREE_CODE (ao
) == BLOCK
10994 && BLOCK_ABSTRACT_ORIGIN (ao
)
10995 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10996 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10998 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11000 /* If AO is an artificial inline, point RET to the
11001 call site locus at which it has been inlined and continue
11002 the loop, in case AO's caller is also an artificial
11004 if (DECL_DECLARED_INLINE_P (ao
)
11005 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11006 ret
= &BLOCK_SOURCE_LOCATION (block
);
11010 else if (TREE_CODE (ao
) != BLOCK
)
11013 block
= BLOCK_SUPERCONTEXT (block
);
11019 /* If EXP is inlined from an __attribute__((__artificial__))
11020 function, return the location of the original call expression. */
11023 tree_nonartificial_location (tree exp
)
11025 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11030 return EXPR_LOCATION (exp
);
11034 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11037 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11040 cl_option_hash_hash (const void *x
)
11042 const_tree
const t
= (const_tree
) x
;
11046 hashval_t hash
= 0;
11048 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11050 p
= (const char *)TREE_OPTIMIZATION (t
);
11051 len
= sizeof (struct cl_optimization
);
11054 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11056 p
= (const char *)TREE_TARGET_OPTION (t
);
11057 len
= sizeof (struct cl_target_option
);
11061 gcc_unreachable ();
11063 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11065 for (i
= 0; i
< len
; i
++)
11067 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11072 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11073 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11077 cl_option_hash_eq (const void *x
, const void *y
)
11079 const_tree
const xt
= (const_tree
) x
;
11080 const_tree
const yt
= (const_tree
) y
;
11085 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11088 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11090 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11091 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11092 len
= sizeof (struct cl_optimization
);
11095 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11097 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11098 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11099 len
= sizeof (struct cl_target_option
);
11103 gcc_unreachable ();
11105 return (memcmp (xp
, yp
, len
) == 0);
11108 /* Build an OPTIMIZATION_NODE based on the current options. */
11111 build_optimization_node (void)
11116 /* Use the cache of optimization nodes. */
11118 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11121 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11125 /* Insert this one into the hash table. */
11126 t
= cl_optimization_node
;
11129 /* Make a new node for next time round. */
11130 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11136 /* Build a TARGET_OPTION_NODE based on the current options. */
11139 build_target_option_node (void)
11144 /* Use the cache of optimization nodes. */
11146 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11149 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11153 /* Insert this one into the hash table. */
11154 t
= cl_target_option_node
;
11157 /* Make a new node for next time round. */
11158 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11164 /* Determine the "ultimate origin" of a block. The block may be an inlined
11165 instance of an inlined instance of a block which is local to an inline
11166 function, so we have to trace all of the way back through the origin chain
11167 to find out what sort of node actually served as the original seed for the
11171 block_ultimate_origin (const_tree block
)
11173 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11175 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11176 nodes in the function to point to themselves; ignore that if
11177 we're trying to output the abstract instance of this function. */
11178 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11181 if (immediate_origin
== NULL_TREE
)
11186 tree lookahead
= immediate_origin
;
11190 ret_val
= lookahead
;
11191 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11192 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11194 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11196 /* The block's abstract origin chain may not be the *ultimate* origin of
11197 the block. It could lead to a DECL that has an abstract origin set.
11198 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11199 will give us if it has one). Note that DECL's abstract origins are
11200 supposed to be the most distant ancestor (or so decl_ultimate_origin
11201 claims), so we don't need to loop following the DECL origins. */
11202 if (DECL_P (ret_val
))
11203 return DECL_ORIGIN (ret_val
);
11209 /* Return true if T1 and T2 are equivalent lists. */
11212 list_equal_p (const_tree t1
, const_tree t2
)
11214 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11215 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11220 /* Return true iff conversion in EXP generates no instruction. Mark
11221 it inline so that we fully inline into the stripping functions even
11222 though we have two uses of this function. */
11225 tree_nop_conversion (const_tree exp
)
11227 tree outer_type
, inner_type
;
11229 if (!CONVERT_EXPR_P (exp
)
11230 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11232 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11235 outer_type
= TREE_TYPE (exp
);
11236 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11241 /* Use precision rather then machine mode when we can, which gives
11242 the correct answer even for submode (bit-field) types. */
11243 if ((INTEGRAL_TYPE_P (outer_type
)
11244 || POINTER_TYPE_P (outer_type
)
11245 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11246 && (INTEGRAL_TYPE_P (inner_type
)
11247 || POINTER_TYPE_P (inner_type
)
11248 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11249 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11251 /* Otherwise fall back on comparing machine modes (e.g. for
11252 aggregate types, floats). */
11253 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11256 /* Return true iff conversion in EXP generates no instruction. Don't
11257 consider conversions changing the signedness. */
11260 tree_sign_nop_conversion (const_tree exp
)
11262 tree outer_type
, inner_type
;
11264 if (!tree_nop_conversion (exp
))
11267 outer_type
= TREE_TYPE (exp
);
11268 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11270 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11271 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11274 /* Strip conversions from EXP according to tree_nop_conversion and
11275 return the resulting expression. */
11278 tree_strip_nop_conversions (tree exp
)
11280 while (tree_nop_conversion (exp
))
11281 exp
= TREE_OPERAND (exp
, 0);
11285 /* Strip conversions from EXP according to tree_sign_nop_conversion
11286 and return the resulting expression. */
11289 tree_strip_sign_nop_conversions (tree exp
)
11291 while (tree_sign_nop_conversion (exp
))
11292 exp
= TREE_OPERAND (exp
, 0);
11296 /* Avoid any floating point extensions from EXP. */
11298 strip_float_extensions (tree exp
)
11300 tree sub
, expt
, subt
;
11302 /* For floating point constant look up the narrowest type that can hold
11303 it properly and handle it like (type)(narrowest_type)constant.
11304 This way we can optimize for instance a=a*2.0 where "a" is float
11305 but 2.0 is double constant. */
11306 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11308 REAL_VALUE_TYPE orig
;
11311 orig
= TREE_REAL_CST (exp
);
11312 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11313 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11314 type
= float_type_node
;
11315 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11316 > TYPE_PRECISION (double_type_node
)
11317 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11318 type
= double_type_node
;
11320 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11323 if (!CONVERT_EXPR_P (exp
))
11326 sub
= TREE_OPERAND (exp
, 0);
11327 subt
= TREE_TYPE (sub
);
11328 expt
= TREE_TYPE (exp
);
11330 if (!FLOAT_TYPE_P (subt
))
11333 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11336 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11339 return strip_float_extensions (sub
);
11342 /* Strip out all handled components that produce invariant
11346 strip_invariant_refs (const_tree op
)
11348 while (handled_component_p (op
))
11350 switch (TREE_CODE (op
))
11353 case ARRAY_RANGE_REF
:
11354 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11355 || TREE_OPERAND (op
, 2) != NULL_TREE
11356 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11360 case COMPONENT_REF
:
11361 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11367 op
= TREE_OPERAND (op
, 0);
11373 static GTY(()) tree gcc_eh_personality_decl
;
11375 /* Return the GCC personality function decl. */
11378 lhd_gcc_personality (void)
11380 if (!gcc_eh_personality_decl
)
11381 gcc_eh_personality_decl
= build_personality_function ("gcc");
11382 return gcc_eh_personality_decl
;
11385 /* Try to find a base info of BINFO that would have its field decl at offset
11386 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11387 found, return, otherwise return NULL_TREE. */
11390 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11392 tree type
= BINFO_TYPE (binfo
);
11396 HOST_WIDE_INT pos
, size
;
11400 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11405 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11407 if (TREE_CODE (fld
) != FIELD_DECL
)
11410 pos
= int_bit_position (fld
);
11411 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11412 if (pos
<= offset
&& (pos
+ size
) > offset
)
11415 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11418 if (!DECL_ARTIFICIAL (fld
))
11420 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11424 /* Offset 0 indicates the primary base, whose vtable contents are
11425 represented in the binfo for the derived class. */
11426 else if (offset
!= 0)
11428 tree base_binfo
, found_binfo
= NULL_TREE
;
11429 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11430 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11432 found_binfo
= base_binfo
;
11437 binfo
= found_binfo
;
11440 type
= TREE_TYPE (fld
);
11445 /* Returns true if X is a typedef decl. */
11448 is_typedef_decl (tree x
)
11450 return (x
&& TREE_CODE (x
) == TYPE_DECL
11451 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11454 /* Returns true iff TYPE is a type variant created for a typedef. */
11457 typedef_variant_p (tree type
)
11459 return is_typedef_decl (TYPE_NAME (type
));
11462 /* Warn about a use of an identifier which was marked deprecated. */
11464 warn_deprecated_use (tree node
, tree attr
)
11468 if (node
== 0 || !warn_deprecated_decl
)
11474 attr
= DECL_ATTRIBUTES (node
);
11475 else if (TYPE_P (node
))
11477 tree decl
= TYPE_STUB_DECL (node
);
11479 attr
= lookup_attribute ("deprecated",
11480 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11485 attr
= lookup_attribute ("deprecated", attr
);
11488 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11494 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11496 warning (OPT_Wdeprecated_declarations
,
11497 "%qD is deprecated (declared at %s:%d): %s",
11498 node
, xloc
.file
, xloc
.line
, msg
);
11500 warning (OPT_Wdeprecated_declarations
,
11501 "%qD is deprecated (declared at %s:%d)",
11502 node
, xloc
.file
, xloc
.line
);
11504 else if (TYPE_P (node
))
11506 tree what
= NULL_TREE
;
11507 tree decl
= TYPE_STUB_DECL (node
);
11509 if (TYPE_NAME (node
))
11511 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11512 what
= TYPE_NAME (node
);
11513 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11514 && DECL_NAME (TYPE_NAME (node
)))
11515 what
= DECL_NAME (TYPE_NAME (node
));
11520 expanded_location xloc
11521 = expand_location (DECL_SOURCE_LOCATION (decl
));
11525 warning (OPT_Wdeprecated_declarations
,
11526 "%qE is deprecated (declared at %s:%d): %s",
11527 what
, xloc
.file
, xloc
.line
, msg
);
11529 warning (OPT_Wdeprecated_declarations
,
11530 "%qE is deprecated (declared at %s:%d)", what
,
11531 xloc
.file
, xloc
.line
);
11536 warning (OPT_Wdeprecated_declarations
,
11537 "type is deprecated (declared at %s:%d): %s",
11538 xloc
.file
, xloc
.line
, msg
);
11540 warning (OPT_Wdeprecated_declarations
,
11541 "type is deprecated (declared at %s:%d)",
11542 xloc
.file
, xloc
.line
);
11550 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11553 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11558 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11561 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11567 #include "gt-tree.h"