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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
54 /* Each tree code class has an associated string representation.
55 These must correspond to the tree_code_class entries. */
57 const char *const tree_code_class_strings
[] =
71 /* obstack.[ch] explicitly declined to prototype this. */
72 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
74 #ifdef GATHER_STATISTICS
75 /* Statistics-gathering stuff. */
77 int tree_node_counts
[(int) all_kinds
];
78 int tree_node_sizes
[(int) all_kinds
];
80 /* Keep in sync with tree.h:enum tree_node_kind. */
81 static const char * const tree_node_kind_names
[] = {
100 #endif /* GATHER_STATISTICS */
102 /* Unique id for next decl created. */
103 static GTY(()) int next_decl_uid
;
104 /* Unique id for next type created. */
105 static GTY(()) int next_type_uid
= 1;
107 /* Since we cannot rehash a type after it is in the table, we have to
108 keep the hash code. */
110 struct type_hash
GTY(())
116 /* Initial size of the hash table (rounded to next prime). */
117 #define TYPE_HASH_INITIAL_SIZE 1000
119 /* Now here is the hash table. When recording a type, it is added to
120 the slot whose index is the hash code. Note that the hash table is
121 used for several kinds of types (function types, array types and
122 array index range types, for now). While all these live in the
123 same table, they are completely independent, and the hash code is
124 computed differently for each of these. */
126 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
127 htab_t type_hash_table
;
129 /* Hash table and temporary node for larger integer const values. */
130 static GTY (()) tree int_cst_node
;
131 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
132 htab_t int_cst_hash_table
;
134 /* General tree->tree mapping structure for use in hash tables. */
136 struct tree_map
GTY(())
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 void set_type_quals (tree
, int);
150 static int type_hash_eq (const void *, const void *);
151 static hashval_t
type_hash_hash (const void *);
152 static int tree_map_eq (const void *, const void *);
153 static hashval_t
tree_map_hash (const void *);
154 static hashval_t
int_cst_hash_hash (const void *);
155 static int int_cst_hash_eq (const void *, const void *);
156 static void print_type_hash_statistics (void);
157 static void print_debug_expr_statistics (void);
158 static void print_value_expr_statistics (void);
159 static tree
make_vector_type (tree
, int, enum machine_mode
);
160 static int type_hash_marked_p (const void *);
161 static int tree_map_marked_p (const void *);
162 static unsigned int type_hash_list (tree
, hashval_t
);
163 static unsigned int attribute_hash_list (tree
, hashval_t
);
165 tree global_trees
[TI_MAX
];
166 tree integer_types
[itk_none
];
174 /* Initialize the hash table of types. */
175 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
178 debug_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
181 value_expr_for_decl
= htab_create_ggc (512, tree_map_hash
,
184 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
185 int_cst_hash_eq
, NULL
);
187 int_cst_node
= make_node (INTEGER_CST
);
192 /* The name of the object as the assembler will see it (but before any
193 translations made by ASM_OUTPUT_LABELREF). Often this is the same
194 as DECL_NAME. It is an IDENTIFIER_NODE. */
196 decl_assembler_name (tree decl
)
198 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
199 lang_hooks
.set_decl_assembler_name (decl
);
200 return DECL_CHECK (decl
)->decl
.assembler_name
;
203 /* Compute the number of bytes occupied by a tree with code CODE.
204 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
205 codes, which are of variable length. */
207 tree_code_size (enum tree_code code
)
209 switch (TREE_CODE_CLASS (code
))
211 case tcc_declaration
: /* A decl node */
212 return sizeof (struct tree_decl
);
214 case tcc_type
: /* a type node */
215 return sizeof (struct tree_type
);
217 case tcc_reference
: /* a reference */
218 case tcc_expression
: /* an expression */
219 case tcc_statement
: /* an expression with side effects */
220 case tcc_comparison
: /* a comparison expression */
221 case tcc_unary
: /* a unary arithmetic expression */
222 case tcc_binary
: /* a binary arithmetic expression */
223 return (sizeof (struct tree_exp
)
224 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
226 case tcc_constant
: /* a constant */
229 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
230 case REAL_CST
: return sizeof (struct tree_real_cst
);
231 case COMPLEX_CST
: return sizeof (struct tree_complex
);
232 case VECTOR_CST
: return sizeof (struct tree_vector
);
233 case STRING_CST
: gcc_unreachable ();
235 return lang_hooks
.tree_size (code
);
238 case tcc_exceptional
: /* something random, like an identifier. */
241 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
242 case TREE_LIST
: return sizeof (struct tree_list
);
245 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
248 case PHI_NODE
: gcc_unreachable ();
250 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
252 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
253 case BLOCK
: return sizeof (struct tree_block
);
254 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
257 return lang_hooks
.tree_size (code
);
265 /* Compute the number of bytes occupied by NODE. This routine only
266 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
268 tree_size (tree node
)
270 enum tree_code code
= TREE_CODE (node
);
274 return (sizeof (struct tree_phi_node
)
275 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
278 return (offsetof (struct tree_binfo
, base_binfos
)
279 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
282 return (sizeof (struct tree_vec
)
283 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
286 return sizeof (struct tree_string
) + TREE_STRING_LENGTH (node
) - 1;
289 return tree_code_size (code
);
293 /* Return a newly allocated node of code CODE. For decl and type
294 nodes, some other fields are initialized. The rest of the node is
295 initialized to zero. This function cannot be used for PHI_NODE or
296 TREE_VEC nodes, which is enforced by asserts in tree_code_size.
298 Achoo! I got a code in the node. */
301 make_node_stat (enum tree_code code MEM_STAT_DECL
)
304 enum tree_code_class type
= TREE_CODE_CLASS (code
);
305 size_t length
= tree_code_size (code
);
306 #ifdef GATHER_STATISTICS
311 case tcc_declaration
: /* A decl node */
315 case tcc_type
: /* a type node */
319 case tcc_statement
: /* an expression with side effects */
323 case tcc_reference
: /* a reference */
327 case tcc_expression
: /* an expression */
328 case tcc_comparison
: /* a comparison expression */
329 case tcc_unary
: /* a unary arithmetic expression */
330 case tcc_binary
: /* a binary arithmetic expression */
334 case tcc_constant
: /* a constant */
338 case tcc_exceptional
: /* something random, like an identifier. */
341 case IDENTIFIER_NODE
:
358 kind
= ssa_name_kind
;
375 tree_node_counts
[(int) kind
]++;
376 tree_node_sizes
[(int) kind
] += length
;
379 if (code
== IDENTIFIER_NODE
)
380 t
= ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
382 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
384 memset (t
, 0, length
);
386 TREE_SET_CODE (t
, code
);
391 TREE_SIDE_EFFECTS (t
) = 1;
394 case tcc_declaration
:
395 if (code
!= FUNCTION_DECL
)
397 DECL_USER_ALIGN (t
) = 0;
398 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
399 DECL_SOURCE_LOCATION (t
) = input_location
;
400 DECL_UID (t
) = next_decl_uid
++;
402 /* We have not yet computed the alias set for this declaration. */
403 DECL_POINTER_ALIAS_SET (t
) = -1;
407 TYPE_UID (t
) = next_type_uid
++;
408 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
409 TYPE_USER_ALIGN (t
) = 0;
410 TYPE_MAIN_VARIANT (t
) = t
;
412 /* Default to no attributes for type, but let target change that. */
413 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
414 targetm
.set_default_type_attributes (t
);
416 /* We have not yet computed the alias set for this type. */
417 TYPE_ALIAS_SET (t
) = -1;
421 TREE_CONSTANT (t
) = 1;
422 TREE_INVARIANT (t
) = 1;
431 case PREDECREMENT_EXPR
:
432 case PREINCREMENT_EXPR
:
433 case POSTDECREMENT_EXPR
:
434 case POSTINCREMENT_EXPR
:
435 /* All of these have side-effects, no matter what their
437 TREE_SIDE_EFFECTS (t
) = 1;
446 /* Other classes need no special treatment. */
453 /* Return a new node with the same contents as NODE except that its
454 TREE_CHAIN is zero and it has a fresh uid. */
457 copy_node_stat (tree node MEM_STAT_DECL
)
460 enum tree_code code
= TREE_CODE (node
);
463 gcc_assert (code
!= STATEMENT_LIST
);
465 length
= tree_size (node
);
466 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
467 memcpy (t
, node
, length
);
470 TREE_ASM_WRITTEN (t
) = 0;
471 TREE_VISITED (t
) = 0;
474 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
476 DECL_UID (t
) = next_decl_uid
++;
477 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
478 && DECL_HAS_VALUE_EXPR_P (node
))
480 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
481 DECL_HAS_VALUE_EXPR_P (t
) = 1;
485 else if (TREE_CODE_CLASS (code
) == tcc_type
)
487 TYPE_UID (t
) = next_type_uid
++;
488 /* The following is so that the debug code for
489 the copy is different from the original type.
490 The two statements usually duplicate each other
491 (because they clear fields of the same union),
492 but the optimizer should catch that. */
493 TYPE_SYMTAB_POINTER (t
) = 0;
494 TYPE_SYMTAB_ADDRESS (t
) = 0;
496 /* Do not copy the values cache. */
497 if (TYPE_CACHED_VALUES_P(t
))
499 TYPE_CACHED_VALUES_P (t
) = 0;
500 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
507 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
508 For example, this can copy a list made of TREE_LIST nodes. */
511 copy_list (tree list
)
519 head
= prev
= copy_node (list
);
520 next
= TREE_CHAIN (list
);
523 TREE_CHAIN (prev
) = copy_node (next
);
524 prev
= TREE_CHAIN (prev
);
525 next
= TREE_CHAIN (next
);
531 /* Create an INT_CST node with a LOW value sign extended. */
534 build_int_cst (tree type
, HOST_WIDE_INT low
)
536 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
539 /* Create an INT_CST node with a LOW value zero extended. */
542 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
544 return build_int_cst_wide (type
, low
, 0);
547 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
548 if it is negative. This function is similar to build_int_cst, but
549 the extra bits outside of the type precision are cleared. Constants
550 with these extra bits may confuse the fold so that it detects overflows
551 even in cases when they do not occur, and in general should be avoided.
552 We cannot however make this a default behavior of build_int_cst without
553 more intrusive changes, since there are parts of gcc that rely on the extra
554 precision of the integer constants. */
557 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
559 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
560 unsigned HOST_WIDE_INT hi
, mask
;
566 type
= integer_type_node
;
568 bits
= TYPE_PRECISION (type
);
569 signed_p
= !TYPE_UNSIGNED (type
);
571 if (bits
>= HOST_BITS_PER_WIDE_INT
)
572 negative
= (low
< 0);
575 /* If the sign bit is inside precision of LOW, use it to determine
576 the sign of the constant. */
577 negative
= ((val
>> (bits
- 1)) & 1) != 0;
579 /* Mask out the bits outside of the precision of the constant. */
580 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
582 if (signed_p
&& negative
)
588 /* Determine the high bits. */
589 hi
= (negative
? ~(unsigned HOST_WIDE_INT
) 0 : 0);
591 /* For unsigned type we need to mask out the bits outside of the type
595 if (bits
<= HOST_BITS_PER_WIDE_INT
)
599 bits
-= HOST_BITS_PER_WIDE_INT
;
600 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
605 return build_int_cst_wide (type
, val
, hi
);
608 /* These are the hash table functions for the hash table of INTEGER_CST
609 nodes of a sizetype. */
611 /* Return the hash code code X, an INTEGER_CST. */
614 int_cst_hash_hash (const void *x
)
618 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
619 ^ htab_hash_pointer (TREE_TYPE (t
)));
622 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
623 is the same as that given by *Y, which is the same. */
626 int_cst_hash_eq (const void *x
, const void *y
)
631 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
632 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
633 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
636 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
637 integer_type_node is used. The returned node is always shared.
638 For small integers we use a per-type vector cache, for larger ones
639 we use a single hash table. */
642 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
649 type
= integer_type_node
;
651 switch (TREE_CODE (type
))
655 /* Cache NULL pointer. */
664 /* Cache false or true. */
673 if (TYPE_UNSIGNED (type
))
676 limit
= INTEGER_SHARE_LIMIT
;
677 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
683 limit
= INTEGER_SHARE_LIMIT
+ 1;
684 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
686 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
696 /* Look for it in the type's vector of small shared ints. */
697 if (!TYPE_CACHED_VALUES_P (type
))
699 TYPE_CACHED_VALUES_P (type
) = 1;
700 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
703 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
706 /* Make sure no one is clobbering the shared constant. */
707 gcc_assert (TREE_TYPE (t
) == type
);
708 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
709 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
713 /* Create a new shared int. */
714 t
= make_node (INTEGER_CST
);
716 TREE_INT_CST_LOW (t
) = low
;
717 TREE_INT_CST_HIGH (t
) = hi
;
718 TREE_TYPE (t
) = type
;
720 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
725 /* Use the cache of larger shared ints. */
728 TREE_INT_CST_LOW (int_cst_node
) = low
;
729 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
730 TREE_TYPE (int_cst_node
) = type
;
732 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
736 /* Insert this one into the hash table. */
739 /* Make a new node for next time round. */
740 int_cst_node
= make_node (INTEGER_CST
);
747 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
748 and the rest are zeros. */
751 build_low_bits_mask (tree type
, unsigned bits
)
753 unsigned HOST_WIDE_INT low
;
755 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
757 gcc_assert (bits
<= TYPE_PRECISION (type
));
759 if (bits
== TYPE_PRECISION (type
)
760 && !TYPE_UNSIGNED (type
))
762 /* Sign extended all-ones mask. */
766 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
768 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
773 bits
-= HOST_BITS_PER_WIDE_INT
;
775 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
778 return build_int_cst_wide (type
, low
, high
);
781 /* Checks that X is integer constant that can be expressed in (unsigned)
782 HOST_WIDE_INT without loss of precision. */
785 cst_and_fits_in_hwi (tree x
)
787 if (TREE_CODE (x
) != INTEGER_CST
)
790 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
793 return (TREE_INT_CST_HIGH (x
) == 0
794 || TREE_INT_CST_HIGH (x
) == -1);
797 /* Return a new VECTOR_CST node whose type is TYPE and whose values
798 are in a list pointed by VALS. */
801 build_vector (tree type
, tree vals
)
803 tree v
= make_node (VECTOR_CST
);
804 int over1
= 0, over2
= 0;
807 TREE_VECTOR_CST_ELTS (v
) = vals
;
808 TREE_TYPE (v
) = type
;
810 /* Iterate through elements and check for overflow. */
811 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
813 tree value
= TREE_VALUE (link
);
815 over1
|= TREE_OVERFLOW (value
);
816 over2
|= TREE_CONSTANT_OVERFLOW (value
);
819 TREE_OVERFLOW (v
) = over1
;
820 TREE_CONSTANT_OVERFLOW (v
) = over2
;
825 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
826 are in a list pointed to by VALS. */
828 build_constructor (tree type
, tree vals
)
830 tree c
= make_node (CONSTRUCTOR
);
831 TREE_TYPE (c
) = type
;
832 CONSTRUCTOR_ELTS (c
) = vals
;
834 /* ??? May not be necessary. Mirrors what build does. */
837 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
838 TREE_READONLY (c
) = TREE_READONLY (vals
);
839 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
840 TREE_INVARIANT (c
) = TREE_INVARIANT (vals
);
846 /* Return a new REAL_CST node whose type is TYPE and value is D. */
849 build_real (tree type
, REAL_VALUE_TYPE d
)
855 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
856 Consider doing it via real_convert now. */
858 v
= make_node (REAL_CST
);
859 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
860 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
862 TREE_TYPE (v
) = type
;
863 TREE_REAL_CST_PTR (v
) = dp
;
864 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
868 /* Return a new REAL_CST node whose type is TYPE
869 and whose value is the integer value of the INTEGER_CST node I. */
872 real_value_from_int_cst (tree type
, tree i
)
876 /* Clear all bits of the real value type so that we can later do
877 bitwise comparisons to see if two values are the same. */
878 memset (&d
, 0, sizeof d
);
880 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
881 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
882 TYPE_UNSIGNED (TREE_TYPE (i
)));
886 /* Given a tree representing an integer constant I, return a tree
887 representing the same value as a floating-point constant of type TYPE. */
890 build_real_from_int_cst (tree type
, tree i
)
893 int overflow
= TREE_OVERFLOW (i
);
895 v
= build_real (type
, real_value_from_int_cst (type
, i
));
897 TREE_OVERFLOW (v
) |= overflow
;
898 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
902 /* Return a newly constructed STRING_CST node whose value is
903 the LEN characters at STR.
904 The TREE_TYPE is not initialized. */
907 build_string (int len
, const char *str
)
912 length
= len
+ sizeof (struct tree_string
);
914 #ifdef GATHER_STATISTICS
915 tree_node_counts
[(int) c_kind
]++;
916 tree_node_sizes
[(int) c_kind
] += length
;
919 s
= ggc_alloc_tree (length
);
921 memset (s
, 0, sizeof (struct tree_common
));
922 TREE_SET_CODE (s
, STRING_CST
);
923 TREE_STRING_LENGTH (s
) = len
;
924 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
925 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
930 /* Return a newly constructed COMPLEX_CST node whose value is
931 specified by the real and imaginary parts REAL and IMAG.
932 Both REAL and IMAG should be constant nodes. TYPE, if specified,
933 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
936 build_complex (tree type
, tree real
, tree imag
)
938 tree t
= make_node (COMPLEX_CST
);
940 TREE_REALPART (t
) = real
;
941 TREE_IMAGPART (t
) = imag
;
942 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
943 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
944 TREE_CONSTANT_OVERFLOW (t
)
945 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
949 /* Build a BINFO with LEN language slots. */
952 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
955 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
956 + VEC_embedded_size (tree
, base_binfos
));
958 #ifdef GATHER_STATISTICS
959 tree_node_counts
[(int) binfo_kind
]++;
960 tree_node_sizes
[(int) binfo_kind
] += length
;
963 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
965 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
967 TREE_SET_CODE (t
, TREE_BINFO
);
969 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
975 /* Build a newly constructed TREE_VEC node of length LEN. */
978 make_tree_vec_stat (int len MEM_STAT_DECL
)
981 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
983 #ifdef GATHER_STATISTICS
984 tree_node_counts
[(int) vec_kind
]++;
985 tree_node_sizes
[(int) vec_kind
] += length
;
988 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
990 memset (t
, 0, length
);
992 TREE_SET_CODE (t
, TREE_VEC
);
993 TREE_VEC_LENGTH (t
) = len
;
998 /* Return 1 if EXPR is the integer constant zero or a complex constant
1002 integer_zerop (tree expr
)
1006 return ((TREE_CODE (expr
) == INTEGER_CST
1007 && ! TREE_CONSTANT_OVERFLOW (expr
)
1008 && TREE_INT_CST_LOW (expr
) == 0
1009 && TREE_INT_CST_HIGH (expr
) == 0)
1010 || (TREE_CODE (expr
) == COMPLEX_CST
1011 && integer_zerop (TREE_REALPART (expr
))
1012 && integer_zerop (TREE_IMAGPART (expr
))));
1015 /* Return 1 if EXPR is the integer constant one or the corresponding
1016 complex constant. */
1019 integer_onep (tree expr
)
1023 return ((TREE_CODE (expr
) == INTEGER_CST
1024 && ! TREE_CONSTANT_OVERFLOW (expr
)
1025 && TREE_INT_CST_LOW (expr
) == 1
1026 && TREE_INT_CST_HIGH (expr
) == 0)
1027 || (TREE_CODE (expr
) == COMPLEX_CST
1028 && integer_onep (TREE_REALPART (expr
))
1029 && integer_zerop (TREE_IMAGPART (expr
))));
1032 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1033 it contains. Likewise for the corresponding complex constant. */
1036 integer_all_onesp (tree expr
)
1043 if (TREE_CODE (expr
) == COMPLEX_CST
1044 && integer_all_onesp (TREE_REALPART (expr
))
1045 && integer_zerop (TREE_IMAGPART (expr
)))
1048 else if (TREE_CODE (expr
) != INTEGER_CST
1049 || TREE_CONSTANT_OVERFLOW (expr
))
1052 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1054 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1055 && TREE_INT_CST_HIGH (expr
) == -1);
1057 /* Note that using TYPE_PRECISION here is wrong. We care about the
1058 actual bits, not the (arbitrary) range of the type. */
1059 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1060 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1062 HOST_WIDE_INT high_value
;
1065 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1067 /* Can not handle precisions greater than twice the host int size. */
1068 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1069 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1070 /* Shifting by the host word size is undefined according to the ANSI
1071 standard, so we must handle this as a special case. */
1074 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1076 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1077 && TREE_INT_CST_HIGH (expr
) == high_value
);
1080 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1083 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1087 integer_pow2p (tree expr
)
1090 HOST_WIDE_INT high
, low
;
1094 if (TREE_CODE (expr
) == COMPLEX_CST
1095 && integer_pow2p (TREE_REALPART (expr
))
1096 && integer_zerop (TREE_IMAGPART (expr
)))
1099 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1102 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1103 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1104 high
= TREE_INT_CST_HIGH (expr
);
1105 low
= TREE_INT_CST_LOW (expr
);
1107 /* First clear all bits that are beyond the type's precision in case
1108 we've been sign extended. */
1110 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1112 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1113 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1117 if (prec
< HOST_BITS_PER_WIDE_INT
)
1118 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1121 if (high
== 0 && low
== 0)
1124 return ((high
== 0 && (low
& (low
- 1)) == 0)
1125 || (low
== 0 && (high
& (high
- 1)) == 0));
1128 /* Return 1 if EXPR is an integer constant other than zero or a
1129 complex constant other than zero. */
1132 integer_nonzerop (tree expr
)
1136 return ((TREE_CODE (expr
) == INTEGER_CST
1137 && ! TREE_CONSTANT_OVERFLOW (expr
)
1138 && (TREE_INT_CST_LOW (expr
) != 0
1139 || TREE_INT_CST_HIGH (expr
) != 0))
1140 || (TREE_CODE (expr
) == COMPLEX_CST
1141 && (integer_nonzerop (TREE_REALPART (expr
))
1142 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1145 /* Return the power of two represented by a tree node known to be a
1149 tree_log2 (tree expr
)
1152 HOST_WIDE_INT high
, low
;
1156 if (TREE_CODE (expr
) == COMPLEX_CST
)
1157 return tree_log2 (TREE_REALPART (expr
));
1159 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1160 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1162 high
= TREE_INT_CST_HIGH (expr
);
1163 low
= TREE_INT_CST_LOW (expr
);
1165 /* First clear all bits that are beyond the type's precision in case
1166 we've been sign extended. */
1168 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1170 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1171 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1175 if (prec
< HOST_BITS_PER_WIDE_INT
)
1176 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1179 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1180 : exact_log2 (low
));
1183 /* Similar, but return the largest integer Y such that 2 ** Y is less
1184 than or equal to EXPR. */
1187 tree_floor_log2 (tree expr
)
1190 HOST_WIDE_INT high
, low
;
1194 if (TREE_CODE (expr
) == COMPLEX_CST
)
1195 return tree_log2 (TREE_REALPART (expr
));
1197 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1198 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1200 high
= TREE_INT_CST_HIGH (expr
);
1201 low
= TREE_INT_CST_LOW (expr
);
1203 /* First clear all bits that are beyond the type's precision in case
1204 we've been sign extended. Ignore if type's precision hasn't been set
1205 since what we are doing is setting it. */
1207 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1209 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1210 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1214 if (prec
< HOST_BITS_PER_WIDE_INT
)
1215 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1218 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1219 : floor_log2 (low
));
1222 /* Return 1 if EXPR is the real constant zero. */
1225 real_zerop (tree expr
)
1229 return ((TREE_CODE (expr
) == REAL_CST
1230 && ! TREE_CONSTANT_OVERFLOW (expr
)
1231 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1232 || (TREE_CODE (expr
) == COMPLEX_CST
1233 && real_zerop (TREE_REALPART (expr
))
1234 && real_zerop (TREE_IMAGPART (expr
))));
1237 /* Return 1 if EXPR is the real constant one in real or complex form. */
1240 real_onep (tree expr
)
1244 return ((TREE_CODE (expr
) == REAL_CST
1245 && ! TREE_CONSTANT_OVERFLOW (expr
)
1246 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1247 || (TREE_CODE (expr
) == COMPLEX_CST
1248 && real_onep (TREE_REALPART (expr
))
1249 && real_zerop (TREE_IMAGPART (expr
))));
1252 /* Return 1 if EXPR is the real constant two. */
1255 real_twop (tree expr
)
1259 return ((TREE_CODE (expr
) == REAL_CST
1260 && ! TREE_CONSTANT_OVERFLOW (expr
)
1261 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1262 || (TREE_CODE (expr
) == COMPLEX_CST
1263 && real_twop (TREE_REALPART (expr
))
1264 && real_zerop (TREE_IMAGPART (expr
))));
1267 /* Return 1 if EXPR is the real constant minus one. */
1270 real_minus_onep (tree expr
)
1274 return ((TREE_CODE (expr
) == REAL_CST
1275 && ! TREE_CONSTANT_OVERFLOW (expr
)
1276 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1277 || (TREE_CODE (expr
) == COMPLEX_CST
1278 && real_minus_onep (TREE_REALPART (expr
))
1279 && real_zerop (TREE_IMAGPART (expr
))));
1282 /* Nonzero if EXP is a constant or a cast of a constant. */
1285 really_constant_p (tree exp
)
1287 /* This is not quite the same as STRIP_NOPS. It does more. */
1288 while (TREE_CODE (exp
) == NOP_EXPR
1289 || TREE_CODE (exp
) == CONVERT_EXPR
1290 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1291 exp
= TREE_OPERAND (exp
, 0);
1292 return TREE_CONSTANT (exp
);
1295 /* Return first list element whose TREE_VALUE is ELEM.
1296 Return 0 if ELEM is not in LIST. */
1299 value_member (tree elem
, tree list
)
1303 if (elem
== TREE_VALUE (list
))
1305 list
= TREE_CHAIN (list
);
1310 /* Return first list element whose TREE_PURPOSE is ELEM.
1311 Return 0 if ELEM is not in LIST. */
1314 purpose_member (tree elem
, tree list
)
1318 if (elem
== TREE_PURPOSE (list
))
1320 list
= TREE_CHAIN (list
);
1325 /* Return nonzero if ELEM is part of the chain CHAIN. */
1328 chain_member (tree elem
, tree chain
)
1334 chain
= TREE_CHAIN (chain
);
1340 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1341 We expect a null pointer to mark the end of the chain.
1342 This is the Lisp primitive `length'. */
1345 list_length (tree t
)
1348 #ifdef ENABLE_TREE_CHECKING
1356 #ifdef ENABLE_TREE_CHECKING
1359 gcc_assert (p
!= q
);
1367 /* Returns the number of FIELD_DECLs in TYPE. */
1370 fields_length (tree type
)
1372 tree t
= TYPE_FIELDS (type
);
1375 for (; t
; t
= TREE_CHAIN (t
))
1376 if (TREE_CODE (t
) == FIELD_DECL
)
1382 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1383 by modifying the last node in chain 1 to point to chain 2.
1384 This is the Lisp primitive `nconc'. */
1387 chainon (tree op1
, tree op2
)
1396 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1398 TREE_CHAIN (t1
) = op2
;
1400 #ifdef ENABLE_TREE_CHECKING
1403 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1404 gcc_assert (t2
!= t1
);
1411 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1414 tree_last (tree chain
)
1418 while ((next
= TREE_CHAIN (chain
)))
1423 /* Reverse the order of elements in the chain T,
1424 and return the new head of the chain (old last element). */
1429 tree prev
= 0, decl
, next
;
1430 for (decl
= t
; decl
; decl
= next
)
1432 next
= TREE_CHAIN (decl
);
1433 TREE_CHAIN (decl
) = prev
;
1439 /* Return a newly created TREE_LIST node whose
1440 purpose and value fields are PARM and VALUE. */
1443 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1445 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1446 TREE_PURPOSE (t
) = parm
;
1447 TREE_VALUE (t
) = value
;
1451 /* Return a newly created TREE_LIST node whose
1452 purpose and value fields are PURPOSE and VALUE
1453 and whose TREE_CHAIN is CHAIN. */
1456 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1460 node
= ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1462 memset (node
, 0, sizeof (struct tree_common
));
1464 #ifdef GATHER_STATISTICS
1465 tree_node_counts
[(int) x_kind
]++;
1466 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1469 TREE_SET_CODE (node
, TREE_LIST
);
1470 TREE_CHAIN (node
) = chain
;
1471 TREE_PURPOSE (node
) = purpose
;
1472 TREE_VALUE (node
) = value
;
1477 /* Return the size nominally occupied by an object of type TYPE
1478 when it resides in memory. The value is measured in units of bytes,
1479 and its data type is that normally used for type sizes
1480 (which is the first type created by make_signed_type or
1481 make_unsigned_type). */
1484 size_in_bytes (tree type
)
1488 if (type
== error_mark_node
)
1489 return integer_zero_node
;
1491 type
= TYPE_MAIN_VARIANT (type
);
1492 t
= TYPE_SIZE_UNIT (type
);
1496 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1497 return size_zero_node
;
1500 if (TREE_CODE (t
) == INTEGER_CST
)
1501 t
= force_fit_type (t
, 0, false, false);
1506 /* Return the size of TYPE (in bytes) as a wide integer
1507 or return -1 if the size can vary or is larger than an integer. */
1510 int_size_in_bytes (tree type
)
1514 if (type
== error_mark_node
)
1517 type
= TYPE_MAIN_VARIANT (type
);
1518 t
= TYPE_SIZE_UNIT (type
);
1520 || TREE_CODE (t
) != INTEGER_CST
1521 || TREE_OVERFLOW (t
)
1522 || TREE_INT_CST_HIGH (t
) != 0
1523 /* If the result would appear negative, it's too big to represent. */
1524 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1527 return TREE_INT_CST_LOW (t
);
1530 /* Return the bit position of FIELD, in bits from the start of the record.
1531 This is a tree of type bitsizetype. */
1534 bit_position (tree field
)
1536 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1537 DECL_FIELD_BIT_OFFSET (field
));
1540 /* Likewise, but return as an integer. It must be representable in
1541 that way (since it could be a signed value, we don't have the
1542 option of returning -1 like int_size_in_byte can. */
1545 int_bit_position (tree field
)
1547 return tree_low_cst (bit_position (field
), 0);
1550 /* Return the byte position of FIELD, in bytes from the start of the record.
1551 This is a tree of type sizetype. */
1554 byte_position (tree field
)
1556 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1557 DECL_FIELD_BIT_OFFSET (field
));
1560 /* Likewise, but return as an integer. It must be representable in
1561 that way (since it could be a signed value, we don't have the
1562 option of returning -1 like int_size_in_byte can. */
1565 int_byte_position (tree field
)
1567 return tree_low_cst (byte_position (field
), 0);
1570 /* Return the strictest alignment, in bits, that T is known to have. */
1575 unsigned int align0
, align1
;
1577 switch (TREE_CODE (t
))
1579 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1580 /* If we have conversions, we know that the alignment of the
1581 object must meet each of the alignments of the types. */
1582 align0
= expr_align (TREE_OPERAND (t
, 0));
1583 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1584 return MAX (align0
, align1
);
1586 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1587 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1588 case CLEANUP_POINT_EXPR
:
1589 /* These don't change the alignment of an object. */
1590 return expr_align (TREE_OPERAND (t
, 0));
1593 /* The best we can do is say that the alignment is the least aligned
1595 align0
= expr_align (TREE_OPERAND (t
, 1));
1596 align1
= expr_align (TREE_OPERAND (t
, 2));
1597 return MIN (align0
, align1
);
1599 case LABEL_DECL
: case CONST_DECL
:
1600 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1601 if (DECL_ALIGN (t
) != 0)
1602 return DECL_ALIGN (t
);
1606 return FUNCTION_BOUNDARY
;
1612 /* Otherwise take the alignment from that of the type. */
1613 return TYPE_ALIGN (TREE_TYPE (t
));
1616 /* Return, as a tree node, the number of elements for TYPE (which is an
1617 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1620 array_type_nelts (tree type
)
1622 tree index_type
, min
, max
;
1624 /* If they did it with unspecified bounds, then we should have already
1625 given an error about it before we got here. */
1626 if (! TYPE_DOMAIN (type
))
1627 return error_mark_node
;
1629 index_type
= TYPE_DOMAIN (type
);
1630 min
= TYPE_MIN_VALUE (index_type
);
1631 max
= TYPE_MAX_VALUE (index_type
);
1633 return (integer_zerop (min
)
1635 : fold (build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1638 /* If arg is static -- a reference to an object in static storage -- then
1639 return the object. This is not the same as the C meaning of `static'.
1640 If arg isn't static, return NULL. */
1645 switch (TREE_CODE (arg
))
1648 /* Nested functions are static, even though taking their address will
1649 involve a trampoline as we unnest the nested function and create
1650 the trampoline on the tree level. */
1654 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1655 && ! DECL_THREAD_LOCAL (arg
)
1656 && ! DECL_NON_ADDR_CONST_P (arg
)
1660 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1664 return TREE_STATIC (arg
) ? arg
: NULL
;
1671 /* If the thing being referenced is not a field, then it is
1672 something language specific. */
1673 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1674 return (*lang_hooks
.staticp
) (arg
);
1676 /* If we are referencing a bitfield, we can't evaluate an
1677 ADDR_EXPR at compile time and so it isn't a constant. */
1678 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1681 return staticp (TREE_OPERAND (arg
, 0));
1686 case MISALIGNED_INDIRECT_REF
:
1687 case ALIGN_INDIRECT_REF
:
1689 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
1692 case ARRAY_RANGE_REF
:
1693 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1694 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1695 return staticp (TREE_OPERAND (arg
, 0));
1700 if ((unsigned int) TREE_CODE (arg
)
1701 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1702 return lang_hooks
.staticp (arg
);
1708 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1709 Do this to any expression which may be used in more than one place,
1710 but must be evaluated only once.
1712 Normally, expand_expr would reevaluate the expression each time.
1713 Calling save_expr produces something that is evaluated and recorded
1714 the first time expand_expr is called on it. Subsequent calls to
1715 expand_expr just reuse the recorded value.
1717 The call to expand_expr that generates code that actually computes
1718 the value is the first call *at compile time*. Subsequent calls
1719 *at compile time* generate code to use the saved value.
1720 This produces correct result provided that *at run time* control
1721 always flows through the insns made by the first expand_expr
1722 before reaching the other places where the save_expr was evaluated.
1723 You, the caller of save_expr, must make sure this is so.
1725 Constants, and certain read-only nodes, are returned with no
1726 SAVE_EXPR because that is safe. Expressions containing placeholders
1727 are not touched; see tree.def for an explanation of what these
1731 save_expr (tree expr
)
1733 tree t
= fold (expr
);
1736 /* If the tree evaluates to a constant, then we don't want to hide that
1737 fact (i.e. this allows further folding, and direct checks for constants).
1738 However, a read-only object that has side effects cannot be bypassed.
1739 Since it is no problem to reevaluate literals, we just return the
1741 inner
= skip_simple_arithmetic (t
);
1743 if (TREE_INVARIANT (inner
)
1744 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1745 || TREE_CODE (inner
) == SAVE_EXPR
1746 || TREE_CODE (inner
) == ERROR_MARK
)
1749 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1750 it means that the size or offset of some field of an object depends on
1751 the value within another field.
1753 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1754 and some variable since it would then need to be both evaluated once and
1755 evaluated more than once. Front-ends must assure this case cannot
1756 happen by surrounding any such subexpressions in their own SAVE_EXPR
1757 and forcing evaluation at the proper time. */
1758 if (contains_placeholder_p (inner
))
1761 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
1763 /* This expression might be placed ahead of a jump to ensure that the
1764 value was computed on both sides of the jump. So make sure it isn't
1765 eliminated as dead. */
1766 TREE_SIDE_EFFECTS (t
) = 1;
1767 TREE_INVARIANT (t
) = 1;
1771 /* Look inside EXPR and into any simple arithmetic operations. Return
1772 the innermost non-arithmetic node. */
1775 skip_simple_arithmetic (tree expr
)
1779 /* We don't care about whether this can be used as an lvalue in this
1781 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1782 expr
= TREE_OPERAND (expr
, 0);
1784 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1785 a constant, it will be more efficient to not make another SAVE_EXPR since
1786 it will allow better simplification and GCSE will be able to merge the
1787 computations if they actually occur. */
1791 if (UNARY_CLASS_P (inner
))
1792 inner
= TREE_OPERAND (inner
, 0);
1793 else if (BINARY_CLASS_P (inner
))
1795 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
1796 inner
= TREE_OPERAND (inner
, 0);
1797 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
1798 inner
= TREE_OPERAND (inner
, 1);
1809 /* Return which tree structure is used by T. */
1811 enum tree_node_structure_enum
1812 tree_node_structure (tree t
)
1814 enum tree_code code
= TREE_CODE (t
);
1816 switch (TREE_CODE_CLASS (code
))
1818 case tcc_declaration
:
1823 case tcc_comparison
:
1826 case tcc_expression
:
1829 default: /* tcc_constant and tcc_exceptional */
1834 /* tcc_constant cases. */
1835 case INTEGER_CST
: return TS_INT_CST
;
1836 case REAL_CST
: return TS_REAL_CST
;
1837 case COMPLEX_CST
: return TS_COMPLEX
;
1838 case VECTOR_CST
: return TS_VECTOR
;
1839 case STRING_CST
: return TS_STRING
;
1840 /* tcc_exceptional cases. */
1841 case ERROR_MARK
: return TS_COMMON
;
1842 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1843 case TREE_LIST
: return TS_LIST
;
1844 case TREE_VEC
: return TS_VEC
;
1845 case PHI_NODE
: return TS_PHI_NODE
;
1846 case SSA_NAME
: return TS_SSA_NAME
;
1847 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1848 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
1849 case BLOCK
: return TS_BLOCK
;
1850 case TREE_BINFO
: return TS_BINFO
;
1851 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
1858 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1859 or offset that depends on a field within a record. */
1862 contains_placeholder_p (tree exp
)
1864 enum tree_code code
;
1869 code
= TREE_CODE (exp
);
1870 if (code
== PLACEHOLDER_EXPR
)
1873 switch (TREE_CODE_CLASS (code
))
1876 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1877 position computations since they will be converted into a
1878 WITH_RECORD_EXPR involving the reference, which will assume
1879 here will be valid. */
1880 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1882 case tcc_exceptional
:
1883 if (code
== TREE_LIST
)
1884 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
1885 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
1890 case tcc_comparison
:
1891 case tcc_expression
:
1895 /* Ignoring the first operand isn't quite right, but works best. */
1896 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1899 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1900 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
1901 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
1907 switch (TREE_CODE_LENGTH (code
))
1910 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1912 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1913 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
1924 /* Return true if any part of the computation of TYPE involves a
1925 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
1926 (for QUAL_UNION_TYPE) and field positions. */
1929 type_contains_placeholder_1 (tree type
)
1931 /* If the size contains a placeholder or the parent type (component type in
1932 the case of arrays) type involves a placeholder, this type does. */
1933 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1934 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
1935 || (TREE_TYPE (type
) != 0
1936 && type_contains_placeholder_p (TREE_TYPE (type
))))
1939 /* Now do type-specific checks. Note that the last part of the check above
1940 greatly limits what we have to do below. */
1941 switch (TREE_CODE (type
))
1950 case REFERENCE_TYPE
:
1958 /* Here we just check the bounds. */
1959 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
1960 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
1963 /* We're already checked the component type (TREE_TYPE), so just check
1965 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
1969 case QUAL_UNION_TYPE
:
1973 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1974 if (TREE_CODE (field
) == FIELD_DECL
1975 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
1976 || (TREE_CODE (type
) == QUAL_UNION_TYPE
1977 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
1978 || type_contains_placeholder_p (TREE_TYPE (field
))))
1990 type_contains_placeholder_p (tree type
)
1994 /* If the contains_placeholder_bits field has been initialized,
1995 then we know the answer. */
1996 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
1997 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
1999 /* Indicate that we've seen this type node, and the answer is false.
2000 This is what we want to return if we run into recursion via fields. */
2001 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
2003 /* Compute the real value. */
2004 result
= type_contains_placeholder_1 (type
);
2006 /* Store the real value. */
2007 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
2012 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2013 return a tree with all occurrences of references to F in a
2014 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2015 contains only arithmetic expressions or a CALL_EXPR with a
2016 PLACEHOLDER_EXPR occurring only in its arglist. */
2019 substitute_in_expr (tree exp
, tree f
, tree r
)
2021 enum tree_code code
= TREE_CODE (exp
);
2026 /* We handle TREE_LIST and COMPONENT_REF separately. */
2027 if (code
== TREE_LIST
)
2029 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
2030 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
2031 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2034 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2036 else if (code
== COMPONENT_REF
)
2038 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2039 and it is the right field, replace it with R. */
2040 for (inner
= TREE_OPERAND (exp
, 0);
2041 REFERENCE_CLASS_P (inner
);
2042 inner
= TREE_OPERAND (inner
, 0))
2044 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2045 && TREE_OPERAND (exp
, 1) == f
)
2048 /* If this expression hasn't been completed let, leave it alone. */
2049 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2052 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2053 if (op0
== TREE_OPERAND (exp
, 0))
2056 new = fold (build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2057 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
));
2060 switch (TREE_CODE_CLASS (code
))
2063 case tcc_declaration
:
2066 case tcc_exceptional
:
2069 case tcc_comparison
:
2070 case tcc_expression
:
2072 switch (TREE_CODE_LENGTH (code
))
2078 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2079 if (op0
== TREE_OPERAND (exp
, 0))
2082 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2086 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2087 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2089 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2092 new = fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2096 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2097 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2098 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2100 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2101 && op2
== TREE_OPERAND (exp
, 2))
2104 new = fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2116 TREE_READONLY (new) = TREE_READONLY (exp
);
2120 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2121 for it within OBJ, a tree that is an object or a chain of references. */
2124 substitute_placeholder_in_expr (tree exp
, tree obj
)
2126 enum tree_code code
= TREE_CODE (exp
);
2127 tree op0
, op1
, op2
, op3
;
2129 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2130 in the chain of OBJ. */
2131 if (code
== PLACEHOLDER_EXPR
)
2133 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2136 for (elt
= obj
; elt
!= 0;
2137 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2138 || TREE_CODE (elt
) == COND_EXPR
)
2139 ? TREE_OPERAND (elt
, 1)
2140 : (REFERENCE_CLASS_P (elt
)
2141 || UNARY_CLASS_P (elt
)
2142 || BINARY_CLASS_P (elt
)
2143 || EXPRESSION_CLASS_P (elt
))
2144 ? TREE_OPERAND (elt
, 0) : 0))
2145 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2148 for (elt
= obj
; elt
!= 0;
2149 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2150 || TREE_CODE (elt
) == COND_EXPR
)
2151 ? TREE_OPERAND (elt
, 1)
2152 : (REFERENCE_CLASS_P (elt
)
2153 || UNARY_CLASS_P (elt
)
2154 || BINARY_CLASS_P (elt
)
2155 || EXPRESSION_CLASS_P (elt
))
2156 ? TREE_OPERAND (elt
, 0) : 0))
2157 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2158 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2160 return fold (build1 (INDIRECT_REF
, need_type
, elt
));
2162 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2163 survives until RTL generation, there will be an error. */
2167 /* TREE_LIST is special because we need to look at TREE_VALUE
2168 and TREE_CHAIN, not TREE_OPERANDS. */
2169 else if (code
== TREE_LIST
)
2171 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2172 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2173 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2176 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2179 switch (TREE_CODE_CLASS (code
))
2182 case tcc_declaration
:
2185 case tcc_exceptional
:
2188 case tcc_comparison
:
2189 case tcc_expression
:
2192 switch (TREE_CODE_LENGTH (code
))
2198 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2199 if (op0
== TREE_OPERAND (exp
, 0))
2202 return fold (build1 (code
, TREE_TYPE (exp
), op0
));
2205 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2206 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2208 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2211 return fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2214 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2215 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2216 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2218 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2219 && op2
== TREE_OPERAND (exp
, 2))
2222 return fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2225 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2226 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2227 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2228 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2230 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2231 && op2
== TREE_OPERAND (exp
, 2)
2232 && op3
== TREE_OPERAND (exp
, 3))
2235 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2247 /* Stabilize a reference so that we can use it any number of times
2248 without causing its operands to be evaluated more than once.
2249 Returns the stabilized reference. This works by means of save_expr,
2250 so see the caveats in the comments about save_expr.
2252 Also allows conversion expressions whose operands are references.
2253 Any other kind of expression is returned unchanged. */
2256 stabilize_reference (tree ref
)
2259 enum tree_code code
= TREE_CODE (ref
);
2266 /* No action is needed in this case. */
2272 case FIX_TRUNC_EXPR
:
2273 case FIX_FLOOR_EXPR
:
2274 case FIX_ROUND_EXPR
:
2276 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2280 result
= build_nt (INDIRECT_REF
,
2281 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2285 result
= build_nt (COMPONENT_REF
,
2286 stabilize_reference (TREE_OPERAND (ref
, 0)),
2287 TREE_OPERAND (ref
, 1), NULL_TREE
);
2291 result
= build_nt (BIT_FIELD_REF
,
2292 stabilize_reference (TREE_OPERAND (ref
, 0)),
2293 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2294 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2298 result
= build_nt (ARRAY_REF
,
2299 stabilize_reference (TREE_OPERAND (ref
, 0)),
2300 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2301 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2304 case ARRAY_RANGE_REF
:
2305 result
= build_nt (ARRAY_RANGE_REF
,
2306 stabilize_reference (TREE_OPERAND (ref
, 0)),
2307 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2308 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2312 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2313 it wouldn't be ignored. This matters when dealing with
2315 return stabilize_reference_1 (ref
);
2317 /* If arg isn't a kind of lvalue we recognize, make no change.
2318 Caller should recognize the error for an invalid lvalue. */
2323 return error_mark_node
;
2326 TREE_TYPE (result
) = TREE_TYPE (ref
);
2327 TREE_READONLY (result
) = TREE_READONLY (ref
);
2328 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2329 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2334 /* Subroutine of stabilize_reference; this is called for subtrees of
2335 references. Any expression with side-effects must be put in a SAVE_EXPR
2336 to ensure that it is only evaluated once.
2338 We don't put SAVE_EXPR nodes around everything, because assigning very
2339 simple expressions to temporaries causes us to miss good opportunities
2340 for optimizations. Among other things, the opportunity to fold in the
2341 addition of a constant into an addressing mode often gets lost, e.g.
2342 "y[i+1] += x;". In general, we take the approach that we should not make
2343 an assignment unless we are forced into it - i.e., that any non-side effect
2344 operator should be allowed, and that cse should take care of coalescing
2345 multiple utterances of the same expression should that prove fruitful. */
2348 stabilize_reference_1 (tree e
)
2351 enum tree_code code
= TREE_CODE (e
);
2353 /* We cannot ignore const expressions because it might be a reference
2354 to a const array but whose index contains side-effects. But we can
2355 ignore things that are actual constant or that already have been
2356 handled by this function. */
2358 if (TREE_INVARIANT (e
))
2361 switch (TREE_CODE_CLASS (code
))
2363 case tcc_exceptional
:
2365 case tcc_declaration
:
2366 case tcc_comparison
:
2368 case tcc_expression
:
2370 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2371 so that it will only be evaluated once. */
2372 /* The reference (r) and comparison (<) classes could be handled as
2373 below, but it is generally faster to only evaluate them once. */
2374 if (TREE_SIDE_EFFECTS (e
))
2375 return save_expr (e
);
2379 /* Constants need no processing. In fact, we should never reach
2384 /* Division is slow and tends to be compiled with jumps,
2385 especially the division by powers of 2 that is often
2386 found inside of an array reference. So do it just once. */
2387 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2388 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2389 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2390 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2391 return save_expr (e
);
2392 /* Recursively stabilize each operand. */
2393 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2394 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2398 /* Recursively stabilize each operand. */
2399 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2406 TREE_TYPE (result
) = TREE_TYPE (e
);
2407 TREE_READONLY (result
) = TREE_READONLY (e
);
2408 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2409 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2410 TREE_INVARIANT (result
) = 1;
2415 /* Low-level constructors for expressions. */
2417 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2418 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2421 recompute_tree_invarant_for_addr_expr (tree t
)
2424 bool tc
= true, ti
= true, se
= false;
2426 /* We started out assuming this address is both invariant and constant, but
2427 does not have side effects. Now go down any handled components and see if
2428 any of them involve offsets that are either non-constant or non-invariant.
2429 Also check for side-effects.
2431 ??? Note that this code makes no attempt to deal with the case where
2432 taking the address of something causes a copy due to misalignment. */
2434 #define UPDATE_TITCSE(NODE) \
2435 do { tree _node = (NODE); \
2436 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2437 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2438 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2440 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2441 node
= TREE_OPERAND (node
, 0))
2443 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2444 array reference (probably made temporarily by the G++ front end),
2445 so ignore all the operands. */
2446 if ((TREE_CODE (node
) == ARRAY_REF
2447 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2448 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2450 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2451 if (TREE_OPERAND (node
, 2))
2452 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2453 if (TREE_OPERAND (node
, 3))
2454 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2456 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2457 FIELD_DECL, apparently. The G++ front end can put something else
2458 there, at least temporarily. */
2459 else if (TREE_CODE (node
) == COMPONENT_REF
2460 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2462 if (TREE_OPERAND (node
, 2))
2463 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2465 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2466 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2469 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2470 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2471 invariant and constant if the decl is static. It's also invariant if it's
2472 a decl in the current function. Taking the address of a volatile variable
2473 is not volatile. If it's a constant, the address is both invariant and
2474 constant. Otherwise it's neither. */
2475 if (TREE_CODE (node
) == INDIRECT_REF
)
2476 UPDATE_TITCSE (TREE_OPERAND (node
, 0));
2477 else if (DECL_P (node
))
2481 else if (decl_function_context (node
) == current_function_decl
2482 /* Addresses of thread-local variables are invariant. */
2483 || (TREE_CODE (node
) == VAR_DECL
&& DECL_THREAD_LOCAL (node
)))
2488 else if (CONSTANT_CLASS_P (node
))
2493 se
|= TREE_SIDE_EFFECTS (node
);
2496 TREE_CONSTANT (t
) = tc
;
2497 TREE_INVARIANT (t
) = ti
;
2498 TREE_SIDE_EFFECTS (t
) = se
;
2499 #undef UPDATE_TITCSE
2502 /* Build an expression of code CODE, data type TYPE, and operands as
2503 specified. Expressions and reference nodes can be created this way.
2504 Constants, decls, types and misc nodes cannot be.
2506 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2507 enough for all extant tree codes. These functions can be called
2508 directly (preferably!), but can also be obtained via GCC preprocessor
2509 magic within the build macro. */
2512 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2516 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2518 t
= make_node_stat (code PASS_MEM_STAT
);
2525 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2527 int length
= sizeof (struct tree_exp
);
2528 #ifdef GATHER_STATISTICS
2529 tree_node_kind kind
;
2533 #ifdef GATHER_STATISTICS
2534 switch (TREE_CODE_CLASS (code
))
2536 case tcc_statement
: /* an expression with side effects */
2539 case tcc_reference
: /* a reference */
2547 tree_node_counts
[(int) kind
]++;
2548 tree_node_sizes
[(int) kind
] += length
;
2551 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2553 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
2555 memset (t
, 0, sizeof (struct tree_common
));
2557 TREE_SET_CODE (t
, code
);
2559 TREE_TYPE (t
) = type
;
2560 #ifdef USE_MAPPED_LOCATION
2561 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2563 SET_EXPR_LOCUS (t
, NULL
);
2565 TREE_COMPLEXITY (t
) = 0;
2566 TREE_OPERAND (t
, 0) = node
;
2567 TREE_BLOCK (t
) = NULL_TREE
;
2568 if (node
&& !TYPE_P (node
))
2570 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2571 TREE_READONLY (t
) = TREE_READONLY (node
);
2574 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2575 TREE_SIDE_EFFECTS (t
) = 1;
2579 /* All of these have side-effects, no matter what their
2581 TREE_SIDE_EFFECTS (t
) = 1;
2582 TREE_READONLY (t
) = 0;
2585 case MISALIGNED_INDIRECT_REF
:
2586 case ALIGN_INDIRECT_REF
:
2588 /* Whether a dereference is readonly has nothing to do with whether
2589 its operand is readonly. */
2590 TREE_READONLY (t
) = 0;
2595 recompute_tree_invarant_for_addr_expr (t
);
2599 if (TREE_CODE_CLASS (code
) == tcc_unary
2600 && node
&& !TYPE_P (node
)
2601 && TREE_CONSTANT (node
))
2602 TREE_CONSTANT (t
) = 1;
2603 if (TREE_CODE_CLASS (code
) == tcc_unary
2604 && node
&& TREE_INVARIANT (node
))
2605 TREE_INVARIANT (t
) = 1;
2606 if (TREE_CODE_CLASS (code
) == tcc_reference
2607 && node
&& TREE_THIS_VOLATILE (node
))
2608 TREE_THIS_VOLATILE (t
) = 1;
2615 #define PROCESS_ARG(N) \
2617 TREE_OPERAND (t, N) = arg##N; \
2618 if (arg##N &&!TYPE_P (arg##N)) \
2620 if (TREE_SIDE_EFFECTS (arg##N)) \
2622 if (!TREE_READONLY (arg##N)) \
2624 if (!TREE_CONSTANT (arg##N)) \
2626 if (!TREE_INVARIANT (arg##N)) \
2632 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2634 bool constant
, read_only
, side_effects
, invariant
;
2637 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
2639 t
= make_node_stat (code PASS_MEM_STAT
);
2642 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2643 result based on those same flags for the arguments. But if the
2644 arguments aren't really even `tree' expressions, we shouldn't be trying
2647 /* Expressions without side effects may be constant if their
2648 arguments are as well. */
2649 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
2650 || TREE_CODE_CLASS (code
) == tcc_binary
);
2652 side_effects
= TREE_SIDE_EFFECTS (t
);
2653 invariant
= constant
;
2658 TREE_READONLY (t
) = read_only
;
2659 TREE_CONSTANT (t
) = constant
;
2660 TREE_INVARIANT (t
) = invariant
;
2661 TREE_SIDE_EFFECTS (t
) = side_effects
;
2662 TREE_THIS_VOLATILE (t
)
2663 = (TREE_CODE_CLASS (code
) == tcc_reference
2664 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2670 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2671 tree arg2 MEM_STAT_DECL
)
2673 bool constant
, read_only
, side_effects
, invariant
;
2676 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
2678 t
= make_node_stat (code PASS_MEM_STAT
);
2681 side_effects
= TREE_SIDE_EFFECTS (t
);
2687 if (code
== CALL_EXPR
&& !side_effects
)
2692 /* Calls have side-effects, except those to const or
2694 i
= call_expr_flags (t
);
2695 if (!(i
& (ECF_CONST
| ECF_PURE
)))
2698 /* And even those have side-effects if their arguments do. */
2699 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
2700 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
2707 TREE_SIDE_EFFECTS (t
) = side_effects
;
2708 TREE_THIS_VOLATILE (t
)
2709 = (TREE_CODE_CLASS (code
) == tcc_reference
2710 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2716 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2717 tree arg2
, tree arg3 MEM_STAT_DECL
)
2719 bool constant
, read_only
, side_effects
, invariant
;
2722 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
2724 t
= make_node_stat (code PASS_MEM_STAT
);
2727 side_effects
= TREE_SIDE_EFFECTS (t
);
2734 TREE_SIDE_EFFECTS (t
) = side_effects
;
2735 TREE_THIS_VOLATILE (t
)
2736 = (TREE_CODE_CLASS (code
) == tcc_reference
2737 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2742 /* Backup definition for non-gcc build compilers. */
2745 (build
) (enum tree_code code
, tree tt
, ...)
2747 tree t
, arg0
, arg1
, arg2
, arg3
;
2748 int length
= TREE_CODE_LENGTH (code
);
2755 t
= build0 (code
, tt
);
2758 arg0
= va_arg (p
, tree
);
2759 t
= build1 (code
, tt
, arg0
);
2762 arg0
= va_arg (p
, tree
);
2763 arg1
= va_arg (p
, tree
);
2764 t
= build2 (code
, tt
, arg0
, arg1
);
2767 arg0
= va_arg (p
, tree
);
2768 arg1
= va_arg (p
, tree
);
2769 arg2
= va_arg (p
, tree
);
2770 t
= build3 (code
, tt
, arg0
, arg1
, arg2
);
2773 arg0
= va_arg (p
, tree
);
2774 arg1
= va_arg (p
, tree
);
2775 arg2
= va_arg (p
, tree
);
2776 arg3
= va_arg (p
, tree
);
2777 t
= build4 (code
, tt
, arg0
, arg1
, arg2
, arg3
);
2787 /* Similar except don't specify the TREE_TYPE
2788 and leave the TREE_SIDE_EFFECTS as 0.
2789 It is permissible for arguments to be null,
2790 or even garbage if their values do not matter. */
2793 build_nt (enum tree_code code
, ...)
2802 t
= make_node (code
);
2803 length
= TREE_CODE_LENGTH (code
);
2805 for (i
= 0; i
< length
; i
++)
2806 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2812 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2813 We do NOT enter this node in any sort of symbol table.
2815 layout_decl is used to set up the decl's storage layout.
2816 Other slots are initialized to 0 or null pointers. */
2819 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
2823 t
= make_node_stat (code PASS_MEM_STAT
);
2825 /* if (type == error_mark_node)
2826 type = integer_type_node; */
2827 /* That is not done, deliberately, so that having error_mark_node
2828 as the type can suppress useless errors in the use of this variable. */
2830 DECL_NAME (t
) = name
;
2831 TREE_TYPE (t
) = type
;
2833 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2835 else if (code
== FUNCTION_DECL
)
2836 DECL_MODE (t
) = FUNCTION_MODE
;
2838 /* Set default visibility to whatever the user supplied with
2839 visibility_specified depending on #pragma GCC visibility. */
2840 DECL_VISIBILITY (t
) = default_visibility
;
2841 DECL_VISIBILITY_SPECIFIED (t
) = visibility_options
.inpragma
;
2846 /* Builds and returns function declaration with NAME and TYPE. */
2849 build_fn_decl (const char *name
, tree type
)
2851 tree id
= get_identifier (name
);
2852 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
2854 DECL_EXTERNAL (decl
) = 1;
2855 TREE_PUBLIC (decl
) = 1;
2856 DECL_ARTIFICIAL (decl
) = 1;
2857 TREE_NOTHROW (decl
) = 1;
2863 /* BLOCK nodes are used to represent the structure of binding contours
2864 and declarations, once those contours have been exited and their contents
2865 compiled. This information is used for outputting debugging info. */
2868 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
2870 tree block
= make_node (BLOCK
);
2872 BLOCK_VARS (block
) = vars
;
2873 BLOCK_SUBBLOCKS (block
) = subblocks
;
2874 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2875 BLOCK_CHAIN (block
) = chain
;
2879 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2880 /* ??? gengtype doesn't handle conditionals */
2881 static GTY(()) tree last_annotated_node
;
2884 #ifdef USE_MAPPED_LOCATION
2887 expand_location (source_location loc
)
2889 expanded_location xloc
;
2890 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
2893 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
2894 xloc
.file
= map
->to_file
;
2895 xloc
.line
= SOURCE_LINE (map
, loc
);
2896 xloc
.column
= SOURCE_COLUMN (map
, loc
);
2903 /* Record the exact location where an expression or an identifier were
2907 annotate_with_file_line (tree node
, const char *file
, int line
)
2909 /* Roughly one percent of the calls to this function are to annotate
2910 a node with the same information already attached to that node!
2911 Just return instead of wasting memory. */
2912 if (EXPR_LOCUS (node
)
2913 && (EXPR_FILENAME (node
) == file
2914 || ! strcmp (EXPR_FILENAME (node
), file
))
2915 && EXPR_LINENO (node
) == line
)
2917 last_annotated_node
= node
;
2921 /* In heavily macroized code (such as GCC itself) this single
2922 entry cache can reduce the number of allocations by more
2924 if (last_annotated_node
2925 && EXPR_LOCUS (last_annotated_node
)
2926 && (EXPR_FILENAME (last_annotated_node
) == file
2927 || ! strcmp (EXPR_FILENAME (last_annotated_node
), file
))
2928 && EXPR_LINENO (last_annotated_node
) == line
)
2930 SET_EXPR_LOCUS (node
, EXPR_LOCUS (last_annotated_node
));
2934 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
2935 EXPR_LINENO (node
) = line
;
2936 EXPR_FILENAME (node
) = file
;
2937 last_annotated_node
= node
;
2941 annotate_with_locus (tree node
, location_t locus
)
2943 annotate_with_file_line (node
, locus
.file
, locus
.line
);
2947 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2951 build_decl_attribute_variant (tree ddecl
, tree attribute
)
2953 DECL_ATTRIBUTES (ddecl
) = attribute
;
2957 /* Borrowed from hashtab.c iterative_hash implementation. */
2958 #define mix(a,b,c) \
2960 a -= b; a -= c; a ^= (c>>13); \
2961 b -= c; b -= a; b ^= (a<< 8); \
2962 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2963 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2964 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2965 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2966 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2967 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2968 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2972 /* Produce good hash value combining VAL and VAL2. */
2973 static inline hashval_t
2974 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
2976 /* the golden ratio; an arbitrary value. */
2977 hashval_t a
= 0x9e3779b9;
2983 /* Produce good hash value combining PTR and VAL2. */
2984 static inline hashval_t
2985 iterative_hash_pointer (void *ptr
, hashval_t val2
)
2987 if (sizeof (ptr
) == sizeof (hashval_t
))
2988 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
2991 hashval_t a
= (hashval_t
) (size_t) ptr
;
2992 /* Avoid warnings about shifting of more than the width of the type on
2993 hosts that won't execute this path. */
2995 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
3001 /* Produce good hash value combining VAL and VAL2. */
3002 static inline hashval_t
3003 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
3005 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
3006 return iterative_hash_hashval_t (val
, val2
);
3009 hashval_t a
= (hashval_t
) val
;
3010 /* Avoid warnings about shifting of more than the width of the type on
3011 hosts that won't execute this path. */
3013 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
3015 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
3017 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
3018 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
3025 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
3028 Record such modified types already made so we don't make duplicates. */
3031 build_type_attribute_variant (tree ttype
, tree attribute
)
3033 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
3035 hashval_t hashcode
= 0;
3037 enum tree_code code
= TREE_CODE (ttype
);
3039 ntype
= copy_node (ttype
);
3041 TYPE_POINTER_TO (ntype
) = 0;
3042 TYPE_REFERENCE_TO (ntype
) = 0;
3043 TYPE_ATTRIBUTES (ntype
) = attribute
;
3045 /* Create a new main variant of TYPE. */
3046 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3047 TYPE_NEXT_VARIANT (ntype
) = 0;
3048 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3050 hashcode
= iterative_hash_object (code
, hashcode
);
3051 if (TREE_TYPE (ntype
))
3052 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3054 hashcode
= attribute_hash_list (attribute
, hashcode
);
3056 switch (TREE_CODE (ntype
))
3059 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3062 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3066 hashcode
= iterative_hash_object
3067 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3068 hashcode
= iterative_hash_object
3069 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3073 unsigned int precision
= TYPE_PRECISION (ntype
);
3074 hashcode
= iterative_hash_object (precision
, hashcode
);
3081 ntype
= type_hash_canon (hashcode
, ntype
);
3082 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3089 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3092 We try both `text' and `__text__', ATTR may be either one. */
3093 /* ??? It might be a reasonable simplification to require ATTR to be only
3094 `text'. One might then also require attribute lists to be stored in
3095 their canonicalized form. */
3098 is_attribute_with_length_p (const char *attr
, int attr_len
, tree ident
)
3103 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3106 p
= IDENTIFIER_POINTER (ident
);
3107 ident_len
= IDENTIFIER_LENGTH (ident
);
3109 if (ident_len
== attr_len
3110 && strcmp (attr
, p
) == 0)
3113 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3116 gcc_assert (attr
[1] == '_');
3117 gcc_assert (attr
[attr_len
- 2] == '_');
3118 gcc_assert (attr
[attr_len
- 1] == '_');
3119 gcc_assert (attr
[1] == '_');
3120 if (ident_len
== attr_len
- 4
3121 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3126 if (ident_len
== attr_len
+ 4
3127 && p
[0] == '_' && p
[1] == '_'
3128 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3129 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3136 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3139 We try both `text' and `__text__', ATTR may be either one. */
3142 is_attribute_p (const char *attr
, tree ident
)
3144 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3147 /* Given an attribute name and a list of attributes, return a pointer to the
3148 attribute's list element if the attribute is part of the list, or NULL_TREE
3149 if not found. If the attribute appears more than once, this only
3150 returns the first occurrence; the TREE_CHAIN of the return value should
3151 be passed back in if further occurrences are wanted. */
3154 lookup_attribute (const char *attr_name
, tree list
)
3157 size_t attr_len
= strlen (attr_name
);
3159 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3161 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3162 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3169 /* Return an attribute list that is the union of a1 and a2. */
3172 merge_attributes (tree a1
, tree a2
)
3176 /* Either one unset? Take the set one. */
3178 if ((attributes
= a1
) == 0)
3181 /* One that completely contains the other? Take it. */
3183 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3185 if (attribute_list_contained (a2
, a1
))
3189 /* Pick the longest list, and hang on the other list. */
3191 if (list_length (a1
) < list_length (a2
))
3192 attributes
= a2
, a2
= a1
;
3194 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3197 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3200 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3203 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
3208 a1
= copy_node (a2
);
3209 TREE_CHAIN (a1
) = attributes
;
3218 /* Given types T1 and T2, merge their attributes and return
3222 merge_type_attributes (tree t1
, tree t2
)
3224 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3225 TYPE_ATTRIBUTES (t2
));
3228 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3232 merge_decl_attributes (tree olddecl
, tree newdecl
)
3234 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3235 DECL_ATTRIBUTES (newdecl
));
3238 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3240 /* Specialization of merge_decl_attributes for various Windows targets.
3242 This handles the following situation:
3244 __declspec (dllimport) int foo;
3247 The second instance of `foo' nullifies the dllimport. */
3250 merge_dllimport_decl_attributes (tree old
, tree
new)
3253 int delete_dllimport_p
;
3255 old
= DECL_ATTRIBUTES (old
);
3256 new = DECL_ATTRIBUTES (new);
3258 /* What we need to do here is remove from `old' dllimport if it doesn't
3259 appear in `new'. dllimport behaves like extern: if a declaration is
3260 marked dllimport and a definition appears later, then the object
3261 is not dllimport'd. */
3262 if (lookup_attribute ("dllimport", old
) != NULL_TREE
3263 && lookup_attribute ("dllimport", new) == NULL_TREE
)
3264 delete_dllimport_p
= 1;
3266 delete_dllimport_p
= 0;
3268 a
= merge_attributes (old
, new);
3270 if (delete_dllimport_p
)
3274 /* Scan the list for dllimport and delete it. */
3275 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3277 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3279 if (prev
== NULL_TREE
)
3282 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3291 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3292 struct attribute_spec.handler. */
3295 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3300 /* These attributes may apply to structure and union types being created,
3301 but otherwise should pass to the declaration involved. */
3304 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3305 | (int) ATTR_FLAG_ARRAY_NEXT
))
3307 *no_add_attrs
= true;
3308 return tree_cons (name
, args
, NULL_TREE
);
3310 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3312 warning (OPT_Wattributes
, "%qs attribute ignored",
3313 IDENTIFIER_POINTER (name
));
3314 *no_add_attrs
= true;
3320 /* Report error on dllimport ambiguities seen now before they cause
3322 if (is_attribute_p ("dllimport", name
))
3324 /* Like MS, treat definition of dllimported variables and
3325 non-inlined functions on declaration as syntax errors. We
3326 allow the attribute for function definitions if declared
3328 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
)
3329 && !DECL_DECLARED_INLINE_P (node
))
3331 error ("%Jfunction %qD definition is marked dllimport.", node
, node
);
3332 *no_add_attrs
= true;
3335 else if (TREE_CODE (node
) == VAR_DECL
)
3337 if (DECL_INITIAL (node
))
3339 error ("%Jvariable %qD definition is marked dllimport.",
3341 *no_add_attrs
= true;
3344 /* `extern' needn't be specified with dllimport.
3345 Specify `extern' now and hope for the best. Sigh. */
3346 DECL_EXTERNAL (node
) = 1;
3347 /* Also, implicitly give dllimport'd variables declared within
3348 a function global scope, unless declared static. */
3349 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3350 TREE_PUBLIC (node
) = 1;
3354 /* Report error if symbol is not accessible at global scope. */
3355 if (!TREE_PUBLIC (node
)
3356 && (TREE_CODE (node
) == VAR_DECL
3357 || TREE_CODE (node
) == FUNCTION_DECL
))
3359 error ("%Jexternal linkage required for symbol %qD because of "
3360 "%qs attribute.", node
, node
, IDENTIFIER_POINTER (name
));
3361 *no_add_attrs
= true;
3367 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3369 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3370 of the various TYPE_QUAL values. */
3373 set_type_quals (tree type
, int type_quals
)
3375 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3376 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3377 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3380 /* Returns true iff cand is equivalent to base with type_quals. */
3383 check_qualified_type (tree cand
, tree base
, int type_quals
)
3385 return (TYPE_QUALS (cand
) == type_quals
3386 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3387 /* Apparently this is needed for Objective-C. */
3388 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3389 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3390 TYPE_ATTRIBUTES (base
)));
3393 /* Return a version of the TYPE, qualified as indicated by the
3394 TYPE_QUALS, if one exists. If no qualified version exists yet,
3395 return NULL_TREE. */
3398 get_qualified_type (tree type
, int type_quals
)
3402 if (TYPE_QUALS (type
) == type_quals
)
3405 /* Search the chain of variants to see if there is already one there just
3406 like the one we need to have. If so, use that existing one. We must
3407 preserve the TYPE_NAME, since there is code that depends on this. */
3408 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3409 if (check_qualified_type (t
, type
, type_quals
))
3415 /* Like get_qualified_type, but creates the type if it does not
3416 exist. This function never returns NULL_TREE. */
3419 build_qualified_type (tree type
, int type_quals
)
3423 /* See if we already have the appropriate qualified variant. */
3424 t
= get_qualified_type (type
, type_quals
);
3426 /* If not, build it. */
3429 t
= build_variant_type_copy (type
);
3430 set_type_quals (t
, type_quals
);
3436 /* Create a new distinct copy of TYPE. The new type is made its own
3440 build_distinct_type_copy (tree type
)
3442 tree t
= copy_node (type
);
3444 TYPE_POINTER_TO (t
) = 0;
3445 TYPE_REFERENCE_TO (t
) = 0;
3447 /* Make it its own variant. */
3448 TYPE_MAIN_VARIANT (t
) = t
;
3449 TYPE_NEXT_VARIANT (t
) = 0;
3454 /* Create a new variant of TYPE, equivalent but distinct.
3455 This is so the caller can modify it. */
3458 build_variant_type_copy (tree type
)
3460 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3462 t
= build_distinct_type_copy (type
);
3464 /* Add the new type to the chain of variants of TYPE. */
3465 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3466 TYPE_NEXT_VARIANT (m
) = t
;
3467 TYPE_MAIN_VARIANT (t
) = m
;
3472 /* Return true if the from tree in both tree maps are equal. */
3475 tree_map_eq (const void *va
, const void *vb
)
3477 const struct tree_map
*a
= va
, *b
= vb
;
3478 return (a
->from
== b
->from
);
3481 /* Hash a from tree in a tree_map. */
3484 tree_map_hash (const void *item
)
3486 return (((const struct tree_map
*) item
)->hash
);
3489 /* Return true if this tree map structure is marked for garbage collection
3490 purposes. We simply return true if the from tree is marked, so that this
3491 structure goes away when the from tree goes away. */
3494 tree_map_marked_p (const void *p
)
3496 tree from
= ((struct tree_map
*) p
)->from
;
3498 return ggc_marked_p (from
);
3501 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
3504 print_debug_expr_statistics (void)
3506 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
3507 (long) htab_size (debug_expr_for_decl
),
3508 (long) htab_elements (debug_expr_for_decl
),
3509 htab_collisions (debug_expr_for_decl
));
3512 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
3515 print_value_expr_statistics (void)
3517 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
3518 (long) htab_size (value_expr_for_decl
),
3519 (long) htab_elements (value_expr_for_decl
),
3520 htab_collisions (value_expr_for_decl
));
3522 /* Lookup a debug expression for FROM, and return it if we find one. */
3525 decl_debug_expr_lookup (tree from
)
3527 struct tree_map
*h
, in
;
3530 h
= htab_find_with_hash (debug_expr_for_decl
, &in
, htab_hash_pointer (from
));
3536 /* Insert a mapping FROM->TO in the debug expression hashtable. */
3539 decl_debug_expr_insert (tree from
, tree to
)
3544 h
= ggc_alloc (sizeof (struct tree_map
));
3545 h
->hash
= htab_hash_pointer (from
);
3548 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, h
->hash
, INSERT
);
3549 *(struct tree_map
**) loc
= h
;
3552 /* Lookup a value expression for FROM, and return it if we find one. */
3555 decl_value_expr_lookup (tree from
)
3557 struct tree_map
*h
, in
;
3560 h
= htab_find_with_hash (value_expr_for_decl
, &in
, htab_hash_pointer (from
));
3566 /* Insert a mapping FROM->TO in the value expression hashtable. */
3569 decl_value_expr_insert (tree from
, tree to
)
3574 h
= ggc_alloc (sizeof (struct tree_map
));
3575 h
->hash
= htab_hash_pointer (from
);
3578 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, h
->hash
, INSERT
);
3579 *(struct tree_map
**) loc
= h
;
3582 /* Hashing of types so that we don't make duplicates.
3583 The entry point is `type_hash_canon'. */
3585 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3586 with types in the TREE_VALUE slots), by adding the hash codes
3587 of the individual types. */
3590 type_hash_list (tree list
, hashval_t hashcode
)
3594 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3595 if (TREE_VALUE (tail
) != error_mark_node
)
3596 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
3602 /* These are the Hashtable callback functions. */
3604 /* Returns true iff the types are equivalent. */
3607 type_hash_eq (const void *va
, const void *vb
)
3609 const struct type_hash
*a
= va
, *b
= vb
;
3611 /* First test the things that are the same for all types. */
3612 if (a
->hash
!= b
->hash
3613 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
3614 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
3615 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3616 TYPE_ATTRIBUTES (b
->type
))
3617 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
3618 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
3621 switch (TREE_CODE (a
->type
))
3626 case REFERENCE_TYPE
:
3630 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
3633 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
3634 && !(TYPE_VALUES (a
->type
)
3635 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
3636 && TYPE_VALUES (b
->type
)
3637 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
3638 && type_list_equal (TYPE_VALUES (a
->type
),
3639 TYPE_VALUES (b
->type
))))
3642 /* ... fall through ... */
3648 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3649 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3650 TYPE_MAX_VALUE (b
->type
)))
3651 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3652 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3653 TYPE_MIN_VALUE (b
->type
))));
3656 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
3659 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
3660 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3661 || (TYPE_ARG_TYPES (a
->type
)
3662 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3663 && TYPE_ARG_TYPES (b
->type
)
3664 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3665 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3666 TYPE_ARG_TYPES (b
->type
)))));
3669 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
3673 case QUAL_UNION_TYPE
:
3674 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
3675 || (TYPE_FIELDS (a
->type
)
3676 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
3677 && TYPE_FIELDS (b
->type
)
3678 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
3679 && type_list_equal (TYPE_FIELDS (a
->type
),
3680 TYPE_FIELDS (b
->type
))));
3683 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3684 || (TYPE_ARG_TYPES (a
->type
)
3685 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3686 && TYPE_ARG_TYPES (b
->type
)
3687 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3688 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3689 TYPE_ARG_TYPES (b
->type
))));
3696 /* Return the cached hash value. */
3699 type_hash_hash (const void *item
)
3701 return ((const struct type_hash
*) item
)->hash
;
3704 /* Look in the type hash table for a type isomorphic to TYPE.
3705 If one is found, return it. Otherwise return 0. */
3708 type_hash_lookup (hashval_t hashcode
, tree type
)
3710 struct type_hash
*h
, in
;
3712 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3713 must call that routine before comparing TYPE_ALIGNs. */
3719 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3725 /* Add an entry to the type-hash-table
3726 for a type TYPE whose hash code is HASHCODE. */
3729 type_hash_add (hashval_t hashcode
, tree type
)
3731 struct type_hash
*h
;
3734 h
= ggc_alloc (sizeof (struct type_hash
));
3737 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3738 *(struct type_hash
**) loc
= h
;
3741 /* Given TYPE, and HASHCODE its hash code, return the canonical
3742 object for an identical type if one already exists.
3743 Otherwise, return TYPE, and record it as the canonical object.
3745 To use this function, first create a type of the sort you want.
3746 Then compute its hash code from the fields of the type that
3747 make it different from other similar types.
3748 Then call this function and use the value. */
3751 type_hash_canon (unsigned int hashcode
, tree type
)
3755 /* The hash table only contains main variants, so ensure that's what we're
3757 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
3759 if (!lang_hooks
.types
.hash_types
)
3762 /* See if the type is in the hash table already. If so, return it.
3763 Otherwise, add the type. */
3764 t1
= type_hash_lookup (hashcode
, type
);
3767 #ifdef GATHER_STATISTICS
3768 tree_node_counts
[(int) t_kind
]--;
3769 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3775 type_hash_add (hashcode
, type
);
3780 /* See if the data pointed to by the type hash table is marked. We consider
3781 it marked if the type is marked or if a debug type number or symbol
3782 table entry has been made for the type. This reduces the amount of
3783 debugging output and eliminates that dependency of the debug output on
3784 the number of garbage collections. */
3787 type_hash_marked_p (const void *p
)
3789 tree type
= ((struct type_hash
*) p
)->type
;
3791 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3795 print_type_hash_statistics (void)
3797 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3798 (long) htab_size (type_hash_table
),
3799 (long) htab_elements (type_hash_table
),
3800 htab_collisions (type_hash_table
));
3803 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3804 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3805 by adding the hash codes of the individual attributes. */
3808 attribute_hash_list (tree list
, hashval_t hashcode
)
3812 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3813 /* ??? Do we want to add in TREE_VALUE too? */
3814 hashcode
= iterative_hash_object
3815 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
3819 /* Given two lists of attributes, return true if list l2 is
3820 equivalent to l1. */
3823 attribute_list_equal (tree l1
, tree l2
)
3825 return attribute_list_contained (l1
, l2
)
3826 && attribute_list_contained (l2
, l1
);
3829 /* Given two lists of attributes, return true if list L2 is
3830 completely contained within L1. */
3831 /* ??? This would be faster if attribute names were stored in a canonicalized
3832 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3833 must be used to show these elements are equivalent (which they are). */
3834 /* ??? It's not clear that attributes with arguments will always be handled
3838 attribute_list_contained (tree l1
, tree l2
)
3842 /* First check the obvious, maybe the lists are identical. */
3846 /* Maybe the lists are similar. */
3847 for (t1
= l1
, t2
= l2
;
3849 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3850 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3851 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3853 /* Maybe the lists are equal. */
3854 if (t1
== 0 && t2
== 0)
3857 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3860 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3862 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3865 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3872 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3879 /* Given two lists of types
3880 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3881 return 1 if the lists contain the same types in the same order.
3882 Also, the TREE_PURPOSEs must match. */
3885 type_list_equal (tree l1
, tree l2
)
3889 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3890 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3891 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3892 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3893 && (TREE_TYPE (TREE_PURPOSE (t1
))
3894 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3900 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3901 given by TYPE. If the argument list accepts variable arguments,
3902 then this function counts only the ordinary arguments. */
3905 type_num_arguments (tree type
)
3910 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3911 /* If the function does not take a variable number of arguments,
3912 the last element in the list will have type `void'. */
3913 if (VOID_TYPE_P (TREE_VALUE (t
)))
3921 /* Nonzero if integer constants T1 and T2
3922 represent the same constant value. */
3925 tree_int_cst_equal (tree t1
, tree t2
)
3930 if (t1
== 0 || t2
== 0)
3933 if (TREE_CODE (t1
) == INTEGER_CST
3934 && TREE_CODE (t2
) == INTEGER_CST
3935 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3936 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3942 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3943 The precise way of comparison depends on their data type. */
3946 tree_int_cst_lt (tree t1
, tree t2
)
3951 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
3953 int t1_sgn
= tree_int_cst_sgn (t1
);
3954 int t2_sgn
= tree_int_cst_sgn (t2
);
3956 if (t1_sgn
< t2_sgn
)
3958 else if (t1_sgn
> t2_sgn
)
3960 /* Otherwise, both are non-negative, so we compare them as
3961 unsigned just in case one of them would overflow a signed
3964 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
3965 return INT_CST_LT (t1
, t2
);
3967 return INT_CST_LT_UNSIGNED (t1
, t2
);
3970 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3973 tree_int_cst_compare (tree t1
, tree t2
)
3975 if (tree_int_cst_lt (t1
, t2
))
3977 else if (tree_int_cst_lt (t2
, t1
))
3983 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3984 the host. If POS is zero, the value can be represented in a single
3985 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3986 be represented in a single unsigned HOST_WIDE_INT. */
3989 host_integerp (tree t
, int pos
)
3991 return (TREE_CODE (t
) == INTEGER_CST
3992 && ! TREE_OVERFLOW (t
)
3993 && ((TREE_INT_CST_HIGH (t
) == 0
3994 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3995 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3996 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3997 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
3998 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
4001 /* Return the HOST_WIDE_INT least significant bits of T if it is an
4002 INTEGER_CST and there is no overflow. POS is nonzero if the result must
4003 be positive. We must be able to satisfy the above conditions. */
4006 tree_low_cst (tree t
, int pos
)
4008 gcc_assert (host_integerp (t
, pos
));
4009 return TREE_INT_CST_LOW (t
);
4012 /* Return the most significant bit of the integer constant T. */
4015 tree_int_cst_msb (tree t
)
4019 unsigned HOST_WIDE_INT l
;
4021 /* Note that using TYPE_PRECISION here is wrong. We care about the
4022 actual bits, not the (arbitrary) range of the type. */
4023 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
4024 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
4025 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
4026 return (l
& 1) == 1;
4029 /* Return an indication of the sign of the integer constant T.
4030 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
4031 Note that -1 will never be returned it T's type is unsigned. */
4034 tree_int_cst_sgn (tree t
)
4036 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
4038 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
4040 else if (TREE_INT_CST_HIGH (t
) < 0)
4046 /* Compare two constructor-element-type constants. Return 1 if the lists
4047 are known to be equal; otherwise return 0. */
4050 simple_cst_list_equal (tree l1
, tree l2
)
4052 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4054 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4057 l1
= TREE_CHAIN (l1
);
4058 l2
= TREE_CHAIN (l2
);
4064 /* Return truthvalue of whether T1 is the same tree structure as T2.
4065 Return 1 if they are the same.
4066 Return 0 if they are understandably different.
4067 Return -1 if either contains tree structure not understood by
4071 simple_cst_equal (tree t1
, tree t2
)
4073 enum tree_code code1
, code2
;
4079 if (t1
== 0 || t2
== 0)
4082 code1
= TREE_CODE (t1
);
4083 code2
= TREE_CODE (t2
);
4085 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
4087 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4088 || code2
== NON_LVALUE_EXPR
)
4089 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4091 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
4094 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
4095 || code2
== NON_LVALUE_EXPR
)
4096 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
4104 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
4105 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
4108 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
4111 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
4112 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
4113 TREE_STRING_LENGTH (t1
)));
4116 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1
),
4117 CONSTRUCTOR_ELTS (t2
));
4120 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4123 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4127 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4130 /* Special case: if either target is an unallocated VAR_DECL,
4131 it means that it's going to be unified with whatever the
4132 TARGET_EXPR is really supposed to initialize, so treat it
4133 as being equivalent to anything. */
4134 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
4135 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
4136 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
4137 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
4138 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
4139 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
4142 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4147 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
4149 case WITH_CLEANUP_EXPR
:
4150 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4154 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
4157 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4158 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4172 /* This general rule works for most tree codes. All exceptions should be
4173 handled above. If this is a language-specific tree code, we can't
4174 trust what might be in the operand, so say we don't know
4176 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4179 switch (TREE_CODE_CLASS (code1
))
4183 case tcc_comparison
:
4184 case tcc_expression
:
4188 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
4190 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4202 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4203 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4204 than U, respectively. */
4207 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
4209 if (tree_int_cst_sgn (t
) < 0)
4211 else if (TREE_INT_CST_HIGH (t
) != 0)
4213 else if (TREE_INT_CST_LOW (t
) == u
)
4215 else if (TREE_INT_CST_LOW (t
) < u
)
4221 /* Return true if CODE represents an associative tree code. Otherwise
4224 associative_tree_code (enum tree_code code
)
4243 /* Return true if CODE represents a commutative tree code. Otherwise
4246 commutative_tree_code (enum tree_code code
)
4259 case UNORDERED_EXPR
:
4263 case TRUTH_AND_EXPR
:
4264 case TRUTH_XOR_EXPR
:
4274 /* Generate a hash value for an expression. This can be used iteratively
4275 by passing a previous result as the "val" argument.
4277 This function is intended to produce the same hash for expressions which
4278 would compare equal using operand_equal_p. */
4281 iterative_hash_expr (tree t
, hashval_t val
)
4284 enum tree_code code
;
4288 return iterative_hash_pointer (t
, val
);
4290 code
= TREE_CODE (t
);
4294 /* Alas, constants aren't shared, so we can't rely on pointer
4297 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
4298 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4301 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4303 return iterative_hash_hashval_t (val2
, val
);
4306 return iterative_hash (TREE_STRING_POINTER (t
),
4307 TREE_STRING_LENGTH (t
), val
);
4309 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4310 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4312 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4316 /* we can just compare by pointer. */
4317 return iterative_hash_pointer (t
, val
);
4320 /* A list of expressions, for a CALL_EXPR or as the elements of a
4322 for (; t
; t
= TREE_CHAIN (t
))
4323 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4326 /* When referring to a built-in FUNCTION_DECL, use the
4327 __builtin__ form. Otherwise nodes that compare equal
4328 according to operand_equal_p might get different
4330 if (DECL_BUILT_IN (t
))
4332 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
4336 /* else FALL THROUGH */
4338 class = TREE_CODE_CLASS (code
);
4340 if (class == tcc_declaration
)
4342 /* Otherwise, we can just compare decls by pointer. */
4343 val
= iterative_hash_pointer (t
, val
);
4347 gcc_assert (IS_EXPR_CODE_CLASS (class));
4349 val
= iterative_hash_object (code
, val
);
4351 /* Don't hash the type, that can lead to having nodes which
4352 compare equal according to operand_equal_p, but which
4353 have different hash codes. */
4354 if (code
== NOP_EXPR
4355 || code
== CONVERT_EXPR
4356 || code
== NON_LVALUE_EXPR
)
4358 /* Make sure to include signness in the hash computation. */
4359 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4360 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4363 else if (commutative_tree_code (code
))
4365 /* It's a commutative expression. We want to hash it the same
4366 however it appears. We do this by first hashing both operands
4367 and then rehashing based on the order of their independent
4369 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4370 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4374 t
= one
, one
= two
, two
= t
;
4376 val
= iterative_hash_hashval_t (one
, val
);
4377 val
= iterative_hash_hashval_t (two
, val
);
4380 for (i
= TREE_CODE_LENGTH (code
) - 1; i
>= 0; --i
)
4381 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4388 /* Constructors for pointer, array and function types.
4389 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4390 constructed by language-dependent code, not here.) */
4392 /* Construct, lay out and return the type of pointers to TO_TYPE with
4393 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4394 reference all of memory. If such a type has already been
4395 constructed, reuse it. */
4398 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4403 /* In some cases, languages will have things that aren't a POINTER_TYPE
4404 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4405 In that case, return that type without regard to the rest of our
4408 ??? This is a kludge, but consistent with the way this function has
4409 always operated and there doesn't seem to be a good way to avoid this
4411 if (TYPE_POINTER_TO (to_type
) != 0
4412 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4413 return TYPE_POINTER_TO (to_type
);
4415 /* First, if we already have a type for pointers to TO_TYPE and it's
4416 the proper mode, use it. */
4417 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4418 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4421 t
= make_node (POINTER_TYPE
);
4423 TREE_TYPE (t
) = to_type
;
4424 TYPE_MODE (t
) = mode
;
4425 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4426 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4427 TYPE_POINTER_TO (to_type
) = t
;
4429 /* Lay out the type. This function has many callers that are concerned
4430 with expression-construction, and this simplifies them all. */
4436 /* By default build pointers in ptr_mode. */
4439 build_pointer_type (tree to_type
)
4441 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4444 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4447 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4452 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4453 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4454 In that case, return that type without regard to the rest of our
4457 ??? This is a kludge, but consistent with the way this function has
4458 always operated and there doesn't seem to be a good way to avoid this
4460 if (TYPE_REFERENCE_TO (to_type
) != 0
4461 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4462 return TYPE_REFERENCE_TO (to_type
);
4464 /* First, if we already have a type for pointers to TO_TYPE and it's
4465 the proper mode, use it. */
4466 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4467 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4470 t
= make_node (REFERENCE_TYPE
);
4472 TREE_TYPE (t
) = to_type
;
4473 TYPE_MODE (t
) = mode
;
4474 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4475 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4476 TYPE_REFERENCE_TO (to_type
) = t
;
4484 /* Build the node for the type of references-to-TO_TYPE by default
4488 build_reference_type (tree to_type
)
4490 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4493 /* Build a type that is compatible with t but has no cv quals anywhere
4496 const char *const *const * -> char ***. */
4499 build_type_no_quals (tree t
)
4501 switch (TREE_CODE (t
))
4504 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4506 TYPE_REF_CAN_ALIAS_ALL (t
));
4507 case REFERENCE_TYPE
:
4509 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4511 TYPE_REF_CAN_ALIAS_ALL (t
));
4513 return TYPE_MAIN_VARIANT (t
);
4517 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4518 MAXVAL should be the maximum value in the domain
4519 (one less than the length of the array).
4521 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4522 We don't enforce this limit, that is up to caller (e.g. language front end).
4523 The limit exists because the result is a signed type and we don't handle
4524 sizes that use more than one HOST_WIDE_INT. */
4527 build_index_type (tree maxval
)
4529 tree itype
= make_node (INTEGER_TYPE
);
4531 TREE_TYPE (itype
) = sizetype
;
4532 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4533 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4534 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
4535 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4536 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4537 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4538 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4539 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
4541 if (host_integerp (maxval
, 1))
4542 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
4547 /* Builds a signed or unsigned integer type of precision PRECISION.
4548 Used for C bitfields whose precision does not match that of
4549 built-in target types. */
4551 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
4554 tree itype
= make_node (INTEGER_TYPE
);
4556 TYPE_PRECISION (itype
) = precision
;
4559 fixup_unsigned_type (itype
);
4561 fixup_signed_type (itype
);
4563 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
4564 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
4569 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4570 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4571 low bound LOWVAL and high bound HIGHVAL.
4572 if TYPE==NULL_TREE, sizetype is used. */
4575 build_range_type (tree type
, tree lowval
, tree highval
)
4577 tree itype
= make_node (INTEGER_TYPE
);
4579 TREE_TYPE (itype
) = type
;
4580 if (type
== NULL_TREE
)
4583 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4584 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4586 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4587 TYPE_MODE (itype
) = TYPE_MODE (type
);
4588 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4589 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4590 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4591 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
4593 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
4594 return type_hash_canon (tree_low_cst (highval
, 0)
4595 - tree_low_cst (lowval
, 0),
4601 /* Just like build_index_type, but takes lowval and highval instead
4602 of just highval (maxval). */
4605 build_index_2_type (tree lowval
, tree highval
)
4607 return build_range_type (sizetype
, lowval
, highval
);
4610 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4611 and number of elements specified by the range of values of INDEX_TYPE.
4612 If such a type has already been constructed, reuse it. */
4615 build_array_type (tree elt_type
, tree index_type
)
4618 hashval_t hashcode
= 0;
4620 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4622 error ("arrays of functions are not meaningful");
4623 elt_type
= integer_type_node
;
4626 t
= make_node (ARRAY_TYPE
);
4627 TREE_TYPE (t
) = elt_type
;
4628 TYPE_DOMAIN (t
) = index_type
;
4630 if (index_type
== 0)
4636 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
4637 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
4638 t
= type_hash_canon (hashcode
, t
);
4640 if (!COMPLETE_TYPE_P (t
))
4645 /* Return the TYPE of the elements comprising
4646 the innermost dimension of ARRAY. */
4649 get_inner_array_type (tree array
)
4651 tree type
= TREE_TYPE (array
);
4653 while (TREE_CODE (type
) == ARRAY_TYPE
)
4654 type
= TREE_TYPE (type
);
4659 /* Construct, lay out and return
4660 the type of functions returning type VALUE_TYPE
4661 given arguments of types ARG_TYPES.
4662 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4663 are data type nodes for the arguments of the function.
4664 If such a type has already been constructed, reuse it. */
4667 build_function_type (tree value_type
, tree arg_types
)
4670 hashval_t hashcode
= 0;
4672 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4674 error ("function return type cannot be function");
4675 value_type
= integer_type_node
;
4678 /* Make a node of the sort we want. */
4679 t
= make_node (FUNCTION_TYPE
);
4680 TREE_TYPE (t
) = value_type
;
4681 TYPE_ARG_TYPES (t
) = arg_types
;
4683 /* If we already have such a type, use the old one. */
4684 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
4685 hashcode
= type_hash_list (arg_types
, hashcode
);
4686 t
= type_hash_canon (hashcode
, t
);
4688 if (!COMPLETE_TYPE_P (t
))
4693 /* Build a function type. The RETURN_TYPE is the type returned by the
4694 function. If additional arguments are provided, they are
4695 additional argument types. The list of argument types must always
4696 be terminated by NULL_TREE. */
4699 build_function_type_list (tree return_type
, ...)
4704 va_start (p
, return_type
);
4706 t
= va_arg (p
, tree
);
4707 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
4708 args
= tree_cons (NULL_TREE
, t
, args
);
4710 if (args
== NULL_TREE
)
4711 args
= void_list_node
;
4715 args
= nreverse (args
);
4716 TREE_CHAIN (last
) = void_list_node
;
4718 args
= build_function_type (return_type
, args
);
4724 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4725 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4726 for the method. An implicit additional parameter (of type
4727 pointer-to-BASETYPE) is added to the ARGTYPES. */
4730 build_method_type_directly (tree basetype
,
4738 /* Make a node of the sort we want. */
4739 t
= make_node (METHOD_TYPE
);
4741 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4742 TREE_TYPE (t
) = rettype
;
4743 ptype
= build_pointer_type (basetype
);
4745 /* The actual arglist for this function includes a "hidden" argument
4746 which is "this". Put it into the list of argument types. */
4747 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
4748 TYPE_ARG_TYPES (t
) = argtypes
;
4750 /* If we already have such a type, use the old one. */
4751 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4752 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
4753 hashcode
= type_hash_list (argtypes
, hashcode
);
4754 t
= type_hash_canon (hashcode
, t
);
4756 if (!COMPLETE_TYPE_P (t
))
4762 /* Construct, lay out and return the type of methods belonging to class
4763 BASETYPE and whose arguments and values are described by TYPE.
4764 If that type exists already, reuse it.
4765 TYPE must be a FUNCTION_TYPE node. */
4768 build_method_type (tree basetype
, tree type
)
4770 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
4772 return build_method_type_directly (basetype
,
4774 TYPE_ARG_TYPES (type
));
4777 /* Construct, lay out and return the type of offsets to a value
4778 of type TYPE, within an object of type BASETYPE.
4779 If a suitable offset type exists already, reuse it. */
4782 build_offset_type (tree basetype
, tree type
)
4785 hashval_t hashcode
= 0;
4787 /* Make a node of the sort we want. */
4788 t
= make_node (OFFSET_TYPE
);
4790 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4791 TREE_TYPE (t
) = type
;
4793 /* If we already have such a type, use the old one. */
4794 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4795 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
4796 t
= type_hash_canon (hashcode
, t
);
4798 if (!COMPLETE_TYPE_P (t
))
4804 /* Create a complex type whose components are COMPONENT_TYPE. */
4807 build_complex_type (tree component_type
)
4812 /* Make a node of the sort we want. */
4813 t
= make_node (COMPLEX_TYPE
);
4815 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4817 /* If we already have such a type, use the old one. */
4818 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
4819 t
= type_hash_canon (hashcode
, t
);
4821 if (!COMPLETE_TYPE_P (t
))
4824 /* If we are writing Dwarf2 output we need to create a name,
4825 since complex is a fundamental type. */
4826 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4830 if (component_type
== char_type_node
)
4831 name
= "complex char";
4832 else if (component_type
== signed_char_type_node
)
4833 name
= "complex signed char";
4834 else if (component_type
== unsigned_char_type_node
)
4835 name
= "complex unsigned char";
4836 else if (component_type
== short_integer_type_node
)
4837 name
= "complex short int";
4838 else if (component_type
== short_unsigned_type_node
)
4839 name
= "complex short unsigned int";
4840 else if (component_type
== integer_type_node
)
4841 name
= "complex int";
4842 else if (component_type
== unsigned_type_node
)
4843 name
= "complex unsigned int";
4844 else if (component_type
== long_integer_type_node
)
4845 name
= "complex long int";
4846 else if (component_type
== long_unsigned_type_node
)
4847 name
= "complex long unsigned int";
4848 else if (component_type
== long_long_integer_type_node
)
4849 name
= "complex long long int";
4850 else if (component_type
== long_long_unsigned_type_node
)
4851 name
= "complex long long unsigned int";
4856 TYPE_NAME (t
) = get_identifier (name
);
4859 return build_qualified_type (t
, TYPE_QUALS (component_type
));
4862 /* Return OP, stripped of any conversions to wider types as much as is safe.
4863 Converting the value back to OP's type makes a value equivalent to OP.
4865 If FOR_TYPE is nonzero, we return a value which, if converted to
4866 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4868 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4869 narrowest type that can hold the value, even if they don't exactly fit.
4870 Otherwise, bit-field references are changed to a narrower type
4871 only if they can be fetched directly from memory in that type.
4873 OP must have integer, real or enumeral type. Pointers are not allowed!
4875 There are some cases where the obvious value we could return
4876 would regenerate to OP if converted to OP's type,
4877 but would not extend like OP to wider types.
4878 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4879 For example, if OP is (unsigned short)(signed char)-1,
4880 we avoid returning (signed char)-1 if FOR_TYPE is int,
4881 even though extending that to an unsigned short would regenerate OP,
4882 since the result of extending (signed char)-1 to (int)
4883 is different from (int) OP. */
4886 get_unwidened (tree op
, tree for_type
)
4888 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4889 tree type
= TREE_TYPE (op
);
4891 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4893 = (for_type
!= 0 && for_type
!= type
4894 && final_prec
> TYPE_PRECISION (type
)
4895 && TYPE_UNSIGNED (type
));
4898 while (TREE_CODE (op
) == NOP_EXPR
4899 || TREE_CODE (op
) == CONVERT_EXPR
)
4902 = TYPE_PRECISION (TREE_TYPE (op
))
4903 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4905 /* Truncations are many-one so cannot be removed.
4906 Unless we are later going to truncate down even farther. */
4908 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4911 /* See what's inside this conversion. If we decide to strip it,
4913 op
= TREE_OPERAND (op
, 0);
4915 /* If we have not stripped any zero-extensions (uns is 0),
4916 we can strip any kind of extension.
4917 If we have previously stripped a zero-extension,
4918 only zero-extensions can safely be stripped.
4919 Any extension can be stripped if the bits it would produce
4920 are all going to be discarded later by truncating to FOR_TYPE. */
4924 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4926 /* TYPE_UNSIGNED says whether this is a zero-extension.
4927 Let's avoid computing it if it does not affect WIN
4928 and if UNS will not be needed again. */
4930 || TREE_CODE (op
) == NOP_EXPR
4931 || TREE_CODE (op
) == CONVERT_EXPR
)
4932 && TYPE_UNSIGNED (TREE_TYPE (op
)))
4940 if (TREE_CODE (op
) == COMPONENT_REF
4941 /* Since type_for_size always gives an integer type. */
4942 && TREE_CODE (type
) != REAL_TYPE
4943 /* Don't crash if field not laid out yet. */
4944 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4945 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4947 unsigned int innerprec
4948 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4949 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4950 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4951 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4953 /* We can get this structure field in the narrowest type it fits in.
4954 If FOR_TYPE is 0, do this only for a field that matches the
4955 narrower type exactly and is aligned for it
4956 The resulting extension to its nominal type (a fullword type)
4957 must fit the same conditions as for other extensions. */
4960 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
4961 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4962 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
4964 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4965 TREE_OPERAND (op
, 1), NULL_TREE
);
4966 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4967 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4974 /* Return OP or a simpler expression for a narrower value
4975 which can be sign-extended or zero-extended to give back OP.
4976 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4977 or 0 if the value should be sign-extended. */
4980 get_narrower (tree op
, int *unsignedp_ptr
)
4985 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
4987 while (TREE_CODE (op
) == NOP_EXPR
)
4990 = (TYPE_PRECISION (TREE_TYPE (op
))
4991 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4993 /* Truncations are many-one so cannot be removed. */
4997 /* See what's inside this conversion. If we decide to strip it,
5002 op
= TREE_OPERAND (op
, 0);
5003 /* An extension: the outermost one can be stripped,
5004 but remember whether it is zero or sign extension. */
5006 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5007 /* Otherwise, if a sign extension has been stripped,
5008 only sign extensions can now be stripped;
5009 if a zero extension has been stripped, only zero-extensions. */
5010 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
5014 else /* bitschange == 0 */
5016 /* A change in nominal type can always be stripped, but we must
5017 preserve the unsignedness. */
5019 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
5021 op
= TREE_OPERAND (op
, 0);
5022 /* Keep trying to narrow, but don't assign op to win if it
5023 would turn an integral type into something else. */
5024 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
5031 if (TREE_CODE (op
) == COMPONENT_REF
5032 /* Since type_for_size always gives an integer type. */
5033 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
5034 /* Ensure field is laid out already. */
5035 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
5036 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
5038 unsigned HOST_WIDE_INT innerprec
5039 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
5040 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
5041 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
5042 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
5044 /* We can get this structure field in a narrower type that fits it,
5045 but the resulting extension to its nominal type (a fullword type)
5046 must satisfy the same conditions as for other extensions.
5048 Do this only for fields that are aligned (not bit-fields),
5049 because when bit-field insns will be used there is no
5050 advantage in doing this. */
5052 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
5053 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
5054 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
5058 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
5059 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
5060 TREE_OPERAND (op
, 1), NULL_TREE
);
5061 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
5062 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
5065 *unsignedp_ptr
= uns
;
5069 /* Nonzero if integer constant C has a value that is permissible
5070 for type TYPE (an INTEGER_TYPE). */
5073 int_fits_type_p (tree c
, tree type
)
5075 tree type_low_bound
= TYPE_MIN_VALUE (type
);
5076 tree type_high_bound
= TYPE_MAX_VALUE (type
);
5077 bool ok_for_low_bound
, ok_for_high_bound
;
5080 /* If at least one bound of the type is a constant integer, we can check
5081 ourselves and maybe make a decision. If no such decision is possible, but
5082 this type is a subtype, try checking against that. Otherwise, use
5083 force_fit_type, which checks against the precision.
5085 Compute the status for each possibly constant bound, and return if we see
5086 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
5087 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
5088 for "constant known to fit". */
5090 /* Check if C >= type_low_bound. */
5091 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
5093 if (tree_int_cst_lt (c
, type_low_bound
))
5095 ok_for_low_bound
= true;
5098 ok_for_low_bound
= false;
5100 /* Check if c <= type_high_bound. */
5101 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
5103 if (tree_int_cst_lt (type_high_bound
, c
))
5105 ok_for_high_bound
= true;
5108 ok_for_high_bound
= false;
5110 /* If the constant fits both bounds, the result is known. */
5111 if (ok_for_low_bound
&& ok_for_high_bound
)
5114 /* Perform some generic filtering which may allow making a decision
5115 even if the bounds are not constant. First, negative integers
5116 never fit in unsigned types, */
5117 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
5120 /* Second, narrower types always fit in wider ones. */
5121 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
5124 /* Third, unsigned integers with top bit set never fit signed types. */
5125 if (! TYPE_UNSIGNED (type
)
5126 && TYPE_UNSIGNED (TREE_TYPE (c
))
5127 && tree_int_cst_msb (c
))
5130 /* If we haven't been able to decide at this point, there nothing more we
5131 can check ourselves here. Look at the base type if we have one. */
5132 if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
5133 return int_fits_type_p (c
, TREE_TYPE (type
));
5135 /* Or to force_fit_type, if nothing else. */
5136 tmp
= copy_node (c
);
5137 TREE_TYPE (tmp
) = type
;
5138 tmp
= force_fit_type (tmp
, -1, false, false);
5139 return TREE_INT_CST_HIGH (tmp
) == TREE_INT_CST_HIGH (c
)
5140 && TREE_INT_CST_LOW (tmp
) == TREE_INT_CST_LOW (c
);
5143 /* Subprogram of following function. Called by walk_tree.
5145 Return *TP if it is an automatic variable or parameter of the
5146 function passed in as DATA. */
5149 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
5151 tree fn
= (tree
) data
;
5156 else if (DECL_P (*tp
)
5157 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
5163 /* Returns true if T is, contains, or refers to a type with variable
5164 size. If FN is nonzero, only return true if a modifier of the type
5165 or position of FN is a variable or parameter inside FN.
5167 This concept is more general than that of C99 'variably modified types':
5168 in C99, a struct type is never variably modified because a VLA may not
5169 appear as a structure member. However, in GNU C code like:
5171 struct S { int i[f()]; };
5173 is valid, and other languages may define similar constructs. */
5176 variably_modified_type_p (tree type
, tree fn
)
5180 /* Test if T is either variable (if FN is zero) or an expression containing
5181 a variable in FN. */
5182 #define RETURN_TRUE_IF_VAR(T) \
5183 do { tree _t = (T); \
5184 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5185 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5186 return true; } while (0)
5188 if (type
== error_mark_node
)
5191 /* If TYPE itself has variable size, it is variably modified.
5193 We do not yet have a representation of the C99 '[*]' syntax.
5194 When a representation is chosen, this function should be modified
5195 to test for that case as well. */
5196 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
5197 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type
));
5199 switch (TREE_CODE (type
))
5202 case REFERENCE_TYPE
:
5205 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5211 /* If TYPE is a function type, it is variably modified if any of the
5212 parameters or the return type are variably modified. */
5213 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5216 for (t
= TYPE_ARG_TYPES (type
);
5217 t
&& t
!= void_list_node
;
5219 if (variably_modified_type_p (TREE_VALUE (t
), fn
))
5228 /* Scalar types are variably modified if their end points
5230 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
5231 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
5236 case QUAL_UNION_TYPE
:
5237 /* We can't see if any of the field are variably-modified by the
5238 definition we normally use, since that would produce infinite
5239 recursion via pointers. */
5240 /* This is variably modified if some field's type is. */
5241 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5242 if (TREE_CODE (t
) == FIELD_DECL
)
5244 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
5245 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
5246 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
5248 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
5249 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
5257 /* The current language may have other cases to check, but in general,
5258 all other types are not variably modified. */
5259 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
5261 #undef RETURN_TRUE_IF_VAR
5264 /* Given a DECL or TYPE, return the scope in which it was declared, or
5265 NULL_TREE if there is no containing scope. */
5268 get_containing_scope (tree t
)
5270 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
5273 /* Return the innermost context enclosing DECL that is
5274 a FUNCTION_DECL, or zero if none. */
5277 decl_function_context (tree decl
)
5281 if (TREE_CODE (decl
) == ERROR_MARK
)
5284 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5285 where we look up the function at runtime. Such functions always take
5286 a first argument of type 'pointer to real context'.
5288 C++ should really be fixed to use DECL_CONTEXT for the real context,
5289 and use something else for the "virtual context". */
5290 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
5293 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
5295 context
= DECL_CONTEXT (decl
);
5297 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
5299 if (TREE_CODE (context
) == BLOCK
)
5300 context
= BLOCK_SUPERCONTEXT (context
);
5302 context
= get_containing_scope (context
);
5308 /* Return the innermost context enclosing DECL that is
5309 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5310 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5313 decl_type_context (tree decl
)
5315 tree context
= DECL_CONTEXT (decl
);
5318 switch (TREE_CODE (context
))
5320 case NAMESPACE_DECL
:
5321 case TRANSLATION_UNIT_DECL
:
5326 case QUAL_UNION_TYPE
:
5331 context
= DECL_CONTEXT (context
);
5335 context
= BLOCK_SUPERCONTEXT (context
);
5345 /* CALL is a CALL_EXPR. Return the declaration for the function
5346 called, or NULL_TREE if the called function cannot be
5350 get_callee_fndecl (tree call
)
5354 /* It's invalid to call this function with anything but a
5356 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5358 /* The first operand to the CALL is the address of the function
5360 addr
= TREE_OPERAND (call
, 0);
5364 /* If this is a readonly function pointer, extract its initial value. */
5365 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5366 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5367 && DECL_INITIAL (addr
))
5368 addr
= DECL_INITIAL (addr
);
5370 /* If the address is just `&f' for some function `f', then we know
5371 that `f' is being called. */
5372 if (TREE_CODE (addr
) == ADDR_EXPR
5373 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5374 return TREE_OPERAND (addr
, 0);
5376 /* We couldn't figure out what was being called. Maybe the front
5377 end has some idea. */
5378 return lang_hooks
.lang_get_callee_fndecl (call
);
5381 /* Print debugging information about tree nodes generated during the compile,
5382 and any language-specific information. */
5385 dump_tree_statistics (void)
5387 #ifdef GATHER_STATISTICS
5389 int total_nodes
, total_bytes
;
5392 fprintf (stderr
, "\n??? tree nodes created\n\n");
5393 #ifdef GATHER_STATISTICS
5394 fprintf (stderr
, "Kind Nodes Bytes\n");
5395 fprintf (stderr
, "---------------------------------------\n");
5396 total_nodes
= total_bytes
= 0;
5397 for (i
= 0; i
< (int) all_kinds
; i
++)
5399 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5400 tree_node_counts
[i
], tree_node_sizes
[i
]);
5401 total_nodes
+= tree_node_counts
[i
];
5402 total_bytes
+= tree_node_sizes
[i
];
5404 fprintf (stderr
, "---------------------------------------\n");
5405 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5406 fprintf (stderr
, "---------------------------------------\n");
5407 ssanames_print_statistics ();
5408 phinodes_print_statistics ();
5410 fprintf (stderr
, "(No per-node statistics)\n");
5412 print_type_hash_statistics ();
5413 print_debug_expr_statistics ();
5414 print_value_expr_statistics ();
5415 lang_hooks
.print_statistics ();
5418 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5420 /* Generate a crc32 of a string. */
5423 crc32_string (unsigned chksum
, const char *string
)
5427 unsigned value
= *string
<< 24;
5430 for (ix
= 8; ix
--; value
<<= 1)
5434 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5443 /* P is a string that will be used in a symbol. Mask out any characters
5444 that are not valid in that context. */
5447 clean_symbol_name (char *p
)
5451 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5454 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5461 /* Generate a name for a function unique to this translation unit.
5462 TYPE is some string to identify the purpose of this function to the
5463 linker or collect2. */
5466 get_file_function_name_long (const char *type
)
5472 if (first_global_object_name
)
5473 p
= first_global_object_name
;
5476 /* We don't have anything that we know to be unique to this translation
5477 unit, so use what we do have and throw in some randomness. */
5479 const char *name
= weak_global_object_name
;
5480 const char *file
= main_input_filename
;
5485 file
= input_filename
;
5487 len
= strlen (file
);
5488 q
= alloca (9 * 2 + len
+ 1);
5489 memcpy (q
, file
, len
+ 1);
5490 clean_symbol_name (q
);
5492 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5493 crc32_string (0, flag_random_seed
));
5498 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5500 /* Set up the name of the file-level functions we may need.
5501 Use a global object (which is already required to be unique over
5502 the program) rather than the file name (which imposes extra
5504 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5506 return get_identifier (buf
);
5509 /* If KIND=='I', return a suitable global initializer (constructor) name.
5510 If KIND=='D', return a suitable global clean-up (destructor) name. */
5513 get_file_function_name (int kind
)
5520 return get_file_function_name_long (p
);
5523 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5525 /* Complain that the tree code of NODE does not match the expected 0
5526 terminated list of trailing codes. The trailing code list can be
5527 empty, for a more vague error message. FILE, LINE, and FUNCTION
5528 are of the caller. */
5531 tree_check_failed (const tree node
, const char *file
,
5532 int line
, const char *function
, ...)
5536 unsigned length
= 0;
5539 va_start (args
, function
);
5540 while ((code
= va_arg (args
, int)))
5541 length
+= 4 + strlen (tree_code_name
[code
]);
5545 va_start (args
, function
);
5546 length
+= strlen ("expected ");
5547 buffer
= alloca (length
);
5549 while ((code
= va_arg (args
, int)))
5551 const char *prefix
= length
? " or " : "expected ";
5553 strcpy (buffer
+ length
, prefix
);
5554 length
+= strlen (prefix
);
5555 strcpy (buffer
+ length
, tree_code_name
[code
]);
5556 length
+= strlen (tree_code_name
[code
]);
5561 buffer
= (char *)"unexpected node";
5563 internal_error ("tree check: %s, have %s in %s, at %s:%d",
5564 buffer
, tree_code_name
[TREE_CODE (node
)],
5565 function
, trim_filename (file
), line
);
5568 /* Complain that the tree code of NODE does match the expected 0
5569 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5573 tree_not_check_failed (const tree node
, const char *file
,
5574 int line
, const char *function
, ...)
5578 unsigned length
= 0;
5581 va_start (args
, function
);
5582 while ((code
= va_arg (args
, int)))
5583 length
+= 4 + strlen (tree_code_name
[code
]);
5585 va_start (args
, function
);
5586 buffer
= alloca (length
);
5588 while ((code
= va_arg (args
, int)))
5592 strcpy (buffer
+ length
, " or ");
5595 strcpy (buffer
+ length
, tree_code_name
[code
]);
5596 length
+= strlen (tree_code_name
[code
]);
5600 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5601 buffer
, tree_code_name
[TREE_CODE (node
)],
5602 function
, trim_filename (file
), line
);
5605 /* Similar to tree_check_failed, except that we check for a class of tree
5606 code, given in CL. */
5609 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
5610 const char *file
, int line
, const char *function
)
5613 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
5614 TREE_CODE_CLASS_STRING (cl
),
5615 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
5616 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
5619 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5620 (dynamically sized) vector. */
5623 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5624 const char *function
)
5627 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5628 idx
+ 1, len
, function
, trim_filename (file
), line
);
5631 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5632 (dynamically sized) vector. */
5635 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5636 const char *function
)
5639 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5640 idx
+ 1, len
, function
, trim_filename (file
), line
);
5643 /* Similar to above, except that the check is for the bounds of the operand
5644 vector of an expression node. */
5647 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
5648 int line
, const char *function
)
5651 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5652 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
5653 function
, trim_filename (file
), line
);
5655 #endif /* ENABLE_TREE_CHECKING */
5657 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5658 and mapped to the machine mode MODE. Initialize its fields and build
5659 the information necessary for debugging output. */
5662 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
5664 tree t
= make_node (VECTOR_TYPE
);
5666 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
5667 TYPE_VECTOR_SUBPARTS (t
) = nunits
;
5668 TYPE_MODE (t
) = mode
;
5669 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
5670 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
5675 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
5676 tree array
= build_array_type (innertype
, build_index_type (index
));
5677 tree rt
= make_node (RECORD_TYPE
);
5679 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5680 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5682 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
5683 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5684 the representation type, and we want to find that die when looking up
5685 the vector type. This is most easily achieved by making the TYPE_UID
5687 TYPE_UID (rt
) = TYPE_UID (t
);
5690 /* Build our main variant, based on the main variant of the inner type. */
5691 if (TYPE_MAIN_VARIANT (innertype
) != innertype
)
5693 tree innertype_main_variant
= TYPE_MAIN_VARIANT (innertype
);
5694 unsigned int hash
= TYPE_HASH (innertype_main_variant
);
5695 TYPE_MAIN_VARIANT (t
)
5696 = type_hash_canon (hash
, make_vector_type (innertype_main_variant
,
5704 make_or_reuse_type (unsigned size
, int unsignedp
)
5706 if (size
== INT_TYPE_SIZE
)
5707 return unsignedp
? unsigned_type_node
: integer_type_node
;
5708 if (size
== CHAR_TYPE_SIZE
)
5709 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5710 if (size
== SHORT_TYPE_SIZE
)
5711 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5712 if (size
== LONG_TYPE_SIZE
)
5713 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5714 if (size
== LONG_LONG_TYPE_SIZE
)
5715 return (unsignedp
? long_long_unsigned_type_node
5716 : long_long_integer_type_node
);
5719 return make_unsigned_type (size
);
5721 return make_signed_type (size
);
5724 /* Create nodes for all integer types (and error_mark_node) using the sizes
5725 of C datatypes. The caller should call set_sizetype soon after calling
5726 this function to select one of the types as sizetype. */
5729 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
5731 error_mark_node
= make_node (ERROR_MARK
);
5732 TREE_TYPE (error_mark_node
) = error_mark_node
;
5734 initialize_sizetypes (signed_sizetype
);
5736 /* Define both `signed char' and `unsigned char'. */
5737 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5738 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5740 /* Define `char', which is like either `signed char' or `unsigned char'
5741 but not the same as either. */
5744 ? make_signed_type (CHAR_TYPE_SIZE
)
5745 : make_unsigned_type (CHAR_TYPE_SIZE
));
5747 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5748 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5749 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5750 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5751 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5752 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5753 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5754 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5756 /* Define a boolean type. This type only represents boolean values but
5757 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5758 Front ends which want to override this size (i.e. Java) can redefine
5759 boolean_type_node before calling build_common_tree_nodes_2. */
5760 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5761 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5762 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5763 TYPE_PRECISION (boolean_type_node
) = 1;
5765 /* Fill in the rest of the sized types. Reuse existing type nodes
5767 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
5768 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
5769 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
5770 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
5771 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
5773 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
5774 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
5775 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
5776 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
5777 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
5779 access_public_node
= get_identifier ("public");
5780 access_protected_node
= get_identifier ("protected");
5781 access_private_node
= get_identifier ("private");
5784 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5785 It will create several other common tree nodes. */
5788 build_common_tree_nodes_2 (int short_double
)
5790 /* Define these next since types below may used them. */
5791 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
5792 integer_one_node
= build_int_cst (NULL_TREE
, 1);
5793 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
5795 size_zero_node
= size_int (0);
5796 size_one_node
= size_int (1);
5797 bitsize_zero_node
= bitsize_int (0);
5798 bitsize_one_node
= bitsize_int (1);
5799 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5801 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5802 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5804 void_type_node
= make_node (VOID_TYPE
);
5805 layout_type (void_type_node
);
5807 /* We are not going to have real types in C with less than byte alignment,
5808 so we might as well not have any types that claim to have it. */
5809 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5810 TYPE_USER_ALIGN (void_type_node
) = 0;
5812 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
5813 layout_type (TREE_TYPE (null_pointer_node
));
5815 ptr_type_node
= build_pointer_type (void_type_node
);
5817 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5818 fileptr_type_node
= ptr_type_node
;
5820 float_type_node
= make_node (REAL_TYPE
);
5821 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5822 layout_type (float_type_node
);
5824 double_type_node
= make_node (REAL_TYPE
);
5826 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5828 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5829 layout_type (double_type_node
);
5831 long_double_type_node
= make_node (REAL_TYPE
);
5832 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5833 layout_type (long_double_type_node
);
5835 float_ptr_type_node
= build_pointer_type (float_type_node
);
5836 double_ptr_type_node
= build_pointer_type (double_type_node
);
5837 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
5838 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
5840 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5841 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5842 layout_type (complex_integer_type_node
);
5844 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5845 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5846 layout_type (complex_float_type_node
);
5848 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5849 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5850 layout_type (complex_double_type_node
);
5852 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5853 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5854 layout_type (complex_long_double_type_node
);
5857 tree t
= targetm
.build_builtin_va_list ();
5859 /* Many back-ends define record types without setting TYPE_NAME.
5860 If we copied the record type here, we'd keep the original
5861 record type without a name. This breaks name mangling. So,
5862 don't copy record types and let c_common_nodes_and_builtins()
5863 declare the type to be __builtin_va_list. */
5864 if (TREE_CODE (t
) != RECORD_TYPE
)
5865 t
= build_variant_type_copy (t
);
5867 va_list_type_node
= t
;
5871 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
5874 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
5875 const char *library_name
, int ecf_flags
)
5879 decl
= lang_hooks
.builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
5880 library_name
, NULL_TREE
);
5881 if (ecf_flags
& ECF_CONST
)
5882 TREE_READONLY (decl
) = 1;
5883 if (ecf_flags
& ECF_PURE
)
5884 DECL_IS_PURE (decl
) = 1;
5885 if (ecf_flags
& ECF_NORETURN
)
5886 TREE_THIS_VOLATILE (decl
) = 1;
5887 if (ecf_flags
& ECF_NOTHROW
)
5888 TREE_NOTHROW (decl
) = 1;
5889 if (ecf_flags
& ECF_MALLOC
)
5890 DECL_IS_MALLOC (decl
) = 1;
5892 built_in_decls
[code
] = decl
;
5893 implicit_built_in_decls
[code
] = decl
;
5896 /* Call this function after instantiating all builtins that the language
5897 front end cares about. This will build the rest of the builtins that
5898 are relied upon by the tree optimizers and the middle-end. */
5901 build_common_builtin_nodes (void)
5905 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
5906 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
5908 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5909 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5910 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5911 ftype
= build_function_type (ptr_type_node
, tmp
);
5913 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
5914 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
5915 "memcpy", ECF_NOTHROW
);
5916 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
5917 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
5918 "memmove", ECF_NOTHROW
);
5921 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
5923 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5924 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5925 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5926 ftype
= build_function_type (integer_type_node
, tmp
);
5927 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
5928 "memcmp", ECF_PURE
| ECF_NOTHROW
);
5931 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
5933 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5934 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
5935 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5936 ftype
= build_function_type (ptr_type_node
, tmp
);
5937 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
5938 "memset", ECF_NOTHROW
);
5941 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
5943 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5944 ftype
= build_function_type (ptr_type_node
, tmp
);
5945 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
5946 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
5949 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5950 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5951 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5952 ftype
= build_function_type (void_type_node
, tmp
);
5953 local_define_builtin ("__builtin_init_trampoline", ftype
,
5954 BUILT_IN_INIT_TRAMPOLINE
,
5955 "__builtin_init_trampoline", ECF_NOTHROW
);
5957 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5958 ftype
= build_function_type (ptr_type_node
, tmp
);
5959 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
5960 BUILT_IN_ADJUST_TRAMPOLINE
,
5961 "__builtin_adjust_trampoline",
5962 ECF_CONST
| ECF_NOTHROW
);
5964 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5965 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5966 ftype
= build_function_type (void_type_node
, tmp
);
5967 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
5968 BUILT_IN_NONLOCAL_GOTO
,
5969 "__builtin_nonlocal_goto",
5970 ECF_NORETURN
| ECF_NOTHROW
);
5972 ftype
= build_function_type (ptr_type_node
, void_list_node
);
5973 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
5974 "__builtin_stack_save", ECF_NOTHROW
);
5976 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5977 ftype
= build_function_type (void_type_node
, tmp
);
5978 local_define_builtin ("__builtin_stack_restore", ftype
,
5979 BUILT_IN_STACK_RESTORE
,
5980 "__builtin_stack_restore", ECF_NOTHROW
);
5982 ftype
= build_function_type (void_type_node
, void_list_node
);
5983 local_define_builtin ("__builtin_profile_func_enter", ftype
,
5984 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
5985 local_define_builtin ("__builtin_profile_func_exit", ftype
,
5986 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
5988 /* Complex multiplication and division. These are handled as builtins
5989 rather than optabs because emit_library_call_value doesn't support
5990 complex. Further, we can do slightly better with folding these
5991 beasties if the real and complex parts of the arguments are separate. */
5993 enum machine_mode mode
;
5995 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
5997 char mode_name_buf
[4], *q
;
5999 enum built_in_function mcode
, dcode
;
6000 tree type
, inner_type
;
6002 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
6005 inner_type
= TREE_TYPE (type
);
6007 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
6008 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6009 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6010 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
6011 ftype
= build_function_type (type
, tmp
);
6013 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
6014 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
6016 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
6020 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
6021 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
6022 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
6024 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
6025 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
6026 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
6031 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
6034 If we requested a pointer to a vector, build up the pointers that
6035 we stripped off while looking for the inner type. Similarly for
6036 return values from functions.
6038 The argument TYPE is the top of the chain, and BOTTOM is the
6039 new type which we will point to. */
6042 reconstruct_complex_type (tree type
, tree bottom
)
6046 if (POINTER_TYPE_P (type
))
6048 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6049 outer
= build_pointer_type (inner
);
6051 else if (TREE_CODE (type
) == ARRAY_TYPE
)
6053 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6054 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
6056 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
6058 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6059 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
6061 else if (TREE_CODE (type
) == METHOD_TYPE
)
6064 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
6065 /* The build_method_type_directly() routine prepends 'this' to argument list,
6066 so we must compensate by getting rid of it. */
6067 argtypes
= TYPE_ARG_TYPES (type
);
6068 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
6070 TYPE_ARG_TYPES (type
));
6071 TYPE_ARG_TYPES (outer
) = argtypes
;
6076 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
6077 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
6082 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6085 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
6089 switch (GET_MODE_CLASS (mode
))
6091 case MODE_VECTOR_INT
:
6092 case MODE_VECTOR_FLOAT
:
6093 nunits
= GET_MODE_NUNITS (mode
);
6097 /* Check that there are no leftover bits. */
6098 gcc_assert (GET_MODE_BITSIZE (mode
)
6099 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
6101 nunits
= GET_MODE_BITSIZE (mode
)
6102 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
6109 return make_vector_type (innertype
, nunits
, mode
);
6112 /* Similarly, but takes the inner type and number of units, which must be
6116 build_vector_type (tree innertype
, int nunits
)
6118 return make_vector_type (innertype
, nunits
, VOIDmode
);
6121 /* Build RESX_EXPR with given REGION_NUMBER. */
6123 build_resx (int region_number
)
6126 t
= build1 (RESX_EXPR
, void_type_node
,
6127 build_int_cst (NULL_TREE
, region_number
));
6131 /* Given an initializer INIT, return TRUE if INIT is zero or some
6132 aggregate of zeros. Otherwise return FALSE. */
6134 initializer_zerop (tree init
)
6140 switch (TREE_CODE (init
))
6143 return integer_zerop (init
);
6146 /* ??? Note that this is not correct for C4X float formats. There,
6147 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6148 negative exponent. */
6149 return real_zerop (init
)
6150 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
6153 return integer_zerop (init
)
6154 || (real_zerop (init
)
6155 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
6156 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
6159 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
6160 if (!initializer_zerop (TREE_VALUE (elt
)))
6165 elt
= CONSTRUCTOR_ELTS (init
);
6166 if (elt
== NULL_TREE
)
6169 for (; elt
; elt
= TREE_CHAIN (elt
))
6170 if (! initializer_zerop (TREE_VALUE (elt
)))
6180 add_var_to_bind_expr (tree bind_expr
, tree var
)
6182 BIND_EXPR_VARS (bind_expr
)
6183 = chainon (BIND_EXPR_VARS (bind_expr
), var
);
6184 if (BIND_EXPR_BLOCK (bind_expr
))
6185 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr
))
6186 = BIND_EXPR_VARS (bind_expr
);
6189 /* Build an empty statement. */
6192 build_empty_stmt (void)
6194 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
6198 /* Returns true if it is possible to prove that the index of
6199 an array access REF (an ARRAY_REF expression) falls into the
6203 in_array_bounds_p (tree ref
)
6205 tree idx
= TREE_OPERAND (ref
, 1);
6208 if (TREE_CODE (idx
) != INTEGER_CST
)
6211 min
= array_ref_low_bound (ref
);
6212 max
= array_ref_up_bound (ref
);
6215 || TREE_CODE (min
) != INTEGER_CST
6216 || TREE_CODE (max
) != INTEGER_CST
)
6219 if (tree_int_cst_lt (idx
, min
)
6220 || tree_int_cst_lt (max
, idx
))
6226 /* Return true if T (assumed to be a DECL) is a global variable. */
6229 is_global_var (tree t
)
6231 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
6234 /* Return true if T (assumed to be a DECL) must be assigned a memory
6238 needs_to_live_in_memory (tree t
)
6240 return (TREE_ADDRESSABLE (t
)
6241 || is_global_var (t
)
6242 || (TREE_CODE (t
) == RESULT_DECL
6243 && aggregate_value_p (t
, current_function_decl
)));
6246 /* There are situations in which a language considers record types
6247 compatible which have different field lists. Decide if two fields
6248 are compatible. It is assumed that the parent records are compatible. */
6251 fields_compatible_p (tree f1
, tree f2
)
6253 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
6254 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
6257 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
6258 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
6261 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
6267 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
6270 find_compatible_field (tree record
, tree orig_field
)
6274 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
6275 if (TREE_CODE (f
) == FIELD_DECL
6276 && fields_compatible_p (f
, orig_field
))
6279 /* ??? Why isn't this on the main fields list? */
6280 f
= TYPE_VFIELD (record
);
6281 if (f
&& TREE_CODE (f
) == FIELD_DECL
6282 && fields_compatible_p (f
, orig_field
))
6285 /* ??? We should abort here, but Java appears to do Bad Things
6286 with inherited fields. */
6290 /* Return value of a constant X. */
6293 int_cst_value (tree x
)
6295 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
6296 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
6297 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
6299 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
6302 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
6304 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
6309 /* Returns the greatest common divisor of A and B, which must be
6313 tree_fold_gcd (tree a
, tree b
)
6316 tree type
= TREE_TYPE (a
);
6318 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
6319 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
6321 if (integer_zerop (a
))
6324 if (integer_zerop (b
))
6327 if (tree_int_cst_sgn (a
) == -1)
6328 a
= fold (build2 (MULT_EXPR
, type
, a
,
6329 convert (type
, integer_minus_one_node
)));
6331 if (tree_int_cst_sgn (b
) == -1)
6332 b
= fold (build2 (MULT_EXPR
, type
, b
,
6333 convert (type
, integer_minus_one_node
)));
6337 a_mod_b
= fold (build2 (FLOOR_MOD_EXPR
, type
, a
, b
));
6339 if (!TREE_INT_CST_LOW (a_mod_b
)
6340 && !TREE_INT_CST_HIGH (a_mod_b
))
6348 /* Returns unsigned variant of TYPE. */
6351 unsigned_type_for (tree type
)
6353 return lang_hooks
.types
.unsigned_type (type
);
6356 /* Returns signed variant of TYPE. */
6359 signed_type_for (tree type
)
6361 return lang_hooks
.types
.signed_type (type
);
6364 /* Returns the largest value obtainable by casting something in INNER type to
6368 upper_bound_in_type (tree outer
, tree inner
)
6370 unsigned HOST_WIDE_INT lo
, hi
;
6371 unsigned bits
= TYPE_PRECISION (inner
);
6373 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6375 /* Zero extending in these cases. */
6376 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6379 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6380 >> (HOST_BITS_PER_WIDE_INT
- bits
);
6384 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6385 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
);
6386 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6391 /* Sign extending in these cases. */
6392 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6395 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6396 >> (HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6400 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6401 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6402 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6406 return fold_convert (outer
,
6407 build_int_cst_wide (inner
, lo
, hi
));
6410 /* Returns the smallest value obtainable by casting something in INNER type to
6414 lower_bound_in_type (tree outer
, tree inner
)
6416 unsigned HOST_WIDE_INT lo
, hi
;
6417 unsigned bits
= TYPE_PRECISION (inner
);
6419 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6421 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
6423 hi
= ~(unsigned HOST_WIDE_INT
) 0;
6424 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1);
6428 hi
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- HOST_BITS_PER_WIDE_INT
- 1);
6432 return fold_convert (outer
,
6433 build_int_cst_wide (inner
, lo
, hi
));
6436 /* Return nonzero if two operands that are suitable for PHI nodes are
6437 necessarily equal. Specifically, both ARG0 and ARG1 must be either
6438 SSA_NAME or invariant. Note that this is strictly an optimization.
6439 That is, callers of this function can directly call operand_equal_p
6440 and get the same result, only slower. */
6443 operand_equal_for_phi_arg_p (tree arg0
, tree arg1
)
6447 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
6449 return operand_equal_p (arg0
, arg1
, 0);
6452 /* Returns number of zeros at the end of binary representation of X.
6454 ??? Use ffs if available? */
6457 num_ending_zeros (tree x
)
6459 unsigned HOST_WIDE_INT fr
, nfr
;
6460 unsigned num
, abits
;
6461 tree type
= TREE_TYPE (x
);
6463 if (TREE_INT_CST_LOW (x
) == 0)
6465 num
= HOST_BITS_PER_WIDE_INT
;
6466 fr
= TREE_INT_CST_HIGH (x
);
6471 fr
= TREE_INT_CST_LOW (x
);
6474 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
6477 if (nfr
<< abits
== fr
)
6484 if (num
> TYPE_PRECISION (type
))
6485 num
= TYPE_PRECISION (type
);
6487 return build_int_cst_type (type
, num
);
6491 #define WALK_SUBTREE(NODE) \
6494 result = walk_tree (&(NODE), func, data, pset); \
6500 /* This is a subroutine of walk_tree that walks field of TYPE that are to
6501 be walked whenever a type is seen in the tree. Rest of operands and return
6502 value are as for walk_tree. */
6505 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
6506 struct pointer_set_t
*pset
)
6508 tree result
= NULL_TREE
;
6510 switch (TREE_CODE (type
))
6513 case REFERENCE_TYPE
:
6514 /* We have to worry about mutually recursive pointers. These can't
6515 be written in C. They can in Ada. It's pathological, but
6516 there's an ACATS test (c38102a) that checks it. Deal with this
6517 by checking if we're pointing to another pointer, that one
6518 points to another pointer, that one does too, and we have no htab.
6519 If so, get a hash table. We check three levels deep to avoid
6520 the cost of the hash table if we don't need one. */
6521 if (POINTER_TYPE_P (TREE_TYPE (type
))
6522 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
6523 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
6526 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
6534 /* ... fall through ... */
6537 WALK_SUBTREE (TREE_TYPE (type
));
6541 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
6546 WALK_SUBTREE (TREE_TYPE (type
));
6550 /* We never want to walk into default arguments. */
6551 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
6552 WALK_SUBTREE (TREE_VALUE (arg
));
6557 /* Don't follow this nodes's type if a pointer for fear that we'll
6558 have infinite recursion. Those types are uninteresting anyway. */
6559 if (!POINTER_TYPE_P (TREE_TYPE (type
))
6560 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
6561 WALK_SUBTREE (TREE_TYPE (type
));
6562 WALK_SUBTREE (TYPE_DOMAIN (type
));
6570 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
6571 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
6575 WALK_SUBTREE (TREE_TYPE (type
));
6576 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
6586 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
6587 called with the DATA and the address of each sub-tree. If FUNC returns a
6588 non-NULL value, the traversal is stopped, and the value returned by FUNC
6589 is returned. If PSET is non-NULL it is used to record the nodes visited,
6590 and to avoid visiting a node more than once. */
6593 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
6595 enum tree_code code
;
6599 #define WALK_SUBTREE_TAIL(NODE) \
6603 goto tail_recurse; \
6608 /* Skip empty subtrees. */
6612 /* Don't walk the same tree twice, if the user has requested
6613 that we avoid doing so. */
6614 if (pset
&& pointer_set_insert (pset
, *tp
))
6617 /* Call the function. */
6619 result
= (*func
) (tp
, &walk_subtrees
, data
);
6621 /* If we found something, return it. */
6625 code
= TREE_CODE (*tp
);
6627 /* Even if we didn't, FUNC may have decided that there was nothing
6628 interesting below this point in the tree. */
6631 if (code
== TREE_LIST
)
6632 /* But we still need to check our siblings. */
6633 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
6638 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
6640 if (result
|| ! walk_subtrees
)
6643 /* If this is a DECL_EXPR, walk into various fields of the type that it's
6644 defining. We only want to walk into these fields of a type in this
6645 case. Note that decls get walked as part of the processing of a
6648 ??? Precisely which fields of types that we are supposed to walk in
6649 this case vs. the normal case aren't well defined. */
6650 if (code
== DECL_EXPR
6651 && TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
6652 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
6654 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
6656 /* Call the function for the type. See if it returns anything or
6657 doesn't want us to continue. If we are to continue, walk both
6658 the normal fields and those for the declaration case. */
6659 result
= (*func
) (type_p
, &walk_subtrees
, data
);
6660 if (result
|| !walk_subtrees
)
6663 result
= walk_type_fields (*type_p
, func
, data
, pset
);
6667 WALK_SUBTREE (TYPE_SIZE (*type_p
));
6668 WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p
));
6670 /* If this is a record type, also walk the fields. */
6671 if (TREE_CODE (*type_p
) == RECORD_TYPE
6672 || TREE_CODE (*type_p
) == UNION_TYPE
6673 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
6677 for (field
= TYPE_FIELDS (*type_p
); field
;
6678 field
= TREE_CHAIN (field
))
6680 /* We'd like to look at the type of the field, but we can easily
6681 get infinite recursion. So assume it's pointed to elsewhere
6682 in the tree. Also, ignore things that aren't fields. */
6683 if (TREE_CODE (field
) != FIELD_DECL
)
6686 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
6687 WALK_SUBTREE (DECL_SIZE (field
));
6688 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
6689 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
6690 WALK_SUBTREE (DECL_QUALIFIER (field
));
6695 else if (code
!= SAVE_EXPR
6696 && code
!= BIND_EXPR
6697 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
6701 /* Walk over all the sub-trees of this operand. */
6702 len
= TREE_CODE_LENGTH (code
);
6703 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
6704 But, we only want to walk once. */
6705 if (code
== TARGET_EXPR
6706 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
6709 /* Go through the subtrees. We need to do this in forward order so
6710 that the scope of a FOR_EXPR is handled properly. */
6711 #ifdef DEBUG_WALK_TREE
6712 for (i
= 0; i
< len
; ++i
)
6713 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
6715 for (i
= 0; i
< len
- 1; ++i
)
6716 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
6720 /* The common case is that we may tail recurse here. */
6721 if (code
!= BIND_EXPR
6722 && !TREE_CHAIN (*tp
))
6723 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
6725 WALK_SUBTREE (TREE_OPERAND (*tp
, len
- 1));
6730 /* If this is a type, walk the needed fields in the type. */
6731 else if (TYPE_P (*tp
))
6733 result
= walk_type_fields (*tp
, func
, data
, pset
);
6739 /* Not one of the easy cases. We must explicitly go through the
6744 case IDENTIFIER_NODE
:
6750 case PLACEHOLDER_EXPR
:
6754 /* None of these have subtrees other than those already walked
6759 WALK_SUBTREE (TREE_VALUE (*tp
));
6760 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
6765 int len
= TREE_VEC_LENGTH (*tp
);
6770 /* Walk all elements but the first. */
6772 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
6774 /* Now walk the first one as a tail call. */
6775 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
6779 WALK_SUBTREE (TREE_REALPART (*tp
));
6780 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
6783 WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp
));
6786 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
6791 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
6793 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
6794 into declarations that are just mentioned, rather than
6795 declared; they don't really belong to this part of the tree.
6796 And, we can see cycles: the initializer for a declaration
6797 can refer to the declaration itself. */
6798 WALK_SUBTREE (DECL_INITIAL (decl
));
6799 WALK_SUBTREE (DECL_SIZE (decl
));
6800 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
6802 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
6805 case STATEMENT_LIST
:
6807 tree_stmt_iterator i
;
6808 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
6809 WALK_SUBTREE (*tsi_stmt_ptr (i
));
6814 /* ??? This could be a language-defined node. We really should make
6815 a hook for it, but right now just ignore it. */
6820 /* We didn't find what we were looking for. */
6823 #undef WALK_SUBTREE_TAIL
6827 /* Like walk_tree, but does not walk duplicate nodes more than once. */
6830 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
6833 struct pointer_set_t
*pset
;
6835 pset
= pointer_set_create ();
6836 result
= walk_tree (tp
, func
, data
, pset
);
6837 pointer_set_destroy (pset
);
6841 #include "gt-tree.h"