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 2, 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 COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
23 /* This file contains the low level primitives for operating on tree nodes,
24 including allocation, list operations, interning of identifiers,
25 construction of data type nodes and statement nodes,
26 and construction of type conversion nodes. It also contains
27 tables index by tree code that describe how to take apart
30 It is intended to be language-independent, but occasionally
31 calls language-dependent routines defined (for C) in typecheck.c. */
35 #include "coretypes.h"
48 #include "langhooks.h"
49 #include "tree-iterator.h"
50 #include "basic-block.h"
51 #include "tree-flow.h"
53 #include "pointer-set.h"
55 /* Each tree code class has an associated string representation.
56 These must correspond to the tree_code_class entries. */
58 const char *const tree_code_class_strings
[] =
72 /* obstack.[ch] explicitly declined to prototype this. */
73 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
75 #ifdef GATHER_STATISTICS
76 /* Statistics-gathering stuff. */
78 int tree_node_counts
[(int) all_kinds
];
79 int tree_node_sizes
[(int) all_kinds
];
81 /* Keep in sync with tree.h:enum tree_node_kind. */
82 static const char * const tree_node_kind_names
[] = {
103 #endif /* GATHER_STATISTICS */
105 /* Unique id for next decl created. */
106 static GTY(()) int next_decl_uid
;
107 /* Unique id for next type created. */
108 static GTY(()) int next_type_uid
= 1;
110 /* Since we cannot rehash a type after it is in the table, we have to
111 keep the hash code. */
113 struct type_hash
GTY(())
119 /* Initial size of the hash table (rounded to next prime). */
120 #define TYPE_HASH_INITIAL_SIZE 1000
122 /* Now here is the hash table. When recording a type, it is added to
123 the slot whose index is the hash code. Note that the hash table is
124 used for several kinds of types (function types, array types and
125 array index range types, for now). While all these live in the
126 same table, they are completely independent, and the hash code is
127 computed differently for each of these. */
129 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
130 htab_t type_hash_table
;
132 /* Hash table and temporary node for larger integer const values. */
133 static GTY (()) tree int_cst_node
;
134 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
135 htab_t int_cst_hash_table
;
137 /* General tree->tree mapping structure for use in hash tables. */
140 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
141 htab_t debug_expr_for_decl
;
143 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
144 htab_t value_expr_for_decl
;
146 static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map
)))
147 htab_t init_priority_for_decl
;
149 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
150 htab_t restrict_base_for_decl
;
152 struct tree_int_map
GTY(())
157 static unsigned int tree_int_map_hash (const void *);
158 static int tree_int_map_eq (const void *, const void *);
159 static int tree_int_map_marked_p (const void *);
160 static void set_type_quals (tree
, int);
161 static int type_hash_eq (const void *, const void *);
162 static hashval_t
type_hash_hash (const void *);
163 static hashval_t
int_cst_hash_hash (const void *);
164 static int int_cst_hash_eq (const void *, const void *);
165 static void print_type_hash_statistics (void);
166 static void print_debug_expr_statistics (void);
167 static void print_value_expr_statistics (void);
168 static tree
make_vector_type (tree
, int, enum machine_mode
);
169 static int type_hash_marked_p (const void *);
170 static unsigned int type_hash_list (tree
, hashval_t
);
171 static unsigned int attribute_hash_list (tree
, hashval_t
);
173 tree global_trees
[TI_MAX
];
174 tree integer_types
[itk_none
];
176 unsigned char tree_contains_struct
[256][64];
178 /* Number of operands for each OpenMP clause. */
179 unsigned const char omp_clause_num_ops
[] =
181 0, /* OMP_CLAUSE_ERROR */
182 1, /* OMP_CLAUSE_PRIVATE */
183 1, /* OMP_CLAUSE_SHARED */
184 1, /* OMP_CLAUSE_FIRSTPRIVATE */
185 1, /* OMP_CLAUSE_LASTPRIVATE */
186 4, /* OMP_CLAUSE_REDUCTION */
187 1, /* OMP_CLAUSE_COPYIN */
188 1, /* OMP_CLAUSE_COPYPRIVATE */
189 1, /* OMP_CLAUSE_IF */
190 1, /* OMP_CLAUSE_NUM_THREADS */
191 1, /* OMP_CLAUSE_SCHEDULE */
192 0, /* OMP_CLAUSE_NOWAIT */
193 0, /* OMP_CLAUSE_ORDERED */
194 0 /* OMP_CLAUSE_DEFAULT */
197 const char * const omp_clause_code_name
[] =
220 /* Initialize the hash table of types. */
221 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
224 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
227 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
229 init_priority_for_decl
= htab_create_ggc (512, tree_int_map_hash
,
231 restrict_base_for_decl
= htab_create_ggc (256, tree_map_hash
,
234 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
235 int_cst_hash_eq
, NULL
);
237 int_cst_node
= make_node (INTEGER_CST
);
239 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
] = 1;
240 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
] = 1;
241 tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
] = 1;
244 tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
] = 1;
245 tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
] = 1;
246 tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
] = 1;
247 tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
] = 1;
248 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
] = 1;
249 tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
] = 1;
250 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
] = 1;
251 tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
] = 1;
252 tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
] = 1;
255 tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
] = 1;
256 tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
] = 1;
257 tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
] = 1;
258 tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
] = 1;
259 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
] = 1;
260 tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
] = 1;
262 tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
] = 1;
263 tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
] = 1;
264 tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
] = 1;
265 tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
] = 1;
266 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
] = 1;
267 tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
] = 1;
268 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
] = 1;
269 tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
] = 1;
270 tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
] = 1;
271 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_DECL_MINIMAL
] = 1;
272 tree_contains_struct
[NAME_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
273 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
275 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_MEMORY_TAG
] = 1;
276 tree_contains_struct
[NAME_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
277 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
279 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_STRUCT_FIELD_TAG
] = 1;
281 tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
] = 1;
282 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
] = 1;
283 tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
] = 1;
284 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
] = 1;
286 tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
] = 1;
287 tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
] = 1;
288 tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
] = 1;
289 tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
] = 1;
290 tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
] = 1;
291 tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
] = 1;
292 tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
] = 1;
293 tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
] = 1;
295 lang_hooks
.init_ts ();
299 /* The name of the object as the assembler will see it (but before any
300 translations made by ASM_OUTPUT_LABELREF). Often this is the same
301 as DECL_NAME. It is an IDENTIFIER_NODE. */
303 decl_assembler_name (tree decl
)
305 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
306 lang_hooks
.set_decl_assembler_name (decl
);
307 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
310 /* Compute the number of bytes occupied by a tree with code CODE.
311 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
312 codes, which are of variable length. */
314 tree_code_size (enum tree_code code
)
316 switch (TREE_CODE_CLASS (code
))
318 case tcc_declaration
: /* A decl node */
323 return sizeof (struct tree_field_decl
);
325 return sizeof (struct tree_parm_decl
);
327 return sizeof (struct tree_var_decl
);
329 return sizeof (struct tree_label_decl
);
331 return sizeof (struct tree_result_decl
);
333 return sizeof (struct tree_const_decl
);
335 return sizeof (struct tree_type_decl
);
337 return sizeof (struct tree_function_decl
);
338 case NAME_MEMORY_TAG
:
339 case SYMBOL_MEMORY_TAG
:
340 return sizeof (struct tree_memory_tag
);
341 case STRUCT_FIELD_TAG
:
342 return sizeof (struct tree_struct_field_tag
);
344 return sizeof (struct tree_decl_non_common
);
348 case tcc_type
: /* a type node */
349 return sizeof (struct tree_type
);
351 case tcc_reference
: /* a reference */
352 case tcc_expression
: /* an expression */
353 case tcc_statement
: /* an expression with side effects */
354 case tcc_comparison
: /* a comparison expression */
355 case tcc_unary
: /* a unary arithmetic expression */
356 case tcc_binary
: /* a binary arithmetic expression */
357 return (sizeof (struct tree_exp
)
358 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
360 case tcc_constant
: /* a constant */
363 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
364 case REAL_CST
: return sizeof (struct tree_real_cst
);
365 case COMPLEX_CST
: return sizeof (struct tree_complex
);
366 case VECTOR_CST
: return sizeof (struct tree_vector
);
367 case STRING_CST
: gcc_unreachable ();
369 return lang_hooks
.tree_size (code
);
372 case tcc_exceptional
: /* something random, like an identifier. */
375 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
376 case TREE_LIST
: return sizeof (struct tree_list
);
379 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
383 case PHI_NODE
: gcc_unreachable ();
385 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
387 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
388 case BLOCK
: return sizeof (struct tree_block
);
389 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
390 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
393 return lang_hooks
.tree_size (code
);
401 /* Compute the number of bytes occupied by NODE. This routine only
402 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
404 tree_size (tree node
)
406 enum tree_code code
= TREE_CODE (node
);
410 return (sizeof (struct tree_phi_node
)
411 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
414 return (offsetof (struct tree_binfo
, base_binfos
)
415 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
418 return (sizeof (struct tree_vec
)
419 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
422 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
425 return (sizeof (struct tree_omp_clause
)
426 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
430 return tree_code_size (code
);
434 /* Return a newly allocated node of code CODE. For decl and type
435 nodes, some other fields are initialized. The rest of the node is
436 initialized to zero. This function cannot be used for PHI_NODE,
437 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
440 Achoo! I got a code in the node. */
443 make_node_stat (enum tree_code code MEM_STAT_DECL
)
446 enum tree_code_class type
= TREE_CODE_CLASS (code
);
447 size_t length
= tree_code_size (code
);
448 #ifdef GATHER_STATISTICS
453 case tcc_declaration
: /* A decl node */
457 case tcc_type
: /* a type node */
461 case tcc_statement
: /* an expression with side effects */
465 case tcc_reference
: /* a reference */
469 case tcc_expression
: /* an expression */
470 case tcc_comparison
: /* a comparison expression */
471 case tcc_unary
: /* a unary arithmetic expression */
472 case tcc_binary
: /* a binary arithmetic expression */
476 case tcc_constant
: /* a constant */
480 case tcc_exceptional
: /* something random, like an identifier. */
483 case IDENTIFIER_NODE
:
500 kind
= ssa_name_kind
;
521 tree_node_counts
[(int) kind
]++;
522 tree_node_sizes
[(int) kind
] += length
;
525 if (code
== IDENTIFIER_NODE
)
526 t
= ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
528 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
530 memset (t
, 0, length
);
532 TREE_SET_CODE (t
, code
);
537 TREE_SIDE_EFFECTS (t
) = 1;
540 case tcc_declaration
:
541 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WITH_VIS
))
542 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
543 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
545 if (code
!= FUNCTION_DECL
)
547 DECL_USER_ALIGN (t
) = 0;
548 /* We have not yet computed the alias set for this declaration. */
549 DECL_POINTER_ALIAS_SET (t
) = -1;
551 DECL_SOURCE_LOCATION (t
) = input_location
;
552 DECL_UID (t
) = next_decl_uid
++;
557 TYPE_UID (t
) = next_type_uid
++;
558 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
559 TYPE_USER_ALIGN (t
) = 0;
560 TYPE_MAIN_VARIANT (t
) = t
;
562 /* Default to no attributes for type, but let target change that. */
563 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
564 targetm
.set_default_type_attributes (t
);
566 /* We have not yet computed the alias set for this type. */
567 TYPE_ALIAS_SET (t
) = -1;
571 TREE_CONSTANT (t
) = 1;
572 TREE_INVARIANT (t
) = 1;
581 case PREDECREMENT_EXPR
:
582 case PREINCREMENT_EXPR
:
583 case POSTDECREMENT_EXPR
:
584 case POSTINCREMENT_EXPR
:
585 /* All of these have side-effects, no matter what their
587 TREE_SIDE_EFFECTS (t
) = 1;
596 /* Other classes need no special treatment. */
603 /* Return a new node with the same contents as NODE except that its
604 TREE_CHAIN is zero and it has a fresh uid. */
607 copy_node_stat (tree node MEM_STAT_DECL
)
610 enum tree_code code
= TREE_CODE (node
);
613 gcc_assert (code
!= STATEMENT_LIST
);
615 length
= tree_size (node
);
616 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
617 memcpy (t
, node
, length
);
620 TREE_ASM_WRITTEN (t
) = 0;
621 TREE_VISITED (t
) = 0;
624 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
626 DECL_UID (t
) = next_decl_uid
++;
627 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
628 && DECL_HAS_VALUE_EXPR_P (node
))
630 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
631 DECL_HAS_VALUE_EXPR_P (t
) = 1;
633 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
635 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
636 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
638 if (TREE_CODE (node
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (node
))
640 SET_DECL_RESTRICT_BASE (t
, DECL_GET_RESTRICT_BASE (node
));
641 DECL_BASED_ON_RESTRICT_P (t
) = 1;
644 else if (TREE_CODE_CLASS (code
) == tcc_type
)
646 TYPE_UID (t
) = next_type_uid
++;
647 /* The following is so that the debug code for
648 the copy is different from the original type.
649 The two statements usually duplicate each other
650 (because they clear fields of the same union),
651 but the optimizer should catch that. */
652 TYPE_SYMTAB_POINTER (t
) = 0;
653 TYPE_SYMTAB_ADDRESS (t
) = 0;
655 /* Do not copy the values cache. */
656 if (TYPE_CACHED_VALUES_P(t
))
658 TYPE_CACHED_VALUES_P (t
) = 0;
659 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
666 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
667 For example, this can copy a list made of TREE_LIST nodes. */
670 copy_list (tree list
)
678 head
= prev
= copy_node (list
);
679 next
= TREE_CHAIN (list
);
682 TREE_CHAIN (prev
) = copy_node (next
);
683 prev
= TREE_CHAIN (prev
);
684 next
= TREE_CHAIN (next
);
690 /* Create an INT_CST node with a LOW value sign extended. */
693 build_int_cst (tree type
, HOST_WIDE_INT low
)
695 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
698 /* Create an INT_CST node with a LOW value zero extended. */
701 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
703 return build_int_cst_wide (type
, low
, 0);
706 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
707 if it is negative. This function is similar to build_int_cst, but
708 the extra bits outside of the type precision are cleared. Constants
709 with these extra bits may confuse the fold so that it detects overflows
710 even in cases when they do not occur, and in general should be avoided.
711 We cannot however make this a default behavior of build_int_cst without
712 more intrusive changes, since there are parts of gcc that rely on the extra
713 precision of the integer constants. */
716 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
718 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
719 unsigned HOST_WIDE_INT hi
, mask
;
725 type
= integer_type_node
;
727 bits
= TYPE_PRECISION (type
);
728 signed_p
= !TYPE_UNSIGNED (type
);
730 if (bits
>= HOST_BITS_PER_WIDE_INT
)
731 negative
= (low
< 0);
734 /* If the sign bit is inside precision of LOW, use it to determine
735 the sign of the constant. */
736 negative
= ((val
>> (bits
- 1)) & 1) != 0;
738 /* Mask out the bits outside of the precision of the constant. */
739 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
741 if (signed_p
&& negative
)
747 /* Determine the high bits. */
748 hi
= (negative
? ~(unsigned HOST_WIDE_INT
) 0 : 0);
750 /* For unsigned type we need to mask out the bits outside of the type
754 if (bits
<= HOST_BITS_PER_WIDE_INT
)
758 bits
-= HOST_BITS_PER_WIDE_INT
;
759 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
764 return build_int_cst_wide (type
, val
, hi
);
767 /* These are the hash table functions for the hash table of INTEGER_CST
768 nodes of a sizetype. */
770 /* Return the hash code code X, an INTEGER_CST. */
773 int_cst_hash_hash (const void *x
)
777 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
778 ^ htab_hash_pointer (TREE_TYPE (t
)));
781 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
782 is the same as that given by *Y, which is the same. */
785 int_cst_hash_eq (const void *x
, const void *y
)
790 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
791 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
792 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
795 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
796 integer_type_node is used. The returned node is always shared.
797 For small integers we use a per-type vector cache, for larger ones
798 we use a single hash table. */
801 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
808 type
= integer_type_node
;
810 switch (TREE_CODE (type
))
814 /* Cache NULL pointer. */
823 /* Cache false or true. */
831 if (TYPE_UNSIGNED (type
))
834 limit
= INTEGER_SHARE_LIMIT
;
835 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
841 limit
= INTEGER_SHARE_LIMIT
+ 1;
842 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
844 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
854 /* Look for it in the type's vector of small shared ints. */
855 if (!TYPE_CACHED_VALUES_P (type
))
857 TYPE_CACHED_VALUES_P (type
) = 1;
858 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
861 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
864 /* Make sure no one is clobbering the shared constant. */
865 gcc_assert (TREE_TYPE (t
) == type
);
866 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
867 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
871 /* Create a new shared int. */
872 t
= make_node (INTEGER_CST
);
874 TREE_INT_CST_LOW (t
) = low
;
875 TREE_INT_CST_HIGH (t
) = hi
;
876 TREE_TYPE (t
) = type
;
878 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
883 /* Use the cache of larger shared ints. */
886 TREE_INT_CST_LOW (int_cst_node
) = low
;
887 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
888 TREE_TYPE (int_cst_node
) = type
;
890 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
894 /* Insert this one into the hash table. */
897 /* Make a new node for next time round. */
898 int_cst_node
= make_node (INTEGER_CST
);
905 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
906 and the rest are zeros. */
909 build_low_bits_mask (tree type
, unsigned bits
)
911 unsigned HOST_WIDE_INT low
;
913 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
915 gcc_assert (bits
<= TYPE_PRECISION (type
));
917 if (bits
== TYPE_PRECISION (type
)
918 && !TYPE_UNSIGNED (type
))
920 /* Sign extended all-ones mask. */
924 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
926 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
931 bits
-= HOST_BITS_PER_WIDE_INT
;
933 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
936 return build_int_cst_wide (type
, low
, high
);
939 /* Checks that X is integer constant that can be expressed in (unsigned)
940 HOST_WIDE_INT without loss of precision. */
943 cst_and_fits_in_hwi (tree x
)
945 if (TREE_CODE (x
) != INTEGER_CST
)
948 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
951 return (TREE_INT_CST_HIGH (x
) == 0
952 || TREE_INT_CST_HIGH (x
) == -1);
955 /* Return a new VECTOR_CST node whose type is TYPE and whose values
956 are in a list pointed to by VALS. */
959 build_vector (tree type
, tree vals
)
961 tree v
= make_node (VECTOR_CST
);
962 int over1
= 0, over2
= 0;
965 TREE_VECTOR_CST_ELTS (v
) = vals
;
966 TREE_TYPE (v
) = type
;
968 /* Iterate through elements and check for overflow. */
969 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
971 tree value
= TREE_VALUE (link
);
973 over1
|= TREE_OVERFLOW (value
);
974 over2
|= TREE_CONSTANT_OVERFLOW (value
);
977 TREE_OVERFLOW (v
) = over1
;
978 TREE_CONSTANT_OVERFLOW (v
) = over2
;
983 /* Return a new VECTOR_CST node whose type is TYPE and whose values
984 are extracted from V, a vector of CONSTRUCTOR_ELT. */
987 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
989 tree list
= NULL_TREE
;
990 unsigned HOST_WIDE_INT idx
;
993 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
994 list
= tree_cons (NULL_TREE
, value
, list
);
995 return build_vector (type
, nreverse (list
));
998 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
999 are in the VEC pointed to by VALS. */
1001 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1003 tree c
= make_node (CONSTRUCTOR
);
1004 TREE_TYPE (c
) = type
;
1005 CONSTRUCTOR_ELTS (c
) = vals
;
1009 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1012 build_constructor_single (tree type
, tree index
, tree value
)
1014 VEC(constructor_elt
,gc
) *v
;
1015 constructor_elt
*elt
;
1018 v
= VEC_alloc (constructor_elt
, gc
, 1);
1019 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1023 t
= build_constructor (type
, v
);
1024 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1029 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1030 are in a list pointed to by VALS. */
1032 build_constructor_from_list (tree type
, tree vals
)
1035 VEC(constructor_elt
,gc
) *v
= NULL
;
1036 bool constant_p
= true;
1040 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1041 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1043 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1044 val
= TREE_VALUE (t
);
1045 elt
->index
= TREE_PURPOSE (t
);
1047 if (!TREE_CONSTANT (val
))
1052 t
= build_constructor (type
, v
);
1053 TREE_CONSTANT (t
) = constant_p
;
1058 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1061 build_real (tree type
, REAL_VALUE_TYPE d
)
1064 REAL_VALUE_TYPE
*dp
;
1067 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1068 Consider doing it via real_convert now. */
1070 v
= make_node (REAL_CST
);
1071 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
1072 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1074 TREE_TYPE (v
) = type
;
1075 TREE_REAL_CST_PTR (v
) = dp
;
1076 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1080 /* Return a new REAL_CST node whose type is TYPE
1081 and whose value is the integer value of the INTEGER_CST node I. */
1084 real_value_from_int_cst (tree type
, tree i
)
1088 /* Clear all bits of the real value type so that we can later do
1089 bitwise comparisons to see if two values are the same. */
1090 memset (&d
, 0, sizeof d
);
1092 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1093 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1094 TYPE_UNSIGNED (TREE_TYPE (i
)));
1098 /* Given a tree representing an integer constant I, return a tree
1099 representing the same value as a floating-point constant of type TYPE. */
1102 build_real_from_int_cst (tree type
, tree i
)
1105 int overflow
= TREE_OVERFLOW (i
);
1107 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1109 TREE_OVERFLOW (v
) |= overflow
;
1110 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
1114 /* Return a newly constructed STRING_CST node whose value is
1115 the LEN characters at STR.
1116 The TREE_TYPE is not initialized. */
1119 build_string (int len
, const char *str
)
1124 /* Do not waste bytes provided by padding of struct tree_string. */
1125 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1127 #ifdef GATHER_STATISTICS
1128 tree_node_counts
[(int) c_kind
]++;
1129 tree_node_sizes
[(int) c_kind
] += length
;
1132 s
= ggc_alloc_tree (length
);
1134 memset (s
, 0, sizeof (struct tree_common
));
1135 TREE_SET_CODE (s
, STRING_CST
);
1136 TREE_CONSTANT (s
) = 1;
1137 TREE_INVARIANT (s
) = 1;
1138 TREE_STRING_LENGTH (s
) = len
;
1139 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
1140 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
1145 /* Return a newly constructed COMPLEX_CST node whose value is
1146 specified by the real and imaginary parts REAL and IMAG.
1147 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1148 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1151 build_complex (tree type
, tree real
, tree imag
)
1153 tree t
= make_node (COMPLEX_CST
);
1155 TREE_REALPART (t
) = real
;
1156 TREE_IMAGPART (t
) = imag
;
1157 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1158 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1159 TREE_CONSTANT_OVERFLOW (t
)
1160 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1164 /* Build a BINFO with LEN language slots. */
1167 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1170 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1171 + VEC_embedded_size (tree
, base_binfos
));
1173 #ifdef GATHER_STATISTICS
1174 tree_node_counts
[(int) binfo_kind
]++;
1175 tree_node_sizes
[(int) binfo_kind
] += length
;
1178 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1180 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1182 TREE_SET_CODE (t
, TREE_BINFO
);
1184 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1190 /* Build a newly constructed TREE_VEC node of length LEN. */
1193 make_tree_vec_stat (int len MEM_STAT_DECL
)
1196 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1198 #ifdef GATHER_STATISTICS
1199 tree_node_counts
[(int) vec_kind
]++;
1200 tree_node_sizes
[(int) vec_kind
] += length
;
1203 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1205 memset (t
, 0, length
);
1207 TREE_SET_CODE (t
, TREE_VEC
);
1208 TREE_VEC_LENGTH (t
) = len
;
1213 /* Return 1 if EXPR is the integer constant zero or a complex constant
1217 integer_zerop (tree expr
)
1221 return ((TREE_CODE (expr
) == INTEGER_CST
1222 && TREE_INT_CST_LOW (expr
) == 0
1223 && TREE_INT_CST_HIGH (expr
) == 0)
1224 || (TREE_CODE (expr
) == COMPLEX_CST
1225 && integer_zerop (TREE_REALPART (expr
))
1226 && integer_zerop (TREE_IMAGPART (expr
))));
1229 /* Return 1 if EXPR is the integer constant one or the corresponding
1230 complex constant. */
1233 integer_onep (tree expr
)
1237 return ((TREE_CODE (expr
) == INTEGER_CST
1238 && TREE_INT_CST_LOW (expr
) == 1
1239 && TREE_INT_CST_HIGH (expr
) == 0)
1240 || (TREE_CODE (expr
) == COMPLEX_CST
1241 && integer_onep (TREE_REALPART (expr
))
1242 && integer_zerop (TREE_IMAGPART (expr
))));
1245 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1246 it contains. Likewise for the corresponding complex constant. */
1249 integer_all_onesp (tree expr
)
1256 if (TREE_CODE (expr
) == COMPLEX_CST
1257 && integer_all_onesp (TREE_REALPART (expr
))
1258 && integer_zerop (TREE_IMAGPART (expr
)))
1261 else if (TREE_CODE (expr
) != INTEGER_CST
)
1264 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1265 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1266 && TREE_INT_CST_HIGH (expr
) == -1)
1271 /* Note that using TYPE_PRECISION here is wrong. We care about the
1272 actual bits, not the (arbitrary) range of the type. */
1273 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1274 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1276 HOST_WIDE_INT high_value
;
1279 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1281 /* Can not handle precisions greater than twice the host int size. */
1282 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1283 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1284 /* Shifting by the host word size is undefined according to the ANSI
1285 standard, so we must handle this as a special case. */
1288 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1290 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1291 && TREE_INT_CST_HIGH (expr
) == high_value
);
1294 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1297 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1301 integer_pow2p (tree expr
)
1304 HOST_WIDE_INT high
, low
;
1308 if (TREE_CODE (expr
) == COMPLEX_CST
1309 && integer_pow2p (TREE_REALPART (expr
))
1310 && integer_zerop (TREE_IMAGPART (expr
)))
1313 if (TREE_CODE (expr
) != INTEGER_CST
)
1316 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1317 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1318 high
= TREE_INT_CST_HIGH (expr
);
1319 low
= TREE_INT_CST_LOW (expr
);
1321 /* First clear all bits that are beyond the type's precision in case
1322 we've been sign extended. */
1324 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1326 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1327 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1331 if (prec
< HOST_BITS_PER_WIDE_INT
)
1332 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1335 if (high
== 0 && low
== 0)
1338 return ((high
== 0 && (low
& (low
- 1)) == 0)
1339 || (low
== 0 && (high
& (high
- 1)) == 0));
1342 /* Return 1 if EXPR is an integer constant other than zero or a
1343 complex constant other than zero. */
1346 integer_nonzerop (tree expr
)
1350 return ((TREE_CODE (expr
) == INTEGER_CST
1351 && (TREE_INT_CST_LOW (expr
) != 0
1352 || TREE_INT_CST_HIGH (expr
) != 0))
1353 || (TREE_CODE (expr
) == COMPLEX_CST
1354 && (integer_nonzerop (TREE_REALPART (expr
))
1355 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1358 /* Return the power of two represented by a tree node known to be a
1362 tree_log2 (tree expr
)
1365 HOST_WIDE_INT high
, low
;
1369 if (TREE_CODE (expr
) == COMPLEX_CST
)
1370 return tree_log2 (TREE_REALPART (expr
));
1372 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1373 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1375 high
= TREE_INT_CST_HIGH (expr
);
1376 low
= TREE_INT_CST_LOW (expr
);
1378 /* First clear all bits that are beyond the type's precision in case
1379 we've been sign extended. */
1381 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1383 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1384 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1388 if (prec
< HOST_BITS_PER_WIDE_INT
)
1389 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1392 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1393 : exact_log2 (low
));
1396 /* Similar, but return the largest integer Y such that 2 ** Y is less
1397 than or equal to EXPR. */
1400 tree_floor_log2 (tree expr
)
1403 HOST_WIDE_INT high
, low
;
1407 if (TREE_CODE (expr
) == COMPLEX_CST
)
1408 return tree_log2 (TREE_REALPART (expr
));
1410 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1411 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1413 high
= TREE_INT_CST_HIGH (expr
);
1414 low
= TREE_INT_CST_LOW (expr
);
1416 /* First clear all bits that are beyond the type's precision in case
1417 we've been sign extended. Ignore if type's precision hasn't been set
1418 since what we are doing is setting it. */
1420 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1422 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1423 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1427 if (prec
< HOST_BITS_PER_WIDE_INT
)
1428 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1431 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1432 : floor_log2 (low
));
1435 /* Return 1 if EXPR is the real constant zero. */
1438 real_zerop (tree expr
)
1442 return ((TREE_CODE (expr
) == REAL_CST
1443 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1444 || (TREE_CODE (expr
) == COMPLEX_CST
1445 && real_zerop (TREE_REALPART (expr
))
1446 && real_zerop (TREE_IMAGPART (expr
))));
1449 /* Return 1 if EXPR is the real constant one in real or complex form. */
1452 real_onep (tree expr
)
1456 return ((TREE_CODE (expr
) == REAL_CST
1457 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1458 || (TREE_CODE (expr
) == COMPLEX_CST
1459 && real_onep (TREE_REALPART (expr
))
1460 && real_zerop (TREE_IMAGPART (expr
))));
1463 /* Return 1 if EXPR is the real constant two. */
1466 real_twop (tree expr
)
1470 return ((TREE_CODE (expr
) == REAL_CST
1471 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1472 || (TREE_CODE (expr
) == COMPLEX_CST
1473 && real_twop (TREE_REALPART (expr
))
1474 && real_zerop (TREE_IMAGPART (expr
))));
1477 /* Return 1 if EXPR is the real constant minus one. */
1480 real_minus_onep (tree expr
)
1484 return ((TREE_CODE (expr
) == REAL_CST
1485 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1486 || (TREE_CODE (expr
) == COMPLEX_CST
1487 && real_minus_onep (TREE_REALPART (expr
))
1488 && real_zerop (TREE_IMAGPART (expr
))));
1491 /* Nonzero if EXP is a constant or a cast of a constant. */
1494 really_constant_p (tree exp
)
1496 /* This is not quite the same as STRIP_NOPS. It does more. */
1497 while (TREE_CODE (exp
) == NOP_EXPR
1498 || TREE_CODE (exp
) == CONVERT_EXPR
1499 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1500 exp
= TREE_OPERAND (exp
, 0);
1501 return TREE_CONSTANT (exp
);
1504 /* Return first list element whose TREE_VALUE is ELEM.
1505 Return 0 if ELEM is not in LIST. */
1508 value_member (tree elem
, tree list
)
1512 if (elem
== TREE_VALUE (list
))
1514 list
= TREE_CHAIN (list
);
1519 /* Return first list element whose TREE_PURPOSE is ELEM.
1520 Return 0 if ELEM is not in LIST. */
1523 purpose_member (tree elem
, tree list
)
1527 if (elem
== TREE_PURPOSE (list
))
1529 list
= TREE_CHAIN (list
);
1534 /* Return nonzero if ELEM is part of the chain CHAIN. */
1537 chain_member (tree elem
, tree chain
)
1543 chain
= TREE_CHAIN (chain
);
1549 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1550 We expect a null pointer to mark the end of the chain.
1551 This is the Lisp primitive `length'. */
1554 list_length (tree t
)
1557 #ifdef ENABLE_TREE_CHECKING
1565 #ifdef ENABLE_TREE_CHECKING
1568 gcc_assert (p
!= q
);
1576 /* Returns the number of FIELD_DECLs in TYPE. */
1579 fields_length (tree type
)
1581 tree t
= TYPE_FIELDS (type
);
1584 for (; t
; t
= TREE_CHAIN (t
))
1585 if (TREE_CODE (t
) == FIELD_DECL
)
1591 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1592 by modifying the last node in chain 1 to point to chain 2.
1593 This is the Lisp primitive `nconc'. */
1596 chainon (tree op1
, tree op2
)
1605 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1607 TREE_CHAIN (t1
) = op2
;
1609 #ifdef ENABLE_TREE_CHECKING
1612 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1613 gcc_assert (t2
!= t1
);
1620 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1623 tree_last (tree chain
)
1627 while ((next
= TREE_CHAIN (chain
)))
1632 /* Reverse the order of elements in the chain T,
1633 and return the new head of the chain (old last element). */
1638 tree prev
= 0, decl
, next
;
1639 for (decl
= t
; decl
; decl
= next
)
1641 next
= TREE_CHAIN (decl
);
1642 TREE_CHAIN (decl
) = prev
;
1648 /* Return a newly created TREE_LIST node whose
1649 purpose and value fields are PARM and VALUE. */
1652 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1654 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1655 TREE_PURPOSE (t
) = parm
;
1656 TREE_VALUE (t
) = value
;
1660 /* Return a newly created TREE_LIST node whose
1661 purpose and value fields are PURPOSE and VALUE
1662 and whose TREE_CHAIN is CHAIN. */
1665 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1669 node
= ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1671 memset (node
, 0, sizeof (struct tree_common
));
1673 #ifdef GATHER_STATISTICS
1674 tree_node_counts
[(int) x_kind
]++;
1675 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1678 TREE_SET_CODE (node
, TREE_LIST
);
1679 TREE_CHAIN (node
) = chain
;
1680 TREE_PURPOSE (node
) = purpose
;
1681 TREE_VALUE (node
) = value
;
1686 /* Return the size nominally occupied by an object of type TYPE
1687 when it resides in memory. The value is measured in units of bytes,
1688 and its data type is that normally used for type sizes
1689 (which is the first type created by make_signed_type or
1690 make_unsigned_type). */
1693 size_in_bytes (tree type
)
1697 if (type
== error_mark_node
)
1698 return integer_zero_node
;
1700 type
= TYPE_MAIN_VARIANT (type
);
1701 t
= TYPE_SIZE_UNIT (type
);
1705 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1706 return size_zero_node
;
1709 if (TREE_CODE (t
) == INTEGER_CST
)
1710 t
= force_fit_type (t
, 0, false, false);
1715 /* Return the size of TYPE (in bytes) as a wide integer
1716 or return -1 if the size can vary or is larger than an integer. */
1719 int_size_in_bytes (tree type
)
1723 if (type
== error_mark_node
)
1726 type
= TYPE_MAIN_VARIANT (type
);
1727 t
= TYPE_SIZE_UNIT (type
);
1729 || TREE_CODE (t
) != INTEGER_CST
1730 || TREE_INT_CST_HIGH (t
) != 0
1731 /* If the result would appear negative, it's too big to represent. */
1732 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1735 return TREE_INT_CST_LOW (t
);
1738 /* Return the maximum size of TYPE (in bytes) as a wide integer
1739 or return -1 if the size can vary or is larger than an integer. */
1742 max_int_size_in_bytes (tree type
)
1744 HOST_WIDE_INT size
= -1;
1747 /* If this is an array type, check for a possible MAX_SIZE attached. */
1749 if (TREE_CODE (type
) == ARRAY_TYPE
)
1751 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
1753 if (size_tree
&& host_integerp (size_tree
, 1))
1754 size
= tree_low_cst (size_tree
, 1);
1757 /* If we still haven't been able to get a size, see if the language
1758 can compute a maximum size. */
1762 size_tree
= lang_hooks
.types
.max_size (type
);
1764 if (size_tree
&& host_integerp (size_tree
, 1))
1765 size
= tree_low_cst (size_tree
, 1);
1771 /* Return the bit position of FIELD, in bits from the start of the record.
1772 This is a tree of type bitsizetype. */
1775 bit_position (tree field
)
1777 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1778 DECL_FIELD_BIT_OFFSET (field
));
1781 /* Likewise, but return as an integer. It must be representable in
1782 that way (since it could be a signed value, we don't have the
1783 option of returning -1 like int_size_in_byte can. */
1786 int_bit_position (tree field
)
1788 return tree_low_cst (bit_position (field
), 0);
1791 /* Return the byte position of FIELD, in bytes from the start of the record.
1792 This is a tree of type sizetype. */
1795 byte_position (tree field
)
1797 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1798 DECL_FIELD_BIT_OFFSET (field
));
1801 /* Likewise, but return as an integer. It must be representable in
1802 that way (since it could be a signed value, we don't have the
1803 option of returning -1 like int_size_in_byte can. */
1806 int_byte_position (tree field
)
1808 return tree_low_cst (byte_position (field
), 0);
1811 /* Return the strictest alignment, in bits, that T is known to have. */
1816 unsigned int align0
, align1
;
1818 switch (TREE_CODE (t
))
1820 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1821 /* If we have conversions, we know that the alignment of the
1822 object must meet each of the alignments of the types. */
1823 align0
= expr_align (TREE_OPERAND (t
, 0));
1824 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1825 return MAX (align0
, align1
);
1827 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1828 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1829 case CLEANUP_POINT_EXPR
:
1830 /* These don't change the alignment of an object. */
1831 return expr_align (TREE_OPERAND (t
, 0));
1834 /* The best we can do is say that the alignment is the least aligned
1836 align0
= expr_align (TREE_OPERAND (t
, 1));
1837 align1
= expr_align (TREE_OPERAND (t
, 2));
1838 return MIN (align0
, align1
);
1840 case LABEL_DECL
: case CONST_DECL
:
1841 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1842 if (DECL_ALIGN (t
) != 0)
1843 return DECL_ALIGN (t
);
1847 return FUNCTION_BOUNDARY
;
1853 /* Otherwise take the alignment from that of the type. */
1854 return TYPE_ALIGN (TREE_TYPE (t
));
1857 /* Return, as a tree node, the number of elements for TYPE (which is an
1858 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1861 array_type_nelts (tree type
)
1863 tree index_type
, min
, max
;
1865 /* If they did it with unspecified bounds, then we should have already
1866 given an error about it before we got here. */
1867 if (! TYPE_DOMAIN (type
))
1868 return error_mark_node
;
1870 index_type
= TYPE_DOMAIN (type
);
1871 min
= TYPE_MIN_VALUE (index_type
);
1872 max
= TYPE_MAX_VALUE (index_type
);
1874 return (integer_zerop (min
)
1876 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
1879 /* If arg is static -- a reference to an object in static storage -- then
1880 return the object. This is not the same as the C meaning of `static'.
1881 If arg isn't static, return NULL. */
1886 switch (TREE_CODE (arg
))
1889 /* Nested functions are static, even though taking their address will
1890 involve a trampoline as we unnest the nested function and create
1891 the trampoline on the tree level. */
1895 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1896 && ! DECL_THREAD_LOCAL_P (arg
)
1897 && ! DECL_DLLIMPORT_P (arg
)
1901 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1905 return TREE_STATIC (arg
) ? arg
: NULL
;
1912 /* If the thing being referenced is not a field, then it is
1913 something language specific. */
1914 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1915 return (*lang_hooks
.staticp
) (arg
);
1917 /* If we are referencing a bitfield, we can't evaluate an
1918 ADDR_EXPR at compile time and so it isn't a constant. */
1919 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1922 return staticp (TREE_OPERAND (arg
, 0));
1927 case MISALIGNED_INDIRECT_REF
:
1928 case ALIGN_INDIRECT_REF
:
1930 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
1933 case ARRAY_RANGE_REF
:
1934 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1935 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1936 return staticp (TREE_OPERAND (arg
, 0));
1941 if ((unsigned int) TREE_CODE (arg
)
1942 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1943 return lang_hooks
.staticp (arg
);
1949 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1950 Do this to any expression which may be used in more than one place,
1951 but must be evaluated only once.
1953 Normally, expand_expr would reevaluate the expression each time.
1954 Calling save_expr produces something that is evaluated and recorded
1955 the first time expand_expr is called on it. Subsequent calls to
1956 expand_expr just reuse the recorded value.
1958 The call to expand_expr that generates code that actually computes
1959 the value is the first call *at compile time*. Subsequent calls
1960 *at compile time* generate code to use the saved value.
1961 This produces correct result provided that *at run time* control
1962 always flows through the insns made by the first expand_expr
1963 before reaching the other places where the save_expr was evaluated.
1964 You, the caller of save_expr, must make sure this is so.
1966 Constants, and certain read-only nodes, are returned with no
1967 SAVE_EXPR because that is safe. Expressions containing placeholders
1968 are not touched; see tree.def for an explanation of what these
1972 save_expr (tree expr
)
1974 tree t
= fold (expr
);
1977 /* If the tree evaluates to a constant, then we don't want to hide that
1978 fact (i.e. this allows further folding, and direct checks for constants).
1979 However, a read-only object that has side effects cannot be bypassed.
1980 Since it is no problem to reevaluate literals, we just return the
1982 inner
= skip_simple_arithmetic (t
);
1984 if (TREE_INVARIANT (inner
)
1985 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1986 || TREE_CODE (inner
) == SAVE_EXPR
1987 || TREE_CODE (inner
) == ERROR_MARK
)
1990 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1991 it means that the size or offset of some field of an object depends on
1992 the value within another field.
1994 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1995 and some variable since it would then need to be both evaluated once and
1996 evaluated more than once. Front-ends must assure this case cannot
1997 happen by surrounding any such subexpressions in their own SAVE_EXPR
1998 and forcing evaluation at the proper time. */
1999 if (contains_placeholder_p (inner
))
2002 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2004 /* This expression might be placed ahead of a jump to ensure that the
2005 value was computed on both sides of the jump. So make sure it isn't
2006 eliminated as dead. */
2007 TREE_SIDE_EFFECTS (t
) = 1;
2008 TREE_INVARIANT (t
) = 1;
2012 /* Look inside EXPR and into any simple arithmetic operations. Return
2013 the innermost non-arithmetic node. */
2016 skip_simple_arithmetic (tree expr
)
2020 /* We don't care about whether this can be used as an lvalue in this
2022 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2023 expr
= TREE_OPERAND (expr
, 0);
2025 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2026 a constant, it will be more efficient to not make another SAVE_EXPR since
2027 it will allow better simplification and GCSE will be able to merge the
2028 computations if they actually occur. */
2032 if (UNARY_CLASS_P (inner
))
2033 inner
= TREE_OPERAND (inner
, 0);
2034 else if (BINARY_CLASS_P (inner
))
2036 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
2037 inner
= TREE_OPERAND (inner
, 0);
2038 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
2039 inner
= TREE_OPERAND (inner
, 1);
2050 /* Return which tree structure is used by T. */
2052 enum tree_node_structure_enum
2053 tree_node_structure (tree t
)
2055 enum tree_code code
= TREE_CODE (t
);
2057 switch (TREE_CODE_CLASS (code
))
2059 case tcc_declaration
:
2064 return TS_FIELD_DECL
;
2066 return TS_PARM_DECL
;
2070 return TS_LABEL_DECL
;
2072 return TS_RESULT_DECL
;
2074 return TS_CONST_DECL
;
2076 return TS_TYPE_DECL
;
2078 return TS_FUNCTION_DECL
;
2079 case SYMBOL_MEMORY_TAG
:
2080 case NAME_MEMORY_TAG
:
2081 case STRUCT_FIELD_TAG
:
2082 return TS_MEMORY_TAG
;
2084 return TS_DECL_NON_COMMON
;
2090 case tcc_comparison
:
2093 case tcc_expression
:
2096 default: /* tcc_constant and tcc_exceptional */
2101 /* tcc_constant cases. */
2102 case INTEGER_CST
: return TS_INT_CST
;
2103 case REAL_CST
: return TS_REAL_CST
;
2104 case COMPLEX_CST
: return TS_COMPLEX
;
2105 case VECTOR_CST
: return TS_VECTOR
;
2106 case STRING_CST
: return TS_STRING
;
2107 /* tcc_exceptional cases. */
2108 case ERROR_MARK
: return TS_COMMON
;
2109 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
2110 case TREE_LIST
: return TS_LIST
;
2111 case TREE_VEC
: return TS_VEC
;
2112 case PHI_NODE
: return TS_PHI_NODE
;
2113 case SSA_NAME
: return TS_SSA_NAME
;
2114 case PLACEHOLDER_EXPR
: return TS_COMMON
;
2115 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
2116 case BLOCK
: return TS_BLOCK
;
2117 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
2118 case TREE_BINFO
: return TS_BINFO
;
2119 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
2120 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
2127 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2128 or offset that depends on a field within a record. */
2131 contains_placeholder_p (tree exp
)
2133 enum tree_code code
;
2138 code
= TREE_CODE (exp
);
2139 if (code
== PLACEHOLDER_EXPR
)
2142 switch (TREE_CODE_CLASS (code
))
2145 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2146 position computations since they will be converted into a
2147 WITH_RECORD_EXPR involving the reference, which will assume
2148 here will be valid. */
2149 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2151 case tcc_exceptional
:
2152 if (code
== TREE_LIST
)
2153 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2154 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2159 case tcc_comparison
:
2160 case tcc_expression
:
2164 /* Ignoring the first operand isn't quite right, but works best. */
2165 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2168 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2169 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2170 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2173 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2179 switch (TREE_CODE_LENGTH (code
))
2182 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2184 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2185 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2196 /* Return true if any part of the computation of TYPE involves a
2197 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2198 (for QUAL_UNION_TYPE) and field positions. */
2201 type_contains_placeholder_1 (tree type
)
2203 /* If the size contains a placeholder or the parent type (component type in
2204 the case of arrays) type involves a placeholder, this type does. */
2205 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2206 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2207 || (TREE_TYPE (type
) != 0
2208 && type_contains_placeholder_p (TREE_TYPE (type
))))
2211 /* Now do type-specific checks. Note that the last part of the check above
2212 greatly limits what we have to do below. */
2213 switch (TREE_CODE (type
))
2221 case REFERENCE_TYPE
:
2229 /* Here we just check the bounds. */
2230 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2231 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2234 /* We're already checked the component type (TREE_TYPE), so just check
2236 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2240 case QUAL_UNION_TYPE
:
2244 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2245 if (TREE_CODE (field
) == FIELD_DECL
2246 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2247 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2248 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2249 || type_contains_placeholder_p (TREE_TYPE (field
))))
2261 type_contains_placeholder_p (tree type
)
2265 /* If the contains_placeholder_bits field has been initialized,
2266 then we know the answer. */
2267 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2268 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2270 /* Indicate that we've seen this type node, and the answer is false.
2271 This is what we want to return if we run into recursion via fields. */
2272 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2274 /* Compute the real value. */
2275 result
= type_contains_placeholder_1 (type
);
2277 /* Store the real value. */
2278 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2283 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2284 return a tree with all occurrences of references to F in a
2285 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2286 contains only arithmetic expressions or a CALL_EXPR with a
2287 PLACEHOLDER_EXPR occurring only in its arglist. */
2290 substitute_in_expr (tree exp
, tree f
, tree r
)
2292 enum tree_code code
= TREE_CODE (exp
);
2293 tree op0
, op1
, op2
, op3
;
2297 /* We handle TREE_LIST and COMPONENT_REF separately. */
2298 if (code
== TREE_LIST
)
2300 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2301 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2302 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2305 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2307 else if (code
== COMPONENT_REF
)
2309 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2310 and it is the right field, replace it with R. */
2311 for (inner
= TREE_OPERAND (exp
, 0);
2312 REFERENCE_CLASS_P (inner
);
2313 inner
= TREE_OPERAND (inner
, 0))
2315 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2316 && TREE_OPERAND (exp
, 1) == f
)
2319 /* If this expression hasn't been completed let, leave it alone. */
2320 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2323 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2324 if (op0
== TREE_OPERAND (exp
, 0))
2327 new = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2328 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
);
2331 switch (TREE_CODE_CLASS (code
))
2334 case tcc_declaration
:
2337 case tcc_exceptional
:
2340 case tcc_comparison
:
2341 case tcc_expression
:
2343 switch (TREE_CODE_LENGTH (code
))
2349 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2350 if (op0
== TREE_OPERAND (exp
, 0))
2353 new = fold_build1 (code
, TREE_TYPE (exp
), op0
);
2357 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2358 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2360 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2363 new = fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2367 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2368 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2369 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2371 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2372 && op2
== TREE_OPERAND (exp
, 2))
2375 new = fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2379 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2380 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2381 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2382 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
2384 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2385 && op2
== TREE_OPERAND (exp
, 2)
2386 && op3
== TREE_OPERAND (exp
, 3))
2389 new = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2401 TREE_READONLY (new) = TREE_READONLY (exp
);
2405 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2406 for it within OBJ, a tree that is an object or a chain of references. */
2409 substitute_placeholder_in_expr (tree exp
, tree obj
)
2411 enum tree_code code
= TREE_CODE (exp
);
2412 tree op0
, op1
, op2
, op3
;
2414 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2415 in the chain of OBJ. */
2416 if (code
== PLACEHOLDER_EXPR
)
2418 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2421 for (elt
= obj
; elt
!= 0;
2422 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2423 || TREE_CODE (elt
) == COND_EXPR
)
2424 ? TREE_OPERAND (elt
, 1)
2425 : (REFERENCE_CLASS_P (elt
)
2426 || UNARY_CLASS_P (elt
)
2427 || BINARY_CLASS_P (elt
)
2428 || EXPRESSION_CLASS_P (elt
))
2429 ? TREE_OPERAND (elt
, 0) : 0))
2430 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2433 for (elt
= obj
; elt
!= 0;
2434 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2435 || TREE_CODE (elt
) == COND_EXPR
)
2436 ? TREE_OPERAND (elt
, 1)
2437 : (REFERENCE_CLASS_P (elt
)
2438 || UNARY_CLASS_P (elt
)
2439 || BINARY_CLASS_P (elt
)
2440 || EXPRESSION_CLASS_P (elt
))
2441 ? TREE_OPERAND (elt
, 0) : 0))
2442 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2443 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2445 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
2447 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2448 survives until RTL generation, there will be an error. */
2452 /* TREE_LIST is special because we need to look at TREE_VALUE
2453 and TREE_CHAIN, not TREE_OPERANDS. */
2454 else if (code
== TREE_LIST
)
2456 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2457 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2458 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2461 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2464 switch (TREE_CODE_CLASS (code
))
2467 case tcc_declaration
:
2470 case tcc_exceptional
:
2473 case tcc_comparison
:
2474 case tcc_expression
:
2477 switch (TREE_CODE_LENGTH (code
))
2483 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2484 if (op0
== TREE_OPERAND (exp
, 0))
2487 return fold_build1 (code
, TREE_TYPE (exp
), op0
);
2490 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2491 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2493 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2496 return fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2499 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2500 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2501 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2503 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2504 && op2
== TREE_OPERAND (exp
, 2))
2507 return fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2510 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2511 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2512 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2513 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2515 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2516 && op2
== TREE_OPERAND (exp
, 2)
2517 && op3
== TREE_OPERAND (exp
, 3))
2520 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2532 /* Stabilize a reference so that we can use it any number of times
2533 without causing its operands to be evaluated more than once.
2534 Returns the stabilized reference. This works by means of save_expr,
2535 so see the caveats in the comments about save_expr.
2537 Also allows conversion expressions whose operands are references.
2538 Any other kind of expression is returned unchanged. */
2541 stabilize_reference (tree ref
)
2544 enum tree_code code
= TREE_CODE (ref
);
2551 /* No action is needed in this case. */
2557 case FIX_TRUNC_EXPR
:
2558 case FIX_FLOOR_EXPR
:
2559 case FIX_ROUND_EXPR
:
2561 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2565 result
= build_nt (INDIRECT_REF
,
2566 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2570 result
= build_nt (COMPONENT_REF
,
2571 stabilize_reference (TREE_OPERAND (ref
, 0)),
2572 TREE_OPERAND (ref
, 1), NULL_TREE
);
2576 result
= build_nt (BIT_FIELD_REF
,
2577 stabilize_reference (TREE_OPERAND (ref
, 0)),
2578 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2579 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2583 result
= build_nt (ARRAY_REF
,
2584 stabilize_reference (TREE_OPERAND (ref
, 0)),
2585 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2586 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2589 case ARRAY_RANGE_REF
:
2590 result
= build_nt (ARRAY_RANGE_REF
,
2591 stabilize_reference (TREE_OPERAND (ref
, 0)),
2592 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2593 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2597 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2598 it wouldn't be ignored. This matters when dealing with
2600 return stabilize_reference_1 (ref
);
2602 /* If arg isn't a kind of lvalue we recognize, make no change.
2603 Caller should recognize the error for an invalid lvalue. */
2608 return error_mark_node
;
2611 TREE_TYPE (result
) = TREE_TYPE (ref
);
2612 TREE_READONLY (result
) = TREE_READONLY (ref
);
2613 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2614 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2619 /* Subroutine of stabilize_reference; this is called for subtrees of
2620 references. Any expression with side-effects must be put in a SAVE_EXPR
2621 to ensure that it is only evaluated once.
2623 We don't put SAVE_EXPR nodes around everything, because assigning very
2624 simple expressions to temporaries causes us to miss good opportunities
2625 for optimizations. Among other things, the opportunity to fold in the
2626 addition of a constant into an addressing mode often gets lost, e.g.
2627 "y[i+1] += x;". In general, we take the approach that we should not make
2628 an assignment unless we are forced into it - i.e., that any non-side effect
2629 operator should be allowed, and that cse should take care of coalescing
2630 multiple utterances of the same expression should that prove fruitful. */
2633 stabilize_reference_1 (tree e
)
2636 enum tree_code code
= TREE_CODE (e
);
2638 /* We cannot ignore const expressions because it might be a reference
2639 to a const array but whose index contains side-effects. But we can
2640 ignore things that are actual constant or that already have been
2641 handled by this function. */
2643 if (TREE_INVARIANT (e
))
2646 switch (TREE_CODE_CLASS (code
))
2648 case tcc_exceptional
:
2650 case tcc_declaration
:
2651 case tcc_comparison
:
2653 case tcc_expression
:
2655 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2656 so that it will only be evaluated once. */
2657 /* The reference (r) and comparison (<) classes could be handled as
2658 below, but it is generally faster to only evaluate them once. */
2659 if (TREE_SIDE_EFFECTS (e
))
2660 return save_expr (e
);
2664 /* Constants need no processing. In fact, we should never reach
2669 /* Division is slow and tends to be compiled with jumps,
2670 especially the division by powers of 2 that is often
2671 found inside of an array reference. So do it just once. */
2672 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2673 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2674 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2675 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2676 return save_expr (e
);
2677 /* Recursively stabilize each operand. */
2678 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2679 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2683 /* Recursively stabilize each operand. */
2684 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2691 TREE_TYPE (result
) = TREE_TYPE (e
);
2692 TREE_READONLY (result
) = TREE_READONLY (e
);
2693 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2694 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2695 TREE_INVARIANT (result
) = 1;
2700 /* Low-level constructors for expressions. */
2702 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2703 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2706 recompute_tree_invariant_for_addr_expr (tree t
)
2709 bool tc
= true, ti
= true, se
= false;
2711 /* We started out assuming this address is both invariant and constant, but
2712 does not have side effects. Now go down any handled components and see if
2713 any of them involve offsets that are either non-constant or non-invariant.
2714 Also check for side-effects.
2716 ??? Note that this code makes no attempt to deal with the case where
2717 taking the address of something causes a copy due to misalignment. */
2719 #define UPDATE_TITCSE(NODE) \
2720 do { tree _node = (NODE); \
2721 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2722 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2723 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2725 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2726 node
= TREE_OPERAND (node
, 0))
2728 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2729 array reference (probably made temporarily by the G++ front end),
2730 so ignore all the operands. */
2731 if ((TREE_CODE (node
) == ARRAY_REF
2732 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2733 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2735 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2736 if (TREE_OPERAND (node
, 2))
2737 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2738 if (TREE_OPERAND (node
, 3))
2739 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2741 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2742 FIELD_DECL, apparently. The G++ front end can put something else
2743 there, at least temporarily. */
2744 else if (TREE_CODE (node
) == COMPONENT_REF
2745 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2747 if (TREE_OPERAND (node
, 2))
2748 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2750 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2751 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2754 node
= lang_hooks
.expr_to_decl (node
, &tc
, &ti
, &se
);
2756 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2757 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2758 invariant and constant if the decl is static. It's also invariant if it's
2759 a decl in the current function. Taking the address of a volatile variable
2760 is not volatile. If it's a constant, the address is both invariant and
2761 constant. Otherwise it's neither. */
2762 if (TREE_CODE (node
) == INDIRECT_REF
)
2763 UPDATE_TITCSE (TREE_OPERAND (node
, 0));
2764 else if (DECL_P (node
))
2768 else if (decl_function_context (node
) == current_function_decl
2769 /* Addresses of thread-local variables are invariant. */
2770 || (TREE_CODE (node
) == VAR_DECL
2771 && DECL_THREAD_LOCAL_P (node
)))
2776 else if (CONSTANT_CLASS_P (node
))
2781 se
|= TREE_SIDE_EFFECTS (node
);
2784 TREE_CONSTANT (t
) = tc
;
2785 TREE_INVARIANT (t
) = ti
;
2786 TREE_SIDE_EFFECTS (t
) = se
;
2787 #undef UPDATE_TITCSE
2790 /* Build an expression of code CODE, data type TYPE, and operands as
2791 specified. Expressions and reference nodes can be created this way.
2792 Constants, decls, types and misc nodes cannot be.
2794 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2795 enough for all extant tree codes. */
2798 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2802 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2804 t
= make_node_stat (code PASS_MEM_STAT
);
2811 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2813 int length
= sizeof (struct tree_exp
);
2814 #ifdef GATHER_STATISTICS
2815 tree_node_kind kind
;
2819 #ifdef GATHER_STATISTICS
2820 switch (TREE_CODE_CLASS (code
))
2822 case tcc_statement
: /* an expression with side effects */
2825 case tcc_reference
: /* a reference */
2833 tree_node_counts
[(int) kind
]++;
2834 tree_node_sizes
[(int) kind
] += length
;
2837 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2839 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
2841 memset (t
, 0, sizeof (struct tree_common
));
2843 TREE_SET_CODE (t
, code
);
2845 TREE_TYPE (t
) = type
;
2846 #ifdef USE_MAPPED_LOCATION
2847 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2849 SET_EXPR_LOCUS (t
, NULL
);
2851 TREE_COMPLEXITY (t
) = 0;
2852 TREE_OPERAND (t
, 0) = node
;
2853 TREE_BLOCK (t
) = NULL_TREE
;
2854 if (node
&& !TYPE_P (node
))
2856 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2857 TREE_READONLY (t
) = TREE_READONLY (node
);
2860 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2861 TREE_SIDE_EFFECTS (t
) = 1;
2865 /* All of these have side-effects, no matter what their
2867 TREE_SIDE_EFFECTS (t
) = 1;
2868 TREE_READONLY (t
) = 0;
2871 case MISALIGNED_INDIRECT_REF
:
2872 case ALIGN_INDIRECT_REF
:
2874 /* Whether a dereference is readonly has nothing to do with whether
2875 its operand is readonly. */
2876 TREE_READONLY (t
) = 0;
2881 recompute_tree_invariant_for_addr_expr (t
);
2885 if (TREE_CODE_CLASS (code
) == tcc_unary
2886 && node
&& !TYPE_P (node
)
2887 && TREE_CONSTANT (node
))
2888 TREE_CONSTANT (t
) = 1;
2889 if (TREE_CODE_CLASS (code
) == tcc_unary
2890 && node
&& TREE_INVARIANT (node
))
2891 TREE_INVARIANT (t
) = 1;
2892 if (TREE_CODE_CLASS (code
) == tcc_reference
2893 && node
&& TREE_THIS_VOLATILE (node
))
2894 TREE_THIS_VOLATILE (t
) = 1;
2901 #define PROCESS_ARG(N) \
2903 TREE_OPERAND (t, N) = arg##N; \
2904 if (arg##N &&!TYPE_P (arg##N)) \
2906 if (TREE_SIDE_EFFECTS (arg##N)) \
2908 if (!TREE_READONLY (arg##N)) \
2910 if (!TREE_CONSTANT (arg##N)) \
2912 if (!TREE_INVARIANT (arg##N)) \
2918 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2920 bool constant
, read_only
, side_effects
, invariant
;
2923 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
2925 t
= make_node_stat (code PASS_MEM_STAT
);
2928 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2929 result based on those same flags for the arguments. But if the
2930 arguments aren't really even `tree' expressions, we shouldn't be trying
2933 /* Expressions without side effects may be constant if their
2934 arguments are as well. */
2935 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
2936 || TREE_CODE_CLASS (code
) == tcc_binary
);
2938 side_effects
= TREE_SIDE_EFFECTS (t
);
2939 invariant
= constant
;
2944 TREE_READONLY (t
) = read_only
;
2945 TREE_CONSTANT (t
) = constant
;
2946 TREE_INVARIANT (t
) = invariant
;
2947 TREE_SIDE_EFFECTS (t
) = side_effects
;
2948 TREE_THIS_VOLATILE (t
)
2949 = (TREE_CODE_CLASS (code
) == tcc_reference
2950 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2956 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2957 tree arg2 MEM_STAT_DECL
)
2959 bool constant
, read_only
, side_effects
, invariant
;
2962 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
2964 t
= make_node_stat (code PASS_MEM_STAT
);
2967 side_effects
= TREE_SIDE_EFFECTS (t
);
2973 if (code
== CALL_EXPR
&& !side_effects
)
2978 /* Calls have side-effects, except those to const or
2980 i
= call_expr_flags (t
);
2981 if (!(i
& (ECF_CONST
| ECF_PURE
)))
2984 /* And even those have side-effects if their arguments do. */
2985 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
2986 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
2993 TREE_SIDE_EFFECTS (t
) = side_effects
;
2994 TREE_THIS_VOLATILE (t
)
2995 = (TREE_CODE_CLASS (code
) == tcc_reference
2996 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3002 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3003 tree arg2
, tree arg3 MEM_STAT_DECL
)
3005 bool constant
, read_only
, side_effects
, invariant
;
3008 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3010 t
= make_node_stat (code PASS_MEM_STAT
);
3013 side_effects
= TREE_SIDE_EFFECTS (t
);
3020 TREE_SIDE_EFFECTS (t
) = side_effects
;
3021 TREE_THIS_VOLATILE (t
)
3022 = (TREE_CODE_CLASS (code
) == tcc_reference
3023 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3029 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3030 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3032 bool constant
, read_only
, side_effects
, invariant
;
3035 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3037 t
= make_node_stat (code PASS_MEM_STAT
);
3040 side_effects
= TREE_SIDE_EFFECTS (t
);
3048 TREE_SIDE_EFFECTS (t
) = side_effects
;
3049 TREE_THIS_VOLATILE (t
)
3050 = (TREE_CODE_CLASS (code
) == tcc_reference
3051 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3057 build7_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3058 tree arg2
, tree arg3
, tree arg4
, tree arg5
,
3059 tree arg6 MEM_STAT_DECL
)
3061 bool constant
, read_only
, side_effects
, invariant
;
3064 gcc_assert (code
== TARGET_MEM_REF
);
3066 t
= make_node_stat (code PASS_MEM_STAT
);
3069 side_effects
= TREE_SIDE_EFFECTS (t
);
3079 TREE_SIDE_EFFECTS (t
) = side_effects
;
3080 TREE_THIS_VOLATILE (t
) = 0;
3085 /* Similar except don't specify the TREE_TYPE
3086 and leave the TREE_SIDE_EFFECTS as 0.
3087 It is permissible for arguments to be null,
3088 or even garbage if their values do not matter. */
3091 build_nt (enum tree_code code
, ...)
3100 t
= make_node (code
);
3101 length
= TREE_CODE_LENGTH (code
);
3103 for (i
= 0; i
< length
; i
++)
3104 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3110 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3111 We do NOT enter this node in any sort of symbol table.
3113 layout_decl is used to set up the decl's storage layout.
3114 Other slots are initialized to 0 or null pointers. */
3117 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
3121 t
= make_node_stat (code PASS_MEM_STAT
);
3123 /* if (type == error_mark_node)
3124 type = integer_type_node; */
3125 /* That is not done, deliberately, so that having error_mark_node
3126 as the type can suppress useless errors in the use of this variable. */
3128 DECL_NAME (t
) = name
;
3129 TREE_TYPE (t
) = type
;
3131 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3133 else if (code
== FUNCTION_DECL
)
3134 DECL_MODE (t
) = FUNCTION_MODE
;
3139 /* Builds and returns function declaration with NAME and TYPE. */
3142 build_fn_decl (const char *name
, tree type
)
3144 tree id
= get_identifier (name
);
3145 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
3147 DECL_EXTERNAL (decl
) = 1;
3148 TREE_PUBLIC (decl
) = 1;
3149 DECL_ARTIFICIAL (decl
) = 1;
3150 TREE_NOTHROW (decl
) = 1;
3156 /* BLOCK nodes are used to represent the structure of binding contours
3157 and declarations, once those contours have been exited and their contents
3158 compiled. This information is used for outputting debugging info. */
3161 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3163 tree block
= make_node (BLOCK
);
3165 BLOCK_VARS (block
) = vars
;
3166 BLOCK_SUBBLOCKS (block
) = subblocks
;
3167 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3168 BLOCK_CHAIN (block
) = chain
;
3172 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3173 /* ??? gengtype doesn't handle conditionals */
3174 static GTY(()) source_locus last_annotated_node
;
3177 #ifdef USE_MAPPED_LOCATION
3180 expand_location (source_location loc
)
3182 expanded_location xloc
;
3183 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
3186 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
3187 xloc
.file
= map
->to_file
;
3188 xloc
.line
= SOURCE_LINE (map
, loc
);
3189 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3196 /* Record the exact location where an expression or an identifier were
3200 annotate_with_file_line (tree node
, const char *file
, int line
)
3202 /* Roughly one percent of the calls to this function are to annotate
3203 a node with the same information already attached to that node!
3204 Just return instead of wasting memory. */
3205 if (EXPR_LOCUS (node
)
3206 && EXPR_LINENO (node
) == line
3207 && (EXPR_FILENAME (node
) == file
3208 || !strcmp (EXPR_FILENAME (node
), file
)))
3210 last_annotated_node
= EXPR_LOCUS (node
);
3214 /* In heavily macroized code (such as GCC itself) this single
3215 entry cache can reduce the number of allocations by more
3217 if (last_annotated_node
3218 && last_annotated_node
->line
== line
3219 && (last_annotated_node
->file
== file
3220 || !strcmp (last_annotated_node
->file
, file
)))
3222 SET_EXPR_LOCUS (node
, last_annotated_node
);
3226 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
3227 EXPR_LINENO (node
) = line
;
3228 EXPR_FILENAME (node
) = file
;
3229 last_annotated_node
= EXPR_LOCUS (node
);
3233 annotate_with_locus (tree node
, location_t locus
)
3235 annotate_with_file_line (node
, locus
.file
, locus
.line
);
3239 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3243 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3245 DECL_ATTRIBUTES (ddecl
) = attribute
;
3249 /* Borrowed from hashtab.c iterative_hash implementation. */
3250 #define mix(a,b,c) \
3252 a -= b; a -= c; a ^= (c>>13); \
3253 b -= c; b -= a; b ^= (a<< 8); \
3254 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3255 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3256 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3257 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3258 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3259 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3260 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3264 /* Produce good hash value combining VAL and VAL2. */
3265 static inline hashval_t
3266 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
3268 /* the golden ratio; an arbitrary value. */
3269 hashval_t a
= 0x9e3779b9;
3275 /* Produce good hash value combining PTR and VAL2. */
3276 static inline hashval_t
3277 iterative_hash_pointer (void *ptr
, hashval_t val2
)
3279 if (sizeof (ptr
) == sizeof (hashval_t
))
3280 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
3283 hashval_t a
= (hashval_t
) (size_t) ptr
;
3284 /* Avoid warnings about shifting of more than the width of the type on
3285 hosts that won't execute this path. */
3287 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
3293 /* Produce good hash value combining VAL and VAL2. */
3294 static inline hashval_t
3295 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
3297 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
3298 return iterative_hash_hashval_t (val
, val2
);
3301 hashval_t a
= (hashval_t
) val
;
3302 /* Avoid warnings about shifting of more than the width of the type on
3303 hosts that won't execute this path. */
3305 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
3307 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
3309 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
3310 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
3317 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3320 Record such modified types already made so we don't make duplicates. */
3323 build_type_attribute_variant (tree ttype
, tree attribute
)
3325 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3327 hashval_t hashcode
= 0;
3329 enum tree_code code
= TREE_CODE (ttype
);
3331 ntype
= copy_node (ttype
);
3333 TYPE_POINTER_TO (ntype
) = 0;
3334 TYPE_REFERENCE_TO (ntype
) = 0;
3335 TYPE_ATTRIBUTES (ntype
) = attribute
;
3337 /* Create a new main variant of TYPE. */
3338 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3339 TYPE_NEXT_VARIANT (ntype
) = 0;
3340 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3342 hashcode
= iterative_hash_object (code
, hashcode
);
3343 if (TREE_TYPE (ntype
))
3344 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3346 hashcode
= attribute_hash_list (attribute
, hashcode
);
3348 switch (TREE_CODE (ntype
))
3351 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3354 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3358 hashcode
= iterative_hash_object
3359 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3360 hashcode
= iterative_hash_object
3361 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3365 unsigned int precision
= TYPE_PRECISION (ntype
);
3366 hashcode
= iterative_hash_object (precision
, hashcode
);
3373 ntype
= type_hash_canon (hashcode
, ntype
);
3374 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3381 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3384 We try both `text' and `__text__', ATTR may be either one. */
3385 /* ??? It might be a reasonable simplification to require ATTR to be only
3386 `text'. One might then also require attribute lists to be stored in
3387 their canonicalized form. */
3390 is_attribute_with_length_p (const char *attr
, int attr_len
, tree ident
)
3395 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3398 p
= IDENTIFIER_POINTER (ident
);
3399 ident_len
= IDENTIFIER_LENGTH (ident
);
3401 if (ident_len
== attr_len
3402 && strcmp (attr
, p
) == 0)
3405 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3408 gcc_assert (attr
[1] == '_');
3409 gcc_assert (attr
[attr_len
- 2] == '_');
3410 gcc_assert (attr
[attr_len
- 1] == '_');
3411 gcc_assert (attr
[1] == '_');
3412 if (ident_len
== attr_len
- 4
3413 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3418 if (ident_len
== attr_len
+ 4
3419 && p
[0] == '_' && p
[1] == '_'
3420 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3421 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3428 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3431 We try both `text' and `__text__', ATTR may be either one. */
3434 is_attribute_p (const char *attr
, tree ident
)
3436 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3439 /* Given an attribute name and a list of attributes, return a pointer to the
3440 attribute's list element if the attribute is part of the list, or NULL_TREE
3441 if not found. If the attribute appears more than once, this only
3442 returns the first occurrence; the TREE_CHAIN of the return value should
3443 be passed back in if further occurrences are wanted. */
3446 lookup_attribute (const char *attr_name
, tree list
)
3449 size_t attr_len
= strlen (attr_name
);
3451 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3453 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3454 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3461 /* Return an attribute list that is the union of a1 and a2. */
3464 merge_attributes (tree a1
, tree a2
)
3468 /* Either one unset? Take the set one. */
3470 if ((attributes
= a1
) == 0)
3473 /* One that completely contains the other? Take it. */
3475 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3477 if (attribute_list_contained (a2
, a1
))
3481 /* Pick the longest list, and hang on the other list. */
3483 if (list_length (a1
) < list_length (a2
))
3484 attributes
= a2
, a2
= a1
;
3486 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3489 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3492 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3495 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
3500 a1
= copy_node (a2
);
3501 TREE_CHAIN (a1
) = attributes
;
3510 /* Given types T1 and T2, merge their attributes and return
3514 merge_type_attributes (tree t1
, tree t2
)
3516 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3517 TYPE_ATTRIBUTES (t2
));
3520 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3524 merge_decl_attributes (tree olddecl
, tree newdecl
)
3526 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3527 DECL_ATTRIBUTES (newdecl
));
3530 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3532 /* Specialization of merge_decl_attributes for various Windows targets.
3534 This handles the following situation:
3536 __declspec (dllimport) int foo;
3539 The second instance of `foo' nullifies the dllimport. */
3542 merge_dllimport_decl_attributes (tree old
, tree
new)
3545 int delete_dllimport_p
= 1;
3547 /* What we need to do here is remove from `old' dllimport if it doesn't
3548 appear in `new'. dllimport behaves like extern: if a declaration is
3549 marked dllimport and a definition appears later, then the object
3550 is not dllimport'd. We also remove a `new' dllimport if the old list
3551 contains dllexport: dllexport always overrides dllimport, regardless
3552 of the order of declaration. */
3553 if (!VAR_OR_FUNCTION_DECL_P (new))
3554 delete_dllimport_p
= 0;
3555 else if (DECL_DLLIMPORT_P (new)
3556 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
3558 DECL_DLLIMPORT_P (new) = 0;
3559 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
3560 "dllimport ignored", new);
3562 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new))
3564 /* Warn about overriding a symbol that has already been used. eg:
3565 extern int __attribute__ ((dllimport)) foo;
3566 int* bar () {return &foo;}
3569 if (TREE_USED (old
))
3571 warning (0, "%q+D redeclared without dllimport attribute "
3572 "after being referenced with dll linkage", new);
3573 /* If we have used a variable's address with dllimport linkage,
3574 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3575 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3577 We still remove the attribute so that assembler code refers
3578 to '&foo rather than '_imp__foo'. */
3579 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
3580 DECL_DLLIMPORT_P (new) = 1;
3583 /* Let an inline definition silently override the external reference,
3584 but otherwise warn about attribute inconsistency. */
3585 else if (TREE_CODE (new) == VAR_DECL
3586 || !DECL_DECLARED_INLINE_P (new))
3587 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
3588 "previous dllimport ignored", new);
3591 delete_dllimport_p
= 0;
3593 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new));
3595 if (delete_dllimport_p
)
3598 const size_t attr_len
= strlen ("dllimport");
3600 /* Scan the list for dllimport and delete it. */
3601 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3603 if (is_attribute_with_length_p ("dllimport", attr_len
,
3606 if (prev
== NULL_TREE
)
3609 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3618 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3619 struct attribute_spec.handler. */
3622 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3627 /* These attributes may apply to structure and union types being created,
3628 but otherwise should pass to the declaration involved. */
3631 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3632 | (int) ATTR_FLAG_ARRAY_NEXT
))
3634 *no_add_attrs
= true;
3635 return tree_cons (name
, args
, NULL_TREE
);
3637 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3639 warning (OPT_Wattributes
, "%qs attribute ignored",
3640 IDENTIFIER_POINTER (name
));
3641 *no_add_attrs
= true;
3647 /* Report error on dllimport ambiguities seen now before they cause
3649 if (is_attribute_p ("dllimport", name
))
3651 /* Honor any target-specific overrides. */
3652 if (!targetm
.valid_dllimport_attribute_p (node
))
3653 *no_add_attrs
= true;
3655 else if (TREE_CODE (node
) == FUNCTION_DECL
3656 && DECL_DECLARED_INLINE_P (node
))
3658 warning (OPT_Wattributes
, "inline function %q+D declared as "
3659 " dllimport: attribute ignored", node
);
3660 *no_add_attrs
= true;
3662 /* Like MS, treat definition of dllimported variables and
3663 non-inlined functions on declaration as syntax errors. */
3664 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
3666 error ("function %q+D definition is marked dllimport", node
);
3667 *no_add_attrs
= true;
3670 else if (TREE_CODE (node
) == VAR_DECL
)
3672 if (DECL_INITIAL (node
))
3674 error ("variable %q+D definition is marked dllimport",
3676 *no_add_attrs
= true;
3679 /* `extern' needn't be specified with dllimport.
3680 Specify `extern' now and hope for the best. Sigh. */
3681 DECL_EXTERNAL (node
) = 1;
3682 /* Also, implicitly give dllimport'd variables declared within
3683 a function global scope, unless declared static. */
3684 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3685 TREE_PUBLIC (node
) = 1;
3688 if (*no_add_attrs
== false)
3689 DECL_DLLIMPORT_P (node
) = 1;
3692 /* Report error if symbol is not accessible at global scope. */
3693 if (!TREE_PUBLIC (node
)
3694 && (TREE_CODE (node
) == VAR_DECL
3695 || TREE_CODE (node
) == FUNCTION_DECL
))
3697 error ("external linkage required for symbol %q+D because of "
3698 "%qs attribute", node
, IDENTIFIER_POINTER (name
));
3699 *no_add_attrs
= true;
3705 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3707 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3708 of the various TYPE_QUAL values. */
3711 set_type_quals (tree type
, int type_quals
)
3713 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3714 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3715 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3718 /* Returns true iff cand is equivalent to base with type_quals. */
3721 check_qualified_type (tree cand
, tree base
, int type_quals
)
3723 return (TYPE_QUALS (cand
) == type_quals
3724 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3725 /* Apparently this is needed for Objective-C. */
3726 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3727 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3728 TYPE_ATTRIBUTES (base
)));
3731 /* Return a version of the TYPE, qualified as indicated by the
3732 TYPE_QUALS, if one exists. If no qualified version exists yet,
3733 return NULL_TREE. */
3736 get_qualified_type (tree type
, int type_quals
)
3740 if (TYPE_QUALS (type
) == type_quals
)
3743 /* Search the chain of variants to see if there is already one there just
3744 like the one we need to have. If so, use that existing one. We must
3745 preserve the TYPE_NAME, since there is code that depends on this. */
3746 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3747 if (check_qualified_type (t
, type
, type_quals
))
3753 /* Like get_qualified_type, but creates the type if it does not
3754 exist. This function never returns NULL_TREE. */
3757 build_qualified_type (tree type
, int type_quals
)
3761 /* See if we already have the appropriate qualified variant. */
3762 t
= get_qualified_type (type
, type_quals
);
3764 /* If not, build it. */
3767 t
= build_variant_type_copy (type
);
3768 set_type_quals (t
, type_quals
);
3774 /* Create a new distinct copy of TYPE. The new type is made its own
3778 build_distinct_type_copy (tree type
)
3780 tree t
= copy_node (type
);
3782 TYPE_POINTER_TO (t
) = 0;
3783 TYPE_REFERENCE_TO (t
) = 0;
3785 /* Make it its own variant. */
3786 TYPE_MAIN_VARIANT (t
) = t
;
3787 TYPE_NEXT_VARIANT (t
) = 0;
3792 /* Create a new variant of TYPE, equivalent but distinct.
3793 This is so the caller can modify it. */
3796 build_variant_type_copy (tree type
)
3798 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3800 t
= build_distinct_type_copy (type
);
3802 /* Add the new type to the chain of variants of TYPE. */
3803 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3804 TYPE_NEXT_VARIANT (m
) = t
;
3805 TYPE_MAIN_VARIANT (t
) = m
;
3810 /* Return true if the from tree in both tree maps are equal. */
3813 tree_map_eq (const void *va
, const void *vb
)
3815 const struct tree_map
*a
= va
, *b
= vb
;
3816 return (a
->from
== b
->from
);
3819 /* Hash a from tree in a tree_map. */
3822 tree_map_hash (const void *item
)
3824 return (((const struct tree_map
*) item
)->hash
);
3827 /* Return true if this tree map structure is marked for garbage collection
3828 purposes. We simply return true if the from tree is marked, so that this
3829 structure goes away when the from tree goes away. */
3832 tree_map_marked_p (const void *p
)
3834 tree from
= ((struct tree_map
*) p
)->from
;
3836 return ggc_marked_p (from
);
3839 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
3842 tree_int_map_eq (const void *va
, const void *vb
)
3844 const struct tree_int_map
*a
= va
, *b
= vb
;
3845 return (a
->from
== b
->from
);
3848 /* Hash a from tree in the tree_int_map * ITEM. */
3851 tree_int_map_hash (const void *item
)
3853 return htab_hash_pointer (((const struct tree_int_map
*)item
)->from
);
3856 /* Return true if this tree int map structure is marked for garbage collection
3857 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
3858 structure goes away when the from tree goes away. */
3861 tree_int_map_marked_p (const void *p
)
3863 tree from
= ((struct tree_int_map
*) p
)->from
;
3865 return ggc_marked_p (from
);
3867 /* Lookup an init priority for FROM, and return it if we find one. */
3870 decl_init_priority_lookup (tree from
)
3872 struct tree_int_map
*h
, in
;
3875 h
= htab_find_with_hash (init_priority_for_decl
,
3876 &in
, htab_hash_pointer (from
));
3882 /* Insert a mapping FROM->TO in the init priority hashtable. */
3885 decl_init_priority_insert (tree from
, unsigned short to
)
3887 struct tree_int_map
*h
;
3890 h
= ggc_alloc (sizeof (struct tree_int_map
));
3893 loc
= htab_find_slot_with_hash (init_priority_for_decl
, h
,
3894 htab_hash_pointer (from
), INSERT
);
3895 *(struct tree_int_map
**) loc
= h
;
3898 /* Look up a restrict qualified base decl for FROM. */
3901 decl_restrict_base_lookup (tree from
)
3907 h
= htab_find_with_hash (restrict_base_for_decl
, &in
,
3908 htab_hash_pointer (from
));
3909 return h
? h
->to
: NULL_TREE
;
3912 /* Record the restrict qualified base TO for FROM. */
3915 decl_restrict_base_insert (tree from
, tree to
)
3920 h
= ggc_alloc (sizeof (struct tree_map
));
3921 h
->hash
= htab_hash_pointer (from
);
3924 loc
= htab_find_slot_with_hash (restrict_base_for_decl
, h
, h
->hash
, INSERT
);
3925 *(struct tree_map
**) loc
= h
;
3928 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
3931 print_debug_expr_statistics (void)
3933 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
3934 (long) htab_size (debug_expr_for_decl
),
3935 (long) htab_elements (debug_expr_for_decl
),
3936 htab_collisions (debug_expr_for_decl
));
3939 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
3942 print_value_expr_statistics (void)
3944 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
3945 (long) htab_size (value_expr_for_decl
),
3946 (long) htab_elements (value_expr_for_decl
),
3947 htab_collisions (value_expr_for_decl
));
3950 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
3951 don't print anything if the table is empty. */
3954 print_restrict_base_statistics (void)
3956 if (htab_elements (restrict_base_for_decl
) != 0)
3958 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
3959 (long) htab_size (restrict_base_for_decl
),
3960 (long) htab_elements (restrict_base_for_decl
),
3961 htab_collisions (restrict_base_for_decl
));
3964 /* Lookup a debug expression for FROM, and return it if we find one. */
3967 decl_debug_expr_lookup (tree from
)
3969 struct tree_map
*h
, in
;
3972 h
= htab_find_with_hash (debug_expr_for_decl
, &in
, htab_hash_pointer (from
));
3978 /* Insert a mapping FROM->TO in the debug expression hashtable. */
3981 decl_debug_expr_insert (tree from
, tree to
)
3986 h
= ggc_alloc (sizeof (struct tree_map
));
3987 h
->hash
= htab_hash_pointer (from
);
3990 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
3991 *(struct tree_map
**) loc
= h
;
3994 /* Lookup a value expression for FROM, and return it if we find one. */
3997 decl_value_expr_lookup (tree from
)
3999 struct tree_map
*h
, in
;
4002 h
= htab_find_with_hash (value_expr_for_decl
, &in
, htab_hash_pointer (from
));
4008 /* Insert a mapping FROM->TO in the value expression hashtable. */
4011 decl_value_expr_insert (tree from
, tree to
)
4016 h
= ggc_alloc (sizeof (struct tree_map
));
4017 h
->hash
= htab_hash_pointer (from
);
4020 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
4021 *(struct tree_map
**) loc
= h
;
4024 /* Hashing of types so that we don't make duplicates.
4025 The entry point is `type_hash_canon'. */
4027 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4028 with types in the TREE_VALUE slots), by adding the hash codes
4029 of the individual types. */
4032 type_hash_list (tree list
, hashval_t hashcode
)
4036 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4037 if (TREE_VALUE (tail
) != error_mark_node
)
4038 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
4044 /* These are the Hashtable callback functions. */
4046 /* Returns true iff the types are equivalent. */
4049 type_hash_eq (const void *va
, const void *vb
)
4051 const struct type_hash
*a
= va
, *b
= vb
;
4053 /* First test the things that are the same for all types. */
4054 if (a
->hash
!= b
->hash
4055 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
4056 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
4057 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
4058 TYPE_ATTRIBUTES (b
->type
))
4059 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
4060 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
4063 switch (TREE_CODE (a
->type
))
4068 case REFERENCE_TYPE
:
4072 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
4075 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
4076 && !(TYPE_VALUES (a
->type
)
4077 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
4078 && TYPE_VALUES (b
->type
)
4079 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
4080 && type_list_equal (TYPE_VALUES (a
->type
),
4081 TYPE_VALUES (b
->type
))))
4084 /* ... fall through ... */
4089 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
4090 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
4091 TYPE_MAX_VALUE (b
->type
)))
4092 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
4093 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
4094 TYPE_MIN_VALUE (b
->type
))));
4097 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
4100 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
4101 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4102 || (TYPE_ARG_TYPES (a
->type
)
4103 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4104 && TYPE_ARG_TYPES (b
->type
)
4105 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4106 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4107 TYPE_ARG_TYPES (b
->type
)))));
4110 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
4114 case QUAL_UNION_TYPE
:
4115 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
4116 || (TYPE_FIELDS (a
->type
)
4117 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
4118 && TYPE_FIELDS (b
->type
)
4119 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
4120 && type_list_equal (TYPE_FIELDS (a
->type
),
4121 TYPE_FIELDS (b
->type
))));
4124 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4125 || (TYPE_ARG_TYPES (a
->type
)
4126 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4127 && TYPE_ARG_TYPES (b
->type
)
4128 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4129 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4130 TYPE_ARG_TYPES (b
->type
))));
4137 /* Return the cached hash value. */
4140 type_hash_hash (const void *item
)
4142 return ((const struct type_hash
*) item
)->hash
;
4145 /* Look in the type hash table for a type isomorphic to TYPE.
4146 If one is found, return it. Otherwise return 0. */
4149 type_hash_lookup (hashval_t hashcode
, tree type
)
4151 struct type_hash
*h
, in
;
4153 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4154 must call that routine before comparing TYPE_ALIGNs. */
4160 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
4166 /* Add an entry to the type-hash-table
4167 for a type TYPE whose hash code is HASHCODE. */
4170 type_hash_add (hashval_t hashcode
, tree type
)
4172 struct type_hash
*h
;
4175 h
= ggc_alloc (sizeof (struct type_hash
));
4178 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
4179 *(struct type_hash
**) loc
= h
;
4182 /* Given TYPE, and HASHCODE its hash code, return the canonical
4183 object for an identical type if one already exists.
4184 Otherwise, return TYPE, and record it as the canonical object.
4186 To use this function, first create a type of the sort you want.
4187 Then compute its hash code from the fields of the type that
4188 make it different from other similar types.
4189 Then call this function and use the value. */
4192 type_hash_canon (unsigned int hashcode
, tree type
)
4196 /* The hash table only contains main variants, so ensure that's what we're
4198 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
4200 if (!lang_hooks
.types
.hash_types
)
4203 /* See if the type is in the hash table already. If so, return it.
4204 Otherwise, add the type. */
4205 t1
= type_hash_lookup (hashcode
, type
);
4208 #ifdef GATHER_STATISTICS
4209 tree_node_counts
[(int) t_kind
]--;
4210 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
4216 type_hash_add (hashcode
, type
);
4221 /* See if the data pointed to by the type hash table is marked. We consider
4222 it marked if the type is marked or if a debug type number or symbol
4223 table entry has been made for the type. This reduces the amount of
4224 debugging output and eliminates that dependency of the debug output on
4225 the number of garbage collections. */
4228 type_hash_marked_p (const void *p
)
4230 tree type
= ((struct type_hash
*) p
)->type
;
4232 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
4236 print_type_hash_statistics (void)
4238 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
4239 (long) htab_size (type_hash_table
),
4240 (long) htab_elements (type_hash_table
),
4241 htab_collisions (type_hash_table
));
4244 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4245 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4246 by adding the hash codes of the individual attributes. */
4249 attribute_hash_list (tree list
, hashval_t hashcode
)
4253 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4254 /* ??? Do we want to add in TREE_VALUE too? */
4255 hashcode
= iterative_hash_object
4256 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
4260 /* Given two lists of attributes, return true if list l2 is
4261 equivalent to l1. */
4264 attribute_list_equal (tree l1
, tree l2
)
4266 return attribute_list_contained (l1
, l2
)
4267 && attribute_list_contained (l2
, l1
);
4270 /* Given two lists of attributes, return true if list L2 is
4271 completely contained within L1. */
4272 /* ??? This would be faster if attribute names were stored in a canonicalized
4273 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4274 must be used to show these elements are equivalent (which they are). */
4275 /* ??? It's not clear that attributes with arguments will always be handled
4279 attribute_list_contained (tree l1
, tree l2
)
4283 /* First check the obvious, maybe the lists are identical. */
4287 /* Maybe the lists are similar. */
4288 for (t1
= l1
, t2
= l2
;
4290 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
4291 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
4292 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
4294 /* Maybe the lists are equal. */
4295 if (t1
== 0 && t2
== 0)
4298 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
4301 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
4303 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4306 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
4313 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
4320 /* Given two lists of types
4321 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4322 return 1 if the lists contain the same types in the same order.
4323 Also, the TREE_PURPOSEs must match. */
4326 type_list_equal (tree l1
, tree l2
)
4330 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
4331 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
4332 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
4333 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
4334 && (TREE_TYPE (TREE_PURPOSE (t1
))
4335 == TREE_TYPE (TREE_PURPOSE (t2
))))))
4341 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4342 given by TYPE. If the argument list accepts variable arguments,
4343 then this function counts only the ordinary arguments. */
4346 type_num_arguments (tree type
)
4351 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
4352 /* If the function does not take a variable number of arguments,
4353 the last element in the list will have type `void'. */
4354 if (VOID_TYPE_P (TREE_VALUE (t
)))
4362 /* Nonzero if integer constants T1 and T2
4363 represent the same constant value. */
4366 tree_int_cst_equal (tree t1
, tree t2
)
4371 if (t1
== 0 || t2
== 0)
4374 if (TREE_CODE (t1
) == INTEGER_CST
4375 && TREE_CODE (t2
) == INTEGER_CST
4376 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4377 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
4383 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4384 The precise way of comparison depends on their data type. */
4387 tree_int_cst_lt (tree t1
, tree t2
)
4392 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
4394 int t1_sgn
= tree_int_cst_sgn (t1
);
4395 int t2_sgn
= tree_int_cst_sgn (t2
);
4397 if (t1_sgn
< t2_sgn
)
4399 else if (t1_sgn
> t2_sgn
)
4401 /* Otherwise, both are non-negative, so we compare them as
4402 unsigned just in case one of them would overflow a signed
4405 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
4406 return INT_CST_LT (t1
, t2
);
4408 return INT_CST_LT_UNSIGNED (t1
, t2
);
4411 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4414 tree_int_cst_compare (tree t1
, tree t2
)
4416 if (tree_int_cst_lt (t1
, t2
))
4418 else if (tree_int_cst_lt (t2
, t1
))
4424 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4425 the host. If POS is zero, the value can be represented in a single
4426 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4427 be represented in a single unsigned HOST_WIDE_INT. */
4430 host_integerp (tree t
, int pos
)
4432 return (TREE_CODE (t
) == INTEGER_CST
4433 && ((TREE_INT_CST_HIGH (t
) == 0
4434 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
4435 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
4436 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
4437 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
4438 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
4441 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4442 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4443 be non-negative. We must be able to satisfy the above conditions. */
4446 tree_low_cst (tree t
, int pos
)
4448 gcc_assert (host_integerp (t
, pos
));
4449 return TREE_INT_CST_LOW (t
);
4452 /* Return the most significant bit of the integer constant T. */
4455 tree_int_cst_msb (tree t
)
4459 unsigned HOST_WIDE_INT l
;
4461 /* Note that using TYPE_PRECISION here is wrong. We care about the
4462 actual bits, not the (arbitrary) range of the type. */
4463 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
4464 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
4465 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
4466 return (l
& 1) == 1;
4469 /* Return an indication of the sign of the integer constant T.
4470 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4471 Note that -1 will never be returned if T's type is unsigned. */
4474 tree_int_cst_sgn (tree t
)
4476 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
4478 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
4480 else if (TREE_INT_CST_HIGH (t
) < 0)
4486 /* Compare two constructor-element-type constants. Return 1 if the lists
4487 are known to be equal; otherwise return 0. */
4490 simple_cst_list_equal (tree l1
, tree l2
)
4492 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4494 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4497 l1
= TREE_CHAIN (l1
);
4498 l2
= TREE_CHAIN (l2
);
4504 /* Return truthvalue of whether T1 is the same tree structure as T2.
4505 Return 1 if they are the same.
4506 Return 0 if they are understandably different.
4507 Return -1 if either contains tree structure not understood by
4511 simple_cst_equal (tree t1
, tree t2
)
4513 enum tree_code code1
, code2
;
4519 if (t1
== 0 || t2
== 0)
4522 code1
= TREE_CODE (t1
);
4523 code2
= TREE_CODE (t2
);
4525 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
4527 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4528 || code2
== NON_LVALUE_EXPR
)
4529 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4531 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
4534 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4535 || code2
== NON_LVALUE_EXPR
)
4536 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
4544 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4545 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
4548 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
4551 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
4552 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
4553 TREE_STRING_LENGTH (t1
)));
4557 unsigned HOST_WIDE_INT idx
;
4558 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
4559 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
4561 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
4564 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
4565 /* ??? Should we handle also fields here? */
4566 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
4567 VEC_index (constructor_elt
, v2
, idx
)->value
))
4573 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4576 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4580 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4583 /* Special case: if either target is an unallocated VAR_DECL,
4584 it means that it's going to be unified with whatever the
4585 TARGET_EXPR is really supposed to initialize, so treat it
4586 as being equivalent to anything. */
4587 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
4588 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
4589 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
4590 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
4591 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
4592 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
4595 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4600 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4602 case WITH_CLEANUP_EXPR
:
4603 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4607 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
4610 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4611 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4625 /* This general rule works for most tree codes. All exceptions should be
4626 handled above. If this is a language-specific tree code, we can't
4627 trust what might be in the operand, so say we don't know
4629 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4632 switch (TREE_CODE_CLASS (code1
))
4636 case tcc_comparison
:
4637 case tcc_expression
:
4641 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
4643 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4655 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4656 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4657 than U, respectively. */
4660 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
4662 if (tree_int_cst_sgn (t
) < 0)
4664 else if (TREE_INT_CST_HIGH (t
) != 0)
4666 else if (TREE_INT_CST_LOW (t
) == u
)
4668 else if (TREE_INT_CST_LOW (t
) < u
)
4674 /* Return true if CODE represents an associative tree code. Otherwise
4677 associative_tree_code (enum tree_code code
)
4696 /* Return true if CODE represents a commutative tree code. Otherwise
4699 commutative_tree_code (enum tree_code code
)
4712 case UNORDERED_EXPR
:
4716 case TRUTH_AND_EXPR
:
4717 case TRUTH_XOR_EXPR
:
4727 /* Generate a hash value for an expression. This can be used iteratively
4728 by passing a previous result as the "val" argument.
4730 This function is intended to produce the same hash for expressions which
4731 would compare equal using operand_equal_p. */
4734 iterative_hash_expr (tree t
, hashval_t val
)
4737 enum tree_code code
;
4741 return iterative_hash_pointer (t
, val
);
4743 code
= TREE_CODE (t
);
4747 /* Alas, constants aren't shared, so we can't rely on pointer
4750 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
4751 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4754 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4756 return iterative_hash_hashval_t (val2
, val
);
4759 return iterative_hash (TREE_STRING_POINTER (t
),
4760 TREE_STRING_LENGTH (t
), val
);
4762 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4763 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4765 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4769 /* we can just compare by pointer. */
4770 return iterative_hash_pointer (t
, val
);
4773 /* A list of expressions, for a CALL_EXPR or as the elements of a
4775 for (; t
; t
= TREE_CHAIN (t
))
4776 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4780 unsigned HOST_WIDE_INT idx
;
4782 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
4784 val
= iterative_hash_expr (field
, val
);
4785 val
= iterative_hash_expr (value
, val
);
4790 /* When referring to a built-in FUNCTION_DECL, use the
4791 __builtin__ form. Otherwise nodes that compare equal
4792 according to operand_equal_p might get different
4794 if (DECL_BUILT_IN (t
))
4796 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
4800 /* else FALL THROUGH */
4802 class = TREE_CODE_CLASS (code
);
4804 if (class == tcc_declaration
)
4806 /* DECL's have a unique ID */
4807 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
4811 gcc_assert (IS_EXPR_CODE_CLASS (class));
4813 val
= iterative_hash_object (code
, val
);
4815 /* Don't hash the type, that can lead to having nodes which
4816 compare equal according to operand_equal_p, but which
4817 have different hash codes. */
4818 if (code
== NOP_EXPR
4819 || code
== CONVERT_EXPR
4820 || code
== NON_LVALUE_EXPR
)
4822 /* Make sure to include signness in the hash computation. */
4823 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4824 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4827 else if (commutative_tree_code (code
))
4829 /* It's a commutative expression. We want to hash it the same
4830 however it appears. We do this by first hashing both operands
4831 and then rehashing based on the order of their independent
4833 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4834 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4838 t
= one
, one
= two
, two
= t
;
4840 val
= iterative_hash_hashval_t (one
, val
);
4841 val
= iterative_hash_hashval_t (two
, val
);
4844 for (i
= TREE_CODE_LENGTH (code
) - 1; i
>= 0; --i
)
4845 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4852 /* Constructors for pointer, array and function types.
4853 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4854 constructed by language-dependent code, not here.) */
4856 /* Construct, lay out and return the type of pointers to TO_TYPE with
4857 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4858 reference all of memory. If such a type has already been
4859 constructed, reuse it. */
4862 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4867 if (to_type
== error_mark_node
)
4868 return error_mark_node
;
4870 /* In some cases, languages will have things that aren't a POINTER_TYPE
4871 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4872 In that case, return that type without regard to the rest of our
4875 ??? This is a kludge, but consistent with the way this function has
4876 always operated and there doesn't seem to be a good way to avoid this
4878 if (TYPE_POINTER_TO (to_type
) != 0
4879 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4880 return TYPE_POINTER_TO (to_type
);
4882 /* First, if we already have a type for pointers to TO_TYPE and it's
4883 the proper mode, use it. */
4884 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4885 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4888 t
= make_node (POINTER_TYPE
);
4890 TREE_TYPE (t
) = to_type
;
4891 TYPE_MODE (t
) = mode
;
4892 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4893 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4894 TYPE_POINTER_TO (to_type
) = t
;
4896 /* Lay out the type. This function has many callers that are concerned
4897 with expression-construction, and this simplifies them all. */
4903 /* By default build pointers in ptr_mode. */
4906 build_pointer_type (tree to_type
)
4908 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4911 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4914 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4919 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4920 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4921 In that case, return that type without regard to the rest of our
4924 ??? This is a kludge, but consistent with the way this function has
4925 always operated and there doesn't seem to be a good way to avoid this
4927 if (TYPE_REFERENCE_TO (to_type
) != 0
4928 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4929 return TYPE_REFERENCE_TO (to_type
);
4931 /* First, if we already have a type for pointers to TO_TYPE and it's
4932 the proper mode, use it. */
4933 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4934 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4937 t
= make_node (REFERENCE_TYPE
);
4939 TREE_TYPE (t
) = to_type
;
4940 TYPE_MODE (t
) = mode
;
4941 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4942 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4943 TYPE_REFERENCE_TO (to_type
) = t
;
4951 /* Build the node for the type of references-to-TO_TYPE by default
4955 build_reference_type (tree to_type
)
4957 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4960 /* Build a type that is compatible with t but has no cv quals anywhere
4963 const char *const *const * -> char ***. */
4966 build_type_no_quals (tree t
)
4968 switch (TREE_CODE (t
))
4971 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4973 TYPE_REF_CAN_ALIAS_ALL (t
));
4974 case REFERENCE_TYPE
:
4976 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4978 TYPE_REF_CAN_ALIAS_ALL (t
));
4980 return TYPE_MAIN_VARIANT (t
);
4984 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4985 MAXVAL should be the maximum value in the domain
4986 (one less than the length of the array).
4988 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4989 We don't enforce this limit, that is up to caller (e.g. language front end).
4990 The limit exists because the result is a signed type and we don't handle
4991 sizes that use more than one HOST_WIDE_INT. */
4994 build_index_type (tree maxval
)
4996 tree itype
= make_node (INTEGER_TYPE
);
4998 TREE_TYPE (itype
) = sizetype
;
4999 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
5000 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5001 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
5002 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
5003 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
5004 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
5005 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
5006 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
5008 if (host_integerp (maxval
, 1))
5009 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
5014 /* Builds a signed or unsigned integer type of precision PRECISION.
5015 Used for C bitfields whose precision does not match that of
5016 built-in target types. */
5018 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
5021 tree itype
= make_node (INTEGER_TYPE
);
5023 TYPE_PRECISION (itype
) = precision
;
5026 fixup_unsigned_type (itype
);
5028 fixup_signed_type (itype
);
5030 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
5031 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
5036 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5037 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5038 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5041 build_range_type (tree type
, tree lowval
, tree highval
)
5043 tree itype
= make_node (INTEGER_TYPE
);
5045 TREE_TYPE (itype
) = type
;
5046 if (type
== NULL_TREE
)
5049 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
5050 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
5052 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
5053 TYPE_MODE (itype
) = TYPE_MODE (type
);
5054 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
5055 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
5056 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
5057 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
5059 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
5060 return type_hash_canon (tree_low_cst (highval
, 0)
5061 - tree_low_cst (lowval
, 0),
5067 /* Just like build_index_type, but takes lowval and highval instead
5068 of just highval (maxval). */
5071 build_index_2_type (tree lowval
, tree highval
)
5073 return build_range_type (sizetype
, lowval
, highval
);
5076 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5077 and number of elements specified by the range of values of INDEX_TYPE.
5078 If such a type has already been constructed, reuse it. */
5081 build_array_type (tree elt_type
, tree index_type
)
5084 hashval_t hashcode
= 0;
5086 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
5088 error ("arrays of functions are not meaningful");
5089 elt_type
= integer_type_node
;
5092 t
= make_node (ARRAY_TYPE
);
5093 TREE_TYPE (t
) = elt_type
;
5094 TYPE_DOMAIN (t
) = index_type
;
5096 if (index_type
== 0)
5102 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5103 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
5104 t
= type_hash_canon (hashcode
, t
);
5106 if (!COMPLETE_TYPE_P (t
))
5111 /* Return the TYPE of the elements comprising
5112 the innermost dimension of ARRAY. */
5115 get_inner_array_type (tree array
)
5117 tree type
= TREE_TYPE (array
);
5119 while (TREE_CODE (type
) == ARRAY_TYPE
)
5120 type
= TREE_TYPE (type
);
5125 /* Construct, lay out and return
5126 the type of functions returning type VALUE_TYPE
5127 given arguments of types ARG_TYPES.
5128 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5129 are data type nodes for the arguments of the function.
5130 If such a type has already been constructed, reuse it. */
5133 build_function_type (tree value_type
, tree arg_types
)
5136 hashval_t hashcode
= 0;
5138 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
5140 error ("function return type cannot be function");
5141 value_type
= integer_type_node
;
5144 /* Make a node of the sort we want. */
5145 t
= make_node (FUNCTION_TYPE
);
5146 TREE_TYPE (t
) = value_type
;
5147 TYPE_ARG_TYPES (t
) = arg_types
;
5149 /* If we already have such a type, use the old one. */
5150 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
5151 hashcode
= type_hash_list (arg_types
, hashcode
);
5152 t
= type_hash_canon (hashcode
, t
);
5154 if (!COMPLETE_TYPE_P (t
))
5159 /* Build a function type. The RETURN_TYPE is the type returned by the
5160 function. If additional arguments are provided, they are
5161 additional argument types. The list of argument types must always
5162 be terminated by NULL_TREE. */
5165 build_function_type_list (tree return_type
, ...)
5170 va_start (p
, return_type
);
5172 t
= va_arg (p
, tree
);
5173 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
5174 args
= tree_cons (NULL_TREE
, t
, args
);
5176 if (args
== NULL_TREE
)
5177 args
= void_list_node
;
5181 args
= nreverse (args
);
5182 TREE_CHAIN (last
) = void_list_node
;
5184 args
= build_function_type (return_type
, args
);
5190 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5191 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5192 for the method. An implicit additional parameter (of type
5193 pointer-to-BASETYPE) is added to the ARGTYPES. */
5196 build_method_type_directly (tree basetype
,
5204 /* Make a node of the sort we want. */
5205 t
= make_node (METHOD_TYPE
);
5207 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5208 TREE_TYPE (t
) = rettype
;
5209 ptype
= build_pointer_type (basetype
);
5211 /* The actual arglist for this function includes a "hidden" argument
5212 which is "this". Put it into the list of argument types. */
5213 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
5214 TYPE_ARG_TYPES (t
) = argtypes
;
5216 /* If we already have such a type, use the old one. */
5217 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5218 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
5219 hashcode
= type_hash_list (argtypes
, hashcode
);
5220 t
= type_hash_canon (hashcode
, t
);
5222 if (!COMPLETE_TYPE_P (t
))
5228 /* Construct, lay out and return the type of methods belonging to class
5229 BASETYPE and whose arguments and values are described by TYPE.
5230 If that type exists already, reuse it.
5231 TYPE must be a FUNCTION_TYPE node. */
5234 build_method_type (tree basetype
, tree type
)
5236 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
5238 return build_method_type_directly (basetype
,
5240 TYPE_ARG_TYPES (type
));
5243 /* Construct, lay out and return the type of offsets to a value
5244 of type TYPE, within an object of type BASETYPE.
5245 If a suitable offset type exists already, reuse it. */
5248 build_offset_type (tree basetype
, tree type
)
5251 hashval_t hashcode
= 0;
5253 /* Make a node of the sort we want. */
5254 t
= make_node (OFFSET_TYPE
);
5256 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5257 TREE_TYPE (t
) = type
;
5259 /* If we already have such a type, use the old one. */
5260 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5261 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
5262 t
= type_hash_canon (hashcode
, t
);
5264 if (!COMPLETE_TYPE_P (t
))
5270 /* Create a complex type whose components are COMPONENT_TYPE. */
5273 build_complex_type (tree component_type
)
5278 /* Make a node of the sort we want. */
5279 t
= make_node (COMPLEX_TYPE
);
5281 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
5283 /* If we already have such a type, use the old one. */
5284 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
5285 t
= type_hash_canon (hashcode
, t
);
5287 if (!COMPLETE_TYPE_P (t
))
5290 /* If we are writing Dwarf2 output we need to create a name,
5291 since complex is a fundamental type. */
5292 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
5296 if (component_type
== char_type_node
)
5297 name
= "complex char";
5298 else if (component_type
== signed_char_type_node
)
5299 name
= "complex signed char";
5300 else if (component_type
== unsigned_char_type_node
)
5301 name
= "complex unsigned char";
5302 else if (component_type
== short_integer_type_node
)
5303 name
= "complex short int";
5304 else if (component_type
== short_unsigned_type_node
)
5305 name
= "complex short unsigned int";
5306 else if (component_type
== integer_type_node
)
5307 name
= "complex int";
5308 else if (component_type
== unsigned_type_node
)
5309 name
= "complex unsigned int";
5310 else if (component_type
== long_integer_type_node
)
5311 name
= "complex long int";
5312 else if (component_type
== long_unsigned_type_node
)
5313 name
= "complex long unsigned int";
5314 else if (component_type
== long_long_integer_type_node
)
5315 name
= "complex long long int";
5316 else if (component_type
== long_long_unsigned_type_node
)
5317 name
= "complex long long unsigned int";
5322 TYPE_NAME (t
) = get_identifier (name
);
5325 return build_qualified_type (t
, TYPE_QUALS (component_type
));
5328 /* Return OP, stripped of any conversions to wider types as much as is safe.
5329 Converting the value back to OP's type makes a value equivalent to OP.
5331 If FOR_TYPE is nonzero, we return a value which, if converted to
5332 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5334 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5335 narrowest type that can hold the value, even if they don't exactly fit.
5336 Otherwise, bit-field references are changed to a narrower type
5337 only if they can be fetched directly from memory in that type.
5339 OP must have integer, real or enumeral type. Pointers are not allowed!
5341 There are some cases where the obvious value we could return
5342 would regenerate to OP if converted to OP's type,
5343 but would not extend like OP to wider types.
5344 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5345 For example, if OP is (unsigned short)(signed char)-1,
5346 we avoid returning (signed char)-1 if FOR_TYPE is int,
5347 even though extending that to an unsigned short would regenerate OP,
5348 since the result of extending (signed char)-1 to (int)
5349 is different from (int) OP. */
5352 get_unwidened (tree op
, tree for_type
)
5354 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5355 tree type
= TREE_TYPE (op
);
5357 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
5359 = (for_type
!= 0 && for_type
!= type
5360 && final_prec
> TYPE_PRECISION (type
)
5361 && TYPE_UNSIGNED (type
));
5364 while (TREE_CODE (op
) == NOP_EXPR
5365 || TREE_CODE (op
) == CONVERT_EXPR
)
5369 /* TYPE_PRECISION on vector types has different meaning
5370 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5371 so avoid them here. */
5372 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
5375 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
5376 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
5378 /* Truncations are many-one so cannot be removed.
5379 Unless we are later going to truncate down even farther. */
5381 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
5384 /* See what's inside this conversion. If we decide to strip it,
5386 op
= TREE_OPERAND (op
, 0);
5388 /* If we have not stripped any zero-extensions (uns is 0),
5389 we can strip any kind of extension.
5390 If we have previously stripped a zero-extension,
5391 only zero-extensions can safely be stripped.
5392 Any extension can be stripped if the bits it would produce
5393 are all going to be discarded later by truncating to FOR_TYPE. */
5397 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
5399 /* TYPE_UNSIGNED says whether this is a zero-extension.
5400 Let's avoid computing it if it does not affect WIN
5401 and if UNS will not be needed again. */
5403 || TREE_CODE (op
) == NOP_EXPR
5404 || TREE_CODE (op
) == CONVERT_EXPR
)
5405 && TYPE_UNSIGNED (TREE_TYPE (op
)))
5413 if (TREE_CODE (op
) == COMPONENT_REF
5414 /* Since type_for_size always gives an integer type. */
5415 && TREE_CODE (type
) != REAL_TYPE
5416 /* Don't crash if field not laid out yet. */
5417 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
5418 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
5420 unsigned int innerprec
5421 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
5422 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
5423 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
5424 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
5426 /* We can get this structure field in the narrowest type it fits in.
5427 If FOR_TYPE is 0, do this only for a field that matches the
5428 narrower type exactly and is aligned for it
5429 The resulting extension to its nominal type (a fullword type)
5430 must fit the same conditions as for other extensions. */
5433 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
5434 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
5435 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
5437 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
5438 TREE_OPERAND (op
, 1), NULL_TREE
);
5439 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
5440 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
5447 /* Return OP or a simpler expression for a narrower value
5448 which can be sign-extended or zero-extended to give back OP.
5449 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5450 or 0 if the value should be sign-extended. */
5453 get_narrower (tree op
, int *unsignedp_ptr
)
5458 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
5460 while (TREE_CODE (op
) == NOP_EXPR
)
5463 = (TYPE_PRECISION (TREE_TYPE (op
))
5464 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
5466 /* Truncations are many-one so cannot be removed. */
5470 /* See what's inside this conversion. If we decide to strip it,
5475 op
= TREE_OPERAND (op
, 0);
5476 /* An extension: the outermost one can be stripped,
5477 but remember whether it is zero or sign extension. */
5479 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5480 /* Otherwise, if a sign extension has been stripped,
5481 only sign extensions can now be stripped;
5482 if a zero extension has been stripped, only zero-extensions. */
5483 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
5487 else /* bitschange == 0 */
5489 /* A change in nominal type can always be stripped, but we must
5490 preserve the unsignedness. */
5492 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5494 op
= TREE_OPERAND (op
, 0);
5495 /* Keep trying to narrow, but don't assign op to win if it
5496 would turn an integral type into something else. */
5497 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
5504 if (TREE_CODE (op
) == COMPONENT_REF
5505 /* Since type_for_size always gives an integer type. */
5506 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
5507 /* Ensure field is laid out already. */
5508 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
5509 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
5511 unsigned HOST_WIDE_INT innerprec
5512 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
5513 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
5514 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
5515 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
5517 /* We can get this structure field in a narrower type that fits it,
5518 but the resulting extension to its nominal type (a fullword type)
5519 must satisfy the same conditions as for other extensions.
5521 Do this only for fields that are aligned (not bit-fields),
5522 because when bit-field insns will be used there is no
5523 advantage in doing this. */
5525 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
5526 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
5527 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
5531 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
5532 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
5533 TREE_OPERAND (op
, 1), NULL_TREE
);
5534 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
5535 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
5538 *unsignedp_ptr
= uns
;
5542 /* Nonzero if integer constant C has a value that is permissible
5543 for type TYPE (an INTEGER_TYPE). */
5546 int_fits_type_p (tree c
, tree type
)
5548 tree type_low_bound
= TYPE_MIN_VALUE (type
);
5549 tree type_high_bound
= TYPE_MAX_VALUE (type
);
5550 bool ok_for_low_bound
, ok_for_high_bound
;
5553 /* If at least one bound of the type is a constant integer, we can check
5554 ourselves and maybe make a decision. If no such decision is possible, but
5555 this type is a subtype, try checking against that. Otherwise, use
5556 force_fit_type, which checks against the precision.
5558 Compute the status for each possibly constant bound, and return if we see
5559 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5560 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5561 for "constant known to fit". */
5563 /* Check if C >= type_low_bound. */
5564 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
5566 if (tree_int_cst_lt (c
, type_low_bound
))
5568 ok_for_low_bound
= true;
5571 ok_for_low_bound
= false;
5573 /* Check if c <= type_high_bound. */
5574 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
5576 if (tree_int_cst_lt (type_high_bound
, c
))
5578 ok_for_high_bound
= true;
5581 ok_for_high_bound
= false;
5583 /* If the constant fits both bounds, the result is known. */
5584 if (ok_for_low_bound
&& ok_for_high_bound
)
5587 /* Perform some generic filtering which may allow making a decision
5588 even if the bounds are not constant. First, negative integers
5589 never fit in unsigned types, */
5590 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
5593 /* Second, narrower types always fit in wider ones. */
5594 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
5597 /* Third, unsigned integers with top bit set never fit signed types. */
5598 if (! TYPE_UNSIGNED (type
)
5599 && TYPE_UNSIGNED (TREE_TYPE (c
))
5600 && tree_int_cst_msb (c
))
5603 /* If we haven't been able to decide at this point, there nothing more we
5604 can check ourselves here. Look at the base type if we have one and it
5605 has the same precision. */
5606 if (TREE_CODE (type
) == INTEGER_TYPE
5607 && TREE_TYPE (type
) != 0
5608 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
5609 return int_fits_type_p (c
, TREE_TYPE (type
));
5611 /* Or to force_fit_type, if nothing else. */
5612 tmp
= copy_node (c
);
5613 TREE_TYPE (tmp
) = type
;
5614 tmp
= force_fit_type (tmp
, -1, false, false);
5615 return TREE_INT_CST_HIGH (tmp
) == TREE_INT_CST_HIGH (c
)
5616 && TREE_INT_CST_LOW (tmp
) == TREE_INT_CST_LOW (c
);
5619 /* Subprogram of following function. Called by walk_tree.
5621 Return *TP if it is an automatic variable or parameter of the
5622 function passed in as DATA. */
5625 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
5627 tree fn
= (tree
) data
;
5632 else if (DECL_P (*tp
)
5633 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
5639 /* Returns true if T is, contains, or refers to a type with variable
5640 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
5641 arguments, but not the return type. If FN is nonzero, only return
5642 true if a modifier of the type or position of FN is a variable or
5643 parameter inside FN.
5645 This concept is more general than that of C99 'variably modified types':
5646 in C99, a struct type is never variably modified because a VLA may not
5647 appear as a structure member. However, in GNU C code like:
5649 struct S { int i[f()]; };
5651 is valid, and other languages may define similar constructs. */
5654 variably_modified_type_p (tree type
, tree fn
)
5658 /* Test if T is either variable (if FN is zero) or an expression containing
5659 a variable in FN. */
5660 #define RETURN_TRUE_IF_VAR(T) \
5661 do { tree _t = (T); \
5662 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5663 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5664 return true; } while (0)
5666 if (type
== error_mark_node
)
5669 /* If TYPE itself has variable size, it is variably modified. */
5670 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
5671 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
5673 switch (TREE_CODE (type
))
5676 case REFERENCE_TYPE
:
5678 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5684 /* If TYPE is a function type, it is variably modified if the
5685 return type is variably modified. */
5686 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5694 /* Scalar types are variably modified if their end points
5696 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
5697 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
5702 case QUAL_UNION_TYPE
:
5703 /* We can't see if any of the fields are variably-modified by the
5704 definition we normally use, since that would produce infinite
5705 recursion via pointers. */
5706 /* This is variably modified if some field's type is. */
5707 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5708 if (TREE_CODE (t
) == FIELD_DECL
)
5710 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
5711 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
5712 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
5714 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
5715 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
5720 /* Do not call ourselves to avoid infinite recursion. This is
5721 variably modified if the element type is. */
5722 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
5723 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
5730 /* The current language may have other cases to check, but in general,
5731 all other types are not variably modified. */
5732 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
5734 #undef RETURN_TRUE_IF_VAR
5737 /* Given a DECL or TYPE, return the scope in which it was declared, or
5738 NULL_TREE if there is no containing scope. */
5741 get_containing_scope (tree t
)
5743 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
5746 /* Return the innermost context enclosing DECL that is
5747 a FUNCTION_DECL, or zero if none. */
5750 decl_function_context (tree decl
)
5754 if (TREE_CODE (decl
) == ERROR_MARK
)
5757 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5758 where we look up the function at runtime. Such functions always take
5759 a first argument of type 'pointer to real context'.
5761 C++ should really be fixed to use DECL_CONTEXT for the real context,
5762 and use something else for the "virtual context". */
5763 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
5766 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
5768 context
= DECL_CONTEXT (decl
);
5770 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
5772 if (TREE_CODE (context
) == BLOCK
)
5773 context
= BLOCK_SUPERCONTEXT (context
);
5775 context
= get_containing_scope (context
);
5781 /* Return the innermost context enclosing DECL that is
5782 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5783 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5786 decl_type_context (tree decl
)
5788 tree context
= DECL_CONTEXT (decl
);
5791 switch (TREE_CODE (context
))
5793 case NAMESPACE_DECL
:
5794 case TRANSLATION_UNIT_DECL
:
5799 case QUAL_UNION_TYPE
:
5804 context
= DECL_CONTEXT (context
);
5808 context
= BLOCK_SUPERCONTEXT (context
);
5818 /* CALL is a CALL_EXPR. Return the declaration for the function
5819 called, or NULL_TREE if the called function cannot be
5823 get_callee_fndecl (tree call
)
5827 if (call
== error_mark_node
)
5830 /* It's invalid to call this function with anything but a
5832 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5834 /* The first operand to the CALL is the address of the function
5836 addr
= TREE_OPERAND (call
, 0);
5840 /* If this is a readonly function pointer, extract its initial value. */
5841 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5842 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5843 && DECL_INITIAL (addr
))
5844 addr
= DECL_INITIAL (addr
);
5846 /* If the address is just `&f' for some function `f', then we know
5847 that `f' is being called. */
5848 if (TREE_CODE (addr
) == ADDR_EXPR
5849 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5850 return TREE_OPERAND (addr
, 0);
5852 /* We couldn't figure out what was being called. Maybe the front
5853 end has some idea. */
5854 return lang_hooks
.lang_get_callee_fndecl (call
);
5857 /* Print debugging information about tree nodes generated during the compile,
5858 and any language-specific information. */
5861 dump_tree_statistics (void)
5863 #ifdef GATHER_STATISTICS
5865 int total_nodes
, total_bytes
;
5868 fprintf (stderr
, "\n??? tree nodes created\n\n");
5869 #ifdef GATHER_STATISTICS
5870 fprintf (stderr
, "Kind Nodes Bytes\n");
5871 fprintf (stderr
, "---------------------------------------\n");
5872 total_nodes
= total_bytes
= 0;
5873 for (i
= 0; i
< (int) all_kinds
; i
++)
5875 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5876 tree_node_counts
[i
], tree_node_sizes
[i
]);
5877 total_nodes
+= tree_node_counts
[i
];
5878 total_bytes
+= tree_node_sizes
[i
];
5880 fprintf (stderr
, "---------------------------------------\n");
5881 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5882 fprintf (stderr
, "---------------------------------------\n");
5883 ssanames_print_statistics ();
5884 phinodes_print_statistics ();
5886 fprintf (stderr
, "(No per-node statistics)\n");
5888 print_type_hash_statistics ();
5889 print_debug_expr_statistics ();
5890 print_value_expr_statistics ();
5891 print_restrict_base_statistics ();
5892 lang_hooks
.print_statistics ();
5895 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5897 /* Generate a crc32 of a string. */
5900 crc32_string (unsigned chksum
, const char *string
)
5904 unsigned value
= *string
<< 24;
5907 for (ix
= 8; ix
--; value
<<= 1)
5911 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5920 /* P is a string that will be used in a symbol. Mask out any characters
5921 that are not valid in that context. */
5924 clean_symbol_name (char *p
)
5928 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5931 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5938 /* Generate a name for a function unique to this translation unit.
5939 TYPE is some string to identify the purpose of this function to the
5940 linker or collect2. */
5943 get_file_function_name_long (const char *type
)
5949 if (first_global_object_name
)
5951 p
= first_global_object_name
;
5953 /* For type 'F', the generated name must be unique not only to this
5954 translation unit but also to any given link. Since global names
5955 can be overloaded, we concatenate the first global object name
5956 with a string derived from the file name of this object. */
5957 if (!strcmp (type
, "F"))
5959 const char *file
= main_input_filename
;
5962 file
= input_filename
;
5964 q
= alloca (strlen (p
) + 10);
5965 sprintf (q
, "%s_%08X", p
, crc32_string (0, file
));
5972 /* We don't have anything that we know to be unique to this translation
5973 unit, so use what we do have and throw in some randomness. */
5975 const char *name
= weak_global_object_name
;
5976 const char *file
= main_input_filename
;
5981 file
= input_filename
;
5983 len
= strlen (file
);
5984 q
= alloca (9 * 2 + len
+ 1);
5985 memcpy (q
, file
, len
+ 1);
5986 clean_symbol_name (q
);
5988 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5989 crc32_string (0, flag_random_seed
));
5994 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5996 /* Set up the name of the file-level functions we may need.
5997 Use a global object (which is already required to be unique over
5998 the program) rather than the file name (which imposes extra
6000 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
6002 return get_identifier (buf
);
6005 /* If KIND=='I', return a suitable global initializer (constructor) name.
6006 If KIND=='D', return a suitable global clean-up (destructor) name. */
6009 get_file_function_name (int kind
)
6016 return get_file_function_name_long (p
);
6019 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6021 /* Complain that the tree code of NODE does not match the expected 0
6022 terminated list of trailing codes. The trailing code list can be
6023 empty, for a more vague error message. FILE, LINE, and FUNCTION
6024 are of the caller. */
6027 tree_check_failed (const tree node
, const char *file
,
6028 int line
, const char *function
, ...)
6032 unsigned length
= 0;
6035 va_start (args
, function
);
6036 while ((code
= va_arg (args
, int)))
6037 length
+= 4 + strlen (tree_code_name
[code
]);
6041 va_start (args
, function
);
6042 length
+= strlen ("expected ");
6043 buffer
= alloca (length
);
6045 while ((code
= va_arg (args
, int)))
6047 const char *prefix
= length
? " or " : "expected ";
6049 strcpy (buffer
+ length
, prefix
);
6050 length
+= strlen (prefix
);
6051 strcpy (buffer
+ length
, tree_code_name
[code
]);
6052 length
+= strlen (tree_code_name
[code
]);
6057 buffer
= (char *)"unexpected node";
6059 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6060 buffer
, tree_code_name
[TREE_CODE (node
)],
6061 function
, trim_filename (file
), line
);
6064 /* Complain that the tree code of NODE does match the expected 0
6065 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6069 tree_not_check_failed (const tree node
, const char *file
,
6070 int line
, const char *function
, ...)
6074 unsigned length
= 0;
6077 va_start (args
, function
);
6078 while ((code
= va_arg (args
, int)))
6079 length
+= 4 + strlen (tree_code_name
[code
]);
6081 va_start (args
, function
);
6082 buffer
= alloca (length
);
6084 while ((code
= va_arg (args
, int)))
6088 strcpy (buffer
+ length
, " or ");
6091 strcpy (buffer
+ length
, tree_code_name
[code
]);
6092 length
+= strlen (tree_code_name
[code
]);
6096 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6097 buffer
, tree_code_name
[TREE_CODE (node
)],
6098 function
, trim_filename (file
), line
);
6101 /* Similar to tree_check_failed, except that we check for a class of tree
6102 code, given in CL. */
6105 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
6106 const char *file
, int line
, const char *function
)
6109 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6110 TREE_CODE_CLASS_STRING (cl
),
6111 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6112 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6115 /* Similar to tree_check_failed, except that instead of specifying a
6116 dozen codes, use the knowledge that they're all sequential. */
6119 tree_range_check_failed (const tree node
, const char *file
, int line
,
6120 const char *function
, enum tree_code c1
,
6124 unsigned length
= 0;
6127 for (c
= c1
; c
<= c2
; ++c
)
6128 length
+= 4 + strlen (tree_code_name
[c
]);
6130 length
+= strlen ("expected ");
6131 buffer
= alloca (length
);
6134 for (c
= c1
; c
<= c2
; ++c
)
6136 const char *prefix
= length
? " or " : "expected ";
6138 strcpy (buffer
+ length
, prefix
);
6139 length
+= strlen (prefix
);
6140 strcpy (buffer
+ length
, tree_code_name
[c
]);
6141 length
+= strlen (tree_code_name
[c
]);
6144 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6145 buffer
, tree_code_name
[TREE_CODE (node
)],
6146 function
, trim_filename (file
), line
);
6150 /* Similar to tree_check_failed, except that we check that a tree does
6151 not have the specified code, given in CL. */
6154 tree_not_class_check_failed (const tree node
, const enum tree_code_class cl
,
6155 const char *file
, int line
, const char *function
)
6158 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6159 TREE_CODE_CLASS_STRING (cl
),
6160 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6161 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6165 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6168 omp_clause_check_failed (const tree node
, const char *file
, int line
,
6169 const char *function
, enum omp_clause_code code
)
6171 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6172 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
6173 function
, trim_filename (file
), line
);
6177 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6180 omp_clause_range_check_failed (const tree node
, const char *file
, int line
,
6181 const char *function
, enum omp_clause_code c1
,
6182 enum omp_clause_code c2
)
6185 unsigned length
= 0;
6186 enum omp_clause_code c
;
6188 for (c
= c1
; c
<= c2
; ++c
)
6189 length
+= 4 + strlen (omp_clause_code_name
[c
]);
6191 length
+= strlen ("expected ");
6192 buffer
= alloca (length
);
6195 for (c
= c1
; c
<= c2
; ++c
)
6197 const char *prefix
= length
? " or " : "expected ";
6199 strcpy (buffer
+ length
, prefix
);
6200 length
+= strlen (prefix
);
6201 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
6202 length
+= strlen (omp_clause_code_name
[c
]);
6205 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6206 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
6207 function
, trim_filename (file
), line
);
6211 #undef DEFTREESTRUCT
6212 #define DEFTREESTRUCT(VAL, NAME) NAME,
6214 static const char *ts_enum_names
[] = {
6215 #include "treestruct.def"
6217 #undef DEFTREESTRUCT
6219 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6221 /* Similar to tree_class_check_failed, except that we check for
6222 whether CODE contains the tree structure identified by EN. */
6225 tree_contains_struct_check_failed (const tree node
,
6226 const enum tree_node_structure_enum en
,
6227 const char *file
, int line
,
6228 const char *function
)
6231 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6233 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6237 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6238 (dynamically sized) vector. */
6241 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6242 const char *function
)
6245 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6246 idx
+ 1, len
, function
, trim_filename (file
), line
);
6249 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6250 (dynamically sized) vector. */
6253 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6254 const char *function
)
6257 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6258 idx
+ 1, len
, function
, trim_filename (file
), line
);
6261 /* Similar to above, except that the check is for the bounds of the operand
6262 vector of an expression node. */
6265 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
6266 int line
, const char *function
)
6269 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6270 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
6271 function
, trim_filename (file
), line
);
6274 /* Similar to above, except that the check is for the number of
6275 operands of an OMP_CLAUSE node. */
6278 omp_clause_operand_check_failed (int idx
, tree t
, const char *file
,
6279 int line
, const char *function
)
6282 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6283 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
6284 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
6285 trim_filename (file
), line
);
6287 #endif /* ENABLE_TREE_CHECKING */
6289 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6290 and mapped to the machine mode MODE. Initialize its fields and build
6291 the information necessary for debugging output. */
6294 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
6296 tree t
= make_node (VECTOR_TYPE
);
6298 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
6299 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
6300 TYPE_MODE (t
) = mode
;
6301 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
6302 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
6307 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
6308 tree array
= build_array_type (innertype
, build_index_type (index
));
6309 tree rt
= make_node (RECORD_TYPE
);
6311 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
6312 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
6314 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
6315 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6316 the representation type, and we want to find that die when looking up
6317 the vector type. This is most easily achieved by making the TYPE_UID
6319 TYPE_UID (rt
) = TYPE_UID (t
);
6322 /* Build our main variant, based on the main variant of the inner type. */
6323 if (TYPE_MAIN_VARIANT (innertype
) != innertype
)
6325 tree innertype_main_variant
= TYPE_MAIN_VARIANT (innertype
);
6326 unsigned int hash
= TYPE_HASH (innertype_main_variant
);
6327 TYPE_MAIN_VARIANT (t
)
6328 = type_hash_canon (hash
, make_vector_type (innertype_main_variant
,
6336 make_or_reuse_type (unsigned size
, int unsignedp
)
6338 if (size
== INT_TYPE_SIZE
)
6339 return unsignedp
? unsigned_type_node
: integer_type_node
;
6340 if (size
== CHAR_TYPE_SIZE
)
6341 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
6342 if (size
== SHORT_TYPE_SIZE
)
6343 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
6344 if (size
== LONG_TYPE_SIZE
)
6345 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
6346 if (size
== LONG_LONG_TYPE_SIZE
)
6347 return (unsignedp
? long_long_unsigned_type_node
6348 : long_long_integer_type_node
);
6351 return make_unsigned_type (size
);
6353 return make_signed_type (size
);
6356 /* Create nodes for all integer types (and error_mark_node) using the sizes
6357 of C datatypes. The caller should call set_sizetype soon after calling
6358 this function to select one of the types as sizetype. */
6361 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
6363 error_mark_node
= make_node (ERROR_MARK
);
6364 TREE_TYPE (error_mark_node
) = error_mark_node
;
6366 initialize_sizetypes (signed_sizetype
);
6368 /* Define both `signed char' and `unsigned char'. */
6369 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6370 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
6371 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6372 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
6374 /* Define `char', which is like either `signed char' or `unsigned char'
6375 but not the same as either. */
6378 ? make_signed_type (CHAR_TYPE_SIZE
)
6379 : make_unsigned_type (CHAR_TYPE_SIZE
));
6380 TYPE_STRING_FLAG (char_type_node
) = 1;
6382 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6383 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6384 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6385 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6386 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6387 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6388 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6389 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6391 /* Define a boolean type. This type only represents boolean values but
6392 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6393 Front ends which want to override this size (i.e. Java) can redefine
6394 boolean_type_node before calling build_common_tree_nodes_2. */
6395 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6396 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6397 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
6398 TYPE_PRECISION (boolean_type_node
) = 1;
6400 /* Fill in the rest of the sized types. Reuse existing type nodes
6402 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
6403 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
6404 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
6405 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
6406 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
6408 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
6409 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
6410 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
6411 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
6412 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
6414 access_public_node
= get_identifier ("public");
6415 access_protected_node
= get_identifier ("protected");
6416 access_private_node
= get_identifier ("private");
6419 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6420 It will create several other common tree nodes. */
6423 build_common_tree_nodes_2 (int short_double
)
6425 /* Define these next since types below may used them. */
6426 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
6427 integer_one_node
= build_int_cst (NULL_TREE
, 1);
6428 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
6430 size_zero_node
= size_int (0);
6431 size_one_node
= size_int (1);
6432 bitsize_zero_node
= bitsize_int (0);
6433 bitsize_one_node
= bitsize_int (1);
6434 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
6436 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
6437 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
6439 void_type_node
= make_node (VOID_TYPE
);
6440 layout_type (void_type_node
);
6442 /* We are not going to have real types in C with less than byte alignment,
6443 so we might as well not have any types that claim to have it. */
6444 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
6445 TYPE_USER_ALIGN (void_type_node
) = 0;
6447 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
6448 layout_type (TREE_TYPE (null_pointer_node
));
6450 ptr_type_node
= build_pointer_type (void_type_node
);
6452 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
6453 fileptr_type_node
= ptr_type_node
;
6455 float_type_node
= make_node (REAL_TYPE
);
6456 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6457 layout_type (float_type_node
);
6459 double_type_node
= make_node (REAL_TYPE
);
6461 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6463 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6464 layout_type (double_type_node
);
6466 long_double_type_node
= make_node (REAL_TYPE
);
6467 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6468 layout_type (long_double_type_node
);
6470 float_ptr_type_node
= build_pointer_type (float_type_node
);
6471 double_ptr_type_node
= build_pointer_type (double_type_node
);
6472 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
6473 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
6475 /* Decimal float types. */
6476 dfloat32_type_node
= make_node (REAL_TYPE
);
6477 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
6478 layout_type (dfloat32_type_node
);
6479 TYPE_MODE (dfloat32_type_node
) = SDmode
;
6480 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
6482 dfloat64_type_node
= make_node (REAL_TYPE
);
6483 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
6484 layout_type (dfloat64_type_node
);
6485 TYPE_MODE (dfloat64_type_node
) = DDmode
;
6486 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
6488 dfloat128_type_node
= make_node (REAL_TYPE
);
6489 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
6490 layout_type (dfloat128_type_node
);
6491 TYPE_MODE (dfloat128_type_node
) = TDmode
;
6492 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
6494 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6495 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6496 layout_type (complex_integer_type_node
);
6498 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6499 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6500 layout_type (complex_float_type_node
);
6502 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6503 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6504 layout_type (complex_double_type_node
);
6506 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6507 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6508 layout_type (complex_long_double_type_node
);
6511 tree t
= targetm
.build_builtin_va_list ();
6513 /* Many back-ends define record types without setting TYPE_NAME.
6514 If we copied the record type here, we'd keep the original
6515 record type without a name. This breaks name mangling. So,
6516 don't copy record types and let c_common_nodes_and_builtins()
6517 declare the type to be __builtin_va_list. */
6518 if (TREE_CODE (t
) != RECORD_TYPE
)
6519 t
= build_variant_type_copy (t
);
6521 va_list_type_node
= t
;
6525 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6528 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
6529 const char *library_name
, int ecf_flags
)
6533 decl
= lang_hooks
.builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
6534 library_name
, NULL_TREE
);
6535 if (ecf_flags
& ECF_CONST
)
6536 TREE_READONLY (decl
) = 1;
6537 if (ecf_flags
& ECF_PURE
)
6538 DECL_IS_PURE (decl
) = 1;
6539 if (ecf_flags
& ECF_NORETURN
)
6540 TREE_THIS_VOLATILE (decl
) = 1;
6541 if (ecf_flags
& ECF_NOTHROW
)
6542 TREE_NOTHROW (decl
) = 1;
6543 if (ecf_flags
& ECF_MALLOC
)
6544 DECL_IS_MALLOC (decl
) = 1;
6546 built_in_decls
[code
] = decl
;
6547 implicit_built_in_decls
[code
] = decl
;
6550 /* Call this function after instantiating all builtins that the language
6551 front end cares about. This will build the rest of the builtins that
6552 are relied upon by the tree optimizers and the middle-end. */
6555 build_common_builtin_nodes (void)
6559 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
6560 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
6562 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6563 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
6564 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6565 ftype
= build_function_type (ptr_type_node
, tmp
);
6567 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
6568 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
6569 "memcpy", ECF_NOTHROW
);
6570 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
6571 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
6572 "memmove", ECF_NOTHROW
);
6575 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
6577 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6578 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
6579 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
6580 ftype
= build_function_type (integer_type_node
, tmp
);
6581 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
6582 "memcmp", ECF_PURE
| ECF_NOTHROW
);
6585 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
6587 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6588 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
6589 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6590 ftype
= build_function_type (ptr_type_node
, tmp
);
6591 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
6592 "memset", ECF_NOTHROW
);
6595 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
6597 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
6598 ftype
= build_function_type (ptr_type_node
, tmp
);
6599 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
6600 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
6603 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6604 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6605 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6606 ftype
= build_function_type (void_type_node
, tmp
);
6607 local_define_builtin ("__builtin_init_trampoline", ftype
,
6608 BUILT_IN_INIT_TRAMPOLINE
,
6609 "__builtin_init_trampoline", ECF_NOTHROW
);
6611 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6612 ftype
= build_function_type (ptr_type_node
, tmp
);
6613 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
6614 BUILT_IN_ADJUST_TRAMPOLINE
,
6615 "__builtin_adjust_trampoline",
6616 ECF_CONST
| ECF_NOTHROW
);
6618 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6619 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
6620 ftype
= build_function_type (void_type_node
, tmp
);
6621 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
6622 BUILT_IN_NONLOCAL_GOTO
,
6623 "__builtin_nonlocal_goto",
6624 ECF_NORETURN
| ECF_NOTHROW
);
6626 ftype
= build_function_type (ptr_type_node
, void_list_node
);
6627 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
6628 "__builtin_stack_save", ECF_NOTHROW
);
6630 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
6631 ftype
= build_function_type (void_type_node
, tmp
);
6632 local_define_builtin ("__builtin_stack_restore", ftype
,
6633 BUILT_IN_STACK_RESTORE
,
6634 "__builtin_stack_restore", ECF_NOTHROW
);
6636 ftype
= build_function_type (void_type_node
, void_list_node
);
6637 local_define_builtin ("__builtin_profile_func_enter", ftype
,
6638 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
6639 local_define_builtin ("__builtin_profile_func_exit", ftype
,
6640 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
6642 /* Complex multiplication and division. These are handled as builtins
6643 rather than optabs because emit_library_call_value doesn't support
6644 complex. Further, we can do slightly better with folding these
6645 beasties if the real and complex parts of the arguments are separate. */
6647 enum machine_mode mode
;
6649 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
6651 char mode_name_buf
[4], *q
;
6653 enum built_in_function mcode
, dcode
;
6654 tree type
, inner_type
;
6656 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
6659 inner_type
= TREE_TYPE (type
);
6661 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
6662 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6663 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6664 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6665 ftype
= build_function_type (type
, tmp
);
6667 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
6668 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
6670 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
6674 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
6675 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
6676 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
6678 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
6679 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
6680 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
6685 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6688 If we requested a pointer to a vector, build up the pointers that
6689 we stripped off while looking for the inner type. Similarly for
6690 return values from functions.
6692 The argument TYPE is the top of the chain, and BOTTOM is the
6693 new type which we will point to. */
6696 reconstruct_complex_type (tree type
, tree bottom
)
6700 if (POINTER_TYPE_P (type
))
6702 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6703 outer
= build_pointer_type (inner
);
6705 else if (TREE_CODE (type
) == ARRAY_TYPE
)
6707 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6708 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
6710 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
6712 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6713 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
6715 else if (TREE_CODE (type
) == METHOD_TYPE
)
6718 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6719 /* The build_method_type_directly() routine prepends 'this' to argument list,
6720 so we must compensate by getting rid of it. */
6721 argtypes
= TYPE_ARG_TYPES (type
);
6722 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
6724 TYPE_ARG_TYPES (type
));
6725 TYPE_ARG_TYPES (outer
) = argtypes
;
6730 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
6731 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
6736 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6739 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
6743 switch (GET_MODE_CLASS (mode
))
6745 case MODE_VECTOR_INT
:
6746 case MODE_VECTOR_FLOAT
:
6747 nunits
= GET_MODE_NUNITS (mode
);
6751 /* Check that there are no leftover bits. */
6752 gcc_assert (GET_MODE_BITSIZE (mode
)
6753 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
6755 nunits
= GET_MODE_BITSIZE (mode
)
6756 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
6763 return make_vector_type (innertype
, nunits
, mode
);
6766 /* Similarly, but takes the inner type and number of units, which must be
6770 build_vector_type (tree innertype
, int nunits
)
6772 return make_vector_type (innertype
, nunits
, VOIDmode
);
6775 /* Build RESX_EXPR with given REGION_NUMBER. */
6777 build_resx (int region_number
)
6780 t
= build1 (RESX_EXPR
, void_type_node
,
6781 build_int_cst (NULL_TREE
, region_number
));
6785 /* Given an initializer INIT, return TRUE if INIT is zero or some
6786 aggregate of zeros. Otherwise return FALSE. */
6788 initializer_zerop (tree init
)
6794 switch (TREE_CODE (init
))
6797 return integer_zerop (init
);
6800 /* ??? Note that this is not correct for C4X float formats. There,
6801 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6802 negative exponent. */
6803 return real_zerop (init
)
6804 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
6807 return integer_zerop (init
)
6808 || (real_zerop (init
)
6809 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
6810 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
6813 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
6814 if (!initializer_zerop (TREE_VALUE (elt
)))
6820 unsigned HOST_WIDE_INT idx
;
6822 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
6823 if (!initializer_zerop (elt
))
6833 /* Build an empty statement. */
6836 build_empty_stmt (void)
6838 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
6842 /* Build an OpenMP clause with code CODE. */
6845 build_omp_clause (enum omp_clause_code code
)
6850 length
= omp_clause_num_ops
[code
];
6851 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
6853 t
= ggc_alloc (size
);
6854 memset (t
, 0, size
);
6855 TREE_SET_CODE (t
, OMP_CLAUSE
);
6856 OMP_CLAUSE_SET_CODE (t
, code
);
6858 #ifdef GATHER_STATISTICS
6859 tree_node_counts
[(int) omp_clause_kind
]++;
6860 tree_node_sizes
[(int) omp_clause_kind
] += size
;
6867 /* Returns true if it is possible to prove that the index of
6868 an array access REF (an ARRAY_REF expression) falls into the
6872 in_array_bounds_p (tree ref
)
6874 tree idx
= TREE_OPERAND (ref
, 1);
6877 if (TREE_CODE (idx
) != INTEGER_CST
)
6880 min
= array_ref_low_bound (ref
);
6881 max
= array_ref_up_bound (ref
);
6884 || TREE_CODE (min
) != INTEGER_CST
6885 || TREE_CODE (max
) != INTEGER_CST
)
6888 if (tree_int_cst_lt (idx
, min
)
6889 || tree_int_cst_lt (max
, idx
))
6895 /* Return true if T (assumed to be a DECL) is a global variable. */
6898 is_global_var (tree t
)
6901 return (TREE_STATIC (t
) || MTAG_GLOBAL (t
));
6903 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
6906 /* Return true if T (assumed to be a DECL) must be assigned a memory
6910 needs_to_live_in_memory (tree t
)
6912 return (TREE_ADDRESSABLE (t
)
6913 || is_global_var (t
)
6914 || (TREE_CODE (t
) == RESULT_DECL
6915 && aggregate_value_p (t
, current_function_decl
)));
6918 /* There are situations in which a language considers record types
6919 compatible which have different field lists. Decide if two fields
6920 are compatible. It is assumed that the parent records are compatible. */
6923 fields_compatible_p (tree f1
, tree f2
)
6925 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
6926 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
6929 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
6930 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
6933 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
6939 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
6942 find_compatible_field (tree record
, tree orig_field
)
6946 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
6947 if (TREE_CODE (f
) == FIELD_DECL
6948 && fields_compatible_p (f
, orig_field
))
6951 /* ??? Why isn't this on the main fields list? */
6952 f
= TYPE_VFIELD (record
);
6953 if (f
&& TREE_CODE (f
) == FIELD_DECL
6954 && fields_compatible_p (f
, orig_field
))
6957 /* ??? We should abort here, but Java appears to do Bad Things
6958 with inherited fields. */
6962 /* Return value of a constant X. */
6965 int_cst_value (tree x
)
6967 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
6968 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
6969 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
6971 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
6974 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
6976 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
6981 /* Returns the greatest common divisor of A and B, which must be
6985 tree_fold_gcd (tree a
, tree b
)
6988 tree type
= TREE_TYPE (a
);
6990 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
6991 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
6993 if (integer_zerop (a
))
6996 if (integer_zerop (b
))
6999 if (tree_int_cst_sgn (a
) == -1)
7000 a
= fold_build2 (MULT_EXPR
, type
, a
,
7001 build_int_cst (type
, -1));
7003 if (tree_int_cst_sgn (b
) == -1)
7004 b
= fold_build2 (MULT_EXPR
, type
, b
,
7005 build_int_cst (type
, -1));
7009 a_mod_b
= fold_build2 (FLOOR_MOD_EXPR
, type
, a
, b
);
7011 if (!TREE_INT_CST_LOW (a_mod_b
)
7012 && !TREE_INT_CST_HIGH (a_mod_b
))
7020 /* Returns unsigned variant of TYPE. */
7023 unsigned_type_for (tree type
)
7025 if (POINTER_TYPE_P (type
))
7026 return lang_hooks
.types
.unsigned_type (size_type_node
);
7027 return lang_hooks
.types
.unsigned_type (type
);
7030 /* Returns signed variant of TYPE. */
7033 signed_type_for (tree type
)
7035 if (POINTER_TYPE_P (type
))
7036 return lang_hooks
.types
.signed_type (size_type_node
);
7037 return lang_hooks
.types
.signed_type (type
);
7040 /* Returns the largest value obtainable by casting something in INNER type to
7044 upper_bound_in_type (tree outer
, tree inner
)
7046 unsigned HOST_WIDE_INT lo
, hi
;
7047 unsigned int det
= 0;
7048 unsigned oprec
= TYPE_PRECISION (outer
);
7049 unsigned iprec
= TYPE_PRECISION (inner
);
7052 /* Compute a unique number for every combination. */
7053 det
|= (oprec
> iprec
) ? 4 : 0;
7054 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
7055 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
7057 /* Determine the exponent to use. */
7062 /* oprec <= iprec, outer: signed, inner: don't care. */
7067 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7071 /* oprec > iprec, outer: signed, inner: signed. */
7075 /* oprec > iprec, outer: signed, inner: unsigned. */
7079 /* oprec > iprec, outer: unsigned, inner: signed. */
7083 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7090 /* Compute 2^^prec - 1. */
7091 if (prec
<= HOST_BITS_PER_WIDE_INT
)
7094 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
7095 >> (HOST_BITS_PER_WIDE_INT
- prec
));
7099 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
7100 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
7101 lo
= ~(unsigned HOST_WIDE_INT
) 0;
7104 return build_int_cst_wide (outer
, lo
, hi
);
7107 /* Returns the smallest value obtainable by casting something in INNER type to
7111 lower_bound_in_type (tree outer
, tree inner
)
7113 unsigned HOST_WIDE_INT lo
, hi
;
7114 unsigned oprec
= TYPE_PRECISION (outer
);
7115 unsigned iprec
= TYPE_PRECISION (inner
);
7117 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7119 if (TYPE_UNSIGNED (outer
)
7120 /* If we are widening something of an unsigned type, OUTER type
7121 contains all values of INNER type. In particular, both INNER
7122 and OUTER types have zero in common. */
7123 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
7127 /* If we are widening a signed type to another signed type, we
7128 want to obtain -2^^(iprec-1). If we are keeping the
7129 precision or narrowing to a signed type, we want to obtain
7131 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
7133 if (prec
<= HOST_BITS_PER_WIDE_INT
)
7135 hi
= ~(unsigned HOST_WIDE_INT
) 0;
7136 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
7140 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
7141 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
7146 return build_int_cst_wide (outer
, lo
, hi
);
7149 /* Return nonzero if two operands that are suitable for PHI nodes are
7150 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7151 SSA_NAME or invariant. Note that this is strictly an optimization.
7152 That is, callers of this function can directly call operand_equal_p
7153 and get the same result, only slower. */
7156 operand_equal_for_phi_arg_p (tree arg0
, tree arg1
)
7160 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
7162 return operand_equal_p (arg0
, arg1
, 0);
7165 /* Returns number of zeros at the end of binary representation of X.
7167 ??? Use ffs if available? */
7170 num_ending_zeros (tree x
)
7172 unsigned HOST_WIDE_INT fr
, nfr
;
7173 unsigned num
, abits
;
7174 tree type
= TREE_TYPE (x
);
7176 if (TREE_INT_CST_LOW (x
) == 0)
7178 num
= HOST_BITS_PER_WIDE_INT
;
7179 fr
= TREE_INT_CST_HIGH (x
);
7184 fr
= TREE_INT_CST_LOW (x
);
7187 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
7190 if (nfr
<< abits
== fr
)
7197 if (num
> TYPE_PRECISION (type
))
7198 num
= TYPE_PRECISION (type
);
7200 return build_int_cst_type (type
, num
);
7204 #define WALK_SUBTREE(NODE) \
7207 result = walk_tree (&(NODE), func, data, pset); \
7213 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7214 be walked whenever a type is seen in the tree. Rest of operands and return
7215 value are as for walk_tree. */
7218 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
7219 struct pointer_set_t
*pset
)
7221 tree result
= NULL_TREE
;
7223 switch (TREE_CODE (type
))
7226 case REFERENCE_TYPE
:
7227 /* We have to worry about mutually recursive pointers. These can't
7228 be written in C. They can in Ada. It's pathological, but
7229 there's an ACATS test (c38102a) that checks it. Deal with this
7230 by checking if we're pointing to another pointer, that one
7231 points to another pointer, that one does too, and we have no htab.
7232 If so, get a hash table. We check three levels deep to avoid
7233 the cost of the hash table if we don't need one. */
7234 if (POINTER_TYPE_P (TREE_TYPE (type
))
7235 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
7236 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
7239 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
7247 /* ... fall through ... */
7250 WALK_SUBTREE (TREE_TYPE (type
));
7254 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
7259 WALK_SUBTREE (TREE_TYPE (type
));
7263 /* We never want to walk into default arguments. */
7264 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
7265 WALK_SUBTREE (TREE_VALUE (arg
));
7270 /* Don't follow this nodes's type if a pointer for fear that we'll
7271 have infinite recursion. Those types are uninteresting anyway. */
7272 if (!POINTER_TYPE_P (TREE_TYPE (type
))
7273 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
7274 WALK_SUBTREE (TREE_TYPE (type
));
7275 WALK_SUBTREE (TYPE_DOMAIN (type
));
7282 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
7283 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
7287 WALK_SUBTREE (TREE_TYPE (type
));
7288 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
7298 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7299 called with the DATA and the address of each sub-tree. If FUNC returns a
7300 non-NULL value, the traversal is stopped, and the value returned by FUNC
7301 is returned. If PSET is non-NULL it is used to record the nodes visited,
7302 and to avoid visiting a node more than once. */
7305 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
7307 enum tree_code code
;
7311 #define WALK_SUBTREE_TAIL(NODE) \
7315 goto tail_recurse; \
7320 /* Skip empty subtrees. */
7324 /* Don't walk the same tree twice, if the user has requested
7325 that we avoid doing so. */
7326 if (pset
&& pointer_set_insert (pset
, *tp
))
7329 /* Call the function. */
7331 result
= (*func
) (tp
, &walk_subtrees
, data
);
7333 /* If we found something, return it. */
7337 code
= TREE_CODE (*tp
);
7339 /* Even if we didn't, FUNC may have decided that there was nothing
7340 interesting below this point in the tree. */
7343 /* But we still need to check our siblings. */
7344 if (code
== TREE_LIST
)
7345 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
7346 else if (code
== OMP_CLAUSE
)
7347 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7352 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
7354 if (result
|| ! walk_subtrees
)
7360 case IDENTIFIER_NODE
:
7366 case PLACEHOLDER_EXPR
:
7370 /* None of these have subtrees other than those already walked
7375 WALK_SUBTREE (TREE_VALUE (*tp
));
7376 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
7381 int len
= TREE_VEC_LENGTH (*tp
);
7386 /* Walk all elements but the first. */
7388 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
7390 /* Now walk the first one as a tail call. */
7391 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
7395 WALK_SUBTREE (TREE_REALPART (*tp
));
7396 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
7400 unsigned HOST_WIDE_INT idx
;
7401 constructor_elt
*ce
;
7404 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
7406 WALK_SUBTREE (ce
->value
);
7411 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
7416 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
7418 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7419 into declarations that are just mentioned, rather than
7420 declared; they don't really belong to this part of the tree.
7421 And, we can see cycles: the initializer for a declaration
7422 can refer to the declaration itself. */
7423 WALK_SUBTREE (DECL_INITIAL (decl
));
7424 WALK_SUBTREE (DECL_SIZE (decl
));
7425 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
7427 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
7430 case STATEMENT_LIST
:
7432 tree_stmt_iterator i
;
7433 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
7434 WALK_SUBTREE (*tsi_stmt_ptr (i
));
7439 switch (OMP_CLAUSE_CODE (*tp
))
7441 case OMP_CLAUSE_PRIVATE
:
7442 case OMP_CLAUSE_SHARED
:
7443 case OMP_CLAUSE_FIRSTPRIVATE
:
7444 case OMP_CLAUSE_LASTPRIVATE
:
7445 case OMP_CLAUSE_COPYIN
:
7446 case OMP_CLAUSE_COPYPRIVATE
:
7448 case OMP_CLAUSE_NUM_THREADS
:
7449 case OMP_CLAUSE_SCHEDULE
:
7450 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
7453 case OMP_CLAUSE_NOWAIT
:
7454 case OMP_CLAUSE_ORDERED
:
7455 case OMP_CLAUSE_DEFAULT
:
7456 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7458 case OMP_CLAUSE_REDUCTION
:
7461 for (i
= 0; i
< 4; i
++)
7462 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
7463 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7475 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7476 But, we only want to walk once. */
7477 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
7478 for (i
= 0; i
< len
; ++i
)
7479 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
7480 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
7484 /* Walk into various fields of the type that it's defining. We only
7485 want to walk into these fields of a type in this case. Note that
7486 decls get walked as part of the processing of a BIND_EXPR.
7488 ??? Precisely which fields of types that we are supposed to walk in
7489 this case vs. the normal case aren't well defined. */
7490 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
7491 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
7493 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
7495 /* Call the function for the type. See if it returns anything or
7496 doesn't want us to continue. If we are to continue, walk both
7497 the normal fields and those for the declaration case. */
7498 result
= (*func
) (type_p
, &walk_subtrees
, data
);
7499 if (result
|| !walk_subtrees
)
7502 result
= walk_type_fields (*type_p
, func
, data
, pset
);
7506 /* If this is a record type, also walk the fields. */
7507 if (TREE_CODE (*type_p
) == RECORD_TYPE
7508 || TREE_CODE (*type_p
) == UNION_TYPE
7509 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
7513 for (field
= TYPE_FIELDS (*type_p
); field
;
7514 field
= TREE_CHAIN (field
))
7516 /* We'd like to look at the type of the field, but we can
7517 easily get infinite recursion. So assume it's pointed
7518 to elsewhere in the tree. Also, ignore things that
7520 if (TREE_CODE (field
) != FIELD_DECL
)
7523 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
7524 WALK_SUBTREE (DECL_SIZE (field
));
7525 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
7526 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
7527 WALK_SUBTREE (DECL_QUALIFIER (field
));
7531 WALK_SUBTREE (TYPE_SIZE (*type_p
));
7532 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
7537 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
7541 /* Walk over all the sub-trees of this operand. */
7542 len
= TREE_CODE_LENGTH (code
);
7544 /* Go through the subtrees. We need to do this in forward order so
7545 that the scope of a FOR_EXPR is handled properly. */
7548 for (i
= 0; i
< len
- 1; ++i
)
7549 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
7550 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
7554 /* If this is a type, walk the needed fields in the type. */
7555 else if (TYPE_P (*tp
))
7556 return walk_type_fields (*tp
, func
, data
, pset
);
7560 /* We didn't find what we were looking for. */
7563 #undef WALK_SUBTREE_TAIL
7567 /* Like walk_tree, but does not walk duplicate nodes more than once. */
7570 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
7573 struct pointer_set_t
*pset
;
7575 pset
= pointer_set_create ();
7576 result
= walk_tree (tp
, func
, data
, pset
);
7577 pointer_set_destroy (pset
);
7582 /* Return true if STMT is an empty statement or contains nothing but
7583 empty statements. */
7586 empty_body_p (tree stmt
)
7588 tree_stmt_iterator i
;
7591 if (IS_EMPTY_STMT (stmt
))
7593 else if (TREE_CODE (stmt
) == BIND_EXPR
)
7594 body
= BIND_EXPR_BODY (stmt
);
7595 else if (TREE_CODE (stmt
) == STATEMENT_LIST
)
7600 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
7601 if (!empty_body_p (tsi_stmt (i
)))
7607 #include "gt-tree.h"