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 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"
53 /* Each tree code class has an associated string representation.
54 These must correspond to the tree_code_class entries. */
56 const char *const tree_code_class_strings
[] =
70 /* obstack.[ch] explicitly declined to prototype this. */
71 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
73 #ifdef GATHER_STATISTICS
74 /* Statistics-gathering stuff. */
76 int tree_node_counts
[(int) all_kinds
];
77 int tree_node_sizes
[(int) all_kinds
];
79 /* Keep in sync with tree.h:enum tree_node_kind. */
80 static const char * const tree_node_kind_names
[] = {
99 #endif /* GATHER_STATISTICS */
101 /* Unique id for next decl created. */
102 static GTY(()) int next_decl_uid
;
103 /* Unique id for next type created. */
104 static GTY(()) int next_type_uid
= 1;
106 /* Since we cannot rehash a type after it is in the table, we have to
107 keep the hash code. */
109 struct type_hash
GTY(())
115 /* Initial size of the hash table (rounded to next prime). */
116 #define TYPE_HASH_INITIAL_SIZE 1000
118 /* Now here is the hash table. When recording a type, it is added to
119 the slot whose index is the hash code. Note that the hash table is
120 used for several kinds of types (function types, array types and
121 array index range types, for now). While all these live in the
122 same table, they are completely independent, and the hash code is
123 computed differently for each of these. */
125 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
126 htab_t type_hash_table
;
128 static void set_type_quals (tree
, int);
129 static int type_hash_eq (const void *, const void *);
130 static hashval_t
type_hash_hash (const void *);
131 static void print_type_hash_statistics (void);
132 static tree
make_vector_type (tree
, int, enum machine_mode
);
133 static int type_hash_marked_p (const void *);
134 static unsigned int type_hash_list (tree
, hashval_t
);
135 static unsigned int attribute_hash_list (tree
, hashval_t
);
137 tree global_trees
[TI_MAX
];
138 tree integer_types
[itk_none
];
145 /* Initialize the hash table of types. */
146 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
151 /* The name of the object as the assembler will see it (but before any
152 translations made by ASM_OUTPUT_LABELREF). Often this is the same
153 as DECL_NAME. It is an IDENTIFIER_NODE. */
155 decl_assembler_name (tree decl
)
157 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
158 lang_hooks
.set_decl_assembler_name (decl
);
159 return DECL_CHECK (decl
)->decl
.assembler_name
;
162 /* Compute the number of bytes occupied by a tree with code CODE.
163 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
164 codes, which are of variable length. */
166 tree_code_size (enum tree_code code
)
168 switch (TREE_CODE_CLASS (code
))
170 case tcc_declaration
: /* A decl node */
171 return sizeof (struct tree_decl
);
173 case tcc_type
: /* a type node */
174 return sizeof (struct tree_type
);
176 case tcc_reference
: /* a reference */
177 case tcc_expression
: /* an expression */
178 case tcc_statement
: /* an expression with side effects */
179 case tcc_comparison
: /* a comparison expression */
180 case tcc_unary
: /* a unary arithmetic expression */
181 case tcc_binary
: /* a binary arithmetic expression */
182 return (sizeof (struct tree_exp
)
183 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
185 case tcc_constant
: /* a constant */
188 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
189 case REAL_CST
: return sizeof (struct tree_real_cst
);
190 case COMPLEX_CST
: return sizeof (struct tree_complex
);
191 case VECTOR_CST
: return sizeof (struct tree_vector
);
192 case STRING_CST
: gcc_unreachable ();
194 return lang_hooks
.tree_size (code
);
197 case tcc_exceptional
: /* something random, like an identifier. */
200 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
201 case TREE_LIST
: return sizeof (struct tree_list
);
204 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
207 case PHI_NODE
: gcc_unreachable ();
209 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
211 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
212 case BLOCK
: return sizeof (struct tree_block
);
213 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
216 return lang_hooks
.tree_size (code
);
224 /* Compute the number of bytes occupied by NODE. This routine only
225 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
227 tree_size (tree node
)
229 enum tree_code code
= TREE_CODE (node
);
233 return (sizeof (struct tree_phi_node
)
234 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
237 return (sizeof (struct tree_vec
)
238 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
241 return sizeof (struct tree_string
) + TREE_STRING_LENGTH (node
) - 1;
244 return tree_code_size (code
);
248 /* Return a newly allocated node of code CODE. For decl and type
249 nodes, some other fields are initialized. The rest of the node is
250 initialized to zero. This function cannot be used for PHI_NODE or
251 TREE_VEC nodes, which is enforced by asserts in tree_code_size.
253 Achoo! I got a code in the node. */
256 make_node_stat (enum tree_code code MEM_STAT_DECL
)
259 enum tree_code_class type
= TREE_CODE_CLASS (code
);
260 size_t length
= tree_code_size (code
);
261 #ifdef GATHER_STATISTICS
266 case tcc_declaration
: /* A decl node */
270 case tcc_type
: /* a type node */
274 case tcc_statement
: /* an expression with side effects */
278 case tcc_reference
: /* a reference */
282 case tcc_expression
: /* an expression */
283 case tcc_comparison
: /* a comparison expression */
284 case tcc_unary
: /* a unary arithmetic expression */
285 case tcc_binary
: /* a binary arithmetic expression */
289 case tcc_constant
: /* a constant */
293 case tcc_exceptional
: /* something random, like an identifier. */
294 if (code
== IDENTIFIER_NODE
)
296 else if (code
== TREE_VEC
)
298 else if (code
== TREE_BINFO
)
300 else if (code
== PHI_NODE
)
302 else if (code
== SSA_NAME
)
303 kind
= ssa_name_kind
;
304 else if (code
== BLOCK
)
311 tree_node_counts
[(int) kind
]++;
312 tree_node_sizes
[(int) kind
] += length
;
315 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
317 memset (t
, 0, length
);
319 TREE_SET_CODE (t
, code
);
324 TREE_SIDE_EFFECTS (t
) = 1;
327 case tcc_declaration
:
328 if (code
!= FUNCTION_DECL
)
330 DECL_USER_ALIGN (t
) = 0;
331 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
332 DECL_SOURCE_LOCATION (t
) = input_location
;
333 DECL_UID (t
) = next_decl_uid
++;
335 /* We have not yet computed the alias set for this declaration. */
336 DECL_POINTER_ALIAS_SET (t
) = -1;
340 TYPE_UID (t
) = next_type_uid
++;
341 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
342 TYPE_USER_ALIGN (t
) = 0;
343 TYPE_MAIN_VARIANT (t
) = t
;
345 /* Default to no attributes for type, but let target change that. */
346 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
347 targetm
.set_default_type_attributes (t
);
349 /* We have not yet computed the alias set for this type. */
350 TYPE_ALIAS_SET (t
) = -1;
354 TREE_CONSTANT (t
) = 1;
355 TREE_INVARIANT (t
) = 1;
364 case PREDECREMENT_EXPR
:
365 case PREINCREMENT_EXPR
:
366 case POSTDECREMENT_EXPR
:
367 case POSTINCREMENT_EXPR
:
368 /* All of these have side-effects, no matter what their
370 TREE_SIDE_EFFECTS (t
) = 1;
379 /* Other classes need no special treatment. */
386 /* Return a new node with the same contents as NODE except that its
387 TREE_CHAIN is zero and it has a fresh uid. */
390 copy_node_stat (tree node MEM_STAT_DECL
)
393 enum tree_code code
= TREE_CODE (node
);
396 gcc_assert (code
!= STATEMENT_LIST
);
398 length
= tree_size (node
);
399 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
400 memcpy (t
, node
, length
);
403 TREE_ASM_WRITTEN (t
) = 0;
404 TREE_VISITED (t
) = 0;
407 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
408 DECL_UID (t
) = next_decl_uid
++;
409 else if (TREE_CODE_CLASS (code
) == tcc_type
)
411 TYPE_UID (t
) = next_type_uid
++;
412 /* The following is so that the debug code for
413 the copy is different from the original type.
414 The two statements usually duplicate each other
415 (because they clear fields of the same union),
416 but the optimizer should catch that. */
417 TYPE_SYMTAB_POINTER (t
) = 0;
418 TYPE_SYMTAB_ADDRESS (t
) = 0;
420 /* Do not copy the values cache. */
421 if (TYPE_CACHED_VALUES_P(t
))
423 TYPE_CACHED_VALUES_P (t
) = 0;
424 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
431 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
432 For example, this can copy a list made of TREE_LIST nodes. */
435 copy_list (tree list
)
443 head
= prev
= copy_node (list
);
444 next
= TREE_CHAIN (list
);
447 TREE_CHAIN (prev
) = copy_node (next
);
448 prev
= TREE_CHAIN (prev
);
449 next
= TREE_CHAIN (next
);
455 /* Create an INT_CST node with a LOW value sign extended. */
458 build_int_cst (tree type
, HOST_WIDE_INT low
)
460 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
463 /* Create an INT_CST node with a LOW value zero extended. */
466 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
468 return build_int_cst_wide (type
, low
, 0);
471 /* Create an INT_CST node with a LOW value zero or sign extended depending
475 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
477 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
484 type
= integer_type_node
;
486 bits
= TYPE_PRECISION (type
);
487 signed_p
= !TYPE_UNSIGNED (type
);
488 negative
= ((val
>> (bits
- 1)) & 1) != 0;
490 if (signed_p
&& negative
)
492 if (bits
< HOST_BITS_PER_WIDE_INT
)
493 val
= val
| ((~(unsigned HOST_WIDE_INT
) 0) << bits
);
494 ret
= build_int_cst_wide (type
, val
, ~(unsigned HOST_WIDE_INT
) 0);
498 if (bits
< HOST_BITS_PER_WIDE_INT
)
499 val
= val
& ~((~(unsigned HOST_WIDE_INT
) 0) << bits
);
500 ret
= build_int_cst_wide (type
, val
, 0);
506 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
507 integer_type_node is used. */
510 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
517 type
= integer_type_node
;
519 switch (TREE_CODE (type
))
523 /* Cache NULL pointer. */
532 /* Cache false or true. */
541 if (TYPE_UNSIGNED (type
))
544 limit
= INTEGER_SHARE_LIMIT
;
545 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
551 limit
= INTEGER_SHARE_LIMIT
+ 1;
552 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
554 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
564 if (!TYPE_CACHED_VALUES_P (type
))
566 TYPE_CACHED_VALUES_P (type
) = 1;
567 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
570 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
573 /* Make sure no one is clobbering the shared constant. */
574 gcc_assert (TREE_TYPE (t
) == type
);
575 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
576 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
581 t
= make_node (INTEGER_CST
);
583 TREE_INT_CST_LOW (t
) = low
;
584 TREE_INT_CST_HIGH (t
) = hi
;
585 TREE_TYPE (t
) = type
;
588 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
593 /* Checks that X is integer constant that can be expressed in (unsigned)
594 HOST_WIDE_INT without loss of precision. */
597 cst_and_fits_in_hwi (tree x
)
599 if (TREE_CODE (x
) != INTEGER_CST
)
602 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
605 return (TREE_INT_CST_HIGH (x
) == 0
606 || TREE_INT_CST_HIGH (x
) == -1);
609 /* Return a new VECTOR_CST node whose type is TYPE and whose values
610 are in a list pointed by VALS. */
613 build_vector (tree type
, tree vals
)
615 tree v
= make_node (VECTOR_CST
);
616 int over1
= 0, over2
= 0;
619 TREE_VECTOR_CST_ELTS (v
) = vals
;
620 TREE_TYPE (v
) = type
;
622 /* Iterate through elements and check for overflow. */
623 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
625 tree value
= TREE_VALUE (link
);
627 over1
|= TREE_OVERFLOW (value
);
628 over2
|= TREE_CONSTANT_OVERFLOW (value
);
631 TREE_OVERFLOW (v
) = over1
;
632 TREE_CONSTANT_OVERFLOW (v
) = over2
;
637 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
638 are in a list pointed to by VALS. */
640 build_constructor (tree type
, tree vals
)
642 tree c
= make_node (CONSTRUCTOR
);
643 TREE_TYPE (c
) = type
;
644 CONSTRUCTOR_ELTS (c
) = vals
;
646 /* ??? May not be necessary. Mirrors what build does. */
649 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
650 TREE_READONLY (c
) = TREE_READONLY (vals
);
651 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
652 TREE_INVARIANT (c
) = TREE_INVARIANT (vals
);
658 /* Return a new REAL_CST node whose type is TYPE and value is D. */
661 build_real (tree type
, REAL_VALUE_TYPE d
)
667 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
668 Consider doing it via real_convert now. */
670 v
= make_node (REAL_CST
);
671 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
672 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
674 TREE_TYPE (v
) = type
;
675 TREE_REAL_CST_PTR (v
) = dp
;
676 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
680 /* Return a new REAL_CST node whose type is TYPE
681 and whose value is the integer value of the INTEGER_CST node I. */
684 real_value_from_int_cst (tree type
, tree i
)
688 /* Clear all bits of the real value type so that we can later do
689 bitwise comparisons to see if two values are the same. */
690 memset (&d
, 0, sizeof d
);
692 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
693 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
694 TYPE_UNSIGNED (TREE_TYPE (i
)));
698 /* Given a tree representing an integer constant I, return a tree
699 representing the same value as a floating-point constant of type TYPE. */
702 build_real_from_int_cst (tree type
, tree i
)
705 int overflow
= TREE_OVERFLOW (i
);
707 v
= build_real (type
, real_value_from_int_cst (type
, i
));
709 TREE_OVERFLOW (v
) |= overflow
;
710 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
714 /* Return a newly constructed STRING_CST node whose value is
715 the LEN characters at STR.
716 The TREE_TYPE is not initialized. */
719 build_string (int len
, const char *str
)
724 length
= len
+ sizeof (struct tree_string
);
726 #ifdef GATHER_STATISTICS
727 tree_node_counts
[(int) c_kind
]++;
728 tree_node_sizes
[(int) c_kind
] += length
;
731 s
= ggc_alloc_tree (length
);
733 memset (s
, 0, sizeof (struct tree_common
));
734 TREE_SET_CODE (s
, STRING_CST
);
735 TREE_STRING_LENGTH (s
) = len
;
736 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
737 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
742 /* Return a newly constructed COMPLEX_CST node whose value is
743 specified by the real and imaginary parts REAL and IMAG.
744 Both REAL and IMAG should be constant nodes. TYPE, if specified,
745 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
748 build_complex (tree type
, tree real
, tree imag
)
750 tree t
= make_node (COMPLEX_CST
);
752 TREE_REALPART (t
) = real
;
753 TREE_IMAGPART (t
) = imag
;
754 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
755 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
756 TREE_CONSTANT_OVERFLOW (t
)
757 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
761 /* Build a BINFO with LEN language slots. */
764 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
767 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
768 + VEC_embedded_size (tree
, base_binfos
));
770 #ifdef GATHER_STATISTICS
771 tree_node_counts
[(int) binfo_kind
]++;
772 tree_node_sizes
[(int) binfo_kind
] += length
;
775 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
777 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
779 TREE_SET_CODE (t
, TREE_BINFO
);
781 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
787 /* Build a newly constructed TREE_VEC node of length LEN. */
790 make_tree_vec_stat (int len MEM_STAT_DECL
)
793 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
795 #ifdef GATHER_STATISTICS
796 tree_node_counts
[(int) vec_kind
]++;
797 tree_node_sizes
[(int) vec_kind
] += length
;
800 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
802 memset (t
, 0, length
);
804 TREE_SET_CODE (t
, TREE_VEC
);
805 TREE_VEC_LENGTH (t
) = len
;
810 /* Return 1 if EXPR is the integer constant zero or a complex constant
814 integer_zerop (tree expr
)
818 return ((TREE_CODE (expr
) == INTEGER_CST
819 && ! TREE_CONSTANT_OVERFLOW (expr
)
820 && TREE_INT_CST_LOW (expr
) == 0
821 && TREE_INT_CST_HIGH (expr
) == 0)
822 || (TREE_CODE (expr
) == COMPLEX_CST
823 && integer_zerop (TREE_REALPART (expr
))
824 && integer_zerop (TREE_IMAGPART (expr
))));
827 /* Return 1 if EXPR is the integer constant one or the corresponding
831 integer_onep (tree expr
)
835 return ((TREE_CODE (expr
) == INTEGER_CST
836 && ! TREE_CONSTANT_OVERFLOW (expr
)
837 && TREE_INT_CST_LOW (expr
) == 1
838 && TREE_INT_CST_HIGH (expr
) == 0)
839 || (TREE_CODE (expr
) == COMPLEX_CST
840 && integer_onep (TREE_REALPART (expr
))
841 && integer_zerop (TREE_IMAGPART (expr
))));
844 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
845 it contains. Likewise for the corresponding complex constant. */
848 integer_all_onesp (tree expr
)
855 if (TREE_CODE (expr
) == COMPLEX_CST
856 && integer_all_onesp (TREE_REALPART (expr
))
857 && integer_zerop (TREE_IMAGPART (expr
)))
860 else if (TREE_CODE (expr
) != INTEGER_CST
861 || TREE_CONSTANT_OVERFLOW (expr
))
864 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
866 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
867 && TREE_INT_CST_HIGH (expr
) == -1);
869 /* Note that using TYPE_PRECISION here is wrong. We care about the
870 actual bits, not the (arbitrary) range of the type. */
871 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
872 if (prec
>= HOST_BITS_PER_WIDE_INT
)
874 HOST_WIDE_INT high_value
;
877 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
879 /* Can not handle precisions greater than twice the host int size. */
880 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
881 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
882 /* Shifting by the host word size is undefined according to the ANSI
883 standard, so we must handle this as a special case. */
886 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
888 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
889 && TREE_INT_CST_HIGH (expr
) == high_value
);
892 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
895 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
899 integer_pow2p (tree expr
)
902 HOST_WIDE_INT high
, low
;
906 if (TREE_CODE (expr
) == COMPLEX_CST
907 && integer_pow2p (TREE_REALPART (expr
))
908 && integer_zerop (TREE_IMAGPART (expr
)))
911 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
914 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
915 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
916 high
= TREE_INT_CST_HIGH (expr
);
917 low
= TREE_INT_CST_LOW (expr
);
919 /* First clear all bits that are beyond the type's precision in case
920 we've been sign extended. */
922 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
924 else if (prec
> HOST_BITS_PER_WIDE_INT
)
925 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
929 if (prec
< HOST_BITS_PER_WIDE_INT
)
930 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
933 if (high
== 0 && low
== 0)
936 return ((high
== 0 && (low
& (low
- 1)) == 0)
937 || (low
== 0 && (high
& (high
- 1)) == 0));
940 /* Return 1 if EXPR is an integer constant other than zero or a
941 complex constant other than zero. */
944 integer_nonzerop (tree expr
)
948 return ((TREE_CODE (expr
) == INTEGER_CST
949 && ! TREE_CONSTANT_OVERFLOW (expr
)
950 && (TREE_INT_CST_LOW (expr
) != 0
951 || TREE_INT_CST_HIGH (expr
) != 0))
952 || (TREE_CODE (expr
) == COMPLEX_CST
953 && (integer_nonzerop (TREE_REALPART (expr
))
954 || integer_nonzerop (TREE_IMAGPART (expr
)))));
957 /* Return the power of two represented by a tree node known to be a
961 tree_log2 (tree expr
)
964 HOST_WIDE_INT high
, low
;
968 if (TREE_CODE (expr
) == COMPLEX_CST
)
969 return tree_log2 (TREE_REALPART (expr
));
971 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
972 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
974 high
= TREE_INT_CST_HIGH (expr
);
975 low
= TREE_INT_CST_LOW (expr
);
977 /* First clear all bits that are beyond the type's precision in case
978 we've been sign extended. */
980 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
982 else if (prec
> HOST_BITS_PER_WIDE_INT
)
983 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
987 if (prec
< HOST_BITS_PER_WIDE_INT
)
988 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
991 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
995 /* Similar, but return the largest integer Y such that 2 ** Y is less
996 than or equal to EXPR. */
999 tree_floor_log2 (tree expr
)
1002 HOST_WIDE_INT high
, low
;
1006 if (TREE_CODE (expr
) == COMPLEX_CST
)
1007 return tree_log2 (TREE_REALPART (expr
));
1009 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1010 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1012 high
= TREE_INT_CST_HIGH (expr
);
1013 low
= TREE_INT_CST_LOW (expr
);
1015 /* First clear all bits that are beyond the type's precision in case
1016 we've been sign extended. Ignore if type's precision hasn't been set
1017 since what we are doing is setting it. */
1019 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1021 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1022 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1026 if (prec
< HOST_BITS_PER_WIDE_INT
)
1027 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1030 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1031 : floor_log2 (low
));
1034 /* Return 1 if EXPR is the real constant zero. */
1037 real_zerop (tree expr
)
1041 return ((TREE_CODE (expr
) == REAL_CST
1042 && ! TREE_CONSTANT_OVERFLOW (expr
)
1043 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1044 || (TREE_CODE (expr
) == COMPLEX_CST
1045 && real_zerop (TREE_REALPART (expr
))
1046 && real_zerop (TREE_IMAGPART (expr
))));
1049 /* Return 1 if EXPR is the real constant one in real or complex form. */
1052 real_onep (tree expr
)
1056 return ((TREE_CODE (expr
) == REAL_CST
1057 && ! TREE_CONSTANT_OVERFLOW (expr
)
1058 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1059 || (TREE_CODE (expr
) == COMPLEX_CST
1060 && real_onep (TREE_REALPART (expr
))
1061 && real_zerop (TREE_IMAGPART (expr
))));
1064 /* Return 1 if EXPR is the real constant two. */
1067 real_twop (tree expr
)
1071 return ((TREE_CODE (expr
) == REAL_CST
1072 && ! TREE_CONSTANT_OVERFLOW (expr
)
1073 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1074 || (TREE_CODE (expr
) == COMPLEX_CST
1075 && real_twop (TREE_REALPART (expr
))
1076 && real_zerop (TREE_IMAGPART (expr
))));
1079 /* Return 1 if EXPR is the real constant minus one. */
1082 real_minus_onep (tree expr
)
1086 return ((TREE_CODE (expr
) == REAL_CST
1087 && ! TREE_CONSTANT_OVERFLOW (expr
)
1088 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1089 || (TREE_CODE (expr
) == COMPLEX_CST
1090 && real_minus_onep (TREE_REALPART (expr
))
1091 && real_zerop (TREE_IMAGPART (expr
))));
1094 /* Nonzero if EXP is a constant or a cast of a constant. */
1097 really_constant_p (tree exp
)
1099 /* This is not quite the same as STRIP_NOPS. It does more. */
1100 while (TREE_CODE (exp
) == NOP_EXPR
1101 || TREE_CODE (exp
) == CONVERT_EXPR
1102 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1103 exp
= TREE_OPERAND (exp
, 0);
1104 return TREE_CONSTANT (exp
);
1107 /* Return first list element whose TREE_VALUE is ELEM.
1108 Return 0 if ELEM is not in LIST. */
1111 value_member (tree elem
, tree list
)
1115 if (elem
== TREE_VALUE (list
))
1117 list
= TREE_CHAIN (list
);
1122 /* Return first list element whose TREE_PURPOSE is ELEM.
1123 Return 0 if ELEM is not in LIST. */
1126 purpose_member (tree elem
, tree list
)
1130 if (elem
== TREE_PURPOSE (list
))
1132 list
= TREE_CHAIN (list
);
1137 /* Return nonzero if ELEM is part of the chain CHAIN. */
1140 chain_member (tree elem
, tree chain
)
1146 chain
= TREE_CHAIN (chain
);
1152 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1153 We expect a null pointer to mark the end of the chain.
1154 This is the Lisp primitive `length'. */
1157 list_length (tree t
)
1160 #ifdef ENABLE_TREE_CHECKING
1168 #ifdef ENABLE_TREE_CHECKING
1171 gcc_assert (p
!= q
);
1179 /* Returns the number of FIELD_DECLs in TYPE. */
1182 fields_length (tree type
)
1184 tree t
= TYPE_FIELDS (type
);
1187 for (; t
; t
= TREE_CHAIN (t
))
1188 if (TREE_CODE (t
) == FIELD_DECL
)
1194 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1195 by modifying the last node in chain 1 to point to chain 2.
1196 This is the Lisp primitive `nconc'. */
1199 chainon (tree op1
, tree op2
)
1208 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1210 TREE_CHAIN (t1
) = op2
;
1212 #ifdef ENABLE_TREE_CHECKING
1215 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1216 gcc_assert (t2
!= t1
);
1223 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1226 tree_last (tree chain
)
1230 while ((next
= TREE_CHAIN (chain
)))
1235 /* Reverse the order of elements in the chain T,
1236 and return the new head of the chain (old last element). */
1241 tree prev
= 0, decl
, next
;
1242 for (decl
= t
; decl
; decl
= next
)
1244 next
= TREE_CHAIN (decl
);
1245 TREE_CHAIN (decl
) = prev
;
1251 /* Return a newly created TREE_LIST node whose
1252 purpose and value fields are PARM and VALUE. */
1255 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1257 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1258 TREE_PURPOSE (t
) = parm
;
1259 TREE_VALUE (t
) = value
;
1263 /* Return a newly created TREE_LIST node whose
1264 purpose and value fields are PURPOSE and VALUE
1265 and whose TREE_CHAIN is CHAIN. */
1268 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1272 node
= ggc_alloc_zone_stat (sizeof (struct tree_list
),
1273 tree_zone PASS_MEM_STAT
);
1275 memset (node
, 0, sizeof (struct tree_common
));
1277 #ifdef GATHER_STATISTICS
1278 tree_node_counts
[(int) x_kind
]++;
1279 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1282 TREE_SET_CODE (node
, TREE_LIST
);
1283 TREE_CHAIN (node
) = chain
;
1284 TREE_PURPOSE (node
) = purpose
;
1285 TREE_VALUE (node
) = value
;
1290 /* Return the size nominally occupied by an object of type TYPE
1291 when it resides in memory. The value is measured in units of bytes,
1292 and its data type is that normally used for type sizes
1293 (which is the first type created by make_signed_type or
1294 make_unsigned_type). */
1297 size_in_bytes (tree type
)
1301 if (type
== error_mark_node
)
1302 return integer_zero_node
;
1304 type
= TYPE_MAIN_VARIANT (type
);
1305 t
= TYPE_SIZE_UNIT (type
);
1309 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1310 return size_zero_node
;
1313 if (TREE_CODE (t
) == INTEGER_CST
)
1314 t
= force_fit_type (t
, 0, false, false);
1319 /* Return the size of TYPE (in bytes) as a wide integer
1320 or return -1 if the size can vary or is larger than an integer. */
1323 int_size_in_bytes (tree type
)
1327 if (type
== error_mark_node
)
1330 type
= TYPE_MAIN_VARIANT (type
);
1331 t
= TYPE_SIZE_UNIT (type
);
1333 || TREE_CODE (t
) != INTEGER_CST
1334 || TREE_OVERFLOW (t
)
1335 || TREE_INT_CST_HIGH (t
) != 0
1336 /* If the result would appear negative, it's too big to represent. */
1337 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1340 return TREE_INT_CST_LOW (t
);
1343 /* Return the bit position of FIELD, in bits from the start of the record.
1344 This is a tree of type bitsizetype. */
1347 bit_position (tree field
)
1349 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1350 DECL_FIELD_BIT_OFFSET (field
));
1353 /* Likewise, but return as an integer. Abort if it cannot be represented
1354 in that way (since it could be a signed value, we don't have the option
1355 of returning -1 like int_size_in_byte can. */
1358 int_bit_position (tree field
)
1360 return tree_low_cst (bit_position (field
), 0);
1363 /* Return the byte position of FIELD, in bytes from the start of the record.
1364 This is a tree of type sizetype. */
1367 byte_position (tree field
)
1369 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1370 DECL_FIELD_BIT_OFFSET (field
));
1373 /* Likewise, but return as an integer. Abort if it cannot be represented
1374 in that way (since it could be a signed value, we don't have the option
1375 of returning -1 like int_size_in_byte can. */
1378 int_byte_position (tree field
)
1380 return tree_low_cst (byte_position (field
), 0);
1383 /* Return the strictest alignment, in bits, that T is known to have. */
1388 unsigned int align0
, align1
;
1390 switch (TREE_CODE (t
))
1392 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1393 /* If we have conversions, we know that the alignment of the
1394 object must meet each of the alignments of the types. */
1395 align0
= expr_align (TREE_OPERAND (t
, 0));
1396 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1397 return MAX (align0
, align1
);
1399 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1400 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1401 case CLEANUP_POINT_EXPR
:
1402 /* These don't change the alignment of an object. */
1403 return expr_align (TREE_OPERAND (t
, 0));
1406 /* The best we can do is say that the alignment is the least aligned
1408 align0
= expr_align (TREE_OPERAND (t
, 1));
1409 align1
= expr_align (TREE_OPERAND (t
, 2));
1410 return MIN (align0
, align1
);
1412 case LABEL_DECL
: case CONST_DECL
:
1413 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1414 if (DECL_ALIGN (t
) != 0)
1415 return DECL_ALIGN (t
);
1419 return FUNCTION_BOUNDARY
;
1425 /* Otherwise take the alignment from that of the type. */
1426 return TYPE_ALIGN (TREE_TYPE (t
));
1429 /* Return, as a tree node, the number of elements for TYPE (which is an
1430 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1433 array_type_nelts (tree type
)
1435 tree index_type
, min
, max
;
1437 /* If they did it with unspecified bounds, then we should have already
1438 given an error about it before we got here. */
1439 if (! TYPE_DOMAIN (type
))
1440 return error_mark_node
;
1442 index_type
= TYPE_DOMAIN (type
);
1443 min
= TYPE_MIN_VALUE (index_type
);
1444 max
= TYPE_MAX_VALUE (index_type
);
1446 return (integer_zerop (min
)
1448 : fold (build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1451 /* If arg is static -- a reference to an object in static storage -- then
1452 return the object. This is not the same as the C meaning of `static'.
1453 If arg isn't static, return NULL. */
1458 switch (TREE_CODE (arg
))
1461 /* Nested functions aren't static, since taking their address
1462 involves a trampoline. */
1463 return ((decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1464 && ! DECL_NON_ADDR_CONST_P (arg
)
1468 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1469 && ! DECL_THREAD_LOCAL (arg
)
1470 && ! DECL_NON_ADDR_CONST_P (arg
)
1474 return TREE_STATIC (arg
) ? arg
: NULL
;
1481 /* If the thing being referenced is not a field, then it is
1482 something language specific. */
1483 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1484 return (*lang_hooks
.staticp
) (arg
);
1486 /* If we are referencing a bitfield, we can't evaluate an
1487 ADDR_EXPR at compile time and so it isn't a constant. */
1488 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1491 return staticp (TREE_OPERAND (arg
, 0));
1496 case MISALIGNED_INDIRECT_REF
:
1497 case ALIGN_INDIRECT_REF
:
1499 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
1502 case ARRAY_RANGE_REF
:
1503 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1504 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1505 return staticp (TREE_OPERAND (arg
, 0));
1510 if ((unsigned int) TREE_CODE (arg
)
1511 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1512 return lang_hooks
.staticp (arg
);
1518 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1519 Do this to any expression which may be used in more than one place,
1520 but must be evaluated only once.
1522 Normally, expand_expr would reevaluate the expression each time.
1523 Calling save_expr produces something that is evaluated and recorded
1524 the first time expand_expr is called on it. Subsequent calls to
1525 expand_expr just reuse the recorded value.
1527 The call to expand_expr that generates code that actually computes
1528 the value is the first call *at compile time*. Subsequent calls
1529 *at compile time* generate code to use the saved value.
1530 This produces correct result provided that *at run time* control
1531 always flows through the insns made by the first expand_expr
1532 before reaching the other places where the save_expr was evaluated.
1533 You, the caller of save_expr, must make sure this is so.
1535 Constants, and certain read-only nodes, are returned with no
1536 SAVE_EXPR because that is safe. Expressions containing placeholders
1537 are not touched; see tree.def for an explanation of what these
1541 save_expr (tree expr
)
1543 tree t
= fold (expr
);
1546 /* If the tree evaluates to a constant, then we don't want to hide that
1547 fact (i.e. this allows further folding, and direct checks for constants).
1548 However, a read-only object that has side effects cannot be bypassed.
1549 Since it is no problem to reevaluate literals, we just return the
1551 inner
= skip_simple_arithmetic (t
);
1553 if (TREE_INVARIANT (inner
)
1554 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1555 || TREE_CODE (inner
) == SAVE_EXPR
1556 || TREE_CODE (inner
) == ERROR_MARK
)
1559 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1560 it means that the size or offset of some field of an object depends on
1561 the value within another field.
1563 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1564 and some variable since it would then need to be both evaluated once and
1565 evaluated more than once. Front-ends must assure this case cannot
1566 happen by surrounding any such subexpressions in their own SAVE_EXPR
1567 and forcing evaluation at the proper time. */
1568 if (contains_placeholder_p (inner
))
1571 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
1573 /* This expression might be placed ahead of a jump to ensure that the
1574 value was computed on both sides of the jump. So make sure it isn't
1575 eliminated as dead. */
1576 TREE_SIDE_EFFECTS (t
) = 1;
1577 TREE_INVARIANT (t
) = 1;
1581 /* Look inside EXPR and into any simple arithmetic operations. Return
1582 the innermost non-arithmetic node. */
1585 skip_simple_arithmetic (tree expr
)
1589 /* We don't care about whether this can be used as an lvalue in this
1591 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1592 expr
= TREE_OPERAND (expr
, 0);
1594 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1595 a constant, it will be more efficient to not make another SAVE_EXPR since
1596 it will allow better simplification and GCSE will be able to merge the
1597 computations if they actually occur. */
1601 if (UNARY_CLASS_P (inner
))
1602 inner
= TREE_OPERAND (inner
, 0);
1603 else if (BINARY_CLASS_P (inner
))
1605 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
1606 inner
= TREE_OPERAND (inner
, 0);
1607 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
1608 inner
= TREE_OPERAND (inner
, 1);
1619 /* Returns the index of the first non-tree operand for CODE, or the number
1620 of operands if all are trees. */
1623 first_rtl_op (enum tree_code code
)
1628 return TREE_CODE_LENGTH (code
);
1632 /* Return which tree structure is used by T. */
1634 enum tree_node_structure_enum
1635 tree_node_structure (tree t
)
1637 enum tree_code code
= TREE_CODE (t
);
1639 switch (TREE_CODE_CLASS (code
))
1641 case tcc_declaration
:
1646 case tcc_comparison
:
1649 case tcc_expression
:
1652 default: /* tcc_constant and tcc_exceptional */
1657 /* tcc_constant cases. */
1658 case INTEGER_CST
: return TS_INT_CST
;
1659 case REAL_CST
: return TS_REAL_CST
;
1660 case COMPLEX_CST
: return TS_COMPLEX
;
1661 case VECTOR_CST
: return TS_VECTOR
;
1662 case STRING_CST
: return TS_STRING
;
1663 /* tcc_exceptional cases. */
1664 case ERROR_MARK
: return TS_COMMON
;
1665 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1666 case TREE_LIST
: return TS_LIST
;
1667 case TREE_VEC
: return TS_VEC
;
1668 case PHI_NODE
: return TS_PHI_NODE
;
1669 case SSA_NAME
: return TS_SSA_NAME
;
1670 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1671 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
1672 case BLOCK
: return TS_BLOCK
;
1673 case TREE_BINFO
: return TS_BINFO
;
1674 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
1681 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1682 or offset that depends on a field within a record. */
1685 contains_placeholder_p (tree exp
)
1687 enum tree_code code
;
1692 code
= TREE_CODE (exp
);
1693 if (code
== PLACEHOLDER_EXPR
)
1696 switch (TREE_CODE_CLASS (code
))
1699 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1700 position computations since they will be converted into a
1701 WITH_RECORD_EXPR involving the reference, which will assume
1702 here will be valid. */
1703 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1705 case tcc_exceptional
:
1706 if (code
== TREE_LIST
)
1707 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
1708 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
1713 case tcc_comparison
:
1714 case tcc_expression
:
1718 /* Ignoring the first operand isn't quite right, but works best. */
1719 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1722 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1723 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
1724 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
1730 switch (first_rtl_op (code
))
1733 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1735 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1736 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
1747 /* Return true if any part of the computation of TYPE involves a
1748 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
1749 (for QUAL_UNION_TYPE) and field positions. */
1752 type_contains_placeholder_1 (tree type
)
1754 /* If the size contains a placeholder or the parent type (component type in
1755 the case of arrays) type involves a placeholder, this type does. */
1756 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1757 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
1758 || (TREE_TYPE (type
) != 0
1759 && type_contains_placeholder_p (TREE_TYPE (type
))))
1762 /* Now do type-specific checks. Note that the last part of the check above
1763 greatly limits what we have to do below. */
1764 switch (TREE_CODE (type
))
1773 case REFERENCE_TYPE
:
1781 /* Here we just check the bounds. */
1782 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
1783 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
1788 /* We're already checked the component type (TREE_TYPE), so just check
1790 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
1794 case QUAL_UNION_TYPE
:
1798 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1799 if (TREE_CODE (field
) == FIELD_DECL
1800 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
1801 || (TREE_CODE (type
) == QUAL_UNION_TYPE
1802 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
1803 || type_contains_placeholder_p (TREE_TYPE (field
))))
1815 type_contains_placeholder_p (tree type
)
1819 /* If the contains_placeholder_bits field has been initialized,
1820 then we know the answer. */
1821 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
1822 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
1824 /* Indicate that we've seen this type node, and the answer is false.
1825 This is what we want to return if we run into recursion via fields. */
1826 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
1828 /* Compute the real value. */
1829 result
= type_contains_placeholder_1 (type
);
1831 /* Store the real value. */
1832 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
1837 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1838 return a tree with all occurrences of references to F in a
1839 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1840 contains only arithmetic expressions or a CALL_EXPR with a
1841 PLACEHOLDER_EXPR occurring only in its arglist. */
1844 substitute_in_expr (tree exp
, tree f
, tree r
)
1846 enum tree_code code
= TREE_CODE (exp
);
1851 /* We handle TREE_LIST and COMPONENT_REF separately. */
1852 if (code
== TREE_LIST
)
1854 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
1855 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
1856 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1859 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1861 else if (code
== COMPONENT_REF
)
1863 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1864 and it is the right field, replace it with R. */
1865 for (inner
= TREE_OPERAND (exp
, 0);
1866 REFERENCE_CLASS_P (inner
);
1867 inner
= TREE_OPERAND (inner
, 0))
1869 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
1870 && TREE_OPERAND (exp
, 1) == f
)
1873 /* If this expression hasn't been completed let, leave it alone. */
1874 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
1877 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1878 if (op0
== TREE_OPERAND (exp
, 0))
1881 new = fold (build3 (COMPONENT_REF
, TREE_TYPE (exp
),
1882 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
));
1885 switch (TREE_CODE_CLASS (code
))
1888 case tcc_declaration
:
1891 case tcc_exceptional
:
1894 case tcc_comparison
:
1895 case tcc_expression
:
1897 switch (first_rtl_op (code
))
1903 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1904 if (op0
== TREE_OPERAND (exp
, 0))
1907 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
1911 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1912 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
1914 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
1917 new = fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
1921 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1922 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
1923 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
1925 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
1926 && op2
== TREE_OPERAND (exp
, 2))
1929 new = fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
1941 TREE_READONLY (new) = TREE_READONLY (exp
);
1945 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1946 for it within OBJ, a tree that is an object or a chain of references. */
1949 substitute_placeholder_in_expr (tree exp
, tree obj
)
1951 enum tree_code code
= TREE_CODE (exp
);
1952 tree op0
, op1
, op2
, op3
;
1954 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
1955 in the chain of OBJ. */
1956 if (code
== PLACEHOLDER_EXPR
)
1958 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
1961 for (elt
= obj
; elt
!= 0;
1962 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
1963 || TREE_CODE (elt
) == COND_EXPR
)
1964 ? TREE_OPERAND (elt
, 1)
1965 : (REFERENCE_CLASS_P (elt
)
1966 || UNARY_CLASS_P (elt
)
1967 || BINARY_CLASS_P (elt
)
1968 || EXPRESSION_CLASS_P (elt
))
1969 ? TREE_OPERAND (elt
, 0) : 0))
1970 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
1973 for (elt
= obj
; elt
!= 0;
1974 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
1975 || TREE_CODE (elt
) == COND_EXPR
)
1976 ? TREE_OPERAND (elt
, 1)
1977 : (REFERENCE_CLASS_P (elt
)
1978 || UNARY_CLASS_P (elt
)
1979 || BINARY_CLASS_P (elt
)
1980 || EXPRESSION_CLASS_P (elt
))
1981 ? TREE_OPERAND (elt
, 0) : 0))
1982 if (POINTER_TYPE_P (TREE_TYPE (elt
))
1983 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
1985 return fold (build1 (INDIRECT_REF
, need_type
, elt
));
1987 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
1988 survives until RTL generation, there will be an error. */
1992 /* TREE_LIST is special because we need to look at TREE_VALUE
1993 and TREE_CHAIN, not TREE_OPERANDS. */
1994 else if (code
== TREE_LIST
)
1996 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
1997 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
1998 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2001 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2004 switch (TREE_CODE_CLASS (code
))
2007 case tcc_declaration
:
2010 case tcc_exceptional
:
2013 case tcc_comparison
:
2014 case tcc_expression
:
2017 switch (first_rtl_op (code
))
2023 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2024 if (op0
== TREE_OPERAND (exp
, 0))
2027 return fold (build1 (code
, TREE_TYPE (exp
), op0
));
2030 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2031 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2033 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2036 return fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2039 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2040 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2041 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2043 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2044 && op2
== TREE_OPERAND (exp
, 2))
2047 return fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2050 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2051 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2052 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2053 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2055 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2056 && op2
== TREE_OPERAND (exp
, 2)
2057 && op3
== TREE_OPERAND (exp
, 3))
2060 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2072 /* Stabilize a reference so that we can use it any number of times
2073 without causing its operands to be evaluated more than once.
2074 Returns the stabilized reference. This works by means of save_expr,
2075 so see the caveats in the comments about save_expr.
2077 Also allows conversion expressions whose operands are references.
2078 Any other kind of expression is returned unchanged. */
2081 stabilize_reference (tree ref
)
2084 enum tree_code code
= TREE_CODE (ref
);
2091 /* No action is needed in this case. */
2097 case FIX_TRUNC_EXPR
:
2098 case FIX_FLOOR_EXPR
:
2099 case FIX_ROUND_EXPR
:
2101 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2105 result
= build_nt (INDIRECT_REF
,
2106 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2110 result
= build_nt (COMPONENT_REF
,
2111 stabilize_reference (TREE_OPERAND (ref
, 0)),
2112 TREE_OPERAND (ref
, 1), NULL_TREE
);
2116 result
= build_nt (BIT_FIELD_REF
,
2117 stabilize_reference (TREE_OPERAND (ref
, 0)),
2118 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2119 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2123 result
= build_nt (ARRAY_REF
,
2124 stabilize_reference (TREE_OPERAND (ref
, 0)),
2125 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2126 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2129 case ARRAY_RANGE_REF
:
2130 result
= build_nt (ARRAY_RANGE_REF
,
2131 stabilize_reference (TREE_OPERAND (ref
, 0)),
2132 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2133 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2137 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2138 it wouldn't be ignored. This matters when dealing with
2140 return stabilize_reference_1 (ref
);
2142 /* If arg isn't a kind of lvalue we recognize, make no change.
2143 Caller should recognize the error for an invalid lvalue. */
2148 return error_mark_node
;
2151 TREE_TYPE (result
) = TREE_TYPE (ref
);
2152 TREE_READONLY (result
) = TREE_READONLY (ref
);
2153 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2154 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2159 /* Subroutine of stabilize_reference; this is called for subtrees of
2160 references. Any expression with side-effects must be put in a SAVE_EXPR
2161 to ensure that it is only evaluated once.
2163 We don't put SAVE_EXPR nodes around everything, because assigning very
2164 simple expressions to temporaries causes us to miss good opportunities
2165 for optimizations. Among other things, the opportunity to fold in the
2166 addition of a constant into an addressing mode often gets lost, e.g.
2167 "y[i+1] += x;". In general, we take the approach that we should not make
2168 an assignment unless we are forced into it - i.e., that any non-side effect
2169 operator should be allowed, and that cse should take care of coalescing
2170 multiple utterances of the same expression should that prove fruitful. */
2173 stabilize_reference_1 (tree e
)
2176 enum tree_code code
= TREE_CODE (e
);
2178 /* We cannot ignore const expressions because it might be a reference
2179 to a const array but whose index contains side-effects. But we can
2180 ignore things that are actual constant or that already have been
2181 handled by this function. */
2183 if (TREE_INVARIANT (e
))
2186 switch (TREE_CODE_CLASS (code
))
2188 case tcc_exceptional
:
2190 case tcc_declaration
:
2191 case tcc_comparison
:
2193 case tcc_expression
:
2195 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2196 so that it will only be evaluated once. */
2197 /* The reference (r) and comparison (<) classes could be handled as
2198 below, but it is generally faster to only evaluate them once. */
2199 if (TREE_SIDE_EFFECTS (e
))
2200 return save_expr (e
);
2204 /* Constants need no processing. In fact, we should never reach
2209 /* Division is slow and tends to be compiled with jumps,
2210 especially the division by powers of 2 that is often
2211 found inside of an array reference. So do it just once. */
2212 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2213 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2214 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2215 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2216 return save_expr (e
);
2217 /* Recursively stabilize each operand. */
2218 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2219 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2223 /* Recursively stabilize each operand. */
2224 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2231 TREE_TYPE (result
) = TREE_TYPE (e
);
2232 TREE_READONLY (result
) = TREE_READONLY (e
);
2233 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2234 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2235 TREE_INVARIANT (result
) = 1;
2240 /* Low-level constructors for expressions. */
2242 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2243 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2246 recompute_tree_invarant_for_addr_expr (tree t
)
2249 bool tc
= true, ti
= true, se
= false;
2251 /* We started out assuming this address is both invariant and constant, but
2252 does not have side effects. Now go down any handled components and see if
2253 any of them involve offsets that are either non-constant or non-invariant.
2254 Also check for side-effects.
2256 ??? Note that this code makes no attempt to deal with the case where
2257 taking the address of something causes a copy due to misalignment. */
2259 #define UPDATE_TITCSE(NODE) \
2260 do { tree _node = (NODE); \
2261 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2262 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2263 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2265 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2266 node
= TREE_OPERAND (node
, 0))
2268 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2269 array reference (probably made temporarily by the G++ front end),
2270 so ignore all the operands. */
2271 if ((TREE_CODE (node
) == ARRAY_REF
2272 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2273 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2275 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2276 if (TREE_OPERAND (node
, 2))
2277 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2278 if (TREE_OPERAND (node
, 3))
2279 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2281 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2282 FIELD_DECL, apparently. The G++ front end can put something else
2283 there, at least temporarily. */
2284 else if (TREE_CODE (node
) == COMPONENT_REF
2285 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2287 if (TREE_OPERAND (node
, 2))
2288 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2290 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2291 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2294 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2295 it. If it's a decl, it's invariant and constant if the decl is static.
2296 It's also invariant if it's a decl in the current function. (Taking the
2297 address of a volatile variable is not volatile.) If it's a constant,
2298 the address is both invariant and constant. Otherwise it's neither. */
2299 if (TREE_CODE (node
) == INDIRECT_REF
)
2301 /* If this is &((T*)0)->field, then this is a form of addition. */
2302 if (TREE_CODE (TREE_OPERAND (node
, 0)) != INTEGER_CST
)
2303 UPDATE_TITCSE (node
);
2305 else if (DECL_P (node
))
2309 else if (decl_function_context (node
) == current_function_decl
)
2314 else if (CONSTANT_CLASS_P (node
))
2319 se
|= TREE_SIDE_EFFECTS (node
);
2322 TREE_CONSTANT (t
) = tc
;
2323 TREE_INVARIANT (t
) = ti
;
2324 TREE_SIDE_EFFECTS (t
) = se
;
2325 #undef UPDATE_TITCSE
2328 /* Build an expression of code CODE, data type TYPE, and operands as
2329 specified. Expressions and reference nodes can be created this way.
2330 Constants, decls, types and misc nodes cannot be.
2332 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2333 enough for all extant tree codes. These functions can be called
2334 directly (preferably!), but can also be obtained via GCC preprocessor
2335 magic within the build macro. */
2338 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2342 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2344 t
= make_node_stat (code PASS_MEM_STAT
);
2351 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2353 int length
= sizeof (struct tree_exp
);
2354 #ifdef GATHER_STATISTICS
2355 tree_node_kind kind
;
2359 #ifdef GATHER_STATISTICS
2360 switch (TREE_CODE_CLASS (code
))
2362 case tcc_statement
: /* an expression with side effects */
2365 case tcc_reference
: /* a reference */
2373 tree_node_counts
[(int) kind
]++;
2374 tree_node_sizes
[(int) kind
] += length
;
2377 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2379 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
2381 memset (t
, 0, sizeof (struct tree_common
));
2383 TREE_SET_CODE (t
, code
);
2385 TREE_TYPE (t
) = type
;
2386 #ifdef USE_MAPPED_LOCATION
2387 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2389 SET_EXPR_LOCUS (t
, NULL
);
2391 TREE_COMPLEXITY (t
) = 0;
2392 TREE_OPERAND (t
, 0) = node
;
2393 TREE_BLOCK (t
) = NULL_TREE
;
2394 if (node
&& !TYPE_P (node
) && first_rtl_op (code
) != 0)
2396 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2397 TREE_READONLY (t
) = TREE_READONLY (node
);
2400 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2401 TREE_SIDE_EFFECTS (t
) = 1;
2407 case PREDECREMENT_EXPR
:
2408 case PREINCREMENT_EXPR
:
2409 case POSTDECREMENT_EXPR
:
2410 case POSTINCREMENT_EXPR
:
2411 /* All of these have side-effects, no matter what their
2413 TREE_SIDE_EFFECTS (t
) = 1;
2414 TREE_READONLY (t
) = 0;
2417 case MISALIGNED_INDIRECT_REF
:
2418 case ALIGN_INDIRECT_REF
:
2420 /* Whether a dereference is readonly has nothing to do with whether
2421 its operand is readonly. */
2422 TREE_READONLY (t
) = 0;
2427 recompute_tree_invarant_for_addr_expr (t
);
2431 if (TREE_CODE_CLASS (code
) == tcc_unary
2432 && node
&& !TYPE_P (node
)
2433 && TREE_CONSTANT (node
))
2434 TREE_CONSTANT (t
) = 1;
2435 if (TREE_CODE_CLASS (code
) == tcc_unary
2436 && node
&& TREE_INVARIANT (node
))
2437 TREE_INVARIANT (t
) = 1;
2438 if (TREE_CODE_CLASS (code
) == tcc_reference
2439 && node
&& TREE_THIS_VOLATILE (node
))
2440 TREE_THIS_VOLATILE (t
) = 1;
2447 #define PROCESS_ARG(N) \
2449 TREE_OPERAND (t, N) = arg##N; \
2450 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2452 if (TREE_SIDE_EFFECTS (arg##N)) \
2454 if (!TREE_READONLY (arg##N)) \
2456 if (!TREE_CONSTANT (arg##N)) \
2458 if (!TREE_INVARIANT (arg##N)) \
2464 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2466 bool constant
, read_only
, side_effects
, invariant
;
2470 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
2472 t
= make_node_stat (code PASS_MEM_STAT
);
2475 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2476 result based on those same flags for the arguments. But if the
2477 arguments aren't really even `tree' expressions, we shouldn't be trying
2479 fro
= first_rtl_op (code
);
2481 /* Expressions without side effects may be constant if their
2482 arguments are as well. */
2483 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
2484 || TREE_CODE_CLASS (code
) == tcc_binary
);
2486 side_effects
= TREE_SIDE_EFFECTS (t
);
2487 invariant
= constant
;
2492 TREE_READONLY (t
) = read_only
;
2493 TREE_CONSTANT (t
) = constant
;
2494 TREE_INVARIANT (t
) = invariant
;
2495 TREE_SIDE_EFFECTS (t
) = side_effects
;
2496 TREE_THIS_VOLATILE (t
)
2497 = (TREE_CODE_CLASS (code
) == tcc_reference
2498 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2504 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2505 tree arg2 MEM_STAT_DECL
)
2507 bool constant
, read_only
, side_effects
, invariant
;
2511 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
2513 t
= make_node_stat (code PASS_MEM_STAT
);
2516 fro
= first_rtl_op (code
);
2518 side_effects
= TREE_SIDE_EFFECTS (t
);
2524 if (code
== CALL_EXPR
&& !side_effects
)
2529 /* Calls have side-effects, except those to const or
2531 i
= call_expr_flags (t
);
2532 if (!(i
& (ECF_CONST
| ECF_PURE
)))
2535 /* And even those have side-effects if their arguments do. */
2536 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
2537 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
2544 TREE_SIDE_EFFECTS (t
) = side_effects
;
2545 TREE_THIS_VOLATILE (t
)
2546 = (TREE_CODE_CLASS (code
) == tcc_reference
2547 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2553 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2554 tree arg2
, tree arg3 MEM_STAT_DECL
)
2556 bool constant
, read_only
, side_effects
, invariant
;
2560 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
2562 t
= make_node_stat (code PASS_MEM_STAT
);
2565 fro
= first_rtl_op (code
);
2567 side_effects
= TREE_SIDE_EFFECTS (t
);
2574 TREE_SIDE_EFFECTS (t
) = side_effects
;
2575 TREE_THIS_VOLATILE (t
)
2576 = (TREE_CODE_CLASS (code
) == tcc_reference
2577 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2582 /* Backup definition for non-gcc build compilers. */
2585 (build
) (enum tree_code code
, tree tt
, ...)
2587 tree t
, arg0
, arg1
, arg2
, arg3
;
2588 int length
= TREE_CODE_LENGTH (code
);
2595 t
= build0 (code
, tt
);
2598 arg0
= va_arg (p
, tree
);
2599 t
= build1 (code
, tt
, arg0
);
2602 arg0
= va_arg (p
, tree
);
2603 arg1
= va_arg (p
, tree
);
2604 t
= build2 (code
, tt
, arg0
, arg1
);
2607 arg0
= va_arg (p
, tree
);
2608 arg1
= va_arg (p
, tree
);
2609 arg2
= va_arg (p
, tree
);
2610 t
= build3 (code
, tt
, arg0
, arg1
, arg2
);
2613 arg0
= va_arg (p
, tree
);
2614 arg1
= va_arg (p
, tree
);
2615 arg2
= va_arg (p
, tree
);
2616 arg3
= va_arg (p
, tree
);
2617 t
= build4 (code
, tt
, arg0
, arg1
, arg2
, arg3
);
2627 /* Similar except don't specify the TREE_TYPE
2628 and leave the TREE_SIDE_EFFECTS as 0.
2629 It is permissible for arguments to be null,
2630 or even garbage if their values do not matter. */
2633 build_nt (enum tree_code code
, ...)
2642 t
= make_node (code
);
2643 length
= TREE_CODE_LENGTH (code
);
2645 for (i
= 0; i
< length
; i
++)
2646 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2652 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2653 We do NOT enter this node in any sort of symbol table.
2655 layout_decl is used to set up the decl's storage layout.
2656 Other slots are initialized to 0 or null pointers. */
2659 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
2663 t
= make_node_stat (code PASS_MEM_STAT
);
2665 /* if (type == error_mark_node)
2666 type = integer_type_node; */
2667 /* That is not done, deliberately, so that having error_mark_node
2668 as the type can suppress useless errors in the use of this variable. */
2670 DECL_NAME (t
) = name
;
2671 TREE_TYPE (t
) = type
;
2673 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2675 else if (code
== FUNCTION_DECL
)
2676 DECL_MODE (t
) = FUNCTION_MODE
;
2678 /* Set default visibility to whatever the user supplied with
2679 visibility_specified depending on #pragma GCC visibility. */
2680 DECL_VISIBILITY (t
) = default_visibility
;
2681 DECL_VISIBILITY_SPECIFIED (t
) = visibility_options
.inpragma
;
2686 /* BLOCK nodes are used to represent the structure of binding contours
2687 and declarations, once those contours have been exited and their contents
2688 compiled. This information is used for outputting debugging info. */
2691 build_block (tree vars
, tree tags ATTRIBUTE_UNUSED
, tree subblocks
,
2692 tree supercontext
, tree chain
)
2694 tree block
= make_node (BLOCK
);
2696 BLOCK_VARS (block
) = vars
;
2697 BLOCK_SUBBLOCKS (block
) = subblocks
;
2698 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2699 BLOCK_CHAIN (block
) = chain
;
2703 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2704 /* ??? gengtype doesn't handle conditionals */
2705 static GTY(()) tree last_annotated_node
;
2708 #ifdef USE_MAPPED_LOCATION
2711 expand_location (source_location loc
)
2713 expanded_location xloc
;
2714 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
2717 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
2718 xloc
.file
= map
->to_file
;
2719 xloc
.line
= SOURCE_LINE (map
, loc
);
2720 xloc
.column
= SOURCE_COLUMN (map
, loc
);
2727 /* Record the exact location where an expression or an identifier were
2731 annotate_with_file_line (tree node
, const char *file
, int line
)
2733 /* Roughly one percent of the calls to this function are to annotate
2734 a node with the same information already attached to that node!
2735 Just return instead of wasting memory. */
2736 if (EXPR_LOCUS (node
)
2737 && (EXPR_FILENAME (node
) == file
2738 || ! strcmp (EXPR_FILENAME (node
), file
))
2739 && EXPR_LINENO (node
) == line
)
2741 last_annotated_node
= node
;
2745 /* In heavily macroized code (such as GCC itself) this single
2746 entry cache can reduce the number of allocations by more
2748 if (last_annotated_node
2749 && EXPR_LOCUS (last_annotated_node
)
2750 && (EXPR_FILENAME (last_annotated_node
) == file
2751 || ! strcmp (EXPR_FILENAME (last_annotated_node
), file
))
2752 && EXPR_LINENO (last_annotated_node
) == line
)
2754 SET_EXPR_LOCUS (node
, EXPR_LOCUS (last_annotated_node
));
2758 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
2759 EXPR_LINENO (node
) = line
;
2760 EXPR_FILENAME (node
) = file
;
2761 last_annotated_node
= node
;
2765 annotate_with_locus (tree node
, location_t locus
)
2767 annotate_with_file_line (node
, locus
.file
, locus
.line
);
2771 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2775 build_decl_attribute_variant (tree ddecl
, tree attribute
)
2777 DECL_ATTRIBUTES (ddecl
) = attribute
;
2781 /* Borrowed from hashtab.c iterative_hash implementation. */
2782 #define mix(a,b,c) \
2784 a -= b; a -= c; a ^= (c>>13); \
2785 b -= c; b -= a; b ^= (a<< 8); \
2786 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2787 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2788 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2789 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2790 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2791 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2792 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2796 /* Produce good hash value combining VAL and VAL2. */
2797 static inline hashval_t
2798 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
2800 /* the golden ratio; an arbitrary value. */
2801 hashval_t a
= 0x9e3779b9;
2807 /* Produce good hash value combining PTR and VAL2. */
2808 static inline hashval_t
2809 iterative_hash_pointer (void *ptr
, hashval_t val2
)
2811 if (sizeof (ptr
) == sizeof (hashval_t
))
2812 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
2815 hashval_t a
= (hashval_t
) (size_t) ptr
;
2816 /* Avoid warnings about shifting of more than the width of the type on
2817 hosts that won't execute this path. */
2819 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
2825 /* Produce good hash value combining VAL and VAL2. */
2826 static inline hashval_t
2827 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
2829 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
2830 return iterative_hash_hashval_t (val
, val2
);
2833 hashval_t a
= (hashval_t
) val
;
2834 /* Avoid warnings about shifting of more than the width of the type on
2835 hosts that won't execute this path. */
2837 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
2839 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
2841 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
2842 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
2849 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2852 Record such modified types already made so we don't make duplicates. */
2855 build_type_attribute_variant (tree ttype
, tree attribute
)
2857 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2859 hashval_t hashcode
= 0;
2861 enum tree_code code
= TREE_CODE (ttype
);
2863 ntype
= copy_node (ttype
);
2865 TYPE_POINTER_TO (ntype
) = 0;
2866 TYPE_REFERENCE_TO (ntype
) = 0;
2867 TYPE_ATTRIBUTES (ntype
) = attribute
;
2869 /* Create a new main variant of TYPE. */
2870 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2871 TYPE_NEXT_VARIANT (ntype
) = 0;
2872 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2874 hashcode
= iterative_hash_object (code
, hashcode
);
2875 if (TREE_TYPE (ntype
))
2876 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
2878 hashcode
= attribute_hash_list (attribute
, hashcode
);
2880 switch (TREE_CODE (ntype
))
2883 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
2886 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
2890 hashcode
= iterative_hash_object
2891 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
2892 hashcode
= iterative_hash_object
2893 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
2897 unsigned int precision
= TYPE_PRECISION (ntype
);
2898 hashcode
= iterative_hash_object (precision
, hashcode
);
2905 ntype
= type_hash_canon (hashcode
, ntype
);
2906 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2912 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2915 We try both `text' and `__text__', ATTR may be either one. */
2916 /* ??? It might be a reasonable simplification to require ATTR to be only
2917 `text'. One might then also require attribute lists to be stored in
2918 their canonicalized form. */
2921 is_attribute_p (const char *attr
, tree ident
)
2923 int ident_len
, attr_len
;
2926 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2929 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2932 p
= IDENTIFIER_POINTER (ident
);
2933 ident_len
= strlen (p
);
2934 attr_len
= strlen (attr
);
2936 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2939 gcc_assert (attr
[1] == '_');
2940 gcc_assert (attr
[attr_len
- 2] == '_');
2941 gcc_assert (attr
[attr_len
- 1] == '_');
2942 gcc_assert (attr
[1] == '_');
2943 if (ident_len
== attr_len
- 4
2944 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2949 if (ident_len
== attr_len
+ 4
2950 && p
[0] == '_' && p
[1] == '_'
2951 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2952 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2959 /* Given an attribute name and a list of attributes, return a pointer to the
2960 attribute's list element if the attribute is part of the list, or NULL_TREE
2961 if not found. If the attribute appears more than once, this only
2962 returns the first occurrence; the TREE_CHAIN of the return value should
2963 be passed back in if further occurrences are wanted. */
2966 lookup_attribute (const char *attr_name
, tree list
)
2970 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2972 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
2973 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2980 /* Return an attribute list that is the union of a1 and a2. */
2983 merge_attributes (tree a1
, tree a2
)
2987 /* Either one unset? Take the set one. */
2989 if ((attributes
= a1
) == 0)
2992 /* One that completely contains the other? Take it. */
2994 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2996 if (attribute_list_contained (a2
, a1
))
3000 /* Pick the longest list, and hang on the other list. */
3002 if (list_length (a1
) < list_length (a2
))
3003 attributes
= a2
, a2
= a1
;
3005 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3008 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3011 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3014 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
3019 a1
= copy_node (a2
);
3020 TREE_CHAIN (a1
) = attributes
;
3029 /* Given types T1 and T2, merge their attributes and return
3033 merge_type_attributes (tree t1
, tree t2
)
3035 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3036 TYPE_ATTRIBUTES (t2
));
3039 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3043 merge_decl_attributes (tree olddecl
, tree newdecl
)
3045 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3046 DECL_ATTRIBUTES (newdecl
));
3049 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3051 /* Specialization of merge_decl_attributes for various Windows targets.
3053 This handles the following situation:
3055 __declspec (dllimport) int foo;
3058 The second instance of `foo' nullifies the dllimport. */
3061 merge_dllimport_decl_attributes (tree old
, tree
new)
3064 int delete_dllimport_p
;
3066 old
= DECL_ATTRIBUTES (old
);
3067 new = DECL_ATTRIBUTES (new);
3069 /* What we need to do here is remove from `old' dllimport if it doesn't
3070 appear in `new'. dllimport behaves like extern: if a declaration is
3071 marked dllimport and a definition appears later, then the object
3072 is not dllimport'd. */
3073 if (lookup_attribute ("dllimport", old
) != NULL_TREE
3074 && lookup_attribute ("dllimport", new) == NULL_TREE
)
3075 delete_dllimport_p
= 1;
3077 delete_dllimport_p
= 0;
3079 a
= merge_attributes (old
, new);
3081 if (delete_dllimport_p
)
3085 /* Scan the list for dllimport and delete it. */
3086 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3088 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3090 if (prev
== NULL_TREE
)
3093 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3102 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3103 struct attribute_spec.handler. */
3106 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3111 /* These attributes may apply to structure and union types being created,
3112 but otherwise should pass to the declaration involved. */
3115 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3116 | (int) ATTR_FLAG_ARRAY_NEXT
))
3118 *no_add_attrs
= true;
3119 return tree_cons (name
, args
, NULL_TREE
);
3121 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3123 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name
));
3124 *no_add_attrs
= true;
3130 /* Report error on dllimport ambiguities seen now before they cause
3132 if (is_attribute_p ("dllimport", name
))
3134 /* Like MS, treat definition of dllimported variables and
3135 non-inlined functions on declaration as syntax errors. We
3136 allow the attribute for function definitions if declared
3138 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
)
3139 && !DECL_DECLARED_INLINE_P (node
))
3141 error ("%Jfunction %qD definition is marked dllimport.", node
, node
);
3142 *no_add_attrs
= true;
3145 else if (TREE_CODE (node
) == VAR_DECL
)
3147 if (DECL_INITIAL (node
))
3149 error ("%Jvariable %qD definition is marked dllimport.",
3151 *no_add_attrs
= true;
3154 /* `extern' needn't be specified with dllimport.
3155 Specify `extern' now and hope for the best. Sigh. */
3156 DECL_EXTERNAL (node
) = 1;
3157 /* Also, implicitly give dllimport'd variables declared within
3158 a function global scope, unless declared static. */
3159 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3160 TREE_PUBLIC (node
) = 1;
3164 /* Report error if symbol is not accessible at global scope. */
3165 if (!TREE_PUBLIC (node
)
3166 && (TREE_CODE (node
) == VAR_DECL
3167 || TREE_CODE (node
) == FUNCTION_DECL
))
3169 error ("%Jexternal linkage required for symbol %qD because of "
3170 "%qs attribute.", node
, node
, IDENTIFIER_POINTER (name
));
3171 *no_add_attrs
= true;
3177 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3179 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3180 of the various TYPE_QUAL values. */
3183 set_type_quals (tree type
, int type_quals
)
3185 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3186 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3187 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3190 /* Returns true iff cand is equivalent to base with type_quals. */
3193 check_qualified_type (tree cand
, tree base
, int type_quals
)
3195 return (TYPE_QUALS (cand
) == type_quals
3196 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3197 /* Apparently this is needed for Objective-C. */
3198 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3199 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3200 TYPE_ATTRIBUTES (base
)));
3203 /* Return a version of the TYPE, qualified as indicated by the
3204 TYPE_QUALS, if one exists. If no qualified version exists yet,
3205 return NULL_TREE. */
3208 get_qualified_type (tree type
, int type_quals
)
3212 if (TYPE_QUALS (type
) == type_quals
)
3215 /* Search the chain of variants to see if there is already one there just
3216 like the one we need to have. If so, use that existing one. We must
3217 preserve the TYPE_NAME, since there is code that depends on this. */
3218 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3219 if (check_qualified_type (t
, type
, type_quals
))
3225 /* Like get_qualified_type, but creates the type if it does not
3226 exist. This function never returns NULL_TREE. */
3229 build_qualified_type (tree type
, int type_quals
)
3233 /* See if we already have the appropriate qualified variant. */
3234 t
= get_qualified_type (type
, type_quals
);
3236 /* If not, build it. */
3239 t
= build_variant_type_copy (type
);
3240 set_type_quals (t
, type_quals
);
3246 /* Create a new distinct copy of TYPE. The new type is made its own
3250 build_distinct_type_copy (tree type
)
3252 tree t
= copy_node (type
);
3254 TYPE_POINTER_TO (t
) = 0;
3255 TYPE_REFERENCE_TO (t
) = 0;
3257 /* Make it its own variant. */
3258 TYPE_MAIN_VARIANT (t
) = t
;
3259 TYPE_NEXT_VARIANT (t
) = 0;
3264 /* Create a new variant of TYPE, equivalent but distinct.
3265 This is so the caller can modify it. */
3268 build_variant_type_copy (tree type
)
3270 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3272 t
= build_distinct_type_copy (type
);
3274 /* Add the new type to the chain of variants of TYPE. */
3275 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3276 TYPE_NEXT_VARIANT (m
) = t
;
3277 TYPE_MAIN_VARIANT (t
) = m
;
3282 /* Hashing of types so that we don't make duplicates.
3283 The entry point is `type_hash_canon'. */
3285 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3286 with types in the TREE_VALUE slots), by adding the hash codes
3287 of the individual types. */
3290 type_hash_list (tree list
, hashval_t hashcode
)
3294 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3295 if (TREE_VALUE (tail
) != error_mark_node
)
3296 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
3302 /* These are the Hashtable callback functions. */
3304 /* Returns true iff the types are equivalent. */
3307 type_hash_eq (const void *va
, const void *vb
)
3309 const struct type_hash
*a
= va
, *b
= vb
;
3311 /* First test the things that are the same for all types. */
3312 if (a
->hash
!= b
->hash
3313 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
3314 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
3315 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3316 TYPE_ATTRIBUTES (b
->type
))
3317 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
3318 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
3321 switch (TREE_CODE (a
->type
))
3327 case REFERENCE_TYPE
:
3331 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
3332 && !(TYPE_VALUES (a
->type
)
3333 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
3334 && TYPE_VALUES (b
->type
)
3335 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
3336 && type_list_equal (TYPE_VALUES (a
->type
),
3337 TYPE_VALUES (b
->type
))))
3340 /* ... fall through ... */
3346 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3347 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3348 TYPE_MAX_VALUE (b
->type
)))
3349 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3350 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3351 TYPE_MIN_VALUE (b
->type
))));
3354 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
3357 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
3358 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3359 || (TYPE_ARG_TYPES (a
->type
)
3360 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3361 && TYPE_ARG_TYPES (b
->type
)
3362 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3363 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3364 TYPE_ARG_TYPES (b
->type
)))));
3368 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
3372 case QUAL_UNION_TYPE
:
3373 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
3374 || (TYPE_FIELDS (a
->type
)
3375 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
3376 && TYPE_FIELDS (b
->type
)
3377 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
3378 && type_list_equal (TYPE_FIELDS (a
->type
),
3379 TYPE_FIELDS (b
->type
))));
3382 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3383 || (TYPE_ARG_TYPES (a
->type
)
3384 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3385 && TYPE_ARG_TYPES (b
->type
)
3386 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3387 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3388 TYPE_ARG_TYPES (b
->type
))));
3395 /* Return the cached hash value. */
3398 type_hash_hash (const void *item
)
3400 return ((const struct type_hash
*) item
)->hash
;
3403 /* Look in the type hash table for a type isomorphic to TYPE.
3404 If one is found, return it. Otherwise return 0. */
3407 type_hash_lookup (hashval_t hashcode
, tree type
)
3409 struct type_hash
*h
, in
;
3411 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3412 must call that routine before comparing TYPE_ALIGNs. */
3418 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3424 /* Add an entry to the type-hash-table
3425 for a type TYPE whose hash code is HASHCODE. */
3428 type_hash_add (hashval_t hashcode
, tree type
)
3430 struct type_hash
*h
;
3433 h
= ggc_alloc (sizeof (struct type_hash
));
3436 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3437 *(struct type_hash
**) loc
= h
;
3440 /* Given TYPE, and HASHCODE its hash code, return the canonical
3441 object for an identical type if one already exists.
3442 Otherwise, return TYPE, and record it as the canonical object.
3444 To use this function, first create a type of the sort you want.
3445 Then compute its hash code from the fields of the type that
3446 make it different from other similar types.
3447 Then call this function and use the value. */
3450 type_hash_canon (unsigned int hashcode
, tree type
)
3454 /* The hash table only contains main variants, so ensure that's what we're
3456 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
3458 if (!lang_hooks
.types
.hash_types
)
3461 /* See if the type is in the hash table already. If so, return it.
3462 Otherwise, add the type. */
3463 t1
= type_hash_lookup (hashcode
, type
);
3466 #ifdef GATHER_STATISTICS
3467 tree_node_counts
[(int) t_kind
]--;
3468 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3474 type_hash_add (hashcode
, type
);
3479 /* See if the data pointed to by the type hash table is marked. We consider
3480 it marked if the type is marked or if a debug type number or symbol
3481 table entry has been made for the type. This reduces the amount of
3482 debugging output and eliminates that dependency of the debug output on
3483 the number of garbage collections. */
3486 type_hash_marked_p (const void *p
)
3488 tree type
= ((struct type_hash
*) p
)->type
;
3490 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3494 print_type_hash_statistics (void)
3496 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3497 (long) htab_size (type_hash_table
),
3498 (long) htab_elements (type_hash_table
),
3499 htab_collisions (type_hash_table
));
3502 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3503 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3504 by adding the hash codes of the individual attributes. */
3507 attribute_hash_list (tree list
, hashval_t hashcode
)
3511 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3512 /* ??? Do we want to add in TREE_VALUE too? */
3513 hashcode
= iterative_hash_object
3514 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
3518 /* Given two lists of attributes, return true if list l2 is
3519 equivalent to l1. */
3522 attribute_list_equal (tree l1
, tree l2
)
3524 return attribute_list_contained (l1
, l2
)
3525 && attribute_list_contained (l2
, l1
);
3528 /* Given two lists of attributes, return true if list L2 is
3529 completely contained within L1. */
3530 /* ??? This would be faster if attribute names were stored in a canonicalized
3531 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3532 must be used to show these elements are equivalent (which they are). */
3533 /* ??? It's not clear that attributes with arguments will always be handled
3537 attribute_list_contained (tree l1
, tree l2
)
3541 /* First check the obvious, maybe the lists are identical. */
3545 /* Maybe the lists are similar. */
3546 for (t1
= l1
, t2
= l2
;
3548 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3549 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3550 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3552 /* Maybe the lists are equal. */
3553 if (t1
== 0 && t2
== 0)
3556 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3559 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3561 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3564 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3571 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3578 /* Given two lists of types
3579 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3580 return 1 if the lists contain the same types in the same order.
3581 Also, the TREE_PURPOSEs must match. */
3584 type_list_equal (tree l1
, tree l2
)
3588 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3589 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3590 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3591 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3592 && (TREE_TYPE (TREE_PURPOSE (t1
))
3593 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3599 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3600 given by TYPE. If the argument list accepts variable arguments,
3601 then this function counts only the ordinary arguments. */
3604 type_num_arguments (tree type
)
3609 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3610 /* If the function does not take a variable number of arguments,
3611 the last element in the list will have type `void'. */
3612 if (VOID_TYPE_P (TREE_VALUE (t
)))
3620 /* Nonzero if integer constants T1 and T2
3621 represent the same constant value. */
3624 tree_int_cst_equal (tree t1
, tree t2
)
3629 if (t1
== 0 || t2
== 0)
3632 if (TREE_CODE (t1
) == INTEGER_CST
3633 && TREE_CODE (t2
) == INTEGER_CST
3634 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3635 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3641 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3642 The precise way of comparison depends on their data type. */
3645 tree_int_cst_lt (tree t1
, tree t2
)
3650 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
3652 int t1_sgn
= tree_int_cst_sgn (t1
);
3653 int t2_sgn
= tree_int_cst_sgn (t2
);
3655 if (t1_sgn
< t2_sgn
)
3657 else if (t1_sgn
> t2_sgn
)
3659 /* Otherwise, both are non-negative, so we compare them as
3660 unsigned just in case one of them would overflow a signed
3663 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
3664 return INT_CST_LT (t1
, t2
);
3666 return INT_CST_LT_UNSIGNED (t1
, t2
);
3669 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3672 tree_int_cst_compare (tree t1
, tree t2
)
3674 if (tree_int_cst_lt (t1
, t2
))
3676 else if (tree_int_cst_lt (t2
, t1
))
3682 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3683 the host. If POS is zero, the value can be represented in a single
3684 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3685 be represented in a single unsigned HOST_WIDE_INT. */
3688 host_integerp (tree t
, int pos
)
3690 return (TREE_CODE (t
) == INTEGER_CST
3691 && ! TREE_OVERFLOW (t
)
3692 && ((TREE_INT_CST_HIGH (t
) == 0
3693 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3694 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3695 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3696 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
3697 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3700 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3701 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3702 be positive. Abort if we cannot satisfy the above conditions. */
3705 tree_low_cst (tree t
, int pos
)
3707 gcc_assert (host_integerp (t
, pos
));
3708 return TREE_INT_CST_LOW (t
);
3711 /* Return the most significant bit of the integer constant T. */
3714 tree_int_cst_msb (tree t
)
3718 unsigned HOST_WIDE_INT l
;
3720 /* Note that using TYPE_PRECISION here is wrong. We care about the
3721 actual bits, not the (arbitrary) range of the type. */
3722 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3723 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3724 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3725 return (l
& 1) == 1;
3728 /* Return an indication of the sign of the integer constant T.
3729 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3730 Note that -1 will never be returned it T's type is unsigned. */
3733 tree_int_cst_sgn (tree t
)
3735 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3737 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
3739 else if (TREE_INT_CST_HIGH (t
) < 0)
3745 /* Compare two constructor-element-type constants. Return 1 if the lists
3746 are known to be equal; otherwise return 0. */
3749 simple_cst_list_equal (tree l1
, tree l2
)
3751 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3753 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3756 l1
= TREE_CHAIN (l1
);
3757 l2
= TREE_CHAIN (l2
);
3763 /* Return truthvalue of whether T1 is the same tree structure as T2.
3764 Return 1 if they are the same.
3765 Return 0 if they are understandably different.
3766 Return -1 if either contains tree structure not understood by
3770 simple_cst_equal (tree t1
, tree t2
)
3772 enum tree_code code1
, code2
;
3778 if (t1
== 0 || t2
== 0)
3781 code1
= TREE_CODE (t1
);
3782 code2
= TREE_CODE (t2
);
3784 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3786 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3787 || code2
== NON_LVALUE_EXPR
)
3788 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3790 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3793 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3794 || code2
== NON_LVALUE_EXPR
)
3795 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3803 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3804 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3807 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3810 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3811 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3812 TREE_STRING_LENGTH (t1
)));
3815 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1
),
3816 CONSTRUCTOR_ELTS (t2
));
3819 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3822 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3826 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3829 /* Special case: if either target is an unallocated VAR_DECL,
3830 it means that it's going to be unified with whatever the
3831 TARGET_EXPR is really supposed to initialize, so treat it
3832 as being equivalent to anything. */
3833 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3834 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3835 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3836 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3837 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3838 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3841 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3846 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3848 case WITH_CLEANUP_EXPR
:
3849 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3853 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3856 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3857 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3871 /* This general rule works for most tree codes. All exceptions should be
3872 handled above. If this is a language-specific tree code, we can't
3873 trust what might be in the operand, so say we don't know
3875 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3878 switch (TREE_CODE_CLASS (code1
))
3882 case tcc_comparison
:
3883 case tcc_expression
:
3887 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3889 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3901 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3902 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3903 than U, respectively. */
3906 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
3908 if (tree_int_cst_sgn (t
) < 0)
3910 else if (TREE_INT_CST_HIGH (t
) != 0)
3912 else if (TREE_INT_CST_LOW (t
) == u
)
3914 else if (TREE_INT_CST_LOW (t
) < u
)
3920 /* Return true if CODE represents an associative tree code. Otherwise
3923 associative_tree_code (enum tree_code code
)
3942 /* Return true if CODE represents an commutative tree code. Otherwise
3945 commutative_tree_code (enum tree_code code
)
3958 case UNORDERED_EXPR
:
3962 case TRUTH_AND_EXPR
:
3963 case TRUTH_XOR_EXPR
:
3973 /* Generate a hash value for an expression. This can be used iteratively
3974 by passing a previous result as the "val" argument.
3976 This function is intended to produce the same hash for expressions which
3977 would compare equal using operand_equal_p. */
3980 iterative_hash_expr (tree t
, hashval_t val
)
3983 enum tree_code code
;
3987 return iterative_hash_pointer (t
, val
);
3989 code
= TREE_CODE (t
);
3993 /* Alas, constants aren't shared, so we can't rely on pointer
3996 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
3997 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4000 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4002 return iterative_hash_hashval_t (val2
, val
);
4005 return iterative_hash (TREE_STRING_POINTER (t
),
4006 TREE_STRING_LENGTH (t
), val
);
4008 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4009 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4011 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4015 /* we can just compare by pointer. */
4016 return iterative_hash_pointer (t
, val
);
4019 /* A list of expressions, for a CALL_EXPR or as the elements of a
4021 for (; t
; t
= TREE_CHAIN (t
))
4022 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4025 class = TREE_CODE_CLASS (code
);
4027 if (class == tcc_declaration
)
4029 /* Decls we can just compare by pointer. */
4030 val
= iterative_hash_pointer (t
, val
);
4034 gcc_assert (IS_EXPR_CODE_CLASS (class));
4036 val
= iterative_hash_object (code
, val
);
4038 /* Don't hash the type, that can lead to having nodes which
4039 compare equal according to operand_equal_p, but which
4040 have different hash codes. */
4041 if (code
== NOP_EXPR
4042 || code
== CONVERT_EXPR
4043 || code
== NON_LVALUE_EXPR
)
4045 /* Make sure to include signness in the hash computation. */
4046 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4047 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4050 else if (commutative_tree_code (code
))
4052 /* It's a commutative expression. We want to hash it the same
4053 however it appears. We do this by first hashing both operands
4054 and then rehashing based on the order of their independent
4056 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4057 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4061 t
= one
, one
= two
, two
= t
;
4063 val
= iterative_hash_hashval_t (one
, val
);
4064 val
= iterative_hash_hashval_t (two
, val
);
4067 for (i
= first_rtl_op (code
) - 1; i
>= 0; --i
)
4068 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4075 /* Constructors for pointer, array and function types.
4076 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4077 constructed by language-dependent code, not here.) */
4079 /* Construct, lay out and return the type of pointers to TO_TYPE with
4080 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4081 reference all of memory. If such a type has already been
4082 constructed, reuse it. */
4085 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4090 /* In some cases, languages will have things that aren't a POINTER_TYPE
4091 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4092 In that case, return that type without regard to the rest of our
4095 ??? This is a kludge, but consistent with the way this function has
4096 always operated and there doesn't seem to be a good way to avoid this
4098 if (TYPE_POINTER_TO (to_type
) != 0
4099 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4100 return TYPE_POINTER_TO (to_type
);
4102 /* First, if we already have a type for pointers to TO_TYPE and it's
4103 the proper mode, use it. */
4104 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4105 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4108 t
= make_node (POINTER_TYPE
);
4110 TREE_TYPE (t
) = to_type
;
4111 TYPE_MODE (t
) = mode
;
4112 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4113 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4114 TYPE_POINTER_TO (to_type
) = t
;
4116 /* Lay out the type. This function has many callers that are concerned
4117 with expression-construction, and this simplifies them all. */
4123 /* By default build pointers in ptr_mode. */
4126 build_pointer_type (tree to_type
)
4128 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4131 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4134 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4139 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4140 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4141 In that case, return that type without regard to the rest of our
4144 ??? This is a kludge, but consistent with the way this function has
4145 always operated and there doesn't seem to be a good way to avoid this
4147 if (TYPE_REFERENCE_TO (to_type
) != 0
4148 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4149 return TYPE_REFERENCE_TO (to_type
);
4151 /* First, if we already have a type for pointers to TO_TYPE and it's
4152 the proper mode, use it. */
4153 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4154 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4157 t
= make_node (REFERENCE_TYPE
);
4159 TREE_TYPE (t
) = to_type
;
4160 TYPE_MODE (t
) = mode
;
4161 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4162 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4163 TYPE_REFERENCE_TO (to_type
) = t
;
4171 /* Build the node for the type of references-to-TO_TYPE by default
4175 build_reference_type (tree to_type
)
4177 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4180 /* Build a type that is compatible with t but has no cv quals anywhere
4183 const char *const *const * -> char ***. */
4186 build_type_no_quals (tree t
)
4188 switch (TREE_CODE (t
))
4191 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4193 TYPE_REF_CAN_ALIAS_ALL (t
));
4194 case REFERENCE_TYPE
:
4196 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4198 TYPE_REF_CAN_ALIAS_ALL (t
));
4200 return TYPE_MAIN_VARIANT (t
);
4204 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4205 MAXVAL should be the maximum value in the domain
4206 (one less than the length of the array).
4208 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4209 We don't enforce this limit, that is up to caller (e.g. language front end).
4210 The limit exists because the result is a signed type and we don't handle
4211 sizes that use more than one HOST_WIDE_INT. */
4214 build_index_type (tree maxval
)
4216 tree itype
= make_node (INTEGER_TYPE
);
4218 TREE_TYPE (itype
) = sizetype
;
4219 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4220 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4221 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
4222 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4223 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4224 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4225 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4226 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
4228 if (host_integerp (maxval
, 1))
4229 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
4234 /* Builds a signed or unsigned integer type of precision PRECISION.
4235 Used for C bitfields whose precision does not match that of
4236 built-in target types. */
4238 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
4241 tree itype
= make_node (INTEGER_TYPE
);
4243 TYPE_PRECISION (itype
) = precision
;
4246 fixup_unsigned_type (itype
);
4248 fixup_signed_type (itype
);
4250 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
4251 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
4256 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4257 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4258 low bound LOWVAL and high bound HIGHVAL.
4259 if TYPE==NULL_TREE, sizetype is used. */
4262 build_range_type (tree type
, tree lowval
, tree highval
)
4264 tree itype
= make_node (INTEGER_TYPE
);
4266 TREE_TYPE (itype
) = type
;
4267 if (type
== NULL_TREE
)
4270 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4271 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4273 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4274 TYPE_MODE (itype
) = TYPE_MODE (type
);
4275 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4276 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4277 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4278 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
4280 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
4281 return type_hash_canon (tree_low_cst (highval
, 0)
4282 - tree_low_cst (lowval
, 0),
4288 /* Just like build_index_type, but takes lowval and highval instead
4289 of just highval (maxval). */
4292 build_index_2_type (tree lowval
, tree highval
)
4294 return build_range_type (sizetype
, lowval
, highval
);
4297 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4298 and number of elements specified by the range of values of INDEX_TYPE.
4299 If such a type has already been constructed, reuse it. */
4302 build_array_type (tree elt_type
, tree index_type
)
4305 hashval_t hashcode
= 0;
4307 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4309 error ("arrays of functions are not meaningful");
4310 elt_type
= integer_type_node
;
4313 t
= make_node (ARRAY_TYPE
);
4314 TREE_TYPE (t
) = elt_type
;
4315 TYPE_DOMAIN (t
) = index_type
;
4317 if (index_type
== 0)
4320 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
4321 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
4322 t
= type_hash_canon (hashcode
, t
);
4324 if (!COMPLETE_TYPE_P (t
))
4329 /* Return the TYPE of the elements comprising
4330 the innermost dimension of ARRAY. */
4333 get_inner_array_type (tree array
)
4335 tree type
= TREE_TYPE (array
);
4337 while (TREE_CODE (type
) == ARRAY_TYPE
)
4338 type
= TREE_TYPE (type
);
4343 /* Construct, lay out and return
4344 the type of functions returning type VALUE_TYPE
4345 given arguments of types ARG_TYPES.
4346 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4347 are data type nodes for the arguments of the function.
4348 If such a type has already been constructed, reuse it. */
4351 build_function_type (tree value_type
, tree arg_types
)
4354 hashval_t hashcode
= 0;
4356 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4358 error ("function return type cannot be function");
4359 value_type
= integer_type_node
;
4362 /* Make a node of the sort we want. */
4363 t
= make_node (FUNCTION_TYPE
);
4364 TREE_TYPE (t
) = value_type
;
4365 TYPE_ARG_TYPES (t
) = arg_types
;
4367 /* If we already have such a type, use the old one. */
4368 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
4369 hashcode
= type_hash_list (arg_types
, hashcode
);
4370 t
= type_hash_canon (hashcode
, t
);
4372 if (!COMPLETE_TYPE_P (t
))
4377 /* Build a function type. The RETURN_TYPE is the type returned by the
4378 function. If additional arguments are provided, they are
4379 additional argument types. The list of argument types must always
4380 be terminated by NULL_TREE. */
4383 build_function_type_list (tree return_type
, ...)
4388 va_start (p
, return_type
);
4390 t
= va_arg (p
, tree
);
4391 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
4392 args
= tree_cons (NULL_TREE
, t
, args
);
4395 args
= nreverse (args
);
4396 TREE_CHAIN (last
) = void_list_node
;
4397 args
= build_function_type (return_type
, args
);
4403 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4404 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4405 for the method. An implicit additional parameter (of type
4406 pointer-to-BASETYPE) is added to the ARGTYPES. */
4409 build_method_type_directly (tree basetype
,
4417 /* Make a node of the sort we want. */
4418 t
= make_node (METHOD_TYPE
);
4420 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4421 TREE_TYPE (t
) = rettype
;
4422 ptype
= build_pointer_type (basetype
);
4424 /* The actual arglist for this function includes a "hidden" argument
4425 which is "this". Put it into the list of argument types. */
4426 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
4427 TYPE_ARG_TYPES (t
) = argtypes
;
4429 /* If we already have such a type, use the old one. */
4430 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4431 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
4432 hashcode
= type_hash_list (argtypes
, hashcode
);
4433 t
= type_hash_canon (hashcode
, t
);
4435 if (!COMPLETE_TYPE_P (t
))
4441 /* Construct, lay out and return the type of methods belonging to class
4442 BASETYPE and whose arguments and values are described by TYPE.
4443 If that type exists already, reuse it.
4444 TYPE must be a FUNCTION_TYPE node. */
4447 build_method_type (tree basetype
, tree type
)
4449 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
4451 return build_method_type_directly (basetype
,
4453 TYPE_ARG_TYPES (type
));
4456 /* Construct, lay out and return the type of offsets to a value
4457 of type TYPE, within an object of type BASETYPE.
4458 If a suitable offset type exists already, reuse it. */
4461 build_offset_type (tree basetype
, tree type
)
4464 hashval_t hashcode
= 0;
4466 /* Make a node of the sort we want. */
4467 t
= make_node (OFFSET_TYPE
);
4469 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4470 TREE_TYPE (t
) = type
;
4472 /* If we already have such a type, use the old one. */
4473 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4474 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
4475 t
= type_hash_canon (hashcode
, t
);
4477 if (!COMPLETE_TYPE_P (t
))
4483 /* Create a complex type whose components are COMPONENT_TYPE. */
4486 build_complex_type (tree component_type
)
4491 /* Make a node of the sort we want. */
4492 t
= make_node (COMPLEX_TYPE
);
4494 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4496 /* If we already have such a type, use the old one. */
4497 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
4498 t
= type_hash_canon (hashcode
, t
);
4500 if (!COMPLETE_TYPE_P (t
))
4503 /* If we are writing Dwarf2 output we need to create a name,
4504 since complex is a fundamental type. */
4505 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4509 if (component_type
== char_type_node
)
4510 name
= "complex char";
4511 else if (component_type
== signed_char_type_node
)
4512 name
= "complex signed char";
4513 else if (component_type
== unsigned_char_type_node
)
4514 name
= "complex unsigned char";
4515 else if (component_type
== short_integer_type_node
)
4516 name
= "complex short int";
4517 else if (component_type
== short_unsigned_type_node
)
4518 name
= "complex short unsigned int";
4519 else if (component_type
== integer_type_node
)
4520 name
= "complex int";
4521 else if (component_type
== unsigned_type_node
)
4522 name
= "complex unsigned int";
4523 else if (component_type
== long_integer_type_node
)
4524 name
= "complex long int";
4525 else if (component_type
== long_unsigned_type_node
)
4526 name
= "complex long unsigned int";
4527 else if (component_type
== long_long_integer_type_node
)
4528 name
= "complex long long int";
4529 else if (component_type
== long_long_unsigned_type_node
)
4530 name
= "complex long long unsigned int";
4535 TYPE_NAME (t
) = get_identifier (name
);
4538 return build_qualified_type (t
, TYPE_QUALS (component_type
));
4541 /* Return OP, stripped of any conversions to wider types as much as is safe.
4542 Converting the value back to OP's type makes a value equivalent to OP.
4544 If FOR_TYPE is nonzero, we return a value which, if converted to
4545 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4547 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4548 narrowest type that can hold the value, even if they don't exactly fit.
4549 Otherwise, bit-field references are changed to a narrower type
4550 only if they can be fetched directly from memory in that type.
4552 OP must have integer, real or enumeral type. Pointers are not allowed!
4554 There are some cases where the obvious value we could return
4555 would regenerate to OP if converted to OP's type,
4556 but would not extend like OP to wider types.
4557 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4558 For example, if OP is (unsigned short)(signed char)-1,
4559 we avoid returning (signed char)-1 if FOR_TYPE is int,
4560 even though extending that to an unsigned short would regenerate OP,
4561 since the result of extending (signed char)-1 to (int)
4562 is different from (int) OP. */
4565 get_unwidened (tree op
, tree for_type
)
4567 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4568 tree type
= TREE_TYPE (op
);
4570 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4572 = (for_type
!= 0 && for_type
!= type
4573 && final_prec
> TYPE_PRECISION (type
)
4574 && TYPE_UNSIGNED (type
));
4577 while (TREE_CODE (op
) == NOP_EXPR
)
4580 = TYPE_PRECISION (TREE_TYPE (op
))
4581 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4583 /* Truncations are many-one so cannot be removed.
4584 Unless we are later going to truncate down even farther. */
4586 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4589 /* See what's inside this conversion. If we decide to strip it,
4591 op
= TREE_OPERAND (op
, 0);
4593 /* If we have not stripped any zero-extensions (uns is 0),
4594 we can strip any kind of extension.
4595 If we have previously stripped a zero-extension,
4596 only zero-extensions can safely be stripped.
4597 Any extension can be stripped if the bits it would produce
4598 are all going to be discarded later by truncating to FOR_TYPE. */
4602 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4604 /* TYPE_UNSIGNED says whether this is a zero-extension.
4605 Let's avoid computing it if it does not affect WIN
4606 and if UNS will not be needed again. */
4607 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4608 && TYPE_UNSIGNED (TREE_TYPE (op
)))
4616 if (TREE_CODE (op
) == COMPONENT_REF
4617 /* Since type_for_size always gives an integer type. */
4618 && TREE_CODE (type
) != REAL_TYPE
4619 /* Don't crash if field not laid out yet. */
4620 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4621 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4623 unsigned int innerprec
4624 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4625 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4626 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4627 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4629 /* We can get this structure field in the narrowest type it fits in.
4630 If FOR_TYPE is 0, do this only for a field that matches the
4631 narrower type exactly and is aligned for it
4632 The resulting extension to its nominal type (a fullword type)
4633 must fit the same conditions as for other extensions. */
4636 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
4637 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4638 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
4640 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4641 TREE_OPERAND (op
, 1), NULL_TREE
);
4642 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4643 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4650 /* Return OP or a simpler expression for a narrower value
4651 which can be sign-extended or zero-extended to give back OP.
4652 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4653 or 0 if the value should be sign-extended. */
4656 get_narrower (tree op
, int *unsignedp_ptr
)
4661 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
4663 while (TREE_CODE (op
) == NOP_EXPR
)
4666 = (TYPE_PRECISION (TREE_TYPE (op
))
4667 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4669 /* Truncations are many-one so cannot be removed. */
4673 /* See what's inside this conversion. If we decide to strip it,
4678 op
= TREE_OPERAND (op
, 0);
4679 /* An extension: the outermost one can be stripped,
4680 but remember whether it is zero or sign extension. */
4682 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4683 /* Otherwise, if a sign extension has been stripped,
4684 only sign extensions can now be stripped;
4685 if a zero extension has been stripped, only zero-extensions. */
4686 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
4690 else /* bitschange == 0 */
4692 /* A change in nominal type can always be stripped, but we must
4693 preserve the unsignedness. */
4695 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4697 op
= TREE_OPERAND (op
, 0);
4698 /* Keep trying to narrow, but don't assign op to win if it
4699 would turn an integral type into something else. */
4700 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
4707 if (TREE_CODE (op
) == COMPONENT_REF
4708 /* Since type_for_size always gives an integer type. */
4709 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4710 /* Ensure field is laid out already. */
4711 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4712 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4714 unsigned HOST_WIDE_INT innerprec
4715 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4716 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4717 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4718 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4720 /* We can get this structure field in a narrower type that fits it,
4721 but the resulting extension to its nominal type (a fullword type)
4722 must satisfy the same conditions as for other extensions.
4724 Do this only for fields that are aligned (not bit-fields),
4725 because when bit-field insns will be used there is no
4726 advantage in doing this. */
4728 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4729 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4730 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
4734 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
4735 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4736 TREE_OPERAND (op
, 1), NULL_TREE
);
4737 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4738 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4741 *unsignedp_ptr
= uns
;
4745 /* Nonzero if integer constant C has a value that is permissible
4746 for type TYPE (an INTEGER_TYPE). */
4749 int_fits_type_p (tree c
, tree type
)
4751 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4752 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4753 int ok_for_low_bound
, ok_for_high_bound
;
4755 /* Perform some generic filtering first, which may allow making a decision
4756 even if the bounds are not constant. First, negative integers never fit
4757 in unsigned types, */
4758 if ((TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4759 /* Also, unsigned integers with top bit set never fit signed types. */
4760 || (! TYPE_UNSIGNED (type
)
4761 && TYPE_UNSIGNED (TREE_TYPE (c
)) && tree_int_cst_msb (c
)))
4764 /* If at least one bound of the type is a constant integer, we can check
4765 ourselves and maybe make a decision. If no such decision is possible, but
4766 this type is a subtype, try checking against that. Otherwise, use
4767 force_fit_type, which checks against the precision.
4769 Compute the status for each possibly constant bound, and return if we see
4770 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4771 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4772 for "constant known to fit". */
4774 ok_for_low_bound
= -1;
4775 ok_for_high_bound
= -1;
4777 /* Check if C >= type_low_bound. */
4778 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4780 ok_for_low_bound
= ! tree_int_cst_lt (c
, type_low_bound
);
4781 if (! ok_for_low_bound
)
4785 /* Check if c <= type_high_bound. */
4786 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4788 ok_for_high_bound
= ! tree_int_cst_lt (type_high_bound
, c
);
4789 if (! ok_for_high_bound
)
4793 /* If the constant fits both bounds, the result is known. */
4794 if (ok_for_low_bound
== 1 && ok_for_high_bound
== 1)
4797 /* If we haven't been able to decide at this point, there nothing more we
4798 can check ourselves here. Look at the base type if we have one. */
4799 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4800 return int_fits_type_p (c
, TREE_TYPE (type
));
4802 /* Or to force_fit_type, if nothing else. */
4806 TREE_TYPE (c
) = type
;
4807 c
= force_fit_type (c
, -1, false, false);
4808 return !TREE_OVERFLOW (c
);
4812 /* Subprogram of following function. Called by walk_tree.
4814 Return *TP if it is an automatic variable or parameter of the
4815 function passed in as DATA. */
4818 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
4820 tree fn
= (tree
) data
;
4825 else if (DECL_P (*tp
)
4826 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
4832 /* Returns true if T is, contains, or refers to a type with variable
4833 size. If FN is nonzero, only return true if a modifier of the type
4834 or position of FN is a variable or parameter inside FN.
4836 This concept is more general than that of C99 'variably modified types':
4837 in C99, a struct type is never variably modified because a VLA may not
4838 appear as a structure member. However, in GNU C code like:
4840 struct S { int i[f()]; };
4842 is valid, and other languages may define similar constructs. */
4845 variably_modified_type_p (tree type
, tree fn
)
4849 /* Test if T is either variable (if FN is zero) or an expression containing
4850 a variable in FN. */
4851 #define RETURN_TRUE_IF_VAR(T) \
4852 do { tree _t = (T); \
4853 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4854 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4855 return true; } while (0)
4857 if (type
== error_mark_node
)
4860 /* If TYPE itself has variable size, it is variably modified.
4862 We do not yet have a representation of the C99 '[*]' syntax.
4863 When a representation is chosen, this function should be modified
4864 to test for that case as well. */
4865 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
4866 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type
));
4868 switch (TREE_CODE (type
))
4871 case REFERENCE_TYPE
:
4875 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
4881 /* If TYPE is a function type, it is variably modified if any of the
4882 parameters or the return type are variably modified. */
4883 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
4886 for (t
= TYPE_ARG_TYPES (type
);
4887 t
&& t
!= void_list_node
;
4889 if (variably_modified_type_p (TREE_VALUE (t
), fn
))
4898 /* Scalar types are variably modified if their end points
4900 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
4901 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
4906 case QUAL_UNION_TYPE
:
4907 /* We can't see if any of the field are variably-modified by the
4908 definition we normally use, since that would produce infinite
4909 recursion via pointers. */
4910 /* This is variably modified if some field's type is. */
4911 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
4912 if (TREE_CODE (t
) == FIELD_DECL
)
4914 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
4915 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
4916 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
4918 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
4919 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
4927 /* The current language may have other cases to check, but in general,
4928 all other types are not variably modified. */
4929 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
4931 #undef RETURN_TRUE_IF_VAR
4934 /* Given a DECL or TYPE, return the scope in which it was declared, or
4935 NULL_TREE if there is no containing scope. */
4938 get_containing_scope (tree t
)
4940 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4943 /* Return the innermost context enclosing DECL that is
4944 a FUNCTION_DECL, or zero if none. */
4947 decl_function_context (tree decl
)
4951 if (TREE_CODE (decl
) == ERROR_MARK
)
4954 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4955 where we look up the function at runtime. Such functions always take
4956 a first argument of type 'pointer to real context'.
4958 C++ should really be fixed to use DECL_CONTEXT for the real context,
4959 and use something else for the "virtual context". */
4960 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4963 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4965 context
= DECL_CONTEXT (decl
);
4967 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4969 if (TREE_CODE (context
) == BLOCK
)
4970 context
= BLOCK_SUPERCONTEXT (context
);
4972 context
= get_containing_scope (context
);
4978 /* Return the innermost context enclosing DECL that is
4979 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4980 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4983 decl_type_context (tree decl
)
4985 tree context
= DECL_CONTEXT (decl
);
4988 switch (TREE_CODE (context
))
4990 case NAMESPACE_DECL
:
4991 case TRANSLATION_UNIT_DECL
:
4996 case QUAL_UNION_TYPE
:
5001 context
= DECL_CONTEXT (context
);
5005 context
= BLOCK_SUPERCONTEXT (context
);
5015 /* CALL is a CALL_EXPR. Return the declaration for the function
5016 called, or NULL_TREE if the called function cannot be
5020 get_callee_fndecl (tree call
)
5024 /* It's invalid to call this function with anything but a
5026 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5028 /* The first operand to the CALL is the address of the function
5030 addr
= TREE_OPERAND (call
, 0);
5034 /* If this is a readonly function pointer, extract its initial value. */
5035 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5036 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5037 && DECL_INITIAL (addr
))
5038 addr
= DECL_INITIAL (addr
);
5040 /* If the address is just `&f' for some function `f', then we know
5041 that `f' is being called. */
5042 if (TREE_CODE (addr
) == ADDR_EXPR
5043 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5044 return TREE_OPERAND (addr
, 0);
5046 /* We couldn't figure out what was being called. Maybe the front
5047 end has some idea. */
5048 return lang_hooks
.lang_get_callee_fndecl (call
);
5051 /* Print debugging information about tree nodes generated during the compile,
5052 and any language-specific information. */
5055 dump_tree_statistics (void)
5057 #ifdef GATHER_STATISTICS
5059 int total_nodes
, total_bytes
;
5062 fprintf (stderr
, "\n??? tree nodes created\n\n");
5063 #ifdef GATHER_STATISTICS
5064 fprintf (stderr
, "Kind Nodes Bytes\n");
5065 fprintf (stderr
, "---------------------------------------\n");
5066 total_nodes
= total_bytes
= 0;
5067 for (i
= 0; i
< (int) all_kinds
; i
++)
5069 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5070 tree_node_counts
[i
], tree_node_sizes
[i
]);
5071 total_nodes
+= tree_node_counts
[i
];
5072 total_bytes
+= tree_node_sizes
[i
];
5074 fprintf (stderr
, "---------------------------------------\n");
5075 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5076 fprintf (stderr
, "---------------------------------------\n");
5077 ssanames_print_statistics ();
5078 phinodes_print_statistics ();
5080 fprintf (stderr
, "(No per-node statistics)\n");
5082 print_type_hash_statistics ();
5083 lang_hooks
.print_statistics ();
5086 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5088 /* Generate a crc32 of a string. */
5091 crc32_string (unsigned chksum
, const char *string
)
5095 unsigned value
= *string
<< 24;
5098 for (ix
= 8; ix
--; value
<<= 1)
5102 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5111 /* P is a string that will be used in a symbol. Mask out any characters
5112 that are not valid in that context. */
5115 clean_symbol_name (char *p
)
5119 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5122 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5129 /* Generate a name for a function unique to this translation unit.
5130 TYPE is some string to identify the purpose of this function to the
5131 linker or collect2. */
5134 get_file_function_name_long (const char *type
)
5140 if (first_global_object_name
)
5141 p
= first_global_object_name
;
5144 /* We don't have anything that we know to be unique to this translation
5145 unit, so use what we do have and throw in some randomness. */
5147 const char *name
= weak_global_object_name
;
5148 const char *file
= main_input_filename
;
5153 file
= input_filename
;
5155 len
= strlen (file
);
5156 q
= alloca (9 * 2 + len
+ 1);
5157 memcpy (q
, file
, len
+ 1);
5158 clean_symbol_name (q
);
5160 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5161 crc32_string (0, flag_random_seed
));
5166 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5168 /* Set up the name of the file-level functions we may need.
5169 Use a global object (which is already required to be unique over
5170 the program) rather than the file name (which imposes extra
5172 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5174 return get_identifier (buf
);
5177 /* If KIND=='I', return a suitable global initializer (constructor) name.
5178 If KIND=='D', return a suitable global clean-up (destructor) name. */
5181 get_file_function_name (int kind
)
5188 return get_file_function_name_long (p
);
5191 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5192 The result is placed in BUFFER (which has length BIT_SIZE),
5193 with one bit in each char ('\000' or '\001').
5195 If the constructor is constant, NULL_TREE is returned.
5196 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5199 get_set_constructor_bits (tree init
, char *buffer
, int bit_size
)
5203 HOST_WIDE_INT domain_min
5204 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
5205 tree non_const_bits
= NULL_TREE
;
5207 for (i
= 0; i
< bit_size
; i
++)
5210 for (vals
= TREE_OPERAND (init
, 1);
5211 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
5213 if (!host_integerp (TREE_VALUE (vals
), 0)
5214 || (TREE_PURPOSE (vals
) != NULL_TREE
5215 && !host_integerp (TREE_PURPOSE (vals
), 0)))
5217 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
5218 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
5220 /* Set a range of bits to ones. */
5221 HOST_WIDE_INT lo_index
5222 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
5223 HOST_WIDE_INT hi_index
5224 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5226 gcc_assert (lo_index
>= 0);
5227 gcc_assert (lo_index
< bit_size
);
5228 gcc_assert (hi_index
>= 0);
5229 gcc_assert (hi_index
< bit_size
);
5230 for (; lo_index
<= hi_index
; lo_index
++)
5231 buffer
[lo_index
] = 1;
5235 /* Set a single bit to one. */
5237 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5238 if (index
< 0 || index
>= bit_size
)
5240 error ("invalid initializer for bit string");
5246 return non_const_bits
;
5249 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5250 The result is placed in BUFFER (which is an array of bytes).
5251 If the constructor is constant, NULL_TREE is returned.
5252 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5255 get_set_constructor_bytes (tree init
, unsigned char *buffer
, int wd_size
)
5258 int set_word_size
= BITS_PER_UNIT
;
5259 int bit_size
= wd_size
* set_word_size
;
5261 unsigned char *bytep
= buffer
;
5262 char *bit_buffer
= alloca (bit_size
);
5263 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5265 for (i
= 0; i
< wd_size
; i
++)
5268 for (i
= 0; i
< bit_size
; i
++)
5272 if (BYTES_BIG_ENDIAN
)
5273 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5275 *bytep
|= 1 << bit_pos
;
5278 if (bit_pos
>= set_word_size
)
5279 bit_pos
= 0, bytep
++;
5281 return non_const_bits
;
5284 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5286 /* Complain that the tree code of NODE does not match the expected 0
5287 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5291 tree_check_failed (const tree node
, const char *file
,
5292 int line
, const char *function
, ...)
5296 unsigned length
= 0;
5299 va_start (args
, function
);
5300 while ((code
= va_arg (args
, int)))
5301 length
+= 4 + strlen (tree_code_name
[code
]);
5303 va_start (args
, function
);
5304 buffer
= alloca (length
);
5306 while ((code
= va_arg (args
, int)))
5310 strcpy (buffer
+ length
, " or ");
5313 strcpy (buffer
+ length
, tree_code_name
[code
]);
5314 length
+= strlen (tree_code_name
[code
]);
5318 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5319 buffer
, tree_code_name
[TREE_CODE (node
)],
5320 function
, trim_filename (file
), line
);
5323 /* Complain that the tree code of NODE does match the expected 0
5324 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5328 tree_not_check_failed (const tree node
, const char *file
,
5329 int line
, const char *function
, ...)
5333 unsigned length
= 0;
5336 va_start (args
, function
);
5337 while ((code
= va_arg (args
, int)))
5338 length
+= 4 + strlen (tree_code_name
[code
]);
5340 va_start (args
, function
);
5341 buffer
= alloca (length
);
5343 while ((code
= va_arg (args
, int)))
5347 strcpy (buffer
+ length
, " or ");
5350 strcpy (buffer
+ length
, tree_code_name
[code
]);
5351 length
+= strlen (tree_code_name
[code
]);
5355 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5356 buffer
, tree_code_name
[TREE_CODE (node
)],
5357 function
, trim_filename (file
), line
);
5360 /* Similar to tree_check_failed, except that we check for a class of tree
5361 code, given in CL. */
5364 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
5365 const char *file
, int line
, const char *function
)
5368 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
5369 TREE_CODE_CLASS_STRING (cl
),
5370 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
5371 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
5374 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5375 (dynamically sized) vector. */
5378 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5379 const char *function
)
5382 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5383 idx
+ 1, len
, function
, trim_filename (file
), line
);
5386 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5387 (dynamically sized) vector. */
5390 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5391 const char *function
)
5394 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5395 idx
+ 1, len
, function
, trim_filename (file
), line
);
5398 /* Similar to above, except that the check is for the bounds of the operand
5399 vector of an expression node. */
5402 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
5403 int line
, const char *function
)
5406 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5407 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
5408 function
, trim_filename (file
), line
);
5410 #endif /* ENABLE_TREE_CHECKING */
5412 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5413 and mapped to the machine mode MODE. Initialize its fields and build
5414 the information necessary for debugging output. */
5417 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
5419 tree t
= make_node (VECTOR_TYPE
);
5421 TREE_TYPE (t
) = innertype
;
5422 TYPE_VECTOR_SUBPARTS (t
) = nunits
;
5423 TYPE_MODE (t
) = mode
;
5427 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
5428 tree array
= build_array_type (innertype
, build_index_type (index
));
5429 tree rt
= make_node (RECORD_TYPE
);
5431 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5432 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5434 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
5435 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5436 the representation type, and we want to find that die when looking up
5437 the vector type. This is most easily achieved by making the TYPE_UID
5439 TYPE_UID (rt
) = TYPE_UID (t
);
5446 make_or_reuse_type (unsigned size
, int unsignedp
)
5448 if (size
== INT_TYPE_SIZE
)
5449 return unsignedp
? unsigned_type_node
: integer_type_node
;
5450 if (size
== CHAR_TYPE_SIZE
)
5451 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5452 if (size
== SHORT_TYPE_SIZE
)
5453 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5454 if (size
== LONG_TYPE_SIZE
)
5455 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5456 if (size
== LONG_LONG_TYPE_SIZE
)
5457 return (unsignedp
? long_long_unsigned_type_node
5458 : long_long_integer_type_node
);
5461 return make_unsigned_type (size
);
5463 return make_signed_type (size
);
5466 /* Create nodes for all integer types (and error_mark_node) using the sizes
5467 of C datatypes. The caller should call set_sizetype soon after calling
5468 this function to select one of the types as sizetype. */
5471 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
5473 error_mark_node
= make_node (ERROR_MARK
);
5474 TREE_TYPE (error_mark_node
) = error_mark_node
;
5476 initialize_sizetypes (signed_sizetype
);
5478 /* Define both `signed char' and `unsigned char'. */
5479 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5480 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5482 /* Define `char', which is like either `signed char' or `unsigned char'
5483 but not the same as either. */
5486 ? make_signed_type (CHAR_TYPE_SIZE
)
5487 : make_unsigned_type (CHAR_TYPE_SIZE
));
5489 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5490 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5491 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5492 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5493 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5494 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5495 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5496 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5498 /* Define a boolean type. This type only represents boolean values but
5499 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5500 Front ends which want to override this size (i.e. Java) can redefine
5501 boolean_type_node before calling build_common_tree_nodes_2. */
5502 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5503 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5504 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5505 TYPE_PRECISION (boolean_type_node
) = 1;
5507 /* Fill in the rest of the sized types. Reuse existing type nodes
5509 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
5510 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
5511 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
5512 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
5513 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
5515 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
5516 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
5517 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
5518 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
5519 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
5521 access_public_node
= get_identifier ("public");
5522 access_protected_node
= get_identifier ("protected");
5523 access_private_node
= get_identifier ("private");
5526 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5527 It will create several other common tree nodes. */
5530 build_common_tree_nodes_2 (int short_double
)
5532 /* Define these next since types below may used them. */
5533 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
5534 integer_one_node
= build_int_cst (NULL_TREE
, 1);
5535 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
5537 size_zero_node
= size_int (0);
5538 size_one_node
= size_int (1);
5539 bitsize_zero_node
= bitsize_int (0);
5540 bitsize_one_node
= bitsize_int (1);
5541 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5543 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5544 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5546 void_type_node
= make_node (VOID_TYPE
);
5547 layout_type (void_type_node
);
5549 /* We are not going to have real types in C with less than byte alignment,
5550 so we might as well not have any types that claim to have it. */
5551 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5552 TYPE_USER_ALIGN (void_type_node
) = 0;
5554 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
5555 layout_type (TREE_TYPE (null_pointer_node
));
5557 ptr_type_node
= build_pointer_type (void_type_node
);
5559 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5560 fileptr_type_node
= ptr_type_node
;
5562 float_type_node
= make_node (REAL_TYPE
);
5563 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5564 layout_type (float_type_node
);
5566 double_type_node
= make_node (REAL_TYPE
);
5568 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5570 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5571 layout_type (double_type_node
);
5573 long_double_type_node
= make_node (REAL_TYPE
);
5574 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5575 layout_type (long_double_type_node
);
5577 float_ptr_type_node
= build_pointer_type (float_type_node
);
5578 double_ptr_type_node
= build_pointer_type (double_type_node
);
5579 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
5580 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
5582 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5583 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5584 layout_type (complex_integer_type_node
);
5586 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5587 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5588 layout_type (complex_float_type_node
);
5590 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5591 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5592 layout_type (complex_double_type_node
);
5594 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5595 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5596 layout_type (complex_long_double_type_node
);
5599 tree t
= targetm
.build_builtin_va_list ();
5601 /* Many back-ends define record types without setting TYPE_NAME.
5602 If we copied the record type here, we'd keep the original
5603 record type without a name. This breaks name mangling. So,
5604 don't copy record types and let c_common_nodes_and_builtins()
5605 declare the type to be __builtin_va_list. */
5606 if (TREE_CODE (t
) != RECORD_TYPE
)
5607 t
= build_variant_type_copy (t
);
5609 va_list_type_node
= t
;
5613 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5616 If we requested a pointer to a vector, build up the pointers that
5617 we stripped off while looking for the inner type. Similarly for
5618 return values from functions.
5620 The argument TYPE is the top of the chain, and BOTTOM is the
5621 new type which we will point to. */
5624 reconstruct_complex_type (tree type
, tree bottom
)
5628 if (POINTER_TYPE_P (type
))
5630 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5631 outer
= build_pointer_type (inner
);
5633 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5635 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5636 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
5638 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5640 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5641 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
5643 else if (TREE_CODE (type
) == METHOD_TYPE
)
5645 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5646 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
5648 TYPE_ARG_TYPES (type
));
5653 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
5654 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
5659 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5662 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
5666 switch (GET_MODE_CLASS (mode
))
5668 case MODE_VECTOR_INT
:
5669 case MODE_VECTOR_FLOAT
:
5670 nunits
= GET_MODE_NUNITS (mode
);
5674 /* Check that there are no leftover bits. */
5675 gcc_assert (GET_MODE_BITSIZE (mode
)
5676 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
5678 nunits
= GET_MODE_BITSIZE (mode
)
5679 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
5686 return make_vector_type (innertype
, nunits
, mode
);
5689 /* Similarly, but takes the inner type and number of units, which must be
5693 build_vector_type (tree innertype
, int nunits
)
5695 return make_vector_type (innertype
, nunits
, VOIDmode
);
5698 /* Given an initializer INIT, return TRUE if INIT is zero or some
5699 aggregate of zeros. Otherwise return FALSE. */
5701 initializer_zerop (tree init
)
5707 switch (TREE_CODE (init
))
5710 return integer_zerop (init
);
5713 /* ??? Note that this is not correct for C4X float formats. There,
5714 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5715 negative exponent. */
5716 return real_zerop (init
)
5717 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
5720 return integer_zerop (init
)
5721 || (real_zerop (init
)
5722 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
5723 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
5726 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
5727 if (!initializer_zerop (TREE_VALUE (elt
)))
5732 elt
= CONSTRUCTOR_ELTS (init
);
5733 if (elt
== NULL_TREE
)
5736 /* A set is empty only if it has no elements. */
5737 if (TREE_CODE (TREE_TYPE (init
)) == SET_TYPE
)
5740 for (; elt
; elt
= TREE_CHAIN (elt
))
5741 if (! initializer_zerop (TREE_VALUE (elt
)))
5751 add_var_to_bind_expr (tree bind_expr
, tree var
)
5753 BIND_EXPR_VARS (bind_expr
)
5754 = chainon (BIND_EXPR_VARS (bind_expr
), var
);
5755 if (BIND_EXPR_BLOCK (bind_expr
))
5756 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr
))
5757 = BIND_EXPR_VARS (bind_expr
);
5760 /* Build an empty statement. */
5763 build_empty_stmt (void)
5765 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
5769 /* Returns true if it is possible to prove that the index of
5770 an array access REF (an ARRAY_REF expression) falls into the
5774 in_array_bounds_p (tree ref
)
5776 tree idx
= TREE_OPERAND (ref
, 1);
5779 if (TREE_CODE (idx
) != INTEGER_CST
)
5782 min
= array_ref_low_bound (ref
);
5783 max
= array_ref_up_bound (ref
);
5786 || TREE_CODE (min
) != INTEGER_CST
5787 || TREE_CODE (max
) != INTEGER_CST
)
5790 if (tree_int_cst_lt (idx
, min
)
5791 || tree_int_cst_lt (max
, idx
))
5797 /* Return true if T (assumed to be a DECL) is a global variable. */
5800 is_global_var (tree t
)
5802 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5805 /* Return true if T (assumed to be a DECL) must be assigned a memory
5809 needs_to_live_in_memory (tree t
)
5811 return (TREE_ADDRESSABLE (t
)
5812 || is_global_var (t
)
5813 || (TREE_CODE (t
) == RESULT_DECL
5814 && aggregate_value_p (t
, current_function_decl
)));
5817 /* There are situations in which a language considers record types
5818 compatible which have different field lists. Decide if two fields
5819 are compatible. It is assumed that the parent records are compatible. */
5822 fields_compatible_p (tree f1
, tree f2
)
5824 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
5825 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
5828 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
5829 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
5832 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
5838 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5841 find_compatible_field (tree record
, tree orig_field
)
5845 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
5846 if (TREE_CODE (f
) == FIELD_DECL
5847 && fields_compatible_p (f
, orig_field
))
5850 /* ??? Why isn't this on the main fields list? */
5851 f
= TYPE_VFIELD (record
);
5852 if (f
&& TREE_CODE (f
) == FIELD_DECL
5853 && fields_compatible_p (f
, orig_field
))
5856 /* ??? We should abort here, but Java appears to do Bad Things
5857 with inherited fields. */
5861 /* Return value of a constant X. */
5864 int_cst_value (tree x
)
5866 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
5867 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
5868 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
5870 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
5873 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
5875 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
5880 /* Returns the greatest common divisor of A and B, which must be
5884 tree_fold_gcd (tree a
, tree b
)
5887 tree type
= TREE_TYPE (a
);
5889 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
5890 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
5892 if (integer_zerop (a
))
5895 if (integer_zerop (b
))
5898 if (tree_int_cst_sgn (a
) == -1)
5899 a
= fold (build2 (MULT_EXPR
, type
, a
,
5900 convert (type
, integer_minus_one_node
)));
5902 if (tree_int_cst_sgn (b
) == -1)
5903 b
= fold (build2 (MULT_EXPR
, type
, b
,
5904 convert (type
, integer_minus_one_node
)));
5908 a_mod_b
= fold (build2 (CEIL_MOD_EXPR
, type
, a
, b
));
5910 if (!TREE_INT_CST_LOW (a_mod_b
)
5911 && !TREE_INT_CST_HIGH (a_mod_b
))
5919 /* Returns unsigned variant of TYPE. */
5922 unsigned_type_for (tree type
)
5924 return lang_hooks
.types
.unsigned_type (type
);
5927 /* Returns signed variant of TYPE. */
5930 signed_type_for (tree type
)
5932 return lang_hooks
.types
.signed_type (type
);
5935 #include "gt-tree.h"