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;
347 lang_hooks
.init_ts ();
351 /* The name of the object as the assembler will see it (but before any
352 translations made by ASM_OUTPUT_LABELREF). Often this is the same
353 as DECL_NAME. It is an IDENTIFIER_NODE. */
355 decl_assembler_name (tree decl
)
357 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
358 lang_hooks
.set_decl_assembler_name (decl
);
359 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
362 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
365 decl_assembler_name_equal (tree decl
, const_tree asmname
)
367 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
368 const char *decl_str
;
369 const char *asmname_str
;
372 if (decl_asmname
== asmname
)
375 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
376 asmname_str
= IDENTIFIER_POINTER (asmname
);
379 /* If the target assembler name was set by the user, things are trickier.
380 We have a leading '*' to begin with. After that, it's arguable what
381 is the correct thing to do with -fleading-underscore. Arguably, we've
382 historically been doing the wrong thing in assemble_alias by always
383 printing the leading underscore. Since we're not changing that, make
384 sure user_label_prefix follows the '*' before matching. */
385 if (decl_str
[0] == '*')
387 size_t ulp_len
= strlen (user_label_prefix
);
393 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
394 decl_str
+= ulp_len
, test
=true;
398 if (asmname_str
[0] == '*')
400 size_t ulp_len
= strlen (user_label_prefix
);
406 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
407 asmname_str
+= ulp_len
, test
=true;
414 return strcmp (decl_str
, asmname_str
) == 0;
417 /* Hash asmnames ignoring the user specified marks. */
420 decl_assembler_name_hash (const_tree asmname
)
422 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
424 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
425 size_t ulp_len
= strlen (user_label_prefix
);
429 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
432 return htab_hash_string (decl_str
);
435 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
438 /* Compute the number of bytes occupied by a tree with code CODE.
439 This function cannot be used for nodes that have variable sizes,
440 including TREE_VEC, STRING_CST, and CALL_EXPR. */
442 tree_code_size (enum tree_code code
)
444 switch (TREE_CODE_CLASS (code
))
446 case tcc_declaration
: /* A decl node */
451 return sizeof (struct tree_field_decl
);
453 return sizeof (struct tree_parm_decl
);
455 return sizeof (struct tree_var_decl
);
457 return sizeof (struct tree_label_decl
);
459 return sizeof (struct tree_result_decl
);
461 return sizeof (struct tree_const_decl
);
463 return sizeof (struct tree_type_decl
);
465 return sizeof (struct tree_function_decl
);
466 case NAME_MEMORY_TAG
:
467 case SYMBOL_MEMORY_TAG
:
468 return sizeof (struct tree_memory_tag
);
469 case MEMORY_PARTITION_TAG
:
470 return sizeof (struct tree_memory_partition_tag
);
472 return sizeof (struct tree_decl_non_common
);
476 case tcc_type
: /* a type node */
477 return sizeof (struct tree_type
);
479 case tcc_reference
: /* a reference */
480 case tcc_expression
: /* an expression */
481 case tcc_statement
: /* an expression with side effects */
482 case tcc_comparison
: /* a comparison expression */
483 case tcc_unary
: /* a unary arithmetic expression */
484 case tcc_binary
: /* a binary arithmetic expression */
485 return (sizeof (struct tree_exp
)
486 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
488 case tcc_constant
: /* a constant */
491 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
492 case REAL_CST
: return sizeof (struct tree_real_cst
);
493 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
494 case COMPLEX_CST
: return sizeof (struct tree_complex
);
495 case VECTOR_CST
: return sizeof (struct tree_vector
);
496 case STRING_CST
: gcc_unreachable ();
498 return lang_hooks
.tree_size (code
);
501 case tcc_exceptional
: /* something random, like an identifier. */
504 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
505 case TREE_LIST
: return sizeof (struct tree_list
);
508 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
511 case OMP_CLAUSE
: gcc_unreachable ();
513 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
515 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
516 case BLOCK
: return sizeof (struct tree_block
);
517 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
518 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
519 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
522 return lang_hooks
.tree_size (code
);
530 /* Compute the number of bytes occupied by NODE. This routine only
531 looks at TREE_CODE, except for those nodes that have variable sizes. */
533 tree_size (const_tree node
)
535 const enum tree_code code
= TREE_CODE (node
);
539 return (offsetof (struct tree_binfo
, base_binfos
)
540 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
543 return (sizeof (struct tree_vec
)
544 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
547 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
550 return (sizeof (struct tree_omp_clause
)
551 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
555 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
556 return (sizeof (struct tree_exp
)
557 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
559 return tree_code_size (code
);
563 /* Return a newly allocated node of code CODE. For decl and type
564 nodes, some other fields are initialized. The rest of the node is
565 initialized to zero. This function cannot be used for TREE_VEC or
566 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
568 Achoo! I got a code in the node. */
571 make_node_stat (enum tree_code code MEM_STAT_DECL
)
574 enum tree_code_class type
= TREE_CODE_CLASS (code
);
575 size_t length
= tree_code_size (code
);
576 #ifdef GATHER_STATISTICS
581 case tcc_declaration
: /* A decl node */
585 case tcc_type
: /* a type node */
589 case tcc_statement
: /* an expression with side effects */
593 case tcc_reference
: /* a reference */
597 case tcc_expression
: /* an expression */
598 case tcc_comparison
: /* a comparison expression */
599 case tcc_unary
: /* a unary arithmetic expression */
600 case tcc_binary
: /* a binary arithmetic expression */
604 case tcc_constant
: /* a constant */
608 case tcc_exceptional
: /* something random, like an identifier. */
611 case IDENTIFIER_NODE
:
624 kind
= ssa_name_kind
;
645 tree_node_counts
[(int) kind
]++;
646 tree_node_sizes
[(int) kind
] += length
;
649 if (code
== IDENTIFIER_NODE
)
650 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
652 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
654 memset (t
, 0, length
);
656 TREE_SET_CODE (t
, code
);
661 TREE_SIDE_EFFECTS (t
) = 1;
664 case tcc_declaration
:
665 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
667 if (code
== FUNCTION_DECL
)
669 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
670 DECL_MODE (t
) = FUNCTION_MODE
;
674 /* We have not yet computed the alias set for this declaration. */
675 DECL_POINTER_ALIAS_SET (t
) = -1;
677 DECL_SOURCE_LOCATION (t
) = input_location
;
678 DECL_UID (t
) = next_decl_uid
++;
683 TYPE_UID (t
) = next_type_uid
++;
684 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
685 TYPE_USER_ALIGN (t
) = 0;
686 TYPE_MAIN_VARIANT (t
) = t
;
687 TYPE_CANONICAL (t
) = t
;
689 /* Default to no attributes for type, but let target change that. */
690 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
691 targetm
.set_default_type_attributes (t
);
693 /* We have not yet computed the alias set for this type. */
694 TYPE_ALIAS_SET (t
) = -1;
698 TREE_CONSTANT (t
) = 1;
707 case PREDECREMENT_EXPR
:
708 case PREINCREMENT_EXPR
:
709 case POSTDECREMENT_EXPR
:
710 case POSTINCREMENT_EXPR
:
711 /* All of these have side-effects, no matter what their
713 TREE_SIDE_EFFECTS (t
) = 1;
722 /* Other classes need no special treatment. */
729 /* Return a new node with the same contents as NODE except that its
730 TREE_CHAIN is zero and it has a fresh uid. */
733 copy_node_stat (tree node MEM_STAT_DECL
)
736 enum tree_code code
= TREE_CODE (node
);
739 gcc_assert (code
!= STATEMENT_LIST
);
741 length
= tree_size (node
);
742 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
743 memcpy (t
, node
, length
);
746 TREE_ASM_WRITTEN (t
) = 0;
747 TREE_VISITED (t
) = 0;
750 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
752 DECL_UID (t
) = next_decl_uid
++;
753 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
754 && DECL_HAS_VALUE_EXPR_P (node
))
756 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
757 DECL_HAS_VALUE_EXPR_P (t
) = 1;
759 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
761 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
762 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
764 if (TREE_CODE (node
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (node
))
766 SET_DECL_RESTRICT_BASE (t
, DECL_GET_RESTRICT_BASE (node
));
767 DECL_BASED_ON_RESTRICT_P (t
) = 1;
770 else if (TREE_CODE_CLASS (code
) == tcc_type
)
772 TYPE_UID (t
) = next_type_uid
++;
773 /* The following is so that the debug code for
774 the copy is different from the original type.
775 The two statements usually duplicate each other
776 (because they clear fields of the same union),
777 but the optimizer should catch that. */
778 TYPE_SYMTAB_POINTER (t
) = 0;
779 TYPE_SYMTAB_ADDRESS (t
) = 0;
781 /* Do not copy the values cache. */
782 if (TYPE_CACHED_VALUES_P(t
))
784 TYPE_CACHED_VALUES_P (t
) = 0;
785 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
792 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
793 For example, this can copy a list made of TREE_LIST nodes. */
796 copy_list (tree list
)
804 head
= prev
= copy_node (list
);
805 next
= TREE_CHAIN (list
);
808 TREE_CHAIN (prev
) = copy_node (next
);
809 prev
= TREE_CHAIN (prev
);
810 next
= TREE_CHAIN (next
);
816 /* Create an INT_CST node with a LOW value sign extended. */
819 build_int_cst (tree type
, HOST_WIDE_INT low
)
821 /* Support legacy code. */
823 type
= integer_type_node
;
825 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
828 /* Create an INT_CST node with a LOW value zero extended. */
831 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
833 return build_int_cst_wide (type
, low
, 0);
836 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
837 if it is negative. This function is similar to build_int_cst, but
838 the extra bits outside of the type precision are cleared. Constants
839 with these extra bits may confuse the fold so that it detects overflows
840 even in cases when they do not occur, and in general should be avoided.
841 We cannot however make this a default behavior of build_int_cst without
842 more intrusive changes, since there are parts of gcc that rely on the extra
843 precision of the integer constants. */
846 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
848 unsigned HOST_WIDE_INT low1
;
853 fit_double_type (low
, low
< 0 ? -1 : 0, &low1
, &hi
, type
);
855 return build_int_cst_wide (type
, low1
, hi
);
858 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
859 and sign extended according to the value range of TYPE. */
862 build_int_cst_wide_type (tree type
,
863 unsigned HOST_WIDE_INT low
, HOST_WIDE_INT high
)
865 fit_double_type (low
, high
, &low
, &high
, type
);
866 return build_int_cst_wide (type
, low
, high
);
869 /* These are the hash table functions for the hash table of INTEGER_CST
870 nodes of a sizetype. */
872 /* Return the hash code code X, an INTEGER_CST. */
875 int_cst_hash_hash (const void *x
)
877 const_tree
const t
= (const_tree
) x
;
879 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
880 ^ htab_hash_pointer (TREE_TYPE (t
)));
883 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
884 is the same as that given by *Y, which is the same. */
887 int_cst_hash_eq (const void *x
, const void *y
)
889 const_tree
const xt
= (const_tree
) x
;
890 const_tree
const yt
= (const_tree
) y
;
892 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
893 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
894 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
897 /* Create an INT_CST node of TYPE and value HI:LOW.
898 The returned node is always shared. For small integers we use a
899 per-type vector cache, for larger ones we use a single hash table. */
902 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
910 switch (TREE_CODE (type
))
914 /* Cache NULL pointer. */
923 /* Cache false or true. */
931 if (TYPE_UNSIGNED (type
))
934 limit
= INTEGER_SHARE_LIMIT
;
935 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
941 limit
= INTEGER_SHARE_LIMIT
+ 1;
942 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
944 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
958 /* Look for it in the type's vector of small shared ints. */
959 if (!TYPE_CACHED_VALUES_P (type
))
961 TYPE_CACHED_VALUES_P (type
) = 1;
962 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
965 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
968 /* Make sure no one is clobbering the shared constant. */
969 gcc_assert (TREE_TYPE (t
) == type
);
970 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
971 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
975 /* Create a new shared int. */
976 t
= make_node (INTEGER_CST
);
978 TREE_INT_CST_LOW (t
) = low
;
979 TREE_INT_CST_HIGH (t
) = hi
;
980 TREE_TYPE (t
) = type
;
982 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
987 /* Use the cache of larger shared ints. */
990 TREE_INT_CST_LOW (int_cst_node
) = low
;
991 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
992 TREE_TYPE (int_cst_node
) = type
;
994 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
998 /* Insert this one into the hash table. */
1001 /* Make a new node for next time round. */
1002 int_cst_node
= make_node (INTEGER_CST
);
1009 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1010 and the rest are zeros. */
1013 build_low_bits_mask (tree type
, unsigned bits
)
1015 unsigned HOST_WIDE_INT low
;
1017 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
1019 gcc_assert (bits
<= TYPE_PRECISION (type
));
1021 if (bits
== TYPE_PRECISION (type
)
1022 && !TYPE_UNSIGNED (type
))
1024 /* Sign extended all-ones mask. */
1028 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
1030 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1035 bits
-= HOST_BITS_PER_WIDE_INT
;
1037 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1040 return build_int_cst_wide (type
, low
, high
);
1043 /* Checks that X is integer constant that can be expressed in (unsigned)
1044 HOST_WIDE_INT without loss of precision. */
1047 cst_and_fits_in_hwi (const_tree x
)
1049 if (TREE_CODE (x
) != INTEGER_CST
)
1052 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1055 return (TREE_INT_CST_HIGH (x
) == 0
1056 || TREE_INT_CST_HIGH (x
) == -1);
1059 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1060 are in a list pointed to by VALS. */
1063 build_vector (tree type
, tree vals
)
1065 tree v
= make_node (VECTOR_CST
);
1069 TREE_VECTOR_CST_ELTS (v
) = vals
;
1070 TREE_TYPE (v
) = type
;
1072 /* Iterate through elements and check for overflow. */
1073 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1075 tree value
= TREE_VALUE (link
);
1077 /* Don't crash if we get an address constant. */
1078 if (!CONSTANT_CLASS_P (value
))
1081 over
|= TREE_OVERFLOW (value
);
1084 TREE_OVERFLOW (v
) = over
;
1088 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1089 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1092 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1094 tree list
= NULL_TREE
;
1095 unsigned HOST_WIDE_INT idx
;
1098 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1099 list
= tree_cons (NULL_TREE
, value
, list
);
1100 return build_vector (type
, nreverse (list
));
1103 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1104 are in the VEC pointed to by VALS. */
1106 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1108 tree c
= make_node (CONSTRUCTOR
);
1109 TREE_TYPE (c
) = type
;
1110 CONSTRUCTOR_ELTS (c
) = vals
;
1114 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1117 build_constructor_single (tree type
, tree index
, tree value
)
1119 VEC(constructor_elt
,gc
) *v
;
1120 constructor_elt
*elt
;
1123 v
= VEC_alloc (constructor_elt
, gc
, 1);
1124 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1128 t
= build_constructor (type
, v
);
1129 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1134 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1135 are in a list pointed to by VALS. */
1137 build_constructor_from_list (tree type
, tree vals
)
1140 VEC(constructor_elt
,gc
) *v
= NULL
;
1141 bool constant_p
= true;
1145 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1146 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1148 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1149 val
= TREE_VALUE (t
);
1150 elt
->index
= TREE_PURPOSE (t
);
1152 if (!TREE_CONSTANT (val
))
1157 t
= build_constructor (type
, v
);
1158 TREE_CONSTANT (t
) = constant_p
;
1162 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1165 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1168 FIXED_VALUE_TYPE
*fp
;
1170 v
= make_node (FIXED_CST
);
1171 fp
= GGC_NEW (FIXED_VALUE_TYPE
);
1172 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1174 TREE_TYPE (v
) = type
;
1175 TREE_FIXED_CST_PTR (v
) = fp
;
1179 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1182 build_real (tree type
, REAL_VALUE_TYPE d
)
1185 REAL_VALUE_TYPE
*dp
;
1188 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1189 Consider doing it via real_convert now. */
1191 v
= make_node (REAL_CST
);
1192 dp
= GGC_NEW (REAL_VALUE_TYPE
);
1193 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1195 TREE_TYPE (v
) = type
;
1196 TREE_REAL_CST_PTR (v
) = dp
;
1197 TREE_OVERFLOW (v
) = overflow
;
1201 /* Return a new REAL_CST node whose type is TYPE
1202 and whose value is the integer value of the INTEGER_CST node I. */
1205 real_value_from_int_cst (const_tree type
, const_tree i
)
1209 /* Clear all bits of the real value type so that we can later do
1210 bitwise comparisons to see if two values are the same. */
1211 memset (&d
, 0, sizeof d
);
1213 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1214 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1215 TYPE_UNSIGNED (TREE_TYPE (i
)));
1219 /* Given a tree representing an integer constant I, return a tree
1220 representing the same value as a floating-point constant of type TYPE. */
1223 build_real_from_int_cst (tree type
, const_tree i
)
1226 int overflow
= TREE_OVERFLOW (i
);
1228 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1230 TREE_OVERFLOW (v
) |= overflow
;
1234 /* Return a newly constructed STRING_CST node whose value is
1235 the LEN characters at STR.
1236 The TREE_TYPE is not initialized. */
1239 build_string (int len
, const char *str
)
1244 /* Do not waste bytes provided by padding of struct tree_string. */
1245 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1247 #ifdef GATHER_STATISTICS
1248 tree_node_counts
[(int) c_kind
]++;
1249 tree_node_sizes
[(int) c_kind
] += length
;
1252 s
= ggc_alloc_tree (length
);
1254 memset (s
, 0, sizeof (struct tree_common
));
1255 TREE_SET_CODE (s
, STRING_CST
);
1256 TREE_CONSTANT (s
) = 1;
1257 TREE_STRING_LENGTH (s
) = len
;
1258 memcpy (s
->string
.str
, str
, len
);
1259 s
->string
.str
[len
] = '\0';
1264 /* Return a newly constructed COMPLEX_CST node whose value is
1265 specified by the real and imaginary parts REAL and IMAG.
1266 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1267 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1270 build_complex (tree type
, tree real
, tree imag
)
1272 tree t
= make_node (COMPLEX_CST
);
1274 TREE_REALPART (t
) = real
;
1275 TREE_IMAGPART (t
) = imag
;
1276 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1277 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1281 /* Return a constant of arithmetic type TYPE which is the
1282 multiplicative identity of the set TYPE. */
1285 build_one_cst (tree type
)
1287 switch (TREE_CODE (type
))
1289 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1290 case POINTER_TYPE
: case REFERENCE_TYPE
:
1292 return build_int_cst (type
, 1);
1295 return build_real (type
, dconst1
);
1297 case FIXED_POINT_TYPE
:
1298 /* We can only generate 1 for accum types. */
1299 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1300 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1307 scalar
= build_one_cst (TREE_TYPE (type
));
1309 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1311 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1312 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1314 return build_vector (type
, cst
);
1318 return build_complex (type
,
1319 build_one_cst (TREE_TYPE (type
)),
1320 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1327 /* Build a BINFO with LEN language slots. */
1330 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1333 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1334 + VEC_embedded_size (tree
, base_binfos
));
1336 #ifdef GATHER_STATISTICS
1337 tree_node_counts
[(int) binfo_kind
]++;
1338 tree_node_sizes
[(int) binfo_kind
] += length
;
1341 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1343 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1345 TREE_SET_CODE (t
, TREE_BINFO
);
1347 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1353 /* Build a newly constructed TREE_VEC node of length LEN. */
1356 make_tree_vec_stat (int len MEM_STAT_DECL
)
1359 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1361 #ifdef GATHER_STATISTICS
1362 tree_node_counts
[(int) vec_kind
]++;
1363 tree_node_sizes
[(int) vec_kind
] += length
;
1366 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1368 memset (t
, 0, length
);
1370 TREE_SET_CODE (t
, TREE_VEC
);
1371 TREE_VEC_LENGTH (t
) = len
;
1376 /* Return 1 if EXPR is the integer constant zero or a complex constant
1380 integer_zerop (const_tree expr
)
1384 return ((TREE_CODE (expr
) == INTEGER_CST
1385 && TREE_INT_CST_LOW (expr
) == 0
1386 && TREE_INT_CST_HIGH (expr
) == 0)
1387 || (TREE_CODE (expr
) == COMPLEX_CST
1388 && integer_zerop (TREE_REALPART (expr
))
1389 && integer_zerop (TREE_IMAGPART (expr
))));
1392 /* Return 1 if EXPR is the integer constant one or the corresponding
1393 complex constant. */
1396 integer_onep (const_tree expr
)
1400 return ((TREE_CODE (expr
) == INTEGER_CST
1401 && TREE_INT_CST_LOW (expr
) == 1
1402 && TREE_INT_CST_HIGH (expr
) == 0)
1403 || (TREE_CODE (expr
) == COMPLEX_CST
1404 && integer_onep (TREE_REALPART (expr
))
1405 && integer_zerop (TREE_IMAGPART (expr
))));
1408 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1409 it contains. Likewise for the corresponding complex constant. */
1412 integer_all_onesp (const_tree expr
)
1419 if (TREE_CODE (expr
) == COMPLEX_CST
1420 && integer_all_onesp (TREE_REALPART (expr
))
1421 && integer_zerop (TREE_IMAGPART (expr
)))
1424 else if (TREE_CODE (expr
) != INTEGER_CST
)
1427 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1428 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1429 && TREE_INT_CST_HIGH (expr
) == -1)
1434 /* Note that using TYPE_PRECISION here is wrong. We care about the
1435 actual bits, not the (arbitrary) range of the type. */
1436 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1437 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1439 HOST_WIDE_INT high_value
;
1442 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1444 /* Can not handle precisions greater than twice the host int size. */
1445 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1446 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1447 /* Shifting by the host word size is undefined according to the ANSI
1448 standard, so we must handle this as a special case. */
1451 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1453 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1454 && TREE_INT_CST_HIGH (expr
) == high_value
);
1457 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1460 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1464 integer_pow2p (const_tree expr
)
1467 HOST_WIDE_INT high
, low
;
1471 if (TREE_CODE (expr
) == COMPLEX_CST
1472 && integer_pow2p (TREE_REALPART (expr
))
1473 && integer_zerop (TREE_IMAGPART (expr
)))
1476 if (TREE_CODE (expr
) != INTEGER_CST
)
1479 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1480 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1481 high
= TREE_INT_CST_HIGH (expr
);
1482 low
= TREE_INT_CST_LOW (expr
);
1484 /* First clear all bits that are beyond the type's precision in case
1485 we've been sign extended. */
1487 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1489 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1490 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1494 if (prec
< HOST_BITS_PER_WIDE_INT
)
1495 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1498 if (high
== 0 && low
== 0)
1501 return ((high
== 0 && (low
& (low
- 1)) == 0)
1502 || (low
== 0 && (high
& (high
- 1)) == 0));
1505 /* Return 1 if EXPR is an integer constant other than zero or a
1506 complex constant other than zero. */
1509 integer_nonzerop (const_tree expr
)
1513 return ((TREE_CODE (expr
) == INTEGER_CST
1514 && (TREE_INT_CST_LOW (expr
) != 0
1515 || TREE_INT_CST_HIGH (expr
) != 0))
1516 || (TREE_CODE (expr
) == COMPLEX_CST
1517 && (integer_nonzerop (TREE_REALPART (expr
))
1518 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1521 /* Return 1 if EXPR is the fixed-point constant zero. */
1524 fixed_zerop (const_tree expr
)
1526 return (TREE_CODE (expr
) == FIXED_CST
1527 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1530 /* Return the power of two represented by a tree node known to be a
1534 tree_log2 (const_tree expr
)
1537 HOST_WIDE_INT high
, low
;
1541 if (TREE_CODE (expr
) == COMPLEX_CST
)
1542 return tree_log2 (TREE_REALPART (expr
));
1544 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1545 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1547 high
= TREE_INT_CST_HIGH (expr
);
1548 low
= TREE_INT_CST_LOW (expr
);
1550 /* First clear all bits that are beyond the type's precision in case
1551 we've been sign extended. */
1553 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1555 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1556 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1560 if (prec
< HOST_BITS_PER_WIDE_INT
)
1561 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1564 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1565 : exact_log2 (low
));
1568 /* Similar, but return the largest integer Y such that 2 ** Y is less
1569 than or equal to EXPR. */
1572 tree_floor_log2 (const_tree expr
)
1575 HOST_WIDE_INT high
, low
;
1579 if (TREE_CODE (expr
) == COMPLEX_CST
)
1580 return tree_log2 (TREE_REALPART (expr
));
1582 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1583 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1585 high
= TREE_INT_CST_HIGH (expr
);
1586 low
= TREE_INT_CST_LOW (expr
);
1588 /* First clear all bits that are beyond the type's precision in case
1589 we've been sign extended. Ignore if type's precision hasn't been set
1590 since what we are doing is setting it. */
1592 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1594 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1595 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1599 if (prec
< HOST_BITS_PER_WIDE_INT
)
1600 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1603 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1604 : floor_log2 (low
));
1607 /* Return 1 if EXPR is the real constant zero. */
1610 real_zerop (const_tree expr
)
1614 return ((TREE_CODE (expr
) == REAL_CST
1615 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1616 || (TREE_CODE (expr
) == COMPLEX_CST
1617 && real_zerop (TREE_REALPART (expr
))
1618 && real_zerop (TREE_IMAGPART (expr
))));
1621 /* Return 1 if EXPR is the real constant one in real or complex form. */
1624 real_onep (const_tree expr
)
1628 return ((TREE_CODE (expr
) == REAL_CST
1629 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1630 || (TREE_CODE (expr
) == COMPLEX_CST
1631 && real_onep (TREE_REALPART (expr
))
1632 && real_zerop (TREE_IMAGPART (expr
))));
1635 /* Return 1 if EXPR is the real constant two. */
1638 real_twop (const_tree expr
)
1642 return ((TREE_CODE (expr
) == REAL_CST
1643 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1644 || (TREE_CODE (expr
) == COMPLEX_CST
1645 && real_twop (TREE_REALPART (expr
))
1646 && real_zerop (TREE_IMAGPART (expr
))));
1649 /* Return 1 if EXPR is the real constant minus one. */
1652 real_minus_onep (const_tree expr
)
1656 return ((TREE_CODE (expr
) == REAL_CST
1657 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1658 || (TREE_CODE (expr
) == COMPLEX_CST
1659 && real_minus_onep (TREE_REALPART (expr
))
1660 && real_zerop (TREE_IMAGPART (expr
))));
1663 /* Nonzero if EXP is a constant or a cast of a constant. */
1666 really_constant_p (const_tree exp
)
1668 /* This is not quite the same as STRIP_NOPS. It does more. */
1669 while (CONVERT_EXPR_P (exp
)
1670 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1671 exp
= TREE_OPERAND (exp
, 0);
1672 return TREE_CONSTANT (exp
);
1675 /* Return first list element whose TREE_VALUE is ELEM.
1676 Return 0 if ELEM is not in LIST. */
1679 value_member (tree elem
, tree list
)
1683 if (elem
== TREE_VALUE (list
))
1685 list
= TREE_CHAIN (list
);
1690 /* Return first list element whose TREE_PURPOSE is ELEM.
1691 Return 0 if ELEM is not in LIST. */
1694 purpose_member (const_tree elem
, tree list
)
1698 if (elem
== TREE_PURPOSE (list
))
1700 list
= TREE_CHAIN (list
);
1705 /* Return nonzero if ELEM is part of the chain CHAIN. */
1708 chain_member (const_tree elem
, const_tree chain
)
1714 chain
= TREE_CHAIN (chain
);
1720 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1721 We expect a null pointer to mark the end of the chain.
1722 This is the Lisp primitive `length'. */
1725 list_length (const_tree t
)
1728 #ifdef ENABLE_TREE_CHECKING
1736 #ifdef ENABLE_TREE_CHECKING
1739 gcc_assert (p
!= q
);
1747 /* Returns the number of FIELD_DECLs in TYPE. */
1750 fields_length (const_tree type
)
1752 tree t
= TYPE_FIELDS (type
);
1755 for (; t
; t
= TREE_CHAIN (t
))
1756 if (TREE_CODE (t
) == FIELD_DECL
)
1762 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1763 by modifying the last node in chain 1 to point to chain 2.
1764 This is the Lisp primitive `nconc'. */
1767 chainon (tree op1
, tree op2
)
1776 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1778 TREE_CHAIN (t1
) = op2
;
1780 #ifdef ENABLE_TREE_CHECKING
1783 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1784 gcc_assert (t2
!= t1
);
1791 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1794 tree_last (tree chain
)
1798 while ((next
= TREE_CHAIN (chain
)))
1803 /* Reverse the order of elements in the chain T,
1804 and return the new head of the chain (old last element). */
1809 tree prev
= 0, decl
, next
;
1810 for (decl
= t
; decl
; decl
= next
)
1812 next
= TREE_CHAIN (decl
);
1813 TREE_CHAIN (decl
) = prev
;
1819 /* Return a newly created TREE_LIST node whose
1820 purpose and value fields are PARM and VALUE. */
1823 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1825 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1826 TREE_PURPOSE (t
) = parm
;
1827 TREE_VALUE (t
) = value
;
1831 /* Return a newly created TREE_LIST node whose
1832 purpose and value fields are PURPOSE and VALUE
1833 and whose TREE_CHAIN is CHAIN. */
1836 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1840 node
= (tree
) ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1842 memset (node
, 0, sizeof (struct tree_common
));
1844 #ifdef GATHER_STATISTICS
1845 tree_node_counts
[(int) x_kind
]++;
1846 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1849 TREE_SET_CODE (node
, TREE_LIST
);
1850 TREE_CHAIN (node
) = chain
;
1851 TREE_PURPOSE (node
) = purpose
;
1852 TREE_VALUE (node
) = value
;
1856 /* Return the elements of a CONSTRUCTOR as a TREE_LIST. */
1859 ctor_to_list (tree ctor
)
1861 tree list
= NULL_TREE
;
1866 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), ix
, purpose
, val
)
1868 *p
= build_tree_list (purpose
, val
);
1869 p
= &TREE_CHAIN (*p
);
1875 /* Return the size nominally occupied by an object of type TYPE
1876 when it resides in memory. The value is measured in units of bytes,
1877 and its data type is that normally used for type sizes
1878 (which is the first type created by make_signed_type or
1879 make_unsigned_type). */
1882 size_in_bytes (const_tree type
)
1886 if (type
== error_mark_node
)
1887 return integer_zero_node
;
1889 type
= TYPE_MAIN_VARIANT (type
);
1890 t
= TYPE_SIZE_UNIT (type
);
1894 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1895 return size_zero_node
;
1901 /* Return the size of TYPE (in bytes) as a wide integer
1902 or return -1 if the size can vary or is larger than an integer. */
1905 int_size_in_bytes (const_tree type
)
1909 if (type
== error_mark_node
)
1912 type
= TYPE_MAIN_VARIANT (type
);
1913 t
= TYPE_SIZE_UNIT (type
);
1915 || TREE_CODE (t
) != INTEGER_CST
1916 || TREE_INT_CST_HIGH (t
) != 0
1917 /* If the result would appear negative, it's too big to represent. */
1918 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1921 return TREE_INT_CST_LOW (t
);
1924 /* Return the maximum size of TYPE (in bytes) as a wide integer
1925 or return -1 if the size can vary or is larger than an integer. */
1928 max_int_size_in_bytes (const_tree type
)
1930 HOST_WIDE_INT size
= -1;
1933 /* If this is an array type, check for a possible MAX_SIZE attached. */
1935 if (TREE_CODE (type
) == ARRAY_TYPE
)
1937 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
1939 if (size_tree
&& host_integerp (size_tree
, 1))
1940 size
= tree_low_cst (size_tree
, 1);
1943 /* If we still haven't been able to get a size, see if the language
1944 can compute a maximum size. */
1948 size_tree
= lang_hooks
.types
.max_size (type
);
1950 if (size_tree
&& host_integerp (size_tree
, 1))
1951 size
= tree_low_cst (size_tree
, 1);
1957 /* Return the bit position of FIELD, in bits from the start of the record.
1958 This is a tree of type bitsizetype. */
1961 bit_position (const_tree field
)
1963 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1964 DECL_FIELD_BIT_OFFSET (field
));
1967 /* Likewise, but return as an integer. It must be representable in
1968 that way (since it could be a signed value, we don't have the
1969 option of returning -1 like int_size_in_byte can. */
1972 int_bit_position (const_tree field
)
1974 return tree_low_cst (bit_position (field
), 0);
1977 /* Return the byte position of FIELD, in bytes from the start of the record.
1978 This is a tree of type sizetype. */
1981 byte_position (const_tree field
)
1983 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1984 DECL_FIELD_BIT_OFFSET (field
));
1987 /* Likewise, but return as an integer. It must be representable in
1988 that way (since it could be a signed value, we don't have the
1989 option of returning -1 like int_size_in_byte can. */
1992 int_byte_position (const_tree field
)
1994 return tree_low_cst (byte_position (field
), 0);
1997 /* Return the strictest alignment, in bits, that T is known to have. */
2000 expr_align (const_tree t
)
2002 unsigned int align0
, align1
;
2004 switch (TREE_CODE (t
))
2006 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2007 /* If we have conversions, we know that the alignment of the
2008 object must meet each of the alignments of the types. */
2009 align0
= expr_align (TREE_OPERAND (t
, 0));
2010 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2011 return MAX (align0
, align1
);
2013 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2014 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2015 case CLEANUP_POINT_EXPR
:
2016 /* These don't change the alignment of an object. */
2017 return expr_align (TREE_OPERAND (t
, 0));
2020 /* The best we can do is say that the alignment is the least aligned
2022 align0
= expr_align (TREE_OPERAND (t
, 1));
2023 align1
= expr_align (TREE_OPERAND (t
, 2));
2024 return MIN (align0
, align1
);
2026 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2027 meaningfully, it's always 1. */
2028 case LABEL_DECL
: case CONST_DECL
:
2029 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2031 gcc_assert (DECL_ALIGN (t
) != 0);
2032 return DECL_ALIGN (t
);
2038 /* Otherwise take the alignment from that of the type. */
2039 return TYPE_ALIGN (TREE_TYPE (t
));
2042 /* Return, as a tree node, the number of elements for TYPE (which is an
2043 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2046 array_type_nelts (const_tree type
)
2048 tree index_type
, min
, max
;
2050 /* If they did it with unspecified bounds, then we should have already
2051 given an error about it before we got here. */
2052 if (! TYPE_DOMAIN (type
))
2053 return error_mark_node
;
2055 index_type
= TYPE_DOMAIN (type
);
2056 min
= TYPE_MIN_VALUE (index_type
);
2057 max
= TYPE_MAX_VALUE (index_type
);
2059 return (integer_zerop (min
)
2061 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2064 /* If arg is static -- a reference to an object in static storage -- then
2065 return the object. This is not the same as the C meaning of `static'.
2066 If arg isn't static, return NULL. */
2071 switch (TREE_CODE (arg
))
2074 /* Nested functions are static, even though taking their address will
2075 involve a trampoline as we unnest the nested function and create
2076 the trampoline on the tree level. */
2080 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2081 && ! DECL_THREAD_LOCAL_P (arg
)
2082 && ! DECL_DLLIMPORT_P (arg
)
2086 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2090 return TREE_STATIC (arg
) ? arg
: NULL
;
2097 /* If the thing being referenced is not a field, then it is
2098 something language specific. */
2099 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
2100 return (*lang_hooks
.staticp
) (arg
);
2102 /* If we are referencing a bitfield, we can't evaluate an
2103 ADDR_EXPR at compile time and so it isn't a constant. */
2104 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2107 return staticp (TREE_OPERAND (arg
, 0));
2112 case MISALIGNED_INDIRECT_REF
:
2113 case ALIGN_INDIRECT_REF
:
2115 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2118 case ARRAY_RANGE_REF
:
2119 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2120 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2121 return staticp (TREE_OPERAND (arg
, 0));
2126 if ((unsigned int) TREE_CODE (arg
)
2127 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
2128 return lang_hooks
.staticp (arg
);
2137 /* Return whether OP is a DECL whose address is function-invariant. */
2140 decl_address_invariant_p (const_tree op
)
2142 /* The conditions below are slightly less strict than the one in
2145 switch (TREE_CODE (op
))
2154 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2155 && !DECL_DLLIMPORT_P (op
))
2156 || DECL_THREAD_LOCAL_P (op
)
2157 || DECL_CONTEXT (op
) == current_function_decl
2158 || decl_function_context (op
) == current_function_decl
)
2163 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2164 || decl_function_context (op
) == current_function_decl
)
2175 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2178 decl_address_ip_invariant_p (const_tree op
)
2180 /* The conditions below are slightly less strict than the one in
2183 switch (TREE_CODE (op
))
2191 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2192 && !DECL_DLLIMPORT_P (op
))
2193 || DECL_THREAD_LOCAL_P (op
))
2198 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2210 /* Return true if T is function-invariant (internal function, does
2211 not handle arithmetic; that's handled in skip_simple_arithmetic and
2212 tree_invariant_p). */
2214 static bool tree_invariant_p (tree t
);
2217 tree_invariant_p_1 (tree t
)
2221 if (TREE_CONSTANT (t
)
2222 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2225 switch (TREE_CODE (t
))
2231 op
= TREE_OPERAND (t
, 0);
2232 while (handled_component_p (op
))
2234 switch (TREE_CODE (op
))
2237 case ARRAY_RANGE_REF
:
2238 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2239 || TREE_OPERAND (op
, 2) != NULL_TREE
2240 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2245 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2251 op
= TREE_OPERAND (op
, 0);
2254 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2263 /* Return true if T is function-invariant. */
2266 tree_invariant_p (tree t
)
2268 tree inner
= skip_simple_arithmetic (t
);
2269 return tree_invariant_p_1 (inner
);
2272 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2273 Do this to any expression which may be used in more than one place,
2274 but must be evaluated only once.
2276 Normally, expand_expr would reevaluate the expression each time.
2277 Calling save_expr produces something that is evaluated and recorded
2278 the first time expand_expr is called on it. Subsequent calls to
2279 expand_expr just reuse the recorded value.
2281 The call to expand_expr that generates code that actually computes
2282 the value is the first call *at compile time*. Subsequent calls
2283 *at compile time* generate code to use the saved value.
2284 This produces correct result provided that *at run time* control
2285 always flows through the insns made by the first expand_expr
2286 before reaching the other places where the save_expr was evaluated.
2287 You, the caller of save_expr, must make sure this is so.
2289 Constants, and certain read-only nodes, are returned with no
2290 SAVE_EXPR because that is safe. Expressions containing placeholders
2291 are not touched; see tree.def for an explanation of what these
2295 save_expr (tree expr
)
2297 tree t
= fold (expr
);
2300 /* If the tree evaluates to a constant, then we don't want to hide that
2301 fact (i.e. this allows further folding, and direct checks for constants).
2302 However, a read-only object that has side effects cannot be bypassed.
2303 Since it is no problem to reevaluate literals, we just return the
2305 inner
= skip_simple_arithmetic (t
);
2306 if (TREE_CODE (inner
) == ERROR_MARK
)
2309 if (tree_invariant_p_1 (inner
))
2312 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2313 it means that the size or offset of some field of an object depends on
2314 the value within another field.
2316 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2317 and some variable since it would then need to be both evaluated once and
2318 evaluated more than once. Front-ends must assure this case cannot
2319 happen by surrounding any such subexpressions in their own SAVE_EXPR
2320 and forcing evaluation at the proper time. */
2321 if (contains_placeholder_p (inner
))
2324 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2326 /* This expression might be placed ahead of a jump to ensure that the
2327 value was computed on both sides of the jump. So make sure it isn't
2328 eliminated as dead. */
2329 TREE_SIDE_EFFECTS (t
) = 1;
2333 /* Look inside EXPR and into any simple arithmetic operations. Return
2334 the innermost non-arithmetic node. */
2337 skip_simple_arithmetic (tree expr
)
2341 /* We don't care about whether this can be used as an lvalue in this
2343 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2344 expr
= TREE_OPERAND (expr
, 0);
2346 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2347 a constant, it will be more efficient to not make another SAVE_EXPR since
2348 it will allow better simplification and GCSE will be able to merge the
2349 computations if they actually occur. */
2353 if (UNARY_CLASS_P (inner
))
2354 inner
= TREE_OPERAND (inner
, 0);
2355 else if (BINARY_CLASS_P (inner
))
2357 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2358 inner
= TREE_OPERAND (inner
, 0);
2359 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2360 inner
= TREE_OPERAND (inner
, 1);
2371 /* Return which tree structure is used by T. */
2373 enum tree_node_structure_enum
2374 tree_node_structure (const_tree t
)
2376 const enum tree_code code
= TREE_CODE (t
);
2378 switch (TREE_CODE_CLASS (code
))
2380 case tcc_declaration
:
2385 return TS_FIELD_DECL
;
2387 return TS_PARM_DECL
;
2391 return TS_LABEL_DECL
;
2393 return TS_RESULT_DECL
;
2395 return TS_CONST_DECL
;
2397 return TS_TYPE_DECL
;
2399 return TS_FUNCTION_DECL
;
2400 case SYMBOL_MEMORY_TAG
:
2401 case NAME_MEMORY_TAG
:
2402 case MEMORY_PARTITION_TAG
:
2403 return TS_MEMORY_TAG
;
2405 return TS_DECL_NON_COMMON
;
2411 case tcc_comparison
:
2414 case tcc_expression
:
2418 default: /* tcc_constant and tcc_exceptional */
2423 /* tcc_constant cases. */
2424 case INTEGER_CST
: return TS_INT_CST
;
2425 case REAL_CST
: return TS_REAL_CST
;
2426 case FIXED_CST
: return TS_FIXED_CST
;
2427 case COMPLEX_CST
: return TS_COMPLEX
;
2428 case VECTOR_CST
: return TS_VECTOR
;
2429 case STRING_CST
: return TS_STRING
;
2430 /* tcc_exceptional cases. */
2431 case ERROR_MARK
: return TS_COMMON
;
2432 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
2433 case TREE_LIST
: return TS_LIST
;
2434 case TREE_VEC
: return TS_VEC
;
2435 case SSA_NAME
: return TS_SSA_NAME
;
2436 case PLACEHOLDER_EXPR
: return TS_COMMON
;
2437 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
2438 case BLOCK
: return TS_BLOCK
;
2439 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
2440 case TREE_BINFO
: return TS_BINFO
;
2441 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
2442 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
2443 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
2450 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2451 or offset that depends on a field within a record. */
2454 contains_placeholder_p (const_tree exp
)
2456 enum tree_code code
;
2461 code
= TREE_CODE (exp
);
2462 if (code
== PLACEHOLDER_EXPR
)
2465 switch (TREE_CODE_CLASS (code
))
2468 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2469 position computations since they will be converted into a
2470 WITH_RECORD_EXPR involving the reference, which will assume
2471 here will be valid. */
2472 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2474 case tcc_exceptional
:
2475 if (code
== TREE_LIST
)
2476 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2477 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2482 case tcc_comparison
:
2483 case tcc_expression
:
2487 /* Ignoring the first operand isn't quite right, but works best. */
2488 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2491 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2492 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2493 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2496 /* The save_expr function never wraps anything containing
2497 a PLACEHOLDER_EXPR. */
2504 switch (TREE_CODE_LENGTH (code
))
2507 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2509 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2510 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2521 const_call_expr_arg_iterator iter
;
2522 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2523 if (CONTAINS_PLACEHOLDER_P (arg
))
2537 /* Return true if any part of the computation of TYPE involves a
2538 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2539 (for QUAL_UNION_TYPE) and field positions. */
2542 type_contains_placeholder_1 (const_tree type
)
2544 /* If the size contains a placeholder or the parent type (component type in
2545 the case of arrays) type involves a placeholder, this type does. */
2546 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2547 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2548 || (TREE_TYPE (type
) != 0
2549 && type_contains_placeholder_p (TREE_TYPE (type
))))
2552 /* Now do type-specific checks. Note that the last part of the check above
2553 greatly limits what we have to do below. */
2554 switch (TREE_CODE (type
))
2562 case REFERENCE_TYPE
:
2570 case FIXED_POINT_TYPE
:
2571 /* Here we just check the bounds. */
2572 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2573 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2576 /* We're already checked the component type (TREE_TYPE), so just check
2578 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2582 case QUAL_UNION_TYPE
:
2586 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2587 if (TREE_CODE (field
) == FIELD_DECL
2588 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2589 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2590 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2591 || type_contains_placeholder_p (TREE_TYPE (field
))))
2603 type_contains_placeholder_p (tree type
)
2607 /* If the contains_placeholder_bits field has been initialized,
2608 then we know the answer. */
2609 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2610 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2612 /* Indicate that we've seen this type node, and the answer is false.
2613 This is what we want to return if we run into recursion via fields. */
2614 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2616 /* Compute the real value. */
2617 result
= type_contains_placeholder_1 (type
);
2619 /* Store the real value. */
2620 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2625 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2626 return a tree with all occurrences of references to F in a
2627 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2628 contains only arithmetic expressions or a CALL_EXPR with a
2629 PLACEHOLDER_EXPR occurring only in its arglist. */
2632 substitute_in_expr (tree exp
, tree f
, tree r
)
2634 enum tree_code code
= TREE_CODE (exp
);
2635 tree op0
, op1
, op2
, op3
;
2636 tree new_tree
, inner
;
2638 /* We handle TREE_LIST and COMPONENT_REF separately. */
2639 if (code
== TREE_LIST
)
2641 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2642 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2643 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2646 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2648 else if (code
== COMPONENT_REF
)
2650 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2651 and it is the right field, replace it with R. */
2652 for (inner
= TREE_OPERAND (exp
, 0);
2653 REFERENCE_CLASS_P (inner
);
2654 inner
= TREE_OPERAND (inner
, 0))
2656 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2657 && TREE_OPERAND (exp
, 1) == f
)
2660 /* If this expression hasn't been completed let, leave it alone. */
2661 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2664 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2665 if (op0
== TREE_OPERAND (exp
, 0))
2668 new_tree
= fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2669 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
);
2672 switch (TREE_CODE_CLASS (code
))
2675 case tcc_declaration
:
2678 case tcc_exceptional
:
2681 case tcc_comparison
:
2682 case tcc_expression
:
2684 switch (TREE_CODE_LENGTH (code
))
2690 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2691 if (op0
== TREE_OPERAND (exp
, 0))
2694 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
2698 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2699 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2701 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2704 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2708 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2709 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2710 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2712 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2713 && op2
== TREE_OPERAND (exp
, 2))
2716 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2720 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2721 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2722 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2723 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
2725 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2726 && op2
== TREE_OPERAND (exp
, 2)
2727 && op3
== TREE_OPERAND (exp
, 3))
2730 new_tree
= fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2740 tree copy
= NULL_TREE
;
2743 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2745 tree op
= TREE_OPERAND (exp
, i
);
2746 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
2750 copy
= copy_node (exp
);
2751 TREE_OPERAND (copy
, i
) = new_op
;
2756 new_tree
= fold (copy
);
2766 TREE_READONLY (new_tree
) = TREE_READONLY (exp
);
2770 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2771 for it within OBJ, a tree that is an object or a chain of references. */
2774 substitute_placeholder_in_expr (tree exp
, tree obj
)
2776 enum tree_code code
= TREE_CODE (exp
);
2777 tree op0
, op1
, op2
, op3
;
2779 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2780 in the chain of OBJ. */
2781 if (code
== PLACEHOLDER_EXPR
)
2783 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2786 for (elt
= obj
; elt
!= 0;
2787 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2788 || TREE_CODE (elt
) == COND_EXPR
)
2789 ? TREE_OPERAND (elt
, 1)
2790 : (REFERENCE_CLASS_P (elt
)
2791 || UNARY_CLASS_P (elt
)
2792 || BINARY_CLASS_P (elt
)
2793 || VL_EXP_CLASS_P (elt
)
2794 || EXPRESSION_CLASS_P (elt
))
2795 ? TREE_OPERAND (elt
, 0) : 0))
2796 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2799 for (elt
= obj
; elt
!= 0;
2800 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2801 || TREE_CODE (elt
) == COND_EXPR
)
2802 ? TREE_OPERAND (elt
, 1)
2803 : (REFERENCE_CLASS_P (elt
)
2804 || UNARY_CLASS_P (elt
)
2805 || BINARY_CLASS_P (elt
)
2806 || VL_EXP_CLASS_P (elt
)
2807 || EXPRESSION_CLASS_P (elt
))
2808 ? TREE_OPERAND (elt
, 0) : 0))
2809 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2810 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2812 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
2814 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2815 survives until RTL generation, there will be an error. */
2819 /* TREE_LIST is special because we need to look at TREE_VALUE
2820 and TREE_CHAIN, not TREE_OPERANDS. */
2821 else if (code
== TREE_LIST
)
2823 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2824 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2825 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2828 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2831 switch (TREE_CODE_CLASS (code
))
2834 case tcc_declaration
:
2837 case tcc_exceptional
:
2840 case tcc_comparison
:
2841 case tcc_expression
:
2844 switch (TREE_CODE_LENGTH (code
))
2850 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2851 if (op0
== TREE_OPERAND (exp
, 0))
2854 return fold_build1 (code
, TREE_TYPE (exp
), op0
);
2857 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2858 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2860 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2863 return fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2866 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2867 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2868 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2870 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2871 && op2
== TREE_OPERAND (exp
, 2))
2874 return fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2877 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2878 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2879 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2880 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2882 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2883 && op2
== TREE_OPERAND (exp
, 2)
2884 && op3
== TREE_OPERAND (exp
, 3))
2887 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2896 tree copy
= NULL_TREE
;
2899 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2901 tree op
= TREE_OPERAND (exp
, i
);
2902 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
2906 copy
= copy_node (exp
);
2907 TREE_OPERAND (copy
, i
) = new_op
;
2922 /* Stabilize a reference so that we can use it any number of times
2923 without causing its operands to be evaluated more than once.
2924 Returns the stabilized reference. This works by means of save_expr,
2925 so see the caveats in the comments about save_expr.
2927 Also allows conversion expressions whose operands are references.
2928 Any other kind of expression is returned unchanged. */
2931 stabilize_reference (tree ref
)
2934 enum tree_code code
= TREE_CODE (ref
);
2941 /* No action is needed in this case. */
2946 case FIX_TRUNC_EXPR
:
2947 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2951 result
= build_nt (INDIRECT_REF
,
2952 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2956 result
= build_nt (COMPONENT_REF
,
2957 stabilize_reference (TREE_OPERAND (ref
, 0)),
2958 TREE_OPERAND (ref
, 1), NULL_TREE
);
2962 result
= build_nt (BIT_FIELD_REF
,
2963 stabilize_reference (TREE_OPERAND (ref
, 0)),
2964 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2965 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2969 result
= build_nt (ARRAY_REF
,
2970 stabilize_reference (TREE_OPERAND (ref
, 0)),
2971 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2972 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2975 case ARRAY_RANGE_REF
:
2976 result
= build_nt (ARRAY_RANGE_REF
,
2977 stabilize_reference (TREE_OPERAND (ref
, 0)),
2978 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2979 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2983 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2984 it wouldn't be ignored. This matters when dealing with
2986 return stabilize_reference_1 (ref
);
2988 /* If arg isn't a kind of lvalue we recognize, make no change.
2989 Caller should recognize the error for an invalid lvalue. */
2994 return error_mark_node
;
2997 TREE_TYPE (result
) = TREE_TYPE (ref
);
2998 TREE_READONLY (result
) = TREE_READONLY (ref
);
2999 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3000 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3005 /* Subroutine of stabilize_reference; this is called for subtrees of
3006 references. Any expression with side-effects must be put in a SAVE_EXPR
3007 to ensure that it is only evaluated once.
3009 We don't put SAVE_EXPR nodes around everything, because assigning very
3010 simple expressions to temporaries causes us to miss good opportunities
3011 for optimizations. Among other things, the opportunity to fold in the
3012 addition of a constant into an addressing mode often gets lost, e.g.
3013 "y[i+1] += x;". In general, we take the approach that we should not make
3014 an assignment unless we are forced into it - i.e., that any non-side effect
3015 operator should be allowed, and that cse should take care of coalescing
3016 multiple utterances of the same expression should that prove fruitful. */
3019 stabilize_reference_1 (tree e
)
3022 enum tree_code code
= TREE_CODE (e
);
3024 /* We cannot ignore const expressions because it might be a reference
3025 to a const array but whose index contains side-effects. But we can
3026 ignore things that are actual constant or that already have been
3027 handled by this function. */
3029 if (tree_invariant_p (e
))
3032 switch (TREE_CODE_CLASS (code
))
3034 case tcc_exceptional
:
3036 case tcc_declaration
:
3037 case tcc_comparison
:
3039 case tcc_expression
:
3042 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3043 so that it will only be evaluated once. */
3044 /* The reference (r) and comparison (<) classes could be handled as
3045 below, but it is generally faster to only evaluate them once. */
3046 if (TREE_SIDE_EFFECTS (e
))
3047 return save_expr (e
);
3051 /* Constants need no processing. In fact, we should never reach
3056 /* Division is slow and tends to be compiled with jumps,
3057 especially the division by powers of 2 that is often
3058 found inside of an array reference. So do it just once. */
3059 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3060 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3061 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3062 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3063 return save_expr (e
);
3064 /* Recursively stabilize each operand. */
3065 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3066 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3070 /* Recursively stabilize each operand. */
3071 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3078 TREE_TYPE (result
) = TREE_TYPE (e
);
3079 TREE_READONLY (result
) = TREE_READONLY (e
);
3080 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3081 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3086 /* Low-level constructors for expressions. */
3088 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3089 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3092 recompute_tree_invariant_for_addr_expr (tree t
)
3095 bool tc
= true, se
= false;
3097 /* We started out assuming this address is both invariant and constant, but
3098 does not have side effects. Now go down any handled components and see if
3099 any of them involve offsets that are either non-constant or non-invariant.
3100 Also check for side-effects.
3102 ??? Note that this code makes no attempt to deal with the case where
3103 taking the address of something causes a copy due to misalignment. */
3105 #define UPDATE_FLAGS(NODE) \
3106 do { tree _node = (NODE); \
3107 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3108 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3110 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3111 node
= TREE_OPERAND (node
, 0))
3113 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3114 array reference (probably made temporarily by the G++ front end),
3115 so ignore all the operands. */
3116 if ((TREE_CODE (node
) == ARRAY_REF
3117 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3118 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3120 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3121 if (TREE_OPERAND (node
, 2))
3122 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3123 if (TREE_OPERAND (node
, 3))
3124 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3126 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3127 FIELD_DECL, apparently. The G++ front end can put something else
3128 there, at least temporarily. */
3129 else if (TREE_CODE (node
) == COMPONENT_REF
3130 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3132 if (TREE_OPERAND (node
, 2))
3133 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3135 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3136 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3139 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3141 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3142 the address, since &(*a)->b is a form of addition. If it's a constant, the
3143 address is constant too. If it's a decl, its address is constant if the
3144 decl is static. Everything else is not constant and, furthermore,
3145 taking the address of a volatile variable is not volatile. */
3146 if (TREE_CODE (node
) == INDIRECT_REF
)
3147 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3148 else if (CONSTANT_CLASS_P (node
))
3150 else if (DECL_P (node
))
3151 tc
&= (staticp (node
) != NULL_TREE
);
3155 se
|= TREE_SIDE_EFFECTS (node
);
3159 TREE_CONSTANT (t
) = tc
;
3160 TREE_SIDE_EFFECTS (t
) = se
;
3164 /* Build an expression of code CODE, data type TYPE, and operands as
3165 specified. Expressions and reference nodes can be created this way.
3166 Constants, decls, types and misc nodes cannot be.
3168 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3169 enough for all extant tree codes. */
3172 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3176 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3178 t
= make_node_stat (code PASS_MEM_STAT
);
3185 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3187 int length
= sizeof (struct tree_exp
);
3188 #ifdef GATHER_STATISTICS
3189 tree_node_kind kind
;
3193 #ifdef GATHER_STATISTICS
3194 switch (TREE_CODE_CLASS (code
))
3196 case tcc_statement
: /* an expression with side effects */
3199 case tcc_reference
: /* a reference */
3207 tree_node_counts
[(int) kind
]++;
3208 tree_node_sizes
[(int) kind
] += length
;
3211 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3213 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
3215 memset (t
, 0, sizeof (struct tree_common
));
3217 TREE_SET_CODE (t
, code
);
3219 TREE_TYPE (t
) = type
;
3220 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3221 TREE_OPERAND (t
, 0) = node
;
3222 TREE_BLOCK (t
) = NULL_TREE
;
3223 if (node
&& !TYPE_P (node
))
3225 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3226 TREE_READONLY (t
) = TREE_READONLY (node
);
3229 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3230 TREE_SIDE_EFFECTS (t
) = 1;
3234 /* All of these have side-effects, no matter what their
3236 TREE_SIDE_EFFECTS (t
) = 1;
3237 TREE_READONLY (t
) = 0;
3240 case MISALIGNED_INDIRECT_REF
:
3241 case ALIGN_INDIRECT_REF
:
3243 /* Whether a dereference is readonly has nothing to do with whether
3244 its operand is readonly. */
3245 TREE_READONLY (t
) = 0;
3250 recompute_tree_invariant_for_addr_expr (t
);
3254 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3255 && node
&& !TYPE_P (node
)
3256 && TREE_CONSTANT (node
))
3257 TREE_CONSTANT (t
) = 1;
3258 if (TREE_CODE_CLASS (code
) == tcc_reference
3259 && node
&& TREE_THIS_VOLATILE (node
))
3260 TREE_THIS_VOLATILE (t
) = 1;
3267 #define PROCESS_ARG(N) \
3269 TREE_OPERAND (t, N) = arg##N; \
3270 if (arg##N &&!TYPE_P (arg##N)) \
3272 if (TREE_SIDE_EFFECTS (arg##N)) \
3274 if (!TREE_READONLY (arg##N)) \
3276 if (!TREE_CONSTANT (arg##N)) \
3282 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3284 bool constant
, read_only
, side_effects
;
3287 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3289 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3290 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
))
3291 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
);
3293 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3294 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3295 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3296 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3298 t
= make_node_stat (code PASS_MEM_STAT
);
3301 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3302 result based on those same flags for the arguments. But if the
3303 arguments aren't really even `tree' expressions, we shouldn't be trying
3306 /* Expressions without side effects may be constant if their
3307 arguments are as well. */
3308 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3309 || TREE_CODE_CLASS (code
) == tcc_binary
);
3311 side_effects
= TREE_SIDE_EFFECTS (t
);
3316 TREE_READONLY (t
) = read_only
;
3317 TREE_CONSTANT (t
) = constant
;
3318 TREE_SIDE_EFFECTS (t
) = side_effects
;
3319 TREE_THIS_VOLATILE (t
)
3320 = (TREE_CODE_CLASS (code
) == tcc_reference
3321 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3328 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3329 tree arg2 MEM_STAT_DECL
)
3331 bool constant
, read_only
, side_effects
;
3334 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3335 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3337 t
= make_node_stat (code PASS_MEM_STAT
);
3340 /* As a special exception, if COND_EXPR has NULL branches, we
3341 assume that it is a gimple statement and always consider
3342 it to have side effects. */
3343 if (code
== COND_EXPR
3344 && tt
== void_type_node
3345 && arg1
== NULL_TREE
3346 && arg2
== NULL_TREE
)
3347 side_effects
= true;
3349 side_effects
= TREE_SIDE_EFFECTS (t
);
3355 TREE_SIDE_EFFECTS (t
) = side_effects
;
3356 TREE_THIS_VOLATILE (t
)
3357 = (TREE_CODE_CLASS (code
) == tcc_reference
3358 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3364 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3365 tree arg2
, tree arg3 MEM_STAT_DECL
)
3367 bool constant
, read_only
, side_effects
;
3370 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3372 t
= make_node_stat (code PASS_MEM_STAT
);
3375 side_effects
= TREE_SIDE_EFFECTS (t
);
3382 TREE_SIDE_EFFECTS (t
) = side_effects
;
3383 TREE_THIS_VOLATILE (t
)
3384 = (TREE_CODE_CLASS (code
) == tcc_reference
3385 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3391 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3392 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3394 bool constant
, read_only
, side_effects
;
3397 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3399 t
= make_node_stat (code PASS_MEM_STAT
);
3402 side_effects
= TREE_SIDE_EFFECTS (t
);
3410 TREE_SIDE_EFFECTS (t
) = side_effects
;
3411 TREE_THIS_VOLATILE (t
)
3412 = (TREE_CODE_CLASS (code
) == tcc_reference
3413 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3419 build7_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3420 tree arg2
, tree arg3
, tree arg4
, tree arg5
,
3421 tree arg6 MEM_STAT_DECL
)
3423 bool constant
, read_only
, side_effects
;
3426 gcc_assert (code
== TARGET_MEM_REF
);
3428 t
= make_node_stat (code PASS_MEM_STAT
);
3431 side_effects
= TREE_SIDE_EFFECTS (t
);
3441 TREE_SIDE_EFFECTS (t
) = side_effects
;
3442 TREE_THIS_VOLATILE (t
) = 0;
3447 /* Similar except don't specify the TREE_TYPE
3448 and leave the TREE_SIDE_EFFECTS as 0.
3449 It is permissible for arguments to be null,
3450 or even garbage if their values do not matter. */
3453 build_nt (enum tree_code code
, ...)
3460 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3464 t
= make_node (code
);
3465 length
= TREE_CODE_LENGTH (code
);
3467 for (i
= 0; i
< length
; i
++)
3468 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3474 /* Similar to build_nt, but for creating a CALL_EXPR object with
3475 ARGLIST passed as a list. */
3478 build_nt_call_list (tree fn
, tree arglist
)
3483 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
3484 CALL_EXPR_FN (t
) = fn
;
3485 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
3486 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
3487 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
3491 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3492 We do NOT enter this node in any sort of symbol table.
3494 layout_decl is used to set up the decl's storage layout.
3495 Other slots are initialized to 0 or null pointers. */
3498 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
3502 t
= make_node_stat (code PASS_MEM_STAT
);
3504 /* if (type == error_mark_node)
3505 type = integer_type_node; */
3506 /* That is not done, deliberately, so that having error_mark_node
3507 as the type can suppress useless errors in the use of this variable. */
3509 DECL_NAME (t
) = name
;
3510 TREE_TYPE (t
) = type
;
3512 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3518 /* Builds and returns function declaration with NAME and TYPE. */
3521 build_fn_decl (const char *name
, tree type
)
3523 tree id
= get_identifier (name
);
3524 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
3526 DECL_EXTERNAL (decl
) = 1;
3527 TREE_PUBLIC (decl
) = 1;
3528 DECL_ARTIFICIAL (decl
) = 1;
3529 TREE_NOTHROW (decl
) = 1;
3535 /* BLOCK nodes are used to represent the structure of binding contours
3536 and declarations, once those contours have been exited and their contents
3537 compiled. This information is used for outputting debugging info. */
3540 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3542 tree block
= make_node (BLOCK
);
3544 BLOCK_VARS (block
) = vars
;
3545 BLOCK_SUBBLOCKS (block
) = subblocks
;
3546 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3547 BLOCK_CHAIN (block
) = chain
;
3552 expand_location (source_location loc
)
3554 expanded_location xloc
;
3564 const struct line_map
*map
= linemap_lookup (line_table
, loc
);
3565 xloc
.file
= map
->to_file
;
3566 xloc
.line
= SOURCE_LINE (map
, loc
);
3567 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3568 xloc
.sysp
= map
->sysp
!= 0;
3574 /* Source location accessor functions. */
3578 set_expr_locus (tree node
, source_location
*loc
)
3581 EXPR_CHECK (node
)->exp
.locus
= UNKNOWN_LOCATION
;
3583 EXPR_CHECK (node
)->exp
.locus
= *loc
;
3586 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
3588 LOC is the location to use in tree T. */
3590 void protected_set_expr_location (tree t
, location_t loc
)
3592 if (t
&& CAN_HAVE_LOCATION_P (t
))
3593 SET_EXPR_LOCATION (t
, loc
);
3596 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3600 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3602 DECL_ATTRIBUTES (ddecl
) = attribute
;
3606 /* Borrowed from hashtab.c iterative_hash implementation. */
3607 #define mix(a,b,c) \
3609 a -= b; a -= c; a ^= (c>>13); \
3610 b -= c; b -= a; b ^= (a<< 8); \
3611 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3612 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3613 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3614 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3615 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3616 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3617 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3621 /* Produce good hash value combining VAL and VAL2. */
3623 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
3625 /* the golden ratio; an arbitrary value. */
3626 hashval_t a
= 0x9e3779b9;
3632 /* Produce good hash value combining PTR and VAL2. */
3633 static inline hashval_t
3634 iterative_hash_pointer (const void *ptr
, hashval_t val2
)
3636 if (sizeof (ptr
) == sizeof (hashval_t
))
3637 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
3640 hashval_t a
= (hashval_t
) (size_t) ptr
;
3641 /* Avoid warnings about shifting of more than the width of the type on
3642 hosts that won't execute this path. */
3644 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
3650 /* Produce good hash value combining VAL and VAL2. */
3651 static inline hashval_t
3652 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
3654 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
3655 return iterative_hash_hashval_t (val
, val2
);
3658 hashval_t a
= (hashval_t
) val
;
3659 /* Avoid warnings about shifting of more than the width of the type on
3660 hosts that won't execute this path. */
3662 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
3664 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
3666 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
3667 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
3674 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3675 is ATTRIBUTE and its qualifiers are QUALS.
3677 Record such modified types already made so we don't make duplicates. */
3680 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
3682 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3684 hashval_t hashcode
= 0;
3686 enum tree_code code
= TREE_CODE (ttype
);
3688 /* Building a distinct copy of a tagged type is inappropriate; it
3689 causes breakage in code that expects there to be a one-to-one
3690 relationship between a struct and its fields.
3691 build_duplicate_type is another solution (as used in
3692 handle_transparent_union_attribute), but that doesn't play well
3693 with the stronger C++ type identity model. */
3694 if (TREE_CODE (ttype
) == RECORD_TYPE
3695 || TREE_CODE (ttype
) == UNION_TYPE
3696 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
3697 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
3699 warning (OPT_Wattributes
,
3700 "ignoring attributes applied to %qT after definition",
3701 TYPE_MAIN_VARIANT (ttype
));
3702 return build_qualified_type (ttype
, quals
);
3705 ntype
= build_distinct_type_copy (ttype
);
3707 TYPE_ATTRIBUTES (ntype
) = attribute
;
3708 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3710 hashcode
= iterative_hash_object (code
, hashcode
);
3711 if (TREE_TYPE (ntype
))
3712 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3714 hashcode
= attribute_hash_list (attribute
, hashcode
);
3716 switch (TREE_CODE (ntype
))
3719 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3722 if (TYPE_DOMAIN (ntype
))
3723 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3727 hashcode
= iterative_hash_object
3728 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3729 hashcode
= iterative_hash_object
3730 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3733 case FIXED_POINT_TYPE
:
3735 unsigned int precision
= TYPE_PRECISION (ntype
);
3736 hashcode
= iterative_hash_object (precision
, hashcode
);
3743 ntype
= type_hash_canon (hashcode
, ntype
);
3745 /* If the target-dependent attributes make NTYPE different from
3746 its canonical type, we will need to use structural equality
3747 checks for this qualified type. */
3748 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
3749 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
3750 || !targetm
.comp_type_attributes (ntype
, ttype
))
3751 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
3753 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
3755 ttype
= build_qualified_type (ntype
, quals
);
3757 else if (TYPE_QUALS (ttype
) != quals
)
3758 ttype
= build_qualified_type (ttype
, quals
);
3764 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3767 Record such modified types already made so we don't make duplicates. */
3770 build_type_attribute_variant (tree ttype
, tree attribute
)
3772 return build_type_attribute_qual_variant (ttype
, attribute
,
3773 TYPE_QUALS (ttype
));
3776 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3779 We try both `text' and `__text__', ATTR may be either one. */
3780 /* ??? It might be a reasonable simplification to require ATTR to be only
3781 `text'. One might then also require attribute lists to be stored in
3782 their canonicalized form. */
3785 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
3790 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3793 p
= IDENTIFIER_POINTER (ident
);
3794 ident_len
= IDENTIFIER_LENGTH (ident
);
3796 if (ident_len
== attr_len
3797 && strcmp (attr
, p
) == 0)
3800 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3803 gcc_assert (attr
[1] == '_');
3804 gcc_assert (attr
[attr_len
- 2] == '_');
3805 gcc_assert (attr
[attr_len
- 1] == '_');
3806 if (ident_len
== attr_len
- 4
3807 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3812 if (ident_len
== attr_len
+ 4
3813 && p
[0] == '_' && p
[1] == '_'
3814 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3815 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3822 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3825 We try both `text' and `__text__', ATTR may be either one. */
3828 is_attribute_p (const char *attr
, const_tree ident
)
3830 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3833 /* Given an attribute name and a list of attributes, return a pointer to the
3834 attribute's list element if the attribute is part of the list, or NULL_TREE
3835 if not found. If the attribute appears more than once, this only
3836 returns the first occurrence; the TREE_CHAIN of the return value should
3837 be passed back in if further occurrences are wanted. */
3840 lookup_attribute (const char *attr_name
, tree list
)
3843 size_t attr_len
= strlen (attr_name
);
3845 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3847 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3848 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3854 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3858 remove_attribute (const char *attr_name
, tree list
)
3861 size_t attr_len
= strlen (attr_name
);
3863 for (p
= &list
; *p
; )
3866 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3867 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3868 *p
= TREE_CHAIN (l
);
3870 p
= &TREE_CHAIN (l
);
3876 /* Return an attribute list that is the union of a1 and a2. */
3879 merge_attributes (tree a1
, tree a2
)
3883 /* Either one unset? Take the set one. */
3885 if ((attributes
= a1
) == 0)
3888 /* One that completely contains the other? Take it. */
3890 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3892 if (attribute_list_contained (a2
, a1
))
3896 /* Pick the longest list, and hang on the other list. */
3898 if (list_length (a1
) < list_length (a2
))
3899 attributes
= a2
, a2
= a1
;
3901 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3904 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3907 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3910 if (TREE_VALUE (a
) != NULL
3911 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
3912 && TREE_VALUE (a2
) != NULL
3913 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
3915 if (simple_cst_list_equal (TREE_VALUE (a
),
3916 TREE_VALUE (a2
)) == 1)
3919 else if (simple_cst_equal (TREE_VALUE (a
),
3920 TREE_VALUE (a2
)) == 1)
3925 a1
= copy_node (a2
);
3926 TREE_CHAIN (a1
) = attributes
;
3935 /* Given types T1 and T2, merge their attributes and return
3939 merge_type_attributes (tree t1
, tree t2
)
3941 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3942 TYPE_ATTRIBUTES (t2
));
3945 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3949 merge_decl_attributes (tree olddecl
, tree newdecl
)
3951 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3952 DECL_ATTRIBUTES (newdecl
));
3955 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3957 /* Specialization of merge_decl_attributes for various Windows targets.
3959 This handles the following situation:
3961 __declspec (dllimport) int foo;
3964 The second instance of `foo' nullifies the dllimport. */
3967 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
3970 int delete_dllimport_p
= 1;
3972 /* What we need to do here is remove from `old' dllimport if it doesn't
3973 appear in `new'. dllimport behaves like extern: if a declaration is
3974 marked dllimport and a definition appears later, then the object
3975 is not dllimport'd. We also remove a `new' dllimport if the old list
3976 contains dllexport: dllexport always overrides dllimport, regardless
3977 of the order of declaration. */
3978 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
3979 delete_dllimport_p
= 0;
3980 else if (DECL_DLLIMPORT_P (new_tree
)
3981 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
3983 DECL_DLLIMPORT_P (new_tree
) = 0;
3984 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
3985 "dllimport ignored", new_tree
);
3987 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
3989 /* Warn about overriding a symbol that has already been used, e.g.:
3990 extern int __attribute__ ((dllimport)) foo;
3991 int* bar () {return &foo;}
3994 if (TREE_USED (old
))
3996 warning (0, "%q+D redeclared without dllimport attribute "
3997 "after being referenced with dll linkage", new_tree
);
3998 /* If we have used a variable's address with dllimport linkage,
3999 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
4000 decl may already have had TREE_CONSTANT computed.
4001 We still remove the attribute so that assembler code refers
4002 to '&foo rather than '_imp__foo'. */
4003 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
4004 DECL_DLLIMPORT_P (new_tree
) = 1;
4007 /* Let an inline definition silently override the external reference,
4008 but otherwise warn about attribute inconsistency. */
4009 else if (TREE_CODE (new_tree
) == VAR_DECL
4010 || !DECL_DECLARED_INLINE_P (new_tree
))
4011 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
4012 "previous dllimport ignored", new_tree
);
4015 delete_dllimport_p
= 0;
4017 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
4019 if (delete_dllimport_p
)
4022 const size_t attr_len
= strlen ("dllimport");
4024 /* Scan the list for dllimport and delete it. */
4025 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
4027 if (is_attribute_with_length_p ("dllimport", attr_len
,
4030 if (prev
== NULL_TREE
)
4033 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
4042 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4043 struct attribute_spec.handler. */
4046 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
4051 /* These attributes may apply to structure and union types being created,
4052 but otherwise should pass to the declaration involved. */
4055 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
4056 | (int) ATTR_FLAG_ARRAY_NEXT
))
4058 *no_add_attrs
= true;
4059 return tree_cons (name
, args
, NULL_TREE
);
4061 if (TREE_CODE (node
) == RECORD_TYPE
4062 || TREE_CODE (node
) == UNION_TYPE
)
4064 node
= TYPE_NAME (node
);
4070 warning (OPT_Wattributes
, "%qs attribute ignored",
4071 IDENTIFIER_POINTER (name
));
4072 *no_add_attrs
= true;
4077 if (TREE_CODE (node
) != FUNCTION_DECL
4078 && TREE_CODE (node
) != VAR_DECL
4079 && TREE_CODE (node
) != TYPE_DECL
)
4081 *no_add_attrs
= true;
4082 warning (OPT_Wattributes
, "%qs attribute ignored",
4083 IDENTIFIER_POINTER (name
));
4087 if (TREE_CODE (node
) == TYPE_DECL
4088 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
4089 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
4091 *no_add_attrs
= true;
4092 warning (OPT_Wattributes
, "%qs attribute ignored",
4093 IDENTIFIER_POINTER (name
));
4097 /* Report error on dllimport ambiguities seen now before they cause
4099 else if (is_attribute_p ("dllimport", name
))
4101 /* Honor any target-specific overrides. */
4102 if (!targetm
.valid_dllimport_attribute_p (node
))
4103 *no_add_attrs
= true;
4105 else if (TREE_CODE (node
) == FUNCTION_DECL
4106 && DECL_DECLARED_INLINE_P (node
))
4108 warning (OPT_Wattributes
, "inline function %q+D declared as "
4109 " dllimport: attribute ignored", node
);
4110 *no_add_attrs
= true;
4112 /* Like MS, treat definition of dllimported variables and
4113 non-inlined functions on declaration as syntax errors. */
4114 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
4116 error ("function %q+D definition is marked dllimport", node
);
4117 *no_add_attrs
= true;
4120 else if (TREE_CODE (node
) == VAR_DECL
)
4122 if (DECL_INITIAL (node
))
4124 error ("variable %q+D definition is marked dllimport",
4126 *no_add_attrs
= true;
4129 /* `extern' needn't be specified with dllimport.
4130 Specify `extern' now and hope for the best. Sigh. */
4131 DECL_EXTERNAL (node
) = 1;
4132 /* Also, implicitly give dllimport'd variables declared within
4133 a function global scope, unless declared static. */
4134 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
4135 TREE_PUBLIC (node
) = 1;
4138 if (*no_add_attrs
== false)
4139 DECL_DLLIMPORT_P (node
) = 1;
4142 /* Report error if symbol is not accessible at global scope. */
4143 if (!TREE_PUBLIC (node
)
4144 && (TREE_CODE (node
) == VAR_DECL
4145 || TREE_CODE (node
) == FUNCTION_DECL
))
4147 error ("external linkage required for symbol %q+D because of "
4148 "%qs attribute", node
, IDENTIFIER_POINTER (name
));
4149 *no_add_attrs
= true;
4152 /* A dllexport'd entity must have default visibility so that other
4153 program units (shared libraries or the main executable) can see
4154 it. A dllimport'd entity must have default visibility so that
4155 the linker knows that undefined references within this program
4156 unit can be resolved by the dynamic linker. */
4159 if (DECL_VISIBILITY_SPECIFIED (node
)
4160 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
4161 error ("%qs implies default visibility, but %qD has already "
4162 "been declared with a different visibility",
4163 IDENTIFIER_POINTER (name
), node
);
4164 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
4165 DECL_VISIBILITY_SPECIFIED (node
) = 1;
4171 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4173 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4174 of the various TYPE_QUAL values. */
4177 set_type_quals (tree type
, int type_quals
)
4179 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
4180 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
4181 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
4184 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4187 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
4189 return (TYPE_QUALS (cand
) == type_quals
4190 && TYPE_NAME (cand
) == TYPE_NAME (base
)
4191 /* Apparently this is needed for Objective-C. */
4192 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
4193 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
4194 TYPE_ATTRIBUTES (base
)));
4197 /* Return a version of the TYPE, qualified as indicated by the
4198 TYPE_QUALS, if one exists. If no qualified version exists yet,
4199 return NULL_TREE. */
4202 get_qualified_type (tree type
, int type_quals
)
4206 if (TYPE_QUALS (type
) == type_quals
)
4209 /* Search the chain of variants to see if there is already one there just
4210 like the one we need to have. If so, use that existing one. We must
4211 preserve the TYPE_NAME, since there is code that depends on this. */
4212 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4213 if (check_qualified_type (t
, type
, type_quals
))
4219 /* Like get_qualified_type, but creates the type if it does not
4220 exist. This function never returns NULL_TREE. */
4223 build_qualified_type (tree type
, int type_quals
)
4227 /* See if we already have the appropriate qualified variant. */
4228 t
= get_qualified_type (type
, type_quals
);
4230 /* If not, build it. */
4233 t
= build_variant_type_copy (type
);
4234 set_type_quals (t
, type_quals
);
4236 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4237 /* Propagate structural equality. */
4238 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4239 else if (TYPE_CANONICAL (type
) != type
)
4240 /* Build the underlying canonical type, since it is different
4242 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
4245 /* T is its own canonical type. */
4246 TYPE_CANONICAL (t
) = t
;
4253 /* Create a new distinct copy of TYPE. The new type is made its own
4254 MAIN_VARIANT. If TYPE requires structural equality checks, the
4255 resulting type requires structural equality checks; otherwise, its
4256 TYPE_CANONICAL points to itself. */
4259 build_distinct_type_copy (tree type
)
4261 tree t
= copy_node (type
);
4263 TYPE_POINTER_TO (t
) = 0;
4264 TYPE_REFERENCE_TO (t
) = 0;
4266 /* Set the canonical type either to a new equivalence class, or
4267 propagate the need for structural equality checks. */
4268 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4269 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4271 TYPE_CANONICAL (t
) = t
;
4273 /* Make it its own variant. */
4274 TYPE_MAIN_VARIANT (t
) = t
;
4275 TYPE_NEXT_VARIANT (t
) = 0;
4277 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4278 whose TREE_TYPE is not t. This can also happen in the Ada
4279 frontend when using subtypes. */
4284 /* Create a new variant of TYPE, equivalent but distinct. This is so
4285 the caller can modify it. TYPE_CANONICAL for the return type will
4286 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4287 are considered equal by the language itself (or that both types
4288 require structural equality checks). */
4291 build_variant_type_copy (tree type
)
4293 tree t
, m
= TYPE_MAIN_VARIANT (type
);
4295 t
= build_distinct_type_copy (type
);
4297 /* Since we're building a variant, assume that it is a non-semantic
4298 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4299 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
4301 /* Add the new type to the chain of variants of TYPE. */
4302 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
4303 TYPE_NEXT_VARIANT (m
) = t
;
4304 TYPE_MAIN_VARIANT (t
) = m
;
4309 /* Return true if the from tree in both tree maps are equal. */
4312 tree_map_base_eq (const void *va
, const void *vb
)
4314 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
4315 *const b
= (const struct tree_map_base
*) vb
;
4316 return (a
->from
== b
->from
);
4319 /* Hash a from tree in a tree_map. */
4322 tree_map_base_hash (const void *item
)
4324 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
4327 /* Return true if this tree map structure is marked for garbage collection
4328 purposes. We simply return true if the from tree is marked, so that this
4329 structure goes away when the from tree goes away. */
4332 tree_map_base_marked_p (const void *p
)
4334 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
4338 tree_map_hash (const void *item
)
4340 return (((const struct tree_map
*) item
)->hash
);
4343 /* Return the initialization priority for DECL. */
4346 decl_init_priority_lookup (tree decl
)
4348 struct tree_priority_map
*h
;
4349 struct tree_map_base in
;
4351 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
4353 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
4354 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
4357 /* Return the finalization priority for DECL. */
4360 decl_fini_priority_lookup (tree decl
)
4362 struct tree_priority_map
*h
;
4363 struct tree_map_base in
;
4365 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
4367 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
4368 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
4371 /* Return the initialization and finalization priority information for
4372 DECL. If there is no previous priority information, a freshly
4373 allocated structure is returned. */
4375 static struct tree_priority_map
*
4376 decl_priority_info (tree decl
)
4378 struct tree_priority_map in
;
4379 struct tree_priority_map
*h
;
4382 in
.base
.from
= decl
;
4383 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
4384 h
= (struct tree_priority_map
*) *loc
;
4387 h
= GGC_CNEW (struct tree_priority_map
);
4389 h
->base
.from
= decl
;
4390 h
->init
= DEFAULT_INIT_PRIORITY
;
4391 h
->fini
= DEFAULT_INIT_PRIORITY
;
4397 /* Set the initialization priority for DECL to PRIORITY. */
4400 decl_init_priority_insert (tree decl
, priority_type priority
)
4402 struct tree_priority_map
*h
;
4404 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
4405 h
= decl_priority_info (decl
);
4409 /* Set the finalization priority for DECL to PRIORITY. */
4412 decl_fini_priority_insert (tree decl
, priority_type priority
)
4414 struct tree_priority_map
*h
;
4416 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
4417 h
= decl_priority_info (decl
);
4421 /* Look up a restrict qualified base decl for FROM. */
4424 decl_restrict_base_lookup (tree from
)
4429 in
.base
.from
= from
;
4430 h
= (struct tree_map
*) htab_find_with_hash (restrict_base_for_decl
, &in
,
4431 htab_hash_pointer (from
));
4432 return h
? h
->to
: NULL_TREE
;
4435 /* Record the restrict qualified base TO for FROM. */
4438 decl_restrict_base_insert (tree from
, tree to
)
4443 h
= GGC_NEW (struct tree_map
);
4444 h
->hash
= htab_hash_pointer (from
);
4445 h
->base
.from
= from
;
4447 loc
= htab_find_slot_with_hash (restrict_base_for_decl
, h
, h
->hash
, INSERT
);
4448 *(struct tree_map
**) loc
= h
;
4451 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4454 print_debug_expr_statistics (void)
4456 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4457 (long) htab_size (debug_expr_for_decl
),
4458 (long) htab_elements (debug_expr_for_decl
),
4459 htab_collisions (debug_expr_for_decl
));
4462 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4465 print_value_expr_statistics (void)
4467 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4468 (long) htab_size (value_expr_for_decl
),
4469 (long) htab_elements (value_expr_for_decl
),
4470 htab_collisions (value_expr_for_decl
));
4473 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4474 don't print anything if the table is empty. */
4477 print_restrict_base_statistics (void)
4479 if (htab_elements (restrict_base_for_decl
) != 0)
4481 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4482 (long) htab_size (restrict_base_for_decl
),
4483 (long) htab_elements (restrict_base_for_decl
),
4484 htab_collisions (restrict_base_for_decl
));
4487 /* Lookup a debug expression for FROM, and return it if we find one. */
4490 decl_debug_expr_lookup (tree from
)
4492 struct tree_map
*h
, in
;
4493 in
.base
.from
= from
;
4495 h
= (struct tree_map
*) htab_find_with_hash (debug_expr_for_decl
, &in
,
4496 htab_hash_pointer (from
));
4502 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4505 decl_debug_expr_insert (tree from
, tree to
)
4510 h
= GGC_NEW (struct tree_map
);
4511 h
->hash
= htab_hash_pointer (from
);
4512 h
->base
.from
= from
;
4514 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
4515 *(struct tree_map
**) loc
= h
;
4518 /* Lookup a value expression for FROM, and return it if we find one. */
4521 decl_value_expr_lookup (tree from
)
4523 struct tree_map
*h
, in
;
4524 in
.base
.from
= from
;
4526 h
= (struct tree_map
*) htab_find_with_hash (value_expr_for_decl
, &in
,
4527 htab_hash_pointer (from
));
4533 /* Insert a mapping FROM->TO in the value expression hashtable. */
4536 decl_value_expr_insert (tree from
, tree to
)
4541 h
= GGC_NEW (struct tree_map
);
4542 h
->hash
= htab_hash_pointer (from
);
4543 h
->base
.from
= from
;
4545 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
4546 *(struct tree_map
**) loc
= h
;
4549 /* Hashing of types so that we don't make duplicates.
4550 The entry point is `type_hash_canon'. */
4552 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4553 with types in the TREE_VALUE slots), by adding the hash codes
4554 of the individual types. */
4557 type_hash_list (const_tree list
, hashval_t hashcode
)
4561 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4562 if (TREE_VALUE (tail
) != error_mark_node
)
4563 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
4569 /* These are the Hashtable callback functions. */
4571 /* Returns true iff the types are equivalent. */
4574 type_hash_eq (const void *va
, const void *vb
)
4576 const struct type_hash
*const a
= (const struct type_hash
*) va
,
4577 *const b
= (const struct type_hash
*) vb
;
4579 /* First test the things that are the same for all types. */
4580 if (a
->hash
!= b
->hash
4581 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
4582 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
4583 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
4584 TYPE_ATTRIBUTES (b
->type
))
4585 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
4586 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
4589 switch (TREE_CODE (a
->type
))
4594 case REFERENCE_TYPE
:
4598 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
4601 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
4602 && !(TYPE_VALUES (a
->type
)
4603 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
4604 && TYPE_VALUES (b
->type
)
4605 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
4606 && type_list_equal (TYPE_VALUES (a
->type
),
4607 TYPE_VALUES (b
->type
))))
4610 /* ... fall through ... */
4615 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
4616 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
4617 TYPE_MAX_VALUE (b
->type
)))
4618 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
4619 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
4620 TYPE_MIN_VALUE (b
->type
))));
4622 case FIXED_POINT_TYPE
:
4623 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
4626 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
4629 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
4630 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4631 || (TYPE_ARG_TYPES (a
->type
)
4632 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4633 && TYPE_ARG_TYPES (b
->type
)
4634 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4635 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4636 TYPE_ARG_TYPES (b
->type
)))));
4639 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
4643 case QUAL_UNION_TYPE
:
4644 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
4645 || (TYPE_FIELDS (a
->type
)
4646 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
4647 && TYPE_FIELDS (b
->type
)
4648 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
4649 && type_list_equal (TYPE_FIELDS (a
->type
),
4650 TYPE_FIELDS (b
->type
))));
4653 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4654 || (TYPE_ARG_TYPES (a
->type
)
4655 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4656 && TYPE_ARG_TYPES (b
->type
)
4657 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4658 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4659 TYPE_ARG_TYPES (b
->type
))))
4667 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
4668 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
4673 /* Return the cached hash value. */
4676 type_hash_hash (const void *item
)
4678 return ((const struct type_hash
*) item
)->hash
;
4681 /* Look in the type hash table for a type isomorphic to TYPE.
4682 If one is found, return it. Otherwise return 0. */
4685 type_hash_lookup (hashval_t hashcode
, tree type
)
4687 struct type_hash
*h
, in
;
4689 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4690 must call that routine before comparing TYPE_ALIGNs. */
4696 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
4703 /* Add an entry to the type-hash-table
4704 for a type TYPE whose hash code is HASHCODE. */
4707 type_hash_add (hashval_t hashcode
, tree type
)
4709 struct type_hash
*h
;
4712 h
= GGC_NEW (struct type_hash
);
4715 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
4719 /* Given TYPE, and HASHCODE its hash code, return the canonical
4720 object for an identical type if one already exists.
4721 Otherwise, return TYPE, and record it as the canonical object.
4723 To use this function, first create a type of the sort you want.
4724 Then compute its hash code from the fields of the type that
4725 make it different from other similar types.
4726 Then call this function and use the value. */
4729 type_hash_canon (unsigned int hashcode
, tree type
)
4733 /* The hash table only contains main variants, so ensure that's what we're
4735 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
4737 if (!lang_hooks
.types
.hash_types
)
4740 /* See if the type is in the hash table already. If so, return it.
4741 Otherwise, add the type. */
4742 t1
= type_hash_lookup (hashcode
, type
);
4745 #ifdef GATHER_STATISTICS
4746 tree_node_counts
[(int) t_kind
]--;
4747 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
4753 type_hash_add (hashcode
, type
);
4758 /* See if the data pointed to by the type hash table is marked. We consider
4759 it marked if the type is marked or if a debug type number or symbol
4760 table entry has been made for the type. This reduces the amount of
4761 debugging output and eliminates that dependency of the debug output on
4762 the number of garbage collections. */
4765 type_hash_marked_p (const void *p
)
4767 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
4769 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
4773 print_type_hash_statistics (void)
4775 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
4776 (long) htab_size (type_hash_table
),
4777 (long) htab_elements (type_hash_table
),
4778 htab_collisions (type_hash_table
));
4781 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4782 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4783 by adding the hash codes of the individual attributes. */
4786 attribute_hash_list (const_tree list
, hashval_t hashcode
)
4790 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4791 /* ??? Do we want to add in TREE_VALUE too? */
4792 hashcode
= iterative_hash_object
4793 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
4797 /* Given two lists of attributes, return true if list l2 is
4798 equivalent to l1. */
4801 attribute_list_equal (const_tree l1
, const_tree l2
)
4803 return attribute_list_contained (l1
, l2
)
4804 && attribute_list_contained (l2
, l1
);
4807 /* Given two lists of attributes, return true if list L2 is
4808 completely contained within L1. */
4809 /* ??? This would be faster if attribute names were stored in a canonicalized
4810 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4811 must be used to show these elements are equivalent (which they are). */
4812 /* ??? It's not clear that attributes with arguments will always be handled
4816 attribute_list_contained (const_tree l1
, const_tree l2
)
4820 /* First check the obvious, maybe the lists are identical. */
4824 /* Maybe the lists are similar. */
4825 for (t1
= l1
, t2
= l2
;
4827 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
4828 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
4829 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
4831 /* Maybe the lists are equal. */
4832 if (t1
== 0 && t2
== 0)
4835 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
4838 /* This CONST_CAST is okay because lookup_attribute does not
4839 modify its argument and the return value is assigned to a
4841 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4842 CONST_CAST_TREE(l1
));
4844 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4847 if (TREE_VALUE (t2
) != NULL
4848 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
4849 && TREE_VALUE (attr
) != NULL
4850 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
4852 if (simple_cst_list_equal (TREE_VALUE (t2
),
4853 TREE_VALUE (attr
)) == 1)
4856 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
4867 /* Given two lists of types
4868 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4869 return 1 if the lists contain the same types in the same order.
4870 Also, the TREE_PURPOSEs must match. */
4873 type_list_equal (const_tree l1
, const_tree l2
)
4877 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
4878 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
4879 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
4880 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
4881 && (TREE_TYPE (TREE_PURPOSE (t1
))
4882 == TREE_TYPE (TREE_PURPOSE (t2
))))))
4888 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4889 given by TYPE. If the argument list accepts variable arguments,
4890 then this function counts only the ordinary arguments. */
4893 type_num_arguments (const_tree type
)
4898 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
4899 /* If the function does not take a variable number of arguments,
4900 the last element in the list will have type `void'. */
4901 if (VOID_TYPE_P (TREE_VALUE (t
)))
4909 /* Nonzero if integer constants T1 and T2
4910 represent the same constant value. */
4913 tree_int_cst_equal (const_tree t1
, const_tree t2
)
4918 if (t1
== 0 || t2
== 0)
4921 if (TREE_CODE (t1
) == INTEGER_CST
4922 && TREE_CODE (t2
) == INTEGER_CST
4923 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4924 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
4930 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4931 The precise way of comparison depends on their data type. */
4934 tree_int_cst_lt (const_tree t1
, const_tree t2
)
4939 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
4941 int t1_sgn
= tree_int_cst_sgn (t1
);
4942 int t2_sgn
= tree_int_cst_sgn (t2
);
4944 if (t1_sgn
< t2_sgn
)
4946 else if (t1_sgn
> t2_sgn
)
4948 /* Otherwise, both are non-negative, so we compare them as
4949 unsigned just in case one of them would overflow a signed
4952 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
4953 return INT_CST_LT (t1
, t2
);
4955 return INT_CST_LT_UNSIGNED (t1
, t2
);
4958 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4961 tree_int_cst_compare (const_tree t1
, const_tree t2
)
4963 if (tree_int_cst_lt (t1
, t2
))
4965 else if (tree_int_cst_lt (t2
, t1
))
4971 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4972 the host. If POS is zero, the value can be represented in a single
4973 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4974 be represented in a single unsigned HOST_WIDE_INT. */
4977 host_integerp (const_tree t
, int pos
)
4979 return (TREE_CODE (t
) == INTEGER_CST
4980 && ((TREE_INT_CST_HIGH (t
) == 0
4981 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
4982 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
4983 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
4984 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
4985 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
4986 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
4987 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
4990 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4991 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4992 be non-negative. We must be able to satisfy the above conditions. */
4995 tree_low_cst (const_tree t
, int pos
)
4997 gcc_assert (host_integerp (t
, pos
));
4998 return TREE_INT_CST_LOW (t
);
5001 /* Return the most significant bit of the integer constant T. */
5004 tree_int_cst_msb (const_tree t
)
5008 unsigned HOST_WIDE_INT l
;
5010 /* Note that using TYPE_PRECISION here is wrong. We care about the
5011 actual bits, not the (arbitrary) range of the type. */
5012 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
5013 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
5014 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
5015 return (l
& 1) == 1;
5018 /* Return an indication of the sign of the integer constant T.
5019 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
5020 Note that -1 will never be returned if T's type is unsigned. */
5023 tree_int_cst_sgn (const_tree t
)
5025 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
5027 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
5029 else if (TREE_INT_CST_HIGH (t
) < 0)
5035 /* Compare two constructor-element-type constants. Return 1 if the lists
5036 are known to be equal; otherwise return 0. */
5039 simple_cst_list_equal (const_tree l1
, const_tree l2
)
5041 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
5043 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
5046 l1
= TREE_CHAIN (l1
);
5047 l2
= TREE_CHAIN (l2
);
5053 /* Return truthvalue of whether T1 is the same tree structure as T2.
5054 Return 1 if they are the same.
5055 Return 0 if they are understandably different.
5056 Return -1 if either contains tree structure not understood by
5060 simple_cst_equal (const_tree t1
, const_tree t2
)
5062 enum tree_code code1
, code2
;
5068 if (t1
== 0 || t2
== 0)
5071 code1
= TREE_CODE (t1
);
5072 code2
= TREE_CODE (t2
);
5074 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
5076 if (CONVERT_EXPR_CODE_P (code2
)
5077 || code2
== NON_LVALUE_EXPR
)
5078 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5080 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
5083 else if (CONVERT_EXPR_CODE_P (code2
)
5084 || code2
== NON_LVALUE_EXPR
)
5085 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
5093 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
5094 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
5097 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
5100 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
5103 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
5104 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
5105 TREE_STRING_LENGTH (t1
)));
5109 unsigned HOST_WIDE_INT idx
;
5110 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
5111 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
5113 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
5116 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
5117 /* ??? Should we handle also fields here? */
5118 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
5119 VEC_index (constructor_elt
, v2
, idx
)->value
))
5125 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5128 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
5131 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
5134 const_tree arg1
, arg2
;
5135 const_call_expr_arg_iterator iter1
, iter2
;
5136 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
5137 arg2
= first_const_call_expr_arg (t2
, &iter2
);
5139 arg1
= next_const_call_expr_arg (&iter1
),
5140 arg2
= next_const_call_expr_arg (&iter2
))
5142 cmp
= simple_cst_equal (arg1
, arg2
);
5146 return arg1
== arg2
;
5150 /* Special case: if either target is an unallocated VAR_DECL,
5151 it means that it's going to be unified with whatever the
5152 TARGET_EXPR is really supposed to initialize, so treat it
5153 as being equivalent to anything. */
5154 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
5155 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
5156 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
5157 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
5158 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
5159 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
5162 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5167 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
5169 case WITH_CLEANUP_EXPR
:
5170 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5174 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
5177 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
5178 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5192 /* This general rule works for most tree codes. All exceptions should be
5193 handled above. If this is a language-specific tree code, we can't
5194 trust what might be in the operand, so say we don't know
5196 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
5199 switch (TREE_CODE_CLASS (code1
))
5203 case tcc_comparison
:
5204 case tcc_expression
:
5208 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
5210 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
5222 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5223 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5224 than U, respectively. */
5227 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
5229 if (tree_int_cst_sgn (t
) < 0)
5231 else if (TREE_INT_CST_HIGH (t
) != 0)
5233 else if (TREE_INT_CST_LOW (t
) == u
)
5235 else if (TREE_INT_CST_LOW (t
) < u
)
5241 /* Return true if CODE represents an associative tree code. Otherwise
5244 associative_tree_code (enum tree_code code
)
5263 /* Return true if CODE represents a commutative tree code. Otherwise
5266 commutative_tree_code (enum tree_code code
)
5279 case UNORDERED_EXPR
:
5283 case TRUTH_AND_EXPR
:
5284 case TRUTH_XOR_EXPR
:
5294 /* Generate a hash value for an expression. This can be used iteratively
5295 by passing a previous result as the VAL argument.
5297 This function is intended to produce the same hash for expressions which
5298 would compare equal using operand_equal_p. */
5301 iterative_hash_expr (const_tree t
, hashval_t val
)
5304 enum tree_code code
;
5308 return iterative_hash_pointer (t
, val
);
5310 code
= TREE_CODE (t
);
5314 /* Alas, constants aren't shared, so we can't rely on pointer
5317 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
5318 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
5321 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
5323 return iterative_hash_hashval_t (val2
, val
);
5327 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
5329 return iterative_hash_hashval_t (val2
, val
);
5332 return iterative_hash (TREE_STRING_POINTER (t
),
5333 TREE_STRING_LENGTH (t
), val
);
5335 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
5336 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
5338 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
5341 /* we can just compare by pointer. */
5342 return iterative_hash_pointer (t
, val
);
5345 /* A list of expressions, for a CALL_EXPR or as the elements of a
5347 for (; t
; t
= TREE_CHAIN (t
))
5348 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
5352 unsigned HOST_WIDE_INT idx
;
5354 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
5356 val
= iterative_hash_expr (field
, val
);
5357 val
= iterative_hash_expr (value
, val
);
5362 /* When referring to a built-in FUNCTION_DECL, use the
5363 __builtin__ form. Otherwise nodes that compare equal
5364 according to operand_equal_p might get different
5366 if (DECL_BUILT_IN (t
))
5368 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
5372 /* else FALL THROUGH */
5374 tclass
= TREE_CODE_CLASS (code
);
5376 if (tclass
== tcc_declaration
)
5378 /* DECL's have a unique ID */
5379 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
5383 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
5385 val
= iterative_hash_object (code
, val
);
5387 /* Don't hash the type, that can lead to having nodes which
5388 compare equal according to operand_equal_p, but which
5389 have different hash codes. */
5390 if (CONVERT_EXPR_CODE_P (code
)
5391 || code
== NON_LVALUE_EXPR
)
5393 /* Make sure to include signness in the hash computation. */
5394 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
5395 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
5398 else if (commutative_tree_code (code
))
5400 /* It's a commutative expression. We want to hash it the same
5401 however it appears. We do this by first hashing both operands
5402 and then rehashing based on the order of their independent
5404 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
5405 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
5409 t
= one
, one
= two
, two
= t
;
5411 val
= iterative_hash_hashval_t (one
, val
);
5412 val
= iterative_hash_hashval_t (two
, val
);
5415 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
5416 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
5423 /* Generate a hash value for a pair of expressions. This can be used
5424 iteratively by passing a previous result as the VAL argument.
5426 The same hash value is always returned for a given pair of expressions,
5427 regardless of the order in which they are presented. This is useful in
5428 hashing the operands of commutative functions. */
5431 iterative_hash_exprs_commutative (const_tree t1
,
5432 const_tree t2
, hashval_t val
)
5434 hashval_t one
= iterative_hash_expr (t1
, 0);
5435 hashval_t two
= iterative_hash_expr (t2
, 0);
5439 t
= one
, one
= two
, two
= t
;
5440 val
= iterative_hash_hashval_t (one
, val
);
5441 val
= iterative_hash_hashval_t (two
, val
);
5446 /* Constructors for pointer, array and function types.
5447 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5448 constructed by language-dependent code, not here.) */
5450 /* Construct, lay out and return the type of pointers to TO_TYPE with
5451 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5452 reference all of memory. If such a type has already been
5453 constructed, reuse it. */
5456 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
5461 if (to_type
== error_mark_node
)
5462 return error_mark_node
;
5464 /* If the pointed-to type has the may_alias attribute set, force
5465 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5466 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
5467 can_alias_all
= true;
5469 /* In some cases, languages will have things that aren't a POINTER_TYPE
5470 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5471 In that case, return that type without regard to the rest of our
5474 ??? This is a kludge, but consistent with the way this function has
5475 always operated and there doesn't seem to be a good way to avoid this
5477 if (TYPE_POINTER_TO (to_type
) != 0
5478 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
5479 return TYPE_POINTER_TO (to_type
);
5481 /* First, if we already have a type for pointers to TO_TYPE and it's
5482 the proper mode, use it. */
5483 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
5484 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5487 t
= make_node (POINTER_TYPE
);
5489 TREE_TYPE (t
) = to_type
;
5490 TYPE_MODE (t
) = mode
;
5491 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5492 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
5493 TYPE_POINTER_TO (to_type
) = t
;
5495 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5496 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5497 else if (TYPE_CANONICAL (to_type
) != to_type
)
5499 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
5500 mode
, can_alias_all
);
5502 /* Lay out the type. This function has many callers that are concerned
5503 with expression-construction, and this simplifies them all. */
5509 /* By default build pointers in ptr_mode. */
5512 build_pointer_type (tree to_type
)
5514 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
5517 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5520 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
5525 if (to_type
== error_mark_node
)
5526 return error_mark_node
;
5528 /* If the pointed-to type has the may_alias attribute set, force
5529 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
5530 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
5531 can_alias_all
= true;
5533 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5534 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5535 In that case, return that type without regard to the rest of our
5538 ??? This is a kludge, but consistent with the way this function has
5539 always operated and there doesn't seem to be a good way to avoid this
5541 if (TYPE_REFERENCE_TO (to_type
) != 0
5542 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
5543 return TYPE_REFERENCE_TO (to_type
);
5545 /* First, if we already have a type for pointers to TO_TYPE and it's
5546 the proper mode, use it. */
5547 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
5548 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5551 t
= make_node (REFERENCE_TYPE
);
5553 TREE_TYPE (t
) = to_type
;
5554 TYPE_MODE (t
) = mode
;
5555 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5556 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
5557 TYPE_REFERENCE_TO (to_type
) = t
;
5559 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5560 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5561 else if (TYPE_CANONICAL (to_type
) != to_type
)
5563 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
5564 mode
, can_alias_all
);
5572 /* Build the node for the type of references-to-TO_TYPE by default
5576 build_reference_type (tree to_type
)
5578 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
5581 /* Build a type that is compatible with t but has no cv quals anywhere
5584 const char *const *const * -> char ***. */
5587 build_type_no_quals (tree t
)
5589 switch (TREE_CODE (t
))
5592 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5594 TYPE_REF_CAN_ALIAS_ALL (t
));
5595 case REFERENCE_TYPE
:
5597 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5599 TYPE_REF_CAN_ALIAS_ALL (t
));
5601 return TYPE_MAIN_VARIANT (t
);
5605 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5606 MAXVAL should be the maximum value in the domain
5607 (one less than the length of the array).
5609 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5610 We don't enforce this limit, that is up to caller (e.g. language front end).
5611 The limit exists because the result is a signed type and we don't handle
5612 sizes that use more than one HOST_WIDE_INT. */
5615 build_index_type (tree maxval
)
5617 tree itype
= make_node (INTEGER_TYPE
);
5619 TREE_TYPE (itype
) = sizetype
;
5620 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
5621 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5622 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
5623 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
5624 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
5625 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
5626 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
5627 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
5629 if (host_integerp (maxval
, 1))
5630 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
5633 /* Since we cannot hash this type, we need to compare it using
5634 structural equality checks. */
5635 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
5640 /* Builds a signed or unsigned integer type of precision PRECISION.
5641 Used for C bitfields whose precision does not match that of
5642 built-in target types. */
5644 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
5647 tree itype
= make_node (INTEGER_TYPE
);
5649 TYPE_PRECISION (itype
) = precision
;
5652 fixup_unsigned_type (itype
);
5654 fixup_signed_type (itype
);
5656 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
5657 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
5662 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5663 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5664 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5667 build_range_type (tree type
, tree lowval
, tree highval
)
5669 tree itype
= make_node (INTEGER_TYPE
);
5671 TREE_TYPE (itype
) = type
;
5672 if (type
== NULL_TREE
)
5675 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
5676 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
5678 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
5679 TYPE_MODE (itype
) = TYPE_MODE (type
);
5680 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
5681 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
5682 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
5683 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
5685 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
5686 return type_hash_canon (tree_low_cst (highval
, 0)
5687 - tree_low_cst (lowval
, 0),
5693 /* Just like build_index_type, but takes lowval and highval instead
5694 of just highval (maxval). */
5697 build_index_2_type (tree lowval
, tree highval
)
5699 return build_range_type (sizetype
, lowval
, highval
);
5702 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5703 and number of elements specified by the range of values of INDEX_TYPE.
5704 If such a type has already been constructed, reuse it. */
5707 build_array_type (tree elt_type
, tree index_type
)
5710 hashval_t hashcode
= 0;
5712 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
5714 error ("arrays of functions are not meaningful");
5715 elt_type
= integer_type_node
;
5718 t
= make_node (ARRAY_TYPE
);
5719 TREE_TYPE (t
) = elt_type
;
5720 TYPE_DOMAIN (t
) = index_type
;
5722 if (index_type
== 0)
5725 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5726 t
= type_hash_canon (hashcode
, t
);
5730 if (TYPE_CANONICAL (t
) == t
)
5732 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
))
5733 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5734 else if (TYPE_CANONICAL (elt_type
) != elt_type
)
5736 = build_array_type (TYPE_CANONICAL (elt_type
), index_type
);
5742 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5743 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
5744 t
= type_hash_canon (hashcode
, t
);
5746 if (!COMPLETE_TYPE_P (t
))
5749 if (TYPE_CANONICAL (t
) == t
)
5751 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
5752 || TYPE_STRUCTURAL_EQUALITY_P (index_type
))
5753 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5754 else if (TYPE_CANONICAL (elt_type
) != elt_type
5755 || TYPE_CANONICAL (index_type
) != index_type
)
5757 = build_array_type (TYPE_CANONICAL (elt_type
),
5758 TYPE_CANONICAL (index_type
));
5764 /* Recursively examines the array elements of TYPE, until a non-array
5765 element type is found. */
5768 strip_array_types (tree type
)
5770 while (TREE_CODE (type
) == ARRAY_TYPE
)
5771 type
= TREE_TYPE (type
);
5776 /* Computes the canonical argument types from the argument type list
5779 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5780 on entry to this function, or if any of the ARGTYPES are
5783 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5784 true on entry to this function, or if any of the ARGTYPES are
5787 Returns a canonical argument list, which may be ARGTYPES when the
5788 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5789 true) or would not differ from ARGTYPES. */
5792 maybe_canonicalize_argtypes(tree argtypes
,
5793 bool *any_structural_p
,
5794 bool *any_noncanonical_p
)
5797 bool any_noncanonical_argtypes_p
= false;
5799 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
5801 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
5802 /* Fail gracefully by stating that the type is structural. */
5803 *any_structural_p
= true;
5804 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
5805 *any_structural_p
= true;
5806 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
5807 || TREE_PURPOSE (arg
))
5808 /* If the argument has a default argument, we consider it
5809 non-canonical even though the type itself is canonical.
5810 That way, different variants of function and method types
5811 with default arguments will all point to the variant with
5812 no defaults as their canonical type. */
5813 any_noncanonical_argtypes_p
= true;
5816 if (*any_structural_p
)
5819 if (any_noncanonical_argtypes_p
)
5821 /* Build the canonical list of argument types. */
5822 tree canon_argtypes
= NULL_TREE
;
5823 bool is_void
= false;
5825 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
5827 if (arg
== void_list_node
)
5830 canon_argtypes
= tree_cons (NULL_TREE
,
5831 TYPE_CANONICAL (TREE_VALUE (arg
)),
5835 canon_argtypes
= nreverse (canon_argtypes
);
5837 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
5839 /* There is a non-canonical type. */
5840 *any_noncanonical_p
= true;
5841 return canon_argtypes
;
5844 /* The canonical argument types are the same as ARGTYPES. */
5848 /* Construct, lay out and return
5849 the type of functions returning type VALUE_TYPE
5850 given arguments of types ARG_TYPES.
5851 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5852 are data type nodes for the arguments of the function.
5853 If such a type has already been constructed, reuse it. */
5856 build_function_type (tree value_type
, tree arg_types
)
5859 hashval_t hashcode
= 0;
5860 bool any_structural_p
, any_noncanonical_p
;
5861 tree canon_argtypes
;
5863 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
5865 error ("function return type cannot be function");
5866 value_type
= integer_type_node
;
5869 /* Make a node of the sort we want. */
5870 t
= make_node (FUNCTION_TYPE
);
5871 TREE_TYPE (t
) = value_type
;
5872 TYPE_ARG_TYPES (t
) = arg_types
;
5874 /* If we already have such a type, use the old one. */
5875 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
5876 hashcode
= type_hash_list (arg_types
, hashcode
);
5877 t
= type_hash_canon (hashcode
, t
);
5879 /* Set up the canonical type. */
5880 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
5881 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
5882 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
5884 &any_noncanonical_p
);
5885 if (any_structural_p
)
5886 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5887 else if (any_noncanonical_p
)
5888 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
5891 if (!COMPLETE_TYPE_P (t
))
5896 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP. */
5899 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
)
5901 tree new_type
= NULL
;
5902 tree args
, new_args
= NULL
, t
;
5906 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
5907 args
= TREE_CHAIN (args
), i
++)
5908 if (!bitmap_bit_p (args_to_skip
, i
))
5909 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
5911 new_reversed
= nreverse (new_args
);
5915 TREE_CHAIN (new_args
) = void_list_node
;
5917 new_reversed
= void_list_node
;
5919 gcc_assert (new_reversed
);
5921 /* Use copy_node to preserve as much as possible from original type
5922 (debug info, attribute lists etc.)
5923 Exception is METHOD_TYPEs must have THIS argument.
5924 When we are asked to remove it, we need to build new FUNCTION_TYPE
5926 if (TREE_CODE (orig_type
) != METHOD_TYPE
5927 || !bitmap_bit_p (args_to_skip
, 0))
5929 new_type
= copy_node (orig_type
);
5930 TYPE_ARG_TYPES (new_type
) = new_reversed
;
5935 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
5937 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
5940 /* This is a new type, not a copy of an old type. Need to reassociate
5941 variants. We can handle everything except the main variant lazily. */
5942 t
= TYPE_MAIN_VARIANT (orig_type
);
5945 TYPE_MAIN_VARIANT (new_type
) = t
;
5946 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
5947 TYPE_NEXT_VARIANT (t
) = new_type
;
5951 TYPE_MAIN_VARIANT (new_type
) = new_type
;
5952 TYPE_NEXT_VARIANT (new_type
) = NULL
;
5957 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP.
5959 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
5960 linked by TREE_CHAIN directly. It is caller responsibility to eliminate
5961 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
5964 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
)
5966 tree new_decl
= copy_node (orig_decl
);
5969 new_type
= TREE_TYPE (orig_decl
);
5970 if (prototype_p (new_type
))
5971 new_type
= build_function_type_skip_args (new_type
, args_to_skip
);
5972 TREE_TYPE (new_decl
) = new_type
;
5974 /* For declarations setting DECL_VINDEX (i.e. methods)
5975 we expect first argument to be THIS pointer. */
5976 if (bitmap_bit_p (args_to_skip
, 0))
5977 DECL_VINDEX (new_decl
) = NULL_TREE
;
5981 /* Build a function type. The RETURN_TYPE is the type returned by the
5982 function. If VAARGS is set, no void_type_node is appended to the
5983 the list. ARGP muse be alway be terminated be a NULL_TREE. */
5986 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
5990 t
= va_arg (argp
, tree
);
5991 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
5992 args
= tree_cons (NULL_TREE
, t
, args
);
5997 if (args
!= NULL_TREE
)
5998 args
= nreverse (args
);
5999 gcc_assert (args
!= NULL_TREE
&& last
!= void_list_node
);
6001 else if (args
== NULL_TREE
)
6002 args
= void_list_node
;
6006 args
= nreverse (args
);
6007 TREE_CHAIN (last
) = void_list_node
;
6009 args
= build_function_type (return_type
, args
);
6014 /* Build a function type. The RETURN_TYPE is the type returned by the
6015 function. If additional arguments are provided, they are
6016 additional argument types. The list of argument types must always
6017 be terminated by NULL_TREE. */
6020 build_function_type_list (tree return_type
, ...)
6025 va_start (p
, return_type
);
6026 args
= build_function_type_list_1 (false, return_type
, p
);
6031 /* Build a variable argument function type. The RETURN_TYPE is the
6032 type returned by the function. If additional arguments are provided,
6033 they are additional argument types. The list of argument types must
6034 always be terminated by NULL_TREE. */
6037 build_varargs_function_type_list (tree return_type
, ...)
6042 va_start (p
, return_type
);
6043 args
= build_function_type_list_1 (true, return_type
, p
);
6049 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
6050 and ARGTYPES (a TREE_LIST) are the return type and arguments types
6051 for the method. An implicit additional parameter (of type
6052 pointer-to-BASETYPE) is added to the ARGTYPES. */
6055 build_method_type_directly (tree basetype
,
6062 bool any_structural_p
, any_noncanonical_p
;
6063 tree canon_argtypes
;
6065 /* Make a node of the sort we want. */
6066 t
= make_node (METHOD_TYPE
);
6068 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
6069 TREE_TYPE (t
) = rettype
;
6070 ptype
= build_pointer_type (basetype
);
6072 /* The actual arglist for this function includes a "hidden" argument
6073 which is "this". Put it into the list of argument types. */
6074 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
6075 TYPE_ARG_TYPES (t
) = argtypes
;
6077 /* If we already have such a type, use the old one. */
6078 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
6079 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
6080 hashcode
= type_hash_list (argtypes
, hashcode
);
6081 t
= type_hash_canon (hashcode
, t
);
6083 /* Set up the canonical type. */
6085 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
6086 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
6088 = (TYPE_CANONICAL (basetype
) != basetype
6089 || TYPE_CANONICAL (rettype
) != rettype
);
6090 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
6092 &any_noncanonical_p
);
6093 if (any_structural_p
)
6094 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6095 else if (any_noncanonical_p
)
6097 = build_method_type_directly (TYPE_CANONICAL (basetype
),
6098 TYPE_CANONICAL (rettype
),
6100 if (!COMPLETE_TYPE_P (t
))
6106 /* Construct, lay out and return the type of methods belonging to class
6107 BASETYPE and whose arguments and values are described by TYPE.
6108 If that type exists already, reuse it.
6109 TYPE must be a FUNCTION_TYPE node. */
6112 build_method_type (tree basetype
, tree type
)
6114 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
6116 return build_method_type_directly (basetype
,
6118 TYPE_ARG_TYPES (type
));
6121 /* Construct, lay out and return the type of offsets to a value
6122 of type TYPE, within an object of type BASETYPE.
6123 If a suitable offset type exists already, reuse it. */
6126 build_offset_type (tree basetype
, tree type
)
6129 hashval_t hashcode
= 0;
6131 /* Make a node of the sort we want. */
6132 t
= make_node (OFFSET_TYPE
);
6134 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
6135 TREE_TYPE (t
) = type
;
6137 /* If we already have such a type, use the old one. */
6138 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
6139 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
6140 t
= type_hash_canon (hashcode
, t
);
6142 if (!COMPLETE_TYPE_P (t
))
6145 if (TYPE_CANONICAL (t
) == t
)
6147 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
6148 || TYPE_STRUCTURAL_EQUALITY_P (type
))
6149 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6150 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
6151 || TYPE_CANONICAL (type
) != type
)
6153 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
6154 TYPE_CANONICAL (type
));
6160 /* Create a complex type whose components are COMPONENT_TYPE. */
6163 build_complex_type (tree component_type
)
6168 /* Make a node of the sort we want. */
6169 t
= make_node (COMPLEX_TYPE
);
6171 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
6173 /* If we already have such a type, use the old one. */
6174 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
6175 t
= type_hash_canon (hashcode
, t
);
6177 if (!COMPLETE_TYPE_P (t
))
6180 if (TYPE_CANONICAL (t
) == t
)
6182 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
6183 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6184 else if (TYPE_CANONICAL (component_type
) != component_type
)
6186 = build_complex_type (TYPE_CANONICAL (component_type
));
6189 /* We need to create a name, since complex is a fundamental type. */
6190 if (! TYPE_NAME (t
))
6193 if (component_type
== char_type_node
)
6194 name
= "complex char";
6195 else if (component_type
== signed_char_type_node
)
6196 name
= "complex signed char";
6197 else if (component_type
== unsigned_char_type_node
)
6198 name
= "complex unsigned char";
6199 else if (component_type
== short_integer_type_node
)
6200 name
= "complex short int";
6201 else if (component_type
== short_unsigned_type_node
)
6202 name
= "complex short unsigned int";
6203 else if (component_type
== integer_type_node
)
6204 name
= "complex int";
6205 else if (component_type
== unsigned_type_node
)
6206 name
= "complex unsigned int";
6207 else if (component_type
== long_integer_type_node
)
6208 name
= "complex long int";
6209 else if (component_type
== long_unsigned_type_node
)
6210 name
= "complex long unsigned int";
6211 else if (component_type
== long_long_integer_type_node
)
6212 name
= "complex long long int";
6213 else if (component_type
== long_long_unsigned_type_node
)
6214 name
= "complex long long unsigned int";
6219 TYPE_NAME (t
) = build_decl (TYPE_DECL
, get_identifier (name
), t
);
6222 return build_qualified_type (t
, TYPE_QUALS (component_type
));
6225 /* Return OP, stripped of any conversions to wider types as much as is safe.
6226 Converting the value back to OP's type makes a value equivalent to OP.
6228 If FOR_TYPE is nonzero, we return a value which, if converted to
6229 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6231 OP must have integer, real or enumeral type. Pointers are not allowed!
6233 There are some cases where the obvious value we could return
6234 would regenerate to OP if converted to OP's type,
6235 but would not extend like OP to wider types.
6236 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6237 For example, if OP is (unsigned short)(signed char)-1,
6238 we avoid returning (signed char)-1 if FOR_TYPE is int,
6239 even though extending that to an unsigned short would regenerate OP,
6240 since the result of extending (signed char)-1 to (int)
6241 is different from (int) OP. */
6244 get_unwidened (tree op
, tree for_type
)
6246 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6247 tree type
= TREE_TYPE (op
);
6249 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
6251 = (for_type
!= 0 && for_type
!= type
6252 && final_prec
> TYPE_PRECISION (type
)
6253 && TYPE_UNSIGNED (type
));
6256 while (CONVERT_EXPR_P (op
))
6260 /* TYPE_PRECISION on vector types has different meaning
6261 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6262 so avoid them here. */
6263 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
6266 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
6267 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
6269 /* Truncations are many-one so cannot be removed.
6270 Unless we are later going to truncate down even farther. */
6272 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
6275 /* See what's inside this conversion. If we decide to strip it,
6277 op
= TREE_OPERAND (op
, 0);
6279 /* If we have not stripped any zero-extensions (uns is 0),
6280 we can strip any kind of extension.
6281 If we have previously stripped a zero-extension,
6282 only zero-extensions can safely be stripped.
6283 Any extension can be stripped if the bits it would produce
6284 are all going to be discarded later by truncating to FOR_TYPE. */
6288 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
6290 /* TYPE_UNSIGNED says whether this is a zero-extension.
6291 Let's avoid computing it if it does not affect WIN
6292 and if UNS will not be needed again. */
6294 || CONVERT_EXPR_P (op
))
6295 && TYPE_UNSIGNED (TREE_TYPE (op
)))
6306 /* Return OP or a simpler expression for a narrower value
6307 which can be sign-extended or zero-extended to give back OP.
6308 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6309 or 0 if the value should be sign-extended. */
6312 get_narrower (tree op
, int *unsignedp_ptr
)
6317 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
6319 while (TREE_CODE (op
) == NOP_EXPR
)
6322 = (TYPE_PRECISION (TREE_TYPE (op
))
6323 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
6325 /* Truncations are many-one so cannot be removed. */
6329 /* See what's inside this conversion. If we decide to strip it,
6334 op
= TREE_OPERAND (op
, 0);
6335 /* An extension: the outermost one can be stripped,
6336 but remember whether it is zero or sign extension. */
6338 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
6339 /* Otherwise, if a sign extension has been stripped,
6340 only sign extensions can now be stripped;
6341 if a zero extension has been stripped, only zero-extensions. */
6342 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
6346 else /* bitschange == 0 */
6348 /* A change in nominal type can always be stripped, but we must
6349 preserve the unsignedness. */
6351 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
6353 op
= TREE_OPERAND (op
, 0);
6354 /* Keep trying to narrow, but don't assign op to win if it
6355 would turn an integral type into something else. */
6356 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
6363 if (TREE_CODE (op
) == COMPONENT_REF
6364 /* Since type_for_size always gives an integer type. */
6365 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
6366 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
6367 /* Ensure field is laid out already. */
6368 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
6369 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
6371 unsigned HOST_WIDE_INT innerprec
6372 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
6373 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
6374 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
6375 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
6377 /* We can get this structure field in a narrower type that fits it,
6378 but the resulting extension to its nominal type (a fullword type)
6379 must satisfy the same conditions as for other extensions.
6381 Do this only for fields that are aligned (not bit-fields),
6382 because when bit-field insns will be used there is no
6383 advantage in doing this. */
6385 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
6386 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
6387 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
6391 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
6392 win
= fold_convert (type
, op
);
6396 *unsignedp_ptr
= uns
;
6400 /* Nonzero if integer constant C has a value that is permissible
6401 for type TYPE (an INTEGER_TYPE). */
6404 int_fits_type_p (const_tree c
, const_tree type
)
6406 tree type_low_bound
= TYPE_MIN_VALUE (type
);
6407 tree type_high_bound
= TYPE_MAX_VALUE (type
);
6408 bool ok_for_low_bound
, ok_for_high_bound
;
6409 unsigned HOST_WIDE_INT low
;
6412 /* If at least one bound of the type is a constant integer, we can check
6413 ourselves and maybe make a decision. If no such decision is possible, but
6414 this type is a subtype, try checking against that. Otherwise, use
6415 fit_double_type, which checks against the precision.
6417 Compute the status for each possibly constant bound, and return if we see
6418 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6419 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6420 for "constant known to fit". */
6422 if (TREE_TYPE (c
) == sizetype
6423 && TYPE_UNSIGNED (TREE_TYPE (c
))
6424 && TREE_INT_CST_HIGH (c
) == -1
6425 && !TREE_OVERFLOW (c
))
6426 /* So c is an unsigned integer which type is sizetype.
6427 sizetype'd integers are sign extended even though they are
6428 unsigned. If the integer value fits in the lower end word of c,
6429 and if the higher end word has all its bits set to 1, that
6430 means the higher end bits are set to 1 only for sign extension.
6431 So let's convert c into an equivalent zero extended unsigned
6433 c
= force_fit_type_double (size_type_node
,
6434 TREE_INT_CST_LOW (c
),
6435 TREE_INT_CST_HIGH (c
),
6437 /* Check if C >= type_low_bound. */
6438 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
6440 if (tree_int_cst_lt (c
, type_low_bound
))
6442 ok_for_low_bound
= true;
6445 ok_for_low_bound
= false;
6447 /* Check if c <= type_high_bound. */
6448 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
6450 if (tree_int_cst_lt (type_high_bound
, c
))
6452 ok_for_high_bound
= true;
6455 ok_for_high_bound
= false;
6457 /* If the constant fits both bounds, the result is known. */
6458 if (ok_for_low_bound
&& ok_for_high_bound
)
6461 /* Perform some generic filtering which may allow making a decision
6462 even if the bounds are not constant. First, negative integers
6463 never fit in unsigned types, */
6464 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
6467 /* Second, narrower types always fit in wider ones. */
6468 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
6471 /* Third, unsigned integers with top bit set never fit signed types. */
6472 if (! TYPE_UNSIGNED (type
)
6473 && TYPE_UNSIGNED (TREE_TYPE (c
))
6474 && tree_int_cst_msb (c
))
6477 /* If we haven't been able to decide at this point, there nothing more we
6478 can check ourselves here. Look at the base type if we have one and it
6479 has the same precision. */
6480 if (TREE_CODE (type
) == INTEGER_TYPE
6481 && TREE_TYPE (type
) != 0
6482 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
6483 return int_fits_type_p (c
, TREE_TYPE (type
));
6485 /* Or to fit_double_type, if nothing else. */
6486 low
= TREE_INT_CST_LOW (c
);
6487 high
= TREE_INT_CST_HIGH (c
);
6488 return !fit_double_type (low
, high
, &low
, &high
, type
);
6491 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6492 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6493 represented (assuming two's-complement arithmetic) within the bit
6494 precision of the type are returned instead. */
6497 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
6499 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
6500 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
6501 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
6502 TYPE_UNSIGNED (type
));
6505 if (TYPE_UNSIGNED (type
))
6506 mpz_set_ui (min
, 0);
6510 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
6511 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
6512 TYPE_PRECISION (type
));
6513 mpz_set_double_int (min
, mn
, false);
6517 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
6518 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
6519 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
6520 TYPE_UNSIGNED (type
));
6523 if (TYPE_UNSIGNED (type
))
6524 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
6527 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
6532 /* Return true if VAR is an automatic variable defined in function FN. */
6535 auto_var_in_fn_p (const_tree var
, const_tree fn
)
6537 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
6538 && (((TREE_CODE (var
) == VAR_DECL
|| TREE_CODE (var
) == PARM_DECL
)
6539 && ! TREE_STATIC (var
))
6540 || TREE_CODE (var
) == LABEL_DECL
6541 || TREE_CODE (var
) == RESULT_DECL
));
6544 /* Subprogram of following function. Called by walk_tree.
6546 Return *TP if it is an automatic variable or parameter of the
6547 function passed in as DATA. */
6550 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
6552 tree fn
= (tree
) data
;
6557 else if (DECL_P (*tp
)
6558 && auto_var_in_fn_p (*tp
, fn
))
6564 /* Returns true if T is, contains, or refers to a type with variable
6565 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6566 arguments, but not the return type. If FN is nonzero, only return
6567 true if a modifier of the type or position of FN is a variable or
6568 parameter inside FN.
6570 This concept is more general than that of C99 'variably modified types':
6571 in C99, a struct type is never variably modified because a VLA may not
6572 appear as a structure member. However, in GNU C code like:
6574 struct S { int i[f()]; };
6576 is valid, and other languages may define similar constructs. */
6579 variably_modified_type_p (tree type
, tree fn
)
6583 /* Test if T is either variable (if FN is zero) or an expression containing
6584 a variable in FN. */
6585 #define RETURN_TRUE_IF_VAR(T) \
6586 do { tree _t = (T); \
6587 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6588 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6589 return true; } while (0)
6591 if (type
== error_mark_node
)
6594 /* If TYPE itself has variable size, it is variably modified. */
6595 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
6596 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
6598 switch (TREE_CODE (type
))
6601 case REFERENCE_TYPE
:
6603 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6609 /* If TYPE is a function type, it is variably modified if the
6610 return type is variably modified. */
6611 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6617 case FIXED_POINT_TYPE
:
6620 /* Scalar types are variably modified if their end points
6622 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
6623 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
6628 case QUAL_UNION_TYPE
:
6629 /* We can't see if any of the fields are variably-modified by the
6630 definition we normally use, since that would produce infinite
6631 recursion via pointers. */
6632 /* This is variably modified if some field's type is. */
6633 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
6634 if (TREE_CODE (t
) == FIELD_DECL
)
6636 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
6637 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
6638 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
6640 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
6641 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
6646 /* Do not call ourselves to avoid infinite recursion. This is
6647 variably modified if the element type is. */
6648 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
6649 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
6656 /* The current language may have other cases to check, but in general,
6657 all other types are not variably modified. */
6658 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
6660 #undef RETURN_TRUE_IF_VAR
6663 /* Given a DECL or TYPE, return the scope in which it was declared, or
6664 NULL_TREE if there is no containing scope. */
6667 get_containing_scope (const_tree t
)
6669 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
6672 /* Return the innermost context enclosing DECL that is
6673 a FUNCTION_DECL, or zero if none. */
6676 decl_function_context (const_tree decl
)
6680 if (TREE_CODE (decl
) == ERROR_MARK
)
6683 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6684 where we look up the function at runtime. Such functions always take
6685 a first argument of type 'pointer to real context'.
6687 C++ should really be fixed to use DECL_CONTEXT for the real context,
6688 and use something else for the "virtual context". */
6689 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
6692 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
6694 context
= DECL_CONTEXT (decl
);
6696 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
6698 if (TREE_CODE (context
) == BLOCK
)
6699 context
= BLOCK_SUPERCONTEXT (context
);
6701 context
= get_containing_scope (context
);
6707 /* Return the innermost context enclosing DECL that is
6708 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6709 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6712 decl_type_context (const_tree decl
)
6714 tree context
= DECL_CONTEXT (decl
);
6717 switch (TREE_CODE (context
))
6719 case NAMESPACE_DECL
:
6720 case TRANSLATION_UNIT_DECL
:
6725 case QUAL_UNION_TYPE
:
6730 context
= DECL_CONTEXT (context
);
6734 context
= BLOCK_SUPERCONTEXT (context
);
6744 /* CALL is a CALL_EXPR. Return the declaration for the function
6745 called, or NULL_TREE if the called function cannot be
6749 get_callee_fndecl (const_tree call
)
6753 if (call
== error_mark_node
)
6754 return error_mark_node
;
6756 /* It's invalid to call this function with anything but a
6758 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
6760 /* The first operand to the CALL is the address of the function
6762 addr
= CALL_EXPR_FN (call
);
6766 /* If this is a readonly function pointer, extract its initial value. */
6767 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
6768 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
6769 && DECL_INITIAL (addr
))
6770 addr
= DECL_INITIAL (addr
);
6772 /* If the address is just `&f' for some function `f', then we know
6773 that `f' is being called. */
6774 if (TREE_CODE (addr
) == ADDR_EXPR
6775 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
6776 return TREE_OPERAND (addr
, 0);
6778 /* We couldn't figure out what was being called. */
6782 /* Print debugging information about tree nodes generated during the compile,
6783 and any language-specific information. */
6786 dump_tree_statistics (void)
6788 #ifdef GATHER_STATISTICS
6790 int total_nodes
, total_bytes
;
6793 fprintf (stderr
, "\n??? tree nodes created\n\n");
6794 #ifdef GATHER_STATISTICS
6795 fprintf (stderr
, "Kind Nodes Bytes\n");
6796 fprintf (stderr
, "---------------------------------------\n");
6797 total_nodes
= total_bytes
= 0;
6798 for (i
= 0; i
< (int) all_kinds
; i
++)
6800 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
6801 tree_node_counts
[i
], tree_node_sizes
[i
]);
6802 total_nodes
+= tree_node_counts
[i
];
6803 total_bytes
+= tree_node_sizes
[i
];
6805 fprintf (stderr
, "---------------------------------------\n");
6806 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
6807 fprintf (stderr
, "---------------------------------------\n");
6808 ssanames_print_statistics ();
6809 phinodes_print_statistics ();
6811 fprintf (stderr
, "(No per-node statistics)\n");
6813 print_type_hash_statistics ();
6814 print_debug_expr_statistics ();
6815 print_value_expr_statistics ();
6816 print_restrict_base_statistics ();
6817 lang_hooks
.print_statistics ();
6820 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6822 /* Generate a crc32 of a string. */
6825 crc32_string (unsigned chksum
, const char *string
)
6829 unsigned value
= *string
<< 24;
6832 for (ix
= 8; ix
--; value
<<= 1)
6836 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
6845 /* P is a string that will be used in a symbol. Mask out any characters
6846 that are not valid in that context. */
6849 clean_symbol_name (char *p
)
6853 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6856 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6863 /* Generate a name for a special-purpose function function.
6864 The generated name may need to be unique across the whole link.
6865 TYPE is some string to identify the purpose of this function to the
6866 linker or collect2; it must start with an uppercase letter,
6868 I - for constructors
6870 N - for C++ anonymous namespaces
6871 F - for DWARF unwind frame information. */
6874 get_file_function_name (const char *type
)
6880 /* If we already have a name we know to be unique, just use that. */
6881 if (first_global_object_name
)
6882 p
= first_global_object_name
;
6883 /* If the target is handling the constructors/destructors, they
6884 will be local to this file and the name is only necessary for
6885 debugging purposes. */
6886 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
6888 const char *file
= main_input_filename
;
6890 file
= input_filename
;
6891 /* Just use the file's basename, because the full pathname
6892 might be quite long. */
6893 p
= strrchr (file
, '/');
6898 p
= q
= ASTRDUP (p
);
6899 clean_symbol_name (q
);
6903 /* Otherwise, the name must be unique across the entire link.
6904 We don't have anything that we know to be unique to this translation
6905 unit, so use what we do have and throw in some randomness. */
6907 const char *name
= weak_global_object_name
;
6908 const char *file
= main_input_filename
;
6913 file
= input_filename
;
6915 len
= strlen (file
);
6916 q
= (char *) alloca (9 * 2 + len
+ 1);
6917 memcpy (q
, file
, len
+ 1);
6918 clean_symbol_name (q
);
6920 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
6921 crc32_string (0, get_random_seed (false)));
6926 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
6929 /* Set up the name of the file-level functions we may need.
6930 Use a global object (which is already required to be unique over
6931 the program) rather than the file name (which imposes extra
6933 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
6935 return get_identifier (buf
);
6938 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6940 /* Complain that the tree code of NODE does not match the expected 0
6941 terminated list of trailing codes. The trailing code list can be
6942 empty, for a more vague error message. FILE, LINE, and FUNCTION
6943 are of the caller. */
6946 tree_check_failed (const_tree node
, const char *file
,
6947 int line
, const char *function
, ...)
6951 unsigned length
= 0;
6954 va_start (args
, function
);
6955 while ((code
= va_arg (args
, int)))
6956 length
+= 4 + strlen (tree_code_name
[code
]);
6961 va_start (args
, function
);
6962 length
+= strlen ("expected ");
6963 buffer
= tmp
= (char *) alloca (length
);
6965 while ((code
= va_arg (args
, int)))
6967 const char *prefix
= length
? " or " : "expected ";
6969 strcpy (tmp
+ length
, prefix
);
6970 length
+= strlen (prefix
);
6971 strcpy (tmp
+ length
, tree_code_name
[code
]);
6972 length
+= strlen (tree_code_name
[code
]);
6977 buffer
= "unexpected node";
6979 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6980 buffer
, tree_code_name
[TREE_CODE (node
)],
6981 function
, trim_filename (file
), line
);
6984 /* Complain that the tree code of NODE does match the expected 0
6985 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6989 tree_not_check_failed (const_tree node
, const char *file
,
6990 int line
, const char *function
, ...)
6994 unsigned length
= 0;
6997 va_start (args
, function
);
6998 while ((code
= va_arg (args
, int)))
6999 length
+= 4 + strlen (tree_code_name
[code
]);
7001 va_start (args
, function
);
7002 buffer
= (char *) alloca (length
);
7004 while ((code
= va_arg (args
, int)))
7008 strcpy (buffer
+ length
, " or ");
7011 strcpy (buffer
+ length
, tree_code_name
[code
]);
7012 length
+= strlen (tree_code_name
[code
]);
7016 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
7017 buffer
, tree_code_name
[TREE_CODE (node
)],
7018 function
, trim_filename (file
), line
);
7021 /* Similar to tree_check_failed, except that we check for a class of tree
7022 code, given in CL. */
7025 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
7026 const char *file
, int line
, const char *function
)
7029 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
7030 TREE_CODE_CLASS_STRING (cl
),
7031 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
7032 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
7035 /* Similar to tree_check_failed, except that instead of specifying a
7036 dozen codes, use the knowledge that they're all sequential. */
7039 tree_range_check_failed (const_tree node
, const char *file
, int line
,
7040 const char *function
, enum tree_code c1
,
7044 unsigned length
= 0;
7047 for (c
= c1
; c
<= c2
; ++c
)
7048 length
+= 4 + strlen (tree_code_name
[c
]);
7050 length
+= strlen ("expected ");
7051 buffer
= (char *) alloca (length
);
7054 for (c
= c1
; c
<= c2
; ++c
)
7056 const char *prefix
= length
? " or " : "expected ";
7058 strcpy (buffer
+ length
, prefix
);
7059 length
+= strlen (prefix
);
7060 strcpy (buffer
+ length
, tree_code_name
[c
]);
7061 length
+= strlen (tree_code_name
[c
]);
7064 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7065 buffer
, tree_code_name
[TREE_CODE (node
)],
7066 function
, trim_filename (file
), line
);
7070 /* Similar to tree_check_failed, except that we check that a tree does
7071 not have the specified code, given in CL. */
7074 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
7075 const char *file
, int line
, const char *function
)
7078 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
7079 TREE_CODE_CLASS_STRING (cl
),
7080 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
7081 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
7085 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
7088 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
7089 const char *function
, enum omp_clause_code code
)
7091 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
7092 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
7093 function
, trim_filename (file
), line
);
7097 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
7100 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
7101 const char *function
, enum omp_clause_code c1
,
7102 enum omp_clause_code c2
)
7105 unsigned length
= 0;
7106 enum omp_clause_code c
;
7108 for (c
= c1
; c
<= c2
; ++c
)
7109 length
+= 4 + strlen (omp_clause_code_name
[c
]);
7111 length
+= strlen ("expected ");
7112 buffer
= (char *) alloca (length
);
7115 for (c
= c1
; c
<= c2
; ++c
)
7117 const char *prefix
= length
? " or " : "expected ";
7119 strcpy (buffer
+ length
, prefix
);
7120 length
+= strlen (prefix
);
7121 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
7122 length
+= strlen (omp_clause_code_name
[c
]);
7125 internal_error ("tree check: %s, have %s in %s, at %s:%d",
7126 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
7127 function
, trim_filename (file
), line
);
7131 #undef DEFTREESTRUCT
7132 #define DEFTREESTRUCT(VAL, NAME) NAME,
7134 static const char *ts_enum_names
[] = {
7135 #include "treestruct.def"
7137 #undef DEFTREESTRUCT
7139 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
7141 /* Similar to tree_class_check_failed, except that we check for
7142 whether CODE contains the tree structure identified by EN. */
7145 tree_contains_struct_check_failed (const_tree node
,
7146 const enum tree_node_structure_enum en
,
7147 const char *file
, int line
,
7148 const char *function
)
7151 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
7153 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
7157 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
7158 (dynamically sized) vector. */
7161 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
7162 const char *function
)
7165 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
7166 idx
+ 1, len
, function
, trim_filename (file
), line
);
7169 /* Similar to above, except that the check is for the bounds of the operand
7170 vector of an expression node EXP. */
7173 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
7174 int line
, const char *function
)
7176 int code
= TREE_CODE (exp
);
7178 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
7179 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
7180 function
, trim_filename (file
), line
);
7183 /* Similar to above, except that the check is for the number of
7184 operands of an OMP_CLAUSE node. */
7187 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
7188 int line
, const char *function
)
7191 ("tree check: accessed operand %d of omp_clause %s with %d operands "
7192 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
7193 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
7194 trim_filename (file
), line
);
7196 #endif /* ENABLE_TREE_CHECKING */
7198 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
7199 and mapped to the machine mode MODE. Initialize its fields and build
7200 the information necessary for debugging output. */
7203 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
7206 hashval_t hashcode
= 0;
7208 /* Build a main variant, based on the main variant of the inner type, then
7209 use it to build the variant we return. */
7210 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
7211 && TYPE_MAIN_VARIANT (innertype
) != innertype
)
7212 return build_type_attribute_qual_variant (
7213 make_vector_type (TYPE_MAIN_VARIANT (innertype
), nunits
, mode
),
7214 TYPE_ATTRIBUTES (innertype
),
7215 TYPE_QUALS (innertype
));
7217 t
= make_node (VECTOR_TYPE
);
7218 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
7219 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
7220 TYPE_MODE (t
) = mode
;
7221 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
7222 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
7224 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
7225 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7226 else if (TYPE_CANONICAL (innertype
) != innertype
7227 || mode
!= VOIDmode
)
7229 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
7234 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
7235 tree array
= build_array_type (innertype
, build_index_type (index
));
7236 tree rt
= make_node (RECORD_TYPE
);
7238 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
7239 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
7241 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
7242 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7243 the representation type, and we want to find that die when looking up
7244 the vector type. This is most easily achieved by making the TYPE_UID
7246 TYPE_UID (rt
) = TYPE_UID (t
);
7249 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
7250 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
7251 hashcode
= iterative_hash_object (TYPE_HASH (innertype
), hashcode
);
7252 return type_hash_canon (hashcode
, t
);
7256 make_or_reuse_type (unsigned size
, int unsignedp
)
7258 if (size
== INT_TYPE_SIZE
)
7259 return unsignedp
? unsigned_type_node
: integer_type_node
;
7260 if (size
== CHAR_TYPE_SIZE
)
7261 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
7262 if (size
== SHORT_TYPE_SIZE
)
7263 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
7264 if (size
== LONG_TYPE_SIZE
)
7265 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
7266 if (size
== LONG_LONG_TYPE_SIZE
)
7267 return (unsignedp
? long_long_unsigned_type_node
7268 : long_long_integer_type_node
);
7271 return make_unsigned_type (size
);
7273 return make_signed_type (size
);
7276 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7279 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
7283 if (size
== SHORT_FRACT_TYPE_SIZE
)
7284 return unsignedp
? sat_unsigned_short_fract_type_node
7285 : sat_short_fract_type_node
;
7286 if (size
== FRACT_TYPE_SIZE
)
7287 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
7288 if (size
== LONG_FRACT_TYPE_SIZE
)
7289 return unsignedp
? sat_unsigned_long_fract_type_node
7290 : sat_long_fract_type_node
;
7291 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
7292 return unsignedp
? sat_unsigned_long_long_fract_type_node
7293 : sat_long_long_fract_type_node
;
7297 if (size
== SHORT_FRACT_TYPE_SIZE
)
7298 return unsignedp
? unsigned_short_fract_type_node
7299 : short_fract_type_node
;
7300 if (size
== FRACT_TYPE_SIZE
)
7301 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
7302 if (size
== LONG_FRACT_TYPE_SIZE
)
7303 return unsignedp
? unsigned_long_fract_type_node
7304 : long_fract_type_node
;
7305 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
7306 return unsignedp
? unsigned_long_long_fract_type_node
7307 : long_long_fract_type_node
;
7310 return make_fract_type (size
, unsignedp
, satp
);
7313 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7316 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
7320 if (size
== SHORT_ACCUM_TYPE_SIZE
)
7321 return unsignedp
? sat_unsigned_short_accum_type_node
7322 : sat_short_accum_type_node
;
7323 if (size
== ACCUM_TYPE_SIZE
)
7324 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
7325 if (size
== LONG_ACCUM_TYPE_SIZE
)
7326 return unsignedp
? sat_unsigned_long_accum_type_node
7327 : sat_long_accum_type_node
;
7328 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
7329 return unsignedp
? sat_unsigned_long_long_accum_type_node
7330 : sat_long_long_accum_type_node
;
7334 if (size
== SHORT_ACCUM_TYPE_SIZE
)
7335 return unsignedp
? unsigned_short_accum_type_node
7336 : short_accum_type_node
;
7337 if (size
== ACCUM_TYPE_SIZE
)
7338 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
7339 if (size
== LONG_ACCUM_TYPE_SIZE
)
7340 return unsignedp
? unsigned_long_accum_type_node
7341 : long_accum_type_node
;
7342 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
7343 return unsignedp
? unsigned_long_long_accum_type_node
7344 : long_long_accum_type_node
;
7347 return make_accum_type (size
, unsignedp
, satp
);
7350 /* Create nodes for all integer types (and error_mark_node) using the sizes
7351 of C datatypes. The caller should call set_sizetype soon after calling
7352 this function to select one of the types as sizetype. */
7355 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
7357 error_mark_node
= make_node (ERROR_MARK
);
7358 TREE_TYPE (error_mark_node
) = error_mark_node
;
7360 initialize_sizetypes (signed_sizetype
);
7362 /* Define both `signed char' and `unsigned char'. */
7363 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
7364 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
7365 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
7366 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
7368 /* Define `char', which is like either `signed char' or `unsigned char'
7369 but not the same as either. */
7372 ? make_signed_type (CHAR_TYPE_SIZE
)
7373 : make_unsigned_type (CHAR_TYPE_SIZE
));
7374 TYPE_STRING_FLAG (char_type_node
) = 1;
7376 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
7377 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
7378 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
7379 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
7380 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
7381 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
7382 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
7383 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
7385 /* Define a boolean type. This type only represents boolean values but
7386 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7387 Front ends which want to override this size (i.e. Java) can redefine
7388 boolean_type_node before calling build_common_tree_nodes_2. */
7389 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
7390 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
7391 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
7392 TYPE_PRECISION (boolean_type_node
) = 1;
7394 /* Fill in the rest of the sized types. Reuse existing type nodes
7396 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
7397 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
7398 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
7399 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
7400 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
7402 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
7403 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
7404 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
7405 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
7406 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
7408 access_public_node
= get_identifier ("public");
7409 access_protected_node
= get_identifier ("protected");
7410 access_private_node
= get_identifier ("private");
7413 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7414 It will create several other common tree nodes. */
7417 build_common_tree_nodes_2 (int short_double
)
7419 /* Define these next since types below may used them. */
7420 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
7421 integer_one_node
= build_int_cst (NULL_TREE
, 1);
7422 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
7424 size_zero_node
= size_int (0);
7425 size_one_node
= size_int (1);
7426 bitsize_zero_node
= bitsize_int (0);
7427 bitsize_one_node
= bitsize_int (1);
7428 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
7430 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
7431 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
7433 void_type_node
= make_node (VOID_TYPE
);
7434 layout_type (void_type_node
);
7436 /* We are not going to have real types in C with less than byte alignment,
7437 so we might as well not have any types that claim to have it. */
7438 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
7439 TYPE_USER_ALIGN (void_type_node
) = 0;
7441 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
7442 layout_type (TREE_TYPE (null_pointer_node
));
7444 ptr_type_node
= build_pointer_type (void_type_node
);
7446 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
7447 fileptr_type_node
= ptr_type_node
;
7449 float_type_node
= make_node (REAL_TYPE
);
7450 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
7451 layout_type (float_type_node
);
7453 double_type_node
= make_node (REAL_TYPE
);
7455 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
7457 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
7458 layout_type (double_type_node
);
7460 long_double_type_node
= make_node (REAL_TYPE
);
7461 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
7462 layout_type (long_double_type_node
);
7464 float_ptr_type_node
= build_pointer_type (float_type_node
);
7465 double_ptr_type_node
= build_pointer_type (double_type_node
);
7466 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
7467 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
7469 /* Fixed size integer types. */
7470 uint32_type_node
= build_nonstandard_integer_type (32, true);
7471 uint64_type_node
= build_nonstandard_integer_type (64, true);
7473 /* Decimal float types. */
7474 dfloat32_type_node
= make_node (REAL_TYPE
);
7475 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
7476 layout_type (dfloat32_type_node
);
7477 TYPE_MODE (dfloat32_type_node
) = SDmode
;
7478 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
7480 dfloat64_type_node
= make_node (REAL_TYPE
);
7481 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
7482 layout_type (dfloat64_type_node
);
7483 TYPE_MODE (dfloat64_type_node
) = DDmode
;
7484 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
7486 dfloat128_type_node
= make_node (REAL_TYPE
);
7487 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
7488 layout_type (dfloat128_type_node
);
7489 TYPE_MODE (dfloat128_type_node
) = TDmode
;
7490 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
7492 complex_integer_type_node
= build_complex_type (integer_type_node
);
7493 complex_float_type_node
= build_complex_type (float_type_node
);
7494 complex_double_type_node
= build_complex_type (double_type_node
);
7495 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
7497 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7498 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
7499 sat_ ## KIND ## _type_node = \
7500 make_sat_signed_ ## KIND ## _type (SIZE); \
7501 sat_unsigned_ ## KIND ## _type_node = \
7502 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7503 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7504 unsigned_ ## KIND ## _type_node = \
7505 make_unsigned_ ## KIND ## _type (SIZE);
7507 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
7508 sat_ ## WIDTH ## KIND ## _type_node = \
7509 make_sat_signed_ ## KIND ## _type (SIZE); \
7510 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7511 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7512 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7513 unsigned_ ## WIDTH ## KIND ## _type_node = \
7514 make_unsigned_ ## KIND ## _type (SIZE);
7516 /* Make fixed-point type nodes based on four different widths. */
7517 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7518 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7519 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
7520 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7521 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7523 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7524 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7525 NAME ## _type_node = \
7526 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7527 u ## NAME ## _type_node = \
7528 make_or_reuse_unsigned_ ## KIND ## _type \
7529 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7530 sat_ ## NAME ## _type_node = \
7531 make_or_reuse_sat_signed_ ## KIND ## _type \
7532 (GET_MODE_BITSIZE (MODE ## mode)); \
7533 sat_u ## NAME ## _type_node = \
7534 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7535 (GET_MODE_BITSIZE (U ## MODE ## mode));
7537 /* Fixed-point type and mode nodes. */
7538 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
7539 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
7540 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
7541 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
7542 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
7543 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
7544 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
7545 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
7546 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
7547 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
7548 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
7551 tree t
= targetm
.build_builtin_va_list ();
7553 /* Many back-ends define record types without setting TYPE_NAME.
7554 If we copied the record type here, we'd keep the original
7555 record type without a name. This breaks name mangling. So,
7556 don't copy record types and let c_common_nodes_and_builtins()
7557 declare the type to be __builtin_va_list. */
7558 if (TREE_CODE (t
) != RECORD_TYPE
)
7559 t
= build_variant_type_copy (t
);
7561 va_list_type_node
= t
;
7565 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7568 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
7569 const char *library_name
, int ecf_flags
)
7573 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
7574 library_name
, NULL_TREE
);
7575 if (ecf_flags
& ECF_CONST
)
7576 TREE_READONLY (decl
) = 1;
7577 if (ecf_flags
& ECF_PURE
)
7578 DECL_PURE_P (decl
) = 1;
7579 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
7580 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
7581 if (ecf_flags
& ECF_NORETURN
)
7582 TREE_THIS_VOLATILE (decl
) = 1;
7583 if (ecf_flags
& ECF_NOTHROW
)
7584 TREE_NOTHROW (decl
) = 1;
7585 if (ecf_flags
& ECF_MALLOC
)
7586 DECL_IS_MALLOC (decl
) = 1;
7588 built_in_decls
[code
] = decl
;
7589 implicit_built_in_decls
[code
] = decl
;
7592 /* Call this function after instantiating all builtins that the language
7593 front end cares about. This will build the rest of the builtins that
7594 are relied upon by the tree optimizers and the middle-end. */
7597 build_common_builtin_nodes (void)
7601 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
7602 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7604 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7605 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7606 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7607 ftype
= build_function_type (ptr_type_node
, tmp
);
7609 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
7610 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
7611 "memcpy", ECF_NOTHROW
);
7612 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7613 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
7614 "memmove", ECF_NOTHROW
);
7617 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
7619 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7620 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7621 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7622 ftype
= build_function_type (integer_type_node
, tmp
);
7623 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
7624 "memcmp", ECF_PURE
| ECF_NOTHROW
);
7627 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
7629 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7630 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
7631 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7632 ftype
= build_function_type (ptr_type_node
, tmp
);
7633 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
7634 "memset", ECF_NOTHROW
);
7637 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
7639 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7640 ftype
= build_function_type (ptr_type_node
, tmp
);
7641 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
7642 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
7645 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7646 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7647 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7648 ftype
= build_function_type (void_type_node
, tmp
);
7649 local_define_builtin ("__builtin_init_trampoline", ftype
,
7650 BUILT_IN_INIT_TRAMPOLINE
,
7651 "__builtin_init_trampoline", ECF_NOTHROW
);
7653 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7654 ftype
= build_function_type (ptr_type_node
, tmp
);
7655 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
7656 BUILT_IN_ADJUST_TRAMPOLINE
,
7657 "__builtin_adjust_trampoline",
7658 ECF_CONST
| ECF_NOTHROW
);
7660 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7661 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7662 ftype
= build_function_type (void_type_node
, tmp
);
7663 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
7664 BUILT_IN_NONLOCAL_GOTO
,
7665 "__builtin_nonlocal_goto",
7666 ECF_NORETURN
| ECF_NOTHROW
);
7668 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7669 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7670 ftype
= build_function_type (void_type_node
, tmp
);
7671 local_define_builtin ("__builtin_setjmp_setup", ftype
,
7672 BUILT_IN_SETJMP_SETUP
,
7673 "__builtin_setjmp_setup", ECF_NOTHROW
);
7675 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7676 ftype
= build_function_type (ptr_type_node
, tmp
);
7677 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
7678 BUILT_IN_SETJMP_DISPATCHER
,
7679 "__builtin_setjmp_dispatcher",
7680 ECF_PURE
| ECF_NOTHROW
);
7682 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7683 ftype
= build_function_type (void_type_node
, tmp
);
7684 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
7685 BUILT_IN_SETJMP_RECEIVER
,
7686 "__builtin_setjmp_receiver", ECF_NOTHROW
);
7688 ftype
= build_function_type (ptr_type_node
, void_list_node
);
7689 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
7690 "__builtin_stack_save", ECF_NOTHROW
);
7692 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7693 ftype
= build_function_type (void_type_node
, tmp
);
7694 local_define_builtin ("__builtin_stack_restore", ftype
,
7695 BUILT_IN_STACK_RESTORE
,
7696 "__builtin_stack_restore", ECF_NOTHROW
);
7698 ftype
= build_function_type (void_type_node
, void_list_node
);
7699 local_define_builtin ("__builtin_profile_func_enter", ftype
,
7700 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
7701 local_define_builtin ("__builtin_profile_func_exit", ftype
,
7702 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
7704 /* Complex multiplication and division. These are handled as builtins
7705 rather than optabs because emit_library_call_value doesn't support
7706 complex. Further, we can do slightly better with folding these
7707 beasties if the real and complex parts of the arguments are separate. */
7709 enum machine_mode mode
;
7711 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
7713 char mode_name_buf
[4], *q
;
7715 enum built_in_function mcode
, dcode
;
7716 tree type
, inner_type
;
7718 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
7721 inner_type
= TREE_TYPE (type
);
7723 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
7724 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7725 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7726 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7727 ftype
= build_function_type (type
, tmp
);
7729 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7730 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7732 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
7736 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
7737 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
7738 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
7740 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
7741 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
7742 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
7747 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7750 If we requested a pointer to a vector, build up the pointers that
7751 we stripped off while looking for the inner type. Similarly for
7752 return values from functions.
7754 The argument TYPE is the top of the chain, and BOTTOM is the
7755 new type which we will point to. */
7758 reconstruct_complex_type (tree type
, tree bottom
)
7762 if (TREE_CODE (type
) == POINTER_TYPE
)
7764 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7765 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
7766 TYPE_REF_CAN_ALIAS_ALL (type
));
7768 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
7770 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7771 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
7772 TYPE_REF_CAN_ALIAS_ALL (type
));
7774 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7776 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7777 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
7779 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
7781 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7782 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
7784 else if (TREE_CODE (type
) == METHOD_TYPE
)
7786 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7787 /* The build_method_type_directly() routine prepends 'this' to argument list,
7788 so we must compensate by getting rid of it. */
7790 = build_method_type_directly
7791 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
7793 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
7795 else if (TREE_CODE (type
) == OFFSET_TYPE
)
7797 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7798 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
7803 return build_qualified_type (outer
, TYPE_QUALS (type
));
7806 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7809 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
7813 switch (GET_MODE_CLASS (mode
))
7815 case MODE_VECTOR_INT
:
7816 case MODE_VECTOR_FLOAT
:
7817 case MODE_VECTOR_FRACT
:
7818 case MODE_VECTOR_UFRACT
:
7819 case MODE_VECTOR_ACCUM
:
7820 case MODE_VECTOR_UACCUM
:
7821 nunits
= GET_MODE_NUNITS (mode
);
7825 /* Check that there are no leftover bits. */
7826 gcc_assert (GET_MODE_BITSIZE (mode
)
7827 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
7829 nunits
= GET_MODE_BITSIZE (mode
)
7830 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
7837 return make_vector_type (innertype
, nunits
, mode
);
7840 /* Similarly, but takes the inner type and number of units, which must be
7844 build_vector_type (tree innertype
, int nunits
)
7846 return make_vector_type (innertype
, nunits
, VOIDmode
);
7850 /* Build RESX_EXPR with given REGION_NUMBER. */
7852 build_resx (int region_number
)
7855 t
= build1 (RESX_EXPR
, void_type_node
,
7856 build_int_cst (NULL_TREE
, region_number
));
7860 /* Given an initializer INIT, return TRUE if INIT is zero or some
7861 aggregate of zeros. Otherwise return FALSE. */
7863 initializer_zerop (const_tree init
)
7869 switch (TREE_CODE (init
))
7872 return integer_zerop (init
);
7875 /* ??? Note that this is not correct for C4X float formats. There,
7876 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7877 negative exponent. */
7878 return real_zerop (init
)
7879 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
7882 return fixed_zerop (init
);
7885 return integer_zerop (init
)
7886 || (real_zerop (init
)
7887 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
7888 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
7891 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
7892 if (!initializer_zerop (TREE_VALUE (elt
)))
7898 unsigned HOST_WIDE_INT idx
;
7900 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
7901 if (!initializer_zerop (elt
))
7911 /* Build an empty statement. */
7914 build_empty_stmt (void)
7916 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
7920 /* Build an OpenMP clause with code CODE. */
7923 build_omp_clause (enum omp_clause_code code
)
7928 length
= omp_clause_num_ops
[code
];
7929 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
7931 t
= GGC_NEWVAR (union tree_node
, size
);
7932 memset (t
, 0, size
);
7933 TREE_SET_CODE (t
, OMP_CLAUSE
);
7934 OMP_CLAUSE_SET_CODE (t
, code
);
7936 #ifdef GATHER_STATISTICS
7937 tree_node_counts
[(int) omp_clause_kind
]++;
7938 tree_node_sizes
[(int) omp_clause_kind
] += size
;
7944 /* Set various status flags when building a CALL_EXPR object T. */
7947 process_call_operands (tree t
)
7951 side_effects
= TREE_SIDE_EFFECTS (t
);
7955 n
= TREE_OPERAND_LENGTH (t
);
7956 for (i
= 1; i
< n
; i
++)
7958 tree op
= TREE_OPERAND (t
, i
);
7959 if (op
&& TREE_SIDE_EFFECTS (op
))
7970 /* Calls have side-effects, except those to const or
7972 i
= call_expr_flags (t
);
7973 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
7976 TREE_SIDE_EFFECTS (t
) = side_effects
;
7979 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7980 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7981 Except for the CODE and operand count field, other storage for the
7982 object is initialized to zeros. */
7985 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
7988 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
7990 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
7991 gcc_assert (len
>= 1);
7993 #ifdef GATHER_STATISTICS
7994 tree_node_counts
[(int) e_kind
]++;
7995 tree_node_sizes
[(int) e_kind
] += length
;
7998 t
= (tree
) ggc_alloc_zone_pass_stat (length
, &tree_zone
);
8000 memset (t
, 0, length
);
8002 TREE_SET_CODE (t
, code
);
8004 /* Can't use TREE_OPERAND to store the length because if checking is
8005 enabled, it will try to check the length before we store it. :-P */
8006 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
8012 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
8013 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
8017 build_call_list (tree return_type
, tree fn
, tree arglist
)
8022 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
8023 TREE_TYPE (t
) = return_type
;
8024 CALL_EXPR_FN (t
) = fn
;
8025 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
8026 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
8027 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
8028 process_call_operands (t
);
8032 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8033 FN and a null static chain slot. NARGS is the number of call arguments
8034 which are specified as "..." arguments. */
8037 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
8041 va_start (args
, nargs
);
8042 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
8047 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8048 FN and a null static chain slot. NARGS is the number of call arguments
8049 which are specified as a va_list ARGS. */
8052 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
8057 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
8058 TREE_TYPE (t
) = return_type
;
8059 CALL_EXPR_FN (t
) = fn
;
8060 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
8061 for (i
= 0; i
< nargs
; i
++)
8062 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
8063 process_call_operands (t
);
8067 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
8068 FN and a null static chain slot. NARGS is the number of call arguments
8069 which are specified as a tree array ARGS. */
8072 build_call_array (tree return_type
, tree fn
, int nargs
, tree
*args
)
8077 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
8078 TREE_TYPE (t
) = return_type
;
8079 CALL_EXPR_FN (t
) = fn
;
8080 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
8081 for (i
= 0; i
< nargs
; i
++)
8082 CALL_EXPR_ARG (t
, i
) = args
[i
];
8083 process_call_operands (t
);
8088 /* Returns true if it is possible to prove that the index of
8089 an array access REF (an ARRAY_REF expression) falls into the
8093 in_array_bounds_p (tree ref
)
8095 tree idx
= TREE_OPERAND (ref
, 1);
8098 if (TREE_CODE (idx
) != INTEGER_CST
)
8101 min
= array_ref_low_bound (ref
);
8102 max
= array_ref_up_bound (ref
);
8105 || TREE_CODE (min
) != INTEGER_CST
8106 || TREE_CODE (max
) != INTEGER_CST
)
8109 if (tree_int_cst_lt (idx
, min
)
8110 || tree_int_cst_lt (max
, idx
))
8116 /* Returns true if it is possible to prove that the range of
8117 an array access REF (an ARRAY_RANGE_REF expression) falls
8118 into the array bounds. */
8121 range_in_array_bounds_p (tree ref
)
8123 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
8124 tree range_min
, range_max
, min
, max
;
8126 range_min
= TYPE_MIN_VALUE (domain_type
);
8127 range_max
= TYPE_MAX_VALUE (domain_type
);
8130 || TREE_CODE (range_min
) != INTEGER_CST
8131 || TREE_CODE (range_max
) != INTEGER_CST
)
8134 min
= array_ref_low_bound (ref
);
8135 max
= array_ref_up_bound (ref
);
8138 || TREE_CODE (min
) != INTEGER_CST
8139 || TREE_CODE (max
) != INTEGER_CST
)
8142 if (tree_int_cst_lt (range_min
, min
)
8143 || tree_int_cst_lt (max
, range_max
))
8149 /* Return true if T (assumed to be a DECL) must be assigned a memory
8153 needs_to_live_in_memory (const_tree t
)
8155 if (TREE_CODE (t
) == SSA_NAME
)
8156 t
= SSA_NAME_VAR (t
);
8158 return (TREE_ADDRESSABLE (t
)
8159 || is_global_var (t
)
8160 || (TREE_CODE (t
) == RESULT_DECL
8161 && aggregate_value_p (t
, current_function_decl
)));
8164 /* There are situations in which a language considers record types
8165 compatible which have different field lists. Decide if two fields
8166 are compatible. It is assumed that the parent records are compatible. */
8169 fields_compatible_p (const_tree f1
, const_tree f2
)
8171 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
8172 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
8175 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
8176 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
8179 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
8185 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
8188 find_compatible_field (tree record
, tree orig_field
)
8192 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
8193 if (TREE_CODE (f
) == FIELD_DECL
8194 && fields_compatible_p (f
, orig_field
))
8197 /* ??? Why isn't this on the main fields list? */
8198 f
= TYPE_VFIELD (record
);
8199 if (f
&& TREE_CODE (f
) == FIELD_DECL
8200 && fields_compatible_p (f
, orig_field
))
8203 /* ??? We should abort here, but Java appears to do Bad Things
8204 with inherited fields. */
8208 /* Return value of a constant X and sign-extend it. */
8211 int_cst_value (const_tree x
)
8213 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
8214 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
8216 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8217 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
8218 || TREE_INT_CST_HIGH (x
) == -1);
8220 if (bits
< HOST_BITS_PER_WIDE_INT
)
8222 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
8224 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
8226 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
8232 /* If TYPE is an integral type, return an equivalent type which is
8233 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8234 return TYPE itself. */
8237 signed_or_unsigned_type_for (int unsignedp
, tree type
)
8240 if (POINTER_TYPE_P (type
))
8243 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
8246 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
8249 /* Returns unsigned variant of TYPE. */
8252 unsigned_type_for (tree type
)
8254 return signed_or_unsigned_type_for (1, type
);
8257 /* Returns signed variant of TYPE. */
8260 signed_type_for (tree type
)
8262 return signed_or_unsigned_type_for (0, type
);
8265 /* Returns the largest value obtainable by casting something in INNER type to
8269 upper_bound_in_type (tree outer
, tree inner
)
8271 unsigned HOST_WIDE_INT lo
, hi
;
8272 unsigned int det
= 0;
8273 unsigned oprec
= TYPE_PRECISION (outer
);
8274 unsigned iprec
= TYPE_PRECISION (inner
);
8277 /* Compute a unique number for every combination. */
8278 det
|= (oprec
> iprec
) ? 4 : 0;
8279 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
8280 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
8282 /* Determine the exponent to use. */
8287 /* oprec <= iprec, outer: signed, inner: don't care. */
8292 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8296 /* oprec > iprec, outer: signed, inner: signed. */
8300 /* oprec > iprec, outer: signed, inner: unsigned. */
8304 /* oprec > iprec, outer: unsigned, inner: signed. */
8308 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8315 /* Compute 2^^prec - 1. */
8316 if (prec
<= HOST_BITS_PER_WIDE_INT
)
8319 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
8320 >> (HOST_BITS_PER_WIDE_INT
- prec
));
8324 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
8325 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
8326 lo
= ~(unsigned HOST_WIDE_INT
) 0;
8329 return build_int_cst_wide (outer
, lo
, hi
);
8332 /* Returns the smallest value obtainable by casting something in INNER type to
8336 lower_bound_in_type (tree outer
, tree inner
)
8338 unsigned HOST_WIDE_INT lo
, hi
;
8339 unsigned oprec
= TYPE_PRECISION (outer
);
8340 unsigned iprec
= TYPE_PRECISION (inner
);
8342 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8344 if (TYPE_UNSIGNED (outer
)
8345 /* If we are widening something of an unsigned type, OUTER type
8346 contains all values of INNER type. In particular, both INNER
8347 and OUTER types have zero in common. */
8348 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
8352 /* If we are widening a signed type to another signed type, we
8353 want to obtain -2^^(iprec-1). If we are keeping the
8354 precision or narrowing to a signed type, we want to obtain
8356 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
8358 if (prec
<= HOST_BITS_PER_WIDE_INT
)
8360 hi
= ~(unsigned HOST_WIDE_INT
) 0;
8361 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
8365 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
8366 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
8371 return build_int_cst_wide (outer
, lo
, hi
);
8374 /* Return nonzero if two operands that are suitable for PHI nodes are
8375 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8376 SSA_NAME or invariant. Note that this is strictly an optimization.
8377 That is, callers of this function can directly call operand_equal_p
8378 and get the same result, only slower. */
8381 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
8385 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
8387 return operand_equal_p (arg0
, arg1
, 0);
8390 /* Returns number of zeros at the end of binary representation of X.
8392 ??? Use ffs if available? */
8395 num_ending_zeros (const_tree x
)
8397 unsigned HOST_WIDE_INT fr
, nfr
;
8398 unsigned num
, abits
;
8399 tree type
= TREE_TYPE (x
);
8401 if (TREE_INT_CST_LOW (x
) == 0)
8403 num
= HOST_BITS_PER_WIDE_INT
;
8404 fr
= TREE_INT_CST_HIGH (x
);
8409 fr
= TREE_INT_CST_LOW (x
);
8412 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
8415 if (nfr
<< abits
== fr
)
8422 if (num
> TYPE_PRECISION (type
))
8423 num
= TYPE_PRECISION (type
);
8425 return build_int_cst_type (type
, num
);
8429 #define WALK_SUBTREE(NODE) \
8432 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8438 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8439 be walked whenever a type is seen in the tree. Rest of operands and return
8440 value are as for walk_tree. */
8443 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
8444 struct pointer_set_t
*pset
, walk_tree_lh lh
)
8446 tree result
= NULL_TREE
;
8448 switch (TREE_CODE (type
))
8451 case REFERENCE_TYPE
:
8452 /* We have to worry about mutually recursive pointers. These can't
8453 be written in C. They can in Ada. It's pathological, but
8454 there's an ACATS test (c38102a) that checks it. Deal with this
8455 by checking if we're pointing to another pointer, that one
8456 points to another pointer, that one does too, and we have no htab.
8457 If so, get a hash table. We check three levels deep to avoid
8458 the cost of the hash table if we don't need one. */
8459 if (POINTER_TYPE_P (TREE_TYPE (type
))
8460 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
8461 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
8464 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
8472 /* ... fall through ... */
8475 WALK_SUBTREE (TREE_TYPE (type
));
8479 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
8484 WALK_SUBTREE (TREE_TYPE (type
));
8488 /* We never want to walk into default arguments. */
8489 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
8490 WALK_SUBTREE (TREE_VALUE (arg
));
8495 /* Don't follow this nodes's type if a pointer for fear that
8496 we'll have infinite recursion. If we have a PSET, then we
8499 || (!POINTER_TYPE_P (TREE_TYPE (type
))
8500 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
8501 WALK_SUBTREE (TREE_TYPE (type
));
8502 WALK_SUBTREE (TYPE_DOMAIN (type
));
8506 WALK_SUBTREE (TREE_TYPE (type
));
8507 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
8517 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8518 called with the DATA and the address of each sub-tree. If FUNC returns a
8519 non-NULL value, the traversal is stopped, and the value returned by FUNC
8520 is returned. If PSET is non-NULL it is used to record the nodes visited,
8521 and to avoid visiting a node more than once. */
8524 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
8525 struct pointer_set_t
*pset
, walk_tree_lh lh
)
8527 enum tree_code code
;
8531 #define WALK_SUBTREE_TAIL(NODE) \
8535 goto tail_recurse; \
8540 /* Skip empty subtrees. */
8544 /* Don't walk the same tree twice, if the user has requested
8545 that we avoid doing so. */
8546 if (pset
&& pointer_set_insert (pset
, *tp
))
8549 /* Call the function. */
8551 result
= (*func
) (tp
, &walk_subtrees
, data
);
8553 /* If we found something, return it. */
8557 code
= TREE_CODE (*tp
);
8559 /* Even if we didn't, FUNC may have decided that there was nothing
8560 interesting below this point in the tree. */
8563 /* But we still need to check our siblings. */
8564 if (code
== TREE_LIST
)
8565 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
8566 else if (code
== OMP_CLAUSE
)
8567 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8574 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
8575 if (result
|| !walk_subtrees
)
8582 case IDENTIFIER_NODE
:
8589 case PLACEHOLDER_EXPR
:
8593 /* None of these have subtrees other than those already walked
8598 WALK_SUBTREE (TREE_VALUE (*tp
));
8599 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
8604 int len
= TREE_VEC_LENGTH (*tp
);
8609 /* Walk all elements but the first. */
8611 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
8613 /* Now walk the first one as a tail call. */
8614 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
8618 WALK_SUBTREE (TREE_REALPART (*tp
));
8619 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
8623 unsigned HOST_WIDE_INT idx
;
8624 constructor_elt
*ce
;
8627 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
8629 WALK_SUBTREE (ce
->value
);
8634 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
8639 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
8641 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8642 into declarations that are just mentioned, rather than
8643 declared; they don't really belong to this part of the tree.
8644 And, we can see cycles: the initializer for a declaration
8645 can refer to the declaration itself. */
8646 WALK_SUBTREE (DECL_INITIAL (decl
));
8647 WALK_SUBTREE (DECL_SIZE (decl
));
8648 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
8650 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
8653 case STATEMENT_LIST
:
8655 tree_stmt_iterator i
;
8656 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
8657 WALK_SUBTREE (*tsi_stmt_ptr (i
));
8662 switch (OMP_CLAUSE_CODE (*tp
))
8664 case OMP_CLAUSE_PRIVATE
:
8665 case OMP_CLAUSE_SHARED
:
8666 case OMP_CLAUSE_FIRSTPRIVATE
:
8667 case OMP_CLAUSE_COPYIN
:
8668 case OMP_CLAUSE_COPYPRIVATE
:
8670 case OMP_CLAUSE_NUM_THREADS
:
8671 case OMP_CLAUSE_SCHEDULE
:
8672 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
8675 case OMP_CLAUSE_NOWAIT
:
8676 case OMP_CLAUSE_ORDERED
:
8677 case OMP_CLAUSE_DEFAULT
:
8678 case OMP_CLAUSE_UNTIED
:
8679 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8681 case OMP_CLAUSE_LASTPRIVATE
:
8682 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
8683 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
8684 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8686 case OMP_CLAUSE_COLLAPSE
:
8689 for (i
= 0; i
< 3; i
++)
8690 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
8691 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8694 case OMP_CLAUSE_REDUCTION
:
8697 for (i
= 0; i
< 4; i
++)
8698 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
8699 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8711 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8712 But, we only want to walk once. */
8713 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
8714 for (i
= 0; i
< len
; ++i
)
8715 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
8716 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
8719 case CHANGE_DYNAMIC_TYPE_EXPR
:
8720 WALK_SUBTREE (CHANGE_DYNAMIC_TYPE_NEW_TYPE (*tp
));
8721 WALK_SUBTREE_TAIL (CHANGE_DYNAMIC_TYPE_LOCATION (*tp
));
8724 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8725 defining. We only want to walk into these fields of a type in this
8726 case and not in the general case of a mere reference to the type.
8728 The criterion is as follows: if the field can be an expression, it
8729 must be walked only here. This should be in keeping with the fields
8730 that are directly gimplified in gimplify_type_sizes in order for the
8731 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8732 variable-sized types.
8734 Note that DECLs get walked as part of processing the BIND_EXPR. */
8735 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
8737 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
8738 if (TREE_CODE (*type_p
) == ERROR_MARK
)
8741 /* Call the function for the type. See if it returns anything or
8742 doesn't want us to continue. If we are to continue, walk both
8743 the normal fields and those for the declaration case. */
8744 result
= (*func
) (type_p
, &walk_subtrees
, data
);
8745 if (result
|| !walk_subtrees
)
8748 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
8752 /* If this is a record type, also walk the fields. */
8753 if (TREE_CODE (*type_p
) == RECORD_TYPE
8754 || TREE_CODE (*type_p
) == UNION_TYPE
8755 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8759 for (field
= TYPE_FIELDS (*type_p
); field
;
8760 field
= TREE_CHAIN (field
))
8762 /* We'd like to look at the type of the field, but we can
8763 easily get infinite recursion. So assume it's pointed
8764 to elsewhere in the tree. Also, ignore things that
8766 if (TREE_CODE (field
) != FIELD_DECL
)
8769 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
8770 WALK_SUBTREE (DECL_SIZE (field
));
8771 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
8772 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8773 WALK_SUBTREE (DECL_QUALIFIER (field
));
8777 /* Same for scalar types. */
8778 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
8779 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
8780 || TREE_CODE (*type_p
) == INTEGER_TYPE
8781 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
8782 || TREE_CODE (*type_p
) == REAL_TYPE
)
8784 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
8785 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
8788 WALK_SUBTREE (TYPE_SIZE (*type_p
));
8789 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
8794 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
8798 /* Walk over all the sub-trees of this operand. */
8799 len
= TREE_OPERAND_LENGTH (*tp
);
8801 /* Go through the subtrees. We need to do this in forward order so
8802 that the scope of a FOR_EXPR is handled properly. */
8805 for (i
= 0; i
< len
- 1; ++i
)
8806 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
8807 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
8810 /* If this is a type, walk the needed fields in the type. */
8811 else if (TYPE_P (*tp
))
8812 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
8816 /* We didn't find what we were looking for. */
8819 #undef WALK_SUBTREE_TAIL
8823 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8826 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
8830 struct pointer_set_t
*pset
;
8832 pset
= pointer_set_create ();
8833 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
8834 pointer_set_destroy (pset
);
8842 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
8844 if (IS_EXPR_CODE_CLASS (c
))
8845 return &t
->exp
.block
;
8850 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8851 FIXME: don't use this function. It exists for compatibility with
8852 the old representation of CALL_EXPRs where a list was used to hold the
8853 arguments. Places that currently extract the arglist from a CALL_EXPR
8854 ought to be rewritten to use the CALL_EXPR itself. */
8856 call_expr_arglist (tree exp
)
8858 tree arglist
= NULL_TREE
;
8860 for (i
= call_expr_nargs (exp
) - 1; i
>= 0; i
--)
8861 arglist
= tree_cons (NULL_TREE
, CALL_EXPR_ARG (exp
, i
), arglist
);
8866 /* Create a nameless artificial label and put it in the current function
8867 context. Returns the newly created label. */
8870 create_artificial_label (void)
8872 tree lab
= build_decl (LABEL_DECL
, NULL_TREE
, void_type_node
);
8874 DECL_ARTIFICIAL (lab
) = 1;
8875 DECL_IGNORED_P (lab
) = 1;
8876 DECL_CONTEXT (lab
) = current_function_decl
;
8880 /* Given a tree, try to return a useful variable name that we can use
8881 to prefix a temporary that is being assigned the value of the tree.
8882 I.E. given <temp> = &A, return A. */
8890 STRIP_NOPS (stripped_decl
);
8891 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
8892 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
8895 switch (TREE_CODE (stripped_decl
))
8898 return get_name (TREE_OPERAND (stripped_decl
, 0));
8905 /* Return true if TYPE has a variable argument list. */
8908 stdarg_p (tree fntype
)
8910 function_args_iterator args_iter
;
8911 tree n
= NULL_TREE
, t
;
8916 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
8921 return n
!= NULL_TREE
&& n
!= void_type_node
;
8924 /* Return true if TYPE has a prototype. */
8927 prototype_p (tree fntype
)
8931 gcc_assert (fntype
!= NULL_TREE
);
8933 t
= TYPE_ARG_TYPES (fntype
);
8934 return (t
!= NULL_TREE
);
8937 /* Return the number of arguments that a function has. */
8940 function_args_count (tree fntype
)
8942 function_args_iterator args_iter
;
8948 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
8957 /* If BLOCK is inlined from an __attribute__((__artificial__))
8958 routine, return pointer to location from where it has been
8961 block_nonartificial_location (tree block
)
8963 location_t
*ret
= NULL
;
8965 while (block
&& TREE_CODE (block
) == BLOCK
8966 && BLOCK_ABSTRACT_ORIGIN (block
))
8968 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
8970 while (TREE_CODE (ao
) == BLOCK
8971 && BLOCK_ABSTRACT_ORIGIN (ao
)
8972 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
8973 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
8975 if (TREE_CODE (ao
) == FUNCTION_DECL
)
8977 /* If AO is an artificial inline, point RET to the
8978 call site locus at which it has been inlined and continue
8979 the loop, in case AO's caller is also an artificial
8981 if (DECL_DECLARED_INLINE_P (ao
)
8982 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
8983 ret
= &BLOCK_SOURCE_LOCATION (block
);
8987 else if (TREE_CODE (ao
) != BLOCK
)
8990 block
= BLOCK_SUPERCONTEXT (block
);
8995 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
8998 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
9001 cl_option_hash_hash (const void *x
)
9003 const_tree
const t
= (const_tree
) x
;
9009 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
9011 p
= (const char *)TREE_OPTIMIZATION (t
);
9012 len
= sizeof (struct cl_optimization
);
9015 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
9017 p
= (const char *)TREE_TARGET_OPTION (t
);
9018 len
= sizeof (struct cl_target_option
);
9024 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
9026 for (i
= 0; i
< len
; i
++)
9028 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
9033 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
9034 TARGET_OPTION tree node) is the same as that given by *Y, which is the
9038 cl_option_hash_eq (const void *x
, const void *y
)
9040 const_tree
const xt
= (const_tree
) x
;
9041 const_tree
const yt
= (const_tree
) y
;
9046 if (TREE_CODE (xt
) != TREE_CODE (yt
))
9049 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
9051 xp
= (const char *)TREE_OPTIMIZATION (xt
);
9052 yp
= (const char *)TREE_OPTIMIZATION (yt
);
9053 len
= sizeof (struct cl_optimization
);
9056 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
9058 xp
= (const char *)TREE_TARGET_OPTION (xt
);
9059 yp
= (const char *)TREE_TARGET_OPTION (yt
);
9060 len
= sizeof (struct cl_target_option
);
9066 return (memcmp (xp
, yp
, len
) == 0);
9069 /* Build an OPTIMIZATION_NODE based on the current options. */
9072 build_optimization_node (void)
9077 /* Use the cache of optimization nodes. */
9079 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
));
9081 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
9085 /* Insert this one into the hash table. */
9086 t
= cl_optimization_node
;
9089 /* Make a new node for next time round. */
9090 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
9096 /* Build a TARGET_OPTION_NODE based on the current options. */
9099 build_target_option_node (void)
9104 /* Use the cache of optimization nodes. */
9106 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
));
9108 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
9112 /* Insert this one into the hash table. */
9113 t
= cl_target_option_node
;
9116 /* Make a new node for next time round. */
9117 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
9123 #include "gt-tree.h"