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 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"
49 /* obstack.[ch] explicitly declined to prototype this. */
50 extern int _obstack_allocated_p
PARAMS ((struct obstack
*h
, void *obj
));
52 #ifdef GATHER_STATISTICS
53 /* Statistics-gathering stuff. */
73 int tree_node_counts
[(int) all_kinds
];
74 int tree_node_sizes
[(int) all_kinds
];
76 static const char * const tree_node_kind_names
[] = {
92 #endif /* GATHER_STATISTICS */
94 /* Unique id for next decl created. */
95 static GTY(()) int next_decl_uid
;
96 /* Unique id for next type created. */
97 static GTY(()) int next_type_uid
= 1;
99 /* Since we cannot rehash a type after it is in the table, we have to
100 keep the hash code. */
102 struct type_hash
GTY(())
108 /* Initial size of the hash table (rounded to next prime). */
109 #define TYPE_HASH_INITIAL_SIZE 1000
111 /* Now here is the hash table. When recording a type, it is added to
112 the slot whose index is the hash code. Note that the hash table is
113 used for several kinds of types (function types, array types and
114 array index range types, for now). While all these live in the
115 same table, they are completely independent, and the hash code is
116 computed differently for each of these. */
118 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
119 htab_t type_hash_table
;
121 static void set_type_quals
PARAMS ((tree
, int));
122 static void append_random_chars
PARAMS ((char *));
123 static int type_hash_eq
PARAMS ((const void *, const void *));
124 static hashval_t type_hash_hash
PARAMS ((const void *));
125 static void print_type_hash_statistics
PARAMS((void));
126 static void finish_vector_type
PARAMS((tree
));
127 static tree make_vector
PARAMS ((enum machine_mode
, tree
, int));
128 static int type_hash_marked_p
PARAMS ((const void *));
130 tree global_trees
[TI_MAX
];
131 tree integer_types
[itk_none
];
138 /* Initialize the hash table of types. */
139 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
144 /* The name of the object as the assembler will see it (but before any
145 translations made by ASM_OUTPUT_LABELREF). Often this is the same
146 as DECL_NAME. It is an IDENTIFIER_NODE. */
148 decl_assembler_name (decl
)
151 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
152 (*lang_hooks
.set_decl_assembler_name
) (decl
);
153 return DECL_CHECK (decl
)->decl
.assembler_name
;
156 /* Compute the number of bytes occupied by 'node'. This routine only
157 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
162 enum tree_code code
= TREE_CODE (node
);
164 switch (TREE_CODE_CLASS (code
))
166 case 'd': /* A decl node */
167 return sizeof (struct tree_decl
);
169 case 't': /* a type node */
170 return sizeof (struct tree_type
);
172 case 'b': /* a lexical block node */
173 return sizeof (struct tree_block
);
175 case 'r': /* a reference */
176 case 'e': /* an expression */
177 case 's': /* an expression with side effects */
178 case '<': /* a comparison expression */
179 case '1': /* a unary arithmetic expression */
180 case '2': /* a binary arithmetic expression */
181 return (sizeof (struct tree_exp
)
182 + TREE_CODE_LENGTH (code
) * sizeof (char *) - sizeof (char *));
184 case 'c': /* a constant */
187 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
188 case REAL_CST
: return sizeof (struct tree_real_cst
);
189 case COMPLEX_CST
: return sizeof (struct tree_complex
);
190 case VECTOR_CST
: return sizeof (struct tree_vector
);
191 case STRING_CST
: return sizeof (struct tree_string
);
193 return (*lang_hooks
.tree_size
) (code
);
196 case 'x': /* something random, like an identifier. */
199 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
200 case TREE_LIST
: return sizeof (struct tree_list
);
201 case TREE_VEC
: return (sizeof (struct tree_vec
)
202 + TREE_VEC_LENGTH(node
) * sizeof(char *)
206 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
209 return (*lang_hooks
.tree_size
) (code
);
217 /* Return a newly allocated node of code CODE.
218 For decl and type nodes, some other fields are initialized.
219 The rest of the node is initialized to zero.
221 Achoo! I got a code in the node. */
228 int type
= TREE_CODE_CLASS (code
);
230 #ifdef GATHER_STATISTICS
233 struct tree_common ttmp
;
235 /* We can't allocate a TREE_VEC without knowing how many elements
237 if (code
== TREE_VEC
)
240 TREE_SET_CODE ((tree
)&ttmp
, code
);
241 length
= tree_size ((tree
)&ttmp
);
243 #ifdef GATHER_STATISTICS
246 case 'd': /* A decl node */
250 case 't': /* a type node */
254 case 'b': /* a lexical block */
258 case 's': /* an expression with side effects */
262 case 'r': /* a reference */
266 case 'e': /* an expression */
267 case '<': /* a comparison expression */
268 case '1': /* a unary arithmetic expression */
269 case '2': /* a binary arithmetic expression */
273 case 'c': /* a constant */
277 case 'x': /* something random, like an identifier. */
278 if (code
== IDENTIFIER_NODE
)
280 else if (code
== TREE_VEC
)
290 tree_node_counts
[(int) kind
]++;
291 tree_node_sizes
[(int) kind
] += length
;
294 t
= ggc_alloc_tree (length
);
296 memset (t
, 0, length
);
298 TREE_SET_CODE (t
, code
);
303 TREE_SIDE_EFFECTS (t
) = 1;
307 if (code
!= FUNCTION_DECL
)
309 DECL_USER_ALIGN (t
) = 0;
310 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
311 DECL_SOURCE_LOCATION (t
) = input_location
;
312 DECL_UID (t
) = next_decl_uid
++;
314 /* We have not yet computed the alias set for this declaration. */
315 DECL_POINTER_ALIAS_SET (t
) = -1;
319 TYPE_UID (t
) = next_type_uid
++;
320 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
321 TYPE_USER_ALIGN (t
) = 0;
322 TYPE_MAIN_VARIANT (t
) = t
;
324 /* Default to no attributes for type, but let target change that. */
325 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
326 (*targetm
.set_default_type_attributes
) (t
);
328 /* We have not yet computed the alias set for this type. */
329 TYPE_ALIAS_SET (t
) = -1;
333 TREE_CONSTANT (t
) = 1;
343 case PREDECREMENT_EXPR
:
344 case PREINCREMENT_EXPR
:
345 case POSTDECREMENT_EXPR
:
346 case POSTINCREMENT_EXPR
:
347 /* All of these have side-effects, no matter what their
349 TREE_SIDE_EFFECTS (t
) = 1;
361 /* Return a new node with the same contents as NODE except that its
362 TREE_CHAIN is zero and it has a fresh uid. */
369 enum tree_code code
= TREE_CODE (node
);
372 length
= tree_size (node
);
373 t
= ggc_alloc_tree (length
);
374 memcpy (t
, node
, length
);
377 TREE_ASM_WRITTEN (t
) = 0;
379 if (TREE_CODE_CLASS (code
) == 'd')
380 DECL_UID (t
) = next_decl_uid
++;
381 else if (TREE_CODE_CLASS (code
) == 't')
383 TYPE_UID (t
) = next_type_uid
++;
384 /* The following is so that the debug code for
385 the copy is different from the original type.
386 The two statements usually duplicate each other
387 (because they clear fields of the same union),
388 but the optimizer should catch that. */
389 TYPE_SYMTAB_POINTER (t
) = 0;
390 TYPE_SYMTAB_ADDRESS (t
) = 0;
396 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
397 For example, this can copy a list made of TREE_LIST nodes. */
409 head
= prev
= copy_node (list
);
410 next
= TREE_CHAIN (list
);
413 TREE_CHAIN (prev
) = copy_node (next
);
414 prev
= TREE_CHAIN (prev
);
415 next
= TREE_CHAIN (next
);
421 /* Return a newly constructed INTEGER_CST node whose constant value
422 is specified by the two ints LOW and HI.
423 The TREE_TYPE is set to `int'.
425 This function should be used via the `build_int_2' macro. */
428 build_int_2_wide (low
, hi
)
429 unsigned HOST_WIDE_INT low
;
432 tree t
= make_node (INTEGER_CST
);
434 TREE_INT_CST_LOW (t
) = low
;
435 TREE_INT_CST_HIGH (t
) = hi
;
436 TREE_TYPE (t
) = integer_type_node
;
440 /* Return a new VECTOR_CST node whose type is TYPE and whose values
441 are in a list pointed by VALS. */
444 build_vector (type
, vals
)
447 tree v
= make_node (VECTOR_CST
);
448 int over1
= 0, over2
= 0;
451 TREE_VECTOR_CST_ELTS (v
) = vals
;
452 TREE_TYPE (v
) = type
;
454 /* Iterate through elements and check for overflow. */
455 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
457 tree value
= TREE_VALUE (link
);
459 over1
|= TREE_OVERFLOW (value
);
460 over2
|= TREE_CONSTANT_OVERFLOW (value
);
463 TREE_OVERFLOW (v
) = over1
;
464 TREE_CONSTANT_OVERFLOW (v
) = over2
;
469 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
470 are in a list pointed to by VALS. */
472 build_constructor (type
, vals
)
475 tree c
= make_node (CONSTRUCTOR
);
476 TREE_TYPE (c
) = type
;
477 CONSTRUCTOR_ELTS (c
) = vals
;
479 /* ??? May not be necessary. Mirrors what build does. */
482 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
483 TREE_READONLY (c
) = TREE_READONLY (vals
);
484 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
487 TREE_CONSTANT (c
) = 0; /* safe side */
492 /* Return a new REAL_CST node whose type is TYPE and value is D. */
503 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
504 Consider doing it via real_convert now. */
506 v
= make_node (REAL_CST
);
507 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
508 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
510 TREE_TYPE (v
) = type
;
511 TREE_REAL_CST_PTR (v
) = dp
;
512 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
516 /* Return a new REAL_CST node whose type is TYPE
517 and whose value is the integer value of the INTEGER_CST node I. */
520 real_value_from_int_cst (type
, i
)
521 tree type ATTRIBUTE_UNUSED
, i
;
525 /* Clear all bits of the real value type so that we can later do
526 bitwise comparisons to see if two values are the same. */
527 memset ((char *) &d
, 0, sizeof d
);
529 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
530 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
533 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
534 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
538 /* Given a tree representing an integer constant I, return a tree
539 representing the same value as a floating-point constant of type TYPE. */
542 build_real_from_int_cst (type
, i
)
547 int overflow
= TREE_OVERFLOW (i
);
549 v
= build_real (type
, real_value_from_int_cst (type
, i
));
551 TREE_OVERFLOW (v
) |= overflow
;
552 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
556 /* Return a newly constructed STRING_CST node whose value is
557 the LEN characters at STR.
558 The TREE_TYPE is not initialized. */
561 build_string (len
, str
)
565 tree s
= make_node (STRING_CST
);
567 TREE_STRING_LENGTH (s
) = len
;
568 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
573 /* Return a newly constructed COMPLEX_CST node whose value is
574 specified by the real and imaginary parts REAL and IMAG.
575 Both REAL and IMAG should be constant nodes. TYPE, if specified,
576 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
579 build_complex (type
, real
, imag
)
583 tree t
= make_node (COMPLEX_CST
);
585 TREE_REALPART (t
) = real
;
586 TREE_IMAGPART (t
) = imag
;
587 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
588 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
589 TREE_CONSTANT_OVERFLOW (t
)
590 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
594 /* Build a newly constructed TREE_VEC node of length LEN. */
601 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
603 #ifdef GATHER_STATISTICS
604 tree_node_counts
[(int) vec_kind
]++;
605 tree_node_sizes
[(int) vec_kind
] += length
;
608 t
= ggc_alloc_tree (length
);
610 memset (t
, 0, length
);
611 TREE_SET_CODE (t
, TREE_VEC
);
612 TREE_VEC_LENGTH (t
) = len
;
617 /* Return 1 if EXPR is the integer constant zero or a complex constant
626 return ((TREE_CODE (expr
) == INTEGER_CST
627 && ! TREE_CONSTANT_OVERFLOW (expr
)
628 && TREE_INT_CST_LOW (expr
) == 0
629 && TREE_INT_CST_HIGH (expr
) == 0)
630 || (TREE_CODE (expr
) == COMPLEX_CST
631 && integer_zerop (TREE_REALPART (expr
))
632 && integer_zerop (TREE_IMAGPART (expr
))));
635 /* Return 1 if EXPR is the integer constant one or the corresponding
644 return ((TREE_CODE (expr
) == INTEGER_CST
645 && ! TREE_CONSTANT_OVERFLOW (expr
)
646 && TREE_INT_CST_LOW (expr
) == 1
647 && TREE_INT_CST_HIGH (expr
) == 0)
648 || (TREE_CODE (expr
) == COMPLEX_CST
649 && integer_onep (TREE_REALPART (expr
))
650 && integer_zerop (TREE_IMAGPART (expr
))));
653 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
654 it contains. Likewise for the corresponding complex constant. */
657 integer_all_onesp (expr
)
665 if (TREE_CODE (expr
) == COMPLEX_CST
666 && integer_all_onesp (TREE_REALPART (expr
))
667 && integer_zerop (TREE_IMAGPART (expr
)))
670 else if (TREE_CODE (expr
) != INTEGER_CST
671 || TREE_CONSTANT_OVERFLOW (expr
))
674 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
676 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
677 && TREE_INT_CST_HIGH (expr
) == -1);
679 /* Note that using TYPE_PRECISION here is wrong. We care about the
680 actual bits, not the (arbitrary) range of the type. */
681 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
682 if (prec
>= HOST_BITS_PER_WIDE_INT
)
684 HOST_WIDE_INT high_value
;
687 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
689 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
690 /* Can not handle precisions greater than twice the host int size. */
692 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
693 /* Shifting by the host word size is undefined according to the ANSI
694 standard, so we must handle this as a special case. */
697 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
699 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
700 && TREE_INT_CST_HIGH (expr
) == high_value
);
703 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
706 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
714 HOST_WIDE_INT high
, low
;
718 if (TREE_CODE (expr
) == COMPLEX_CST
719 && integer_pow2p (TREE_REALPART (expr
))
720 && integer_zerop (TREE_IMAGPART (expr
)))
723 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
726 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
727 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
728 high
= TREE_INT_CST_HIGH (expr
);
729 low
= TREE_INT_CST_LOW (expr
);
731 /* First clear all bits that are beyond the type's precision in case
732 we've been sign extended. */
734 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
736 else if (prec
> HOST_BITS_PER_WIDE_INT
)
737 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
741 if (prec
< HOST_BITS_PER_WIDE_INT
)
742 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
745 if (high
== 0 && low
== 0)
748 return ((high
== 0 && (low
& (low
- 1)) == 0)
749 || (low
== 0 && (high
& (high
- 1)) == 0));
752 /* Return 1 if EXPR is an integer constant other than zero or a
753 complex constant other than zero. */
756 integer_nonzerop (expr
)
761 return ((TREE_CODE (expr
) == INTEGER_CST
762 && ! TREE_CONSTANT_OVERFLOW (expr
)
763 && (TREE_INT_CST_LOW (expr
) != 0
764 || TREE_INT_CST_HIGH (expr
) != 0))
765 || (TREE_CODE (expr
) == COMPLEX_CST
766 && (integer_nonzerop (TREE_REALPART (expr
))
767 || integer_nonzerop (TREE_IMAGPART (expr
)))));
770 /* Return the power of two represented by a tree node known to be a
778 HOST_WIDE_INT high
, low
;
782 if (TREE_CODE (expr
) == COMPLEX_CST
)
783 return tree_log2 (TREE_REALPART (expr
));
785 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
786 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
788 high
= TREE_INT_CST_HIGH (expr
);
789 low
= TREE_INT_CST_LOW (expr
);
791 /* First clear all bits that are beyond the type's precision in case
792 we've been sign extended. */
794 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
796 else if (prec
> HOST_BITS_PER_WIDE_INT
)
797 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
801 if (prec
< HOST_BITS_PER_WIDE_INT
)
802 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
805 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
809 /* Similar, but return the largest integer Y such that 2 ** Y is less
810 than or equal to EXPR. */
813 tree_floor_log2 (expr
)
817 HOST_WIDE_INT high
, low
;
821 if (TREE_CODE (expr
) == COMPLEX_CST
)
822 return tree_log2 (TREE_REALPART (expr
));
824 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
825 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
827 high
= TREE_INT_CST_HIGH (expr
);
828 low
= TREE_INT_CST_LOW (expr
);
830 /* First clear all bits that are beyond the type's precision in case
831 we've been sign extended. Ignore if type's precision hasn't been set
832 since what we are doing is setting it. */
834 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
836 else if (prec
> HOST_BITS_PER_WIDE_INT
)
837 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
841 if (prec
< HOST_BITS_PER_WIDE_INT
)
842 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
845 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
849 /* Return 1 if EXPR is the real constant zero. */
857 return ((TREE_CODE (expr
) == REAL_CST
858 && ! TREE_CONSTANT_OVERFLOW (expr
)
859 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
860 || (TREE_CODE (expr
) == COMPLEX_CST
861 && real_zerop (TREE_REALPART (expr
))
862 && real_zerop (TREE_IMAGPART (expr
))));
865 /* Return 1 if EXPR is the real constant one in real or complex form. */
873 return ((TREE_CODE (expr
) == REAL_CST
874 && ! TREE_CONSTANT_OVERFLOW (expr
)
875 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
876 || (TREE_CODE (expr
) == COMPLEX_CST
877 && real_onep (TREE_REALPART (expr
))
878 && real_zerop (TREE_IMAGPART (expr
))));
881 /* Return 1 if EXPR is the real constant two. */
889 return ((TREE_CODE (expr
) == REAL_CST
890 && ! TREE_CONSTANT_OVERFLOW (expr
)
891 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
892 || (TREE_CODE (expr
) == COMPLEX_CST
893 && real_twop (TREE_REALPART (expr
))
894 && real_zerop (TREE_IMAGPART (expr
))));
897 /* Return 1 if EXPR is the real constant minus one. */
900 real_minus_onep (expr
)
905 return ((TREE_CODE (expr
) == REAL_CST
906 && ! TREE_CONSTANT_OVERFLOW (expr
)
907 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
908 || (TREE_CODE (expr
) == COMPLEX_CST
909 && real_minus_onep (TREE_REALPART (expr
))
910 && real_zerop (TREE_IMAGPART (expr
))));
913 /* Nonzero if EXP is a constant or a cast of a constant. */
916 really_constant_p (exp
)
919 /* This is not quite the same as STRIP_NOPS. It does more. */
920 while (TREE_CODE (exp
) == NOP_EXPR
921 || TREE_CODE (exp
) == CONVERT_EXPR
922 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
923 exp
= TREE_OPERAND (exp
, 0);
924 return TREE_CONSTANT (exp
);
927 /* Return first list element whose TREE_VALUE is ELEM.
928 Return 0 if ELEM is not in LIST. */
931 value_member (elem
, list
)
936 if (elem
== TREE_VALUE (list
))
938 list
= TREE_CHAIN (list
);
943 /* Return first list element whose TREE_PURPOSE is ELEM.
944 Return 0 if ELEM is not in LIST. */
947 purpose_member (elem
, list
)
952 if (elem
== TREE_PURPOSE (list
))
954 list
= TREE_CHAIN (list
);
959 /* Return first list element whose BINFO_TYPE is ELEM.
960 Return 0 if ELEM is not in LIST. */
963 binfo_member (elem
, list
)
968 if (elem
== BINFO_TYPE (list
))
970 list
= TREE_CHAIN (list
);
975 /* Return nonzero if ELEM is part of the chain CHAIN. */
978 chain_member (elem
, chain
)
985 chain
= TREE_CHAIN (chain
);
991 /* Return the length of a chain of nodes chained through TREE_CHAIN.
992 We expect a null pointer to mark the end of the chain.
993 This is the Lisp primitive `length'. */
1002 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1008 /* Returns the number of FIELD_DECLs in TYPE. */
1011 fields_length (type
)
1014 tree t
= TYPE_FIELDS (type
);
1017 for (; t
; t
= TREE_CHAIN (t
))
1018 if (TREE_CODE (t
) == FIELD_DECL
)
1024 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1025 by modifying the last node in chain 1 to point to chain 2.
1026 This is the Lisp primitive `nconc'. */
1039 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1041 TREE_CHAIN (t1
) = op2
;
1043 #ifdef ENABLE_TREE_CHECKING
1046 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1048 abort (); /* Circularity created. */
1055 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1063 while ((next
= TREE_CHAIN (chain
)))
1068 /* Reverse the order of elements in the chain T,
1069 and return the new head of the chain (old last element). */
1075 tree prev
= 0, decl
, next
;
1076 for (decl
= t
; decl
; decl
= next
)
1078 next
= TREE_CHAIN (decl
);
1079 TREE_CHAIN (decl
) = prev
;
1085 /* Return a newly created TREE_LIST node whose
1086 purpose and value fields are PARM and VALUE. */
1089 build_tree_list (parm
, value
)
1092 tree t
= make_node (TREE_LIST
);
1093 TREE_PURPOSE (t
) = parm
;
1094 TREE_VALUE (t
) = value
;
1098 /* Return a newly created TREE_LIST node whose
1099 purpose and value fields are PURPOSE and VALUE
1100 and whose TREE_CHAIN is CHAIN. */
1103 tree_cons (purpose
, value
, chain
)
1104 tree purpose
, value
, chain
;
1108 node
= ggc_alloc_tree (sizeof (struct tree_list
));
1110 memset (node
, 0, sizeof (struct tree_common
));
1112 #ifdef GATHER_STATISTICS
1113 tree_node_counts
[(int) x_kind
]++;
1114 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1117 TREE_SET_CODE (node
, TREE_LIST
);
1118 TREE_CHAIN (node
) = chain
;
1119 TREE_PURPOSE (node
) = purpose
;
1120 TREE_VALUE (node
) = value
;
1124 /* Return the first expression in a sequence of COMPOUND_EXPRs. */
1127 expr_first (tree expr
)
1129 if (expr
== NULL_TREE
)
1131 while (TREE_CODE (expr
) == COMPOUND_EXPR
)
1132 expr
= TREE_OPERAND (expr
, 0);
1136 /* Return the last expression in a sequence of COMPOUND_EXPRs. */
1139 expr_last (tree expr
)
1141 if (expr
== NULL_TREE
)
1143 while (TREE_CODE (expr
) == COMPOUND_EXPR
)
1144 expr
= TREE_OPERAND (expr
, 1);
1148 /* Return the number of subexpressions in a sequence of COMPOUND_EXPRs. */
1151 expr_length (tree expr
)
1155 if (expr
== NULL_TREE
)
1157 for (; TREE_CODE (expr
) == COMPOUND_EXPR
; expr
= TREE_OPERAND (expr
, 1))
1158 len
+= expr_length (TREE_OPERAND (expr
, 0));
1163 /* Return the size nominally occupied by an object of type TYPE
1164 when it resides in memory. The value is measured in units of bytes,
1165 and its data type is that normally used for type sizes
1166 (which is the first type created by make_signed_type or
1167 make_unsigned_type). */
1170 size_in_bytes (type
)
1175 if (type
== error_mark_node
)
1176 return integer_zero_node
;
1178 type
= TYPE_MAIN_VARIANT (type
);
1179 t
= TYPE_SIZE_UNIT (type
);
1183 (*lang_hooks
.types
.incomplete_type_error
) (NULL_TREE
, type
);
1184 return size_zero_node
;
1187 if (TREE_CODE (t
) == INTEGER_CST
)
1188 force_fit_type (t
, 0);
1193 /* Return the size of TYPE (in bytes) as a wide integer
1194 or return -1 if the size can vary or is larger than an integer. */
1197 int_size_in_bytes (type
)
1202 if (type
== error_mark_node
)
1205 type
= TYPE_MAIN_VARIANT (type
);
1206 t
= TYPE_SIZE_UNIT (type
);
1208 || TREE_CODE (t
) != INTEGER_CST
1209 || TREE_OVERFLOW (t
)
1210 || TREE_INT_CST_HIGH (t
) != 0
1211 /* If the result would appear negative, it's too big to represent. */
1212 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1215 return TREE_INT_CST_LOW (t
);
1218 /* Return the bit position of FIELD, in bits from the start of the record.
1219 This is a tree of type bitsizetype. */
1222 bit_position (field
)
1225 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1226 DECL_FIELD_BIT_OFFSET (field
));
1229 /* Likewise, but return as an integer. Abort if it cannot be represented
1230 in that way (since it could be a signed value, we don't have the option
1231 of returning -1 like int_size_in_byte can. */
1234 int_bit_position (field
)
1237 return tree_low_cst (bit_position (field
), 0);
1240 /* Return the byte position of FIELD, in bytes from the start of the record.
1241 This is a tree of type sizetype. */
1244 byte_position (field
)
1247 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1248 DECL_FIELD_BIT_OFFSET (field
));
1251 /* Likewise, but return as an integer. Abort if it cannot be represented
1252 in that way (since it could be a signed value, we don't have the option
1253 of returning -1 like int_size_in_byte can. */
1256 int_byte_position (field
)
1259 return tree_low_cst (byte_position (field
), 0);
1262 /* Return the strictest alignment, in bits, that T is known to have. */
1268 unsigned int align0
, align1
;
1270 switch (TREE_CODE (t
))
1272 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1273 /* If we have conversions, we know that the alignment of the
1274 object must meet each of the alignments of the types. */
1275 align0
= expr_align (TREE_OPERAND (t
, 0));
1276 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1277 return MAX (align0
, align1
);
1279 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1280 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1281 case WITH_RECORD_EXPR
: case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
1282 /* These don't change the alignment of an object. */
1283 return expr_align (TREE_OPERAND (t
, 0));
1286 /* The best we can do is say that the alignment is the least aligned
1288 align0
= expr_align (TREE_OPERAND (t
, 1));
1289 align1
= expr_align (TREE_OPERAND (t
, 2));
1290 return MIN (align0
, align1
);
1292 case LABEL_DECL
: case CONST_DECL
:
1293 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1294 if (DECL_ALIGN (t
) != 0)
1295 return DECL_ALIGN (t
);
1299 return FUNCTION_BOUNDARY
;
1305 /* Otherwise take the alignment from that of the type. */
1306 return TYPE_ALIGN (TREE_TYPE (t
));
1309 /* Return, as a tree node, the number of elements for TYPE (which is an
1310 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1313 array_type_nelts (type
)
1316 tree index_type
, min
, max
;
1318 /* If they did it with unspecified bounds, then we should have already
1319 given an error about it before we got here. */
1320 if (! TYPE_DOMAIN (type
))
1321 return error_mark_node
;
1323 index_type
= TYPE_DOMAIN (type
);
1324 min
= TYPE_MIN_VALUE (index_type
);
1325 max
= TYPE_MAX_VALUE (index_type
);
1327 return (integer_zerop (min
)
1329 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1332 /* Return nonzero if arg is static -- a reference to an object in
1333 static storage. This is not the same as the C meaning of `static'. */
1339 switch (TREE_CODE (arg
))
1342 /* Nested functions aren't static, since taking their address
1343 involves a trampoline. */
1344 return ((decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1345 && ! DECL_NON_ADDR_CONST_P (arg
));
1348 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1349 && ! DECL_THREAD_LOCAL (arg
)
1350 && ! DECL_NON_ADDR_CONST_P (arg
));
1353 return TREE_STATIC (arg
);
1359 /* If we are referencing a bitfield, we can't evaluate an
1360 ADDR_EXPR at compile time and so it isn't a constant. */
1362 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
1363 && staticp (TREE_OPERAND (arg
, 0)));
1369 /* This case is technically correct, but results in setting
1370 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1373 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
1377 case ARRAY_RANGE_REF
:
1378 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1379 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1380 return staticp (TREE_OPERAND (arg
, 0));
1383 if ((unsigned int) TREE_CODE (arg
)
1384 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1385 return (*lang_hooks
.staticp
) (arg
);
1391 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1392 Do this to any expression which may be used in more than one place,
1393 but must be evaluated only once.
1395 Normally, expand_expr would reevaluate the expression each time.
1396 Calling save_expr produces something that is evaluated and recorded
1397 the first time expand_expr is called on it. Subsequent calls to
1398 expand_expr just reuse the recorded value.
1400 The call to expand_expr that generates code that actually computes
1401 the value is the first call *at compile time*. Subsequent calls
1402 *at compile time* generate code to use the saved value.
1403 This produces correct result provided that *at run time* control
1404 always flows through the insns made by the first expand_expr
1405 before reaching the other places where the save_expr was evaluated.
1406 You, the caller of save_expr, must make sure this is so.
1408 Constants, and certain read-only nodes, are returned with no
1409 SAVE_EXPR because that is safe. Expressions containing placeholders
1410 are not touched; see tree.def for an explanation of what these
1417 tree t
= fold (expr
);
1420 /* If the tree evaluates to a constant, then we don't want to hide that
1421 fact (i.e. this allows further folding, and direct checks for constants).
1422 However, a read-only object that has side effects cannot be bypassed.
1423 Since it is no problem to reevaluate literals, we just return the
1425 inner
= skip_simple_arithmetic (t
);
1426 if (TREE_CONSTANT (inner
)
1427 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1428 || TREE_CODE (inner
) == SAVE_EXPR
1429 || TREE_CODE (inner
) == ERROR_MARK
)
1432 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1433 it means that the size or offset of some field of an object depends on
1434 the value within another field.
1436 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1437 and some variable since it would then need to be both evaluated once and
1438 evaluated more than once. Front-ends must assure this case cannot
1439 happen by surrounding any such subexpressions in their own SAVE_EXPR
1440 and forcing evaluation at the proper time. */
1441 if (contains_placeholder_p (inner
))
1444 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
1446 /* This expression might be placed ahead of a jump to ensure that the
1447 value was computed on both sides of the jump. So make sure it isn't
1448 eliminated as dead. */
1449 TREE_SIDE_EFFECTS (t
) = 1;
1450 TREE_READONLY (t
) = 1;
1454 /* Look inside EXPR and into any simple arithmetic operations. Return
1455 the innermost non-arithmetic node. */
1458 skip_simple_arithmetic (expr
)
1463 /* We don't care about whether this can be used as an lvalue in this
1465 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1466 expr
= TREE_OPERAND (expr
, 0);
1468 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1469 a constant, it will be more efficient to not make another SAVE_EXPR since
1470 it will allow better simplification and GCSE will be able to merge the
1471 computations if they actually occur. */
1475 if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '1')
1476 inner
= TREE_OPERAND (inner
, 0);
1477 else if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '2')
1479 if (TREE_CONSTANT (TREE_OPERAND (inner
, 1)))
1480 inner
= TREE_OPERAND (inner
, 0);
1481 else if (TREE_CONSTANT (TREE_OPERAND (inner
, 0)))
1482 inner
= TREE_OPERAND (inner
, 1);
1493 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
1494 SAVE_EXPR. Return FALSE otherwise. */
1500 return TREE_CODE (skip_simple_arithmetic (expr
)) == SAVE_EXPR
;
1503 /* Arrange for an expression to be expanded multiple independent
1504 times. This is useful for cleanup actions, as the backend can
1505 expand them multiple times in different places. */
1513 /* If this is already protected, no sense in protecting it again. */
1514 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
1517 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
1518 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
1522 /* Returns the index of the first non-tree operand for CODE, or the number
1523 of operands if all are trees. */
1527 enum tree_code code
;
1533 case GOTO_SUBROUTINE_EXPR
:
1536 case WITH_CLEANUP_EXPR
:
1538 case METHOD_CALL_EXPR
:
1541 return TREE_CODE_LENGTH (code
);
1545 /* Return which tree structure is used by T. */
1547 enum tree_node_structure_enum
1548 tree_node_structure (t
)
1551 enum tree_code code
= TREE_CODE (t
);
1553 switch (TREE_CODE_CLASS (code
))
1555 case 'd': return TS_DECL
;
1556 case 't': return TS_TYPE
;
1557 case 'b': return TS_BLOCK
;
1558 case 'r': case '<': case '1': case '2': case 'e': case 's':
1560 default: /* 'c' and 'x' */
1566 case INTEGER_CST
: return TS_INT_CST
;
1567 case REAL_CST
: return TS_REAL_CST
;
1568 case COMPLEX_CST
: return TS_COMPLEX
;
1569 case VECTOR_CST
: return TS_VECTOR
;
1570 case STRING_CST
: return TS_STRING
;
1572 case ERROR_MARK
: return TS_COMMON
;
1573 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1574 case TREE_LIST
: return TS_LIST
;
1575 case TREE_VEC
: return TS_VEC
;
1576 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1583 /* Perform any modifications to EXPR required when it is unsaved. Does
1584 not recurse into EXPR's subtrees. */
1587 unsave_expr_1 (expr
)
1590 switch (TREE_CODE (expr
))
1593 if (! SAVE_EXPR_PERSISTENT_P (expr
))
1594 SAVE_EXPR_RTL (expr
) = 0;
1598 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1599 It's OK for this to happen if it was part of a subtree that
1600 isn't immediately expanded, such as operand 2 of another
1602 if (TREE_OPERAND (expr
, 1))
1605 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
1606 TREE_OPERAND (expr
, 3) = NULL_TREE
;
1610 /* I don't yet know how to emit a sequence multiple times. */
1611 if (RTL_EXPR_SEQUENCE (expr
) != 0)
1620 /* Default lang hook for "unsave_expr_now". */
1623 lhd_unsave_expr_now (expr
)
1626 enum tree_code code
;
1628 /* There's nothing to do for NULL_TREE. */
1632 unsave_expr_1 (expr
);
1634 code
= TREE_CODE (expr
);
1635 switch (TREE_CODE_CLASS (code
))
1637 case 'c': /* a constant */
1638 case 't': /* a type node */
1639 case 'd': /* A decl node */
1640 case 'b': /* A block node */
1643 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1644 if (code
== TREE_LIST
)
1646 lhd_unsave_expr_now (TREE_VALUE (expr
));
1647 lhd_unsave_expr_now (TREE_CHAIN (expr
));
1651 case 'e': /* an expression */
1652 case 'r': /* a reference */
1653 case 's': /* an expression with side effects */
1654 case '<': /* a comparison expression */
1655 case '2': /* a binary arithmetic expression */
1656 case '1': /* a unary arithmetic expression */
1660 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
1661 lhd_unsave_expr_now (TREE_OPERAND (expr
, i
));
1672 /* Return 0 if it is safe to evaluate EXPR multiple times,
1673 return 1 if it is safe if EXPR is unsaved afterward, or
1674 return 2 if it is completely unsafe.
1676 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1677 an expression tree, so that it safe to unsave them and the surrounding
1678 context will be correct.
1680 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1681 occasionally across the whole of a function. It is therefore only
1682 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1683 below the UNSAVE_EXPR.
1685 RTL_EXPRs consume their rtl during evaluation. It is therefore
1686 never possible to unsave them. */
1689 unsafe_for_reeval (expr
)
1693 enum tree_code code
;
1698 if (expr
== NULL_TREE
)
1701 code
= TREE_CODE (expr
);
1702 first_rtl
= first_rtl_op (code
);
1711 for (exp
= expr
; exp
!= 0; exp
= TREE_CHAIN (exp
))
1713 tmp
= unsafe_for_reeval (TREE_VALUE (exp
));
1714 unsafeness
= MAX (tmp
, unsafeness
);
1720 tmp2
= unsafe_for_reeval (TREE_OPERAND (expr
, 0));
1721 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, 1));
1722 return MAX (MAX (tmp
, 1), tmp2
);
1729 tmp
= (*lang_hooks
.unsafe_for_reeval
) (expr
);
1735 switch (TREE_CODE_CLASS (code
))
1737 case 'c': /* a constant */
1738 case 't': /* a type node */
1739 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1740 case 'd': /* A decl node */
1741 case 'b': /* A block node */
1744 case 'e': /* an expression */
1745 case 'r': /* a reference */
1746 case 's': /* an expression with side effects */
1747 case '<': /* a comparison expression */
1748 case '2': /* a binary arithmetic expression */
1749 case '1': /* a unary arithmetic expression */
1750 for (i
= first_rtl
- 1; i
>= 0; i
--)
1752 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, i
));
1753 unsafeness
= MAX (tmp
, unsafeness
);
1763 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1764 or offset that depends on a field within a record. */
1767 contains_placeholder_p (exp
)
1770 enum tree_code code
;
1776 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1777 in it since it is supplying a value for it. */
1778 code
= TREE_CODE (exp
);
1779 if (code
== WITH_RECORD_EXPR
)
1781 else if (code
== PLACEHOLDER_EXPR
)
1784 switch (TREE_CODE_CLASS (code
))
1787 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1788 position computations since they will be converted into a
1789 WITH_RECORD_EXPR involving the reference, which will assume
1790 here will be valid. */
1791 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1794 if (code
== TREE_LIST
)
1795 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
1796 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
1805 /* Ignoring the first operand isn't quite right, but works best. */
1806 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1813 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1814 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
1815 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
1818 /* If we already know this doesn't have a placeholder, don't
1820 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
1823 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
1824 result
= CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1826 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
1831 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1837 switch (TREE_CODE_LENGTH (code
))
1840 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1842 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1843 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
1854 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1855 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1859 type_contains_placeholder_p (type
)
1862 /* If the size contains a placeholder or the parent type (component type in
1863 the case of arrays) type involves a placeholder, this type does. */
1864 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1865 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
1866 || (TREE_TYPE (type
) != 0
1867 && type_contains_placeholder_p (TREE_TYPE (type
))))
1870 /* Now do type-specific checks. Note that the last part of the check above
1871 greatly limits what we have to do below. */
1872 switch (TREE_CODE (type
))
1882 case REFERENCE_TYPE
:
1890 /* Here we just check the bounds. */
1891 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
1892 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
1896 /* We're already checked the component type (TREE_TYPE), so just check
1898 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
1902 case QUAL_UNION_TYPE
:
1904 static tree seen_types
= 0;
1908 /* We have to be careful here that we don't end up in infinite
1909 recursions due to a field of a type being a pointer to that type
1910 or to a mutually-recursive type. So we store a list of record
1911 types that we've seen and see if this type is in them. To save
1912 memory, we don't use a list for just one type. Here we check
1913 whether we've seen this type before and store it if not. */
1914 if (seen_types
== 0)
1916 else if (TREE_CODE (seen_types
) != TREE_LIST
)
1918 if (seen_types
== type
)
1921 seen_types
= tree_cons (NULL_TREE
, type
,
1922 build_tree_list (NULL_TREE
, seen_types
));
1926 if (value_member (type
, seen_types
) != 0)
1929 seen_types
= tree_cons (NULL_TREE
, type
, seen_types
);
1932 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1933 if (TREE_CODE (field
) == FIELD_DECL
1934 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
1935 || (TREE_CODE (type
) == QUAL_UNION_TYPE
1936 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
1937 || type_contains_placeholder_p (TREE_TYPE (field
))))
1943 /* Now remove us from seen_types and return the result. */
1944 if (seen_types
== type
)
1947 seen_types
= TREE_CHAIN (seen_types
);
1957 /* Return 1 if EXP contains any expressions that produce cleanups for an
1958 outer scope to deal with. Used by fold. */
1966 if (! TREE_SIDE_EFFECTS (exp
))
1969 switch (TREE_CODE (exp
))
1972 case GOTO_SUBROUTINE_EXPR
:
1973 case WITH_CLEANUP_EXPR
:
1976 case CLEANUP_POINT_EXPR
:
1980 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
1982 cmp
= has_cleanups (TREE_VALUE (exp
));
1992 /* This general rule works for most tree codes. All exceptions should be
1993 handled above. If this is a language-specific tree code, we can't
1994 trust what might be in the operand, so say we don't know
1996 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
1999 nops
= first_rtl_op (TREE_CODE (exp
));
2000 for (i
= 0; i
< nops
; i
++)
2001 if (TREE_OPERAND (exp
, i
) != 0)
2003 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
2004 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
2005 || type
== 'r' || type
== 's')
2007 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
2016 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
2017 return a tree with all occurrences of references to F in a
2018 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2019 contains only arithmetic expressions or a CALL_EXPR with a
2020 PLACEHOLDER_EXPR occurring only in its arglist. */
2023 substitute_in_expr (exp
, f
, r
)
2028 enum tree_code code
= TREE_CODE (exp
);
2033 switch (TREE_CODE_CLASS (code
))
2040 if (code
== PLACEHOLDER_EXPR
)
2042 else if (code
== TREE_LIST
)
2044 op0
= (TREE_CHAIN (exp
) == 0
2045 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
2046 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
2047 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2050 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2059 switch (TREE_CODE_LENGTH (code
))
2062 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2063 if (op0
== TREE_OPERAND (exp
, 0))
2066 if (code
== NON_LVALUE_EXPR
)
2069 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2073 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2074 could, but we don't support it. */
2075 if (code
== RTL_EXPR
)
2077 else if (code
== CONSTRUCTOR
)
2080 op0
= TREE_OPERAND (exp
, 0);
2081 op1
= TREE_OPERAND (exp
, 1);
2082 if (CONTAINS_PLACEHOLDER_P (op0
))
2083 op0
= substitute_in_expr (op0
, f
, r
);
2084 if (CONTAINS_PLACEHOLDER_P (op1
))
2085 op1
= substitute_in_expr (op1
, f
, r
);
2087 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2090 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
2094 /* It cannot be that anything inside a SAVE_EXPR contains a
2095 PLACEHOLDER_EXPR. */
2096 if (code
== SAVE_EXPR
)
2099 else if (code
== CALL_EXPR
)
2101 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2102 if (op1
== TREE_OPERAND (exp
, 1))
2105 return build (code
, TREE_TYPE (exp
),
2106 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
2109 else if (code
!= COND_EXPR
)
2112 op0
= TREE_OPERAND (exp
, 0);
2113 op1
= TREE_OPERAND (exp
, 1);
2114 op2
= TREE_OPERAND (exp
, 2);
2116 if (CONTAINS_PLACEHOLDER_P (op0
))
2117 op0
= substitute_in_expr (op0
, f
, r
);
2118 if (CONTAINS_PLACEHOLDER_P (op1
))
2119 op1
= substitute_in_expr (op1
, f
, r
);
2120 if (CONTAINS_PLACEHOLDER_P (op2
))
2121 op2
= substitute_in_expr (op2
, f
, r
);
2123 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2124 && op2
== TREE_OPERAND (exp
, 2))
2127 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2140 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2141 and it is the right field, replace it with R. */
2142 for (inner
= TREE_OPERAND (exp
, 0);
2143 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2144 inner
= TREE_OPERAND (inner
, 0))
2146 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2147 && TREE_OPERAND (exp
, 1) == f
)
2150 /* If this expression hasn't been completed let, leave it
2152 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2153 && TREE_TYPE (inner
) == 0)
2156 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2157 if (op0
== TREE_OPERAND (exp
, 0))
2160 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2161 TREE_OPERAND (exp
, 1)));
2165 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2166 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2167 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2168 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2169 && op2
== TREE_OPERAND (exp
, 2))
2172 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2177 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2178 if (op0
== TREE_OPERAND (exp
, 0))
2181 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2193 TREE_READONLY (new) = TREE_READONLY (exp
);
2197 /* Stabilize a reference so that we can use it any number of times
2198 without causing its operands to be evaluated more than once.
2199 Returns the stabilized reference. This works by means of save_expr,
2200 so see the caveats in the comments about save_expr.
2202 Also allows conversion expressions whose operands are references.
2203 Any other kind of expression is returned unchanged. */
2206 stabilize_reference (ref
)
2210 enum tree_code code
= TREE_CODE (ref
);
2217 /* No action is needed in this case. */
2223 case FIX_TRUNC_EXPR
:
2224 case FIX_FLOOR_EXPR
:
2225 case FIX_ROUND_EXPR
:
2227 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2231 result
= build_nt (INDIRECT_REF
,
2232 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2236 result
= build_nt (COMPONENT_REF
,
2237 stabilize_reference (TREE_OPERAND (ref
, 0)),
2238 TREE_OPERAND (ref
, 1));
2242 result
= build_nt (BIT_FIELD_REF
,
2243 stabilize_reference (TREE_OPERAND (ref
, 0)),
2244 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2245 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2249 result
= build_nt (ARRAY_REF
,
2250 stabilize_reference (TREE_OPERAND (ref
, 0)),
2251 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2254 case ARRAY_RANGE_REF
:
2255 result
= build_nt (ARRAY_RANGE_REF
,
2256 stabilize_reference (TREE_OPERAND (ref
, 0)),
2257 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2261 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2262 it wouldn't be ignored. This matters when dealing with
2264 return stabilize_reference_1 (ref
);
2267 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2268 save_expr (build1 (ADDR_EXPR
,
2269 build_pointer_type (TREE_TYPE (ref
)),
2273 /* If arg isn't a kind of lvalue we recognize, make no change.
2274 Caller should recognize the error for an invalid lvalue. */
2279 return error_mark_node
;
2282 TREE_TYPE (result
) = TREE_TYPE (ref
);
2283 TREE_READONLY (result
) = TREE_READONLY (ref
);
2284 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2285 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2290 /* Subroutine of stabilize_reference; this is called for subtrees of
2291 references. Any expression with side-effects must be put in a SAVE_EXPR
2292 to ensure that it is only evaluated once.
2294 We don't put SAVE_EXPR nodes around everything, because assigning very
2295 simple expressions to temporaries causes us to miss good opportunities
2296 for optimizations. Among other things, the opportunity to fold in the
2297 addition of a constant into an addressing mode often gets lost, e.g.
2298 "y[i+1] += x;". In general, we take the approach that we should not make
2299 an assignment unless we are forced into it - i.e., that any non-side effect
2300 operator should be allowed, and that cse should take care of coalescing
2301 multiple utterances of the same expression should that prove fruitful. */
2304 stabilize_reference_1 (e
)
2308 enum tree_code code
= TREE_CODE (e
);
2310 /* We cannot ignore const expressions because it might be a reference
2311 to a const array but whose index contains side-effects. But we can
2312 ignore things that are actual constant or that already have been
2313 handled by this function. */
2315 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2318 switch (TREE_CODE_CLASS (code
))
2328 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2329 so that it will only be evaluated once. */
2330 /* The reference (r) and comparison (<) classes could be handled as
2331 below, but it is generally faster to only evaluate them once. */
2332 if (TREE_SIDE_EFFECTS (e
))
2333 return save_expr (e
);
2337 /* Constants need no processing. In fact, we should never reach
2342 /* Division is slow and tends to be compiled with jumps,
2343 especially the division by powers of 2 that is often
2344 found inside of an array reference. So do it just once. */
2345 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2346 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2347 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2348 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2349 return save_expr (e
);
2350 /* Recursively stabilize each operand. */
2351 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2352 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2356 /* Recursively stabilize each operand. */
2357 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2364 TREE_TYPE (result
) = TREE_TYPE (e
);
2365 TREE_READONLY (result
) = TREE_READONLY (e
);
2366 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2367 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2372 /* Low-level constructors for expressions. */
2374 /* Build an expression of code CODE, data type TYPE,
2375 and operands as specified by the arguments ARG1 and following arguments.
2376 Expressions and reference nodes can be created this way.
2377 Constants, decls, types and misc nodes cannot be. */
2380 build (enum tree_code code
, tree tt
, ...)
2391 t
= make_node (code
);
2392 length
= TREE_CODE_LENGTH (code
);
2395 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2396 result based on those same flags for the arguments. But if the
2397 arguments aren't really even `tree' expressions, we shouldn't be trying
2399 fro
= first_rtl_op (code
);
2401 /* Expressions without side effects may be constant if their
2402 arguments are as well. */
2403 constant
= (TREE_CODE_CLASS (code
) == '<'
2404 || TREE_CODE_CLASS (code
) == '1'
2405 || TREE_CODE_CLASS (code
) == '2'
2406 || TREE_CODE_CLASS (code
) == 'c');
2410 /* This is equivalent to the loop below, but faster. */
2411 tree arg0
= va_arg (p
, tree
);
2412 tree arg1
= va_arg (p
, tree
);
2414 TREE_OPERAND (t
, 0) = arg0
;
2415 TREE_OPERAND (t
, 1) = arg1
;
2416 TREE_READONLY (t
) = 1;
2417 if (arg0
&& fro
> 0)
2419 if (TREE_SIDE_EFFECTS (arg0
))
2420 TREE_SIDE_EFFECTS (t
) = 1;
2421 if (!TREE_READONLY (arg0
))
2422 TREE_READONLY (t
) = 0;
2423 if (!TREE_CONSTANT (arg0
))
2427 if (arg1
&& fro
> 1)
2429 if (TREE_SIDE_EFFECTS (arg1
))
2430 TREE_SIDE_EFFECTS (t
) = 1;
2431 if (!TREE_READONLY (arg1
))
2432 TREE_READONLY (t
) = 0;
2433 if (!TREE_CONSTANT (arg1
))
2437 else if (length
== 1)
2439 tree arg0
= va_arg (p
, tree
);
2441 /* The only one-operand cases we handle here are those with side-effects.
2442 Others are handled with build1. So don't bother checked if the
2443 arg has side-effects since we'll already have set it.
2445 ??? This really should use build1 too. */
2446 if (TREE_CODE_CLASS (code
) != 's')
2448 TREE_OPERAND (t
, 0) = arg0
;
2452 for (i
= 0; i
< length
; i
++)
2454 tree operand
= va_arg (p
, tree
);
2456 TREE_OPERAND (t
, i
) = operand
;
2457 if (operand
&& fro
> i
)
2459 if (TREE_SIDE_EFFECTS (operand
))
2460 TREE_SIDE_EFFECTS (t
) = 1;
2461 if (!TREE_CONSTANT (operand
))
2468 TREE_CONSTANT (t
) = constant
;
2472 /* Same as above, but only builds for unary operators.
2473 Saves lions share of calls to `build'; cuts down use
2474 of varargs, which is expensive for RISC machines. */
2477 build1 (code
, type
, node
)
2478 enum tree_code code
;
2482 int length
= sizeof (struct tree_exp
);
2483 #ifdef GATHER_STATISTICS
2484 tree_node_kind kind
;
2488 #ifdef GATHER_STATISTICS
2489 switch (TREE_CODE_CLASS (code
))
2491 case 's': /* an expression with side effects */
2494 case 'r': /* a reference */
2502 tree_node_counts
[(int) kind
]++;
2503 tree_node_sizes
[(int) kind
] += length
;
2506 #ifdef ENABLE_CHECKING
2507 if (TREE_CODE_CLASS (code
) == '2'
2508 || TREE_CODE_CLASS (code
) == '<'
2509 || TREE_CODE_LENGTH (code
) != 1)
2511 #endif /* ENABLE_CHECKING */
2513 t
= ggc_alloc_tree (length
);
2515 memset (t
, 0, sizeof (struct tree_common
));
2517 TREE_SET_CODE (t
, code
);
2519 TREE_TYPE (t
) = type
;
2520 TREE_COMPLEXITY (t
) = 0;
2521 TREE_OPERAND (t
, 0) = node
;
2522 if (node
&& first_rtl_op (code
) != 0)
2524 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2525 TREE_READONLY (t
) = TREE_READONLY (node
);
2528 if (TREE_CODE_CLASS (code
) == 's')
2529 TREE_SIDE_EFFECTS (t
) = 1;
2536 case PREDECREMENT_EXPR
:
2537 case PREINCREMENT_EXPR
:
2538 case POSTDECREMENT_EXPR
:
2539 case POSTINCREMENT_EXPR
:
2540 /* All of these have side-effects, no matter what their
2542 TREE_SIDE_EFFECTS (t
) = 1;
2543 TREE_READONLY (t
) = 0;
2547 /* Whether a dereference is readonly has nothing to do with whether
2548 its operand is readonly. */
2549 TREE_READONLY (t
) = 0;
2553 if (TREE_CODE_CLASS (code
) == '1' && node
&& TREE_CONSTANT (node
))
2554 TREE_CONSTANT (t
) = 1;
2561 /* Similar except don't specify the TREE_TYPE
2562 and leave the TREE_SIDE_EFFECTS as 0.
2563 It is permissible for arguments to be null,
2564 or even garbage if their values do not matter. */
2567 build_nt (enum tree_code code
, ...)
2576 t
= make_node (code
);
2577 length
= TREE_CODE_LENGTH (code
);
2579 for (i
= 0; i
< length
; i
++)
2580 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2586 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2587 We do NOT enter this node in any sort of symbol table.
2589 layout_decl is used to set up the decl's storage layout.
2590 Other slots are initialized to 0 or null pointers. */
2593 build_decl (code
, name
, type
)
2594 enum tree_code code
;
2599 t
= make_node (code
);
2601 /* if (type == error_mark_node)
2602 type = integer_type_node; */
2603 /* That is not done, deliberately, so that having error_mark_node
2604 as the type can suppress useless errors in the use of this variable. */
2606 DECL_NAME (t
) = name
;
2607 TREE_TYPE (t
) = type
;
2609 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2611 else if (code
== FUNCTION_DECL
)
2612 DECL_MODE (t
) = FUNCTION_MODE
;
2617 /* BLOCK nodes are used to represent the structure of binding contours
2618 and declarations, once those contours have been exited and their contents
2619 compiled. This information is used for outputting debugging info. */
2622 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
2623 tree vars
, tags ATTRIBUTE_UNUSED
, subblocks
, supercontext
, chain
;
2625 tree block
= make_node (BLOCK
);
2627 BLOCK_VARS (block
) = vars
;
2628 BLOCK_SUBBLOCKS (block
) = subblocks
;
2629 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2630 BLOCK_CHAIN (block
) = chain
;
2634 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2635 location where an expression or an identifier were encountered. It
2636 is necessary for languages where the frontend parser will handle
2637 recursively more than one file (Java is one of them). */
2640 build_expr_wfl (node
, file
, line
, col
)
2645 static const char *last_file
= 0;
2646 static tree last_filenode
= NULL_TREE
;
2647 tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
2649 EXPR_WFL_NODE (wfl
) = node
;
2650 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
2651 if (file
!= last_file
)
2654 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
2657 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
2660 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
2661 TREE_TYPE (wfl
) = TREE_TYPE (node
);
2667 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2671 build_decl_attribute_variant (ddecl
, attribute
)
2672 tree ddecl
, attribute
;
2674 DECL_ATTRIBUTES (ddecl
) = attribute
;
2678 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2681 Record such modified types already made so we don't make duplicates. */
2684 build_type_attribute_variant (ttype
, attribute
)
2685 tree ttype
, attribute
;
2687 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2689 unsigned int hashcode
;
2692 ntype
= copy_node (ttype
);
2694 TYPE_POINTER_TO (ntype
) = 0;
2695 TYPE_REFERENCE_TO (ntype
) = 0;
2696 TYPE_ATTRIBUTES (ntype
) = attribute
;
2698 /* Create a new main variant of TYPE. */
2699 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2700 TYPE_NEXT_VARIANT (ntype
) = 0;
2701 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2703 hashcode
= (TYPE_HASH (TREE_CODE (ntype
))
2704 + TYPE_HASH (TREE_TYPE (ntype
))
2705 + attribute_hash_list (attribute
));
2707 switch (TREE_CODE (ntype
))
2710 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
2713 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
2716 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
2719 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
2725 ntype
= type_hash_canon (hashcode
, ntype
);
2726 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2732 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2735 We try both `text' and `__text__', ATTR may be either one. */
2736 /* ??? It might be a reasonable simplification to require ATTR to be only
2737 `text'. One might then also require attribute lists to be stored in
2738 their canonicalized form. */
2741 is_attribute_p (attr
, ident
)
2745 int ident_len
, attr_len
;
2748 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2751 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2754 p
= IDENTIFIER_POINTER (ident
);
2755 ident_len
= strlen (p
);
2756 attr_len
= strlen (attr
);
2758 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2762 || attr
[attr_len
- 2] != '_'
2763 || attr
[attr_len
- 1] != '_')
2765 if (ident_len
== attr_len
- 4
2766 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2771 if (ident_len
== attr_len
+ 4
2772 && p
[0] == '_' && p
[1] == '_'
2773 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2774 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2781 /* Given an attribute name and a list of attributes, return a pointer to the
2782 attribute's list element if the attribute is part of the list, or NULL_TREE
2783 if not found. If the attribute appears more than once, this only
2784 returns the first occurrence; the TREE_CHAIN of the return value should
2785 be passed back in if further occurrences are wanted. */
2788 lookup_attribute (attr_name
, list
)
2789 const char *attr_name
;
2794 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2796 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
2798 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2805 /* Return an attribute list that is the union of a1 and a2. */
2808 merge_attributes (a1
, a2
)
2813 /* Either one unset? Take the set one. */
2815 if ((attributes
= a1
) == 0)
2818 /* One that completely contains the other? Take it. */
2820 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2822 if (attribute_list_contained (a2
, a1
))
2826 /* Pick the longest list, and hang on the other list. */
2828 if (list_length (a1
) < list_length (a2
))
2829 attributes
= a2
, a2
= a1
;
2831 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
2834 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2837 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2840 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
2845 a1
= copy_node (a2
);
2846 TREE_CHAIN (a1
) = attributes
;
2855 /* Given types T1 and T2, merge their attributes and return
2859 merge_type_attributes (t1
, t2
)
2862 return merge_attributes (TYPE_ATTRIBUTES (t1
),
2863 TYPE_ATTRIBUTES (t2
));
2866 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2870 merge_decl_attributes (olddecl
, newdecl
)
2871 tree olddecl
, newdecl
;
2873 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
2874 DECL_ATTRIBUTES (newdecl
));
2877 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2879 /* Specialization of merge_decl_attributes for various Windows targets.
2881 This handles the following situation:
2883 __declspec (dllimport) int foo;
2886 The second instance of `foo' nullifies the dllimport. */
2889 merge_dllimport_decl_attributes (old
, new)
2894 int delete_dllimport_p
;
2896 old
= DECL_ATTRIBUTES (old
);
2897 new = DECL_ATTRIBUTES (new);
2899 /* What we need to do here is remove from `old' dllimport if it doesn't
2900 appear in `new'. dllimport behaves like extern: if a declaration is
2901 marked dllimport and a definition appears later, then the object
2902 is not dllimport'd. */
2903 if (lookup_attribute ("dllimport", old
) != NULL_TREE
2904 && lookup_attribute ("dllimport", new) == NULL_TREE
)
2905 delete_dllimport_p
= 1;
2907 delete_dllimport_p
= 0;
2909 a
= merge_attributes (old
, new);
2911 if (delete_dllimport_p
)
2915 /* Scan the list for dllimport and delete it. */
2916 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
2918 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
2920 if (prev
== NULL_TREE
)
2923 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
2932 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2934 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2935 of the various TYPE_QUAL values. */
2938 set_type_quals (type
, type_quals
)
2942 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
2943 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
2944 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
2947 /* Return a version of the TYPE, qualified as indicated by the
2948 TYPE_QUALS, if one exists. If no qualified version exists yet,
2949 return NULL_TREE. */
2952 get_qualified_type (type
, type_quals
)
2958 /* Search the chain of variants to see if there is already one there just
2959 like the one we need to have. If so, use that existing one. We must
2960 preserve the TYPE_NAME, since there is code that depends on this. */
2961 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2962 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
)
2963 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
))
2969 /* Like get_qualified_type, but creates the type if it does not
2970 exist. This function never returns NULL_TREE. */
2973 build_qualified_type (type
, type_quals
)
2979 /* See if we already have the appropriate qualified variant. */
2980 t
= get_qualified_type (type
, type_quals
);
2982 /* If not, build it. */
2985 t
= build_type_copy (type
);
2986 set_type_quals (t
, type_quals
);
2992 /* Create a new variant of TYPE, equivalent but distinct.
2993 This is so the caller can modify it. */
2996 build_type_copy (type
)
2999 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3001 t
= copy_node (type
);
3003 TYPE_POINTER_TO (t
) = 0;
3004 TYPE_REFERENCE_TO (t
) = 0;
3006 /* Add this type to the chain of variants of TYPE. */
3007 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3008 TYPE_NEXT_VARIANT (m
) = t
;
3013 /* Hashing of types so that we don't make duplicates.
3014 The entry point is `type_hash_canon'. */
3016 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3017 with types in the TREE_VALUE slots), by adding the hash codes
3018 of the individual types. */
3021 type_hash_list (list
)
3024 unsigned int hashcode
;
3027 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3028 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
3033 /* These are the Hashtable callback functions. */
3035 /* Returns true if the types are equal. */
3038 type_hash_eq (va
, vb
)
3042 const struct type_hash
*a
= va
, *b
= vb
;
3043 if (a
->hash
== b
->hash
3044 && TREE_CODE (a
->type
) == TREE_CODE (b
->type
)
3045 && TREE_TYPE (a
->type
) == TREE_TYPE (b
->type
)
3046 && attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3047 TYPE_ATTRIBUTES (b
->type
))
3048 && TYPE_ALIGN (a
->type
) == TYPE_ALIGN (b
->type
)
3049 && (TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3050 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3051 TYPE_MAX_VALUE (b
->type
)))
3052 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3053 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3054 TYPE_MIN_VALUE (b
->type
)))
3055 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3056 && (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
3057 || (TYPE_DOMAIN (a
->type
)
3058 && TREE_CODE (TYPE_DOMAIN (a
->type
)) == TREE_LIST
3059 && TYPE_DOMAIN (b
->type
)
3060 && TREE_CODE (TYPE_DOMAIN (b
->type
)) == TREE_LIST
3061 && type_list_equal (TYPE_DOMAIN (a
->type
),
3062 TYPE_DOMAIN (b
->type
)))))
3067 /* Return the cached hash value. */
3070 type_hash_hash (item
)
3073 return ((const struct type_hash
*) item
)->hash
;
3076 /* Look in the type hash table for a type isomorphic to TYPE.
3077 If one is found, return it. Otherwise return 0. */
3080 type_hash_lookup (hashcode
, type
)
3081 unsigned int hashcode
;
3084 struct type_hash
*h
, in
;
3086 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3087 must call that routine before comparing TYPE_ALIGNs. */
3093 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3099 /* Add an entry to the type-hash-table
3100 for a type TYPE whose hash code is HASHCODE. */
3103 type_hash_add (hashcode
, type
)
3104 unsigned int hashcode
;
3107 struct type_hash
*h
;
3110 h
= (struct type_hash
*) ggc_alloc (sizeof (struct type_hash
));
3113 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3114 *(struct type_hash
**) loc
= h
;
3117 /* Given TYPE, and HASHCODE its hash code, return the canonical
3118 object for an identical type if one already exists.
3119 Otherwise, return TYPE, and record it as the canonical object
3120 if it is a permanent object.
3122 To use this function, first create a type of the sort you want.
3123 Then compute its hash code from the fields of the type that
3124 make it different from other similar types.
3125 Then call this function and use the value.
3126 This function frees the type you pass in if it is a duplicate. */
3128 /* Set to 1 to debug without canonicalization. Never set by program. */
3129 int debug_no_type_hash
= 0;
3132 type_hash_canon (hashcode
, type
)
3133 unsigned int hashcode
;
3138 if (debug_no_type_hash
)
3141 /* See if the type is in the hash table already. If so, return it.
3142 Otherwise, add the type. */
3143 t1
= type_hash_lookup (hashcode
, type
);
3146 #ifdef GATHER_STATISTICS
3147 tree_node_counts
[(int) t_kind
]--;
3148 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3154 type_hash_add (hashcode
, type
);
3159 /* See if the data pointed to by the type hash table is marked. We consider
3160 it marked if the type is marked or if a debug type number or symbol
3161 table entry has been made for the type. This reduces the amount of
3162 debugging output and eliminates that dependency of the debug output on
3163 the number of garbage collections. */
3166 type_hash_marked_p (p
)
3169 tree type
= ((struct type_hash
*) p
)->type
;
3171 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3175 print_type_hash_statistics ()
3177 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3178 (long) htab_size (type_hash_table
),
3179 (long) htab_elements (type_hash_table
),
3180 htab_collisions (type_hash_table
));
3183 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3184 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3185 by adding the hash codes of the individual attributes. */
3188 attribute_hash_list (list
)
3191 unsigned int hashcode
;
3194 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3195 /* ??? Do we want to add in TREE_VALUE too? */
3196 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3200 /* Given two lists of attributes, return true if list l2 is
3201 equivalent to l1. */
3204 attribute_list_equal (l1
, l2
)
3207 return attribute_list_contained (l1
, l2
)
3208 && attribute_list_contained (l2
, l1
);
3211 /* Given two lists of attributes, return true if list L2 is
3212 completely contained within L1. */
3213 /* ??? This would be faster if attribute names were stored in a canonicalized
3214 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3215 must be used to show these elements are equivalent (which they are). */
3216 /* ??? It's not clear that attributes with arguments will always be handled
3220 attribute_list_contained (l1
, l2
)
3225 /* First check the obvious, maybe the lists are identical. */
3229 /* Maybe the lists are similar. */
3230 for (t1
= l1
, t2
= l2
;
3232 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3233 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3234 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3236 /* Maybe the lists are equal. */
3237 if (t1
== 0 && t2
== 0)
3240 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3243 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3245 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3248 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3255 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3262 /* Given two lists of types
3263 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3264 return 1 if the lists contain the same types in the same order.
3265 Also, the TREE_PURPOSEs must match. */
3268 type_list_equal (l1
, l2
)
3273 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3274 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3275 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3276 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3277 && (TREE_TYPE (TREE_PURPOSE (t1
))
3278 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3284 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3285 given by TYPE. If the argument list accepts variable arguments,
3286 then this function counts only the ordinary arguments. */
3289 type_num_arguments (type
)
3295 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3296 /* If the function does not take a variable number of arguments,
3297 the last element in the list will have type `void'. */
3298 if (VOID_TYPE_P (TREE_VALUE (t
)))
3306 /* Nonzero if integer constants T1 and T2
3307 represent the same constant value. */
3310 tree_int_cst_equal (t1
, t2
)
3316 if (t1
== 0 || t2
== 0)
3319 if (TREE_CODE (t1
) == INTEGER_CST
3320 && TREE_CODE (t2
) == INTEGER_CST
3321 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3322 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3328 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3329 The precise way of comparison depends on their data type. */
3332 tree_int_cst_lt (t1
, t2
)
3338 if (TREE_UNSIGNED (TREE_TYPE (t1
)) != TREE_UNSIGNED (TREE_TYPE (t2
)))
3340 int t1_sgn
= tree_int_cst_sgn (t1
);
3341 int t2_sgn
= tree_int_cst_sgn (t2
);
3343 if (t1_sgn
< t2_sgn
)
3345 else if (t1_sgn
> t2_sgn
)
3347 /* Otherwise, both are non-negative, so we compare them as
3348 unsigned just in case one of them would overflow a signed
3351 else if (! TREE_UNSIGNED (TREE_TYPE (t1
)))
3352 return INT_CST_LT (t1
, t2
);
3354 return INT_CST_LT_UNSIGNED (t1
, t2
);
3357 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3360 tree_int_cst_compare (t1
, t2
)
3364 if (tree_int_cst_lt (t1
, t2
))
3366 else if (tree_int_cst_lt (t2
, t1
))
3372 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3373 the host. If POS is zero, the value can be represented in a single
3374 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3375 be represented in a single unsigned HOST_WIDE_INT. */
3378 host_integerp (t
, pos
)
3382 return (TREE_CODE (t
) == INTEGER_CST
3383 && ! TREE_OVERFLOW (t
)
3384 && ((TREE_INT_CST_HIGH (t
) == 0
3385 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3386 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3387 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3388 && ! TREE_UNSIGNED (TREE_TYPE (t
)))
3389 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3392 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3393 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3394 be positive. Abort if we cannot satisfy the above conditions. */
3397 tree_low_cst (t
, pos
)
3401 if (host_integerp (t
, pos
))
3402 return TREE_INT_CST_LOW (t
);
3407 /* Return the most significant bit of the integer constant T. */
3410 tree_int_cst_msb (t
)
3415 unsigned HOST_WIDE_INT l
;
3417 /* Note that using TYPE_PRECISION here is wrong. We care about the
3418 actual bits, not the (arbitrary) range of the type. */
3419 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3420 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3421 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3422 return (l
& 1) == 1;
3425 /* Return an indication of the sign of the integer constant T.
3426 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3427 Note that -1 will never be returned it T's type is unsigned. */
3430 tree_int_cst_sgn (t
)
3433 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3435 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3437 else if (TREE_INT_CST_HIGH (t
) < 0)
3443 /* Compare two constructor-element-type constants. Return 1 if the lists
3444 are known to be equal; otherwise return 0. */
3447 simple_cst_list_equal (l1
, l2
)
3450 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3452 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3455 l1
= TREE_CHAIN (l1
);
3456 l2
= TREE_CHAIN (l2
);
3462 /* Return truthvalue of whether T1 is the same tree structure as T2.
3463 Return 1 if they are the same.
3464 Return 0 if they are understandably different.
3465 Return -1 if either contains tree structure not understood by
3469 simple_cst_equal (t1
, t2
)
3472 enum tree_code code1
, code2
;
3478 if (t1
== 0 || t2
== 0)
3481 code1
= TREE_CODE (t1
);
3482 code2
= TREE_CODE (t2
);
3484 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3486 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3487 || code2
== NON_LVALUE_EXPR
)
3488 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3490 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3493 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3494 || code2
== NON_LVALUE_EXPR
)
3495 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3503 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3504 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3507 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3510 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3511 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3512 TREE_STRING_LENGTH (t1
)));
3515 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
3521 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3524 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3528 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3531 /* Special case: if either target is an unallocated VAR_DECL,
3532 it means that it's going to be unified with whatever the
3533 TARGET_EXPR is really supposed to initialize, so treat it
3534 as being equivalent to anything. */
3535 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3536 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3537 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3538 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3539 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3540 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3543 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3548 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3550 case WITH_CLEANUP_EXPR
:
3551 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3555 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3558 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3559 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3573 /* This general rule works for most tree codes. All exceptions should be
3574 handled above. If this is a language-specific tree code, we can't
3575 trust what might be in the operand, so say we don't know
3577 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3580 switch (TREE_CODE_CLASS (code1
))
3589 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3591 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3603 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3604 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3605 than U, respectively. */
3608 compare_tree_int (t
, u
)
3610 unsigned HOST_WIDE_INT u
;
3612 if (tree_int_cst_sgn (t
) < 0)
3614 else if (TREE_INT_CST_HIGH (t
) != 0)
3616 else if (TREE_INT_CST_LOW (t
) == u
)
3618 else if (TREE_INT_CST_LOW (t
) < u
)
3624 /* Generate a hash value for an expression. This can be used iteratively
3625 by passing a previous result as the "val" argument.
3627 This function is intended to produce the same hash for expressions which
3628 would compare equal using operand_equal_p. */
3631 iterative_hash_expr (tree t
, hashval_t val
)
3634 enum tree_code code
;
3638 return iterative_hash_object (t
, val
);
3640 code
= TREE_CODE (t
);
3641 class = TREE_CODE_CLASS (code
);
3645 /* Decls we can just compare by pointer. */
3646 val
= iterative_hash_object (t
, val
);
3648 else if (class == 'c')
3650 /* Alas, constants aren't shared, so we can't rely on pointer
3652 if (code
== INTEGER_CST
)
3654 val
= iterative_hash_object (TREE_INT_CST_LOW (t
), val
);
3655 val
= iterative_hash_object (TREE_INT_CST_HIGH (t
), val
);
3657 else if (code
== REAL_CST
)
3658 val
= iterative_hash (TREE_REAL_CST_PTR (t
),
3659 sizeof (REAL_VALUE_TYPE
), val
);
3660 else if (code
== STRING_CST
)
3661 val
= iterative_hash (TREE_STRING_POINTER (t
),
3662 TREE_STRING_LENGTH (t
), val
);
3663 else if (code
== COMPLEX_CST
)
3665 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
3666 val
= iterative_hash_expr (TREE_IMAGPART (t
), val
);
3668 else if (code
== VECTOR_CST
)
3669 val
= iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
3673 else if (IS_EXPR_CODE_CLASS (class) || class == 'r')
3675 val
= iterative_hash_object (code
, val
);
3677 if (code
== NOP_EXPR
|| code
== CONVERT_EXPR
3678 || code
== NON_LVALUE_EXPR
)
3679 val
= iterative_hash_object (TREE_TYPE (t
), val
);
3681 if (code
== PLUS_EXPR
|| code
== MULT_EXPR
|| code
== MIN_EXPR
3682 || code
== MAX_EXPR
|| code
== BIT_IOR_EXPR
|| code
== BIT_XOR_EXPR
3683 || code
== BIT_AND_EXPR
|| code
== NE_EXPR
|| code
== EQ_EXPR
)
3685 /* It's a commutative expression. We want to hash it the same
3686 however it appears. We do this by first hashing both operands
3687 and then rehashing based on the order of their independent
3689 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
3690 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
3694 t
= one
, one
= two
, two
= t
;
3696 val
= iterative_hash_object (one
, val
);
3697 val
= iterative_hash_object (two
, val
);
3700 for (i
= first_rtl_op (code
) - 1; i
>= 0; --i
)
3701 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
3703 else if (code
== TREE_LIST
)
3705 /* A list of expressions, for a CALL_EXPR or as the elements of a
3707 for (; t
; t
= TREE_CHAIN (t
))
3708 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
3716 /* Constructors for pointer, array and function types.
3717 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3718 constructed by language-dependent code, not here.) */
3720 /* Construct, lay out and return the type of pointers to TO_TYPE
3721 with mode MODE. If such a type has already been constructed,
3725 build_pointer_type_for_mode (to_type
, mode
)
3727 enum machine_mode mode
;
3729 tree t
= TYPE_POINTER_TO (to_type
);
3731 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3732 if (t
!= 0 && mode
== ptr_mode
)
3735 t
= make_node (POINTER_TYPE
);
3737 TREE_TYPE (t
) = to_type
;
3738 TYPE_MODE (t
) = mode
;
3740 /* Record this type as the pointer to TO_TYPE. */
3741 if (mode
== ptr_mode
)
3742 TYPE_POINTER_TO (to_type
) = t
;
3744 /* Lay out the type. This function has many callers that are concerned
3745 with expression-construction, and this simplifies them all.
3746 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3752 /* By default build pointers in ptr_mode. */
3755 build_pointer_type (to_type
)
3758 return build_pointer_type_for_mode (to_type
, ptr_mode
);
3761 /* Construct, lay out and return the type of references to TO_TYPE
3762 with mode MODE. If such a type has already been constructed,
3766 build_reference_type_for_mode (to_type
, mode
)
3768 enum machine_mode mode
;
3770 tree t
= TYPE_REFERENCE_TO (to_type
);
3772 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3773 if (t
!= 0 && mode
== ptr_mode
)
3776 t
= make_node (REFERENCE_TYPE
);
3778 TREE_TYPE (t
) = to_type
;
3779 TYPE_MODE (t
) = mode
;
3781 /* Record this type as the pointer to TO_TYPE. */
3782 if (mode
== ptr_mode
)
3783 TYPE_REFERENCE_TO (to_type
) = t
;
3791 /* Build the node for the type of references-to-TO_TYPE by default
3795 build_reference_type (to_type
)
3798 return build_reference_type_for_mode (to_type
, ptr_mode
);
3801 /* Build a type that is compatible with t but has no cv quals anywhere
3804 const char *const *const * -> char ***. */
3807 build_type_no_quals (t
)
3810 switch (TREE_CODE (t
))
3813 return build_pointer_type (build_type_no_quals (TREE_TYPE (t
)));
3814 case REFERENCE_TYPE
:
3815 return build_reference_type (build_type_no_quals (TREE_TYPE (t
)));
3817 return TYPE_MAIN_VARIANT (t
);
3821 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3822 MAXVAL should be the maximum value in the domain
3823 (one less than the length of the array).
3825 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3826 We don't enforce this limit, that is up to caller (e.g. language front end).
3827 The limit exists because the result is a signed type and we don't handle
3828 sizes that use more than one HOST_WIDE_INT. */
3831 build_index_type (maxval
)
3834 tree itype
= make_node (INTEGER_TYPE
);
3836 TREE_TYPE (itype
) = sizetype
;
3837 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
3838 TYPE_MIN_VALUE (itype
) = size_zero_node
;
3839 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
3840 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
3841 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
3842 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
3843 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
3844 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
3846 if (host_integerp (maxval
, 1))
3847 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
3852 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3853 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3854 low bound LOWVAL and high bound HIGHVAL.
3855 if TYPE==NULL_TREE, sizetype is used. */
3858 build_range_type (type
, lowval
, highval
)
3859 tree type
, lowval
, highval
;
3861 tree itype
= make_node (INTEGER_TYPE
);
3863 TREE_TYPE (itype
) = type
;
3864 if (type
== NULL_TREE
)
3867 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
3868 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
3870 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
3871 TYPE_MODE (itype
) = TYPE_MODE (type
);
3872 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
3873 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
3874 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
3875 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
3877 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
3878 return type_hash_canon (tree_low_cst (highval
, 0)
3879 - tree_low_cst (lowval
, 0),
3885 /* Just like build_index_type, but takes lowval and highval instead
3886 of just highval (maxval). */
3889 build_index_2_type (lowval
, highval
)
3890 tree lowval
, highval
;
3892 return build_range_type (sizetype
, lowval
, highval
);
3895 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3896 and number of elements specified by the range of values of INDEX_TYPE.
3897 If such a type has already been constructed, reuse it. */
3900 build_array_type (elt_type
, index_type
)
3901 tree elt_type
, index_type
;
3904 unsigned int hashcode
;
3906 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
3908 error ("arrays of functions are not meaningful");
3909 elt_type
= integer_type_node
;
3912 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3913 build_pointer_type (elt_type
);
3915 /* Allocate the array after the pointer type,
3916 in case we free it in type_hash_canon. */
3917 t
= make_node (ARRAY_TYPE
);
3918 TREE_TYPE (t
) = elt_type
;
3919 TYPE_DOMAIN (t
) = index_type
;
3921 if (index_type
== 0)
3926 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
3927 t
= type_hash_canon (hashcode
, t
);
3929 if (!COMPLETE_TYPE_P (t
))
3934 /* Return the TYPE of the elements comprising
3935 the innermost dimension of ARRAY. */
3938 get_inner_array_type (array
)
3941 tree type
= TREE_TYPE (array
);
3943 while (TREE_CODE (type
) == ARRAY_TYPE
)
3944 type
= TREE_TYPE (type
);
3949 /* Construct, lay out and return
3950 the type of functions returning type VALUE_TYPE
3951 given arguments of types ARG_TYPES.
3952 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3953 are data type nodes for the arguments of the function.
3954 If such a type has already been constructed, reuse it. */
3957 build_function_type (value_type
, arg_types
)
3958 tree value_type
, arg_types
;
3961 unsigned int hashcode
;
3963 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
3965 error ("function return type cannot be function");
3966 value_type
= integer_type_node
;
3969 /* Make a node of the sort we want. */
3970 t
= make_node (FUNCTION_TYPE
);
3971 TREE_TYPE (t
) = value_type
;
3972 TYPE_ARG_TYPES (t
) = arg_types
;
3974 /* If we already have such a type, use the old one and free this one. */
3975 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
3976 t
= type_hash_canon (hashcode
, t
);
3978 if (!COMPLETE_TYPE_P (t
))
3983 /* Build a function type. The RETURN_TYPE is the type retured by the
3984 function. If additional arguments are provided, they are
3985 additional argument types. The list of argument types must always
3986 be terminated by NULL_TREE. */
3989 build_function_type_list (tree return_type
, ...)
3994 va_start (p
, return_type
);
3996 t
= va_arg (p
, tree
);
3997 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
3998 args
= tree_cons (NULL_TREE
, t
, args
);
4001 args
= nreverse (args
);
4002 TREE_CHAIN (last
) = void_list_node
;
4003 args
= build_function_type (return_type
, args
);
4009 /* Construct, lay out and return the type of methods belonging to class
4010 BASETYPE and whose arguments and values are described by TYPE.
4011 If that type exists already, reuse it.
4012 TYPE must be a FUNCTION_TYPE node. */
4015 build_method_type (basetype
, type
)
4016 tree basetype
, type
;
4019 unsigned int hashcode
;
4021 /* Make a node of the sort we want. */
4022 t
= make_node (METHOD_TYPE
);
4024 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4027 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4028 TREE_TYPE (t
) = TREE_TYPE (type
);
4030 /* The actual arglist for this function includes a "hidden" argument
4031 which is "this". Put it into the list of argument types. */
4034 = tree_cons (NULL_TREE
,
4035 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
4037 /* If we already have such a type, use the old one and free this one. */
4038 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4039 t
= type_hash_canon (hashcode
, t
);
4041 if (!COMPLETE_TYPE_P (t
))
4047 /* Construct, lay out and return the type of offsets to a value
4048 of type TYPE, within an object of type BASETYPE.
4049 If a suitable offset type exists already, reuse it. */
4052 build_offset_type (basetype
, type
)
4053 tree basetype
, type
;
4056 unsigned int hashcode
;
4058 /* Make a node of the sort we want. */
4059 t
= make_node (OFFSET_TYPE
);
4061 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4062 TREE_TYPE (t
) = type
;
4064 /* If we already have such a type, use the old one and free this one. */
4065 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4066 t
= type_hash_canon (hashcode
, t
);
4068 if (!COMPLETE_TYPE_P (t
))
4074 /* Create a complex type whose components are COMPONENT_TYPE. */
4077 build_complex_type (component_type
)
4078 tree component_type
;
4081 unsigned int hashcode
;
4083 /* Make a node of the sort we want. */
4084 t
= make_node (COMPLEX_TYPE
);
4086 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4087 set_type_quals (t
, TYPE_QUALS (component_type
));
4089 /* If we already have such a type, use the old one and free this one. */
4090 hashcode
= TYPE_HASH (component_type
);
4091 t
= type_hash_canon (hashcode
, t
);
4093 if (!COMPLETE_TYPE_P (t
))
4096 /* If we are writing Dwarf2 output we need to create a name,
4097 since complex is a fundamental type. */
4098 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4102 if (component_type
== char_type_node
)
4103 name
= "complex char";
4104 else if (component_type
== signed_char_type_node
)
4105 name
= "complex signed char";
4106 else if (component_type
== unsigned_char_type_node
)
4107 name
= "complex unsigned char";
4108 else if (component_type
== short_integer_type_node
)
4109 name
= "complex short int";
4110 else if (component_type
== short_unsigned_type_node
)
4111 name
= "complex short unsigned int";
4112 else if (component_type
== integer_type_node
)
4113 name
= "complex int";
4114 else if (component_type
== unsigned_type_node
)
4115 name
= "complex unsigned int";
4116 else if (component_type
== long_integer_type_node
)
4117 name
= "complex long int";
4118 else if (component_type
== long_unsigned_type_node
)
4119 name
= "complex long unsigned int";
4120 else if (component_type
== long_long_integer_type_node
)
4121 name
= "complex long long int";
4122 else if (component_type
== long_long_unsigned_type_node
)
4123 name
= "complex long long unsigned int";
4128 TYPE_NAME (t
) = get_identifier (name
);
4134 /* Return OP, stripped of any conversions to wider types as much as is safe.
4135 Converting the value back to OP's type makes a value equivalent to OP.
4137 If FOR_TYPE is nonzero, we return a value which, if converted to
4138 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4140 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4141 narrowest type that can hold the value, even if they don't exactly fit.
4142 Otherwise, bit-field references are changed to a narrower type
4143 only if they can be fetched directly from memory in that type.
4145 OP must have integer, real or enumeral type. Pointers are not allowed!
4147 There are some cases where the obvious value we could return
4148 would regenerate to OP if converted to OP's type,
4149 but would not extend like OP to wider types.
4150 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4151 For example, if OP is (unsigned short)(signed char)-1,
4152 we avoid returning (signed char)-1 if FOR_TYPE is int,
4153 even though extending that to an unsigned short would regenerate OP,
4154 since the result of extending (signed char)-1 to (int)
4155 is different from (int) OP. */
4158 get_unwidened (op
, for_type
)
4162 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4163 tree type
= TREE_TYPE (op
);
4165 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4167 = (for_type
!= 0 && for_type
!= type
4168 && final_prec
> TYPE_PRECISION (type
)
4169 && TREE_UNSIGNED (type
));
4172 while (TREE_CODE (op
) == NOP_EXPR
)
4175 = TYPE_PRECISION (TREE_TYPE (op
))
4176 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4178 /* Truncations are many-one so cannot be removed.
4179 Unless we are later going to truncate down even farther. */
4181 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4184 /* See what's inside this conversion. If we decide to strip it,
4186 op
= TREE_OPERAND (op
, 0);
4188 /* If we have not stripped any zero-extensions (uns is 0),
4189 we can strip any kind of extension.
4190 If we have previously stripped a zero-extension,
4191 only zero-extensions can safely be stripped.
4192 Any extension can be stripped if the bits it would produce
4193 are all going to be discarded later by truncating to FOR_TYPE. */
4197 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4199 /* TREE_UNSIGNED says whether this is a zero-extension.
4200 Let's avoid computing it if it does not affect WIN
4201 and if UNS will not be needed again. */
4202 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4203 && TREE_UNSIGNED (TREE_TYPE (op
)))
4211 if (TREE_CODE (op
) == COMPONENT_REF
4212 /* Since type_for_size always gives an integer type. */
4213 && TREE_CODE (type
) != REAL_TYPE
4214 /* Don't crash if field not laid out yet. */
4215 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4216 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4218 unsigned int innerprec
4219 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4220 int unsignedp
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4221 type
= (*lang_hooks
.types
.type_for_size
) (innerprec
, unsignedp
);
4223 /* We can get this structure field in the narrowest type it fits in.
4224 If FOR_TYPE is 0, do this only for a field that matches the
4225 narrower type exactly and is aligned for it
4226 The resulting extension to its nominal type (a fullword type)
4227 must fit the same conditions as for other extensions. */
4229 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4230 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4231 && (! uns
|| final_prec
<= innerprec
|| unsignedp
)
4234 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4235 TREE_OPERAND (op
, 1));
4236 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4237 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4244 /* Return OP or a simpler expression for a narrower value
4245 which can be sign-extended or zero-extended to give back OP.
4246 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4247 or 0 if the value should be sign-extended. */
4250 get_narrower (op
, unsignedp_ptr
)
4258 while (TREE_CODE (op
) == NOP_EXPR
)
4261 = (TYPE_PRECISION (TREE_TYPE (op
))
4262 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4264 /* Truncations are many-one so cannot be removed. */
4268 /* See what's inside this conversion. If we decide to strip it,
4273 op
= TREE_OPERAND (op
, 0);
4274 /* An extension: the outermost one can be stripped,
4275 but remember whether it is zero or sign extension. */
4277 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4278 /* Otherwise, if a sign extension has been stripped,
4279 only sign extensions can now be stripped;
4280 if a zero extension has been stripped, only zero-extensions. */
4281 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4285 else /* bitschange == 0 */
4287 /* A change in nominal type can always be stripped, but we must
4288 preserve the unsignedness. */
4290 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4292 op
= TREE_OPERAND (op
, 0);
4298 if (TREE_CODE (op
) == COMPONENT_REF
4299 /* Since type_for_size always gives an integer type. */
4300 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4301 /* Ensure field is laid out already. */
4302 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4304 unsigned HOST_WIDE_INT innerprec
4305 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4306 tree type
= (*lang_hooks
.types
.type_for_size
) (innerprec
,
4307 TREE_UNSIGNED (op
));
4309 /* We can get this structure field in a narrower type that fits it,
4310 but the resulting extension to its nominal type (a fullword type)
4311 must satisfy the same conditions as for other extensions.
4313 Do this only for fields that are aligned (not bit-fields),
4314 because when bit-field insns will be used there is no
4315 advantage in doing this. */
4317 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4318 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4319 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4323 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4324 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4325 TREE_OPERAND (op
, 1));
4326 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4327 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4330 *unsignedp_ptr
= uns
;
4334 /* Nonzero if integer constant C has a value that is permissible
4335 for type TYPE (an INTEGER_TYPE). */
4338 int_fits_type_p (c
, type
)
4341 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4342 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4343 int ok_for_low_bound
, ok_for_high_bound
;
4345 /* Perform some generic filtering first, which may allow making a decision
4346 even if the bounds are not constant. First, negative integers never fit
4347 in unsigned types, */
4348 if ((TREE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4349 /* Also, unsigned integers with top bit set never fit signed types. */
4350 || (! TREE_UNSIGNED (type
)
4351 && TREE_UNSIGNED (TREE_TYPE (c
)) && tree_int_cst_msb (c
)))
4354 /* If at least one bound of the type is a constant integer, we can check
4355 ourselves and maybe make a decision. If no such decision is possible, but
4356 this type is a subtype, try checking against that. Otherwise, use
4357 force_fit_type, which checks against the precision.
4359 Compute the status for each possibly constant bound, and return if we see
4360 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4361 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4362 for "constant known to fit". */
4364 ok_for_low_bound
= -1;
4365 ok_for_high_bound
= -1;
4367 /* Check if C >= type_low_bound. */
4368 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4370 ok_for_low_bound
= ! tree_int_cst_lt (c
, type_low_bound
);
4371 if (! ok_for_low_bound
)
4375 /* Check if c <= type_high_bound. */
4376 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4378 ok_for_high_bound
= ! tree_int_cst_lt (type_high_bound
, c
);
4379 if (! ok_for_high_bound
)
4383 /* If the constant fits both bounds, the result is known. */
4384 if (ok_for_low_bound
== 1 && ok_for_high_bound
== 1)
4387 /* If we haven't been able to decide at this point, there nothing more we
4388 can check ourselves here. Look at the base type if we have one. */
4389 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4390 return int_fits_type_p (c
, TREE_TYPE (type
));
4392 /* Or to force_fit_type, if nothing else. */
4396 TREE_TYPE (c
) = type
;
4397 return !force_fit_type (c
, 0);
4401 /* Returns true if T is, contains, or refers to a type with variable
4402 size. This concept is more general than that of C99 'variably
4403 modified types': in C99, a struct type is never variably modified
4404 because a VLA may not appear as a structure member. However, in
4407 struct S { int i[f()]; };
4409 is valid, and other languages may define similar constructs. */
4412 variably_modified_type_p (type
)
4415 if (type
== error_mark_node
)
4418 /* If TYPE itself has variable size, it is variably modified.
4420 We do not yet have a representation of the C99 '[*]' syntax.
4421 When a representation is chosen, this function should be modified
4422 to test for that case as well. */
4423 if (TYPE_SIZE (type
)
4424 && TYPE_SIZE (type
) != error_mark_node
4425 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4428 /* If TYPE is a pointer or reference, it is variably modified if
4429 the type pointed to is variably modified. */
4430 if ((TREE_CODE (type
) == POINTER_TYPE
4431 || TREE_CODE (type
) == REFERENCE_TYPE
)
4432 && variably_modified_type_p (TREE_TYPE (type
)))
4435 /* If TYPE is an array, it is variably modified if the array
4436 elements are. (Note that the VLA case has already been checked
4438 if (TREE_CODE (type
) == ARRAY_TYPE
4439 && variably_modified_type_p (TREE_TYPE (type
)))
4442 /* If TYPE is a function type, it is variably modified if any of the
4443 parameters or the return type are variably modified. */
4444 if (TREE_CODE (type
) == FUNCTION_TYPE
4445 || TREE_CODE (type
) == METHOD_TYPE
)
4449 if (variably_modified_type_p (TREE_TYPE (type
)))
4451 for (parm
= TYPE_ARG_TYPES (type
);
4452 parm
&& parm
!= void_list_node
;
4453 parm
= TREE_CHAIN (parm
))
4454 if (variably_modified_type_p (TREE_VALUE (parm
)))
4458 /* The current language may have other cases to check, but in general,
4459 all other types are not variably modified. */
4460 return (*lang_hooks
.tree_inlining
.var_mod_type_p
) (type
);
4463 /* Given a DECL or TYPE, return the scope in which it was declared, or
4464 NULL_TREE if there is no containing scope. */
4467 get_containing_scope (t
)
4470 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4473 /* Return the innermost context enclosing DECL that is
4474 a FUNCTION_DECL, or zero if none. */
4477 decl_function_context (decl
)
4482 if (TREE_CODE (decl
) == ERROR_MARK
)
4485 if (TREE_CODE (decl
) == SAVE_EXPR
)
4486 context
= SAVE_EXPR_CONTEXT (decl
);
4488 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4489 where we look up the function at runtime. Such functions always take
4490 a first argument of type 'pointer to real context'.
4492 C++ should really be fixed to use DECL_CONTEXT for the real context,
4493 and use something else for the "virtual context". */
4494 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4497 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4499 context
= DECL_CONTEXT (decl
);
4501 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4503 if (TREE_CODE (context
) == BLOCK
)
4504 context
= BLOCK_SUPERCONTEXT (context
);
4506 context
= get_containing_scope (context
);
4512 /* Return the innermost context enclosing DECL that is
4513 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4514 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4517 decl_type_context (decl
)
4520 tree context
= DECL_CONTEXT (decl
);
4524 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4527 if (TREE_CODE (context
) == RECORD_TYPE
4528 || TREE_CODE (context
) == UNION_TYPE
4529 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4532 if (TREE_CODE (context
) == TYPE_DECL
4533 || TREE_CODE (context
) == FUNCTION_DECL
)
4534 context
= DECL_CONTEXT (context
);
4536 else if (TREE_CODE (context
) == BLOCK
)
4537 context
= BLOCK_SUPERCONTEXT (context
);
4540 /* Unhandled CONTEXT!? */
4546 /* CALL is a CALL_EXPR. Return the declaration for the function
4547 called, or NULL_TREE if the called function cannot be
4551 get_callee_fndecl (call
)
4556 /* It's invalid to call this function with anything but a
4558 if (TREE_CODE (call
) != CALL_EXPR
)
4561 /* The first operand to the CALL is the address of the function
4563 addr
= TREE_OPERAND (call
, 0);
4567 /* If this is a readonly function pointer, extract its initial value. */
4568 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
4569 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
4570 && DECL_INITIAL (addr
))
4571 addr
= DECL_INITIAL (addr
);
4573 /* If the address is just `&f' for some function `f', then we know
4574 that `f' is being called. */
4575 if (TREE_CODE (addr
) == ADDR_EXPR
4576 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4577 return TREE_OPERAND (addr
, 0);
4579 /* We couldn't figure out what was being called. */
4583 /* Print debugging information about tree nodes generated during the compile,
4584 and any language-specific information. */
4587 dump_tree_statistics ()
4589 #ifdef GATHER_STATISTICS
4591 int total_nodes
, total_bytes
;
4594 fprintf (stderr
, "\n??? tree nodes created\n\n");
4595 #ifdef GATHER_STATISTICS
4596 fprintf (stderr
, "Kind Nodes Bytes\n");
4597 fprintf (stderr
, "-------------------------------------\n");
4598 total_nodes
= total_bytes
= 0;
4599 for (i
= 0; i
< (int) all_kinds
; i
++)
4601 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4602 tree_node_counts
[i
], tree_node_sizes
[i
]);
4603 total_nodes
+= tree_node_counts
[i
];
4604 total_bytes
+= tree_node_sizes
[i
];
4606 fprintf (stderr
, "-------------------------------------\n");
4607 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4608 fprintf (stderr
, "-------------------------------------\n");
4610 fprintf (stderr
, "(No per-node statistics)\n");
4612 print_type_hash_statistics ();
4613 (*lang_hooks
.print_statistics
) ();
4616 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4618 const char *flag_random_seed
;
4620 /* Set up a default flag_random_seed value, if there wasn't one already. */
4623 default_flag_random_seed (void)
4625 unsigned HOST_WIDE_INT value
;
4626 char *new_random_seed
;
4628 if (flag_random_seed
!= NULL
)
4631 /* Get some more or less random data. */
4632 #ifdef HAVE_GETTIMEOFDAY
4636 gettimeofday (&tv
, NULL
);
4637 value
= (((unsigned HOST_WIDE_INT
) tv
.tv_usec
<< 16)
4638 ^ tv
.tv_sec
^ getpid ());
4644 /* This slightly overestimates the space required. */
4645 new_random_seed
= xmalloc (HOST_BITS_PER_WIDE_INT
/ 3 + 2);
4646 sprintf (new_random_seed
, HOST_WIDE_INT_PRINT_UNSIGNED
, value
);
4647 flag_random_seed
= new_random_seed
;
4650 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4651 clashes in cases where we can't reliably choose a unique name.
4653 Derived from mkstemp.c in libiberty. */
4656 append_random_chars (template)
4659 static const char letters
[]
4660 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4661 unsigned HOST_WIDE_INT v
;
4664 default_flag_random_seed ();
4666 /* This isn't a very good hash, but it does guarantee no collisions
4667 when the random string is generated by the code above and the time
4670 for (i
= 0; i
< strlen (flag_random_seed
); i
++)
4671 v
= (v
<< 4) ^ (v
>> (HOST_BITS_PER_WIDE_INT
- 4)) ^ flag_random_seed
[i
];
4673 template += strlen (template);
4675 /* Fill in the random bits. */
4676 template[0] = letters
[v
% 62];
4678 template[1] = letters
[v
% 62];
4680 template[2] = letters
[v
% 62];
4682 template[3] = letters
[v
% 62];
4684 template[4] = letters
[v
% 62];
4686 template[5] = letters
[v
% 62];
4691 /* P is a string that will be used in a symbol. Mask out any characters
4692 that are not valid in that context. */
4695 clean_symbol_name (p
)
4700 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4703 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4710 /* Generate a name for a function unique to this translation unit.
4711 TYPE is some string to identify the purpose of this function to the
4712 linker or collect2. */
4715 get_file_function_name_long (type
)
4722 if (first_global_object_name
)
4723 p
= first_global_object_name
;
4726 /* We don't have anything that we know to be unique to this translation
4727 unit, so use what we do have and throw in some randomness. */
4729 const char *name
= weak_global_object_name
;
4730 const char *file
= main_input_filename
;
4735 file
= input_filename
;
4737 q
= (char *) alloca (7 + strlen (name
) + strlen (file
));
4739 sprintf (q
, "%s%s", name
, file
);
4740 append_random_chars (q
);
4744 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
4747 /* Set up the name of the file-level functions we may need.
4748 Use a global object (which is already required to be unique over
4749 the program) rather than the file name (which imposes extra
4751 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
4753 /* Don't need to pull weird characters out of global names. */
4754 if (p
!= first_global_object_name
)
4755 clean_symbol_name (buf
+ 11);
4757 return get_identifier (buf
);
4760 /* If KIND=='I', return a suitable global initializer (constructor) name.
4761 If KIND=='D', return a suitable global clean-up (destructor) name. */
4764 get_file_function_name (kind
)
4772 return get_file_function_name_long (p
);
4775 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4776 The result is placed in BUFFER (which has length BIT_SIZE),
4777 with one bit in each char ('\000' or '\001').
4779 If the constructor is constant, NULL_TREE is returned.
4780 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4783 get_set_constructor_bits (init
, buffer
, bit_size
)
4790 HOST_WIDE_INT domain_min
4791 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
4792 tree non_const_bits
= NULL_TREE
;
4794 for (i
= 0; i
< bit_size
; i
++)
4797 for (vals
= TREE_OPERAND (init
, 1);
4798 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4800 if (!host_integerp (TREE_VALUE (vals
), 0)
4801 || (TREE_PURPOSE (vals
) != NULL_TREE
4802 && !host_integerp (TREE_PURPOSE (vals
), 0)))
4804 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4805 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4807 /* Set a range of bits to ones. */
4808 HOST_WIDE_INT lo_index
4809 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
4810 HOST_WIDE_INT hi_index
4811 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4813 if (lo_index
< 0 || lo_index
>= bit_size
4814 || hi_index
< 0 || hi_index
>= bit_size
)
4816 for (; lo_index
<= hi_index
; lo_index
++)
4817 buffer
[lo_index
] = 1;
4821 /* Set a single bit to one. */
4823 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4824 if (index
< 0 || index
>= bit_size
)
4826 error ("invalid initializer for bit string");
4832 return non_const_bits
;
4835 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4836 The result is placed in BUFFER (which is an array of bytes).
4837 If the constructor is constant, NULL_TREE is returned.
4838 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4841 get_set_constructor_bytes (init
, buffer
, wd_size
)
4843 unsigned char *buffer
;
4847 int set_word_size
= BITS_PER_UNIT
;
4848 int bit_size
= wd_size
* set_word_size
;
4850 unsigned char *bytep
= buffer
;
4851 char *bit_buffer
= (char *) alloca (bit_size
);
4852 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4854 for (i
= 0; i
< wd_size
; i
++)
4857 for (i
= 0; i
< bit_size
; i
++)
4861 if (BYTES_BIG_ENDIAN
)
4862 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4864 *bytep
|= 1 << bit_pos
;
4867 if (bit_pos
>= set_word_size
)
4868 bit_pos
= 0, bytep
++;
4870 return non_const_bits
;
4873 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4874 /* Complain that the tree code of NODE does not match the expected CODE.
4875 FILE, LINE, and FUNCTION are of the caller. */
4878 tree_check_failed (node
, code
, file
, line
, function
)
4880 enum tree_code code
;
4883 const char *function
;
4885 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4886 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
4887 function
, trim_filename (file
), line
);
4890 /* Similar to above, except that we check for a class of tree
4891 code, given in CL. */
4894 tree_class_check_failed (node
, cl
, file
, line
, function
)
4899 const char *function
;
4902 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4903 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
4904 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
4907 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
4908 (dynamically sized) vector. */
4911 tree_vec_elt_check_failed (idx
, len
, file
, line
, function
)
4916 const char *function
;
4919 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
4920 idx
+ 1, len
, function
, trim_filename (file
), line
);
4923 /* Similar to above, except that the check is for the bounds of the operand
4924 vector of an expression node. */
4927 tree_operand_check_failed (idx
, code
, file
, line
, function
)
4929 enum tree_code code
;
4932 const char *function
;
4935 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
4936 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
4937 function
, trim_filename (file
), line
);
4939 #endif /* ENABLE_TREE_CHECKING */
4941 /* For a new vector type node T, build the information necessary for
4942 debugging output. */
4945 finish_vector_type (t
)
4951 tree index
= build_int_2 (TYPE_VECTOR_SUBPARTS (t
) - 1, 0);
4952 tree array
= build_array_type (TREE_TYPE (t
),
4953 build_index_type (index
));
4954 tree rt
= make_node (RECORD_TYPE
);
4956 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
4957 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
4959 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
4960 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4961 the representation type, and we want to find that die when looking up
4962 the vector type. This is most easily achieved by making the TYPE_UID
4964 TYPE_UID (rt
) = TYPE_UID (t
);
4968 /* Create nodes for all integer types (and error_mark_node) using the sizes
4969 of C datatypes. The caller should call set_sizetype soon after calling
4970 this function to select one of the types as sizetype. */
4973 build_common_tree_nodes (signed_char
)
4976 error_mark_node
= make_node (ERROR_MARK
);
4977 TREE_TYPE (error_mark_node
) = error_mark_node
;
4979 initialize_sizetypes ();
4981 /* Define both `signed char' and `unsigned char'. */
4982 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
4983 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
4985 /* Define `char', which is like either `signed char' or `unsigned char'
4986 but not the same as either. */
4989 ? make_signed_type (CHAR_TYPE_SIZE
)
4990 : make_unsigned_type (CHAR_TYPE_SIZE
));
4992 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
4993 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
4994 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
4995 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
4996 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
4997 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
4998 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
4999 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5001 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
5002 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
5003 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
5004 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
5005 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
5007 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
5008 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
5009 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
5010 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
5011 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
5014 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5015 It will create several other common tree nodes. */
5018 build_common_tree_nodes_2 (short_double
)
5021 /* Define these next since types below may used them. */
5022 integer_zero_node
= build_int_2 (0, 0);
5023 integer_one_node
= build_int_2 (1, 0);
5024 integer_minus_one_node
= build_int_2 (-1, -1);
5026 size_zero_node
= size_int (0);
5027 size_one_node
= size_int (1);
5028 bitsize_zero_node
= bitsize_int (0);
5029 bitsize_one_node
= bitsize_int (1);
5030 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5032 void_type_node
= make_node (VOID_TYPE
);
5033 layout_type (void_type_node
);
5035 /* We are not going to have real types in C with less than byte alignment,
5036 so we might as well not have any types that claim to have it. */
5037 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5038 TYPE_USER_ALIGN (void_type_node
) = 0;
5040 null_pointer_node
= build_int_2 (0, 0);
5041 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5042 layout_type (TREE_TYPE (null_pointer_node
));
5044 ptr_type_node
= build_pointer_type (void_type_node
);
5046 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5048 float_type_node
= make_node (REAL_TYPE
);
5049 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5050 layout_type (float_type_node
);
5052 double_type_node
= make_node (REAL_TYPE
);
5054 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5056 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5057 layout_type (double_type_node
);
5059 long_double_type_node
= make_node (REAL_TYPE
);
5060 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5061 layout_type (long_double_type_node
);
5063 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5064 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5065 layout_type (complex_integer_type_node
);
5067 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5068 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5069 layout_type (complex_float_type_node
);
5071 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5072 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5073 layout_type (complex_double_type_node
);
5075 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5076 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5077 layout_type (complex_long_double_type_node
);
5081 BUILD_VA_LIST_TYPE (t
);
5083 /* Many back-ends define record types without seting TYPE_NAME.
5084 If we copied the record type here, we'd keep the original
5085 record type without a name. This breaks name mangling. So,
5086 don't copy record types and let c_common_nodes_and_builtins()
5087 declare the type to be __builtin_va_list. */
5088 if (TREE_CODE (t
) != RECORD_TYPE
)
5089 t
= build_type_copy (t
);
5091 va_list_type_node
= t
;
5094 unsigned_V4SI_type_node
5095 = make_vector (V4SImode
, unsigned_intSI_type_node
, 1);
5096 unsigned_V2HI_type_node
5097 = make_vector (V2HImode
, unsigned_intHI_type_node
, 1);
5098 unsigned_V2SI_type_node
5099 = make_vector (V2SImode
, unsigned_intSI_type_node
, 1);
5100 unsigned_V2DI_type_node
5101 = make_vector (V2DImode
, unsigned_intDI_type_node
, 1);
5102 unsigned_V4HI_type_node
5103 = make_vector (V4HImode
, unsigned_intHI_type_node
, 1);
5104 unsigned_V8QI_type_node
5105 = make_vector (V8QImode
, unsigned_intQI_type_node
, 1);
5106 unsigned_V8HI_type_node
5107 = make_vector (V8HImode
, unsigned_intHI_type_node
, 1);
5108 unsigned_V16QI_type_node
5109 = make_vector (V16QImode
, unsigned_intQI_type_node
, 1);
5110 unsigned_V1DI_type_node
5111 = make_vector (V1DImode
, unsigned_intDI_type_node
, 1);
5113 V16SF_type_node
= make_vector (V16SFmode
, float_type_node
, 0);
5114 V4SF_type_node
= make_vector (V4SFmode
, float_type_node
, 0);
5115 V4SI_type_node
= make_vector (V4SImode
, intSI_type_node
, 0);
5116 V2HI_type_node
= make_vector (V2HImode
, intHI_type_node
, 0);
5117 V2SI_type_node
= make_vector (V2SImode
, intSI_type_node
, 0);
5118 V2DI_type_node
= make_vector (V2DImode
, intDI_type_node
, 0);
5119 V4HI_type_node
= make_vector (V4HImode
, intHI_type_node
, 0);
5120 V8QI_type_node
= make_vector (V8QImode
, intQI_type_node
, 0);
5121 V8HI_type_node
= make_vector (V8HImode
, intHI_type_node
, 0);
5122 V2SF_type_node
= make_vector (V2SFmode
, float_type_node
, 0);
5123 V2DF_type_node
= make_vector (V2DFmode
, double_type_node
, 0);
5124 V16QI_type_node
= make_vector (V16QImode
, intQI_type_node
, 0);
5125 V1DI_type_node
= make_vector (V1DImode
, intDI_type_node
, 0);
5128 /* Returns a vector tree node given a vector mode, the inner type, and
5132 make_vector (mode
, innertype
, unsignedp
)
5133 enum machine_mode mode
;
5139 t
= make_node (VECTOR_TYPE
);
5140 TREE_TYPE (t
) = innertype
;
5141 TYPE_MODE (t
) = mode
;
5142 TREE_UNSIGNED (TREE_TYPE (t
)) = unsignedp
;
5143 finish_vector_type (t
);
5148 /* Given an initializer INIT, return TRUE if INIT is zero or some
5149 aggregate of zeros. Otherwise return FALSE. */
5152 initializer_zerop (init
)
5157 switch (TREE_CODE (init
))
5160 return integer_zerop (init
);
5162 return real_zerop (init
)
5163 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
5165 return integer_zerop (init
)
5166 || (real_zerop (init
)
5167 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
5168 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
5171 if (AGGREGATE_TYPE_P (TREE_TYPE (init
)))
5173 tree aggr_init
= CONSTRUCTOR_ELTS (init
);
5177 if (! initializer_zerop (TREE_VALUE (aggr_init
)))
5179 aggr_init
= TREE_CHAIN (aggr_init
);
5190 #include "gt-tree.h"