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
4 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"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "fixed-value.h"
55 /* Tree code classes. */
57 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
58 #define END_OF_BASE_TREE_CODES tcc_exceptional,
60 const enum tree_code_class tree_code_type
[] = {
61 #include "all-tree.def"
65 #undef END_OF_BASE_TREE_CODES
67 /* Table indexed by tree code giving number of expression
68 operands beyond the fixed part of the node structure.
69 Not used for types or decls. */
71 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
72 #define END_OF_BASE_TREE_CODES 0,
74 const unsigned char tree_code_length
[] = {
75 #include "all-tree.def"
79 #undef END_OF_BASE_TREE_CODES
81 /* Names of tree components.
82 Used for printing out the tree and error messages. */
83 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
84 #define END_OF_BASE_TREE_CODES "@dummy",
86 const char *const tree_code_name
[] = {
87 #include "all-tree.def"
91 #undef END_OF_BASE_TREE_CODES
93 /* Each tree code class has an associated string representation.
94 These must correspond to the tree_code_class entries. */
96 const char *const tree_code_class_strings
[] =
111 /* obstack.[ch] explicitly declined to prototype this. */
112 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
114 #ifdef GATHER_STATISTICS
115 /* Statistics-gathering stuff. */
117 int tree_node_counts
[(int) all_kinds
];
118 int tree_node_sizes
[(int) all_kinds
];
120 /* Keep in sync with tree.h:enum tree_node_kind. */
121 static const char * const tree_node_kind_names
[] = {
141 #endif /* GATHER_STATISTICS */
143 /* Unique id for next decl created. */
144 static GTY(()) int next_decl_uid
;
145 /* Unique id for next type created. */
146 static GTY(()) int next_type_uid
= 1;
148 /* Since we cannot rehash a type after it is in the table, we have to
149 keep the hash code. */
151 struct type_hash
GTY(())
157 /* Initial size of the hash table (rounded to next prime). */
158 #define TYPE_HASH_INITIAL_SIZE 1000
160 /* Now here is the hash table. When recording a type, it is added to
161 the slot whose index is the hash code. Note that the hash table is
162 used for several kinds of types (function types, array types and
163 array index range types, for now). While all these live in the
164 same table, they are completely independent, and the hash code is
165 computed differently for each of these. */
167 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
168 htab_t type_hash_table
;
170 /* Hash table and temporary node for larger integer const values. */
171 static GTY (()) tree int_cst_node
;
172 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
173 htab_t int_cst_hash_table
;
175 /* Hash table for optimization flags and target option flags. Use the same
176 hash table for both sets of options. Nodes for building the current
177 optimization and target option nodes. The assumption is most of the time
178 the options created will already be in the hash table, so we avoid
179 allocating and freeing up a node repeatably. */
180 static GTY (()) tree cl_optimization_node
;
181 static GTY (()) tree cl_target_option_node
;
182 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
183 htab_t cl_option_hash_table
;
185 /* General tree->tree mapping structure for use in hash tables. */
188 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
189 htab_t debug_expr_for_decl
;
191 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
192 htab_t value_expr_for_decl
;
194 static GTY ((if_marked ("tree_priority_map_marked_p"),
195 param_is (struct tree_priority_map
)))
196 htab_t init_priority_for_decl
;
198 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
199 htab_t restrict_base_for_decl
;
201 static void set_type_quals (tree
, int);
202 static int type_hash_eq (const void *, const void *);
203 static hashval_t
type_hash_hash (const void *);
204 static hashval_t
int_cst_hash_hash (const void *);
205 static int int_cst_hash_eq (const void *, const void *);
206 static hashval_t
cl_option_hash_hash (const void *);
207 static int cl_option_hash_eq (const void *, const void *);
208 static void print_type_hash_statistics (void);
209 static void print_debug_expr_statistics (void);
210 static void print_value_expr_statistics (void);
211 static int type_hash_marked_p (const void *);
212 static unsigned int type_hash_list (const_tree
, hashval_t
);
213 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
215 tree global_trees
[TI_MAX
];
216 tree integer_types
[itk_none
];
218 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
220 /* Number of operands for each OpenMP clause. */
221 unsigned const char omp_clause_num_ops
[] =
223 0, /* OMP_CLAUSE_ERROR */
224 1, /* OMP_CLAUSE_PRIVATE */
225 1, /* OMP_CLAUSE_SHARED */
226 1, /* OMP_CLAUSE_FIRSTPRIVATE */
227 2, /* OMP_CLAUSE_LASTPRIVATE */
228 4, /* OMP_CLAUSE_REDUCTION */
229 1, /* OMP_CLAUSE_COPYIN */
230 1, /* OMP_CLAUSE_COPYPRIVATE */
231 1, /* OMP_CLAUSE_IF */
232 1, /* OMP_CLAUSE_NUM_THREADS */
233 1, /* OMP_CLAUSE_SCHEDULE */
234 0, /* OMP_CLAUSE_NOWAIT */
235 0, /* OMP_CLAUSE_ORDERED */
236 0, /* OMP_CLAUSE_DEFAULT */
237 3, /* OMP_CLAUSE_COLLAPSE */
238 0 /* OMP_CLAUSE_UNTIED */
241 const char * const omp_clause_code_name
[] =
266 /* Initialize the hash table of types. */
267 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
270 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
273 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
275 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
276 tree_priority_map_eq
, 0);
277 restrict_base_for_decl
= htab_create_ggc (256, tree_map_hash
,
280 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
281 int_cst_hash_eq
, NULL
);
283 int_cst_node
= make_node (INTEGER_CST
);
285 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
286 cl_option_hash_eq
, NULL
);
288 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
289 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
291 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
] = 1;
292 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
] = 1;
293 tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
] = 1;
296 tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
] = 1;
297 tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
] = 1;
298 tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
] = 1;
299 tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
] = 1;
300 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
] = 1;
301 tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
] = 1;
302 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
] = 1;
303 tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
] = 1;
304 tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
] = 1;
307 tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
] = 1;
308 tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
] = 1;
309 tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
] = 1;
310 tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
] = 1;
311 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
] = 1;
312 tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
] = 1;
314 tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
] = 1;
315 tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
] = 1;
316 tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
] = 1;
317 tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
] = 1;
318 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
] = 1;
319 tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
] = 1;
320 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
] = 1;
321 tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
] = 1;
322 tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
] = 1;
323 tree_contains_struct
[NAME_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
324 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
325 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_DECL_MINIMAL
] = 1;
327 tree_contains_struct
[NAME_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
328 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
329 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_MEMORY_TAG
] = 1;
331 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_MEMORY_PARTITION_TAG
] = 1;
333 tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
] = 1;
334 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
] = 1;
335 tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
] = 1;
336 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
] = 1;
338 tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
] = 1;
339 tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
] = 1;
340 tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
] = 1;
341 tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
] = 1;
342 tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
] = 1;
343 tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
] = 1;
344 tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
] = 1;
345 tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
] = 1;
346 tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
] = 1;
347 tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
] = 1;
349 lang_hooks
.init_ts ();
353 /* The name of the object as the assembler will see it (but before any
354 translations made by ASM_OUTPUT_LABELREF). Often this is the same
355 as DECL_NAME. It is an IDENTIFIER_NODE. */
357 decl_assembler_name (tree decl
)
359 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
360 lang_hooks
.set_decl_assembler_name (decl
);
361 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
364 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
367 decl_assembler_name_equal (tree decl
, const_tree asmname
)
369 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
370 const char *decl_str
;
371 const char *asmname_str
;
374 if (decl_asmname
== asmname
)
377 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
378 asmname_str
= IDENTIFIER_POINTER (asmname
);
381 /* If the target assembler name was set by the user, things are trickier.
382 We have a leading '*' to begin with. After that, it's arguable what
383 is the correct thing to do with -fleading-underscore. Arguably, we've
384 historically been doing the wrong thing in assemble_alias by always
385 printing the leading underscore. Since we're not changing that, make
386 sure user_label_prefix follows the '*' before matching. */
387 if (decl_str
[0] == '*')
389 size_t ulp_len
= strlen (user_label_prefix
);
395 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
396 decl_str
+= ulp_len
, test
=true;
400 if (asmname_str
[0] == '*')
402 size_t ulp_len
= strlen (user_label_prefix
);
408 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
409 asmname_str
+= ulp_len
, test
=true;
416 return strcmp (decl_str
, asmname_str
) == 0;
419 /* Hash asmnames ignoring the user specified marks. */
422 decl_assembler_name_hash (const_tree asmname
)
424 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
426 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
427 size_t ulp_len
= strlen (user_label_prefix
);
431 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
434 return htab_hash_string (decl_str
);
437 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
440 /* Compute the number of bytes occupied by a tree with code CODE.
441 This function cannot be used for nodes that have variable sizes,
442 including TREE_VEC, STRING_CST, and CALL_EXPR. */
444 tree_code_size (enum tree_code code
)
446 switch (TREE_CODE_CLASS (code
))
448 case tcc_declaration
: /* A decl node */
453 return sizeof (struct tree_field_decl
);
455 return sizeof (struct tree_parm_decl
);
457 return sizeof (struct tree_var_decl
);
459 return sizeof (struct tree_label_decl
);
461 return sizeof (struct tree_result_decl
);
463 return sizeof (struct tree_const_decl
);
465 return sizeof (struct tree_type_decl
);
467 return sizeof (struct tree_function_decl
);
468 case NAME_MEMORY_TAG
:
469 case SYMBOL_MEMORY_TAG
:
470 return sizeof (struct tree_memory_tag
);
471 case MEMORY_PARTITION_TAG
:
472 return sizeof (struct tree_memory_partition_tag
);
474 return sizeof (struct tree_decl_non_common
);
478 case tcc_type
: /* a type node */
479 return sizeof (struct tree_type
);
481 case tcc_reference
: /* a reference */
482 case tcc_expression
: /* an expression */
483 case tcc_statement
: /* an expression with side effects */
484 case tcc_comparison
: /* a comparison expression */
485 case tcc_unary
: /* a unary arithmetic expression */
486 case tcc_binary
: /* a binary arithmetic expression */
487 return (sizeof (struct tree_exp
)
488 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
490 case tcc_constant
: /* a constant */
493 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
494 case REAL_CST
: return sizeof (struct tree_real_cst
);
495 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
496 case COMPLEX_CST
: return sizeof (struct tree_complex
);
497 case VECTOR_CST
: return sizeof (struct tree_vector
);
498 case STRING_CST
: gcc_unreachable ();
500 return lang_hooks
.tree_size (code
);
503 case tcc_exceptional
: /* something random, like an identifier. */
506 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
507 case TREE_LIST
: return sizeof (struct tree_list
);
510 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
513 case OMP_CLAUSE
: gcc_unreachable ();
515 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
517 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
518 case BLOCK
: return sizeof (struct tree_block
);
519 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
520 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
521 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
524 return lang_hooks
.tree_size (code
);
532 /* Compute the number of bytes occupied by NODE. This routine only
533 looks at TREE_CODE, except for those nodes that have variable sizes. */
535 tree_size (const_tree node
)
537 const enum tree_code code
= TREE_CODE (node
);
541 return (offsetof (struct tree_binfo
, base_binfos
)
542 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
545 return (sizeof (struct tree_vec
)
546 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
549 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
552 return (sizeof (struct tree_omp_clause
)
553 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
557 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
558 return (sizeof (struct tree_exp
)
559 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
561 return tree_code_size (code
);
565 /* Return a newly allocated node of code CODE. For decl and type
566 nodes, some other fields are initialized. The rest of the node is
567 initialized to zero. This function cannot be used for TREE_VEC or
568 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
570 Achoo! I got a code in the node. */
573 make_node_stat (enum tree_code code MEM_STAT_DECL
)
576 enum tree_code_class type
= TREE_CODE_CLASS (code
);
577 size_t length
= tree_code_size (code
);
578 #ifdef GATHER_STATISTICS
583 case tcc_declaration
: /* A decl node */
587 case tcc_type
: /* a type node */
591 case tcc_statement
: /* an expression with side effects */
595 case tcc_reference
: /* a reference */
599 case tcc_expression
: /* an expression */
600 case tcc_comparison
: /* a comparison expression */
601 case tcc_unary
: /* a unary arithmetic expression */
602 case tcc_binary
: /* a binary arithmetic expression */
606 case tcc_constant
: /* a constant */
610 case tcc_exceptional
: /* something random, like an identifier. */
613 case IDENTIFIER_NODE
:
626 kind
= ssa_name_kind
;
647 tree_node_counts
[(int) kind
]++;
648 tree_node_sizes
[(int) kind
] += length
;
651 if (code
== IDENTIFIER_NODE
)
652 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
654 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
656 memset (t
, 0, length
);
658 TREE_SET_CODE (t
, code
);
663 TREE_SIDE_EFFECTS (t
) = 1;
666 case tcc_declaration
:
667 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
669 if (code
== FUNCTION_DECL
)
671 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
672 DECL_MODE (t
) = FUNCTION_MODE
;
676 /* We have not yet computed the alias set for this declaration. */
677 DECL_POINTER_ALIAS_SET (t
) = -1;
679 DECL_SOURCE_LOCATION (t
) = input_location
;
680 DECL_UID (t
) = next_decl_uid
++;
685 TYPE_UID (t
) = next_type_uid
++;
686 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
687 TYPE_USER_ALIGN (t
) = 0;
688 TYPE_MAIN_VARIANT (t
) = t
;
689 TYPE_CANONICAL (t
) = t
;
691 /* Default to no attributes for type, but let target change that. */
692 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
693 targetm
.set_default_type_attributes (t
);
695 /* We have not yet computed the alias set for this type. */
696 TYPE_ALIAS_SET (t
) = -1;
700 TREE_CONSTANT (t
) = 1;
709 case PREDECREMENT_EXPR
:
710 case PREINCREMENT_EXPR
:
711 case POSTDECREMENT_EXPR
:
712 case POSTINCREMENT_EXPR
:
713 /* All of these have side-effects, no matter what their
715 TREE_SIDE_EFFECTS (t
) = 1;
724 /* Other classes need no special treatment. */
731 /* Return a new node with the same contents as NODE except that its
732 TREE_CHAIN is zero and it has a fresh uid. */
735 copy_node_stat (tree node MEM_STAT_DECL
)
738 enum tree_code code
= TREE_CODE (node
);
741 gcc_assert (code
!= STATEMENT_LIST
);
743 length
= tree_size (node
);
744 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
745 memcpy (t
, node
, length
);
748 TREE_ASM_WRITTEN (t
) = 0;
749 TREE_VISITED (t
) = 0;
752 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
754 DECL_UID (t
) = next_decl_uid
++;
755 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
756 && DECL_HAS_VALUE_EXPR_P (node
))
758 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
759 DECL_HAS_VALUE_EXPR_P (t
) = 1;
761 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
763 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
764 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
766 if (TREE_CODE (node
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (node
))
768 SET_DECL_RESTRICT_BASE (t
, DECL_GET_RESTRICT_BASE (node
));
769 DECL_BASED_ON_RESTRICT_P (t
) = 1;
772 else if (TREE_CODE_CLASS (code
) == tcc_type
)
774 TYPE_UID (t
) = next_type_uid
++;
775 /* The following is so that the debug code for
776 the copy is different from the original type.
777 The two statements usually duplicate each other
778 (because they clear fields of the same union),
779 but the optimizer should catch that. */
780 TYPE_SYMTAB_POINTER (t
) = 0;
781 TYPE_SYMTAB_ADDRESS (t
) = 0;
783 /* Do not copy the values cache. */
784 if (TYPE_CACHED_VALUES_P(t
))
786 TYPE_CACHED_VALUES_P (t
) = 0;
787 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
794 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
795 For example, this can copy a list made of TREE_LIST nodes. */
798 copy_list (tree list
)
806 head
= prev
= copy_node (list
);
807 next
= TREE_CHAIN (list
);
810 TREE_CHAIN (prev
) = copy_node (next
);
811 prev
= TREE_CHAIN (prev
);
812 next
= TREE_CHAIN (next
);
818 /* Create an INT_CST node with a LOW value sign extended. */
821 build_int_cst (tree type
, HOST_WIDE_INT low
)
823 /* Support legacy code. */
825 type
= integer_type_node
;
827 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
830 /* Create an INT_CST node with a LOW value zero extended. */
833 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
835 return build_int_cst_wide (type
, low
, 0);
838 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
839 if it is negative. This function is similar to build_int_cst, but
840 the extra bits outside of the type precision are cleared. Constants
841 with these extra bits may confuse the fold so that it detects overflows
842 even in cases when they do not occur, and in general should be avoided.
843 We cannot however make this a default behavior of build_int_cst without
844 more intrusive changes, since there are parts of gcc that rely on the extra
845 precision of the integer constants. */
848 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
850 unsigned HOST_WIDE_INT low1
;
855 fit_double_type (low
, low
< 0 ? -1 : 0, &low1
, &hi
, type
);
857 return build_int_cst_wide (type
, low1
, hi
);
860 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
861 and sign extended according to the value range of TYPE. */
864 build_int_cst_wide_type (tree type
,
865 unsigned HOST_WIDE_INT low
, HOST_WIDE_INT high
)
867 fit_double_type (low
, high
, &low
, &high
, type
);
868 return build_int_cst_wide (type
, low
, high
);
871 /* These are the hash table functions for the hash table of INTEGER_CST
872 nodes of a sizetype. */
874 /* Return the hash code code X, an INTEGER_CST. */
877 int_cst_hash_hash (const void *x
)
879 const_tree
const t
= (const_tree
) x
;
881 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
882 ^ htab_hash_pointer (TREE_TYPE (t
)));
885 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
886 is the same as that given by *Y, which is the same. */
889 int_cst_hash_eq (const void *x
, const void *y
)
891 const_tree
const xt
= (const_tree
) x
;
892 const_tree
const yt
= (const_tree
) y
;
894 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
895 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
896 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
899 /* Create an INT_CST node of TYPE and value HI:LOW.
900 The returned node is always shared. For small integers we use a
901 per-type vector cache, for larger ones we use a single hash table. */
904 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
912 switch (TREE_CODE (type
))
916 /* Cache NULL pointer. */
925 /* Cache false or true. */
933 if (TYPE_UNSIGNED (type
))
936 limit
= INTEGER_SHARE_LIMIT
;
937 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
943 limit
= INTEGER_SHARE_LIMIT
+ 1;
944 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
946 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
960 /* Look for it in the type's vector of small shared ints. */
961 if (!TYPE_CACHED_VALUES_P (type
))
963 TYPE_CACHED_VALUES_P (type
) = 1;
964 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
967 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
970 /* Make sure no one is clobbering the shared constant. */
971 gcc_assert (TREE_TYPE (t
) == type
);
972 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
973 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
977 /* Create a new shared int. */
978 t
= make_node (INTEGER_CST
);
980 TREE_INT_CST_LOW (t
) = low
;
981 TREE_INT_CST_HIGH (t
) = hi
;
982 TREE_TYPE (t
) = type
;
984 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
989 /* Use the cache of larger shared ints. */
992 TREE_INT_CST_LOW (int_cst_node
) = low
;
993 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
994 TREE_TYPE (int_cst_node
) = type
;
996 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1000 /* Insert this one into the hash table. */
1003 /* Make a new node for next time round. */
1004 int_cst_node
= make_node (INTEGER_CST
);
1011 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1012 and the rest are zeros. */
1015 build_low_bits_mask (tree type
, unsigned bits
)
1017 unsigned HOST_WIDE_INT low
;
1019 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
1021 gcc_assert (bits
<= TYPE_PRECISION (type
));
1023 if (bits
== TYPE_PRECISION (type
)
1024 && !TYPE_UNSIGNED (type
))
1026 /* Sign extended all-ones mask. */
1030 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
1032 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1037 bits
-= HOST_BITS_PER_WIDE_INT
;
1039 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1042 return build_int_cst_wide (type
, low
, high
);
1045 /* Checks that X is integer constant that can be expressed in (unsigned)
1046 HOST_WIDE_INT without loss of precision. */
1049 cst_and_fits_in_hwi (const_tree x
)
1051 if (TREE_CODE (x
) != INTEGER_CST
)
1054 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1057 return (TREE_INT_CST_HIGH (x
) == 0
1058 || TREE_INT_CST_HIGH (x
) == -1);
1061 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1062 are in a list pointed to by VALS. */
1065 build_vector (tree type
, tree vals
)
1067 tree v
= make_node (VECTOR_CST
);
1071 TREE_VECTOR_CST_ELTS (v
) = vals
;
1072 TREE_TYPE (v
) = type
;
1074 /* Iterate through elements and check for overflow. */
1075 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1077 tree value
= TREE_VALUE (link
);
1079 /* Don't crash if we get an address constant. */
1080 if (!CONSTANT_CLASS_P (value
))
1083 over
|= TREE_OVERFLOW (value
);
1086 TREE_OVERFLOW (v
) = over
;
1090 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1091 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1094 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1096 tree list
= NULL_TREE
;
1097 unsigned HOST_WIDE_INT idx
;
1100 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1101 list
= tree_cons (NULL_TREE
, value
, list
);
1102 return build_vector (type
, nreverse (list
));
1105 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1106 are in the VEC pointed to by VALS. */
1108 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1110 tree c
= make_node (CONSTRUCTOR
);
1111 TREE_TYPE (c
) = type
;
1112 CONSTRUCTOR_ELTS (c
) = vals
;
1116 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1119 build_constructor_single (tree type
, tree index
, tree value
)
1121 VEC(constructor_elt
,gc
) *v
;
1122 constructor_elt
*elt
;
1125 v
= VEC_alloc (constructor_elt
, gc
, 1);
1126 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1130 t
= build_constructor (type
, v
);
1131 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1136 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1137 are in a list pointed to by VALS. */
1139 build_constructor_from_list (tree type
, tree vals
)
1142 VEC(constructor_elt
,gc
) *v
= NULL
;
1143 bool constant_p
= true;
1147 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1148 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1150 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1151 val
= TREE_VALUE (t
);
1152 elt
->index
= TREE_PURPOSE (t
);
1154 if (!TREE_CONSTANT (val
))
1159 t
= build_constructor (type
, v
);
1160 TREE_CONSTANT (t
) = constant_p
;
1164 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1167 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1170 FIXED_VALUE_TYPE
*fp
;
1172 v
= make_node (FIXED_CST
);
1173 fp
= GGC_NEW (FIXED_VALUE_TYPE
);
1174 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1176 TREE_TYPE (v
) = type
;
1177 TREE_FIXED_CST_PTR (v
) = fp
;
1181 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1184 build_real (tree type
, REAL_VALUE_TYPE d
)
1187 REAL_VALUE_TYPE
*dp
;
1190 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1191 Consider doing it via real_convert now. */
1193 v
= make_node (REAL_CST
);
1194 dp
= GGC_NEW (REAL_VALUE_TYPE
);
1195 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1197 TREE_TYPE (v
) = type
;
1198 TREE_REAL_CST_PTR (v
) = dp
;
1199 TREE_OVERFLOW (v
) = overflow
;
1203 /* Return a new REAL_CST node whose type is TYPE
1204 and whose value is the integer value of the INTEGER_CST node I. */
1207 real_value_from_int_cst (const_tree type
, const_tree i
)
1211 /* Clear all bits of the real value type so that we can later do
1212 bitwise comparisons to see if two values are the same. */
1213 memset (&d
, 0, sizeof d
);
1215 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1216 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1217 TYPE_UNSIGNED (TREE_TYPE (i
)));
1221 /* Given a tree representing an integer constant I, return a tree
1222 representing the same value as a floating-point constant of type TYPE. */
1225 build_real_from_int_cst (tree type
, const_tree i
)
1228 int overflow
= TREE_OVERFLOW (i
);
1230 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1232 TREE_OVERFLOW (v
) |= overflow
;
1236 /* Return a newly constructed STRING_CST node whose value is
1237 the LEN characters at STR.
1238 The TREE_TYPE is not initialized. */
1241 build_string (int len
, const char *str
)
1246 /* Do not waste bytes provided by padding of struct tree_string. */
1247 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1249 #ifdef GATHER_STATISTICS
1250 tree_node_counts
[(int) c_kind
]++;
1251 tree_node_sizes
[(int) c_kind
] += length
;
1254 s
= ggc_alloc_tree (length
);
1256 memset (s
, 0, sizeof (struct tree_common
));
1257 TREE_SET_CODE (s
, STRING_CST
);
1258 TREE_CONSTANT (s
) = 1;
1259 TREE_STRING_LENGTH (s
) = len
;
1260 memcpy (s
->string
.str
, str
, len
);
1261 s
->string
.str
[len
] = '\0';
1266 /* Return a newly constructed COMPLEX_CST node whose value is
1267 specified by the real and imaginary parts REAL and IMAG.
1268 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1269 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1272 build_complex (tree type
, tree real
, tree imag
)
1274 tree t
= make_node (COMPLEX_CST
);
1276 TREE_REALPART (t
) = real
;
1277 TREE_IMAGPART (t
) = imag
;
1278 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1279 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1283 /* Return a constant of arithmetic type TYPE which is the
1284 multiplicative identity of the set TYPE. */
1287 build_one_cst (tree type
)
1289 switch (TREE_CODE (type
))
1291 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1292 case POINTER_TYPE
: case REFERENCE_TYPE
:
1294 return build_int_cst (type
, 1);
1297 return build_real (type
, dconst1
);
1299 case FIXED_POINT_TYPE
:
1300 /* We can only generate 1 for accum types. */
1301 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1302 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1309 scalar
= build_one_cst (TREE_TYPE (type
));
1311 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1313 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1314 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1316 return build_vector (type
, cst
);
1320 return build_complex (type
,
1321 build_one_cst (TREE_TYPE (type
)),
1322 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1329 /* Build a BINFO with LEN language slots. */
1332 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1335 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1336 + VEC_embedded_size (tree
, base_binfos
));
1338 #ifdef GATHER_STATISTICS
1339 tree_node_counts
[(int) binfo_kind
]++;
1340 tree_node_sizes
[(int) binfo_kind
] += length
;
1343 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1345 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1347 TREE_SET_CODE (t
, TREE_BINFO
);
1349 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1355 /* Build a newly constructed TREE_VEC node of length LEN. */
1358 make_tree_vec_stat (int len MEM_STAT_DECL
)
1361 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1363 #ifdef GATHER_STATISTICS
1364 tree_node_counts
[(int) vec_kind
]++;
1365 tree_node_sizes
[(int) vec_kind
] += length
;
1368 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1370 memset (t
, 0, length
);
1372 TREE_SET_CODE (t
, TREE_VEC
);
1373 TREE_VEC_LENGTH (t
) = len
;
1378 /* Return 1 if EXPR is the integer constant zero or a complex constant
1382 integer_zerop (const_tree expr
)
1386 return ((TREE_CODE (expr
) == INTEGER_CST
1387 && TREE_INT_CST_LOW (expr
) == 0
1388 && TREE_INT_CST_HIGH (expr
) == 0)
1389 || (TREE_CODE (expr
) == COMPLEX_CST
1390 && integer_zerop (TREE_REALPART (expr
))
1391 && integer_zerop (TREE_IMAGPART (expr
))));
1394 /* Return 1 if EXPR is the integer constant one or the corresponding
1395 complex constant. */
1398 integer_onep (const_tree expr
)
1402 return ((TREE_CODE (expr
) == INTEGER_CST
1403 && TREE_INT_CST_LOW (expr
) == 1
1404 && TREE_INT_CST_HIGH (expr
) == 0)
1405 || (TREE_CODE (expr
) == COMPLEX_CST
1406 && integer_onep (TREE_REALPART (expr
))
1407 && integer_zerop (TREE_IMAGPART (expr
))));
1410 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1411 it contains. Likewise for the corresponding complex constant. */
1414 integer_all_onesp (const_tree expr
)
1421 if (TREE_CODE (expr
) == COMPLEX_CST
1422 && integer_all_onesp (TREE_REALPART (expr
))
1423 && integer_zerop (TREE_IMAGPART (expr
)))
1426 else if (TREE_CODE (expr
) != INTEGER_CST
)
1429 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1430 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1431 && TREE_INT_CST_HIGH (expr
) == -1)
1436 /* Note that using TYPE_PRECISION here is wrong. We care about the
1437 actual bits, not the (arbitrary) range of the type. */
1438 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1439 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1441 HOST_WIDE_INT high_value
;
1444 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1446 /* Can not handle precisions greater than twice the host int size. */
1447 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1448 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1449 /* Shifting by the host word size is undefined according to the ANSI
1450 standard, so we must handle this as a special case. */
1453 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1455 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1456 && TREE_INT_CST_HIGH (expr
) == high_value
);
1459 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1462 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1466 integer_pow2p (const_tree expr
)
1469 HOST_WIDE_INT high
, low
;
1473 if (TREE_CODE (expr
) == COMPLEX_CST
1474 && integer_pow2p (TREE_REALPART (expr
))
1475 && integer_zerop (TREE_IMAGPART (expr
)))
1478 if (TREE_CODE (expr
) != INTEGER_CST
)
1481 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1482 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1483 high
= TREE_INT_CST_HIGH (expr
);
1484 low
= TREE_INT_CST_LOW (expr
);
1486 /* First clear all bits that are beyond the type's precision in case
1487 we've been sign extended. */
1489 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1491 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1492 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1496 if (prec
< HOST_BITS_PER_WIDE_INT
)
1497 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1500 if (high
== 0 && low
== 0)
1503 return ((high
== 0 && (low
& (low
- 1)) == 0)
1504 || (low
== 0 && (high
& (high
- 1)) == 0));
1507 /* Return 1 if EXPR is an integer constant other than zero or a
1508 complex constant other than zero. */
1511 integer_nonzerop (const_tree expr
)
1515 return ((TREE_CODE (expr
) == INTEGER_CST
1516 && (TREE_INT_CST_LOW (expr
) != 0
1517 || TREE_INT_CST_HIGH (expr
) != 0))
1518 || (TREE_CODE (expr
) == COMPLEX_CST
1519 && (integer_nonzerop (TREE_REALPART (expr
))
1520 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1523 /* Return 1 if EXPR is the fixed-point constant zero. */
1526 fixed_zerop (const_tree expr
)
1528 return (TREE_CODE (expr
) == FIXED_CST
1529 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1532 /* Return the power of two represented by a tree node known to be a
1536 tree_log2 (const_tree expr
)
1539 HOST_WIDE_INT high
, low
;
1543 if (TREE_CODE (expr
) == COMPLEX_CST
)
1544 return tree_log2 (TREE_REALPART (expr
));
1546 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1547 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1549 high
= TREE_INT_CST_HIGH (expr
);
1550 low
= TREE_INT_CST_LOW (expr
);
1552 /* First clear all bits that are beyond the type's precision in case
1553 we've been sign extended. */
1555 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1557 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1558 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1562 if (prec
< HOST_BITS_PER_WIDE_INT
)
1563 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1566 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1567 : exact_log2 (low
));
1570 /* Similar, but return the largest integer Y such that 2 ** Y is less
1571 than or equal to EXPR. */
1574 tree_floor_log2 (const_tree expr
)
1577 HOST_WIDE_INT high
, low
;
1581 if (TREE_CODE (expr
) == COMPLEX_CST
)
1582 return tree_log2 (TREE_REALPART (expr
));
1584 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1585 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1587 high
= TREE_INT_CST_HIGH (expr
);
1588 low
= TREE_INT_CST_LOW (expr
);
1590 /* First clear all bits that are beyond the type's precision in case
1591 we've been sign extended. Ignore if type's precision hasn't been set
1592 since what we are doing is setting it. */
1594 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1596 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1597 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1601 if (prec
< HOST_BITS_PER_WIDE_INT
)
1602 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1605 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1606 : floor_log2 (low
));
1609 /* Return 1 if EXPR is the real constant zero. */
1612 real_zerop (const_tree expr
)
1616 return ((TREE_CODE (expr
) == REAL_CST
1617 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1618 || (TREE_CODE (expr
) == COMPLEX_CST
1619 && real_zerop (TREE_REALPART (expr
))
1620 && real_zerop (TREE_IMAGPART (expr
))));
1623 /* Return 1 if EXPR is the real constant one in real or complex form. */
1626 real_onep (const_tree expr
)
1630 return ((TREE_CODE (expr
) == REAL_CST
1631 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1632 || (TREE_CODE (expr
) == COMPLEX_CST
1633 && real_onep (TREE_REALPART (expr
))
1634 && real_zerop (TREE_IMAGPART (expr
))));
1637 /* Return 1 if EXPR is the real constant two. */
1640 real_twop (const_tree expr
)
1644 return ((TREE_CODE (expr
) == REAL_CST
1645 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1646 || (TREE_CODE (expr
) == COMPLEX_CST
1647 && real_twop (TREE_REALPART (expr
))
1648 && real_zerop (TREE_IMAGPART (expr
))));
1651 /* Return 1 if EXPR is the real constant minus one. */
1654 real_minus_onep (const_tree expr
)
1658 return ((TREE_CODE (expr
) == REAL_CST
1659 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1660 || (TREE_CODE (expr
) == COMPLEX_CST
1661 && real_minus_onep (TREE_REALPART (expr
))
1662 && real_zerop (TREE_IMAGPART (expr
))));
1665 /* Nonzero if EXP is a constant or a cast of a constant. */
1668 really_constant_p (const_tree exp
)
1670 /* This is not quite the same as STRIP_NOPS. It does more. */
1671 while (CONVERT_EXPR_P (exp
)
1672 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1673 exp
= TREE_OPERAND (exp
, 0);
1674 return TREE_CONSTANT (exp
);
1677 /* Return first list element whose TREE_VALUE is ELEM.
1678 Return 0 if ELEM is not in LIST. */
1681 value_member (tree elem
, tree list
)
1685 if (elem
== TREE_VALUE (list
))
1687 list
= TREE_CHAIN (list
);
1692 /* Return first list element whose TREE_PURPOSE is ELEM.
1693 Return 0 if ELEM is not in LIST. */
1696 purpose_member (const_tree elem
, tree list
)
1700 if (elem
== TREE_PURPOSE (list
))
1702 list
= TREE_CHAIN (list
);
1707 /* Return nonzero if ELEM is part of the chain CHAIN. */
1710 chain_member (const_tree elem
, const_tree chain
)
1716 chain
= TREE_CHAIN (chain
);
1722 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1723 We expect a null pointer to mark the end of the chain.
1724 This is the Lisp primitive `length'. */
1727 list_length (const_tree t
)
1730 #ifdef ENABLE_TREE_CHECKING
1738 #ifdef ENABLE_TREE_CHECKING
1741 gcc_assert (p
!= q
);
1749 /* Returns the number of FIELD_DECLs in TYPE. */
1752 fields_length (const_tree type
)
1754 tree t
= TYPE_FIELDS (type
);
1757 for (; t
; t
= TREE_CHAIN (t
))
1758 if (TREE_CODE (t
) == FIELD_DECL
)
1764 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1765 by modifying the last node in chain 1 to point to chain 2.
1766 This is the Lisp primitive `nconc'. */
1769 chainon (tree op1
, tree op2
)
1778 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1780 TREE_CHAIN (t1
) = op2
;
1782 #ifdef ENABLE_TREE_CHECKING
1785 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1786 gcc_assert (t2
!= t1
);
1793 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1796 tree_last (tree chain
)
1800 while ((next
= TREE_CHAIN (chain
)))
1805 /* Reverse the order of elements in the chain T,
1806 and return the new head of the chain (old last element). */
1811 tree prev
= 0, decl
, next
;
1812 for (decl
= t
; decl
; decl
= next
)
1814 next
= TREE_CHAIN (decl
);
1815 TREE_CHAIN (decl
) = prev
;
1821 /* Return a newly created TREE_LIST node whose
1822 purpose and value fields are PARM and VALUE. */
1825 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1827 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1828 TREE_PURPOSE (t
) = parm
;
1829 TREE_VALUE (t
) = value
;
1833 /* Return a newly created TREE_LIST node whose
1834 purpose and value fields are PURPOSE and VALUE
1835 and whose TREE_CHAIN is CHAIN. */
1838 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1842 node
= (tree
) ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1844 memset (node
, 0, sizeof (struct tree_common
));
1846 #ifdef GATHER_STATISTICS
1847 tree_node_counts
[(int) x_kind
]++;
1848 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1851 TREE_SET_CODE (node
, TREE_LIST
);
1852 TREE_CHAIN (node
) = chain
;
1853 TREE_PURPOSE (node
) = purpose
;
1854 TREE_VALUE (node
) = value
;
1858 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
1861 ctor_to_list (tree ctor
)
1863 tree list
= NULL_TREE
;
1868 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), ix
, purpose
, val
)
1870 *p
= build_tree_list (purpose
, val
);
1871 p
= &TREE_CHAIN (*p
);
1877 /* Return the size nominally occupied by an object of type TYPE
1878 when it resides in memory. The value is measured in units of bytes,
1879 and its data type is that normally used for type sizes
1880 (which is the first type created by make_signed_type or
1881 make_unsigned_type). */
1884 size_in_bytes (const_tree type
)
1888 if (type
== error_mark_node
)
1889 return integer_zero_node
;
1891 type
= TYPE_MAIN_VARIANT (type
);
1892 t
= TYPE_SIZE_UNIT (type
);
1896 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1897 return size_zero_node
;
1903 /* Return the size of TYPE (in bytes) as a wide integer
1904 or return -1 if the size can vary or is larger than an integer. */
1907 int_size_in_bytes (const_tree type
)
1911 if (type
== error_mark_node
)
1914 type
= TYPE_MAIN_VARIANT (type
);
1915 t
= TYPE_SIZE_UNIT (type
);
1917 || TREE_CODE (t
) != INTEGER_CST
1918 || TREE_INT_CST_HIGH (t
) != 0
1919 /* If the result would appear negative, it's too big to represent. */
1920 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1923 return TREE_INT_CST_LOW (t
);
1926 /* Return the maximum size of TYPE (in bytes) as a wide integer
1927 or return -1 if the size can vary or is larger than an integer. */
1930 max_int_size_in_bytes (const_tree type
)
1932 HOST_WIDE_INT size
= -1;
1935 /* If this is an array type, check for a possible MAX_SIZE attached. */
1937 if (TREE_CODE (type
) == ARRAY_TYPE
)
1939 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
1941 if (size_tree
&& host_integerp (size_tree
, 1))
1942 size
= tree_low_cst (size_tree
, 1);
1945 /* If we still haven't been able to get a size, see if the language
1946 can compute a maximum size. */
1950 size_tree
= lang_hooks
.types
.max_size (type
);
1952 if (size_tree
&& host_integerp (size_tree
, 1))
1953 size
= tree_low_cst (size_tree
, 1);
1959 /* Return the bit position of FIELD, in bits from the start of the record.
1960 This is a tree of type bitsizetype. */
1963 bit_position (const_tree field
)
1965 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1966 DECL_FIELD_BIT_OFFSET (field
));
1969 /* Likewise, but return as an integer. It must be representable in
1970 that way (since it could be a signed value, we don't have the
1971 option of returning -1 like int_size_in_byte can. */
1974 int_bit_position (const_tree field
)
1976 return tree_low_cst (bit_position (field
), 0);
1979 /* Return the byte position of FIELD, in bytes from the start of the record.
1980 This is a tree of type sizetype. */
1983 byte_position (const_tree field
)
1985 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1986 DECL_FIELD_BIT_OFFSET (field
));
1989 /* Likewise, but return as an integer. It must be representable in
1990 that way (since it could be a signed value, we don't have the
1991 option of returning -1 like int_size_in_byte can. */
1994 int_byte_position (const_tree field
)
1996 return tree_low_cst (byte_position (field
), 0);
1999 /* Return the strictest alignment, in bits, that T is known to have. */
2002 expr_align (const_tree t
)
2004 unsigned int align0
, align1
;
2006 switch (TREE_CODE (t
))
2008 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2009 /* If we have conversions, we know that the alignment of the
2010 object must meet each of the alignments of the types. */
2011 align0
= expr_align (TREE_OPERAND (t
, 0));
2012 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2013 return MAX (align0
, align1
);
2015 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2016 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2017 case CLEANUP_POINT_EXPR
:
2018 /* These don't change the alignment of an object. */
2019 return expr_align (TREE_OPERAND (t
, 0));
2022 /* The best we can do is say that the alignment is the least aligned
2024 align0
= expr_align (TREE_OPERAND (t
, 1));
2025 align1
= expr_align (TREE_OPERAND (t
, 2));
2026 return MIN (align0
, align1
);
2028 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2029 meaningfully, it's always 1. */
2030 case LABEL_DECL
: case CONST_DECL
:
2031 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2033 gcc_assert (DECL_ALIGN (t
) != 0);
2034 return DECL_ALIGN (t
);
2040 /* Otherwise take the alignment from that of the type. */
2041 return TYPE_ALIGN (TREE_TYPE (t
));
2044 /* Return, as a tree node, the number of elements for TYPE (which is an
2045 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2048 array_type_nelts (const_tree type
)
2050 tree index_type
, min
, max
;
2052 /* If they did it with unspecified bounds, then we should have already
2053 given an error about it before we got here. */
2054 if (! TYPE_DOMAIN (type
))
2055 return error_mark_node
;
2057 index_type
= TYPE_DOMAIN (type
);
2058 min
= TYPE_MIN_VALUE (index_type
);
2059 max
= TYPE_MAX_VALUE (index_type
);
2061 return (integer_zerop (min
)
2063 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2066 /* If arg is static -- a reference to an object in static storage -- then
2067 return the object. This is not the same as the C meaning of `static'.
2068 If arg isn't static, return NULL. */
2073 switch (TREE_CODE (arg
))
2076 /* Nested functions are static, even though taking their address will
2077 involve a trampoline as we unnest the nested function and create
2078 the trampoline on the tree level. */
2082 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2083 && ! DECL_THREAD_LOCAL_P (arg
)
2084 && ! DECL_DLLIMPORT_P (arg
)
2088 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2092 return TREE_STATIC (arg
) ? arg
: NULL
;
2099 /* If the thing being referenced is not a field, then it is
2100 something language specific. */
2101 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
2102 return (*lang_hooks
.staticp
) (arg
);
2104 /* If we are referencing a bitfield, we can't evaluate an
2105 ADDR_EXPR at compile time and so it isn't a constant. */
2106 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2109 return staticp (TREE_OPERAND (arg
, 0));
2114 case MISALIGNED_INDIRECT_REF
:
2115 case ALIGN_INDIRECT_REF
:
2117 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2120 case ARRAY_RANGE_REF
:
2121 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2122 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2123 return staticp (TREE_OPERAND (arg
, 0));
2128 if ((unsigned int) TREE_CODE (arg
)
2129 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
2130 return lang_hooks
.staticp (arg
);
2139 /* Return whether OP is a DECL whose address is function-invariant. */
2142 decl_address_invariant_p (const_tree op
)
2144 /* The conditions below are slightly less strict than the one in
2147 switch (TREE_CODE (op
))
2156 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2157 && !DECL_DLLIMPORT_P (op
))
2158 || DECL_THREAD_LOCAL_P (op
)
2159 || DECL_CONTEXT (op
) == current_function_decl
2160 || decl_function_context (op
) == current_function_decl
)
2165 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2166 || decl_function_context (op
) == current_function_decl
)
2177 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2180 decl_address_ip_invariant_p (const_tree op
)
2182 /* The conditions below are slightly less strict than the one in
2185 switch (TREE_CODE (op
))
2193 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2194 && !DECL_DLLIMPORT_P (op
))
2195 || DECL_THREAD_LOCAL_P (op
))
2200 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2212 /* Return true if T is function-invariant (internal function, does
2213 not handle arithmetic; that's handled in skip_simple_arithmetic and
2214 tree_invariant_p). */
2216 static bool tree_invariant_p (tree t
);
2219 tree_invariant_p_1 (tree t
)
2223 if (TREE_CONSTANT (t
)
2224 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2227 switch (TREE_CODE (t
))
2233 op
= TREE_OPERAND (t
, 0);
2234 while (handled_component_p (op
))
2236 switch (TREE_CODE (op
))
2239 case ARRAY_RANGE_REF
:
2240 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2241 || TREE_OPERAND (op
, 2) != NULL_TREE
2242 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2247 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2253 op
= TREE_OPERAND (op
, 0);
2256 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2265 /* Return true if T is function-invariant. */
2268 tree_invariant_p (tree t
)
2270 tree inner
= skip_simple_arithmetic (t
);
2271 return tree_invariant_p_1 (inner
);
2274 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2275 Do this to any expression which may be used in more than one place,
2276 but must be evaluated only once.
2278 Normally, expand_expr would reevaluate the expression each time.
2279 Calling save_expr produces something that is evaluated and recorded
2280 the first time expand_expr is called on it. Subsequent calls to
2281 expand_expr just reuse the recorded value.
2283 The call to expand_expr that generates code that actually computes
2284 the value is the first call *at compile time*. Subsequent calls
2285 *at compile time* generate code to use the saved value.
2286 This produces correct result provided that *at run time* control
2287 always flows through the insns made by the first expand_expr
2288 before reaching the other places where the save_expr was evaluated.
2289 You, the caller of save_expr, must make sure this is so.
2291 Constants, and certain read-only nodes, are returned with no
2292 SAVE_EXPR because that is safe. Expressions containing placeholders
2293 are not touched; see tree.def for an explanation of what these
2297 save_expr (tree expr
)
2299 tree t
= fold (expr
);
2302 /* If the tree evaluates to a constant, then we don't want to hide that
2303 fact (i.e. this allows further folding, and direct checks for constants).
2304 However, a read-only object that has side effects cannot be bypassed.
2305 Since it is no problem to reevaluate literals, we just return the
2307 inner
= skip_simple_arithmetic (t
);
2308 if (TREE_CODE (inner
) == ERROR_MARK
)
2311 if (tree_invariant_p_1 (inner
))
2314 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2315 it means that the size or offset of some field of an object depends on
2316 the value within another field.
2318 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2319 and some variable since it would then need to be both evaluated once and
2320 evaluated more than once. Front-ends must assure this case cannot
2321 happen by surrounding any such subexpressions in their own SAVE_EXPR
2322 and forcing evaluation at the proper time. */
2323 if (contains_placeholder_p (inner
))
2326 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2328 /* This expression might be placed ahead of a jump to ensure that the
2329 value was computed on both sides of the jump. So make sure it isn't
2330 eliminated as dead. */
2331 TREE_SIDE_EFFECTS (t
) = 1;
2335 /* Look inside EXPR and into any simple arithmetic operations. Return
2336 the innermost non-arithmetic node. */
2339 skip_simple_arithmetic (tree expr
)
2343 /* We don't care about whether this can be used as an lvalue in this
2345 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2346 expr
= TREE_OPERAND (expr
, 0);
2348 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2349 a constant, it will be more efficient to not make another SAVE_EXPR since
2350 it will allow better simplification and GCSE will be able to merge the
2351 computations if they actually occur. */
2355 if (UNARY_CLASS_P (inner
))
2356 inner
= TREE_OPERAND (inner
, 0);
2357 else if (BINARY_CLASS_P (inner
))
2359 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2360 inner
= TREE_OPERAND (inner
, 0);
2361 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2362 inner
= TREE_OPERAND (inner
, 1);
2373 /* Return which tree structure is used by T. */
2375 enum tree_node_structure_enum
2376 tree_node_structure (const_tree t
)
2378 const enum tree_code code
= TREE_CODE (t
);
2380 switch (TREE_CODE_CLASS (code
))
2382 case tcc_declaration
:
2387 return TS_FIELD_DECL
;
2389 return TS_PARM_DECL
;
2393 return TS_LABEL_DECL
;
2395 return TS_RESULT_DECL
;
2397 return TS_CONST_DECL
;
2399 return TS_TYPE_DECL
;
2401 return TS_FUNCTION_DECL
;
2402 case SYMBOL_MEMORY_TAG
:
2403 case NAME_MEMORY_TAG
:
2404 case MEMORY_PARTITION_TAG
:
2405 return TS_MEMORY_TAG
;
2407 return TS_DECL_NON_COMMON
;
2413 case tcc_comparison
:
2416 case tcc_expression
:
2420 default: /* tcc_constant and tcc_exceptional */
2425 /* tcc_constant cases. */
2426 case INTEGER_CST
: return TS_INT_CST
;
2427 case REAL_CST
: return TS_REAL_CST
;
2428 case FIXED_CST
: return TS_FIXED_CST
;
2429 case COMPLEX_CST
: return TS_COMPLEX
;
2430 case VECTOR_CST
: return TS_VECTOR
;
2431 case STRING_CST
: return TS_STRING
;
2432 /* tcc_exceptional cases. */
2433 case ERROR_MARK
: return TS_COMMON
;
2434 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
2435 case TREE_LIST
: return TS_LIST
;
2436 case TREE_VEC
: return TS_VEC
;
2437 case SSA_NAME
: return TS_SSA_NAME
;
2438 case PLACEHOLDER_EXPR
: return TS_COMMON
;
2439 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
2440 case BLOCK
: return TS_BLOCK
;
2441 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
2442 case TREE_BINFO
: return TS_BINFO
;
2443 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
2444 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
2445 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
2452 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2453 or offset that depends on a field within a record. */
2456 contains_placeholder_p (const_tree exp
)
2458 enum tree_code code
;
2463 code
= TREE_CODE (exp
);
2464 if (code
== PLACEHOLDER_EXPR
)
2467 switch (TREE_CODE_CLASS (code
))
2470 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2471 position computations since they will be converted into a
2472 WITH_RECORD_EXPR involving the reference, which will assume
2473 here will be valid. */
2474 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2476 case tcc_exceptional
:
2477 if (code
== TREE_LIST
)
2478 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2479 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2484 case tcc_comparison
:
2485 case tcc_expression
:
2489 /* Ignoring the first operand isn't quite right, but works best. */
2490 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2493 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2494 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2495 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2498 /* The save_expr function never wraps anything containing
2499 a PLACEHOLDER_EXPR. */
2506 switch (TREE_CODE_LENGTH (code
))
2509 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2511 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2512 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2523 const_call_expr_arg_iterator iter
;
2524 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2525 if (CONTAINS_PLACEHOLDER_P (arg
))
2539 /* Return true if any part of the computation of TYPE involves a
2540 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2541 (for QUAL_UNION_TYPE) and field positions. */
2544 type_contains_placeholder_1 (const_tree type
)
2546 /* If the size contains a placeholder or the parent type (component type in
2547 the case of arrays) type involves a placeholder, this type does. */
2548 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2549 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2550 || (TREE_TYPE (type
) != 0
2551 && type_contains_placeholder_p (TREE_TYPE (type
))))
2554 /* Now do type-specific checks. Note that the last part of the check above
2555 greatly limits what we have to do below. */
2556 switch (TREE_CODE (type
))
2564 case REFERENCE_TYPE
:
2572 case FIXED_POINT_TYPE
:
2573 /* Here we just check the bounds. */
2574 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2575 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2578 /* We're already checked the component type (TREE_TYPE), so just check
2580 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2584 case QUAL_UNION_TYPE
:
2588 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2589 if (TREE_CODE (field
) == FIELD_DECL
2590 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2591 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2592 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2593 || type_contains_placeholder_p (TREE_TYPE (field
))))
2605 type_contains_placeholder_p (tree type
)
2609 /* If the contains_placeholder_bits field has been initialized,
2610 then we know the answer. */
2611 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2612 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2614 /* Indicate that we've seen this type node, and the answer is false.
2615 This is what we want to return if we run into recursion via fields. */
2616 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2618 /* Compute the real value. */
2619 result
= type_contains_placeholder_1 (type
);
2621 /* Store the real value. */
2622 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2627 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2628 return a tree with all occurrences of references to F in a
2629 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2630 contains only arithmetic expressions or a CALL_EXPR with a
2631 PLACEHOLDER_EXPR occurring only in its arglist. */
2634 substitute_in_expr (tree exp
, tree f
, tree r
)
2636 enum tree_code code
= TREE_CODE (exp
);
2637 tree op0
, op1
, op2
, op3
;
2638 tree new_tree
, inner
;
2640 /* We handle TREE_LIST and COMPONENT_REF separately. */
2641 if (code
== TREE_LIST
)
2643 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2644 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2645 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2648 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2650 else if (code
== COMPONENT_REF
)
2652 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2653 and it is the right field, replace it with R. */
2654 for (inner
= TREE_OPERAND (exp
, 0);
2655 REFERENCE_CLASS_P (inner
);
2656 inner
= TREE_OPERAND (inner
, 0))
2658 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2659 && TREE_OPERAND (exp
, 1) == f
)
2662 /* If this expression hasn't been completed let, leave it alone. */
2663 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2666 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2667 if (op0
== TREE_OPERAND (exp
, 0))
2670 new_tree
= fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2671 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
);
2674 switch (TREE_CODE_CLASS (code
))
2677 case tcc_declaration
:
2680 case tcc_exceptional
:
2683 case tcc_comparison
:
2684 case tcc_expression
:
2686 switch (TREE_CODE_LENGTH (code
))
2692 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2693 if (op0
== TREE_OPERAND (exp
, 0))
2696 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
2700 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2701 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2703 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2706 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2710 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2711 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2712 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2714 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2715 && op2
== TREE_OPERAND (exp
, 2))
2718 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2722 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2723 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2724 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2725 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
2727 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2728 && op2
== TREE_OPERAND (exp
, 2)
2729 && op3
== TREE_OPERAND (exp
, 3))
2732 new_tree
= fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2742 tree copy
= NULL_TREE
;
2745 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2747 tree op
= TREE_OPERAND (exp
, i
);
2748 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
2752 copy
= copy_node (exp
);
2753 TREE_OPERAND (copy
, i
) = new_op
;
2758 new_tree
= fold (copy
);
2768 TREE_READONLY (new_tree
) = TREE_READONLY (exp
);
2772 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2773 for it within OBJ, a tree that is an object or a chain of references. */
2776 substitute_placeholder_in_expr (tree exp
, tree obj
)
2778 enum tree_code code
= TREE_CODE (exp
);
2779 tree op0
, op1
, op2
, op3
;
2781 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2782 in the chain of OBJ. */
2783 if (code
== PLACEHOLDER_EXPR
)
2785 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2788 for (elt
= obj
; elt
!= 0;
2789 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2790 || TREE_CODE (elt
) == COND_EXPR
)
2791 ? TREE_OPERAND (elt
, 1)
2792 : (REFERENCE_CLASS_P (elt
)
2793 || UNARY_CLASS_P (elt
)
2794 || BINARY_CLASS_P (elt
)
2795 || VL_EXP_CLASS_P (elt
)
2796 || EXPRESSION_CLASS_P (elt
))
2797 ? TREE_OPERAND (elt
, 0) : 0))
2798 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2801 for (elt
= obj
; elt
!= 0;
2802 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2803 || TREE_CODE (elt
) == COND_EXPR
)
2804 ? TREE_OPERAND (elt
, 1)
2805 : (REFERENCE_CLASS_P (elt
)
2806 || UNARY_CLASS_P (elt
)
2807 || BINARY_CLASS_P (elt
)
2808 || VL_EXP_CLASS_P (elt
)
2809 || EXPRESSION_CLASS_P (elt
))
2810 ? TREE_OPERAND (elt
, 0) : 0))
2811 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2812 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2814 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
2816 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2817 survives until RTL generation, there will be an error. */
2821 /* TREE_LIST is special because we need to look at TREE_VALUE
2822 and TREE_CHAIN, not TREE_OPERANDS. */
2823 else if (code
== TREE_LIST
)
2825 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2826 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2827 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2830 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2833 switch (TREE_CODE_CLASS (code
))
2836 case tcc_declaration
:
2839 case tcc_exceptional
:
2842 case tcc_comparison
:
2843 case tcc_expression
:
2846 switch (TREE_CODE_LENGTH (code
))
2852 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2853 if (op0
== TREE_OPERAND (exp
, 0))
2856 return fold_build1 (code
, TREE_TYPE (exp
), op0
);
2859 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2860 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2862 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2865 return fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2868 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2869 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2870 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2872 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2873 && op2
== TREE_OPERAND (exp
, 2))
2876 return fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2879 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2880 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2881 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2882 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2884 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2885 && op2
== TREE_OPERAND (exp
, 2)
2886 && op3
== TREE_OPERAND (exp
, 3))
2889 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2898 tree copy
= NULL_TREE
;
2901 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2903 tree op
= TREE_OPERAND (exp
, i
);
2904 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
2908 copy
= copy_node (exp
);
2909 TREE_OPERAND (copy
, i
) = new_op
;
2924 /* Stabilize a reference so that we can use it any number of times
2925 without causing its operands to be evaluated more than once.
2926 Returns the stabilized reference. This works by means of save_expr,
2927 so see the caveats in the comments about save_expr.
2929 Also allows conversion expressions whose operands are references.
2930 Any other kind of expression is returned unchanged. */
2933 stabilize_reference (tree ref
)
2936 enum tree_code code
= TREE_CODE (ref
);
2943 /* No action is needed in this case. */
2948 case FIX_TRUNC_EXPR
:
2949 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2953 result
= build_nt (INDIRECT_REF
,
2954 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2958 result
= build_nt (COMPONENT_REF
,
2959 stabilize_reference (TREE_OPERAND (ref
, 0)),
2960 TREE_OPERAND (ref
, 1), NULL_TREE
);
2964 result
= build_nt (BIT_FIELD_REF
,
2965 stabilize_reference (TREE_OPERAND (ref
, 0)),
2966 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2967 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2971 result
= build_nt (ARRAY_REF
,
2972 stabilize_reference (TREE_OPERAND (ref
, 0)),
2973 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2974 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2977 case ARRAY_RANGE_REF
:
2978 result
= build_nt (ARRAY_RANGE_REF
,
2979 stabilize_reference (TREE_OPERAND (ref
, 0)),
2980 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2981 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2985 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2986 it wouldn't be ignored. This matters when dealing with
2988 return stabilize_reference_1 (ref
);
2990 /* If arg isn't a kind of lvalue we recognize, make no change.
2991 Caller should recognize the error for an invalid lvalue. */
2996 return error_mark_node
;
2999 TREE_TYPE (result
) = TREE_TYPE (ref
);
3000 TREE_READONLY (result
) = TREE_READONLY (ref
);
3001 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3002 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3007 /* Subroutine of stabilize_reference; this is called for subtrees of
3008 references. Any expression with side-effects must be put in a SAVE_EXPR
3009 to ensure that it is only evaluated once.
3011 We don't put SAVE_EXPR nodes around everything, because assigning very
3012 simple expressions to temporaries causes us to miss good opportunities
3013 for optimizations. Among other things, the opportunity to fold in the
3014 addition of a constant into an addressing mode often gets lost, e.g.
3015 "y[i+1] += x;". In general, we take the approach that we should not make
3016 an assignment unless we are forced into it - i.e., that any non-side effect
3017 operator should be allowed, and that cse should take care of coalescing
3018 multiple utterances of the same expression should that prove fruitful. */
3021 stabilize_reference_1 (tree e
)
3024 enum tree_code code
= TREE_CODE (e
);
3026 /* We cannot ignore const expressions because it might be a reference
3027 to a const array but whose index contains side-effects. But we can
3028 ignore things that are actual constant or that already have been
3029 handled by this function. */
3031 if (tree_invariant_p (e
))
3034 switch (TREE_CODE_CLASS (code
))
3036 case tcc_exceptional
:
3038 case tcc_declaration
:
3039 case tcc_comparison
:
3041 case tcc_expression
:
3044 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3045 so that it will only be evaluated once. */
3046 /* The reference (r) and comparison (<) classes could be handled as
3047 below, but it is generally faster to only evaluate them once. */
3048 if (TREE_SIDE_EFFECTS (e
))
3049 return save_expr (e
);
3053 /* Constants need no processing. In fact, we should never reach
3058 /* Division is slow and tends to be compiled with jumps,
3059 especially the division by powers of 2 that is often
3060 found inside of an array reference. So do it just once. */
3061 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3062 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3063 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3064 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3065 return save_expr (e
);
3066 /* Recursively stabilize each operand. */
3067 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3068 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3072 /* Recursively stabilize each operand. */
3073 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3080 TREE_TYPE (result
) = TREE_TYPE (e
);
3081 TREE_READONLY (result
) = TREE_READONLY (e
);
3082 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3083 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3088 /* Low-level constructors for expressions. */
3090 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3091 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3094 recompute_tree_invariant_for_addr_expr (tree t
)
3097 bool tc
= true, se
= false;
3099 /* We started out assuming this address is both invariant and constant, but
3100 does not have side effects. Now go down any handled components and see if
3101 any of them involve offsets that are either non-constant or non-invariant.
3102 Also check for side-effects.
3104 ??? Note that this code makes no attempt to deal with the case where
3105 taking the address of something causes a copy due to misalignment. */
3107 #define UPDATE_FLAGS(NODE) \
3108 do { tree _node = (NODE); \
3109 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3110 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3112 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3113 node
= TREE_OPERAND (node
, 0))
3115 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3116 array reference (probably made temporarily by the G++ front end),
3117 so ignore all the operands. */
3118 if ((TREE_CODE (node
) == ARRAY_REF
3119 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3120 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3122 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3123 if (TREE_OPERAND (node
, 2))
3124 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3125 if (TREE_OPERAND (node
, 3))
3126 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3128 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3129 FIELD_DECL, apparently. The G++ front end can put something else
3130 there, at least temporarily. */
3131 else if (TREE_CODE (node
) == COMPONENT_REF
3132 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3134 if (TREE_OPERAND (node
, 2))
3135 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3137 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3138 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3141 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3143 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3144 the address, since &(*a)->b is a form of addition. If it's a constant, the
3145 address is constant too. If it's a decl, its address is constant if the
3146 decl is static. Everything else is not constant and, furthermore,
3147 taking the address of a volatile variable is not volatile. */
3148 if (TREE_CODE (node
) == INDIRECT_REF
)
3149 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3150 else if (CONSTANT_CLASS_P (node
))
3152 else if (DECL_P (node
))
3153 tc
&= (staticp (node
) != NULL_TREE
);
3157 se
|= TREE_SIDE_EFFECTS (node
);
3161 TREE_CONSTANT (t
) = tc
;
3162 TREE_SIDE_EFFECTS (t
) = se
;
3166 /* Build an expression of code CODE, data type TYPE, and operands as
3167 specified. Expressions and reference nodes can be created this way.
3168 Constants, decls, types and misc nodes cannot be.
3170 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3171 enough for all extant tree codes. */
3174 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3178 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3180 t
= make_node_stat (code PASS_MEM_STAT
);
3187 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3189 int length
= sizeof (struct tree_exp
);
3190 #ifdef GATHER_STATISTICS
3191 tree_node_kind kind
;
3195 #ifdef GATHER_STATISTICS
3196 switch (TREE_CODE_CLASS (code
))
3198 case tcc_statement
: /* an expression with side effects */
3201 case tcc_reference
: /* a reference */
3209 tree_node_counts
[(int) kind
]++;
3210 tree_node_sizes
[(int) kind
] += length
;
3213 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3215 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
3217 memset (t
, 0, sizeof (struct tree_common
));
3219 TREE_SET_CODE (t
, code
);
3221 TREE_TYPE (t
) = type
;
3222 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3223 TREE_OPERAND (t
, 0) = node
;
3224 TREE_BLOCK (t
) = NULL_TREE
;
3225 if (node
&& !TYPE_P (node
))
3227 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3228 TREE_READONLY (t
) = TREE_READONLY (node
);
3231 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3232 TREE_SIDE_EFFECTS (t
) = 1;
3236 /* All of these have side-effects, no matter what their
3238 TREE_SIDE_EFFECTS (t
) = 1;
3239 TREE_READONLY (t
) = 0;
3242 case MISALIGNED_INDIRECT_REF
:
3243 case ALIGN_INDIRECT_REF
:
3245 /* Whether a dereference is readonly has nothing to do with whether
3246 its operand is readonly. */
3247 TREE_READONLY (t
) = 0;
3252 recompute_tree_invariant_for_addr_expr (t
);
3256 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3257 && node
&& !TYPE_P (node
)
3258 && TREE_CONSTANT (node
))
3259 TREE_CONSTANT (t
) = 1;
3260 if (TREE_CODE_CLASS (code
) == tcc_reference
3261 && node
&& TREE_THIS_VOLATILE (node
))
3262 TREE_THIS_VOLATILE (t
) = 1;
3269 #define PROCESS_ARG(N) \
3271 TREE_OPERAND (t, N) = arg##N; \
3272 if (arg##N &&!TYPE_P (arg##N)) \
3274 if (TREE_SIDE_EFFECTS (arg##N)) \
3276 if (!TREE_READONLY (arg##N)) \
3278 if (!TREE_CONSTANT (arg##N)) \
3284 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3286 bool constant
, read_only
, side_effects
;
3289 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3291 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3292 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
))
3293 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
);
3295 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3296 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3297 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3298 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3300 t
= make_node_stat (code PASS_MEM_STAT
);
3303 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3304 result based on those same flags for the arguments. But if the
3305 arguments aren't really even `tree' expressions, we shouldn't be trying
3308 /* Expressions without side effects may be constant if their
3309 arguments are as well. */
3310 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3311 || TREE_CODE_CLASS (code
) == tcc_binary
);
3313 side_effects
= TREE_SIDE_EFFECTS (t
);
3318 TREE_READONLY (t
) = read_only
;
3319 TREE_CONSTANT (t
) = constant
;
3320 TREE_SIDE_EFFECTS (t
) = side_effects
;
3321 TREE_THIS_VOLATILE (t
)
3322 = (TREE_CODE_CLASS (code
) == tcc_reference
3323 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3330 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3331 tree arg2 MEM_STAT_DECL
)
3333 bool constant
, read_only
, side_effects
;
3336 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3337 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3339 t
= make_node_stat (code PASS_MEM_STAT
);
3342 /* As a special exception, if COND_EXPR has NULL branches, we
3343 assume that it is a gimple statement and always consider
3344 it to have side effects. */
3345 if (code
== COND_EXPR
3346 && tt
== void_type_node
3347 && arg1
== NULL_TREE
3348 && arg2
== NULL_TREE
)
3349 side_effects
= true;
3351 side_effects
= TREE_SIDE_EFFECTS (t
);
3357 TREE_SIDE_EFFECTS (t
) = side_effects
;
3358 TREE_THIS_VOLATILE (t
)
3359 = (TREE_CODE_CLASS (code
) == tcc_reference
3360 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3366 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3367 tree arg2
, tree arg3 MEM_STAT_DECL
)
3369 bool constant
, read_only
, side_effects
;
3372 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3374 t
= make_node_stat (code PASS_MEM_STAT
);
3377 side_effects
= TREE_SIDE_EFFECTS (t
);
3384 TREE_SIDE_EFFECTS (t
) = side_effects
;
3385 TREE_THIS_VOLATILE (t
)
3386 = (TREE_CODE_CLASS (code
) == tcc_reference
3387 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3393 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3394 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3396 bool constant
, read_only
, side_effects
;
3399 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3401 t
= make_node_stat (code PASS_MEM_STAT
);
3404 side_effects
= TREE_SIDE_EFFECTS (t
);
3412 TREE_SIDE_EFFECTS (t
) = side_effects
;
3413 TREE_THIS_VOLATILE (t
)
3414 = (TREE_CODE_CLASS (code
) == tcc_reference
3415 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3421 build7_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3422 tree arg2
, tree arg3
, tree arg4
, tree arg5
,
3423 tree arg6 MEM_STAT_DECL
)
3425 bool constant
, read_only
, side_effects
;
3428 gcc_assert (code
== TARGET_MEM_REF
);
3430 t
= make_node_stat (code PASS_MEM_STAT
);
3433 side_effects
= TREE_SIDE_EFFECTS (t
);
3443 TREE_SIDE_EFFECTS (t
) = side_effects
;
3444 TREE_THIS_VOLATILE (t
) = 0;
3449 /* Similar except don't specify the TREE_TYPE
3450 and leave the TREE_SIDE_EFFECTS as 0.
3451 It is permissible for arguments to be null,
3452 or even garbage if their values do not matter. */
3455 build_nt (enum tree_code code
, ...)
3462 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3466 t
= make_node (code
);
3467 length
= TREE_CODE_LENGTH (code
);
3469 for (i
= 0; i
< length
; i
++)
3470 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3476 /* Similar to build_nt, but for creating a CALL_EXPR object with
3477 ARGLIST passed as a list. */
3480 build_nt_call_list (tree fn
, tree arglist
)
3485 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
3486 CALL_EXPR_FN (t
) = fn
;
3487 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
3488 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
3489 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
3493 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3494 We do NOT enter this node in any sort of symbol table.
3496 layout_decl is used to set up the decl's storage layout.
3497 Other slots are initialized to 0 or null pointers. */
3500 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
3504 t
= make_node_stat (code PASS_MEM_STAT
);
3506 /* if (type == error_mark_node)
3507 type = integer_type_node; */
3508 /* That is not done, deliberately, so that having error_mark_node
3509 as the type can suppress useless errors in the use of this variable. */
3511 DECL_NAME (t
) = name
;
3512 TREE_TYPE (t
) = type
;
3514 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3520 /* Builds and returns function declaration with NAME and TYPE. */
3523 build_fn_decl (const char *name
, tree type
)
3525 tree id
= get_identifier (name
);
3526 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
3528 DECL_EXTERNAL (decl
) = 1;
3529 TREE_PUBLIC (decl
) = 1;
3530 DECL_ARTIFICIAL (decl
) = 1;
3531 TREE_NOTHROW (decl
) = 1;
3537 /* BLOCK nodes are used to represent the structure of binding contours
3538 and declarations, once those contours have been exited and their contents
3539 compiled. This information is used for outputting debugging info. */
3542 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3544 tree block
= make_node (BLOCK
);
3546 BLOCK_VARS (block
) = vars
;
3547 BLOCK_SUBBLOCKS (block
) = subblocks
;
3548 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3549 BLOCK_CHAIN (block
) = chain
;
3554 expand_location (source_location loc
)
3556 expanded_location xloc
;
3566 const struct line_map
*map
= linemap_lookup (line_table
, loc
);
3567 xloc
.file
= map
->to_file
;
3568 xloc
.line
= SOURCE_LINE (map
, loc
);
3569 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3570 xloc
.sysp
= map
->sysp
!= 0;
3576 /* Source location accessor functions. */
3580 set_expr_locus (tree node
, source_location
*loc
)
3583 EXPR_CHECK (node
)->exp
.locus
= UNKNOWN_LOCATION
;
3585 EXPR_CHECK (node
)->exp
.locus
= *loc
;
3588 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3590 LOC is the location to use in tree T. */
3592 void protected_set_expr_location (tree t
, location_t loc
)
3594 if (t
&& CAN_HAVE_LOCATION_P (t
))
3595 SET_EXPR_LOCATION (t
, loc
);
3598 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3602 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3604 DECL_ATTRIBUTES (ddecl
) = attribute
;
3608 /* Borrowed from hashtab.c iterative_hash implementation. */
3609 #define mix(a,b,c) \
3611 a -= b; a -= c; a ^= (c>>13); \
3612 b -= c; b -= a; b ^= (a<< 8); \
3613 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3614 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3615 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3616 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3617 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3618 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3619 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3623 /* Produce good hash value combining VAL and VAL2. */
3625 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
3627 /* the golden ratio; an arbitrary value. */
3628 hashval_t a
= 0x9e3779b9;
3634 /* Produce good hash value combining PTR and VAL2. */
3635 static inline hashval_t
3636 iterative_hash_pointer (const void *ptr
, hashval_t val2
)
3638 if (sizeof (ptr
) == sizeof (hashval_t
))
3639 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
3642 hashval_t a
= (hashval_t
) (size_t) ptr
;
3643 /* Avoid warnings about shifting of more than the width of the type on
3644 hosts that won't execute this path. */
3646 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
3652 /* Produce good hash value combining VAL and VAL2. */
3653 static inline hashval_t
3654 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
3656 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
3657 return iterative_hash_hashval_t (val
, val2
);
3660 hashval_t a
= (hashval_t
) val
;
3661 /* Avoid warnings about shifting of more than the width of the type on
3662 hosts that won't execute this path. */
3664 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
3666 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
3668 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
3669 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
3676 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3677 is ATTRIBUTE and its qualifiers are QUALS.
3679 Record such modified types already made so we don't make duplicates. */
3682 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
3684 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3686 hashval_t hashcode
= 0;
3688 enum tree_code code
= TREE_CODE (ttype
);
3690 /* Building a distinct copy of a tagged type is inappropriate; it
3691 causes breakage in code that expects there to be a one-to-one
3692 relationship between a struct and its fields.
3693 build_duplicate_type is another solution (as used in
3694 handle_transparent_union_attribute), but that doesn't play well
3695 with the stronger C++ type identity model. */
3696 if (TREE_CODE (ttype
) == RECORD_TYPE
3697 || TREE_CODE (ttype
) == UNION_TYPE
3698 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
3699 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
3701 warning (OPT_Wattributes
,
3702 "ignoring attributes applied to %qT after definition",
3703 TYPE_MAIN_VARIANT (ttype
));
3704 return build_qualified_type (ttype
, quals
);
3707 ntype
= build_distinct_type_copy (ttype
);
3709 TYPE_ATTRIBUTES (ntype
) = attribute
;
3710 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3712 hashcode
= iterative_hash_object (code
, hashcode
);
3713 if (TREE_TYPE (ntype
))
3714 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3716 hashcode
= attribute_hash_list (attribute
, hashcode
);
3718 switch (TREE_CODE (ntype
))
3721 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3724 if (TYPE_DOMAIN (ntype
))
3725 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3729 hashcode
= iterative_hash_object
3730 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3731 hashcode
= iterative_hash_object
3732 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3735 case FIXED_POINT_TYPE
:
3737 unsigned int precision
= TYPE_PRECISION (ntype
);
3738 hashcode
= iterative_hash_object (precision
, hashcode
);
3745 ntype
= type_hash_canon (hashcode
, ntype
);
3747 /* If the target-dependent attributes make NTYPE different from
3748 its canonical type, we will need to use structural equality
3749 checks for this qualified type. */
3750 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
3751 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
3752 || !targetm
.comp_type_attributes (ntype
, ttype
))
3753 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
3755 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
3757 ttype
= build_qualified_type (ntype
, quals
);
3759 else if (TYPE_QUALS (ttype
) != quals
)
3760 ttype
= build_qualified_type (ttype
, quals
);
3766 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3769 Record such modified types already made so we don't make duplicates. */
3772 build_type_attribute_variant (tree ttype
, tree attribute
)
3774 return build_type_attribute_qual_variant (ttype
, attribute
,
3775 TYPE_QUALS (ttype
));
3778 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3781 We try both `text' and `__text__', ATTR may be either one. */
3782 /* ??? It might be a reasonable simplification to require ATTR to be only
3783 `text'. One might then also require attribute lists to be stored in
3784 their canonicalized form. */
3787 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
3792 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3795 p
= IDENTIFIER_POINTER (ident
);
3796 ident_len
= IDENTIFIER_LENGTH (ident
);
3798 if (ident_len
== attr_len
3799 && strcmp (attr
, p
) == 0)
3802 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3805 gcc_assert (attr
[1] == '_');
3806 gcc_assert (attr
[attr_len
- 2] == '_');
3807 gcc_assert (attr
[attr_len
- 1] == '_');
3808 if (ident_len
== attr_len
- 4
3809 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3814 if (ident_len
== attr_len
+ 4
3815 && p
[0] == '_' && p
[1] == '_'
3816 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3817 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3824 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3827 We try both `text' and `__text__', ATTR may be either one. */
3830 is_attribute_p (const char *attr
, const_tree ident
)
3832 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3835 /* Given an attribute name and a list of attributes, return a pointer to the
3836 attribute's list element if the attribute is part of the list, or NULL_TREE
3837 if not found. If the attribute appears more than once, this only
3838 returns the first occurrence; the TREE_CHAIN of the return value should
3839 be passed back in if further occurrences are wanted. */
3842 lookup_attribute (const char *attr_name
, tree list
)
3845 size_t attr_len
= strlen (attr_name
);
3847 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3849 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3850 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3856 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3860 remove_attribute (const char *attr_name
, tree list
)
3863 size_t attr_len
= strlen (attr_name
);
3865 for (p
= &list
; *p
; )
3868 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3869 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3870 *p
= TREE_CHAIN (l
);
3872 p
= &TREE_CHAIN (l
);
3878 /* Return an attribute list that is the union of a1 and a2. */
3881 merge_attributes (tree a1
, tree a2
)
3885 /* Either one unset? Take the set one. */
3887 if ((attributes
= a1
) == 0)
3890 /* One that completely contains the other? Take it. */
3892 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3894 if (attribute_list_contained (a2
, a1
))
3898 /* Pick the longest list, and hang on the other list. */
3900 if (list_length (a1
) < list_length (a2
))
3901 attributes
= a2
, a2
= a1
;
3903 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3906 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3909 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3912 if (TREE_VALUE (a
) != NULL
3913 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
3914 && TREE_VALUE (a2
) != NULL
3915 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
3917 if (simple_cst_list_equal (TREE_VALUE (a
),
3918 TREE_VALUE (a2
)) == 1)
3921 else if (simple_cst_equal (TREE_VALUE (a
),
3922 TREE_VALUE (a2
)) == 1)
3927 a1
= copy_node (a2
);
3928 TREE_CHAIN (a1
) = attributes
;
3937 /* Given types T1 and T2, merge their attributes and return
3941 merge_type_attributes (tree t1
, tree t2
)
3943 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3944 TYPE_ATTRIBUTES (t2
));
3947 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3951 merge_decl_attributes (tree olddecl
, tree newdecl
)
3953 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3954 DECL_ATTRIBUTES (newdecl
));
3957 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3959 /* Specialization of merge_decl_attributes for various Windows targets.
3961 This handles the following situation:
3963 __declspec (dllimport) int foo;
3966 The second instance of `foo' nullifies the dllimport. */
3969 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
3972 int delete_dllimport_p
= 1;
3974 /* What we need to do here is remove from `old' dllimport if it doesn't
3975 appear in `new'. dllimport behaves like extern: if a declaration is
3976 marked dllimport and a definition appears later, then the object
3977 is not dllimport'd. We also remove a `new' dllimport if the old list
3978 contains dllexport: dllexport always overrides dllimport, regardless
3979 of the order of declaration. */
3980 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
3981 delete_dllimport_p
= 0;
3982 else if (DECL_DLLIMPORT_P (new_tree
)
3983 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
3985 DECL_DLLIMPORT_P (new_tree
) = 0;
3986 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
3987 "dllimport ignored", new_tree
);
3989 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
3991 /* Warn about overriding a symbol that has already been used, e.g.:
3992 extern int __attribute__ ((dllimport)) foo;
3993 int* bar () {return &foo;}
3996 if (TREE_USED (old
))
3998 warning (0, "%q+D redeclared without dllimport attribute "
3999 "after being referenced with dll linkage", new_tree
);
4000 /* If we have used a variable's address with dllimport linkage,
4001 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
4002 decl may already have had TREE_CONSTANT computed.
4003 We still remove the attribute so that assembler code refers
4004 to '&foo rather than '_imp__foo'. */
4005 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
4006 DECL_DLLIMPORT_P (new_tree
) = 1;
4009 /* Let an inline definition silently override the external reference,
4010 but otherwise warn about attribute inconsistency. */
4011 else if (TREE_CODE (new_tree
) == VAR_DECL
4012 || !DECL_DECLARED_INLINE_P (new_tree
))
4013 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
4014 "previous dllimport ignored", new_tree
);
4017 delete_dllimport_p
= 0;
4019 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
4021 if (delete_dllimport_p
)
4024 const size_t attr_len
= strlen ("dllimport");
4026 /* Scan the list for dllimport and delete it. */
4027 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
4029 if (is_attribute_with_length_p ("dllimport", attr_len
,
4032 if (prev
== NULL_TREE
)
4035 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
4044 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4045 struct attribute_spec.handler. */
4048 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
4053 /* These attributes may apply to structure and union types being created,
4054 but otherwise should pass to the declaration involved. */
4057 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
4058 | (int) ATTR_FLAG_ARRAY_NEXT
))
4060 *no_add_attrs
= true;
4061 return tree_cons (name
, args
, NULL_TREE
);
4063 if (TREE_CODE (node
) == RECORD_TYPE
4064 || TREE_CODE (node
) == UNION_TYPE
)
4066 node
= TYPE_NAME (node
);
4072 warning (OPT_Wattributes
, "%qs attribute ignored",
4073 IDENTIFIER_POINTER (name
));
4074 *no_add_attrs
= true;
4079 if (TREE_CODE (node
) != FUNCTION_DECL
4080 && TREE_CODE (node
) != VAR_DECL
4081 && TREE_CODE (node
) != TYPE_DECL
)
4083 *no_add_attrs
= true;
4084 warning (OPT_Wattributes
, "%qs attribute ignored",
4085 IDENTIFIER_POINTER (name
));
4089 if (TREE_CODE (node
) == TYPE_DECL
4090 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
4091 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
4093 *no_add_attrs
= true;
4094 warning (OPT_Wattributes
, "%qs attribute ignored",
4095 IDENTIFIER_POINTER (name
));
4099 /* Report error on dllimport ambiguities seen now before they cause
4101 else if (is_attribute_p ("dllimport", name
))
4103 /* Honor any target-specific overrides. */
4104 if (!targetm
.valid_dllimport_attribute_p (node
))
4105 *no_add_attrs
= true;
4107 else if (TREE_CODE (node
) == FUNCTION_DECL
4108 && DECL_DECLARED_INLINE_P (node
))
4110 warning (OPT_Wattributes
, "inline function %q+D declared as "
4111 " dllimport: attribute ignored", node
);
4112 *no_add_attrs
= true;
4114 /* Like MS, treat definition of dllimported variables and
4115 non-inlined functions on declaration as syntax errors. */
4116 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
4118 error ("function %q+D definition is marked dllimport", node
);
4119 *no_add_attrs
= true;
4122 else if (TREE_CODE (node
) == VAR_DECL
)
4124 if (DECL_INITIAL (node
))
4126 error ("variable %q+D definition is marked dllimport",
4128 *no_add_attrs
= true;
4131 /* `extern' needn't be specified with dllimport.
4132 Specify `extern' now and hope for the best. Sigh. */
4133 DECL_EXTERNAL (node
) = 1;
4134 /* Also, implicitly give dllimport'd variables declared within
4135 a function global scope, unless declared static. */
4136 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
4137 TREE_PUBLIC (node
) = 1;
4140 if (*no_add_attrs
== false)
4141 DECL_DLLIMPORT_P (node
) = 1;
4144 /* Report error if symbol is not accessible at global scope. */
4145 if (!TREE_PUBLIC (node
)
4146 && (TREE_CODE (node
) == VAR_DECL
4147 || TREE_CODE (node
) == FUNCTION_DECL
))
4149 error ("external linkage required for symbol %q+D because of "
4150 "%qs attribute", node
, IDENTIFIER_POINTER (name
));
4151 *no_add_attrs
= true;
4154 /* A dllexport'd entity must have default visibility so that other
4155 program units (shared libraries or the main executable) can see
4156 it. A dllimport'd entity must have default visibility so that
4157 the linker knows that undefined references within this program
4158 unit can be resolved by the dynamic linker. */
4161 if (DECL_VISIBILITY_SPECIFIED (node
)
4162 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
4163 error ("%qs implies default visibility, but %qD has already "
4164 "been declared with a different visibility",
4165 IDENTIFIER_POINTER (name
), node
);
4166 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
4167 DECL_VISIBILITY_SPECIFIED (node
) = 1;
4173 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4175 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4176 of the various TYPE_QUAL values. */
4179 set_type_quals (tree type
, int type_quals
)
4181 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
4182 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
4183 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
4186 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4189 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
4191 return (TYPE_QUALS (cand
) == type_quals
4192 && TYPE_NAME (cand
) == TYPE_NAME (base
)
4193 /* Apparently this is needed for Objective-C. */
4194 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
4195 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
4196 TYPE_ATTRIBUTES (base
)));
4199 /* Return a version of the TYPE, qualified as indicated by the
4200 TYPE_QUALS, if one exists. If no qualified version exists yet,
4201 return NULL_TREE. */
4204 get_qualified_type (tree type
, int type_quals
)
4208 if (TYPE_QUALS (type
) == type_quals
)
4211 /* Search the chain of variants to see if there is already one there just
4212 like the one we need to have. If so, use that existing one. We must
4213 preserve the TYPE_NAME, since there is code that depends on this. */
4214 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4215 if (check_qualified_type (t
, type
, type_quals
))
4221 /* Like get_qualified_type, but creates the type if it does not
4222 exist. This function never returns NULL_TREE. */
4225 build_qualified_type (tree type
, int type_quals
)
4229 /* See if we already have the appropriate qualified variant. */
4230 t
= get_qualified_type (type
, type_quals
);
4232 /* If not, build it. */
4235 t
= build_variant_type_copy (type
);
4236 set_type_quals (t
, type_quals
);
4238 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4239 /* Propagate structural equality. */
4240 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4241 else if (TYPE_CANONICAL (type
) != type
)
4242 /* Build the underlying canonical type, since it is different
4244 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
4247 /* T is its own canonical type. */
4248 TYPE_CANONICAL (t
) = t
;
4255 /* Create a new distinct copy of TYPE. The new type is made its own
4256 MAIN_VARIANT. If TYPE requires structural equality checks, the
4257 resulting type requires structural equality checks; otherwise, its
4258 TYPE_CANONICAL points to itself. */
4261 build_distinct_type_copy (tree type
)
4263 tree t
= copy_node (type
);
4265 TYPE_POINTER_TO (t
) = 0;
4266 TYPE_REFERENCE_TO (t
) = 0;
4268 /* Set the canonical type either to a new equivalence class, or
4269 propagate the need for structural equality checks. */
4270 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4271 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4273 TYPE_CANONICAL (t
) = t
;
4275 /* Make it its own variant. */
4276 TYPE_MAIN_VARIANT (t
) = t
;
4277 TYPE_NEXT_VARIANT (t
) = 0;
4279 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4280 whose TREE_TYPE is not t. This can also happen in the Ada
4281 frontend when using subtypes. */
4286 /* Create a new variant of TYPE, equivalent but distinct. This is so
4287 the caller can modify it. TYPE_CANONICAL for the return type will
4288 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4289 are considered equal by the language itself (or that both types
4290 require structural equality checks). */
4293 build_variant_type_copy (tree type
)
4295 tree t
, m
= TYPE_MAIN_VARIANT (type
);
4297 t
= build_distinct_type_copy (type
);
4299 /* Since we're building a variant, assume that it is a non-semantic
4300 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4301 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
4303 /* Add the new type to the chain of variants of TYPE. */
4304 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
4305 TYPE_NEXT_VARIANT (m
) = t
;
4306 TYPE_MAIN_VARIANT (t
) = m
;
4311 /* Return true if the from tree in both tree maps are equal. */
4314 tree_map_base_eq (const void *va
, const void *vb
)
4316 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
4317 *const b
= (const struct tree_map_base
*) vb
;
4318 return (a
->from
== b
->from
);
4321 /* Hash a from tree in a tree_map. */
4324 tree_map_base_hash (const void *item
)
4326 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
4329 /* Return true if this tree map structure is marked for garbage collection
4330 purposes. We simply return true if the from tree is marked, so that this
4331 structure goes away when the from tree goes away. */
4334 tree_map_base_marked_p (const void *p
)
4336 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
4340 tree_map_hash (const void *item
)
4342 return (((const struct tree_map
*) item
)->hash
);
4345 /* Return the initialization priority for DECL. */
4348 decl_init_priority_lookup (tree decl
)
4350 struct tree_priority_map
*h
;
4351 struct tree_map_base in
;
4353 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
4355 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
4356 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
4359 /* Return the finalization priority for DECL. */
4362 decl_fini_priority_lookup (tree decl
)
4364 struct tree_priority_map
*h
;
4365 struct tree_map_base in
;
4367 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
4369 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
4370 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
4373 /* Return the initialization and finalization priority information for
4374 DECL. If there is no previous priority information, a freshly
4375 allocated structure is returned. */
4377 static struct tree_priority_map
*
4378 decl_priority_info (tree decl
)
4380 struct tree_priority_map in
;
4381 struct tree_priority_map
*h
;
4384 in
.base
.from
= decl
;
4385 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
4386 h
= (struct tree_priority_map
*) *loc
;
4389 h
= GGC_CNEW (struct tree_priority_map
);
4391 h
->base
.from
= decl
;
4392 h
->init
= DEFAULT_INIT_PRIORITY
;
4393 h
->fini
= DEFAULT_INIT_PRIORITY
;
4399 /* Set the initialization priority for DECL to PRIORITY. */
4402 decl_init_priority_insert (tree decl
, priority_type priority
)
4404 struct tree_priority_map
*h
;
4406 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
4407 h
= decl_priority_info (decl
);
4411 /* Set the finalization priority for DECL to PRIORITY. */
4414 decl_fini_priority_insert (tree decl
, priority_type priority
)
4416 struct tree_priority_map
*h
;
4418 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
4419 h
= decl_priority_info (decl
);
4423 /* Look up a restrict qualified base decl for FROM. */
4426 decl_restrict_base_lookup (tree from
)
4431 in
.base
.from
= from
;
4432 h
= (struct tree_map
*) htab_find_with_hash (restrict_base_for_decl
, &in
,
4433 htab_hash_pointer (from
));
4434 return h
? h
->to
: NULL_TREE
;
4437 /* Record the restrict qualified base TO for FROM. */
4440 decl_restrict_base_insert (tree from
, tree to
)
4445 h
= GGC_NEW (struct tree_map
);
4446 h
->hash
= htab_hash_pointer (from
);
4447 h
->base
.from
= from
;
4449 loc
= htab_find_slot_with_hash (restrict_base_for_decl
, h
, h
->hash
, INSERT
);
4450 *(struct tree_map
**) loc
= h
;
4453 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4456 print_debug_expr_statistics (void)
4458 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4459 (long) htab_size (debug_expr_for_decl
),
4460 (long) htab_elements (debug_expr_for_decl
),
4461 htab_collisions (debug_expr_for_decl
));
4464 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4467 print_value_expr_statistics (void)
4469 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4470 (long) htab_size (value_expr_for_decl
),
4471 (long) htab_elements (value_expr_for_decl
),
4472 htab_collisions (value_expr_for_decl
));
4475 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4476 don't print anything if the table is empty. */
4479 print_restrict_base_statistics (void)
4481 if (htab_elements (restrict_base_for_decl
) != 0)
4483 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4484 (long) htab_size (restrict_base_for_decl
),
4485 (long) htab_elements (restrict_base_for_decl
),
4486 htab_collisions (restrict_base_for_decl
));
4489 /* Lookup a debug expression for FROM, and return it if we find one. */
4492 decl_debug_expr_lookup (tree from
)
4494 struct tree_map
*h
, in
;
4495 in
.base
.from
= from
;
4497 h
= (struct tree_map
*) htab_find_with_hash (debug_expr_for_decl
, &in
,
4498 htab_hash_pointer (from
));
4504 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4507 decl_debug_expr_insert (tree from
, tree to
)
4512 h
= GGC_NEW (struct tree_map
);
4513 h
->hash
= htab_hash_pointer (from
);
4514 h
->base
.from
= from
;
4516 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
4517 *(struct tree_map
**) loc
= h
;
4520 /* Lookup a value expression for FROM, and return it if we find one. */
4523 decl_value_expr_lookup (tree from
)
4525 struct tree_map
*h
, in
;
4526 in
.base
.from
= from
;
4528 h
= (struct tree_map
*) htab_find_with_hash (value_expr_for_decl
, &in
,
4529 htab_hash_pointer (from
));
4535 /* Insert a mapping FROM->TO in the value expression hashtable. */
4538 decl_value_expr_insert (tree from
, tree to
)
4543 h
= GGC_NEW (struct tree_map
);
4544 h
->hash
= htab_hash_pointer (from
);
4545 h
->base
.from
= from
;
4547 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
4548 *(struct tree_map
**) loc
= h
;
4551 /* Hashing of types so that we don't make duplicates.
4552 The entry point is `type_hash_canon'. */
4554 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4555 with types in the TREE_VALUE slots), by adding the hash codes
4556 of the individual types. */
4559 type_hash_list (const_tree list
, hashval_t hashcode
)
4563 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4564 if (TREE_VALUE (tail
) != error_mark_node
)
4565 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
4571 /* These are the Hashtable callback functions. */
4573 /* Returns true iff the types are equivalent. */
4576 type_hash_eq (const void *va
, const void *vb
)
4578 const struct type_hash
*const a
= (const struct type_hash
*) va
,
4579 *const b
= (const struct type_hash
*) vb
;
4581 /* First test the things that are the same for all types. */
4582 if (a
->hash
!= b
->hash
4583 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
4584 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
4585 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
4586 TYPE_ATTRIBUTES (b
->type
))
4587 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
4588 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
4591 switch (TREE_CODE (a
->type
))
4596 case REFERENCE_TYPE
:
4600 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
4603 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
4604 && !(TYPE_VALUES (a
->type
)
4605 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
4606 && TYPE_VALUES (b
->type
)
4607 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
4608 && type_list_equal (TYPE_VALUES (a
->type
),
4609 TYPE_VALUES (b
->type
))))
4612 /* ... fall through ... */
4617 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
4618 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
4619 TYPE_MAX_VALUE (b
->type
)))
4620 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
4621 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
4622 TYPE_MIN_VALUE (b
->type
))));
4624 case FIXED_POINT_TYPE
:
4625 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
4628 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
4631 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
4632 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4633 || (TYPE_ARG_TYPES (a
->type
)
4634 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4635 && TYPE_ARG_TYPES (b
->type
)
4636 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4637 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4638 TYPE_ARG_TYPES (b
->type
)))));
4641 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
4645 case QUAL_UNION_TYPE
:
4646 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
4647 || (TYPE_FIELDS (a
->type
)
4648 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
4649 && TYPE_FIELDS (b
->type
)
4650 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
4651 && type_list_equal (TYPE_FIELDS (a
->type
),
4652 TYPE_FIELDS (b
->type
))));
4655 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4656 || (TYPE_ARG_TYPES (a
->type
)
4657 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4658 && TYPE_ARG_TYPES (b
->type
)
4659 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4660 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4661 TYPE_ARG_TYPES (b
->type
))))
4669 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
4670 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
4675 /* Return the cached hash value. */
4678 type_hash_hash (const void *item
)
4680 return ((const struct type_hash
*) item
)->hash
;
4683 /* Look in the type hash table for a type isomorphic to TYPE.
4684 If one is found, return it. Otherwise return 0. */
4687 type_hash_lookup (hashval_t hashcode
, tree type
)
4689 struct type_hash
*h
, in
;
4691 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4692 must call that routine before comparing TYPE_ALIGNs. */
4698 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
4705 /* Add an entry to the type-hash-table
4706 for a type TYPE whose hash code is HASHCODE. */
4709 type_hash_add (hashval_t hashcode
, tree type
)
4711 struct type_hash
*h
;
4714 h
= GGC_NEW (struct type_hash
);
4717 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
4721 /* Given TYPE, and HASHCODE its hash code, return the canonical
4722 object for an identical type if one already exists.
4723 Otherwise, return TYPE, and record it as the canonical object.
4725 To use this function, first create a type of the sort you want.
4726 Then compute its hash code from the fields of the type that
4727 make it different from other similar types.
4728 Then call this function and use the value. */
4731 type_hash_canon (unsigned int hashcode
, tree type
)
4735 /* The hash table only contains main variants, so ensure that's what we're
4737 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
4739 if (!lang_hooks
.types
.hash_types
)
4742 /* See if the type is in the hash table already. If so, return it.
4743 Otherwise, add the type. */
4744 t1
= type_hash_lookup (hashcode
, type
);
4747 #ifdef GATHER_STATISTICS
4748 tree_node_counts
[(int) t_kind
]--;
4749 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
4755 type_hash_add (hashcode
, type
);
4760 /* See if the data pointed to by the type hash table is marked. We consider
4761 it marked if the type is marked or if a debug type number or symbol
4762 table entry has been made for the type. This reduces the amount of
4763 debugging output and eliminates that dependency of the debug output on
4764 the number of garbage collections. */
4767 type_hash_marked_p (const void *p
)
4769 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
4771 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
4775 print_type_hash_statistics (void)
4777 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
4778 (long) htab_size (type_hash_table
),
4779 (long) htab_elements (type_hash_table
),
4780 htab_collisions (type_hash_table
));
4783 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4784 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4785 by adding the hash codes of the individual attributes. */
4788 attribute_hash_list (const_tree list
, hashval_t hashcode
)
4792 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4793 /* ??? Do we want to add in TREE_VALUE too? */
4794 hashcode
= iterative_hash_object
4795 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
4799 /* Given two lists of attributes, return true if list l2 is
4800 equivalent to l1. */
4803 attribute_list_equal (const_tree l1
, const_tree l2
)
4805 return attribute_list_contained (l1
, l2
)
4806 && attribute_list_contained (l2
, l1
);
4809 /* Given two lists of attributes, return true if list L2 is
4810 completely contained within L1. */
4811 /* ??? This would be faster if attribute names were stored in a canonicalized
4812 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4813 must be used to show these elements are equivalent (which they are). */
4814 /* ??? It's not clear that attributes with arguments will always be handled
4818 attribute_list_contained (const_tree l1
, const_tree l2
)
4822 /* First check the obvious, maybe the lists are identical. */
4826 /* Maybe the lists are similar. */
4827 for (t1
= l1
, t2
= l2
;
4829 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
4830 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
4831 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
4833 /* Maybe the lists are equal. */
4834 if (t1
== 0 && t2
== 0)
4837 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
4840 /* This CONST_CAST is okay because lookup_attribute does not
4841 modify its argument and the return value is assigned to a
4843 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4844 CONST_CAST_TREE(l1
));
4846 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4849 if (TREE_VALUE (t2
) != NULL
4850 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
4851 && TREE_VALUE (attr
) != NULL
4852 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
4854 if (simple_cst_list_equal (TREE_VALUE (t2
),
4855 TREE_VALUE (attr
)) == 1)
4858 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
4869 /* Given two lists of types
4870 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4871 return 1 if the lists contain the same types in the same order.
4872 Also, the TREE_PURPOSEs must match. */
4875 type_list_equal (const_tree l1
, const_tree l2
)
4879 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
4880 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
4881 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
4882 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
4883 && (TREE_TYPE (TREE_PURPOSE (t1
))
4884 == TREE_TYPE (TREE_PURPOSE (t2
))))))
4890 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4891 given by TYPE. If the argument list accepts variable arguments,
4892 then this function counts only the ordinary arguments. */
4895 type_num_arguments (const_tree type
)
4900 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
4901 /* If the function does not take a variable number of arguments,
4902 the last element in the list will have type `void'. */
4903 if (VOID_TYPE_P (TREE_VALUE (t
)))
4911 /* Nonzero if integer constants T1 and T2
4912 represent the same constant value. */
4915 tree_int_cst_equal (const_tree t1
, const_tree t2
)
4920 if (t1
== 0 || t2
== 0)
4923 if (TREE_CODE (t1
) == INTEGER_CST
4924 && TREE_CODE (t2
) == INTEGER_CST
4925 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4926 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
4932 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4933 The precise way of comparison depends on their data type. */
4936 tree_int_cst_lt (const_tree t1
, const_tree t2
)
4941 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
4943 int t1_sgn
= tree_int_cst_sgn (t1
);
4944 int t2_sgn
= tree_int_cst_sgn (t2
);
4946 if (t1_sgn
< t2_sgn
)
4948 else if (t1_sgn
> t2_sgn
)
4950 /* Otherwise, both are non-negative, so we compare them as
4951 unsigned just in case one of them would overflow a signed
4954 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
4955 return INT_CST_LT (t1
, t2
);
4957 return INT_CST_LT_UNSIGNED (t1
, t2
);
4960 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4963 tree_int_cst_compare (const_tree t1
, const_tree t2
)
4965 if (tree_int_cst_lt (t1
, t2
))
4967 else if (tree_int_cst_lt (t2
, t1
))
4973 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4974 the host. If POS is zero, the value can be represented in a single
4975 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4976 be represented in a single unsigned HOST_WIDE_INT. */
4979 host_integerp (const_tree t
, int pos
)
4981 return (TREE_CODE (t
) == INTEGER_CST
4982 && ((TREE_INT_CST_HIGH (t
) == 0
4983 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
4984 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
4985 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
4986 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
4987 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
4988 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
4989 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
4992 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4993 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4994 be non-negative. We must be able to satisfy the above conditions. */
4997 tree_low_cst (const_tree t
, int pos
)
4999 gcc_assert (host_integerp (t
, pos
));
5000 return TREE_INT_CST_LOW (t
);
5003 /* Return the most significant bit of the integer constant T. */
5006 tree_int_cst_msb (const_tree t
)
5010 unsigned HOST_WIDE_INT l
;
5012 /* Note that using TYPE_PRECISION here is wrong. We care about the
5013 actual bits, not the (arbitrary) range of the type. */
5014 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
5015 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
5016 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
5017 return (l
& 1) == 1;
5020 /* Return an indication of the sign of the integer constant T.
5021 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
5022 Note that -1 will never be returned if T's type is unsigned. */
5025 tree_int_cst_sgn (const_tree t
)
5027 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
5029 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
5031 else if (TREE_INT_CST_HIGH (t
) < 0)
5037 /* Compare two constructor-element-type constants. Return 1 if the lists
5038 are known to be equal; otherwise return 0. */
5041 simple_cst_list_equal (const_tree l1
, const_tree l2
)
5043 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
5045 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
5048 l1
= TREE_CHAIN (l1
);
5049 l2
= TREE_CHAIN (l2
);
5055 /* Return truthvalue of whether T1 is the same tree structure as T2.
5056 Return 1 if they are the same.
5057 Return 0 if they are understandably different.
5058 Return -1 if either contains tree structure not understood by
5062 simple_cst_equal (const_tree t1
, const_tree t2
)
5064 enum tree_code code1
, code2
;
5070 if (t1
== 0 || t2
== 0)
5073 code1
= TREE_CODE (t1
);
5074 code2
= TREE_CODE (t2
);
5076 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
5078 if (CONVERT_EXPR_CODE_P (code2
)
5079 || code2
== NON_LVALUE_EXPR
)
5080 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5082 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
5085 else if (CONVERT_EXPR_CODE_P (code2
)
5086 || code2
== NON_LVALUE_EXPR
)
5087 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
5095 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
5096 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
5099 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
5102 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
5105 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
5106 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
5107 TREE_STRING_LENGTH (t1
)));
5111 unsigned HOST_WIDE_INT idx
;
5112 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
5113 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
5115 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
5118 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
5119 /* ??? Should we handle also fields here? */
5120 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
5121 VEC_index (constructor_elt
, v2
, idx
)->value
))
5127 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5130 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
5133 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
5136 const_tree arg1
, arg2
;
5137 const_call_expr_arg_iterator iter1
, iter2
;
5138 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
5139 arg2
= first_const_call_expr_arg (t2
, &iter2
);
5141 arg1
= next_const_call_expr_arg (&iter1
),
5142 arg2
= next_const_call_expr_arg (&iter2
))
5144 cmp
= simple_cst_equal (arg1
, arg2
);
5148 return arg1
== arg2
;
5152 /* Special case: if either target is an unallocated VAR_DECL,
5153 it means that it's going to be unified with whatever the
5154 TARGET_EXPR is really supposed to initialize, so treat it
5155 as being equivalent to anything. */
5156 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
5157 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
5158 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
5159 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
5160 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
5161 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
5164 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5169 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
5171 case WITH_CLEANUP_EXPR
:
5172 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5176 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
5179 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
5180 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5194 /* This general rule works for most tree codes. All exceptions should be
5195 handled above. If this is a language-specific tree code, we can't
5196 trust what might be in the operand, so say we don't know
5198 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
5201 switch (TREE_CODE_CLASS (code1
))
5205 case tcc_comparison
:
5206 case tcc_expression
:
5210 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
5212 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
5224 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5225 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5226 than U, respectively. */
5229 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
5231 if (tree_int_cst_sgn (t
) < 0)
5233 else if (TREE_INT_CST_HIGH (t
) != 0)
5235 else if (TREE_INT_CST_LOW (t
) == u
)
5237 else if (TREE_INT_CST_LOW (t
) < u
)
5243 /* Return true if CODE represents an associative tree code. Otherwise
5246 associative_tree_code (enum tree_code code
)
5265 /* Return true if CODE represents a commutative tree code. Otherwise
5268 commutative_tree_code (enum tree_code code
)
5281 case UNORDERED_EXPR
:
5285 case TRUTH_AND_EXPR
:
5286 case TRUTH_XOR_EXPR
:
5296 /* Generate a hash value for an expression. This can be used iteratively
5297 by passing a previous result as the VAL argument.
5299 This function is intended to produce the same hash for expressions which
5300 would compare equal using operand_equal_p. */
5303 iterative_hash_expr (const_tree t
, hashval_t val
)
5306 enum tree_code code
;
5310 return iterative_hash_pointer (t
, val
);
5312 code
= TREE_CODE (t
);
5316 /* Alas, constants aren't shared, so we can't rely on pointer
5319 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
5320 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
5323 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
5325 return iterative_hash_hashval_t (val2
, val
);
5329 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
5331 return iterative_hash_hashval_t (val2
, val
);
5334 return iterative_hash (TREE_STRING_POINTER (t
),
5335 TREE_STRING_LENGTH (t
), val
);
5337 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
5338 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
5340 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
5343 /* we can just compare by pointer. */
5344 return iterative_hash_pointer (t
, val
);
5347 /* A list of expressions, for a CALL_EXPR or as the elements of a
5349 for (; t
; t
= TREE_CHAIN (t
))
5350 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
5354 unsigned HOST_WIDE_INT idx
;
5356 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
5358 val
= iterative_hash_expr (field
, val
);
5359 val
= iterative_hash_expr (value
, val
);
5364 /* When referring to a built-in FUNCTION_DECL, use the
5365 __builtin__ form. Otherwise nodes that compare equal
5366 according to operand_equal_p might get different
5368 if (DECL_BUILT_IN (t
))
5370 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
5374 /* else FALL THROUGH */
5376 tclass
= TREE_CODE_CLASS (code
);
5378 if (tclass
== tcc_declaration
)
5380 /* DECL's have a unique ID */
5381 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
5385 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
5387 val
= iterative_hash_object (code
, val
);
5389 /* Don't hash the type, that can lead to having nodes which
5390 compare equal according to operand_equal_p, but which
5391 have different hash codes. */
5392 if (CONVERT_EXPR_CODE_P (code
)
5393 || code
== NON_LVALUE_EXPR
)
5395 /* Make sure to include signness in the hash computation. */
5396 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
5397 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
5400 else if (commutative_tree_code (code
))
5402 /* It's a commutative expression. We want to hash it the same
5403 however it appears. We do this by first hashing both operands
5404 and then rehashing based on the order of their independent
5406 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
5407 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
5411 t
= one
, one
= two
, two
= t
;
5413 val
= iterative_hash_hashval_t (one
, val
);
5414 val
= iterative_hash_hashval_t (two
, val
);
5417 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
5418 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
5425 /* Generate a hash value for a pair of expressions. This can be used
5426 iteratively by passing a previous result as the VAL argument.
5428 The same hash value is always returned for a given pair of expressions,
5429 regardless of the order in which they are presented. This is useful in
5430 hashing the operands of commutative functions. */
5433 iterative_hash_exprs_commutative (const_tree t1
,
5434 const_tree t2
, hashval_t val
)
5436 hashval_t one
= iterative_hash_expr (t1
, 0);
5437 hashval_t two
= iterative_hash_expr (t2
, 0);
5441 t
= one
, one
= two
, two
= t
;
5442 val
= iterative_hash_hashval_t (one
, val
);
5443 val
= iterative_hash_hashval_t (two
, val
);
5448 /* Constructors for pointer, array and function types.
5449 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5450 constructed by language-dependent code, not here.) */
5452 /* Construct, lay out and return the type of pointers to TO_TYPE with
5453 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5454 reference all of memory. If such a type has already been
5455 constructed, reuse it. */
5458 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
5463 if (to_type
== error_mark_node
)
5464 return error_mark_node
;
5466 /* If the pointed-to type has the may_alias attribute set, force
5467 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5468 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
5469 can_alias_all
= true;
5471 /* In some cases, languages will have things that aren't a POINTER_TYPE
5472 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5473 In that case, return that type without regard to the rest of our
5476 ??? This is a kludge, but consistent with the way this function has
5477 always operated and there doesn't seem to be a good way to avoid this
5479 if (TYPE_POINTER_TO (to_type
) != 0
5480 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
5481 return TYPE_POINTER_TO (to_type
);
5483 /* First, if we already have a type for pointers to TO_TYPE and it's
5484 the proper mode, use it. */
5485 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
5486 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5489 t
= make_node (POINTER_TYPE
);
5491 TREE_TYPE (t
) = to_type
;
5492 TYPE_MODE (t
) = mode
;
5493 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5494 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
5495 TYPE_POINTER_TO (to_type
) = t
;
5497 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5498 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5499 else if (TYPE_CANONICAL (to_type
) != to_type
)
5501 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
5502 mode
, can_alias_all
);
5504 /* Lay out the type. This function has many callers that are concerned
5505 with expression-construction, and this simplifies them all. */
5511 /* By default build pointers in ptr_mode. */
5514 build_pointer_type (tree to_type
)
5516 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
5519 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5522 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
5527 if (to_type
== error_mark_node
)
5528 return error_mark_node
;
5530 /* If the pointed-to type has the may_alias attribute set, force
5531 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5532 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
5533 can_alias_all
= true;
5535 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5536 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5537 In that case, return that type without regard to the rest of our
5540 ??? This is a kludge, but consistent with the way this function has
5541 always operated and there doesn't seem to be a good way to avoid this
5543 if (TYPE_REFERENCE_TO (to_type
) != 0
5544 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
5545 return TYPE_REFERENCE_TO (to_type
);
5547 /* First, if we already have a type for pointers to TO_TYPE and it's
5548 the proper mode, use it. */
5549 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
5550 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5553 t
= make_node (REFERENCE_TYPE
);
5555 TREE_TYPE (t
) = to_type
;
5556 TYPE_MODE (t
) = mode
;
5557 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5558 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
5559 TYPE_REFERENCE_TO (to_type
) = t
;
5561 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5562 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5563 else if (TYPE_CANONICAL (to_type
) != to_type
)
5565 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
5566 mode
, can_alias_all
);
5574 /* Build the node for the type of references-to-TO_TYPE by default
5578 build_reference_type (tree to_type
)
5580 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
5583 /* Build a type that is compatible with t but has no cv quals anywhere
5586 const char *const *const * -> char ***. */
5589 build_type_no_quals (tree t
)
5591 switch (TREE_CODE (t
))
5594 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5596 TYPE_REF_CAN_ALIAS_ALL (t
));
5597 case REFERENCE_TYPE
:
5599 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5601 TYPE_REF_CAN_ALIAS_ALL (t
));
5603 return TYPE_MAIN_VARIANT (t
);
5607 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5608 MAXVAL should be the maximum value in the domain
5609 (one less than the length of the array).
5611 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5612 We don't enforce this limit, that is up to caller (e.g. language front end).
5613 The limit exists because the result is a signed type and we don't handle
5614 sizes that use more than one HOST_WIDE_INT. */
5617 build_index_type (tree maxval
)
5619 tree itype
= make_node (INTEGER_TYPE
);
5621 TREE_TYPE (itype
) = sizetype
;
5622 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
5623 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5624 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
5625 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
5626 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
5627 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
5628 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
5629 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
5631 if (host_integerp (maxval
, 1))
5632 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
5635 /* Since we cannot hash this type, we need to compare it using
5636 structural equality checks. */
5637 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
5642 /* Builds a signed or unsigned integer type of precision PRECISION.
5643 Used for C bitfields whose precision does not match that of
5644 built-in target types. */
5646 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
5649 tree itype
= make_node (INTEGER_TYPE
);
5651 TYPE_PRECISION (itype
) = precision
;
5654 fixup_unsigned_type (itype
);
5656 fixup_signed_type (itype
);
5658 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
5659 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
5664 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5665 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5666 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5669 build_range_type (tree type
, tree lowval
, tree highval
)
5671 tree itype
= make_node (INTEGER_TYPE
);
5673 TREE_TYPE (itype
) = type
;
5674 if (type
== NULL_TREE
)
5677 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
5678 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
5680 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
5681 TYPE_MODE (itype
) = TYPE_MODE (type
);
5682 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
5683 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
5684 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
5685 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
5687 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
5688 return type_hash_canon (tree_low_cst (highval
, 0)
5689 - tree_low_cst (lowval
, 0),
5695 /* Just like build_index_type, but takes lowval and highval instead
5696 of just highval (maxval). */
5699 build_index_2_type (tree lowval
, tree highval
)
5701 return build_range_type (sizetype
, lowval
, highval
);
5704 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5705 and number of elements specified by the range of values of INDEX_TYPE.
5706 If such a type has already been constructed, reuse it. */
5709 build_array_type (tree elt_type
, tree index_type
)
5712 hashval_t hashcode
= 0;
5714 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
5716 error ("arrays of functions are not meaningful");
5717 elt_type
= integer_type_node
;
5720 t
= make_node (ARRAY_TYPE
);
5721 TREE_TYPE (t
) = elt_type
;
5722 TYPE_DOMAIN (t
) = index_type
;
5724 if (index_type
== 0)
5727 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5728 t
= type_hash_canon (hashcode
, t
);
5732 if (TYPE_CANONICAL (t
) == t
)
5734 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
))
5735 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5736 else if (TYPE_CANONICAL (elt_type
) != elt_type
)
5738 = build_array_type (TYPE_CANONICAL (elt_type
), index_type
);
5744 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5745 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
5746 t
= type_hash_canon (hashcode
, t
);
5748 if (!COMPLETE_TYPE_P (t
))
5751 if (TYPE_CANONICAL (t
) == t
)
5753 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
5754 || TYPE_STRUCTURAL_EQUALITY_P (index_type
))
5755 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5756 else if (TYPE_CANONICAL (elt_type
) != elt_type
5757 || TYPE_CANONICAL (index_type
) != index_type
)
5759 = build_array_type (TYPE_CANONICAL (elt_type
),
5760 TYPE_CANONICAL (index_type
));
5766 /* Recursively examines the array elements of TYPE, until a non-array
5767 element type is found. */
5770 strip_array_types (tree type
)
5772 while (TREE_CODE (type
) == ARRAY_TYPE
)
5773 type
= TREE_TYPE (type
);
5778 /* Computes the canonical argument types from the argument type list
5781 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5782 on entry to this function, or if any of the ARGTYPES are
5785 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5786 true on entry to this function, or if any of the ARGTYPES are
5789 Returns a canonical argument list, which may be ARGTYPES when the
5790 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5791 true) or would not differ from ARGTYPES. */
5794 maybe_canonicalize_argtypes(tree argtypes
,
5795 bool *any_structural_p
,
5796 bool *any_noncanonical_p
)
5799 bool any_noncanonical_argtypes_p
= false;
5801 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
5803 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
5804 /* Fail gracefully by stating that the type is structural. */
5805 *any_structural_p
= true;
5806 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
5807 *any_structural_p
= true;
5808 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
5809 || TREE_PURPOSE (arg
))
5810 /* If the argument has a default argument, we consider it
5811 non-canonical even though the type itself is canonical.
5812 That way, different variants of function and method types
5813 with default arguments will all point to the variant with
5814 no defaults as their canonical type. */
5815 any_noncanonical_argtypes_p
= true;
5818 if (*any_structural_p
)
5821 if (any_noncanonical_argtypes_p
)
5823 /* Build the canonical list of argument types. */
5824 tree canon_argtypes
= NULL_TREE
;
5825 bool is_void
= false;
5827 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
5829 if (arg
== void_list_node
)
5832 canon_argtypes
= tree_cons (NULL_TREE
,
5833 TYPE_CANONICAL (TREE_VALUE (arg
)),
5837 canon_argtypes
= nreverse (canon_argtypes
);
5839 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
5841 /* There is a non-canonical type. */
5842 *any_noncanonical_p
= true;
5843 return canon_argtypes
;
5846 /* The canonical argument types are the same as ARGTYPES. */
5850 /* Construct, lay out and return
5851 the type of functions returning type VALUE_TYPE
5852 given arguments of types ARG_TYPES.
5853 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5854 are data type nodes for the arguments of the function.
5855 If such a type has already been constructed, reuse it. */
5858 build_function_type (tree value_type
, tree arg_types
)
5861 hashval_t hashcode
= 0;
5862 bool any_structural_p
, any_noncanonical_p
;
5863 tree canon_argtypes
;
5865 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
5867 error ("function return type cannot be function");
5868 value_type
= integer_type_node
;
5871 /* Make a node of the sort we want. */
5872 t
= make_node (FUNCTION_TYPE
);
5873 TREE_TYPE (t
) = value_type
;
5874 TYPE_ARG_TYPES (t
) = arg_types
;
5876 /* If we already have such a type, use the old one. */
5877 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
5878 hashcode
= type_hash_list (arg_types
, hashcode
);
5879 t
= type_hash_canon (hashcode
, t
);
5881 /* Set up the canonical type. */
5882 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
5883 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
5884 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
5886 &any_noncanonical_p
);
5887 if (any_structural_p
)
5888 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5889 else if (any_noncanonical_p
)
5890 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
5893 if (!COMPLETE_TYPE_P (t
))
5898 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
5901 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
5903 tree new_type
= NULL
;
5904 tree args
, new_args
= NULL
, t
;
5908 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
5909 args
= TREE_CHAIN (args
), i
++)
5910 if (!bitmap_bit_p (args_to_skip
, i
))
5911 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
5913 new_reversed
= nreverse (new_args
);
5917 TREE_CHAIN (new_args
) = void_list_node
;
5919 new_reversed
= void_list_node
;
5921 gcc_assert (new_reversed
);
5923 /* Use copy_node to preserve as much as possible from original type
5924 (debug info, attribute lists etc.)
5925 Exception is METHOD_TYPEs must have THIS argument.
5926 When we are asked to remove it, we need to build new FUNCTION_TYPE
5928 if (TREE_CODE (orig_type
) != METHOD_TYPE
5929 || !bitmap_bit_p (args_to_skip
, 0))
5931 new_type
= copy_node (orig_type
);
5932 TYPE_ARG_TYPES (new_type
) = new_reversed
;
5937 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
5939 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
5942 /* This is a new type, not a copy of an old type. Need to reassociate
5943 variants. We can handle everything except the main variant lazily. */
5944 t
= TYPE_MAIN_VARIANT (orig_type
);
5947 TYPE_MAIN_VARIANT (new_type
) = t
;
5948 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
5949 TYPE_NEXT_VARIANT (t
) = new_type
;
5953 TYPE_MAIN_VARIANT (new_type
) = new_type
;
5954 TYPE_NEXT_VARIANT (new_type
) = NULL
;
5959 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
5961 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
5962 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
5963 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
5966 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
5968 tree new_decl
= copy_node (orig_decl
);
5971 new_type
= TREE_TYPE (orig_decl
);
5972 if (prototype_p (new_type
))
5973 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
5974 TREE_TYPE (new_decl
) = new_type
;
5976 /* For declarations setting DECL_VINDEX (i.e. methods)
5977 we expect first argument to be THIS pointer. */
5978 if (bitmap_bit_p (args_to_skip
, 0))
5979 DECL_VINDEX (new_decl
) = NULL_TREE
;
5983 /* Build a function type. The RETURN_TYPE is the type returned by the
5984 function. If VAARGS is set, no void_type_node is appended to the
5985 the list. ARGP muse be alway be terminated be a NULL_TREE. */
5988 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
5992 t
= va_arg (argp
, tree
);
5993 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
5994 args
= tree_cons (NULL_TREE
, t
, args
);
5999 if (args
!= NULL_TREE
)
6000 args
= nreverse (args
);
6001 gcc_assert (args
!= NULL_TREE
&& last
!= void_list_node
);
6003 else if (args
== NULL_TREE
)
6004 args
= void_list_node
;
6008 args
= nreverse (args
);
6009 TREE_CHAIN (last
) = void_list_node
;
6011 args
= build_function_type (return_type
, args
);
6016 /* Build a function type. The RETURN_TYPE is the type returned by the
6017 function. If additional arguments are provided, they are
6018 additional argument types. The list of argument types must always
6019 be terminated by NULL_TREE. */
6022 build_function_type_list (tree return_type
, ...)
6027 va_start (p
, return_type
);
6028 args
= build_function_type_list_1 (false, return_type
, p
);
6033 /* Build a variable argument function type. The RETURN_TYPE is the
6034 type returned by the function. If additional arguments are provided,
6035 they are additional argument types. The list of argument types must
6036 always be terminated by NULL_TREE. */
6039 build_varargs_function_type_list (tree return_type
, ...)
6044 va_start (p
, return_type
);
6045 args
= build_function_type_list_1 (true, return_type
, p
);
6051 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
6052 and ARGTYPES (a TREE_LIST) are the return type and arguments types
6053 for the method. An implicit additional parameter (of type
6054 pointer-to-BASETYPE) is added to the ARGTYPES. */
6057 build_method_type_directly (tree basetype
,
6064 bool any_structural_p
, any_noncanonical_p
;
6065 tree canon_argtypes
;
6067 /* Make a node of the sort we want. */
6068 t
= make_node (METHOD_TYPE
);
6070 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
6071 TREE_TYPE (t
) = rettype
;
6072 ptype
= build_pointer_type (basetype
);
6074 /* The actual arglist for this function includes a "hidden" argument
6075 which is "this". Put it into the list of argument types. */
6076 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
6077 TYPE_ARG_TYPES (t
) = argtypes
;
6079 /* If we already have such a type, use the old one. */
6080 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
6081 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
6082 hashcode
= type_hash_list (argtypes
, hashcode
);
6083 t
= type_hash_canon (hashcode
, t
);
6085 /* Set up the canonical type. */
6087 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
6088 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
6090 = (TYPE_CANONICAL (basetype
) != basetype
6091 || TYPE_CANONICAL (rettype
) != rettype
);
6092 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
6094 &any_noncanonical_p
);
6095 if (any_structural_p
)
6096 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6097 else if (any_noncanonical_p
)
6099 = build_method_type_directly (TYPE_CANONICAL (basetype
),
6100 TYPE_CANONICAL (rettype
),
6102 if (!COMPLETE_TYPE_P (t
))
6108 /* Construct, lay out and return the type of methods belonging to class
6109 BASETYPE and whose arguments and values are described by TYPE.
6110 If that type exists already, reuse it.
6111 TYPE must be a FUNCTION_TYPE node. */
6114 build_method_type (tree basetype
, tree type
)
6116 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
6118 return build_method_type_directly (basetype
,
6120 TYPE_ARG_TYPES (type
));
6123 /* Construct, lay out and return the type of offsets to a value
6124 of type TYPE, within an object of type BASETYPE.
6125 If a suitable offset type exists already, reuse it. */
6128 build_offset_type (tree basetype
, tree type
)
6131 hashval_t hashcode
= 0;
6133 /* Make a node of the sort we want. */
6134 t
= make_node (OFFSET_TYPE
);
6136 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
6137 TREE_TYPE (t
) = type
;
6139 /* If we already have such a type, use the old one. */
6140 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
6141 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
6142 t
= type_hash_canon (hashcode
, t
);
6144 if (!COMPLETE_TYPE_P (t
))
6147 if (TYPE_CANONICAL (t
) == t
)
6149 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
6150 || TYPE_STRUCTURAL_EQUALITY_P (type
))
6151 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6152 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
6153 || TYPE_CANONICAL (type
) != type
)
6155 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
6156 TYPE_CANONICAL (type
));
6162 /* Create a complex type whose components are COMPONENT_TYPE. */
6165 build_complex_type (tree component_type
)
6170 /* Make a node of the sort we want. */
6171 t
= make_node (COMPLEX_TYPE
);
6173 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
6175 /* If we already have such a type, use the old one. */
6176 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
6177 t
= type_hash_canon (hashcode
, t
);
6179 if (!COMPLETE_TYPE_P (t
))
6182 if (TYPE_CANONICAL (t
) == t
)
6184 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
6185 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6186 else if (TYPE_CANONICAL (component_type
) != component_type
)
6188 = build_complex_type (TYPE_CANONICAL (component_type
));
6191 /* We need to create a name, since complex is a fundamental type. */
6192 if (! TYPE_NAME (t
))
6195 if (component_type
== char_type_node
)
6196 name
= "complex char";
6197 else if (component_type
== signed_char_type_node
)
6198 name
= "complex signed char";
6199 else if (component_type
== unsigned_char_type_node
)
6200 name
= "complex unsigned char";
6201 else if (component_type
== short_integer_type_node
)
6202 name
= "complex short int";
6203 else if (component_type
== short_unsigned_type_node
)
6204 name
= "complex short unsigned int";
6205 else if (component_type
== integer_type_node
)
6206 name
= "complex int";
6207 else if (component_type
== unsigned_type_node
)
6208 name
= "complex unsigned int";
6209 else if (component_type
== long_integer_type_node
)
6210 name
= "complex long int";
6211 else if (component_type
== long_unsigned_type_node
)
6212 name
= "complex long unsigned int";
6213 else if (component_type
== long_long_integer_type_node
)
6214 name
= "complex long long int";
6215 else if (component_type
== long_long_unsigned_type_node
)
6216 name
= "complex long long unsigned int";
6221 TYPE_NAME (t
) = build_decl (TYPE_DECL
, get_identifier (name
), t
);
6224 return build_qualified_type (t
, TYPE_QUALS (component_type
));
6227 /* Return OP, stripped of any conversions to wider types as much as is safe.
6228 Converting the value back to OP's type makes a value equivalent to OP.
6230 If FOR_TYPE is nonzero, we return a value which, if converted to
6231 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6233 OP must have integer, real or enumeral type. Pointers are not allowed!
6235 There are some cases where the obvious value we could return
6236 would regenerate to OP if converted to OP's type,
6237 but would not extend like OP to wider types.
6238 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6239 For example, if OP is (unsigned short)(signed char)-1,
6240 we avoid returning (signed char)-1 if FOR_TYPE is int,
6241 even though extending that to an unsigned short would regenerate OP,
6242 since the result of extending (signed char)-1 to (int)
6243 is different from (int) OP. */
6246 get_unwidened (tree op
, tree for_type
)
6248 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6249 tree type
= TREE_TYPE (op
);
6251 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
6253 = (for_type
!= 0 && for_type
!= type
6254 && final_prec
> TYPE_PRECISION (type
)
6255 && TYPE_UNSIGNED (type
));
6258 while (CONVERT_EXPR_P (op
))
6262 /* TYPE_PRECISION on vector types has different meaning
6263 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6264 so avoid them here. */
6265 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
6268 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
6269 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
6271 /* Truncations are many-one so cannot be removed.
6272 Unless we are later going to truncate down even farther. */
6274 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
6277 /* See what's inside this conversion. If we decide to strip it,
6279 op
= TREE_OPERAND (op
, 0);
6281 /* If we have not stripped any zero-extensions (uns is 0),
6282 we can strip any kind of extension.
6283 If we have previously stripped a zero-extension,
6284 only zero-extensions can safely be stripped.
6285 Any extension can be stripped if the bits it would produce
6286 are all going to be discarded later by truncating to FOR_TYPE. */
6290 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
6292 /* TYPE_UNSIGNED says whether this is a zero-extension.
6293 Let's avoid computing it if it does not affect WIN
6294 and if UNS will not be needed again. */
6296 || CONVERT_EXPR_P (op
))
6297 && TYPE_UNSIGNED (TREE_TYPE (op
)))
6308 /* Return OP or a simpler expression for a narrower value
6309 which can be sign-extended or zero-extended to give back OP.
6310 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6311 or 0 if the value should be sign-extended. */
6314 get_narrower (tree op
, int *unsignedp_ptr
)
6319 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
6321 while (TREE_CODE (op
) == NOP_EXPR
)
6324 = (TYPE_PRECISION (TREE_TYPE (op
))
6325 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
6327 /* Truncations are many-one so cannot be removed. */
6331 /* See what's inside this conversion. If we decide to strip it,
6336 op
= TREE_OPERAND (op
, 0);
6337 /* An extension: the outermost one can be stripped,
6338 but remember whether it is zero or sign extension. */
6340 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
6341 /* Otherwise, if a sign extension has been stripped,
6342 only sign extensions can now be stripped;
6343 if a zero extension has been stripped, only zero-extensions. */
6344 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
6348 else /* bitschange == 0 */
6350 /* A change in nominal type can always be stripped, but we must
6351 preserve the unsignedness. */
6353 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
6355 op
= TREE_OPERAND (op
, 0);
6356 /* Keep trying to narrow, but don't assign op to win if it
6357 would turn an integral type into something else. */
6358 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
6365 if (TREE_CODE (op
) == COMPONENT_REF
6366 /* Since type_for_size always gives an integer type. */
6367 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
6368 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
6369 /* Ensure field is laid out already. */
6370 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
6371 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
6373 unsigned HOST_WIDE_INT innerprec
6374 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
6375 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
6376 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
6377 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
6379 /* We can get this structure field in a narrower type that fits it,
6380 but the resulting extension to its nominal type (a fullword type)
6381 must satisfy the same conditions as for other extensions.
6383 Do this only for fields that are aligned (not bit-fields),
6384 because when bit-field insns will be used there is no
6385 advantage in doing this. */
6387 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
6388 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
6389 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
6393 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
6394 win
= fold_convert (type
, op
);
6398 *unsignedp_ptr
= uns
;
6402 /* Nonzero if integer constant C has a value that is permissible
6403 for type TYPE (an INTEGER_TYPE). */
6406 int_fits_type_p (const_tree c
, const_tree type
)
6408 tree type_low_bound
= TYPE_MIN_VALUE (type
);
6409 tree type_high_bound
= TYPE_MAX_VALUE (type
);
6410 bool ok_for_low_bound
, ok_for_high_bound
;
6411 unsigned HOST_WIDE_INT low
;
6414 /* If at least one bound of the type is a constant integer, we can check
6415 ourselves and maybe make a decision. If no such decision is possible, but
6416 this type is a subtype, try checking against that. Otherwise, use
6417 fit_double_type, which checks against the precision.
6419 Compute the status for each possibly constant bound, and return if we see
6420 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6421 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6422 for "constant known to fit". */
6424 if (TREE_TYPE (c
) == sizetype
6425 && TYPE_UNSIGNED (TREE_TYPE (c
))
6426 && TREE_INT_CST_HIGH (c
) == -1
6427 && !TREE_OVERFLOW (c
))
6428 /* So c is an unsigned integer which type is sizetype.
6429 sizetype'd integers are sign extended even though they are
6430 unsigned. If the integer value fits in the lower end word of c,
6431 and if the higher end word has all its bits set to 1, that
6432 means the higher end bits are set to 1 only for sign extension.
6433 So let's convert c into an equivalent zero extended unsigned
6435 c
= force_fit_type_double (size_type_node
,
6436 TREE_INT_CST_LOW (c
),
6437 TREE_INT_CST_HIGH (c
),
6439 /* Check if C >= type_low_bound. */
6440 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
6442 if (tree_int_cst_lt (c
, type_low_bound
))
6444 ok_for_low_bound
= true;
6447 ok_for_low_bound
= false;
6449 /* Check if c <= type_high_bound. */
6450 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
6452 if (tree_int_cst_lt (type_high_bound
, c
))
6454 ok_for_high_bound
= true;
6457 ok_for_high_bound
= false;
6459 /* If the constant fits both bounds, the result is known. */
6460 if (ok_for_low_bound
&& ok_for_high_bound
)
6463 /* Perform some generic filtering which may allow making a decision
6464 even if the bounds are not constant. First, negative integers
6465 never fit in unsigned types, */
6466 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
6469 /* Second, narrower types always fit in wider ones. */
6470 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
6473 /* Third, unsigned integers with top bit set never fit signed types. */
6474 if (! TYPE_UNSIGNED (type
)
6475 && TYPE_UNSIGNED (TREE_TYPE (c
))
6476 && tree_int_cst_msb (c
))
6479 /* If we haven't been able to decide at this point, there nothing more we
6480 can check ourselves here. Look at the base type if we have one and it
6481 has the same precision. */
6482 if (TREE_CODE (type
) == INTEGER_TYPE
6483 && TREE_TYPE (type
) != 0
6484 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
6485 return int_fits_type_p (c
, TREE_TYPE (type
));
6487 /* Or to fit_double_type, if nothing else. */
6488 low
= TREE_INT_CST_LOW (c
);
6489 high
= TREE_INT_CST_HIGH (c
);
6490 return !fit_double_type (low
, high
, &low
, &high
, type
);
6493 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6494 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6495 represented (assuming two's-complement arithmetic) within the bit
6496 precision of the type are returned instead. */
6499 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
6501 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
6502 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
6503 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
6504 TYPE_UNSIGNED (type
));
6507 if (TYPE_UNSIGNED (type
))
6508 mpz_set_ui (min
, 0);
6512 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
6513 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
6514 TYPE_PRECISION (type
));
6515 mpz_set_double_int (min
, mn
, false);
6519 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
6520 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
6521 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
6522 TYPE_UNSIGNED (type
));
6525 if (TYPE_UNSIGNED (type
))
6526 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
6529 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
6534 /* Return true if VAR is an automatic variable defined in function FN. */
6537 auto_var_in_fn_p (const_tree var
, const_tree fn
)
6539 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
6540 && (((TREE_CODE (var
) == VAR_DECL
|| TREE_CODE (var
) == PARM_DECL
)
6541 && ! TREE_STATIC (var
))
6542 || TREE_CODE (var
) == LABEL_DECL
6543 || TREE_CODE (var
) == RESULT_DECL
));
6546 /* Subprogram of following function. Called by walk_tree.
6548 Return *TP if it is an automatic variable or parameter of the
6549 function passed in as DATA. */
6552 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
6554 tree fn
= (tree
) data
;
6559 else if (DECL_P (*tp
)
6560 && auto_var_in_fn_p (*tp
, fn
))
6566 /* Returns true if T is, contains, or refers to a type with variable
6567 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6568 arguments, but not the return type. If FN is nonzero, only return
6569 true if a modifier of the type or position of FN is a variable or
6570 parameter inside FN.
6572 This concept is more general than that of C99 'variably modified types':
6573 in C99, a struct type is never variably modified because a VLA may not
6574 appear as a structure member. However, in GNU C code like:
6576 struct S { int i[f()]; };
6578 is valid, and other languages may define similar constructs. */
6581 variably_modified_type_p (tree type
, tree fn
)
6585 /* Test if T is either variable (if FN is zero) or an expression containing
6586 a variable in FN. */
6587 #define RETURN_TRUE_IF_VAR(T) \
6588 do { tree _t = (T); \
6589 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6590 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6591 return true; } while (0)
6593 if (type
== error_mark_node
)
6596 /* If TYPE itself has variable size, it is variably modified. */
6597 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
6598 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
6600 switch (TREE_CODE (type
))
6603 case REFERENCE_TYPE
:
6605 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6611 /* If TYPE is a function type, it is variably modified if the
6612 return type is variably modified. */
6613 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6619 case FIXED_POINT_TYPE
:
6622 /* Scalar types are variably modified if their end points
6624 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
6625 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
6630 case QUAL_UNION_TYPE
:
6631 /* We can't see if any of the fields are variably-modified by the
6632 definition we normally use, since that would produce infinite
6633 recursion via pointers. */
6634 /* This is variably modified if some field's type is. */
6635 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
6636 if (TREE_CODE (t
) == FIELD_DECL
)
6638 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
6639 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
6640 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
6642 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
6643 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
6648 /* Do not call ourselves to avoid infinite recursion. This is
6649 variably modified if the element type is. */
6650 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
6651 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
6658 /* The current language may have other cases to check, but in general,
6659 all other types are not variably modified. */
6660 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
6662 #undef RETURN_TRUE_IF_VAR
6665 /* Given a DECL or TYPE, return the scope in which it was declared, or
6666 NULL_TREE if there is no containing scope. */
6669 get_containing_scope (const_tree t
)
6671 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
6674 /* Return the innermost context enclosing DECL that is
6675 a FUNCTION_DECL, or zero if none. */
6678 decl_function_context (const_tree decl
)
6682 if (TREE_CODE (decl
) == ERROR_MARK
)
6685 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6686 where we look up the function at runtime. Such functions always take
6687 a first argument of type 'pointer to real context'.
6689 C++ should really be fixed to use DECL_CONTEXT for the real context,
6690 and use something else for the "virtual context". */
6691 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
6694 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
6696 context
= DECL_CONTEXT (decl
);
6698 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
6700 if (TREE_CODE (context
) == BLOCK
)
6701 context
= BLOCK_SUPERCONTEXT (context
);
6703 context
= get_containing_scope (context
);
6709 /* Return the innermost context enclosing DECL that is
6710 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6711 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6714 decl_type_context (const_tree decl
)
6716 tree context
= DECL_CONTEXT (decl
);
6719 switch (TREE_CODE (context
))
6721 case NAMESPACE_DECL
:
6722 case TRANSLATION_UNIT_DECL
:
6727 case QUAL_UNION_TYPE
:
6732 context
= DECL_CONTEXT (context
);
6736 context
= BLOCK_SUPERCONTEXT (context
);
6746 /* CALL is a CALL_EXPR. Return the declaration for the function
6747 called, or NULL_TREE if the called function cannot be
6751 get_callee_fndecl (const_tree call
)
6755 if (call
== error_mark_node
)
6756 return error_mark_node
;
6758 /* It's invalid to call this function with anything but a
6760 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
6762 /* The first operand to the CALL is the address of the function
6764 addr
= CALL_EXPR_FN (call
);
6768 /* If this is a readonly function pointer, extract its initial value. */
6769 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
6770 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
6771 && DECL_INITIAL (addr
))
6772 addr
= DECL_INITIAL (addr
);
6774 /* If the address is just `&f' for some function `f', then we know
6775 that `f' is being called. */
6776 if (TREE_CODE (addr
) == ADDR_EXPR
6777 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
6778 return TREE_OPERAND (addr
, 0);
6780 /* We couldn't figure out what was being called. */
6784 /* Print debugging information about tree nodes generated during the compile,
6785 and any language-specific information. */
6788 dump_tree_statistics (void)
6790 #ifdef GATHER_STATISTICS
6792 int total_nodes
, total_bytes
;
6795 fprintf (stderr
, "\n??? tree nodes created\n\n");
6796 #ifdef GATHER_STATISTICS
6797 fprintf (stderr
, "Kind Nodes Bytes\n");
6798 fprintf (stderr
, "---------------------------------------\n");
6799 total_nodes
= total_bytes
= 0;
6800 for (i
= 0; i
< (int) all_kinds
; i
++)
6802 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
6803 tree_node_counts
[i
], tree_node_sizes
[i
]);
6804 total_nodes
+= tree_node_counts
[i
];
6805 total_bytes
+= tree_node_sizes
[i
];
6807 fprintf (stderr
, "---------------------------------------\n");
6808 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
6809 fprintf (stderr
, "---------------------------------------\n");
6810 ssanames_print_statistics ();
6811 phinodes_print_statistics ();
6813 fprintf (stderr
, "(No per-node statistics)\n");
6815 print_type_hash_statistics ();
6816 print_debug_expr_statistics ();
6817 print_value_expr_statistics ();
6818 print_restrict_base_statistics ();
6819 lang_hooks
.print_statistics ();
6822 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6824 /* Generate a crc32 of a string. */
6827 crc32_string (unsigned chksum
, const char *string
)
6831 unsigned value
= *string
<< 24;
6834 for (ix
= 8; ix
--; value
<<= 1)
6838 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
6847 /* P is a string that will be used in a symbol. Mask out any characters
6848 that are not valid in that context. */
6851 clean_symbol_name (char *p
)
6855 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6858 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6865 /* Generate a name for a special-purpose function function.
6866 The generated name may need to be unique across the whole link.
6867 TYPE is some string to identify the purpose of this function to the
6868 linker or collect2; it must start with an uppercase letter,
6870 I - for constructors
6872 N - for C++ anonymous namespaces
6873 F - for DWARF unwind frame information. */
6876 get_file_function_name (const char *type
)
6882 /* If we already have a name we know to be unique, just use that. */
6883 if (first_global_object_name
)
6884 p
= first_global_object_name
;
6885 /* If the target is handling the constructors/destructors, they
6886 will be local to this file and the name is only necessary for
6887 debugging purposes. */
6888 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
6890 const char *file
= main_input_filename
;
6892 file
= input_filename
;
6893 /* Just use the file's basename, because the full pathname
6894 might be quite long. */
6895 p
= strrchr (file
, '/');
6900 p
= q
= ASTRDUP (p
);
6901 clean_symbol_name (q
);
6905 /* Otherwise, the name must be unique across the entire link.
6906 We don't have anything that we know to be unique to this translation
6907 unit, so use what we do have and throw in some randomness. */
6909 const char *name
= weak_global_object_name
;
6910 const char *file
= main_input_filename
;
6915 file
= input_filename
;
6917 len
= strlen (file
);
6918 q
= (char *) alloca (9 * 2 + len
+ 1);
6919 memcpy (q
, file
, len
+ 1);
6920 clean_symbol_name (q
);
6922 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
6923 crc32_string (0, get_random_seed (false)));
6928 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
6931 /* Set up the name of the file-level functions we may need.
6932 Use a global object (which is already required to be unique over
6933 the program) rather than the file name (which imposes extra
6935 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
6937 return get_identifier (buf
);
6940 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6942 /* Complain that the tree code of NODE does not match the expected 0
6943 terminated list of trailing codes. The trailing code list can be
6944 empty, for a more vague error message. FILE, LINE, and FUNCTION
6945 are of the caller. */
6948 tree_check_failed (const_tree node
, const char *file
,
6949 int line
, const char *function
, ...)
6953 unsigned length
= 0;
6956 va_start (args
, function
);
6957 while ((code
= va_arg (args
, int)))
6958 length
+= 4 + strlen (tree_code_name
[code
]);
6963 va_start (args
, function
);
6964 length
+= strlen ("expected ");
6965 buffer
= tmp
= (char *) alloca (length
);
6967 while ((code
= va_arg (args
, int)))
6969 const char *prefix
= length
? " or " : "expected ";
6971 strcpy (tmp
+ length
, prefix
);
6972 length
+= strlen (prefix
);
6973 strcpy (tmp
+ length
, tree_code_name
[code
]);
6974 length
+= strlen (tree_code_name
[code
]);
6979 buffer
= "unexpected node";
6981 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6982 buffer
, tree_code_name
[TREE_CODE (node
)],
6983 function
, trim_filename (file
), line
);
6986 /* Complain that the tree code of NODE does match the expected 0
6987 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6991 tree_not_check_failed (const_tree node
, const char *file
,
6992 int line
, const char *function
, ...)
6996 unsigned length
= 0;
6999 va_start (args
, function
);
7000 while ((code
= va_arg (args
, int)))
7001 length
+= 4 + strlen (tree_code_name
[code
]);
7003 va_start (args
, function
);
7004 buffer
= (char *) alloca (length
);
7006 while ((code
= va_arg (args
, int)))
7010 strcpy (buffer
+ length
, " or ");
7013 strcpy (buffer
+ length
, tree_code_name
[code
]);
7014 length
+= strlen (tree_code_name
[code
]);
7018 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
7019 buffer
, tree_code_name
[TREE_CODE (node
)],
7020 function
, trim_filename (file
), line
);
7023 /* Similar to tree_check_failed, except that we check for a class of tree
7024 code, given in CL. */
7027 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
7028 const char *file
, int line
, const char *function
)
7031 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
7032 TREE_CODE_CLASS_STRING (cl
),
7033 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
7034 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
7037 /* Similar to tree_check_failed, except that instead of specifying a
7038 dozen codes, use the knowledge that they're all sequential. */
7041 tree_range_check_failed (const_tree node
, const char *file
, int line
,
7042 const char *function
, enum tree_code c1
,
7046 unsigned length
= 0;
7049 for (c
= c1
; c
<= c2
; ++c
)
7050 length
+= 4 + strlen (tree_code_name
[c
]);
7052 length
+= strlen ("expected ");
7053 buffer
= (char *) alloca (length
);
7056 for (c
= c1
; c
<= c2
; ++c
)
7058 const char *prefix
= length
? " or " : "expected ";
7060 strcpy (buffer
+ length
, prefix
);
7061 length
+= strlen (prefix
);
7062 strcpy (buffer
+ length
, tree_code_name
[c
]);
7063 length
+= strlen (tree_code_name
[c
]);
7066 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7067 buffer
, tree_code_name
[TREE_CODE (node
)],
7068 function
, trim_filename (file
), line
);
7072 /* Similar to tree_check_failed, except that we check that a tree does
7073 not have the specified code, given in CL. */
7076 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
7077 const char *file
, int line
, const char *function
)
7080 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
7081 TREE_CODE_CLASS_STRING (cl
),
7082 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
7083 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
7087 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
7090 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
7091 const char *function
, enum omp_clause_code code
)
7093 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
7094 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
7095 function
, trim_filename (file
), line
);
7099 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
7102 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
7103 const char *function
, enum omp_clause_code c1
,
7104 enum omp_clause_code c2
)
7107 unsigned length
= 0;
7108 enum omp_clause_code c
;
7110 for (c
= c1
; c
<= c2
; ++c
)
7111 length
+= 4 + strlen (omp_clause_code_name
[c
]);
7113 length
+= strlen ("expected ");
7114 buffer
= (char *) alloca (length
);
7117 for (c
= c1
; c
<= c2
; ++c
)
7119 const char *prefix
= length
? " or " : "expected ";
7121 strcpy (buffer
+ length
, prefix
);
7122 length
+= strlen (prefix
);
7123 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
7124 length
+= strlen (omp_clause_code_name
[c
]);
7127 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7128 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
7129 function
, trim_filename (file
), line
);
7133 #undef DEFTREESTRUCT
7134 #define DEFTREESTRUCT(VAL, NAME) NAME,
7136 static const char *ts_enum_names
[] = {
7137 #include "treestruct.def"
7139 #undef DEFTREESTRUCT
7141 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
7143 /* Similar to tree_class_check_failed, except that we check for
7144 whether CODE contains the tree structure identified by EN. */
7147 tree_contains_struct_check_failed (const_tree node
,
7148 const enum tree_node_structure_enum en
,
7149 const char *file
, int line
,
7150 const char *function
)
7153 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
7155 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
7159 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
7160 (dynamically sized) vector. */
7163 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
7164 const char *function
)
7167 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7168 idx
+ 1, len
, function
, trim_filename (file
), line
);
7171 /* Similar to above, except that the check is for the bounds of the operand
7172 vector of an expression node EXP. */
7175 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
7176 int line
, const char *function
)
7178 int code
= TREE_CODE (exp
);
7180 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7181 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
7182 function
, trim_filename (file
), line
);
7185 /* Similar to above, except that the check is for the number of
7186 operands of an OMP_CLAUSE node. */
7189 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
7190 int line
, const char *function
)
7193 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7194 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
7195 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
7196 trim_filename (file
), line
);
7198 #endif /* ENABLE_TREE_CHECKING */
7200 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7201 and mapped to the machine mode MODE. Initialize its fields and build
7202 the information necessary for debugging output. */
7205 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
7208 hashval_t hashcode
= 0;
7210 /* Build a main variant, based on the main variant of the inner type, then
7211 use it to build the variant we return. */
7212 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
7213 && TYPE_MAIN_VARIANT (innertype
) != innertype
)
7214 return build_type_attribute_qual_variant (
7215 make_vector_type (TYPE_MAIN_VARIANT (innertype
), nunits
, mode
),
7216 TYPE_ATTRIBUTES (innertype
),
7217 TYPE_QUALS (innertype
));
7219 t
= make_node (VECTOR_TYPE
);
7220 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
7221 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
7222 TYPE_MODE (t
) = mode
;
7223 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
7224 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
7226 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
7227 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7228 else if (TYPE_CANONICAL (innertype
) != innertype
7229 || mode
!= VOIDmode
)
7231 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
7236 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
7237 tree array
= build_array_type (innertype
, build_index_type (index
));
7238 tree rt
= make_node (RECORD_TYPE
);
7240 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
7241 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
7243 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
7244 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7245 the representation type, and we want to find that die when looking up
7246 the vector type. This is most easily achieved by making the TYPE_UID
7248 TYPE_UID (rt
) = TYPE_UID (t
);
7251 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
7252 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
7253 hashcode
= iterative_hash_object (TYPE_HASH (innertype
), hashcode
);
7254 return type_hash_canon (hashcode
, t
);
7258 make_or_reuse_type (unsigned size
, int unsignedp
)
7260 if (size
== INT_TYPE_SIZE
)
7261 return unsignedp
? unsigned_type_node
: integer_type_node
;
7262 if (size
== CHAR_TYPE_SIZE
)
7263 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
7264 if (size
== SHORT_TYPE_SIZE
)
7265 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
7266 if (size
== LONG_TYPE_SIZE
)
7267 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
7268 if (size
== LONG_LONG_TYPE_SIZE
)
7269 return (unsignedp
? long_long_unsigned_type_node
7270 : long_long_integer_type_node
);
7273 return make_unsigned_type (size
);
7275 return make_signed_type (size
);
7278 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7281 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
7285 if (size
== SHORT_FRACT_TYPE_SIZE
)
7286 return unsignedp
? sat_unsigned_short_fract_type_node
7287 : sat_short_fract_type_node
;
7288 if (size
== FRACT_TYPE_SIZE
)
7289 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
7290 if (size
== LONG_FRACT_TYPE_SIZE
)
7291 return unsignedp
? sat_unsigned_long_fract_type_node
7292 : sat_long_fract_type_node
;
7293 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
7294 return unsignedp
? sat_unsigned_long_long_fract_type_node
7295 : sat_long_long_fract_type_node
;
7299 if (size
== SHORT_FRACT_TYPE_SIZE
)
7300 return unsignedp
? unsigned_short_fract_type_node
7301 : short_fract_type_node
;
7302 if (size
== FRACT_TYPE_SIZE
)
7303 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
7304 if (size
== LONG_FRACT_TYPE_SIZE
)
7305 return unsignedp
? unsigned_long_fract_type_node
7306 : long_fract_type_node
;
7307 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
7308 return unsignedp
? unsigned_long_long_fract_type_node
7309 : long_long_fract_type_node
;
7312 return make_fract_type (size
, unsignedp
, satp
);
7315 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7318 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
7322 if (size
== SHORT_ACCUM_TYPE_SIZE
)
7323 return unsignedp
? sat_unsigned_short_accum_type_node
7324 : sat_short_accum_type_node
;
7325 if (size
== ACCUM_TYPE_SIZE
)
7326 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
7327 if (size
== LONG_ACCUM_TYPE_SIZE
)
7328 return unsignedp
? sat_unsigned_long_accum_type_node
7329 : sat_long_accum_type_node
;
7330 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
7331 return unsignedp
? sat_unsigned_long_long_accum_type_node
7332 : sat_long_long_accum_type_node
;
7336 if (size
== SHORT_ACCUM_TYPE_SIZE
)
7337 return unsignedp
? unsigned_short_accum_type_node
7338 : short_accum_type_node
;
7339 if (size
== ACCUM_TYPE_SIZE
)
7340 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
7341 if (size
== LONG_ACCUM_TYPE_SIZE
)
7342 return unsignedp
? unsigned_long_accum_type_node
7343 : long_accum_type_node
;
7344 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
7345 return unsignedp
? unsigned_long_long_accum_type_node
7346 : long_long_accum_type_node
;
7349 return make_accum_type (size
, unsignedp
, satp
);
7352 /* Create nodes for all integer types (and error_mark_node) using the sizes
7353 of C datatypes. The caller should call set_sizetype soon after calling
7354 this function to select one of the types as sizetype. */
7357 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
7359 error_mark_node
= make_node (ERROR_MARK
);
7360 TREE_TYPE (error_mark_node
) = error_mark_node
;
7362 initialize_sizetypes (signed_sizetype
);
7364 /* Define both `signed char' and `unsigned char'. */
7365 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
7366 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
7367 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
7368 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
7370 /* Define `char', which is like either `signed char' or `unsigned char'
7371 but not the same as either. */
7374 ? make_signed_type (CHAR_TYPE_SIZE
)
7375 : make_unsigned_type (CHAR_TYPE_SIZE
));
7376 TYPE_STRING_FLAG (char_type_node
) = 1;
7378 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
7379 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
7380 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
7381 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
7382 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
7383 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
7384 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
7385 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
7387 /* Define a boolean type. This type only represents boolean values but
7388 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7389 Front ends which want to override this size (i.e. Java) can redefine
7390 boolean_type_node before calling build_common_tree_nodes_2. */
7391 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
7392 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
7393 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
7394 TYPE_PRECISION (boolean_type_node
) = 1;
7396 /* Fill in the rest of the sized types. Reuse existing type nodes
7398 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
7399 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
7400 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
7401 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
7402 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
7404 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
7405 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
7406 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
7407 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
7408 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
7410 access_public_node
= get_identifier ("public");
7411 access_protected_node
= get_identifier ("protected");
7412 access_private_node
= get_identifier ("private");
7415 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7416 It will create several other common tree nodes. */
7419 build_common_tree_nodes_2 (int short_double
)
7421 /* Define these next since types below may used them. */
7422 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
7423 integer_one_node
= build_int_cst (NULL_TREE
, 1);
7424 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
7426 size_zero_node
= size_int (0);
7427 size_one_node
= size_int (1);
7428 bitsize_zero_node
= bitsize_int (0);
7429 bitsize_one_node
= bitsize_int (1);
7430 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
7432 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
7433 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
7435 void_type_node
= make_node (VOID_TYPE
);
7436 layout_type (void_type_node
);
7438 /* We are not going to have real types in C with less than byte alignment,
7439 so we might as well not have any types that claim to have it. */
7440 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
7441 TYPE_USER_ALIGN (void_type_node
) = 0;
7443 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
7444 layout_type (TREE_TYPE (null_pointer_node
));
7446 ptr_type_node
= build_pointer_type (void_type_node
);
7448 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
7449 fileptr_type_node
= ptr_type_node
;
7451 float_type_node
= make_node (REAL_TYPE
);
7452 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
7453 layout_type (float_type_node
);
7455 double_type_node
= make_node (REAL_TYPE
);
7457 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
7459 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
7460 layout_type (double_type_node
);
7462 long_double_type_node
= make_node (REAL_TYPE
);
7463 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
7464 layout_type (long_double_type_node
);
7466 float_ptr_type_node
= build_pointer_type (float_type_node
);
7467 double_ptr_type_node
= build_pointer_type (double_type_node
);
7468 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
7469 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
7471 /* Fixed size integer types. */
7472 uint32_type_node
= build_nonstandard_integer_type (32, true);
7473 uint64_type_node
= build_nonstandard_integer_type (64, true);
7475 /* Decimal float types. */
7476 dfloat32_type_node
= make_node (REAL_TYPE
);
7477 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
7478 layout_type (dfloat32_type_node
);
7479 TYPE_MODE (dfloat32_type_node
) = SDmode
;
7480 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
7482 dfloat64_type_node
= make_node (REAL_TYPE
);
7483 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
7484 layout_type (dfloat64_type_node
);
7485 TYPE_MODE (dfloat64_type_node
) = DDmode
;
7486 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
7488 dfloat128_type_node
= make_node (REAL_TYPE
);
7489 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
7490 layout_type (dfloat128_type_node
);
7491 TYPE_MODE (dfloat128_type_node
) = TDmode
;
7492 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
7494 complex_integer_type_node
= build_complex_type (integer_type_node
);
7495 complex_float_type_node
= build_complex_type (float_type_node
);
7496 complex_double_type_node
= build_complex_type (double_type_node
);
7497 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
7499 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7500 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
7501 sat_ ## KIND ## _type_node = \
7502 make_sat_signed_ ## KIND ## _type (SIZE); \
7503 sat_unsigned_ ## KIND ## _type_node = \
7504 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7505 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7506 unsigned_ ## KIND ## _type_node = \
7507 make_unsigned_ ## KIND ## _type (SIZE);
7509 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
7510 sat_ ## WIDTH ## KIND ## _type_node = \
7511 make_sat_signed_ ## KIND ## _type (SIZE); \
7512 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7513 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7514 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7515 unsigned_ ## WIDTH ## KIND ## _type_node = \
7516 make_unsigned_ ## KIND ## _type (SIZE);
7518 /* Make fixed-point type nodes based on four different widths. */
7519 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7520 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7521 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
7522 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7523 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7525 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7526 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7527 NAME ## _type_node = \
7528 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7529 u ## NAME ## _type_node = \
7530 make_or_reuse_unsigned_ ## KIND ## _type \
7531 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7532 sat_ ## NAME ## _type_node = \
7533 make_or_reuse_sat_signed_ ## KIND ## _type \
7534 (GET_MODE_BITSIZE (MODE ## mode)); \
7535 sat_u ## NAME ## _type_node = \
7536 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7537 (GET_MODE_BITSIZE (U ## MODE ## mode));
7539 /* Fixed-point type and mode nodes. */
7540 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
7541 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
7542 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
7543 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
7544 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
7545 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
7546 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
7547 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
7548 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
7549 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
7550 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
7553 tree t
= targetm
.build_builtin_va_list ();
7555 /* Many back-ends define record types without setting TYPE_NAME.
7556 If we copied the record type here, we'd keep the original
7557 record type without a name. This breaks name mangling. So,
7558 don't copy record types and let c_common_nodes_and_builtins()
7559 declare the type to be __builtin_va_list. */
7560 if (TREE_CODE (t
) != RECORD_TYPE
)
7561 t
= build_variant_type_copy (t
);
7563 va_list_type_node
= t
;
7567 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7570 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
7571 const char *library_name
, int ecf_flags
)
7575 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
7576 library_name
, NULL_TREE
);
7577 if (ecf_flags
& ECF_CONST
)
7578 TREE_READONLY (decl
) = 1;
7579 if (ecf_flags
& ECF_PURE
)
7580 DECL_PURE_P (decl
) = 1;
7581 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
7582 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
7583 if (ecf_flags
& ECF_NORETURN
)
7584 TREE_THIS_VOLATILE (decl
) = 1;
7585 if (ecf_flags
& ECF_NOTHROW
)
7586 TREE_NOTHROW (decl
) = 1;
7587 if (ecf_flags
& ECF_MALLOC
)
7588 DECL_IS_MALLOC (decl
) = 1;
7590 built_in_decls
[code
] = decl
;
7591 implicit_built_in_decls
[code
] = decl
;
7594 /* Call this function after instantiating all builtins that the language
7595 front end cares about. This will build the rest of the builtins that
7596 are relied upon by the tree optimizers and the middle-end. */
7599 build_common_builtin_nodes (void)
7603 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
7604 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7606 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7607 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7608 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7609 ftype
= build_function_type (ptr_type_node
, tmp
);
7611 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
7612 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
7613 "memcpy", ECF_NOTHROW
);
7614 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7615 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
7616 "memmove", ECF_NOTHROW
);
7619 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
7621 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7622 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7623 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7624 ftype
= build_function_type (integer_type_node
, tmp
);
7625 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
7626 "memcmp", ECF_PURE
| ECF_NOTHROW
);
7629 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
7631 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7632 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
7633 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7634 ftype
= build_function_type (ptr_type_node
, tmp
);
7635 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
7636 "memset", ECF_NOTHROW
);
7639 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
7641 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7642 ftype
= build_function_type (ptr_type_node
, tmp
);
7643 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
7644 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
7647 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7648 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7649 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7650 ftype
= build_function_type (void_type_node
, tmp
);
7651 local_define_builtin ("__builtin_init_trampoline", ftype
,
7652 BUILT_IN_INIT_TRAMPOLINE
,
7653 "__builtin_init_trampoline", ECF_NOTHROW
);
7655 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7656 ftype
= build_function_type (ptr_type_node
, tmp
);
7657 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
7658 BUILT_IN_ADJUST_TRAMPOLINE
,
7659 "__builtin_adjust_trampoline",
7660 ECF_CONST
| ECF_NOTHROW
);
7662 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7663 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7664 ftype
= build_function_type (void_type_node
, tmp
);
7665 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
7666 BUILT_IN_NONLOCAL_GOTO
,
7667 "__builtin_nonlocal_goto",
7668 ECF_NORETURN
| ECF_NOTHROW
);
7670 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7671 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7672 ftype
= build_function_type (void_type_node
, tmp
);
7673 local_define_builtin ("__builtin_setjmp_setup", ftype
,
7674 BUILT_IN_SETJMP_SETUP
,
7675 "__builtin_setjmp_setup", ECF_NOTHROW
);
7677 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7678 ftype
= build_function_type (ptr_type_node
, tmp
);
7679 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
7680 BUILT_IN_SETJMP_DISPATCHER
,
7681 "__builtin_setjmp_dispatcher",
7682 ECF_PURE
| ECF_NOTHROW
);
7684 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7685 ftype
= build_function_type (void_type_node
, tmp
);
7686 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
7687 BUILT_IN_SETJMP_RECEIVER
,
7688 "__builtin_setjmp_receiver", ECF_NOTHROW
);
7690 ftype
= build_function_type (ptr_type_node
, void_list_node
);
7691 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
7692 "__builtin_stack_save", ECF_NOTHROW
);
7694 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7695 ftype
= build_function_type (void_type_node
, tmp
);
7696 local_define_builtin ("__builtin_stack_restore", ftype
,
7697 BUILT_IN_STACK_RESTORE
,
7698 "__builtin_stack_restore", ECF_NOTHROW
);
7700 ftype
= build_function_type (void_type_node
, void_list_node
);
7701 local_define_builtin ("__builtin_profile_func_enter", ftype
,
7702 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
7703 local_define_builtin ("__builtin_profile_func_exit", ftype
,
7704 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
7706 /* Complex multiplication and division. These are handled as builtins
7707 rather than optabs because emit_library_call_value doesn't support
7708 complex. Further, we can do slightly better with folding these
7709 beasties if the real and complex parts of the arguments are separate. */
7711 enum machine_mode mode
;
7713 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
7715 char mode_name_buf
[4], *q
;
7717 enum built_in_function mcode
, dcode
;
7718 tree type
, inner_type
;
7720 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
7723 inner_type
= TREE_TYPE (type
);
7725 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
7726 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7727 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7728 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7729 ftype
= build_function_type (type
, tmp
);
7731 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7732 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7734 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
7738 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
7739 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
7740 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
7742 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
7743 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
7744 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
7749 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7752 If we requested a pointer to a vector, build up the pointers that
7753 we stripped off while looking for the inner type. Similarly for
7754 return values from functions.
7756 The argument TYPE is the top of the chain, and BOTTOM is the
7757 new type which we will point to. */
7760 reconstruct_complex_type (tree type
, tree bottom
)
7764 if (TREE_CODE (type
) == POINTER_TYPE
)
7766 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7767 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
7768 TYPE_REF_CAN_ALIAS_ALL (type
));
7770 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
7772 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7773 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
7774 TYPE_REF_CAN_ALIAS_ALL (type
));
7776 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7778 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7779 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
7781 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
7783 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7784 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
7786 else if (TREE_CODE (type
) == METHOD_TYPE
)
7788 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7789 /* The build_method_type_directly() routine prepends 'this' to argument list,
7790 so we must compensate by getting rid of it. */
7792 = build_method_type_directly
7793 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
7795 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
7797 else if (TREE_CODE (type
) == OFFSET_TYPE
)
7799 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7800 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
7805 return build_qualified_type (outer
, TYPE_QUALS (type
));
7808 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7811 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
7815 switch (GET_MODE_CLASS (mode
))
7817 case MODE_VECTOR_INT
:
7818 case MODE_VECTOR_FLOAT
:
7819 case MODE_VECTOR_FRACT
:
7820 case MODE_VECTOR_UFRACT
:
7821 case MODE_VECTOR_ACCUM
:
7822 case MODE_VECTOR_UACCUM
:
7823 nunits
= GET_MODE_NUNITS (mode
);
7827 /* Check that there are no leftover bits. */
7828 gcc_assert (GET_MODE_BITSIZE (mode
)
7829 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
7831 nunits
= GET_MODE_BITSIZE (mode
)
7832 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
7839 return make_vector_type (innertype
, nunits
, mode
);
7842 /* Similarly, but takes the inner type and number of units, which must be
7846 build_vector_type (tree innertype
, int nunits
)
7848 return make_vector_type (innertype
, nunits
, VOIDmode
);
7852 /* Build RESX_EXPR with given REGION_NUMBER. */
7854 build_resx (int region_number
)
7857 t
= build1 (RESX_EXPR
, void_type_node
,
7858 build_int_cst (NULL_TREE
, region_number
));
7862 /* Given an initializer INIT, return TRUE if INIT is zero or some
7863 aggregate of zeros. Otherwise return FALSE. */
7865 initializer_zerop (const_tree init
)
7871 switch (TREE_CODE (init
))
7874 return integer_zerop (init
);
7877 /* ??? Note that this is not correct for C4X float formats. There,
7878 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7879 negative exponent. */
7880 return real_zerop (init
)
7881 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
7884 return fixed_zerop (init
);
7887 return integer_zerop (init
)
7888 || (real_zerop (init
)
7889 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
7890 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
7893 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
7894 if (!initializer_zerop (TREE_VALUE (elt
)))
7900 unsigned HOST_WIDE_INT idx
;
7902 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
7903 if (!initializer_zerop (elt
))
7913 /* Build an empty statement. */
7916 build_empty_stmt (void)
7918 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
7922 /* Build an OpenMP clause with code CODE. */
7925 build_omp_clause (enum omp_clause_code code
)
7930 length
= omp_clause_num_ops
[code
];
7931 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
7933 t
= GGC_NEWVAR (union tree_node
, size
);
7934 memset (t
, 0, size
);
7935 TREE_SET_CODE (t
, OMP_CLAUSE
);
7936 OMP_CLAUSE_SET_CODE (t
, code
);
7938 #ifdef GATHER_STATISTICS
7939 tree_node_counts
[(int) omp_clause_kind
]++;
7940 tree_node_sizes
[(int) omp_clause_kind
] += size
;
7946 /* Set various status flags when building a CALL_EXPR object T. */
7949 process_call_operands (tree t
)
7953 side_effects
= TREE_SIDE_EFFECTS (t
);
7957 n
= TREE_OPERAND_LENGTH (t
);
7958 for (i
= 1; i
< n
; i
++)
7960 tree op
= TREE_OPERAND (t
, i
);
7961 if (op
&& TREE_SIDE_EFFECTS (op
))
7972 /* Calls have side-effects, except those to const or
7974 i
= call_expr_flags (t
);
7975 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
7978 TREE_SIDE_EFFECTS (t
) = side_effects
;
7981 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7982 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7983 Except for the CODE and operand count field, other storage for the
7984 object is initialized to zeros. */
7987 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
7990 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
7992 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
7993 gcc_assert (len
>= 1);
7995 #ifdef GATHER_STATISTICS
7996 tree_node_counts
[(int) e_kind
]++;
7997 tree_node_sizes
[(int) e_kind
] += length
;
8000 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
8002 memset (t
, 0, length
);
8004 TREE_SET_CODE (t
, code
);
8006 /* Can't use TREE_OPERAND to store the length because if checking is
8007 enabled, it will try to check the length before we store it. :-P */
8008 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
8014 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
8015 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
8019 build_call_list (tree return_type
, tree fn
, tree arglist
)
8024 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
8025 TREE_TYPE (t
) = return_type
;
8026 CALL_EXPR_FN (t
) = fn
;
8027 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
8028 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
8029 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
8030 process_call_operands (t
);
8034 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8035 FN and a null static chain slot. NARGS is the number of call arguments
8036 which are specified as "..." arguments. */
8039 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
8043 va_start (args
, nargs
);
8044 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
8049 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8050 FN and a null static chain slot. NARGS is the number of call arguments
8051 which are specified as a va_list ARGS. */
8054 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
8059 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
8060 TREE_TYPE (t
) = return_type
;
8061 CALL_EXPR_FN (t
) = fn
;
8062 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
8063 for (i
= 0; i
< nargs
; i
++)
8064 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
8065 process_call_operands (t
);
8069 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8070 FN and a null static chain slot. NARGS is the number of call arguments
8071 which are specified as a tree array ARGS. */
8074 build_call_array (tree return_type
, tree fn
, int nargs
, tree
*args
)
8079 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
8080 TREE_TYPE (t
) = return_type
;
8081 CALL_EXPR_FN (t
) = fn
;
8082 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
8083 for (i
= 0; i
< nargs
; i
++)
8084 CALL_EXPR_ARG (t
, i
) = args
[i
];
8085 process_call_operands (t
);
8090 /* Returns true if it is possible to prove that the index of
8091 an array access REF (an ARRAY_REF expression) falls into the
8095 in_array_bounds_p (tree ref
)
8097 tree idx
= TREE_OPERAND (ref
, 1);
8100 if (TREE_CODE (idx
) != INTEGER_CST
)
8103 min
= array_ref_low_bound (ref
);
8104 max
= array_ref_up_bound (ref
);
8107 || TREE_CODE (min
) != INTEGER_CST
8108 || TREE_CODE (max
) != INTEGER_CST
)
8111 if (tree_int_cst_lt (idx
, min
)
8112 || tree_int_cst_lt (max
, idx
))
8118 /* Returns true if it is possible to prove that the range of
8119 an array access REF (an ARRAY_RANGE_REF expression) falls
8120 into the array bounds. */
8123 range_in_array_bounds_p (tree ref
)
8125 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
8126 tree range_min
, range_max
, min
, max
;
8128 range_min
= TYPE_MIN_VALUE (domain_type
);
8129 range_max
= TYPE_MAX_VALUE (domain_type
);
8132 || TREE_CODE (range_min
) != INTEGER_CST
8133 || TREE_CODE (range_max
) != INTEGER_CST
)
8136 min
= array_ref_low_bound (ref
);
8137 max
= array_ref_up_bound (ref
);
8140 || TREE_CODE (min
) != INTEGER_CST
8141 || TREE_CODE (max
) != INTEGER_CST
)
8144 if (tree_int_cst_lt (range_min
, min
)
8145 || tree_int_cst_lt (max
, range_max
))
8151 /* Return true if T (assumed to be a DECL) must be assigned a memory
8155 needs_to_live_in_memory (const_tree t
)
8157 if (TREE_CODE (t
) == SSA_NAME
)
8158 t
= SSA_NAME_VAR (t
);
8160 return (TREE_ADDRESSABLE (t
)
8161 || is_global_var (t
)
8162 || (TREE_CODE (t
) == RESULT_DECL
8163 && aggregate_value_p (t
, current_function_decl
)));
8166 /* There are situations in which a language considers record types
8167 compatible which have different field lists. Decide if two fields
8168 are compatible. It is assumed that the parent records are compatible. */
8171 fields_compatible_p (const_tree f1
, const_tree f2
)
8173 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
8174 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
8177 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
8178 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
8181 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
8187 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8190 find_compatible_field (tree record
, tree orig_field
)
8194 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
8195 if (TREE_CODE (f
) == FIELD_DECL
8196 && fields_compatible_p (f
, orig_field
))
8199 /* ??? Why isn't this on the main fields list? */
8200 f
= TYPE_VFIELD (record
);
8201 if (f
&& TREE_CODE (f
) == FIELD_DECL
8202 && fields_compatible_p (f
, orig_field
))
8205 /* ??? We should abort here, but Java appears to do Bad Things
8206 with inherited fields. */
8210 /* Return value of a constant X and sign-extend it. */
8213 int_cst_value (const_tree x
)
8215 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
8216 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
8218 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8219 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
8220 || TREE_INT_CST_HIGH (x
) == -1);
8222 if (bits
< HOST_BITS_PER_WIDE_INT
)
8224 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
8226 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
8228 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
8234 /* If TYPE is an integral type, return an equivalent type which is
8235 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8236 return TYPE itself. */
8239 signed_or_unsigned_type_for (int unsignedp
, tree type
)
8242 if (POINTER_TYPE_P (type
))
8245 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
8248 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
8251 /* Returns unsigned variant of TYPE. */
8254 unsigned_type_for (tree type
)
8256 return signed_or_unsigned_type_for (1, type
);
8259 /* Returns signed variant of TYPE. */
8262 signed_type_for (tree type
)
8264 return signed_or_unsigned_type_for (0, type
);
8267 /* Returns the largest value obtainable by casting something in INNER type to
8271 upper_bound_in_type (tree outer
, tree inner
)
8273 unsigned HOST_WIDE_INT lo
, hi
;
8274 unsigned int det
= 0;
8275 unsigned oprec
= TYPE_PRECISION (outer
);
8276 unsigned iprec
= TYPE_PRECISION (inner
);
8279 /* Compute a unique number for every combination. */
8280 det
|= (oprec
> iprec
) ? 4 : 0;
8281 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
8282 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
8284 /* Determine the exponent to use. */
8289 /* oprec <= iprec, outer: signed, inner: don't care. */
8294 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8298 /* oprec > iprec, outer: signed, inner: signed. */
8302 /* oprec > iprec, outer: signed, inner: unsigned. */
8306 /* oprec > iprec, outer: unsigned, inner: signed. */
8310 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8317 /* Compute 2^^prec - 1. */
8318 if (prec
<= HOST_BITS_PER_WIDE_INT
)
8321 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
8322 >> (HOST_BITS_PER_WIDE_INT
- prec
));
8326 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
8327 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
8328 lo
= ~(unsigned HOST_WIDE_INT
) 0;
8331 return build_int_cst_wide (outer
, lo
, hi
);
8334 /* Returns the smallest value obtainable by casting something in INNER type to
8338 lower_bound_in_type (tree outer
, tree inner
)
8340 unsigned HOST_WIDE_INT lo
, hi
;
8341 unsigned oprec
= TYPE_PRECISION (outer
);
8342 unsigned iprec
= TYPE_PRECISION (inner
);
8344 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8346 if (TYPE_UNSIGNED (outer
)
8347 /* If we are widening something of an unsigned type, OUTER type
8348 contains all values of INNER type. In particular, both INNER
8349 and OUTER types have zero in common. */
8350 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
8354 /* If we are widening a signed type to another signed type, we
8355 want to obtain -2^^(iprec-1). If we are keeping the
8356 precision or narrowing to a signed type, we want to obtain
8358 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
8360 if (prec
<= HOST_BITS_PER_WIDE_INT
)
8362 hi
= ~(unsigned HOST_WIDE_INT
) 0;
8363 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
8367 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
8368 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
8373 return build_int_cst_wide (outer
, lo
, hi
);
8376 /* Return nonzero if two operands that are suitable for PHI nodes are
8377 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8378 SSA_NAME or invariant. Note that this is strictly an optimization.
8379 That is, callers of this function can directly call operand_equal_p
8380 and get the same result, only slower. */
8383 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
8387 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
8389 return operand_equal_p (arg0
, arg1
, 0);
8392 /* Returns number of zeros at the end of binary representation of X.
8394 ??? Use ffs if available? */
8397 num_ending_zeros (const_tree x
)
8399 unsigned HOST_WIDE_INT fr
, nfr
;
8400 unsigned num
, abits
;
8401 tree type
= TREE_TYPE (x
);
8403 if (TREE_INT_CST_LOW (x
) == 0)
8405 num
= HOST_BITS_PER_WIDE_INT
;
8406 fr
= TREE_INT_CST_HIGH (x
);
8411 fr
= TREE_INT_CST_LOW (x
);
8414 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
8417 if (nfr
<< abits
== fr
)
8424 if (num
> TYPE_PRECISION (type
))
8425 num
= TYPE_PRECISION (type
);
8427 return build_int_cst_type (type
, num
);
8431 #define WALK_SUBTREE(NODE) \
8434 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8440 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8441 be walked whenever a type is seen in the tree. Rest of operands and return
8442 value are as for walk_tree. */
8445 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
8446 struct pointer_set_t
*pset
, walk_tree_lh lh
)
8448 tree result
= NULL_TREE
;
8450 switch (TREE_CODE (type
))
8453 case REFERENCE_TYPE
:
8454 /* We have to worry about mutually recursive pointers. These can't
8455 be written in C. They can in Ada. It's pathological, but
8456 there's an ACATS test (c38102a) that checks it. Deal with this
8457 by checking if we're pointing to another pointer, that one
8458 points to another pointer, that one does too, and we have no htab.
8459 If so, get a hash table. We check three levels deep to avoid
8460 the cost of the hash table if we don't need one. */
8461 if (POINTER_TYPE_P (TREE_TYPE (type
))
8462 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
8463 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
8466 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
8474 /* ... fall through ... */
8477 WALK_SUBTREE (TREE_TYPE (type
));
8481 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
8486 WALK_SUBTREE (TREE_TYPE (type
));
8490 /* We never want to walk into default arguments. */
8491 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
8492 WALK_SUBTREE (TREE_VALUE (arg
));
8497 /* Don't follow this nodes's type if a pointer for fear that
8498 we'll have infinite recursion. If we have a PSET, then we
8501 || (!POINTER_TYPE_P (TREE_TYPE (type
))
8502 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
8503 WALK_SUBTREE (TREE_TYPE (type
));
8504 WALK_SUBTREE (TYPE_DOMAIN (type
));
8508 WALK_SUBTREE (TREE_TYPE (type
));
8509 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
8519 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8520 called with the DATA and the address of each sub-tree. If FUNC returns a
8521 non-NULL value, the traversal is stopped, and the value returned by FUNC
8522 is returned. If PSET is non-NULL it is used to record the nodes visited,
8523 and to avoid visiting a node more than once. */
8526 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
8527 struct pointer_set_t
*pset
, walk_tree_lh lh
)
8529 enum tree_code code
;
8533 #define WALK_SUBTREE_TAIL(NODE) \
8537 goto tail_recurse; \
8542 /* Skip empty subtrees. */
8546 /* Don't walk the same tree twice, if the user has requested
8547 that we avoid doing so. */
8548 if (pset
&& pointer_set_insert (pset
, *tp
))
8551 /* Call the function. */
8553 result
= (*func
) (tp
, &walk_subtrees
, data
);
8555 /* If we found something, return it. */
8559 code
= TREE_CODE (*tp
);
8561 /* Even if we didn't, FUNC may have decided that there was nothing
8562 interesting below this point in the tree. */
8565 /* But we still need to check our siblings. */
8566 if (code
== TREE_LIST
)
8567 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
8568 else if (code
== OMP_CLAUSE
)
8569 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8576 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
8577 if (result
|| !walk_subtrees
)
8584 case IDENTIFIER_NODE
:
8591 case PLACEHOLDER_EXPR
:
8595 /* None of these have subtrees other than those already walked
8600 WALK_SUBTREE (TREE_VALUE (*tp
));
8601 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
8606 int len
= TREE_VEC_LENGTH (*tp
);
8611 /* Walk all elements but the first. */
8613 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
8615 /* Now walk the first one as a tail call. */
8616 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
8620 WALK_SUBTREE (TREE_REALPART (*tp
));
8621 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
8625 unsigned HOST_WIDE_INT idx
;
8626 constructor_elt
*ce
;
8629 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
8631 WALK_SUBTREE (ce
->value
);
8636 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
8641 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
8643 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8644 into declarations that are just mentioned, rather than
8645 declared; they don't really belong to this part of the tree.
8646 And, we can see cycles: the initializer for a declaration
8647 can refer to the declaration itself. */
8648 WALK_SUBTREE (DECL_INITIAL (decl
));
8649 WALK_SUBTREE (DECL_SIZE (decl
));
8650 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
8652 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
8655 case STATEMENT_LIST
:
8657 tree_stmt_iterator i
;
8658 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
8659 WALK_SUBTREE (*tsi_stmt_ptr (i
));
8664 switch (OMP_CLAUSE_CODE (*tp
))
8666 case OMP_CLAUSE_PRIVATE
:
8667 case OMP_CLAUSE_SHARED
:
8668 case OMP_CLAUSE_FIRSTPRIVATE
:
8669 case OMP_CLAUSE_COPYIN
:
8670 case OMP_CLAUSE_COPYPRIVATE
:
8672 case OMP_CLAUSE_NUM_THREADS
:
8673 case OMP_CLAUSE_SCHEDULE
:
8674 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
8677 case OMP_CLAUSE_NOWAIT
:
8678 case OMP_CLAUSE_ORDERED
:
8679 case OMP_CLAUSE_DEFAULT
:
8680 case OMP_CLAUSE_UNTIED
:
8681 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8683 case OMP_CLAUSE_LASTPRIVATE
:
8684 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
8685 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
8686 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8688 case OMP_CLAUSE_COLLAPSE
:
8691 for (i
= 0; i
< 3; i
++)
8692 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
8693 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8696 case OMP_CLAUSE_REDUCTION
:
8699 for (i
= 0; i
< 4; i
++)
8700 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
8701 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8713 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8714 But, we only want to walk once. */
8715 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
8716 for (i
= 0; i
< len
; ++i
)
8717 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
8718 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
8721 case CHANGE_DYNAMIC_TYPE_EXPR
:
8722 WALK_SUBTREE (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*tp
));
8723 WALK_SUBTREE_TAIL (CHANGE_DYNAMIC_TYPE_LOCATION (*tp
));
8726 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8727 defining. We only want to walk into these fields of a type in this
8728 case and not in the general case of a mere reference to the type.
8730 The criterion is as follows: if the field can be an expression, it
8731 must be walked only here. This should be in keeping with the fields
8732 that are directly gimplified in gimplify_type_sizes in order for the
8733 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8734 variable-sized types.
8736 Note that DECLs get walked as part of processing the BIND_EXPR. */
8737 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
8739 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
8740 if (TREE_CODE (*type_p
) == ERROR_MARK
)
8743 /* Call the function for the type. See if it returns anything or
8744 doesn't want us to continue. If we are to continue, walk both
8745 the normal fields and those for the declaration case. */
8746 result
= (*func
) (type_p
, &walk_subtrees
, data
);
8747 if (result
|| !walk_subtrees
)
8750 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
8754 /* If this is a record type, also walk the fields. */
8755 if (TREE_CODE (*type_p
) == RECORD_TYPE
8756 || TREE_CODE (*type_p
) == UNION_TYPE
8757 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8761 for (field
= TYPE_FIELDS (*type_p
); field
;
8762 field
= TREE_CHAIN (field
))
8764 /* We'd like to look at the type of the field, but we can
8765 easily get infinite recursion. So assume it's pointed
8766 to elsewhere in the tree. Also, ignore things that
8768 if (TREE_CODE (field
) != FIELD_DECL
)
8771 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
8772 WALK_SUBTREE (DECL_SIZE (field
));
8773 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
8774 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8775 WALK_SUBTREE (DECL_QUALIFIER (field
));
8779 /* Same for scalar types. */
8780 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
8781 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
8782 || TREE_CODE (*type_p
) == INTEGER_TYPE
8783 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
8784 || TREE_CODE (*type_p
) == REAL_TYPE
)
8786 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
8787 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
8790 WALK_SUBTREE (TYPE_SIZE (*type_p
));
8791 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
8796 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
8800 /* Walk over all the sub-trees of this operand. */
8801 len
= TREE_OPERAND_LENGTH (*tp
);
8803 /* Go through the subtrees. We need to do this in forward order so
8804 that the scope of a FOR_EXPR is handled properly. */
8807 for (i
= 0; i
< len
- 1; ++i
)
8808 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
8809 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
8812 /* If this is a type, walk the needed fields in the type. */
8813 else if (TYPE_P (*tp
))
8814 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
8818 /* We didn't find what we were looking for. */
8821 #undef WALK_SUBTREE_TAIL
8825 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8828 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
8832 struct pointer_set_t
*pset
;
8834 pset
= pointer_set_create ();
8835 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
8836 pointer_set_destroy (pset
);
8844 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
8846 if (IS_EXPR_CODE_CLASS (c
))
8847 return &t
->exp
.block
;
8852 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8853 FIXME: don't use this function. It exists for compatibility with
8854 the old representation of CALL_EXPRs where a list was used to hold the
8855 arguments. Places that currently extract the arglist from a CALL_EXPR
8856 ought to be rewritten to use the CALL_EXPR itself. */
8858 call_expr_arglist (tree exp
)
8860 tree arglist
= NULL_TREE
;
8862 for (i
= call_expr_nargs (exp
) - 1; i
>= 0; i
--)
8863 arglist
= tree_cons (NULL_TREE
, CALL_EXPR_ARG (exp
, i
), arglist
);
8868 /* Create a nameless artificial label and put it in the current function
8869 context. Returns the newly created label. */
8872 create_artificial_label (void)
8874 tree lab
= build_decl (LABEL_DECL
, NULL_TREE
, void_type_node
);
8876 DECL_ARTIFICIAL (lab
) = 1;
8877 DECL_IGNORED_P (lab
) = 1;
8878 DECL_CONTEXT (lab
) = current_function_decl
;
8882 /* Given a tree, try to return a useful variable name that we can use
8883 to prefix a temporary that is being assigned the value of the tree.
8884 I.E. given <temp> = &A, return A. */
8892 STRIP_NOPS (stripped_decl
);
8893 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
8894 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
8897 switch (TREE_CODE (stripped_decl
))
8900 return get_name (TREE_OPERAND (stripped_decl
, 0));
8907 /* Return true if TYPE has a variable argument list. */
8910 stdarg_p (tree fntype
)
8912 function_args_iterator args_iter
;
8913 tree n
= NULL_TREE
, t
;
8918 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
8923 return n
!= NULL_TREE
&& n
!= void_type_node
;
8926 /* Return true if TYPE has a prototype. */
8929 prototype_p (tree fntype
)
8933 gcc_assert (fntype
!= NULL_TREE
);
8935 t
= TYPE_ARG_TYPES (fntype
);
8936 return (t
!= NULL_TREE
);
8939 /* Return the number of arguments that a function has. */
8942 function_args_count (tree fntype
)
8944 function_args_iterator args_iter
;
8950 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
8959 /* If BLOCK is inlined from an __attribute__((__artificial__))
8960 routine, return pointer to location from where it has been
8963 block_nonartificial_location (tree block
)
8965 location_t
*ret
= NULL
;
8967 while (block
&& TREE_CODE (block
) == BLOCK
8968 && BLOCK_ABSTRACT_ORIGIN (block
))
8970 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
8972 while (TREE_CODE (ao
) == BLOCK
8973 && BLOCK_ABSTRACT_ORIGIN (ao
)
8974 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
8975 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
8977 if (TREE_CODE (ao
) == FUNCTION_DECL
)
8979 /* If AO is an artificial inline, point RET to the
8980 call site locus at which it has been inlined and continue
8981 the loop, in case AO's caller is also an artificial
8983 if (DECL_DECLARED_INLINE_P (ao
)
8984 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
8985 ret
= &BLOCK_SOURCE_LOCATION (block
);
8989 else if (TREE_CODE (ao
) != BLOCK
)
8992 block
= BLOCK_SUPERCONTEXT (block
);
8997 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
9000 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
9003 cl_option_hash_hash (const void *x
)
9005 const_tree
const t
= (const_tree
) x
;
9011 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
9013 p
= (const char *)TREE_OPTIMIZATION (t
);
9014 len
= sizeof (struct cl_optimization
);
9017 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
9019 p
= (const char *)TREE_TARGET_OPTION (t
);
9020 len
= sizeof (struct cl_target_option
);
9026 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
9028 for (i
= 0; i
< len
; i
++)
9030 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
9035 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
9036 TARGET_OPTION tree node) is the same as that given by *Y, which is the
9040 cl_option_hash_eq (const void *x
, const void *y
)
9042 const_tree
const xt
= (const_tree
) x
;
9043 const_tree
const yt
= (const_tree
) y
;
9048 if (TREE_CODE (xt
) != TREE_CODE (yt
))
9051 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
9053 xp
= (const char *)TREE_OPTIMIZATION (xt
);
9054 yp
= (const char *)TREE_OPTIMIZATION (yt
);
9055 len
= sizeof (struct cl_optimization
);
9058 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
9060 xp
= (const char *)TREE_TARGET_OPTION (xt
);
9061 yp
= (const char *)TREE_TARGET_OPTION (yt
);
9062 len
= sizeof (struct cl_target_option
);
9068 return (memcmp (xp
, yp
, len
) == 0);
9071 /* Build an OPTIMIZATION_NODE based on the current options. */
9074 build_optimization_node (void)
9079 /* Use the cache of optimization nodes. */
9081 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
));
9083 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
9087 /* Insert this one into the hash table. */
9088 t
= cl_optimization_node
;
9091 /* Make a new node for next time round. */
9092 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
9098 /* Build a TARGET_OPTION_NODE based on the current options. */
9101 build_target_option_node (void)
9106 /* Use the cache of optimization nodes. */
9108 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
));
9110 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
9114 /* Insert this one into the hash table. */
9115 t
= cl_target_option_node
;
9118 /* Make a new node for next time round. */
9119 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
9125 #include "gt-tree.h"