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 #ifdef GATHER_STATISTICS
125 /* Statistics-gathering stuff. */
127 static int tree_code_counts
[MAX_TREE_CODES
];
128 int tree_node_counts
[(int) all_kinds
];
129 int tree_node_sizes
[(int) all_kinds
];
131 /* Keep in sync with tree.h:enum tree_node_kind. */
132 static const char * const tree_node_kind_names
[] = {
150 #endif /* GATHER_STATISTICS */
152 /* Unique id for next decl created. */
153 static GTY(()) int next_decl_uid
;
154 /* Unique id for next type created. */
155 static GTY(()) int next_type_uid
= 1;
156 /* Unique id for next debug decl created. Use negative numbers,
157 to catch erroneous uses. */
158 static GTY(()) int next_debug_decl_uid
;
160 /* Since we cannot rehash a type after it is in the table, we have to
161 keep the hash code. */
163 struct GTY(()) type_hash
{
168 /* Initial size of the hash table (rounded to next prime). */
169 #define TYPE_HASH_INITIAL_SIZE 1000
171 /* Now here is the hash table. When recording a type, it is added to
172 the slot whose index is the hash code. Note that the hash table is
173 used for several kinds of types (function types, array types and
174 array index range types, for now). While all these live in the
175 same table, they are completely independent, and the hash code is
176 computed differently for each of these. */
178 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
179 htab_t type_hash_table
;
181 /* Hash table and temporary node for larger integer const values. */
182 static GTY (()) tree int_cst_node
;
183 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
184 htab_t int_cst_hash_table
;
186 /* Hash table for optimization flags and target option flags. Use the same
187 hash table for both sets of options. Nodes for building the current
188 optimization and target option nodes. The assumption is most of the time
189 the options created will already be in the hash table, so we avoid
190 allocating and freeing up a node repeatably. */
191 static GTY (()) tree cl_optimization_node
;
192 static GTY (()) tree cl_target_option_node
;
193 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
194 htab_t cl_option_hash_table
;
196 /* General tree->tree mapping structure for use in hash tables. */
199 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
200 htab_t debug_expr_for_decl
;
202 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
203 htab_t value_expr_for_decl
;
205 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
206 htab_t debug_args_for_decl
;
208 static GTY ((if_marked ("tree_priority_map_marked_p"),
209 param_is (struct tree_priority_map
)))
210 htab_t init_priority_for_decl
;
212 static void set_type_quals (tree
, int);
213 static int type_hash_eq (const void *, const void *);
214 static hashval_t
type_hash_hash (const void *);
215 static hashval_t
int_cst_hash_hash (const void *);
216 static int int_cst_hash_eq (const void *, const void *);
217 static hashval_t
cl_option_hash_hash (const void *);
218 static int cl_option_hash_eq (const void *, const void *);
219 static void print_type_hash_statistics (void);
220 static void print_debug_expr_statistics (void);
221 static void print_value_expr_statistics (void);
222 static int type_hash_marked_p (const void *);
223 static unsigned int type_hash_list (const_tree
, hashval_t
);
224 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
226 tree global_trees
[TI_MAX
];
227 tree integer_types
[itk_none
];
229 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
231 /* Number of operands for each OpenMP clause. */
232 unsigned const char omp_clause_num_ops
[] =
234 0, /* OMP_CLAUSE_ERROR */
235 1, /* OMP_CLAUSE_PRIVATE */
236 1, /* OMP_CLAUSE_SHARED */
237 1, /* OMP_CLAUSE_FIRSTPRIVATE */
238 2, /* OMP_CLAUSE_LASTPRIVATE */
239 4, /* OMP_CLAUSE_REDUCTION */
240 1, /* OMP_CLAUSE_COPYIN */
241 1, /* OMP_CLAUSE_COPYPRIVATE */
242 1, /* OMP_CLAUSE_IF */
243 1, /* OMP_CLAUSE_NUM_THREADS */
244 1, /* OMP_CLAUSE_SCHEDULE */
245 0, /* OMP_CLAUSE_NOWAIT */
246 0, /* OMP_CLAUSE_ORDERED */
247 0, /* OMP_CLAUSE_DEFAULT */
248 3, /* OMP_CLAUSE_COLLAPSE */
249 0, /* OMP_CLAUSE_UNTIED */
250 1, /* OMP_CLAUSE_FINAL */
251 0 /* OMP_CLAUSE_MERGEABLE */
254 const char * const omp_clause_code_name
[] =
277 /* Return the tree node structure used by tree code CODE. */
279 static inline enum tree_node_structure_enum
280 tree_node_structure_for_code (enum tree_code code
)
282 switch (TREE_CODE_CLASS (code
))
284 case tcc_declaration
:
289 return TS_FIELD_DECL
;
295 return TS_LABEL_DECL
;
297 return TS_RESULT_DECL
;
298 case DEBUG_EXPR_DECL
:
301 return TS_CONST_DECL
;
305 return TS_FUNCTION_DECL
;
306 case TRANSLATION_UNIT_DECL
:
307 return TS_TRANSLATION_UNIT_DECL
;
309 return TS_DECL_NON_COMMON
;
313 return TS_TYPE_NON_COMMON
;
322 default: /* tcc_constant and tcc_exceptional */
327 /* tcc_constant cases. */
328 case INTEGER_CST
: return TS_INT_CST
;
329 case REAL_CST
: return TS_REAL_CST
;
330 case FIXED_CST
: return TS_FIXED_CST
;
331 case COMPLEX_CST
: return TS_COMPLEX
;
332 case VECTOR_CST
: return TS_VECTOR
;
333 case STRING_CST
: return TS_STRING
;
334 /* tcc_exceptional cases. */
335 case ERROR_MARK
: return TS_COMMON
;
336 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
337 case TREE_LIST
: return TS_LIST
;
338 case TREE_VEC
: return TS_VEC
;
339 case SSA_NAME
: return TS_SSA_NAME
;
340 case PLACEHOLDER_EXPR
: return TS_COMMON
;
341 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
342 case BLOCK
: return TS_BLOCK
;
343 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
344 case TREE_BINFO
: return TS_BINFO
;
345 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
346 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
347 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
355 /* Initialize tree_contains_struct to describe the hierarchy of tree
359 initialize_tree_contains_struct (void)
363 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
366 enum tree_node_structure_enum ts_code
;
368 code
= (enum tree_code
) i
;
369 ts_code
= tree_node_structure_for_code (code
);
371 /* Mark the TS structure itself. */
372 tree_contains_struct
[code
][ts_code
] = 1;
374 /* Mark all the structures that TS is derived from. */
392 case TS_STATEMENT_LIST
:
393 MARK_TS_TYPED (code
);
397 case TS_DECL_MINIMAL
:
403 case TS_OPTIMIZATION
:
404 case TS_TARGET_OPTION
:
405 MARK_TS_COMMON (code
);
408 case TS_TYPE_WITH_LANG_SPECIFIC
:
409 MARK_TS_TYPE_COMMON (code
);
412 case TS_TYPE_NON_COMMON
:
413 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
417 MARK_TS_DECL_MINIMAL (code
);
422 MARK_TS_DECL_COMMON (code
);
425 case TS_DECL_NON_COMMON
:
426 MARK_TS_DECL_WITH_VIS (code
);
429 case TS_DECL_WITH_VIS
:
433 MARK_TS_DECL_WRTL (code
);
437 MARK_TS_DECL_COMMON (code
);
441 MARK_TS_DECL_WITH_VIS (code
);
445 case TS_FUNCTION_DECL
:
446 MARK_TS_DECL_NON_COMMON (code
);
449 case TS_TRANSLATION_UNIT_DECL
:
450 MARK_TS_DECL_COMMON (code
);
458 /* Basic consistency checks for attributes used in fold. */
459 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
460 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
461 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
462 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
463 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
464 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
465 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
466 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
467 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
468 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
469 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
470 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
471 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
472 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
473 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
474 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
475 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
476 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
477 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
478 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
479 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
480 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
481 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
482 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
483 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
484 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
485 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
486 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
487 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
488 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
489 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
490 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
491 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
492 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
493 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
494 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
495 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
496 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
505 /* Initialize the hash table of types. */
506 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
509 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
510 tree_decl_map_eq
, 0);
512 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
513 tree_decl_map_eq
, 0);
514 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
515 tree_priority_map_eq
, 0);
517 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
518 int_cst_hash_eq
, NULL
);
520 int_cst_node
= make_node (INTEGER_CST
);
522 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
523 cl_option_hash_eq
, NULL
);
525 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
526 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
528 /* Initialize the tree_contains_struct array. */
529 initialize_tree_contains_struct ();
530 lang_hooks
.init_ts ();
534 /* The name of the object as the assembler will see it (but before any
535 translations made by ASM_OUTPUT_LABELREF). Often this is the same
536 as DECL_NAME. It is an IDENTIFIER_NODE. */
538 decl_assembler_name (tree decl
)
540 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
541 lang_hooks
.set_decl_assembler_name (decl
);
542 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
545 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
548 decl_assembler_name_equal (tree decl
, const_tree asmname
)
550 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
551 const char *decl_str
;
552 const char *asmname_str
;
555 if (decl_asmname
== asmname
)
558 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
559 asmname_str
= IDENTIFIER_POINTER (asmname
);
562 /* If the target assembler name was set by the user, things are trickier.
563 We have a leading '*' to begin with. After that, it's arguable what
564 is the correct thing to do with -fleading-underscore. Arguably, we've
565 historically been doing the wrong thing in assemble_alias by always
566 printing the leading underscore. Since we're not changing that, make
567 sure user_label_prefix follows the '*' before matching. */
568 if (decl_str
[0] == '*')
570 size_t ulp_len
= strlen (user_label_prefix
);
576 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
577 decl_str
+= ulp_len
, test
=true;
581 if (asmname_str
[0] == '*')
583 size_t ulp_len
= strlen (user_label_prefix
);
589 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
590 asmname_str
+= ulp_len
, test
=true;
597 return strcmp (decl_str
, asmname_str
) == 0;
600 /* Hash asmnames ignoring the user specified marks. */
603 decl_assembler_name_hash (const_tree asmname
)
605 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
607 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
608 size_t ulp_len
= strlen (user_label_prefix
);
612 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
615 return htab_hash_string (decl_str
);
618 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
621 /* Compute the number of bytes occupied by a tree with code CODE.
622 This function cannot be used for nodes that have variable sizes,
623 including TREE_VEC, STRING_CST, and CALL_EXPR. */
625 tree_code_size (enum tree_code code
)
627 switch (TREE_CODE_CLASS (code
))
629 case tcc_declaration
: /* A decl node */
634 return sizeof (struct tree_field_decl
);
636 return sizeof (struct tree_parm_decl
);
638 return sizeof (struct tree_var_decl
);
640 return sizeof (struct tree_label_decl
);
642 return sizeof (struct tree_result_decl
);
644 return sizeof (struct tree_const_decl
);
646 return sizeof (struct tree_type_decl
);
648 return sizeof (struct tree_function_decl
);
649 case DEBUG_EXPR_DECL
:
650 return sizeof (struct tree_decl_with_rtl
);
652 return sizeof (struct tree_decl_non_common
);
656 case tcc_type
: /* a type node */
657 return sizeof (struct tree_type_non_common
);
659 case tcc_reference
: /* a reference */
660 case tcc_expression
: /* an expression */
661 case tcc_statement
: /* an expression with side effects */
662 case tcc_comparison
: /* a comparison expression */
663 case tcc_unary
: /* a unary arithmetic expression */
664 case tcc_binary
: /* a binary arithmetic expression */
665 return (sizeof (struct tree_exp
)
666 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
668 case tcc_constant
: /* a constant */
671 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
672 case REAL_CST
: return sizeof (struct tree_real_cst
);
673 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
674 case COMPLEX_CST
: return sizeof (struct tree_complex
);
675 case VECTOR_CST
: return sizeof (struct tree_vector
);
676 case STRING_CST
: gcc_unreachable ();
678 return lang_hooks
.tree_size (code
);
681 case tcc_exceptional
: /* something random, like an identifier. */
684 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
685 case TREE_LIST
: return sizeof (struct tree_list
);
688 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
691 case OMP_CLAUSE
: gcc_unreachable ();
693 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
695 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
696 case BLOCK
: return sizeof (struct tree_block
);
697 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
698 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
699 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
702 return lang_hooks
.tree_size (code
);
710 /* Compute the number of bytes occupied by NODE. This routine only
711 looks at TREE_CODE, except for those nodes that have variable sizes. */
713 tree_size (const_tree node
)
715 const enum tree_code code
= TREE_CODE (node
);
719 return (offsetof (struct tree_binfo
, base_binfos
)
720 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
723 return (sizeof (struct tree_vec
)
724 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
727 return (sizeof (struct tree_vector
)
728 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
731 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
734 return (sizeof (struct tree_omp_clause
)
735 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
739 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
740 return (sizeof (struct tree_exp
)
741 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
743 return tree_code_size (code
);
747 /* Record interesting allocation statistics for a tree node with CODE
751 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
752 size_t length ATTRIBUTE_UNUSED
)
754 #ifdef GATHER_STATISTICS
755 enum tree_code_class type
= TREE_CODE_CLASS (code
);
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
;
838 /* Allocate and return a new UID from the DECL_UID namespace. */
841 allocate_decl_uid (void)
843 return next_decl_uid
++;
846 /* Return a newly allocated node of code CODE. For decl and type
847 nodes, some other fields are initialized. The rest of the node is
848 initialized to zero. This function cannot be used for TREE_VEC or
849 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
851 Achoo! I got a code in the node. */
854 make_node_stat (enum tree_code code MEM_STAT_DECL
)
857 enum tree_code_class type
= TREE_CODE_CLASS (code
);
858 size_t length
= tree_code_size (code
);
860 record_node_allocation_statistics (code
, length
);
862 t
= ggc_alloc_zone_cleared_tree_node_stat (
863 (code
== IDENTIFIER_NODE
) ? &tree_id_zone
: &tree_zone
,
864 length PASS_MEM_STAT
);
865 TREE_SET_CODE (t
, code
);
870 TREE_SIDE_EFFECTS (t
) = 1;
873 case tcc_declaration
:
874 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
876 if (code
== FUNCTION_DECL
)
878 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
879 DECL_MODE (t
) = FUNCTION_MODE
;
884 DECL_SOURCE_LOCATION (t
) = input_location
;
885 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
886 DECL_UID (t
) = --next_debug_decl_uid
;
889 DECL_UID (t
) = allocate_decl_uid ();
890 SET_DECL_PT_UID (t
, -1);
892 if (TREE_CODE (t
) == LABEL_DECL
)
893 LABEL_DECL_UID (t
) = -1;
898 TYPE_UID (t
) = next_type_uid
++;
899 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
900 TYPE_USER_ALIGN (t
) = 0;
901 TYPE_MAIN_VARIANT (t
) = t
;
902 TYPE_CANONICAL (t
) = t
;
904 /* Default to no attributes for type, but let target change that. */
905 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
906 targetm
.set_default_type_attributes (t
);
908 /* We have not yet computed the alias set for this type. */
909 TYPE_ALIAS_SET (t
) = -1;
913 TREE_CONSTANT (t
) = 1;
922 case PREDECREMENT_EXPR
:
923 case PREINCREMENT_EXPR
:
924 case POSTDECREMENT_EXPR
:
925 case POSTINCREMENT_EXPR
:
926 /* All of these have side-effects, no matter what their
928 TREE_SIDE_EFFECTS (t
) = 1;
937 /* Other classes need no special treatment. */
944 /* Return a new node with the same contents as NODE except that its
945 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
948 copy_node_stat (tree node MEM_STAT_DECL
)
951 enum tree_code code
= TREE_CODE (node
);
954 gcc_assert (code
!= STATEMENT_LIST
);
956 length
= tree_size (node
);
957 record_node_allocation_statistics (code
, length
);
958 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
959 memcpy (t
, node
, length
);
961 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
963 TREE_ASM_WRITTEN (t
) = 0;
964 TREE_VISITED (t
) = 0;
965 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
966 *DECL_VAR_ANN_PTR (t
) = 0;
968 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
970 if (code
== DEBUG_EXPR_DECL
)
971 DECL_UID (t
) = --next_debug_decl_uid
;
974 DECL_UID (t
) = allocate_decl_uid ();
975 if (DECL_PT_UID_SET_P (node
))
976 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
978 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
979 && DECL_HAS_VALUE_EXPR_P (node
))
981 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
982 DECL_HAS_VALUE_EXPR_P (t
) = 1;
984 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
986 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
987 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
990 else if (TREE_CODE_CLASS (code
) == tcc_type
)
992 TYPE_UID (t
) = next_type_uid
++;
993 /* The following is so that the debug code for
994 the copy is different from the original type.
995 The two statements usually duplicate each other
996 (because they clear fields of the same union),
997 but the optimizer should catch that. */
998 TYPE_SYMTAB_POINTER (t
) = 0;
999 TYPE_SYMTAB_ADDRESS (t
) = 0;
1001 /* Do not copy the values cache. */
1002 if (TYPE_CACHED_VALUES_P(t
))
1004 TYPE_CACHED_VALUES_P (t
) = 0;
1005 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1012 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1013 For example, this can copy a list made of TREE_LIST nodes. */
1016 copy_list (tree list
)
1024 head
= prev
= copy_node (list
);
1025 next
= TREE_CHAIN (list
);
1028 TREE_CHAIN (prev
) = copy_node (next
);
1029 prev
= TREE_CHAIN (prev
);
1030 next
= TREE_CHAIN (next
);
1036 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1039 build_int_cst (tree type
, HOST_WIDE_INT low
)
1041 /* Support legacy code. */
1043 type
= integer_type_node
;
1045 return double_int_to_tree (type
, shwi_to_double_int (low
));
1048 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1051 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1055 return double_int_to_tree (type
, shwi_to_double_int (low
));
1058 /* Constructs tree in type TYPE from with value given by CST. Signedness
1059 of CST is assumed to be the same as the signedness of TYPE. */
1062 double_int_to_tree (tree type
, double_int cst
)
1064 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1066 cst
= double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1068 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1071 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1072 to be the same as the signedness of TYPE. */
1075 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1077 /* Size types *are* sign extended. */
1078 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1081 = double_int_ext (cst
, TYPE_PRECISION (type
), !sign_extended_type
);
1083 return double_int_equal_p (cst
, ext
);
1086 /* We force the double_int CST to the range of the type TYPE by sign or
1087 zero extending it. OVERFLOWABLE indicates if we are interested in
1088 overflow of the value, when >0 we are only interested in signed
1089 overflow, for <0 we are interested in any overflow. OVERFLOWED
1090 indicates whether overflow has already occurred. CONST_OVERFLOWED
1091 indicates whether constant overflow has already occurred. We force
1092 T's value to be within range of T's type (by setting to 0 or 1 all
1093 the bits outside the type's range). We set TREE_OVERFLOWED if,
1094 OVERFLOWED is nonzero,
1095 or OVERFLOWABLE is >0 and signed overflow occurs
1096 or OVERFLOWABLE is <0 and any overflow occurs
1097 We return a new tree node for the extended double_int. The node
1098 is shared if no overflow flags are set. */
1102 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1105 bool sign_extended_type
;
1107 /* Size types *are* sign extended. */
1108 sign_extended_type
= !TYPE_UNSIGNED (type
);
1110 /* If we need to set overflow flags, return a new unshared node. */
1111 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1115 || (overflowable
> 0 && sign_extended_type
))
1117 tree t
= make_node (INTEGER_CST
);
1118 TREE_INT_CST (t
) = double_int_ext (cst
, TYPE_PRECISION (type
),
1119 !sign_extended_type
);
1120 TREE_TYPE (t
) = type
;
1121 TREE_OVERFLOW (t
) = 1;
1126 /* Else build a shared node. */
1127 return double_int_to_tree (type
, cst
);
1130 /* These are the hash table functions for the hash table of INTEGER_CST
1131 nodes of a sizetype. */
1133 /* Return the hash code code X, an INTEGER_CST. */
1136 int_cst_hash_hash (const void *x
)
1138 const_tree
const t
= (const_tree
) x
;
1140 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1141 ^ htab_hash_pointer (TREE_TYPE (t
)));
1144 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1145 is the same as that given by *Y, which is the same. */
1148 int_cst_hash_eq (const void *x
, const void *y
)
1150 const_tree
const xt
= (const_tree
) x
;
1151 const_tree
const yt
= (const_tree
) y
;
1153 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1154 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1155 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1158 /* Create an INT_CST node of TYPE and value HI:LOW.
1159 The returned node is always shared. For small integers we use a
1160 per-type vector cache, for larger ones we use a single hash table. */
1163 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1171 switch (TREE_CODE (type
))
1174 gcc_assert (hi
== 0 && low
== 0);
1178 case REFERENCE_TYPE
:
1179 /* Cache NULL pointer. */
1188 /* Cache false or true. */
1196 if (TYPE_UNSIGNED (type
))
1199 limit
= INTEGER_SHARE_LIMIT
;
1200 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1206 limit
= INTEGER_SHARE_LIMIT
+ 1;
1207 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1209 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1223 /* Look for it in the type's vector of small shared ints. */
1224 if (!TYPE_CACHED_VALUES_P (type
))
1226 TYPE_CACHED_VALUES_P (type
) = 1;
1227 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1230 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1233 /* Make sure no one is clobbering the shared constant. */
1234 gcc_assert (TREE_TYPE (t
) == type
);
1235 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1236 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1240 /* Create a new shared int. */
1241 t
= make_node (INTEGER_CST
);
1243 TREE_INT_CST_LOW (t
) = low
;
1244 TREE_INT_CST_HIGH (t
) = hi
;
1245 TREE_TYPE (t
) = type
;
1247 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1252 /* Use the cache of larger shared ints. */
1255 TREE_INT_CST_LOW (int_cst_node
) = low
;
1256 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1257 TREE_TYPE (int_cst_node
) = type
;
1259 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1263 /* Insert this one into the hash table. */
1266 /* Make a new node for next time round. */
1267 int_cst_node
= make_node (INTEGER_CST
);
1274 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1275 and the rest are zeros. */
1278 build_low_bits_mask (tree type
, unsigned bits
)
1282 gcc_assert (bits
<= TYPE_PRECISION (type
));
1284 if (bits
== TYPE_PRECISION (type
)
1285 && !TYPE_UNSIGNED (type
))
1286 /* Sign extended all-ones mask. */
1287 mask
= double_int_minus_one
;
1289 mask
= double_int_mask (bits
);
1291 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1294 /* Checks that X is integer constant that can be expressed in (unsigned)
1295 HOST_WIDE_INT without loss of precision. */
1298 cst_and_fits_in_hwi (const_tree x
)
1300 if (TREE_CODE (x
) != INTEGER_CST
)
1303 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1306 return (TREE_INT_CST_HIGH (x
) == 0
1307 || TREE_INT_CST_HIGH (x
) == -1);
1310 /* Build a newly constructed TREE_VEC node of length LEN. */
1313 make_vector_stat (unsigned len MEM_STAT_DECL
)
1316 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1318 record_node_allocation_statistics (VECTOR_CST
, length
);
1320 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1322 TREE_SET_CODE (t
, VECTOR_CST
);
1323 TREE_CONSTANT (t
) = 1;
1328 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1329 are in a list pointed to by VALS. */
1332 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1336 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1337 TREE_TYPE (v
) = type
;
1339 /* Iterate through elements and check for overflow. */
1340 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1342 tree value
= vals
[cnt
];
1344 VECTOR_CST_ELT (v
, cnt
) = value
;
1346 /* Don't crash if we get an address constant. */
1347 if (!CONSTANT_CLASS_P (value
))
1350 over
|= TREE_OVERFLOW (value
);
1353 TREE_OVERFLOW (v
) = over
;
1357 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1358 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1361 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1363 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1364 unsigned HOST_WIDE_INT idx
;
1367 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1369 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1370 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1372 return build_vector (type
, vec
);
1375 /* Build a vector of type VECTYPE where all the elements are SCs. */
1377 build_vector_from_val (tree vectype
, tree sc
)
1379 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1381 if (sc
== error_mark_node
)
1384 /* Verify that the vector type is suitable for SC. Note that there
1385 is some inconsistency in the type-system with respect to restrict
1386 qualifications of pointers. Vector types always have a main-variant
1387 element type and the qualification is applied to the vector-type.
1388 So TREE_TYPE (vector-type) does not return a properly qualified
1389 vector element-type. */
1390 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1391 TREE_TYPE (vectype
)));
1393 if (CONSTANT_CLASS_P (sc
))
1395 tree
*v
= XALLOCAVEC (tree
, nunits
);
1396 for (i
= 0; i
< nunits
; ++i
)
1398 return build_vector (vectype
, v
);
1402 VEC(constructor_elt
, gc
) *v
= VEC_alloc (constructor_elt
, gc
, nunits
);
1403 for (i
= 0; i
< nunits
; ++i
)
1404 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1405 return build_constructor (vectype
, v
);
1409 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1410 are in the VEC pointed to by VALS. */
1412 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1414 tree c
= make_node (CONSTRUCTOR
);
1416 constructor_elt
*elt
;
1417 bool constant_p
= true;
1418 bool side_effects_p
= false;
1420 TREE_TYPE (c
) = type
;
1421 CONSTRUCTOR_ELTS (c
) = vals
;
1423 FOR_EACH_VEC_ELT (constructor_elt
, vals
, i
, elt
)
1425 /* Mostly ctors will have elts that don't have side-effects, so
1426 the usual case is to scan all the elements. Hence a single
1427 loop for both const and side effects, rather than one loop
1428 each (with early outs). */
1429 if (!TREE_CONSTANT (elt
->value
))
1431 if (TREE_SIDE_EFFECTS (elt
->value
))
1432 side_effects_p
= true;
1435 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1436 TREE_CONSTANT (c
) = constant_p
;
1441 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1444 build_constructor_single (tree type
, tree index
, tree value
)
1446 VEC(constructor_elt
,gc
) *v
;
1447 constructor_elt
*elt
;
1449 v
= VEC_alloc (constructor_elt
, gc
, 1);
1450 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1454 return build_constructor (type
, v
);
1458 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1459 are in a list pointed to by VALS. */
1461 build_constructor_from_list (tree type
, tree vals
)
1464 VEC(constructor_elt
,gc
) *v
= NULL
;
1468 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1469 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1470 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1473 return build_constructor (type
, v
);
1476 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1479 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1482 FIXED_VALUE_TYPE
*fp
;
1484 v
= make_node (FIXED_CST
);
1485 fp
= ggc_alloc_fixed_value ();
1486 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1488 TREE_TYPE (v
) = type
;
1489 TREE_FIXED_CST_PTR (v
) = fp
;
1493 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1496 build_real (tree type
, REAL_VALUE_TYPE d
)
1499 REAL_VALUE_TYPE
*dp
;
1502 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1503 Consider doing it via real_convert now. */
1505 v
= make_node (REAL_CST
);
1506 dp
= ggc_alloc_real_value ();
1507 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1509 TREE_TYPE (v
) = type
;
1510 TREE_REAL_CST_PTR (v
) = dp
;
1511 TREE_OVERFLOW (v
) = overflow
;
1515 /* Return a new REAL_CST node whose type is TYPE
1516 and whose value is the integer value of the INTEGER_CST node I. */
1519 real_value_from_int_cst (const_tree type
, const_tree i
)
1523 /* Clear all bits of the real value type so that we can later do
1524 bitwise comparisons to see if two values are the same. */
1525 memset (&d
, 0, sizeof d
);
1527 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1528 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1529 TYPE_UNSIGNED (TREE_TYPE (i
)));
1533 /* Given a tree representing an integer constant I, return a tree
1534 representing the same value as a floating-point constant of type TYPE. */
1537 build_real_from_int_cst (tree type
, const_tree i
)
1540 int overflow
= TREE_OVERFLOW (i
);
1542 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1544 TREE_OVERFLOW (v
) |= overflow
;
1548 /* Return a newly constructed STRING_CST node whose value is
1549 the LEN characters at STR.
1550 Note that for a C string literal, LEN should include the trailing NUL.
1551 The TREE_TYPE is not initialized. */
1554 build_string (int len
, const char *str
)
1559 /* Do not waste bytes provided by padding of struct tree_string. */
1560 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1562 record_node_allocation_statistics (STRING_CST
, length
);
1564 s
= ggc_alloc_tree_node (length
);
1566 memset (s
, 0, sizeof (struct tree_typed
));
1567 TREE_SET_CODE (s
, STRING_CST
);
1568 TREE_CONSTANT (s
) = 1;
1569 TREE_STRING_LENGTH (s
) = len
;
1570 memcpy (s
->string
.str
, str
, len
);
1571 s
->string
.str
[len
] = '\0';
1576 /* Return a newly constructed COMPLEX_CST node whose value is
1577 specified by the real and imaginary parts REAL and IMAG.
1578 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1579 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1582 build_complex (tree type
, tree real
, tree imag
)
1584 tree t
= make_node (COMPLEX_CST
);
1586 TREE_REALPART (t
) = real
;
1587 TREE_IMAGPART (t
) = imag
;
1588 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1589 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1593 /* Return a constant of arithmetic type TYPE which is the
1594 multiplicative identity of the set TYPE. */
1597 build_one_cst (tree type
)
1599 switch (TREE_CODE (type
))
1601 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1602 case POINTER_TYPE
: case REFERENCE_TYPE
:
1604 return build_int_cst (type
, 1);
1607 return build_real (type
, dconst1
);
1609 case FIXED_POINT_TYPE
:
1610 /* We can only generate 1 for accum types. */
1611 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1612 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1616 tree scalar
= build_one_cst (TREE_TYPE (type
));
1618 return build_vector_from_val (type
, scalar
);
1622 return build_complex (type
,
1623 build_one_cst (TREE_TYPE (type
)),
1624 build_zero_cst (TREE_TYPE (type
)));
1631 /* Build 0 constant of type TYPE. This is used by constructor folding
1632 and thus the constant should be represented in memory by
1636 build_zero_cst (tree type
)
1638 switch (TREE_CODE (type
))
1640 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1641 case POINTER_TYPE
: case REFERENCE_TYPE
:
1642 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1643 return build_int_cst (type
, 0);
1646 return build_real (type
, dconst0
);
1648 case FIXED_POINT_TYPE
:
1649 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1653 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1655 return build_vector_from_val (type
, scalar
);
1660 tree zero
= build_zero_cst (TREE_TYPE (type
));
1662 return build_complex (type
, zero
, zero
);
1666 if (!AGGREGATE_TYPE_P (type
))
1667 return fold_convert (type
, integer_zero_node
);
1668 return build_constructor (type
, NULL
);
1673 /* Build a BINFO with LEN language slots. */
1676 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1679 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1680 + VEC_embedded_size (tree
, base_binfos
));
1682 record_node_allocation_statistics (TREE_BINFO
, length
);
1684 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1686 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1688 TREE_SET_CODE (t
, TREE_BINFO
);
1690 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1695 /* Create a CASE_LABEL_EXPR tree node and return it. */
1698 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1700 tree t
= make_node (CASE_LABEL_EXPR
);
1702 TREE_TYPE (t
) = void_type_node
;
1703 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1705 CASE_LOW (t
) = low_value
;
1706 CASE_HIGH (t
) = high_value
;
1707 CASE_LABEL (t
) = label_decl
;
1708 CASE_CHAIN (t
) = NULL_TREE
;
1713 /* Build a newly constructed TREE_VEC node of length LEN. */
1716 make_tree_vec_stat (int len MEM_STAT_DECL
)
1719 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1721 record_node_allocation_statistics (TREE_VEC
, length
);
1723 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
1725 TREE_SET_CODE (t
, TREE_VEC
);
1726 TREE_VEC_LENGTH (t
) = len
;
1731 /* Return 1 if EXPR is the integer constant zero or a complex constant
1735 integer_zerop (const_tree expr
)
1739 switch (TREE_CODE (expr
))
1742 return (TREE_INT_CST_LOW (expr
) == 0
1743 && TREE_INT_CST_HIGH (expr
) == 0);
1745 return (integer_zerop (TREE_REALPART (expr
))
1746 && integer_zerop (TREE_IMAGPART (expr
)));
1750 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1751 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
1760 /* Return 1 if EXPR is the integer constant one or the corresponding
1761 complex constant. */
1764 integer_onep (const_tree expr
)
1768 switch (TREE_CODE (expr
))
1771 return (TREE_INT_CST_LOW (expr
) == 1
1772 && TREE_INT_CST_HIGH (expr
) == 0);
1774 return (integer_onep (TREE_REALPART (expr
))
1775 && integer_zerop (TREE_IMAGPART (expr
)));
1779 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1780 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
1789 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1790 it contains. Likewise for the corresponding complex constant. */
1793 integer_all_onesp (const_tree expr
)
1800 if (TREE_CODE (expr
) == COMPLEX_CST
1801 && integer_all_onesp (TREE_REALPART (expr
))
1802 && integer_zerop (TREE_IMAGPART (expr
)))
1805 else if (TREE_CODE (expr
) == VECTOR_CST
)
1808 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1809 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
1814 else if (TREE_CODE (expr
) != INTEGER_CST
)
1817 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1818 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1819 && TREE_INT_CST_HIGH (expr
) == -1)
1824 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1825 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1827 HOST_WIDE_INT high_value
;
1830 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1832 /* Can not handle precisions greater than twice the host int size. */
1833 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1834 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1835 /* Shifting by the host word size is undefined according to the ANSI
1836 standard, so we must handle this as a special case. */
1839 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1841 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1842 && TREE_INT_CST_HIGH (expr
) == high_value
);
1845 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1848 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1852 integer_pow2p (const_tree expr
)
1855 HOST_WIDE_INT high
, low
;
1859 if (TREE_CODE (expr
) == COMPLEX_CST
1860 && integer_pow2p (TREE_REALPART (expr
))
1861 && integer_zerop (TREE_IMAGPART (expr
)))
1864 if (TREE_CODE (expr
) != INTEGER_CST
)
1867 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1868 high
= TREE_INT_CST_HIGH (expr
);
1869 low
= TREE_INT_CST_LOW (expr
);
1871 /* First clear all bits that are beyond the type's precision in case
1872 we've been sign extended. */
1874 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1876 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1877 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1881 if (prec
< HOST_BITS_PER_WIDE_INT
)
1882 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1885 if (high
== 0 && low
== 0)
1888 return ((high
== 0 && (low
& (low
- 1)) == 0)
1889 || (low
== 0 && (high
& (high
- 1)) == 0));
1892 /* Return 1 if EXPR is an integer constant other than zero or a
1893 complex constant other than zero. */
1896 integer_nonzerop (const_tree expr
)
1900 return ((TREE_CODE (expr
) == INTEGER_CST
1901 && (TREE_INT_CST_LOW (expr
) != 0
1902 || TREE_INT_CST_HIGH (expr
) != 0))
1903 || (TREE_CODE (expr
) == COMPLEX_CST
1904 && (integer_nonzerop (TREE_REALPART (expr
))
1905 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1908 /* Return 1 if EXPR is the fixed-point constant zero. */
1911 fixed_zerop (const_tree expr
)
1913 return (TREE_CODE (expr
) == FIXED_CST
1914 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1917 /* Return the power of two represented by a tree node known to be a
1921 tree_log2 (const_tree expr
)
1924 HOST_WIDE_INT high
, low
;
1928 if (TREE_CODE (expr
) == COMPLEX_CST
)
1929 return tree_log2 (TREE_REALPART (expr
));
1931 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1932 high
= TREE_INT_CST_HIGH (expr
);
1933 low
= TREE_INT_CST_LOW (expr
);
1935 /* First clear all bits that are beyond the type's precision in case
1936 we've been sign extended. */
1938 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1940 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1941 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1945 if (prec
< HOST_BITS_PER_WIDE_INT
)
1946 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1949 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1950 : exact_log2 (low
));
1953 /* Similar, but return the largest integer Y such that 2 ** Y is less
1954 than or equal to EXPR. */
1957 tree_floor_log2 (const_tree expr
)
1960 HOST_WIDE_INT high
, low
;
1964 if (TREE_CODE (expr
) == COMPLEX_CST
)
1965 return tree_log2 (TREE_REALPART (expr
));
1967 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1968 high
= TREE_INT_CST_HIGH (expr
);
1969 low
= TREE_INT_CST_LOW (expr
);
1971 /* First clear all bits that are beyond the type's precision in case
1972 we've been sign extended. Ignore if type's precision hasn't been set
1973 since what we are doing is setting it. */
1975 if (prec
== HOST_BITS_PER_DOUBLE_INT
|| prec
== 0)
1977 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1978 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1982 if (prec
< HOST_BITS_PER_WIDE_INT
)
1983 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1986 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1987 : floor_log2 (low
));
1990 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1991 decimal float constants, so don't return 1 for them. */
1994 real_zerop (const_tree expr
)
1998 return ((TREE_CODE (expr
) == REAL_CST
1999 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2000 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2001 || (TREE_CODE (expr
) == COMPLEX_CST
2002 && real_zerop (TREE_REALPART (expr
))
2003 && real_zerop (TREE_IMAGPART (expr
))));
2006 /* Return 1 if EXPR is the real constant one in real or complex form.
2007 Trailing zeroes matter for decimal float constants, so don't return
2011 real_onep (const_tree expr
)
2015 return ((TREE_CODE (expr
) == REAL_CST
2016 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2017 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2018 || (TREE_CODE (expr
) == COMPLEX_CST
2019 && real_onep (TREE_REALPART (expr
))
2020 && real_zerop (TREE_IMAGPART (expr
))));
2023 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
2024 for decimal float constants, so don't return 1 for them. */
2027 real_twop (const_tree expr
)
2031 return ((TREE_CODE (expr
) == REAL_CST
2032 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
2033 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2034 || (TREE_CODE (expr
) == COMPLEX_CST
2035 && real_twop (TREE_REALPART (expr
))
2036 && real_zerop (TREE_IMAGPART (expr
))));
2039 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2040 matter for decimal float constants, so don't return 1 for them. */
2043 real_minus_onep (const_tree expr
)
2047 return ((TREE_CODE (expr
) == REAL_CST
2048 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2049 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
)))))
2050 || (TREE_CODE (expr
) == COMPLEX_CST
2051 && real_minus_onep (TREE_REALPART (expr
))
2052 && real_zerop (TREE_IMAGPART (expr
))));
2055 /* Nonzero if EXP is a constant or a cast of a constant. */
2058 really_constant_p (const_tree exp
)
2060 /* This is not quite the same as STRIP_NOPS. It does more. */
2061 while (CONVERT_EXPR_P (exp
)
2062 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2063 exp
= TREE_OPERAND (exp
, 0);
2064 return TREE_CONSTANT (exp
);
2067 /* Return first list element whose TREE_VALUE is ELEM.
2068 Return 0 if ELEM is not in LIST. */
2071 value_member (tree elem
, tree list
)
2075 if (elem
== TREE_VALUE (list
))
2077 list
= TREE_CHAIN (list
);
2082 /* Return first list element whose TREE_PURPOSE is ELEM.
2083 Return 0 if ELEM is not in LIST. */
2086 purpose_member (const_tree elem
, tree list
)
2090 if (elem
== TREE_PURPOSE (list
))
2092 list
= TREE_CHAIN (list
);
2097 /* Return true if ELEM is in V. */
2100 vec_member (const_tree elem
, VEC(tree
,gc
) *v
)
2104 FOR_EACH_VEC_ELT (tree
, v
, ix
, t
)
2110 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2114 chain_index (int idx
, tree chain
)
2116 for (; chain
&& idx
> 0; --idx
)
2117 chain
= TREE_CHAIN (chain
);
2121 /* Return nonzero if ELEM is part of the chain CHAIN. */
2124 chain_member (const_tree elem
, const_tree chain
)
2130 chain
= DECL_CHAIN (chain
);
2136 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2137 We expect a null pointer to mark the end of the chain.
2138 This is the Lisp primitive `length'. */
2141 list_length (const_tree t
)
2144 #ifdef ENABLE_TREE_CHECKING
2152 #ifdef ENABLE_TREE_CHECKING
2155 gcc_assert (p
!= q
);
2163 /* Returns the number of FIELD_DECLs in TYPE. */
2166 fields_length (const_tree type
)
2168 tree t
= TYPE_FIELDS (type
);
2171 for (; t
; t
= DECL_CHAIN (t
))
2172 if (TREE_CODE (t
) == FIELD_DECL
)
2178 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2179 UNION_TYPE TYPE, or NULL_TREE if none. */
2182 first_field (const_tree type
)
2184 tree t
= TYPE_FIELDS (type
);
2185 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2190 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2191 by modifying the last node in chain 1 to point to chain 2.
2192 This is the Lisp primitive `nconc'. */
2195 chainon (tree op1
, tree op2
)
2204 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2206 TREE_CHAIN (t1
) = op2
;
2208 #ifdef ENABLE_TREE_CHECKING
2211 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2212 gcc_assert (t2
!= t1
);
2219 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2222 tree_last (tree chain
)
2226 while ((next
= TREE_CHAIN (chain
)))
2231 /* Reverse the order of elements in the chain T,
2232 and return the new head of the chain (old last element). */
2237 tree prev
= 0, decl
, next
;
2238 for (decl
= t
; decl
; decl
= next
)
2240 /* We shouldn't be using this function to reverse BLOCK chains; we
2241 have blocks_nreverse for that. */
2242 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2243 next
= TREE_CHAIN (decl
);
2244 TREE_CHAIN (decl
) = prev
;
2250 /* Return a newly created TREE_LIST node whose
2251 purpose and value fields are PARM and VALUE. */
2254 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2256 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2257 TREE_PURPOSE (t
) = parm
;
2258 TREE_VALUE (t
) = value
;
2262 /* Build a chain of TREE_LIST nodes from a vector. */
2265 build_tree_list_vec_stat (const VEC(tree
,gc
) *vec MEM_STAT_DECL
)
2267 tree ret
= NULL_TREE
;
2271 FOR_EACH_VEC_ELT (tree
, vec
, i
, t
)
2273 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2274 pp
= &TREE_CHAIN (*pp
);
2279 /* Return a newly created TREE_LIST node whose
2280 purpose and value fields are PURPOSE and VALUE
2281 and whose TREE_CHAIN is CHAIN. */
2284 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2288 node
= ggc_alloc_zone_tree_node_stat (&tree_zone
, sizeof (struct tree_list
)
2290 memset (node
, 0, sizeof (struct tree_common
));
2292 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2294 TREE_SET_CODE (node
, TREE_LIST
);
2295 TREE_CHAIN (node
) = chain
;
2296 TREE_PURPOSE (node
) = purpose
;
2297 TREE_VALUE (node
) = value
;
2301 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2305 ctor_to_vec (tree ctor
)
2307 VEC(tree
, gc
) *vec
= VEC_alloc (tree
, gc
, CONSTRUCTOR_NELTS (ctor
));
2311 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2312 VEC_quick_push (tree
, vec
, val
);
2317 /* Return the size nominally occupied by an object of type TYPE
2318 when it resides in memory. The value is measured in units of bytes,
2319 and its data type is that normally used for type sizes
2320 (which is the first type created by make_signed_type or
2321 make_unsigned_type). */
2324 size_in_bytes (const_tree type
)
2328 if (type
== error_mark_node
)
2329 return integer_zero_node
;
2331 type
= TYPE_MAIN_VARIANT (type
);
2332 t
= TYPE_SIZE_UNIT (type
);
2336 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2337 return size_zero_node
;
2343 /* Return the size of TYPE (in bytes) as a wide integer
2344 or return -1 if the size can vary or is larger than an integer. */
2347 int_size_in_bytes (const_tree type
)
2351 if (type
== error_mark_node
)
2354 type
= TYPE_MAIN_VARIANT (type
);
2355 t
= TYPE_SIZE_UNIT (type
);
2357 || TREE_CODE (t
) != INTEGER_CST
2358 || TREE_INT_CST_HIGH (t
) != 0
2359 /* If the result would appear negative, it's too big to represent. */
2360 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2363 return TREE_INT_CST_LOW (t
);
2366 /* Return the maximum size of TYPE (in bytes) as a wide integer
2367 or return -1 if the size can vary or is larger than an integer. */
2370 max_int_size_in_bytes (const_tree type
)
2372 HOST_WIDE_INT size
= -1;
2375 /* If this is an array type, check for a possible MAX_SIZE attached. */
2377 if (TREE_CODE (type
) == ARRAY_TYPE
)
2379 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2381 if (size_tree
&& host_integerp (size_tree
, 1))
2382 size
= tree_low_cst (size_tree
, 1);
2385 /* If we still haven't been able to get a size, see if the language
2386 can compute a maximum size. */
2390 size_tree
= lang_hooks
.types
.max_size (type
);
2392 if (size_tree
&& host_integerp (size_tree
, 1))
2393 size
= tree_low_cst (size_tree
, 1);
2399 /* Returns a tree for the size of EXP in bytes. */
2402 tree_expr_size (const_tree exp
)
2405 && DECL_SIZE_UNIT (exp
) != 0)
2406 return DECL_SIZE_UNIT (exp
);
2408 return size_in_bytes (TREE_TYPE (exp
));
2411 /* Return the bit position of FIELD, in bits from the start of the record.
2412 This is a tree of type bitsizetype. */
2415 bit_position (const_tree field
)
2417 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2418 DECL_FIELD_BIT_OFFSET (field
));
2421 /* Likewise, but return as an integer. It must be representable in
2422 that way (since it could be a signed value, we don't have the
2423 option of returning -1 like int_size_in_byte can. */
2426 int_bit_position (const_tree field
)
2428 return tree_low_cst (bit_position (field
), 0);
2431 /* Return the byte position of FIELD, in bytes from the start of the record.
2432 This is a tree of type sizetype. */
2435 byte_position (const_tree field
)
2437 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2438 DECL_FIELD_BIT_OFFSET (field
));
2441 /* Likewise, but return as an integer. It must be representable in
2442 that way (since it could be a signed value, we don't have the
2443 option of returning -1 like int_size_in_byte can. */
2446 int_byte_position (const_tree field
)
2448 return tree_low_cst (byte_position (field
), 0);
2451 /* Return the strictest alignment, in bits, that T is known to have. */
2454 expr_align (const_tree t
)
2456 unsigned int align0
, align1
;
2458 switch (TREE_CODE (t
))
2460 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2461 /* If we have conversions, we know that the alignment of the
2462 object must meet each of the alignments of the types. */
2463 align0
= expr_align (TREE_OPERAND (t
, 0));
2464 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2465 return MAX (align0
, align1
);
2467 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2468 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2469 case CLEANUP_POINT_EXPR
:
2470 /* These don't change the alignment of an object. */
2471 return expr_align (TREE_OPERAND (t
, 0));
2474 /* The best we can do is say that the alignment is the least aligned
2476 align0
= expr_align (TREE_OPERAND (t
, 1));
2477 align1
= expr_align (TREE_OPERAND (t
, 2));
2478 return MIN (align0
, align1
);
2480 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2481 meaningfully, it's always 1. */
2482 case LABEL_DECL
: case CONST_DECL
:
2483 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2485 gcc_assert (DECL_ALIGN (t
) != 0);
2486 return DECL_ALIGN (t
);
2492 /* Otherwise take the alignment from that of the type. */
2493 return TYPE_ALIGN (TREE_TYPE (t
));
2496 /* Return, as a tree node, the number of elements for TYPE (which is an
2497 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2500 array_type_nelts (const_tree type
)
2502 tree index_type
, min
, max
;
2504 /* If they did it with unspecified bounds, then we should have already
2505 given an error about it before we got here. */
2506 if (! TYPE_DOMAIN (type
))
2507 return error_mark_node
;
2509 index_type
= TYPE_DOMAIN (type
);
2510 min
= TYPE_MIN_VALUE (index_type
);
2511 max
= TYPE_MAX_VALUE (index_type
);
2513 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2515 return error_mark_node
;
2517 return (integer_zerop (min
)
2519 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2522 /* If arg is static -- a reference to an object in static storage -- then
2523 return the object. This is not the same as the C meaning of `static'.
2524 If arg isn't static, return NULL. */
2529 switch (TREE_CODE (arg
))
2532 /* Nested functions are static, even though taking their address will
2533 involve a trampoline as we unnest the nested function and create
2534 the trampoline on the tree level. */
2538 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2539 && ! DECL_THREAD_LOCAL_P (arg
)
2540 && ! DECL_DLLIMPORT_P (arg
)
2544 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2548 return TREE_STATIC (arg
) ? arg
: NULL
;
2555 /* If the thing being referenced is not a field, then it is
2556 something language specific. */
2557 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2559 /* If we are referencing a bitfield, we can't evaluate an
2560 ADDR_EXPR at compile time and so it isn't a constant. */
2561 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2564 return staticp (TREE_OPERAND (arg
, 0));
2570 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2573 case ARRAY_RANGE_REF
:
2574 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2575 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2576 return staticp (TREE_OPERAND (arg
, 0));
2580 case COMPOUND_LITERAL_EXPR
:
2581 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2591 /* Return whether OP is a DECL whose address is function-invariant. */
2594 decl_address_invariant_p (const_tree op
)
2596 /* The conditions below are slightly less strict than the one in
2599 switch (TREE_CODE (op
))
2608 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2609 || DECL_THREAD_LOCAL_P (op
)
2610 || DECL_CONTEXT (op
) == current_function_decl
2611 || decl_function_context (op
) == current_function_decl
)
2616 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2617 || decl_function_context (op
) == current_function_decl
)
2628 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2631 decl_address_ip_invariant_p (const_tree op
)
2633 /* The conditions below are slightly less strict than the one in
2636 switch (TREE_CODE (op
))
2644 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2645 && !DECL_DLLIMPORT_P (op
))
2646 || DECL_THREAD_LOCAL_P (op
))
2651 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2663 /* Return true if T is function-invariant (internal function, does
2664 not handle arithmetic; that's handled in skip_simple_arithmetic and
2665 tree_invariant_p). */
2667 static bool tree_invariant_p (tree t
);
2670 tree_invariant_p_1 (tree t
)
2674 if (TREE_CONSTANT (t
)
2675 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2678 switch (TREE_CODE (t
))
2684 op
= TREE_OPERAND (t
, 0);
2685 while (handled_component_p (op
))
2687 switch (TREE_CODE (op
))
2690 case ARRAY_RANGE_REF
:
2691 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2692 || TREE_OPERAND (op
, 2) != NULL_TREE
2693 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2698 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2704 op
= TREE_OPERAND (op
, 0);
2707 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2716 /* Return true if T is function-invariant. */
2719 tree_invariant_p (tree t
)
2721 tree inner
= skip_simple_arithmetic (t
);
2722 return tree_invariant_p_1 (inner
);
2725 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2726 Do this to any expression which may be used in more than one place,
2727 but must be evaluated only once.
2729 Normally, expand_expr would reevaluate the expression each time.
2730 Calling save_expr produces something that is evaluated and recorded
2731 the first time expand_expr is called on it. Subsequent calls to
2732 expand_expr just reuse the recorded value.
2734 The call to expand_expr that generates code that actually computes
2735 the value is the first call *at compile time*. Subsequent calls
2736 *at compile time* generate code to use the saved value.
2737 This produces correct result provided that *at run time* control
2738 always flows through the insns made by the first expand_expr
2739 before reaching the other places where the save_expr was evaluated.
2740 You, the caller of save_expr, must make sure this is so.
2742 Constants, and certain read-only nodes, are returned with no
2743 SAVE_EXPR because that is safe. Expressions containing placeholders
2744 are not touched; see tree.def for an explanation of what these
2748 save_expr (tree expr
)
2750 tree t
= fold (expr
);
2753 /* If the tree evaluates to a constant, then we don't want to hide that
2754 fact (i.e. this allows further folding, and direct checks for constants).
2755 However, a read-only object that has side effects cannot be bypassed.
2756 Since it is no problem to reevaluate literals, we just return the
2758 inner
= skip_simple_arithmetic (t
);
2759 if (TREE_CODE (inner
) == ERROR_MARK
)
2762 if (tree_invariant_p_1 (inner
))
2765 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2766 it means that the size or offset of some field of an object depends on
2767 the value within another field.
2769 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2770 and some variable since it would then need to be both evaluated once and
2771 evaluated more than once. Front-ends must assure this case cannot
2772 happen by surrounding any such subexpressions in their own SAVE_EXPR
2773 and forcing evaluation at the proper time. */
2774 if (contains_placeholder_p (inner
))
2777 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2778 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2780 /* This expression might be placed ahead of a jump to ensure that the
2781 value was computed on both sides of the jump. So make sure it isn't
2782 eliminated as dead. */
2783 TREE_SIDE_EFFECTS (t
) = 1;
2787 /* Look inside EXPR and into any simple arithmetic operations. Return
2788 the innermost non-arithmetic node. */
2791 skip_simple_arithmetic (tree expr
)
2795 /* We don't care about whether this can be used as an lvalue in this
2797 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2798 expr
= TREE_OPERAND (expr
, 0);
2800 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2801 a constant, it will be more efficient to not make another SAVE_EXPR since
2802 it will allow better simplification and GCSE will be able to merge the
2803 computations if they actually occur. */
2807 if (UNARY_CLASS_P (inner
))
2808 inner
= TREE_OPERAND (inner
, 0);
2809 else if (BINARY_CLASS_P (inner
))
2811 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2812 inner
= TREE_OPERAND (inner
, 0);
2813 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2814 inner
= TREE_OPERAND (inner
, 1);
2826 /* Return which tree structure is used by T. */
2828 enum tree_node_structure_enum
2829 tree_node_structure (const_tree t
)
2831 const enum tree_code code
= TREE_CODE (t
);
2832 return tree_node_structure_for_code (code
);
2835 /* Set various status flags when building a CALL_EXPR object T. */
2838 process_call_operands (tree t
)
2840 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2841 bool read_only
= false;
2842 int i
= call_expr_flags (t
);
2844 /* Calls have side-effects, except those to const or pure functions. */
2845 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2846 side_effects
= true;
2847 /* Propagate TREE_READONLY of arguments for const functions. */
2851 if (!side_effects
|| read_only
)
2852 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2854 tree op
= TREE_OPERAND (t
, i
);
2855 if (op
&& TREE_SIDE_EFFECTS (op
))
2856 side_effects
= true;
2857 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2861 TREE_SIDE_EFFECTS (t
) = side_effects
;
2862 TREE_READONLY (t
) = read_only
;
2865 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2866 size or offset that depends on a field within a record. */
2869 contains_placeholder_p (const_tree exp
)
2871 enum tree_code code
;
2876 code
= TREE_CODE (exp
);
2877 if (code
== PLACEHOLDER_EXPR
)
2880 switch (TREE_CODE_CLASS (code
))
2883 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2884 position computations since they will be converted into a
2885 WITH_RECORD_EXPR involving the reference, which will assume
2886 here will be valid. */
2887 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2889 case tcc_exceptional
:
2890 if (code
== TREE_LIST
)
2891 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2892 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2897 case tcc_comparison
:
2898 case tcc_expression
:
2902 /* Ignoring the first operand isn't quite right, but works best. */
2903 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2906 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2907 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2908 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2911 /* The save_expr function never wraps anything containing
2912 a PLACEHOLDER_EXPR. */
2919 switch (TREE_CODE_LENGTH (code
))
2922 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2924 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2925 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2936 const_call_expr_arg_iterator iter
;
2937 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2938 if (CONTAINS_PLACEHOLDER_P (arg
))
2952 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
2953 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
2957 type_contains_placeholder_1 (const_tree type
)
2959 /* If the size contains a placeholder or the parent type (component type in
2960 the case of arrays) type involves a placeholder, this type does. */
2961 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2962 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2963 || (!POINTER_TYPE_P (type
)
2965 && type_contains_placeholder_p (TREE_TYPE (type
))))
2968 /* Now do type-specific checks. Note that the last part of the check above
2969 greatly limits what we have to do below. */
2970 switch (TREE_CODE (type
))
2978 case REFERENCE_TYPE
:
2987 case FIXED_POINT_TYPE
:
2988 /* Here we just check the bounds. */
2989 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2990 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2993 /* We have already checked the component type above, so just check the
2995 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2999 case QUAL_UNION_TYPE
:
3003 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3004 if (TREE_CODE (field
) == FIELD_DECL
3005 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3006 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3007 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3008 || type_contains_placeholder_p (TREE_TYPE (field
))))
3019 /* Wrapper around above function used to cache its result. */
3022 type_contains_placeholder_p (tree type
)
3026 /* If the contains_placeholder_bits field has been initialized,
3027 then we know the answer. */
3028 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3029 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3031 /* Indicate that we've seen this type node, and the answer is false.
3032 This is what we want to return if we run into recursion via fields. */
3033 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3035 /* Compute the real value. */
3036 result
= type_contains_placeholder_1 (type
);
3038 /* Store the real value. */
3039 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3044 /* Push tree EXP onto vector QUEUE if it is not already present. */
3047 push_without_duplicates (tree exp
, VEC (tree
, heap
) **queue
)
3052 FOR_EACH_VEC_ELT (tree
, *queue
, i
, iter
)
3053 if (simple_cst_equal (iter
, exp
) == 1)
3057 VEC_safe_push (tree
, heap
, *queue
, exp
);
3060 /* Given a tree EXP, find all occurrences of references to fields
3061 in a PLACEHOLDER_EXPR and place them in vector REFS without
3062 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3063 we assume here that EXP contains only arithmetic expressions
3064 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3068 find_placeholder_in_expr (tree exp
, VEC (tree
, heap
) **refs
)
3070 enum tree_code code
= TREE_CODE (exp
);
3074 /* We handle TREE_LIST and COMPONENT_REF separately. */
3075 if (code
== TREE_LIST
)
3077 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3078 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3080 else if (code
== COMPONENT_REF
)
3082 for (inner
= TREE_OPERAND (exp
, 0);
3083 REFERENCE_CLASS_P (inner
);
3084 inner
= TREE_OPERAND (inner
, 0))
3087 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3088 push_without_duplicates (exp
, refs
);
3090 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3093 switch (TREE_CODE_CLASS (code
))
3098 case tcc_declaration
:
3099 /* Variables allocated to static storage can stay. */
3100 if (!TREE_STATIC (exp
))
3101 push_without_duplicates (exp
, refs
);
3104 case tcc_expression
:
3105 /* This is the pattern built in ada/make_aligning_type. */
3106 if (code
== ADDR_EXPR
3107 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3109 push_without_duplicates (exp
, refs
);
3113 /* Fall through... */
3115 case tcc_exceptional
:
3118 case tcc_comparison
:
3120 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3121 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3125 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3126 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3134 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3135 return a tree with all occurrences of references to F in a
3136 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3137 CONST_DECLs. Note that we assume here that EXP contains only
3138 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3139 occurring only in their argument list. */
3142 substitute_in_expr (tree exp
, tree f
, tree r
)
3144 enum tree_code code
= TREE_CODE (exp
);
3145 tree op0
, op1
, op2
, op3
;
3148 /* We handle TREE_LIST and COMPONENT_REF separately. */
3149 if (code
== TREE_LIST
)
3151 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3152 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3153 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3156 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3158 else if (code
== COMPONENT_REF
)
3162 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3163 and it is the right field, replace it with R. */
3164 for (inner
= TREE_OPERAND (exp
, 0);
3165 REFERENCE_CLASS_P (inner
);
3166 inner
= TREE_OPERAND (inner
, 0))
3170 op1
= TREE_OPERAND (exp
, 1);
3172 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3175 /* If this expression hasn't been completed let, leave it alone. */
3176 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3179 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3180 if (op0
== TREE_OPERAND (exp
, 0))
3184 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3187 switch (TREE_CODE_CLASS (code
))
3192 case tcc_declaration
:
3198 case tcc_expression
:
3202 /* Fall through... */
3204 case tcc_exceptional
:
3207 case tcc_comparison
:
3209 switch (TREE_CODE_LENGTH (code
))
3215 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3216 if (op0
== TREE_OPERAND (exp
, 0))
3219 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3223 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3224 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3226 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3229 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3233 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3234 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3235 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3237 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3238 && op2
== TREE_OPERAND (exp
, 2))
3241 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3245 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3246 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3247 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3248 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3250 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3251 && op2
== TREE_OPERAND (exp
, 2)
3252 && op3
== TREE_OPERAND (exp
, 3))
3256 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3268 new_tree
= NULL_TREE
;
3270 /* If we are trying to replace F with a constant, inline back
3271 functions which do nothing else than computing a value from
3272 the arguments they are passed. This makes it possible to
3273 fold partially or entirely the replacement expression. */
3274 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3276 tree t
= maybe_inline_call_in_expr (exp
);
3278 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3281 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3283 tree op
= TREE_OPERAND (exp
, i
);
3284 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3288 new_tree
= copy_node (exp
);
3289 TREE_OPERAND (new_tree
, i
) = new_op
;
3295 new_tree
= fold (new_tree
);
3296 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3297 process_call_operands (new_tree
);
3308 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3310 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3311 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3316 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3317 for it within OBJ, a tree that is an object or a chain of references. */
3320 substitute_placeholder_in_expr (tree exp
, tree obj
)
3322 enum tree_code code
= TREE_CODE (exp
);
3323 tree op0
, op1
, op2
, op3
;
3326 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3327 in the chain of OBJ. */
3328 if (code
== PLACEHOLDER_EXPR
)
3330 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3333 for (elt
= obj
; elt
!= 0;
3334 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3335 || TREE_CODE (elt
) == COND_EXPR
)
3336 ? TREE_OPERAND (elt
, 1)
3337 : (REFERENCE_CLASS_P (elt
)
3338 || UNARY_CLASS_P (elt
)
3339 || BINARY_CLASS_P (elt
)
3340 || VL_EXP_CLASS_P (elt
)
3341 || EXPRESSION_CLASS_P (elt
))
3342 ? TREE_OPERAND (elt
, 0) : 0))
3343 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3346 for (elt
= obj
; elt
!= 0;
3347 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3348 || TREE_CODE (elt
) == COND_EXPR
)
3349 ? TREE_OPERAND (elt
, 1)
3350 : (REFERENCE_CLASS_P (elt
)
3351 || UNARY_CLASS_P (elt
)
3352 || BINARY_CLASS_P (elt
)
3353 || VL_EXP_CLASS_P (elt
)
3354 || EXPRESSION_CLASS_P (elt
))
3355 ? TREE_OPERAND (elt
, 0) : 0))
3356 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3357 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3359 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3361 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3362 survives until RTL generation, there will be an error. */
3366 /* TREE_LIST is special because we need to look at TREE_VALUE
3367 and TREE_CHAIN, not TREE_OPERANDS. */
3368 else if (code
== TREE_LIST
)
3370 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3371 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3372 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3375 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3378 switch (TREE_CODE_CLASS (code
))
3381 case tcc_declaration
:
3384 case tcc_exceptional
:
3387 case tcc_comparison
:
3388 case tcc_expression
:
3391 switch (TREE_CODE_LENGTH (code
))
3397 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3398 if (op0
== TREE_OPERAND (exp
, 0))
3401 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3405 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3406 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3408 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3411 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3415 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3416 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3417 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3419 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3420 && op2
== TREE_OPERAND (exp
, 2))
3423 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3427 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3428 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3429 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3430 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3432 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3433 && op2
== TREE_OPERAND (exp
, 2)
3434 && op3
== TREE_OPERAND (exp
, 3))
3438 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3450 new_tree
= NULL_TREE
;
3452 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3454 tree op
= TREE_OPERAND (exp
, i
);
3455 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3459 new_tree
= copy_node (exp
);
3460 TREE_OPERAND (new_tree
, i
) = new_op
;
3466 new_tree
= fold (new_tree
);
3467 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3468 process_call_operands (new_tree
);
3479 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3481 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3482 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3487 /* Stabilize a reference so that we can use it any number of times
3488 without causing its operands to be evaluated more than once.
3489 Returns the stabilized reference. This works by means of save_expr,
3490 so see the caveats in the comments about save_expr.
3492 Also allows conversion expressions whose operands are references.
3493 Any other kind of expression is returned unchanged. */
3496 stabilize_reference (tree ref
)
3499 enum tree_code code
= TREE_CODE (ref
);
3506 /* No action is needed in this case. */
3511 case FIX_TRUNC_EXPR
:
3512 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3516 result
= build_nt (INDIRECT_REF
,
3517 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3521 result
= build_nt (COMPONENT_REF
,
3522 stabilize_reference (TREE_OPERAND (ref
, 0)),
3523 TREE_OPERAND (ref
, 1), NULL_TREE
);
3527 result
= build_nt (BIT_FIELD_REF
,
3528 stabilize_reference (TREE_OPERAND (ref
, 0)),
3529 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3530 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
3534 result
= build_nt (ARRAY_REF
,
3535 stabilize_reference (TREE_OPERAND (ref
, 0)),
3536 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3537 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3540 case ARRAY_RANGE_REF
:
3541 result
= build_nt (ARRAY_RANGE_REF
,
3542 stabilize_reference (TREE_OPERAND (ref
, 0)),
3543 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3544 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3548 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3549 it wouldn't be ignored. This matters when dealing with
3551 return stabilize_reference_1 (ref
);
3553 /* If arg isn't a kind of lvalue we recognize, make no change.
3554 Caller should recognize the error for an invalid lvalue. */
3559 return error_mark_node
;
3562 TREE_TYPE (result
) = TREE_TYPE (ref
);
3563 TREE_READONLY (result
) = TREE_READONLY (ref
);
3564 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3565 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3570 /* Subroutine of stabilize_reference; this is called for subtrees of
3571 references. Any expression with side-effects must be put in a SAVE_EXPR
3572 to ensure that it is only evaluated once.
3574 We don't put SAVE_EXPR nodes around everything, because assigning very
3575 simple expressions to temporaries causes us to miss good opportunities
3576 for optimizations. Among other things, the opportunity to fold in the
3577 addition of a constant into an addressing mode often gets lost, e.g.
3578 "y[i+1] += x;". In general, we take the approach that we should not make
3579 an assignment unless we are forced into it - i.e., that any non-side effect
3580 operator should be allowed, and that cse should take care of coalescing
3581 multiple utterances of the same expression should that prove fruitful. */
3584 stabilize_reference_1 (tree e
)
3587 enum tree_code code
= TREE_CODE (e
);
3589 /* We cannot ignore const expressions because it might be a reference
3590 to a const array but whose index contains side-effects. But we can
3591 ignore things that are actual constant or that already have been
3592 handled by this function. */
3594 if (tree_invariant_p (e
))
3597 switch (TREE_CODE_CLASS (code
))
3599 case tcc_exceptional
:
3601 case tcc_declaration
:
3602 case tcc_comparison
:
3604 case tcc_expression
:
3607 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3608 so that it will only be evaluated once. */
3609 /* The reference (r) and comparison (<) classes could be handled as
3610 below, but it is generally faster to only evaluate them once. */
3611 if (TREE_SIDE_EFFECTS (e
))
3612 return save_expr (e
);
3616 /* Constants need no processing. In fact, we should never reach
3621 /* Division is slow and tends to be compiled with jumps,
3622 especially the division by powers of 2 that is often
3623 found inside of an array reference. So do it just once. */
3624 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3625 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3626 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3627 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3628 return save_expr (e
);
3629 /* Recursively stabilize each operand. */
3630 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3631 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3635 /* Recursively stabilize each operand. */
3636 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3643 TREE_TYPE (result
) = TREE_TYPE (e
);
3644 TREE_READONLY (result
) = TREE_READONLY (e
);
3645 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3646 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3651 /* Low-level constructors for expressions. */
3653 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3654 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3657 recompute_tree_invariant_for_addr_expr (tree t
)
3660 bool tc
= true, se
= false;
3662 /* We started out assuming this address is both invariant and constant, but
3663 does not have side effects. Now go down any handled components and see if
3664 any of them involve offsets that are either non-constant or non-invariant.
3665 Also check for side-effects.
3667 ??? Note that this code makes no attempt to deal with the case where
3668 taking the address of something causes a copy due to misalignment. */
3670 #define UPDATE_FLAGS(NODE) \
3671 do { tree _node = (NODE); \
3672 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3673 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3675 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3676 node
= TREE_OPERAND (node
, 0))
3678 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3679 array reference (probably made temporarily by the G++ front end),
3680 so ignore all the operands. */
3681 if ((TREE_CODE (node
) == ARRAY_REF
3682 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3683 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3685 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3686 if (TREE_OPERAND (node
, 2))
3687 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3688 if (TREE_OPERAND (node
, 3))
3689 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3691 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3692 FIELD_DECL, apparently. The G++ front end can put something else
3693 there, at least temporarily. */
3694 else if (TREE_CODE (node
) == COMPONENT_REF
3695 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3697 if (TREE_OPERAND (node
, 2))
3698 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3700 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3701 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3704 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3706 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3707 the address, since &(*a)->b is a form of addition. If it's a constant, the
3708 address is constant too. If it's a decl, its address is constant if the
3709 decl is static. Everything else is not constant and, furthermore,
3710 taking the address of a volatile variable is not volatile. */
3711 if (TREE_CODE (node
) == INDIRECT_REF
3712 || TREE_CODE (node
) == MEM_REF
)
3713 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3714 else if (CONSTANT_CLASS_P (node
))
3716 else if (DECL_P (node
))
3717 tc
&= (staticp (node
) != NULL_TREE
);
3721 se
|= TREE_SIDE_EFFECTS (node
);
3725 TREE_CONSTANT (t
) = tc
;
3726 TREE_SIDE_EFFECTS (t
) = se
;
3730 /* Build an expression of code CODE, data type TYPE, and operands as
3731 specified. Expressions and reference nodes can be created this way.
3732 Constants, decls, types and misc nodes cannot be.
3734 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3735 enough for all extant tree codes. */
3738 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3742 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3744 t
= make_node_stat (code PASS_MEM_STAT
);
3751 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3753 int length
= sizeof (struct tree_exp
);
3756 record_node_allocation_statistics (code
, length
);
3758 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3760 t
= ggc_alloc_zone_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
3762 memset (t
, 0, sizeof (struct tree_common
));
3764 TREE_SET_CODE (t
, code
);
3766 TREE_TYPE (t
) = type
;
3767 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3768 TREE_OPERAND (t
, 0) = node
;
3769 TREE_BLOCK (t
) = NULL_TREE
;
3770 if (node
&& !TYPE_P (node
))
3772 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3773 TREE_READONLY (t
) = TREE_READONLY (node
);
3776 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3777 TREE_SIDE_EFFECTS (t
) = 1;
3781 /* All of these have side-effects, no matter what their
3783 TREE_SIDE_EFFECTS (t
) = 1;
3784 TREE_READONLY (t
) = 0;
3788 /* Whether a dereference is readonly has nothing to do with whether
3789 its operand is readonly. */
3790 TREE_READONLY (t
) = 0;
3795 recompute_tree_invariant_for_addr_expr (t
);
3799 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3800 && node
&& !TYPE_P (node
)
3801 && TREE_CONSTANT (node
))
3802 TREE_CONSTANT (t
) = 1;
3803 if (TREE_CODE_CLASS (code
) == tcc_reference
3804 && node
&& TREE_THIS_VOLATILE (node
))
3805 TREE_THIS_VOLATILE (t
) = 1;
3812 #define PROCESS_ARG(N) \
3814 TREE_OPERAND (t, N) = arg##N; \
3815 if (arg##N &&!TYPE_P (arg##N)) \
3817 if (TREE_SIDE_EFFECTS (arg##N)) \
3819 if (!TREE_READONLY (arg##N) \
3820 && !CONSTANT_CLASS_P (arg##N)) \
3821 (void) (read_only = 0); \
3822 if (!TREE_CONSTANT (arg##N)) \
3823 (void) (constant = 0); \
3828 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3830 bool constant
, read_only
, side_effects
;
3833 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3835 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3836 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3837 /* When sizetype precision doesn't match that of pointers
3838 we need to be able to build explicit extensions or truncations
3839 of the offset argument. */
3840 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3841 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3842 && TREE_CODE (arg1
) == INTEGER_CST
);
3844 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3845 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3846 && ptrofftype_p (TREE_TYPE (arg1
)));
3848 t
= make_node_stat (code PASS_MEM_STAT
);
3851 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3852 result based on those same flags for the arguments. But if the
3853 arguments aren't really even `tree' expressions, we shouldn't be trying
3856 /* Expressions without side effects may be constant if their
3857 arguments are as well. */
3858 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3859 || TREE_CODE_CLASS (code
) == tcc_binary
);
3861 side_effects
= TREE_SIDE_EFFECTS (t
);
3866 TREE_READONLY (t
) = read_only
;
3867 TREE_CONSTANT (t
) = constant
;
3868 TREE_SIDE_EFFECTS (t
) = side_effects
;
3869 TREE_THIS_VOLATILE (t
)
3870 = (TREE_CODE_CLASS (code
) == tcc_reference
3871 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3878 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3879 tree arg2 MEM_STAT_DECL
)
3881 bool constant
, read_only
, side_effects
;
3884 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3885 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3887 t
= make_node_stat (code PASS_MEM_STAT
);
3892 /* As a special exception, if COND_EXPR has NULL branches, we
3893 assume that it is a gimple statement and always consider
3894 it to have side effects. */
3895 if (code
== COND_EXPR
3896 && tt
== void_type_node
3897 && arg1
== NULL_TREE
3898 && arg2
== NULL_TREE
)
3899 side_effects
= true;
3901 side_effects
= TREE_SIDE_EFFECTS (t
);
3907 if (code
== COND_EXPR
)
3908 TREE_READONLY (t
) = read_only
;
3910 TREE_SIDE_EFFECTS (t
) = side_effects
;
3911 TREE_THIS_VOLATILE (t
)
3912 = (TREE_CODE_CLASS (code
) == tcc_reference
3913 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3919 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3920 tree arg2
, tree arg3 MEM_STAT_DECL
)
3922 bool constant
, read_only
, side_effects
;
3925 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3927 t
= make_node_stat (code PASS_MEM_STAT
);
3930 side_effects
= TREE_SIDE_EFFECTS (t
);
3937 TREE_SIDE_EFFECTS (t
) = side_effects
;
3938 TREE_THIS_VOLATILE (t
)
3939 = (TREE_CODE_CLASS (code
) == tcc_reference
3940 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3946 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3947 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3949 bool constant
, read_only
, side_effects
;
3952 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3954 t
= make_node_stat (code PASS_MEM_STAT
);
3957 side_effects
= TREE_SIDE_EFFECTS (t
);
3965 TREE_SIDE_EFFECTS (t
) = side_effects
;
3966 TREE_THIS_VOLATILE (t
)
3967 = (TREE_CODE_CLASS (code
) == tcc_reference
3968 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3974 build6_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3975 tree arg2
, tree arg3
, tree arg4
, tree arg5 MEM_STAT_DECL
)
3977 bool constant
, read_only
, side_effects
;
3980 gcc_assert (code
== TARGET_MEM_REF
);
3982 t
= make_node_stat (code PASS_MEM_STAT
);
3985 side_effects
= TREE_SIDE_EFFECTS (t
);
3992 if (code
== TARGET_MEM_REF
)
3996 TREE_SIDE_EFFECTS (t
) = side_effects
;
3997 TREE_THIS_VOLATILE (t
)
3998 = (code
== TARGET_MEM_REF
3999 && arg5
&& TREE_THIS_VOLATILE (arg5
));
4004 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4005 on the pointer PTR. */
4008 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4010 HOST_WIDE_INT offset
= 0;
4011 tree ptype
= TREE_TYPE (ptr
);
4013 /* For convenience allow addresses that collapse to a simple base
4015 if (TREE_CODE (ptr
) == ADDR_EXPR
4016 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4017 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4019 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4021 ptr
= build_fold_addr_expr (ptr
);
4022 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4024 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4025 ptr
, build_int_cst (ptype
, offset
));
4026 SET_EXPR_LOCATION (tem
, loc
);
4030 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4033 mem_ref_offset (const_tree t
)
4035 tree toff
= TREE_OPERAND (t
, 1);
4036 return double_int_sext (tree_to_double_int (toff
),
4037 TYPE_PRECISION (TREE_TYPE (toff
)));
4040 /* Return the pointer-type relevant for TBAA purposes from the
4041 gimple memory reference tree T. This is the type to be used for
4042 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4045 reference_alias_ptr_type (const_tree t
)
4047 const_tree base
= t
;
4048 while (handled_component_p (base
))
4049 base
= TREE_OPERAND (base
, 0);
4050 if (TREE_CODE (base
) == MEM_REF
)
4051 return TREE_TYPE (TREE_OPERAND (base
, 1));
4052 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4053 return TREE_TYPE (TMR_OFFSET (base
));
4055 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4058 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4059 offsetted by OFFSET units. */
4062 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4064 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4065 build_fold_addr_expr (base
),
4066 build_int_cst (ptr_type_node
, offset
));
4067 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4068 recompute_tree_invariant_for_addr_expr (addr
);
4072 /* Similar except don't specify the TREE_TYPE
4073 and leave the TREE_SIDE_EFFECTS as 0.
4074 It is permissible for arguments to be null,
4075 or even garbage if their values do not matter. */
4078 build_nt (enum tree_code code
, ...)
4085 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4089 t
= make_node (code
);
4090 length
= TREE_CODE_LENGTH (code
);
4092 for (i
= 0; i
< length
; i
++)
4093 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4099 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4103 build_nt_call_vec (tree fn
, VEC(tree
,gc
) *args
)
4108 ret
= build_vl_exp (CALL_EXPR
, VEC_length (tree
, args
) + 3);
4109 CALL_EXPR_FN (ret
) = fn
;
4110 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4111 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
4112 CALL_EXPR_ARG (ret
, ix
) = t
;
4116 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4117 We do NOT enter this node in any sort of symbol table.
4119 LOC is the location of the decl.
4121 layout_decl is used to set up the decl's storage layout.
4122 Other slots are initialized to 0 or null pointers. */
4125 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4126 tree type MEM_STAT_DECL
)
4130 t
= make_node_stat (code PASS_MEM_STAT
);
4131 DECL_SOURCE_LOCATION (t
) = loc
;
4133 /* if (type == error_mark_node)
4134 type = integer_type_node; */
4135 /* That is not done, deliberately, so that having error_mark_node
4136 as the type can suppress useless errors in the use of this variable. */
4138 DECL_NAME (t
) = name
;
4139 TREE_TYPE (t
) = type
;
4141 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4147 /* Builds and returns function declaration with NAME and TYPE. */
4150 build_fn_decl (const char *name
, tree type
)
4152 tree id
= get_identifier (name
);
4153 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4155 DECL_EXTERNAL (decl
) = 1;
4156 TREE_PUBLIC (decl
) = 1;
4157 DECL_ARTIFICIAL (decl
) = 1;
4158 TREE_NOTHROW (decl
) = 1;
4163 VEC(tree
,gc
) *all_translation_units
;
4165 /* Builds a new translation-unit decl with name NAME, queues it in the
4166 global list of translation-unit decls and returns it. */
4169 build_translation_unit_decl (tree name
)
4171 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4173 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4174 VEC_safe_push (tree
, gc
, all_translation_units
, tu
);
4179 /* BLOCK nodes are used to represent the structure of binding contours
4180 and declarations, once those contours have been exited and their contents
4181 compiled. This information is used for outputting debugging info. */
4184 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4186 tree block
= make_node (BLOCK
);
4188 BLOCK_VARS (block
) = vars
;
4189 BLOCK_SUBBLOCKS (block
) = subblocks
;
4190 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4191 BLOCK_CHAIN (block
) = chain
;
4196 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4198 LOC is the location to use in tree T. */
4201 protected_set_expr_location (tree t
, location_t loc
)
4203 if (t
&& CAN_HAVE_LOCATION_P (t
))
4204 SET_EXPR_LOCATION (t
, loc
);
4207 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4211 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4213 DECL_ATTRIBUTES (ddecl
) = attribute
;
4217 /* Borrowed from hashtab.c iterative_hash implementation. */
4218 #define mix(a,b,c) \
4220 a -= b; a -= c; a ^= (c>>13); \
4221 b -= c; b -= a; b ^= (a<< 8); \
4222 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4223 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4224 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4225 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4226 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4227 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4228 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4232 /* Produce good hash value combining VAL and VAL2. */
4234 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4236 /* the golden ratio; an arbitrary value. */
4237 hashval_t a
= 0x9e3779b9;
4243 /* Produce good hash value combining VAL and VAL2. */
4245 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4247 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4248 return iterative_hash_hashval_t (val
, val2
);
4251 hashval_t a
= (hashval_t
) val
;
4252 /* Avoid warnings about shifting of more than the width of the type on
4253 hosts that won't execute this path. */
4255 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4257 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4259 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4260 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4267 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4268 is ATTRIBUTE and its qualifiers are QUALS.
4270 Record such modified types already made so we don't make duplicates. */
4273 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4275 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4277 hashval_t hashcode
= 0;
4279 enum tree_code code
= TREE_CODE (ttype
);
4281 /* Building a distinct copy of a tagged type is inappropriate; it
4282 causes breakage in code that expects there to be a one-to-one
4283 relationship between a struct and its fields.
4284 build_duplicate_type is another solution (as used in
4285 handle_transparent_union_attribute), but that doesn't play well
4286 with the stronger C++ type identity model. */
4287 if (TREE_CODE (ttype
) == RECORD_TYPE
4288 || TREE_CODE (ttype
) == UNION_TYPE
4289 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4290 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4292 warning (OPT_Wattributes
,
4293 "ignoring attributes applied to %qT after definition",
4294 TYPE_MAIN_VARIANT (ttype
));
4295 return build_qualified_type (ttype
, quals
);
4298 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4299 ntype
= build_distinct_type_copy (ttype
);
4301 TYPE_ATTRIBUTES (ntype
) = attribute
;
4303 hashcode
= iterative_hash_object (code
, hashcode
);
4304 if (TREE_TYPE (ntype
))
4305 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4307 hashcode
= attribute_hash_list (attribute
, hashcode
);
4309 switch (TREE_CODE (ntype
))
4312 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4315 if (TYPE_DOMAIN (ntype
))
4316 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4320 hashcode
= iterative_hash_object
4321 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4322 hashcode
= iterative_hash_object
4323 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4326 case FIXED_POINT_TYPE
:
4328 unsigned int precision
= TYPE_PRECISION (ntype
);
4329 hashcode
= iterative_hash_object (precision
, hashcode
);
4336 ntype
= type_hash_canon (hashcode
, ntype
);
4338 /* If the target-dependent attributes make NTYPE different from
4339 its canonical type, we will need to use structural equality
4340 checks for this type. */
4341 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4342 || !comp_type_attributes (ntype
, ttype
))
4343 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4344 else if (TYPE_CANONICAL (ntype
) == ntype
)
4345 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4347 ttype
= build_qualified_type (ntype
, quals
);
4349 else if (TYPE_QUALS (ttype
) != quals
)
4350 ttype
= build_qualified_type (ttype
, quals
);
4355 /* Compare two attributes for their value identity. Return true if the
4356 attribute values are known to be equal; otherwise return false.
4360 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4362 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4365 if (TREE_VALUE (attr1
) != NULL_TREE
4366 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4367 && TREE_VALUE (attr2
) != NULL
4368 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4369 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4370 TREE_VALUE (attr2
)) == 1);
4372 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4375 /* Return 0 if the attributes for two types are incompatible, 1 if they
4376 are compatible, and 2 if they are nearly compatible (which causes a
4377 warning to be generated). */
4379 comp_type_attributes (const_tree type1
, const_tree type2
)
4381 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4382 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4387 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4389 const struct attribute_spec
*as
;
4392 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4393 if (!as
|| as
->affects_type_identity
== false)
4396 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4397 if (!attr
|| !attribute_value_equal (a
, attr
))
4402 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4404 const struct attribute_spec
*as
;
4406 as
= lookup_attribute_spec (TREE_PURPOSE (a
));
4407 if (!as
|| as
->affects_type_identity
== false)
4410 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4412 /* We don't need to compare trees again, as we did this
4413 already in first loop. */
4415 /* All types - affecting identity - are equal, so
4416 there is no need to call target hook for comparison. */
4420 /* As some type combinations - like default calling-convention - might
4421 be compatible, we have to call the target hook to get the final result. */
4422 return targetm
.comp_type_attributes (type1
, type2
);
4425 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4428 Record such modified types already made so we don't make duplicates. */
4431 build_type_attribute_variant (tree ttype
, tree attribute
)
4433 return build_type_attribute_qual_variant (ttype
, attribute
,
4434 TYPE_QUALS (ttype
));
4438 /* Reset the expression *EXPR_P, a size or position.
4440 ??? We could reset all non-constant sizes or positions. But it's cheap
4441 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4443 We need to reset self-referential sizes or positions because they cannot
4444 be gimplified and thus can contain a CALL_EXPR after the gimplification
4445 is finished, which will run afoul of LTO streaming. And they need to be
4446 reset to something essentially dummy but not constant, so as to preserve
4447 the properties of the object they are attached to. */
4450 free_lang_data_in_one_sizepos (tree
*expr_p
)
4452 tree expr
= *expr_p
;
4453 if (CONTAINS_PLACEHOLDER_P (expr
))
4454 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4458 /* Reset all the fields in a binfo node BINFO. We only keep
4459 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4462 free_lang_data_in_binfo (tree binfo
)
4467 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4469 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4470 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4471 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4472 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4474 FOR_EACH_VEC_ELT (tree
, BINFO_BASE_BINFOS (binfo
), i
, t
)
4475 free_lang_data_in_binfo (t
);
4479 /* Reset all language specific information still present in TYPE. */
4482 free_lang_data_in_type (tree type
)
4484 gcc_assert (TYPE_P (type
));
4486 /* Give the FE a chance to remove its own data first. */
4487 lang_hooks
.free_lang_data (type
);
4489 TREE_LANG_FLAG_0 (type
) = 0;
4490 TREE_LANG_FLAG_1 (type
) = 0;
4491 TREE_LANG_FLAG_2 (type
) = 0;
4492 TREE_LANG_FLAG_3 (type
) = 0;
4493 TREE_LANG_FLAG_4 (type
) = 0;
4494 TREE_LANG_FLAG_5 (type
) = 0;
4495 TREE_LANG_FLAG_6 (type
) = 0;
4497 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4499 /* Remove the const and volatile qualifiers from arguments. The
4500 C++ front end removes them, but the C front end does not,
4501 leading to false ODR violation errors when merging two
4502 instances of the same function signature compiled by
4503 different front ends. */
4506 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4508 tree arg_type
= TREE_VALUE (p
);
4510 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4512 int quals
= TYPE_QUALS (arg_type
)
4514 & ~TYPE_QUAL_VOLATILE
;
4515 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4516 free_lang_data_in_type (TREE_VALUE (p
));
4521 /* Remove members that are not actually FIELD_DECLs from the field
4522 list of an aggregate. These occur in C++. */
4523 if (RECORD_OR_UNION_TYPE_P (type
))
4527 /* Note that TYPE_FIELDS can be shared across distinct
4528 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4529 to be removed, we cannot set its TREE_CHAIN to NULL.
4530 Otherwise, we would not be able to find all the other fields
4531 in the other instances of this TREE_TYPE.
4533 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4535 member
= TYPE_FIELDS (type
);
4538 if (TREE_CODE (member
) == FIELD_DECL
4539 || TREE_CODE (member
) == TYPE_DECL
)
4542 TREE_CHAIN (prev
) = member
;
4544 TYPE_FIELDS (type
) = member
;
4548 member
= TREE_CHAIN (member
);
4552 TREE_CHAIN (prev
) = NULL_TREE
;
4554 TYPE_FIELDS (type
) = NULL_TREE
;
4556 TYPE_METHODS (type
) = NULL_TREE
;
4557 if (TYPE_BINFO (type
))
4558 free_lang_data_in_binfo (TYPE_BINFO (type
));
4562 /* For non-aggregate types, clear out the language slot (which
4563 overloads TYPE_BINFO). */
4564 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4566 if (INTEGRAL_TYPE_P (type
)
4567 || SCALAR_FLOAT_TYPE_P (type
)
4568 || FIXED_POINT_TYPE_P (type
))
4570 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4571 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4575 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4576 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4578 if (TYPE_CONTEXT (type
)
4579 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4581 tree ctx
= TYPE_CONTEXT (type
);
4584 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4586 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4587 TYPE_CONTEXT (type
) = ctx
;
4592 /* Return true if DECL may need an assembler name to be set. */
4595 need_assembler_name_p (tree decl
)
4597 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4598 if (TREE_CODE (decl
) != FUNCTION_DECL
4599 && TREE_CODE (decl
) != VAR_DECL
)
4602 /* If DECL already has its assembler name set, it does not need a
4604 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4605 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4608 /* Abstract decls do not need an assembler name. */
4609 if (DECL_ABSTRACT (decl
))
4612 /* For VAR_DECLs, only static, public and external symbols need an
4614 if (TREE_CODE (decl
) == VAR_DECL
4615 && !TREE_STATIC (decl
)
4616 && !TREE_PUBLIC (decl
)
4617 && !DECL_EXTERNAL (decl
))
4620 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4622 /* Do not set assembler name on builtins. Allow RTL expansion to
4623 decide whether to expand inline or via a regular call. */
4624 if (DECL_BUILT_IN (decl
)
4625 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4628 /* Functions represented in the callgraph need an assembler name. */
4629 if (cgraph_get_node (decl
) != NULL
)
4632 /* Unused and not public functions don't need an assembler name. */
4633 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4641 /* Reset all language specific information still present in symbol
4645 free_lang_data_in_decl (tree decl
)
4647 gcc_assert (DECL_P (decl
));
4649 /* Give the FE a chance to remove its own data first. */
4650 lang_hooks
.free_lang_data (decl
);
4652 TREE_LANG_FLAG_0 (decl
) = 0;
4653 TREE_LANG_FLAG_1 (decl
) = 0;
4654 TREE_LANG_FLAG_2 (decl
) = 0;
4655 TREE_LANG_FLAG_3 (decl
) = 0;
4656 TREE_LANG_FLAG_4 (decl
) = 0;
4657 TREE_LANG_FLAG_5 (decl
) = 0;
4658 TREE_LANG_FLAG_6 (decl
) = 0;
4660 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4661 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4662 if (TREE_CODE (decl
) == FIELD_DECL
)
4664 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4665 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4666 DECL_QUALIFIER (decl
) = NULL_TREE
;
4669 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4671 if (gimple_has_body_p (decl
))
4675 /* If DECL has a gimple body, then the context for its
4676 arguments must be DECL. Otherwise, it doesn't really
4677 matter, as we will not be emitting any code for DECL. In
4678 general, there may be other instances of DECL created by
4679 the front end and since PARM_DECLs are generally shared,
4680 their DECL_CONTEXT changes as the replicas of DECL are
4681 created. The only time where DECL_CONTEXT is important
4682 is for the FUNCTION_DECLs that have a gimple body (since
4683 the PARM_DECL will be used in the function's body). */
4684 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4685 DECL_CONTEXT (t
) = decl
;
4688 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4689 At this point, it is not needed anymore. */
4690 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4692 /* Clear the abstract origin if it refers to a method. Otherwise
4693 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4694 origin will not be output correctly. */
4695 if (DECL_ABSTRACT_ORIGIN (decl
)
4696 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4697 && RECORD_OR_UNION_TYPE_P
4698 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4699 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4701 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4702 DECL_VINDEX referring to itself into a vtable slot number as it
4703 should. Happens with functions that are copied and then forgotten
4704 about. Just clear it, it won't matter anymore. */
4705 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4706 DECL_VINDEX (decl
) = NULL_TREE
;
4708 else if (TREE_CODE (decl
) == VAR_DECL
)
4710 if ((DECL_EXTERNAL (decl
)
4711 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4712 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4713 DECL_INITIAL (decl
) = NULL_TREE
;
4715 else if (TREE_CODE (decl
) == TYPE_DECL
4716 || TREE_CODE (decl
) == FIELD_DECL
)
4717 DECL_INITIAL (decl
) = NULL_TREE
;
4718 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4719 && DECL_INITIAL (decl
)
4720 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4722 /* Strip builtins from the translation-unit BLOCK. We still have targets
4723 without builtin_decl_explicit support and also builtins are shared
4724 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4725 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4729 if (TREE_CODE (var
) == FUNCTION_DECL
4730 && DECL_BUILT_IN (var
))
4731 *nextp
= TREE_CHAIN (var
);
4733 nextp
= &TREE_CHAIN (var
);
4739 /* Data used when collecting DECLs and TYPEs for language data removal. */
4741 struct free_lang_data_d
4743 /* Worklist to avoid excessive recursion. */
4744 VEC(tree
,heap
) *worklist
;
4746 /* Set of traversed objects. Used to avoid duplicate visits. */
4747 struct pointer_set_t
*pset
;
4749 /* Array of symbols to process with free_lang_data_in_decl. */
4750 VEC(tree
,heap
) *decls
;
4752 /* Array of types to process with free_lang_data_in_type. */
4753 VEC(tree
,heap
) *types
;
4757 /* Save all language fields needed to generate proper debug information
4758 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4761 save_debug_info_for_decl (tree t
)
4763 /*struct saved_debug_info_d *sdi;*/
4765 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4767 /* FIXME. Partial implementation for saving debug info removed. */
4771 /* Save all language fields needed to generate proper debug information
4772 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4775 save_debug_info_for_type (tree t
)
4777 /*struct saved_debug_info_d *sdi;*/
4779 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4781 /* FIXME. Partial implementation for saving debug info removed. */
4785 /* Add type or decl T to one of the list of tree nodes that need their
4786 language data removed. The lists are held inside FLD. */
4789 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4793 VEC_safe_push (tree
, heap
, fld
->decls
, t
);
4794 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4795 save_debug_info_for_decl (t
);
4797 else if (TYPE_P (t
))
4799 VEC_safe_push (tree
, heap
, fld
->types
, t
);
4800 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4801 save_debug_info_for_type (t
);
4807 /* Push tree node T into FLD->WORKLIST. */
4810 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4812 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4813 VEC_safe_push (tree
, heap
, fld
->worklist
, (t
));
4817 /* Operand callback helper for free_lang_data_in_node. *TP is the
4818 subtree operand being considered. */
4821 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4824 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4826 if (TREE_CODE (t
) == TREE_LIST
)
4829 /* Language specific nodes will be removed, so there is no need
4830 to gather anything under them. */
4831 if (is_lang_specific (t
))
4839 /* Note that walk_tree does not traverse every possible field in
4840 decls, so we have to do our own traversals here. */
4841 add_tree_to_fld_list (t
, fld
);
4843 fld_worklist_push (DECL_NAME (t
), fld
);
4844 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4845 fld_worklist_push (DECL_SIZE (t
), fld
);
4846 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4848 /* We are going to remove everything under DECL_INITIAL for
4849 TYPE_DECLs. No point walking them. */
4850 if (TREE_CODE (t
) != TYPE_DECL
)
4851 fld_worklist_push (DECL_INITIAL (t
), fld
);
4853 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4854 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4856 if (TREE_CODE (t
) == FUNCTION_DECL
)
4858 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4859 fld_worklist_push (DECL_RESULT (t
), fld
);
4861 else if (TREE_CODE (t
) == TYPE_DECL
)
4863 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4864 fld_worklist_push (DECL_VINDEX (t
), fld
);
4865 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
4867 else if (TREE_CODE (t
) == FIELD_DECL
)
4869 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4870 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4871 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4872 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4874 else if (TREE_CODE (t
) == VAR_DECL
)
4876 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4877 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4880 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4881 && DECL_HAS_VALUE_EXPR_P (t
))
4882 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4884 if (TREE_CODE (t
) != FIELD_DECL
4885 && TREE_CODE (t
) != TYPE_DECL
)
4886 fld_worklist_push (TREE_CHAIN (t
), fld
);
4889 else if (TYPE_P (t
))
4891 /* Note that walk_tree does not traverse every possible field in
4892 types, so we have to do our own traversals here. */
4893 add_tree_to_fld_list (t
, fld
);
4895 if (!RECORD_OR_UNION_TYPE_P (t
))
4896 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4897 fld_worklist_push (TYPE_SIZE (t
), fld
);
4898 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4899 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4900 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4901 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4902 fld_worklist_push (TYPE_NAME (t
), fld
);
4903 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4904 them and thus do not and want not to reach unused pointer types
4906 if (!POINTER_TYPE_P (t
))
4907 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4908 if (!RECORD_OR_UNION_TYPE_P (t
))
4909 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4910 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4911 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4912 do not and want not to reach unused variants this way. */
4913 if (TYPE_CONTEXT (t
))
4915 tree ctx
= TYPE_CONTEXT (t
);
4916 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
4917 So push that instead. */
4918 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
4919 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4920 fld_worklist_push (ctx
, fld
);
4922 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4923 and want not to reach unused types this way. */
4925 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4929 for (i
= 0; VEC_iterate (tree
, BINFO_BASE_BINFOS (TYPE_BINFO (t
)),
4931 fld_worklist_push (TREE_TYPE (tem
), fld
);
4932 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4934 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4935 && TREE_CODE (tem
) == TREE_LIST
)
4938 fld_worklist_push (TREE_VALUE (tem
), fld
);
4939 tem
= TREE_CHAIN (tem
);
4943 if (RECORD_OR_UNION_TYPE_P (t
))
4946 /* Push all TYPE_FIELDS - there can be interleaving interesting
4947 and non-interesting things. */
4948 tem
= TYPE_FIELDS (t
);
4951 if (TREE_CODE (tem
) == FIELD_DECL
4952 || TREE_CODE (tem
) == TYPE_DECL
)
4953 fld_worklist_push (tem
, fld
);
4954 tem
= TREE_CHAIN (tem
);
4958 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
4961 else if (TREE_CODE (t
) == BLOCK
)
4964 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
4965 fld_worklist_push (tem
, fld
);
4966 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
4967 fld_worklist_push (tem
, fld
);
4968 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
4971 if (TREE_CODE (t
) != IDENTIFIER_NODE
4972 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
4973 fld_worklist_push (TREE_TYPE (t
), fld
);
4979 /* Find decls and types in T. */
4982 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
4986 if (!pointer_set_contains (fld
->pset
, t
))
4987 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
4988 if (VEC_empty (tree
, fld
->worklist
))
4990 t
= VEC_pop (tree
, fld
->worklist
);
4994 /* Translate all the types in LIST with the corresponding runtime
4998 get_eh_types_for_runtime (tree list
)
5002 if (list
== NULL_TREE
)
5005 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5007 list
= TREE_CHAIN (list
);
5010 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5011 TREE_CHAIN (prev
) = n
;
5012 prev
= TREE_CHAIN (prev
);
5013 list
= TREE_CHAIN (list
);
5020 /* Find decls and types referenced in EH region R and store them in
5021 FLD->DECLS and FLD->TYPES. */
5024 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5035 /* The types referenced in each catch must first be changed to the
5036 EH types used at runtime. This removes references to FE types
5038 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5040 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5041 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5046 case ERT_ALLOWED_EXCEPTIONS
:
5047 r
->u
.allowed
.type_list
5048 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5049 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5052 case ERT_MUST_NOT_THROW
:
5053 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5054 find_decls_types_r
, fld
, fld
->pset
);
5060 /* Find decls and types referenced in cgraph node N and store them in
5061 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5062 look for *every* kind of DECL and TYPE node reachable from N,
5063 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5064 NAMESPACE_DECLs, etc). */
5067 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5070 struct function
*fn
;
5074 find_decls_types (n
->symbol
.decl
, fld
);
5076 if (!gimple_has_body_p (n
->symbol
.decl
))
5079 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5081 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5083 /* Traverse locals. */
5084 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5085 find_decls_types (t
, fld
);
5087 /* Traverse EH regions in FN. */
5090 FOR_ALL_EH_REGION_FN (r
, fn
)
5091 find_decls_types_in_eh_region (r
, fld
);
5094 /* Traverse every statement in FN. */
5095 FOR_EACH_BB_FN (bb
, fn
)
5097 gimple_stmt_iterator si
;
5100 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5102 gimple phi
= gsi_stmt (si
);
5104 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5106 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5107 find_decls_types (*arg_p
, fld
);
5111 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5113 gimple stmt
= gsi_stmt (si
);
5115 if (is_gimple_call (stmt
))
5116 find_decls_types (gimple_call_fntype (stmt
), fld
);
5118 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5120 tree arg
= gimple_op (stmt
, i
);
5121 find_decls_types (arg
, fld
);
5128 /* Find decls and types referenced in varpool node N and store them in
5129 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5130 look for *every* kind of DECL and TYPE node reachable from N,
5131 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5132 NAMESPACE_DECLs, etc). */
5135 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5137 find_decls_types (v
->symbol
.decl
, fld
);
5140 /* If T needs an assembler name, have one created for it. */
5143 assign_assembler_name_if_neeeded (tree t
)
5145 if (need_assembler_name_p (t
))
5147 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5148 diagnostics that use input_location to show locus
5149 information. The problem here is that, at this point,
5150 input_location is generally anchored to the end of the file
5151 (since the parser is long gone), so we don't have a good
5152 position to pin it to.
5154 To alleviate this problem, this uses the location of T's
5155 declaration. Examples of this are
5156 testsuite/g++.dg/template/cond2.C and
5157 testsuite/g++.dg/template/pr35240.C. */
5158 location_t saved_location
= input_location
;
5159 input_location
= DECL_SOURCE_LOCATION (t
);
5161 decl_assembler_name (t
);
5163 input_location
= saved_location
;
5168 /* Free language specific information for every operand and expression
5169 in every node of the call graph. This process operates in three stages:
5171 1- Every callgraph node and varpool node is traversed looking for
5172 decls and types embedded in them. This is a more exhaustive
5173 search than that done by find_referenced_vars, because it will
5174 also collect individual fields, decls embedded in types, etc.
5176 2- All the decls found are sent to free_lang_data_in_decl.
5178 3- All the types found are sent to free_lang_data_in_type.
5180 The ordering between decls and types is important because
5181 free_lang_data_in_decl sets assembler names, which includes
5182 mangling. So types cannot be freed up until assembler names have
5186 free_lang_data_in_cgraph (void)
5188 struct cgraph_node
*n
;
5189 struct varpool_node
*v
;
5190 struct free_lang_data_d fld
;
5195 /* Initialize sets and arrays to store referenced decls and types. */
5196 fld
.pset
= pointer_set_create ();
5197 fld
.worklist
= NULL
;
5198 fld
.decls
= VEC_alloc (tree
, heap
, 100);
5199 fld
.types
= VEC_alloc (tree
, heap
, 100);
5201 /* Find decls and types in the body of every function in the callgraph. */
5202 FOR_EACH_FUNCTION (n
)
5203 find_decls_types_in_node (n
, &fld
);
5205 FOR_EACH_VEC_ELT (alias_pair
, alias_pairs
, i
, p
)
5206 find_decls_types (p
->decl
, &fld
);
5208 /* Find decls and types in every varpool symbol. */
5209 FOR_EACH_VARIABLE (v
)
5210 find_decls_types_in_var (v
, &fld
);
5212 /* Set the assembler name on every decl found. We need to do this
5213 now because free_lang_data_in_decl will invalidate data needed
5214 for mangling. This breaks mangling on interdependent decls. */
5215 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5216 assign_assembler_name_if_neeeded (t
);
5218 /* Traverse every decl found freeing its language data. */
5219 FOR_EACH_VEC_ELT (tree
, fld
.decls
, i
, t
)
5220 free_lang_data_in_decl (t
);
5222 /* Traverse every type found freeing its language data. */
5223 FOR_EACH_VEC_ELT (tree
, fld
.types
, i
, t
)
5224 free_lang_data_in_type (t
);
5226 pointer_set_destroy (fld
.pset
);
5227 VEC_free (tree
, heap
, fld
.worklist
);
5228 VEC_free (tree
, heap
, fld
.decls
);
5229 VEC_free (tree
, heap
, fld
.types
);
5233 /* Free resources that are used by FE but are not needed once they are done. */
5236 free_lang_data (void)
5240 /* If we are the LTO frontend we have freed lang-specific data already. */
5242 || !flag_generate_lto
)
5245 /* Allocate and assign alias sets to the standard integer types
5246 while the slots are still in the way the frontends generated them. */
5247 for (i
= 0; i
< itk_none
; ++i
)
5248 if (integer_types
[i
])
5249 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5251 /* Traverse the IL resetting language specific information for
5252 operands, expressions, etc. */
5253 free_lang_data_in_cgraph ();
5255 /* Create gimple variants for common types. */
5256 ptrdiff_type_node
= integer_type_node
;
5257 fileptr_type_node
= ptr_type_node
;
5259 /* Reset some langhooks. Do not reset types_compatible_p, it may
5260 still be used indirectly via the get_alias_set langhook. */
5261 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5262 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5263 /* We do not want the default decl_assembler_name implementation,
5264 rather if we have fixed everything we want a wrapper around it
5265 asserting that all non-local symbols already got their assembler
5266 name and only produce assembler names for local symbols. Or rather
5267 make sure we never call decl_assembler_name on local symbols and
5268 devise a separate, middle-end private scheme for it. */
5270 /* Reset diagnostic machinery. */
5271 tree_diagnostics_defaults (global_dc
);
5277 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5281 "*free_lang_data", /* name */
5283 free_lang_data
, /* execute */
5286 0, /* static_pass_number */
5287 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5288 0, /* properties_required */
5289 0, /* properties_provided */
5290 0, /* properties_destroyed */
5291 0, /* todo_flags_start */
5292 TODO_ggc_collect
/* todo_flags_finish */
5296 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5297 ATTR_NAME. Also used internally by remove_attribute(). */
5299 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5301 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5303 if (ident_len
== attr_len
)
5305 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5308 else if (ident_len
== attr_len
+ 4)
5310 /* There is the possibility that ATTR is 'text' and IDENT is
5312 const char *p
= IDENTIFIER_POINTER (ident
);
5313 if (p
[0] == '_' && p
[1] == '_'
5314 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5315 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5322 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5323 of ATTR_NAME, and LIST is not NULL_TREE. */
5325 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5329 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5331 if (ident_len
== attr_len
)
5333 if (strcmp (attr_name
, IDENTIFIER_POINTER (TREE_PURPOSE (list
))) == 0)
5336 /* TODO: If we made sure that attributes were stored in the
5337 canonical form without '__...__' (ie, as in 'text' as opposed
5338 to '__text__') then we could avoid the following case. */
5339 else if (ident_len
== attr_len
+ 4)
5341 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5342 if (p
[0] == '_' && p
[1] == '_'
5343 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5344 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5347 list
= TREE_CHAIN (list
);
5353 /* A variant of lookup_attribute() that can be used with an identifier
5354 as the first argument, and where the identifier can be either
5355 'text' or '__text__'.
5357 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5358 return a pointer to the attribute's list element if the attribute
5359 is part of the list, or NULL_TREE if not found. If the attribute
5360 appears more than once, this only returns the first occurrence; the
5361 TREE_CHAIN of the return value should be passed back in if further
5362 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5363 can be in the form 'text' or '__text__'. */
5365 lookup_ident_attribute (tree attr_identifier
, tree list
)
5367 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5371 gcc_checking_assert (TREE_CODE (TREE_PURPOSE (list
)) == IDENTIFIER_NODE
);
5373 /* Identifiers can be compared directly for equality. */
5374 if (attr_identifier
== TREE_PURPOSE (list
))
5377 /* If they are not equal, they may still be one in the form
5378 'text' while the other one is in the form '__text__'. TODO:
5379 If we were storing attributes in normalized 'text' form, then
5380 this could all go away and we could take full advantage of
5381 the fact that we're comparing identifiers. :-) */
5383 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5384 size_t ident_len
= IDENTIFIER_LENGTH (TREE_PURPOSE (list
));
5386 if (ident_len
== attr_len
+ 4)
5388 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5389 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5390 if (p
[0] == '_' && p
[1] == '_'
5391 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5392 && strncmp (q
, p
+ 2, attr_len
) == 0)
5395 else if (ident_len
+ 4 == attr_len
)
5397 const char *p
= IDENTIFIER_POINTER (TREE_PURPOSE (list
));
5398 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5399 if (q
[0] == '_' && q
[1] == '_'
5400 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5401 && strncmp (q
+ 2, p
, ident_len
) == 0)
5405 list
= TREE_CHAIN (list
);
5411 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5415 remove_attribute (const char *attr_name
, tree list
)
5418 size_t attr_len
= strlen (attr_name
);
5420 gcc_checking_assert (attr_name
[0] != '_');
5422 for (p
= &list
; *p
; )
5425 /* TODO: If we were storing attributes in normalized form, here
5426 we could use a simple strcmp(). */
5427 if (private_is_attribute_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
5428 *p
= TREE_CHAIN (l
);
5430 p
= &TREE_CHAIN (l
);
5436 /* Return an attribute list that is the union of a1 and a2. */
5439 merge_attributes (tree a1
, tree a2
)
5443 /* Either one unset? Take the set one. */
5445 if ((attributes
= a1
) == 0)
5448 /* One that completely contains the other? Take it. */
5450 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5452 if (attribute_list_contained (a2
, a1
))
5456 /* Pick the longest list, and hang on the other list. */
5458 if (list_length (a1
) < list_length (a2
))
5459 attributes
= a2
, a2
= a1
;
5461 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5464 for (a
= lookup_ident_attribute (TREE_PURPOSE (a2
), attributes
);
5465 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5466 a
= lookup_ident_attribute (TREE_PURPOSE (a2
), TREE_CHAIN (a
)))
5470 a1
= copy_node (a2
);
5471 TREE_CHAIN (a1
) = attributes
;
5480 /* Given types T1 and T2, merge their attributes and return
5484 merge_type_attributes (tree t1
, tree t2
)
5486 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5487 TYPE_ATTRIBUTES (t2
));
5490 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5494 merge_decl_attributes (tree olddecl
, tree newdecl
)
5496 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5497 DECL_ATTRIBUTES (newdecl
));
5500 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5502 /* Specialization of merge_decl_attributes for various Windows targets.
5504 This handles the following situation:
5506 __declspec (dllimport) int foo;
5509 The second instance of `foo' nullifies the dllimport. */
5512 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5515 int delete_dllimport_p
= 1;
5517 /* What we need to do here is remove from `old' dllimport if it doesn't
5518 appear in `new'. dllimport behaves like extern: if a declaration is
5519 marked dllimport and a definition appears later, then the object
5520 is not dllimport'd. We also remove a `new' dllimport if the old list
5521 contains dllexport: dllexport always overrides dllimport, regardless
5522 of the order of declaration. */
5523 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5524 delete_dllimport_p
= 0;
5525 else if (DECL_DLLIMPORT_P (new_tree
)
5526 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5528 DECL_DLLIMPORT_P (new_tree
) = 0;
5529 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5530 "dllimport ignored", new_tree
);
5532 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5534 /* Warn about overriding a symbol that has already been used, e.g.:
5535 extern int __attribute__ ((dllimport)) foo;
5536 int* bar () {return &foo;}
5539 if (TREE_USED (old
))
5541 warning (0, "%q+D redeclared without dllimport attribute "
5542 "after being referenced with dll linkage", new_tree
);
5543 /* If we have used a variable's address with dllimport linkage,
5544 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5545 decl may already have had TREE_CONSTANT computed.
5546 We still remove the attribute so that assembler code refers
5547 to '&foo rather than '_imp__foo'. */
5548 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5549 DECL_DLLIMPORT_P (new_tree
) = 1;
5552 /* Let an inline definition silently override the external reference,
5553 but otherwise warn about attribute inconsistency. */
5554 else if (TREE_CODE (new_tree
) == VAR_DECL
5555 || !DECL_DECLARED_INLINE_P (new_tree
))
5556 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5557 "previous dllimport ignored", new_tree
);
5560 delete_dllimport_p
= 0;
5562 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5564 if (delete_dllimport_p
)
5565 a
= remove_attribute ("dllimport", a
);
5570 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5571 struct attribute_spec.handler. */
5574 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5580 /* These attributes may apply to structure and union types being created,
5581 but otherwise should pass to the declaration involved. */
5584 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5585 | (int) ATTR_FLAG_ARRAY_NEXT
))
5587 *no_add_attrs
= true;
5588 return tree_cons (name
, args
, NULL_TREE
);
5590 if (TREE_CODE (node
) == RECORD_TYPE
5591 || TREE_CODE (node
) == UNION_TYPE
)
5593 node
= TYPE_NAME (node
);
5599 warning (OPT_Wattributes
, "%qE attribute ignored",
5601 *no_add_attrs
= true;
5606 if (TREE_CODE (node
) != FUNCTION_DECL
5607 && TREE_CODE (node
) != VAR_DECL
5608 && TREE_CODE (node
) != TYPE_DECL
)
5610 *no_add_attrs
= true;
5611 warning (OPT_Wattributes
, "%qE attribute ignored",
5616 if (TREE_CODE (node
) == TYPE_DECL
5617 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5618 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5620 *no_add_attrs
= true;
5621 warning (OPT_Wattributes
, "%qE attribute ignored",
5626 is_dllimport
= is_attribute_p ("dllimport", name
);
5628 /* Report error on dllimport ambiguities seen now before they cause
5632 /* Honor any target-specific overrides. */
5633 if (!targetm
.valid_dllimport_attribute_p (node
))
5634 *no_add_attrs
= true;
5636 else if (TREE_CODE (node
) == FUNCTION_DECL
5637 && DECL_DECLARED_INLINE_P (node
))
5639 warning (OPT_Wattributes
, "inline function %q+D declared as "
5640 " dllimport: attribute ignored", node
);
5641 *no_add_attrs
= true;
5643 /* Like MS, treat definition of dllimported variables and
5644 non-inlined functions on declaration as syntax errors. */
5645 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5647 error ("function %q+D definition is marked dllimport", node
);
5648 *no_add_attrs
= true;
5651 else if (TREE_CODE (node
) == VAR_DECL
)
5653 if (DECL_INITIAL (node
))
5655 error ("variable %q+D definition is marked dllimport",
5657 *no_add_attrs
= true;
5660 /* `extern' needn't be specified with dllimport.
5661 Specify `extern' now and hope for the best. Sigh. */
5662 DECL_EXTERNAL (node
) = 1;
5663 /* Also, implicitly give dllimport'd variables declared within
5664 a function global scope, unless declared static. */
5665 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5666 TREE_PUBLIC (node
) = 1;
5669 if (*no_add_attrs
== false)
5670 DECL_DLLIMPORT_P (node
) = 1;
5672 else if (TREE_CODE (node
) == FUNCTION_DECL
5673 && DECL_DECLARED_INLINE_P (node
)
5674 && flag_keep_inline_dllexport
)
5675 /* An exported function, even if inline, must be emitted. */
5676 DECL_EXTERNAL (node
) = 0;
5678 /* Report error if symbol is not accessible at global scope. */
5679 if (!TREE_PUBLIC (node
)
5680 && (TREE_CODE (node
) == VAR_DECL
5681 || TREE_CODE (node
) == FUNCTION_DECL
))
5683 error ("external linkage required for symbol %q+D because of "
5684 "%qE attribute", node
, name
);
5685 *no_add_attrs
= true;
5688 /* A dllexport'd entity must have default visibility so that other
5689 program units (shared libraries or the main executable) can see
5690 it. A dllimport'd entity must have default visibility so that
5691 the linker knows that undefined references within this program
5692 unit can be resolved by the dynamic linker. */
5695 if (DECL_VISIBILITY_SPECIFIED (node
)
5696 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5697 error ("%qE implies default visibility, but %qD has already "
5698 "been declared with a different visibility",
5700 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5701 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5707 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5709 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5710 of the various TYPE_QUAL values. */
5713 set_type_quals (tree type
, int type_quals
)
5715 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5716 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5717 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5718 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5721 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5724 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5726 return (TYPE_QUALS (cand
) == type_quals
5727 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5728 /* Apparently this is needed for Objective-C. */
5729 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5730 /* Check alignment. */
5731 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5732 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5733 TYPE_ATTRIBUTES (base
)));
5736 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5739 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5741 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5742 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5743 /* Apparently this is needed for Objective-C. */
5744 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5745 /* Check alignment. */
5746 && TYPE_ALIGN (cand
) == align
5747 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5748 TYPE_ATTRIBUTES (base
)));
5751 /* Return a version of the TYPE, qualified as indicated by the
5752 TYPE_QUALS, if one exists. If no qualified version exists yet,
5753 return NULL_TREE. */
5756 get_qualified_type (tree type
, int type_quals
)
5760 if (TYPE_QUALS (type
) == type_quals
)
5763 /* Search the chain of variants to see if there is already one there just
5764 like the one we need to have. If so, use that existing one. We must
5765 preserve the TYPE_NAME, since there is code that depends on this. */
5766 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5767 if (check_qualified_type (t
, type
, type_quals
))
5773 /* Like get_qualified_type, but creates the type if it does not
5774 exist. This function never returns NULL_TREE. */
5777 build_qualified_type (tree type
, int type_quals
)
5781 /* See if we already have the appropriate qualified variant. */
5782 t
= get_qualified_type (type
, type_quals
);
5784 /* If not, build it. */
5787 t
= build_variant_type_copy (type
);
5788 set_type_quals (t
, type_quals
);
5790 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5791 /* Propagate structural equality. */
5792 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5793 else if (TYPE_CANONICAL (type
) != type
)
5794 /* Build the underlying canonical type, since it is different
5796 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5799 /* T is its own canonical type. */
5800 TYPE_CANONICAL (t
) = t
;
5807 /* Create a variant of type T with alignment ALIGN. */
5810 build_aligned_type (tree type
, unsigned int align
)
5814 if (TYPE_PACKED (type
)
5815 || TYPE_ALIGN (type
) == align
)
5818 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5819 if (check_aligned_type (t
, type
, align
))
5822 t
= build_variant_type_copy (type
);
5823 TYPE_ALIGN (t
) = align
;
5828 /* Create a new distinct copy of TYPE. The new type is made its own
5829 MAIN_VARIANT. If TYPE requires structural equality checks, the
5830 resulting type requires structural equality checks; otherwise, its
5831 TYPE_CANONICAL points to itself. */
5834 build_distinct_type_copy (tree type
)
5836 tree t
= copy_node (type
);
5838 TYPE_POINTER_TO (t
) = 0;
5839 TYPE_REFERENCE_TO (t
) = 0;
5841 /* Set the canonical type either to a new equivalence class, or
5842 propagate the need for structural equality checks. */
5843 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5844 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5846 TYPE_CANONICAL (t
) = t
;
5848 /* Make it its own variant. */
5849 TYPE_MAIN_VARIANT (t
) = t
;
5850 TYPE_NEXT_VARIANT (t
) = 0;
5852 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5853 whose TREE_TYPE is not t. This can also happen in the Ada
5854 frontend when using subtypes. */
5859 /* Create a new variant of TYPE, equivalent but distinct. This is so
5860 the caller can modify it. TYPE_CANONICAL for the return type will
5861 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5862 are considered equal by the language itself (or that both types
5863 require structural equality checks). */
5866 build_variant_type_copy (tree type
)
5868 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5870 t
= build_distinct_type_copy (type
);
5872 /* Since we're building a variant, assume that it is a non-semantic
5873 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5874 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5876 /* Add the new type to the chain of variants of TYPE. */
5877 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5878 TYPE_NEXT_VARIANT (m
) = t
;
5879 TYPE_MAIN_VARIANT (t
) = m
;
5884 /* Return true if the from tree in both tree maps are equal. */
5887 tree_map_base_eq (const void *va
, const void *vb
)
5889 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5890 *const b
= (const struct tree_map_base
*) vb
;
5891 return (a
->from
== b
->from
);
5894 /* Hash a from tree in a tree_base_map. */
5897 tree_map_base_hash (const void *item
)
5899 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5902 /* Return true if this tree map structure is marked for garbage collection
5903 purposes. We simply return true if the from tree is marked, so that this
5904 structure goes away when the from tree goes away. */
5907 tree_map_base_marked_p (const void *p
)
5909 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5912 /* Hash a from tree in a tree_map. */
5915 tree_map_hash (const void *item
)
5917 return (((const struct tree_map
*) item
)->hash
);
5920 /* Hash a from tree in a tree_decl_map. */
5923 tree_decl_map_hash (const void *item
)
5925 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5928 /* Return the initialization priority for DECL. */
5931 decl_init_priority_lookup (tree decl
)
5933 struct tree_priority_map
*h
;
5934 struct tree_map_base in
;
5936 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5938 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5939 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5942 /* Return the finalization priority for DECL. */
5945 decl_fini_priority_lookup (tree decl
)
5947 struct tree_priority_map
*h
;
5948 struct tree_map_base in
;
5950 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
5952 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5953 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
5956 /* Return the initialization and finalization priority information for
5957 DECL. If there is no previous priority information, a freshly
5958 allocated structure is returned. */
5960 static struct tree_priority_map
*
5961 decl_priority_info (tree decl
)
5963 struct tree_priority_map in
;
5964 struct tree_priority_map
*h
;
5967 in
.base
.from
= decl
;
5968 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
5969 h
= (struct tree_priority_map
*) *loc
;
5972 h
= ggc_alloc_cleared_tree_priority_map ();
5974 h
->base
.from
= decl
;
5975 h
->init
= DEFAULT_INIT_PRIORITY
;
5976 h
->fini
= DEFAULT_INIT_PRIORITY
;
5982 /* Set the initialization priority for DECL to PRIORITY. */
5985 decl_init_priority_insert (tree decl
, priority_type priority
)
5987 struct tree_priority_map
*h
;
5989 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5990 if (priority
== DEFAULT_INIT_PRIORITY
)
5992 h
= decl_priority_info (decl
);
5996 /* Set the finalization priority for DECL to PRIORITY. */
5999 decl_fini_priority_insert (tree decl
, priority_type priority
)
6001 struct tree_priority_map
*h
;
6003 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6004 if (priority
== DEFAULT_INIT_PRIORITY
)
6006 h
= decl_priority_info (decl
);
6010 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6013 print_debug_expr_statistics (void)
6015 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6016 (long) htab_size (debug_expr_for_decl
),
6017 (long) htab_elements (debug_expr_for_decl
),
6018 htab_collisions (debug_expr_for_decl
));
6021 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6024 print_value_expr_statistics (void)
6026 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6027 (long) htab_size (value_expr_for_decl
),
6028 (long) htab_elements (value_expr_for_decl
),
6029 htab_collisions (value_expr_for_decl
));
6032 /* Lookup a debug expression for FROM, and return it if we find one. */
6035 decl_debug_expr_lookup (tree from
)
6037 struct tree_decl_map
*h
, in
;
6038 in
.base
.from
= from
;
6040 h
= (struct tree_decl_map
*)
6041 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6047 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6050 decl_debug_expr_insert (tree from
, tree to
)
6052 struct tree_decl_map
*h
;
6055 h
= ggc_alloc_tree_decl_map ();
6056 h
->base
.from
= from
;
6058 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6060 *(struct tree_decl_map
**) loc
= h
;
6063 /* Lookup a value expression for FROM, and return it if we find one. */
6066 decl_value_expr_lookup (tree from
)
6068 struct tree_decl_map
*h
, in
;
6069 in
.base
.from
= from
;
6071 h
= (struct tree_decl_map
*)
6072 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6078 /* Insert a mapping FROM->TO in the value expression hashtable. */
6081 decl_value_expr_insert (tree from
, tree to
)
6083 struct tree_decl_map
*h
;
6086 h
= ggc_alloc_tree_decl_map ();
6087 h
->base
.from
= from
;
6089 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6091 *(struct tree_decl_map
**) loc
= h
;
6094 /* Lookup a vector of debug arguments for FROM, and return it if we
6098 decl_debug_args_lookup (tree from
)
6100 struct tree_vec_map
*h
, in
;
6102 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6104 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6105 in
.base
.from
= from
;
6106 h
= (struct tree_vec_map
*)
6107 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6113 /* Insert a mapping FROM->empty vector of debug arguments in the value
6114 expression hashtable. */
6117 decl_debug_args_insert (tree from
)
6119 struct tree_vec_map
*h
;
6122 if (DECL_HAS_DEBUG_ARGS_P (from
))
6123 return decl_debug_args_lookup (from
);
6124 if (debug_args_for_decl
== NULL
)
6125 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6126 tree_vec_map_eq
, 0);
6127 h
= ggc_alloc_tree_vec_map ();
6128 h
->base
.from
= from
;
6130 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6132 *(struct tree_vec_map
**) loc
= h
;
6133 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6137 /* Hashing of types so that we don't make duplicates.
6138 The entry point is `type_hash_canon'. */
6140 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6141 with types in the TREE_VALUE slots), by adding the hash codes
6142 of the individual types. */
6145 type_hash_list (const_tree list
, hashval_t hashcode
)
6149 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6150 if (TREE_VALUE (tail
) != error_mark_node
)
6151 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6157 /* These are the Hashtable callback functions. */
6159 /* Returns true iff the types are equivalent. */
6162 type_hash_eq (const void *va
, const void *vb
)
6164 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6165 *const b
= (const struct type_hash
*) vb
;
6167 /* First test the things that are the same for all types. */
6168 if (a
->hash
!= b
->hash
6169 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6170 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6171 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6172 TYPE_ATTRIBUTES (b
->type
))
6173 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6174 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6177 /* Be careful about comparing arrays before and after the element type
6178 has been completed; don't compare TYPE_ALIGN unless both types are
6180 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6181 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6182 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6185 switch (TREE_CODE (a
->type
))
6190 case REFERENCE_TYPE
:
6195 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6198 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6199 && !(TYPE_VALUES (a
->type
)
6200 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6201 && TYPE_VALUES (b
->type
)
6202 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6203 && type_list_equal (TYPE_VALUES (a
->type
),
6204 TYPE_VALUES (b
->type
))))
6207 /* ... fall through ... */
6212 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6213 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6214 TYPE_MAX_VALUE (b
->type
)))
6215 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6216 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6217 TYPE_MIN_VALUE (b
->type
))));
6219 case FIXED_POINT_TYPE
:
6220 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6223 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6226 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6227 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6228 || (TYPE_ARG_TYPES (a
->type
)
6229 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6230 && TYPE_ARG_TYPES (b
->type
)
6231 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6232 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6233 TYPE_ARG_TYPES (b
->type
)))))
6237 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6241 case QUAL_UNION_TYPE
:
6242 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6243 || (TYPE_FIELDS (a
->type
)
6244 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6245 && TYPE_FIELDS (b
->type
)
6246 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6247 && type_list_equal (TYPE_FIELDS (a
->type
),
6248 TYPE_FIELDS (b
->type
))));
6251 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6252 || (TYPE_ARG_TYPES (a
->type
)
6253 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6254 && TYPE_ARG_TYPES (b
->type
)
6255 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6256 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6257 TYPE_ARG_TYPES (b
->type
))))
6265 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6266 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6271 /* Return the cached hash value. */
6274 type_hash_hash (const void *item
)
6276 return ((const struct type_hash
*) item
)->hash
;
6279 /* Look in the type hash table for a type isomorphic to TYPE.
6280 If one is found, return it. Otherwise return 0. */
6283 type_hash_lookup (hashval_t hashcode
, tree type
)
6285 struct type_hash
*h
, in
;
6287 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6288 must call that routine before comparing TYPE_ALIGNs. */
6294 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6301 /* Add an entry to the type-hash-table
6302 for a type TYPE whose hash code is HASHCODE. */
6305 type_hash_add (hashval_t hashcode
, tree type
)
6307 struct type_hash
*h
;
6310 h
= ggc_alloc_type_hash ();
6313 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6317 /* Given TYPE, and HASHCODE its hash code, return the canonical
6318 object for an identical type if one already exists.
6319 Otherwise, return TYPE, and record it as the canonical object.
6321 To use this function, first create a type of the sort you want.
6322 Then compute its hash code from the fields of the type that
6323 make it different from other similar types.
6324 Then call this function and use the value. */
6327 type_hash_canon (unsigned int hashcode
, tree type
)
6331 /* The hash table only contains main variants, so ensure that's what we're
6333 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6335 /* See if the type is in the hash table already. If so, return it.
6336 Otherwise, add the type. */
6337 t1
= type_hash_lookup (hashcode
, type
);
6340 #ifdef GATHER_STATISTICS
6341 tree_code_counts
[(int) TREE_CODE (type
)]--;
6342 tree_node_counts
[(int) t_kind
]--;
6343 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6349 type_hash_add (hashcode
, type
);
6354 /* See if the data pointed to by the type hash table is marked. We consider
6355 it marked if the type is marked or if a debug type number or symbol
6356 table entry has been made for the type. */
6359 type_hash_marked_p (const void *p
)
6361 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6363 return ggc_marked_p (type
);
6367 print_type_hash_statistics (void)
6369 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6370 (long) htab_size (type_hash_table
),
6371 (long) htab_elements (type_hash_table
),
6372 htab_collisions (type_hash_table
));
6375 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6376 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6377 by adding the hash codes of the individual attributes. */
6380 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6384 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6385 /* ??? Do we want to add in TREE_VALUE too? */
6386 hashcode
= iterative_hash_object
6387 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
6391 /* Given two lists of attributes, return true if list l2 is
6392 equivalent to l1. */
6395 attribute_list_equal (const_tree l1
, const_tree l2
)
6400 return attribute_list_contained (l1
, l2
)
6401 && attribute_list_contained (l2
, l1
);
6404 /* Given two lists of attributes, return true if list L2 is
6405 completely contained within L1. */
6406 /* ??? This would be faster if attribute names were stored in a canonicalized
6407 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6408 must be used to show these elements are equivalent (which they are). */
6409 /* ??? It's not clear that attributes with arguments will always be handled
6413 attribute_list_contained (const_tree l1
, const_tree l2
)
6417 /* First check the obvious, maybe the lists are identical. */
6421 /* Maybe the lists are similar. */
6422 for (t1
= l1
, t2
= l2
;
6424 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
6425 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6426 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6429 /* Maybe the lists are equal. */
6430 if (t1
== 0 && t2
== 0)
6433 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6436 /* This CONST_CAST is okay because lookup_attribute does not
6437 modify its argument and the return value is assigned to a
6439 for (attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), CONST_CAST_TREE(l1
));
6440 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6441 attr
= lookup_ident_attribute (TREE_PURPOSE (t2
), TREE_CHAIN (attr
)))
6444 if (attr
== NULL_TREE
)
6451 /* Given two lists of types
6452 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6453 return 1 if the lists contain the same types in the same order.
6454 Also, the TREE_PURPOSEs must match. */
6457 type_list_equal (const_tree l1
, const_tree l2
)
6461 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6462 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6463 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6464 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6465 && (TREE_TYPE (TREE_PURPOSE (t1
))
6466 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6472 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6473 given by TYPE. If the argument list accepts variable arguments,
6474 then this function counts only the ordinary arguments. */
6477 type_num_arguments (const_tree type
)
6482 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6483 /* If the function does not take a variable number of arguments,
6484 the last element in the list will have type `void'. */
6485 if (VOID_TYPE_P (TREE_VALUE (t
)))
6493 /* Nonzero if integer constants T1 and T2
6494 represent the same constant value. */
6497 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6502 if (t1
== 0 || t2
== 0)
6505 if (TREE_CODE (t1
) == INTEGER_CST
6506 && TREE_CODE (t2
) == INTEGER_CST
6507 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6508 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6514 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6515 The precise way of comparison depends on their data type. */
6518 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6523 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6525 int t1_sgn
= tree_int_cst_sgn (t1
);
6526 int t2_sgn
= tree_int_cst_sgn (t2
);
6528 if (t1_sgn
< t2_sgn
)
6530 else if (t1_sgn
> t2_sgn
)
6532 /* Otherwise, both are non-negative, so we compare them as
6533 unsigned just in case one of them would overflow a signed
6536 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6537 return INT_CST_LT (t1
, t2
);
6539 return INT_CST_LT_UNSIGNED (t1
, t2
);
6542 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6545 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6547 if (tree_int_cst_lt (t1
, t2
))
6549 else if (tree_int_cst_lt (t2
, t1
))
6555 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6556 the host. If POS is zero, the value can be represented in a single
6557 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6558 be represented in a single unsigned HOST_WIDE_INT. */
6561 host_integerp (const_tree t
, int pos
)
6566 return (TREE_CODE (t
) == INTEGER_CST
6567 && ((TREE_INT_CST_HIGH (t
) == 0
6568 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6569 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6570 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6571 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6572 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6575 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6576 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6577 be non-negative. We must be able to satisfy the above conditions. */
6580 tree_low_cst (const_tree t
, int pos
)
6582 gcc_assert (host_integerp (t
, pos
));
6583 return TREE_INT_CST_LOW (t
);
6586 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6587 kind INTEGER_CST. This makes sure to properly sign-extend the
6591 size_low_cst (const_tree t
)
6593 double_int d
= tree_to_double_int (t
);
6594 return double_int_sext (d
, TYPE_PRECISION (TREE_TYPE (t
))).low
;
6597 /* Return the most significant (sign) bit of T. */
6600 tree_int_cst_sign_bit (const_tree t
)
6602 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6603 unsigned HOST_WIDE_INT w
;
6605 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6606 w
= TREE_INT_CST_LOW (t
);
6609 w
= TREE_INT_CST_HIGH (t
);
6610 bitno
-= HOST_BITS_PER_WIDE_INT
;
6613 return (w
>> bitno
) & 1;
6616 /* Return an indication of the sign of the integer constant T.
6617 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6618 Note that -1 will never be returned if T's type is unsigned. */
6621 tree_int_cst_sgn (const_tree t
)
6623 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6625 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6627 else if (TREE_INT_CST_HIGH (t
) < 0)
6633 /* Return the minimum number of bits needed to represent VALUE in a
6634 signed or unsigned type, UNSIGNEDP says which. */
6637 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6641 /* If the value is negative, compute its negative minus 1. The latter
6642 adjustment is because the absolute value of the largest negative value
6643 is one larger than the largest positive value. This is equivalent to
6644 a bit-wise negation, so use that operation instead. */
6646 if (tree_int_cst_sgn (value
) < 0)
6647 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6649 /* Return the number of bits needed, taking into account the fact
6650 that we need one more bit for a signed than unsigned type. */
6652 if (integer_zerop (value
))
6655 log
= tree_floor_log2 (value
);
6657 return log
+ 1 + !unsignedp
;
6660 /* Compare two constructor-element-type constants. Return 1 if the lists
6661 are known to be equal; otherwise return 0. */
6664 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6666 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6668 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6671 l1
= TREE_CHAIN (l1
);
6672 l2
= TREE_CHAIN (l2
);
6678 /* Return truthvalue of whether T1 is the same tree structure as T2.
6679 Return 1 if they are the same.
6680 Return 0 if they are understandably different.
6681 Return -1 if either contains tree structure not understood by
6685 simple_cst_equal (const_tree t1
, const_tree t2
)
6687 enum tree_code code1
, code2
;
6693 if (t1
== 0 || t2
== 0)
6696 code1
= TREE_CODE (t1
);
6697 code2
= TREE_CODE (t2
);
6699 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6701 if (CONVERT_EXPR_CODE_P (code2
)
6702 || code2
== NON_LVALUE_EXPR
)
6703 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6705 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6708 else if (CONVERT_EXPR_CODE_P (code2
)
6709 || code2
== NON_LVALUE_EXPR
)
6710 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6718 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6719 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6722 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6725 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6728 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6729 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6730 TREE_STRING_LENGTH (t1
)));
6734 unsigned HOST_WIDE_INT idx
;
6735 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
6736 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
6738 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
6741 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
6742 /* ??? Should we handle also fields here? */
6743 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
6744 VEC_index (constructor_elt
, v2
, idx
)->value
))
6750 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6753 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6756 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6759 const_tree arg1
, arg2
;
6760 const_call_expr_arg_iterator iter1
, iter2
;
6761 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6762 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6764 arg1
= next_const_call_expr_arg (&iter1
),
6765 arg2
= next_const_call_expr_arg (&iter2
))
6767 cmp
= simple_cst_equal (arg1
, arg2
);
6771 return arg1
== arg2
;
6775 /* Special case: if either target is an unallocated VAR_DECL,
6776 it means that it's going to be unified with whatever the
6777 TARGET_EXPR is really supposed to initialize, so treat it
6778 as being equivalent to anything. */
6779 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6780 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6781 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6782 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6783 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6784 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6787 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6792 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6794 case WITH_CLEANUP_EXPR
:
6795 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6799 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6802 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6803 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6817 /* This general rule works for most tree codes. All exceptions should be
6818 handled above. If this is a language-specific tree code, we can't
6819 trust what might be in the operand, so say we don't know
6821 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6824 switch (TREE_CODE_CLASS (code1
))
6828 case tcc_comparison
:
6829 case tcc_expression
:
6833 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6835 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6847 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6848 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6849 than U, respectively. */
6852 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6854 if (tree_int_cst_sgn (t
) < 0)
6856 else if (TREE_INT_CST_HIGH (t
) != 0)
6858 else if (TREE_INT_CST_LOW (t
) == u
)
6860 else if (TREE_INT_CST_LOW (t
) < u
)
6866 /* Return true if SIZE represents a constant size that is in bounds of
6867 what the middle-end and the backend accepts (covering not more than
6868 half of the address-space). */
6871 valid_constant_size_p (const_tree size
)
6873 if (! host_integerp (size
, 1)
6874 || TREE_OVERFLOW (size
)
6875 || tree_int_cst_sign_bit (size
) != 0)
6880 /* Return true if CODE represents an associative tree code. Otherwise
6883 associative_tree_code (enum tree_code code
)
6902 /* Return true if CODE represents a commutative tree code. Otherwise
6905 commutative_tree_code (enum tree_code code
)
6911 case MULT_HIGHPART_EXPR
:
6919 case UNORDERED_EXPR
:
6923 case TRUTH_AND_EXPR
:
6924 case TRUTH_XOR_EXPR
:
6926 case WIDEN_MULT_EXPR
:
6927 case VEC_WIDEN_MULT_HI_EXPR
:
6928 case VEC_WIDEN_MULT_LO_EXPR
:
6929 case VEC_WIDEN_MULT_EVEN_EXPR
:
6930 case VEC_WIDEN_MULT_ODD_EXPR
:
6939 /* Return true if CODE represents a ternary tree code for which the
6940 first two operands are commutative. Otherwise return false. */
6942 commutative_ternary_tree_code (enum tree_code code
)
6946 case WIDEN_MULT_PLUS_EXPR
:
6947 case WIDEN_MULT_MINUS_EXPR
:
6956 /* Generate a hash value for an expression. This can be used iteratively
6957 by passing a previous result as the VAL argument.
6959 This function is intended to produce the same hash for expressions which
6960 would compare equal using operand_equal_p. */
6963 iterative_hash_expr (const_tree t
, hashval_t val
)
6966 enum tree_code code
;
6970 return iterative_hash_hashval_t (0, val
);
6972 code
= TREE_CODE (t
);
6976 /* Alas, constants aren't shared, so we can't rely on pointer
6979 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
6980 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
6983 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
6985 return iterative_hash_hashval_t (val2
, val
);
6989 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
6991 return iterative_hash_hashval_t (val2
, val
);
6994 return iterative_hash (TREE_STRING_POINTER (t
),
6995 TREE_STRING_LENGTH (t
), val
);
6997 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
6998 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7002 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7003 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7007 /* We can just compare by pointer. */
7008 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7009 case PLACEHOLDER_EXPR
:
7010 /* The node itself doesn't matter. */
7013 /* A list of expressions, for a CALL_EXPR or as the elements of a
7015 for (; t
; t
= TREE_CHAIN (t
))
7016 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7020 unsigned HOST_WIDE_INT idx
;
7022 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7024 val
= iterative_hash_expr (field
, val
);
7025 val
= iterative_hash_expr (value
, val
);
7031 /* The type of the second operand is relevant, except for
7032 its top-level qualifiers. */
7033 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7035 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7037 /* We could use the standard hash computation from this point
7039 val
= iterative_hash_object (code
, val
);
7040 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7041 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7045 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7046 Otherwise nodes that compare equal according to operand_equal_p might
7047 get different hash codes. However, don't do this for machine specific
7048 or front end builtins, since the function code is overloaded in those
7050 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7051 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7053 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7054 code
= TREE_CODE (t
);
7058 tclass
= TREE_CODE_CLASS (code
);
7060 if (tclass
== tcc_declaration
)
7062 /* DECL's have a unique ID */
7063 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7067 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7069 val
= iterative_hash_object (code
, val
);
7071 /* Don't hash the type, that can lead to having nodes which
7072 compare equal according to operand_equal_p, but which
7073 have different hash codes. */
7074 if (CONVERT_EXPR_CODE_P (code
)
7075 || code
== NON_LVALUE_EXPR
)
7077 /* Make sure to include signness in the hash computation. */
7078 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7079 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7082 else if (commutative_tree_code (code
))
7084 /* It's a commutative expression. We want to hash it the same
7085 however it appears. We do this by first hashing both operands
7086 and then rehashing based on the order of their independent
7088 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7089 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7093 t
= one
, one
= two
, two
= t
;
7095 val
= iterative_hash_hashval_t (one
, val
);
7096 val
= iterative_hash_hashval_t (two
, val
);
7099 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7100 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7106 /* Generate a hash value for a pair of expressions. This can be used
7107 iteratively by passing a previous result as the VAL argument.
7109 The same hash value is always returned for a given pair of expressions,
7110 regardless of the order in which they are presented. This is useful in
7111 hashing the operands of commutative functions. */
7114 iterative_hash_exprs_commutative (const_tree t1
,
7115 const_tree t2
, hashval_t val
)
7117 hashval_t one
= iterative_hash_expr (t1
, 0);
7118 hashval_t two
= iterative_hash_expr (t2
, 0);
7122 t
= one
, one
= two
, two
= t
;
7123 val
= iterative_hash_hashval_t (one
, val
);
7124 val
= iterative_hash_hashval_t (two
, val
);
7129 /* Constructors for pointer, array and function types.
7130 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7131 constructed by language-dependent code, not here.) */
7133 /* Construct, lay out and return the type of pointers to TO_TYPE with
7134 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7135 reference all of memory. If such a type has already been
7136 constructed, reuse it. */
7139 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7144 if (to_type
== error_mark_node
)
7145 return error_mark_node
;
7147 /* If the pointed-to type has the may_alias attribute set, force
7148 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7149 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7150 can_alias_all
= true;
7152 /* In some cases, languages will have things that aren't a POINTER_TYPE
7153 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7154 In that case, return that type without regard to the rest of our
7157 ??? This is a kludge, but consistent with the way this function has
7158 always operated and there doesn't seem to be a good way to avoid this
7160 if (TYPE_POINTER_TO (to_type
) != 0
7161 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7162 return TYPE_POINTER_TO (to_type
);
7164 /* First, if we already have a type for pointers to TO_TYPE and it's
7165 the proper mode, use it. */
7166 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7167 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7170 t
= make_node (POINTER_TYPE
);
7172 TREE_TYPE (t
) = to_type
;
7173 SET_TYPE_MODE (t
, mode
);
7174 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7175 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7176 TYPE_POINTER_TO (to_type
) = t
;
7178 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7179 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7180 else if (TYPE_CANONICAL (to_type
) != to_type
)
7182 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7183 mode
, can_alias_all
);
7185 /* Lay out the type. This function has many callers that are concerned
7186 with expression-construction, and this simplifies them all. */
7192 /* By default build pointers in ptr_mode. */
7195 build_pointer_type (tree to_type
)
7197 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7198 : TYPE_ADDR_SPACE (to_type
);
7199 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7200 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7203 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7206 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7211 if (to_type
== error_mark_node
)
7212 return error_mark_node
;
7214 /* If the pointed-to type has the may_alias attribute set, force
7215 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7216 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7217 can_alias_all
= true;
7219 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7220 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7221 In that case, return that type without regard to the rest of our
7224 ??? This is a kludge, but consistent with the way this function has
7225 always operated and there doesn't seem to be a good way to avoid this
7227 if (TYPE_REFERENCE_TO (to_type
) != 0
7228 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7229 return TYPE_REFERENCE_TO (to_type
);
7231 /* First, if we already have a type for pointers to TO_TYPE and it's
7232 the proper mode, use it. */
7233 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7234 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7237 t
= make_node (REFERENCE_TYPE
);
7239 TREE_TYPE (t
) = to_type
;
7240 SET_TYPE_MODE (t
, mode
);
7241 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7242 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7243 TYPE_REFERENCE_TO (to_type
) = t
;
7245 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7246 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7247 else if (TYPE_CANONICAL (to_type
) != to_type
)
7249 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7250 mode
, can_alias_all
);
7258 /* Build the node for the type of references-to-TO_TYPE by default
7262 build_reference_type (tree to_type
)
7264 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7265 : TYPE_ADDR_SPACE (to_type
);
7266 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7267 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7270 /* Build a type that is compatible with t but has no cv quals anywhere
7273 const char *const *const * -> char ***. */
7276 build_type_no_quals (tree t
)
7278 switch (TREE_CODE (t
))
7281 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7283 TYPE_REF_CAN_ALIAS_ALL (t
));
7284 case REFERENCE_TYPE
:
7286 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7288 TYPE_REF_CAN_ALIAS_ALL (t
));
7290 return TYPE_MAIN_VARIANT (t
);
7294 #define MAX_INT_CACHED_PREC \
7295 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7296 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7298 /* Builds a signed or unsigned integer type of precision PRECISION.
7299 Used for C bitfields whose precision does not match that of
7300 built-in target types. */
7302 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7308 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7310 if (precision
<= MAX_INT_CACHED_PREC
)
7312 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7317 itype
= make_node (INTEGER_TYPE
);
7318 TYPE_PRECISION (itype
) = precision
;
7321 fixup_unsigned_type (itype
);
7323 fixup_signed_type (itype
);
7326 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7327 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7328 if (precision
<= MAX_INT_CACHED_PREC
)
7329 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7334 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7335 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7336 is true, reuse such a type that has already been constructed. */
7339 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7341 tree itype
= make_node (INTEGER_TYPE
);
7342 hashval_t hashcode
= 0;
7344 TREE_TYPE (itype
) = type
;
7346 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7347 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7349 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7350 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7351 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7352 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7353 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7354 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7359 if ((TYPE_MIN_VALUE (itype
)
7360 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7361 || (TYPE_MAX_VALUE (itype
)
7362 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7364 /* Since we cannot reliably merge this type, we need to compare it using
7365 structural equality checks. */
7366 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7370 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7371 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7372 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7373 itype
= type_hash_canon (hashcode
, itype
);
7378 /* Wrapper around build_range_type_1 with SHARED set to true. */
7381 build_range_type (tree type
, tree lowval
, tree highval
)
7383 return build_range_type_1 (type
, lowval
, highval
, true);
7386 /* Wrapper around build_range_type_1 with SHARED set to false. */
7389 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7391 return build_range_type_1 (type
, lowval
, highval
, false);
7394 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7395 MAXVAL should be the maximum value in the domain
7396 (one less than the length of the array).
7398 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7399 We don't enforce this limit, that is up to caller (e.g. language front end).
7400 The limit exists because the result is a signed type and we don't handle
7401 sizes that use more than one HOST_WIDE_INT. */
7404 build_index_type (tree maxval
)
7406 return build_range_type (sizetype
, size_zero_node
, maxval
);
7409 /* Return true if the debug information for TYPE, a subtype, should be emitted
7410 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7411 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7412 debug info and doesn't reflect the source code. */
7415 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7417 tree base_type
= TREE_TYPE (type
), low
, high
;
7419 /* Subrange types have a base type which is an integral type. */
7420 if (!INTEGRAL_TYPE_P (base_type
))
7423 /* Get the real bounds of the subtype. */
7424 if (lang_hooks
.types
.get_subrange_bounds
)
7425 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7428 low
= TYPE_MIN_VALUE (type
);
7429 high
= TYPE_MAX_VALUE (type
);
7432 /* If the type and its base type have the same representation and the same
7433 name, then the type is not a subrange but a copy of the base type. */
7434 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7435 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7436 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7437 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7438 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7440 tree type_name
= TYPE_NAME (type
);
7441 tree base_type_name
= TYPE_NAME (base_type
);
7443 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7444 type_name
= DECL_NAME (type_name
);
7446 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7447 base_type_name
= DECL_NAME (base_type_name
);
7449 if (type_name
== base_type_name
)
7460 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7461 and number of elements specified by the range of values of INDEX_TYPE.
7462 If SHARED is true, reuse such a type that has already been constructed. */
7465 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7469 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7471 error ("arrays of functions are not meaningful");
7472 elt_type
= integer_type_node
;
7475 t
= make_node (ARRAY_TYPE
);
7476 TREE_TYPE (t
) = elt_type
;
7477 TYPE_DOMAIN (t
) = index_type
;
7478 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7481 /* If the element type is incomplete at this point we get marked for
7482 structural equality. Do not record these types in the canonical
7484 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7489 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7491 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7492 t
= type_hash_canon (hashcode
, t
);
7495 if (TYPE_CANONICAL (t
) == t
)
7497 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7498 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7499 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7500 else if (TYPE_CANONICAL (elt_type
) != elt_type
7501 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7503 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7505 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7512 /* Wrapper around build_array_type_1 with SHARED set to true. */
7515 build_array_type (tree elt_type
, tree index_type
)
7517 return build_array_type_1 (elt_type
, index_type
, true);
7520 /* Wrapper around build_array_type_1 with SHARED set to false. */
7523 build_nonshared_array_type (tree elt_type
, tree index_type
)
7525 return build_array_type_1 (elt_type
, index_type
, false);
7528 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7532 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7534 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7537 /* Recursively examines the array elements of TYPE, until a non-array
7538 element type is found. */
7541 strip_array_types (tree type
)
7543 while (TREE_CODE (type
) == ARRAY_TYPE
)
7544 type
= TREE_TYPE (type
);
7549 /* Computes the canonical argument types from the argument type list
7552 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7553 on entry to this function, or if any of the ARGTYPES are
7556 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7557 true on entry to this function, or if any of the ARGTYPES are
7560 Returns a canonical argument list, which may be ARGTYPES when the
7561 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7562 true) or would not differ from ARGTYPES. */
7565 maybe_canonicalize_argtypes(tree argtypes
,
7566 bool *any_structural_p
,
7567 bool *any_noncanonical_p
)
7570 bool any_noncanonical_argtypes_p
= false;
7572 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7574 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7575 /* Fail gracefully by stating that the type is structural. */
7576 *any_structural_p
= true;
7577 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7578 *any_structural_p
= true;
7579 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7580 || TREE_PURPOSE (arg
))
7581 /* If the argument has a default argument, we consider it
7582 non-canonical even though the type itself is canonical.
7583 That way, different variants of function and method types
7584 with default arguments will all point to the variant with
7585 no defaults as their canonical type. */
7586 any_noncanonical_argtypes_p
= true;
7589 if (*any_structural_p
)
7592 if (any_noncanonical_argtypes_p
)
7594 /* Build the canonical list of argument types. */
7595 tree canon_argtypes
= NULL_TREE
;
7596 bool is_void
= false;
7598 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7600 if (arg
== void_list_node
)
7603 canon_argtypes
= tree_cons (NULL_TREE
,
7604 TYPE_CANONICAL (TREE_VALUE (arg
)),
7608 canon_argtypes
= nreverse (canon_argtypes
);
7610 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7612 /* There is a non-canonical type. */
7613 *any_noncanonical_p
= true;
7614 return canon_argtypes
;
7617 /* The canonical argument types are the same as ARGTYPES. */
7621 /* Construct, lay out and return
7622 the type of functions returning type VALUE_TYPE
7623 given arguments of types ARG_TYPES.
7624 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7625 are data type nodes for the arguments of the function.
7626 If such a type has already been constructed, reuse it. */
7629 build_function_type (tree value_type
, tree arg_types
)
7632 hashval_t hashcode
= 0;
7633 bool any_structural_p
, any_noncanonical_p
;
7634 tree canon_argtypes
;
7636 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7638 error ("function return type cannot be function");
7639 value_type
= integer_type_node
;
7642 /* Make a node of the sort we want. */
7643 t
= make_node (FUNCTION_TYPE
);
7644 TREE_TYPE (t
) = value_type
;
7645 TYPE_ARG_TYPES (t
) = arg_types
;
7647 /* If we already have such a type, use the old one. */
7648 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7649 hashcode
= type_hash_list (arg_types
, hashcode
);
7650 t
= type_hash_canon (hashcode
, t
);
7652 /* Set up the canonical type. */
7653 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7654 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7655 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7657 &any_noncanonical_p
);
7658 if (any_structural_p
)
7659 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7660 else if (any_noncanonical_p
)
7661 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7664 if (!COMPLETE_TYPE_P (t
))
7669 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7670 return value if SKIP_RETURN is true. */
7673 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7676 tree new_type
= NULL
;
7677 tree args
, new_args
= NULL
, t
;
7681 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7682 args
= TREE_CHAIN (args
), i
++)
7683 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7684 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7686 new_reversed
= nreverse (new_args
);
7690 TREE_CHAIN (new_args
) = void_list_node
;
7692 new_reversed
= void_list_node
;
7695 /* Use copy_node to preserve as much as possible from original type
7696 (debug info, attribute lists etc.)
7697 Exception is METHOD_TYPEs must have THIS argument.
7698 When we are asked to remove it, we need to build new FUNCTION_TYPE
7700 if (TREE_CODE (orig_type
) != METHOD_TYPE
7702 || !bitmap_bit_p (args_to_skip
, 0))
7704 new_type
= build_distinct_type_copy (orig_type
);
7705 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7710 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7712 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7716 TREE_TYPE (new_type
) = void_type_node
;
7718 /* This is a new type, not a copy of an old type. Need to reassociate
7719 variants. We can handle everything except the main variant lazily. */
7720 t
= TYPE_MAIN_VARIANT (orig_type
);
7723 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7724 TYPE_MAIN_VARIANT (new_type
) = t
;
7725 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7726 TYPE_NEXT_VARIANT (t
) = new_type
;
7730 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7731 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7737 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7738 return value if SKIP_RETURN is true.
7740 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7741 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7742 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7745 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
7748 tree new_decl
= copy_node (orig_decl
);
7751 new_type
= TREE_TYPE (orig_decl
);
7752 if (prototype_p (new_type
)
7753 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
7755 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
7756 TREE_TYPE (new_decl
) = new_type
;
7758 /* For declarations setting DECL_VINDEX (i.e. methods)
7759 we expect first argument to be THIS pointer. */
7760 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
7761 DECL_VINDEX (new_decl
) = NULL_TREE
;
7763 /* When signature changes, we need to clear builtin info. */
7764 if (DECL_BUILT_IN (new_decl
)
7766 && !bitmap_empty_p (args_to_skip
))
7768 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7769 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7774 /* Build a function type. The RETURN_TYPE is the type returned by the
7775 function. If VAARGS is set, no void_type_node is appended to the
7776 the list. ARGP must be always be terminated be a NULL_TREE. */
7779 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7783 t
= va_arg (argp
, tree
);
7784 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7785 args
= tree_cons (NULL_TREE
, t
, args
);
7790 if (args
!= NULL_TREE
)
7791 args
= nreverse (args
);
7792 gcc_assert (last
!= void_list_node
);
7794 else if (args
== NULL_TREE
)
7795 args
= void_list_node
;
7799 args
= nreverse (args
);
7800 TREE_CHAIN (last
) = void_list_node
;
7802 args
= build_function_type (return_type
, args
);
7807 /* Build a function type. The RETURN_TYPE is the type returned by the
7808 function. If additional arguments are provided, they are
7809 additional argument types. The list of argument types must always
7810 be terminated by NULL_TREE. */
7813 build_function_type_list (tree return_type
, ...)
7818 va_start (p
, return_type
);
7819 args
= build_function_type_list_1 (false, return_type
, p
);
7824 /* Build a variable argument function type. The RETURN_TYPE is the
7825 type returned by the function. If additional arguments are provided,
7826 they are additional argument types. The list of argument types must
7827 always be terminated by NULL_TREE. */
7830 build_varargs_function_type_list (tree return_type
, ...)
7835 va_start (p
, return_type
);
7836 args
= build_function_type_list_1 (true, return_type
, p
);
7842 /* Build a function type. RETURN_TYPE is the type returned by the
7843 function; VAARGS indicates whether the function takes varargs. The
7844 function takes N named arguments, the types of which are provided in
7848 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7852 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7854 for (i
= n
- 1; i
>= 0; i
--)
7855 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7857 return build_function_type (return_type
, t
);
7860 /* Build a function type. RETURN_TYPE is the type returned by the
7861 function. The function takes N named arguments, the types of which
7862 are provided in ARG_TYPES. */
7865 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7867 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7870 /* Build a variable argument function type. RETURN_TYPE is the type
7871 returned by the function. The function takes N named arguments, the
7872 types of which are provided in ARG_TYPES. */
7875 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7877 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7880 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7881 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7882 for the method. An implicit additional parameter (of type
7883 pointer-to-BASETYPE) is added to the ARGTYPES. */
7886 build_method_type_directly (tree basetype
,
7893 bool any_structural_p
, any_noncanonical_p
;
7894 tree canon_argtypes
;
7896 /* Make a node of the sort we want. */
7897 t
= make_node (METHOD_TYPE
);
7899 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7900 TREE_TYPE (t
) = rettype
;
7901 ptype
= build_pointer_type (basetype
);
7903 /* The actual arglist for this function includes a "hidden" argument
7904 which is "this". Put it into the list of argument types. */
7905 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7906 TYPE_ARG_TYPES (t
) = argtypes
;
7908 /* If we already have such a type, use the old one. */
7909 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7910 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7911 hashcode
= type_hash_list (argtypes
, hashcode
);
7912 t
= type_hash_canon (hashcode
, t
);
7914 /* Set up the canonical type. */
7916 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7917 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7919 = (TYPE_CANONICAL (basetype
) != basetype
7920 || TYPE_CANONICAL (rettype
) != rettype
);
7921 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7923 &any_noncanonical_p
);
7924 if (any_structural_p
)
7925 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7926 else if (any_noncanonical_p
)
7928 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7929 TYPE_CANONICAL (rettype
),
7931 if (!COMPLETE_TYPE_P (t
))
7937 /* Construct, lay out and return the type of methods belonging to class
7938 BASETYPE and whose arguments and values are described by TYPE.
7939 If that type exists already, reuse it.
7940 TYPE must be a FUNCTION_TYPE node. */
7943 build_method_type (tree basetype
, tree type
)
7945 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7947 return build_method_type_directly (basetype
,
7949 TYPE_ARG_TYPES (type
));
7952 /* Construct, lay out and return the type of offsets to a value
7953 of type TYPE, within an object of type BASETYPE.
7954 If a suitable offset type exists already, reuse it. */
7957 build_offset_type (tree basetype
, tree type
)
7960 hashval_t hashcode
= 0;
7962 /* Make a node of the sort we want. */
7963 t
= make_node (OFFSET_TYPE
);
7965 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7966 TREE_TYPE (t
) = type
;
7968 /* If we already have such a type, use the old one. */
7969 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7970 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
7971 t
= type_hash_canon (hashcode
, t
);
7973 if (!COMPLETE_TYPE_P (t
))
7976 if (TYPE_CANONICAL (t
) == t
)
7978 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7979 || TYPE_STRUCTURAL_EQUALITY_P (type
))
7980 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7981 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
7982 || TYPE_CANONICAL (type
) != type
)
7984 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
7985 TYPE_CANONICAL (type
));
7991 /* Create a complex type whose components are COMPONENT_TYPE. */
7994 build_complex_type (tree component_type
)
7999 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8000 || SCALAR_FLOAT_TYPE_P (component_type
)
8001 || FIXED_POINT_TYPE_P (component_type
));
8003 /* Make a node of the sort we want. */
8004 t
= make_node (COMPLEX_TYPE
);
8006 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8008 /* If we already have such a type, use the old one. */
8009 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8010 t
= type_hash_canon (hashcode
, t
);
8012 if (!COMPLETE_TYPE_P (t
))
8015 if (TYPE_CANONICAL (t
) == t
)
8017 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8018 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8019 else if (TYPE_CANONICAL (component_type
) != component_type
)
8021 = build_complex_type (TYPE_CANONICAL (component_type
));
8024 /* We need to create a name, since complex is a fundamental type. */
8025 if (! TYPE_NAME (t
))
8028 if (component_type
== char_type_node
)
8029 name
= "complex char";
8030 else if (component_type
== signed_char_type_node
)
8031 name
= "complex signed char";
8032 else if (component_type
== unsigned_char_type_node
)
8033 name
= "complex unsigned char";
8034 else if (component_type
== short_integer_type_node
)
8035 name
= "complex short int";
8036 else if (component_type
== short_unsigned_type_node
)
8037 name
= "complex short unsigned int";
8038 else if (component_type
== integer_type_node
)
8039 name
= "complex int";
8040 else if (component_type
== unsigned_type_node
)
8041 name
= "complex unsigned int";
8042 else if (component_type
== long_integer_type_node
)
8043 name
= "complex long int";
8044 else if (component_type
== long_unsigned_type_node
)
8045 name
= "complex long unsigned int";
8046 else if (component_type
== long_long_integer_type_node
)
8047 name
= "complex long long int";
8048 else if (component_type
== long_long_unsigned_type_node
)
8049 name
= "complex long long unsigned int";
8054 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8055 get_identifier (name
), t
);
8058 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8061 /* If TYPE is a real or complex floating-point type and the target
8062 does not directly support arithmetic on TYPE then return the wider
8063 type to be used for arithmetic on TYPE. Otherwise, return
8067 excess_precision_type (tree type
)
8069 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8071 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8072 switch (TREE_CODE (type
))
8075 switch (flt_eval_method
)
8078 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8079 return double_type_node
;
8082 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8083 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8084 return long_double_type_node
;
8091 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8093 switch (flt_eval_method
)
8096 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8097 return complex_double_type_node
;
8100 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8101 || (TYPE_MODE (TREE_TYPE (type
))
8102 == TYPE_MODE (double_type_node
)))
8103 return complex_long_double_type_node
;
8116 /* Return OP, stripped of any conversions to wider types as much as is safe.
8117 Converting the value back to OP's type makes a value equivalent to OP.
8119 If FOR_TYPE is nonzero, we return a value which, if converted to
8120 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8122 OP must have integer, real or enumeral type. Pointers are not allowed!
8124 There are some cases where the obvious value we could return
8125 would regenerate to OP if converted to OP's type,
8126 but would not extend like OP to wider types.
8127 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8128 For example, if OP is (unsigned short)(signed char)-1,
8129 we avoid returning (signed char)-1 if FOR_TYPE is int,
8130 even though extending that to an unsigned short would regenerate OP,
8131 since the result of extending (signed char)-1 to (int)
8132 is different from (int) OP. */
8135 get_unwidened (tree op
, tree for_type
)
8137 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8138 tree type
= TREE_TYPE (op
);
8140 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8142 = (for_type
!= 0 && for_type
!= type
8143 && final_prec
> TYPE_PRECISION (type
)
8144 && TYPE_UNSIGNED (type
));
8147 while (CONVERT_EXPR_P (op
))
8151 /* TYPE_PRECISION on vector types has different meaning
8152 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8153 so avoid them here. */
8154 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8157 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8158 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8160 /* Truncations are many-one so cannot be removed.
8161 Unless we are later going to truncate down even farther. */
8163 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8166 /* See what's inside this conversion. If we decide to strip it,
8168 op
= TREE_OPERAND (op
, 0);
8170 /* If we have not stripped any zero-extensions (uns is 0),
8171 we can strip any kind of extension.
8172 If we have previously stripped a zero-extension,
8173 only zero-extensions can safely be stripped.
8174 Any extension can be stripped if the bits it would produce
8175 are all going to be discarded later by truncating to FOR_TYPE. */
8179 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8181 /* TYPE_UNSIGNED says whether this is a zero-extension.
8182 Let's avoid computing it if it does not affect WIN
8183 and if UNS will not be needed again. */
8185 || CONVERT_EXPR_P (op
))
8186 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8194 /* If we finally reach a constant see if it fits in for_type and
8195 in that case convert it. */
8197 && TREE_CODE (win
) == INTEGER_CST
8198 && TREE_TYPE (win
) != for_type
8199 && int_fits_type_p (win
, for_type
))
8200 win
= fold_convert (for_type
, win
);
8205 /* Return OP or a simpler expression for a narrower value
8206 which can be sign-extended or zero-extended to give back OP.
8207 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8208 or 0 if the value should be sign-extended. */
8211 get_narrower (tree op
, int *unsignedp_ptr
)
8216 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8218 while (TREE_CODE (op
) == NOP_EXPR
)
8221 = (TYPE_PRECISION (TREE_TYPE (op
))
8222 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8224 /* Truncations are many-one so cannot be removed. */
8228 /* See what's inside this conversion. If we decide to strip it,
8233 op
= TREE_OPERAND (op
, 0);
8234 /* An extension: the outermost one can be stripped,
8235 but remember whether it is zero or sign extension. */
8237 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8238 /* Otherwise, if a sign extension has been stripped,
8239 only sign extensions can now be stripped;
8240 if a zero extension has been stripped, only zero-extensions. */
8241 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8245 else /* bitschange == 0 */
8247 /* A change in nominal type can always be stripped, but we must
8248 preserve the unsignedness. */
8250 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8252 op
= TREE_OPERAND (op
, 0);
8253 /* Keep trying to narrow, but don't assign op to win if it
8254 would turn an integral type into something else. */
8255 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8262 if (TREE_CODE (op
) == COMPONENT_REF
8263 /* Since type_for_size always gives an integer type. */
8264 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8265 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8266 /* Ensure field is laid out already. */
8267 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8268 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8270 unsigned HOST_WIDE_INT innerprec
8271 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8272 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8273 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8274 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8276 /* We can get this structure field in a narrower type that fits it,
8277 but the resulting extension to its nominal type (a fullword type)
8278 must satisfy the same conditions as for other extensions.
8280 Do this only for fields that are aligned (not bit-fields),
8281 because when bit-field insns will be used there is no
8282 advantage in doing this. */
8284 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8285 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8286 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8290 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8291 win
= fold_convert (type
, op
);
8295 *unsignedp_ptr
= uns
;
8299 /* Returns true if integer constant C has a value that is permissible
8300 for type TYPE (an INTEGER_TYPE). */
8303 int_fits_type_p (const_tree c
, const_tree type
)
8305 tree type_low_bound
, type_high_bound
;
8306 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8309 dc
= tree_to_double_int (c
);
8310 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8313 type_low_bound
= TYPE_MIN_VALUE (type
);
8314 type_high_bound
= TYPE_MAX_VALUE (type
);
8316 /* If at least one bound of the type is a constant integer, we can check
8317 ourselves and maybe make a decision. If no such decision is possible, but
8318 this type is a subtype, try checking against that. Otherwise, use
8319 double_int_fits_to_tree_p, which checks against the precision.
8321 Compute the status for each possibly constant bound, and return if we see
8322 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8323 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8324 for "constant known to fit". */
8326 /* Check if c >= type_low_bound. */
8327 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8329 dd
= tree_to_double_int (type_low_bound
);
8330 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8332 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8333 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8335 if (c_neg
&& !t_neg
)
8337 if ((c_neg
|| !t_neg
) && double_int_ucmp (dc
, dd
) < 0)
8340 else if (double_int_cmp (dc
, dd
, unsc
) < 0)
8342 ok_for_low_bound
= true;
8345 ok_for_low_bound
= false;
8347 /* Check if c <= type_high_bound. */
8348 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8350 dd
= tree_to_double_int (type_high_bound
);
8351 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8353 int c_neg
= (!unsc
&& double_int_negative_p (dc
));
8354 int t_neg
= (unsc
&& double_int_negative_p (dd
));
8356 if (t_neg
&& !c_neg
)
8358 if ((t_neg
|| !c_neg
) && double_int_ucmp (dc
, dd
) > 0)
8361 else if (double_int_cmp (dc
, dd
, unsc
) > 0)
8363 ok_for_high_bound
= true;
8366 ok_for_high_bound
= false;
8368 /* If the constant fits both bounds, the result is known. */
8369 if (ok_for_low_bound
&& ok_for_high_bound
)
8372 /* Perform some generic filtering which may allow making a decision
8373 even if the bounds are not constant. First, negative integers
8374 never fit in unsigned types, */
8375 if (TYPE_UNSIGNED (type
) && !unsc
&& double_int_negative_p (dc
))
8378 /* Second, narrower types always fit in wider ones. */
8379 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8382 /* Third, unsigned integers with top bit set never fit signed types. */
8383 if (! TYPE_UNSIGNED (type
) && unsc
)
8385 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8386 if (prec
< HOST_BITS_PER_WIDE_INT
)
8388 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8391 else if (((((unsigned HOST_WIDE_INT
) 1)
8392 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8396 /* If we haven't been able to decide at this point, there nothing more we
8397 can check ourselves here. Look at the base type if we have one and it
8398 has the same precision. */
8399 if (TREE_CODE (type
) == INTEGER_TYPE
8400 && TREE_TYPE (type
) != 0
8401 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8403 type
= TREE_TYPE (type
);
8407 /* Or to double_int_fits_to_tree_p, if nothing else. */
8408 return double_int_fits_to_tree_p (type
, dc
);
8411 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8412 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8413 represented (assuming two's-complement arithmetic) within the bit
8414 precision of the type are returned instead. */
8417 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8419 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8420 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8421 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8422 TYPE_UNSIGNED (type
));
8425 if (TYPE_UNSIGNED (type
))
8426 mpz_set_ui (min
, 0);
8430 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
8431 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
8432 TYPE_PRECISION (type
));
8433 mpz_set_double_int (min
, mn
, false);
8437 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8438 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8439 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8440 TYPE_UNSIGNED (type
));
8443 if (TYPE_UNSIGNED (type
))
8444 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
8447 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
8452 /* Return true if VAR is an automatic variable defined in function FN. */
8455 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8457 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8458 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8459 || TREE_CODE (var
) == PARM_DECL
)
8460 && ! TREE_STATIC (var
))
8461 || TREE_CODE (var
) == LABEL_DECL
8462 || TREE_CODE (var
) == RESULT_DECL
));
8465 /* Subprogram of following function. Called by walk_tree.
8467 Return *TP if it is an automatic variable or parameter of the
8468 function passed in as DATA. */
8471 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8473 tree fn
= (tree
) data
;
8478 else if (DECL_P (*tp
)
8479 && auto_var_in_fn_p (*tp
, fn
))
8485 /* Returns true if T is, contains, or refers to a type with variable
8486 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8487 arguments, but not the return type. If FN is nonzero, only return
8488 true if a modifier of the type or position of FN is a variable or
8489 parameter inside FN.
8491 This concept is more general than that of C99 'variably modified types':
8492 in C99, a struct type is never variably modified because a VLA may not
8493 appear as a structure member. However, in GNU C code like:
8495 struct S { int i[f()]; };
8497 is valid, and other languages may define similar constructs. */
8500 variably_modified_type_p (tree type
, tree fn
)
8504 /* Test if T is either variable (if FN is zero) or an expression containing
8505 a variable in FN. */
8506 #define RETURN_TRUE_IF_VAR(T) \
8507 do { tree _t = (T); \
8508 if (_t != NULL_TREE \
8509 && _t != error_mark_node \
8510 && TREE_CODE (_t) != INTEGER_CST \
8511 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8512 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8513 return true; } while (0)
8515 if (type
== error_mark_node
)
8518 /* If TYPE itself has variable size, it is variably modified. */
8519 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8520 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8522 switch (TREE_CODE (type
))
8525 case REFERENCE_TYPE
:
8527 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8533 /* If TYPE is a function type, it is variably modified if the
8534 return type is variably modified. */
8535 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8541 case FIXED_POINT_TYPE
:
8544 /* Scalar types are variably modified if their end points
8546 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8547 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8552 case QUAL_UNION_TYPE
:
8553 /* We can't see if any of the fields are variably-modified by the
8554 definition we normally use, since that would produce infinite
8555 recursion via pointers. */
8556 /* This is variably modified if some field's type is. */
8557 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8558 if (TREE_CODE (t
) == FIELD_DECL
)
8560 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8561 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8562 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8564 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8565 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8570 /* Do not call ourselves to avoid infinite recursion. This is
8571 variably modified if the element type is. */
8572 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8573 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8580 /* The current language may have other cases to check, but in general,
8581 all other types are not variably modified. */
8582 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8584 #undef RETURN_TRUE_IF_VAR
8587 /* Given a DECL or TYPE, return the scope in which it was declared, or
8588 NULL_TREE if there is no containing scope. */
8591 get_containing_scope (const_tree t
)
8593 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8596 /* Return the innermost context enclosing DECL that is
8597 a FUNCTION_DECL, or zero if none. */
8600 decl_function_context (const_tree decl
)
8604 if (TREE_CODE (decl
) == ERROR_MARK
)
8607 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8608 where we look up the function at runtime. Such functions always take
8609 a first argument of type 'pointer to real context'.
8611 C++ should really be fixed to use DECL_CONTEXT for the real context,
8612 and use something else for the "virtual context". */
8613 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8616 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8618 context
= DECL_CONTEXT (decl
);
8620 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8622 if (TREE_CODE (context
) == BLOCK
)
8623 context
= BLOCK_SUPERCONTEXT (context
);
8625 context
= get_containing_scope (context
);
8631 /* Return the innermost context enclosing DECL that is
8632 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8633 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8636 decl_type_context (const_tree decl
)
8638 tree context
= DECL_CONTEXT (decl
);
8641 switch (TREE_CODE (context
))
8643 case NAMESPACE_DECL
:
8644 case TRANSLATION_UNIT_DECL
:
8649 case QUAL_UNION_TYPE
:
8654 context
= DECL_CONTEXT (context
);
8658 context
= BLOCK_SUPERCONTEXT (context
);
8668 /* CALL is a CALL_EXPR. Return the declaration for the function
8669 called, or NULL_TREE if the called function cannot be
8673 get_callee_fndecl (const_tree call
)
8677 if (call
== error_mark_node
)
8678 return error_mark_node
;
8680 /* It's invalid to call this function with anything but a
8682 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8684 /* The first operand to the CALL is the address of the function
8686 addr
= CALL_EXPR_FN (call
);
8690 /* If this is a readonly function pointer, extract its initial value. */
8691 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8692 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8693 && DECL_INITIAL (addr
))
8694 addr
= DECL_INITIAL (addr
);
8696 /* If the address is just `&f' for some function `f', then we know
8697 that `f' is being called. */
8698 if (TREE_CODE (addr
) == ADDR_EXPR
8699 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8700 return TREE_OPERAND (addr
, 0);
8702 /* We couldn't figure out what was being called. */
8706 /* Print debugging information about tree nodes generated during the compile,
8707 and any language-specific information. */
8710 dump_tree_statistics (void)
8712 #ifdef GATHER_STATISTICS
8714 int total_nodes
, total_bytes
;
8717 fprintf (stderr
, "\n??? tree nodes created\n\n");
8718 #ifdef GATHER_STATISTICS
8719 fprintf (stderr
, "Kind Nodes Bytes\n");
8720 fprintf (stderr
, "---------------------------------------\n");
8721 total_nodes
= total_bytes
= 0;
8722 for (i
= 0; i
< (int) all_kinds
; i
++)
8724 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8725 tree_node_counts
[i
], tree_node_sizes
[i
]);
8726 total_nodes
+= tree_node_counts
[i
];
8727 total_bytes
+= tree_node_sizes
[i
];
8729 fprintf (stderr
, "---------------------------------------\n");
8730 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8731 fprintf (stderr
, "---------------------------------------\n");
8732 fprintf (stderr
, "Code Nodes\n");
8733 fprintf (stderr
, "----------------------------\n");
8734 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8735 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8736 fprintf (stderr
, "----------------------------\n");
8737 ssanames_print_statistics ();
8738 phinodes_print_statistics ();
8740 fprintf (stderr
, "(No per-node statistics)\n");
8742 print_type_hash_statistics ();
8743 print_debug_expr_statistics ();
8744 print_value_expr_statistics ();
8745 lang_hooks
.print_statistics ();
8748 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8750 /* Generate a crc32 of a byte. */
8753 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8757 for (ix
= bits
; ix
--; value
<<= 1)
8761 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8768 /* Generate a crc32 of a 32-bit unsigned. */
8771 crc32_unsigned (unsigned chksum
, unsigned value
)
8773 return crc32_unsigned_bits (chksum
, value
, 32);
8776 /* Generate a crc32 of a byte. */
8779 crc32_byte (unsigned chksum
, char byte
)
8781 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8784 /* Generate a crc32 of a string. */
8787 crc32_string (unsigned chksum
, const char *string
)
8791 chksum
= crc32_byte (chksum
, *string
);
8797 /* P is a string that will be used in a symbol. Mask out any characters
8798 that are not valid in that context. */
8801 clean_symbol_name (char *p
)
8805 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8808 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8815 /* Generate a name for a special-purpose function.
8816 The generated name may need to be unique across the whole link.
8817 Changes to this function may also require corresponding changes to
8818 xstrdup_mask_random.
8819 TYPE is some string to identify the purpose of this function to the
8820 linker or collect2; it must start with an uppercase letter,
8822 I - for constructors
8824 N - for C++ anonymous namespaces
8825 F - for DWARF unwind frame information. */
8828 get_file_function_name (const char *type
)
8834 /* If we already have a name we know to be unique, just use that. */
8835 if (first_global_object_name
)
8836 p
= q
= ASTRDUP (first_global_object_name
);
8837 /* If the target is handling the constructors/destructors, they
8838 will be local to this file and the name is only necessary for
8840 We also assign sub_I and sub_D sufixes to constructors called from
8841 the global static constructors. These are always local. */
8842 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8843 || (strncmp (type
, "sub_", 4) == 0
8844 && (type
[4] == 'I' || type
[4] == 'D')))
8846 const char *file
= main_input_filename
;
8848 file
= input_filename
;
8849 /* Just use the file's basename, because the full pathname
8850 might be quite long. */
8851 p
= q
= ASTRDUP (lbasename (file
));
8855 /* Otherwise, the name must be unique across the entire link.
8856 We don't have anything that we know to be unique to this translation
8857 unit, so use what we do have and throw in some randomness. */
8859 const char *name
= weak_global_object_name
;
8860 const char *file
= main_input_filename
;
8865 file
= input_filename
;
8867 len
= strlen (file
);
8868 q
= (char *) alloca (9 + 17 + len
+ 1);
8869 memcpy (q
, file
, len
+ 1);
8871 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8872 crc32_string (0, name
), get_random_seed (false));
8877 clean_symbol_name (q
);
8878 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8881 /* Set up the name of the file-level functions we may need.
8882 Use a global object (which is already required to be unique over
8883 the program) rather than the file name (which imposes extra
8885 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8887 return get_identifier (buf
);
8890 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8892 /* Complain that the tree code of NODE does not match the expected 0
8893 terminated list of trailing codes. The trailing code list can be
8894 empty, for a more vague error message. FILE, LINE, and FUNCTION
8895 are of the caller. */
8898 tree_check_failed (const_tree node
, const char *file
,
8899 int line
, const char *function
, ...)
8903 unsigned length
= 0;
8906 va_start (args
, function
);
8907 while ((code
= va_arg (args
, int)))
8908 length
+= 4 + strlen (tree_code_name
[code
]);
8913 va_start (args
, function
);
8914 length
+= strlen ("expected ");
8915 buffer
= tmp
= (char *) alloca (length
);
8917 while ((code
= va_arg (args
, int)))
8919 const char *prefix
= length
? " or " : "expected ";
8921 strcpy (tmp
+ length
, prefix
);
8922 length
+= strlen (prefix
);
8923 strcpy (tmp
+ length
, tree_code_name
[code
]);
8924 length
+= strlen (tree_code_name
[code
]);
8929 buffer
= "unexpected node";
8931 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8932 buffer
, tree_code_name
[TREE_CODE (node
)],
8933 function
, trim_filename (file
), line
);
8936 /* Complain that the tree code of NODE does match the expected 0
8937 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8941 tree_not_check_failed (const_tree node
, const char *file
,
8942 int line
, const char *function
, ...)
8946 unsigned length
= 0;
8949 va_start (args
, function
);
8950 while ((code
= va_arg (args
, int)))
8951 length
+= 4 + strlen (tree_code_name
[code
]);
8953 va_start (args
, function
);
8954 buffer
= (char *) alloca (length
);
8956 while ((code
= va_arg (args
, int)))
8960 strcpy (buffer
+ length
, " or ");
8963 strcpy (buffer
+ length
, tree_code_name
[code
]);
8964 length
+= strlen (tree_code_name
[code
]);
8968 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
8969 buffer
, tree_code_name
[TREE_CODE (node
)],
8970 function
, trim_filename (file
), line
);
8973 /* Similar to tree_check_failed, except that we check for a class of tree
8974 code, given in CL. */
8977 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
8978 const char *file
, int line
, const char *function
)
8981 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
8982 TREE_CODE_CLASS_STRING (cl
),
8983 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
8984 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
8987 /* Similar to tree_check_failed, except that instead of specifying a
8988 dozen codes, use the knowledge that they're all sequential. */
8991 tree_range_check_failed (const_tree node
, const char *file
, int line
,
8992 const char *function
, enum tree_code c1
,
8996 unsigned length
= 0;
8999 for (c
= c1
; c
<= c2
; ++c
)
9000 length
+= 4 + strlen (tree_code_name
[c
]);
9002 length
+= strlen ("expected ");
9003 buffer
= (char *) alloca (length
);
9006 for (c
= c1
; c
<= c2
; ++c
)
9008 const char *prefix
= length
? " or " : "expected ";
9010 strcpy (buffer
+ length
, prefix
);
9011 length
+= strlen (prefix
);
9012 strcpy (buffer
+ length
, tree_code_name
[c
]);
9013 length
+= strlen (tree_code_name
[c
]);
9016 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9017 buffer
, tree_code_name
[TREE_CODE (node
)],
9018 function
, trim_filename (file
), line
);
9022 /* Similar to tree_check_failed, except that we check that a tree does
9023 not have the specified code, given in CL. */
9026 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9027 const char *file
, int line
, const char *function
)
9030 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9031 TREE_CODE_CLASS_STRING (cl
),
9032 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9033 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9037 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9040 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9041 const char *function
, enum omp_clause_code code
)
9043 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9044 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9045 function
, trim_filename (file
), line
);
9049 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9052 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9053 const char *function
, enum omp_clause_code c1
,
9054 enum omp_clause_code c2
)
9057 unsigned length
= 0;
9060 for (c
= c1
; c
<= c2
; ++c
)
9061 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9063 length
+= strlen ("expected ");
9064 buffer
= (char *) alloca (length
);
9067 for (c
= c1
; c
<= c2
; ++c
)
9069 const char *prefix
= length
? " or " : "expected ";
9071 strcpy (buffer
+ length
, prefix
);
9072 length
+= strlen (prefix
);
9073 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9074 length
+= strlen (omp_clause_code_name
[c
]);
9077 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9078 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9079 function
, trim_filename (file
), line
);
9083 #undef DEFTREESTRUCT
9084 #define DEFTREESTRUCT(VAL, NAME) NAME,
9086 static const char *ts_enum_names
[] = {
9087 #include "treestruct.def"
9089 #undef DEFTREESTRUCT
9091 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9093 /* Similar to tree_class_check_failed, except that we check for
9094 whether CODE contains the tree structure identified by EN. */
9097 tree_contains_struct_check_failed (const_tree node
,
9098 const enum tree_node_structure_enum en
,
9099 const char *file
, int line
,
9100 const char *function
)
9103 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9105 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9109 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9110 (dynamically sized) vector. */
9113 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9114 const char *function
)
9117 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9118 idx
+ 1, len
, function
, trim_filename (file
), line
);
9121 /* Similar to above, except that the check is for the bounds of the operand
9122 vector of an expression node EXP. */
9125 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9126 int line
, const char *function
)
9128 int code
= TREE_CODE (exp
);
9130 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9131 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9132 function
, trim_filename (file
), line
);
9135 /* Similar to above, except that the check is for the number of
9136 operands of an OMP_CLAUSE node. */
9139 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9140 int line
, const char *function
)
9143 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9144 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9145 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9146 trim_filename (file
), line
);
9148 #endif /* ENABLE_TREE_CHECKING */
9150 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9151 and mapped to the machine mode MODE. Initialize its fields and build
9152 the information necessary for debugging output. */
9155 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9158 hashval_t hashcode
= 0;
9160 t
= make_node (VECTOR_TYPE
);
9161 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9162 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9163 SET_TYPE_MODE (t
, mode
);
9165 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9166 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9167 else if (TYPE_CANONICAL (innertype
) != innertype
9168 || mode
!= VOIDmode
)
9170 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9174 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9175 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9176 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9177 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9178 t
= type_hash_canon (hashcode
, t
);
9180 /* We have built a main variant, based on the main variant of the
9181 inner type. Use it to build the variant we return. */
9182 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9183 && TREE_TYPE (t
) != innertype
)
9184 return build_type_attribute_qual_variant (t
,
9185 TYPE_ATTRIBUTES (innertype
),
9186 TYPE_QUALS (innertype
));
9192 make_or_reuse_type (unsigned size
, int unsignedp
)
9194 if (size
== INT_TYPE_SIZE
)
9195 return unsignedp
? unsigned_type_node
: integer_type_node
;
9196 if (size
== CHAR_TYPE_SIZE
)
9197 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9198 if (size
== SHORT_TYPE_SIZE
)
9199 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9200 if (size
== LONG_TYPE_SIZE
)
9201 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9202 if (size
== LONG_LONG_TYPE_SIZE
)
9203 return (unsignedp
? long_long_unsigned_type_node
9204 : long_long_integer_type_node
);
9205 if (size
== 128 && int128_integer_type_node
)
9206 return (unsignedp
? int128_unsigned_type_node
9207 : int128_integer_type_node
);
9210 return make_unsigned_type (size
);
9212 return make_signed_type (size
);
9215 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9218 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9222 if (size
== SHORT_FRACT_TYPE_SIZE
)
9223 return unsignedp
? sat_unsigned_short_fract_type_node
9224 : sat_short_fract_type_node
;
9225 if (size
== FRACT_TYPE_SIZE
)
9226 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9227 if (size
== LONG_FRACT_TYPE_SIZE
)
9228 return unsignedp
? sat_unsigned_long_fract_type_node
9229 : sat_long_fract_type_node
;
9230 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9231 return unsignedp
? sat_unsigned_long_long_fract_type_node
9232 : sat_long_long_fract_type_node
;
9236 if (size
== SHORT_FRACT_TYPE_SIZE
)
9237 return unsignedp
? unsigned_short_fract_type_node
9238 : short_fract_type_node
;
9239 if (size
== FRACT_TYPE_SIZE
)
9240 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9241 if (size
== LONG_FRACT_TYPE_SIZE
)
9242 return unsignedp
? unsigned_long_fract_type_node
9243 : long_fract_type_node
;
9244 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9245 return unsignedp
? unsigned_long_long_fract_type_node
9246 : long_long_fract_type_node
;
9249 return make_fract_type (size
, unsignedp
, satp
);
9252 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9255 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9259 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9260 return unsignedp
? sat_unsigned_short_accum_type_node
9261 : sat_short_accum_type_node
;
9262 if (size
== ACCUM_TYPE_SIZE
)
9263 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9264 if (size
== LONG_ACCUM_TYPE_SIZE
)
9265 return unsignedp
? sat_unsigned_long_accum_type_node
9266 : sat_long_accum_type_node
;
9267 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9268 return unsignedp
? sat_unsigned_long_long_accum_type_node
9269 : sat_long_long_accum_type_node
;
9273 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9274 return unsignedp
? unsigned_short_accum_type_node
9275 : short_accum_type_node
;
9276 if (size
== ACCUM_TYPE_SIZE
)
9277 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9278 if (size
== LONG_ACCUM_TYPE_SIZE
)
9279 return unsignedp
? unsigned_long_accum_type_node
9280 : long_accum_type_node
;
9281 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9282 return unsignedp
? unsigned_long_long_accum_type_node
9283 : long_long_accum_type_node
;
9286 return make_accum_type (size
, unsignedp
, satp
);
9289 /* Create nodes for all integer types (and error_mark_node) using the sizes
9290 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9291 SHORT_DOUBLE specifies whether double should be of the same precision
9295 build_common_tree_nodes (bool signed_char
, bool short_double
)
9297 error_mark_node
= make_node (ERROR_MARK
);
9298 TREE_TYPE (error_mark_node
) = error_mark_node
;
9300 initialize_sizetypes ();
9302 /* Define both `signed char' and `unsigned char'. */
9303 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9304 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9305 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9306 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9308 /* Define `char', which is like either `signed char' or `unsigned char'
9309 but not the same as either. */
9312 ? make_signed_type (CHAR_TYPE_SIZE
)
9313 : make_unsigned_type (CHAR_TYPE_SIZE
));
9314 TYPE_STRING_FLAG (char_type_node
) = 1;
9316 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9317 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9318 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9319 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9320 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9321 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9322 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9323 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9324 #if HOST_BITS_PER_WIDE_INT >= 64
9325 /* TODO: This isn't correct, but as logic depends at the moment on
9326 host's instead of target's wide-integer.
9327 If there is a target not supporting TImode, but has an 128-bit
9328 integer-scalar register, this target check needs to be adjusted. */
9329 if (targetm
.scalar_mode_supported_p (TImode
))
9331 int128_integer_type_node
= make_signed_type (128);
9332 int128_unsigned_type_node
= make_unsigned_type (128);
9336 /* Define a boolean type. This type only represents boolean values but
9337 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9338 Front ends which want to override this size (i.e. Java) can redefine
9339 boolean_type_node before calling build_common_tree_nodes_2. */
9340 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9341 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9342 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9343 TYPE_PRECISION (boolean_type_node
) = 1;
9345 /* Define what type to use for size_t. */
9346 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9347 size_type_node
= unsigned_type_node
;
9348 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9349 size_type_node
= long_unsigned_type_node
;
9350 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9351 size_type_node
= long_long_unsigned_type_node
;
9352 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9353 size_type_node
= short_unsigned_type_node
;
9357 /* Fill in the rest of the sized types. Reuse existing type nodes
9359 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9360 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9361 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9362 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9363 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9365 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9366 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9367 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9368 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9369 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9371 access_public_node
= get_identifier ("public");
9372 access_protected_node
= get_identifier ("protected");
9373 access_private_node
= get_identifier ("private");
9375 /* Define these next since types below may used them. */
9376 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9377 integer_one_node
= build_int_cst (integer_type_node
, 1);
9378 integer_three_node
= build_int_cst (integer_type_node
, 3);
9379 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9381 size_zero_node
= size_int (0);
9382 size_one_node
= size_int (1);
9383 bitsize_zero_node
= bitsize_int (0);
9384 bitsize_one_node
= bitsize_int (1);
9385 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9387 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9388 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9390 void_type_node
= make_node (VOID_TYPE
);
9391 layout_type (void_type_node
);
9393 /* We are not going to have real types in C with less than byte alignment,
9394 so we might as well not have any types that claim to have it. */
9395 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9396 TYPE_USER_ALIGN (void_type_node
) = 0;
9398 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9399 layout_type (TREE_TYPE (null_pointer_node
));
9401 ptr_type_node
= build_pointer_type (void_type_node
);
9403 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9404 fileptr_type_node
= ptr_type_node
;
9406 float_type_node
= make_node (REAL_TYPE
);
9407 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9408 layout_type (float_type_node
);
9410 double_type_node
= make_node (REAL_TYPE
);
9412 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9414 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9415 layout_type (double_type_node
);
9417 long_double_type_node
= make_node (REAL_TYPE
);
9418 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9419 layout_type (long_double_type_node
);
9421 float_ptr_type_node
= build_pointer_type (float_type_node
);
9422 double_ptr_type_node
= build_pointer_type (double_type_node
);
9423 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9424 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9426 /* Fixed size integer types. */
9427 uint16_type_node
= build_nonstandard_integer_type (16, true);
9428 uint32_type_node
= build_nonstandard_integer_type (32, true);
9429 uint64_type_node
= build_nonstandard_integer_type (64, true);
9431 /* Decimal float types. */
9432 dfloat32_type_node
= make_node (REAL_TYPE
);
9433 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9434 layout_type (dfloat32_type_node
);
9435 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9436 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9438 dfloat64_type_node
= make_node (REAL_TYPE
);
9439 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9440 layout_type (dfloat64_type_node
);
9441 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9442 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9444 dfloat128_type_node
= make_node (REAL_TYPE
);
9445 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9446 layout_type (dfloat128_type_node
);
9447 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9448 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9450 complex_integer_type_node
= build_complex_type (integer_type_node
);
9451 complex_float_type_node
= build_complex_type (float_type_node
);
9452 complex_double_type_node
= build_complex_type (double_type_node
);
9453 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9455 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9456 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9457 sat_ ## KIND ## _type_node = \
9458 make_sat_signed_ ## KIND ## _type (SIZE); \
9459 sat_unsigned_ ## KIND ## _type_node = \
9460 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9461 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9462 unsigned_ ## KIND ## _type_node = \
9463 make_unsigned_ ## KIND ## _type (SIZE);
9465 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9466 sat_ ## WIDTH ## KIND ## _type_node = \
9467 make_sat_signed_ ## KIND ## _type (SIZE); \
9468 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9469 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9470 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9471 unsigned_ ## WIDTH ## KIND ## _type_node = \
9472 make_unsigned_ ## KIND ## _type (SIZE);
9474 /* Make fixed-point type nodes based on four different widths. */
9475 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9476 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9477 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9478 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9479 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9481 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9482 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9483 NAME ## _type_node = \
9484 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9485 u ## NAME ## _type_node = \
9486 make_or_reuse_unsigned_ ## KIND ## _type \
9487 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9488 sat_ ## NAME ## _type_node = \
9489 make_or_reuse_sat_signed_ ## KIND ## _type \
9490 (GET_MODE_BITSIZE (MODE ## mode)); \
9491 sat_u ## NAME ## _type_node = \
9492 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9493 (GET_MODE_BITSIZE (U ## MODE ## mode));
9495 /* Fixed-point type and mode nodes. */
9496 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9497 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9498 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9499 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9500 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9501 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9502 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9503 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9504 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9505 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9506 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9509 tree t
= targetm
.build_builtin_va_list ();
9511 /* Many back-ends define record types without setting TYPE_NAME.
9512 If we copied the record type here, we'd keep the original
9513 record type without a name. This breaks name mangling. So,
9514 don't copy record types and let c_common_nodes_and_builtins()
9515 declare the type to be __builtin_va_list. */
9516 if (TREE_CODE (t
) != RECORD_TYPE
)
9517 t
= build_variant_type_copy (t
);
9519 va_list_type_node
= t
;
9523 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9526 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9527 const char *library_name
, int ecf_flags
)
9531 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9532 library_name
, NULL_TREE
);
9533 if (ecf_flags
& ECF_CONST
)
9534 TREE_READONLY (decl
) = 1;
9535 if (ecf_flags
& ECF_PURE
)
9536 DECL_PURE_P (decl
) = 1;
9537 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
9538 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9539 if (ecf_flags
& ECF_NORETURN
)
9540 TREE_THIS_VOLATILE (decl
) = 1;
9541 if (ecf_flags
& ECF_NOTHROW
)
9542 TREE_NOTHROW (decl
) = 1;
9543 if (ecf_flags
& ECF_MALLOC
)
9544 DECL_IS_MALLOC (decl
) = 1;
9545 if (ecf_flags
& ECF_LEAF
)
9546 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9547 NULL
, DECL_ATTRIBUTES (decl
));
9548 if ((ecf_flags
& ECF_TM_PURE
) && flag_tm
)
9549 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9551 set_builtin_decl (code
, decl
, true);
9554 /* Call this function after instantiating all builtins that the language
9555 front end cares about. This will build the rest of the builtins that
9556 are relied upon by the tree optimizers and the middle-end. */
9559 build_common_builtin_nodes (void)
9564 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9565 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9567 ftype
= build_function_type_list (ptr_type_node
,
9568 ptr_type_node
, const_ptr_type_node
,
9569 size_type_node
, NULL_TREE
);
9571 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9572 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9573 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9574 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9575 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9576 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9579 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9581 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9582 const_ptr_type_node
, size_type_node
,
9584 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9585 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9588 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9590 ftype
= build_function_type_list (ptr_type_node
,
9591 ptr_type_node
, integer_type_node
,
9592 size_type_node
, NULL_TREE
);
9593 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9594 "memset", ECF_NOTHROW
| ECF_LEAF
);
9597 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9599 ftype
= build_function_type_list (ptr_type_node
,
9600 size_type_node
, NULL_TREE
);
9601 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9602 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9605 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9606 size_type_node
, NULL_TREE
);
9607 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9608 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9609 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9611 /* If we're checking the stack, `alloca' can throw. */
9612 if (flag_stack_check
)
9614 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9615 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9618 ftype
= build_function_type_list (void_type_node
,
9619 ptr_type_node
, ptr_type_node
,
9620 ptr_type_node
, NULL_TREE
);
9621 local_define_builtin ("__builtin_init_trampoline", ftype
,
9622 BUILT_IN_INIT_TRAMPOLINE
,
9623 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9624 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9625 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9626 "__builtin_init_heap_trampoline",
9627 ECF_NOTHROW
| ECF_LEAF
);
9629 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9630 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9631 BUILT_IN_ADJUST_TRAMPOLINE
,
9632 "__builtin_adjust_trampoline",
9633 ECF_CONST
| ECF_NOTHROW
);
9635 ftype
= build_function_type_list (void_type_node
,
9636 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9637 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9638 BUILT_IN_NONLOCAL_GOTO
,
9639 "__builtin_nonlocal_goto",
9640 ECF_NORETURN
| ECF_NOTHROW
);
9642 ftype
= build_function_type_list (void_type_node
,
9643 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9644 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9645 BUILT_IN_SETJMP_SETUP
,
9646 "__builtin_setjmp_setup", ECF_NOTHROW
);
9648 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9649 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9650 BUILT_IN_SETJMP_DISPATCHER
,
9651 "__builtin_setjmp_dispatcher",
9652 ECF_PURE
| ECF_NOTHROW
);
9654 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9655 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9656 BUILT_IN_SETJMP_RECEIVER
,
9657 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9659 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9660 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9661 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9663 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9664 local_define_builtin ("__builtin_stack_restore", ftype
,
9665 BUILT_IN_STACK_RESTORE
,
9666 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9668 /* If there's a possibility that we might use the ARM EABI, build the
9669 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9670 if (targetm
.arm_eabi_unwinder
)
9672 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9673 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9674 BUILT_IN_CXA_END_CLEANUP
,
9675 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9678 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9679 local_define_builtin ("__builtin_unwind_resume", ftype
,
9680 BUILT_IN_UNWIND_RESUME
,
9681 ((targetm_common
.except_unwind_info (&global_options
)
9683 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9686 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9688 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9690 local_define_builtin ("__builtin_return_address", ftype
,
9691 BUILT_IN_RETURN_ADDRESS
,
9692 "__builtin_return_address",
9696 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9697 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9699 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9700 ptr_type_node
, NULL_TREE
);
9701 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9702 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9703 BUILT_IN_PROFILE_FUNC_ENTER
,
9704 "__cyg_profile_func_enter", 0);
9705 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9706 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9707 BUILT_IN_PROFILE_FUNC_EXIT
,
9708 "__cyg_profile_func_exit", 0);
9711 /* The exception object and filter values from the runtime. The argument
9712 must be zero before exception lowering, i.e. from the front end. After
9713 exception lowering, it will be the region number for the exception
9714 landing pad. These functions are PURE instead of CONST to prevent
9715 them from being hoisted past the exception edge that will initialize
9716 its value in the landing pad. */
9717 ftype
= build_function_type_list (ptr_type_node
,
9718 integer_type_node
, NULL_TREE
);
9719 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9720 /* Only use TM_PURE if we we have TM language support. */
9721 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9722 ecf_flags
|= ECF_TM_PURE
;
9723 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9724 "__builtin_eh_pointer", ecf_flags
);
9726 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9727 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9728 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9729 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9731 ftype
= build_function_type_list (void_type_node
,
9732 integer_type_node
, integer_type_node
,
9734 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9735 BUILT_IN_EH_COPY_VALUES
,
9736 "__builtin_eh_copy_values", ECF_NOTHROW
);
9738 /* Complex multiplication and division. These are handled as builtins
9739 rather than optabs because emit_library_call_value doesn't support
9740 complex. Further, we can do slightly better with folding these
9741 beasties if the real and complex parts of the arguments are separate. */
9745 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9747 char mode_name_buf
[4], *q
;
9749 enum built_in_function mcode
, dcode
;
9750 tree type
, inner_type
;
9751 const char *prefix
= "__";
9753 if (targetm
.libfunc_gnu_prefix
)
9756 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9759 inner_type
= TREE_TYPE (type
);
9761 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9762 inner_type
, inner_type
, NULL_TREE
);
9764 mcode
= ((enum built_in_function
)
9765 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9766 dcode
= ((enum built_in_function
)
9767 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9769 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9773 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9775 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9776 built_in_names
[mcode
],
9777 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9779 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9781 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9782 built_in_names
[dcode
],
9783 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9788 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9791 If we requested a pointer to a vector, build up the pointers that
9792 we stripped off while looking for the inner type. Similarly for
9793 return values from functions.
9795 The argument TYPE is the top of the chain, and BOTTOM is the
9796 new type which we will point to. */
9799 reconstruct_complex_type (tree type
, tree bottom
)
9803 if (TREE_CODE (type
) == POINTER_TYPE
)
9805 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9806 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9807 TYPE_REF_CAN_ALIAS_ALL (type
));
9809 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9811 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9812 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9813 TYPE_REF_CAN_ALIAS_ALL (type
));
9815 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9817 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9818 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9820 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9822 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9823 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9825 else if (TREE_CODE (type
) == METHOD_TYPE
)
9827 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9828 /* The build_method_type_directly() routine prepends 'this' to argument list,
9829 so we must compensate by getting rid of it. */
9831 = build_method_type_directly
9832 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9834 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9836 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9838 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9839 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9844 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9848 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9851 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9855 switch (GET_MODE_CLASS (mode
))
9857 case MODE_VECTOR_INT
:
9858 case MODE_VECTOR_FLOAT
:
9859 case MODE_VECTOR_FRACT
:
9860 case MODE_VECTOR_UFRACT
:
9861 case MODE_VECTOR_ACCUM
:
9862 case MODE_VECTOR_UACCUM
:
9863 nunits
= GET_MODE_NUNITS (mode
);
9867 /* Check that there are no leftover bits. */
9868 gcc_assert (GET_MODE_BITSIZE (mode
)
9869 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9871 nunits
= GET_MODE_BITSIZE (mode
)
9872 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9879 return make_vector_type (innertype
, nunits
, mode
);
9882 /* Similarly, but takes the inner type and number of units, which must be
9886 build_vector_type (tree innertype
, int nunits
)
9888 return make_vector_type (innertype
, nunits
, VOIDmode
);
9891 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9894 build_opaque_vector_type (tree innertype
, int nunits
)
9896 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9898 /* We always build the non-opaque variant before the opaque one,
9899 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9900 cand
= TYPE_NEXT_VARIANT (t
);
9902 && TYPE_VECTOR_OPAQUE (cand
)
9903 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
9905 /* Othewise build a variant type and make sure to queue it after
9906 the non-opaque type. */
9907 cand
= build_distinct_type_copy (t
);
9908 TYPE_VECTOR_OPAQUE (cand
) = true;
9909 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
9910 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
9911 TYPE_NEXT_VARIANT (t
) = cand
;
9912 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
9917 /* Given an initializer INIT, return TRUE if INIT is zero or some
9918 aggregate of zeros. Otherwise return FALSE. */
9920 initializer_zerop (const_tree init
)
9926 switch (TREE_CODE (init
))
9929 return integer_zerop (init
);
9932 /* ??? Note that this is not correct for C4X float formats. There,
9933 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
9934 negative exponent. */
9935 return real_zerop (init
)
9936 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
9939 return fixed_zerop (init
);
9942 return integer_zerop (init
)
9943 || (real_zerop (init
)
9944 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
9945 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
9950 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
9951 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
9958 unsigned HOST_WIDE_INT idx
;
9960 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
9961 if (!initializer_zerop (elt
))
9970 /* We need to loop through all elements to handle cases like
9971 "\0" and "\0foobar". */
9972 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
9973 if (TREE_STRING_POINTER (init
)[i
] != '\0')
9984 /* Build an empty statement at location LOC. */
9987 build_empty_stmt (location_t loc
)
9989 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
9990 SET_EXPR_LOCATION (t
, loc
);
9995 /* Build an OpenMP clause with code CODE. LOC is the location of the
9999 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10004 length
= omp_clause_num_ops
[code
];
10005 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10007 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10009 t
= ggc_alloc_tree_node (size
);
10010 memset (t
, 0, size
);
10011 TREE_SET_CODE (t
, OMP_CLAUSE
);
10012 OMP_CLAUSE_SET_CODE (t
, code
);
10013 OMP_CLAUSE_LOCATION (t
) = loc
;
10018 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10019 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10020 Except for the CODE and operand count field, other storage for the
10021 object is initialized to zeros. */
10024 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10027 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10029 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10030 gcc_assert (len
>= 1);
10032 record_node_allocation_statistics (code
, length
);
10034 t
= ggc_alloc_zone_cleared_tree_node_stat (&tree_zone
, length PASS_MEM_STAT
);
10036 TREE_SET_CODE (t
, code
);
10038 /* Can't use TREE_OPERAND to store the length because if checking is
10039 enabled, it will try to check the length before we store it. :-P */
10040 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10045 /* Helper function for build_call_* functions; build a CALL_EXPR with
10046 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10047 the argument slots. */
10050 build_call_1 (tree return_type
, tree fn
, int nargs
)
10054 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10055 TREE_TYPE (t
) = return_type
;
10056 CALL_EXPR_FN (t
) = fn
;
10057 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10062 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10063 FN and a null static chain slot. NARGS is the number of call arguments
10064 which are specified as "..." arguments. */
10067 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10071 va_start (args
, nargs
);
10072 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10077 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10078 FN and a null static chain slot. NARGS is the number of call arguments
10079 which are specified as a va_list ARGS. */
10082 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10087 t
= build_call_1 (return_type
, fn
, nargs
);
10088 for (i
= 0; i
< nargs
; i
++)
10089 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10090 process_call_operands (t
);
10094 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10095 FN and a null static chain slot. NARGS is the number of call arguments
10096 which are specified as a tree array ARGS. */
10099 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10100 int nargs
, const tree
*args
)
10105 t
= build_call_1 (return_type
, fn
, nargs
);
10106 for (i
= 0; i
< nargs
; i
++)
10107 CALL_EXPR_ARG (t
, i
) = args
[i
];
10108 process_call_operands (t
);
10109 SET_EXPR_LOCATION (t
, loc
);
10113 /* Like build_call_array, but takes a VEC. */
10116 build_call_vec (tree return_type
, tree fn
, VEC(tree
,gc
) *args
)
10121 ret
= build_call_1 (return_type
, fn
, VEC_length (tree
, args
));
10122 FOR_EACH_VEC_ELT (tree
, args
, ix
, t
)
10123 CALL_EXPR_ARG (ret
, ix
) = t
;
10124 process_call_operands (ret
);
10129 /* Returns true if it is possible to prove that the index of
10130 an array access REF (an ARRAY_REF expression) falls into the
10134 in_array_bounds_p (tree ref
)
10136 tree idx
= TREE_OPERAND (ref
, 1);
10139 if (TREE_CODE (idx
) != INTEGER_CST
)
10142 min
= array_ref_low_bound (ref
);
10143 max
= array_ref_up_bound (ref
);
10146 || TREE_CODE (min
) != INTEGER_CST
10147 || TREE_CODE (max
) != INTEGER_CST
)
10150 if (tree_int_cst_lt (idx
, min
)
10151 || tree_int_cst_lt (max
, idx
))
10157 /* Returns true if it is possible to prove that the range of
10158 an array access REF (an ARRAY_RANGE_REF expression) falls
10159 into the array bounds. */
10162 range_in_array_bounds_p (tree ref
)
10164 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10165 tree range_min
, range_max
, min
, max
;
10167 range_min
= TYPE_MIN_VALUE (domain_type
);
10168 range_max
= TYPE_MAX_VALUE (domain_type
);
10171 || TREE_CODE (range_min
) != INTEGER_CST
10172 || TREE_CODE (range_max
) != INTEGER_CST
)
10175 min
= array_ref_low_bound (ref
);
10176 max
= array_ref_up_bound (ref
);
10179 || TREE_CODE (min
) != INTEGER_CST
10180 || TREE_CODE (max
) != INTEGER_CST
)
10183 if (tree_int_cst_lt (range_min
, min
)
10184 || tree_int_cst_lt (max
, range_max
))
10190 /* Return true if T (assumed to be a DECL) must be assigned a memory
10194 needs_to_live_in_memory (const_tree t
)
10196 if (TREE_CODE (t
) == SSA_NAME
)
10197 t
= SSA_NAME_VAR (t
);
10199 return (TREE_ADDRESSABLE (t
)
10200 || is_global_var (t
)
10201 || (TREE_CODE (t
) == RESULT_DECL
10202 && !DECL_BY_REFERENCE (t
)
10203 && aggregate_value_p (t
, current_function_decl
)));
10206 /* Return value of a constant X and sign-extend it. */
10209 int_cst_value (const_tree x
)
10211 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10212 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10214 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10215 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10216 || TREE_INT_CST_HIGH (x
) == -1);
10218 if (bits
< HOST_BITS_PER_WIDE_INT
)
10220 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10222 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10224 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10230 /* Return value of a constant X and sign-extend it. */
10233 widest_int_cst_value (const_tree x
)
10235 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10236 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10238 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10239 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10240 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10241 << HOST_BITS_PER_WIDE_INT
);
10243 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10244 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10245 || TREE_INT_CST_HIGH (x
) == -1);
10248 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10250 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10252 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10254 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10260 /* If TYPE is an integral or pointer type, return an integer type with
10261 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10262 if TYPE is already an integer type of signedness UNSIGNEDP. */
10265 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10267 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10270 if (!INTEGRAL_TYPE_P (type
)
10271 && !POINTER_TYPE_P (type
))
10274 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10277 /* If TYPE is an integral or pointer type, return an integer type with
10278 the same precision which is unsigned, or itself if TYPE is already an
10279 unsigned integer type. */
10282 unsigned_type_for (tree type
)
10284 return signed_or_unsigned_type_for (1, type
);
10287 /* If TYPE is an integral or pointer type, return an integer type with
10288 the same precision which is signed, or itself if TYPE is already a
10289 signed integer type. */
10292 signed_type_for (tree type
)
10294 return signed_or_unsigned_type_for (0, type
);
10297 /* Returns the largest value obtainable by casting something in INNER type to
10301 upper_bound_in_type (tree outer
, tree inner
)
10304 unsigned int det
= 0;
10305 unsigned oprec
= TYPE_PRECISION (outer
);
10306 unsigned iprec
= TYPE_PRECISION (inner
);
10309 /* Compute a unique number for every combination. */
10310 det
|= (oprec
> iprec
) ? 4 : 0;
10311 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10312 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10314 /* Determine the exponent to use. */
10319 /* oprec <= iprec, outer: signed, inner: don't care. */
10324 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10328 /* oprec > iprec, outer: signed, inner: signed. */
10332 /* oprec > iprec, outer: signed, inner: unsigned. */
10336 /* oprec > iprec, outer: unsigned, inner: signed. */
10340 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10344 gcc_unreachable ();
10347 /* Compute 2^^prec - 1. */
10348 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10351 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10352 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10356 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10357 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10358 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10361 return double_int_to_tree (outer
, high
);
10364 /* Returns the smallest value obtainable by casting something in INNER type to
10368 lower_bound_in_type (tree outer
, tree inner
)
10371 unsigned oprec
= TYPE_PRECISION (outer
);
10372 unsigned iprec
= TYPE_PRECISION (inner
);
10374 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10376 if (TYPE_UNSIGNED (outer
)
10377 /* If we are widening something of an unsigned type, OUTER type
10378 contains all values of INNER type. In particular, both INNER
10379 and OUTER types have zero in common. */
10380 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10381 low
.low
= low
.high
= 0;
10384 /* If we are widening a signed type to another signed type, we
10385 want to obtain -2^^(iprec-1). If we are keeping the
10386 precision or narrowing to a signed type, we want to obtain
10388 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10390 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10392 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10393 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10397 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10398 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10403 return double_int_to_tree (outer
, low
);
10406 /* Return nonzero if two operands that are suitable for PHI nodes are
10407 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10408 SSA_NAME or invariant. Note that this is strictly an optimization.
10409 That is, callers of this function can directly call operand_equal_p
10410 and get the same result, only slower. */
10413 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10417 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10419 return operand_equal_p (arg0
, arg1
, 0);
10422 /* Returns number of zeros at the end of binary representation of X.
10424 ??? Use ffs if available? */
10427 num_ending_zeros (const_tree x
)
10429 unsigned HOST_WIDE_INT fr
, nfr
;
10430 unsigned num
, abits
;
10431 tree type
= TREE_TYPE (x
);
10433 if (TREE_INT_CST_LOW (x
) == 0)
10435 num
= HOST_BITS_PER_WIDE_INT
;
10436 fr
= TREE_INT_CST_HIGH (x
);
10441 fr
= TREE_INT_CST_LOW (x
);
10444 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10447 if (nfr
<< abits
== fr
)
10454 if (num
> TYPE_PRECISION (type
))
10455 num
= TYPE_PRECISION (type
);
10457 return build_int_cst_type (type
, num
);
10461 #define WALK_SUBTREE(NODE) \
10464 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10470 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10471 be walked whenever a type is seen in the tree. Rest of operands and return
10472 value are as for walk_tree. */
10475 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10476 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10478 tree result
= NULL_TREE
;
10480 switch (TREE_CODE (type
))
10483 case REFERENCE_TYPE
:
10484 /* We have to worry about mutually recursive pointers. These can't
10485 be written in C. They can in Ada. It's pathological, but
10486 there's an ACATS test (c38102a) that checks it. Deal with this
10487 by checking if we're pointing to another pointer, that one
10488 points to another pointer, that one does too, and we have no htab.
10489 If so, get a hash table. We check three levels deep to avoid
10490 the cost of the hash table if we don't need one. */
10491 if (POINTER_TYPE_P (TREE_TYPE (type
))
10492 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10493 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10496 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10504 /* ... fall through ... */
10507 WALK_SUBTREE (TREE_TYPE (type
));
10511 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10513 /* Fall through. */
10515 case FUNCTION_TYPE
:
10516 WALK_SUBTREE (TREE_TYPE (type
));
10520 /* We never want to walk into default arguments. */
10521 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10522 WALK_SUBTREE (TREE_VALUE (arg
));
10527 /* Don't follow this nodes's type if a pointer for fear that
10528 we'll have infinite recursion. If we have a PSET, then we
10531 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10532 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10533 WALK_SUBTREE (TREE_TYPE (type
));
10534 WALK_SUBTREE (TYPE_DOMAIN (type
));
10538 WALK_SUBTREE (TREE_TYPE (type
));
10539 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10549 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10550 called with the DATA and the address of each sub-tree. If FUNC returns a
10551 non-NULL value, the traversal is stopped, and the value returned by FUNC
10552 is returned. If PSET is non-NULL it is used to record the nodes visited,
10553 and to avoid visiting a node more than once. */
10556 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10557 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10559 enum tree_code code
;
10563 #define WALK_SUBTREE_TAIL(NODE) \
10567 goto tail_recurse; \
10572 /* Skip empty subtrees. */
10576 /* Don't walk the same tree twice, if the user has requested
10577 that we avoid doing so. */
10578 if (pset
&& pointer_set_insert (pset
, *tp
))
10581 /* Call the function. */
10583 result
= (*func
) (tp
, &walk_subtrees
, data
);
10585 /* If we found something, return it. */
10589 code
= TREE_CODE (*tp
);
10591 /* Even if we didn't, FUNC may have decided that there was nothing
10592 interesting below this point in the tree. */
10593 if (!walk_subtrees
)
10595 /* But we still need to check our siblings. */
10596 if (code
== TREE_LIST
)
10597 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10598 else if (code
== OMP_CLAUSE
)
10599 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10606 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10607 if (result
|| !walk_subtrees
)
10614 case IDENTIFIER_NODE
:
10621 case PLACEHOLDER_EXPR
:
10625 /* None of these have subtrees other than those already walked
10630 WALK_SUBTREE (TREE_VALUE (*tp
));
10631 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10636 int len
= TREE_VEC_LENGTH (*tp
);
10641 /* Walk all elements but the first. */
10643 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10645 /* Now walk the first one as a tail call. */
10646 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10650 WALK_SUBTREE (TREE_REALPART (*tp
));
10651 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10655 unsigned HOST_WIDE_INT idx
;
10656 constructor_elt
*ce
;
10659 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
10661 WALK_SUBTREE (ce
->value
);
10666 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10671 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10673 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10674 into declarations that are just mentioned, rather than
10675 declared; they don't really belong to this part of the tree.
10676 And, we can see cycles: the initializer for a declaration
10677 can refer to the declaration itself. */
10678 WALK_SUBTREE (DECL_INITIAL (decl
));
10679 WALK_SUBTREE (DECL_SIZE (decl
));
10680 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10682 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10685 case STATEMENT_LIST
:
10687 tree_stmt_iterator i
;
10688 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10689 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10694 switch (OMP_CLAUSE_CODE (*tp
))
10696 case OMP_CLAUSE_PRIVATE
:
10697 case OMP_CLAUSE_SHARED
:
10698 case OMP_CLAUSE_FIRSTPRIVATE
:
10699 case OMP_CLAUSE_COPYIN
:
10700 case OMP_CLAUSE_COPYPRIVATE
:
10701 case OMP_CLAUSE_FINAL
:
10702 case OMP_CLAUSE_IF
:
10703 case OMP_CLAUSE_NUM_THREADS
:
10704 case OMP_CLAUSE_SCHEDULE
:
10705 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10708 case OMP_CLAUSE_NOWAIT
:
10709 case OMP_CLAUSE_ORDERED
:
10710 case OMP_CLAUSE_DEFAULT
:
10711 case OMP_CLAUSE_UNTIED
:
10712 case OMP_CLAUSE_MERGEABLE
:
10713 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10715 case OMP_CLAUSE_LASTPRIVATE
:
10716 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10717 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10718 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10720 case OMP_CLAUSE_COLLAPSE
:
10723 for (i
= 0; i
< 3; i
++)
10724 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10725 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10728 case OMP_CLAUSE_REDUCTION
:
10731 for (i
= 0; i
< 4; i
++)
10732 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10733 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10737 gcc_unreachable ();
10745 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10746 But, we only want to walk once. */
10747 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10748 for (i
= 0; i
< len
; ++i
)
10749 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10750 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10754 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10755 defining. We only want to walk into these fields of a type in this
10756 case and not in the general case of a mere reference to the type.
10758 The criterion is as follows: if the field can be an expression, it
10759 must be walked only here. This should be in keeping with the fields
10760 that are directly gimplified in gimplify_type_sizes in order for the
10761 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10762 variable-sized types.
10764 Note that DECLs get walked as part of processing the BIND_EXPR. */
10765 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10767 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10768 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10771 /* Call the function for the type. See if it returns anything or
10772 doesn't want us to continue. If we are to continue, walk both
10773 the normal fields and those for the declaration case. */
10774 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10775 if (result
|| !walk_subtrees
)
10778 /* But do not walk a pointed-to type since it may itself need to
10779 be walked in the declaration case if it isn't anonymous. */
10780 if (!POINTER_TYPE_P (*type_p
))
10782 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10787 /* If this is a record type, also walk the fields. */
10788 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10792 for (field
= TYPE_FIELDS (*type_p
); field
;
10793 field
= DECL_CHAIN (field
))
10795 /* We'd like to look at the type of the field, but we can
10796 easily get infinite recursion. So assume it's pointed
10797 to elsewhere in the tree. Also, ignore things that
10799 if (TREE_CODE (field
) != FIELD_DECL
)
10802 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10803 WALK_SUBTREE (DECL_SIZE (field
));
10804 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10805 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10806 WALK_SUBTREE (DECL_QUALIFIER (field
));
10810 /* Same for scalar types. */
10811 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10812 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10813 || TREE_CODE (*type_p
) == INTEGER_TYPE
10814 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10815 || TREE_CODE (*type_p
) == REAL_TYPE
)
10817 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10818 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10821 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10822 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10827 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10831 /* Walk over all the sub-trees of this operand. */
10832 len
= TREE_OPERAND_LENGTH (*tp
);
10834 /* Go through the subtrees. We need to do this in forward order so
10835 that the scope of a FOR_EXPR is handled properly. */
10838 for (i
= 0; i
< len
- 1; ++i
)
10839 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10840 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10843 /* If this is a type, walk the needed fields in the type. */
10844 else if (TYPE_P (*tp
))
10845 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10849 /* We didn't find what we were looking for. */
10852 #undef WALK_SUBTREE_TAIL
10854 #undef WALK_SUBTREE
10856 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10859 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10863 struct pointer_set_t
*pset
;
10865 pset
= pointer_set_create ();
10866 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10867 pointer_set_destroy (pset
);
10873 tree_block (tree t
)
10875 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10877 if (IS_EXPR_CODE_CLASS (c
))
10878 return &t
->exp
.block
;
10879 gcc_unreachable ();
10883 /* Create a nameless artificial label and put it in the current
10884 function context. The label has a location of LOC. Returns the
10885 newly created label. */
10888 create_artificial_label (location_t loc
)
10890 tree lab
= build_decl (loc
,
10891 LABEL_DECL
, NULL_TREE
, void_type_node
);
10893 DECL_ARTIFICIAL (lab
) = 1;
10894 DECL_IGNORED_P (lab
) = 1;
10895 DECL_CONTEXT (lab
) = current_function_decl
;
10899 /* Given a tree, try to return a useful variable name that we can use
10900 to prefix a temporary that is being assigned the value of the tree.
10901 I.E. given <temp> = &A, return A. */
10906 tree stripped_decl
;
10909 STRIP_NOPS (stripped_decl
);
10910 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
10911 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
10914 switch (TREE_CODE (stripped_decl
))
10917 return get_name (TREE_OPERAND (stripped_decl
, 0));
10924 /* Return true if TYPE has a variable argument list. */
10927 stdarg_p (const_tree fntype
)
10929 function_args_iterator args_iter
;
10930 tree n
= NULL_TREE
, t
;
10935 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
10940 return n
!= NULL_TREE
&& n
!= void_type_node
;
10943 /* Return true if TYPE has a prototype. */
10946 prototype_p (tree fntype
)
10950 gcc_assert (fntype
!= NULL_TREE
);
10952 t
= TYPE_ARG_TYPES (fntype
);
10953 return (t
!= NULL_TREE
);
10956 /* If BLOCK is inlined from an __attribute__((__artificial__))
10957 routine, return pointer to location from where it has been
10960 block_nonartificial_location (tree block
)
10962 location_t
*ret
= NULL
;
10964 while (block
&& TREE_CODE (block
) == BLOCK
10965 && BLOCK_ABSTRACT_ORIGIN (block
))
10967 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
10969 while (TREE_CODE (ao
) == BLOCK
10970 && BLOCK_ABSTRACT_ORIGIN (ao
)
10971 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
10972 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
10974 if (TREE_CODE (ao
) == FUNCTION_DECL
)
10976 /* If AO is an artificial inline, point RET to the
10977 call site locus at which it has been inlined and continue
10978 the loop, in case AO's caller is also an artificial
10980 if (DECL_DECLARED_INLINE_P (ao
)
10981 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
10982 ret
= &BLOCK_SOURCE_LOCATION (block
);
10986 else if (TREE_CODE (ao
) != BLOCK
)
10989 block
= BLOCK_SUPERCONTEXT (block
);
10995 /* If EXP is inlined from an __attribute__((__artificial__))
10996 function, return the location of the original call expression. */
10999 tree_nonartificial_location (tree exp
)
11001 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11006 return EXPR_LOCATION (exp
);
11010 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11013 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11016 cl_option_hash_hash (const void *x
)
11018 const_tree
const t
= (const_tree
) x
;
11022 hashval_t hash
= 0;
11024 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11026 p
= (const char *)TREE_OPTIMIZATION (t
);
11027 len
= sizeof (struct cl_optimization
);
11030 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11032 p
= (const char *)TREE_TARGET_OPTION (t
);
11033 len
= sizeof (struct cl_target_option
);
11037 gcc_unreachable ();
11039 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11041 for (i
= 0; i
< len
; i
++)
11043 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11048 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11049 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11053 cl_option_hash_eq (const void *x
, const void *y
)
11055 const_tree
const xt
= (const_tree
) x
;
11056 const_tree
const yt
= (const_tree
) y
;
11061 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11064 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11066 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11067 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11068 len
= sizeof (struct cl_optimization
);
11071 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11073 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11074 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11075 len
= sizeof (struct cl_target_option
);
11079 gcc_unreachable ();
11081 return (memcmp (xp
, yp
, len
) == 0);
11084 /* Build an OPTIMIZATION_NODE based on the current options. */
11087 build_optimization_node (void)
11092 /* Use the cache of optimization nodes. */
11094 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11097 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11101 /* Insert this one into the hash table. */
11102 t
= cl_optimization_node
;
11105 /* Make a new node for next time round. */
11106 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11112 /* Build a TARGET_OPTION_NODE based on the current options. */
11115 build_target_option_node (void)
11120 /* Use the cache of optimization nodes. */
11122 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11125 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11129 /* Insert this one into the hash table. */
11130 t
= cl_target_option_node
;
11133 /* Make a new node for next time round. */
11134 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11140 /* Determine the "ultimate origin" of a block. The block may be an inlined
11141 instance of an inlined instance of a block which is local to an inline
11142 function, so we have to trace all of the way back through the origin chain
11143 to find out what sort of node actually served as the original seed for the
11147 block_ultimate_origin (const_tree block
)
11149 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11151 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11152 nodes in the function to point to themselves; ignore that if
11153 we're trying to output the abstract instance of this function. */
11154 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11157 if (immediate_origin
== NULL_TREE
)
11162 tree lookahead
= immediate_origin
;
11166 ret_val
= lookahead
;
11167 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11168 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11170 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11172 /* The block's abstract origin chain may not be the *ultimate* origin of
11173 the block. It could lead to a DECL that has an abstract origin set.
11174 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11175 will give us if it has one). Note that DECL's abstract origins are
11176 supposed to be the most distant ancestor (or so decl_ultimate_origin
11177 claims), so we don't need to loop following the DECL origins. */
11178 if (DECL_P (ret_val
))
11179 return DECL_ORIGIN (ret_val
);
11185 /* Return true if T1 and T2 are equivalent lists. */
11188 list_equal_p (const_tree t1
, const_tree t2
)
11190 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11191 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11196 /* Return true iff conversion in EXP generates no instruction. Mark
11197 it inline so that we fully inline into the stripping functions even
11198 though we have two uses of this function. */
11201 tree_nop_conversion (const_tree exp
)
11203 tree outer_type
, inner_type
;
11205 if (!CONVERT_EXPR_P (exp
)
11206 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11208 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11211 outer_type
= TREE_TYPE (exp
);
11212 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11217 /* Use precision rather then machine mode when we can, which gives
11218 the correct answer even for submode (bit-field) types. */
11219 if ((INTEGRAL_TYPE_P (outer_type
)
11220 || POINTER_TYPE_P (outer_type
)
11221 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11222 && (INTEGRAL_TYPE_P (inner_type
)
11223 || POINTER_TYPE_P (inner_type
)
11224 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11225 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11227 /* Otherwise fall back on comparing machine modes (e.g. for
11228 aggregate types, floats). */
11229 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11232 /* Return true iff conversion in EXP generates no instruction. Don't
11233 consider conversions changing the signedness. */
11236 tree_sign_nop_conversion (const_tree exp
)
11238 tree outer_type
, inner_type
;
11240 if (!tree_nop_conversion (exp
))
11243 outer_type
= TREE_TYPE (exp
);
11244 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11246 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11247 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11250 /* Strip conversions from EXP according to tree_nop_conversion and
11251 return the resulting expression. */
11254 tree_strip_nop_conversions (tree exp
)
11256 while (tree_nop_conversion (exp
))
11257 exp
= TREE_OPERAND (exp
, 0);
11261 /* Strip conversions from EXP according to tree_sign_nop_conversion
11262 and return the resulting expression. */
11265 tree_strip_sign_nop_conversions (tree exp
)
11267 while (tree_sign_nop_conversion (exp
))
11268 exp
= TREE_OPERAND (exp
, 0);
11272 /* Avoid any floating point extensions from EXP. */
11274 strip_float_extensions (tree exp
)
11276 tree sub
, expt
, subt
;
11278 /* For floating point constant look up the narrowest type that can hold
11279 it properly and handle it like (type)(narrowest_type)constant.
11280 This way we can optimize for instance a=a*2.0 where "a" is float
11281 but 2.0 is double constant. */
11282 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11284 REAL_VALUE_TYPE orig
;
11287 orig
= TREE_REAL_CST (exp
);
11288 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11289 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11290 type
= float_type_node
;
11291 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11292 > TYPE_PRECISION (double_type_node
)
11293 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11294 type
= double_type_node
;
11296 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11299 if (!CONVERT_EXPR_P (exp
))
11302 sub
= TREE_OPERAND (exp
, 0);
11303 subt
= TREE_TYPE (sub
);
11304 expt
= TREE_TYPE (exp
);
11306 if (!FLOAT_TYPE_P (subt
))
11309 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11312 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11315 return strip_float_extensions (sub
);
11318 /* Strip out all handled components that produce invariant
11322 strip_invariant_refs (const_tree op
)
11324 while (handled_component_p (op
))
11326 switch (TREE_CODE (op
))
11329 case ARRAY_RANGE_REF
:
11330 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11331 || TREE_OPERAND (op
, 2) != NULL_TREE
11332 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11336 case COMPONENT_REF
:
11337 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11343 op
= TREE_OPERAND (op
, 0);
11349 static GTY(()) tree gcc_eh_personality_decl
;
11351 /* Return the GCC personality function decl. */
11354 lhd_gcc_personality (void)
11356 if (!gcc_eh_personality_decl
)
11357 gcc_eh_personality_decl
= build_personality_function ("gcc");
11358 return gcc_eh_personality_decl
;
11361 /* Try to find a base info of BINFO that would have its field decl at offset
11362 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11363 found, return, otherwise return NULL_TREE. */
11366 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11368 tree type
= BINFO_TYPE (binfo
);
11372 HOST_WIDE_INT pos
, size
;
11376 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11381 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11383 if (TREE_CODE (fld
) != FIELD_DECL
)
11386 pos
= int_bit_position (fld
);
11387 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11388 if (pos
<= offset
&& (pos
+ size
) > offset
)
11391 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11394 if (!DECL_ARTIFICIAL (fld
))
11396 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11400 /* Offset 0 indicates the primary base, whose vtable contents are
11401 represented in the binfo for the derived class. */
11402 else if (offset
!= 0)
11404 tree base_binfo
, found_binfo
= NULL_TREE
;
11405 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11406 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11408 found_binfo
= base_binfo
;
11413 binfo
= found_binfo
;
11416 type
= TREE_TYPE (fld
);
11421 /* Returns true if X is a typedef decl. */
11424 is_typedef_decl (tree x
)
11426 return (x
&& TREE_CODE (x
) == TYPE_DECL
11427 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11430 /* Returns true iff TYPE is a type variant created for a typedef. */
11433 typedef_variant_p (tree type
)
11435 return is_typedef_decl (TYPE_NAME (type
));
11438 /* Warn about a use of an identifier which was marked deprecated. */
11440 warn_deprecated_use (tree node
, tree attr
)
11444 if (node
== 0 || !warn_deprecated_decl
)
11450 attr
= DECL_ATTRIBUTES (node
);
11451 else if (TYPE_P (node
))
11453 tree decl
= TYPE_STUB_DECL (node
);
11455 attr
= lookup_attribute ("deprecated",
11456 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11461 attr
= lookup_attribute ("deprecated", attr
);
11464 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11470 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11472 warning (OPT_Wdeprecated_declarations
,
11473 "%qD is deprecated (declared at %s:%d): %s",
11474 node
, xloc
.file
, xloc
.line
, msg
);
11476 warning (OPT_Wdeprecated_declarations
,
11477 "%qD is deprecated (declared at %s:%d)",
11478 node
, xloc
.file
, xloc
.line
);
11480 else if (TYPE_P (node
))
11482 tree what
= NULL_TREE
;
11483 tree decl
= TYPE_STUB_DECL (node
);
11485 if (TYPE_NAME (node
))
11487 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11488 what
= TYPE_NAME (node
);
11489 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11490 && DECL_NAME (TYPE_NAME (node
)))
11491 what
= DECL_NAME (TYPE_NAME (node
));
11496 expanded_location xloc
11497 = expand_location (DECL_SOURCE_LOCATION (decl
));
11501 warning (OPT_Wdeprecated_declarations
,
11502 "%qE is deprecated (declared at %s:%d): %s",
11503 what
, xloc
.file
, xloc
.line
, msg
);
11505 warning (OPT_Wdeprecated_declarations
,
11506 "%qE is deprecated (declared at %s:%d)", what
,
11507 xloc
.file
, xloc
.line
);
11512 warning (OPT_Wdeprecated_declarations
,
11513 "type is deprecated (declared at %s:%d): %s",
11514 xloc
.file
, xloc
.line
, msg
);
11516 warning (OPT_Wdeprecated_declarations
,
11517 "type is deprecated (declared at %s:%d)",
11518 xloc
.file
, xloc
.line
);
11526 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11529 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11534 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11537 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11543 #include "gt-tree.h"