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
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"
54 /* Each tree code class has an associated string representation.
55 These must correspond to the tree_code_class entries. */
57 const char *const tree_code_class_strings
[] =
71 /* obstack.[ch] explicitly declined to prototype this. */
72 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
74 #ifdef GATHER_STATISTICS
75 /* Statistics-gathering stuff. */
77 int tree_node_counts
[(int) all_kinds
];
78 int tree_node_sizes
[(int) all_kinds
];
80 /* Keep in sync with tree.h:enum tree_node_kind. */
81 static const char * const tree_node_kind_names
[] = {
102 #endif /* GATHER_STATISTICS */
104 /* Unique id for next decl created. */
105 static GTY(()) int next_decl_uid
;
106 /* Unique id for next type created. */
107 static GTY(()) int next_type_uid
= 1;
109 /* Since we cannot rehash a type after it is in the table, we have to
110 keep the hash code. */
112 struct type_hash
GTY(())
118 /* Initial size of the hash table (rounded to next prime). */
119 #define TYPE_HASH_INITIAL_SIZE 1000
121 /* Now here is the hash table. When recording a type, it is added to
122 the slot whose index is the hash code. Note that the hash table is
123 used for several kinds of types (function types, array types and
124 array index range types, for now). While all these live in the
125 same table, they are completely independent, and the hash code is
126 computed differently for each of these. */
128 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
129 htab_t type_hash_table
;
131 /* Hash table and temporary node for larger integer const values. */
132 static GTY (()) tree int_cst_node
;
133 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
134 htab_t int_cst_hash_table
;
136 /* General tree->tree mapping structure for use in hash tables. */
139 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
140 htab_t debug_expr_for_decl
;
142 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
143 htab_t value_expr_for_decl
;
145 static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map
)))
146 htab_t init_priority_for_decl
;
148 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
149 htab_t restrict_base_for_decl
;
151 struct tree_int_map
GTY(())
156 static unsigned int tree_int_map_hash (const void *);
157 static int tree_int_map_eq (const void *, const void *);
158 static int tree_int_map_marked_p (const void *);
159 static void set_type_quals (tree
, int);
160 static int type_hash_eq (const void *, const void *);
161 static hashval_t
type_hash_hash (const void *);
162 static hashval_t
int_cst_hash_hash (const void *);
163 static int int_cst_hash_eq (const void *, const void *);
164 static void print_type_hash_statistics (void);
165 static void print_debug_expr_statistics (void);
166 static void print_value_expr_statistics (void);
167 static int type_hash_marked_p (const void *);
168 static unsigned int type_hash_list (tree
, hashval_t
);
169 static unsigned int attribute_hash_list (tree
, hashval_t
);
171 tree global_trees
[TI_MAX
];
172 tree integer_types
[itk_none
];
174 unsigned char tree_contains_struct
[256][64];
176 /* Number of operands for each OpenMP clause. */
177 unsigned const char omp_clause_num_ops
[] =
179 0, /* OMP_CLAUSE_ERROR */
180 1, /* OMP_CLAUSE_PRIVATE */
181 1, /* OMP_CLAUSE_SHARED */
182 1, /* OMP_CLAUSE_FIRSTPRIVATE */
183 1, /* OMP_CLAUSE_LASTPRIVATE */
184 4, /* OMP_CLAUSE_REDUCTION */
185 1, /* OMP_CLAUSE_COPYIN */
186 1, /* OMP_CLAUSE_COPYPRIVATE */
187 1, /* OMP_CLAUSE_IF */
188 1, /* OMP_CLAUSE_NUM_THREADS */
189 1, /* OMP_CLAUSE_SCHEDULE */
190 0, /* OMP_CLAUSE_NOWAIT */
191 0, /* OMP_CLAUSE_ORDERED */
192 0 /* OMP_CLAUSE_DEFAULT */
195 const char * const omp_clause_code_name
[] =
218 /* Initialize the hash table of types. */
219 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
222 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
225 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
227 init_priority_for_decl
= htab_create_ggc (512, tree_int_map_hash
,
229 restrict_base_for_decl
= htab_create_ggc (256, tree_map_hash
,
232 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
233 int_cst_hash_eq
, NULL
);
235 int_cst_node
= make_node (INTEGER_CST
);
237 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
] = 1;
238 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
] = 1;
239 tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
] = 1;
242 tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
] = 1;
243 tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
] = 1;
244 tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
] = 1;
245 tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
] = 1;
246 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
] = 1;
247 tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
] = 1;
248 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
] = 1;
249 tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
] = 1;
250 tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
] = 1;
253 tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
] = 1;
254 tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
] = 1;
255 tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
] = 1;
256 tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
] = 1;
257 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
] = 1;
258 tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
] = 1;
260 tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
] = 1;
261 tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
] = 1;
262 tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
] = 1;
263 tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
] = 1;
264 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
] = 1;
265 tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
] = 1;
266 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
] = 1;
267 tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
] = 1;
268 tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
] = 1;
269 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_DECL_MINIMAL
] = 1;
270 tree_contains_struct
[NAME_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
271 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
273 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_MEMORY_TAG
] = 1;
274 tree_contains_struct
[NAME_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
275 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
277 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_STRUCT_FIELD_TAG
] = 1;
279 tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
] = 1;
280 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
] = 1;
281 tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
] = 1;
282 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
] = 1;
284 tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
] = 1;
285 tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
] = 1;
286 tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
] = 1;
287 tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
] = 1;
288 tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
] = 1;
289 tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
] = 1;
290 tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
] = 1;
291 tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
] = 1;
293 lang_hooks
.init_ts ();
297 /* The name of the object as the assembler will see it (but before any
298 translations made by ASM_OUTPUT_LABELREF). Often this is the same
299 as DECL_NAME. It is an IDENTIFIER_NODE. */
301 decl_assembler_name (tree decl
)
303 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
304 lang_hooks
.set_decl_assembler_name (decl
);
305 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
308 /* Compute the number of bytes occupied by a tree with code CODE.
309 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
310 codes, which are of variable length. */
312 tree_code_size (enum tree_code code
)
314 switch (TREE_CODE_CLASS (code
))
316 case tcc_declaration
: /* A decl node */
321 return sizeof (struct tree_field_decl
);
323 return sizeof (struct tree_parm_decl
);
325 return sizeof (struct tree_var_decl
);
327 return sizeof (struct tree_label_decl
);
329 return sizeof (struct tree_result_decl
);
331 return sizeof (struct tree_const_decl
);
333 return sizeof (struct tree_type_decl
);
335 return sizeof (struct tree_function_decl
);
336 case NAME_MEMORY_TAG
:
337 case SYMBOL_MEMORY_TAG
:
338 return sizeof (struct tree_memory_tag
);
339 case STRUCT_FIELD_TAG
:
340 return sizeof (struct tree_struct_field_tag
);
342 return sizeof (struct tree_decl_non_common
);
346 case tcc_type
: /* a type node */
347 return sizeof (struct tree_type
);
349 case tcc_reference
: /* a reference */
350 case tcc_expression
: /* an expression */
351 case tcc_statement
: /* an expression with side effects */
352 case tcc_comparison
: /* a comparison expression */
353 case tcc_unary
: /* a unary arithmetic expression */
354 case tcc_binary
: /* a binary arithmetic expression */
355 return (sizeof (struct tree_exp
)
356 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
358 case tcc_constant
: /* a constant */
361 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
362 case REAL_CST
: return sizeof (struct tree_real_cst
);
363 case COMPLEX_CST
: return sizeof (struct tree_complex
);
364 case VECTOR_CST
: return sizeof (struct tree_vector
);
365 case STRING_CST
: gcc_unreachable ();
367 return lang_hooks
.tree_size (code
);
370 case tcc_exceptional
: /* something random, like an identifier. */
373 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
374 case TREE_LIST
: return sizeof (struct tree_list
);
377 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
381 case PHI_NODE
: gcc_unreachable ();
383 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
385 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
386 case BLOCK
: return sizeof (struct tree_block
);
387 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
388 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
391 return lang_hooks
.tree_size (code
);
399 /* Compute the number of bytes occupied by NODE. This routine only
400 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
402 tree_size (tree node
)
404 enum tree_code code
= TREE_CODE (node
);
408 return (sizeof (struct tree_phi_node
)
409 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
412 return (offsetof (struct tree_binfo
, base_binfos
)
413 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
416 return (sizeof (struct tree_vec
)
417 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
420 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
423 return (sizeof (struct tree_omp_clause
)
424 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
428 return tree_code_size (code
);
432 /* Return a newly allocated node of code CODE. For decl and type
433 nodes, some other fields are initialized. The rest of the node is
434 initialized to zero. This function cannot be used for PHI_NODE,
435 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
438 Achoo! I got a code in the node. */
441 make_node_stat (enum tree_code code MEM_STAT_DECL
)
444 enum tree_code_class type
= TREE_CODE_CLASS (code
);
445 size_t length
= tree_code_size (code
);
446 #ifdef GATHER_STATISTICS
451 case tcc_declaration
: /* A decl node */
455 case tcc_type
: /* a type node */
459 case tcc_statement
: /* an expression with side effects */
463 case tcc_reference
: /* a reference */
467 case tcc_expression
: /* an expression */
468 case tcc_comparison
: /* a comparison expression */
469 case tcc_unary
: /* a unary arithmetic expression */
470 case tcc_binary
: /* a binary arithmetic expression */
474 case tcc_constant
: /* a constant */
478 case tcc_exceptional
: /* something random, like an identifier. */
481 case IDENTIFIER_NODE
:
498 kind
= ssa_name_kind
;
519 tree_node_counts
[(int) kind
]++;
520 tree_node_sizes
[(int) kind
] += length
;
523 if (code
== IDENTIFIER_NODE
)
524 t
= ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
526 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
528 memset (t
, 0, length
);
530 TREE_SET_CODE (t
, code
);
535 TREE_SIDE_EFFECTS (t
) = 1;
538 case tcc_declaration
:
539 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WITH_VIS
))
540 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
541 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
543 if (code
!= FUNCTION_DECL
)
545 DECL_USER_ALIGN (t
) = 0;
546 /* We have not yet computed the alias set for this declaration. */
547 DECL_POINTER_ALIAS_SET (t
) = -1;
549 DECL_SOURCE_LOCATION (t
) = input_location
;
550 DECL_UID (t
) = next_decl_uid
++;
555 TYPE_UID (t
) = next_type_uid
++;
556 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
557 TYPE_USER_ALIGN (t
) = 0;
558 TYPE_MAIN_VARIANT (t
) = t
;
560 /* Default to no attributes for type, but let target change that. */
561 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
562 targetm
.set_default_type_attributes (t
);
564 /* We have not yet computed the alias set for this type. */
565 TYPE_ALIAS_SET (t
) = -1;
569 TREE_CONSTANT (t
) = 1;
570 TREE_INVARIANT (t
) = 1;
579 case PREDECREMENT_EXPR
:
580 case PREINCREMENT_EXPR
:
581 case POSTDECREMENT_EXPR
:
582 case POSTINCREMENT_EXPR
:
583 /* All of these have side-effects, no matter what their
585 TREE_SIDE_EFFECTS (t
) = 1;
594 /* Other classes need no special treatment. */
601 /* Return a new node with the same contents as NODE except that its
602 TREE_CHAIN is zero and it has a fresh uid. */
605 copy_node_stat (tree node MEM_STAT_DECL
)
608 enum tree_code code
= TREE_CODE (node
);
611 gcc_assert (code
!= STATEMENT_LIST
);
613 length
= tree_size (node
);
614 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
615 memcpy (t
, node
, length
);
618 TREE_ASM_WRITTEN (t
) = 0;
619 TREE_VISITED (t
) = 0;
622 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
624 DECL_UID (t
) = next_decl_uid
++;
625 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
626 && DECL_HAS_VALUE_EXPR_P (node
))
628 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
629 DECL_HAS_VALUE_EXPR_P (t
) = 1;
631 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
633 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
634 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
636 if (TREE_CODE (node
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (node
))
638 SET_DECL_RESTRICT_BASE (t
, DECL_GET_RESTRICT_BASE (node
));
639 DECL_BASED_ON_RESTRICT_P (t
) = 1;
642 else if (TREE_CODE_CLASS (code
) == tcc_type
)
644 TYPE_UID (t
) = next_type_uid
++;
645 /* The following is so that the debug code for
646 the copy is different from the original type.
647 The two statements usually duplicate each other
648 (because they clear fields of the same union),
649 but the optimizer should catch that. */
650 TYPE_SYMTAB_POINTER (t
) = 0;
651 TYPE_SYMTAB_ADDRESS (t
) = 0;
653 /* Do not copy the values cache. */
654 if (TYPE_CACHED_VALUES_P(t
))
656 TYPE_CACHED_VALUES_P (t
) = 0;
657 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
664 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
665 For example, this can copy a list made of TREE_LIST nodes. */
668 copy_list (tree list
)
676 head
= prev
= copy_node (list
);
677 next
= TREE_CHAIN (list
);
680 TREE_CHAIN (prev
) = copy_node (next
);
681 prev
= TREE_CHAIN (prev
);
682 next
= TREE_CHAIN (next
);
688 /* Create an INT_CST node with a LOW value sign extended. */
691 build_int_cst (tree type
, HOST_WIDE_INT low
)
693 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
696 /* Create an INT_CST node with a LOW value zero extended. */
699 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
701 return build_int_cst_wide (type
, low
, 0);
704 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
705 if it is negative. This function is similar to build_int_cst, but
706 the extra bits outside of the type precision are cleared. Constants
707 with these extra bits may confuse the fold so that it detects overflows
708 even in cases when they do not occur, and in general should be avoided.
709 We cannot however make this a default behavior of build_int_cst without
710 more intrusive changes, since there are parts of gcc that rely on the extra
711 precision of the integer constants. */
714 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
716 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
717 unsigned HOST_WIDE_INT hi
, mask
;
723 type
= integer_type_node
;
725 bits
= TYPE_PRECISION (type
);
726 signed_p
= !TYPE_UNSIGNED (type
);
728 if (bits
>= HOST_BITS_PER_WIDE_INT
)
729 negative
= (low
< 0);
732 /* If the sign bit is inside precision of LOW, use it to determine
733 the sign of the constant. */
734 negative
= ((val
>> (bits
- 1)) & 1) != 0;
736 /* Mask out the bits outside of the precision of the constant. */
737 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
739 if (signed_p
&& negative
)
745 /* Determine the high bits. */
746 hi
= (negative
? ~(unsigned HOST_WIDE_INT
) 0 : 0);
748 /* For unsigned type we need to mask out the bits outside of the type
752 if (bits
<= HOST_BITS_PER_WIDE_INT
)
756 bits
-= HOST_BITS_PER_WIDE_INT
;
757 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
762 return build_int_cst_wide (type
, val
, hi
);
765 /* These are the hash table functions for the hash table of INTEGER_CST
766 nodes of a sizetype. */
768 /* Return the hash code code X, an INTEGER_CST. */
771 int_cst_hash_hash (const void *x
)
775 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
776 ^ htab_hash_pointer (TREE_TYPE (t
)));
779 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
780 is the same as that given by *Y, which is the same. */
783 int_cst_hash_eq (const void *x
, const void *y
)
788 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
789 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
790 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
793 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
794 integer_type_node is used. The returned node is always shared.
795 For small integers we use a per-type vector cache, for larger ones
796 we use a single hash table. */
799 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
806 type
= integer_type_node
;
808 switch (TREE_CODE (type
))
812 /* Cache NULL pointer. */
821 /* Cache false or true. */
829 if (TYPE_UNSIGNED (type
))
832 limit
= INTEGER_SHARE_LIMIT
;
833 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
839 limit
= INTEGER_SHARE_LIMIT
+ 1;
840 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
842 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
852 /* Look for it in the type's vector of small shared ints. */
853 if (!TYPE_CACHED_VALUES_P (type
))
855 TYPE_CACHED_VALUES_P (type
) = 1;
856 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
859 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
862 /* Make sure no one is clobbering the shared constant. */
863 gcc_assert (TREE_TYPE (t
) == type
);
864 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
865 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
869 /* Create a new shared int. */
870 t
= make_node (INTEGER_CST
);
872 TREE_INT_CST_LOW (t
) = low
;
873 TREE_INT_CST_HIGH (t
) = hi
;
874 TREE_TYPE (t
) = type
;
876 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
881 /* Use the cache of larger shared ints. */
884 TREE_INT_CST_LOW (int_cst_node
) = low
;
885 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
886 TREE_TYPE (int_cst_node
) = type
;
888 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
892 /* Insert this one into the hash table. */
895 /* Make a new node for next time round. */
896 int_cst_node
= make_node (INTEGER_CST
);
903 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
904 and the rest are zeros. */
907 build_low_bits_mask (tree type
, unsigned bits
)
909 unsigned HOST_WIDE_INT low
;
911 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
913 gcc_assert (bits
<= TYPE_PRECISION (type
));
915 if (bits
== TYPE_PRECISION (type
)
916 && !TYPE_UNSIGNED (type
))
918 /* Sign extended all-ones mask. */
922 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
924 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
929 bits
-= HOST_BITS_PER_WIDE_INT
;
931 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
934 return build_int_cst_wide (type
, low
, high
);
937 /* Checks that X is integer constant that can be expressed in (unsigned)
938 HOST_WIDE_INT without loss of precision. */
941 cst_and_fits_in_hwi (tree x
)
943 if (TREE_CODE (x
) != INTEGER_CST
)
946 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
949 return (TREE_INT_CST_HIGH (x
) == 0
950 || TREE_INT_CST_HIGH (x
) == -1);
953 /* Return a new VECTOR_CST node whose type is TYPE and whose values
954 are in a list pointed to by VALS. */
957 build_vector (tree type
, tree vals
)
959 tree v
= make_node (VECTOR_CST
);
960 int over1
= 0, over2
= 0;
963 TREE_VECTOR_CST_ELTS (v
) = vals
;
964 TREE_TYPE (v
) = type
;
966 /* Iterate through elements and check for overflow. */
967 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
969 tree value
= TREE_VALUE (link
);
971 /* Don't crash if we get an address constant. */
972 if (!CONSTANT_CLASS_P (value
))
975 over1
|= TREE_OVERFLOW (value
);
976 over2
|= TREE_CONSTANT_OVERFLOW (value
);
979 TREE_OVERFLOW (v
) = over1
;
980 TREE_CONSTANT_OVERFLOW (v
) = over2
;
985 /* Return a new VECTOR_CST node whose type is TYPE and whose values
986 are extracted from V, a vector of CONSTRUCTOR_ELT. */
989 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
991 tree list
= NULL_TREE
;
992 unsigned HOST_WIDE_INT idx
;
995 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
996 list
= tree_cons (NULL_TREE
, value
, list
);
997 return build_vector (type
, nreverse (list
));
1000 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1001 are in the VEC pointed to by VALS. */
1003 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1005 tree c
= make_node (CONSTRUCTOR
);
1006 TREE_TYPE (c
) = type
;
1007 CONSTRUCTOR_ELTS (c
) = vals
;
1011 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1014 build_constructor_single (tree type
, tree index
, tree value
)
1016 VEC(constructor_elt
,gc
) *v
;
1017 constructor_elt
*elt
;
1020 v
= VEC_alloc (constructor_elt
, gc
, 1);
1021 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1025 t
= build_constructor (type
, v
);
1026 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1031 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1032 are in a list pointed to by VALS. */
1034 build_constructor_from_list (tree type
, tree vals
)
1037 VEC(constructor_elt
,gc
) *v
= NULL
;
1038 bool constant_p
= true;
1042 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1043 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1045 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1046 val
= TREE_VALUE (t
);
1047 elt
->index
= TREE_PURPOSE (t
);
1049 if (!TREE_CONSTANT (val
))
1054 t
= build_constructor (type
, v
);
1055 TREE_CONSTANT (t
) = constant_p
;
1060 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1063 build_real (tree type
, REAL_VALUE_TYPE d
)
1066 REAL_VALUE_TYPE
*dp
;
1069 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1070 Consider doing it via real_convert now. */
1072 v
= make_node (REAL_CST
);
1073 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
1074 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1076 TREE_TYPE (v
) = type
;
1077 TREE_REAL_CST_PTR (v
) = dp
;
1078 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1082 /* Return a new REAL_CST node whose type is TYPE
1083 and whose value is the integer value of the INTEGER_CST node I. */
1086 real_value_from_int_cst (tree type
, tree i
)
1090 /* Clear all bits of the real value type so that we can later do
1091 bitwise comparisons to see if two values are the same. */
1092 memset (&d
, 0, sizeof d
);
1094 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1095 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1096 TYPE_UNSIGNED (TREE_TYPE (i
)));
1100 /* Given a tree representing an integer constant I, return a tree
1101 representing the same value as a floating-point constant of type TYPE. */
1104 build_real_from_int_cst (tree type
, tree i
)
1107 int overflow
= TREE_OVERFLOW (i
);
1109 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1111 TREE_OVERFLOW (v
) |= overflow
;
1112 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
1116 /* Return a newly constructed STRING_CST node whose value is
1117 the LEN characters at STR.
1118 The TREE_TYPE is not initialized. */
1121 build_string (int len
, const char *str
)
1126 /* Do not waste bytes provided by padding of struct tree_string. */
1127 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1129 #ifdef GATHER_STATISTICS
1130 tree_node_counts
[(int) c_kind
]++;
1131 tree_node_sizes
[(int) c_kind
] += length
;
1134 s
= ggc_alloc_tree (length
);
1136 memset (s
, 0, sizeof (struct tree_common
));
1137 TREE_SET_CODE (s
, STRING_CST
);
1138 TREE_CONSTANT (s
) = 1;
1139 TREE_INVARIANT (s
) = 1;
1140 TREE_STRING_LENGTH (s
) = len
;
1141 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
1142 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
1147 /* Return a newly constructed COMPLEX_CST node whose value is
1148 specified by the real and imaginary parts REAL and IMAG.
1149 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1150 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1153 build_complex (tree type
, tree real
, tree imag
)
1155 tree t
= make_node (COMPLEX_CST
);
1157 TREE_REALPART (t
) = real
;
1158 TREE_IMAGPART (t
) = imag
;
1159 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1160 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1161 TREE_CONSTANT_OVERFLOW (t
)
1162 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1166 /* Return a constant of arithmetic type TYPE which is the
1167 multiplicative identity of the set TYPE. */
1170 build_one_cst (tree type
)
1172 switch (TREE_CODE (type
))
1174 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1175 case POINTER_TYPE
: case REFERENCE_TYPE
:
1177 return build_int_cst (type
, 1);
1180 return build_real (type
, dconst1
);
1187 scalar
= build_one_cst (TREE_TYPE (type
));
1189 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1191 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1192 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1194 return build_vector (type
, cst
);
1198 return build_complex (type
,
1199 build_one_cst (TREE_TYPE (type
)),
1200 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1207 /* Build a BINFO with LEN language slots. */
1210 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1213 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1214 + VEC_embedded_size (tree
, base_binfos
));
1216 #ifdef GATHER_STATISTICS
1217 tree_node_counts
[(int) binfo_kind
]++;
1218 tree_node_sizes
[(int) binfo_kind
] += length
;
1221 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1223 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1225 TREE_SET_CODE (t
, TREE_BINFO
);
1227 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1233 /* Build a newly constructed TREE_VEC node of length LEN. */
1236 make_tree_vec_stat (int len MEM_STAT_DECL
)
1239 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1241 #ifdef GATHER_STATISTICS
1242 tree_node_counts
[(int) vec_kind
]++;
1243 tree_node_sizes
[(int) vec_kind
] += length
;
1246 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1248 memset (t
, 0, length
);
1250 TREE_SET_CODE (t
, TREE_VEC
);
1251 TREE_VEC_LENGTH (t
) = len
;
1256 /* Return 1 if EXPR is the integer constant zero or a complex constant
1260 integer_zerop (tree expr
)
1264 return ((TREE_CODE (expr
) == INTEGER_CST
1265 && TREE_INT_CST_LOW (expr
) == 0
1266 && TREE_INT_CST_HIGH (expr
) == 0)
1267 || (TREE_CODE (expr
) == COMPLEX_CST
1268 && integer_zerop (TREE_REALPART (expr
))
1269 && integer_zerop (TREE_IMAGPART (expr
))));
1272 /* Return 1 if EXPR is the integer constant one or the corresponding
1273 complex constant. */
1276 integer_onep (tree expr
)
1280 return ((TREE_CODE (expr
) == INTEGER_CST
1281 && TREE_INT_CST_LOW (expr
) == 1
1282 && TREE_INT_CST_HIGH (expr
) == 0)
1283 || (TREE_CODE (expr
) == COMPLEX_CST
1284 && integer_onep (TREE_REALPART (expr
))
1285 && integer_zerop (TREE_IMAGPART (expr
))));
1288 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1289 it contains. Likewise for the corresponding complex constant. */
1292 integer_all_onesp (tree expr
)
1299 if (TREE_CODE (expr
) == COMPLEX_CST
1300 && integer_all_onesp (TREE_REALPART (expr
))
1301 && integer_zerop (TREE_IMAGPART (expr
)))
1304 else if (TREE_CODE (expr
) != INTEGER_CST
)
1307 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1308 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1309 && TREE_INT_CST_HIGH (expr
) == -1)
1314 /* Note that using TYPE_PRECISION here is wrong. We care about the
1315 actual bits, not the (arbitrary) range of the type. */
1316 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1317 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1319 HOST_WIDE_INT high_value
;
1322 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1324 /* Can not handle precisions greater than twice the host int size. */
1325 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1326 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1327 /* Shifting by the host word size is undefined according to the ANSI
1328 standard, so we must handle this as a special case. */
1331 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1333 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1334 && TREE_INT_CST_HIGH (expr
) == high_value
);
1337 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1340 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1344 integer_pow2p (tree expr
)
1347 HOST_WIDE_INT high
, low
;
1351 if (TREE_CODE (expr
) == COMPLEX_CST
1352 && integer_pow2p (TREE_REALPART (expr
))
1353 && integer_zerop (TREE_IMAGPART (expr
)))
1356 if (TREE_CODE (expr
) != INTEGER_CST
)
1359 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1360 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1361 high
= TREE_INT_CST_HIGH (expr
);
1362 low
= TREE_INT_CST_LOW (expr
);
1364 /* First clear all bits that are beyond the type's precision in case
1365 we've been sign extended. */
1367 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1369 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1370 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1374 if (prec
< HOST_BITS_PER_WIDE_INT
)
1375 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1378 if (high
== 0 && low
== 0)
1381 return ((high
== 0 && (low
& (low
- 1)) == 0)
1382 || (low
== 0 && (high
& (high
- 1)) == 0));
1385 /* Return 1 if EXPR is an integer constant other than zero or a
1386 complex constant other than zero. */
1389 integer_nonzerop (tree expr
)
1393 return ((TREE_CODE (expr
) == INTEGER_CST
1394 && (TREE_INT_CST_LOW (expr
) != 0
1395 || TREE_INT_CST_HIGH (expr
) != 0))
1396 || (TREE_CODE (expr
) == COMPLEX_CST
1397 && (integer_nonzerop (TREE_REALPART (expr
))
1398 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1401 /* Return the power of two represented by a tree node known to be a
1405 tree_log2 (tree expr
)
1408 HOST_WIDE_INT high
, low
;
1412 if (TREE_CODE (expr
) == COMPLEX_CST
)
1413 return tree_log2 (TREE_REALPART (expr
));
1415 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1416 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1418 high
= TREE_INT_CST_HIGH (expr
);
1419 low
= TREE_INT_CST_LOW (expr
);
1421 /* First clear all bits that are beyond the type's precision in case
1422 we've been sign extended. */
1424 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1426 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1427 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1431 if (prec
< HOST_BITS_PER_WIDE_INT
)
1432 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1435 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1436 : exact_log2 (low
));
1439 /* Similar, but return the largest integer Y such that 2 ** Y is less
1440 than or equal to EXPR. */
1443 tree_floor_log2 (tree expr
)
1446 HOST_WIDE_INT high
, low
;
1450 if (TREE_CODE (expr
) == COMPLEX_CST
)
1451 return tree_log2 (TREE_REALPART (expr
));
1453 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1454 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1456 high
= TREE_INT_CST_HIGH (expr
);
1457 low
= TREE_INT_CST_LOW (expr
);
1459 /* First clear all bits that are beyond the type's precision in case
1460 we've been sign extended. Ignore if type's precision hasn't been set
1461 since what we are doing is setting it. */
1463 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1465 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1466 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1470 if (prec
< HOST_BITS_PER_WIDE_INT
)
1471 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1474 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1475 : floor_log2 (low
));
1478 /* Return 1 if EXPR is the real constant zero. */
1481 real_zerop (tree expr
)
1485 return ((TREE_CODE (expr
) == REAL_CST
1486 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1487 || (TREE_CODE (expr
) == COMPLEX_CST
1488 && real_zerop (TREE_REALPART (expr
))
1489 && real_zerop (TREE_IMAGPART (expr
))));
1492 /* Return 1 if EXPR is the real constant one in real or complex form. */
1495 real_onep (tree expr
)
1499 return ((TREE_CODE (expr
) == REAL_CST
1500 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1501 || (TREE_CODE (expr
) == COMPLEX_CST
1502 && real_onep (TREE_REALPART (expr
))
1503 && real_zerop (TREE_IMAGPART (expr
))));
1506 /* Return 1 if EXPR is the real constant two. */
1509 real_twop (tree expr
)
1513 return ((TREE_CODE (expr
) == REAL_CST
1514 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1515 || (TREE_CODE (expr
) == COMPLEX_CST
1516 && real_twop (TREE_REALPART (expr
))
1517 && real_zerop (TREE_IMAGPART (expr
))));
1520 /* Return 1 if EXPR is the real constant minus one. */
1523 real_minus_onep (tree expr
)
1527 return ((TREE_CODE (expr
) == REAL_CST
1528 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1529 || (TREE_CODE (expr
) == COMPLEX_CST
1530 && real_minus_onep (TREE_REALPART (expr
))
1531 && real_zerop (TREE_IMAGPART (expr
))));
1534 /* Nonzero if EXP is a constant or a cast of a constant. */
1537 really_constant_p (tree exp
)
1539 /* This is not quite the same as STRIP_NOPS. It does more. */
1540 while (TREE_CODE (exp
) == NOP_EXPR
1541 || TREE_CODE (exp
) == CONVERT_EXPR
1542 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1543 exp
= TREE_OPERAND (exp
, 0);
1544 return TREE_CONSTANT (exp
);
1547 /* Return first list element whose TREE_VALUE is ELEM.
1548 Return 0 if ELEM is not in LIST. */
1551 value_member (tree elem
, tree list
)
1555 if (elem
== TREE_VALUE (list
))
1557 list
= TREE_CHAIN (list
);
1562 /* Return first list element whose TREE_PURPOSE is ELEM.
1563 Return 0 if ELEM is not in LIST. */
1566 purpose_member (tree elem
, tree list
)
1570 if (elem
== TREE_PURPOSE (list
))
1572 list
= TREE_CHAIN (list
);
1577 /* Return nonzero if ELEM is part of the chain CHAIN. */
1580 chain_member (tree elem
, tree chain
)
1586 chain
= TREE_CHAIN (chain
);
1592 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1593 We expect a null pointer to mark the end of the chain.
1594 This is the Lisp primitive `length'. */
1597 list_length (tree t
)
1600 #ifdef ENABLE_TREE_CHECKING
1608 #ifdef ENABLE_TREE_CHECKING
1611 gcc_assert (p
!= q
);
1619 /* Returns the number of FIELD_DECLs in TYPE. */
1622 fields_length (tree type
)
1624 tree t
= TYPE_FIELDS (type
);
1627 for (; t
; t
= TREE_CHAIN (t
))
1628 if (TREE_CODE (t
) == FIELD_DECL
)
1634 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1635 by modifying the last node in chain 1 to point to chain 2.
1636 This is the Lisp primitive `nconc'. */
1639 chainon (tree op1
, tree op2
)
1648 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1650 TREE_CHAIN (t1
) = op2
;
1652 #ifdef ENABLE_TREE_CHECKING
1655 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1656 gcc_assert (t2
!= t1
);
1663 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1666 tree_last (tree chain
)
1670 while ((next
= TREE_CHAIN (chain
)))
1675 /* Reverse the order of elements in the chain T,
1676 and return the new head of the chain (old last element). */
1681 tree prev
= 0, decl
, next
;
1682 for (decl
= t
; decl
; decl
= next
)
1684 next
= TREE_CHAIN (decl
);
1685 TREE_CHAIN (decl
) = prev
;
1691 /* Return a newly created TREE_LIST node whose
1692 purpose and value fields are PARM and VALUE. */
1695 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1697 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1698 TREE_PURPOSE (t
) = parm
;
1699 TREE_VALUE (t
) = value
;
1703 /* Return a newly created TREE_LIST node whose
1704 purpose and value fields are PURPOSE and VALUE
1705 and whose TREE_CHAIN is CHAIN. */
1708 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1712 node
= ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1714 memset (node
, 0, sizeof (struct tree_common
));
1716 #ifdef GATHER_STATISTICS
1717 tree_node_counts
[(int) x_kind
]++;
1718 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1721 TREE_SET_CODE (node
, TREE_LIST
);
1722 TREE_CHAIN (node
) = chain
;
1723 TREE_PURPOSE (node
) = purpose
;
1724 TREE_VALUE (node
) = value
;
1729 /* Return the size nominally occupied by an object of type TYPE
1730 when it resides in memory. The value is measured in units of bytes,
1731 and its data type is that normally used for type sizes
1732 (which is the first type created by make_signed_type or
1733 make_unsigned_type). */
1736 size_in_bytes (tree type
)
1740 if (type
== error_mark_node
)
1741 return integer_zero_node
;
1743 type
= TYPE_MAIN_VARIANT (type
);
1744 t
= TYPE_SIZE_UNIT (type
);
1748 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1749 return size_zero_node
;
1752 if (TREE_CODE (t
) == INTEGER_CST
)
1753 t
= force_fit_type (t
, 0, false, false);
1758 /* Return the size of TYPE (in bytes) as a wide integer
1759 or return -1 if the size can vary or is larger than an integer. */
1762 int_size_in_bytes (tree type
)
1766 if (type
== error_mark_node
)
1769 type
= TYPE_MAIN_VARIANT (type
);
1770 t
= TYPE_SIZE_UNIT (type
);
1772 || TREE_CODE (t
) != INTEGER_CST
1773 || TREE_INT_CST_HIGH (t
) != 0
1774 /* If the result would appear negative, it's too big to represent. */
1775 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1778 return TREE_INT_CST_LOW (t
);
1781 /* Return the maximum size of TYPE (in bytes) as a wide integer
1782 or return -1 if the size can vary or is larger than an integer. */
1785 max_int_size_in_bytes (tree type
)
1787 HOST_WIDE_INT size
= -1;
1790 /* If this is an array type, check for a possible MAX_SIZE attached. */
1792 if (TREE_CODE (type
) == ARRAY_TYPE
)
1794 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
1796 if (size_tree
&& host_integerp (size_tree
, 1))
1797 size
= tree_low_cst (size_tree
, 1);
1800 /* If we still haven't been able to get a size, see if the language
1801 can compute a maximum size. */
1805 size_tree
= lang_hooks
.types
.max_size (type
);
1807 if (size_tree
&& host_integerp (size_tree
, 1))
1808 size
= tree_low_cst (size_tree
, 1);
1814 /* Return the bit position of FIELD, in bits from the start of the record.
1815 This is a tree of type bitsizetype. */
1818 bit_position (tree field
)
1820 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1821 DECL_FIELD_BIT_OFFSET (field
));
1824 /* Likewise, but return as an integer. It must be representable in
1825 that way (since it could be a signed value, we don't have the
1826 option of returning -1 like int_size_in_byte can. */
1829 int_bit_position (tree field
)
1831 return tree_low_cst (bit_position (field
), 0);
1834 /* Return the byte position of FIELD, in bytes from the start of the record.
1835 This is a tree of type sizetype. */
1838 byte_position (tree field
)
1840 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1841 DECL_FIELD_BIT_OFFSET (field
));
1844 /* Likewise, but return as an integer. It must be representable in
1845 that way (since it could be a signed value, we don't have the
1846 option of returning -1 like int_size_in_byte can. */
1849 int_byte_position (tree field
)
1851 return tree_low_cst (byte_position (field
), 0);
1854 /* Return the strictest alignment, in bits, that T is known to have. */
1859 unsigned int align0
, align1
;
1861 switch (TREE_CODE (t
))
1863 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1864 /* If we have conversions, we know that the alignment of the
1865 object must meet each of the alignments of the types. */
1866 align0
= expr_align (TREE_OPERAND (t
, 0));
1867 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1868 return MAX (align0
, align1
);
1870 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1871 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1872 case CLEANUP_POINT_EXPR
:
1873 /* These don't change the alignment of an object. */
1874 return expr_align (TREE_OPERAND (t
, 0));
1877 /* The best we can do is say that the alignment is the least aligned
1879 align0
= expr_align (TREE_OPERAND (t
, 1));
1880 align1
= expr_align (TREE_OPERAND (t
, 2));
1881 return MIN (align0
, align1
);
1883 case LABEL_DECL
: case CONST_DECL
:
1884 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1885 if (DECL_ALIGN (t
) != 0)
1886 return DECL_ALIGN (t
);
1890 return FUNCTION_BOUNDARY
;
1896 /* Otherwise take the alignment from that of the type. */
1897 return TYPE_ALIGN (TREE_TYPE (t
));
1900 /* Return, as a tree node, the number of elements for TYPE (which is an
1901 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1904 array_type_nelts (tree type
)
1906 tree index_type
, min
, max
;
1908 /* If they did it with unspecified bounds, then we should have already
1909 given an error about it before we got here. */
1910 if (! TYPE_DOMAIN (type
))
1911 return error_mark_node
;
1913 index_type
= TYPE_DOMAIN (type
);
1914 min
= TYPE_MIN_VALUE (index_type
);
1915 max
= TYPE_MAX_VALUE (index_type
);
1917 return (integer_zerop (min
)
1919 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
1922 /* If arg is static -- a reference to an object in static storage -- then
1923 return the object. This is not the same as the C meaning of `static'.
1924 If arg isn't static, return NULL. */
1929 switch (TREE_CODE (arg
))
1932 /* Nested functions are static, even though taking their address will
1933 involve a trampoline as we unnest the nested function and create
1934 the trampoline on the tree level. */
1938 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1939 && ! DECL_THREAD_LOCAL_P (arg
)
1940 && ! DECL_DLLIMPORT_P (arg
)
1944 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1948 return TREE_STATIC (arg
) ? arg
: NULL
;
1955 /* If the thing being referenced is not a field, then it is
1956 something language specific. */
1957 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1958 return (*lang_hooks
.staticp
) (arg
);
1960 /* If we are referencing a bitfield, we can't evaluate an
1961 ADDR_EXPR at compile time and so it isn't a constant. */
1962 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1965 return staticp (TREE_OPERAND (arg
, 0));
1970 case MISALIGNED_INDIRECT_REF
:
1971 case ALIGN_INDIRECT_REF
:
1973 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
1976 case ARRAY_RANGE_REF
:
1977 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1978 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1979 return staticp (TREE_OPERAND (arg
, 0));
1984 if ((unsigned int) TREE_CODE (arg
)
1985 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1986 return lang_hooks
.staticp (arg
);
1992 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1993 Do this to any expression which may be used in more than one place,
1994 but must be evaluated only once.
1996 Normally, expand_expr would reevaluate the expression each time.
1997 Calling save_expr produces something that is evaluated and recorded
1998 the first time expand_expr is called on it. Subsequent calls to
1999 expand_expr just reuse the recorded value.
2001 The call to expand_expr that generates code that actually computes
2002 the value is the first call *at compile time*. Subsequent calls
2003 *at compile time* generate code to use the saved value.
2004 This produces correct result provided that *at run time* control
2005 always flows through the insns made by the first expand_expr
2006 before reaching the other places where the save_expr was evaluated.
2007 You, the caller of save_expr, must make sure this is so.
2009 Constants, and certain read-only nodes, are returned with no
2010 SAVE_EXPR because that is safe. Expressions containing placeholders
2011 are not touched; see tree.def for an explanation of what these
2015 save_expr (tree expr
)
2017 tree t
= fold (expr
);
2020 /* If the tree evaluates to a constant, then we don't want to hide that
2021 fact (i.e. this allows further folding, and direct checks for constants).
2022 However, a read-only object that has side effects cannot be bypassed.
2023 Since it is no problem to reevaluate literals, we just return the
2025 inner
= skip_simple_arithmetic (t
);
2027 if (TREE_INVARIANT (inner
)
2028 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
2029 || TREE_CODE (inner
) == SAVE_EXPR
2030 || TREE_CODE (inner
) == ERROR_MARK
)
2033 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2034 it means that the size or offset of some field of an object depends on
2035 the value within another field.
2037 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2038 and some variable since it would then need to be both evaluated once and
2039 evaluated more than once. Front-ends must assure this case cannot
2040 happen by surrounding any such subexpressions in their own SAVE_EXPR
2041 and forcing evaluation at the proper time. */
2042 if (contains_placeholder_p (inner
))
2045 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2047 /* This expression might be placed ahead of a jump to ensure that the
2048 value was computed on both sides of the jump. So make sure it isn't
2049 eliminated as dead. */
2050 TREE_SIDE_EFFECTS (t
) = 1;
2051 TREE_INVARIANT (t
) = 1;
2055 /* Look inside EXPR and into any simple arithmetic operations. Return
2056 the innermost non-arithmetic node. */
2059 skip_simple_arithmetic (tree expr
)
2063 /* We don't care about whether this can be used as an lvalue in this
2065 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2066 expr
= TREE_OPERAND (expr
, 0);
2068 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2069 a constant, it will be more efficient to not make another SAVE_EXPR since
2070 it will allow better simplification and GCSE will be able to merge the
2071 computations if they actually occur. */
2075 if (UNARY_CLASS_P (inner
))
2076 inner
= TREE_OPERAND (inner
, 0);
2077 else if (BINARY_CLASS_P (inner
))
2079 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
2080 inner
= TREE_OPERAND (inner
, 0);
2081 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
2082 inner
= TREE_OPERAND (inner
, 1);
2093 /* Return which tree structure is used by T. */
2095 enum tree_node_structure_enum
2096 tree_node_structure (tree t
)
2098 enum tree_code code
= TREE_CODE (t
);
2100 switch (TREE_CODE_CLASS (code
))
2102 case tcc_declaration
:
2107 return TS_FIELD_DECL
;
2109 return TS_PARM_DECL
;
2113 return TS_LABEL_DECL
;
2115 return TS_RESULT_DECL
;
2117 return TS_CONST_DECL
;
2119 return TS_TYPE_DECL
;
2121 return TS_FUNCTION_DECL
;
2122 case SYMBOL_MEMORY_TAG
:
2123 case NAME_MEMORY_TAG
:
2124 case STRUCT_FIELD_TAG
:
2125 return TS_MEMORY_TAG
;
2127 return TS_DECL_NON_COMMON
;
2133 case tcc_comparison
:
2136 case tcc_expression
:
2139 default: /* tcc_constant and tcc_exceptional */
2144 /* tcc_constant cases. */
2145 case INTEGER_CST
: return TS_INT_CST
;
2146 case REAL_CST
: return TS_REAL_CST
;
2147 case COMPLEX_CST
: return TS_COMPLEX
;
2148 case VECTOR_CST
: return TS_VECTOR
;
2149 case STRING_CST
: return TS_STRING
;
2150 /* tcc_exceptional cases. */
2151 case ERROR_MARK
: return TS_COMMON
;
2152 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
2153 case TREE_LIST
: return TS_LIST
;
2154 case TREE_VEC
: return TS_VEC
;
2155 case PHI_NODE
: return TS_PHI_NODE
;
2156 case SSA_NAME
: return TS_SSA_NAME
;
2157 case PLACEHOLDER_EXPR
: return TS_COMMON
;
2158 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
2159 case BLOCK
: return TS_BLOCK
;
2160 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
2161 case TREE_BINFO
: return TS_BINFO
;
2162 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
2163 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
2170 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2171 or offset that depends on a field within a record. */
2174 contains_placeholder_p (tree exp
)
2176 enum tree_code code
;
2181 code
= TREE_CODE (exp
);
2182 if (code
== PLACEHOLDER_EXPR
)
2185 switch (TREE_CODE_CLASS (code
))
2188 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2189 position computations since they will be converted into a
2190 WITH_RECORD_EXPR involving the reference, which will assume
2191 here will be valid. */
2192 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2194 case tcc_exceptional
:
2195 if (code
== TREE_LIST
)
2196 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2197 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2202 case tcc_comparison
:
2203 case tcc_expression
:
2207 /* Ignoring the first operand isn't quite right, but works best. */
2208 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2211 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2212 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2213 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2216 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2222 switch (TREE_CODE_LENGTH (code
))
2225 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2227 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2228 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2239 /* Return true if any part of the computation of TYPE involves a
2240 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2241 (for QUAL_UNION_TYPE) and field positions. */
2244 type_contains_placeholder_1 (tree type
)
2246 /* If the size contains a placeholder or the parent type (component type in
2247 the case of arrays) type involves a placeholder, this type does. */
2248 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2249 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2250 || (TREE_TYPE (type
) != 0
2251 && type_contains_placeholder_p (TREE_TYPE (type
))))
2254 /* Now do type-specific checks. Note that the last part of the check above
2255 greatly limits what we have to do below. */
2256 switch (TREE_CODE (type
))
2264 case REFERENCE_TYPE
:
2272 /* Here we just check the bounds. */
2273 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2274 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2277 /* We're already checked the component type (TREE_TYPE), so just check
2279 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2283 case QUAL_UNION_TYPE
:
2287 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2288 if (TREE_CODE (field
) == FIELD_DECL
2289 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2290 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2291 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2292 || type_contains_placeholder_p (TREE_TYPE (field
))))
2304 type_contains_placeholder_p (tree type
)
2308 /* If the contains_placeholder_bits field has been initialized,
2309 then we know the answer. */
2310 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2311 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2313 /* Indicate that we've seen this type node, and the answer is false.
2314 This is what we want to return if we run into recursion via fields. */
2315 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2317 /* Compute the real value. */
2318 result
= type_contains_placeholder_1 (type
);
2320 /* Store the real value. */
2321 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2326 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2327 return a tree with all occurrences of references to F in a
2328 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2329 contains only arithmetic expressions or a CALL_EXPR with a
2330 PLACEHOLDER_EXPR occurring only in its arglist. */
2333 substitute_in_expr (tree exp
, tree f
, tree r
)
2335 enum tree_code code
= TREE_CODE (exp
);
2336 tree op0
, op1
, op2
, op3
;
2340 /* We handle TREE_LIST and COMPONENT_REF separately. */
2341 if (code
== TREE_LIST
)
2343 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2344 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2345 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2348 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2350 else if (code
== COMPONENT_REF
)
2352 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2353 and it is the right field, replace it with R. */
2354 for (inner
= TREE_OPERAND (exp
, 0);
2355 REFERENCE_CLASS_P (inner
);
2356 inner
= TREE_OPERAND (inner
, 0))
2358 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2359 && TREE_OPERAND (exp
, 1) == f
)
2362 /* If this expression hasn't been completed let, leave it alone. */
2363 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2366 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2367 if (op0
== TREE_OPERAND (exp
, 0))
2370 new = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2371 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
);
2374 switch (TREE_CODE_CLASS (code
))
2377 case tcc_declaration
:
2380 case tcc_exceptional
:
2383 case tcc_comparison
:
2384 case tcc_expression
:
2386 switch (TREE_CODE_LENGTH (code
))
2392 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2393 if (op0
== TREE_OPERAND (exp
, 0))
2396 new = fold_build1 (code
, TREE_TYPE (exp
), op0
);
2400 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2401 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2403 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2406 new = fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2410 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2411 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2412 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2414 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2415 && op2
== TREE_OPERAND (exp
, 2))
2418 new = fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2422 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2423 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2424 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2425 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
2427 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2428 && op2
== TREE_OPERAND (exp
, 2)
2429 && op3
== TREE_OPERAND (exp
, 3))
2432 new = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2444 TREE_READONLY (new) = TREE_READONLY (exp
);
2448 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2449 for it within OBJ, a tree that is an object or a chain of references. */
2452 substitute_placeholder_in_expr (tree exp
, tree obj
)
2454 enum tree_code code
= TREE_CODE (exp
);
2455 tree op0
, op1
, op2
, op3
;
2457 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2458 in the chain of OBJ. */
2459 if (code
== PLACEHOLDER_EXPR
)
2461 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2464 for (elt
= obj
; elt
!= 0;
2465 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2466 || TREE_CODE (elt
) == COND_EXPR
)
2467 ? TREE_OPERAND (elt
, 1)
2468 : (REFERENCE_CLASS_P (elt
)
2469 || UNARY_CLASS_P (elt
)
2470 || BINARY_CLASS_P (elt
)
2471 || EXPRESSION_CLASS_P (elt
))
2472 ? TREE_OPERAND (elt
, 0) : 0))
2473 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2476 for (elt
= obj
; elt
!= 0;
2477 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2478 || TREE_CODE (elt
) == COND_EXPR
)
2479 ? TREE_OPERAND (elt
, 1)
2480 : (REFERENCE_CLASS_P (elt
)
2481 || UNARY_CLASS_P (elt
)
2482 || BINARY_CLASS_P (elt
)
2483 || EXPRESSION_CLASS_P (elt
))
2484 ? TREE_OPERAND (elt
, 0) : 0))
2485 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2486 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2488 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
2490 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2491 survives until RTL generation, there will be an error. */
2495 /* TREE_LIST is special because we need to look at TREE_VALUE
2496 and TREE_CHAIN, not TREE_OPERANDS. */
2497 else if (code
== TREE_LIST
)
2499 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2500 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2501 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2504 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2507 switch (TREE_CODE_CLASS (code
))
2510 case tcc_declaration
:
2513 case tcc_exceptional
:
2516 case tcc_comparison
:
2517 case tcc_expression
:
2520 switch (TREE_CODE_LENGTH (code
))
2526 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2527 if (op0
== TREE_OPERAND (exp
, 0))
2530 return fold_build1 (code
, TREE_TYPE (exp
), op0
);
2533 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2534 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2536 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2539 return fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2542 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2543 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2544 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2546 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2547 && op2
== TREE_OPERAND (exp
, 2))
2550 return fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2553 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2554 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2555 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2556 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2558 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2559 && op2
== TREE_OPERAND (exp
, 2)
2560 && op3
== TREE_OPERAND (exp
, 3))
2563 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2575 /* Stabilize a reference so that we can use it any number of times
2576 without causing its operands to be evaluated more than once.
2577 Returns the stabilized reference. This works by means of save_expr,
2578 so see the caveats in the comments about save_expr.
2580 Also allows conversion expressions whose operands are references.
2581 Any other kind of expression is returned unchanged. */
2584 stabilize_reference (tree ref
)
2587 enum tree_code code
= TREE_CODE (ref
);
2594 /* No action is needed in this case. */
2600 case FIX_TRUNC_EXPR
:
2601 case FIX_FLOOR_EXPR
:
2602 case FIX_ROUND_EXPR
:
2604 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2608 result
= build_nt (INDIRECT_REF
,
2609 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2613 result
= build_nt (COMPONENT_REF
,
2614 stabilize_reference (TREE_OPERAND (ref
, 0)),
2615 TREE_OPERAND (ref
, 1), NULL_TREE
);
2619 result
= build_nt (BIT_FIELD_REF
,
2620 stabilize_reference (TREE_OPERAND (ref
, 0)),
2621 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2622 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2626 result
= build_nt (ARRAY_REF
,
2627 stabilize_reference (TREE_OPERAND (ref
, 0)),
2628 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2629 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2632 case ARRAY_RANGE_REF
:
2633 result
= build_nt (ARRAY_RANGE_REF
,
2634 stabilize_reference (TREE_OPERAND (ref
, 0)),
2635 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2636 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2640 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2641 it wouldn't be ignored. This matters when dealing with
2643 return stabilize_reference_1 (ref
);
2645 /* If arg isn't a kind of lvalue we recognize, make no change.
2646 Caller should recognize the error for an invalid lvalue. */
2651 return error_mark_node
;
2654 TREE_TYPE (result
) = TREE_TYPE (ref
);
2655 TREE_READONLY (result
) = TREE_READONLY (ref
);
2656 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2657 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2662 /* Subroutine of stabilize_reference; this is called for subtrees of
2663 references. Any expression with side-effects must be put in a SAVE_EXPR
2664 to ensure that it is only evaluated once.
2666 We don't put SAVE_EXPR nodes around everything, because assigning very
2667 simple expressions to temporaries causes us to miss good opportunities
2668 for optimizations. Among other things, the opportunity to fold in the
2669 addition of a constant into an addressing mode often gets lost, e.g.
2670 "y[i+1] += x;". In general, we take the approach that we should not make
2671 an assignment unless we are forced into it - i.e., that any non-side effect
2672 operator should be allowed, and that cse should take care of coalescing
2673 multiple utterances of the same expression should that prove fruitful. */
2676 stabilize_reference_1 (tree e
)
2679 enum tree_code code
= TREE_CODE (e
);
2681 /* We cannot ignore const expressions because it might be a reference
2682 to a const array but whose index contains side-effects. But we can
2683 ignore things that are actual constant or that already have been
2684 handled by this function. */
2686 if (TREE_INVARIANT (e
))
2689 switch (TREE_CODE_CLASS (code
))
2691 case tcc_exceptional
:
2693 case tcc_declaration
:
2694 case tcc_comparison
:
2696 case tcc_expression
:
2698 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2699 so that it will only be evaluated once. */
2700 /* The reference (r) and comparison (<) classes could be handled as
2701 below, but it is generally faster to only evaluate them once. */
2702 if (TREE_SIDE_EFFECTS (e
))
2703 return save_expr (e
);
2707 /* Constants need no processing. In fact, we should never reach
2712 /* Division is slow and tends to be compiled with jumps,
2713 especially the division by powers of 2 that is often
2714 found inside of an array reference. So do it just once. */
2715 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2716 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2717 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2718 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2719 return save_expr (e
);
2720 /* Recursively stabilize each operand. */
2721 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2722 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2726 /* Recursively stabilize each operand. */
2727 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2734 TREE_TYPE (result
) = TREE_TYPE (e
);
2735 TREE_READONLY (result
) = TREE_READONLY (e
);
2736 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2737 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2738 TREE_INVARIANT (result
) = 1;
2743 /* Low-level constructors for expressions. */
2745 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2746 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2749 recompute_tree_invariant_for_addr_expr (tree t
)
2752 bool tc
= true, ti
= true, se
= false;
2754 /* We started out assuming this address is both invariant and constant, but
2755 does not have side effects. Now go down any handled components and see if
2756 any of them involve offsets that are either non-constant or non-invariant.
2757 Also check for side-effects.
2759 ??? Note that this code makes no attempt to deal with the case where
2760 taking the address of something causes a copy due to misalignment. */
2762 #define UPDATE_TITCSE(NODE) \
2763 do { tree _node = (NODE); \
2764 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2765 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2766 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2768 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2769 node
= TREE_OPERAND (node
, 0))
2771 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2772 array reference (probably made temporarily by the G++ front end),
2773 so ignore all the operands. */
2774 if ((TREE_CODE (node
) == ARRAY_REF
2775 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2776 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2778 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2779 if (TREE_OPERAND (node
, 2))
2780 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2781 if (TREE_OPERAND (node
, 3))
2782 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2784 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2785 FIELD_DECL, apparently. The G++ front end can put something else
2786 there, at least temporarily. */
2787 else if (TREE_CODE (node
) == COMPONENT_REF
2788 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2790 if (TREE_OPERAND (node
, 2))
2791 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2793 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2794 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2797 node
= lang_hooks
.expr_to_decl (node
, &tc
, &ti
, &se
);
2799 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2800 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2801 invariant and constant if the decl is static. It's also invariant if it's
2802 a decl in the current function. Taking the address of a volatile variable
2803 is not volatile. If it's a constant, the address is both invariant and
2804 constant. Otherwise it's neither. */
2805 if (TREE_CODE (node
) == INDIRECT_REF
)
2806 UPDATE_TITCSE (TREE_OPERAND (node
, 0));
2807 else if (DECL_P (node
))
2811 else if (decl_function_context (node
) == current_function_decl
2812 /* Addresses of thread-local variables are invariant. */
2813 || (TREE_CODE (node
) == VAR_DECL
2814 && DECL_THREAD_LOCAL_P (node
)))
2819 else if (CONSTANT_CLASS_P (node
))
2824 se
|= TREE_SIDE_EFFECTS (node
);
2827 TREE_CONSTANT (t
) = tc
;
2828 TREE_INVARIANT (t
) = ti
;
2829 TREE_SIDE_EFFECTS (t
) = se
;
2830 #undef UPDATE_TITCSE
2833 /* Build an expression of code CODE, data type TYPE, and operands as
2834 specified. Expressions and reference nodes can be created this way.
2835 Constants, decls, types and misc nodes cannot be.
2837 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2838 enough for all extant tree codes. */
2841 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2845 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2847 t
= make_node_stat (code PASS_MEM_STAT
);
2854 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2856 int length
= sizeof (struct tree_exp
);
2857 #ifdef GATHER_STATISTICS
2858 tree_node_kind kind
;
2862 #ifdef GATHER_STATISTICS
2863 switch (TREE_CODE_CLASS (code
))
2865 case tcc_statement
: /* an expression with side effects */
2868 case tcc_reference
: /* a reference */
2876 tree_node_counts
[(int) kind
]++;
2877 tree_node_sizes
[(int) kind
] += length
;
2880 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2882 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
2884 memset (t
, 0, sizeof (struct tree_common
));
2886 TREE_SET_CODE (t
, code
);
2888 TREE_TYPE (t
) = type
;
2889 #ifdef USE_MAPPED_LOCATION
2890 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2892 SET_EXPR_LOCUS (t
, NULL
);
2894 TREE_COMPLEXITY (t
) = 0;
2895 TREE_OPERAND (t
, 0) = node
;
2896 TREE_BLOCK (t
) = NULL_TREE
;
2897 if (node
&& !TYPE_P (node
))
2899 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2900 TREE_READONLY (t
) = TREE_READONLY (node
);
2903 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2904 TREE_SIDE_EFFECTS (t
) = 1;
2908 /* All of these have side-effects, no matter what their
2910 TREE_SIDE_EFFECTS (t
) = 1;
2911 TREE_READONLY (t
) = 0;
2914 case MISALIGNED_INDIRECT_REF
:
2915 case ALIGN_INDIRECT_REF
:
2917 /* Whether a dereference is readonly has nothing to do with whether
2918 its operand is readonly. */
2919 TREE_READONLY (t
) = 0;
2924 recompute_tree_invariant_for_addr_expr (t
);
2928 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
2929 && node
&& !TYPE_P (node
)
2930 && TREE_CONSTANT (node
))
2931 TREE_CONSTANT (t
) = 1;
2932 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
2933 && node
&& TREE_INVARIANT (node
))
2934 TREE_INVARIANT (t
) = 1;
2935 if (TREE_CODE_CLASS (code
) == tcc_reference
2936 && node
&& TREE_THIS_VOLATILE (node
))
2937 TREE_THIS_VOLATILE (t
) = 1;
2944 #define PROCESS_ARG(N) \
2946 TREE_OPERAND (t, N) = arg##N; \
2947 if (arg##N &&!TYPE_P (arg##N)) \
2949 if (TREE_SIDE_EFFECTS (arg##N)) \
2951 if (!TREE_READONLY (arg##N)) \
2953 if (!TREE_CONSTANT (arg##N)) \
2955 if (!TREE_INVARIANT (arg##N)) \
2961 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2963 bool constant
, read_only
, side_effects
, invariant
;
2966 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
2968 t
= make_node_stat (code PASS_MEM_STAT
);
2971 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2972 result based on those same flags for the arguments. But if the
2973 arguments aren't really even `tree' expressions, we shouldn't be trying
2976 /* Expressions without side effects may be constant if their
2977 arguments are as well. */
2978 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
2979 || TREE_CODE_CLASS (code
) == tcc_binary
);
2981 side_effects
= TREE_SIDE_EFFECTS (t
);
2982 invariant
= constant
;
2987 TREE_READONLY (t
) = read_only
;
2988 TREE_CONSTANT (t
) = constant
;
2989 TREE_INVARIANT (t
) = invariant
;
2990 TREE_SIDE_EFFECTS (t
) = side_effects
;
2991 TREE_THIS_VOLATILE (t
)
2992 = (TREE_CODE_CLASS (code
) == tcc_reference
2993 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2999 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3000 tree arg2 MEM_STAT_DECL
)
3002 bool constant
, read_only
, side_effects
, invariant
;
3005 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3007 t
= make_node_stat (code PASS_MEM_STAT
);
3010 side_effects
= TREE_SIDE_EFFECTS (t
);
3016 if (code
== CALL_EXPR
&& !side_effects
)
3021 /* Calls have side-effects, except those to const or
3023 i
= call_expr_flags (t
);
3024 if (!(i
& (ECF_CONST
| ECF_PURE
)))
3027 /* And even those have side-effects if their arguments do. */
3028 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
3029 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
3036 TREE_SIDE_EFFECTS (t
) = side_effects
;
3037 TREE_THIS_VOLATILE (t
)
3038 = (TREE_CODE_CLASS (code
) == tcc_reference
3039 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3045 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3046 tree arg2
, tree arg3 MEM_STAT_DECL
)
3048 bool constant
, read_only
, side_effects
, invariant
;
3051 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3053 t
= make_node_stat (code PASS_MEM_STAT
);
3056 side_effects
= TREE_SIDE_EFFECTS (t
);
3063 TREE_SIDE_EFFECTS (t
) = side_effects
;
3064 TREE_THIS_VOLATILE (t
)
3065 = (TREE_CODE_CLASS (code
) == tcc_reference
3066 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3072 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3073 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3075 bool constant
, read_only
, side_effects
, invariant
;
3078 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3080 t
= make_node_stat (code PASS_MEM_STAT
);
3083 side_effects
= TREE_SIDE_EFFECTS (t
);
3091 TREE_SIDE_EFFECTS (t
) = side_effects
;
3092 TREE_THIS_VOLATILE (t
)
3093 = (TREE_CODE_CLASS (code
) == tcc_reference
3094 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3100 build7_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3101 tree arg2
, tree arg3
, tree arg4
, tree arg5
,
3102 tree arg6 MEM_STAT_DECL
)
3104 bool constant
, read_only
, side_effects
, invariant
;
3107 gcc_assert (code
== TARGET_MEM_REF
);
3109 t
= make_node_stat (code PASS_MEM_STAT
);
3112 side_effects
= TREE_SIDE_EFFECTS (t
);
3122 TREE_SIDE_EFFECTS (t
) = side_effects
;
3123 TREE_THIS_VOLATILE (t
) = 0;
3128 /* Similar except don't specify the TREE_TYPE
3129 and leave the TREE_SIDE_EFFECTS as 0.
3130 It is permissible for arguments to be null,
3131 or even garbage if their values do not matter. */
3134 build_nt (enum tree_code code
, ...)
3143 t
= make_node (code
);
3144 length
= TREE_CODE_LENGTH (code
);
3146 for (i
= 0; i
< length
; i
++)
3147 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3153 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3154 We do NOT enter this node in any sort of symbol table.
3156 layout_decl is used to set up the decl's storage layout.
3157 Other slots are initialized to 0 or null pointers. */
3160 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
3164 t
= make_node_stat (code PASS_MEM_STAT
);
3166 /* if (type == error_mark_node)
3167 type = integer_type_node; */
3168 /* That is not done, deliberately, so that having error_mark_node
3169 as the type can suppress useless errors in the use of this variable. */
3171 DECL_NAME (t
) = name
;
3172 TREE_TYPE (t
) = type
;
3174 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3176 else if (code
== FUNCTION_DECL
)
3177 DECL_MODE (t
) = FUNCTION_MODE
;
3182 /* Builds and returns function declaration with NAME and TYPE. */
3185 build_fn_decl (const char *name
, tree type
)
3187 tree id
= get_identifier (name
);
3188 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
3190 DECL_EXTERNAL (decl
) = 1;
3191 TREE_PUBLIC (decl
) = 1;
3192 DECL_ARTIFICIAL (decl
) = 1;
3193 TREE_NOTHROW (decl
) = 1;
3199 /* BLOCK nodes are used to represent the structure of binding contours
3200 and declarations, once those contours have been exited and their contents
3201 compiled. This information is used for outputting debugging info. */
3204 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3206 tree block
= make_node (BLOCK
);
3208 BLOCK_VARS (block
) = vars
;
3209 BLOCK_SUBBLOCKS (block
) = subblocks
;
3210 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3211 BLOCK_CHAIN (block
) = chain
;
3215 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3216 /* ??? gengtype doesn't handle conditionals */
3217 static GTY(()) source_locus last_annotated_node
;
3220 #ifdef USE_MAPPED_LOCATION
3223 expand_location (source_location loc
)
3225 expanded_location xloc
;
3226 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
3229 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
3230 xloc
.file
= map
->to_file
;
3231 xloc
.line
= SOURCE_LINE (map
, loc
);
3232 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3239 /* Record the exact location where an expression or an identifier were
3243 annotate_with_file_line (tree node
, const char *file
, int line
)
3245 /* Roughly one percent of the calls to this function are to annotate
3246 a node with the same information already attached to that node!
3247 Just return instead of wasting memory. */
3248 if (EXPR_LOCUS (node
)
3249 && EXPR_LINENO (node
) == line
3250 && (EXPR_FILENAME (node
) == file
3251 || !strcmp (EXPR_FILENAME (node
), file
)))
3253 last_annotated_node
= EXPR_LOCUS (node
);
3257 /* In heavily macroized code (such as GCC itself) this single
3258 entry cache can reduce the number of allocations by more
3260 if (last_annotated_node
3261 && last_annotated_node
->line
== line
3262 && (last_annotated_node
->file
== file
3263 || !strcmp (last_annotated_node
->file
, file
)))
3265 SET_EXPR_LOCUS (node
, last_annotated_node
);
3269 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
3270 EXPR_LINENO (node
) = line
;
3271 EXPR_FILENAME (node
) = file
;
3272 last_annotated_node
= EXPR_LOCUS (node
);
3276 annotate_with_locus (tree node
, location_t locus
)
3278 annotate_with_file_line (node
, locus
.file
, locus
.line
);
3282 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3286 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3288 DECL_ATTRIBUTES (ddecl
) = attribute
;
3292 /* Borrowed from hashtab.c iterative_hash implementation. */
3293 #define mix(a,b,c) \
3295 a -= b; a -= c; a ^= (c>>13); \
3296 b -= c; b -= a; b ^= (a<< 8); \
3297 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3298 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3299 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3300 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3301 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3302 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3303 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3307 /* Produce good hash value combining VAL and VAL2. */
3308 static inline hashval_t
3309 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
3311 /* the golden ratio; an arbitrary value. */
3312 hashval_t a
= 0x9e3779b9;
3318 /* Produce good hash value combining PTR and VAL2. */
3319 static inline hashval_t
3320 iterative_hash_pointer (void *ptr
, hashval_t val2
)
3322 if (sizeof (ptr
) == sizeof (hashval_t
))
3323 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
3326 hashval_t a
= (hashval_t
) (size_t) ptr
;
3327 /* Avoid warnings about shifting of more than the width of the type on
3328 hosts that won't execute this path. */
3330 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
3336 /* Produce good hash value combining VAL and VAL2. */
3337 static inline hashval_t
3338 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
3340 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
3341 return iterative_hash_hashval_t (val
, val2
);
3344 hashval_t a
= (hashval_t
) val
;
3345 /* Avoid warnings about shifting of more than the width of the type on
3346 hosts that won't execute this path. */
3348 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
3350 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
3352 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
3353 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
3360 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3361 is ATTRIBUTE and its qualifiers are QUALS.
3363 Record such modified types already made so we don't make duplicates. */
3366 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
3368 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3370 hashval_t hashcode
= 0;
3372 enum tree_code code
= TREE_CODE (ttype
);
3374 ntype
= copy_node (ttype
);
3376 TYPE_POINTER_TO (ntype
) = 0;
3377 TYPE_REFERENCE_TO (ntype
) = 0;
3378 TYPE_ATTRIBUTES (ntype
) = attribute
;
3380 /* Create a new main variant of TYPE. */
3381 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3382 TYPE_NEXT_VARIANT (ntype
) = 0;
3383 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3385 hashcode
= iterative_hash_object (code
, hashcode
);
3386 if (TREE_TYPE (ntype
))
3387 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3389 hashcode
= attribute_hash_list (attribute
, hashcode
);
3391 switch (TREE_CODE (ntype
))
3394 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3397 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3401 hashcode
= iterative_hash_object
3402 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3403 hashcode
= iterative_hash_object
3404 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3408 unsigned int precision
= TYPE_PRECISION (ntype
);
3409 hashcode
= iterative_hash_object (precision
, hashcode
);
3416 ntype
= type_hash_canon (hashcode
, ntype
);
3417 ttype
= build_qualified_type (ntype
, quals
);
3424 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3427 Record such modified types already made so we don't make duplicates. */
3430 build_type_attribute_variant (tree ttype
, tree attribute
)
3432 return build_type_attribute_qual_variant (ttype
, attribute
,
3433 TYPE_QUALS (ttype
));
3436 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3439 We try both `text' and `__text__', ATTR may be either one. */
3440 /* ??? It might be a reasonable simplification to require ATTR to be only
3441 `text'. One might then also require attribute lists to be stored in
3442 their canonicalized form. */
3445 is_attribute_with_length_p (const char *attr
, int attr_len
, tree ident
)
3450 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3453 p
= IDENTIFIER_POINTER (ident
);
3454 ident_len
= IDENTIFIER_LENGTH (ident
);
3456 if (ident_len
== attr_len
3457 && strcmp (attr
, p
) == 0)
3460 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3463 gcc_assert (attr
[1] == '_');
3464 gcc_assert (attr
[attr_len
- 2] == '_');
3465 gcc_assert (attr
[attr_len
- 1] == '_');
3466 if (ident_len
== attr_len
- 4
3467 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3472 if (ident_len
== attr_len
+ 4
3473 && p
[0] == '_' && p
[1] == '_'
3474 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3475 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3482 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3485 We try both `text' and `__text__', ATTR may be either one. */
3488 is_attribute_p (const char *attr
, tree ident
)
3490 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3493 /* Given an attribute name and a list of attributes, return a pointer to the
3494 attribute's list element if the attribute is part of the list, or NULL_TREE
3495 if not found. If the attribute appears more than once, this only
3496 returns the first occurrence; the TREE_CHAIN of the return value should
3497 be passed back in if further occurrences are wanted. */
3500 lookup_attribute (const char *attr_name
, tree list
)
3503 size_t attr_len
= strlen (attr_name
);
3505 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3507 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3508 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3515 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3519 remove_attribute (const char *attr_name
, tree list
)
3522 size_t attr_len
= strlen (attr_name
);
3524 for (p
= &list
; *p
; )
3527 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3528 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3529 *p
= TREE_CHAIN (l
);
3531 p
= &TREE_CHAIN (l
);
3537 /* Return an attribute list that is the union of a1 and a2. */
3540 merge_attributes (tree a1
, tree a2
)
3544 /* Either one unset? Take the set one. */
3546 if ((attributes
= a1
) == 0)
3549 /* One that completely contains the other? Take it. */
3551 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3553 if (attribute_list_contained (a2
, a1
))
3557 /* Pick the longest list, and hang on the other list. */
3559 if (list_length (a1
) < list_length (a2
))
3560 attributes
= a2
, a2
= a1
;
3562 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3565 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3568 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3571 if (TREE_VALUE (a
) != NULL
3572 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
3573 && TREE_VALUE (a2
) != NULL
3574 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
3576 if (simple_cst_list_equal (TREE_VALUE (a
),
3577 TREE_VALUE (a2
)) == 1)
3580 else if (simple_cst_equal (TREE_VALUE (a
),
3581 TREE_VALUE (a2
)) == 1)
3586 a1
= copy_node (a2
);
3587 TREE_CHAIN (a1
) = attributes
;
3596 /* Given types T1 and T2, merge their attributes and return
3600 merge_type_attributes (tree t1
, tree t2
)
3602 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3603 TYPE_ATTRIBUTES (t2
));
3606 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3610 merge_decl_attributes (tree olddecl
, tree newdecl
)
3612 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3613 DECL_ATTRIBUTES (newdecl
));
3616 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3618 /* Specialization of merge_decl_attributes for various Windows targets.
3620 This handles the following situation:
3622 __declspec (dllimport) int foo;
3625 The second instance of `foo' nullifies the dllimport. */
3628 merge_dllimport_decl_attributes (tree old
, tree
new)
3631 int delete_dllimport_p
= 1;
3633 /* What we need to do here is remove from `old' dllimport if it doesn't
3634 appear in `new'. dllimport behaves like extern: if a declaration is
3635 marked dllimport and a definition appears later, then the object
3636 is not dllimport'd. We also remove a `new' dllimport if the old list
3637 contains dllexport: dllexport always overrides dllimport, regardless
3638 of the order of declaration. */
3639 if (!VAR_OR_FUNCTION_DECL_P (new))
3640 delete_dllimport_p
= 0;
3641 else if (DECL_DLLIMPORT_P (new)
3642 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
3644 DECL_DLLIMPORT_P (new) = 0;
3645 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
3646 "dllimport ignored", new);
3648 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new))
3650 /* Warn about overriding a symbol that has already been used. eg:
3651 extern int __attribute__ ((dllimport)) foo;
3652 int* bar () {return &foo;}
3655 if (TREE_USED (old
))
3657 warning (0, "%q+D redeclared without dllimport attribute "
3658 "after being referenced with dll linkage", new);
3659 /* If we have used a variable's address with dllimport linkage,
3660 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3661 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3663 We still remove the attribute so that assembler code refers
3664 to '&foo rather than '_imp__foo'. */
3665 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
3666 DECL_DLLIMPORT_P (new) = 1;
3669 /* Let an inline definition silently override the external reference,
3670 but otherwise warn about attribute inconsistency. */
3671 else if (TREE_CODE (new) == VAR_DECL
3672 || !DECL_DECLARED_INLINE_P (new))
3673 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
3674 "previous dllimport ignored", new);
3677 delete_dllimport_p
= 0;
3679 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new));
3681 if (delete_dllimport_p
)
3684 const size_t attr_len
= strlen ("dllimport");
3686 /* Scan the list for dllimport and delete it. */
3687 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3689 if (is_attribute_with_length_p ("dllimport", attr_len
,
3692 if (prev
== NULL_TREE
)
3695 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3704 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3705 struct attribute_spec.handler. */
3708 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3713 /* These attributes may apply to structure and union types being created,
3714 but otherwise should pass to the declaration involved. */
3717 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3718 | (int) ATTR_FLAG_ARRAY_NEXT
))
3720 *no_add_attrs
= true;
3721 return tree_cons (name
, args
, NULL_TREE
);
3723 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3725 warning (OPT_Wattributes
, "%qs attribute ignored",
3726 IDENTIFIER_POINTER (name
));
3727 *no_add_attrs
= true;
3733 if (TREE_CODE (node
) != FUNCTION_DECL
3734 && TREE_CODE (node
) != VAR_DECL
)
3736 *no_add_attrs
= true;
3737 warning (OPT_Wattributes
, "%qs attribute ignored",
3738 IDENTIFIER_POINTER (name
));
3742 /* Report error on dllimport ambiguities seen now before they cause
3744 else if (is_attribute_p ("dllimport", name
))
3746 /* Honor any target-specific overrides. */
3747 if (!targetm
.valid_dllimport_attribute_p (node
))
3748 *no_add_attrs
= true;
3750 else if (TREE_CODE (node
) == FUNCTION_DECL
3751 && DECL_DECLARED_INLINE_P (node
))
3753 warning (OPT_Wattributes
, "inline function %q+D declared as "
3754 " dllimport: attribute ignored", node
);
3755 *no_add_attrs
= true;
3757 /* Like MS, treat definition of dllimported variables and
3758 non-inlined functions on declaration as syntax errors. */
3759 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
3761 error ("function %q+D definition is marked dllimport", node
);
3762 *no_add_attrs
= true;
3765 else if (TREE_CODE (node
) == VAR_DECL
)
3767 if (DECL_INITIAL (node
))
3769 error ("variable %q+D definition is marked dllimport",
3771 *no_add_attrs
= true;
3774 /* `extern' needn't be specified with dllimport.
3775 Specify `extern' now and hope for the best. Sigh. */
3776 DECL_EXTERNAL (node
) = 1;
3777 /* Also, implicitly give dllimport'd variables declared within
3778 a function global scope, unless declared static. */
3779 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3780 TREE_PUBLIC (node
) = 1;
3783 if (*no_add_attrs
== false)
3784 DECL_DLLIMPORT_P (node
) = 1;
3787 /* Report error if symbol is not accessible at global scope. */
3788 if (!TREE_PUBLIC (node
)
3789 && (TREE_CODE (node
) == VAR_DECL
3790 || TREE_CODE (node
) == FUNCTION_DECL
))
3792 error ("external linkage required for symbol %q+D because of "
3793 "%qs attribute", node
, IDENTIFIER_POINTER (name
));
3794 *no_add_attrs
= true;
3800 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3802 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3803 of the various TYPE_QUAL values. */
3806 set_type_quals (tree type
, int type_quals
)
3808 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3809 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3810 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3813 /* Returns true iff cand is equivalent to base with type_quals. */
3816 check_qualified_type (tree cand
, tree base
, int type_quals
)
3818 return (TYPE_QUALS (cand
) == type_quals
3819 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3820 /* Apparently this is needed for Objective-C. */
3821 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3822 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3823 TYPE_ATTRIBUTES (base
)));
3826 /* Return a version of the TYPE, qualified as indicated by the
3827 TYPE_QUALS, if one exists. If no qualified version exists yet,
3828 return NULL_TREE. */
3831 get_qualified_type (tree type
, int type_quals
)
3835 if (TYPE_QUALS (type
) == type_quals
)
3838 /* Search the chain of variants to see if there is already one there just
3839 like the one we need to have. If so, use that existing one. We must
3840 preserve the TYPE_NAME, since there is code that depends on this. */
3841 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3842 if (check_qualified_type (t
, type
, type_quals
))
3848 /* Like get_qualified_type, but creates the type if it does not
3849 exist. This function never returns NULL_TREE. */
3852 build_qualified_type (tree type
, int type_quals
)
3856 /* See if we already have the appropriate qualified variant. */
3857 t
= get_qualified_type (type
, type_quals
);
3859 /* If not, build it. */
3862 t
= build_variant_type_copy (type
);
3863 set_type_quals (t
, type_quals
);
3869 /* Create a new distinct copy of TYPE. The new type is made its own
3873 build_distinct_type_copy (tree type
)
3875 tree t
= copy_node (type
);
3877 TYPE_POINTER_TO (t
) = 0;
3878 TYPE_REFERENCE_TO (t
) = 0;
3880 /* Make it its own variant. */
3881 TYPE_MAIN_VARIANT (t
) = t
;
3882 TYPE_NEXT_VARIANT (t
) = 0;
3884 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
3885 whose TREE_TYPE is not t. This can also happen in the Ada
3886 frontend when using subtypes. */
3891 /* Create a new variant of TYPE, equivalent but distinct.
3892 This is so the caller can modify it. */
3895 build_variant_type_copy (tree type
)
3897 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3899 t
= build_distinct_type_copy (type
);
3901 /* Add the new type to the chain of variants of TYPE. */
3902 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3903 TYPE_NEXT_VARIANT (m
) = t
;
3904 TYPE_MAIN_VARIANT (t
) = m
;
3909 /* Return true if the from tree in both tree maps are equal. */
3912 tree_map_eq (const void *va
, const void *vb
)
3914 const struct tree_map
*a
= va
, *b
= vb
;
3915 return (a
->from
== b
->from
);
3918 /* Hash a from tree in a tree_map. */
3921 tree_map_hash (const void *item
)
3923 return (((const struct tree_map
*) item
)->hash
);
3926 /* Return true if this tree map structure is marked for garbage collection
3927 purposes. We simply return true if the from tree is marked, so that this
3928 structure goes away when the from tree goes away. */
3931 tree_map_marked_p (const void *p
)
3933 tree from
= ((struct tree_map
*) p
)->from
;
3935 return ggc_marked_p (from
);
3938 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
3941 tree_int_map_eq (const void *va
, const void *vb
)
3943 const struct tree_int_map
*a
= va
, *b
= vb
;
3944 return (a
->from
== b
->from
);
3947 /* Hash a from tree in the tree_int_map * ITEM. */
3950 tree_int_map_hash (const void *item
)
3952 return htab_hash_pointer (((const struct tree_int_map
*)item
)->from
);
3955 /* Return true if this tree int map structure is marked for garbage collection
3956 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
3957 structure goes away when the from tree goes away. */
3960 tree_int_map_marked_p (const void *p
)
3962 tree from
= ((struct tree_int_map
*) p
)->from
;
3964 return ggc_marked_p (from
);
3966 /* Lookup an init priority for FROM, and return it if we find one. */
3969 decl_init_priority_lookup (tree from
)
3971 struct tree_int_map
*h
, in
;
3974 h
= htab_find_with_hash (init_priority_for_decl
,
3975 &in
, htab_hash_pointer (from
));
3981 /* Insert a mapping FROM->TO in the init priority hashtable. */
3984 decl_init_priority_insert (tree from
, unsigned short to
)
3986 struct tree_int_map
*h
;
3989 h
= ggc_alloc (sizeof (struct tree_int_map
));
3992 loc
= htab_find_slot_with_hash (init_priority_for_decl
, h
,
3993 htab_hash_pointer (from
), INSERT
);
3994 *(struct tree_int_map
**) loc
= h
;
3997 /* Look up a restrict qualified base decl for FROM. */
4000 decl_restrict_base_lookup (tree from
)
4006 h
= htab_find_with_hash (restrict_base_for_decl
, &in
,
4007 htab_hash_pointer (from
));
4008 return h
? h
->to
: NULL_TREE
;
4011 /* Record the restrict qualified base TO for FROM. */
4014 decl_restrict_base_insert (tree from
, tree to
)
4019 h
= ggc_alloc (sizeof (struct tree_map
));
4020 h
->hash
= htab_hash_pointer (from
);
4023 loc
= htab_find_slot_with_hash (restrict_base_for_decl
, h
, h
->hash
, INSERT
);
4024 *(struct tree_map
**) loc
= h
;
4027 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4030 print_debug_expr_statistics (void)
4032 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4033 (long) htab_size (debug_expr_for_decl
),
4034 (long) htab_elements (debug_expr_for_decl
),
4035 htab_collisions (debug_expr_for_decl
));
4038 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4041 print_value_expr_statistics (void)
4043 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4044 (long) htab_size (value_expr_for_decl
),
4045 (long) htab_elements (value_expr_for_decl
),
4046 htab_collisions (value_expr_for_decl
));
4049 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4050 don't print anything if the table is empty. */
4053 print_restrict_base_statistics (void)
4055 if (htab_elements (restrict_base_for_decl
) != 0)
4057 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4058 (long) htab_size (restrict_base_for_decl
),
4059 (long) htab_elements (restrict_base_for_decl
),
4060 htab_collisions (restrict_base_for_decl
));
4063 /* Lookup a debug expression for FROM, and return it if we find one. */
4066 decl_debug_expr_lookup (tree from
)
4068 struct tree_map
*h
, in
;
4071 h
= htab_find_with_hash (debug_expr_for_decl
, &in
, htab_hash_pointer (from
));
4077 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4080 decl_debug_expr_insert (tree from
, tree to
)
4085 h
= ggc_alloc (sizeof (struct tree_map
));
4086 h
->hash
= htab_hash_pointer (from
);
4089 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
4090 *(struct tree_map
**) loc
= h
;
4093 /* Lookup a value expression for FROM, and return it if we find one. */
4096 decl_value_expr_lookup (tree from
)
4098 struct tree_map
*h
, in
;
4101 h
= htab_find_with_hash (value_expr_for_decl
, &in
, htab_hash_pointer (from
));
4107 /* Insert a mapping FROM->TO in the value expression hashtable. */
4110 decl_value_expr_insert (tree from
, tree to
)
4115 h
= ggc_alloc (sizeof (struct tree_map
));
4116 h
->hash
= htab_hash_pointer (from
);
4119 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
4120 *(struct tree_map
**) loc
= h
;
4123 /* Hashing of types so that we don't make duplicates.
4124 The entry point is `type_hash_canon'. */
4126 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4127 with types in the TREE_VALUE slots), by adding the hash codes
4128 of the individual types. */
4131 type_hash_list (tree list
, hashval_t hashcode
)
4135 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4136 if (TREE_VALUE (tail
) != error_mark_node
)
4137 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
4143 /* These are the Hashtable callback functions. */
4145 /* Returns true iff the types are equivalent. */
4148 type_hash_eq (const void *va
, const void *vb
)
4150 const struct type_hash
*a
= va
, *b
= vb
;
4152 /* First test the things that are the same for all types. */
4153 if (a
->hash
!= b
->hash
4154 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
4155 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
4156 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
4157 TYPE_ATTRIBUTES (b
->type
))
4158 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
4159 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
4162 switch (TREE_CODE (a
->type
))
4167 case REFERENCE_TYPE
:
4171 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
4174 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
4175 && !(TYPE_VALUES (a
->type
)
4176 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
4177 && TYPE_VALUES (b
->type
)
4178 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
4179 && type_list_equal (TYPE_VALUES (a
->type
),
4180 TYPE_VALUES (b
->type
))))
4183 /* ... fall through ... */
4188 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
4189 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
4190 TYPE_MAX_VALUE (b
->type
)))
4191 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
4192 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
4193 TYPE_MIN_VALUE (b
->type
))));
4196 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
4199 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
4200 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4201 || (TYPE_ARG_TYPES (a
->type
)
4202 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4203 && TYPE_ARG_TYPES (b
->type
)
4204 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4205 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4206 TYPE_ARG_TYPES (b
->type
)))));
4209 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
4213 case QUAL_UNION_TYPE
:
4214 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
4215 || (TYPE_FIELDS (a
->type
)
4216 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
4217 && TYPE_FIELDS (b
->type
)
4218 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
4219 && type_list_equal (TYPE_FIELDS (a
->type
),
4220 TYPE_FIELDS (b
->type
))));
4223 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4224 || (TYPE_ARG_TYPES (a
->type
)
4225 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4226 && TYPE_ARG_TYPES (b
->type
)
4227 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4228 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4229 TYPE_ARG_TYPES (b
->type
))));
4236 /* Return the cached hash value. */
4239 type_hash_hash (const void *item
)
4241 return ((const struct type_hash
*) item
)->hash
;
4244 /* Look in the type hash table for a type isomorphic to TYPE.
4245 If one is found, return it. Otherwise return 0. */
4248 type_hash_lookup (hashval_t hashcode
, tree type
)
4250 struct type_hash
*h
, in
;
4252 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4253 must call that routine before comparing TYPE_ALIGNs. */
4259 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
4265 /* Add an entry to the type-hash-table
4266 for a type TYPE whose hash code is HASHCODE. */
4269 type_hash_add (hashval_t hashcode
, tree type
)
4271 struct type_hash
*h
;
4274 h
= ggc_alloc (sizeof (struct type_hash
));
4277 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
4278 *(struct type_hash
**) loc
= h
;
4281 /* Given TYPE, and HASHCODE its hash code, return the canonical
4282 object for an identical type if one already exists.
4283 Otherwise, return TYPE, and record it as the canonical object.
4285 To use this function, first create a type of the sort you want.
4286 Then compute its hash code from the fields of the type that
4287 make it different from other similar types.
4288 Then call this function and use the value. */
4291 type_hash_canon (unsigned int hashcode
, tree type
)
4295 /* The hash table only contains main variants, so ensure that's what we're
4297 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
4299 if (!lang_hooks
.types
.hash_types
)
4302 /* See if the type is in the hash table already. If so, return it.
4303 Otherwise, add the type. */
4304 t1
= type_hash_lookup (hashcode
, type
);
4307 #ifdef GATHER_STATISTICS
4308 tree_node_counts
[(int) t_kind
]--;
4309 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
4315 type_hash_add (hashcode
, type
);
4320 /* See if the data pointed to by the type hash table is marked. We consider
4321 it marked if the type is marked or if a debug type number or symbol
4322 table entry has been made for the type. This reduces the amount of
4323 debugging output and eliminates that dependency of the debug output on
4324 the number of garbage collections. */
4327 type_hash_marked_p (const void *p
)
4329 tree type
= ((struct type_hash
*) p
)->type
;
4331 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
4335 print_type_hash_statistics (void)
4337 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
4338 (long) htab_size (type_hash_table
),
4339 (long) htab_elements (type_hash_table
),
4340 htab_collisions (type_hash_table
));
4343 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4344 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4345 by adding the hash codes of the individual attributes. */
4348 attribute_hash_list (tree list
, hashval_t hashcode
)
4352 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4353 /* ??? Do we want to add in TREE_VALUE too? */
4354 hashcode
= iterative_hash_object
4355 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
4359 /* Given two lists of attributes, return true if list l2 is
4360 equivalent to l1. */
4363 attribute_list_equal (tree l1
, tree l2
)
4365 return attribute_list_contained (l1
, l2
)
4366 && attribute_list_contained (l2
, l1
);
4369 /* Given two lists of attributes, return true if list L2 is
4370 completely contained within L1. */
4371 /* ??? This would be faster if attribute names were stored in a canonicalized
4372 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4373 must be used to show these elements are equivalent (which they are). */
4374 /* ??? It's not clear that attributes with arguments will always be handled
4378 attribute_list_contained (tree l1
, tree l2
)
4382 /* First check the obvious, maybe the lists are identical. */
4386 /* Maybe the lists are similar. */
4387 for (t1
= l1
, t2
= l2
;
4389 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
4390 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
4391 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
4393 /* Maybe the lists are equal. */
4394 if (t1
== 0 && t2
== 0)
4397 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
4400 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
4402 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4405 if (TREE_VALUE (t2
) != NULL
4406 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
4407 && TREE_VALUE (attr
) != NULL
4408 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
4410 if (simple_cst_list_equal (TREE_VALUE (t2
),
4411 TREE_VALUE (attr
)) == 1)
4414 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
4425 /* Given two lists of types
4426 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4427 return 1 if the lists contain the same types in the same order.
4428 Also, the TREE_PURPOSEs must match. */
4431 type_list_equal (tree l1
, tree l2
)
4435 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
4436 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
4437 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
4438 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
4439 && (TREE_TYPE (TREE_PURPOSE (t1
))
4440 == TREE_TYPE (TREE_PURPOSE (t2
))))))
4446 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4447 given by TYPE. If the argument list accepts variable arguments,
4448 then this function counts only the ordinary arguments. */
4451 type_num_arguments (tree type
)
4456 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
4457 /* If the function does not take a variable number of arguments,
4458 the last element in the list will have type `void'. */
4459 if (VOID_TYPE_P (TREE_VALUE (t
)))
4467 /* Nonzero if integer constants T1 and T2
4468 represent the same constant value. */
4471 tree_int_cst_equal (tree t1
, tree t2
)
4476 if (t1
== 0 || t2
== 0)
4479 if (TREE_CODE (t1
) == INTEGER_CST
4480 && TREE_CODE (t2
) == INTEGER_CST
4481 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4482 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
4488 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4489 The precise way of comparison depends on their data type. */
4492 tree_int_cst_lt (tree t1
, tree t2
)
4497 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
4499 int t1_sgn
= tree_int_cst_sgn (t1
);
4500 int t2_sgn
= tree_int_cst_sgn (t2
);
4502 if (t1_sgn
< t2_sgn
)
4504 else if (t1_sgn
> t2_sgn
)
4506 /* Otherwise, both are non-negative, so we compare them as
4507 unsigned just in case one of them would overflow a signed
4510 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
4511 return INT_CST_LT (t1
, t2
);
4513 return INT_CST_LT_UNSIGNED (t1
, t2
);
4516 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4519 tree_int_cst_compare (tree t1
, tree t2
)
4521 if (tree_int_cst_lt (t1
, t2
))
4523 else if (tree_int_cst_lt (t2
, t1
))
4529 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4530 the host. If POS is zero, the value can be represented in a single
4531 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4532 be represented in a single unsigned HOST_WIDE_INT. */
4535 host_integerp (tree t
, int pos
)
4537 return (TREE_CODE (t
) == INTEGER_CST
4538 && ((TREE_INT_CST_HIGH (t
) == 0
4539 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
4540 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
4541 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
4542 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
4543 || TYPE_IS_SIZETYPE (TREE_TYPE (t
))))
4544 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
4547 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4548 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4549 be non-negative. We must be able to satisfy the above conditions. */
4552 tree_low_cst (tree t
, int pos
)
4554 gcc_assert (host_integerp (t
, pos
));
4555 return TREE_INT_CST_LOW (t
);
4558 /* Return the most significant bit of the integer constant T. */
4561 tree_int_cst_msb (tree t
)
4565 unsigned HOST_WIDE_INT l
;
4567 /* Note that using TYPE_PRECISION here is wrong. We care about the
4568 actual bits, not the (arbitrary) range of the type. */
4569 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
4570 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
4571 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
4572 return (l
& 1) == 1;
4575 /* Return an indication of the sign of the integer constant T.
4576 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4577 Note that -1 will never be returned if T's type is unsigned. */
4580 tree_int_cst_sgn (tree t
)
4582 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
4584 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
4586 else if (TREE_INT_CST_HIGH (t
) < 0)
4592 /* Compare two constructor-element-type constants. Return 1 if the lists
4593 are known to be equal; otherwise return 0. */
4596 simple_cst_list_equal (tree l1
, tree l2
)
4598 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4600 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4603 l1
= TREE_CHAIN (l1
);
4604 l2
= TREE_CHAIN (l2
);
4610 /* Return truthvalue of whether T1 is the same tree structure as T2.
4611 Return 1 if they are the same.
4612 Return 0 if they are understandably different.
4613 Return -1 if either contains tree structure not understood by
4617 simple_cst_equal (tree t1
, tree t2
)
4619 enum tree_code code1
, code2
;
4625 if (t1
== 0 || t2
== 0)
4628 code1
= TREE_CODE (t1
);
4629 code2
= TREE_CODE (t2
);
4631 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
4633 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4634 || code2
== NON_LVALUE_EXPR
)
4635 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4637 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
4640 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4641 || code2
== NON_LVALUE_EXPR
)
4642 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
4650 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4651 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
4654 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
4657 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
4658 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
4659 TREE_STRING_LENGTH (t1
)));
4663 unsigned HOST_WIDE_INT idx
;
4664 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
4665 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
4667 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
4670 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
4671 /* ??? Should we handle also fields here? */
4672 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
4673 VEC_index (constructor_elt
, v2
, idx
)->value
))
4679 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4682 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4686 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4689 /* Special case: if either target is an unallocated VAR_DECL,
4690 it means that it's going to be unified with whatever the
4691 TARGET_EXPR is really supposed to initialize, so treat it
4692 as being equivalent to anything. */
4693 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
4694 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
4695 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
4696 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
4697 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
4698 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
4701 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4706 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4708 case WITH_CLEANUP_EXPR
:
4709 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4713 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
4716 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4717 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4731 /* This general rule works for most tree codes. All exceptions should be
4732 handled above. If this is a language-specific tree code, we can't
4733 trust what might be in the operand, so say we don't know
4735 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4738 switch (TREE_CODE_CLASS (code1
))
4742 case tcc_comparison
:
4743 case tcc_expression
:
4747 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
4749 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4761 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4762 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4763 than U, respectively. */
4766 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
4768 if (tree_int_cst_sgn (t
) < 0)
4770 else if (TREE_INT_CST_HIGH (t
) != 0)
4772 else if (TREE_INT_CST_LOW (t
) == u
)
4774 else if (TREE_INT_CST_LOW (t
) < u
)
4780 /* Return true if CODE represents an associative tree code. Otherwise
4783 associative_tree_code (enum tree_code code
)
4802 /* Return true if CODE represents a commutative tree code. Otherwise
4805 commutative_tree_code (enum tree_code code
)
4818 case UNORDERED_EXPR
:
4822 case TRUTH_AND_EXPR
:
4823 case TRUTH_XOR_EXPR
:
4833 /* Generate a hash value for an expression. This can be used iteratively
4834 by passing a previous result as the "val" argument.
4836 This function is intended to produce the same hash for expressions which
4837 would compare equal using operand_equal_p. */
4840 iterative_hash_expr (tree t
, hashval_t val
)
4843 enum tree_code code
;
4847 return iterative_hash_pointer (t
, val
);
4849 code
= TREE_CODE (t
);
4853 /* Alas, constants aren't shared, so we can't rely on pointer
4856 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
4857 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4860 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4862 return iterative_hash_hashval_t (val2
, val
);
4865 return iterative_hash (TREE_STRING_POINTER (t
),
4866 TREE_STRING_LENGTH (t
), val
);
4868 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4869 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4871 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4875 /* we can just compare by pointer. */
4876 return iterative_hash_pointer (t
, val
);
4879 /* A list of expressions, for a CALL_EXPR or as the elements of a
4881 for (; t
; t
= TREE_CHAIN (t
))
4882 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4886 unsigned HOST_WIDE_INT idx
;
4888 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
4890 val
= iterative_hash_expr (field
, val
);
4891 val
= iterative_hash_expr (value
, val
);
4896 /* When referring to a built-in FUNCTION_DECL, use the
4897 __builtin__ form. Otherwise nodes that compare equal
4898 according to operand_equal_p might get different
4900 if (DECL_BUILT_IN (t
))
4902 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
4906 /* else FALL THROUGH */
4908 class = TREE_CODE_CLASS (code
);
4910 if (class == tcc_declaration
)
4912 /* DECL's have a unique ID */
4913 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
4917 gcc_assert (IS_EXPR_CODE_CLASS (class));
4919 val
= iterative_hash_object (code
, val
);
4921 /* Don't hash the type, that can lead to having nodes which
4922 compare equal according to operand_equal_p, but which
4923 have different hash codes. */
4924 if (code
== NOP_EXPR
4925 || code
== CONVERT_EXPR
4926 || code
== NON_LVALUE_EXPR
)
4928 /* Make sure to include signness in the hash computation. */
4929 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4930 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4933 else if (commutative_tree_code (code
))
4935 /* It's a commutative expression. We want to hash it the same
4936 however it appears. We do this by first hashing both operands
4937 and then rehashing based on the order of their independent
4939 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4940 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4944 t
= one
, one
= two
, two
= t
;
4946 val
= iterative_hash_hashval_t (one
, val
);
4947 val
= iterative_hash_hashval_t (two
, val
);
4950 for (i
= TREE_CODE_LENGTH (code
) - 1; i
>= 0; --i
)
4951 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4958 /* Constructors for pointer, array and function types.
4959 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4960 constructed by language-dependent code, not here.) */
4962 /* Construct, lay out and return the type of pointers to TO_TYPE with
4963 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4964 reference all of memory. If such a type has already been
4965 constructed, reuse it. */
4968 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4973 if (to_type
== error_mark_node
)
4974 return error_mark_node
;
4976 /* In some cases, languages will have things that aren't a POINTER_TYPE
4977 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4978 In that case, return that type without regard to the rest of our
4981 ??? This is a kludge, but consistent with the way this function has
4982 always operated and there doesn't seem to be a good way to avoid this
4984 if (TYPE_POINTER_TO (to_type
) != 0
4985 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4986 return TYPE_POINTER_TO (to_type
);
4988 /* First, if we already have a type for pointers to TO_TYPE and it's
4989 the proper mode, use it. */
4990 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4991 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4994 t
= make_node (POINTER_TYPE
);
4996 TREE_TYPE (t
) = to_type
;
4997 TYPE_MODE (t
) = mode
;
4998 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4999 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
5000 TYPE_POINTER_TO (to_type
) = t
;
5002 /* Lay out the type. This function has many callers that are concerned
5003 with expression-construction, and this simplifies them all. */
5009 /* By default build pointers in ptr_mode. */
5012 build_pointer_type (tree to_type
)
5014 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
5017 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5020 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
5025 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5026 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5027 In that case, return that type without regard to the rest of our
5030 ??? This is a kludge, but consistent with the way this function has
5031 always operated and there doesn't seem to be a good way to avoid this
5033 if (TYPE_REFERENCE_TO (to_type
) != 0
5034 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
5035 return TYPE_REFERENCE_TO (to_type
);
5037 /* First, if we already have a type for pointers to TO_TYPE and it's
5038 the proper mode, use it. */
5039 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
5040 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5043 t
= make_node (REFERENCE_TYPE
);
5045 TREE_TYPE (t
) = to_type
;
5046 TYPE_MODE (t
) = mode
;
5047 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5048 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
5049 TYPE_REFERENCE_TO (to_type
) = t
;
5057 /* Build the node for the type of references-to-TO_TYPE by default
5061 build_reference_type (tree to_type
)
5063 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
5066 /* Build a type that is compatible with t but has no cv quals anywhere
5069 const char *const *const * -> char ***. */
5072 build_type_no_quals (tree t
)
5074 switch (TREE_CODE (t
))
5077 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5079 TYPE_REF_CAN_ALIAS_ALL (t
));
5080 case REFERENCE_TYPE
:
5082 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5084 TYPE_REF_CAN_ALIAS_ALL (t
));
5086 return TYPE_MAIN_VARIANT (t
);
5090 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5091 MAXVAL should be the maximum value in the domain
5092 (one less than the length of the array).
5094 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5095 We don't enforce this limit, that is up to caller (e.g. language front end).
5096 The limit exists because the result is a signed type and we don't handle
5097 sizes that use more than one HOST_WIDE_INT. */
5100 build_index_type (tree maxval
)
5102 tree itype
= make_node (INTEGER_TYPE
);
5104 TREE_TYPE (itype
) = sizetype
;
5105 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
5106 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5107 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
5108 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
5109 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
5110 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
5111 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
5112 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
5114 if (host_integerp (maxval
, 1))
5115 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
5120 /* Builds a signed or unsigned integer type of precision PRECISION.
5121 Used for C bitfields whose precision does not match that of
5122 built-in target types. */
5124 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
5127 tree itype
= make_node (INTEGER_TYPE
);
5129 TYPE_PRECISION (itype
) = precision
;
5132 fixup_unsigned_type (itype
);
5134 fixup_signed_type (itype
);
5136 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
5137 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
5142 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5143 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5144 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5147 build_range_type (tree type
, tree lowval
, tree highval
)
5149 tree itype
= make_node (INTEGER_TYPE
);
5151 TREE_TYPE (itype
) = type
;
5152 if (type
== NULL_TREE
)
5155 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
5156 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
5158 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
5159 TYPE_MODE (itype
) = TYPE_MODE (type
);
5160 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
5161 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
5162 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
5163 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
5165 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
5166 return type_hash_canon (tree_low_cst (highval
, 0)
5167 - tree_low_cst (lowval
, 0),
5173 /* Just like build_index_type, but takes lowval and highval instead
5174 of just highval (maxval). */
5177 build_index_2_type (tree lowval
, tree highval
)
5179 return build_range_type (sizetype
, lowval
, highval
);
5182 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5183 and number of elements specified by the range of values of INDEX_TYPE.
5184 If such a type has already been constructed, reuse it. */
5187 build_array_type (tree elt_type
, tree index_type
)
5190 hashval_t hashcode
= 0;
5192 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
5194 error ("arrays of functions are not meaningful");
5195 elt_type
= integer_type_node
;
5198 t
= make_node (ARRAY_TYPE
);
5199 TREE_TYPE (t
) = elt_type
;
5200 TYPE_DOMAIN (t
) = index_type
;
5202 if (index_type
== 0)
5205 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5206 t
= type_hash_canon (hashcode
, t
);
5212 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5213 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
5214 t
= type_hash_canon (hashcode
, t
);
5216 if (!COMPLETE_TYPE_P (t
))
5221 /* Return the TYPE of the elements comprising
5222 the innermost dimension of ARRAY. */
5225 get_inner_array_type (tree array
)
5227 tree type
= TREE_TYPE (array
);
5229 while (TREE_CODE (type
) == ARRAY_TYPE
)
5230 type
= TREE_TYPE (type
);
5235 /* Construct, lay out and return
5236 the type of functions returning type VALUE_TYPE
5237 given arguments of types ARG_TYPES.
5238 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5239 are data type nodes for the arguments of the function.
5240 If such a type has already been constructed, reuse it. */
5243 build_function_type (tree value_type
, tree arg_types
)
5246 hashval_t hashcode
= 0;
5248 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
5250 error ("function return type cannot be function");
5251 value_type
= integer_type_node
;
5254 /* Make a node of the sort we want. */
5255 t
= make_node (FUNCTION_TYPE
);
5256 TREE_TYPE (t
) = value_type
;
5257 TYPE_ARG_TYPES (t
) = arg_types
;
5259 /* If we already have such a type, use the old one. */
5260 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
5261 hashcode
= type_hash_list (arg_types
, hashcode
);
5262 t
= type_hash_canon (hashcode
, t
);
5264 if (!COMPLETE_TYPE_P (t
))
5269 /* Build a function type. The RETURN_TYPE is the type returned by the
5270 function. If additional arguments are provided, they are
5271 additional argument types. The list of argument types must always
5272 be terminated by NULL_TREE. */
5275 build_function_type_list (tree return_type
, ...)
5280 va_start (p
, return_type
);
5282 t
= va_arg (p
, tree
);
5283 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
5284 args
= tree_cons (NULL_TREE
, t
, args
);
5286 if (args
== NULL_TREE
)
5287 args
= void_list_node
;
5291 args
= nreverse (args
);
5292 TREE_CHAIN (last
) = void_list_node
;
5294 args
= build_function_type (return_type
, args
);
5300 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5301 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5302 for the method. An implicit additional parameter (of type
5303 pointer-to-BASETYPE) is added to the ARGTYPES. */
5306 build_method_type_directly (tree basetype
,
5314 /* Make a node of the sort we want. */
5315 t
= make_node (METHOD_TYPE
);
5317 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5318 TREE_TYPE (t
) = rettype
;
5319 ptype
= build_pointer_type (basetype
);
5321 /* The actual arglist for this function includes a "hidden" argument
5322 which is "this". Put it into the list of argument types. */
5323 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
5324 TYPE_ARG_TYPES (t
) = argtypes
;
5326 /* If we already have such a type, use the old one. */
5327 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5328 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
5329 hashcode
= type_hash_list (argtypes
, hashcode
);
5330 t
= type_hash_canon (hashcode
, t
);
5332 if (!COMPLETE_TYPE_P (t
))
5338 /* Construct, lay out and return the type of methods belonging to class
5339 BASETYPE and whose arguments and values are described by TYPE.
5340 If that type exists already, reuse it.
5341 TYPE must be a FUNCTION_TYPE node. */
5344 build_method_type (tree basetype
, tree type
)
5346 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
5348 return build_method_type_directly (basetype
,
5350 TYPE_ARG_TYPES (type
));
5353 /* Construct, lay out and return the type of offsets to a value
5354 of type TYPE, within an object of type BASETYPE.
5355 If a suitable offset type exists already, reuse it. */
5358 build_offset_type (tree basetype
, tree type
)
5361 hashval_t hashcode
= 0;
5363 /* Make a node of the sort we want. */
5364 t
= make_node (OFFSET_TYPE
);
5366 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5367 TREE_TYPE (t
) = type
;
5369 /* If we already have such a type, use the old one. */
5370 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5371 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
5372 t
= type_hash_canon (hashcode
, t
);
5374 if (!COMPLETE_TYPE_P (t
))
5380 /* Create a complex type whose components are COMPONENT_TYPE. */
5383 build_complex_type (tree component_type
)
5388 /* Make a node of the sort we want. */
5389 t
= make_node (COMPLEX_TYPE
);
5391 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
5393 /* If we already have such a type, use the old one. */
5394 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
5395 t
= type_hash_canon (hashcode
, t
);
5397 if (!COMPLETE_TYPE_P (t
))
5400 /* If we are writing Dwarf2 output we need to create a name,
5401 since complex is a fundamental type. */
5402 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
5406 if (component_type
== char_type_node
)
5407 name
= "complex char";
5408 else if (component_type
== signed_char_type_node
)
5409 name
= "complex signed char";
5410 else if (component_type
== unsigned_char_type_node
)
5411 name
= "complex unsigned char";
5412 else if (component_type
== short_integer_type_node
)
5413 name
= "complex short int";
5414 else if (component_type
== short_unsigned_type_node
)
5415 name
= "complex short unsigned int";
5416 else if (component_type
== integer_type_node
)
5417 name
= "complex int";
5418 else if (component_type
== unsigned_type_node
)
5419 name
= "complex unsigned int";
5420 else if (component_type
== long_integer_type_node
)
5421 name
= "complex long int";
5422 else if (component_type
== long_unsigned_type_node
)
5423 name
= "complex long unsigned int";
5424 else if (component_type
== long_long_integer_type_node
)
5425 name
= "complex long long int";
5426 else if (component_type
== long_long_unsigned_type_node
)
5427 name
= "complex long long unsigned int";
5432 TYPE_NAME (t
) = get_identifier (name
);
5435 return build_qualified_type (t
, TYPE_QUALS (component_type
));
5438 /* Return OP, stripped of any conversions to wider types as much as is safe.
5439 Converting the value back to OP's type makes a value equivalent to OP.
5441 If FOR_TYPE is nonzero, we return a value which, if converted to
5442 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5444 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5445 narrowest type that can hold the value, even if they don't exactly fit.
5446 Otherwise, bit-field references are changed to a narrower type
5447 only if they can be fetched directly from memory in that type.
5449 OP must have integer, real or enumeral type. Pointers are not allowed!
5451 There are some cases where the obvious value we could return
5452 would regenerate to OP if converted to OP's type,
5453 but would not extend like OP to wider types.
5454 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5455 For example, if OP is (unsigned short)(signed char)-1,
5456 we avoid returning (signed char)-1 if FOR_TYPE is int,
5457 even though extending that to an unsigned short would regenerate OP,
5458 since the result of extending (signed char)-1 to (int)
5459 is different from (int) OP. */
5462 get_unwidened (tree op
, tree for_type
)
5464 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5465 tree type
= TREE_TYPE (op
);
5467 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
5469 = (for_type
!= 0 && for_type
!= type
5470 && final_prec
> TYPE_PRECISION (type
)
5471 && TYPE_UNSIGNED (type
));
5474 while (TREE_CODE (op
) == NOP_EXPR
5475 || TREE_CODE (op
) == CONVERT_EXPR
)
5479 /* TYPE_PRECISION on vector types has different meaning
5480 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5481 so avoid them here. */
5482 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
5485 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
5486 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
5488 /* Truncations are many-one so cannot be removed.
5489 Unless we are later going to truncate down even farther. */
5491 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
5494 /* See what's inside this conversion. If we decide to strip it,
5496 op
= TREE_OPERAND (op
, 0);
5498 /* If we have not stripped any zero-extensions (uns is 0),
5499 we can strip any kind of extension.
5500 If we have previously stripped a zero-extension,
5501 only zero-extensions can safely be stripped.
5502 Any extension can be stripped if the bits it would produce
5503 are all going to be discarded later by truncating to FOR_TYPE. */
5507 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
5509 /* TYPE_UNSIGNED says whether this is a zero-extension.
5510 Let's avoid computing it if it does not affect WIN
5511 and if UNS will not be needed again. */
5513 || TREE_CODE (op
) == NOP_EXPR
5514 || TREE_CODE (op
) == CONVERT_EXPR
)
5515 && TYPE_UNSIGNED (TREE_TYPE (op
)))
5523 if (TREE_CODE (op
) == COMPONENT_REF
5524 /* Since type_for_size always gives an integer type. */
5525 && TREE_CODE (type
) != REAL_TYPE
5526 /* Don't crash if field not laid out yet. */
5527 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
5528 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
5530 unsigned int innerprec
5531 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
5532 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
5533 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
5534 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
5536 /* We can get this structure field in the narrowest type it fits in.
5537 If FOR_TYPE is 0, do this only for a field that matches the
5538 narrower type exactly and is aligned for it
5539 The resulting extension to its nominal type (a fullword type)
5540 must fit the same conditions as for other extensions. */
5543 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
5544 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
5545 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
5547 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
5548 TREE_OPERAND (op
, 1), NULL_TREE
);
5549 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
5550 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
5557 /* Return OP or a simpler expression for a narrower value
5558 which can be sign-extended or zero-extended to give back OP.
5559 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5560 or 0 if the value should be sign-extended. */
5563 get_narrower (tree op
, int *unsignedp_ptr
)
5568 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
5570 while (TREE_CODE (op
) == NOP_EXPR
)
5573 = (TYPE_PRECISION (TREE_TYPE (op
))
5574 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
5576 /* Truncations are many-one so cannot be removed. */
5580 /* See what's inside this conversion. If we decide to strip it,
5585 op
= TREE_OPERAND (op
, 0);
5586 /* An extension: the outermost one can be stripped,
5587 but remember whether it is zero or sign extension. */
5589 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5590 /* Otherwise, if a sign extension has been stripped,
5591 only sign extensions can now be stripped;
5592 if a zero extension has been stripped, only zero-extensions. */
5593 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
5597 else /* bitschange == 0 */
5599 /* A change in nominal type can always be stripped, but we must
5600 preserve the unsignedness. */
5602 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5604 op
= TREE_OPERAND (op
, 0);
5605 /* Keep trying to narrow, but don't assign op to win if it
5606 would turn an integral type into something else. */
5607 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
5614 if (TREE_CODE (op
) == COMPONENT_REF
5615 /* Since type_for_size always gives an integer type. */
5616 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
5617 /* Ensure field is laid out already. */
5618 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
5619 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
5621 unsigned HOST_WIDE_INT innerprec
5622 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
5623 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
5624 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
5625 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
5627 /* We can get this structure field in a narrower type that fits it,
5628 but the resulting extension to its nominal type (a fullword type)
5629 must satisfy the same conditions as for other extensions.
5631 Do this only for fields that are aligned (not bit-fields),
5632 because when bit-field insns will be used there is no
5633 advantage in doing this. */
5635 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
5636 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
5637 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
5641 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
5642 win
= fold_convert (type
, op
);
5646 *unsignedp_ptr
= uns
;
5650 /* Nonzero if integer constant C has a value that is permissible
5651 for type TYPE (an INTEGER_TYPE). */
5654 int_fits_type_p (tree c
, tree type
)
5656 tree type_low_bound
= TYPE_MIN_VALUE (type
);
5657 tree type_high_bound
= TYPE_MAX_VALUE (type
);
5658 bool ok_for_low_bound
, ok_for_high_bound
;
5661 /* If at least one bound of the type is a constant integer, we can check
5662 ourselves and maybe make a decision. If no such decision is possible, but
5663 this type is a subtype, try checking against that. Otherwise, use
5664 force_fit_type, which checks against the precision.
5666 Compute the status for each possibly constant bound, and return if we see
5667 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5668 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5669 for "constant known to fit". */
5671 /* Check if C >= type_low_bound. */
5672 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
5674 if (tree_int_cst_lt (c
, type_low_bound
))
5676 ok_for_low_bound
= true;
5679 ok_for_low_bound
= false;
5681 /* Check if c <= type_high_bound. */
5682 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
5684 if (tree_int_cst_lt (type_high_bound
, c
))
5686 ok_for_high_bound
= true;
5689 ok_for_high_bound
= false;
5691 /* If the constant fits both bounds, the result is known. */
5692 if (ok_for_low_bound
&& ok_for_high_bound
)
5695 /* Perform some generic filtering which may allow making a decision
5696 even if the bounds are not constant. First, negative integers
5697 never fit in unsigned types, */
5698 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
5701 /* Second, narrower types always fit in wider ones. */
5702 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
5705 /* Third, unsigned integers with top bit set never fit signed types. */
5706 if (! TYPE_UNSIGNED (type
)
5707 && TYPE_UNSIGNED (TREE_TYPE (c
))
5708 && tree_int_cst_msb (c
))
5711 /* If we haven't been able to decide at this point, there nothing more we
5712 can check ourselves here. Look at the base type if we have one and it
5713 has the same precision. */
5714 if (TREE_CODE (type
) == INTEGER_TYPE
5715 && TREE_TYPE (type
) != 0
5716 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
5717 return int_fits_type_p (c
, TREE_TYPE (type
));
5719 /* Or to force_fit_type, if nothing else. */
5720 tmp
= copy_node (c
);
5721 TREE_TYPE (tmp
) = type
;
5722 tmp
= force_fit_type (tmp
, -1, false, false);
5723 return TREE_INT_CST_HIGH (tmp
) == TREE_INT_CST_HIGH (c
)
5724 && TREE_INT_CST_LOW (tmp
) == TREE_INT_CST_LOW (c
);
5727 /* Subprogram of following function. Called by walk_tree.
5729 Return *TP if it is an automatic variable or parameter of the
5730 function passed in as DATA. */
5733 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
5735 tree fn
= (tree
) data
;
5740 else if (DECL_P (*tp
)
5741 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
5747 /* Returns true if T is, contains, or refers to a type with variable
5748 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
5749 arguments, but not the return type. If FN is nonzero, only return
5750 true if a modifier of the type or position of FN is a variable or
5751 parameter inside FN.
5753 This concept is more general than that of C99 'variably modified types':
5754 in C99, a struct type is never variably modified because a VLA may not
5755 appear as a structure member. However, in GNU C code like:
5757 struct S { int i[f()]; };
5759 is valid, and other languages may define similar constructs. */
5762 variably_modified_type_p (tree type
, tree fn
)
5766 /* Test if T is either variable (if FN is zero) or an expression containing
5767 a variable in FN. */
5768 #define RETURN_TRUE_IF_VAR(T) \
5769 do { tree _t = (T); \
5770 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5771 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5772 return true; } while (0)
5774 if (type
== error_mark_node
)
5777 /* If TYPE itself has variable size, it is variably modified. */
5778 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
5779 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
5781 switch (TREE_CODE (type
))
5784 case REFERENCE_TYPE
:
5786 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5792 /* If TYPE is a function type, it is variably modified if the
5793 return type is variably modified. */
5794 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5802 /* Scalar types are variably modified if their end points
5804 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
5805 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
5810 case QUAL_UNION_TYPE
:
5811 /* We can't see if any of the fields are variably-modified by the
5812 definition we normally use, since that would produce infinite
5813 recursion via pointers. */
5814 /* This is variably modified if some field's type is. */
5815 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5816 if (TREE_CODE (t
) == FIELD_DECL
)
5818 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
5819 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
5820 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
5822 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
5823 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
5828 /* Do not call ourselves to avoid infinite recursion. This is
5829 variably modified if the element type is. */
5830 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
5831 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
5838 /* The current language may have other cases to check, but in general,
5839 all other types are not variably modified. */
5840 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
5842 #undef RETURN_TRUE_IF_VAR
5845 /* Given a DECL or TYPE, return the scope in which it was declared, or
5846 NULL_TREE if there is no containing scope. */
5849 get_containing_scope (tree t
)
5851 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
5854 /* Return the innermost context enclosing DECL that is
5855 a FUNCTION_DECL, or zero if none. */
5858 decl_function_context (tree decl
)
5862 if (TREE_CODE (decl
) == ERROR_MARK
)
5865 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5866 where we look up the function at runtime. Such functions always take
5867 a first argument of type 'pointer to real context'.
5869 C++ should really be fixed to use DECL_CONTEXT for the real context,
5870 and use something else for the "virtual context". */
5871 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
5874 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
5876 context
= DECL_CONTEXT (decl
);
5878 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
5880 if (TREE_CODE (context
) == BLOCK
)
5881 context
= BLOCK_SUPERCONTEXT (context
);
5883 context
= get_containing_scope (context
);
5889 /* Return the innermost context enclosing DECL that is
5890 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5891 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5894 decl_type_context (tree decl
)
5896 tree context
= DECL_CONTEXT (decl
);
5899 switch (TREE_CODE (context
))
5901 case NAMESPACE_DECL
:
5902 case TRANSLATION_UNIT_DECL
:
5907 case QUAL_UNION_TYPE
:
5912 context
= DECL_CONTEXT (context
);
5916 context
= BLOCK_SUPERCONTEXT (context
);
5926 /* CALL is a CALL_EXPR. Return the declaration for the function
5927 called, or NULL_TREE if the called function cannot be
5931 get_callee_fndecl (tree call
)
5935 if (call
== error_mark_node
)
5938 /* It's invalid to call this function with anything but a
5940 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5942 /* The first operand to the CALL is the address of the function
5944 addr
= TREE_OPERAND (call
, 0);
5948 /* If this is a readonly function pointer, extract its initial value. */
5949 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5950 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5951 && DECL_INITIAL (addr
))
5952 addr
= DECL_INITIAL (addr
);
5954 /* If the address is just `&f' for some function `f', then we know
5955 that `f' is being called. */
5956 if (TREE_CODE (addr
) == ADDR_EXPR
5957 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5958 return TREE_OPERAND (addr
, 0);
5960 /* We couldn't figure out what was being called. Maybe the front
5961 end has some idea. */
5962 return lang_hooks
.lang_get_callee_fndecl (call
);
5965 /* Print debugging information about tree nodes generated during the compile,
5966 and any language-specific information. */
5969 dump_tree_statistics (void)
5971 #ifdef GATHER_STATISTICS
5973 int total_nodes
, total_bytes
;
5976 fprintf (stderr
, "\n??? tree nodes created\n\n");
5977 #ifdef GATHER_STATISTICS
5978 fprintf (stderr
, "Kind Nodes Bytes\n");
5979 fprintf (stderr
, "---------------------------------------\n");
5980 total_nodes
= total_bytes
= 0;
5981 for (i
= 0; i
< (int) all_kinds
; i
++)
5983 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5984 tree_node_counts
[i
], tree_node_sizes
[i
]);
5985 total_nodes
+= tree_node_counts
[i
];
5986 total_bytes
+= tree_node_sizes
[i
];
5988 fprintf (stderr
, "---------------------------------------\n");
5989 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5990 fprintf (stderr
, "---------------------------------------\n");
5991 ssanames_print_statistics ();
5992 phinodes_print_statistics ();
5994 fprintf (stderr
, "(No per-node statistics)\n");
5996 print_type_hash_statistics ();
5997 print_debug_expr_statistics ();
5998 print_value_expr_statistics ();
5999 print_restrict_base_statistics ();
6000 lang_hooks
.print_statistics ();
6003 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6005 /* Generate a crc32 of a string. */
6008 crc32_string (unsigned chksum
, const char *string
)
6012 unsigned value
= *string
<< 24;
6015 for (ix
= 8; ix
--; value
<<= 1)
6019 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
6028 /* P is a string that will be used in a symbol. Mask out any characters
6029 that are not valid in that context. */
6032 clean_symbol_name (char *p
)
6036 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6039 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6046 /* Generate a name for a function unique to this translation unit.
6047 TYPE is some string to identify the purpose of this function to the
6048 linker or collect2. */
6051 get_file_function_name_long (const char *type
)
6057 if (first_global_object_name
)
6059 p
= first_global_object_name
;
6061 /* For type 'F', the generated name must be unique not only to this
6062 translation unit but also to any given link. Since global names
6063 can be overloaded, we concatenate the first global object name
6064 with a string derived from the file name of this object. */
6065 if (!strcmp (type
, "F"))
6067 const char *file
= main_input_filename
;
6070 file
= input_filename
;
6072 q
= alloca (strlen (p
) + 10);
6073 sprintf (q
, "%s_%08X", p
, crc32_string (0, file
));
6080 /* We don't have anything that we know to be unique to this translation
6081 unit, so use what we do have and throw in some randomness. */
6083 const char *name
= weak_global_object_name
;
6084 const char *file
= main_input_filename
;
6089 file
= input_filename
;
6091 len
= strlen (file
);
6092 q
= alloca (9 * 2 + len
+ 1);
6093 memcpy (q
, file
, len
+ 1);
6094 clean_symbol_name (q
);
6096 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
6097 crc32_string (0, flag_random_seed
));
6102 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
6104 /* Set up the name of the file-level functions we may need.
6105 Use a global object (which is already required to be unique over
6106 the program) rather than the file name (which imposes extra
6108 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
6110 return get_identifier (buf
);
6113 /* If KIND=='I', return a suitable global initializer (constructor) name.
6114 If KIND=='D', return a suitable global clean-up (destructor) name. */
6117 get_file_function_name (int kind
)
6124 return get_file_function_name_long (p
);
6127 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6129 /* Complain that the tree code of NODE does not match the expected 0
6130 terminated list of trailing codes. The trailing code list can be
6131 empty, for a more vague error message. FILE, LINE, and FUNCTION
6132 are of the caller. */
6135 tree_check_failed (const tree node
, const char *file
,
6136 int line
, const char *function
, ...)
6140 unsigned length
= 0;
6143 va_start (args
, function
);
6144 while ((code
= va_arg (args
, int)))
6145 length
+= 4 + strlen (tree_code_name
[code
]);
6149 va_start (args
, function
);
6150 length
+= strlen ("expected ");
6151 buffer
= alloca (length
);
6153 while ((code
= va_arg (args
, int)))
6155 const char *prefix
= length
? " or " : "expected ";
6157 strcpy (buffer
+ length
, prefix
);
6158 length
+= strlen (prefix
);
6159 strcpy (buffer
+ length
, tree_code_name
[code
]);
6160 length
+= strlen (tree_code_name
[code
]);
6165 buffer
= (char *)"unexpected node";
6167 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6168 buffer
, tree_code_name
[TREE_CODE (node
)],
6169 function
, trim_filename (file
), line
);
6172 /* Complain that the tree code of NODE does match the expected 0
6173 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6177 tree_not_check_failed (const tree node
, const char *file
,
6178 int line
, const char *function
, ...)
6182 unsigned length
= 0;
6185 va_start (args
, function
);
6186 while ((code
= va_arg (args
, int)))
6187 length
+= 4 + strlen (tree_code_name
[code
]);
6189 va_start (args
, function
);
6190 buffer
= alloca (length
);
6192 while ((code
= va_arg (args
, int)))
6196 strcpy (buffer
+ length
, " or ");
6199 strcpy (buffer
+ length
, tree_code_name
[code
]);
6200 length
+= strlen (tree_code_name
[code
]);
6204 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6205 buffer
, tree_code_name
[TREE_CODE (node
)],
6206 function
, trim_filename (file
), line
);
6209 /* Similar to tree_check_failed, except that we check for a class of tree
6210 code, given in CL. */
6213 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
6214 const char *file
, int line
, const char *function
)
6217 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6218 TREE_CODE_CLASS_STRING (cl
),
6219 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6220 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6223 /* Similar to tree_check_failed, except that instead of specifying a
6224 dozen codes, use the knowledge that they're all sequential. */
6227 tree_range_check_failed (const tree node
, const char *file
, int line
,
6228 const char *function
, enum tree_code c1
,
6232 unsigned length
= 0;
6235 for (c
= c1
; c
<= c2
; ++c
)
6236 length
+= 4 + strlen (tree_code_name
[c
]);
6238 length
+= strlen ("expected ");
6239 buffer
= alloca (length
);
6242 for (c
= c1
; c
<= c2
; ++c
)
6244 const char *prefix
= length
? " or " : "expected ";
6246 strcpy (buffer
+ length
, prefix
);
6247 length
+= strlen (prefix
);
6248 strcpy (buffer
+ length
, tree_code_name
[c
]);
6249 length
+= strlen (tree_code_name
[c
]);
6252 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6253 buffer
, tree_code_name
[TREE_CODE (node
)],
6254 function
, trim_filename (file
), line
);
6258 /* Similar to tree_check_failed, except that we check that a tree does
6259 not have the specified code, given in CL. */
6262 tree_not_class_check_failed (const tree node
, const enum tree_code_class cl
,
6263 const char *file
, int line
, const char *function
)
6266 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6267 TREE_CODE_CLASS_STRING (cl
),
6268 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6269 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6273 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6276 omp_clause_check_failed (const tree node
, const char *file
, int line
,
6277 const char *function
, enum omp_clause_code code
)
6279 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6280 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
6281 function
, trim_filename (file
), line
);
6285 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6288 omp_clause_range_check_failed (const tree node
, const char *file
, int line
,
6289 const char *function
, enum omp_clause_code c1
,
6290 enum omp_clause_code c2
)
6293 unsigned length
= 0;
6294 enum omp_clause_code c
;
6296 for (c
= c1
; c
<= c2
; ++c
)
6297 length
+= 4 + strlen (omp_clause_code_name
[c
]);
6299 length
+= strlen ("expected ");
6300 buffer
= alloca (length
);
6303 for (c
= c1
; c
<= c2
; ++c
)
6305 const char *prefix
= length
? " or " : "expected ";
6307 strcpy (buffer
+ length
, prefix
);
6308 length
+= strlen (prefix
);
6309 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
6310 length
+= strlen (omp_clause_code_name
[c
]);
6313 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6314 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
6315 function
, trim_filename (file
), line
);
6319 #undef DEFTREESTRUCT
6320 #define DEFTREESTRUCT(VAL, NAME) NAME,
6322 static const char *ts_enum_names
[] = {
6323 #include "treestruct.def"
6325 #undef DEFTREESTRUCT
6327 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6329 /* Similar to tree_class_check_failed, except that we check for
6330 whether CODE contains the tree structure identified by EN. */
6333 tree_contains_struct_check_failed (const tree node
,
6334 const enum tree_node_structure_enum en
,
6335 const char *file
, int line
,
6336 const char *function
)
6339 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6341 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6345 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6346 (dynamically sized) vector. */
6349 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6350 const char *function
)
6353 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6354 idx
+ 1, len
, function
, trim_filename (file
), line
);
6357 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6358 (dynamically sized) vector. */
6361 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6362 const char *function
)
6365 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6366 idx
+ 1, len
, function
, trim_filename (file
), line
);
6369 /* Similar to above, except that the check is for the bounds of the operand
6370 vector of an expression node. */
6373 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
6374 int line
, const char *function
)
6377 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6378 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
6379 function
, trim_filename (file
), line
);
6382 /* Similar to above, except that the check is for the number of
6383 operands of an OMP_CLAUSE node. */
6386 omp_clause_operand_check_failed (int idx
, tree t
, const char *file
,
6387 int line
, const char *function
)
6390 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6391 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
6392 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
6393 trim_filename (file
), line
);
6395 #endif /* ENABLE_TREE_CHECKING */
6397 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6398 and mapped to the machine mode MODE. Initialize its fields and build
6399 the information necessary for debugging output. */
6402 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
6405 hashval_t hashcode
= 0;
6407 /* Build a main variant, based on the main variant of the inner type, then
6408 use it to build the variant we return. */
6409 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
6410 && TYPE_MAIN_VARIANT (innertype
) != innertype
)
6411 return build_type_attribute_qual_variant (
6412 make_vector_type (TYPE_MAIN_VARIANT (innertype
), nunits
, mode
),
6413 TYPE_ATTRIBUTES (innertype
),
6414 TYPE_QUALS (innertype
));
6416 t
= make_node (VECTOR_TYPE
);
6417 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
6418 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
6419 TYPE_MODE (t
) = mode
;
6420 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
6421 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
6426 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
6427 tree array
= build_array_type (innertype
, build_index_type (index
));
6428 tree rt
= make_node (RECORD_TYPE
);
6430 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
6431 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
6433 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
6434 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6435 the representation type, and we want to find that die when looking up
6436 the vector type. This is most easily achieved by making the TYPE_UID
6438 TYPE_UID (rt
) = TYPE_UID (t
);
6441 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
6442 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
6443 hashcode
= iterative_hash_object (TYPE_HASH (innertype
), hashcode
);
6444 return type_hash_canon (hashcode
, t
);
6448 make_or_reuse_type (unsigned size
, int unsignedp
)
6450 if (size
== INT_TYPE_SIZE
)
6451 return unsignedp
? unsigned_type_node
: integer_type_node
;
6452 if (size
== CHAR_TYPE_SIZE
)
6453 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
6454 if (size
== SHORT_TYPE_SIZE
)
6455 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
6456 if (size
== LONG_TYPE_SIZE
)
6457 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
6458 if (size
== LONG_LONG_TYPE_SIZE
)
6459 return (unsignedp
? long_long_unsigned_type_node
6460 : long_long_integer_type_node
);
6463 return make_unsigned_type (size
);
6465 return make_signed_type (size
);
6468 /* Create nodes for all integer types (and error_mark_node) using the sizes
6469 of C datatypes. The caller should call set_sizetype soon after calling
6470 this function to select one of the types as sizetype. */
6473 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
6475 error_mark_node
= make_node (ERROR_MARK
);
6476 TREE_TYPE (error_mark_node
) = error_mark_node
;
6478 initialize_sizetypes (signed_sizetype
);
6480 /* Define both `signed char' and `unsigned char'. */
6481 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6482 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
6483 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6484 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
6486 /* Define `char', which is like either `signed char' or `unsigned char'
6487 but not the same as either. */
6490 ? make_signed_type (CHAR_TYPE_SIZE
)
6491 : make_unsigned_type (CHAR_TYPE_SIZE
));
6492 TYPE_STRING_FLAG (char_type_node
) = 1;
6494 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6495 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6496 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6497 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6498 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6499 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6500 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6501 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6503 /* Define a boolean type. This type only represents boolean values but
6504 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6505 Front ends which want to override this size (i.e. Java) can redefine
6506 boolean_type_node before calling build_common_tree_nodes_2. */
6507 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6508 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6509 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
6510 TYPE_PRECISION (boolean_type_node
) = 1;
6512 /* Fill in the rest of the sized types. Reuse existing type nodes
6514 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
6515 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
6516 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
6517 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
6518 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
6520 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
6521 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
6522 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
6523 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
6524 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
6526 access_public_node
= get_identifier ("public");
6527 access_protected_node
= get_identifier ("protected");
6528 access_private_node
= get_identifier ("private");
6531 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6532 It will create several other common tree nodes. */
6535 build_common_tree_nodes_2 (int short_double
)
6537 /* Define these next since types below may used them. */
6538 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
6539 integer_one_node
= build_int_cst (NULL_TREE
, 1);
6540 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
6542 size_zero_node
= size_int (0);
6543 size_one_node
= size_int (1);
6544 bitsize_zero_node
= bitsize_int (0);
6545 bitsize_one_node
= bitsize_int (1);
6546 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
6548 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
6549 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
6551 void_type_node
= make_node (VOID_TYPE
);
6552 layout_type (void_type_node
);
6554 /* We are not going to have real types in C with less than byte alignment,
6555 so we might as well not have any types that claim to have it. */
6556 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
6557 TYPE_USER_ALIGN (void_type_node
) = 0;
6559 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
6560 layout_type (TREE_TYPE (null_pointer_node
));
6562 ptr_type_node
= build_pointer_type (void_type_node
);
6564 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
6565 fileptr_type_node
= ptr_type_node
;
6567 float_type_node
= make_node (REAL_TYPE
);
6568 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6569 layout_type (float_type_node
);
6571 double_type_node
= make_node (REAL_TYPE
);
6573 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6575 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6576 layout_type (double_type_node
);
6578 long_double_type_node
= make_node (REAL_TYPE
);
6579 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6580 layout_type (long_double_type_node
);
6582 float_ptr_type_node
= build_pointer_type (float_type_node
);
6583 double_ptr_type_node
= build_pointer_type (double_type_node
);
6584 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
6585 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
6587 /* Decimal float types. */
6588 dfloat32_type_node
= make_node (REAL_TYPE
);
6589 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
6590 layout_type (dfloat32_type_node
);
6591 TYPE_MODE (dfloat32_type_node
) = SDmode
;
6592 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
6594 dfloat64_type_node
= make_node (REAL_TYPE
);
6595 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
6596 layout_type (dfloat64_type_node
);
6597 TYPE_MODE (dfloat64_type_node
) = DDmode
;
6598 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
6600 dfloat128_type_node
= make_node (REAL_TYPE
);
6601 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
6602 layout_type (dfloat128_type_node
);
6603 TYPE_MODE (dfloat128_type_node
) = TDmode
;
6604 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
6606 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6607 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6608 layout_type (complex_integer_type_node
);
6610 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6611 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6612 layout_type (complex_float_type_node
);
6614 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6615 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6616 layout_type (complex_double_type_node
);
6618 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6619 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6620 layout_type (complex_long_double_type_node
);
6623 tree t
= targetm
.build_builtin_va_list ();
6625 /* Many back-ends define record types without setting TYPE_NAME.
6626 If we copied the record type here, we'd keep the original
6627 record type without a name. This breaks name mangling. So,
6628 don't copy record types and let c_common_nodes_and_builtins()
6629 declare the type to be __builtin_va_list. */
6630 if (TREE_CODE (t
) != RECORD_TYPE
)
6631 t
= build_variant_type_copy (t
);
6633 va_list_type_node
= t
;
6637 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6640 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
6641 const char *library_name
, int ecf_flags
)
6645 decl
= lang_hooks
.builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
6646 library_name
, NULL_TREE
);
6647 if (ecf_flags
& ECF_CONST
)
6648 TREE_READONLY (decl
) = 1;
6649 if (ecf_flags
& ECF_PURE
)
6650 DECL_IS_PURE (decl
) = 1;
6651 if (ecf_flags
& ECF_NORETURN
)
6652 TREE_THIS_VOLATILE (decl
) = 1;
6653 if (ecf_flags
& ECF_NOTHROW
)
6654 TREE_NOTHROW (decl
) = 1;
6655 if (ecf_flags
& ECF_MALLOC
)
6656 DECL_IS_MALLOC (decl
) = 1;
6658 built_in_decls
[code
] = decl
;
6659 implicit_built_in_decls
[code
] = decl
;
6662 /* Call this function after instantiating all builtins that the language
6663 front end cares about. This will build the rest of the builtins that
6664 are relied upon by the tree optimizers and the middle-end. */
6667 build_common_builtin_nodes (void)
6671 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
6672 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
6674 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6675 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
6676 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6677 ftype
= build_function_type (ptr_type_node
, tmp
);
6679 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
6680 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
6681 "memcpy", ECF_NOTHROW
);
6682 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
6683 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
6684 "memmove", ECF_NOTHROW
);
6687 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
6689 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6690 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
6691 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
6692 ftype
= build_function_type (integer_type_node
, tmp
);
6693 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
6694 "memcmp", ECF_PURE
| ECF_NOTHROW
);
6697 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
6699 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6700 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
6701 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6702 ftype
= build_function_type (ptr_type_node
, tmp
);
6703 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
6704 "memset", ECF_NOTHROW
);
6707 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
6709 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6710 ftype
= build_function_type (ptr_type_node
, tmp
);
6711 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
6712 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
6715 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6716 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6717 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6718 ftype
= build_function_type (void_type_node
, tmp
);
6719 local_define_builtin ("__builtin_init_trampoline", ftype
,
6720 BUILT_IN_INIT_TRAMPOLINE
,
6721 "__builtin_init_trampoline", ECF_NOTHROW
);
6723 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6724 ftype
= build_function_type (ptr_type_node
, tmp
);
6725 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
6726 BUILT_IN_ADJUST_TRAMPOLINE
,
6727 "__builtin_adjust_trampoline",
6728 ECF_CONST
| ECF_NOTHROW
);
6730 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6731 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6732 ftype
= build_function_type (void_type_node
, tmp
);
6733 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
6734 BUILT_IN_NONLOCAL_GOTO
,
6735 "__builtin_nonlocal_goto",
6736 ECF_NORETURN
| ECF_NOTHROW
);
6738 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6739 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6740 ftype
= build_function_type (void_type_node
, tmp
);
6741 local_define_builtin ("__builtin_setjmp_setup", ftype
,
6742 BUILT_IN_SETJMP_SETUP
,
6743 "__builtin_setjmp_setup", ECF_NOTHROW
);
6745 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6746 ftype
= build_function_type (ptr_type_node
, tmp
);
6747 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
6748 BUILT_IN_SETJMP_DISPATCHER
,
6749 "__builtin_setjmp_dispatcher",
6750 ECF_PURE
| ECF_NOTHROW
);
6752 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6753 ftype
= build_function_type (void_type_node
, tmp
);
6754 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
6755 BUILT_IN_SETJMP_RECEIVER
,
6756 "__builtin_setjmp_receiver", ECF_NOTHROW
);
6758 ftype
= build_function_type (ptr_type_node
, void_list_node
);
6759 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
6760 "__builtin_stack_save", ECF_NOTHROW
);
6762 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6763 ftype
= build_function_type (void_type_node
, tmp
);
6764 local_define_builtin ("__builtin_stack_restore", ftype
,
6765 BUILT_IN_STACK_RESTORE
,
6766 "__builtin_stack_restore", ECF_NOTHROW
);
6768 ftype
= build_function_type (void_type_node
, void_list_node
);
6769 local_define_builtin ("__builtin_profile_func_enter", ftype
,
6770 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
6771 local_define_builtin ("__builtin_profile_func_exit", ftype
,
6772 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
6774 /* Complex multiplication and division. These are handled as builtins
6775 rather than optabs because emit_library_call_value doesn't support
6776 complex. Further, we can do slightly better with folding these
6777 beasties if the real and complex parts of the arguments are separate. */
6779 enum machine_mode mode
;
6781 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
6783 char mode_name_buf
[4], *q
;
6785 enum built_in_function mcode
, dcode
;
6786 tree type
, inner_type
;
6788 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
6791 inner_type
= TREE_TYPE (type
);
6793 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
6794 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6795 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6796 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6797 ftype
= build_function_type (type
, tmp
);
6799 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
6800 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
6802 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
6806 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
6807 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
6808 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
6810 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
6811 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
6812 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
6817 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6820 If we requested a pointer to a vector, build up the pointers that
6821 we stripped off while looking for the inner type. Similarly for
6822 return values from functions.
6824 The argument TYPE is the top of the chain, and BOTTOM is the
6825 new type which we will point to. */
6828 reconstruct_complex_type (tree type
, tree bottom
)
6832 if (POINTER_TYPE_P (type
))
6834 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6835 outer
= build_pointer_type (inner
);
6837 else if (TREE_CODE (type
) == ARRAY_TYPE
)
6839 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6840 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
6842 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
6844 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6845 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
6847 else if (TREE_CODE (type
) == METHOD_TYPE
)
6850 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6851 /* The build_method_type_directly() routine prepends 'this' to argument list,
6852 so we must compensate by getting rid of it. */
6853 argtypes
= TYPE_ARG_TYPES (type
);
6854 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
6856 TYPE_ARG_TYPES (type
));
6857 TYPE_ARG_TYPES (outer
) = argtypes
;
6862 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
6863 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
6868 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6871 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
6875 switch (GET_MODE_CLASS (mode
))
6877 case MODE_VECTOR_INT
:
6878 case MODE_VECTOR_FLOAT
:
6879 nunits
= GET_MODE_NUNITS (mode
);
6883 /* Check that there are no leftover bits. */
6884 gcc_assert (GET_MODE_BITSIZE (mode
)
6885 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
6887 nunits
= GET_MODE_BITSIZE (mode
)
6888 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
6895 return make_vector_type (innertype
, nunits
, mode
);
6898 /* Similarly, but takes the inner type and number of units, which must be
6902 build_vector_type (tree innertype
, int nunits
)
6904 return make_vector_type (innertype
, nunits
, VOIDmode
);
6908 /* Build RESX_EXPR with given REGION_NUMBER. */
6910 build_resx (int region_number
)
6913 t
= build1 (RESX_EXPR
, void_type_node
,
6914 build_int_cst (NULL_TREE
, region_number
));
6918 /* Given an initializer INIT, return TRUE if INIT is zero or some
6919 aggregate of zeros. Otherwise return FALSE. */
6921 initializer_zerop (tree init
)
6927 switch (TREE_CODE (init
))
6930 return integer_zerop (init
);
6933 /* ??? Note that this is not correct for C4X float formats. There,
6934 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6935 negative exponent. */
6936 return real_zerop (init
)
6937 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
6940 return integer_zerop (init
)
6941 || (real_zerop (init
)
6942 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
6943 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
6946 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
6947 if (!initializer_zerop (TREE_VALUE (elt
)))
6953 unsigned HOST_WIDE_INT idx
;
6955 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
6956 if (!initializer_zerop (elt
))
6966 /* Build an empty statement. */
6969 build_empty_stmt (void)
6971 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
6975 /* Build an OpenMP clause with code CODE. */
6978 build_omp_clause (enum omp_clause_code code
)
6983 length
= omp_clause_num_ops
[code
];
6984 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
6986 t
= ggc_alloc (size
);
6987 memset (t
, 0, size
);
6988 TREE_SET_CODE (t
, OMP_CLAUSE
);
6989 OMP_CLAUSE_SET_CODE (t
, code
);
6991 #ifdef GATHER_STATISTICS
6992 tree_node_counts
[(int) omp_clause_kind
]++;
6993 tree_node_sizes
[(int) omp_clause_kind
] += size
;
7000 /* Returns true if it is possible to prove that the index of
7001 an array access REF (an ARRAY_REF expression) falls into the
7005 in_array_bounds_p (tree ref
)
7007 tree idx
= TREE_OPERAND (ref
, 1);
7010 if (TREE_CODE (idx
) != INTEGER_CST
)
7013 min
= array_ref_low_bound (ref
);
7014 max
= array_ref_up_bound (ref
);
7017 || TREE_CODE (min
) != INTEGER_CST
7018 || TREE_CODE (max
) != INTEGER_CST
)
7021 if (tree_int_cst_lt (idx
, min
)
7022 || tree_int_cst_lt (max
, idx
))
7028 /* Returns true if it is possible to prove that the range of
7029 an array access REF (an ARRAY_RANGE_REF expression) falls
7030 into the array bounds. */
7033 range_in_array_bounds_p (tree ref
)
7035 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
7036 tree range_min
, range_max
, min
, max
;
7038 range_min
= TYPE_MIN_VALUE (domain_type
);
7039 range_max
= TYPE_MAX_VALUE (domain_type
);
7042 || TREE_CODE (range_min
) != INTEGER_CST
7043 || TREE_CODE (range_max
) != INTEGER_CST
)
7046 min
= array_ref_low_bound (ref
);
7047 max
= array_ref_up_bound (ref
);
7050 || TREE_CODE (min
) != INTEGER_CST
7051 || TREE_CODE (max
) != INTEGER_CST
)
7054 if (tree_int_cst_lt (range_min
, min
)
7055 || tree_int_cst_lt (max
, range_max
))
7061 /* Return true if T (assumed to be a DECL) is a global variable. */
7064 is_global_var (tree t
)
7067 return (TREE_STATIC (t
) || MTAG_GLOBAL (t
));
7069 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
7072 /* Return true if T (assumed to be a DECL) must be assigned a memory
7076 needs_to_live_in_memory (tree t
)
7078 return (TREE_ADDRESSABLE (t
)
7079 || is_global_var (t
)
7080 || (TREE_CODE (t
) == RESULT_DECL
7081 && aggregate_value_p (t
, current_function_decl
)));
7084 /* There are situations in which a language considers record types
7085 compatible which have different field lists. Decide if two fields
7086 are compatible. It is assumed that the parent records are compatible. */
7089 fields_compatible_p (tree f1
, tree f2
)
7091 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
7092 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
7095 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
7096 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
7099 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
7105 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7108 find_compatible_field (tree record
, tree orig_field
)
7112 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
7113 if (TREE_CODE (f
) == FIELD_DECL
7114 && fields_compatible_p (f
, orig_field
))
7117 /* ??? Why isn't this on the main fields list? */
7118 f
= TYPE_VFIELD (record
);
7119 if (f
&& TREE_CODE (f
) == FIELD_DECL
7120 && fields_compatible_p (f
, orig_field
))
7123 /* ??? We should abort here, but Java appears to do Bad Things
7124 with inherited fields. */
7128 /* Return value of a constant X. */
7131 int_cst_value (tree x
)
7133 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
7134 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
7135 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
7137 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
7140 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
7142 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
7147 /* Returns the greatest common divisor of A and B, which must be
7151 tree_fold_gcd (tree a
, tree b
)
7154 tree type
= TREE_TYPE (a
);
7156 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
7157 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
7159 if (integer_zerop (a
))
7162 if (integer_zerop (b
))
7165 if (tree_int_cst_sgn (a
) == -1)
7166 a
= fold_build2 (MULT_EXPR
, type
, a
,
7167 build_int_cst (type
, -1));
7169 if (tree_int_cst_sgn (b
) == -1)
7170 b
= fold_build2 (MULT_EXPR
, type
, b
,
7171 build_int_cst (type
, -1));
7175 a_mod_b
= fold_build2 (FLOOR_MOD_EXPR
, type
, a
, b
);
7177 if (!TREE_INT_CST_LOW (a_mod_b
)
7178 && !TREE_INT_CST_HIGH (a_mod_b
))
7186 /* Returns unsigned variant of TYPE. */
7189 unsigned_type_for (tree type
)
7191 if (POINTER_TYPE_P (type
))
7192 return lang_hooks
.types
.unsigned_type (size_type_node
);
7193 return lang_hooks
.types
.unsigned_type (type
);
7196 /* Returns signed variant of TYPE. */
7199 signed_type_for (tree type
)
7201 if (POINTER_TYPE_P (type
))
7202 return lang_hooks
.types
.signed_type (size_type_node
);
7203 return lang_hooks
.types
.signed_type (type
);
7206 /* Returns the largest value obtainable by casting something in INNER type to
7210 upper_bound_in_type (tree outer
, tree inner
)
7212 unsigned HOST_WIDE_INT lo
, hi
;
7213 unsigned int det
= 0;
7214 unsigned oprec
= TYPE_PRECISION (outer
);
7215 unsigned iprec
= TYPE_PRECISION (inner
);
7218 /* Compute a unique number for every combination. */
7219 det
|= (oprec
> iprec
) ? 4 : 0;
7220 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
7221 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
7223 /* Determine the exponent to use. */
7228 /* oprec <= iprec, outer: signed, inner: don't care. */
7233 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7237 /* oprec > iprec, outer: signed, inner: signed. */
7241 /* oprec > iprec, outer: signed, inner: unsigned. */
7245 /* oprec > iprec, outer: unsigned, inner: signed. */
7249 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7256 /* Compute 2^^prec - 1. */
7257 if (prec
<= HOST_BITS_PER_WIDE_INT
)
7260 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
7261 >> (HOST_BITS_PER_WIDE_INT
- prec
));
7265 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
7266 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
7267 lo
= ~(unsigned HOST_WIDE_INT
) 0;
7270 return build_int_cst_wide (outer
, lo
, hi
);
7273 /* Returns the smallest value obtainable by casting something in INNER type to
7277 lower_bound_in_type (tree outer
, tree inner
)
7279 unsigned HOST_WIDE_INT lo
, hi
;
7280 unsigned oprec
= TYPE_PRECISION (outer
);
7281 unsigned iprec
= TYPE_PRECISION (inner
);
7283 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7285 if (TYPE_UNSIGNED (outer
)
7286 /* If we are widening something of an unsigned type, OUTER type
7287 contains all values of INNER type. In particular, both INNER
7288 and OUTER types have zero in common. */
7289 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
7293 /* If we are widening a signed type to another signed type, we
7294 want to obtain -2^^(iprec-1). If we are keeping the
7295 precision or narrowing to a signed type, we want to obtain
7297 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
7299 if (prec
<= HOST_BITS_PER_WIDE_INT
)
7301 hi
= ~(unsigned HOST_WIDE_INT
) 0;
7302 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
7306 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
7307 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
7312 return build_int_cst_wide (outer
, lo
, hi
);
7315 /* Return nonzero if two operands that are suitable for PHI nodes are
7316 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7317 SSA_NAME or invariant. Note that this is strictly an optimization.
7318 That is, callers of this function can directly call operand_equal_p
7319 and get the same result, only slower. */
7322 operand_equal_for_phi_arg_p (tree arg0
, tree arg1
)
7326 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
7328 return operand_equal_p (arg0
, arg1
, 0);
7331 /* Returns number of zeros at the end of binary representation of X.
7333 ??? Use ffs if available? */
7336 num_ending_zeros (tree x
)
7338 unsigned HOST_WIDE_INT fr
, nfr
;
7339 unsigned num
, abits
;
7340 tree type
= TREE_TYPE (x
);
7342 if (TREE_INT_CST_LOW (x
) == 0)
7344 num
= HOST_BITS_PER_WIDE_INT
;
7345 fr
= TREE_INT_CST_HIGH (x
);
7350 fr
= TREE_INT_CST_LOW (x
);
7353 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
7356 if (nfr
<< abits
== fr
)
7363 if (num
> TYPE_PRECISION (type
))
7364 num
= TYPE_PRECISION (type
);
7366 return build_int_cst_type (type
, num
);
7370 #define WALK_SUBTREE(NODE) \
7373 result = walk_tree (&(NODE), func, data, pset); \
7379 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7380 be walked whenever a type is seen in the tree. Rest of operands and return
7381 value are as for walk_tree. */
7384 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
7385 struct pointer_set_t
*pset
)
7387 tree result
= NULL_TREE
;
7389 switch (TREE_CODE (type
))
7392 case REFERENCE_TYPE
:
7393 /* We have to worry about mutually recursive pointers. These can't
7394 be written in C. They can in Ada. It's pathological, but
7395 there's an ACATS test (c38102a) that checks it. Deal with this
7396 by checking if we're pointing to another pointer, that one
7397 points to another pointer, that one does too, and we have no htab.
7398 If so, get a hash table. We check three levels deep to avoid
7399 the cost of the hash table if we don't need one. */
7400 if (POINTER_TYPE_P (TREE_TYPE (type
))
7401 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
7402 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
7405 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
7413 /* ... fall through ... */
7416 WALK_SUBTREE (TREE_TYPE (type
));
7420 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
7425 WALK_SUBTREE (TREE_TYPE (type
));
7429 /* We never want to walk into default arguments. */
7430 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
7431 WALK_SUBTREE (TREE_VALUE (arg
));
7436 /* Don't follow this nodes's type if a pointer for fear that
7437 we'll have infinite recursion. If we have a PSET, then we
7440 || (!POINTER_TYPE_P (TREE_TYPE (type
))
7441 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
7442 WALK_SUBTREE (TREE_TYPE (type
));
7443 WALK_SUBTREE (TYPE_DOMAIN (type
));
7450 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
7451 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
7455 WALK_SUBTREE (TREE_TYPE (type
));
7456 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
7466 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7467 called with the DATA and the address of each sub-tree. If FUNC returns a
7468 non-NULL value, the traversal is stopped, and the value returned by FUNC
7469 is returned. If PSET is non-NULL it is used to record the nodes visited,
7470 and to avoid visiting a node more than once. */
7473 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
7475 enum tree_code code
;
7479 #define WALK_SUBTREE_TAIL(NODE) \
7483 goto tail_recurse; \
7488 /* Skip empty subtrees. */
7492 /* Don't walk the same tree twice, if the user has requested
7493 that we avoid doing so. */
7494 if (pset
&& pointer_set_insert (pset
, *tp
))
7497 /* Call the function. */
7499 result
= (*func
) (tp
, &walk_subtrees
, data
);
7501 /* If we found something, return it. */
7505 code
= TREE_CODE (*tp
);
7507 /* Even if we didn't, FUNC may have decided that there was nothing
7508 interesting below this point in the tree. */
7511 /* But we still need to check our siblings. */
7512 if (code
== TREE_LIST
)
7513 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
7514 else if (code
== OMP_CLAUSE
)
7515 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7520 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
7522 if (result
|| ! walk_subtrees
)
7528 case IDENTIFIER_NODE
:
7534 case PLACEHOLDER_EXPR
:
7538 /* None of these have subtrees other than those already walked
7543 WALK_SUBTREE (TREE_VALUE (*tp
));
7544 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
7549 int len
= TREE_VEC_LENGTH (*tp
);
7554 /* Walk all elements but the first. */
7556 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
7558 /* Now walk the first one as a tail call. */
7559 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
7563 WALK_SUBTREE (TREE_REALPART (*tp
));
7564 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
7568 unsigned HOST_WIDE_INT idx
;
7569 constructor_elt
*ce
;
7572 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
7574 WALK_SUBTREE (ce
->value
);
7579 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
7584 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
7586 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7587 into declarations that are just mentioned, rather than
7588 declared; they don't really belong to this part of the tree.
7589 And, we can see cycles: the initializer for a declaration
7590 can refer to the declaration itself. */
7591 WALK_SUBTREE (DECL_INITIAL (decl
));
7592 WALK_SUBTREE (DECL_SIZE (decl
));
7593 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
7595 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
7598 case STATEMENT_LIST
:
7600 tree_stmt_iterator i
;
7601 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
7602 WALK_SUBTREE (*tsi_stmt_ptr (i
));
7607 switch (OMP_CLAUSE_CODE (*tp
))
7609 case OMP_CLAUSE_PRIVATE
:
7610 case OMP_CLAUSE_SHARED
:
7611 case OMP_CLAUSE_FIRSTPRIVATE
:
7612 case OMP_CLAUSE_LASTPRIVATE
:
7613 case OMP_CLAUSE_COPYIN
:
7614 case OMP_CLAUSE_COPYPRIVATE
:
7616 case OMP_CLAUSE_NUM_THREADS
:
7617 case OMP_CLAUSE_SCHEDULE
:
7618 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
7621 case OMP_CLAUSE_NOWAIT
:
7622 case OMP_CLAUSE_ORDERED
:
7623 case OMP_CLAUSE_DEFAULT
:
7624 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7626 case OMP_CLAUSE_REDUCTION
:
7629 for (i
= 0; i
< 4; i
++)
7630 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
7631 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7643 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7644 But, we only want to walk once. */
7645 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
7646 for (i
= 0; i
< len
; ++i
)
7647 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
7648 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
7652 /* Walk into various fields of the type that it's defining. We only
7653 want to walk into these fields of a type in this case. Note that
7654 decls get walked as part of the processing of a BIND_EXPR.
7656 ??? Precisely which fields of types that we are supposed to walk in
7657 this case vs. the normal case aren't well defined. */
7658 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
7659 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
7661 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
7663 /* Call the function for the type. See if it returns anything or
7664 doesn't want us to continue. If we are to continue, walk both
7665 the normal fields and those for the declaration case. */
7666 result
= (*func
) (type_p
, &walk_subtrees
, data
);
7667 if (result
|| !walk_subtrees
)
7670 result
= walk_type_fields (*type_p
, func
, data
, pset
);
7674 /* If this is a record type, also walk the fields. */
7675 if (TREE_CODE (*type_p
) == RECORD_TYPE
7676 || TREE_CODE (*type_p
) == UNION_TYPE
7677 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
7681 for (field
= TYPE_FIELDS (*type_p
); field
;
7682 field
= TREE_CHAIN (field
))
7684 /* We'd like to look at the type of the field, but we can
7685 easily get infinite recursion. So assume it's pointed
7686 to elsewhere in the tree. Also, ignore things that
7688 if (TREE_CODE (field
) != FIELD_DECL
)
7691 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
7692 WALK_SUBTREE (DECL_SIZE (field
));
7693 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
7694 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
7695 WALK_SUBTREE (DECL_QUALIFIER (field
));
7699 WALK_SUBTREE (TYPE_SIZE (*type_p
));
7700 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
7705 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
7709 /* Walk over all the sub-trees of this operand. */
7710 len
= TREE_CODE_LENGTH (code
);
7712 /* Go through the subtrees. We need to do this in forward order so
7713 that the scope of a FOR_EXPR is handled properly. */
7716 for (i
= 0; i
< len
- 1; ++i
)
7717 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
7718 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
7722 /* If this is a type, walk the needed fields in the type. */
7723 else if (TYPE_P (*tp
))
7724 return walk_type_fields (*tp
, func
, data
, pset
);
7728 /* We didn't find what we were looking for. */
7731 #undef WALK_SUBTREE_TAIL
7735 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7738 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
7741 struct pointer_set_t
*pset
;
7743 pset
= pointer_set_create ();
7744 result
= walk_tree (tp
, func
, data
, pset
);
7745 pointer_set_destroy (pset
);
7750 /* Return true if STMT is an empty statement or contains nothing but
7751 empty statements. */
7754 empty_body_p (tree stmt
)
7756 tree_stmt_iterator i
;
7759 if (IS_EMPTY_STMT (stmt
))
7761 else if (TREE_CODE (stmt
) == BIND_EXPR
)
7762 body
= BIND_EXPR_BODY (stmt
);
7763 else if (TREE_CODE (stmt
) == STATEMENT_LIST
)
7768 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
7769 if (!empty_body_p (tsi_stmt (i
)))
7775 #include "gt-tree.h"