1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "fixed-value.h"
55 /* 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
[] =
74 /* obstack.[ch] explicitly declined to prototype this. */
75 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
77 #ifdef GATHER_STATISTICS
78 /* Statistics-gathering stuff. */
80 int tree_node_counts
[(int) all_kinds
];
81 int tree_node_sizes
[(int) all_kinds
];
83 /* Keep in sync with tree.h:enum tree_node_kind. */
84 static const char * const tree_node_kind_names
[] = {
106 #endif /* GATHER_STATISTICS */
108 /* Unique id for next decl created. */
109 static GTY(()) int next_decl_uid
;
110 /* Unique id for next type created. */
111 static GTY(()) int next_type_uid
= 1;
113 /* Since we cannot rehash a type after it is in the table, we have to
114 keep the hash code. */
116 struct type_hash
GTY(())
122 /* Initial size of the hash table (rounded to next prime). */
123 #define TYPE_HASH_INITIAL_SIZE 1000
125 /* Now here is the hash table. When recording a type, it is added to
126 the slot whose index is the hash code. Note that the hash table is
127 used for several kinds of types (function types, array types and
128 array index range types, for now). While all these live in the
129 same table, they are completely independent, and the hash code is
130 computed differently for each of these. */
132 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
133 htab_t type_hash_table
;
135 /* Hash table and temporary node for larger integer const values. */
136 static GTY (()) tree int_cst_node
;
137 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
138 htab_t int_cst_hash_table
;
140 /* General tree->tree mapping structure for use in hash tables. */
143 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
144 htab_t debug_expr_for_decl
;
146 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
147 htab_t value_expr_for_decl
;
149 static GTY ((if_marked ("tree_priority_map_marked_p"),
150 param_is (struct tree_priority_map
)))
151 htab_t init_priority_for_decl
;
153 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map
)))
154 htab_t restrict_base_for_decl
;
156 static void set_type_quals (tree
, int);
157 static int type_hash_eq (const void *, const void *);
158 static hashval_t
type_hash_hash (const void *);
159 static hashval_t
int_cst_hash_hash (const void *);
160 static int int_cst_hash_eq (const void *, const void *);
161 static void print_type_hash_statistics (void);
162 static void print_debug_expr_statistics (void);
163 static void print_value_expr_statistics (void);
164 static int type_hash_marked_p (const void *);
165 static unsigned int type_hash_list (const_tree
, hashval_t
);
166 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
168 tree global_trees
[TI_MAX
];
169 tree integer_types
[itk_none
];
171 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
173 /* Number of operands for each OpenMP clause. */
174 unsigned const char omp_clause_num_ops
[] =
176 0, /* OMP_CLAUSE_ERROR */
177 1, /* OMP_CLAUSE_PRIVATE */
178 1, /* OMP_CLAUSE_SHARED */
179 1, /* OMP_CLAUSE_FIRSTPRIVATE */
180 1, /* OMP_CLAUSE_LASTPRIVATE */
181 4, /* OMP_CLAUSE_REDUCTION */
182 1, /* OMP_CLAUSE_COPYIN */
183 1, /* OMP_CLAUSE_COPYPRIVATE */
184 1, /* OMP_CLAUSE_IF */
185 1, /* OMP_CLAUSE_NUM_THREADS */
186 1, /* OMP_CLAUSE_SCHEDULE */
187 0, /* OMP_CLAUSE_NOWAIT */
188 0, /* OMP_CLAUSE_ORDERED */
189 0 /* OMP_CLAUSE_DEFAULT */
192 const char * const omp_clause_code_name
[] =
215 /* Initialize the hash table of types. */
216 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
219 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
222 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
224 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
225 tree_priority_map_eq
, 0);
226 restrict_base_for_decl
= htab_create_ggc (256, tree_map_hash
,
229 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
230 int_cst_hash_eq
, NULL
);
232 int_cst_node
= make_node (INTEGER_CST
);
234 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
] = 1;
235 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_NON_COMMON
] = 1;
236 tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
] = 1;
239 tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
] = 1;
240 tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
] = 1;
241 tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
] = 1;
242 tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
] = 1;
243 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
] = 1;
244 tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
] = 1;
245 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
] = 1;
246 tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
] = 1;
247 tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
] = 1;
250 tree_contains_struct
[CONST_DECL
][TS_DECL_WRTL
] = 1;
251 tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
] = 1;
252 tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
] = 1;
253 tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
] = 1;
254 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
] = 1;
255 tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
] = 1;
257 tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
] = 1;
258 tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
] = 1;
259 tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
] = 1;
260 tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
] = 1;
261 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
] = 1;
262 tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
] = 1;
263 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
] = 1;
264 tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
] = 1;
265 tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
] = 1;
266 tree_contains_struct
[NAME_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
267 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_DECL_MINIMAL
] = 1;
268 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_DECL_MINIMAL
] = 1;
270 tree_contains_struct
[NAME_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
271 tree_contains_struct
[SYMBOL_MEMORY_TAG
][TS_MEMORY_TAG
] = 1;
272 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_MEMORY_TAG
] = 1;
274 tree_contains_struct
[MEMORY_PARTITION_TAG
][TS_MEMORY_PARTITION_TAG
] = 1;
276 tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
] = 1;
277 tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
] = 1;
278 tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
] = 1;
279 tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_WITH_VIS
] = 1;
281 tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
] = 1;
282 tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
] = 1;
283 tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
] = 1;
284 tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
] = 1;
285 tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
] = 1;
286 tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
] = 1;
287 tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
] = 1;
288 tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
] = 1;
290 lang_hooks
.init_ts ();
294 /* The name of the object as the assembler will see it (but before any
295 translations made by ASM_OUTPUT_LABELREF). Often this is the same
296 as DECL_NAME. It is an IDENTIFIER_NODE. */
298 decl_assembler_name (tree decl
)
300 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
301 lang_hooks
.set_decl_assembler_name (decl
);
302 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
305 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
308 decl_assembler_name_equal (tree decl
, tree asmname
)
310 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
312 if (decl_asmname
== asmname
)
315 /* If the target assembler name was set by the user, things are trickier.
316 We have a leading '*' to begin with. After that, it's arguable what
317 is the correct thing to do with -fleading-underscore. Arguably, we've
318 historically been doing the wrong thing in assemble_alias by always
319 printing the leading underscore. Since we're not changing that, make
320 sure user_label_prefix follows the '*' before matching. */
321 if (IDENTIFIER_POINTER (decl_asmname
)[0] == '*')
323 const char *decl_str
= IDENTIFIER_POINTER (decl_asmname
) + 1;
324 size_t ulp_len
= strlen (user_label_prefix
);
328 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
333 return strcmp (decl_str
, IDENTIFIER_POINTER (asmname
)) == 0;
339 /* Compute the number of bytes occupied by a tree with code CODE.
340 This function cannot be used for nodes that have variable sizes,
341 including TREE_VEC, PHI_NODE, STRING_CST, and CALL_EXPR. */
343 tree_code_size (enum tree_code code
)
345 switch (TREE_CODE_CLASS (code
))
347 case tcc_declaration
: /* A decl node */
352 return sizeof (struct tree_field_decl
);
354 return sizeof (struct tree_parm_decl
);
356 return sizeof (struct tree_var_decl
);
358 return sizeof (struct tree_label_decl
);
360 return sizeof (struct tree_result_decl
);
362 return sizeof (struct tree_const_decl
);
364 return sizeof (struct tree_type_decl
);
366 return sizeof (struct tree_function_decl
);
367 case NAME_MEMORY_TAG
:
368 case SYMBOL_MEMORY_TAG
:
369 return sizeof (struct tree_memory_tag
);
370 case MEMORY_PARTITION_TAG
:
371 return sizeof (struct tree_memory_partition_tag
);
373 return sizeof (struct tree_decl_non_common
);
377 case tcc_type
: /* a type node */
378 return sizeof (struct tree_type
);
380 case tcc_reference
: /* a reference */
381 case tcc_expression
: /* an expression */
382 case tcc_statement
: /* an expression with side effects */
383 case tcc_comparison
: /* a comparison expression */
384 case tcc_unary
: /* a unary arithmetic expression */
385 case tcc_binary
: /* a binary arithmetic expression */
386 return (sizeof (struct tree_exp
)
387 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
389 case tcc_gimple_stmt
:
390 return (sizeof (struct gimple_stmt
)
391 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
393 case tcc_constant
: /* a constant */
396 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
397 case REAL_CST
: return sizeof (struct tree_real_cst
);
398 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
399 case COMPLEX_CST
: return sizeof (struct tree_complex
);
400 case VECTOR_CST
: return sizeof (struct tree_vector
);
401 case STRING_CST
: gcc_unreachable ();
403 return lang_hooks
.tree_size (code
);
406 case tcc_exceptional
: /* something random, like an identifier. */
409 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
410 case TREE_LIST
: return sizeof (struct tree_list
);
413 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
417 case PHI_NODE
: gcc_unreachable ();
419 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
421 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
422 case BLOCK
: return sizeof (struct tree_block
);
423 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
424 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
427 return lang_hooks
.tree_size (code
);
435 /* Compute the number of bytes occupied by NODE. This routine only
436 looks at TREE_CODE, except for those nodes that have variable sizes. */
438 tree_size (const_tree node
)
440 const enum tree_code code
= TREE_CODE (node
);
444 return (sizeof (struct tree_phi_node
)
445 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
448 return (offsetof (struct tree_binfo
, base_binfos
)
449 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
452 return (sizeof (struct tree_vec
)
453 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
456 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
459 return (sizeof (struct tree_omp_clause
)
460 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
464 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
465 return (sizeof (struct tree_exp
)
466 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
468 return tree_code_size (code
);
472 /* Return a newly allocated node of code CODE. For decl and type
473 nodes, some other fields are initialized. The rest of the node is
474 initialized to zero. This function cannot be used for PHI_NODE,
475 TREE_VEC or OMP_CLAUSE nodes, which is enforced by asserts in
478 Achoo! I got a code in the node. */
481 make_node_stat (enum tree_code code MEM_STAT_DECL
)
484 enum tree_code_class type
= TREE_CODE_CLASS (code
);
485 size_t length
= tree_code_size (code
);
486 #ifdef GATHER_STATISTICS
491 case tcc_declaration
: /* A decl node */
495 case tcc_type
: /* a type node */
499 case tcc_statement
: /* an expression with side effects */
503 case tcc_reference
: /* a reference */
507 case tcc_expression
: /* an expression */
508 case tcc_comparison
: /* a comparison expression */
509 case tcc_unary
: /* a unary arithmetic expression */
510 case tcc_binary
: /* a binary arithmetic expression */
514 case tcc_constant
: /* a constant */
518 case tcc_gimple_stmt
:
519 kind
= gimple_stmt_kind
;
522 case tcc_exceptional
: /* something random, like an identifier. */
525 case IDENTIFIER_NODE
:
542 kind
= ssa_name_kind
;
563 tree_node_counts
[(int) kind
]++;
564 tree_node_sizes
[(int) kind
] += length
;
567 if (code
== IDENTIFIER_NODE
)
568 t
= ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
570 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
572 memset (t
, 0, length
);
574 TREE_SET_CODE (t
, code
);
579 TREE_SIDE_EFFECTS (t
) = 1;
582 case tcc_declaration
:
583 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_WITH_VIS
))
584 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
585 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
587 if (code
== FUNCTION_DECL
)
589 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
590 DECL_MODE (t
) = FUNCTION_MODE
;
594 /* We have not yet computed the alias set for this declaration. */
595 DECL_POINTER_ALIAS_SET (t
) = -1;
597 DECL_SOURCE_LOCATION (t
) = input_location
;
598 DECL_UID (t
) = next_decl_uid
++;
603 TYPE_UID (t
) = next_type_uid
++;
604 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
605 TYPE_USER_ALIGN (t
) = 0;
606 TYPE_MAIN_VARIANT (t
) = t
;
607 TYPE_CANONICAL (t
) = t
;
609 /* Default to no attributes for type, but let target change that. */
610 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
611 targetm
.set_default_type_attributes (t
);
613 /* We have not yet computed the alias set for this type. */
614 TYPE_ALIAS_SET (t
) = -1;
618 TREE_CONSTANT (t
) = 1;
627 case PREDECREMENT_EXPR
:
628 case PREINCREMENT_EXPR
:
629 case POSTDECREMENT_EXPR
:
630 case POSTINCREMENT_EXPR
:
631 /* All of these have side-effects, no matter what their
633 TREE_SIDE_EFFECTS (t
) = 1;
641 case tcc_gimple_stmt
:
644 case GIMPLE_MODIFY_STMT
:
645 TREE_SIDE_EFFECTS (t
) = 1;
653 /* Other classes need no special treatment. */
660 /* Return a new node with the same contents as NODE except that its
661 TREE_CHAIN is zero and it has a fresh uid. */
664 copy_node_stat (tree node MEM_STAT_DECL
)
667 enum tree_code code
= TREE_CODE (node
);
670 gcc_assert (code
!= STATEMENT_LIST
);
672 length
= tree_size (node
);
673 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
674 memcpy (t
, node
, length
);
676 if (!GIMPLE_TUPLE_P (node
))
678 TREE_ASM_WRITTEN (t
) = 0;
679 TREE_VISITED (t
) = 0;
682 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
684 DECL_UID (t
) = next_decl_uid
++;
685 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
686 && DECL_HAS_VALUE_EXPR_P (node
))
688 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
689 DECL_HAS_VALUE_EXPR_P (t
) = 1;
691 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
693 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
694 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
696 if (TREE_CODE (node
) == VAR_DECL
&& DECL_BASED_ON_RESTRICT_P (node
))
698 SET_DECL_RESTRICT_BASE (t
, DECL_GET_RESTRICT_BASE (node
));
699 DECL_BASED_ON_RESTRICT_P (t
) = 1;
702 else if (TREE_CODE_CLASS (code
) == tcc_type
)
704 TYPE_UID (t
) = next_type_uid
++;
705 /* The following is so that the debug code for
706 the copy is different from the original type.
707 The two statements usually duplicate each other
708 (because they clear fields of the same union),
709 but the optimizer should catch that. */
710 TYPE_SYMTAB_POINTER (t
) = 0;
711 TYPE_SYMTAB_ADDRESS (t
) = 0;
713 /* Do not copy the values cache. */
714 if (TYPE_CACHED_VALUES_P(t
))
716 TYPE_CACHED_VALUES_P (t
) = 0;
717 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
724 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
725 For example, this can copy a list made of TREE_LIST nodes. */
728 copy_list (tree list
)
736 head
= prev
= copy_node (list
);
737 next
= TREE_CHAIN (list
);
740 TREE_CHAIN (prev
) = copy_node (next
);
741 prev
= TREE_CHAIN (prev
);
742 next
= TREE_CHAIN (next
);
748 /* Create an INT_CST node with a LOW value sign extended. */
751 build_int_cst (tree type
, HOST_WIDE_INT low
)
753 /* Support legacy code. */
755 type
= integer_type_node
;
757 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
760 /* Create an INT_CST node with a LOW value zero extended. */
763 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
765 return build_int_cst_wide (type
, low
, 0);
768 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
769 if it is negative. This function is similar to build_int_cst, but
770 the extra bits outside of the type precision are cleared. Constants
771 with these extra bits may confuse the fold so that it detects overflows
772 even in cases when they do not occur, and in general should be avoided.
773 We cannot however make this a default behavior of build_int_cst without
774 more intrusive changes, since there are parts of gcc that rely on the extra
775 precision of the integer constants. */
778 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
780 unsigned HOST_WIDE_INT low1
;
785 fit_double_type (low
, low
< 0 ? -1 : 0, &low1
, &hi
, type
);
787 return build_int_cst_wide (type
, low1
, hi
);
790 /* Create an INT_CST node of TYPE and value HI:LOW. The value is truncated
791 and sign extended according to the value range of TYPE. */
794 build_int_cst_wide_type (tree type
,
795 unsigned HOST_WIDE_INT low
, HOST_WIDE_INT high
)
797 fit_double_type (low
, high
, &low
, &high
, type
);
798 return build_int_cst_wide (type
, low
, high
);
801 /* These are the hash table functions for the hash table of INTEGER_CST
802 nodes of a sizetype. */
804 /* Return the hash code code X, an INTEGER_CST. */
807 int_cst_hash_hash (const void *x
)
809 const_tree
const t
= (const_tree
) x
;
811 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
812 ^ htab_hash_pointer (TREE_TYPE (t
)));
815 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
816 is the same as that given by *Y, which is the same. */
819 int_cst_hash_eq (const void *x
, const void *y
)
821 const_tree
const xt
= (const_tree
) x
;
822 const_tree
const yt
= (const_tree
) y
;
824 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
825 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
826 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
829 /* Create an INT_CST node of TYPE and value HI:LOW.
830 The returned node is always shared. For small integers we use a
831 per-type vector cache, for larger ones we use a single hash table. */
834 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
842 switch (TREE_CODE (type
))
846 /* Cache NULL pointer. */
855 /* Cache false or true. */
863 if (TYPE_UNSIGNED (type
))
866 limit
= INTEGER_SHARE_LIMIT
;
867 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
873 limit
= INTEGER_SHARE_LIMIT
+ 1;
874 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
876 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
890 /* Look for it in the type's vector of small shared ints. */
891 if (!TYPE_CACHED_VALUES_P (type
))
893 TYPE_CACHED_VALUES_P (type
) = 1;
894 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
897 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
900 /* Make sure no one is clobbering the shared constant. */
901 gcc_assert (TREE_TYPE (t
) == type
);
902 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
903 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
907 /* Create a new shared int. */
908 t
= make_node (INTEGER_CST
);
910 TREE_INT_CST_LOW (t
) = low
;
911 TREE_INT_CST_HIGH (t
) = hi
;
912 TREE_TYPE (t
) = type
;
914 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
919 /* Use the cache of larger shared ints. */
922 TREE_INT_CST_LOW (int_cst_node
) = low
;
923 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
924 TREE_TYPE (int_cst_node
) = type
;
926 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
930 /* Insert this one into the hash table. */
933 /* Make a new node for next time round. */
934 int_cst_node
= make_node (INTEGER_CST
);
941 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
942 and the rest are zeros. */
945 build_low_bits_mask (tree type
, unsigned bits
)
947 unsigned HOST_WIDE_INT low
;
949 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
951 gcc_assert (bits
<= TYPE_PRECISION (type
));
953 if (bits
== TYPE_PRECISION (type
)
954 && !TYPE_UNSIGNED (type
))
956 /* Sign extended all-ones mask. */
960 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
962 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
967 bits
-= HOST_BITS_PER_WIDE_INT
;
969 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
972 return build_int_cst_wide (type
, low
, high
);
975 /* Checks that X is integer constant that can be expressed in (unsigned)
976 HOST_WIDE_INT without loss of precision. */
979 cst_and_fits_in_hwi (const_tree x
)
981 if (TREE_CODE (x
) != INTEGER_CST
)
984 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
987 return (TREE_INT_CST_HIGH (x
) == 0
988 || TREE_INT_CST_HIGH (x
) == -1);
991 /* Return a new VECTOR_CST node whose type is TYPE and whose values
992 are in a list pointed to by VALS. */
995 build_vector (tree type
, tree vals
)
997 tree v
= make_node (VECTOR_CST
);
1001 TREE_VECTOR_CST_ELTS (v
) = vals
;
1002 TREE_TYPE (v
) = type
;
1004 /* Iterate through elements and check for overflow. */
1005 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
1007 tree value
= TREE_VALUE (link
);
1009 /* Don't crash if we get an address constant. */
1010 if (!CONSTANT_CLASS_P (value
))
1013 over
|= TREE_OVERFLOW (value
);
1016 TREE_OVERFLOW (v
) = over
;
1020 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1021 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1024 build_vector_from_ctor (tree type
, VEC(constructor_elt
,gc
) *v
)
1026 tree list
= NULL_TREE
;
1027 unsigned HOST_WIDE_INT idx
;
1030 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1031 list
= tree_cons (NULL_TREE
, value
, list
);
1032 return build_vector (type
, nreverse (list
));
1035 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1036 are in the VEC pointed to by VALS. */
1038 build_constructor (tree type
, VEC(constructor_elt
,gc
) *vals
)
1040 tree c
= make_node (CONSTRUCTOR
);
1041 TREE_TYPE (c
) = type
;
1042 CONSTRUCTOR_ELTS (c
) = vals
;
1046 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1049 build_constructor_single (tree type
, tree index
, tree value
)
1051 VEC(constructor_elt
,gc
) *v
;
1052 constructor_elt
*elt
;
1055 v
= VEC_alloc (constructor_elt
, gc
, 1);
1056 elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1060 t
= build_constructor (type
, v
);
1061 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
1066 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1067 are in a list pointed to by VALS. */
1069 build_constructor_from_list (tree type
, tree vals
)
1072 VEC(constructor_elt
,gc
) *v
= NULL
;
1073 bool constant_p
= true;
1077 v
= VEC_alloc (constructor_elt
, gc
, list_length (vals
));
1078 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1080 constructor_elt
*elt
= VEC_quick_push (constructor_elt
, v
, NULL
);
1081 val
= TREE_VALUE (t
);
1082 elt
->index
= TREE_PURPOSE (t
);
1084 if (!TREE_CONSTANT (val
))
1089 t
= build_constructor (type
, v
);
1090 TREE_CONSTANT (t
) = constant_p
;
1094 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1097 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1100 FIXED_VALUE_TYPE
*fp
;
1102 v
= make_node (FIXED_CST
);
1103 fp
= ggc_alloc (sizeof (FIXED_VALUE_TYPE
));
1104 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1106 TREE_TYPE (v
) = type
;
1107 TREE_FIXED_CST_PTR (v
) = fp
;
1111 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1114 build_real (tree type
, REAL_VALUE_TYPE d
)
1117 REAL_VALUE_TYPE
*dp
;
1120 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1121 Consider doing it via real_convert now. */
1123 v
= make_node (REAL_CST
);
1124 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
1125 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1127 TREE_TYPE (v
) = type
;
1128 TREE_REAL_CST_PTR (v
) = dp
;
1129 TREE_OVERFLOW (v
) = overflow
;
1133 /* Return a new REAL_CST node whose type is TYPE
1134 and whose value is the integer value of the INTEGER_CST node I. */
1137 real_value_from_int_cst (const_tree type
, const_tree i
)
1141 /* Clear all bits of the real value type so that we can later do
1142 bitwise comparisons to see if two values are the same. */
1143 memset (&d
, 0, sizeof d
);
1145 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1146 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1147 TYPE_UNSIGNED (TREE_TYPE (i
)));
1151 /* Given a tree representing an integer constant I, return a tree
1152 representing the same value as a floating-point constant of type TYPE. */
1155 build_real_from_int_cst (tree type
, const_tree i
)
1158 int overflow
= TREE_OVERFLOW (i
);
1160 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1162 TREE_OVERFLOW (v
) |= overflow
;
1166 /* Return a newly constructed STRING_CST node whose value is
1167 the LEN characters at STR.
1168 The TREE_TYPE is not initialized. */
1171 build_string (int len
, const char *str
)
1176 /* Do not waste bytes provided by padding of struct tree_string. */
1177 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1179 #ifdef GATHER_STATISTICS
1180 tree_node_counts
[(int) c_kind
]++;
1181 tree_node_sizes
[(int) c_kind
] += length
;
1184 s
= ggc_alloc_tree (length
);
1186 memset (s
, 0, sizeof (struct tree_common
));
1187 TREE_SET_CODE (s
, STRING_CST
);
1188 TREE_CONSTANT (s
) = 1;
1189 TREE_STRING_LENGTH (s
) = len
;
1190 memcpy (s
->string
.str
, str
, len
);
1191 s
->string
.str
[len
] = '\0';
1196 /* Return a newly constructed COMPLEX_CST node whose value is
1197 specified by the real and imaginary parts REAL and IMAG.
1198 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1199 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1202 build_complex (tree type
, tree real
, tree imag
)
1204 tree t
= make_node (COMPLEX_CST
);
1206 TREE_REALPART (t
) = real
;
1207 TREE_IMAGPART (t
) = imag
;
1208 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1209 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1213 /* Return a constant of arithmetic type TYPE which is the
1214 multiplicative identity of the set TYPE. */
1217 build_one_cst (tree type
)
1219 switch (TREE_CODE (type
))
1221 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1222 case POINTER_TYPE
: case REFERENCE_TYPE
:
1224 return build_int_cst (type
, 1);
1227 return build_real (type
, dconst1
);
1229 case FIXED_POINT_TYPE
:
1230 /* We can only generate 1 for accum types. */
1231 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1232 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1239 scalar
= build_one_cst (TREE_TYPE (type
));
1241 /* Create 'vect_cst_ = {cst,cst,...,cst}' */
1243 for (i
= TYPE_VECTOR_SUBPARTS (type
); --i
>= 0; )
1244 cst
= tree_cons (NULL_TREE
, scalar
, cst
);
1246 return build_vector (type
, cst
);
1250 return build_complex (type
,
1251 build_one_cst (TREE_TYPE (type
)),
1252 fold_convert (TREE_TYPE (type
), integer_zero_node
));
1259 /* Build a BINFO with LEN language slots. */
1262 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1265 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1266 + VEC_embedded_size (tree
, base_binfos
));
1268 #ifdef GATHER_STATISTICS
1269 tree_node_counts
[(int) binfo_kind
]++;
1270 tree_node_sizes
[(int) binfo_kind
] += length
;
1273 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1275 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1277 TREE_SET_CODE (t
, TREE_BINFO
);
1279 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
1285 /* Build a newly constructed TREE_VEC node of length LEN. */
1288 make_tree_vec_stat (int len MEM_STAT_DECL
)
1291 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1293 #ifdef GATHER_STATISTICS
1294 tree_node_counts
[(int) vec_kind
]++;
1295 tree_node_sizes
[(int) vec_kind
] += length
;
1298 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
1300 memset (t
, 0, length
);
1302 TREE_SET_CODE (t
, TREE_VEC
);
1303 TREE_VEC_LENGTH (t
) = len
;
1308 /* Return 1 if EXPR is the integer constant zero or a complex constant
1312 integer_zerop (const_tree expr
)
1316 return ((TREE_CODE (expr
) == INTEGER_CST
1317 && TREE_INT_CST_LOW (expr
) == 0
1318 && TREE_INT_CST_HIGH (expr
) == 0)
1319 || (TREE_CODE (expr
) == COMPLEX_CST
1320 && integer_zerop (TREE_REALPART (expr
))
1321 && integer_zerop (TREE_IMAGPART (expr
))));
1324 /* Return 1 if EXPR is the integer constant one or the corresponding
1325 complex constant. */
1328 integer_onep (const_tree expr
)
1332 return ((TREE_CODE (expr
) == INTEGER_CST
1333 && TREE_INT_CST_LOW (expr
) == 1
1334 && TREE_INT_CST_HIGH (expr
) == 0)
1335 || (TREE_CODE (expr
) == COMPLEX_CST
1336 && integer_onep (TREE_REALPART (expr
))
1337 && integer_zerop (TREE_IMAGPART (expr
))));
1340 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1341 it contains. Likewise for the corresponding complex constant. */
1344 integer_all_onesp (const_tree expr
)
1351 if (TREE_CODE (expr
) == COMPLEX_CST
1352 && integer_all_onesp (TREE_REALPART (expr
))
1353 && integer_zerop (TREE_IMAGPART (expr
)))
1356 else if (TREE_CODE (expr
) != INTEGER_CST
)
1359 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1360 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1361 && TREE_INT_CST_HIGH (expr
) == -1)
1366 /* Note that using TYPE_PRECISION here is wrong. We care about the
1367 actual bits, not the (arbitrary) range of the type. */
1368 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1369 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1371 HOST_WIDE_INT high_value
;
1374 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1376 /* Can not handle precisions greater than twice the host int size. */
1377 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1378 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1379 /* Shifting by the host word size is undefined according to the ANSI
1380 standard, so we must handle this as a special case. */
1383 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1385 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1386 && TREE_INT_CST_HIGH (expr
) == high_value
);
1389 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1392 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1396 integer_pow2p (const_tree expr
)
1399 HOST_WIDE_INT high
, low
;
1403 if (TREE_CODE (expr
) == COMPLEX_CST
1404 && integer_pow2p (TREE_REALPART (expr
))
1405 && integer_zerop (TREE_IMAGPART (expr
)))
1408 if (TREE_CODE (expr
) != INTEGER_CST
)
1411 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1412 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1413 high
= TREE_INT_CST_HIGH (expr
);
1414 low
= TREE_INT_CST_LOW (expr
);
1416 /* First clear all bits that are beyond the type's precision in case
1417 we've been sign extended. */
1419 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1421 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1422 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1426 if (prec
< HOST_BITS_PER_WIDE_INT
)
1427 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1430 if (high
== 0 && low
== 0)
1433 return ((high
== 0 && (low
& (low
- 1)) == 0)
1434 || (low
== 0 && (high
& (high
- 1)) == 0));
1437 /* Return 1 if EXPR is an integer constant other than zero or a
1438 complex constant other than zero. */
1441 integer_nonzerop (const_tree expr
)
1445 return ((TREE_CODE (expr
) == INTEGER_CST
1446 && (TREE_INT_CST_LOW (expr
) != 0
1447 || TREE_INT_CST_HIGH (expr
) != 0))
1448 || (TREE_CODE (expr
) == COMPLEX_CST
1449 && (integer_nonzerop (TREE_REALPART (expr
))
1450 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1453 /* Return 1 if EXPR is the fixed-point constant zero. */
1456 fixed_zerop (const_tree expr
)
1458 return (TREE_CODE (expr
) == FIXED_CST
1459 && double_int_zero_p (TREE_FIXED_CST (expr
).data
));
1462 /* Return the power of two represented by a tree node known to be a
1466 tree_log2 (const_tree expr
)
1469 HOST_WIDE_INT high
, low
;
1473 if (TREE_CODE (expr
) == COMPLEX_CST
)
1474 return tree_log2 (TREE_REALPART (expr
));
1476 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1477 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1479 high
= TREE_INT_CST_HIGH (expr
);
1480 low
= TREE_INT_CST_LOW (expr
);
1482 /* First clear all bits that are beyond the type's precision in case
1483 we've been sign extended. */
1485 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1487 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1488 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1492 if (prec
< HOST_BITS_PER_WIDE_INT
)
1493 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1496 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1497 : exact_log2 (low
));
1500 /* Similar, but return the largest integer Y such that 2 ** Y is less
1501 than or equal to EXPR. */
1504 tree_floor_log2 (const_tree expr
)
1507 HOST_WIDE_INT high
, low
;
1511 if (TREE_CODE (expr
) == COMPLEX_CST
)
1512 return tree_log2 (TREE_REALPART (expr
));
1514 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1515 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1517 high
= TREE_INT_CST_HIGH (expr
);
1518 low
= TREE_INT_CST_LOW (expr
);
1520 /* First clear all bits that are beyond the type's precision in case
1521 we've been sign extended. Ignore if type's precision hasn't been set
1522 since what we are doing is setting it. */
1524 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1526 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1527 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1531 if (prec
< HOST_BITS_PER_WIDE_INT
)
1532 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1535 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1536 : floor_log2 (low
));
1539 /* Return 1 if EXPR is the real constant zero. */
1542 real_zerop (const_tree expr
)
1546 return ((TREE_CODE (expr
) == REAL_CST
1547 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1548 || (TREE_CODE (expr
) == COMPLEX_CST
1549 && real_zerop (TREE_REALPART (expr
))
1550 && real_zerop (TREE_IMAGPART (expr
))));
1553 /* Return 1 if EXPR is the real constant one in real or complex form. */
1556 real_onep (const_tree expr
)
1560 return ((TREE_CODE (expr
) == REAL_CST
1561 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1562 || (TREE_CODE (expr
) == COMPLEX_CST
1563 && real_onep (TREE_REALPART (expr
))
1564 && real_zerop (TREE_IMAGPART (expr
))));
1567 /* Return 1 if EXPR is the real constant two. */
1570 real_twop (const_tree expr
)
1574 return ((TREE_CODE (expr
) == REAL_CST
1575 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1576 || (TREE_CODE (expr
) == COMPLEX_CST
1577 && real_twop (TREE_REALPART (expr
))
1578 && real_zerop (TREE_IMAGPART (expr
))));
1581 /* Return 1 if EXPR is the real constant minus one. */
1584 real_minus_onep (const_tree expr
)
1588 return ((TREE_CODE (expr
) == REAL_CST
1589 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1590 || (TREE_CODE (expr
) == COMPLEX_CST
1591 && real_minus_onep (TREE_REALPART (expr
))
1592 && real_zerop (TREE_IMAGPART (expr
))));
1595 /* Nonzero if EXP is a constant or a cast of a constant. */
1598 really_constant_p (const_tree exp
)
1600 /* This is not quite the same as STRIP_NOPS. It does more. */
1601 while (CONVERT_EXPR_P (exp
)
1602 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1603 exp
= TREE_OPERAND (exp
, 0);
1604 return TREE_CONSTANT (exp
);
1607 /* Return first list element whose TREE_VALUE is ELEM.
1608 Return 0 if ELEM is not in LIST. */
1611 value_member (tree elem
, tree list
)
1615 if (elem
== TREE_VALUE (list
))
1617 list
= TREE_CHAIN (list
);
1622 /* Return first list element whose TREE_PURPOSE is ELEM.
1623 Return 0 if ELEM is not in LIST. */
1626 purpose_member (const_tree elem
, tree list
)
1630 if (elem
== TREE_PURPOSE (list
))
1632 list
= TREE_CHAIN (list
);
1637 /* Return nonzero if ELEM is part of the chain CHAIN. */
1640 chain_member (const_tree elem
, const_tree chain
)
1646 chain
= TREE_CHAIN (chain
);
1652 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1653 We expect a null pointer to mark the end of the chain.
1654 This is the Lisp primitive `length'. */
1657 list_length (const_tree t
)
1660 #ifdef ENABLE_TREE_CHECKING
1668 #ifdef ENABLE_TREE_CHECKING
1671 gcc_assert (p
!= q
);
1679 /* Returns the number of FIELD_DECLs in TYPE. */
1682 fields_length (const_tree type
)
1684 tree t
= TYPE_FIELDS (type
);
1687 for (; t
; t
= TREE_CHAIN (t
))
1688 if (TREE_CODE (t
) == FIELD_DECL
)
1694 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1695 by modifying the last node in chain 1 to point to chain 2.
1696 This is the Lisp primitive `nconc'. */
1699 chainon (tree op1
, tree op2
)
1708 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1710 TREE_CHAIN (t1
) = op2
;
1712 #ifdef ENABLE_TREE_CHECKING
1715 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1716 gcc_assert (t2
!= t1
);
1723 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1726 tree_last (tree chain
)
1730 while ((next
= TREE_CHAIN (chain
)))
1735 /* Reverse the order of elements in the chain T,
1736 and return the new head of the chain (old last element). */
1741 tree prev
= 0, decl
, next
;
1742 for (decl
= t
; decl
; decl
= next
)
1744 next
= TREE_CHAIN (decl
);
1745 TREE_CHAIN (decl
) = prev
;
1751 /* Return a newly created TREE_LIST node whose
1752 purpose and value fields are PARM and VALUE. */
1755 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1757 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1758 TREE_PURPOSE (t
) = parm
;
1759 TREE_VALUE (t
) = value
;
1763 /* Return a newly created TREE_LIST node whose
1764 purpose and value fields are PURPOSE and VALUE
1765 and whose TREE_CHAIN is CHAIN. */
1768 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1772 node
= ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1774 memset (node
, 0, sizeof (struct tree_common
));
1776 #ifdef GATHER_STATISTICS
1777 tree_node_counts
[(int) x_kind
]++;
1778 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1781 TREE_SET_CODE (node
, TREE_LIST
);
1782 TREE_CHAIN (node
) = chain
;
1783 TREE_PURPOSE (node
) = purpose
;
1784 TREE_VALUE (node
) = value
;
1789 /* Return the size nominally occupied by an object of type TYPE
1790 when it resides in memory. The value is measured in units of bytes,
1791 and its data type is that normally used for type sizes
1792 (which is the first type created by make_signed_type or
1793 make_unsigned_type). */
1796 size_in_bytes (const_tree type
)
1800 if (type
== error_mark_node
)
1801 return integer_zero_node
;
1803 type
= TYPE_MAIN_VARIANT (type
);
1804 t
= TYPE_SIZE_UNIT (type
);
1808 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1809 return size_zero_node
;
1815 /* Return the size of TYPE (in bytes) as a wide integer
1816 or return -1 if the size can vary or is larger than an integer. */
1819 int_size_in_bytes (const_tree type
)
1823 if (type
== error_mark_node
)
1826 type
= TYPE_MAIN_VARIANT (type
);
1827 t
= TYPE_SIZE_UNIT (type
);
1829 || TREE_CODE (t
) != INTEGER_CST
1830 || TREE_INT_CST_HIGH (t
) != 0
1831 /* If the result would appear negative, it's too big to represent. */
1832 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1835 return TREE_INT_CST_LOW (t
);
1838 /* Return the maximum size of TYPE (in bytes) as a wide integer
1839 or return -1 if the size can vary or is larger than an integer. */
1842 max_int_size_in_bytes (const_tree type
)
1844 HOST_WIDE_INT size
= -1;
1847 /* If this is an array type, check for a possible MAX_SIZE attached. */
1849 if (TREE_CODE (type
) == ARRAY_TYPE
)
1851 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
1853 if (size_tree
&& host_integerp (size_tree
, 1))
1854 size
= tree_low_cst (size_tree
, 1);
1857 /* If we still haven't been able to get a size, see if the language
1858 can compute a maximum size. */
1862 size_tree
= lang_hooks
.types
.max_size (type
);
1864 if (size_tree
&& host_integerp (size_tree
, 1))
1865 size
= tree_low_cst (size_tree
, 1);
1871 /* Return the bit position of FIELD, in bits from the start of the record.
1872 This is a tree of type bitsizetype. */
1875 bit_position (const_tree field
)
1877 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1878 DECL_FIELD_BIT_OFFSET (field
));
1881 /* Likewise, but return as an integer. It must be representable in
1882 that way (since it could be a signed value, we don't have the
1883 option of returning -1 like int_size_in_byte can. */
1886 int_bit_position (const_tree field
)
1888 return tree_low_cst (bit_position (field
), 0);
1891 /* Return the byte position of FIELD, in bytes from the start of the record.
1892 This is a tree of type sizetype. */
1895 byte_position (const_tree field
)
1897 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1898 DECL_FIELD_BIT_OFFSET (field
));
1901 /* Likewise, but return as an integer. It must be representable in
1902 that way (since it could be a signed value, we don't have the
1903 option of returning -1 like int_size_in_byte can. */
1906 int_byte_position (const_tree field
)
1908 return tree_low_cst (byte_position (field
), 0);
1911 /* Return the strictest alignment, in bits, that T is known to have. */
1914 expr_align (const_tree t
)
1916 unsigned int align0
, align1
;
1918 switch (TREE_CODE (t
))
1920 CASE_CONVERT
: case NON_LVALUE_EXPR
:
1921 /* If we have conversions, we know that the alignment of the
1922 object must meet each of the alignments of the types. */
1923 align0
= expr_align (TREE_OPERAND (t
, 0));
1924 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1925 return MAX (align0
, align1
);
1927 case GIMPLE_MODIFY_STMT
:
1928 /* We should never ask for the alignment of a gimple statement. */
1931 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1932 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1933 case CLEANUP_POINT_EXPR
:
1934 /* These don't change the alignment of an object. */
1935 return expr_align (TREE_OPERAND (t
, 0));
1938 /* The best we can do is say that the alignment is the least aligned
1940 align0
= expr_align (TREE_OPERAND (t
, 1));
1941 align1
= expr_align (TREE_OPERAND (t
, 2));
1942 return MIN (align0
, align1
);
1944 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
1945 meaningfully, it's always 1. */
1946 case LABEL_DECL
: case CONST_DECL
:
1947 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1949 gcc_assert (DECL_ALIGN (t
) != 0);
1950 return DECL_ALIGN (t
);
1956 /* Otherwise take the alignment from that of the type. */
1957 return TYPE_ALIGN (TREE_TYPE (t
));
1960 /* Return, as a tree node, the number of elements for TYPE (which is an
1961 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1964 array_type_nelts (const_tree type
)
1966 tree index_type
, min
, max
;
1968 /* If they did it with unspecified bounds, then we should have already
1969 given an error about it before we got here. */
1970 if (! TYPE_DOMAIN (type
))
1971 return error_mark_node
;
1973 index_type
= TYPE_DOMAIN (type
);
1974 min
= TYPE_MIN_VALUE (index_type
);
1975 max
= TYPE_MAX_VALUE (index_type
);
1977 return (integer_zerop (min
)
1979 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
1982 /* If arg is static -- a reference to an object in static storage -- then
1983 return the object. This is not the same as the C meaning of `static'.
1984 If arg isn't static, return NULL. */
1989 switch (TREE_CODE (arg
))
1992 /* Nested functions are static, even though taking their address will
1993 involve a trampoline as we unnest the nested function and create
1994 the trampoline on the tree level. */
1998 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1999 && ! DECL_THREAD_LOCAL_P (arg
)
2000 && ! DECL_DLLIMPORT_P (arg
)
2004 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2008 return TREE_STATIC (arg
) ? arg
: NULL
;
2015 /* If the thing being referenced is not a field, then it is
2016 something language specific. */
2017 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
2018 return (*lang_hooks
.staticp
) (arg
);
2020 /* If we are referencing a bitfield, we can't evaluate an
2021 ADDR_EXPR at compile time and so it isn't a constant. */
2022 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2025 return staticp (TREE_OPERAND (arg
, 0));
2030 case MISALIGNED_INDIRECT_REF
:
2031 case ALIGN_INDIRECT_REF
:
2033 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2036 case ARRAY_RANGE_REF
:
2037 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2038 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2039 return staticp (TREE_OPERAND (arg
, 0));
2044 if ((unsigned int) TREE_CODE (arg
)
2045 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
2046 return lang_hooks
.staticp (arg
);
2055 /* Return whether OP is a DECL whose address is function-invariant. */
2058 decl_address_invariant_p (const_tree op
)
2060 /* The conditions below are slightly less strict than the one in
2063 switch (TREE_CODE (op
))
2072 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2073 && !DECL_DLLIMPORT_P (op
))
2074 || DECL_THREAD_LOCAL_P (op
)
2075 || DECL_CONTEXT (op
) == current_function_decl
2076 || decl_function_context (op
) == current_function_decl
)
2081 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2082 || decl_function_context (op
) == current_function_decl
)
2094 /* Return true if T is function-invariant (internal function, does
2095 not handle arithmetic; that's handled in skip_simple_arithmetic and
2096 tree_invariant_p). */
2098 static bool tree_invariant_p (tree t
);
2101 tree_invariant_p_1 (tree t
)
2105 if (TREE_CONSTANT (t
)
2106 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2109 switch (TREE_CODE (t
))
2115 op
= TREE_OPERAND (t
, 0);
2116 while (handled_component_p (op
))
2118 switch (TREE_CODE (op
))
2121 case ARRAY_RANGE_REF
:
2122 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2123 || TREE_OPERAND (op
, 2) != NULL_TREE
2124 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2129 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2135 op
= TREE_OPERAND (op
, 0);
2138 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2147 /* Return true if T is function-invariant. */
2150 tree_invariant_p (tree t
)
2152 tree inner
= skip_simple_arithmetic (t
);
2153 return tree_invariant_p_1 (inner
);
2156 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2157 Do this to any expression which may be used in more than one place,
2158 but must be evaluated only once.
2160 Normally, expand_expr would reevaluate the expression each time.
2161 Calling save_expr produces something that is evaluated and recorded
2162 the first time expand_expr is called on it. Subsequent calls to
2163 expand_expr just reuse the recorded value.
2165 The call to expand_expr that generates code that actually computes
2166 the value is the first call *at compile time*. Subsequent calls
2167 *at compile time* generate code to use the saved value.
2168 This produces correct result provided that *at run time* control
2169 always flows through the insns made by the first expand_expr
2170 before reaching the other places where the save_expr was evaluated.
2171 You, the caller of save_expr, must make sure this is so.
2173 Constants, and certain read-only nodes, are returned with no
2174 SAVE_EXPR because that is safe. Expressions containing placeholders
2175 are not touched; see tree.def for an explanation of what these
2179 save_expr (tree expr
)
2181 tree t
= fold (expr
);
2184 /* If the tree evaluates to a constant, then we don't want to hide that
2185 fact (i.e. this allows further folding, and direct checks for constants).
2186 However, a read-only object that has side effects cannot be bypassed.
2187 Since it is no problem to reevaluate literals, we just return the
2189 inner
= skip_simple_arithmetic (t
);
2190 if (TREE_CODE (inner
) == ERROR_MARK
)
2193 if (tree_invariant_p_1 (inner
))
2196 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2197 it means that the size or offset of some field of an object depends on
2198 the value within another field.
2200 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2201 and some variable since it would then need to be both evaluated once and
2202 evaluated more than once. Front-ends must assure this case cannot
2203 happen by surrounding any such subexpressions in their own SAVE_EXPR
2204 and forcing evaluation at the proper time. */
2205 if (contains_placeholder_p (inner
))
2208 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2210 /* This expression might be placed ahead of a jump to ensure that the
2211 value was computed on both sides of the jump. So make sure it isn't
2212 eliminated as dead. */
2213 TREE_SIDE_EFFECTS (t
) = 1;
2217 /* Look inside EXPR and into any simple arithmetic operations. Return
2218 the innermost non-arithmetic node. */
2221 skip_simple_arithmetic (tree expr
)
2225 /* We don't care about whether this can be used as an lvalue in this
2227 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2228 expr
= TREE_OPERAND (expr
, 0);
2230 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2231 a constant, it will be more efficient to not make another SAVE_EXPR since
2232 it will allow better simplification and GCSE will be able to merge the
2233 computations if they actually occur. */
2237 if (UNARY_CLASS_P (inner
))
2238 inner
= TREE_OPERAND (inner
, 0);
2239 else if (BINARY_CLASS_P (inner
))
2241 if (tree_invariant_p (TREE_OPERAND (inner
, 1)))
2242 inner
= TREE_OPERAND (inner
, 0);
2243 else if (tree_invariant_p (TREE_OPERAND (inner
, 0)))
2244 inner
= TREE_OPERAND (inner
, 1);
2255 /* Return which tree structure is used by T. */
2257 enum tree_node_structure_enum
2258 tree_node_structure (const_tree t
)
2260 const enum tree_code code
= TREE_CODE (t
);
2262 switch (TREE_CODE_CLASS (code
))
2264 case tcc_declaration
:
2269 return TS_FIELD_DECL
;
2271 return TS_PARM_DECL
;
2275 return TS_LABEL_DECL
;
2277 return TS_RESULT_DECL
;
2279 return TS_CONST_DECL
;
2281 return TS_TYPE_DECL
;
2283 return TS_FUNCTION_DECL
;
2284 case SYMBOL_MEMORY_TAG
:
2285 case NAME_MEMORY_TAG
:
2286 case MEMORY_PARTITION_TAG
:
2287 return TS_MEMORY_TAG
;
2289 return TS_DECL_NON_COMMON
;
2295 case tcc_comparison
:
2298 case tcc_expression
:
2302 case tcc_gimple_stmt
:
2303 return TS_GIMPLE_STATEMENT
;
2304 default: /* tcc_constant and tcc_exceptional */
2309 /* tcc_constant cases. */
2310 case INTEGER_CST
: return TS_INT_CST
;
2311 case REAL_CST
: return TS_REAL_CST
;
2312 case FIXED_CST
: return TS_FIXED_CST
;
2313 case COMPLEX_CST
: return TS_COMPLEX
;
2314 case VECTOR_CST
: return TS_VECTOR
;
2315 case STRING_CST
: return TS_STRING
;
2316 /* tcc_exceptional cases. */
2317 /* FIXME tuples: eventually this should be TS_BASE. For now, nothing
2319 case ERROR_MARK
: return TS_COMMON
;
2320 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
2321 case TREE_LIST
: return TS_LIST
;
2322 case TREE_VEC
: return TS_VEC
;
2323 case PHI_NODE
: return TS_PHI_NODE
;
2324 case SSA_NAME
: return TS_SSA_NAME
;
2325 case PLACEHOLDER_EXPR
: return TS_COMMON
;
2326 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
2327 case BLOCK
: return TS_BLOCK
;
2328 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
2329 case TREE_BINFO
: return TS_BINFO
;
2330 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
2331 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
2338 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
2339 or offset that depends on a field within a record. */
2342 contains_placeholder_p (const_tree exp
)
2344 enum tree_code code
;
2349 code
= TREE_CODE (exp
);
2350 if (code
== PLACEHOLDER_EXPR
)
2353 switch (TREE_CODE_CLASS (code
))
2356 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2357 position computations since they will be converted into a
2358 WITH_RECORD_EXPR involving the reference, which will assume
2359 here will be valid. */
2360 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2362 case tcc_exceptional
:
2363 if (code
== TREE_LIST
)
2364 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2365 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2370 case tcc_comparison
:
2371 case tcc_expression
:
2375 /* Ignoring the first operand isn't quite right, but works best. */
2376 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2379 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2380 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2381 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2387 switch (TREE_CODE_LENGTH (code
))
2390 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2392 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2393 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
2404 const_call_expr_arg_iterator iter
;
2405 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
2406 if (CONTAINS_PLACEHOLDER_P (arg
))
2420 /* Return true if any part of the computation of TYPE involves a
2421 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
2422 (for QUAL_UNION_TYPE) and field positions. */
2425 type_contains_placeholder_1 (const_tree type
)
2427 /* If the size contains a placeholder or the parent type (component type in
2428 the case of arrays) type involves a placeholder, this type does. */
2429 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
2430 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
2431 || (TREE_TYPE (type
) != 0
2432 && type_contains_placeholder_p (TREE_TYPE (type
))))
2435 /* Now do type-specific checks. Note that the last part of the check above
2436 greatly limits what we have to do below. */
2437 switch (TREE_CODE (type
))
2445 case REFERENCE_TYPE
:
2453 case FIXED_POINT_TYPE
:
2454 /* Here we just check the bounds. */
2455 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
2456 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
2459 /* We're already checked the component type (TREE_TYPE), so just check
2461 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
2465 case QUAL_UNION_TYPE
:
2469 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2470 if (TREE_CODE (field
) == FIELD_DECL
2471 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
2472 || (TREE_CODE (type
) == QUAL_UNION_TYPE
2473 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
2474 || type_contains_placeholder_p (TREE_TYPE (field
))))
2486 type_contains_placeholder_p (tree type
)
2490 /* If the contains_placeholder_bits field has been initialized,
2491 then we know the answer. */
2492 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
2493 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
2495 /* Indicate that we've seen this type node, and the answer is false.
2496 This is what we want to return if we run into recursion via fields. */
2497 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2499 /* Compute the real value. */
2500 result
= type_contains_placeholder_1 (type
);
2502 /* Store the real value. */
2503 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2508 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2509 return a tree with all occurrences of references to F in a
2510 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2511 contains only arithmetic expressions or a CALL_EXPR with a
2512 PLACEHOLDER_EXPR occurring only in its arglist. */
2515 substitute_in_expr (tree exp
, tree f
, tree r
)
2517 enum tree_code code
= TREE_CODE (exp
);
2518 tree op0
, op1
, op2
, op3
;
2522 /* We handle TREE_LIST and COMPONENT_REF separately. */
2523 if (code
== TREE_LIST
)
2525 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2526 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2527 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2530 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2532 else if (code
== COMPONENT_REF
)
2534 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2535 and it is the right field, replace it with R. */
2536 for (inner
= TREE_OPERAND (exp
, 0);
2537 REFERENCE_CLASS_P (inner
);
2538 inner
= TREE_OPERAND (inner
, 0))
2540 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2541 && TREE_OPERAND (exp
, 1) == f
)
2544 /* If this expression hasn't been completed let, leave it alone. */
2545 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2548 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2549 if (op0
== TREE_OPERAND (exp
, 0))
2552 new = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2553 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
);
2556 switch (TREE_CODE_CLASS (code
))
2559 case tcc_declaration
:
2562 case tcc_exceptional
:
2565 case tcc_comparison
:
2566 case tcc_expression
:
2568 switch (TREE_CODE_LENGTH (code
))
2574 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2575 if (op0
== TREE_OPERAND (exp
, 0))
2578 new = fold_build1 (code
, TREE_TYPE (exp
), op0
);
2582 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2583 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2585 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2588 new = fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2592 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2593 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2594 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2596 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2597 && op2
== TREE_OPERAND (exp
, 2))
2600 new = fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2604 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2605 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2606 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2607 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
2609 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2610 && op2
== TREE_OPERAND (exp
, 2)
2611 && op3
== TREE_OPERAND (exp
, 3))
2614 new = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2624 tree copy
= NULL_TREE
;
2627 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
2629 tree op
= TREE_OPERAND (exp
, i
);
2630 tree newop
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
2633 copy
= copy_node (exp
);
2634 TREE_OPERAND (copy
, i
) = newop
;
2648 TREE_READONLY (new) = TREE_READONLY (exp
);
2652 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2653 for it within OBJ, a tree that is an object or a chain of references. */
2656 substitute_placeholder_in_expr (tree exp
, tree obj
)
2658 enum tree_code code
= TREE_CODE (exp
);
2659 tree op0
, op1
, op2
, op3
;
2661 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2662 in the chain of OBJ. */
2663 if (code
== PLACEHOLDER_EXPR
)
2665 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2668 for (elt
= obj
; elt
!= 0;
2669 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2670 || TREE_CODE (elt
) == COND_EXPR
)
2671 ? TREE_OPERAND (elt
, 1)
2672 : (REFERENCE_CLASS_P (elt
)
2673 || UNARY_CLASS_P (elt
)
2674 || BINARY_CLASS_P (elt
)
2675 || VL_EXP_CLASS_P (elt
)
2676 || EXPRESSION_CLASS_P (elt
))
2677 ? TREE_OPERAND (elt
, 0) : 0))
2678 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2681 for (elt
= obj
; elt
!= 0;
2682 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2683 || TREE_CODE (elt
) == COND_EXPR
)
2684 ? TREE_OPERAND (elt
, 1)
2685 : (REFERENCE_CLASS_P (elt
)
2686 || UNARY_CLASS_P (elt
)
2687 || BINARY_CLASS_P (elt
)
2688 || VL_EXP_CLASS_P (elt
)
2689 || EXPRESSION_CLASS_P (elt
))
2690 ? TREE_OPERAND (elt
, 0) : 0))
2691 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2692 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2694 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
2696 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2697 survives until RTL generation, there will be an error. */
2701 /* TREE_LIST is special because we need to look at TREE_VALUE
2702 and TREE_CHAIN, not TREE_OPERANDS. */
2703 else if (code
== TREE_LIST
)
2705 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2706 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2707 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2710 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2713 switch (TREE_CODE_CLASS (code
))
2716 case tcc_declaration
:
2719 case tcc_exceptional
:
2722 case tcc_comparison
:
2723 case tcc_expression
:
2726 switch (TREE_CODE_LENGTH (code
))
2732 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2733 if (op0
== TREE_OPERAND (exp
, 0))
2736 return fold_build1 (code
, TREE_TYPE (exp
), op0
);
2739 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2740 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2742 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2745 return fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
2748 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2749 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2750 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2752 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2753 && op2
== TREE_OPERAND (exp
, 2))
2756 return fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
2759 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2760 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2761 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2762 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2764 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2765 && op2
== TREE_OPERAND (exp
, 2)
2766 && op3
== TREE_OPERAND (exp
, 3))
2769 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2778 tree copy
= NULL_TREE
;
2780 int n
= TREE_OPERAND_LENGTH (exp
);
2781 for (i
= 1; i
< n
; i
++)
2783 tree op
= TREE_OPERAND (exp
, i
);
2784 tree newop
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
2788 copy
= copy_node (exp
);
2789 TREE_OPERAND (copy
, i
) = newop
;
2803 /* Stabilize a reference so that we can use it any number of times
2804 without causing its operands to be evaluated more than once.
2805 Returns the stabilized reference. This works by means of save_expr,
2806 so see the caveats in the comments about save_expr.
2808 Also allows conversion expressions whose operands are references.
2809 Any other kind of expression is returned unchanged. */
2812 stabilize_reference (tree ref
)
2815 enum tree_code code
= TREE_CODE (ref
);
2822 /* No action is needed in this case. */
2827 case FIX_TRUNC_EXPR
:
2828 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2832 result
= build_nt (INDIRECT_REF
,
2833 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2837 result
= build_nt (COMPONENT_REF
,
2838 stabilize_reference (TREE_OPERAND (ref
, 0)),
2839 TREE_OPERAND (ref
, 1), NULL_TREE
);
2843 result
= build_nt (BIT_FIELD_REF
,
2844 stabilize_reference (TREE_OPERAND (ref
, 0)),
2845 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2846 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2850 result
= build_nt (ARRAY_REF
,
2851 stabilize_reference (TREE_OPERAND (ref
, 0)),
2852 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2853 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2856 case ARRAY_RANGE_REF
:
2857 result
= build_nt (ARRAY_RANGE_REF
,
2858 stabilize_reference (TREE_OPERAND (ref
, 0)),
2859 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2860 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2864 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2865 it wouldn't be ignored. This matters when dealing with
2867 return stabilize_reference_1 (ref
);
2869 /* If arg isn't a kind of lvalue we recognize, make no change.
2870 Caller should recognize the error for an invalid lvalue. */
2875 return error_mark_node
;
2878 TREE_TYPE (result
) = TREE_TYPE (ref
);
2879 TREE_READONLY (result
) = TREE_READONLY (ref
);
2880 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2881 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2886 /* Subroutine of stabilize_reference; this is called for subtrees of
2887 references. Any expression with side-effects must be put in a SAVE_EXPR
2888 to ensure that it is only evaluated once.
2890 We don't put SAVE_EXPR nodes around everything, because assigning very
2891 simple expressions to temporaries causes us to miss good opportunities
2892 for optimizations. Among other things, the opportunity to fold in the
2893 addition of a constant into an addressing mode often gets lost, e.g.
2894 "y[i+1] += x;". In general, we take the approach that we should not make
2895 an assignment unless we are forced into it - i.e., that any non-side effect
2896 operator should be allowed, and that cse should take care of coalescing
2897 multiple utterances of the same expression should that prove fruitful. */
2900 stabilize_reference_1 (tree e
)
2903 enum tree_code code
= TREE_CODE (e
);
2905 /* We cannot ignore const expressions because it might be a reference
2906 to a const array but whose index contains side-effects. But we can
2907 ignore things that are actual constant or that already have been
2908 handled by this function. */
2910 if (tree_invariant_p (e
))
2913 switch (TREE_CODE_CLASS (code
))
2915 case tcc_exceptional
:
2917 case tcc_declaration
:
2918 case tcc_comparison
:
2920 case tcc_expression
:
2923 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2924 so that it will only be evaluated once. */
2925 /* The reference (r) and comparison (<) classes could be handled as
2926 below, but it is generally faster to only evaluate them once. */
2927 if (TREE_SIDE_EFFECTS (e
))
2928 return save_expr (e
);
2932 /* Constants need no processing. In fact, we should never reach
2937 /* Division is slow and tends to be compiled with jumps,
2938 especially the division by powers of 2 that is often
2939 found inside of an array reference. So do it just once. */
2940 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2941 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2942 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2943 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2944 return save_expr (e
);
2945 /* Recursively stabilize each operand. */
2946 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2947 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2951 /* Recursively stabilize each operand. */
2952 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2959 TREE_TYPE (result
) = TREE_TYPE (e
);
2960 TREE_READONLY (result
) = TREE_READONLY (e
);
2961 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2962 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2967 /* Low-level constructors for expressions. */
2969 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2970 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2973 recompute_tree_invariant_for_addr_expr (tree t
)
2976 bool tc
= true, se
= false;
2978 /* We started out assuming this address is both invariant and constant, but
2979 does not have side effects. Now go down any handled components and see if
2980 any of them involve offsets that are either non-constant or non-invariant.
2981 Also check for side-effects.
2983 ??? Note that this code makes no attempt to deal with the case where
2984 taking the address of something causes a copy due to misalignment. */
2986 #define UPDATE_FLAGS(NODE) \
2987 do { tree _node = (NODE); \
2988 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2989 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2991 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2992 node
= TREE_OPERAND (node
, 0))
2994 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2995 array reference (probably made temporarily by the G++ front end),
2996 so ignore all the operands. */
2997 if ((TREE_CODE (node
) == ARRAY_REF
2998 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2999 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3001 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3002 if (TREE_OPERAND (node
, 2))
3003 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3004 if (TREE_OPERAND (node
, 3))
3005 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3007 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3008 FIELD_DECL, apparently. The G++ front end can put something else
3009 there, at least temporarily. */
3010 else if (TREE_CODE (node
) == COMPONENT_REF
3011 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3013 if (TREE_OPERAND (node
, 2))
3014 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3016 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
3017 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3020 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3022 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3023 the address, since &(*a)->b is a form of addition. If it's a constant, the
3024 address is constant too. If it's a decl, its address is constant if the
3025 decl is static. Everything else is not constant and, furthermore,
3026 taking the address of a volatile variable is not volatile. */
3027 if (TREE_CODE (node
) == INDIRECT_REF
)
3028 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3029 else if (CONSTANT_CLASS_P (node
))
3031 else if (DECL_P (node
))
3032 tc
&= (staticp (node
) != NULL_TREE
);
3036 se
|= TREE_SIDE_EFFECTS (node
);
3040 TREE_CONSTANT (t
) = tc
;
3041 TREE_SIDE_EFFECTS (t
) = se
;
3045 /* Build an expression of code CODE, data type TYPE, and operands as
3046 specified. Expressions and reference nodes can be created this way.
3047 Constants, decls, types and misc nodes cannot be.
3049 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3050 enough for all extant tree codes. */
3053 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3057 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3059 t
= make_node_stat (code PASS_MEM_STAT
);
3066 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3068 int length
= sizeof (struct tree_exp
);
3069 #ifdef GATHER_STATISTICS
3070 tree_node_kind kind
;
3074 #ifdef GATHER_STATISTICS
3075 switch (TREE_CODE_CLASS (code
))
3077 case tcc_statement
: /* an expression with side effects */
3080 case tcc_reference
: /* a reference */
3088 tree_node_counts
[(int) kind
]++;
3089 tree_node_sizes
[(int) kind
] += length
;
3092 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3094 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
3096 memset (t
, 0, sizeof (struct tree_common
));
3098 TREE_SET_CODE (t
, code
);
3100 TREE_TYPE (t
) = type
;
3101 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3102 TREE_OPERAND (t
, 0) = node
;
3103 TREE_BLOCK (t
) = NULL_TREE
;
3104 if (node
&& !TYPE_P (node
))
3106 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3107 TREE_READONLY (t
) = TREE_READONLY (node
);
3110 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3111 TREE_SIDE_EFFECTS (t
) = 1;
3115 /* All of these have side-effects, no matter what their
3117 TREE_SIDE_EFFECTS (t
) = 1;
3118 TREE_READONLY (t
) = 0;
3121 case MISALIGNED_INDIRECT_REF
:
3122 case ALIGN_INDIRECT_REF
:
3124 /* Whether a dereference is readonly has nothing to do with whether
3125 its operand is readonly. */
3126 TREE_READONLY (t
) = 0;
3131 recompute_tree_invariant_for_addr_expr (t
);
3135 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3136 && node
&& !TYPE_P (node
)
3137 && TREE_CONSTANT (node
))
3138 TREE_CONSTANT (t
) = 1;
3139 if (TREE_CODE_CLASS (code
) == tcc_reference
3140 && node
&& TREE_THIS_VOLATILE (node
))
3141 TREE_THIS_VOLATILE (t
) = 1;
3148 #define PROCESS_ARG(N) \
3150 TREE_OPERAND (t, N) = arg##N; \
3151 if (arg##N &&!TYPE_P (arg##N)) \
3153 if (TREE_SIDE_EFFECTS (arg##N)) \
3155 if (!TREE_READONLY (arg##N)) \
3157 if (!TREE_CONSTANT (arg##N)) \
3163 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3165 bool constant
, read_only
, side_effects
;
3168 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3171 /* FIXME tuples: Statement's aren't expressions! */
3172 if (code
== GIMPLE_MODIFY_STMT
)
3173 return build_gimple_modify_stmt_stat (arg0
, arg1 PASS_MEM_STAT
);
3175 /* Must use build_gimple_modify_stmt to construct GIMPLE_MODIFY_STMTs. */
3176 gcc_assert (code
!= GIMPLE_MODIFY_STMT
);
3179 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3180 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
))
3181 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
&& TREE_CODE (arg1
) == INTEGER_CST
);
3183 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3184 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3185 && INTEGRAL_TYPE_P (TREE_TYPE (arg1
))
3186 && useless_type_conversion_p (sizetype
, TREE_TYPE (arg1
)));
3188 t
= make_node_stat (code PASS_MEM_STAT
);
3191 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3192 result based on those same flags for the arguments. But if the
3193 arguments aren't really even `tree' expressions, we shouldn't be trying
3196 /* Expressions without side effects may be constant if their
3197 arguments are as well. */
3198 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3199 || TREE_CODE_CLASS (code
) == tcc_binary
);
3201 side_effects
= TREE_SIDE_EFFECTS (t
);
3206 TREE_READONLY (t
) = read_only
;
3207 TREE_CONSTANT (t
) = constant
;
3208 TREE_SIDE_EFFECTS (t
) = side_effects
;
3209 TREE_THIS_VOLATILE (t
)
3210 = (TREE_CODE_CLASS (code
) == tcc_reference
3211 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3217 /* Build a GIMPLE_MODIFY_STMT node. This tree code doesn't have a
3218 type, so we can't use build2 (a.k.a. build2_stat). */
3221 build_gimple_modify_stmt_stat (tree arg0
, tree arg1 MEM_STAT_DECL
)
3225 t
= make_node_stat (GIMPLE_MODIFY_STMT PASS_MEM_STAT
);
3226 /* ?? We don't care about setting flags for tuples... */
3227 GIMPLE_STMT_OPERAND (t
, 0) = arg0
;
3228 GIMPLE_STMT_OPERAND (t
, 1) = arg1
;
3233 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3234 tree arg2 MEM_STAT_DECL
)
3236 bool constant
, read_only
, side_effects
;
3239 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3240 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3242 t
= make_node_stat (code PASS_MEM_STAT
);
3245 /* As a special exception, if COND_EXPR has NULL branches, we
3246 assume that it is a gimple statement and always consider
3247 it to have side effects. */
3248 if (code
== COND_EXPR
3249 && tt
== void_type_node
3250 && arg1
== NULL_TREE
3251 && arg2
== NULL_TREE
)
3252 side_effects
= true;
3254 side_effects
= TREE_SIDE_EFFECTS (t
);
3260 TREE_SIDE_EFFECTS (t
) = side_effects
;
3261 TREE_THIS_VOLATILE (t
)
3262 = (TREE_CODE_CLASS (code
) == tcc_reference
3263 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3269 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3270 tree arg2
, tree arg3 MEM_STAT_DECL
)
3272 bool constant
, read_only
, side_effects
;
3275 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
3277 t
= make_node_stat (code PASS_MEM_STAT
);
3280 side_effects
= TREE_SIDE_EFFECTS (t
);
3287 TREE_SIDE_EFFECTS (t
) = side_effects
;
3288 TREE_THIS_VOLATILE (t
)
3289 = (TREE_CODE_CLASS (code
) == tcc_reference
3290 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3296 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3297 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
3299 bool constant
, read_only
, side_effects
;
3302 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
3304 t
= make_node_stat (code PASS_MEM_STAT
);
3307 side_effects
= TREE_SIDE_EFFECTS (t
);
3315 TREE_SIDE_EFFECTS (t
) = side_effects
;
3316 TREE_THIS_VOLATILE (t
)
3317 = (TREE_CODE_CLASS (code
) == tcc_reference
3318 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3324 build7_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3325 tree arg2
, tree arg3
, tree arg4
, tree arg5
,
3326 tree arg6 MEM_STAT_DECL
)
3328 bool constant
, read_only
, side_effects
;
3331 gcc_assert (code
== TARGET_MEM_REF
);
3333 t
= make_node_stat (code PASS_MEM_STAT
);
3336 side_effects
= TREE_SIDE_EFFECTS (t
);
3346 TREE_SIDE_EFFECTS (t
) = side_effects
;
3347 TREE_THIS_VOLATILE (t
) = 0;
3352 /* Similar except don't specify the TREE_TYPE
3353 and leave the TREE_SIDE_EFFECTS as 0.
3354 It is permissible for arguments to be null,
3355 or even garbage if their values do not matter. */
3358 build_nt (enum tree_code code
, ...)
3365 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3369 t
= make_node (code
);
3370 length
= TREE_CODE_LENGTH (code
);
3372 for (i
= 0; i
< length
; i
++)
3373 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
3379 /* Similar to build_nt, but for creating a CALL_EXPR object with
3380 ARGLIST passed as a list. */
3383 build_nt_call_list (tree fn
, tree arglist
)
3388 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
3389 CALL_EXPR_FN (t
) = fn
;
3390 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
3391 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
3392 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
3396 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
3397 We do NOT enter this node in any sort of symbol table.
3399 layout_decl is used to set up the decl's storage layout.
3400 Other slots are initialized to 0 or null pointers. */
3403 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
3407 t
= make_node_stat (code PASS_MEM_STAT
);
3409 /* if (type == error_mark_node)
3410 type = integer_type_node; */
3411 /* That is not done, deliberately, so that having error_mark_node
3412 as the type can suppress useless errors in the use of this variable. */
3414 DECL_NAME (t
) = name
;
3415 TREE_TYPE (t
) = type
;
3417 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
3423 /* Builds and returns function declaration with NAME and TYPE. */
3426 build_fn_decl (const char *name
, tree type
)
3428 tree id
= get_identifier (name
);
3429 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
3431 DECL_EXTERNAL (decl
) = 1;
3432 TREE_PUBLIC (decl
) = 1;
3433 DECL_ARTIFICIAL (decl
) = 1;
3434 TREE_NOTHROW (decl
) = 1;
3440 /* BLOCK nodes are used to represent the structure of binding contours
3441 and declarations, once those contours have been exited and their contents
3442 compiled. This information is used for outputting debugging info. */
3445 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
3447 tree block
= make_node (BLOCK
);
3449 BLOCK_VARS (block
) = vars
;
3450 BLOCK_SUBBLOCKS (block
) = subblocks
;
3451 BLOCK_SUPERCONTEXT (block
) = supercontext
;
3452 BLOCK_CHAIN (block
) = chain
;
3457 expand_location (source_location loc
)
3459 expanded_location xloc
;
3468 const struct line_map
*map
= linemap_lookup (line_table
, loc
);
3469 xloc
.file
= map
->to_file
;
3470 xloc
.line
= SOURCE_LINE (map
, loc
);
3471 xloc
.column
= SOURCE_COLUMN (map
, loc
);
3477 /* Source location accessor functions. */
3480 /* The source location of this expression. Non-tree_exp nodes such as
3481 decls and constants can be shared among multiple locations, so
3484 expr_location (const_tree node
)
3486 if (GIMPLE_STMT_P (node
))
3487 return GIMPLE_STMT_LOCUS (node
);
3488 return EXPR_P (node
) ? node
->exp
.locus
: UNKNOWN_LOCATION
;
3492 set_expr_location (tree node
, location_t locus
)
3494 if (GIMPLE_STMT_P (node
))
3495 GIMPLE_STMT_LOCUS (node
) = locus
;
3497 EXPR_CHECK (node
)->exp
.locus
= locus
;
3501 expr_has_location (const_tree node
)
3503 return expr_location (node
) != UNKNOWN_LOCATION
;
3507 expr_locus (const_tree node
)
3509 if (GIMPLE_STMT_P (node
))
3510 return CONST_CAST (source_location
*, &GIMPLE_STMT_LOCUS (node
));
3511 return (EXPR_P (node
)
3512 ? CONST_CAST (source_location
*, &node
->exp
.locus
)
3513 : (source_location
*) NULL
);
3517 set_expr_locus (tree node
, source_location
*loc
)
3521 if (GIMPLE_STMT_P (node
))
3522 GIMPLE_STMT_LOCUS (node
) = UNKNOWN_LOCATION
;
3524 EXPR_CHECK (node
)->exp
.locus
= UNKNOWN_LOCATION
;
3528 if (GIMPLE_STMT_P (node
))
3529 GIMPLE_STMT_LOCUS (node
) = *loc
;
3531 EXPR_CHECK (node
)->exp
.locus
= *loc
;
3535 /* Return the file name of the location of NODE. */
3537 expr_filename (const_tree node
)
3539 if (GIMPLE_STMT_P (node
))
3540 return LOCATION_FILE (GIMPLE_STMT_LOCUS (node
));
3541 return LOCATION_FILE (EXPR_CHECK (node
)->exp
.locus
);
3544 /* Return the line number of the location of NODE. */
3546 expr_lineno (const_tree node
)
3548 if (GIMPLE_STMT_P (node
))
3549 return LOCATION_LINE (GIMPLE_STMT_LOCUS (node
));
3550 return LOCATION_LINE (EXPR_CHECK (node
)->exp
.locus
);
3554 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
3558 build_decl_attribute_variant (tree ddecl
, tree attribute
)
3560 DECL_ATTRIBUTES (ddecl
) = attribute
;
3564 /* Borrowed from hashtab.c iterative_hash implementation. */
3565 #define mix(a,b,c) \
3567 a -= b; a -= c; a ^= (c>>13); \
3568 b -= c; b -= a; b ^= (a<< 8); \
3569 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
3570 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
3571 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
3572 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
3573 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
3574 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
3575 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
3579 /* Produce good hash value combining VAL and VAL2. */
3580 static inline hashval_t
3581 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
3583 /* the golden ratio; an arbitrary value. */
3584 hashval_t a
= 0x9e3779b9;
3590 /* Produce good hash value combining PTR and VAL2. */
3591 static inline hashval_t
3592 iterative_hash_pointer (const void *ptr
, hashval_t val2
)
3594 if (sizeof (ptr
) == sizeof (hashval_t
))
3595 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
3598 hashval_t a
= (hashval_t
) (size_t) ptr
;
3599 /* Avoid warnings about shifting of more than the width of the type on
3600 hosts that won't execute this path. */
3602 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
3608 /* Produce good hash value combining VAL and VAL2. */
3609 static inline hashval_t
3610 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
3612 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
3613 return iterative_hash_hashval_t (val
, val2
);
3616 hashval_t a
= (hashval_t
) val
;
3617 /* Avoid warnings about shifting of more than the width of the type on
3618 hosts that won't execute this path. */
3620 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
3622 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
3624 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
3625 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
3632 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3633 is ATTRIBUTE and its qualifiers are QUALS.
3635 Record such modified types already made so we don't make duplicates. */
3638 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
3640 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3642 hashval_t hashcode
= 0;
3644 enum tree_code code
= TREE_CODE (ttype
);
3646 /* Building a distinct copy of a tagged type is inappropriate; it
3647 causes breakage in code that expects there to be a one-to-one
3648 relationship between a struct and its fields.
3649 build_duplicate_type is another solution (as used in
3650 handle_transparent_union_attribute), but that doesn't play well
3651 with the stronger C++ type identity model. */
3652 if (TREE_CODE (ttype
) == RECORD_TYPE
3653 || TREE_CODE (ttype
) == UNION_TYPE
3654 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
3655 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
3657 warning (OPT_Wattributes
,
3658 "ignoring attributes applied to %qT after definition",
3659 TYPE_MAIN_VARIANT (ttype
));
3660 return build_qualified_type (ttype
, quals
);
3663 ntype
= build_distinct_type_copy (ttype
);
3665 TYPE_ATTRIBUTES (ntype
) = attribute
;
3666 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3668 hashcode
= iterative_hash_object (code
, hashcode
);
3669 if (TREE_TYPE (ntype
))
3670 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3672 hashcode
= attribute_hash_list (attribute
, hashcode
);
3674 switch (TREE_CODE (ntype
))
3677 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3680 if (TYPE_DOMAIN (ntype
))
3681 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3685 hashcode
= iterative_hash_object
3686 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3687 hashcode
= iterative_hash_object
3688 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3691 case FIXED_POINT_TYPE
:
3693 unsigned int precision
= TYPE_PRECISION (ntype
);
3694 hashcode
= iterative_hash_object (precision
, hashcode
);
3701 ntype
= type_hash_canon (hashcode
, ntype
);
3703 /* If the target-dependent attributes make NTYPE different from
3704 its canonical type, we will need to use structural equality
3705 checks for this qualified type. */
3706 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
3707 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
3708 || !targetm
.comp_type_attributes (ntype
, ttype
))
3709 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
3711 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
3713 ttype
= build_qualified_type (ntype
, quals
);
3715 else if (TYPE_QUALS (ttype
) != quals
)
3716 ttype
= build_qualified_type (ttype
, quals
);
3722 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3725 Record such modified types already made so we don't make duplicates. */
3728 build_type_attribute_variant (tree ttype
, tree attribute
)
3730 return build_type_attribute_qual_variant (ttype
, attribute
,
3731 TYPE_QUALS (ttype
));
3734 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3737 We try both `text' and `__text__', ATTR may be either one. */
3738 /* ??? It might be a reasonable simplification to require ATTR to be only
3739 `text'. One might then also require attribute lists to be stored in
3740 their canonicalized form. */
3743 is_attribute_with_length_p (const char *attr
, int attr_len
, const_tree ident
)
3748 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3751 p
= IDENTIFIER_POINTER (ident
);
3752 ident_len
= IDENTIFIER_LENGTH (ident
);
3754 if (ident_len
== attr_len
3755 && strcmp (attr
, p
) == 0)
3758 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3761 gcc_assert (attr
[1] == '_');
3762 gcc_assert (attr
[attr_len
- 2] == '_');
3763 gcc_assert (attr
[attr_len
- 1] == '_');
3764 if (ident_len
== attr_len
- 4
3765 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3770 if (ident_len
== attr_len
+ 4
3771 && p
[0] == '_' && p
[1] == '_'
3772 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3773 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3780 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3783 We try both `text' and `__text__', ATTR may be either one. */
3786 is_attribute_p (const char *attr
, const_tree ident
)
3788 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3791 /* Given an attribute name and a list of attributes, return a pointer to the
3792 attribute's list element if the attribute is part of the list, or NULL_TREE
3793 if not found. If the attribute appears more than once, this only
3794 returns the first occurrence; the TREE_CHAIN of the return value should
3795 be passed back in if further occurrences are wanted. */
3798 lookup_attribute (const char *attr_name
, tree list
)
3801 size_t attr_len
= strlen (attr_name
);
3803 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3805 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3806 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3812 /* Remove any instances of attribute ATTR_NAME in LIST and return the
3816 remove_attribute (const char *attr_name
, tree list
)
3819 size_t attr_len
= strlen (attr_name
);
3821 for (p
= &list
; *p
; )
3824 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3825 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3826 *p
= TREE_CHAIN (l
);
3828 p
= &TREE_CHAIN (l
);
3834 /* Return an attribute list that is the union of a1 and a2. */
3837 merge_attributes (tree a1
, tree a2
)
3841 /* Either one unset? Take the set one. */
3843 if ((attributes
= a1
) == 0)
3846 /* One that completely contains the other? Take it. */
3848 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3850 if (attribute_list_contained (a2
, a1
))
3854 /* Pick the longest list, and hang on the other list. */
3856 if (list_length (a1
) < list_length (a2
))
3857 attributes
= a2
, a2
= a1
;
3859 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3862 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3865 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3868 if (TREE_VALUE (a
) != NULL
3869 && TREE_CODE (TREE_VALUE (a
)) == TREE_LIST
3870 && TREE_VALUE (a2
) != NULL
3871 && TREE_CODE (TREE_VALUE (a2
)) == TREE_LIST
)
3873 if (simple_cst_list_equal (TREE_VALUE (a
),
3874 TREE_VALUE (a2
)) == 1)
3877 else if (simple_cst_equal (TREE_VALUE (a
),
3878 TREE_VALUE (a2
)) == 1)
3883 a1
= copy_node (a2
);
3884 TREE_CHAIN (a1
) = attributes
;
3893 /* Given types T1 and T2, merge their attributes and return
3897 merge_type_attributes (tree t1
, tree t2
)
3899 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3900 TYPE_ATTRIBUTES (t2
));
3903 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3907 merge_decl_attributes (tree olddecl
, tree newdecl
)
3909 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3910 DECL_ATTRIBUTES (newdecl
));
3913 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3915 /* Specialization of merge_decl_attributes for various Windows targets.
3917 This handles the following situation:
3919 __declspec (dllimport) int foo;
3922 The second instance of `foo' nullifies the dllimport. */
3925 merge_dllimport_decl_attributes (tree old
, tree
new)
3928 int delete_dllimport_p
= 1;
3930 /* What we need to do here is remove from `old' dllimport if it doesn't
3931 appear in `new'. dllimport behaves like extern: if a declaration is
3932 marked dllimport and a definition appears later, then the object
3933 is not dllimport'd. We also remove a `new' dllimport if the old list
3934 contains dllexport: dllexport always overrides dllimport, regardless
3935 of the order of declaration. */
3936 if (!VAR_OR_FUNCTION_DECL_P (new))
3937 delete_dllimport_p
= 0;
3938 else if (DECL_DLLIMPORT_P (new)
3939 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
3941 DECL_DLLIMPORT_P (new) = 0;
3942 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
3943 "dllimport ignored", new);
3945 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new))
3947 /* Warn about overriding a symbol that has already been used. eg:
3948 extern int __attribute__ ((dllimport)) foo;
3949 int* bar () {return &foo;}
3952 if (TREE_USED (old
))
3954 warning (0, "%q+D redeclared without dllimport attribute "
3955 "after being referenced with dll linkage", new);
3956 /* If we have used a variable's address with dllimport linkage,
3957 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
3958 decl may already have had TREE_CONSTANT computed.
3959 We still remove the attribute so that assembler code refers
3960 to '&foo rather than '_imp__foo'. */
3961 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
3962 DECL_DLLIMPORT_P (new) = 1;
3965 /* Let an inline definition silently override the external reference,
3966 but otherwise warn about attribute inconsistency. */
3967 else if (TREE_CODE (new) == VAR_DECL
3968 || !DECL_DECLARED_INLINE_P (new))
3969 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
3970 "previous dllimport ignored", new);
3973 delete_dllimport_p
= 0;
3975 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new));
3977 if (delete_dllimport_p
)
3980 const size_t attr_len
= strlen ("dllimport");
3982 /* Scan the list for dllimport and delete it. */
3983 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3985 if (is_attribute_with_length_p ("dllimport", attr_len
,
3988 if (prev
== NULL_TREE
)
3991 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
4000 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
4001 struct attribute_spec.handler. */
4004 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
4009 /* These attributes may apply to structure and union types being created,
4010 but otherwise should pass to the declaration involved. */
4013 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
4014 | (int) ATTR_FLAG_ARRAY_NEXT
))
4016 *no_add_attrs
= true;
4017 return tree_cons (name
, args
, NULL_TREE
);
4019 if (TREE_CODE (node
) == RECORD_TYPE
4020 || TREE_CODE (node
) == UNION_TYPE
)
4022 node
= TYPE_NAME (node
);
4028 warning (OPT_Wattributes
, "%qs attribute ignored",
4029 IDENTIFIER_POINTER (name
));
4030 *no_add_attrs
= true;
4035 if (TREE_CODE (node
) != FUNCTION_DECL
4036 && TREE_CODE (node
) != VAR_DECL
4037 && TREE_CODE (node
) != TYPE_DECL
)
4039 *no_add_attrs
= true;
4040 warning (OPT_Wattributes
, "%qs attribute ignored",
4041 IDENTIFIER_POINTER (name
));
4045 if (TREE_CODE (node
) == TYPE_DECL
4046 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
4047 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
4049 *no_add_attrs
= true;
4050 warning (OPT_Wattributes
, "%qs attribute ignored",
4051 IDENTIFIER_POINTER (name
));
4055 /* Report error on dllimport ambiguities seen now before they cause
4057 else if (is_attribute_p ("dllimport", name
))
4059 /* Honor any target-specific overrides. */
4060 if (!targetm
.valid_dllimport_attribute_p (node
))
4061 *no_add_attrs
= true;
4063 else if (TREE_CODE (node
) == FUNCTION_DECL
4064 && DECL_DECLARED_INLINE_P (node
))
4066 warning (OPT_Wattributes
, "inline function %q+D declared as "
4067 " dllimport: attribute ignored", node
);
4068 *no_add_attrs
= true;
4070 /* Like MS, treat definition of dllimported variables and
4071 non-inlined functions on declaration as syntax errors. */
4072 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
4074 error ("function %q+D definition is marked dllimport", node
);
4075 *no_add_attrs
= true;
4078 else if (TREE_CODE (node
) == VAR_DECL
)
4080 if (DECL_INITIAL (node
))
4082 error ("variable %q+D definition is marked dllimport",
4084 *no_add_attrs
= true;
4087 /* `extern' needn't be specified with dllimport.
4088 Specify `extern' now and hope for the best. Sigh. */
4089 DECL_EXTERNAL (node
) = 1;
4090 /* Also, implicitly give dllimport'd variables declared within
4091 a function global scope, unless declared static. */
4092 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
4093 TREE_PUBLIC (node
) = 1;
4096 if (*no_add_attrs
== false)
4097 DECL_DLLIMPORT_P (node
) = 1;
4100 /* Report error if symbol is not accessible at global scope. */
4101 if (!TREE_PUBLIC (node
)
4102 && (TREE_CODE (node
) == VAR_DECL
4103 || TREE_CODE (node
) == FUNCTION_DECL
))
4105 error ("external linkage required for symbol %q+D because of "
4106 "%qs attribute", node
, IDENTIFIER_POINTER (name
));
4107 *no_add_attrs
= true;
4110 /* A dllexport'd entity must have default visibility so that other
4111 program units (shared libraries or the main executable) can see
4112 it. A dllimport'd entity must have default visibility so that
4113 the linker knows that undefined references within this program
4114 unit can be resolved by the dynamic linker. */
4117 if (DECL_VISIBILITY_SPECIFIED (node
)
4118 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
4119 error ("%qs implies default visibility, but %qD has already "
4120 "been declared with a different visibility",
4121 IDENTIFIER_POINTER (name
), node
);
4122 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
4123 DECL_VISIBILITY_SPECIFIED (node
) = 1;
4129 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
4131 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
4132 of the various TYPE_QUAL values. */
4135 set_type_quals (tree type
, int type_quals
)
4137 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
4138 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
4139 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
4142 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
4145 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
4147 return (TYPE_QUALS (cand
) == type_quals
4148 && TYPE_NAME (cand
) == TYPE_NAME (base
)
4149 /* Apparently this is needed for Objective-C. */
4150 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
4151 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
4152 TYPE_ATTRIBUTES (base
)));
4155 /* Return a version of the TYPE, qualified as indicated by the
4156 TYPE_QUALS, if one exists. If no qualified version exists yet,
4157 return NULL_TREE. */
4160 get_qualified_type (tree type
, int type_quals
)
4164 if (TYPE_QUALS (type
) == type_quals
)
4167 /* Search the chain of variants to see if there is already one there just
4168 like the one we need to have. If so, use that existing one. We must
4169 preserve the TYPE_NAME, since there is code that depends on this. */
4170 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
4171 if (check_qualified_type (t
, type
, type_quals
))
4177 /* Like get_qualified_type, but creates the type if it does not
4178 exist. This function never returns NULL_TREE. */
4181 build_qualified_type (tree type
, int type_quals
)
4185 /* See if we already have the appropriate qualified variant. */
4186 t
= get_qualified_type (type
, type_quals
);
4188 /* If not, build it. */
4191 t
= build_variant_type_copy (type
);
4192 set_type_quals (t
, type_quals
);
4194 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4195 /* Propagate structural equality. */
4196 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4197 else if (TYPE_CANONICAL (type
) != type
)
4198 /* Build the underlying canonical type, since it is different
4200 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
4203 /* T is its own canonical type. */
4204 TYPE_CANONICAL (t
) = t
;
4211 /* Create a new distinct copy of TYPE. The new type is made its own
4212 MAIN_VARIANT. If TYPE requires structural equality checks, the
4213 resulting type requires structural equality checks; otherwise, its
4214 TYPE_CANONICAL points to itself. */
4217 build_distinct_type_copy (tree type
)
4219 tree t
= copy_node (type
);
4221 TYPE_POINTER_TO (t
) = 0;
4222 TYPE_REFERENCE_TO (t
) = 0;
4224 /* Set the canonical type either to a new equivalence class, or
4225 propagate the need for structural equality checks. */
4226 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
4227 SET_TYPE_STRUCTURAL_EQUALITY (t
);
4229 TYPE_CANONICAL (t
) = t
;
4231 /* Make it its own variant. */
4232 TYPE_MAIN_VARIANT (t
) = t
;
4233 TYPE_NEXT_VARIANT (t
) = 0;
4235 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
4236 whose TREE_TYPE is not t. This can also happen in the Ada
4237 frontend when using subtypes. */
4242 /* Create a new variant of TYPE, equivalent but distinct. This is so
4243 the caller can modify it. TYPE_CANONICAL for the return type will
4244 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
4245 are considered equal by the language itself (or that both types
4246 require structural equality checks). */
4249 build_variant_type_copy (tree type
)
4251 tree t
, m
= TYPE_MAIN_VARIANT (type
);
4253 t
= build_distinct_type_copy (type
);
4255 /* Since we're building a variant, assume that it is a non-semantic
4256 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
4257 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
4259 /* Add the new type to the chain of variants of TYPE. */
4260 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
4261 TYPE_NEXT_VARIANT (m
) = t
;
4262 TYPE_MAIN_VARIANT (t
) = m
;
4267 /* Return true if the from tree in both tree maps are equal. */
4270 tree_map_base_eq (const void *va
, const void *vb
)
4272 const struct tree_map_base
*const a
= va
, *const b
= vb
;
4273 return (a
->from
== b
->from
);
4276 /* Hash a from tree in a tree_map. */
4279 tree_map_base_hash (const void *item
)
4281 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
4284 /* Return true if this tree map structure is marked for garbage collection
4285 purposes. We simply return true if the from tree is marked, so that this
4286 structure goes away when the from tree goes away. */
4289 tree_map_base_marked_p (const void *p
)
4291 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
4295 tree_map_hash (const void *item
)
4297 return (((const struct tree_map
*) item
)->hash
);
4300 /* Return the initialization priority for DECL. */
4303 decl_init_priority_lookup (tree decl
)
4305 struct tree_priority_map
*h
;
4306 struct tree_map_base in
;
4308 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
4310 h
= htab_find (init_priority_for_decl
, &in
);
4311 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
4314 /* Return the finalization priority for DECL. */
4317 decl_fini_priority_lookup (tree decl
)
4319 struct tree_priority_map
*h
;
4320 struct tree_map_base in
;
4322 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
4324 h
= htab_find (init_priority_for_decl
, &in
);
4325 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
4328 /* Return the initialization and finalization priority information for
4329 DECL. If there is no previous priority information, a freshly
4330 allocated structure is returned. */
4332 static struct tree_priority_map
*
4333 decl_priority_info (tree decl
)
4335 struct tree_priority_map in
;
4336 struct tree_priority_map
*h
;
4339 in
.base
.from
= decl
;
4340 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
4344 h
= GGC_CNEW (struct tree_priority_map
);
4346 h
->base
.from
= decl
;
4347 h
->init
= DEFAULT_INIT_PRIORITY
;
4348 h
->fini
= DEFAULT_INIT_PRIORITY
;
4354 /* Set the initialization priority for DECL to PRIORITY. */
4357 decl_init_priority_insert (tree decl
, priority_type priority
)
4359 struct tree_priority_map
*h
;
4361 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
4362 h
= decl_priority_info (decl
);
4366 /* Set the finalization priority for DECL to PRIORITY. */
4369 decl_fini_priority_insert (tree decl
, priority_type priority
)
4371 struct tree_priority_map
*h
;
4373 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
4374 h
= decl_priority_info (decl
);
4378 /* Look up a restrict qualified base decl for FROM. */
4381 decl_restrict_base_lookup (tree from
)
4386 in
.base
.from
= from
;
4387 h
= htab_find_with_hash (restrict_base_for_decl
, &in
,
4388 htab_hash_pointer (from
));
4389 return h
? h
->to
: NULL_TREE
;
4392 /* Record the restrict qualified base TO for FROM. */
4395 decl_restrict_base_insert (tree from
, tree to
)
4400 h
= ggc_alloc (sizeof (struct tree_map
));
4401 h
->hash
= htab_hash_pointer (from
);
4402 h
->base
.from
= from
;
4404 loc
= htab_find_slot_with_hash (restrict_base_for_decl
, h
, h
->hash
, INSERT
);
4405 *(struct tree_map
**) loc
= h
;
4408 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
4411 print_debug_expr_statistics (void)
4413 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
4414 (long) htab_size (debug_expr_for_decl
),
4415 (long) htab_elements (debug_expr_for_decl
),
4416 htab_collisions (debug_expr_for_decl
));
4419 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
4422 print_value_expr_statistics (void)
4424 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
4425 (long) htab_size (value_expr_for_decl
),
4426 (long) htab_elements (value_expr_for_decl
),
4427 htab_collisions (value_expr_for_decl
));
4430 /* Print out statistics for the RESTRICT_BASE_FOR_DECL hash table, but
4431 don't print anything if the table is empty. */
4434 print_restrict_base_statistics (void)
4436 if (htab_elements (restrict_base_for_decl
) != 0)
4438 "RESTRICT_BASE hash: size %ld, %ld elements, %f collisions\n",
4439 (long) htab_size (restrict_base_for_decl
),
4440 (long) htab_elements (restrict_base_for_decl
),
4441 htab_collisions (restrict_base_for_decl
));
4444 /* Lookup a debug expression for FROM, and return it if we find one. */
4447 decl_debug_expr_lookup (tree from
)
4449 struct tree_map
*h
, in
;
4450 in
.base
.from
= from
;
4452 h
= htab_find_with_hash (debug_expr_for_decl
, &in
, htab_hash_pointer (from
));
4458 /* Insert a mapping FROM->TO in the debug expression hashtable. */
4461 decl_debug_expr_insert (tree from
, tree to
)
4466 h
= ggc_alloc (sizeof (struct tree_map
));
4467 h
->hash
= htab_hash_pointer (from
);
4468 h
->base
.from
= from
;
4470 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
4471 *(struct tree_map
**) loc
= h
;
4474 /* Lookup a value expression for FROM, and return it if we find one. */
4477 decl_value_expr_lookup (tree from
)
4479 struct tree_map
*h
, in
;
4480 in
.base
.from
= from
;
4482 h
= htab_find_with_hash (value_expr_for_decl
, &in
, htab_hash_pointer (from
));
4488 /* Insert a mapping FROM->TO in the value expression hashtable. */
4491 decl_value_expr_insert (tree from
, tree to
)
4496 h
= ggc_alloc (sizeof (struct tree_map
));
4497 h
->hash
= htab_hash_pointer (from
);
4498 h
->base
.from
= from
;
4500 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
4501 *(struct tree_map
**) loc
= h
;
4504 /* Hashing of types so that we don't make duplicates.
4505 The entry point is `type_hash_canon'. */
4507 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
4508 with types in the TREE_VALUE slots), by adding the hash codes
4509 of the individual types. */
4512 type_hash_list (const_tree list
, hashval_t hashcode
)
4516 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4517 if (TREE_VALUE (tail
) != error_mark_node
)
4518 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
4524 /* These are the Hashtable callback functions. */
4526 /* Returns true iff the types are equivalent. */
4529 type_hash_eq (const void *va
, const void *vb
)
4531 const struct type_hash
*const a
= va
, *const b
= vb
;
4533 /* First test the things that are the same for all types. */
4534 if (a
->hash
!= b
->hash
4535 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
4536 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
4537 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
4538 TYPE_ATTRIBUTES (b
->type
))
4539 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
4540 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
4543 switch (TREE_CODE (a
->type
))
4548 case REFERENCE_TYPE
:
4552 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
4555 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
4556 && !(TYPE_VALUES (a
->type
)
4557 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
4558 && TYPE_VALUES (b
->type
)
4559 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
4560 && type_list_equal (TYPE_VALUES (a
->type
),
4561 TYPE_VALUES (b
->type
))))
4564 /* ... fall through ... */
4569 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
4570 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
4571 TYPE_MAX_VALUE (b
->type
)))
4572 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
4573 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
4574 TYPE_MIN_VALUE (b
->type
))));
4576 case FIXED_POINT_TYPE
:
4577 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
4580 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
4583 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
4584 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4585 || (TYPE_ARG_TYPES (a
->type
)
4586 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4587 && TYPE_ARG_TYPES (b
->type
)
4588 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4589 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4590 TYPE_ARG_TYPES (b
->type
)))));
4593 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
4597 case QUAL_UNION_TYPE
:
4598 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
4599 || (TYPE_FIELDS (a
->type
)
4600 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
4601 && TYPE_FIELDS (b
->type
)
4602 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
4603 && type_list_equal (TYPE_FIELDS (a
->type
),
4604 TYPE_FIELDS (b
->type
))));
4607 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
4608 || (TYPE_ARG_TYPES (a
->type
)
4609 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
4610 && TYPE_ARG_TYPES (b
->type
)
4611 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
4612 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
4613 TYPE_ARG_TYPES (b
->type
))))
4621 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
4622 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
4627 /* Return the cached hash value. */
4630 type_hash_hash (const void *item
)
4632 return ((const struct type_hash
*) item
)->hash
;
4635 /* Look in the type hash table for a type isomorphic to TYPE.
4636 If one is found, return it. Otherwise return 0. */
4639 type_hash_lookup (hashval_t hashcode
, tree type
)
4641 struct type_hash
*h
, in
;
4643 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
4644 must call that routine before comparing TYPE_ALIGNs. */
4650 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
4656 /* Add an entry to the type-hash-table
4657 for a type TYPE whose hash code is HASHCODE. */
4660 type_hash_add (hashval_t hashcode
, tree type
)
4662 struct type_hash
*h
;
4665 h
= ggc_alloc (sizeof (struct type_hash
));
4668 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
4672 /* Given TYPE, and HASHCODE its hash code, return the canonical
4673 object for an identical type if one already exists.
4674 Otherwise, return TYPE, and record it as the canonical object.
4676 To use this function, first create a type of the sort you want.
4677 Then compute its hash code from the fields of the type that
4678 make it different from other similar types.
4679 Then call this function and use the value. */
4682 type_hash_canon (unsigned int hashcode
, tree type
)
4686 /* The hash table only contains main variants, so ensure that's what we're
4688 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
4690 if (!lang_hooks
.types
.hash_types
)
4693 /* See if the type is in the hash table already. If so, return it.
4694 Otherwise, add the type. */
4695 t1
= type_hash_lookup (hashcode
, type
);
4698 #ifdef GATHER_STATISTICS
4699 tree_node_counts
[(int) t_kind
]--;
4700 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
4706 type_hash_add (hashcode
, type
);
4711 /* See if the data pointed to by the type hash table is marked. We consider
4712 it marked if the type is marked or if a debug type number or symbol
4713 table entry has been made for the type. This reduces the amount of
4714 debugging output and eliminates that dependency of the debug output on
4715 the number of garbage collections. */
4718 type_hash_marked_p (const void *p
)
4720 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
4722 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
4726 print_type_hash_statistics (void)
4728 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
4729 (long) htab_size (type_hash_table
),
4730 (long) htab_elements (type_hash_table
),
4731 htab_collisions (type_hash_table
));
4734 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
4735 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
4736 by adding the hash codes of the individual attributes. */
4739 attribute_hash_list (const_tree list
, hashval_t hashcode
)
4743 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
4744 /* ??? Do we want to add in TREE_VALUE too? */
4745 hashcode
= iterative_hash_object
4746 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
4750 /* Given two lists of attributes, return true if list l2 is
4751 equivalent to l1. */
4754 attribute_list_equal (const_tree l1
, const_tree l2
)
4756 return attribute_list_contained (l1
, l2
)
4757 && attribute_list_contained (l2
, l1
);
4760 /* Given two lists of attributes, return true if list L2 is
4761 completely contained within L1. */
4762 /* ??? This would be faster if attribute names were stored in a canonicalized
4763 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
4764 must be used to show these elements are equivalent (which they are). */
4765 /* ??? It's not clear that attributes with arguments will always be handled
4769 attribute_list_contained (const_tree l1
, const_tree l2
)
4773 /* First check the obvious, maybe the lists are identical. */
4777 /* Maybe the lists are similar. */
4778 for (t1
= l1
, t2
= l2
;
4780 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
4781 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
4782 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
4784 /* Maybe the lists are equal. */
4785 if (t1
== 0 && t2
== 0)
4788 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
4791 /* This CONST_CAST is okay because lookup_attribute does not
4792 modify its argument and the return value is assigned to a
4794 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4795 CONST_CAST_TREE(l1
));
4797 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
4800 if (TREE_VALUE (t2
) != NULL
4801 && TREE_CODE (TREE_VALUE (t2
)) == TREE_LIST
4802 && TREE_VALUE (attr
) != NULL
4803 && TREE_CODE (TREE_VALUE (attr
)) == TREE_LIST
)
4805 if (simple_cst_list_equal (TREE_VALUE (t2
),
4806 TREE_VALUE (attr
)) == 1)
4809 else if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
4820 /* Given two lists of types
4821 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
4822 return 1 if the lists contain the same types in the same order.
4823 Also, the TREE_PURPOSEs must match. */
4826 type_list_equal (const_tree l1
, const_tree l2
)
4830 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
4831 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
4832 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
4833 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
4834 && (TREE_TYPE (TREE_PURPOSE (t1
))
4835 == TREE_TYPE (TREE_PURPOSE (t2
))))))
4841 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
4842 given by TYPE. If the argument list accepts variable arguments,
4843 then this function counts only the ordinary arguments. */
4846 type_num_arguments (const_tree type
)
4851 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
4852 /* If the function does not take a variable number of arguments,
4853 the last element in the list will have type `void'. */
4854 if (VOID_TYPE_P (TREE_VALUE (t
)))
4862 /* Nonzero if integer constants T1 and T2
4863 represent the same constant value. */
4866 tree_int_cst_equal (const_tree t1
, const_tree t2
)
4871 if (t1
== 0 || t2
== 0)
4874 if (TREE_CODE (t1
) == INTEGER_CST
4875 && TREE_CODE (t2
) == INTEGER_CST
4876 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4877 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
4883 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
4884 The precise way of comparison depends on their data type. */
4887 tree_int_cst_lt (const_tree t1
, const_tree t2
)
4892 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
4894 int t1_sgn
= tree_int_cst_sgn (t1
);
4895 int t2_sgn
= tree_int_cst_sgn (t2
);
4897 if (t1_sgn
< t2_sgn
)
4899 else if (t1_sgn
> t2_sgn
)
4901 /* Otherwise, both are non-negative, so we compare them as
4902 unsigned just in case one of them would overflow a signed
4905 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
4906 return INT_CST_LT (t1
, t2
);
4908 return INT_CST_LT_UNSIGNED (t1
, t2
);
4911 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
4914 tree_int_cst_compare (const_tree t1
, const_tree t2
)
4916 if (tree_int_cst_lt (t1
, t2
))
4918 else if (tree_int_cst_lt (t2
, t1
))
4924 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
4925 the host. If POS is zero, the value can be represented in a single
4926 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
4927 be represented in a single unsigned HOST_WIDE_INT. */
4930 host_integerp (const_tree t
, int pos
)
4932 return (TREE_CODE (t
) == INTEGER_CST
4933 && ((TREE_INT_CST_HIGH (t
) == 0
4934 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
4935 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
4936 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
4937 && (!TYPE_UNSIGNED (TREE_TYPE (t
))
4938 || (TREE_CODE (TREE_TYPE (t
)) == INTEGER_TYPE
4939 && TYPE_IS_SIZETYPE (TREE_TYPE (t
)))))
4940 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
4943 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4944 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4945 be non-negative. We must be able to satisfy the above conditions. */
4948 tree_low_cst (const_tree t
, int pos
)
4950 gcc_assert (host_integerp (t
, pos
));
4951 return TREE_INT_CST_LOW (t
);
4954 /* Return the most significant bit of the integer constant T. */
4957 tree_int_cst_msb (const_tree t
)
4961 unsigned HOST_WIDE_INT l
;
4963 /* Note that using TYPE_PRECISION here is wrong. We care about the
4964 actual bits, not the (arbitrary) range of the type. */
4965 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
4966 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
4967 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
4968 return (l
& 1) == 1;
4971 /* Return an indication of the sign of the integer constant T.
4972 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4973 Note that -1 will never be returned if T's type is unsigned. */
4976 tree_int_cst_sgn (const_tree t
)
4978 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
4980 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
4982 else if (TREE_INT_CST_HIGH (t
) < 0)
4988 /* Compare two constructor-element-type constants. Return 1 if the lists
4989 are known to be equal; otherwise return 0. */
4992 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4994 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4996 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4999 l1
= TREE_CHAIN (l1
);
5000 l2
= TREE_CHAIN (l2
);
5006 /* Return truthvalue of whether T1 is the same tree structure as T2.
5007 Return 1 if they are the same.
5008 Return 0 if they are understandably different.
5009 Return -1 if either contains tree structure not understood by
5013 simple_cst_equal (const_tree t1
, const_tree t2
)
5015 enum tree_code code1
, code2
;
5021 if (t1
== 0 || t2
== 0)
5024 code1
= TREE_CODE (t1
);
5025 code2
= TREE_CODE (t2
);
5027 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
5029 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
5030 || code2
== NON_LVALUE_EXPR
)
5031 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5033 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
5036 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
5037 || code2
== NON_LVALUE_EXPR
)
5038 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
5046 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
5047 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
5050 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
5053 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
5056 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
5057 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
5058 TREE_STRING_LENGTH (t1
)));
5062 unsigned HOST_WIDE_INT idx
;
5063 VEC(constructor_elt
, gc
) *v1
= CONSTRUCTOR_ELTS (t1
);
5064 VEC(constructor_elt
, gc
) *v2
= CONSTRUCTOR_ELTS (t2
);
5066 if (VEC_length (constructor_elt
, v1
) != VEC_length (constructor_elt
, v2
))
5069 for (idx
= 0; idx
< VEC_length (constructor_elt
, v1
); ++idx
)
5070 /* ??? Should we handle also fields here? */
5071 if (!simple_cst_equal (VEC_index (constructor_elt
, v1
, idx
)->value
,
5072 VEC_index (constructor_elt
, v2
, idx
)->value
))
5078 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5081 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
5084 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
5087 const_tree arg1
, arg2
;
5088 const_call_expr_arg_iterator iter1
, iter2
;
5089 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
5090 arg2
= first_const_call_expr_arg (t2
, &iter2
);
5092 arg1
= next_const_call_expr_arg (&iter1
),
5093 arg2
= next_const_call_expr_arg (&iter2
))
5095 cmp
= simple_cst_equal (arg1
, arg2
);
5099 return arg1
== arg2
;
5103 /* Special case: if either target is an unallocated VAR_DECL,
5104 it means that it's going to be unified with whatever the
5105 TARGET_EXPR is really supposed to initialize, so treat it
5106 as being equivalent to anything. */
5107 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
5108 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
5109 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
5110 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
5111 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
5112 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
5115 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5120 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
5122 case WITH_CLEANUP_EXPR
:
5123 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5127 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
5130 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
5131 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
5145 /* This general rule works for most tree codes. All exceptions should be
5146 handled above. If this is a language-specific tree code, we can't
5147 trust what might be in the operand, so say we don't know
5149 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
5152 switch (TREE_CODE_CLASS (code1
))
5156 case tcc_comparison
:
5157 case tcc_expression
:
5161 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
5163 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
5175 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
5176 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
5177 than U, respectively. */
5180 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
5182 if (tree_int_cst_sgn (t
) < 0)
5184 else if (TREE_INT_CST_HIGH (t
) != 0)
5186 else if (TREE_INT_CST_LOW (t
) == u
)
5188 else if (TREE_INT_CST_LOW (t
) < u
)
5194 /* Return true if CODE represents an associative tree code. Otherwise
5197 associative_tree_code (enum tree_code code
)
5216 /* Return true if CODE represents a commutative tree code. Otherwise
5219 commutative_tree_code (enum tree_code code
)
5232 case UNORDERED_EXPR
:
5236 case TRUTH_AND_EXPR
:
5237 case TRUTH_XOR_EXPR
:
5247 /* Generate a hash value for an expression. This can be used iteratively
5248 by passing a previous result as the "val" argument.
5250 This function is intended to produce the same hash for expressions which
5251 would compare equal using operand_equal_p. */
5254 iterative_hash_expr (const_tree t
, hashval_t val
)
5257 enum tree_code code
;
5261 return iterative_hash_pointer (t
, val
);
5263 code
= TREE_CODE (t
);
5267 /* Alas, constants aren't shared, so we can't rely on pointer
5270 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
5271 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
5274 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
5276 return iterative_hash_hashval_t (val2
, val
);
5280 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
5282 return iterative_hash_hashval_t (val2
, val
);
5285 return iterative_hash (TREE_STRING_POINTER (t
),
5286 TREE_STRING_LENGTH (t
), val
);
5288 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
5289 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
5291 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
5295 /* we can just compare by pointer. */
5296 return iterative_hash_pointer (t
, val
);
5299 /* A list of expressions, for a CALL_EXPR or as the elements of a
5301 for (; t
; t
= TREE_CHAIN (t
))
5302 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
5306 unsigned HOST_WIDE_INT idx
;
5308 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
5310 val
= iterative_hash_expr (field
, val
);
5311 val
= iterative_hash_expr (value
, val
);
5316 /* When referring to a built-in FUNCTION_DECL, use the
5317 __builtin__ form. Otherwise nodes that compare equal
5318 according to operand_equal_p might get different
5320 if (DECL_BUILT_IN (t
))
5322 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
5326 /* else FALL THROUGH */
5328 class = TREE_CODE_CLASS (code
);
5330 if (class == tcc_declaration
)
5332 /* DECL's have a unique ID */
5333 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
5337 gcc_assert (IS_EXPR_CODE_CLASS (class));
5339 val
= iterative_hash_object (code
, val
);
5341 /* Don't hash the type, that can lead to having nodes which
5342 compare equal according to operand_equal_p, but which
5343 have different hash codes. */
5344 if (code
== NOP_EXPR
5345 || code
== CONVERT_EXPR
5346 || code
== NON_LVALUE_EXPR
)
5348 /* Make sure to include signness in the hash computation. */
5349 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
5350 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
5353 else if (commutative_tree_code (code
))
5355 /* It's a commutative expression. We want to hash it the same
5356 however it appears. We do this by first hashing both operands
5357 and then rehashing based on the order of their independent
5359 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
5360 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
5364 t
= one
, one
= two
, two
= t
;
5366 val
= iterative_hash_hashval_t (one
, val
);
5367 val
= iterative_hash_hashval_t (two
, val
);
5370 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
5371 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
5378 /* Constructors for pointer, array and function types.
5379 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
5380 constructed by language-dependent code, not here.) */
5382 /* Construct, lay out and return the type of pointers to TO_TYPE with
5383 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
5384 reference all of memory. If such a type has already been
5385 constructed, reuse it. */
5388 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
5393 if (to_type
== error_mark_node
)
5394 return error_mark_node
;
5396 /* In some cases, languages will have things that aren't a POINTER_TYPE
5397 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
5398 In that case, return that type without regard to the rest of our
5401 ??? This is a kludge, but consistent with the way this function has
5402 always operated and there doesn't seem to be a good way to avoid this
5404 if (TYPE_POINTER_TO (to_type
) != 0
5405 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
5406 return TYPE_POINTER_TO (to_type
);
5408 /* First, if we already have a type for pointers to TO_TYPE and it's
5409 the proper mode, use it. */
5410 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
5411 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5414 t
= make_node (POINTER_TYPE
);
5416 TREE_TYPE (t
) = to_type
;
5417 TYPE_MODE (t
) = mode
;
5418 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5419 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
5420 TYPE_POINTER_TO (to_type
) = t
;
5422 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5423 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5424 else if (TYPE_CANONICAL (to_type
) != to_type
)
5426 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
5427 mode
, can_alias_all
);
5429 /* Lay out the type. This function has many callers that are concerned
5430 with expression-construction, and this simplifies them all. */
5436 /* By default build pointers in ptr_mode. */
5439 build_pointer_type (tree to_type
)
5441 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
5444 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
5447 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
5452 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
5453 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
5454 In that case, return that type without regard to the rest of our
5457 ??? This is a kludge, but consistent with the way this function has
5458 always operated and there doesn't seem to be a good way to avoid this
5460 if (TYPE_REFERENCE_TO (to_type
) != 0
5461 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
5462 return TYPE_REFERENCE_TO (to_type
);
5464 /* First, if we already have a type for pointers to TO_TYPE and it's
5465 the proper mode, use it. */
5466 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
5467 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
5470 t
= make_node (REFERENCE_TYPE
);
5472 TREE_TYPE (t
) = to_type
;
5473 TYPE_MODE (t
) = mode
;
5474 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
5475 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
5476 TYPE_REFERENCE_TO (to_type
) = t
;
5478 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
5479 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5480 else if (TYPE_CANONICAL (to_type
) != to_type
)
5482 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
5483 mode
, can_alias_all
);
5491 /* Build the node for the type of references-to-TO_TYPE by default
5495 build_reference_type (tree to_type
)
5497 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
5500 /* Build a type that is compatible with t but has no cv quals anywhere
5503 const char *const *const * -> char ***. */
5506 build_type_no_quals (tree t
)
5508 switch (TREE_CODE (t
))
5511 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5513 TYPE_REF_CAN_ALIAS_ALL (t
));
5514 case REFERENCE_TYPE
:
5516 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
5518 TYPE_REF_CAN_ALIAS_ALL (t
));
5520 return TYPE_MAIN_VARIANT (t
);
5524 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
5525 MAXVAL should be the maximum value in the domain
5526 (one less than the length of the array).
5528 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
5529 We don't enforce this limit, that is up to caller (e.g. language front end).
5530 The limit exists because the result is a signed type and we don't handle
5531 sizes that use more than one HOST_WIDE_INT. */
5534 build_index_type (tree maxval
)
5536 tree itype
= make_node (INTEGER_TYPE
);
5538 TREE_TYPE (itype
) = sizetype
;
5539 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
5540 TYPE_MIN_VALUE (itype
) = size_zero_node
;
5541 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
5542 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
5543 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
5544 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
5545 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
5546 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
5548 if (host_integerp (maxval
, 1))
5549 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
5552 /* Since we cannot hash this type, we need to compare it using
5553 structural equality checks. */
5554 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
5559 /* Builds a signed or unsigned integer type of precision PRECISION.
5560 Used for C bitfields whose precision does not match that of
5561 built-in target types. */
5563 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
5566 tree itype
= make_node (INTEGER_TYPE
);
5568 TYPE_PRECISION (itype
) = precision
;
5571 fixup_unsigned_type (itype
);
5573 fixup_signed_type (itype
);
5575 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
5576 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
5581 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
5582 ENUMERAL_TYPE or BOOLEAN_TYPE), with low bound LOWVAL and
5583 high bound HIGHVAL. If TYPE is NULL, sizetype is used. */
5586 build_range_type (tree type
, tree lowval
, tree highval
)
5588 tree itype
= make_node (INTEGER_TYPE
);
5590 TREE_TYPE (itype
) = type
;
5591 if (type
== NULL_TREE
)
5594 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
5595 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
5597 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
5598 TYPE_MODE (itype
) = TYPE_MODE (type
);
5599 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
5600 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
5601 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
5602 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
5604 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
5605 return type_hash_canon (tree_low_cst (highval
, 0)
5606 - tree_low_cst (lowval
, 0),
5612 /* Just like build_index_type, but takes lowval and highval instead
5613 of just highval (maxval). */
5616 build_index_2_type (tree lowval
, tree highval
)
5618 return build_range_type (sizetype
, lowval
, highval
);
5621 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
5622 and number of elements specified by the range of values of INDEX_TYPE.
5623 If such a type has already been constructed, reuse it. */
5626 build_array_type (tree elt_type
, tree index_type
)
5629 hashval_t hashcode
= 0;
5631 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
5633 error ("arrays of functions are not meaningful");
5634 elt_type
= integer_type_node
;
5637 t
= make_node (ARRAY_TYPE
);
5638 TREE_TYPE (t
) = elt_type
;
5639 TYPE_DOMAIN (t
) = index_type
;
5641 if (index_type
== 0)
5644 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5645 t
= type_hash_canon (hashcode
, t
);
5649 if (TYPE_CANONICAL (t
) == t
)
5651 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
))
5652 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5653 else if (TYPE_CANONICAL (elt_type
) != elt_type
)
5655 = build_array_type (TYPE_CANONICAL (elt_type
), index_type
);
5661 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
5662 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
5663 t
= type_hash_canon (hashcode
, t
);
5665 if (!COMPLETE_TYPE_P (t
))
5668 if (TYPE_CANONICAL (t
) == t
)
5670 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
5671 || TYPE_STRUCTURAL_EQUALITY_P (index_type
))
5672 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5673 else if (TYPE_CANONICAL (elt_type
) != elt_type
5674 || TYPE_CANONICAL (index_type
) != index_type
)
5676 = build_array_type (TYPE_CANONICAL (elt_type
),
5677 TYPE_CANONICAL (index_type
));
5683 /* Return the TYPE of the elements comprising
5684 the innermost dimension of ARRAY. */
5687 get_inner_array_type (const_tree array
)
5689 tree type
= TREE_TYPE (array
);
5691 while (TREE_CODE (type
) == ARRAY_TYPE
)
5692 type
= TREE_TYPE (type
);
5697 /* Computes the canonical argument types from the argument type list
5700 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
5701 on entry to this function, or if any of the ARGTYPES are
5704 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
5705 true on entry to this function, or if any of the ARGTYPES are
5708 Returns a canonical argument list, which may be ARGTYPES when the
5709 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
5710 true) or would not differ from ARGTYPES. */
5713 maybe_canonicalize_argtypes(tree argtypes
,
5714 bool *any_structural_p
,
5715 bool *any_noncanonical_p
)
5718 bool any_noncanonical_argtypes_p
= false;
5720 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
5722 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
5723 /* Fail gracefully by stating that the type is structural. */
5724 *any_structural_p
= true;
5725 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
5726 *any_structural_p
= true;
5727 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
5728 || TREE_PURPOSE (arg
))
5729 /* If the argument has a default argument, we consider it
5730 non-canonical even though the type itself is canonical.
5731 That way, different variants of function and method types
5732 with default arguments will all point to the variant with
5733 no defaults as their canonical type. */
5734 any_noncanonical_argtypes_p
= true;
5737 if (*any_structural_p
)
5740 if (any_noncanonical_argtypes_p
)
5742 /* Build the canonical list of argument types. */
5743 tree canon_argtypes
= NULL_TREE
;
5744 bool is_void
= false;
5746 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
5748 if (arg
== void_list_node
)
5751 canon_argtypes
= tree_cons (NULL_TREE
,
5752 TYPE_CANONICAL (TREE_VALUE (arg
)),
5756 canon_argtypes
= nreverse (canon_argtypes
);
5758 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
5760 /* There is a non-canonical type. */
5761 *any_noncanonical_p
= true;
5762 return canon_argtypes
;
5765 /* The canonical argument types are the same as ARGTYPES. */
5769 /* Construct, lay out and return
5770 the type of functions returning type VALUE_TYPE
5771 given arguments of types ARG_TYPES.
5772 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
5773 are data type nodes for the arguments of the function.
5774 If such a type has already been constructed, reuse it. */
5777 build_function_type (tree value_type
, tree arg_types
)
5780 hashval_t hashcode
= 0;
5781 bool any_structural_p
, any_noncanonical_p
;
5782 tree canon_argtypes
;
5784 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
5786 error ("function return type cannot be function");
5787 value_type
= integer_type_node
;
5790 /* Make a node of the sort we want. */
5791 t
= make_node (FUNCTION_TYPE
);
5792 TREE_TYPE (t
) = value_type
;
5793 TYPE_ARG_TYPES (t
) = arg_types
;
5795 /* If we already have such a type, use the old one. */
5796 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
5797 hashcode
= type_hash_list (arg_types
, hashcode
);
5798 t
= type_hash_canon (hashcode
, t
);
5800 /* Set up the canonical type. */
5801 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
5802 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
5803 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
5805 &any_noncanonical_p
);
5806 if (any_structural_p
)
5807 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5808 else if (any_noncanonical_p
)
5809 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
5812 if (!COMPLETE_TYPE_P (t
))
5817 /* Build a function type. The RETURN_TYPE is the type returned by the
5818 function. If additional arguments are provided, they are
5819 additional argument types. The list of argument types must always
5820 be terminated by NULL_TREE. */
5823 build_function_type_list (tree return_type
, ...)
5828 va_start (p
, return_type
);
5830 t
= va_arg (p
, tree
);
5831 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
5832 args
= tree_cons (NULL_TREE
, t
, args
);
5834 if (args
== NULL_TREE
)
5835 args
= void_list_node
;
5839 args
= nreverse (args
);
5840 TREE_CHAIN (last
) = void_list_node
;
5842 args
= build_function_type (return_type
, args
);
5848 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
5849 and ARGTYPES (a TREE_LIST) are the return type and arguments types
5850 for the method. An implicit additional parameter (of type
5851 pointer-to-BASETYPE) is added to the ARGTYPES. */
5854 build_method_type_directly (tree basetype
,
5861 bool any_structural_p
, any_noncanonical_p
;
5862 tree canon_argtypes
;
5864 /* Make a node of the sort we want. */
5865 t
= make_node (METHOD_TYPE
);
5867 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5868 TREE_TYPE (t
) = rettype
;
5869 ptype
= build_pointer_type (basetype
);
5871 /* The actual arglist for this function includes a "hidden" argument
5872 which is "this". Put it into the list of argument types. */
5873 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
5874 TYPE_ARG_TYPES (t
) = argtypes
;
5876 /* If we already have such a type, use the old one. */
5877 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5878 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
5879 hashcode
= type_hash_list (argtypes
, hashcode
);
5880 t
= type_hash_canon (hashcode
, t
);
5882 /* Set up the canonical type. */
5884 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
5885 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
5887 = (TYPE_CANONICAL (basetype
) != basetype
5888 || TYPE_CANONICAL (rettype
) != rettype
);
5889 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
5891 &any_noncanonical_p
);
5892 if (any_structural_p
)
5893 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5894 else if (any_noncanonical_p
)
5896 = build_method_type_directly (TYPE_CANONICAL (basetype
),
5897 TYPE_CANONICAL (rettype
),
5899 if (!COMPLETE_TYPE_P (t
))
5905 /* Construct, lay out and return the type of methods belonging to class
5906 BASETYPE and whose arguments and values are described by TYPE.
5907 If that type exists already, reuse it.
5908 TYPE must be a FUNCTION_TYPE node. */
5911 build_method_type (tree basetype
, tree type
)
5913 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
5915 return build_method_type_directly (basetype
,
5917 TYPE_ARG_TYPES (type
));
5920 /* Construct, lay out and return the type of offsets to a value
5921 of type TYPE, within an object of type BASETYPE.
5922 If a suitable offset type exists already, reuse it. */
5925 build_offset_type (tree basetype
, tree type
)
5928 hashval_t hashcode
= 0;
5930 /* Make a node of the sort we want. */
5931 t
= make_node (OFFSET_TYPE
);
5933 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
5934 TREE_TYPE (t
) = type
;
5936 /* If we already have such a type, use the old one. */
5937 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
5938 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
5939 t
= type_hash_canon (hashcode
, t
);
5941 if (!COMPLETE_TYPE_P (t
))
5944 if (TYPE_CANONICAL (t
) == t
)
5946 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
5947 || TYPE_STRUCTURAL_EQUALITY_P (type
))
5948 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5949 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
5950 || TYPE_CANONICAL (type
) != type
)
5952 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
5953 TYPE_CANONICAL (type
));
5959 /* Create a complex type whose components are COMPONENT_TYPE. */
5962 build_complex_type (tree component_type
)
5967 /* Make a node of the sort we want. */
5968 t
= make_node (COMPLEX_TYPE
);
5970 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
5972 /* If we already have such a type, use the old one. */
5973 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
5974 t
= type_hash_canon (hashcode
, t
);
5976 if (!COMPLETE_TYPE_P (t
))
5979 if (TYPE_CANONICAL (t
) == t
)
5981 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
5982 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5983 else if (TYPE_CANONICAL (component_type
) != component_type
)
5985 = build_complex_type (TYPE_CANONICAL (component_type
));
5988 /* We need to create a name, since complex is a fundamental type. */
5989 if (! TYPE_NAME (t
))
5992 if (component_type
== char_type_node
)
5993 name
= "complex char";
5994 else if (component_type
== signed_char_type_node
)
5995 name
= "complex signed char";
5996 else if (component_type
== unsigned_char_type_node
)
5997 name
= "complex unsigned char";
5998 else if (component_type
== short_integer_type_node
)
5999 name
= "complex short int";
6000 else if (component_type
== short_unsigned_type_node
)
6001 name
= "complex short unsigned int";
6002 else if (component_type
== integer_type_node
)
6003 name
= "complex int";
6004 else if (component_type
== unsigned_type_node
)
6005 name
= "complex unsigned int";
6006 else if (component_type
== long_integer_type_node
)
6007 name
= "complex long int";
6008 else if (component_type
== long_unsigned_type_node
)
6009 name
= "complex long unsigned int";
6010 else if (component_type
== long_long_integer_type_node
)
6011 name
= "complex long long int";
6012 else if (component_type
== long_long_unsigned_type_node
)
6013 name
= "complex long long unsigned int";
6018 TYPE_NAME (t
) = build_decl (TYPE_DECL
, get_identifier (name
), t
);
6021 return build_qualified_type (t
, TYPE_QUALS (component_type
));
6024 /* Return OP, stripped of any conversions to wider types as much as is safe.
6025 Converting the value back to OP's type makes a value equivalent to OP.
6027 If FOR_TYPE is nonzero, we return a value which, if converted to
6028 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
6030 OP must have integer, real or enumeral type. Pointers are not allowed!
6032 There are some cases where the obvious value we could return
6033 would regenerate to OP if converted to OP's type,
6034 but would not extend like OP to wider types.
6035 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
6036 For example, if OP is (unsigned short)(signed char)-1,
6037 we avoid returning (signed char)-1 if FOR_TYPE is int,
6038 even though extending that to an unsigned short would regenerate OP,
6039 since the result of extending (signed char)-1 to (int)
6040 is different from (int) OP. */
6043 get_unwidened (tree op
, tree for_type
)
6045 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
6046 tree type
= TREE_TYPE (op
);
6048 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
6050 = (for_type
!= 0 && for_type
!= type
6051 && final_prec
> TYPE_PRECISION (type
)
6052 && TYPE_UNSIGNED (type
));
6055 while (CONVERT_EXPR_P (op
))
6059 /* TYPE_PRECISION on vector types has different meaning
6060 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
6061 so avoid them here. */
6062 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
6065 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
6066 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
6068 /* Truncations are many-one so cannot be removed.
6069 Unless we are later going to truncate down even farther. */
6071 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
6074 /* See what's inside this conversion. If we decide to strip it,
6076 op
= TREE_OPERAND (op
, 0);
6078 /* If we have not stripped any zero-extensions (uns is 0),
6079 we can strip any kind of extension.
6080 If we have previously stripped a zero-extension,
6081 only zero-extensions can safely be stripped.
6082 Any extension can be stripped if the bits it would produce
6083 are all going to be discarded later by truncating to FOR_TYPE. */
6087 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
6089 /* TYPE_UNSIGNED says whether this is a zero-extension.
6090 Let's avoid computing it if it does not affect WIN
6091 and if UNS will not be needed again. */
6093 || CONVERT_EXPR_P (op
))
6094 && TYPE_UNSIGNED (TREE_TYPE (op
)))
6105 /* Return OP or a simpler expression for a narrower value
6106 which can be sign-extended or zero-extended to give back OP.
6107 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
6108 or 0 if the value should be sign-extended. */
6111 get_narrower (tree op
, int *unsignedp_ptr
)
6116 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
6118 while (TREE_CODE (op
) == NOP_EXPR
)
6121 = (TYPE_PRECISION (TREE_TYPE (op
))
6122 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
6124 /* Truncations are many-one so cannot be removed. */
6128 /* See what's inside this conversion. If we decide to strip it,
6133 op
= TREE_OPERAND (op
, 0);
6134 /* An extension: the outermost one can be stripped,
6135 but remember whether it is zero or sign extension. */
6137 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
6138 /* Otherwise, if a sign extension has been stripped,
6139 only sign extensions can now be stripped;
6140 if a zero extension has been stripped, only zero-extensions. */
6141 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
6145 else /* bitschange == 0 */
6147 /* A change in nominal type can always be stripped, but we must
6148 preserve the unsignedness. */
6150 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
6152 op
= TREE_OPERAND (op
, 0);
6153 /* Keep trying to narrow, but don't assign op to win if it
6154 would turn an integral type into something else. */
6155 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
6162 if (TREE_CODE (op
) == COMPONENT_REF
6163 /* Since type_for_size always gives an integer type. */
6164 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
6165 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
6166 /* Ensure field is laid out already. */
6167 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
6168 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
6170 unsigned HOST_WIDE_INT innerprec
6171 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
6172 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
6173 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
6174 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
6176 /* We can get this structure field in a narrower type that fits it,
6177 but the resulting extension to its nominal type (a fullword type)
6178 must satisfy the same conditions as for other extensions.
6180 Do this only for fields that are aligned (not bit-fields),
6181 because when bit-field insns will be used there is no
6182 advantage in doing this. */
6184 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
6185 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
6186 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
6190 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
6191 win
= fold_convert (type
, op
);
6195 *unsignedp_ptr
= uns
;
6199 /* Nonzero if integer constant C has a value that is permissible
6200 for type TYPE (an INTEGER_TYPE). */
6203 int_fits_type_p (const_tree c
, const_tree type
)
6205 tree type_low_bound
= TYPE_MIN_VALUE (type
);
6206 tree type_high_bound
= TYPE_MAX_VALUE (type
);
6207 bool ok_for_low_bound
, ok_for_high_bound
;
6208 unsigned HOST_WIDE_INT low
;
6211 /* If at least one bound of the type is a constant integer, we can check
6212 ourselves and maybe make a decision. If no such decision is possible, but
6213 this type is a subtype, try checking against that. Otherwise, use
6214 fit_double_type, which checks against the precision.
6216 Compute the status for each possibly constant bound, and return if we see
6217 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
6218 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
6219 for "constant known to fit". */
6221 /* Check if C >= type_low_bound. */
6222 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
6224 if (tree_int_cst_lt (c
, type_low_bound
))
6226 ok_for_low_bound
= true;
6229 ok_for_low_bound
= false;
6231 /* Check if c <= type_high_bound. */
6232 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
6234 if (tree_int_cst_lt (type_high_bound
, c
))
6236 ok_for_high_bound
= true;
6239 ok_for_high_bound
= false;
6241 /* If the constant fits both bounds, the result is known. */
6242 if (ok_for_low_bound
&& ok_for_high_bound
)
6245 /* Perform some generic filtering which may allow making a decision
6246 even if the bounds are not constant. First, negative integers
6247 never fit in unsigned types, */
6248 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
6251 /* Second, narrower types always fit in wider ones. */
6252 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
6255 /* Third, unsigned integers with top bit set never fit signed types. */
6256 if (! TYPE_UNSIGNED (type
)
6257 && TYPE_UNSIGNED (TREE_TYPE (c
))
6258 && tree_int_cst_msb (c
))
6261 /* If we haven't been able to decide at this point, there nothing more we
6262 can check ourselves here. Look at the base type if we have one and it
6263 has the same precision. */
6264 if (TREE_CODE (type
) == INTEGER_TYPE
6265 && TREE_TYPE (type
) != 0
6266 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
6267 return int_fits_type_p (c
, TREE_TYPE (type
));
6269 /* Or to fit_double_type, if nothing else. */
6270 low
= TREE_INT_CST_LOW (c
);
6271 high
= TREE_INT_CST_HIGH (c
);
6272 return !fit_double_type (low
, high
, &low
, &high
, type
);
6275 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
6276 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
6277 represented (assuming two's-complement arithmetic) within the bit
6278 precision of the type are returned instead. */
6281 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
6283 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
6284 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
6285 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
6286 TYPE_UNSIGNED (type
));
6289 if (TYPE_UNSIGNED (type
))
6290 mpz_set_ui (min
, 0);
6294 mn
= double_int_mask (TYPE_PRECISION (type
) - 1);
6295 mn
= double_int_sext (double_int_add (mn
, double_int_one
),
6296 TYPE_PRECISION (type
));
6297 mpz_set_double_int (min
, mn
, false);
6301 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
6302 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
6303 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
6304 TYPE_UNSIGNED (type
));
6307 if (TYPE_UNSIGNED (type
))
6308 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
)),
6311 mpz_set_double_int (max
, double_int_mask (TYPE_PRECISION (type
) - 1),
6316 /* auto_var_in_fn_p is called to determine whether VAR is an automatic
6317 variable defined in function FN. */
6320 auto_var_in_fn_p (const_tree var
, const_tree fn
)
6322 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
6323 && (((TREE_CODE (var
) == VAR_DECL
|| TREE_CODE (var
) == PARM_DECL
)
6324 && ! TREE_STATIC (var
))
6325 || TREE_CODE (var
) == LABEL_DECL
6326 || TREE_CODE (var
) == RESULT_DECL
));
6329 /* Subprogram of following function. Called by walk_tree.
6331 Return *TP if it is an automatic variable or parameter of the
6332 function passed in as DATA. */
6335 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
6337 tree fn
= (tree
) data
;
6342 else if (DECL_P (*tp
)
6343 && auto_var_in_fn_p (*tp
, fn
))
6349 /* Returns true if T is, contains, or refers to a type with variable
6350 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
6351 arguments, but not the return type. If FN is nonzero, only return
6352 true if a modifier of the type or position of FN is a variable or
6353 parameter inside FN.
6355 This concept is more general than that of C99 'variably modified types':
6356 in C99, a struct type is never variably modified because a VLA may not
6357 appear as a structure member. However, in GNU C code like:
6359 struct S { int i[f()]; };
6361 is valid, and other languages may define similar constructs. */
6364 variably_modified_type_p (tree type
, tree fn
)
6368 /* Test if T is either variable (if FN is zero) or an expression containing
6369 a variable in FN. */
6370 #define RETURN_TRUE_IF_VAR(T) \
6371 do { tree _t = (T); \
6372 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
6373 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
6374 return true; } while (0)
6376 if (type
== error_mark_node
)
6379 /* If TYPE itself has variable size, it is variably modified. */
6380 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
6381 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
6383 switch (TREE_CODE (type
))
6386 case REFERENCE_TYPE
:
6388 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6394 /* If TYPE is a function type, it is variably modified if the
6395 return type is variably modified. */
6396 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
6402 case FIXED_POINT_TYPE
:
6405 /* Scalar types are variably modified if their end points
6407 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
6408 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
6413 case QUAL_UNION_TYPE
:
6414 /* We can't see if any of the fields are variably-modified by the
6415 definition we normally use, since that would produce infinite
6416 recursion via pointers. */
6417 /* This is variably modified if some field's type is. */
6418 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
6419 if (TREE_CODE (t
) == FIELD_DECL
)
6421 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
6422 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
6423 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
6425 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
6426 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
6431 /* Do not call ourselves to avoid infinite recursion. This is
6432 variably modified if the element type is. */
6433 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
6434 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
6441 /* The current language may have other cases to check, but in general,
6442 all other types are not variably modified. */
6443 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
6445 #undef RETURN_TRUE_IF_VAR
6448 /* Given a DECL or TYPE, return the scope in which it was declared, or
6449 NULL_TREE if there is no containing scope. */
6452 get_containing_scope (const_tree t
)
6454 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
6457 /* Return the innermost context enclosing DECL that is
6458 a FUNCTION_DECL, or zero if none. */
6461 decl_function_context (const_tree decl
)
6465 if (TREE_CODE (decl
) == ERROR_MARK
)
6468 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
6469 where we look up the function at runtime. Such functions always take
6470 a first argument of type 'pointer to real context'.
6472 C++ should really be fixed to use DECL_CONTEXT for the real context,
6473 and use something else for the "virtual context". */
6474 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
6477 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
6479 context
= DECL_CONTEXT (decl
);
6481 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
6483 if (TREE_CODE (context
) == BLOCK
)
6484 context
= BLOCK_SUPERCONTEXT (context
);
6486 context
= get_containing_scope (context
);
6492 /* Return the innermost context enclosing DECL that is
6493 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
6494 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
6497 decl_type_context (const_tree decl
)
6499 tree context
= DECL_CONTEXT (decl
);
6502 switch (TREE_CODE (context
))
6504 case NAMESPACE_DECL
:
6505 case TRANSLATION_UNIT_DECL
:
6510 case QUAL_UNION_TYPE
:
6515 context
= DECL_CONTEXT (context
);
6519 context
= BLOCK_SUPERCONTEXT (context
);
6529 /* CALL is a CALL_EXPR. Return the declaration for the function
6530 called, or NULL_TREE if the called function cannot be
6534 get_callee_fndecl (const_tree call
)
6538 if (call
== error_mark_node
)
6539 return error_mark_node
;
6541 /* It's invalid to call this function with anything but a
6543 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
6545 /* The first operand to the CALL is the address of the function
6547 addr
= CALL_EXPR_FN (call
);
6551 /* If this is a readonly function pointer, extract its initial value. */
6552 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
6553 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
6554 && DECL_INITIAL (addr
))
6555 addr
= DECL_INITIAL (addr
);
6557 /* If the address is just `&f' for some function `f', then we know
6558 that `f' is being called. */
6559 if (TREE_CODE (addr
) == ADDR_EXPR
6560 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
6561 return TREE_OPERAND (addr
, 0);
6563 /* We couldn't figure out what was being called. Maybe the front
6564 end has some idea. */
6565 return lang_hooks
.lang_get_callee_fndecl (call
);
6568 /* Print debugging information about tree nodes generated during the compile,
6569 and any language-specific information. */
6572 dump_tree_statistics (void)
6574 #ifdef GATHER_STATISTICS
6576 int total_nodes
, total_bytes
;
6579 fprintf (stderr
, "\n??? tree nodes created\n\n");
6580 #ifdef GATHER_STATISTICS
6581 fprintf (stderr
, "Kind Nodes Bytes\n");
6582 fprintf (stderr
, "---------------------------------------\n");
6583 total_nodes
= total_bytes
= 0;
6584 for (i
= 0; i
< (int) all_kinds
; i
++)
6586 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
6587 tree_node_counts
[i
], tree_node_sizes
[i
]);
6588 total_nodes
+= tree_node_counts
[i
];
6589 total_bytes
+= tree_node_sizes
[i
];
6591 fprintf (stderr
, "---------------------------------------\n");
6592 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
6593 fprintf (stderr
, "---------------------------------------\n");
6594 ssanames_print_statistics ();
6595 phinodes_print_statistics ();
6597 fprintf (stderr
, "(No per-node statistics)\n");
6599 print_type_hash_statistics ();
6600 print_debug_expr_statistics ();
6601 print_value_expr_statistics ();
6602 print_restrict_base_statistics ();
6603 lang_hooks
.print_statistics ();
6606 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
6608 /* Generate a crc32 of a string. */
6611 crc32_string (unsigned chksum
, const char *string
)
6615 unsigned value
= *string
<< 24;
6618 for (ix
= 8; ix
--; value
<<= 1)
6622 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
6631 /* P is a string that will be used in a symbol. Mask out any characters
6632 that are not valid in that context. */
6635 clean_symbol_name (char *p
)
6639 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
6642 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
6649 /* Generate a name for a special-purpose function function.
6650 The generated name may need to be unique across the whole link.
6651 TYPE is some string to identify the purpose of this function to the
6652 linker or collect2; it must start with an uppercase letter,
6654 I - for constructors
6656 N - for C++ anonymous namespaces
6657 F - for DWARF unwind frame information. */
6660 get_file_function_name (const char *type
)
6666 /* If we already have a name we know to be unique, just use that. */
6667 if (first_global_object_name
)
6668 p
= first_global_object_name
;
6669 /* If the target is handling the constructors/destructors, they
6670 will be local to this file and the name is only necessary for
6671 debugging purposes. */
6672 else if ((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
6674 const char *file
= main_input_filename
;
6676 file
= input_filename
;
6677 /* Just use the file's basename, because the full pathname
6678 might be quite long. */
6679 p
= strrchr (file
, '/');
6684 p
= q
= ASTRDUP (p
);
6685 clean_symbol_name (q
);
6689 /* Otherwise, the name must be unique across the entire link.
6690 We don't have anything that we know to be unique to this translation
6691 unit, so use what we do have and throw in some randomness. */
6693 const char *name
= weak_global_object_name
;
6694 const char *file
= main_input_filename
;
6699 file
= input_filename
;
6701 len
= strlen (file
);
6702 q
= alloca (9 * 2 + len
+ 1);
6703 memcpy (q
, file
, len
+ 1);
6704 clean_symbol_name (q
);
6706 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
6707 crc32_string (0, get_random_seed (false)));
6712 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
6714 /* Set up the name of the file-level functions we may need.
6715 Use a global object (which is already required to be unique over
6716 the program) rather than the file name (which imposes extra
6718 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
6720 return get_identifier (buf
);
6723 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
6725 /* Complain that the tree code of NODE does not match the expected 0
6726 terminated list of trailing codes. The trailing code list can be
6727 empty, for a more vague error message. FILE, LINE, and FUNCTION
6728 are of the caller. */
6731 tree_check_failed (const_tree node
, const char *file
,
6732 int line
, const char *function
, ...)
6736 unsigned length
= 0;
6739 va_start (args
, function
);
6740 while ((code
= va_arg (args
, int)))
6741 length
+= 4 + strlen (tree_code_name
[code
]);
6746 va_start (args
, function
);
6747 length
+= strlen ("expected ");
6748 buffer
= tmp
= alloca (length
);
6750 while ((code
= va_arg (args
, int)))
6752 const char *prefix
= length
? " or " : "expected ";
6754 strcpy (tmp
+ length
, prefix
);
6755 length
+= strlen (prefix
);
6756 strcpy (tmp
+ length
, tree_code_name
[code
]);
6757 length
+= strlen (tree_code_name
[code
]);
6762 buffer
= "unexpected node";
6764 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6765 buffer
, tree_code_name
[TREE_CODE (node
)],
6766 function
, trim_filename (file
), line
);
6769 /* Complain that the tree code of NODE does match the expected 0
6770 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
6774 tree_not_check_failed (const_tree node
, const char *file
,
6775 int line
, const char *function
, ...)
6779 unsigned length
= 0;
6782 va_start (args
, function
);
6783 while ((code
= va_arg (args
, int)))
6784 length
+= 4 + strlen (tree_code_name
[code
]);
6786 va_start (args
, function
);
6787 buffer
= alloca (length
);
6789 while ((code
= va_arg (args
, int)))
6793 strcpy (buffer
+ length
, " or ");
6796 strcpy (buffer
+ length
, tree_code_name
[code
]);
6797 length
+= strlen (tree_code_name
[code
]);
6801 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
6802 buffer
, tree_code_name
[TREE_CODE (node
)],
6803 function
, trim_filename (file
), line
);
6806 /* Similar to tree_check_failed, except that we check for a class of tree
6807 code, given in CL. */
6810 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
6811 const char *file
, int line
, const char *function
)
6814 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
6815 TREE_CODE_CLASS_STRING (cl
),
6816 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6817 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6820 /* Similar to tree_check_failed, except that instead of specifying a
6821 dozen codes, use the knowledge that they're all sequential. */
6824 tree_range_check_failed (const_tree node
, const char *file
, int line
,
6825 const char *function
, enum tree_code c1
,
6829 unsigned length
= 0;
6832 for (c
= c1
; c
<= c2
; ++c
)
6833 length
+= 4 + strlen (tree_code_name
[c
]);
6835 length
+= strlen ("expected ");
6836 buffer
= alloca (length
);
6839 for (c
= c1
; c
<= c2
; ++c
)
6841 const char *prefix
= length
? " or " : "expected ";
6843 strcpy (buffer
+ length
, prefix
);
6844 length
+= strlen (prefix
);
6845 strcpy (buffer
+ length
, tree_code_name
[c
]);
6846 length
+= strlen (tree_code_name
[c
]);
6849 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6850 buffer
, tree_code_name
[TREE_CODE (node
)],
6851 function
, trim_filename (file
), line
);
6855 /* Similar to tree_check_failed, except that we check that a tree does
6856 not have the specified code, given in CL. */
6859 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
6860 const char *file
, int line
, const char *function
)
6863 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
6864 TREE_CODE_CLASS_STRING (cl
),
6865 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
6866 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6870 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
6873 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
6874 const char *function
, enum omp_clause_code code
)
6876 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
6877 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
6878 function
, trim_filename (file
), line
);
6882 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
6885 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
6886 const char *function
, enum omp_clause_code c1
,
6887 enum omp_clause_code c2
)
6890 unsigned length
= 0;
6891 enum omp_clause_code c
;
6893 for (c
= c1
; c
<= c2
; ++c
)
6894 length
+= 4 + strlen (omp_clause_code_name
[c
]);
6896 length
+= strlen ("expected ");
6897 buffer
= alloca (length
);
6900 for (c
= c1
; c
<= c2
; ++c
)
6902 const char *prefix
= length
? " or " : "expected ";
6904 strcpy (buffer
+ length
, prefix
);
6905 length
+= strlen (prefix
);
6906 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
6907 length
+= strlen (omp_clause_code_name
[c
]);
6910 internal_error ("tree check: %s, have %s in %s, at %s:%d",
6911 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
6912 function
, trim_filename (file
), line
);
6916 #undef DEFTREESTRUCT
6917 #define DEFTREESTRUCT(VAL, NAME) NAME,
6919 static const char *ts_enum_names
[] = {
6920 #include "treestruct.def"
6922 #undef DEFTREESTRUCT
6924 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
6926 /* Similar to tree_class_check_failed, except that we check for
6927 whether CODE contains the tree structure identified by EN. */
6930 tree_contains_struct_check_failed (const_tree node
,
6931 const enum tree_node_structure_enum en
,
6932 const char *file
, int line
,
6933 const char *function
)
6936 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
6938 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
6942 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
6943 (dynamically sized) vector. */
6946 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6947 const char *function
)
6950 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
6951 idx
+ 1, len
, function
, trim_filename (file
), line
);
6954 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
6955 (dynamically sized) vector. */
6958 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
6959 const char *function
)
6962 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
6963 idx
+ 1, len
, function
, trim_filename (file
), line
);
6966 /* Similar to above, except that the check is for the bounds of the operand
6967 vector of an expression node EXP. */
6970 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
6971 int line
, const char *function
)
6973 int code
= TREE_CODE (exp
);
6975 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
6976 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
6977 function
, trim_filename (file
), line
);
6980 /* Similar to above, except that the check is for the number of
6981 operands of an OMP_CLAUSE node. */
6984 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
6985 int line
, const char *function
)
6988 ("tree check: accessed operand %d of omp_clause %s with %d operands "
6989 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
6990 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
6991 trim_filename (file
), line
);
6993 #endif /* ENABLE_TREE_CHECKING */
6995 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
6996 and mapped to the machine mode MODE. Initialize its fields and build
6997 the information necessary for debugging output. */
7000 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
7003 hashval_t hashcode
= 0;
7005 /* Build a main variant, based on the main variant of the inner type, then
7006 use it to build the variant we return. */
7007 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
7008 && TYPE_MAIN_VARIANT (innertype
) != innertype
)
7009 return build_type_attribute_qual_variant (
7010 make_vector_type (TYPE_MAIN_VARIANT (innertype
), nunits
, mode
),
7011 TYPE_ATTRIBUTES (innertype
),
7012 TYPE_QUALS (innertype
));
7014 t
= make_node (VECTOR_TYPE
);
7015 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
7016 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
7017 TYPE_MODE (t
) = mode
;
7018 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
7019 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
7021 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
7022 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7023 else if (TYPE_CANONICAL (innertype
) != innertype
7024 || mode
!= VOIDmode
)
7026 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
7031 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
7032 tree array
= build_array_type (innertype
, build_index_type (index
));
7033 tree rt
= make_node (RECORD_TYPE
);
7035 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
7036 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
7038 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
7039 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
7040 the representation type, and we want to find that die when looking up
7041 the vector type. This is most easily achieved by making the TYPE_UID
7043 TYPE_UID (rt
) = TYPE_UID (t
);
7046 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
7047 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
7048 hashcode
= iterative_hash_object (TYPE_HASH (innertype
), hashcode
);
7049 return type_hash_canon (hashcode
, t
);
7053 make_or_reuse_type (unsigned size
, int unsignedp
)
7055 if (size
== INT_TYPE_SIZE
)
7056 return unsignedp
? unsigned_type_node
: integer_type_node
;
7057 if (size
== CHAR_TYPE_SIZE
)
7058 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
7059 if (size
== SHORT_TYPE_SIZE
)
7060 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
7061 if (size
== LONG_TYPE_SIZE
)
7062 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
7063 if (size
== LONG_LONG_TYPE_SIZE
)
7064 return (unsignedp
? long_long_unsigned_type_node
7065 : long_long_integer_type_node
);
7068 return make_unsigned_type (size
);
7070 return make_signed_type (size
);
7073 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
7076 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
7080 if (size
== SHORT_FRACT_TYPE_SIZE
)
7081 return unsignedp
? sat_unsigned_short_fract_type_node
7082 : sat_short_fract_type_node
;
7083 if (size
== FRACT_TYPE_SIZE
)
7084 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
7085 if (size
== LONG_FRACT_TYPE_SIZE
)
7086 return unsignedp
? sat_unsigned_long_fract_type_node
7087 : sat_long_fract_type_node
;
7088 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
7089 return unsignedp
? sat_unsigned_long_long_fract_type_node
7090 : sat_long_long_fract_type_node
;
7094 if (size
== SHORT_FRACT_TYPE_SIZE
)
7095 return unsignedp
? unsigned_short_fract_type_node
7096 : short_fract_type_node
;
7097 if (size
== FRACT_TYPE_SIZE
)
7098 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
7099 if (size
== LONG_FRACT_TYPE_SIZE
)
7100 return unsignedp
? unsigned_long_fract_type_node
7101 : long_fract_type_node
;
7102 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
7103 return unsignedp
? unsigned_long_long_fract_type_node
7104 : long_long_fract_type_node
;
7107 return make_fract_type (size
, unsignedp
, satp
);
7110 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
7113 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
7117 if (size
== SHORT_ACCUM_TYPE_SIZE
)
7118 return unsignedp
? sat_unsigned_short_accum_type_node
7119 : sat_short_accum_type_node
;
7120 if (size
== ACCUM_TYPE_SIZE
)
7121 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
7122 if (size
== LONG_ACCUM_TYPE_SIZE
)
7123 return unsignedp
? sat_unsigned_long_accum_type_node
7124 : sat_long_accum_type_node
;
7125 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
7126 return unsignedp
? sat_unsigned_long_long_accum_type_node
7127 : sat_long_long_accum_type_node
;
7131 if (size
== SHORT_ACCUM_TYPE_SIZE
)
7132 return unsignedp
? unsigned_short_accum_type_node
7133 : short_accum_type_node
;
7134 if (size
== ACCUM_TYPE_SIZE
)
7135 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
7136 if (size
== LONG_ACCUM_TYPE_SIZE
)
7137 return unsignedp
? unsigned_long_accum_type_node
7138 : long_accum_type_node
;
7139 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
7140 return unsignedp
? unsigned_long_long_accum_type_node
7141 : long_long_accum_type_node
;
7144 return make_accum_type (size
, unsignedp
, satp
);
7147 /* Create nodes for all integer types (and error_mark_node) using the sizes
7148 of C datatypes. The caller should call set_sizetype soon after calling
7149 this function to select one of the types as sizetype. */
7152 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
7154 error_mark_node
= make_node (ERROR_MARK
);
7155 TREE_TYPE (error_mark_node
) = error_mark_node
;
7157 initialize_sizetypes (signed_sizetype
);
7159 /* Define both `signed char' and `unsigned char'. */
7160 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
7161 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
7162 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
7163 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
7165 /* Define `char', which is like either `signed char' or `unsigned char'
7166 but not the same as either. */
7169 ? make_signed_type (CHAR_TYPE_SIZE
)
7170 : make_unsigned_type (CHAR_TYPE_SIZE
));
7171 TYPE_STRING_FLAG (char_type_node
) = 1;
7173 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
7174 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
7175 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
7176 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
7177 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
7178 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
7179 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
7180 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
7182 /* Define a boolean type. This type only represents boolean values but
7183 may be larger than char depending on the value of BOOL_TYPE_SIZE.
7184 Front ends which want to override this size (i.e. Java) can redefine
7185 boolean_type_node before calling build_common_tree_nodes_2. */
7186 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
7187 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
7188 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
7189 TYPE_PRECISION (boolean_type_node
) = 1;
7191 /* Fill in the rest of the sized types. Reuse existing type nodes
7193 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
7194 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
7195 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
7196 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
7197 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
7199 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
7200 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
7201 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
7202 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
7203 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
7205 access_public_node
= get_identifier ("public");
7206 access_protected_node
= get_identifier ("protected");
7207 access_private_node
= get_identifier ("private");
7210 /* Call this function after calling build_common_tree_nodes and set_sizetype.
7211 It will create several other common tree nodes. */
7214 build_common_tree_nodes_2 (int short_double
)
7216 /* Define these next since types below may used them. */
7217 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
7218 integer_one_node
= build_int_cst (NULL_TREE
, 1);
7219 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
7221 size_zero_node
= size_int (0);
7222 size_one_node
= size_int (1);
7223 bitsize_zero_node
= bitsize_int (0);
7224 bitsize_one_node
= bitsize_int (1);
7225 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
7227 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
7228 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
7230 void_type_node
= make_node (VOID_TYPE
);
7231 layout_type (void_type_node
);
7233 /* We are not going to have real types in C with less than byte alignment,
7234 so we might as well not have any types that claim to have it. */
7235 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
7236 TYPE_USER_ALIGN (void_type_node
) = 0;
7238 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
7239 layout_type (TREE_TYPE (null_pointer_node
));
7241 ptr_type_node
= build_pointer_type (void_type_node
);
7243 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
7244 fileptr_type_node
= ptr_type_node
;
7246 float_type_node
= make_node (REAL_TYPE
);
7247 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
7248 layout_type (float_type_node
);
7250 double_type_node
= make_node (REAL_TYPE
);
7252 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
7254 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
7255 layout_type (double_type_node
);
7257 long_double_type_node
= make_node (REAL_TYPE
);
7258 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
7259 layout_type (long_double_type_node
);
7261 float_ptr_type_node
= build_pointer_type (float_type_node
);
7262 double_ptr_type_node
= build_pointer_type (double_type_node
);
7263 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
7264 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
7266 /* Fixed size integer types. */
7267 uint32_type_node
= build_nonstandard_integer_type (32, true);
7268 uint64_type_node
= build_nonstandard_integer_type (64, true);
7270 /* Decimal float types. */
7271 dfloat32_type_node
= make_node (REAL_TYPE
);
7272 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
7273 layout_type (dfloat32_type_node
);
7274 TYPE_MODE (dfloat32_type_node
) = SDmode
;
7275 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
7277 dfloat64_type_node
= make_node (REAL_TYPE
);
7278 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
7279 layout_type (dfloat64_type_node
);
7280 TYPE_MODE (dfloat64_type_node
) = DDmode
;
7281 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
7283 dfloat128_type_node
= make_node (REAL_TYPE
);
7284 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
7285 layout_type (dfloat128_type_node
);
7286 TYPE_MODE (dfloat128_type_node
) = TDmode
;
7287 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
7289 complex_integer_type_node
= build_complex_type (integer_type_node
);
7290 complex_float_type_node
= build_complex_type (float_type_node
);
7291 complex_double_type_node
= build_complex_type (double_type_node
);
7292 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
7294 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
7295 #define MAKE_FIXED_TYPE_NODE(KIND,WIDTH,SIZE) \
7296 sat_ ## WIDTH ## KIND ## _type_node = \
7297 make_sat_signed_ ## KIND ## _type (SIZE); \
7298 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
7299 make_sat_unsigned_ ## KIND ## _type (SIZE); \
7300 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
7301 unsigned_ ## WIDTH ## KIND ## _type_node = \
7302 make_unsigned_ ## KIND ## _type (SIZE);
7304 /* Make fixed-point type nodes based on four different widths. */
7305 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
7306 MAKE_FIXED_TYPE_NODE (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
7307 MAKE_FIXED_TYPE_NODE (N1, , N2 ## _TYPE_SIZE) \
7308 MAKE_FIXED_TYPE_NODE (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
7309 MAKE_FIXED_TYPE_NODE (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
7311 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
7312 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
7313 NAME ## _type_node = \
7314 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
7315 u ## NAME ## _type_node = \
7316 make_or_reuse_unsigned_ ## KIND ## _type \
7317 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
7318 sat_ ## NAME ## _type_node = \
7319 make_or_reuse_sat_signed_ ## KIND ## _type \
7320 (GET_MODE_BITSIZE (MODE ## mode)); \
7321 sat_u ## NAME ## _type_node = \
7322 make_or_reuse_sat_unsigned_ ## KIND ## _type \
7323 (GET_MODE_BITSIZE (U ## MODE ## mode));
7325 /* Fixed-point type and mode nodes. */
7326 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
7327 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
7328 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
7329 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
7330 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
7331 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
7332 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
7333 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
7334 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
7335 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
7336 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
7339 tree t
= targetm
.build_builtin_va_list ();
7341 /* Many back-ends define record types without setting TYPE_NAME.
7342 If we copied the record type here, we'd keep the original
7343 record type without a name. This breaks name mangling. So,
7344 don't copy record types and let c_common_nodes_and_builtins()
7345 declare the type to be __builtin_va_list. */
7346 if (TREE_CODE (t
) != RECORD_TYPE
)
7347 t
= build_variant_type_copy (t
);
7349 va_list_type_node
= t
;
7353 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
7356 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
7357 const char *library_name
, int ecf_flags
)
7361 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
7362 library_name
, NULL_TREE
);
7363 if (ecf_flags
& ECF_CONST
)
7364 TREE_READONLY (decl
) = 1;
7365 if (ecf_flags
& ECF_PURE
)
7366 DECL_PURE_P (decl
) = 1;
7367 if (ecf_flags
& ECF_LOOPING_CONST_OR_PURE
)
7368 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
7369 if (ecf_flags
& ECF_NORETURN
)
7370 TREE_THIS_VOLATILE (decl
) = 1;
7371 if (ecf_flags
& ECF_NOTHROW
)
7372 TREE_NOTHROW (decl
) = 1;
7373 if (ecf_flags
& ECF_MALLOC
)
7374 DECL_IS_MALLOC (decl
) = 1;
7376 built_in_decls
[code
] = decl
;
7377 implicit_built_in_decls
[code
] = decl
;
7380 /* Call this function after instantiating all builtins that the language
7381 front end cares about. This will build the rest of the builtins that
7382 are relied upon by the tree optimizers and the middle-end. */
7385 build_common_builtin_nodes (void)
7389 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
7390 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7392 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7393 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7394 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7395 ftype
= build_function_type (ptr_type_node
, tmp
);
7397 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
7398 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
7399 "memcpy", ECF_NOTHROW
);
7400 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
7401 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
7402 "memmove", ECF_NOTHROW
);
7405 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
7407 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7408 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7409 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
7410 ftype
= build_function_type (integer_type_node
, tmp
);
7411 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
7412 "memcmp", ECF_PURE
| ECF_NOTHROW
);
7415 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
7417 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7418 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
7419 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7420 ftype
= build_function_type (ptr_type_node
, tmp
);
7421 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
7422 "memset", ECF_NOTHROW
);
7425 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
7427 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
7428 ftype
= build_function_type (ptr_type_node
, tmp
);
7429 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
7430 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
7433 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7434 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7435 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7436 ftype
= build_function_type (void_type_node
, tmp
);
7437 local_define_builtin ("__builtin_init_trampoline", ftype
,
7438 BUILT_IN_INIT_TRAMPOLINE
,
7439 "__builtin_init_trampoline", ECF_NOTHROW
);
7441 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7442 ftype
= build_function_type (ptr_type_node
, tmp
);
7443 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
7444 BUILT_IN_ADJUST_TRAMPOLINE
,
7445 "__builtin_adjust_trampoline",
7446 ECF_CONST
| ECF_NOTHROW
);
7448 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7449 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7450 ftype
= build_function_type (void_type_node
, tmp
);
7451 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
7452 BUILT_IN_NONLOCAL_GOTO
,
7453 "__builtin_nonlocal_goto",
7454 ECF_NORETURN
| ECF_NOTHROW
);
7456 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7457 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
7458 ftype
= build_function_type (void_type_node
, tmp
);
7459 local_define_builtin ("__builtin_setjmp_setup", ftype
,
7460 BUILT_IN_SETJMP_SETUP
,
7461 "__builtin_setjmp_setup", ECF_NOTHROW
);
7463 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7464 ftype
= build_function_type (ptr_type_node
, tmp
);
7465 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
7466 BUILT_IN_SETJMP_DISPATCHER
,
7467 "__builtin_setjmp_dispatcher",
7468 ECF_PURE
| ECF_NOTHROW
);
7470 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7471 ftype
= build_function_type (void_type_node
, tmp
);
7472 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
7473 BUILT_IN_SETJMP_RECEIVER
,
7474 "__builtin_setjmp_receiver", ECF_NOTHROW
);
7476 ftype
= build_function_type (ptr_type_node
, void_list_node
);
7477 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
7478 "__builtin_stack_save", ECF_NOTHROW
);
7480 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
7481 ftype
= build_function_type (void_type_node
, tmp
);
7482 local_define_builtin ("__builtin_stack_restore", ftype
,
7483 BUILT_IN_STACK_RESTORE
,
7484 "__builtin_stack_restore", ECF_NOTHROW
);
7486 ftype
= build_function_type (void_type_node
, void_list_node
);
7487 local_define_builtin ("__builtin_profile_func_enter", ftype
,
7488 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
7489 local_define_builtin ("__builtin_profile_func_exit", ftype
,
7490 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
7492 /* Complex multiplication and division. These are handled as builtins
7493 rather than optabs because emit_library_call_value doesn't support
7494 complex. Further, we can do slightly better with folding these
7495 beasties if the real and complex parts of the arguments are separate. */
7497 enum machine_mode mode
;
7499 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
7501 char mode_name_buf
[4], *q
;
7503 enum built_in_function mcode
, dcode
;
7504 tree type
, inner_type
;
7506 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
7509 inner_type
= TREE_TYPE (type
);
7511 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
7512 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7513 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7514 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
7515 ftype
= build_function_type (type
, tmp
);
7517 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7518 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
7520 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
7524 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
7525 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
7526 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
7528 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
7529 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
7530 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
7535 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
7538 If we requested a pointer to a vector, build up the pointers that
7539 we stripped off while looking for the inner type. Similarly for
7540 return values from functions.
7542 The argument TYPE is the top of the chain, and BOTTOM is the
7543 new type which we will point to. */
7546 reconstruct_complex_type (tree type
, tree bottom
)
7550 if (TREE_CODE (type
) == POINTER_TYPE
)
7552 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7553 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
7554 TYPE_REF_CAN_ALIAS_ALL (type
));
7556 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
7558 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7559 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
7560 TYPE_REF_CAN_ALIAS_ALL (type
));
7562 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7564 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7565 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
7567 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
7569 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7570 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
7572 else if (TREE_CODE (type
) == METHOD_TYPE
)
7574 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7575 /* The build_method_type_directly() routine prepends 'this' to argument list,
7576 so we must compensate by getting rid of it. */
7578 = build_method_type_directly
7579 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
7581 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
7583 else if (TREE_CODE (type
) == OFFSET_TYPE
)
7585 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
7586 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
7591 return build_qualified_type (outer
, TYPE_QUALS (type
));
7594 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
7597 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
7601 switch (GET_MODE_CLASS (mode
))
7603 case MODE_VECTOR_INT
:
7604 case MODE_VECTOR_FLOAT
:
7605 case MODE_VECTOR_FRACT
:
7606 case MODE_VECTOR_UFRACT
:
7607 case MODE_VECTOR_ACCUM
:
7608 case MODE_VECTOR_UACCUM
:
7609 nunits
= GET_MODE_NUNITS (mode
);
7613 /* Check that there are no leftover bits. */
7614 gcc_assert (GET_MODE_BITSIZE (mode
)
7615 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
7617 nunits
= GET_MODE_BITSIZE (mode
)
7618 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
7625 return make_vector_type (innertype
, nunits
, mode
);
7628 /* Similarly, but takes the inner type and number of units, which must be
7632 build_vector_type (tree innertype
, int nunits
)
7634 return make_vector_type (innertype
, nunits
, VOIDmode
);
7638 /* Build RESX_EXPR with given REGION_NUMBER. */
7640 build_resx (int region_number
)
7643 t
= build1 (RESX_EXPR
, void_type_node
,
7644 build_int_cst (NULL_TREE
, region_number
));
7648 /* Given an initializer INIT, return TRUE if INIT is zero or some
7649 aggregate of zeros. Otherwise return FALSE. */
7651 initializer_zerop (const_tree init
)
7657 switch (TREE_CODE (init
))
7660 return integer_zerop (init
);
7663 /* ??? Note that this is not correct for C4X float formats. There,
7664 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
7665 negative exponent. */
7666 return real_zerop (init
)
7667 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
7670 return fixed_zerop (init
);
7673 return integer_zerop (init
)
7674 || (real_zerop (init
)
7675 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
7676 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
7679 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
7680 if (!initializer_zerop (TREE_VALUE (elt
)))
7686 unsigned HOST_WIDE_INT idx
;
7688 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
7689 if (!initializer_zerop (elt
))
7699 /* Build an empty statement. */
7702 build_empty_stmt (void)
7704 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
7708 /* Build an OpenMP clause with code CODE. */
7711 build_omp_clause (enum omp_clause_code code
)
7716 length
= omp_clause_num_ops
[code
];
7717 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
7719 t
= ggc_alloc (size
);
7720 memset (t
, 0, size
);
7721 TREE_SET_CODE (t
, OMP_CLAUSE
);
7722 OMP_CLAUSE_SET_CODE (t
, code
);
7724 #ifdef GATHER_STATISTICS
7725 tree_node_counts
[(int) omp_clause_kind
]++;
7726 tree_node_sizes
[(int) omp_clause_kind
] += size
;
7732 /* Set various status flags when building a CALL_EXPR object T. */
7735 process_call_operands (tree t
)
7739 side_effects
= TREE_SIDE_EFFECTS (t
);
7743 n
= TREE_OPERAND_LENGTH (t
);
7744 for (i
= 1; i
< n
; i
++)
7746 tree op
= TREE_OPERAND (t
, i
);
7747 if (op
&& TREE_SIDE_EFFECTS (op
))
7758 /* Calls have side-effects, except those to const or
7760 i
= call_expr_flags (t
);
7761 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
7764 TREE_SIDE_EFFECTS (t
) = side_effects
;
7767 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
7768 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
7769 Except for the CODE and operand count field, other storage for the
7770 object is initialized to zeros. */
7773 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
7776 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
7778 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
7779 gcc_assert (len
>= 1);
7781 #ifdef GATHER_STATISTICS
7782 tree_node_counts
[(int) e_kind
]++;
7783 tree_node_sizes
[(int) e_kind
] += length
;
7786 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
7788 memset (t
, 0, length
);
7790 TREE_SET_CODE (t
, code
);
7792 /* Can't use TREE_OPERAND to store the length because if checking is
7793 enabled, it will try to check the length before we store it. :-P */
7794 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
7800 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE
7801 and FN and a null static chain slot. ARGLIST is a TREE_LIST of the
7805 build_call_list (tree return_type
, tree fn
, tree arglist
)
7810 t
= build_vl_exp (CALL_EXPR
, list_length (arglist
) + 3);
7811 TREE_TYPE (t
) = return_type
;
7812 CALL_EXPR_FN (t
) = fn
;
7813 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
7814 for (i
= 0; arglist
; arglist
= TREE_CHAIN (arglist
), i
++)
7815 CALL_EXPR_ARG (t
, i
) = TREE_VALUE (arglist
);
7816 process_call_operands (t
);
7820 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7821 FN and a null static chain slot. NARGS is the number of call arguments
7822 which are specified as "..." arguments. */
7825 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
7829 va_start (args
, nargs
);
7830 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
7835 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7836 FN and a null static chain slot. NARGS is the number of call arguments
7837 which are specified as a va_list ARGS. */
7840 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
7845 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
7846 TREE_TYPE (t
) = return_type
;
7847 CALL_EXPR_FN (t
) = fn
;
7848 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
7849 for (i
= 0; i
< nargs
; i
++)
7850 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
7851 process_call_operands (t
);
7855 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
7856 FN and a null static chain slot. NARGS is the number of call arguments
7857 which are specified as a tree array ARGS. */
7860 build_call_array (tree return_type
, tree fn
, int nargs
, tree
*args
)
7865 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
7866 TREE_TYPE (t
) = return_type
;
7867 CALL_EXPR_FN (t
) = fn
;
7868 CALL_EXPR_STATIC_CHAIN (t
) = NULL_TREE
;
7869 for (i
= 0; i
< nargs
; i
++)
7870 CALL_EXPR_ARG (t
, i
) = args
[i
];
7871 process_call_operands (t
);
7876 /* Returns true if it is possible to prove that the index of
7877 an array access REF (an ARRAY_REF expression) falls into the
7881 in_array_bounds_p (tree ref
)
7883 tree idx
= TREE_OPERAND (ref
, 1);
7886 if (TREE_CODE (idx
) != INTEGER_CST
)
7889 min
= array_ref_low_bound (ref
);
7890 max
= array_ref_up_bound (ref
);
7893 || TREE_CODE (min
) != INTEGER_CST
7894 || TREE_CODE (max
) != INTEGER_CST
)
7897 if (tree_int_cst_lt (idx
, min
)
7898 || tree_int_cst_lt (max
, idx
))
7904 /* Returns true if it is possible to prove that the range of
7905 an array access REF (an ARRAY_RANGE_REF expression) falls
7906 into the array bounds. */
7909 range_in_array_bounds_p (tree ref
)
7911 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
7912 tree range_min
, range_max
, min
, max
;
7914 range_min
= TYPE_MIN_VALUE (domain_type
);
7915 range_max
= TYPE_MAX_VALUE (domain_type
);
7918 || TREE_CODE (range_min
) != INTEGER_CST
7919 || TREE_CODE (range_max
) != INTEGER_CST
)
7922 min
= array_ref_low_bound (ref
);
7923 max
= array_ref_up_bound (ref
);
7926 || TREE_CODE (min
) != INTEGER_CST
7927 || TREE_CODE (max
) != INTEGER_CST
)
7930 if (tree_int_cst_lt (range_min
, min
)
7931 || tree_int_cst_lt (max
, range_max
))
7937 /* Return true if T (assumed to be a DECL) must be assigned a memory
7941 needs_to_live_in_memory (const_tree t
)
7943 if (TREE_CODE (t
) == SSA_NAME
)
7944 t
= SSA_NAME_VAR (t
);
7946 return (TREE_ADDRESSABLE (t
)
7947 || is_global_var (t
)
7948 || (TREE_CODE (t
) == RESULT_DECL
7949 && aggregate_value_p (t
, current_function_decl
)));
7952 /* There are situations in which a language considers record types
7953 compatible which have different field lists. Decide if two fields
7954 are compatible. It is assumed that the parent records are compatible. */
7957 fields_compatible_p (const_tree f1
, const_tree f2
)
7959 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
7960 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
7963 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
7964 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
7967 if (!types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
7973 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
7976 find_compatible_field (tree record
, tree orig_field
)
7980 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
7981 if (TREE_CODE (f
) == FIELD_DECL
7982 && fields_compatible_p (f
, orig_field
))
7985 /* ??? Why isn't this on the main fields list? */
7986 f
= TYPE_VFIELD (record
);
7987 if (f
&& TREE_CODE (f
) == FIELD_DECL
7988 && fields_compatible_p (f
, orig_field
))
7991 /* ??? We should abort here, but Java appears to do Bad Things
7992 with inherited fields. */
7996 /* Return value of a constant X and sign-extend it. */
7999 int_cst_value (const_tree x
)
8001 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
8002 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
8004 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
8005 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
8006 || TREE_INT_CST_HIGH (x
) == -1);
8008 if (bits
< HOST_BITS_PER_WIDE_INT
)
8010 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
8012 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
8014 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
8020 /* If TYPE is an integral type, return an equivalent type which is
8021 unsigned iff UNSIGNEDP is true. If TYPE is not an integral type,
8022 return TYPE itself. */
8025 signed_or_unsigned_type_for (int unsignedp
, tree type
)
8028 if (POINTER_TYPE_P (type
))
8031 if (!INTEGRAL_TYPE_P (t
) || TYPE_UNSIGNED (t
) == unsignedp
)
8034 return lang_hooks
.types
.type_for_size (TYPE_PRECISION (t
), unsignedp
);
8037 /* Returns unsigned variant of TYPE. */
8040 unsigned_type_for (tree type
)
8042 return signed_or_unsigned_type_for (1, type
);
8045 /* Returns signed variant of TYPE. */
8048 signed_type_for (tree type
)
8050 return signed_or_unsigned_type_for (0, type
);
8053 /* Returns the largest value obtainable by casting something in INNER type to
8057 upper_bound_in_type (tree outer
, tree inner
)
8059 unsigned HOST_WIDE_INT lo
, hi
;
8060 unsigned int det
= 0;
8061 unsigned oprec
= TYPE_PRECISION (outer
);
8062 unsigned iprec
= TYPE_PRECISION (inner
);
8065 /* Compute a unique number for every combination. */
8066 det
|= (oprec
> iprec
) ? 4 : 0;
8067 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
8068 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
8070 /* Determine the exponent to use. */
8075 /* oprec <= iprec, outer: signed, inner: don't care. */
8080 /* oprec <= iprec, outer: unsigned, inner: don't care. */
8084 /* oprec > iprec, outer: signed, inner: signed. */
8088 /* oprec > iprec, outer: signed, inner: unsigned. */
8092 /* oprec > iprec, outer: unsigned, inner: signed. */
8096 /* oprec > iprec, outer: unsigned, inner: unsigned. */
8103 /* Compute 2^^prec - 1. */
8104 if (prec
<= HOST_BITS_PER_WIDE_INT
)
8107 lo
= ((~(unsigned HOST_WIDE_INT
) 0)
8108 >> (HOST_BITS_PER_WIDE_INT
- prec
));
8112 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
8113 >> (2 * HOST_BITS_PER_WIDE_INT
- prec
));
8114 lo
= ~(unsigned HOST_WIDE_INT
) 0;
8117 return build_int_cst_wide (outer
, lo
, hi
);
8120 /* Returns the smallest value obtainable by casting something in INNER type to
8124 lower_bound_in_type (tree outer
, tree inner
)
8126 unsigned HOST_WIDE_INT lo
, hi
;
8127 unsigned oprec
= TYPE_PRECISION (outer
);
8128 unsigned iprec
= TYPE_PRECISION (inner
);
8130 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
8132 if (TYPE_UNSIGNED (outer
)
8133 /* If we are widening something of an unsigned type, OUTER type
8134 contains all values of INNER type. In particular, both INNER
8135 and OUTER types have zero in common. */
8136 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
8140 /* If we are widening a signed type to another signed type, we
8141 want to obtain -2^^(iprec-1). If we are keeping the
8142 precision or narrowing to a signed type, we want to obtain
8144 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
8146 if (prec
<= HOST_BITS_PER_WIDE_INT
)
8148 hi
= ~(unsigned HOST_WIDE_INT
) 0;
8149 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
8153 hi
= ((~(unsigned HOST_WIDE_INT
) 0)
8154 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
8159 return build_int_cst_wide (outer
, lo
, hi
);
8162 /* Return nonzero if two operands that are suitable for PHI nodes are
8163 necessarily equal. Specifically, both ARG0 and ARG1 must be either
8164 SSA_NAME or invariant. Note that this is strictly an optimization.
8165 That is, callers of this function can directly call operand_equal_p
8166 and get the same result, only slower. */
8169 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
8173 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
8175 return operand_equal_p (arg0
, arg1
, 0);
8178 /* Returns number of zeros at the end of binary representation of X.
8180 ??? Use ffs if available? */
8183 num_ending_zeros (const_tree x
)
8185 unsigned HOST_WIDE_INT fr
, nfr
;
8186 unsigned num
, abits
;
8187 tree type
= TREE_TYPE (x
);
8189 if (TREE_INT_CST_LOW (x
) == 0)
8191 num
= HOST_BITS_PER_WIDE_INT
;
8192 fr
= TREE_INT_CST_HIGH (x
);
8197 fr
= TREE_INT_CST_LOW (x
);
8200 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
8203 if (nfr
<< abits
== fr
)
8210 if (num
> TYPE_PRECISION (type
))
8211 num
= TYPE_PRECISION (type
);
8213 return build_int_cst_type (type
, num
);
8217 #define WALK_SUBTREE(NODE) \
8220 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
8226 /* This is a subroutine of walk_tree that walks field of TYPE that are to
8227 be walked whenever a type is seen in the tree. Rest of operands and return
8228 value are as for walk_tree. */
8231 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
8232 struct pointer_set_t
*pset
, walk_tree_lh lh
)
8234 tree result
= NULL_TREE
;
8236 switch (TREE_CODE (type
))
8239 case REFERENCE_TYPE
:
8240 /* We have to worry about mutually recursive pointers. These can't
8241 be written in C. They can in Ada. It's pathological, but
8242 there's an ACATS test (c38102a) that checks it. Deal with this
8243 by checking if we're pointing to another pointer, that one
8244 points to another pointer, that one does too, and we have no htab.
8245 If so, get a hash table. We check three levels deep to avoid
8246 the cost of the hash table if we don't need one. */
8247 if (POINTER_TYPE_P (TREE_TYPE (type
))
8248 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
8249 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
8252 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
8260 /* ... fall through ... */
8263 WALK_SUBTREE (TREE_TYPE (type
));
8267 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
8272 WALK_SUBTREE (TREE_TYPE (type
));
8276 /* We never want to walk into default arguments. */
8277 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
8278 WALK_SUBTREE (TREE_VALUE (arg
));
8283 /* Don't follow this nodes's type if a pointer for fear that
8284 we'll have infinite recursion. If we have a PSET, then we
8287 || (!POINTER_TYPE_P (TREE_TYPE (type
))
8288 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
8289 WALK_SUBTREE (TREE_TYPE (type
));
8290 WALK_SUBTREE (TYPE_DOMAIN (type
));
8294 WALK_SUBTREE (TREE_TYPE (type
));
8295 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
8305 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
8306 called with the DATA and the address of each sub-tree. If FUNC returns a
8307 non-NULL value, the traversal is stopped, and the value returned by FUNC
8308 is returned. If PSET is non-NULL it is used to record the nodes visited,
8309 and to avoid visiting a node more than once. */
8312 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
8313 struct pointer_set_t
*pset
, walk_tree_lh lh
)
8315 enum tree_code code
;
8319 #define WALK_SUBTREE_TAIL(NODE) \
8323 goto tail_recurse; \
8328 /* Skip empty subtrees. */
8332 /* Don't walk the same tree twice, if the user has requested
8333 that we avoid doing so. */
8334 if (pset
&& pointer_set_insert (pset
, *tp
))
8337 /* Call the function. */
8339 result
= (*func
) (tp
, &walk_subtrees
, data
);
8341 /* If we found something, return it. */
8345 code
= TREE_CODE (*tp
);
8347 /* Even if we didn't, FUNC may have decided that there was nothing
8348 interesting below this point in the tree. */
8351 /* But we still need to check our siblings. */
8352 if (code
== TREE_LIST
)
8353 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
8354 else if (code
== OMP_CLAUSE
)
8355 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8362 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
8363 if (result
|| !walk_subtrees
)
8370 case IDENTIFIER_NODE
:
8377 case PLACEHOLDER_EXPR
:
8381 /* None of these have subtrees other than those already walked
8386 WALK_SUBTREE (TREE_VALUE (*tp
));
8387 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
8392 int len
= TREE_VEC_LENGTH (*tp
);
8397 /* Walk all elements but the first. */
8399 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
8401 /* Now walk the first one as a tail call. */
8402 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
8406 WALK_SUBTREE (TREE_REALPART (*tp
));
8407 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
8411 unsigned HOST_WIDE_INT idx
;
8412 constructor_elt
*ce
;
8415 VEC_iterate(constructor_elt
, CONSTRUCTOR_ELTS (*tp
), idx
, ce
);
8417 WALK_SUBTREE (ce
->value
);
8422 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
8427 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
8429 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
8430 into declarations that are just mentioned, rather than
8431 declared; they don't really belong to this part of the tree.
8432 And, we can see cycles: the initializer for a declaration
8433 can refer to the declaration itself. */
8434 WALK_SUBTREE (DECL_INITIAL (decl
));
8435 WALK_SUBTREE (DECL_SIZE (decl
));
8436 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
8438 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
8441 case STATEMENT_LIST
:
8443 tree_stmt_iterator i
;
8444 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
8445 WALK_SUBTREE (*tsi_stmt_ptr (i
));
8450 switch (OMP_CLAUSE_CODE (*tp
))
8452 case OMP_CLAUSE_PRIVATE
:
8453 case OMP_CLAUSE_SHARED
:
8454 case OMP_CLAUSE_FIRSTPRIVATE
:
8455 case OMP_CLAUSE_LASTPRIVATE
:
8456 case OMP_CLAUSE_COPYIN
:
8457 case OMP_CLAUSE_COPYPRIVATE
:
8459 case OMP_CLAUSE_NUM_THREADS
:
8460 case OMP_CLAUSE_SCHEDULE
:
8461 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
8464 case OMP_CLAUSE_NOWAIT
:
8465 case OMP_CLAUSE_ORDERED
:
8466 case OMP_CLAUSE_DEFAULT
:
8467 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8469 case OMP_CLAUSE_REDUCTION
:
8472 for (i
= 0; i
< 4; i
++)
8473 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
8474 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
8486 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
8487 But, we only want to walk once. */
8488 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
8489 for (i
= 0; i
< len
; ++i
)
8490 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
8491 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
8495 /* If this is a TYPE_DECL, walk into the fields of the type that it's
8496 defining. We only want to walk into these fields of a type in this
8497 case and not in the general case of a mere reference to the type.
8499 The criterion is as follows: if the field can be an expression, it
8500 must be walked only here. This should be in keeping with the fields
8501 that are directly gimplified in gimplify_type_sizes in order for the
8502 mark/copy-if-shared/unmark machinery of the gimplifier to work with
8503 variable-sized types.
8505 Note that DECLs get walked as part of processing the BIND_EXPR. */
8506 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
8508 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
8509 if (TREE_CODE (*type_p
) == ERROR_MARK
)
8512 /* Call the function for the type. See if it returns anything or
8513 doesn't want us to continue. If we are to continue, walk both
8514 the normal fields and those for the declaration case. */
8515 result
= (*func
) (type_p
, &walk_subtrees
, data
);
8516 if (result
|| !walk_subtrees
)
8519 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
8523 /* If this is a record type, also walk the fields. */
8524 if (TREE_CODE (*type_p
) == RECORD_TYPE
8525 || TREE_CODE (*type_p
) == UNION_TYPE
8526 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8530 for (field
= TYPE_FIELDS (*type_p
); field
;
8531 field
= TREE_CHAIN (field
))
8533 /* We'd like to look at the type of the field, but we can
8534 easily get infinite recursion. So assume it's pointed
8535 to elsewhere in the tree. Also, ignore things that
8537 if (TREE_CODE (field
) != FIELD_DECL
)
8540 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
8541 WALK_SUBTREE (DECL_SIZE (field
));
8542 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
8543 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
8544 WALK_SUBTREE (DECL_QUALIFIER (field
));
8548 /* Same for scalar types. */
8549 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
8550 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
8551 || TREE_CODE (*type_p
) == INTEGER_TYPE
8552 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
8553 || TREE_CODE (*type_p
) == REAL_TYPE
)
8555 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
8556 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
8559 WALK_SUBTREE (TYPE_SIZE (*type_p
));
8560 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
8565 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
))
8566 || IS_GIMPLE_STMT_CODE_CLASS (TREE_CODE_CLASS (code
)))
8570 /* Walk over all the sub-trees of this operand. */
8571 len
= TREE_OPERAND_LENGTH (*tp
);
8573 /* Go through the subtrees. We need to do this in forward order so
8574 that the scope of a FOR_EXPR is handled properly. */
8577 for (i
= 0; i
< len
- 1; ++i
)
8578 WALK_SUBTREE (GENERIC_TREE_OPERAND (*tp
, i
));
8579 WALK_SUBTREE_TAIL (GENERIC_TREE_OPERAND (*tp
, len
- 1));
8582 /* If this is a type, walk the needed fields in the type. */
8583 else if (TYPE_P (*tp
))
8584 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
8588 /* We didn't find what we were looking for. */
8591 #undef WALK_SUBTREE_TAIL
8595 /* Like walk_tree, but does not walk duplicate nodes more than once. */
8598 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
8602 struct pointer_set_t
*pset
;
8604 pset
= pointer_set_create ();
8605 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
8606 pointer_set_destroy (pset
);
8611 /* Return true if STMT is an empty statement or contains nothing but
8612 empty statements. */
8615 empty_body_p (tree stmt
)
8617 tree_stmt_iterator i
;
8620 if (IS_EMPTY_STMT (stmt
))
8622 else if (TREE_CODE (stmt
) == BIND_EXPR
)
8623 body
= BIND_EXPR_BODY (stmt
);
8624 else if (TREE_CODE (stmt
) == STATEMENT_LIST
)
8629 for (i
= tsi_start (body
); !tsi_end_p (i
); tsi_next (&i
))
8630 if (!empty_body_p (tsi_stmt (i
)))
8639 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
8641 if (IS_EXPR_CODE_CLASS (c
))
8642 return &t
->exp
.block
;
8643 else if (IS_GIMPLE_STMT_CODE_CLASS (c
))
8644 return &GIMPLE_STMT_BLOCK (t
);
8650 generic_tree_operand (tree node
, int i
)
8652 if (GIMPLE_STMT_P (node
))
8653 return &GIMPLE_STMT_OPERAND (node
, i
);
8654 return &TREE_OPERAND (node
, i
);
8658 generic_tree_type (tree node
)
8660 if (GIMPLE_STMT_P (node
))
8661 return &void_type_node
;
8662 return &TREE_TYPE (node
);
8665 /* Build and return a TREE_LIST of arguments in the CALL_EXPR exp.
8666 FIXME: don't use this function. It exists for compatibility with
8667 the old representation of CALL_EXPRs where a list was used to hold the
8668 arguments. Places that currently extract the arglist from a CALL_EXPR
8669 ought to be rewritten to use the CALL_EXPR itself. */
8671 call_expr_arglist (tree exp
)
8673 tree arglist
= NULL_TREE
;
8675 for (i
= call_expr_nargs (exp
) - 1; i
>= 0; i
--)
8676 arglist
= tree_cons (NULL_TREE
, CALL_EXPR_ARG (exp
, i
), arglist
);
8680 /* Return true if TYPE has a variable argument list. */
8683 stdarg_p (tree fntype
)
8685 function_args_iterator args_iter
;
8686 tree n
= NULL_TREE
, t
;
8691 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
8696 return n
!= NULL_TREE
&& n
!= void_type_node
;
8699 /* Return true if TYPE has a prototype. */
8702 prototype_p (tree fntype
)
8706 gcc_assert (fntype
!= NULL_TREE
);
8708 t
= TYPE_ARG_TYPES (fntype
);
8709 return (t
!= NULL_TREE
);
8712 /* Return the number of arguments that a function has. */
8715 function_args_count (tree fntype
)
8717 function_args_iterator args_iter
;
8723 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
8732 /* If BLOCK is inlined from an __attribute__((__artificial__))
8733 routine, return pointer to location from where it has been
8736 block_nonartificial_location (tree block
)
8738 location_t
*ret
= NULL
;
8740 while (block
&& TREE_CODE (block
) == BLOCK
8741 && BLOCK_ABSTRACT_ORIGIN (block
))
8743 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
8745 while (TREE_CODE (ao
) == BLOCK
&& BLOCK_ABSTRACT_ORIGIN (ao
))
8746 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
8748 if (TREE_CODE (ao
) == FUNCTION_DECL
)
8750 /* If AO is an artificial inline, point RET to the
8751 call site locus at which it has been inlined and continue
8752 the loop, in case AO's caller is also an artificial
8754 if (DECL_DECLARED_INLINE_P (ao
)
8755 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
8756 ret
= &BLOCK_SOURCE_LOCATION (block
);
8760 else if (TREE_CODE (ao
) != BLOCK
)
8763 block
= BLOCK_SUPERCONTEXT (block
);
8768 #include "gt-tree.h"