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
[] = {
104 #endif /* GATHER_STATISTICS */
106 /* Unique id for next decl created. */
107 static GTY(()) int next_decl_uid
;
108 /* Unique id for next type created. */
109 static GTY(()) int next_type_uid
= 1;
111 /* Since we cannot rehash a type after it is in the table, we have to
112 keep the hash code. */
114 struct type_hash
GTY(())
120 /* Initial size of the hash table (rounded to next prime). */
121 #define TYPE_HASH_INITIAL_SIZE 1000
123 /* Now here is the hash table. When recording a type, it is added to
124 the slot whose index is the hash code. Note that the hash table is
125 used for several kinds of types (function types, array types and
126 array index range types, for now). While all these live in the
127 same table, they are completely independent, and the hash code is
128 computed differently for each of these. */
130 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
131 htab_t type_hash_table
;
133 /* Hash table and temporary node for larger integer const values. */
134 static GTY (()) tree int_cst_node
;
135 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
136 htab_t int_cst_hash_table
;
138 /* General tree->tree mapping structure for use in hash tables. */
141 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
142 htab_t debug_expr_for_decl
;
144 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
145 htab_t value_expr_for_decl
;
147 static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map
)))
148 htab_t init_priority_for_decl
;
150 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
151 htab_t restrict_base_for_decl
;
153 struct tree_int_map
GTY(())
158 static unsigned int tree_int_map_hash (const void *);
159 static int tree_int_map_eq (const void *, const void *);
160 static int tree_int_map_marked_p (const void *);
161 static void set_type_quals (tree
, int);
162 static int type_hash_eq (const void *, const void *);
163 static hashval_t
type_hash_hash (const void *);
164 static hashval_t
int_cst_hash_hash (const void *);
165 static int int_cst_hash_eq (const void *, const void *);
166 static void print_type_hash_statistics (void);
167 static void print_debug_expr_statistics (void);
168 static void print_value_expr_statistics (void);
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;
274 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_DECL_MINIMAL
] = 1;
276 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_MEMORY_TAG
] = 1;
277 tree_contains_struct
[NAME_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
278 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
279 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_MEMORY_TAG
] = 1;
281 tree_contains_struct
[STRUCT_FIELD_TAG
][TS_STRUCT_FIELD_TAG
] = 1;
282 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_MEMORY_PARTITION_TAG
] = 1;
284 tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
] = 1;
285 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
] = 1;
286 tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
] = 1;
287 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
] = 1;
289 tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
] = 1;
290 tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
] = 1;
291 tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
] = 1;
292 tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
] = 1;
293 tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
] = 1;
294 tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
] = 1;
295 tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
] = 1;
296 tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
] = 1;
298 lang_hooks
.init_ts ();
302 /* The name of the object as the assembler will see it (but before any
303 translations made by ASM_OUTPUT_LABELREF). Often this is the same
304 as DECL_NAME. It is an IDENTIFIER_NODE. */
306 decl_assembler_name (tree decl
)
308 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
309 lang_hooks
.set_decl_assembler_name (decl
);
310 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
313 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
316 decl_assembler_name_equal (tree decl
, tree asmname
)
318 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
320 if (decl_asmname
== asmname
)
323 /* If the target assembler name was set by the user, things are trickier.
324 We have a leading '*' to begin with. After that, it's arguable what
325 is the correct thing to do with -fleading-underscore. Arguably, we've
326 historically been doing the wrong thing in assemble_alias by always
327 printing the leading underscore. Since we're not changing that, make
328 sure user_label_prefix follows the '*' before matching. */
329 if (IDENTIFIER_POINTER (decl_asmname
)[0] == '*')
331 const char *decl_str
= IDENTIFIER_POINTER (decl_asmname
) + 1;
332 size_t ulp_len
= strlen (user_label_prefix
);
336 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
341 return strcmp (decl_str
, IDENTIFIER_POINTER (asmname
)) == 0;
347 /* Compute the number of bytes occupied by a tree with code CODE.
348 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
349 codes, which are of variable length. */
351 tree_code_size (enum tree_code code
)
353 switch (TREE_CODE_CLASS (code
))
355 case tcc_declaration
: /* A decl node */
360 return sizeof (struct tree_field_decl
);
362 return sizeof (struct tree_parm_decl
);
364 return sizeof (struct tree_var_decl
);
366 return sizeof (struct tree_label_decl
);
368 return sizeof (struct tree_result_decl
);
370 return sizeof (struct tree_const_decl
);
372 return sizeof (struct tree_type_decl
);
374 return sizeof (struct tree_function_decl
);
375 case NAME_MEMORY_TAG
:
376 case SYMBOL_MEMORY_TAG
:
377 return sizeof (struct tree_memory_tag
);
378 case STRUCT_FIELD_TAG
:
379 return sizeof (struct tree_struct_field_tag
);
380 case MEMORY_PARTITION_TAG
:
381 return sizeof (struct tree_memory_partition_tag
);
383 return sizeof (struct tree_decl_non_common
);
387 case tcc_type
: /* a type node */
388 return sizeof (struct tree_type
);
390 case tcc_reference
: /* a reference */
391 case tcc_expression
: /* an expression */
392 case tcc_statement
: /* an expression with side effects */
393 case tcc_comparison
: /* a comparison expression */
394 case tcc_unary
: /* a unary arithmetic expression */
395 case tcc_binary
: /* a binary arithmetic expression */
396 return (sizeof (struct tree_exp
)
397 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
399 case tcc_gimple_stmt
:
400 return (sizeof (struct gimple_stmt
)
401 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
403 case tcc_constant
: /* a constant */
406 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
407 case REAL_CST
: return sizeof (struct tree_real_cst
);
408 case COMPLEX_CST
: return sizeof (struct tree_complex
);
409 case VECTOR_CST
: return sizeof (struct tree_vector
);
410 case STRING_CST
: gcc_unreachable ();
412 return lang_hooks
.tree_size (code
);
415 case tcc_exceptional
: /* something random, like an identifier. */
418 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
419 case TREE_LIST
: return sizeof (struct tree_list
);
422 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
426 case PHI_NODE
: gcc_unreachable ();
428 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
430 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
431 case BLOCK
: return sizeof (struct tree_block
);
432 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
433 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
436 return lang_hooks
.tree_size (code
);
444 /* Compute the number of bytes occupied by NODE. This routine only
445 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
447 tree_size (tree node
)
449 enum tree_code code
= TREE_CODE (node
);
453 return (sizeof (struct tree_phi_node
)
454 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
457 return (offsetof (struct tree_binfo
, base_binfos
)
458 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
461 return (sizeof (struct tree_vec
)
462 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
465 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
468 return (sizeof (struct tree_omp_clause
)
469 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
473 return tree_code_size (code
);
477 /* Return a newly allocated node of code CODE. For decl and type
478 nodes, some other fields are initialized. The rest of the node is
479 initialized to zero. This function cannot be used for PHI_NODE,
480 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
483 Achoo! I got a code in the node. */
486 make_node_stat (enum tree_code code MEM_STAT_DECL
)
489 enum tree_code_class type
= TREE_CODE_CLASS (code
);
490 size_t length
= tree_code_size (code
);
491 #ifdef GATHER_STATISTICS
496 case tcc_declaration
: /* A decl node */
500 case tcc_type
: /* a type node */
504 case tcc_statement
: /* an expression with side effects */
508 case tcc_reference
: /* a reference */
512 case tcc_expression
: /* an expression */
513 case tcc_comparison
: /* a comparison expression */
514 case tcc_unary
: /* a unary arithmetic expression */
515 case tcc_binary
: /* a binary arithmetic expression */
519 case tcc_constant
: /* a constant */
523 case tcc_gimple_stmt
:
524 kind
= gimple_stmt_kind
;
527 case tcc_exceptional
: /* something random, like an identifier. */
530 case IDENTIFIER_NODE
:
547 kind
= ssa_name_kind
;
568 tree_node_counts
[(int) kind
]++;
569 tree_node_sizes
[(int) kind
] += length
;
572 if (code
== IDENTIFIER_NODE
)
573 t
= ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
575 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
577 memset (t
, 0, length
);
579 TREE_SET_CODE (t
, code
);
584 TREE_SIDE_EFFECTS (t
) = 1;
587 case tcc_declaration
:
588 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WITH_VIS
))
589 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
590 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
592 if (code
!= FUNCTION_DECL
)
594 DECL_USER_ALIGN (t
) = 0;
595 /* We have not yet computed the alias set for this declaration. */
596 DECL_POINTER_ALIAS_SET (t
) = -1;
598 DECL_SOURCE_LOCATION (t
) = input_location
;
599 DECL_UID (t
) = next_decl_uid
++;
604 TYPE_UID (t
) = next_type_uid
++;
605 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
606 TYPE_USER_ALIGN (t
) = 0;
607 TYPE_MAIN_VARIANT (t
) = t
;
608 TYPE_CANONICAL (t
) = t
;
610 /* Default to no attributes for type, but let target change that. */
611 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
612 targetm
.set_default_type_attributes (t
);
614 /* We have not yet computed the alias set for this type. */
615 TYPE_ALIAS_SET (t
) = -1;
619 TREE_CONSTANT (t
) = 1;
620 TREE_INVARIANT (t
) = 1;
629 case PREDECREMENT_EXPR
:
630 case PREINCREMENT_EXPR
:
631 case POSTDECREMENT_EXPR
:
632 case POSTINCREMENT_EXPR
:
633 /* All of these have side-effects, no matter what their
635 TREE_SIDE_EFFECTS (t
) = 1;
643 case tcc_gimple_stmt
:
646 case GIMPLE_MODIFY_STMT
:
647 TREE_SIDE_EFFECTS (t
) = 1;
655 /* Other classes need no special treatment. */
662 /* Return a new node with the same contents as NODE except that its
663 TREE_CHAIN is zero and it has a fresh uid. */
666 copy_node_stat (tree node MEM_STAT_DECL
)
669 enum tree_code code
= TREE_CODE (node
);
672 gcc_assert (code
!= STATEMENT_LIST
);
674 length
= tree_size (node
);
675 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
676 memcpy (t
, node
, length
);
678 if (!GIMPLE_TUPLE_P (node
))
680 TREE_ASM_WRITTEN (t
) = 0;
681 TREE_VISITED (t
) = 0;
684 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
686 DECL_UID (t
) = next_decl_uid
++;
687 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
688 && DECL_HAS_VALUE_EXPR_P (node
))
690 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
691 DECL_HAS_VALUE_EXPR_P (t
) = 1;
693 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
695 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
696 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
698 if (TREE_CODE (node
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (node
))
700 SET_DECL_RESTRICT_BASE (t
, DECL_GET_RESTRICT_BASE (node
));
701 DECL_BASED_ON_RESTRICT_P (t
) = 1;
704 else if (TREE_CODE_CLASS (code
) == tcc_type
)
706 TYPE_UID (t
) = next_type_uid
++;
707 /* The following is so that the debug code for
708 the copy is different from the original type.
709 The two statements usually duplicate each other
710 (because they clear fields of the same union),
711 but the optimizer should catch that. */
712 TYPE_SYMTAB_POINTER (t
) = 0;
713 TYPE_SYMTAB_ADDRESS (t
) = 0;
715 /* Do not copy the values cache. */
716 if (TYPE_CACHED_VALUES_P(t
))
718 TYPE_CACHED_VALUES_P (t
) = 0;
719 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
726 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
727 For example, this can copy a list made of TREE_LIST nodes. */
730 copy_list (tree list
)
738 head
= prev
= copy_node (list
);
739 next
= TREE_CHAIN (list
);
742 TREE_CHAIN (prev
) = copy_node (next
);
743 prev
= TREE_CHAIN (prev
);
744 next
= TREE_CHAIN (next
);
750 /* Create an INT_CST node with a LOW value sign extended. */
753 build_int_cst (tree type
, HOST_WIDE_INT low
)
755 /* Support legacy code. */
757 type
= integer_type_node
;
759 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
762 /* Create an INT_CST node with a LOW value zero extended. */
765 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
767 return build_int_cst_wide (type
, low
, 0);
770 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
771 if it is negative. This function is similar to build_int_cst, but
772 the extra bits outside of the type precision are cleared. Constants
773 with these extra bits may confuse the fold so that it detects overflows
774 even in cases when they do not occur, and in general should be avoided.
775 We cannot however make this a default behavior of build_int_cst without
776 more intrusive changes, since there are parts of gcc that rely on the extra
777 precision of the integer constants. */
780 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
782 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
783 unsigned HOST_WIDE_INT hi
, mask
;
789 type
= integer_type_node
;
791 bits
= TYPE_PRECISION (type
);
792 signed_p
= !TYPE_UNSIGNED (type
);
794 if (bits
>= HOST_BITS_PER_WIDE_INT
)
795 negative
= (low
< 0);
798 /* If the sign bit is inside precision of LOW, use it to determine
799 the sign of the constant. */
800 negative
= ((val
>> (bits
- 1)) & 1) != 0;
802 /* Mask out the bits outside of the precision of the constant. */
803 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
805 if (signed_p
&& negative
)
811 /* Determine the high bits. */
812 hi
= (negative
? ~(unsigned HOST_WIDE_INT
) 0 : 0);
814 /* For unsigned type we need to mask out the bits outside of the type
818 if (bits
<= HOST_BITS_PER_WIDE_INT
)
822 bits
-= HOST_BITS_PER_WIDE_INT
;
823 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
828 return build_int_cst_wide (type
, val
, hi
);
831 /* These are the hash table functions for the hash table of INTEGER_CST
832 nodes of a sizetype. */
834 /* Return the hash code code X, an INTEGER_CST. */
837 int_cst_hash_hash (const void *x
)
841 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
842 ^ htab_hash_pointer (TREE_TYPE (t
)));
845 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
846 is the same as that given by *Y, which is the same. */
849 int_cst_hash_eq (const void *x
, const void *y
)
854 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
855 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
856 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
859 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
860 integer_type_node is used. The returned node is always shared.
861 For small integers we use a per-type vector cache, for larger ones
862 we use a single hash table. */
865 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
873 switch (TREE_CODE (type
))
877 /* Cache NULL pointer. */
886 /* Cache false or true. */
894 if (TYPE_UNSIGNED (type
))
897 limit
= INTEGER_SHARE_LIMIT
;
898 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
904 limit
= INTEGER_SHARE_LIMIT
+ 1;
905 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
907 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
921 /* Look for it in the type's vector of small shared ints. */
922 if (!TYPE_CACHED_VALUES_P (type
))
924 TYPE_CACHED_VALUES_P (type
) = 1;
925 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
928 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
931 /* Make sure no one is clobbering the shared constant. */
932 gcc_assert (TREE_TYPE (t
) == type
);
933 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
934 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
938 /* Create a new shared int. */
939 t
= make_node (INTEGER_CST
);
941 TREE_INT_CST_LOW (t
) = low
;
942 TREE_INT_CST_HIGH (t
) = hi
;
943 TREE_TYPE (t
) = type
;
945 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
950 /* Use the cache of larger shared ints. */
953 TREE_INT_CST_LOW (int_cst_node
) = low
;
954 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
955 TREE_TYPE (int_cst_node
) = type
;
957 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
961 /* Insert this one into the hash table. */
964 /* Make a new node for next time round. */
965 int_cst_node
= make_node (INTEGER_CST
);
972 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
973 and the rest are zeros. */
976 build_low_bits_mask (tree type
, unsigned bits
)
978 unsigned HOST_WIDE_INT low
;
980 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
982 gcc_assert (bits
<= TYPE_PRECISION (type
));
984 if (bits
== TYPE_PRECISION (type
)
985 && !TYPE_UNSIGNED (type
))
987 /* Sign extended all-ones mask. */
991 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
993 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
998 bits
-= HOST_BITS_PER_WIDE_INT
;
1000 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
1003 return build_int_cst_wide (type
, low
, high
);
1006 /* Checks that X is integer constant that can be expressed in (unsigned)
1007 HOST_WIDE_INT without loss of precision. */
1010 cst_and_fits_in_hwi (tree x
)
1012 if (TREE_CODE (x
) != INTEGER_CST
)
1015 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1018 return (TREE_INT_CST_HIGH (x
) == 0
1019 || TREE_INT_CST_HIGH (x
) == -1);
1022 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1023 are in a list pointed to by VALS. */
1026 build_vector (tree type
, tree vals
)
1028 tree v
= make_node (VECTOR_CST
);
1029 int over1
= 0, over2
= 0;
1032 TREE_VECTOR_CST_ELTS (v
) = vals
;
1033 TREE_TYPE (v
) = type
;
1035 /* Iterate through elements and check for overflow. */
1036 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1038 tree value
= TREE_VALUE (link
);
1040 /* Don't crash if we get an address constant. */
1041 if (!CONSTANT_CLASS_P (value
))
1044 over1
|= TREE_OVERFLOW (value
);
1045 over2
|= TREE_CONSTANT_OVERFLOW (value
);
1048 TREE_OVERFLOW (v
) = over1
;
1049 TREE_CONSTANT_OVERFLOW (v
) = over2
;
1054 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1055 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1058 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1060 tree list
= NULL_TREE
;
1061 unsigned HOST_WIDE_INT idx
;
1064 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1065 list
= tree_cons (NULL_TREE
, value
, list
);
1066 return build_vector (type
, nreverse (list
));
1069 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1070 are in the VEC pointed to by VALS. */
1072 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1074 tree c
= make_node (CONSTRUCTOR
);
1075 TREE_TYPE (c
) = type
;
1076 CONSTRUCTOR_ELTS (c
) = vals
;
1080 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1083 build_constructor_single (tree type
, tree index
, tree value
)
1085 VEC(constructor_elt
,gc
) *v
;
1086 constructor_elt
*elt
;
1089 v
= VEC_alloc (constructor_elt
, gc
, 1);
1090 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1094 t
= build_constructor (type
, v
);
1095 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1100 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1101 are in a list pointed to by VALS. */
1103 build_constructor_from_list (tree type
, tree vals
)
1106 VEC(constructor_elt
,gc
) *v
= NULL
;
1107 bool constant_p
= true;
1111 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1112 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1114 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1115 val
= TREE_VALUE (t
);
1116 elt
->index
= TREE_PURPOSE (t
);
1118 if (!TREE_CONSTANT (val
))
1123 t
= build_constructor (type
, v
);
1124 TREE_CONSTANT (t
) = constant_p
;
1129 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1132 build_real (tree type
, REAL_VALUE_TYPE d
)
1135 REAL_VALUE_TYPE
*dp
;
1138 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1139 Consider doing it via real_convert now. */
1141 v
= make_node (REAL_CST
);
1142 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
1143 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1145 TREE_TYPE (v
) = type
;
1146 TREE_REAL_CST_PTR (v
) = dp
;
1147 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
1151 /* Return a new REAL_CST node whose type is TYPE
1152 and whose value is the integer value of the INTEGER_CST node I. */
1155 real_value_from_int_cst (tree type
, tree i
)
1159 /* Clear all bits of the real value type so that we can later do
1160 bitwise comparisons to see if two values are the same. */
1161 memset (&d
, 0, sizeof d
);
1163 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1164 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1165 TYPE_UNSIGNED (TREE_TYPE (i
)));
1169 /* Given a tree representing an integer constant I, return a tree
1170 representing the same value as a floating-point constant of type TYPE. */
1173 build_real_from_int_cst (tree type
, tree i
)
1176 int overflow
= TREE_OVERFLOW (i
);
1178 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1180 TREE_OVERFLOW (v
) |= overflow
;
1181 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
1185 /* Return a newly constructed STRING_CST node whose value is
1186 the LEN characters at STR.
1187 The TREE_TYPE is not initialized. */
1190 build_string (int len
, const char *str
)
1195 /* Do not waste bytes provided by padding of struct tree_string. */
1196 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1198 #ifdef GATHER_STATISTICS
1199 tree_node_counts
[(int) c_kind
]++;
1200 tree_node_sizes
[(int) c_kind
] += length
;
1203 s
= ggc_alloc_tree (length
);
1205 memset (s
, 0, sizeof (struct tree_common
));
1206 TREE_SET_CODE (s
, STRING_CST
);
1207 TREE_CONSTANT (s
) = 1;
1208 TREE_INVARIANT (s
) = 1;
1209 TREE_STRING_LENGTH (s
) = len
;
1210 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
1211 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
1216 /* Return a newly constructed COMPLEX_CST node whose value is
1217 specified by the real and imaginary parts REAL and IMAG.
1218 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1219 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1222 build_complex (tree type
, tree real
, tree imag
)
1224 tree t
= make_node (COMPLEX_CST
);
1226 TREE_REALPART (t
) = real
;
1227 TREE_IMAGPART (t
) = imag
;
1228 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1229 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1230 TREE_CONSTANT_OVERFLOW (t
)
1231 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
1235 /* Return a constant of arithmetic type TYPE which is the
1236 multiplicative identity of the set TYPE. */
1239 build_one_cst (tree type
)
1241 switch (TREE_CODE (type
))
1243 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1244 case POINTER_TYPE
: case REFERENCE_TYPE
:
1246 return build_int_cst (type
, 1);
1249 return build_real (type
, dconst1
);
1256 scalar
= build_one_cst (TREE_TYPE (type
));
1258 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1260 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1261 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1263 return build_vector (type
, cst
);
1267 return build_complex (type
,
1268 build_one_cst (TREE_TYPE (type
)),
1269 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1276 /* Build a BINFO with LEN language slots. */
1279 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1282 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1283 + VEC_embedded_size (tree
, base_binfos
));
1285 #ifdef GATHER_STATISTICS
1286 tree_node_counts
[(int) binfo_kind
]++;
1287 tree_node_sizes
[(int) binfo_kind
] += length
;
1290 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1292 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1294 TREE_SET_CODE (t
, TREE_BINFO
);
1296 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1302 /* Build a newly constructed TREE_VEC node of length LEN. */
1305 make_tree_vec_stat (int len MEM_STAT_DECL
)
1308 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1310 #ifdef GATHER_STATISTICS
1311 tree_node_counts
[(int) vec_kind
]++;
1312 tree_node_sizes
[(int) vec_kind
] += length
;
1315 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1317 memset (t
, 0, length
);
1319 TREE_SET_CODE (t
, TREE_VEC
);
1320 TREE_VEC_LENGTH (t
) = len
;
1325 /* Return 1 if EXPR is the integer constant zero or a complex constant
1329 integer_zerop (tree expr
)
1333 return ((TREE_CODE (expr
) == INTEGER_CST
1334 && TREE_INT_CST_LOW (expr
) == 0
1335 && TREE_INT_CST_HIGH (expr
) == 0)
1336 || (TREE_CODE (expr
) == COMPLEX_CST
1337 && integer_zerop (TREE_REALPART (expr
))
1338 && integer_zerop (TREE_IMAGPART (expr
))));
1341 /* Return 1 if EXPR is the integer constant one or the corresponding
1342 complex constant. */
1345 integer_onep (tree expr
)
1349 return ((TREE_CODE (expr
) == INTEGER_CST
1350 && TREE_INT_CST_LOW (expr
) == 1
1351 && TREE_INT_CST_HIGH (expr
) == 0)
1352 || (TREE_CODE (expr
) == COMPLEX_CST
1353 && integer_onep (TREE_REALPART (expr
))
1354 && integer_zerop (TREE_IMAGPART (expr
))));
1357 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1358 it contains. Likewise for the corresponding complex constant. */
1361 integer_all_onesp (tree expr
)
1368 if (TREE_CODE (expr
) == COMPLEX_CST
1369 && integer_all_onesp (TREE_REALPART (expr
))
1370 && integer_zerop (TREE_IMAGPART (expr
)))
1373 else if (TREE_CODE (expr
) != INTEGER_CST
)
1376 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1377 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1378 && TREE_INT_CST_HIGH (expr
) == -1)
1383 /* Note that using TYPE_PRECISION here is wrong. We care about the
1384 actual bits, not the (arbitrary) range of the type. */
1385 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1386 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1388 HOST_WIDE_INT high_value
;
1391 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1393 /* Can not handle precisions greater than twice the host int size. */
1394 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1395 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1396 /* Shifting by the host word size is undefined according to the ANSI
1397 standard, so we must handle this as a special case. */
1400 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1402 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1403 && TREE_INT_CST_HIGH (expr
) == high_value
);
1406 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1409 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1413 integer_pow2p (tree expr
)
1416 HOST_WIDE_INT high
, low
;
1420 if (TREE_CODE (expr
) == COMPLEX_CST
1421 && integer_pow2p (TREE_REALPART (expr
))
1422 && integer_zerop (TREE_IMAGPART (expr
)))
1425 if (TREE_CODE (expr
) != INTEGER_CST
)
1428 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1429 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1430 high
= TREE_INT_CST_HIGH (expr
);
1431 low
= TREE_INT_CST_LOW (expr
);
1433 /* First clear all bits that are beyond the type's precision in case
1434 we've been sign extended. */
1436 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1438 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1439 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1443 if (prec
< HOST_BITS_PER_WIDE_INT
)
1444 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1447 if (high
== 0 && low
== 0)
1450 return ((high
== 0 && (low
& (low
- 1)) == 0)
1451 || (low
== 0 && (high
& (high
- 1)) == 0));
1454 /* Return 1 if EXPR is an integer constant other than zero or a
1455 complex constant other than zero. */
1458 integer_nonzerop (tree expr
)
1462 return ((TREE_CODE (expr
) == INTEGER_CST
1463 && (TREE_INT_CST_LOW (expr
) != 0
1464 || TREE_INT_CST_HIGH (expr
) != 0))
1465 || (TREE_CODE (expr
) == COMPLEX_CST
1466 && (integer_nonzerop (TREE_REALPART (expr
))
1467 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1470 /* Return the power of two represented by a tree node known to be a
1474 tree_log2 (tree expr
)
1477 HOST_WIDE_INT high
, low
;
1481 if (TREE_CODE (expr
) == COMPLEX_CST
)
1482 return tree_log2 (TREE_REALPART (expr
));
1484 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1485 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1487 high
= TREE_INT_CST_HIGH (expr
);
1488 low
= TREE_INT_CST_LOW (expr
);
1490 /* First clear all bits that are beyond the type's precision in case
1491 we've been sign extended. */
1493 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1495 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1496 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1500 if (prec
< HOST_BITS_PER_WIDE_INT
)
1501 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1504 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1505 : exact_log2 (low
));
1508 /* Similar, but return the largest integer Y such that 2 ** Y is less
1509 than or equal to EXPR. */
1512 tree_floor_log2 (tree expr
)
1515 HOST_WIDE_INT high
, low
;
1519 if (TREE_CODE (expr
) == COMPLEX_CST
)
1520 return tree_log2 (TREE_REALPART (expr
));
1522 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1523 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1525 high
= TREE_INT_CST_HIGH (expr
);
1526 low
= TREE_INT_CST_LOW (expr
);
1528 /* First clear all bits that are beyond the type's precision in case
1529 we've been sign extended. Ignore if type's precision hasn't been set
1530 since what we are doing is setting it. */
1532 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1534 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1535 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1539 if (prec
< HOST_BITS_PER_WIDE_INT
)
1540 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1543 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1544 : floor_log2 (low
));
1547 /* Return 1 if EXPR is the real constant zero. */
1550 real_zerop (tree expr
)
1554 return ((TREE_CODE (expr
) == REAL_CST
1555 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1556 || (TREE_CODE (expr
) == COMPLEX_CST
1557 && real_zerop (TREE_REALPART (expr
))
1558 && real_zerop (TREE_IMAGPART (expr
))));
1561 /* Return 1 if EXPR is the real constant one in real or complex form. */
1564 real_onep (tree expr
)
1568 return ((TREE_CODE (expr
) == REAL_CST
1569 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1570 || (TREE_CODE (expr
) == COMPLEX_CST
1571 && real_onep (TREE_REALPART (expr
))
1572 && real_zerop (TREE_IMAGPART (expr
))));
1575 /* Return 1 if EXPR is the real constant two. */
1578 real_twop (tree expr
)
1582 return ((TREE_CODE (expr
) == REAL_CST
1583 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1584 || (TREE_CODE (expr
) == COMPLEX_CST
1585 && real_twop (TREE_REALPART (expr
))
1586 && real_zerop (TREE_IMAGPART (expr
))));
1589 /* Return 1 if EXPR is the real constant minus one. */
1592 real_minus_onep (tree expr
)
1596 return ((TREE_CODE (expr
) == REAL_CST
1597 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1598 || (TREE_CODE (expr
) == COMPLEX_CST
1599 && real_minus_onep (TREE_REALPART (expr
))
1600 && real_zerop (TREE_IMAGPART (expr
))));
1603 /* Nonzero if EXP is a constant or a cast of a constant. */
1606 really_constant_p (tree exp
)
1608 /* This is not quite the same as STRIP_NOPS. It does more. */
1609 while (TREE_CODE (exp
) == NOP_EXPR
1610 || TREE_CODE (exp
) == CONVERT_EXPR
1611 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1612 exp
= TREE_OPERAND (exp
, 0);
1613 return TREE_CONSTANT (exp
);
1616 /* Return first list element whose TREE_VALUE is ELEM.
1617 Return 0 if ELEM is not in LIST. */
1620 value_member (tree elem
, tree list
)
1624 if (elem
== TREE_VALUE (list
))
1626 list
= TREE_CHAIN (list
);
1631 /* Return first list element whose TREE_PURPOSE is ELEM.
1632 Return 0 if ELEM is not in LIST. */
1635 purpose_member (tree elem
, tree list
)
1639 if (elem
== TREE_PURPOSE (list
))
1641 list
= TREE_CHAIN (list
);
1646 /* Return nonzero if ELEM is part of the chain CHAIN. */
1649 chain_member (tree elem
, tree chain
)
1655 chain
= TREE_CHAIN (chain
);
1661 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1662 We expect a null pointer to mark the end of the chain.
1663 This is the Lisp primitive `length'. */
1666 list_length (tree t
)
1669 #ifdef ENABLE_TREE_CHECKING
1677 #ifdef ENABLE_TREE_CHECKING
1680 gcc_assert (p
!= q
);
1688 /* Returns the number of FIELD_DECLs in TYPE. */
1691 fields_length (tree type
)
1693 tree t
= TYPE_FIELDS (type
);
1696 for (; t
; t
= TREE_CHAIN (t
))
1697 if (TREE_CODE (t
) == FIELD_DECL
)
1703 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1704 by modifying the last node in chain 1 to point to chain 2.
1705 This is the Lisp primitive `nconc'. */
1708 chainon (tree op1
, tree op2
)
1717 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1719 TREE_CHAIN (t1
) = op2
;
1721 #ifdef ENABLE_TREE_CHECKING
1724 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1725 gcc_assert (t2
!= t1
);
1732 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1735 tree_last (tree chain
)
1739 while ((next
= TREE_CHAIN (chain
)))
1744 /* Reverse the order of elements in the chain T,
1745 and return the new head of the chain (old last element). */
1750 tree prev
= 0, decl
, next
;
1751 for (decl
= t
; decl
; decl
= next
)
1753 next
= TREE_CHAIN (decl
);
1754 TREE_CHAIN (decl
) = prev
;
1760 /* Return a newly created TREE_LIST node whose
1761 purpose and value fields are PARM and VALUE. */
1764 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1766 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1767 TREE_PURPOSE (t
) = parm
;
1768 TREE_VALUE (t
) = value
;
1772 /* Return a newly created TREE_LIST node whose
1773 purpose and value fields are PURPOSE and VALUE
1774 and whose TREE_CHAIN is CHAIN. */
1777 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1781 node
= ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1783 memset (node
, 0, sizeof (struct tree_common
));
1785 #ifdef GATHER_STATISTICS
1786 tree_node_counts
[(int) x_kind
]++;
1787 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1790 TREE_SET_CODE (node
, TREE_LIST
);
1791 TREE_CHAIN (node
) = chain
;
1792 TREE_PURPOSE (node
) = purpose
;
1793 TREE_VALUE (node
) = value
;
1798 /* Return the size nominally occupied by an object of type TYPE
1799 when it resides in memory. The value is measured in units of bytes,
1800 and its data type is that normally used for type sizes
1801 (which is the first type created by make_signed_type or
1802 make_unsigned_type). */
1805 size_in_bytes (tree type
)
1809 if (type
== error_mark_node
)
1810 return integer_zero_node
;
1812 type
= TYPE_MAIN_VARIANT (type
);
1813 t
= TYPE_SIZE_UNIT (type
);
1817 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1818 return size_zero_node
;
1821 if (TREE_CODE (t
) == INTEGER_CST
)
1822 t
= force_fit_type (t
, 0, false, false);
1827 /* Return the size of TYPE (in bytes) as a wide integer
1828 or return -1 if the size can vary or is larger than an integer. */
1831 int_size_in_bytes (tree type
)
1835 if (type
== error_mark_node
)
1838 type
= TYPE_MAIN_VARIANT (type
);
1839 t
= TYPE_SIZE_UNIT (type
);
1841 || TREE_CODE (t
) != INTEGER_CST
1842 || TREE_INT_CST_HIGH (t
) != 0
1843 /* If the result would appear negative, it's too big to represent. */
1844 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1847 return TREE_INT_CST_LOW (t
);
1850 /* Return the maximum size of TYPE (in bytes) as a wide integer
1851 or return -1 if the size can vary or is larger than an integer. */
1854 max_int_size_in_bytes (tree type
)
1856 HOST_WIDE_INT size
= -1;
1859 /* If this is an array type, check for a possible MAX_SIZE attached. */
1861 if (TREE_CODE (type
) == ARRAY_TYPE
)
1863 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
1865 if (size_tree
&& host_integerp (size_tree
, 1))
1866 size
= tree_low_cst (size_tree
, 1);
1869 /* If we still haven't been able to get a size, see if the language
1870 can compute a maximum size. */
1874 size_tree
= lang_hooks
.types
.max_size (type
);
1876 if (size_tree
&& host_integerp (size_tree
, 1))
1877 size
= tree_low_cst (size_tree
, 1);
1883 /* Return the bit position of FIELD, in bits from the start of the record.
1884 This is a tree of type bitsizetype. */
1887 bit_position (tree field
)
1889 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1890 DECL_FIELD_BIT_OFFSET (field
));
1893 /* Likewise, but return as an integer. It must be representable in
1894 that way (since it could be a signed value, we don't have the
1895 option of returning -1 like int_size_in_byte can. */
1898 int_bit_position (tree field
)
1900 return tree_low_cst (bit_position (field
), 0);
1903 /* Return the byte position of FIELD, in bytes from the start of the record.
1904 This is a tree of type sizetype. */
1907 byte_position (tree field
)
1909 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1910 DECL_FIELD_BIT_OFFSET (field
));
1913 /* Likewise, but return as an integer. It must be representable in
1914 that way (since it could be a signed value, we don't have the
1915 option of returning -1 like int_size_in_byte can. */
1918 int_byte_position (tree field
)
1920 return tree_low_cst (byte_position (field
), 0);
1923 /* Return the strictest alignment, in bits, that T is known to have. */
1928 unsigned int align0
, align1
;
1930 switch (TREE_CODE (t
))
1932 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1933 /* If we have conversions, we know that the alignment of the
1934 object must meet each of the alignments of the types. */
1935 align0
= expr_align (TREE_OPERAND (t
, 0));
1936 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1937 return MAX (align0
, align1
);
1940 /* FIXME tuples: It is unclear to me if this function, which
1941 is only called from ADA, is called on gimple or non gimple
1942 trees. Let's assume it's from gimple trees unless we hit
1946 case SAVE_EXPR
: case COMPOUND_EXPR
: case GIMPLE_MODIFY_STMT
:
1947 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1948 case CLEANUP_POINT_EXPR
:
1949 /* These don't change the alignment of an object. */
1950 return expr_align (TREE_OPERAND (t
, 0));
1953 /* The best we can do is say that the alignment is the least aligned
1955 align0
= expr_align (TREE_OPERAND (t
, 1));
1956 align1
= expr_align (TREE_OPERAND (t
, 2));
1957 return MIN (align0
, align1
);
1959 case LABEL_DECL
: case CONST_DECL
:
1960 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1961 if (DECL_ALIGN (t
) != 0)
1962 return DECL_ALIGN (t
);
1966 return FUNCTION_BOUNDARY
;
1972 /* Otherwise take the alignment from that of the type. */
1973 return TYPE_ALIGN (TREE_TYPE (t
));
1976 /* Return, as a tree node, the number of elements for TYPE (which is an
1977 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1980 array_type_nelts (tree type
)
1982 tree index_type
, min
, max
;
1984 /* If they did it with unspecified bounds, then we should have already
1985 given an error about it before we got here. */
1986 if (! TYPE_DOMAIN (type
))
1987 return error_mark_node
;
1989 index_type
= TYPE_DOMAIN (type
);
1990 min
= TYPE_MIN_VALUE (index_type
);
1991 max
= TYPE_MAX_VALUE (index_type
);
1993 return (integer_zerop (min
)
1995 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
1998 /* If arg is static -- a reference to an object in static storage -- then
1999 return the object. This is not the same as the C meaning of `static'.
2000 If arg isn't static, return NULL. */
2005 switch (TREE_CODE (arg
))
2008 /* Nested functions are static, even though taking their address will
2009 involve a trampoline as we unnest the nested function and create
2010 the trampoline on the tree level. */
2014 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2015 && ! DECL_THREAD_LOCAL_P (arg
)
2016 && ! DECL_DLLIMPORT_P (arg
)
2020 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2024 return TREE_STATIC (arg
) ? arg
: NULL
;
2031 /* If the thing being referenced is not a field, then it is
2032 something language specific. */
2033 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
2034 return (*lang_hooks
.staticp
) (arg
);
2036 /* If we are referencing a bitfield, we can't evaluate an
2037 ADDR_EXPR at compile time and so it isn't a constant. */
2038 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2041 return staticp (TREE_OPERAND (arg
, 0));
2046 case MISALIGNED_INDIRECT_REF
:
2047 case ALIGN_INDIRECT_REF
:
2049 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2052 case ARRAY_RANGE_REF
:
2053 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2054 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2055 return staticp (TREE_OPERAND (arg
, 0));
2060 if ((unsigned int) TREE_CODE (arg
)
2061 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
2062 return lang_hooks
.staticp (arg
);
2068 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2069 Do this to any expression which may be used in more than one place,
2070 but must be evaluated only once.
2072 Normally, expand_expr would reevaluate the expression each time.
2073 Calling save_expr produces something that is evaluated and recorded
2074 the first time expand_expr is called on it. Subsequent calls to
2075 expand_expr just reuse the recorded value.
2077 The call to expand_expr that generates code that actually computes
2078 the value is the first call *at compile time*. Subsequent calls
2079 *at compile time* generate code to use the saved value.
2080 This produces correct result provided that *at run time* control
2081 always flows through the insns made by the first expand_expr
2082 before reaching the other places where the save_expr was evaluated.
2083 You, the caller of save_expr, must make sure this is so.
2085 Constants, and certain read-only nodes, are returned with no
2086 SAVE_EXPR because that is safe. Expressions containing placeholders
2087 are not touched; see tree.def for an explanation of what these
2091 save_expr (tree expr
)
2093 tree t
= fold (expr
);
2096 /* If the tree evaluates to a constant, then we don't want to hide that
2097 fact (i.e. this allows further folding, and direct checks for constants).
2098 However, a read-only object that has side effects cannot be bypassed.
2099 Since it is no problem to reevaluate literals, we just return the
2101 inner
= skip_simple_arithmetic (t
);
2103 if (TREE_INVARIANT (inner
)
2104 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
2105 || TREE_CODE (inner
) == SAVE_EXPR
2106 || TREE_CODE (inner
) == ERROR_MARK
)
2109 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2110 it means that the size or offset of some field of an object depends on
2111 the value within another field.
2113 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2114 and some variable since it would then need to be both evaluated once and
2115 evaluated more than once. Front-ends must assure this case cannot
2116 happen by surrounding any such subexpressions in their own SAVE_EXPR
2117 and forcing evaluation at the proper time. */
2118 if (contains_placeholder_p (inner
))
2121 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2123 /* This expression might be placed ahead of a jump to ensure that the
2124 value was computed on both sides of the jump. So make sure it isn't
2125 eliminated as dead. */
2126 TREE_SIDE_EFFECTS (t
) = 1;
2127 TREE_INVARIANT (t
) = 1;
2131 /* Look inside EXPR and into any simple arithmetic operations. Return
2132 the innermost non-arithmetic node. */
2135 skip_simple_arithmetic (tree expr
)
2139 /* We don't care about whether this can be used as an lvalue in this
2141 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2142 expr
= TREE_OPERAND (expr
, 0);
2144 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2145 a constant, it will be more efficient to not make another SAVE_EXPR since
2146 it will allow better simplification and GCSE will be able to merge the
2147 computations if they actually occur. */
2151 if (UNARY_CLASS_P (inner
))
2152 inner
= TREE_OPERAND (inner
, 0);
2153 else if (BINARY_CLASS_P (inner
))
2155 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
2156 inner
= TREE_OPERAND (inner
, 0);
2157 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
2158 inner
= TREE_OPERAND (inner
, 1);
2169 /* Return which tree structure is used by T. */
2171 enum tree_node_structure_enum
2172 tree_node_structure (tree t
)
2174 enum tree_code code
= TREE_CODE (t
);
2176 switch (TREE_CODE_CLASS (code
))
2178 case tcc_declaration
:
2183 return TS_FIELD_DECL
;
2185 return TS_PARM_DECL
;
2189 return TS_LABEL_DECL
;
2191 return TS_RESULT_DECL
;
2193 return TS_CONST_DECL
;
2195 return TS_TYPE_DECL
;
2197 return TS_FUNCTION_DECL
;
2198 case SYMBOL_MEMORY_TAG
:
2199 case NAME_MEMORY_TAG
:
2200 case STRUCT_FIELD_TAG
:
2201 case MEMORY_PARTITION_TAG
:
2202 return TS_MEMORY_TAG
;
2204 return TS_DECL_NON_COMMON
;
2210 case tcc_comparison
:
2213 case tcc_expression
:
2216 case tcc_gimple_stmt
:
2217 return TS_GIMPLE_STATEMENT
;
2218 default: /* tcc_constant and tcc_exceptional */
2223 /* tcc_constant cases. */
2224 case INTEGER_CST
: return TS_INT_CST
;
2225 case REAL_CST
: return TS_REAL_CST
;
2226 case COMPLEX_CST
: return TS_COMPLEX
;
2227 case VECTOR_CST
: return TS_VECTOR
;
2228 case STRING_CST
: return TS_STRING
;
2229 /* tcc_exceptional cases. */
2230 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2232 case ERROR_MARK
: return TS_COMMON
;
2233 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
2234 case TREE_LIST
: return TS_LIST
;
2235 case TREE_VEC
: return TS_VEC
;
2236 case PHI_NODE
: return TS_PHI_NODE
;
2237 case SSA_NAME
: return TS_SSA_NAME
;
2238 case PLACEHOLDER_EXPR
: return TS_COMMON
;
2239 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
2240 case BLOCK
: return TS_BLOCK
;
2241 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
2242 case TREE_BINFO
: return TS_BINFO
;
2243 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
2244 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
2251 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2252 or offset that depends on a field within a record. */
2255 contains_placeholder_p (tree exp
)
2257 enum tree_code code
;
2262 code
= TREE_CODE (exp
);
2263 if (code
== PLACEHOLDER_EXPR
)
2266 switch (TREE_CODE_CLASS (code
))
2269 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2270 position computations since they will be converted into a
2271 WITH_RECORD_EXPR involving the reference, which will assume
2272 here will be valid. */
2273 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2275 case tcc_exceptional
:
2276 if (code
== TREE_LIST
)
2277 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2278 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2283 case tcc_comparison
:
2284 case tcc_expression
:
2288 /* Ignoring the first operand isn't quite right, but works best. */
2289 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2292 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2293 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2294 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2297 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2303 switch (TREE_CODE_LENGTH (code
))
2306 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2308 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2309 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2320 /* Return true if any part of the computation of TYPE involves a
2321 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2322 (for QUAL_UNION_TYPE) and field positions. */
2325 type_contains_placeholder_1 (tree type
)
2327 /* If the size contains a placeholder or the parent type (component type in
2328 the case of arrays) type involves a placeholder, this type does. */
2329 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2330 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2331 || (TREE_TYPE (type
) != 0
2332 && type_contains_placeholder_p (TREE_TYPE (type
))))
2335 /* Now do type-specific checks. Note that the last part of the check above
2336 greatly limits what we have to do below. */
2337 switch (TREE_CODE (type
))
2345 case REFERENCE_TYPE
:
2353 /* Here we just check the bounds. */
2354 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2355 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2358 /* We're already checked the component type (TREE_TYPE), so just check
2360 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2364 case QUAL_UNION_TYPE
:
2368 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2369 if (TREE_CODE (field
) == FIELD_DECL
2370 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2371 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2372 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2373 || type_contains_placeholder_p (TREE_TYPE (field
))))
2385 type_contains_placeholder_p (tree type
)
2389 /* If the contains_placeholder_bits field has been initialized,
2390 then we know the answer. */
2391 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2392 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2394 /* Indicate that we've seen this type node, and the answer is false.
2395 This is what we want to return if we run into recursion via fields. */
2396 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2398 /* Compute the real value. */
2399 result
= type_contains_placeholder_1 (type
);
2401 /* Store the real value. */
2402 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2407 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2408 return a tree with all occurrences of references to F in a
2409 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2410 contains only arithmetic expressions or a CALL_EXPR with a
2411 PLACEHOLDER_EXPR occurring only in its arglist. */
2414 substitute_in_expr (tree exp
, tree f
, tree r
)
2416 enum tree_code code
= TREE_CODE (exp
);
2417 tree op0
, op1
, op2
, op3
;
2421 /* We handle TREE_LIST and COMPONENT_REF separately. */
2422 if (code
== TREE_LIST
)
2424 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2425 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2426 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2429 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2431 else if (code
== COMPONENT_REF
)
2433 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2434 and it is the right field, replace it with R. */
2435 for (inner
= TREE_OPERAND (exp
, 0);
2436 REFERENCE_CLASS_P (inner
);
2437 inner
= TREE_OPERAND (inner
, 0))
2439 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2440 && TREE_OPERAND (exp
, 1) == f
)
2443 /* If this expression hasn't been completed let, leave it alone. */
2444 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2447 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2448 if (op0
== TREE_OPERAND (exp
, 0))
2451 new = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2452 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
);
2455 switch (TREE_CODE_CLASS (code
))
2458 case tcc_declaration
:
2461 case tcc_exceptional
:
2464 case tcc_comparison
:
2465 case tcc_expression
:
2467 switch (TREE_CODE_LENGTH (code
))
2473 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2474 if (op0
== TREE_OPERAND (exp
, 0))
2477 new = fold_build1 (code
, TREE_TYPE (exp
), op0
);
2481 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2482 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2484 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2487 new = fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2491 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2492 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2493 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2495 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2496 && op2
== TREE_OPERAND (exp
, 2))
2499 new = fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2503 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2504 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2505 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2506 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
2508 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2509 && op2
== TREE_OPERAND (exp
, 2)
2510 && op3
== TREE_OPERAND (exp
, 3))
2513 new = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2525 TREE_READONLY (new) = TREE_READONLY (exp
);
2529 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2530 for it within OBJ, a tree that is an object or a chain of references. */
2533 substitute_placeholder_in_expr (tree exp
, tree obj
)
2535 enum tree_code code
= TREE_CODE (exp
);
2536 tree op0
, op1
, op2
, op3
;
2538 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2539 in the chain of OBJ. */
2540 if (code
== PLACEHOLDER_EXPR
)
2542 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2545 for (elt
= obj
; elt
!= 0;
2546 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2547 || TREE_CODE (elt
) == COND_EXPR
)
2548 ? TREE_OPERAND (elt
, 1)
2549 : (REFERENCE_CLASS_P (elt
)
2550 || UNARY_CLASS_P (elt
)
2551 || BINARY_CLASS_P (elt
)
2552 || EXPRESSION_CLASS_P (elt
))
2553 ? TREE_OPERAND (elt
, 0) : 0))
2554 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2557 for (elt
= obj
; elt
!= 0;
2558 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2559 || TREE_CODE (elt
) == COND_EXPR
)
2560 ? TREE_OPERAND (elt
, 1)
2561 : (REFERENCE_CLASS_P (elt
)
2562 || UNARY_CLASS_P (elt
)
2563 || BINARY_CLASS_P (elt
)
2564 || EXPRESSION_CLASS_P (elt
))
2565 ? TREE_OPERAND (elt
, 0) : 0))
2566 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2567 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2569 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
2571 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2572 survives until RTL generation, there will be an error. */
2576 /* TREE_LIST is special because we need to look at TREE_VALUE
2577 and TREE_CHAIN, not TREE_OPERANDS. */
2578 else if (code
== TREE_LIST
)
2580 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2581 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2582 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2585 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2588 switch (TREE_CODE_CLASS (code
))
2591 case tcc_declaration
:
2594 case tcc_exceptional
:
2597 case tcc_comparison
:
2598 case tcc_expression
:
2601 switch (TREE_CODE_LENGTH (code
))
2607 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2608 if (op0
== TREE_OPERAND (exp
, 0))
2611 return fold_build1 (code
, TREE_TYPE (exp
), op0
);
2614 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2615 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2617 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2620 return fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2623 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2624 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2625 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2627 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2628 && op2
== TREE_OPERAND (exp
, 2))
2631 return fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2634 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2635 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2636 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2637 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2639 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2640 && op2
== TREE_OPERAND (exp
, 2)
2641 && op3
== TREE_OPERAND (exp
, 3))
2644 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2656 /* Stabilize a reference so that we can use it any number of times
2657 without causing its operands to be evaluated more than once.
2658 Returns the stabilized reference. This works by means of save_expr,
2659 so see the caveats in the comments about save_expr.
2661 Also allows conversion expressions whose operands are references.
2662 Any other kind of expression is returned unchanged. */
2665 stabilize_reference (tree ref
)
2668 enum tree_code code
= TREE_CODE (ref
);
2675 /* No action is needed in this case. */
2681 case FIX_TRUNC_EXPR
:
2682 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2686 result
= build_nt (INDIRECT_REF
,
2687 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2691 result
= build_nt (COMPONENT_REF
,
2692 stabilize_reference (TREE_OPERAND (ref
, 0)),
2693 TREE_OPERAND (ref
, 1), NULL_TREE
);
2697 result
= build_nt (BIT_FIELD_REF
,
2698 stabilize_reference (TREE_OPERAND (ref
, 0)),
2699 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2700 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2704 result
= build_nt (ARRAY_REF
,
2705 stabilize_reference (TREE_OPERAND (ref
, 0)),
2706 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2707 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2710 case ARRAY_RANGE_REF
:
2711 result
= build_nt (ARRAY_RANGE_REF
,
2712 stabilize_reference (TREE_OPERAND (ref
, 0)),
2713 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2714 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2718 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2719 it wouldn't be ignored. This matters when dealing with
2721 return stabilize_reference_1 (ref
);
2723 /* If arg isn't a kind of lvalue we recognize, make no change.
2724 Caller should recognize the error for an invalid lvalue. */
2729 return error_mark_node
;
2732 TREE_TYPE (result
) = TREE_TYPE (ref
);
2733 TREE_READONLY (result
) = TREE_READONLY (ref
);
2734 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2735 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2740 /* Subroutine of stabilize_reference; this is called for subtrees of
2741 references. Any expression with side-effects must be put in a SAVE_EXPR
2742 to ensure that it is only evaluated once.
2744 We don't put SAVE_EXPR nodes around everything, because assigning very
2745 simple expressions to temporaries causes us to miss good opportunities
2746 for optimizations. Among other things, the opportunity to fold in the
2747 addition of a constant into an addressing mode often gets lost, e.g.
2748 "y[i+1] += x;". In general, we take the approach that we should not make
2749 an assignment unless we are forced into it - i.e., that any non-side effect
2750 operator should be allowed, and that cse should take care of coalescing
2751 multiple utterances of the same expression should that prove fruitful. */
2754 stabilize_reference_1 (tree e
)
2757 enum tree_code code
= TREE_CODE (e
);
2759 /* We cannot ignore const expressions because it might be a reference
2760 to a const array but whose index contains side-effects. But we can
2761 ignore things that are actual constant or that already have been
2762 handled by this function. */
2764 if (TREE_INVARIANT (e
))
2767 switch (TREE_CODE_CLASS (code
))
2769 case tcc_exceptional
:
2771 case tcc_declaration
:
2772 case tcc_comparison
:
2774 case tcc_expression
:
2776 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2777 so that it will only be evaluated once. */
2778 /* The reference (r) and comparison (<) classes could be handled as
2779 below, but it is generally faster to only evaluate them once. */
2780 if (TREE_SIDE_EFFECTS (e
))
2781 return save_expr (e
);
2785 /* Constants need no processing. In fact, we should never reach
2790 /* Division is slow and tends to be compiled with jumps,
2791 especially the division by powers of 2 that is often
2792 found inside of an array reference. So do it just once. */
2793 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2794 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2795 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2796 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2797 return save_expr (e
);
2798 /* Recursively stabilize each operand. */
2799 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2800 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2804 /* Recursively stabilize each operand. */
2805 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2812 TREE_TYPE (result
) = TREE_TYPE (e
);
2813 TREE_READONLY (result
) = TREE_READONLY (e
);
2814 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2815 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2816 TREE_INVARIANT (result
) = 1;
2821 /* Low-level constructors for expressions. */
2823 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2824 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2827 recompute_tree_invariant_for_addr_expr (tree t
)
2830 bool tc
= true, ti
= true, se
= false;
2832 /* We started out assuming this address is both invariant and constant, but
2833 does not have side effects. Now go down any handled components and see if
2834 any of them involve offsets that are either non-constant or non-invariant.
2835 Also check for side-effects.
2837 ??? Note that this code makes no attempt to deal with the case where
2838 taking the address of something causes a copy due to misalignment. */
2840 #define UPDATE_TITCSE(NODE) \
2841 do { tree _node = (NODE); \
2842 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2843 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2844 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2846 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2847 node
= TREE_OPERAND (node
, 0))
2849 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2850 array reference (probably made temporarily by the G++ front end),
2851 so ignore all the operands. */
2852 if ((TREE_CODE (node
) == ARRAY_REF
2853 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2854 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2856 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2857 if (TREE_OPERAND (node
, 2))
2858 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2859 if (TREE_OPERAND (node
, 3))
2860 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2862 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2863 FIELD_DECL, apparently. The G++ front end can put something else
2864 there, at least temporarily. */
2865 else if (TREE_CODE (node
) == COMPONENT_REF
2866 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2868 if (TREE_OPERAND (node
, 2))
2869 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2871 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2872 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2875 node
= lang_hooks
.expr_to_decl (node
, &tc
, &ti
, &se
);
2877 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2878 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2879 invariant and constant if the decl is static. It's also invariant if it's
2880 a decl in the current function. Taking the address of a volatile variable
2881 is not volatile. If it's a constant, the address is both invariant and
2882 constant. Otherwise it's neither. */
2883 if (TREE_CODE (node
) == INDIRECT_REF
)
2884 UPDATE_TITCSE (TREE_OPERAND (node
, 0));
2885 else if (DECL_P (node
))
2889 else if (decl_function_context (node
) == current_function_decl
2890 /* Addresses of thread-local variables are invariant. */
2891 || (TREE_CODE (node
) == VAR_DECL
2892 && DECL_THREAD_LOCAL_P (node
)))
2897 else if (CONSTANT_CLASS_P (node
))
2902 se
|= TREE_SIDE_EFFECTS (node
);
2905 TREE_CONSTANT (t
) = tc
;
2906 TREE_INVARIANT (t
) = ti
;
2907 TREE_SIDE_EFFECTS (t
) = se
;
2908 #undef UPDATE_TITCSE
2911 /* Build an expression of code CODE, data type TYPE, and operands as
2912 specified. Expressions and reference nodes can be created this way.
2913 Constants, decls, types and misc nodes cannot be.
2915 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2916 enough for all extant tree codes. */
2919 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2923 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2925 t
= make_node_stat (code PASS_MEM_STAT
);
2932 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2934 int length
= sizeof (struct tree_exp
);
2935 #ifdef GATHER_STATISTICS
2936 tree_node_kind kind
;
2940 #ifdef GATHER_STATISTICS
2941 switch (TREE_CODE_CLASS (code
))
2943 case tcc_statement
: /* an expression with side effects */
2946 case tcc_reference
: /* a reference */
2954 tree_node_counts
[(int) kind
]++;
2955 tree_node_sizes
[(int) kind
] += length
;
2958 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2960 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
2962 memset (t
, 0, sizeof (struct tree_common
));
2964 TREE_SET_CODE (t
, code
);
2966 TREE_TYPE (t
) = type
;
2967 #ifdef USE_MAPPED_LOCATION
2968 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2970 SET_EXPR_LOCUS (t
, NULL
);
2972 TREE_COMPLEXITY (t
) = 0;
2973 TREE_OPERAND (t
, 0) = node
;
2974 TREE_BLOCK (t
) = NULL_TREE
;
2975 if (node
&& !TYPE_P (node
))
2977 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2978 TREE_READONLY (t
) = TREE_READONLY (node
);
2981 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2982 TREE_SIDE_EFFECTS (t
) = 1;
2986 /* All of these have side-effects, no matter what their
2988 TREE_SIDE_EFFECTS (t
) = 1;
2989 TREE_READONLY (t
) = 0;
2992 case MISALIGNED_INDIRECT_REF
:
2993 case ALIGN_INDIRECT_REF
:
2995 /* Whether a dereference is readonly has nothing to do with whether
2996 its operand is readonly. */
2997 TREE_READONLY (t
) = 0;
3002 recompute_tree_invariant_for_addr_expr (t
);
3006 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3007 && node
&& !TYPE_P (node
)
3008 && TREE_CONSTANT (node
))
3009 TREE_CONSTANT (t
) = 1;
3010 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3011 && node
&& TREE_INVARIANT (node
))
3012 TREE_INVARIANT (t
) = 1;
3013 if (TREE_CODE_CLASS (code
) == tcc_reference
3014 && node
&& TREE_THIS_VOLATILE (node
))
3015 TREE_THIS_VOLATILE (t
) = 1;
3022 #define PROCESS_ARG(N) \
3024 TREE_OPERAND (t, N) = arg##N; \
3025 if (arg##N &&!TYPE_P (arg##N)) \
3027 if (TREE_SIDE_EFFECTS (arg##N)) \
3029 if (!TREE_READONLY (arg##N)) \
3031 if (!TREE_CONSTANT (arg##N)) \
3033 if (!TREE_INVARIANT (arg##N)) \
3039 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3041 bool constant
, read_only
, side_effects
, invariant
;
3044 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3046 if (code
== MODIFY_EXPR
&& cfun
&& cfun
->gimplified
)
3048 /* We should be talking GIMPLE_MODIFY_STMT by now. */
3052 /* FIXME tuples: For now let's be lazy; later we must rewrite all
3053 build2 calls to build2_gimple calls. */
3054 if (TREE_CODE_CLASS (code
) == tcc_gimple_stmt
)
3055 return build2_gimple (code
, arg0
, arg1
);
3057 t
= make_node_stat (code PASS_MEM_STAT
);
3060 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3061 result based on those same flags for the arguments. But if the
3062 arguments aren't really even `tree' expressions, we shouldn't be trying
3065 /* Expressions without side effects may be constant if their
3066 arguments are as well. */
3067 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3068 || TREE_CODE_CLASS (code
) == tcc_binary
);
3070 side_effects
= TREE_SIDE_EFFECTS (t
);
3071 invariant
= constant
;
3076 TREE_READONLY (t
) = read_only
;
3077 TREE_CONSTANT (t
) = constant
;
3078 TREE_INVARIANT (t
) = invariant
;
3079 TREE_SIDE_EFFECTS (t
) = side_effects
;
3080 TREE_THIS_VOLATILE (t
)
3081 = (TREE_CODE_CLASS (code
) == tcc_reference
3082 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3088 /* Similar as build2_stat, but for GIMPLE tuples. For convenience's sake,
3089 arguments and return type are trees. */
3092 build2_gimple_stat (enum tree_code code
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3097 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3099 t
= make_node_stat (code PASS_MEM_STAT
);
3101 side_effects
= TREE_SIDE_EFFECTS (t
);
3103 /* ?? We don't care about setting flags for tuples... */
3104 GIMPLE_STMT_OPERAND (t
, 0) = arg0
;
3105 GIMPLE_STMT_OPERAND (t
, 1) = arg1
;
3107 /* ...except perhaps side_effects and volatility. ?? */
3108 TREE_SIDE_EFFECTS (t
) = side_effects
;
3109 TREE_THIS_VOLATILE (t
) = (TREE_CODE_CLASS (code
) == tcc_reference
3110 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3117 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3118 tree arg2 MEM_STAT_DECL
)
3120 bool constant
, read_only
, side_effects
, invariant
;
3123 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3125 t
= make_node_stat (code PASS_MEM_STAT
);
3128 side_effects
= TREE_SIDE_EFFECTS (t
);
3134 if (code
== CALL_EXPR
&& !side_effects
)
3139 /* Calls have side-effects, except those to const or
3141 i
= call_expr_flags (t
);
3142 if (!(i
& (ECF_CONST
| ECF_PURE
)))
3145 /* And even those have side-effects if their arguments do. */
3146 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
3147 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
3154 TREE_SIDE_EFFECTS (t
) = side_effects
;
3155 TREE_THIS_VOLATILE (t
)
3156 = (TREE_CODE_CLASS (code
) == tcc_reference
3157 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3163 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3164 tree arg2
, tree arg3 MEM_STAT_DECL
)
3166 bool constant
, read_only
, side_effects
, invariant
;
3169 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3171 t
= make_node_stat (code PASS_MEM_STAT
);
3174 side_effects
= TREE_SIDE_EFFECTS (t
);
3181 TREE_SIDE_EFFECTS (t
) = side_effects
;
3182 TREE_THIS_VOLATILE (t
)
3183 = (TREE_CODE_CLASS (code
) == tcc_reference
3184 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3190 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3191 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3193 bool constant
, read_only
, side_effects
, invariant
;
3196 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3198 t
= make_node_stat (code PASS_MEM_STAT
);
3201 side_effects
= TREE_SIDE_EFFECTS (t
);
3209 TREE_SIDE_EFFECTS (t
) = side_effects
;
3210 TREE_THIS_VOLATILE (t
)
3211 = (TREE_CODE_CLASS (code
) == tcc_reference
3212 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3218 build7_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3219 tree arg2
, tree arg3
, tree arg4
, tree arg5
,
3220 tree arg6 MEM_STAT_DECL
)
3222 bool constant
, read_only
, side_effects
, invariant
;
3225 gcc_assert (code
== TARGET_MEM_REF
);
3227 t
= make_node_stat (code PASS_MEM_STAT
);
3230 side_effects
= TREE_SIDE_EFFECTS (t
);
3240 TREE_SIDE_EFFECTS (t
) = side_effects
;
3241 TREE_THIS_VOLATILE (t
) = 0;
3246 /* Similar except don't specify the TREE_TYPE
3247 and leave the TREE_SIDE_EFFECTS as 0.
3248 It is permissible for arguments to be null,
3249 or even garbage if their values do not matter. */
3252 build_nt (enum tree_code code
, ...)
3261 t
= make_node (code
);
3262 length
= TREE_CODE_LENGTH (code
);
3264 for (i
= 0; i
< length
; i
++)
3265 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3271 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3272 We do NOT enter this node in any sort of symbol table.
3274 layout_decl is used to set up the decl's storage layout.
3275 Other slots are initialized to 0 or null pointers. */
3278 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
3282 t
= make_node_stat (code PASS_MEM_STAT
);
3284 /* if (type == error_mark_node)
3285 type = integer_type_node; */
3286 /* That is not done, deliberately, so that having error_mark_node
3287 as the type can suppress useless errors in the use of this variable. */
3289 DECL_NAME (t
) = name
;
3290 TREE_TYPE (t
) = type
;
3292 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3294 else if (code
== FUNCTION_DECL
)
3295 DECL_MODE (t
) = FUNCTION_MODE
;
3300 /* Builds and returns function declaration with NAME and TYPE. */
3303 build_fn_decl (const char *name
, tree type
)
3305 tree id
= get_identifier (name
);
3306 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
3308 DECL_EXTERNAL (decl
) = 1;
3309 TREE_PUBLIC (decl
) = 1;
3310 DECL_ARTIFICIAL (decl
) = 1;
3311 TREE_NOTHROW (decl
) = 1;
3317 /* BLOCK nodes are used to represent the structure of binding contours
3318 and declarations, once those contours have been exited and their contents
3319 compiled. This information is used for outputting debugging info. */
3322 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3324 tree block
= make_node (BLOCK
);
3326 BLOCK_VARS (block
) = vars
;
3327 BLOCK_SUBBLOCKS (block
) = subblocks
;
3328 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3329 BLOCK_CHAIN (block
) = chain
;
3333 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
3334 /* ??? gengtype doesn't handle conditionals */
3335 static GTY(()) source_locus last_annotated_node
;
3338 #ifdef USE_MAPPED_LOCATION
3341 expand_location (source_location loc
)
3343 expanded_location xloc
;
3352 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
3353 xloc
.file
= map
->to_file
;
3354 xloc
.line
= SOURCE_LINE (map
, loc
);
3355 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3362 /* Record the exact location where an expression or an identifier were
3366 annotate_with_file_line (tree node
, const char *file
, int line
)
3368 /* Roughly one percent of the calls to this function are to annotate
3369 a node with the same information already attached to that node!
3370 Just return instead of wasting memory. */
3371 if (EXPR_LOCUS (node
)
3372 && EXPR_LINENO (node
) == line
3373 && (EXPR_FILENAME (node
) == file
3374 || !strcmp (EXPR_FILENAME (node
), file
)))
3376 last_annotated_node
= EXPR_LOCUS (node
);
3380 /* In heavily macroized code (such as GCC itself) this single
3381 entry cache can reduce the number of allocations by more
3383 if (last_annotated_node
3384 && last_annotated_node
->line
== line
3385 && (last_annotated_node
->file
== file
3386 || !strcmp (last_annotated_node
->file
, file
)))
3388 SET_EXPR_LOCUS (node
, last_annotated_node
);
3392 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
3393 EXPR_LINENO (node
) = line
;
3394 EXPR_FILENAME (node
) = file
;
3395 last_annotated_node
= EXPR_LOCUS (node
);
3399 annotate_with_locus (tree node
, location_t locus
)
3401 annotate_with_file_line (node
, locus
.file
, locus
.line
);
3405 /* Source location accessor functions. */
3408 /* The source location of this expression. Non-tree_exp nodes such as
3409 decls and constants can be shared among multiple locations, so
3412 expr_location (tree node
)
3414 #ifdef USE_MAPPED_LOCATION
3415 if (GIMPLE_STMT_P (node
))
3416 return GIMPLE_STMT_LOCUS (node
);
3417 return EXPR_P (node
) ? node
->exp
.locus
: UNKNOWN_LOCATION
;
3419 if (GIMPLE_STMT_P (node
))
3420 return EXPR_HAS_LOCATION (node
)
3421 ? *GIMPLE_STMT_LOCUS (node
) : UNKNOWN_LOCATION
;
3422 return EXPR_HAS_LOCATION (node
) ? *node
->exp
.locus
: UNKNOWN_LOCATION
;
3427 set_expr_location (tree node
, location_t locus
)
3429 #ifdef USE_MAPPED_LOCATION
3430 if (GIMPLE_STMT_P (node
))
3431 GIMPLE_STMT_LOCUS (node
) = locus
;
3433 EXPR_CHECK (node
)->exp
.locus
= locus
;
3435 annotate_with_locus (node
, locus
);
3440 expr_has_location (tree node
)
3442 #ifdef USE_MAPPED_LOCATION
3443 return expr_location (node
) != UNKNOWN_LOCATION
;
3445 return expr_locus (node
) != NULL
;
3449 #ifdef USE_MAPPED_LOCATION
3454 expr_locus (tree node
)
3456 #ifdef USE_MAPPED_LOCATION
3457 if (GIMPLE_STMT_P (node
))
3458 return &GIMPLE_STMT_LOCUS (node
);
3459 return EXPR_P (node
) ? &node
->exp
.locus
: (location_t
*) NULL
;
3461 if (GIMPLE_STMT_P (node
))
3462 return GIMPLE_STMT_LOCUS (node
);
3463 /* ?? The cast below was originally "(location_t *)" in the macro,
3464 but that makes no sense. ?? */
3465 return EXPR_P (node
) ? node
->exp
.locus
: (source_locus
) NULL
;
3470 set_expr_locus (tree node
,
3471 #ifdef USE_MAPPED_LOCATION
3472 source_location
*loc
3478 #ifdef USE_MAPPED_LOCATION
3481 if (GIMPLE_STMT_P (node
))
3482 GIMPLE_STMT_LOCUS (node
) = UNKNOWN_LOCATION
;
3484 EXPR_CHECK (node
)->exp
.locus
= UNKNOWN_LOCATION
;
3488 if (GIMPLE_STMT_P (node
))
3489 GIMPLE_STMT_LOCUS (node
) = *loc
;
3491 EXPR_CHECK (node
)->exp
.locus
= *loc
;
3494 if (GIMPLE_STMT_P (node
))
3495 GIMPLE_STMT_LOCUS (node
) = loc
;
3497 EXPR_CHECK (node
)->exp
.locus
= loc
;
3502 expr_filename (tree node
)
3504 #ifdef USE_MAPPED_LOCATION
3505 if (GIMPLE_STMT_P (node
))
3506 return &LOCATION_FILE (GIMPLE_STMT_LOCUS (node
));
3507 return &LOCATION_FILE (EXPR_CHECK (node
)->exp
.locus
);
3509 if (GIMPLE_STMT_P (node
))
3510 return &GIMPLE_STMT_LOCUS (node
)->file
;
3511 return &(EXPR_CHECK (node
)->exp
.locus
->file
);
3516 expr_lineno (tree node
)
3518 #ifdef USE_MAPPED_LOCATION
3519 if (GIMPLE_STMT_P (node
))
3520 return &LOCATION_LINE (GIMPLE_STMT_LOCUS (node
));
3521 return &LOCATION_LINE (EXPR_CHECK (node
)->exp
.locus
);
3523 if (GIMPLE_STMT_P (node
))
3524 return &GIMPLE_STMT_LOCUS (node
)->line
;
3525 return &EXPR_CHECK (node
)->exp
.locus
->line
;
3529 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3533 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3535 DECL_ATTRIBUTES (ddecl
) = attribute
;
3539 /* Borrowed from hashtab.c iterative_hash implementation. */
3540 #define mix(a,b,c) \
3542 a -= b; a -= c; a ^= (c>>13); \
3543 b -= c; b -= a; b ^= (a<< 8); \
3544 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3545 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3546 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3547 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3548 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3549 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3550 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3554 /* Produce good hash value combining VAL and VAL2. */
3555 static inline hashval_t
3556 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
3558 /* the golden ratio; an arbitrary value. */
3559 hashval_t a
= 0x9e3779b9;
3565 /* Produce good hash value combining PTR and VAL2. */
3566 static inline hashval_t
3567 iterative_hash_pointer (void *ptr
, hashval_t val2
)
3569 if (sizeof (ptr
) == sizeof (hashval_t
))
3570 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
3573 hashval_t a
= (hashval_t
) (size_t) ptr
;
3574 /* Avoid warnings about shifting of more than the width of the type on
3575 hosts that won't execute this path. */
3577 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
3583 /* Produce good hash value combining VAL and VAL2. */
3584 static inline hashval_t
3585 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
3587 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
3588 return iterative_hash_hashval_t (val
, val2
);
3591 hashval_t a
= (hashval_t
) val
;
3592 /* Avoid warnings about shifting of more than the width of the type on
3593 hosts that won't execute this path. */
3595 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
3597 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
3599 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
3600 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
3607 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3608 is ATTRIBUTE and its qualifiers are QUALS.
3610 Record such modified types already made so we don't make duplicates. */
3613 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
3615 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3617 hashval_t hashcode
= 0;
3619 enum tree_code code
= TREE_CODE (ttype
);
3621 ntype
= copy_node (ttype
);
3623 TYPE_POINTER_TO (ntype
) = 0;
3624 TYPE_REFERENCE_TO (ntype
) = 0;
3625 TYPE_ATTRIBUTES (ntype
) = attribute
;
3627 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
))
3628 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
3630 TYPE_CANONICAL (ntype
)
3631 = build_qualified_type (TYPE_CANONICAL (ttype
), quals
);
3633 /* Create a new main variant of TYPE. */
3634 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3635 TYPE_NEXT_VARIANT (ntype
) = 0;
3636 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3638 hashcode
= iterative_hash_object (code
, hashcode
);
3639 if (TREE_TYPE (ntype
))
3640 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3642 hashcode
= attribute_hash_list (attribute
, hashcode
);
3644 switch (TREE_CODE (ntype
))
3647 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3650 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3654 hashcode
= iterative_hash_object
3655 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3656 hashcode
= iterative_hash_object
3657 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3661 unsigned int precision
= TYPE_PRECISION (ntype
);
3662 hashcode
= iterative_hash_object (precision
, hashcode
);
3669 ntype
= type_hash_canon (hashcode
, ntype
);
3671 /* If the target-dependent attributes make NTYPE different from
3672 its canonical type, we will need to use structural equality
3673 checks for this qualified type. */
3674 if (!targetm
.comp_type_attributes (ntype
, ttype
))
3675 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
3677 ttype
= build_qualified_type (ntype
, quals
);
3684 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3687 Record such modified types already made so we don't make duplicates. */
3690 build_type_attribute_variant (tree ttype
, tree attribute
)
3692 return build_type_attribute_qual_variant (ttype
, attribute
,
3693 TYPE_QUALS (ttype
));
3696 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3699 We try both `text' and `__text__', ATTR may be either one. */
3700 /* ??? It might be a reasonable simplification to require ATTR to be only
3701 `text'. One might then also require attribute lists to be stored in
3702 their canonicalized form. */
3705 is_attribute_with_length_p (const char *attr
, int attr_len
, tree ident
)
3710 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3713 p
= IDENTIFIER_POINTER (ident
);
3714 ident_len
= IDENTIFIER_LENGTH (ident
);
3716 if (ident_len
== attr_len
3717 && strcmp (attr
, p
) == 0)
3720 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3723 gcc_assert (attr
[1] == '_');
3724 gcc_assert (attr
[attr_len
- 2] == '_');
3725 gcc_assert (attr
[attr_len
- 1] == '_');
3726 if (ident_len
== attr_len
- 4
3727 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3732 if (ident_len
== attr_len
+ 4
3733 && p
[0] == '_' && p
[1] == '_'
3734 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3735 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3742 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3745 We try both `text' and `__text__', ATTR may be either one. */
3748 is_attribute_p (const char *attr
, tree ident
)
3750 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3753 /* Given an attribute name and a list of attributes, return a pointer to the
3754 attribute's list element if the attribute is part of the list, or NULL_TREE
3755 if not found. If the attribute appears more than once, this only
3756 returns the first occurrence; the TREE_CHAIN of the return value should
3757 be passed back in if further occurrences are wanted. */
3760 lookup_attribute (const char *attr_name
, tree list
)
3763 size_t attr_len
= strlen (attr_name
);
3765 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3767 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3768 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3775 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3779 remove_attribute (const char *attr_name
, tree list
)
3782 size_t attr_len
= strlen (attr_name
);
3784 for (p
= &list
; *p
; )
3787 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3788 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3789 *p
= TREE_CHAIN (l
);
3791 p
= &TREE_CHAIN (l
);
3797 /* Return an attribute list that is the union of a1 and a2. */
3800 merge_attributes (tree a1
, tree a2
)
3804 /* Either one unset? Take the set one. */
3806 if ((attributes
= a1
) == 0)
3809 /* One that completely contains the other? Take it. */
3811 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3813 if (attribute_list_contained (a2
, a1
))
3817 /* Pick the longest list, and hang on the other list. */
3819 if (list_length (a1
) < list_length (a2
))
3820 attributes
= a2
, a2
= a1
;
3822 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3825 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3828 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3831 if (TREE_VALUE (a
) != NULL
3832 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
3833 && TREE_VALUE (a2
) != NULL
3834 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
3836 if (simple_cst_list_equal (TREE_VALUE (a
),
3837 TREE_VALUE (a2
)) == 1)
3840 else if (simple_cst_equal (TREE_VALUE (a
),
3841 TREE_VALUE (a2
)) == 1)
3846 a1
= copy_node (a2
);
3847 TREE_CHAIN (a1
) = attributes
;
3856 /* Given types T1 and T2, merge their attributes and return
3860 merge_type_attributes (tree t1
, tree t2
)
3862 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3863 TYPE_ATTRIBUTES (t2
));
3866 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3870 merge_decl_attributes (tree olddecl
, tree newdecl
)
3872 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3873 DECL_ATTRIBUTES (newdecl
));
3876 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3878 /* Specialization of merge_decl_attributes for various Windows targets.
3880 This handles the following situation:
3882 __declspec (dllimport) int foo;
3885 The second instance of `foo' nullifies the dllimport. */
3888 merge_dllimport_decl_attributes (tree old
, tree
new)
3891 int delete_dllimport_p
= 1;
3893 /* What we need to do here is remove from `old' dllimport if it doesn't
3894 appear in `new'. dllimport behaves like extern: if a declaration is
3895 marked dllimport and a definition appears later, then the object
3896 is not dllimport'd. We also remove a `new' dllimport if the old list
3897 contains dllexport: dllexport always overrides dllimport, regardless
3898 of the order of declaration. */
3899 if (!VAR_OR_FUNCTION_DECL_P (new))
3900 delete_dllimport_p
= 0;
3901 else if (DECL_DLLIMPORT_P (new)
3902 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
3904 DECL_DLLIMPORT_P (new) = 0;
3905 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
3906 "dllimport ignored", new);
3908 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new))
3910 /* Warn about overriding a symbol that has already been used. eg:
3911 extern int __attribute__ ((dllimport)) foo;
3912 int* bar () {return &foo;}
3915 if (TREE_USED (old
))
3917 warning (0, "%q+D redeclared without dllimport attribute "
3918 "after being referenced with dll linkage", new);
3919 /* If we have used a variable's address with dllimport linkage,
3920 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3921 decl may already have had TREE_INVARIANT and TREE_CONSTANT
3923 We still remove the attribute so that assembler code refers
3924 to '&foo rather than '_imp__foo'. */
3925 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
3926 DECL_DLLIMPORT_P (new) = 1;
3929 /* Let an inline definition silently override the external reference,
3930 but otherwise warn about attribute inconsistency. */
3931 else if (TREE_CODE (new) == VAR_DECL
3932 || !DECL_DECLARED_INLINE_P (new))
3933 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
3934 "previous dllimport ignored", new);
3937 delete_dllimport_p
= 0;
3939 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new));
3941 if (delete_dllimport_p
)
3944 const size_t attr_len
= strlen ("dllimport");
3946 /* Scan the list for dllimport and delete it. */
3947 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3949 if (is_attribute_with_length_p ("dllimport", attr_len
,
3952 if (prev
== NULL_TREE
)
3955 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3964 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3965 struct attribute_spec.handler. */
3968 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3973 /* These attributes may apply to structure and union types being created,
3974 but otherwise should pass to the declaration involved. */
3977 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3978 | (int) ATTR_FLAG_ARRAY_NEXT
))
3980 *no_add_attrs
= true;
3981 return tree_cons (name
, args
, NULL_TREE
);
3983 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3985 warning (OPT_Wattributes
, "%qs attribute ignored",
3986 IDENTIFIER_POINTER (name
));
3987 *no_add_attrs
= true;
3993 if (TREE_CODE (node
) != FUNCTION_DECL
3994 && TREE_CODE (node
) != VAR_DECL
)
3996 *no_add_attrs
= true;
3997 warning (OPT_Wattributes
, "%qs attribute ignored",
3998 IDENTIFIER_POINTER (name
));
4002 /* Report error on dllimport ambiguities seen now before they cause
4004 else if (is_attribute_p ("dllimport", name
))
4006 /* Honor any target-specific overrides. */
4007 if (!targetm
.valid_dllimport_attribute_p (node
))
4008 *no_add_attrs
= true;
4010 else if (TREE_CODE (node
) == FUNCTION_DECL
4011 && DECL_DECLARED_INLINE_P (node
))
4013 warning (OPT_Wattributes
, "inline function %q+D declared as "
4014 " dllimport: attribute ignored", node
);
4015 *no_add_attrs
= true;
4017 /* Like MS, treat definition of dllimported variables and
4018 non-inlined functions on declaration as syntax errors. */
4019 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
4021 error ("function %q+D definition is marked dllimport", node
);
4022 *no_add_attrs
= true;
4025 else if (TREE_CODE (node
) == VAR_DECL
)
4027 if (DECL_INITIAL (node
))
4029 error ("variable %q+D definition is marked dllimport",
4031 *no_add_attrs
= true;
4034 /* `extern' needn't be specified with dllimport.
4035 Specify `extern' now and hope for the best. Sigh. */
4036 DECL_EXTERNAL (node
) = 1;
4037 /* Also, implicitly give dllimport'd variables declared within
4038 a function global scope, unless declared static. */
4039 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
4040 TREE_PUBLIC (node
) = 1;
4043 if (*no_add_attrs
== false)
4044 DECL_DLLIMPORT_P (node
) = 1;
4047 /* Report error if symbol is not accessible at global scope. */
4048 if (!TREE_PUBLIC (node
)
4049 && (TREE_CODE (node
) == VAR_DECL
4050 || TREE_CODE (node
) == FUNCTION_DECL
))
4052 error ("external linkage required for symbol %q+D because of "
4053 "%qs attribute", node
, IDENTIFIER_POINTER (name
));
4054 *no_add_attrs
= true;
4060 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4062 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4063 of the various TYPE_QUAL values. */
4066 set_type_quals (tree type
, int type_quals
)
4068 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
4069 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
4070 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
4073 /* Returns true iff cand is equivalent to base with type_quals. */
4076 check_qualified_type (tree cand
, tree base
, int type_quals
)
4078 return (TYPE_QUALS (cand
) == type_quals
4079 && TYPE_NAME (cand
) == TYPE_NAME (base
)
4080 /* Apparently this is needed for Objective-C. */
4081 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
4082 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
4083 TYPE_ATTRIBUTES (base
)));
4086 /* Return a version of the TYPE, qualified as indicated by the
4087 TYPE_QUALS, if one exists. If no qualified version exists yet,
4088 return NULL_TREE. */
4091 get_qualified_type (tree type
, int type_quals
)
4095 if (TYPE_QUALS (type
) == type_quals
)
4098 /* Search the chain of variants to see if there is already one there just
4099 like the one we need to have. If so, use that existing one. We must
4100 preserve the TYPE_NAME, since there is code that depends on this. */
4101 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4102 if (check_qualified_type (t
, type
, type_quals
))
4108 /* Like get_qualified_type, but creates the type if it does not
4109 exist. This function never returns NULL_TREE. */
4112 build_qualified_type (tree type
, int type_quals
)
4116 /* See if we already have the appropriate qualified variant. */
4117 t
= get_qualified_type (type
, type_quals
);
4119 /* If not, build it. */
4122 t
= build_variant_type_copy (type
);
4123 set_type_quals (t
, type_quals
);
4125 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4126 /* Propagate structural equality. */
4127 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4128 else if (TYPE_CANONICAL (type
) != type
)
4129 /* Build the underlying canonical type, since it is different
4131 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
4134 /* T is its own canonical type. */
4135 TYPE_CANONICAL (t
) = t
;
4142 /* Create a new distinct copy of TYPE. The new type is made its own
4143 MAIN_VARIANT. If TYPE requires structural equality checks, the
4144 resulting type requires structural equality checks; otherwise, its
4145 TYPE_CANONICAL points to itself. */
4148 build_distinct_type_copy (tree type
)
4150 tree t
= copy_node (type
);
4152 TYPE_POINTER_TO (t
) = 0;
4153 TYPE_REFERENCE_TO (t
) = 0;
4155 /* Set the canonical type either to a new equivalence class, or
4156 propagate the need for structural equality checks. */
4157 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4158 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4160 TYPE_CANONICAL (t
) = t
;
4162 /* Make it its own variant. */
4163 TYPE_MAIN_VARIANT (t
) = t
;
4164 TYPE_NEXT_VARIANT (t
) = 0;
4169 /* Create a new variant of TYPE, equivalent but distinct. This is so
4170 the caller can modify it. TYPE_CANONICAL for the return type will
4171 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4172 are considered equal by the language itself (or that both types
4173 require structural equality checks). */
4176 build_variant_type_copy (tree type
)
4178 tree t
, m
= TYPE_MAIN_VARIANT (type
);
4180 t
= build_distinct_type_copy (type
);
4182 /* Since we're building a variant, assume that it is a non-semantic
4183 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4184 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
4186 /* Add the new type to the chain of variants of TYPE. */
4187 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
4188 TYPE_NEXT_VARIANT (m
) = t
;
4189 TYPE_MAIN_VARIANT (t
) = m
;
4194 /* Return true if the from tree in both tree maps are equal. */
4197 tree_map_eq (const void *va
, const void *vb
)
4199 const struct tree_map
*a
= va
, *b
= vb
;
4200 return (a
->from
== b
->from
);
4203 /* Hash a from tree in a tree_map. */
4206 tree_map_hash (const void *item
)
4208 return (((const struct tree_map
*) item
)->hash
);
4211 /* Return true if this tree map structure is marked for garbage collection
4212 purposes. We simply return true if the from tree is marked, so that this
4213 structure goes away when the from tree goes away. */
4216 tree_map_marked_p (const void *p
)
4218 tree from
= ((struct tree_map
*) p
)->from
;
4220 return ggc_marked_p (from
);
4223 /* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
4226 tree_int_map_eq (const void *va
, const void *vb
)
4228 const struct tree_int_map
*a
= va
, *b
= vb
;
4229 return (a
->from
== b
->from
);
4232 /* Hash a from tree in the tree_int_map * ITEM. */
4235 tree_int_map_hash (const void *item
)
4237 return htab_hash_pointer (((const struct tree_int_map
*)item
)->from
);
4240 /* Return true if this tree int map structure is marked for garbage collection
4241 purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
4242 structure goes away when the from tree goes away. */
4245 tree_int_map_marked_p (const void *p
)
4247 tree from
= ((struct tree_int_map
*) p
)->from
;
4249 return ggc_marked_p (from
);
4251 /* Lookup an init priority for FROM, and return it if we find one. */
4254 decl_init_priority_lookup (tree from
)
4256 struct tree_int_map
*h
, in
;
4259 h
= htab_find_with_hash (init_priority_for_decl
,
4260 &in
, htab_hash_pointer (from
));
4266 /* Insert a mapping FROM->TO in the init priority hashtable. */
4269 decl_init_priority_insert (tree from
, unsigned short to
)
4271 struct tree_int_map
*h
;
4274 h
= ggc_alloc (sizeof (struct tree_int_map
));
4277 loc
= htab_find_slot_with_hash (init_priority_for_decl
, h
,
4278 htab_hash_pointer (from
), INSERT
);
4279 *(struct tree_int_map
**) loc
= h
;
4282 /* Look up a restrict qualified base decl for FROM. */
4285 decl_restrict_base_lookup (tree from
)
4291 h
= htab_find_with_hash (restrict_base_for_decl
, &in
,
4292 htab_hash_pointer (from
));
4293 return h
? h
->to
: NULL_TREE
;
4296 /* Record the restrict qualified base TO for FROM. */
4299 decl_restrict_base_insert (tree from
, tree to
)
4304 h
= ggc_alloc (sizeof (struct tree_map
));
4305 h
->hash
= htab_hash_pointer (from
);
4308 loc
= htab_find_slot_with_hash (restrict_base_for_decl
, h
, h
->hash
, INSERT
);
4309 *(struct tree_map
**) loc
= h
;
4312 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4315 print_debug_expr_statistics (void)
4317 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4318 (long) htab_size (debug_expr_for_decl
),
4319 (long) htab_elements (debug_expr_for_decl
),
4320 htab_collisions (debug_expr_for_decl
));
4323 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4326 print_value_expr_statistics (void)
4328 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4329 (long) htab_size (value_expr_for_decl
),
4330 (long) htab_elements (value_expr_for_decl
),
4331 htab_collisions (value_expr_for_decl
));
4334 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4335 don't print anything if the table is empty. */
4338 print_restrict_base_statistics (void)
4340 if (htab_elements (restrict_base_for_decl
) != 0)
4342 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4343 (long) htab_size (restrict_base_for_decl
),
4344 (long) htab_elements (restrict_base_for_decl
),
4345 htab_collisions (restrict_base_for_decl
));
4348 /* Lookup a debug expression for FROM, and return it if we find one. */
4351 decl_debug_expr_lookup (tree from
)
4353 struct tree_map
*h
, in
;
4356 h
= htab_find_with_hash (debug_expr_for_decl
, &in
, htab_hash_pointer (from
));
4362 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4365 decl_debug_expr_insert (tree from
, tree to
)
4370 h
= ggc_alloc (sizeof (struct tree_map
));
4371 h
->hash
= htab_hash_pointer (from
);
4374 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
4375 *(struct tree_map
**) loc
= h
;
4378 /* Lookup a value expression for FROM, and return it if we find one. */
4381 decl_value_expr_lookup (tree from
)
4383 struct tree_map
*h
, in
;
4386 h
= htab_find_with_hash (value_expr_for_decl
, &in
, htab_hash_pointer (from
));
4392 /* Insert a mapping FROM->TO in the value expression hashtable. */
4395 decl_value_expr_insert (tree from
, tree to
)
4400 h
= ggc_alloc (sizeof (struct tree_map
));
4401 h
->hash
= htab_hash_pointer (from
);
4404 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
4405 *(struct tree_map
**) loc
= h
;
4408 /* Hashing of types so that we don't make duplicates.
4409 The entry point is `type_hash_canon'. */
4411 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4412 with types in the TREE_VALUE slots), by adding the hash codes
4413 of the individual types. */
4416 type_hash_list (tree list
, hashval_t hashcode
)
4420 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4421 if (TREE_VALUE (tail
) != error_mark_node
)
4422 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
4428 /* These are the Hashtable callback functions. */
4430 /* Returns true iff the types are equivalent. */
4433 type_hash_eq (const void *va
, const void *vb
)
4435 const struct type_hash
*a
= va
, *b
= vb
;
4437 /* First test the things that are the same for all types. */
4438 if (a
->hash
!= b
->hash
4439 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
4440 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
4441 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
4442 TYPE_ATTRIBUTES (b
->type
))
4443 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
4444 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
4447 switch (TREE_CODE (a
->type
))
4452 case REFERENCE_TYPE
:
4456 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
4459 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
4460 && !(TYPE_VALUES (a
->type
)
4461 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
4462 && TYPE_VALUES (b
->type
)
4463 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
4464 && type_list_equal (TYPE_VALUES (a
->type
),
4465 TYPE_VALUES (b
->type
))))
4468 /* ... fall through ... */
4473 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
4474 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
4475 TYPE_MAX_VALUE (b
->type
)))
4476 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
4477 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
4478 TYPE_MIN_VALUE (b
->type
))));
4481 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
4484 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
4485 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4486 || (TYPE_ARG_TYPES (a
->type
)
4487 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4488 && TYPE_ARG_TYPES (b
->type
)
4489 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4490 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4491 TYPE_ARG_TYPES (b
->type
)))));
4494 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
4498 case QUAL_UNION_TYPE
:
4499 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
4500 || (TYPE_FIELDS (a
->type
)
4501 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
4502 && TYPE_FIELDS (b
->type
)
4503 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
4504 && type_list_equal (TYPE_FIELDS (a
->type
),
4505 TYPE_FIELDS (b
->type
))));
4508 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4509 || (TYPE_ARG_TYPES (a
->type
)
4510 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4511 && TYPE_ARG_TYPES (b
->type
)
4512 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4513 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4514 TYPE_ARG_TYPES (b
->type
))));
4521 /* Return the cached hash value. */
4524 type_hash_hash (const void *item
)
4526 return ((const struct type_hash
*) item
)->hash
;
4529 /* Look in the type hash table for a type isomorphic to TYPE.
4530 If one is found, return it. Otherwise return 0. */
4533 type_hash_lookup (hashval_t hashcode
, tree type
)
4535 struct type_hash
*h
, in
;
4537 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4538 must call that routine before comparing TYPE_ALIGNs. */
4544 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
4550 /* Add an entry to the type-hash-table
4551 for a type TYPE whose hash code is HASHCODE. */
4554 type_hash_add (hashval_t hashcode
, tree type
)
4556 struct type_hash
*h
;
4559 h
= ggc_alloc (sizeof (struct type_hash
));
4562 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
4563 *(struct type_hash
**) loc
= h
;
4566 /* Given TYPE, and HASHCODE its hash code, return the canonical
4567 object for an identical type if one already exists.
4568 Otherwise, return TYPE, and record it as the canonical object.
4570 To use this function, first create a type of the sort you want.
4571 Then compute its hash code from the fields of the type that
4572 make it different from other similar types.
4573 Then call this function and use the value. */
4576 type_hash_canon (unsigned int hashcode
, tree type
)
4580 /* The hash table only contains main variants, so ensure that's what we're
4582 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
4584 if (!lang_hooks
.types
.hash_types
)
4587 /* See if the type is in the hash table already. If so, return it.
4588 Otherwise, add the type. */
4589 t1
= type_hash_lookup (hashcode
, type
);
4592 #ifdef GATHER_STATISTICS
4593 tree_node_counts
[(int) t_kind
]--;
4594 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
4600 type_hash_add (hashcode
, type
);
4605 /* See if the data pointed to by the type hash table is marked. We consider
4606 it marked if the type is marked or if a debug type number or symbol
4607 table entry has been made for the type. This reduces the amount of
4608 debugging output and eliminates that dependency of the debug output on
4609 the number of garbage collections. */
4612 type_hash_marked_p (const void *p
)
4614 tree type
= ((struct type_hash
*) p
)->type
;
4616 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
4620 print_type_hash_statistics (void)
4622 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
4623 (long) htab_size (type_hash_table
),
4624 (long) htab_elements (type_hash_table
),
4625 htab_collisions (type_hash_table
));
4628 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4629 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4630 by adding the hash codes of the individual attributes. */
4633 attribute_hash_list (tree list
, hashval_t hashcode
)
4637 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4638 /* ??? Do we want to add in TREE_VALUE too? */
4639 hashcode
= iterative_hash_object
4640 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
4644 /* Given two lists of attributes, return true if list l2 is
4645 equivalent to l1. */
4648 attribute_list_equal (tree l1
, tree l2
)
4650 return attribute_list_contained (l1
, l2
)
4651 && attribute_list_contained (l2
, l1
);
4654 /* Given two lists of attributes, return true if list L2 is
4655 completely contained within L1. */
4656 /* ??? This would be faster if attribute names were stored in a canonicalized
4657 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4658 must be used to show these elements are equivalent (which they are). */
4659 /* ??? It's not clear that attributes with arguments will always be handled
4663 attribute_list_contained (tree l1
, tree l2
)
4667 /* First check the obvious, maybe the lists are identical. */
4671 /* Maybe the lists are similar. */
4672 for (t1
= l1
, t2
= l2
;
4674 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
4675 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
4676 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
4678 /* Maybe the lists are equal. */
4679 if (t1
== 0 && t2
== 0)
4682 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
4685 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
4687 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4690 if (TREE_VALUE (t2
) != NULL
4691 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
4692 && TREE_VALUE (attr
) != NULL
4693 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
4695 if (simple_cst_list_equal (TREE_VALUE (t2
),
4696 TREE_VALUE (attr
)) == 1)
4699 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
4710 /* Given two lists of types
4711 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4712 return 1 if the lists contain the same types in the same order.
4713 Also, the TREE_PURPOSEs must match. */
4716 type_list_equal (tree l1
, tree l2
)
4720 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
4721 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
4722 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
4723 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
4724 && (TREE_TYPE (TREE_PURPOSE (t1
))
4725 == TREE_TYPE (TREE_PURPOSE (t2
))))))
4731 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4732 given by TYPE. If the argument list accepts variable arguments,
4733 then this function counts only the ordinary arguments. */
4736 type_num_arguments (tree type
)
4741 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
4742 /* If the function does not take a variable number of arguments,
4743 the last element in the list will have type `void'. */
4744 if (VOID_TYPE_P (TREE_VALUE (t
)))
4752 /* Nonzero if integer constants T1 and T2
4753 represent the same constant value. */
4756 tree_int_cst_equal (tree t1
, tree t2
)
4761 if (t1
== 0 || t2
== 0)
4764 if (TREE_CODE (t1
) == INTEGER_CST
4765 && TREE_CODE (t2
) == INTEGER_CST
4766 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4767 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
4773 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4774 The precise way of comparison depends on their data type. */
4777 tree_int_cst_lt (tree t1
, tree t2
)
4782 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
4784 int t1_sgn
= tree_int_cst_sgn (t1
);
4785 int t2_sgn
= tree_int_cst_sgn (t2
);
4787 if (t1_sgn
< t2_sgn
)
4789 else if (t1_sgn
> t2_sgn
)
4791 /* Otherwise, both are non-negative, so we compare them as
4792 unsigned just in case one of them would overflow a signed
4795 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
4796 return INT_CST_LT (t1
, t2
);
4798 return INT_CST_LT_UNSIGNED (t1
, t2
);
4801 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4804 tree_int_cst_compare (tree t1
, tree t2
)
4806 if (tree_int_cst_lt (t1
, t2
))
4808 else if (tree_int_cst_lt (t2
, t1
))
4814 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4815 the host. If POS is zero, the value can be represented in a single
4816 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4817 be represented in a single unsigned HOST_WIDE_INT. */
4820 host_integerp (tree t
, int pos
)
4822 return (TREE_CODE (t
) == INTEGER_CST
4823 && ((TREE_INT_CST_HIGH (t
) == 0
4824 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
4825 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
4826 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
4827 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
4828 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
4831 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4832 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4833 be non-negative. We must be able to satisfy the above conditions. */
4836 tree_low_cst (tree t
, int pos
)
4838 gcc_assert (host_integerp (t
, pos
));
4839 return TREE_INT_CST_LOW (t
);
4842 /* Return the most significant bit of the integer constant T. */
4845 tree_int_cst_msb (tree t
)
4849 unsigned HOST_WIDE_INT l
;
4851 /* Note that using TYPE_PRECISION here is wrong. We care about the
4852 actual bits, not the (arbitrary) range of the type. */
4853 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
4854 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
4855 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
4856 return (l
& 1) == 1;
4859 /* Return an indication of the sign of the integer constant T.
4860 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4861 Note that -1 will never be returned if T's type is unsigned. */
4864 tree_int_cst_sgn (tree t
)
4866 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
4868 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
4870 else if (TREE_INT_CST_HIGH (t
) < 0)
4876 /* Compare two constructor-element-type constants. Return 1 if the lists
4877 are known to be equal; otherwise return 0. */
4880 simple_cst_list_equal (tree l1
, tree l2
)
4882 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4884 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4887 l1
= TREE_CHAIN (l1
);
4888 l2
= TREE_CHAIN (l2
);
4894 /* Return truthvalue of whether T1 is the same tree structure as T2.
4895 Return 1 if they are the same.
4896 Return 0 if they are understandably different.
4897 Return -1 if either contains tree structure not understood by
4901 simple_cst_equal (tree t1
, tree t2
)
4903 enum tree_code code1
, code2
;
4909 if (t1
== 0 || t2
== 0)
4912 code1
= TREE_CODE (t1
);
4913 code2
= TREE_CODE (t2
);
4915 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
4917 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4918 || code2
== NON_LVALUE_EXPR
)
4919 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4921 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
4924 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4925 || code2
== NON_LVALUE_EXPR
)
4926 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
4934 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4935 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
4938 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
4941 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
4942 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
4943 TREE_STRING_LENGTH (t1
)));
4947 unsigned HOST_WIDE_INT idx
;
4948 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
4949 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
4951 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
4954 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
4955 /* ??? Should we handle also fields here? */
4956 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
4957 VEC_index (constructor_elt
, v2
, idx
)->value
))
4963 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4966 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4970 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4973 /* Special case: if either target is an unallocated VAR_DECL,
4974 it means that it's going to be unified with whatever the
4975 TARGET_EXPR is really supposed to initialize, so treat it
4976 as being equivalent to anything. */
4977 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
4978 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
4979 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
4980 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
4981 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
4982 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
4985 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4990 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4992 case WITH_CLEANUP_EXPR
:
4993 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4997 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
5000 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
5001 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5015 /* This general rule works for most tree codes. All exceptions should be
5016 handled above. If this is a language-specific tree code, we can't
5017 trust what might be in the operand, so say we don't know
5019 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
5022 switch (TREE_CODE_CLASS (code1
))
5026 case tcc_comparison
:
5027 case tcc_expression
:
5031 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
5033 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
5045 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5046 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5047 than U, respectively. */
5050 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
5052 if (tree_int_cst_sgn (t
) < 0)
5054 else if (TREE_INT_CST_HIGH (t
) != 0)
5056 else if (TREE_INT_CST_LOW (t
) == u
)
5058 else if (TREE_INT_CST_LOW (t
) < u
)
5064 /* Return true if CODE represents an associative tree code. Otherwise
5067 associative_tree_code (enum tree_code code
)
5086 /* Return true if CODE represents a commutative tree code. Otherwise
5089 commutative_tree_code (enum tree_code code
)
5102 case UNORDERED_EXPR
:
5106 case TRUTH_AND_EXPR
:
5107 case TRUTH_XOR_EXPR
:
5117 /* Generate a hash value for an expression. This can be used iteratively
5118 by passing a previous result as the "val" argument.
5120 This function is intended to produce the same hash for expressions which
5121 would compare equal using operand_equal_p. */
5124 iterative_hash_expr (tree t
, hashval_t val
)
5127 enum tree_code code
;
5131 return iterative_hash_pointer (t
, val
);
5133 code
= TREE_CODE (t
);
5137 /* Alas, constants aren't shared, so we can't rely on pointer
5140 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
5141 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
5144 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
5146 return iterative_hash_hashval_t (val2
, val
);
5149 return iterative_hash (TREE_STRING_POINTER (t
),
5150 TREE_STRING_LENGTH (t
), val
);
5152 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
5153 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
5155 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
5159 /* we can just compare by pointer. */
5160 return iterative_hash_pointer (t
, val
);
5163 /* A list of expressions, for a CALL_EXPR or as the elements of a
5165 for (; t
; t
= TREE_CHAIN (t
))
5166 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
5170 unsigned HOST_WIDE_INT idx
;
5172 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
5174 val
= iterative_hash_expr (field
, val
);
5175 val
= iterative_hash_expr (value
, val
);
5180 /* When referring to a built-in FUNCTION_DECL, use the
5181 __builtin__ form. Otherwise nodes that compare equal
5182 according to operand_equal_p might get different
5184 if (DECL_BUILT_IN (t
))
5186 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
5190 /* else FALL THROUGH */
5192 class = TREE_CODE_CLASS (code
);
5194 if (class == tcc_declaration
)
5196 /* DECL's have a unique ID */
5197 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
5201 gcc_assert (IS_EXPR_CODE_CLASS (class));
5203 val
= iterative_hash_object (code
, val
);
5205 /* Don't hash the type, that can lead to having nodes which
5206 compare equal according to operand_equal_p, but which
5207 have different hash codes. */
5208 if (code
== NOP_EXPR
5209 || code
== CONVERT_EXPR
5210 || code
== NON_LVALUE_EXPR
)
5212 /* Make sure to include signness in the hash computation. */
5213 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
5214 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
5217 else if (commutative_tree_code (code
))
5219 /* It's a commutative expression. We want to hash it the same
5220 however it appears. We do this by first hashing both operands
5221 and then rehashing based on the order of their independent
5223 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
5224 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
5228 t
= one
, one
= two
, two
= t
;
5230 val
= iterative_hash_hashval_t (one
, val
);
5231 val
= iterative_hash_hashval_t (two
, val
);
5234 for (i
= TREE_CODE_LENGTH (code
) - 1; i
>= 0; --i
)
5235 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
5242 /* Constructors for pointer, array and function types.
5243 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5244 constructed by language-dependent code, not here.) */
5246 /* Construct, lay out and return the type of pointers to TO_TYPE with
5247 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5248 reference all of memory. If such a type has already been
5249 constructed, reuse it. */
5252 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
5257 if (to_type
== error_mark_node
)
5258 return error_mark_node
;
5260 /* In some cases, languages will have things that aren't a POINTER_TYPE
5261 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5262 In that case, return that type without regard to the rest of our
5265 ??? This is a kludge, but consistent with the way this function has
5266 always operated and there doesn't seem to be a good way to avoid this
5268 if (TYPE_POINTER_TO (to_type
) != 0
5269 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
5270 return TYPE_POINTER_TO (to_type
);
5272 /* First, if we already have a type for pointers to TO_TYPE and it's
5273 the proper mode, use it. */
5274 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
5275 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5278 t
= make_node (POINTER_TYPE
);
5280 TREE_TYPE (t
) = to_type
;
5281 TYPE_MODE (t
) = mode
;
5282 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5283 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
5284 TYPE_POINTER_TO (to_type
) = t
;
5286 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5287 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5288 else if (TYPE_CANONICAL (to_type
) != to_type
)
5290 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
5291 mode
, can_alias_all
);
5293 /* Lay out the type. This function has many callers that are concerned
5294 with expression-construction, and this simplifies them all. */
5300 /* By default build pointers in ptr_mode. */
5303 build_pointer_type (tree to_type
)
5305 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
5308 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5311 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
5316 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5317 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5318 In that case, return that type without regard to the rest of our
5321 ??? This is a kludge, but consistent with the way this function has
5322 always operated and there doesn't seem to be a good way to avoid this
5324 if (TYPE_REFERENCE_TO (to_type
) != 0
5325 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
5326 return TYPE_REFERENCE_TO (to_type
);
5328 /* First, if we already have a type for pointers to TO_TYPE and it's
5329 the proper mode, use it. */
5330 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
5331 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5334 t
= make_node (REFERENCE_TYPE
);
5336 TREE_TYPE (t
) = to_type
;
5337 TYPE_MODE (t
) = mode
;
5338 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5339 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
5340 TYPE_REFERENCE_TO (to_type
) = t
;
5342 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5343 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5344 else if (TYPE_CANONICAL (to_type
) != to_type
)
5346 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
5347 mode
, can_alias_all
);
5355 /* Build the node for the type of references-to-TO_TYPE by default
5359 build_reference_type (tree to_type
)
5361 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
5364 /* Build a type that is compatible with t but has no cv quals anywhere
5367 const char *const *const * -> char ***. */
5370 build_type_no_quals (tree t
)
5372 switch (TREE_CODE (t
))
5375 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5377 TYPE_REF_CAN_ALIAS_ALL (t
));
5378 case REFERENCE_TYPE
:
5380 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5382 TYPE_REF_CAN_ALIAS_ALL (t
));
5384 return TYPE_MAIN_VARIANT (t
);
5388 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5389 MAXVAL should be the maximum value in the domain
5390 (one less than the length of the array).
5392 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5393 We don't enforce this limit, that is up to caller (e.g. language front end).
5394 The limit exists because the result is a signed type and we don't handle
5395 sizes that use more than one HOST_WIDE_INT. */
5398 build_index_type (tree maxval
)
5400 tree itype
= make_node (INTEGER_TYPE
);
5402 TREE_TYPE (itype
) = sizetype
;
5403 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
5404 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5405 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
5406 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
5407 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
5408 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
5409 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
5410 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
5412 if (host_integerp (maxval
, 1))
5413 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
5416 /* Since we cannot hash this type, we need to compare it using
5417 structural equality checks. */
5418 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
5423 /* Builds a signed or unsigned integer type of precision PRECISION.
5424 Used for C bitfields whose precision does not match that of
5425 built-in target types. */
5427 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
5430 tree itype
= make_node (INTEGER_TYPE
);
5432 TYPE_PRECISION (itype
) = precision
;
5435 fixup_unsigned_type (itype
);
5437 fixup_signed_type (itype
);
5439 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
5440 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
5445 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5446 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5447 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5450 build_range_type (tree type
, tree lowval
, tree highval
)
5452 tree itype
= make_node (INTEGER_TYPE
);
5454 TREE_TYPE (itype
) = type
;
5455 if (type
== NULL_TREE
)
5458 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
5459 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
5461 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
5462 TYPE_MODE (itype
) = TYPE_MODE (type
);
5463 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
5464 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
5465 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
5466 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
5468 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
5469 return type_hash_canon (tree_low_cst (highval
, 0)
5470 - tree_low_cst (lowval
, 0),
5476 /* Just like build_index_type, but takes lowval and highval instead
5477 of just highval (maxval). */
5480 build_index_2_type (tree lowval
, tree highval
)
5482 return build_range_type (sizetype
, lowval
, highval
);
5485 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5486 and number of elements specified by the range of values of INDEX_TYPE.
5487 If such a type has already been constructed, reuse it. */
5490 build_array_type (tree elt_type
, tree index_type
)
5493 hashval_t hashcode
= 0;
5495 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
5497 error ("arrays of functions are not meaningful");
5498 elt_type
= integer_type_node
;
5501 t
= make_node (ARRAY_TYPE
);
5502 TREE_TYPE (t
) = elt_type
;
5503 TYPE_DOMAIN (t
) = index_type
;
5505 if (index_type
== 0)
5508 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5509 t
= type_hash_canon (hashcode
, t
);
5513 if (TYPE_CANONICAL (t
) == t
)
5515 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
))
5516 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5517 else if (TYPE_CANONICAL (elt_type
) != elt_type
)
5519 = build_array_type (TYPE_CANONICAL (elt_type
), index_type
);
5525 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5526 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
5527 t
= type_hash_canon (hashcode
, t
);
5529 if (!COMPLETE_TYPE_P (t
))
5532 if (TYPE_CANONICAL (t
) == t
)
5534 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
5535 || TYPE_STRUCTURAL_EQUALITY_P (index_type
))
5536 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5537 else if (TYPE_CANONICAL (elt_type
) != elt_type
5538 || TYPE_CANONICAL (index_type
) != index_type
)
5540 = build_array_type (TYPE_CANONICAL (elt_type
),
5541 TYPE_CANONICAL (index_type
));
5547 /* Return the TYPE of the elements comprising
5548 the innermost dimension of ARRAY. */
5551 get_inner_array_type (tree array
)
5553 tree type
= TREE_TYPE (array
);
5555 while (TREE_CODE (type
) == ARRAY_TYPE
)
5556 type
= TREE_TYPE (type
);
5561 /* Construct, lay out and return
5562 the type of functions returning type VALUE_TYPE
5563 given arguments of types ARG_TYPES.
5564 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5565 are data type nodes for the arguments of the function.
5566 If such a type has already been constructed, reuse it. */
5569 build_function_type (tree value_type
, tree arg_types
)
5572 hashval_t hashcode
= 0;
5574 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
5576 error ("function return type cannot be function");
5577 value_type
= integer_type_node
;
5580 /* Make a node of the sort we want. */
5581 t
= make_node (FUNCTION_TYPE
);
5582 TREE_TYPE (t
) = value_type
;
5583 TYPE_ARG_TYPES (t
) = arg_types
;
5585 /* We don't have canonicalization of function types, yet. */
5586 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5588 /* If we already have such a type, use the old one. */
5589 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
5590 hashcode
= type_hash_list (arg_types
, hashcode
);
5591 t
= type_hash_canon (hashcode
, t
);
5593 if (!COMPLETE_TYPE_P (t
))
5598 /* Build a function type. The RETURN_TYPE is the type returned by the
5599 function. If additional arguments are provided, they are
5600 additional argument types. The list of argument types must always
5601 be terminated by NULL_TREE. */
5604 build_function_type_list (tree return_type
, ...)
5609 va_start (p
, return_type
);
5611 t
= va_arg (p
, tree
);
5612 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
5613 args
= tree_cons (NULL_TREE
, t
, args
);
5615 if (args
== NULL_TREE
)
5616 args
= void_list_node
;
5620 args
= nreverse (args
);
5621 TREE_CHAIN (last
) = void_list_node
;
5623 args
= build_function_type (return_type
, args
);
5629 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5630 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5631 for the method. An implicit additional parameter (of type
5632 pointer-to-BASETYPE) is added to the ARGTYPES. */
5635 build_method_type_directly (tree basetype
,
5643 /* Make a node of the sort we want. */
5644 t
= make_node (METHOD_TYPE
);
5646 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5647 TREE_TYPE (t
) = rettype
;
5648 ptype
= build_pointer_type (basetype
);
5650 /* The actual arglist for this function includes a "hidden" argument
5651 which is "this". Put it into the list of argument types. */
5652 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
5653 TYPE_ARG_TYPES (t
) = argtypes
;
5655 /* We don't have canonicalization of method types yet. */
5656 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5658 /* If we already have such a type, use the old one. */
5659 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5660 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
5661 hashcode
= type_hash_list (argtypes
, hashcode
);
5662 t
= type_hash_canon (hashcode
, t
);
5664 if (!COMPLETE_TYPE_P (t
))
5670 /* Construct, lay out and return the type of methods belonging to class
5671 BASETYPE and whose arguments and values are described by TYPE.
5672 If that type exists already, reuse it.
5673 TYPE must be a FUNCTION_TYPE node. */
5676 build_method_type (tree basetype
, tree type
)
5678 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
5680 return build_method_type_directly (basetype
,
5682 TYPE_ARG_TYPES (type
));
5685 /* Construct, lay out and return the type of offsets to a value
5686 of type TYPE, within an object of type BASETYPE.
5687 If a suitable offset type exists already, reuse it. */
5690 build_offset_type (tree basetype
, tree type
)
5693 hashval_t hashcode
= 0;
5695 /* Make a node of the sort we want. */
5696 t
= make_node (OFFSET_TYPE
);
5698 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5699 TREE_TYPE (t
) = type
;
5701 /* If we already have such a type, use the old one. */
5702 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5703 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
5704 t
= type_hash_canon (hashcode
, t
);
5706 if (!COMPLETE_TYPE_P (t
))
5709 if (TYPE_CANONICAL (t
) == t
)
5711 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
5712 || TYPE_STRUCTURAL_EQUALITY_P (type
))
5713 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5714 else if (TYPE_CANONICAL (basetype
) != basetype
5715 || TYPE_CANONICAL (type
) != type
)
5717 = build_offset_type (TYPE_CANONICAL (basetype
),
5718 TYPE_CANONICAL (type
));
5724 /* Create a complex type whose components are COMPONENT_TYPE. */
5727 build_complex_type (tree component_type
)
5732 /* Make a node of the sort we want. */
5733 t
= make_node (COMPLEX_TYPE
);
5735 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
5737 /* If we already have such a type, use the old one. */
5738 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
5739 t
= type_hash_canon (hashcode
, t
);
5741 if (!COMPLETE_TYPE_P (t
))
5744 if (TYPE_CANONICAL (t
) == t
)
5746 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
5747 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5748 else if (TYPE_CANONICAL (component_type
) != component_type
)
5750 = build_complex_type (TYPE_CANONICAL (component_type
));
5753 /* If we are writing Dwarf2 output we need to create a name,
5754 since complex is a fundamental type. */
5755 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
5759 if (component_type
== char_type_node
)
5760 name
= "complex char";
5761 else if (component_type
== signed_char_type_node
)
5762 name
= "complex signed char";
5763 else if (component_type
== unsigned_char_type_node
)
5764 name
= "complex unsigned char";
5765 else if (component_type
== short_integer_type_node
)
5766 name
= "complex short int";
5767 else if (component_type
== short_unsigned_type_node
)
5768 name
= "complex short unsigned int";
5769 else if (component_type
== integer_type_node
)
5770 name
= "complex int";
5771 else if (component_type
== unsigned_type_node
)
5772 name
= "complex unsigned int";
5773 else if (component_type
== long_integer_type_node
)
5774 name
= "complex long int";
5775 else if (component_type
== long_unsigned_type_node
)
5776 name
= "complex long unsigned int";
5777 else if (component_type
== long_long_integer_type_node
)
5778 name
= "complex long long int";
5779 else if (component_type
== long_long_unsigned_type_node
)
5780 name
= "complex long long unsigned int";
5785 TYPE_NAME (t
) = get_identifier (name
);
5788 return build_qualified_type (t
, TYPE_QUALS (component_type
));
5791 /* Return OP, stripped of any conversions to wider types as much as is safe.
5792 Converting the value back to OP's type makes a value equivalent to OP.
5794 If FOR_TYPE is nonzero, we return a value which, if converted to
5795 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
5797 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
5798 narrowest type that can hold the value, even if they don't exactly fit.
5799 Otherwise, bit-field references are changed to a narrower type
5800 only if they can be fetched directly from memory in that type.
5802 OP must have integer, real or enumeral type. Pointers are not allowed!
5804 There are some cases where the obvious value we could return
5805 would regenerate to OP if converted to OP's type,
5806 but would not extend like OP to wider types.
5807 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
5808 For example, if OP is (unsigned short)(signed char)-1,
5809 we avoid returning (signed char)-1 if FOR_TYPE is int,
5810 even though extending that to an unsigned short would regenerate OP,
5811 since the result of extending (signed char)-1 to (int)
5812 is different from (int) OP. */
5815 get_unwidened (tree op
, tree for_type
)
5817 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
5818 tree type
= TREE_TYPE (op
);
5820 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
5822 = (for_type
!= 0 && for_type
!= type
5823 && final_prec
> TYPE_PRECISION (type
)
5824 && TYPE_UNSIGNED (type
));
5827 while (TREE_CODE (op
) == NOP_EXPR
5828 || TREE_CODE (op
) == CONVERT_EXPR
)
5832 /* TYPE_PRECISION on vector types has different meaning
5833 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
5834 so avoid them here. */
5835 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
5838 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
5839 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
5841 /* Truncations are many-one so cannot be removed.
5842 Unless we are later going to truncate down even farther. */
5844 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
5847 /* See what's inside this conversion. If we decide to strip it,
5849 op
= TREE_OPERAND (op
, 0);
5851 /* If we have not stripped any zero-extensions (uns is 0),
5852 we can strip any kind of extension.
5853 If we have previously stripped a zero-extension,
5854 only zero-extensions can safely be stripped.
5855 Any extension can be stripped if the bits it would produce
5856 are all going to be discarded later by truncating to FOR_TYPE. */
5860 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
5862 /* TYPE_UNSIGNED says whether this is a zero-extension.
5863 Let's avoid computing it if it does not affect WIN
5864 and if UNS will not be needed again. */
5866 || TREE_CODE (op
) == NOP_EXPR
5867 || TREE_CODE (op
) == CONVERT_EXPR
)
5868 && TYPE_UNSIGNED (TREE_TYPE (op
)))
5876 if (TREE_CODE (op
) == COMPONENT_REF
5877 /* Since type_for_size always gives an integer type. */
5878 && TREE_CODE (type
) != REAL_TYPE
5879 /* Don't crash if field not laid out yet. */
5880 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
5881 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
5883 unsigned int innerprec
5884 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
5885 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
5886 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
5887 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
5889 /* We can get this structure field in the narrowest type it fits in.
5890 If FOR_TYPE is 0, do this only for a field that matches the
5891 narrower type exactly and is aligned for it
5892 The resulting extension to its nominal type (a fullword type)
5893 must fit the same conditions as for other extensions. */
5896 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
5897 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
5898 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
5900 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
5901 TREE_OPERAND (op
, 1), NULL_TREE
);
5902 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
5903 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
5910 /* Return OP or a simpler expression for a narrower value
5911 which can be sign-extended or zero-extended to give back OP.
5912 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
5913 or 0 if the value should be sign-extended. */
5916 get_narrower (tree op
, int *unsignedp_ptr
)
5921 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
5923 while (TREE_CODE (op
) == NOP_EXPR
)
5926 = (TYPE_PRECISION (TREE_TYPE (op
))
5927 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
5929 /* Truncations are many-one so cannot be removed. */
5933 /* See what's inside this conversion. If we decide to strip it,
5938 op
= TREE_OPERAND (op
, 0);
5939 /* An extension: the outermost one can be stripped,
5940 but remember whether it is zero or sign extension. */
5942 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5943 /* Otherwise, if a sign extension has been stripped,
5944 only sign extensions can now be stripped;
5945 if a zero extension has been stripped, only zero-extensions. */
5946 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
5950 else /* bitschange == 0 */
5952 /* A change in nominal type can always be stripped, but we must
5953 preserve the unsignedness. */
5955 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5957 op
= TREE_OPERAND (op
, 0);
5958 /* Keep trying to narrow, but don't assign op to win if it
5959 would turn an integral type into something else. */
5960 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
5967 if (TREE_CODE (op
) == COMPONENT_REF
5968 /* Since type_for_size always gives an integer type. */
5969 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
5970 /* Ensure field is laid out already. */
5971 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
5972 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
5974 unsigned HOST_WIDE_INT innerprec
5975 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
5976 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
5977 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
5978 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
5980 /* We can get this structure field in a narrower type that fits it,
5981 but the resulting extension to its nominal type (a fullword type)
5982 must satisfy the same conditions as for other extensions.
5984 Do this only for fields that are aligned (not bit-fields),
5985 because when bit-field insns will be used there is no
5986 advantage in doing this. */
5988 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
5989 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
5990 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
5994 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
5995 win
= fold_convert (type
, op
);
5999 *unsignedp_ptr
= uns
;
6003 /* Nonzero if integer constant C has a value that is permissible
6004 for type TYPE (an INTEGER_TYPE). */
6007 int_fits_type_p (tree c
, tree type
)
6009 tree type_low_bound
= TYPE_MIN_VALUE (type
);
6010 tree type_high_bound
= TYPE_MAX_VALUE (type
);
6011 bool ok_for_low_bound
, ok_for_high_bound
;
6014 /* If at least one bound of the type is a constant integer, we can check
6015 ourselves and maybe make a decision. If no such decision is possible, but
6016 this type is a subtype, try checking against that. Otherwise, use
6017 force_fit_type, which checks against the precision.
6019 Compute the status for each possibly constant bound, and return if we see
6020 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6021 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6022 for "constant known to fit". */
6024 /* Check if C >= type_low_bound. */
6025 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
6027 if (tree_int_cst_lt (c
, type_low_bound
))
6029 ok_for_low_bound
= true;
6032 ok_for_low_bound
= false;
6034 /* Check if c <= type_high_bound. */
6035 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
6037 if (tree_int_cst_lt (type_high_bound
, c
))
6039 ok_for_high_bound
= true;
6042 ok_for_high_bound
= false;
6044 /* If the constant fits both bounds, the result is known. */
6045 if (ok_for_low_bound
&& ok_for_high_bound
)
6048 /* Perform some generic filtering which may allow making a decision
6049 even if the bounds are not constant. First, negative integers
6050 never fit in unsigned types, */
6051 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
6054 /* Second, narrower types always fit in wider ones. */
6055 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
6058 /* Third, unsigned integers with top bit set never fit signed types. */
6059 if (! TYPE_UNSIGNED (type
)
6060 && TYPE_UNSIGNED (TREE_TYPE (c
))
6061 && tree_int_cst_msb (c
))
6064 /* If we haven't been able to decide at this point, there nothing more we
6065 can check ourselves here. Look at the base type if we have one and it
6066 has the same precision. */
6067 if (TREE_CODE (type
) == INTEGER_TYPE
6068 && TREE_TYPE (type
) != 0
6069 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
6070 return int_fits_type_p (c
, TREE_TYPE (type
));
6072 /* Or to force_fit_type, if nothing else. */
6073 tmp
= copy_node (c
);
6074 TREE_TYPE (tmp
) = type
;
6075 tmp
= force_fit_type (tmp
, -1, false, false);
6076 return TREE_INT_CST_HIGH (tmp
) == TREE_INT_CST_HIGH (c
)
6077 && TREE_INT_CST_LOW (tmp
) == TREE_INT_CST_LOW (c
);
6080 /* Subprogram of following function. Called by walk_tree.
6082 Return *TP if it is an automatic variable or parameter of the
6083 function passed in as DATA. */
6086 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
6088 tree fn
= (tree
) data
;
6093 else if (DECL_P (*tp
)
6094 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
6100 /* Returns true if T is, contains, or refers to a type with variable
6101 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6102 arguments, but not the return type. If FN is nonzero, only return
6103 true if a modifier of the type or position of FN is a variable or
6104 parameter inside FN.
6106 This concept is more general than that of C99 'variably modified types':
6107 in C99, a struct type is never variably modified because a VLA may not
6108 appear as a structure member. However, in GNU C code like:
6110 struct S { int i[f()]; };
6112 is valid, and other languages may define similar constructs. */
6115 variably_modified_type_p (tree type
, tree fn
)
6119 /* Test if T is either variable (if FN is zero) or an expression containing
6120 a variable in FN. */
6121 #define RETURN_TRUE_IF_VAR(T) \
6122 do { tree _t = (T); \
6123 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6124 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6125 return true; } while (0)
6127 if (type
== error_mark_node
)
6130 /* If TYPE itself has variable size, it is variably modified. */
6131 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
6132 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
6134 switch (TREE_CODE (type
))
6137 case REFERENCE_TYPE
:
6139 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6145 /* If TYPE is a function type, it is variably modified if the
6146 return type is variably modified. */
6147 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6155 /* Scalar types are variably modified if their end points
6157 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
6158 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
6163 case QUAL_UNION_TYPE
:
6164 /* We can't see if any of the fields are variably-modified by the
6165 definition we normally use, since that would produce infinite
6166 recursion via pointers. */
6167 /* This is variably modified if some field's type is. */
6168 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
6169 if (TREE_CODE (t
) == FIELD_DECL
)
6171 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
6172 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
6173 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
6175 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
6176 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
6181 /* Do not call ourselves to avoid infinite recursion. This is
6182 variably modified if the element type is. */
6183 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
6184 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
6191 /* The current language may have other cases to check, but in general,
6192 all other types are not variably modified. */
6193 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
6195 #undef RETURN_TRUE_IF_VAR
6198 /* Given a DECL or TYPE, return the scope in which it was declared, or
6199 NULL_TREE if there is no containing scope. */
6202 get_containing_scope (tree t
)
6204 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
6207 /* Return the innermost context enclosing DECL that is
6208 a FUNCTION_DECL, or zero if none. */
6211 decl_function_context (tree decl
)
6215 if (TREE_CODE (decl
) == ERROR_MARK
)
6218 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6219 where we look up the function at runtime. Such functions always take
6220 a first argument of type 'pointer to real context'.
6222 C++ should really be fixed to use DECL_CONTEXT for the real context,
6223 and use something else for the "virtual context". */
6224 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
6227 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
6229 context
= DECL_CONTEXT (decl
);
6231 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
6233 if (TREE_CODE (context
) == BLOCK
)
6234 context
= BLOCK_SUPERCONTEXT (context
);
6236 context
= get_containing_scope (context
);
6242 /* Return the innermost context enclosing DECL that is
6243 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6244 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6247 decl_type_context (tree decl
)
6249 tree context
= DECL_CONTEXT (decl
);
6252 switch (TREE_CODE (context
))
6254 case NAMESPACE_DECL
:
6255 case TRANSLATION_UNIT_DECL
:
6260 case QUAL_UNION_TYPE
:
6265 context
= DECL_CONTEXT (context
);
6269 context
= BLOCK_SUPERCONTEXT (context
);
6279 /* CALL is a CALL_EXPR. Return the declaration for the function
6280 called, or NULL_TREE if the called function cannot be
6284 get_callee_fndecl (tree call
)
6288 if (call
== error_mark_node
)
6291 /* It's invalid to call this function with anything but a
6293 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
6295 /* The first operand to the CALL is the address of the function
6297 addr
= TREE_OPERAND (call
, 0);
6301 /* If this is a readonly function pointer, extract its initial value. */
6302 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
6303 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
6304 && DECL_INITIAL (addr
))
6305 addr
= DECL_INITIAL (addr
);
6307 /* If the address is just `&f' for some function `f', then we know
6308 that `f' is being called. */
6309 if (TREE_CODE (addr
) == ADDR_EXPR
6310 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
6311 return TREE_OPERAND (addr
, 0);
6313 /* We couldn't figure out what was being called. Maybe the front
6314 end has some idea. */
6315 return lang_hooks
.lang_get_callee_fndecl (call
);
6318 /* Print debugging information about tree nodes generated during the compile,
6319 and any language-specific information. */
6322 dump_tree_statistics (void)
6324 #ifdef GATHER_STATISTICS
6326 int total_nodes
, total_bytes
;
6329 fprintf (stderr
, "\n??? tree nodes created\n\n");
6330 #ifdef GATHER_STATISTICS
6331 fprintf (stderr
, "Kind Nodes Bytes\n");
6332 fprintf (stderr
, "---------------------------------------\n");
6333 total_nodes
= total_bytes
= 0;
6334 for (i
= 0; i
< (int) all_kinds
; i
++)
6336 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
6337 tree_node_counts
[i
], tree_node_sizes
[i
]);
6338 total_nodes
+= tree_node_counts
[i
];
6339 total_bytes
+= tree_node_sizes
[i
];
6341 fprintf (stderr
, "---------------------------------------\n");
6342 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
6343 fprintf (stderr
, "---------------------------------------\n");
6344 ssanames_print_statistics ();
6345 phinodes_print_statistics ();
6347 fprintf (stderr
, "(No per-node statistics)\n");
6349 print_type_hash_statistics ();
6350 print_debug_expr_statistics ();
6351 print_value_expr_statistics ();
6352 print_restrict_base_statistics ();
6353 lang_hooks
.print_statistics ();
6356 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6358 /* Generate a crc32 of a string. */
6361 crc32_string (unsigned chksum
, const char *string
)
6365 unsigned value
= *string
<< 24;
6368 for (ix
= 8; ix
--; value
<<= 1)
6372 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
6381 /* P is a string that will be used in a symbol. Mask out any characters
6382 that are not valid in that context. */
6385 clean_symbol_name (char *p
)
6389 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6392 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6399 /* Generate a name for a special-purpose function function.
6400 The generated name may need to be unique across the whole link.
6401 TYPE is some string to identify the purpose of this function to the
6402 linker or collect2; it must start with an uppercase letter,
6404 I - for constructors
6406 N - for C++ anonymous namespaces
6407 F - for DWARF unwind frame information. */
6410 get_file_function_name (const char *type
)
6416 /* If we already have a name we know to be unique, just use that. */
6417 if (first_global_object_name
)
6418 p
= first_global_object_name
;
6419 /* If the target is handling the constructors/destructors, they
6420 will be local to this file and the name is only necessary for
6421 debugging purposes. */
6422 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
6424 const char *file
= main_input_filename
;
6426 file
= input_filename
;
6427 /* Just use the file's basename, because the full pathname
6428 might be quite long. */
6429 p
= strrchr (file
, '/');
6434 p
= q
= ASTRDUP (p
);
6435 clean_symbol_name (q
);
6439 /* Otherwise, the name must be unique across the entire link.
6440 We don't have anything that we know to be unique to this translation
6441 unit, so use what we do have and throw in some randomness. */
6443 const char *name
= weak_global_object_name
;
6444 const char *file
= main_input_filename
;
6449 file
= input_filename
;
6451 len
= strlen (file
);
6452 q
= alloca (9 * 2 + len
+ 1);
6453 memcpy (q
, file
, len
+ 1);
6454 clean_symbol_name (q
);
6456 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
6457 crc32_string (0, flag_random_seed
));
6462 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
6464 /* Set up the name of the file-level functions we may need.
6465 Use a global object (which is already required to be unique over
6466 the program) rather than the file name (which imposes extra
6468 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
6470 return get_identifier (buf
);
6473 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6475 /* Complain that the tree code of NODE does not match the expected 0
6476 terminated list of trailing codes. The trailing code list can be
6477 empty, for a more vague error message. FILE, LINE, and FUNCTION
6478 are of the caller. */
6481 tree_check_failed (const tree node
, const char *file
,
6482 int line
, const char *function
, ...)
6486 unsigned length
= 0;
6489 va_start (args
, function
);
6490 while ((code
= va_arg (args
, int)))
6491 length
+= 4 + strlen (tree_code_name
[code
]);
6495 va_start (args
, function
);
6496 length
+= strlen ("expected ");
6497 buffer
= alloca (length
);
6499 while ((code
= va_arg (args
, int)))
6501 const char *prefix
= length
? " or " : "expected ";
6503 strcpy (buffer
+ length
, prefix
);
6504 length
+= strlen (prefix
);
6505 strcpy (buffer
+ length
, tree_code_name
[code
]);
6506 length
+= strlen (tree_code_name
[code
]);
6511 buffer
= (char *)"unexpected node";
6513 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6514 buffer
, tree_code_name
[TREE_CODE (node
)],
6515 function
, trim_filename (file
), line
);
6518 /* Complain that the tree code of NODE does match the expected 0
6519 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6523 tree_not_check_failed (const tree node
, const char *file
,
6524 int line
, const char *function
, ...)
6528 unsigned length
= 0;
6531 va_start (args
, function
);
6532 while ((code
= va_arg (args
, int)))
6533 length
+= 4 + strlen (tree_code_name
[code
]);
6535 va_start (args
, function
);
6536 buffer
= alloca (length
);
6538 while ((code
= va_arg (args
, int)))
6542 strcpy (buffer
+ length
, " or ");
6545 strcpy (buffer
+ length
, tree_code_name
[code
]);
6546 length
+= strlen (tree_code_name
[code
]);
6550 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6551 buffer
, tree_code_name
[TREE_CODE (node
)],
6552 function
, trim_filename (file
), line
);
6555 /* Similar to tree_check_failed, except that we check for a class of tree
6556 code, given in CL. */
6559 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
6560 const char *file
, int line
, const char *function
)
6563 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6564 TREE_CODE_CLASS_STRING (cl
),
6565 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6566 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6569 /* Similar to tree_check_failed, except that instead of specifying a
6570 dozen codes, use the knowledge that they're all sequential. */
6573 tree_range_check_failed (const tree node
, const char *file
, int line
,
6574 const char *function
, enum tree_code c1
,
6578 unsigned length
= 0;
6581 for (c
= c1
; c
<= c2
; ++c
)
6582 length
+= 4 + strlen (tree_code_name
[c
]);
6584 length
+= strlen ("expected ");
6585 buffer
= alloca (length
);
6588 for (c
= c1
; c
<= c2
; ++c
)
6590 const char *prefix
= length
? " or " : "expected ";
6592 strcpy (buffer
+ length
, prefix
);
6593 length
+= strlen (prefix
);
6594 strcpy (buffer
+ length
, tree_code_name
[c
]);
6595 length
+= strlen (tree_code_name
[c
]);
6598 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6599 buffer
, tree_code_name
[TREE_CODE (node
)],
6600 function
, trim_filename (file
), line
);
6604 /* Similar to tree_check_failed, except that we check that a tree does
6605 not have the specified code, given in CL. */
6608 tree_not_class_check_failed (const tree node
, const enum tree_code_class cl
,
6609 const char *file
, int line
, const char *function
)
6612 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6613 TREE_CODE_CLASS_STRING (cl
),
6614 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6615 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6619 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6622 omp_clause_check_failed (const tree node
, const char *file
, int line
,
6623 const char *function
, enum omp_clause_code code
)
6625 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6626 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
6627 function
, trim_filename (file
), line
);
6631 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6634 omp_clause_range_check_failed (const tree node
, const char *file
, int line
,
6635 const char *function
, enum omp_clause_code c1
,
6636 enum omp_clause_code c2
)
6639 unsigned length
= 0;
6640 enum omp_clause_code c
;
6642 for (c
= c1
; c
<= c2
; ++c
)
6643 length
+= 4 + strlen (omp_clause_code_name
[c
]);
6645 length
+= strlen ("expected ");
6646 buffer
= alloca (length
);
6649 for (c
= c1
; c
<= c2
; ++c
)
6651 const char *prefix
= length
? " or " : "expected ";
6653 strcpy (buffer
+ length
, prefix
);
6654 length
+= strlen (prefix
);
6655 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
6656 length
+= strlen (omp_clause_code_name
[c
]);
6659 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6660 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
6661 function
, trim_filename (file
), line
);
6665 #undef DEFTREESTRUCT
6666 #define DEFTREESTRUCT(VAL, NAME) NAME,
6668 static const char *ts_enum_names
[] = {
6669 #include "treestruct.def"
6671 #undef DEFTREESTRUCT
6673 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6675 /* Similar to tree_class_check_failed, except that we check for
6676 whether CODE contains the tree structure identified by EN. */
6679 tree_contains_struct_check_failed (const tree node
,
6680 const enum tree_node_structure_enum en
,
6681 const char *file
, int line
,
6682 const char *function
)
6685 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6687 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6691 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6692 (dynamically sized) vector. */
6695 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6696 const char *function
)
6699 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6700 idx
+ 1, len
, function
, trim_filename (file
), line
);
6703 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6704 (dynamically sized) vector. */
6707 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6708 const char *function
)
6711 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6712 idx
+ 1, len
, function
, trim_filename (file
), line
);
6715 /* Similar to above, except that the check is for the bounds of the operand
6716 vector of an expression node. */
6719 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
6720 int line
, const char *function
)
6723 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6724 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
6725 function
, trim_filename (file
), line
);
6728 /* Similar to above, except that the check is for the number of
6729 operands of an OMP_CLAUSE node. */
6732 omp_clause_operand_check_failed (int idx
, tree t
, const char *file
,
6733 int line
, const char *function
)
6736 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6737 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
6738 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
6739 trim_filename (file
), line
);
6741 #endif /* ENABLE_TREE_CHECKING */
6743 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6744 and mapped to the machine mode MODE. Initialize its fields and build
6745 the information necessary for debugging output. */
6748 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
6751 hashval_t hashcode
= 0;
6753 /* Build a main variant, based on the main variant of the inner type, then
6754 use it to build the variant we return. */
6755 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
6756 && TYPE_MAIN_VARIANT (innertype
) != innertype
)
6757 return build_type_attribute_qual_variant (
6758 make_vector_type (TYPE_MAIN_VARIANT (innertype
), nunits
, mode
),
6759 TYPE_ATTRIBUTES (innertype
),
6760 TYPE_QUALS (innertype
));
6762 t
= make_node (VECTOR_TYPE
);
6763 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
6764 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
6765 TYPE_MODE (t
) = mode
;
6766 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
6767 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
6769 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
6770 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6771 else if (TYPE_CANONICAL (innertype
) != innertype
6772 || mode
!= VOIDmode
)
6774 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
6779 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
6780 tree array
= build_array_type (innertype
, build_index_type (index
));
6781 tree rt
= make_node (RECORD_TYPE
);
6783 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
6784 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
6786 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
6787 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
6788 the representation type, and we want to find that die when looking up
6789 the vector type. This is most easily achieved by making the TYPE_UID
6791 TYPE_UID (rt
) = TYPE_UID (t
);
6794 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
6795 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
6796 hashcode
= iterative_hash_object (TYPE_HASH (innertype
), hashcode
);
6797 return type_hash_canon (hashcode
, t
);
6801 make_or_reuse_type (unsigned size
, int unsignedp
)
6803 if (size
== INT_TYPE_SIZE
)
6804 return unsignedp
? unsigned_type_node
: integer_type_node
;
6805 if (size
== CHAR_TYPE_SIZE
)
6806 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
6807 if (size
== SHORT_TYPE_SIZE
)
6808 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
6809 if (size
== LONG_TYPE_SIZE
)
6810 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
6811 if (size
== LONG_LONG_TYPE_SIZE
)
6812 return (unsignedp
? long_long_unsigned_type_node
6813 : long_long_integer_type_node
);
6816 return make_unsigned_type (size
);
6818 return make_signed_type (size
);
6821 /* Create nodes for all integer types (and error_mark_node) using the sizes
6822 of C datatypes. The caller should call set_sizetype soon after calling
6823 this function to select one of the types as sizetype. */
6826 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
6828 error_mark_node
= make_node (ERROR_MARK
);
6829 TREE_TYPE (error_mark_node
) = error_mark_node
;
6831 initialize_sizetypes (signed_sizetype
);
6833 /* Define both `signed char' and `unsigned char'. */
6834 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6835 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
6836 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6837 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
6839 /* Define `char', which is like either `signed char' or `unsigned char'
6840 but not the same as either. */
6843 ? make_signed_type (CHAR_TYPE_SIZE
)
6844 : make_unsigned_type (CHAR_TYPE_SIZE
));
6845 TYPE_STRING_FLAG (char_type_node
) = 1;
6847 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6848 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6849 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6850 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6851 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6852 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6853 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6854 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6856 /* Define a boolean type. This type only represents boolean values but
6857 may be larger than char depending on the value of BOOL_TYPE_SIZE.
6858 Front ends which want to override this size (i.e. Java) can redefine
6859 boolean_type_node before calling build_common_tree_nodes_2. */
6860 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6861 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6862 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
6863 TYPE_PRECISION (boolean_type_node
) = 1;
6865 /* Fill in the rest of the sized types. Reuse existing type nodes
6867 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
6868 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
6869 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
6870 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
6871 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
6873 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
6874 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
6875 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
6876 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
6877 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
6879 access_public_node
= get_identifier ("public");
6880 access_protected_node
= get_identifier ("protected");
6881 access_private_node
= get_identifier ("private");
6884 /* Call this function after calling build_common_tree_nodes and set_sizetype.
6885 It will create several other common tree nodes. */
6888 build_common_tree_nodes_2 (int short_double
)
6890 /* Define these next since types below may used them. */
6891 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
6892 integer_one_node
= build_int_cst (NULL_TREE
, 1);
6893 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
6895 size_zero_node
= size_int (0);
6896 size_one_node
= size_int (1);
6897 bitsize_zero_node
= bitsize_int (0);
6898 bitsize_one_node
= bitsize_int (1);
6899 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
6901 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
6902 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
6904 void_type_node
= make_node (VOID_TYPE
);
6905 layout_type (void_type_node
);
6907 /* We are not going to have real types in C with less than byte alignment,
6908 so we might as well not have any types that claim to have it. */
6909 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
6910 TYPE_USER_ALIGN (void_type_node
) = 0;
6912 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
6913 layout_type (TREE_TYPE (null_pointer_node
));
6915 ptr_type_node
= build_pointer_type (void_type_node
);
6917 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
6918 fileptr_type_node
= ptr_type_node
;
6920 float_type_node
= make_node (REAL_TYPE
);
6921 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6922 layout_type (float_type_node
);
6924 double_type_node
= make_node (REAL_TYPE
);
6926 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6928 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6929 layout_type (double_type_node
);
6931 long_double_type_node
= make_node (REAL_TYPE
);
6932 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6933 layout_type (long_double_type_node
);
6935 float_ptr_type_node
= build_pointer_type (float_type_node
);
6936 double_ptr_type_node
= build_pointer_type (double_type_node
);
6937 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
6938 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
6940 /* Fixed size integer types. */
6941 uint32_type_node
= build_nonstandard_integer_type (32, true);
6942 uint64_type_node
= build_nonstandard_integer_type (64, true);
6944 /* Decimal float types. */
6945 dfloat32_type_node
= make_node (REAL_TYPE
);
6946 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
6947 layout_type (dfloat32_type_node
);
6948 TYPE_MODE (dfloat32_type_node
) = SDmode
;
6949 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
6951 dfloat64_type_node
= make_node (REAL_TYPE
);
6952 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
6953 layout_type (dfloat64_type_node
);
6954 TYPE_MODE (dfloat64_type_node
) = DDmode
;
6955 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
6957 dfloat128_type_node
= make_node (REAL_TYPE
);
6958 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
6959 layout_type (dfloat128_type_node
);
6960 TYPE_MODE (dfloat128_type_node
) = TDmode
;
6961 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
6963 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6964 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6965 layout_type (complex_integer_type_node
);
6967 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6968 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6969 layout_type (complex_float_type_node
);
6971 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6972 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6973 layout_type (complex_double_type_node
);
6975 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6976 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6977 layout_type (complex_long_double_type_node
);
6980 tree t
= targetm
.build_builtin_va_list ();
6982 /* Many back-ends define record types without setting TYPE_NAME.
6983 If we copied the record type here, we'd keep the original
6984 record type without a name. This breaks name mangling. So,
6985 don't copy record types and let c_common_nodes_and_builtins()
6986 declare the type to be __builtin_va_list. */
6987 if (TREE_CODE (t
) != RECORD_TYPE
)
6988 t
= build_variant_type_copy (t
);
6990 va_list_type_node
= t
;
6994 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
6997 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
6998 const char *library_name
, int ecf_flags
)
7002 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
7003 library_name
, NULL_TREE
);
7004 if (ecf_flags
& ECF_CONST
)
7005 TREE_READONLY (decl
) = 1;
7006 if (ecf_flags
& ECF_PURE
)
7007 DECL_IS_PURE (decl
) = 1;
7008 if (ecf_flags
& ECF_NORETURN
)
7009 TREE_THIS_VOLATILE (decl
) = 1;
7010 if (ecf_flags
& ECF_NOTHROW
)
7011 TREE_NOTHROW (decl
) = 1;
7012 if (ecf_flags
& ECF_MALLOC
)
7013 DECL_IS_MALLOC (decl
) = 1;
7015 built_in_decls
[code
] = decl
;
7016 implicit_built_in_decls
[code
] = decl
;
7019 /* Call this function after instantiating all builtins that the language
7020 front end cares about. This will build the rest of the builtins that
7021 are relied upon by the tree optimizers and the middle-end. */
7024 build_common_builtin_nodes (void)
7028 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
7029 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7031 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7032 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7033 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7034 ftype
= build_function_type (ptr_type_node
, tmp
);
7036 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
7037 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
7038 "memcpy", ECF_NOTHROW
);
7039 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7040 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
7041 "memmove", ECF_NOTHROW
);
7044 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
7046 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7047 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7048 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7049 ftype
= build_function_type (integer_type_node
, tmp
);
7050 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
7051 "memcmp", ECF_PURE
| ECF_NOTHROW
);
7054 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
7056 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7057 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
7058 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7059 ftype
= build_function_type (ptr_type_node
, tmp
);
7060 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
7061 "memset", ECF_NOTHROW
);
7064 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
7066 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7067 ftype
= build_function_type (ptr_type_node
, tmp
);
7068 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
7069 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
7072 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7073 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7074 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7075 ftype
= build_function_type (void_type_node
, tmp
);
7076 local_define_builtin ("__builtin_init_trampoline", ftype
,
7077 BUILT_IN_INIT_TRAMPOLINE
,
7078 "__builtin_init_trampoline", ECF_NOTHROW
);
7080 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7081 ftype
= build_function_type (ptr_type_node
, tmp
);
7082 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
7083 BUILT_IN_ADJUST_TRAMPOLINE
,
7084 "__builtin_adjust_trampoline",
7085 ECF_CONST
| ECF_NOTHROW
);
7087 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7088 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7089 ftype
= build_function_type (void_type_node
, tmp
);
7090 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
7091 BUILT_IN_NONLOCAL_GOTO
,
7092 "__builtin_nonlocal_goto",
7093 ECF_NORETURN
| ECF_NOTHROW
);
7095 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7096 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7097 ftype
= build_function_type (void_type_node
, tmp
);
7098 local_define_builtin ("__builtin_setjmp_setup", ftype
,
7099 BUILT_IN_SETJMP_SETUP
,
7100 "__builtin_setjmp_setup", ECF_NOTHROW
);
7102 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7103 ftype
= build_function_type (ptr_type_node
, tmp
);
7104 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
7105 BUILT_IN_SETJMP_DISPATCHER
,
7106 "__builtin_setjmp_dispatcher",
7107 ECF_PURE
| ECF_NOTHROW
);
7109 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7110 ftype
= build_function_type (void_type_node
, tmp
);
7111 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
7112 BUILT_IN_SETJMP_RECEIVER
,
7113 "__builtin_setjmp_receiver", ECF_NOTHROW
);
7115 ftype
= build_function_type (ptr_type_node
, void_list_node
);
7116 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
7117 "__builtin_stack_save", ECF_NOTHROW
);
7119 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7120 ftype
= build_function_type (void_type_node
, tmp
);
7121 local_define_builtin ("__builtin_stack_restore", ftype
,
7122 BUILT_IN_STACK_RESTORE
,
7123 "__builtin_stack_restore", ECF_NOTHROW
);
7125 ftype
= build_function_type (void_type_node
, void_list_node
);
7126 local_define_builtin ("__builtin_profile_func_enter", ftype
,
7127 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
7128 local_define_builtin ("__builtin_profile_func_exit", ftype
,
7129 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
7131 /* Complex multiplication and division. These are handled as builtins
7132 rather than optabs because emit_library_call_value doesn't support
7133 complex. Further, we can do slightly better with folding these
7134 beasties if the real and complex parts of the arguments are separate. */
7136 enum machine_mode mode
;
7138 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
7140 char mode_name_buf
[4], *q
;
7142 enum built_in_function mcode
, dcode
;
7143 tree type
, inner_type
;
7145 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
7148 inner_type
= TREE_TYPE (type
);
7150 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
7151 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7152 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7153 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7154 ftype
= build_function_type (type
, tmp
);
7156 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7157 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7159 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
7163 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
7164 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
7165 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
7167 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
7168 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
7169 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
7174 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7177 If we requested a pointer to a vector, build up the pointers that
7178 we stripped off while looking for the inner type. Similarly for
7179 return values from functions.
7181 The argument TYPE is the top of the chain, and BOTTOM is the
7182 new type which we will point to. */
7185 reconstruct_complex_type (tree type
, tree bottom
)
7189 if (POINTER_TYPE_P (type
))
7191 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7192 outer
= build_pointer_type (inner
);
7194 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7196 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7197 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
7199 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
7201 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7202 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
7204 else if (TREE_CODE (type
) == METHOD_TYPE
)
7207 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7208 /* The build_method_type_directly() routine prepends 'this' to argument list,
7209 so we must compensate by getting rid of it. */
7210 argtypes
= TYPE_ARG_TYPES (type
);
7211 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
7213 TYPE_ARG_TYPES (type
));
7214 TYPE_ARG_TYPES (outer
) = argtypes
;
7219 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
7220 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
7225 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7228 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
7232 switch (GET_MODE_CLASS (mode
))
7234 case MODE_VECTOR_INT
:
7235 case MODE_VECTOR_FLOAT
:
7236 nunits
= GET_MODE_NUNITS (mode
);
7240 /* Check that there are no leftover bits. */
7241 gcc_assert (GET_MODE_BITSIZE (mode
)
7242 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
7244 nunits
= GET_MODE_BITSIZE (mode
)
7245 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
7252 return make_vector_type (innertype
, nunits
, mode
);
7255 /* Similarly, but takes the inner type and number of units, which must be
7259 build_vector_type (tree innertype
, int nunits
)
7261 return make_vector_type (innertype
, nunits
, VOIDmode
);
7265 /* Build RESX_EXPR with given REGION_NUMBER. */
7267 build_resx (int region_number
)
7270 t
= build1 (RESX_EXPR
, void_type_node
,
7271 build_int_cst (NULL_TREE
, region_number
));
7275 /* Given an initializer INIT, return TRUE if INIT is zero or some
7276 aggregate of zeros. Otherwise return FALSE. */
7278 initializer_zerop (tree init
)
7284 switch (TREE_CODE (init
))
7287 return integer_zerop (init
);
7290 /* ??? Note that this is not correct for C4X float formats. There,
7291 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7292 negative exponent. */
7293 return real_zerop (init
)
7294 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
7297 return integer_zerop (init
)
7298 || (real_zerop (init
)
7299 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
7300 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
7303 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
7304 if (!initializer_zerop (TREE_VALUE (elt
)))
7310 unsigned HOST_WIDE_INT idx
;
7312 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
7313 if (!initializer_zerop (elt
))
7323 /* Build an empty statement. */
7326 build_empty_stmt (void)
7328 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
7332 /* Build an OpenMP clause with code CODE. */
7335 build_omp_clause (enum omp_clause_code code
)
7340 length
= omp_clause_num_ops
[code
];
7341 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
7343 t
= ggc_alloc (size
);
7344 memset (t
, 0, size
);
7345 TREE_SET_CODE (t
, OMP_CLAUSE
);
7346 OMP_CLAUSE_SET_CODE (t
, code
);
7348 #ifdef GATHER_STATISTICS
7349 tree_node_counts
[(int) omp_clause_kind
]++;
7350 tree_node_sizes
[(int) omp_clause_kind
] += size
;
7357 /* Returns true if it is possible to prove that the index of
7358 an array access REF (an ARRAY_REF expression) falls into the
7362 in_array_bounds_p (tree ref
)
7364 tree idx
= TREE_OPERAND (ref
, 1);
7367 if (TREE_CODE (idx
) != INTEGER_CST
)
7370 min
= array_ref_low_bound (ref
);
7371 max
= array_ref_up_bound (ref
);
7374 || TREE_CODE (min
) != INTEGER_CST
7375 || TREE_CODE (max
) != INTEGER_CST
)
7378 if (tree_int_cst_lt (idx
, min
)
7379 || tree_int_cst_lt (max
, idx
))
7385 /* Returns true if it is possible to prove that the range of
7386 an array access REF (an ARRAY_RANGE_REF expression) falls
7387 into the array bounds. */
7390 range_in_array_bounds_p (tree ref
)
7392 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
7393 tree range_min
, range_max
, min
, max
;
7395 range_min
= TYPE_MIN_VALUE (domain_type
);
7396 range_max
= TYPE_MAX_VALUE (domain_type
);
7399 || TREE_CODE (range_min
) != INTEGER_CST
7400 || TREE_CODE (range_max
) != INTEGER_CST
)
7403 min
= array_ref_low_bound (ref
);
7404 max
= array_ref_up_bound (ref
);
7407 || TREE_CODE (min
) != INTEGER_CST
7408 || TREE_CODE (max
) != INTEGER_CST
)
7411 if (tree_int_cst_lt (range_min
, min
)
7412 || tree_int_cst_lt (max
, range_max
))
7418 /* Return true if T (assumed to be a DECL) is a global variable. */
7421 is_global_var (tree t
)
7424 return (TREE_STATIC (t
) || MTAG_GLOBAL (t
));
7426 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
7429 /* Return true if T (assumed to be a DECL) must be assigned a memory
7433 needs_to_live_in_memory (tree t
)
7435 if (TREE_CODE (t
) == SSA_NAME
)
7436 t
= SSA_NAME_VAR (t
);
7438 return (TREE_ADDRESSABLE (t
)
7439 || is_global_var (t
)
7440 || (TREE_CODE (t
) == RESULT_DECL
7441 && aggregate_value_p (t
, current_function_decl
)));
7444 /* There are situations in which a language considers record types
7445 compatible which have different field lists. Decide if two fields
7446 are compatible. It is assumed that the parent records are compatible. */
7449 fields_compatible_p (tree f1
, tree f2
)
7451 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
7452 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
7455 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
7456 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
7459 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
7465 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7468 find_compatible_field (tree record
, tree orig_field
)
7472 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
7473 if (TREE_CODE (f
) == FIELD_DECL
7474 && fields_compatible_p (f
, orig_field
))
7477 /* ??? Why isn't this on the main fields list? */
7478 f
= TYPE_VFIELD (record
);
7479 if (f
&& TREE_CODE (f
) == FIELD_DECL
7480 && fields_compatible_p (f
, orig_field
))
7483 /* ??? We should abort here, but Java appears to do Bad Things
7484 with inherited fields. */
7488 /* Return value of a constant X. */
7491 int_cst_value (tree x
)
7493 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
7494 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
7495 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
7497 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
7500 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
7502 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
7507 /* Returns the greatest common divisor of A and B, which must be
7511 tree_fold_gcd (tree a
, tree b
)
7514 tree type
= TREE_TYPE (a
);
7516 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
7517 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
7519 if (integer_zerop (a
))
7522 if (integer_zerop (b
))
7525 if (tree_int_cst_sgn (a
) == -1)
7526 a
= fold_build2 (MULT_EXPR
, type
, a
,
7527 build_int_cst (type
, -1));
7529 if (tree_int_cst_sgn (b
) == -1)
7530 b
= fold_build2 (MULT_EXPR
, type
, b
,
7531 build_int_cst (type
, -1));
7535 a_mod_b
= fold_build2 (FLOOR_MOD_EXPR
, type
, a
, b
);
7537 if (!TREE_INT_CST_LOW (a_mod_b
)
7538 && !TREE_INT_CST_HIGH (a_mod_b
))
7546 /* Returns unsigned variant of TYPE. */
7549 unsigned_type_for (tree type
)
7551 if (POINTER_TYPE_P (type
))
7552 return lang_hooks
.types
.unsigned_type (size_type_node
);
7553 return lang_hooks
.types
.unsigned_type (type
);
7556 /* Returns signed variant of TYPE. */
7559 signed_type_for (tree type
)
7561 if (POINTER_TYPE_P (type
))
7562 return lang_hooks
.types
.signed_type (size_type_node
);
7563 return lang_hooks
.types
.signed_type (type
);
7566 /* Returns the largest value obtainable by casting something in INNER type to
7570 upper_bound_in_type (tree outer
, tree inner
)
7572 unsigned HOST_WIDE_INT lo
, hi
;
7573 unsigned int det
= 0;
7574 unsigned oprec
= TYPE_PRECISION (outer
);
7575 unsigned iprec
= TYPE_PRECISION (inner
);
7578 /* Compute a unique number for every combination. */
7579 det
|= (oprec
> iprec
) ? 4 : 0;
7580 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
7581 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
7583 /* Determine the exponent to use. */
7588 /* oprec <= iprec, outer: signed, inner: don't care. */
7593 /* oprec <= iprec, outer: unsigned, inner: don't care. */
7597 /* oprec > iprec, outer: signed, inner: signed. */
7601 /* oprec > iprec, outer: signed, inner: unsigned. */
7605 /* oprec > iprec, outer: unsigned, inner: signed. */
7609 /* oprec > iprec, outer: unsigned, inner: unsigned. */
7616 /* Compute 2^^prec - 1. */
7617 if (prec
<= HOST_BITS_PER_WIDE_INT
)
7620 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
7621 >> (HOST_BITS_PER_WIDE_INT
- prec
));
7625 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
7626 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
7627 lo
= ~(unsigned HOST_WIDE_INT
) 0;
7630 return build_int_cst_wide (outer
, lo
, hi
);
7633 /* Returns the smallest value obtainable by casting something in INNER type to
7637 lower_bound_in_type (tree outer
, tree inner
)
7639 unsigned HOST_WIDE_INT lo
, hi
;
7640 unsigned oprec
= TYPE_PRECISION (outer
);
7641 unsigned iprec
= TYPE_PRECISION (inner
);
7643 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
7645 if (TYPE_UNSIGNED (outer
)
7646 /* If we are widening something of an unsigned type, OUTER type
7647 contains all values of INNER type. In particular, both INNER
7648 and OUTER types have zero in common. */
7649 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
7653 /* If we are widening a signed type to another signed type, we
7654 want to obtain -2^^(iprec-1). If we are keeping the
7655 precision or narrowing to a signed type, we want to obtain
7657 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
7659 if (prec
<= HOST_BITS_PER_WIDE_INT
)
7661 hi
= ~(unsigned HOST_WIDE_INT
) 0;
7662 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
7666 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
7667 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
7672 return build_int_cst_wide (outer
, lo
, hi
);
7675 /* Return nonzero if two operands that are suitable for PHI nodes are
7676 necessarily equal. Specifically, both ARG0 and ARG1 must be either
7677 SSA_NAME or invariant. Note that this is strictly an optimization.
7678 That is, callers of this function can directly call operand_equal_p
7679 and get the same result, only slower. */
7682 operand_equal_for_phi_arg_p (tree arg0
, tree arg1
)
7686 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
7688 return operand_equal_p (arg0
, arg1
, 0);
7691 /* Returns number of zeros at the end of binary representation of X.
7693 ??? Use ffs if available? */
7696 num_ending_zeros (tree x
)
7698 unsigned HOST_WIDE_INT fr
, nfr
;
7699 unsigned num
, abits
;
7700 tree type
= TREE_TYPE (x
);
7702 if (TREE_INT_CST_LOW (x
) == 0)
7704 num
= HOST_BITS_PER_WIDE_INT
;
7705 fr
= TREE_INT_CST_HIGH (x
);
7710 fr
= TREE_INT_CST_LOW (x
);
7713 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
7716 if (nfr
<< abits
== fr
)
7723 if (num
> TYPE_PRECISION (type
))
7724 num
= TYPE_PRECISION (type
);
7726 return build_int_cst_type (type
, num
);
7730 #define WALK_SUBTREE(NODE) \
7733 result = walk_tree (&(NODE), func, data, pset); \
7739 /* This is a subroutine of walk_tree that walks field of TYPE that are to
7740 be walked whenever a type is seen in the tree. Rest of operands and return
7741 value are as for walk_tree. */
7744 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
7745 struct pointer_set_t
*pset
)
7747 tree result
= NULL_TREE
;
7749 switch (TREE_CODE (type
))
7752 case REFERENCE_TYPE
:
7753 /* We have to worry about mutually recursive pointers. These can't
7754 be written in C. They can in Ada. It's pathological, but
7755 there's an ACATS test (c38102a) that checks it. Deal with this
7756 by checking if we're pointing to another pointer, that one
7757 points to another pointer, that one does too, and we have no htab.
7758 If so, get a hash table. We check three levels deep to avoid
7759 the cost of the hash table if we don't need one. */
7760 if (POINTER_TYPE_P (TREE_TYPE (type
))
7761 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
7762 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
7765 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
7773 /* ... fall through ... */
7776 WALK_SUBTREE (TREE_TYPE (type
));
7780 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
7785 WALK_SUBTREE (TREE_TYPE (type
));
7789 /* We never want to walk into default arguments. */
7790 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
7791 WALK_SUBTREE (TREE_VALUE (arg
));
7796 /* Don't follow this nodes's type if a pointer for fear that we'll
7797 have infinite recursion. Those types are uninteresting anyway. */
7798 if (!POINTER_TYPE_P (TREE_TYPE (type
))
7799 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
7800 WALK_SUBTREE (TREE_TYPE (type
));
7801 WALK_SUBTREE (TYPE_DOMAIN (type
));
7805 WALK_SUBTREE (TREE_TYPE (type
));
7806 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
7816 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
7817 called with the DATA and the address of each sub-tree. If FUNC returns a
7818 non-NULL value, the traversal is stopped, and the value returned by FUNC
7819 is returned. If PSET is non-NULL it is used to record the nodes visited,
7820 and to avoid visiting a node more than once. */
7823 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
7825 enum tree_code code
;
7829 #define WALK_SUBTREE_TAIL(NODE) \
7833 goto tail_recurse; \
7838 /* Skip empty subtrees. */
7842 /* Don't walk the same tree twice, if the user has requested
7843 that we avoid doing so. */
7844 if (pset
&& pointer_set_insert (pset
, *tp
))
7847 /* Call the function. */
7849 result
= (*func
) (tp
, &walk_subtrees
, data
);
7851 /* If we found something, return it. */
7855 code
= TREE_CODE (*tp
);
7857 /* Even if we didn't, FUNC may have decided that there was nothing
7858 interesting below this point in the tree. */
7861 /* But we still need to check our siblings. */
7862 if (code
== TREE_LIST
)
7863 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
7864 else if (code
== OMP_CLAUSE
)
7865 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7870 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
7872 if (result
|| !walk_subtrees
)
7878 case IDENTIFIER_NODE
:
7884 case PLACEHOLDER_EXPR
:
7888 /* None of these have subtrees other than those already walked
7893 WALK_SUBTREE (TREE_VALUE (*tp
));
7894 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
7899 int len
= TREE_VEC_LENGTH (*tp
);
7904 /* Walk all elements but the first. */
7906 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
7908 /* Now walk the first one as a tail call. */
7909 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
7913 WALK_SUBTREE (TREE_REALPART (*tp
));
7914 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
7918 unsigned HOST_WIDE_INT idx
;
7919 constructor_elt
*ce
;
7922 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
7924 WALK_SUBTREE (ce
->value
);
7929 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
7934 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
7936 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
7937 into declarations that are just mentioned, rather than
7938 declared; they don't really belong to this part of the tree.
7939 And, we can see cycles: the initializer for a declaration
7940 can refer to the declaration itself. */
7941 WALK_SUBTREE (DECL_INITIAL (decl
));
7942 WALK_SUBTREE (DECL_SIZE (decl
));
7943 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
7945 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
7948 case STATEMENT_LIST
:
7950 tree_stmt_iterator i
;
7951 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
7952 WALK_SUBTREE (*tsi_stmt_ptr (i
));
7957 switch (OMP_CLAUSE_CODE (*tp
))
7959 case OMP_CLAUSE_PRIVATE
:
7960 case OMP_CLAUSE_SHARED
:
7961 case OMP_CLAUSE_FIRSTPRIVATE
:
7962 case OMP_CLAUSE_LASTPRIVATE
:
7963 case OMP_CLAUSE_COPYIN
:
7964 case OMP_CLAUSE_COPYPRIVATE
:
7966 case OMP_CLAUSE_NUM_THREADS
:
7967 case OMP_CLAUSE_SCHEDULE
:
7968 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
7971 case OMP_CLAUSE_NOWAIT
:
7972 case OMP_CLAUSE_ORDERED
:
7973 case OMP_CLAUSE_DEFAULT
:
7974 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7976 case OMP_CLAUSE_REDUCTION
:
7979 for (i
= 0; i
< 4; i
++)
7980 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
7981 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
7993 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
7994 But, we only want to walk once. */
7995 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
7996 for (i
= 0; i
< len
; ++i
)
7997 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
7998 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
8002 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8003 defining. We only want to walk into these fields of a type in this
8004 case and not in the general case of a mere reference to the type.
8006 The criterion is as follows: if the field can be an expression, it
8007 must be walked only here. This should be in keeping with the fields
8008 that are directly gimplified in gimplify_type_sizes in order for the
8009 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8010 variable-sized types.
8012 Note that DECLs get walked as part of processing the BIND_EXPR. */
8013 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
8015 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
8016 if (TREE_CODE (*type_p
) == ERROR_MARK
)
8019 /* Call the function for the type. See if it returns anything or
8020 doesn't want us to continue. If we are to continue, walk both
8021 the normal fields and those for the declaration case. */
8022 result
= (*func
) (type_p
, &walk_subtrees
, data
);
8023 if (result
|| !walk_subtrees
)
8026 result
= walk_type_fields (*type_p
, func
, data
, pset
);
8030 /* If this is a record type, also walk the fields. */
8031 if (TREE_CODE (*type_p
) == RECORD_TYPE
8032 || TREE_CODE (*type_p
) == UNION_TYPE
8033 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8037 for (field
= TYPE_FIELDS (*type_p
); field
;
8038 field
= TREE_CHAIN (field
))
8040 /* We'd like to look at the type of the field, but we can
8041 easily get infinite recursion. So assume it's pointed
8042 to elsewhere in the tree. Also, ignore things that
8044 if (TREE_CODE (field
) != FIELD_DECL
)
8047 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
8048 WALK_SUBTREE (DECL_SIZE (field
));
8049 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
8050 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8051 WALK_SUBTREE (DECL_QUALIFIER (field
));
8055 /* Same for scalar types. */
8056 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
8057 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
8058 || TREE_CODE (*type_p
) == INTEGER_TYPE
8059 || TREE_CODE (*type_p
) == REAL_TYPE
)
8061 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
8062 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
8065 WALK_SUBTREE (TYPE_SIZE (*type_p
));
8066 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
8071 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
8072 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code
)))
8076 /* Walk over all the sub-trees of this operand. */
8077 len
= TREE_CODE_LENGTH (code
);
8079 /* Go through the subtrees. We need to do this in forward order so
8080 that the scope of a FOR_EXPR is handled properly. */
8083 for (i
= 0; i
< len
- 1; ++i
)
8084 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp
, i
));
8085 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp
, len
- 1));
8088 /* If this is a type, walk the needed fields in the type. */
8089 else if (TYPE_P (*tp
))
8090 return walk_type_fields (*tp
, func
, data
, pset
);
8094 /* We didn't find what we were looking for. */
8097 #undef WALK_SUBTREE_TAIL
8101 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8104 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
8107 struct pointer_set_t
*pset
;
8109 pset
= pointer_set_create ();
8110 result
= walk_tree (tp
, func
, data
, pset
);
8111 pointer_set_destroy (pset
);
8116 /* Return true if STMT is an empty statement or contains nothing but
8117 empty statements. */
8120 empty_body_p (tree stmt
)
8122 tree_stmt_iterator i
;
8125 if (IS_EMPTY_STMT (stmt
))
8127 else if (TREE_CODE (stmt
) == BIND_EXPR
)
8128 body
= BIND_EXPR_BODY (stmt
);
8129 else if (TREE_CODE (stmt
) == STATEMENT_LIST
)
8134 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
8135 if (!empty_body_p (tsi_stmt (i
)))
8144 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
8146 if (IS_EXPR_CODE_CLASS (c
))
8147 return &t
->exp
.block
;
8148 else if (IS_GIMPLE_STMT_CODE_CLASS (c
))
8149 return &GIMPLE_STMT_BLOCK (t
);
8155 generic_tree_operand (tree node
, int i
)
8157 if (GIMPLE_STMT_P (node
))
8158 return &GIMPLE_STMT_OPERAND (node
, i
);
8159 return &TREE_OPERAND (node
, i
);
8163 generic_tree_type (tree node
)
8165 if (GIMPLE_STMT_P (node
))
8166 return &void_type_node
;
8167 return &TREE_TYPE (node
);
8170 #include "gt-tree.h"
projects / gcc.git / blob