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
, PTR 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 ((PTR
) 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_LINE (t
) = input_line
;
312 DECL_SOURCE_FILE (t
) =
313 (input_filename
) ? input_filename
: "<built-in>";
314 DECL_UID (t
) = next_decl_uid
++;
316 /* We have not yet computed the alias set for this declaration. */
317 DECL_POINTER_ALIAS_SET (t
) = -1;
321 TYPE_UID (t
) = next_type_uid
++;
322 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
323 TYPE_USER_ALIGN (t
) = 0;
324 TYPE_MAIN_VARIANT (t
) = t
;
326 /* Default to no attributes for type, but let target change that. */
327 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
328 (*targetm
.set_default_type_attributes
) (t
);
330 /* We have not yet computed the alias set for this type. */
331 TYPE_ALIAS_SET (t
) = -1;
335 TREE_CONSTANT (t
) = 1;
345 case PREDECREMENT_EXPR
:
346 case PREINCREMENT_EXPR
:
347 case POSTDECREMENT_EXPR
:
348 case POSTINCREMENT_EXPR
:
349 /* All of these have side-effects, no matter what their
351 TREE_SIDE_EFFECTS (t
) = 1;
363 /* Return a new node with the same contents as NODE except that its
364 TREE_CHAIN is zero and it has a fresh uid. */
371 enum tree_code code
= TREE_CODE (node
);
374 length
= tree_size (node
);
375 t
= ggc_alloc_tree (length
);
376 memcpy (t
, node
, length
);
379 TREE_ASM_WRITTEN (t
) = 0;
381 if (TREE_CODE_CLASS (code
) == 'd')
382 DECL_UID (t
) = next_decl_uid
++;
383 else if (TREE_CODE_CLASS (code
) == 't')
385 TYPE_UID (t
) = next_type_uid
++;
386 /* The following is so that the debug code for
387 the copy is different from the original type.
388 The two statements usually duplicate each other
389 (because they clear fields of the same union),
390 but the optimizer should catch that. */
391 TYPE_SYMTAB_POINTER (t
) = 0;
392 TYPE_SYMTAB_ADDRESS (t
) = 0;
398 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
399 For example, this can copy a list made of TREE_LIST nodes. */
411 head
= prev
= copy_node (list
);
412 next
= TREE_CHAIN (list
);
415 TREE_CHAIN (prev
) = copy_node (next
);
416 prev
= TREE_CHAIN (prev
);
417 next
= TREE_CHAIN (next
);
423 /* Return a newly constructed INTEGER_CST node whose constant value
424 is specified by the two ints LOW and HI.
425 The TREE_TYPE is set to `int'.
427 This function should be used via the `build_int_2' macro. */
430 build_int_2_wide (low
, hi
)
431 unsigned HOST_WIDE_INT low
;
434 tree t
= make_node (INTEGER_CST
);
436 TREE_INT_CST_LOW (t
) = low
;
437 TREE_INT_CST_HIGH (t
) = hi
;
438 TREE_TYPE (t
) = integer_type_node
;
442 /* Return a new VECTOR_CST node whose type is TYPE and whose values
443 are in a list pointed by VALS. */
446 build_vector (type
, vals
)
449 tree v
= make_node (VECTOR_CST
);
450 int over1
= 0, over2
= 0;
453 TREE_VECTOR_CST_ELTS (v
) = vals
;
454 TREE_TYPE (v
) = type
;
456 /* Iterate through elements and check for overflow. */
457 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
459 tree value
= TREE_VALUE (link
);
461 over1
|= TREE_OVERFLOW (value
);
462 over2
|= TREE_CONSTANT_OVERFLOW (value
);
465 TREE_OVERFLOW (v
) = over1
;
466 TREE_CONSTANT_OVERFLOW (v
) = over2
;
471 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
472 are in a list pointed to by VALS. */
474 build_constructor (type
, vals
)
477 tree c
= make_node (CONSTRUCTOR
);
478 TREE_TYPE (c
) = type
;
479 CONSTRUCTOR_ELTS (c
) = vals
;
481 /* ??? May not be necessary. Mirrors what build does. */
484 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
485 TREE_READONLY (c
) = TREE_READONLY (vals
);
486 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
489 TREE_CONSTANT (c
) = 0; /* safe side */
494 /* Return a new REAL_CST node whose type is TYPE and value is D. */
505 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
506 Consider doing it via real_convert now. */
508 v
= make_node (REAL_CST
);
509 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
510 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
512 TREE_TYPE (v
) = type
;
513 TREE_REAL_CST_PTR (v
) = dp
;
514 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
518 /* Return a new REAL_CST node whose type is TYPE
519 and whose value is the integer value of the INTEGER_CST node I. */
522 real_value_from_int_cst (type
, i
)
523 tree type ATTRIBUTE_UNUSED
, i
;
527 /* Clear all bits of the real value type so that we can later do
528 bitwise comparisons to see if two values are the same. */
529 memset ((char *) &d
, 0, sizeof d
);
531 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
532 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
535 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
536 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
540 /* Given a tree representing an integer constant I, return a tree
541 representing the same value as a floating-point constant of type TYPE. */
544 build_real_from_int_cst (type
, i
)
549 int overflow
= TREE_OVERFLOW (i
);
551 v
= build_real (type
, real_value_from_int_cst (type
, i
));
553 TREE_OVERFLOW (v
) |= overflow
;
554 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
558 /* Return a newly constructed STRING_CST node whose value is
559 the LEN characters at STR.
560 The TREE_TYPE is not initialized. */
563 build_string (len
, str
)
567 tree s
= make_node (STRING_CST
);
569 TREE_STRING_LENGTH (s
) = len
;
570 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
575 /* Return a newly constructed COMPLEX_CST node whose value is
576 specified by the real and imaginary parts REAL and IMAG.
577 Both REAL and IMAG should be constant nodes. TYPE, if specified,
578 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
581 build_complex (type
, real
, imag
)
585 tree t
= make_node (COMPLEX_CST
);
587 TREE_REALPART (t
) = real
;
588 TREE_IMAGPART (t
) = imag
;
589 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
590 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
591 TREE_CONSTANT_OVERFLOW (t
)
592 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
596 /* Build a newly constructed TREE_VEC node of length LEN. */
603 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
605 #ifdef GATHER_STATISTICS
606 tree_node_counts
[(int) vec_kind
]++;
607 tree_node_sizes
[(int) vec_kind
] += length
;
610 t
= ggc_alloc_tree (length
);
612 memset ((PTR
) t
, 0, length
);
613 TREE_SET_CODE (t
, TREE_VEC
);
614 TREE_VEC_LENGTH (t
) = len
;
619 /* Return 1 if EXPR is the integer constant zero or a complex constant
628 return ((TREE_CODE (expr
) == INTEGER_CST
629 && ! TREE_CONSTANT_OVERFLOW (expr
)
630 && TREE_INT_CST_LOW (expr
) == 0
631 && TREE_INT_CST_HIGH (expr
) == 0)
632 || (TREE_CODE (expr
) == COMPLEX_CST
633 && integer_zerop (TREE_REALPART (expr
))
634 && integer_zerop (TREE_IMAGPART (expr
))));
637 /* Return 1 if EXPR is the integer constant one or the corresponding
646 return ((TREE_CODE (expr
) == INTEGER_CST
647 && ! TREE_CONSTANT_OVERFLOW (expr
)
648 && TREE_INT_CST_LOW (expr
) == 1
649 && TREE_INT_CST_HIGH (expr
) == 0)
650 || (TREE_CODE (expr
) == COMPLEX_CST
651 && integer_onep (TREE_REALPART (expr
))
652 && integer_zerop (TREE_IMAGPART (expr
))));
655 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
656 it contains. Likewise for the corresponding complex constant. */
659 integer_all_onesp (expr
)
667 if (TREE_CODE (expr
) == COMPLEX_CST
668 && integer_all_onesp (TREE_REALPART (expr
))
669 && integer_zerop (TREE_IMAGPART (expr
)))
672 else if (TREE_CODE (expr
) != INTEGER_CST
673 || TREE_CONSTANT_OVERFLOW (expr
))
676 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
678 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
679 && TREE_INT_CST_HIGH (expr
) == -1);
681 /* Note that using TYPE_PRECISION here is wrong. We care about the
682 actual bits, not the (arbitrary) range of the type. */
683 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
684 if (prec
>= HOST_BITS_PER_WIDE_INT
)
686 HOST_WIDE_INT high_value
;
689 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
691 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
692 /* Can not handle precisions greater than twice the host int size. */
694 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
695 /* Shifting by the host word size is undefined according to the ANSI
696 standard, so we must handle this as a special case. */
699 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
701 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
702 && TREE_INT_CST_HIGH (expr
) == high_value
);
705 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
708 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
716 HOST_WIDE_INT high
, low
;
720 if (TREE_CODE (expr
) == COMPLEX_CST
721 && integer_pow2p (TREE_REALPART (expr
))
722 && integer_zerop (TREE_IMAGPART (expr
)))
725 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
728 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
729 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
730 high
= TREE_INT_CST_HIGH (expr
);
731 low
= TREE_INT_CST_LOW (expr
);
733 /* First clear all bits that are beyond the type's precision in case
734 we've been sign extended. */
736 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
738 else if (prec
> HOST_BITS_PER_WIDE_INT
)
739 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
743 if (prec
< HOST_BITS_PER_WIDE_INT
)
744 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
747 if (high
== 0 && low
== 0)
750 return ((high
== 0 && (low
& (low
- 1)) == 0)
751 || (low
== 0 && (high
& (high
- 1)) == 0));
754 /* Return 1 if EXPR is an integer constant other than zero or a
755 complex constant other than zero. */
758 integer_nonzerop (expr
)
763 return ((TREE_CODE (expr
) == INTEGER_CST
764 && ! TREE_CONSTANT_OVERFLOW (expr
)
765 && (TREE_INT_CST_LOW (expr
) != 0
766 || TREE_INT_CST_HIGH (expr
) != 0))
767 || (TREE_CODE (expr
) == COMPLEX_CST
768 && (integer_nonzerop (TREE_REALPART (expr
))
769 || integer_nonzerop (TREE_IMAGPART (expr
)))));
772 /* Return the power of two represented by a tree node known to be a
780 HOST_WIDE_INT high
, low
;
784 if (TREE_CODE (expr
) == COMPLEX_CST
)
785 return tree_log2 (TREE_REALPART (expr
));
787 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
788 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
790 high
= TREE_INT_CST_HIGH (expr
);
791 low
= TREE_INT_CST_LOW (expr
);
793 /* First clear all bits that are beyond the type's precision in case
794 we've been sign extended. */
796 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
798 else if (prec
> HOST_BITS_PER_WIDE_INT
)
799 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
803 if (prec
< HOST_BITS_PER_WIDE_INT
)
804 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
807 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
811 /* Similar, but return the largest integer Y such that 2 ** Y is less
812 than or equal to EXPR. */
815 tree_floor_log2 (expr
)
819 HOST_WIDE_INT high
, low
;
823 if (TREE_CODE (expr
) == COMPLEX_CST
)
824 return tree_log2 (TREE_REALPART (expr
));
826 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
827 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
829 high
= TREE_INT_CST_HIGH (expr
);
830 low
= TREE_INT_CST_LOW (expr
);
832 /* First clear all bits that are beyond the type's precision in case
833 we've been sign extended. Ignore if type's precision hasn't been set
834 since what we are doing is setting it. */
836 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
838 else if (prec
> HOST_BITS_PER_WIDE_INT
)
839 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
843 if (prec
< HOST_BITS_PER_WIDE_INT
)
844 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
847 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
851 /* Return 1 if EXPR is the real constant zero. */
859 return ((TREE_CODE (expr
) == REAL_CST
860 && ! TREE_CONSTANT_OVERFLOW (expr
)
861 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
862 || (TREE_CODE (expr
) == COMPLEX_CST
863 && real_zerop (TREE_REALPART (expr
))
864 && real_zerop (TREE_IMAGPART (expr
))));
867 /* Return 1 if EXPR is the real constant one in real or complex form. */
875 return ((TREE_CODE (expr
) == REAL_CST
876 && ! TREE_CONSTANT_OVERFLOW (expr
)
877 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
878 || (TREE_CODE (expr
) == COMPLEX_CST
879 && real_onep (TREE_REALPART (expr
))
880 && real_zerop (TREE_IMAGPART (expr
))));
883 /* Return 1 if EXPR is the real constant two. */
891 return ((TREE_CODE (expr
) == REAL_CST
892 && ! TREE_CONSTANT_OVERFLOW (expr
)
893 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
894 || (TREE_CODE (expr
) == COMPLEX_CST
895 && real_twop (TREE_REALPART (expr
))
896 && real_zerop (TREE_IMAGPART (expr
))));
899 /* Return 1 if EXPR is the real constant minus one. */
902 real_minus_onep (expr
)
907 return ((TREE_CODE (expr
) == REAL_CST
908 && ! TREE_CONSTANT_OVERFLOW (expr
)
909 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
910 || (TREE_CODE (expr
) == COMPLEX_CST
911 && real_minus_onep (TREE_REALPART (expr
))
912 && real_zerop (TREE_IMAGPART (expr
))));
915 /* Nonzero if EXP is a constant or a cast of a constant. */
918 really_constant_p (exp
)
921 /* This is not quite the same as STRIP_NOPS. It does more. */
922 while (TREE_CODE (exp
) == NOP_EXPR
923 || TREE_CODE (exp
) == CONVERT_EXPR
924 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
925 exp
= TREE_OPERAND (exp
, 0);
926 return TREE_CONSTANT (exp
);
929 /* Return first list element whose TREE_VALUE is ELEM.
930 Return 0 if ELEM is not in LIST. */
933 value_member (elem
, list
)
938 if (elem
== TREE_VALUE (list
))
940 list
= TREE_CHAIN (list
);
945 /* Return first list element whose TREE_PURPOSE is ELEM.
946 Return 0 if ELEM is not in LIST. */
949 purpose_member (elem
, list
)
954 if (elem
== TREE_PURPOSE (list
))
956 list
= TREE_CHAIN (list
);
961 /* Return first list element whose BINFO_TYPE is ELEM.
962 Return 0 if ELEM is not in LIST. */
965 binfo_member (elem
, list
)
970 if (elem
== BINFO_TYPE (list
))
972 list
= TREE_CHAIN (list
);
977 /* Return nonzero if ELEM is part of the chain CHAIN. */
980 chain_member (elem
, chain
)
987 chain
= TREE_CHAIN (chain
);
993 /* Return the length of a chain of nodes chained through TREE_CHAIN.
994 We expect a null pointer to mark the end of the chain.
995 This is the Lisp primitive `length'. */
1004 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1010 /* Returns the number of FIELD_DECLs in TYPE. */
1013 fields_length (type
)
1016 tree t
= TYPE_FIELDS (type
);
1019 for (; t
; t
= TREE_CHAIN (t
))
1020 if (TREE_CODE (t
) == FIELD_DECL
)
1026 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1027 by modifying the last node in chain 1 to point to chain 2.
1028 This is the Lisp primitive `nconc'. */
1041 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1043 TREE_CHAIN (t1
) = op2
;
1045 #ifdef ENABLE_TREE_CHECKING
1048 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1050 abort (); /* Circularity created. */
1057 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1065 while ((next
= TREE_CHAIN (chain
)))
1070 /* Reverse the order of elements in the chain T,
1071 and return the new head of the chain (old last element). */
1077 tree prev
= 0, decl
, next
;
1078 for (decl
= t
; decl
; decl
= next
)
1080 next
= TREE_CHAIN (decl
);
1081 TREE_CHAIN (decl
) = prev
;
1087 /* Return a newly created TREE_LIST node whose
1088 purpose and value fields are PARM and VALUE. */
1091 build_tree_list (parm
, value
)
1094 tree t
= make_node (TREE_LIST
);
1095 TREE_PURPOSE (t
) = parm
;
1096 TREE_VALUE (t
) = value
;
1100 /* Return a newly created TREE_LIST node whose
1101 purpose and value fields are PURPOSE and VALUE
1102 and whose TREE_CHAIN is CHAIN. */
1105 tree_cons (purpose
, value
, chain
)
1106 tree purpose
, value
, chain
;
1110 node
= ggc_alloc_tree (sizeof (struct tree_list
));
1112 memset (node
, 0, sizeof (struct tree_common
));
1114 #ifdef GATHER_STATISTICS
1115 tree_node_counts
[(int) x_kind
]++;
1116 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1119 TREE_SET_CODE (node
, TREE_LIST
);
1120 TREE_CHAIN (node
) = chain
;
1121 TREE_PURPOSE (node
) = purpose
;
1122 TREE_VALUE (node
) = value
;
1126 /* Return the last expression in a sequence of COMPOUND_EXPRs. */
1132 if (expr
== NULL_TREE
)
1134 while (TREE_CODE (expr
) == COMPOUND_EXPR
)
1135 expr
= TREE_OPERAND (expr
, 1);
1139 /* Return the size nominally occupied by an object of type TYPE
1140 when it resides in memory. The value is measured in units of bytes,
1141 and its data type is that normally used for type sizes
1142 (which is the first type created by make_signed_type or
1143 make_unsigned_type). */
1146 size_in_bytes (type
)
1151 if (type
== error_mark_node
)
1152 return integer_zero_node
;
1154 type
= TYPE_MAIN_VARIANT (type
);
1155 t
= TYPE_SIZE_UNIT (type
);
1159 (*lang_hooks
.types
.incomplete_type_error
) (NULL_TREE
, type
);
1160 return size_zero_node
;
1163 if (TREE_CODE (t
) == INTEGER_CST
)
1164 force_fit_type (t
, 0);
1169 /* Return the size of TYPE (in bytes) as a wide integer
1170 or return -1 if the size can vary or is larger than an integer. */
1173 int_size_in_bytes (type
)
1178 if (type
== error_mark_node
)
1181 type
= TYPE_MAIN_VARIANT (type
);
1182 t
= TYPE_SIZE_UNIT (type
);
1184 || TREE_CODE (t
) != INTEGER_CST
1185 || TREE_OVERFLOW (t
)
1186 || TREE_INT_CST_HIGH (t
) != 0
1187 /* If the result would appear negative, it's too big to represent. */
1188 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1191 return TREE_INT_CST_LOW (t
);
1194 /* Return the bit position of FIELD, in bits from the start of the record.
1195 This is a tree of type bitsizetype. */
1198 bit_position (field
)
1201 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1202 DECL_FIELD_BIT_OFFSET (field
));
1205 /* Likewise, but return as an integer. Abort if it cannot be represented
1206 in that way (since it could be a signed value, we don't have the option
1207 of returning -1 like int_size_in_byte can. */
1210 int_bit_position (field
)
1213 return tree_low_cst (bit_position (field
), 0);
1216 /* Return the byte position of FIELD, in bytes from the start of the record.
1217 This is a tree of type sizetype. */
1220 byte_position (field
)
1223 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1224 DECL_FIELD_BIT_OFFSET (field
));
1227 /* Likewise, but return as an integer. Abort if it cannot be represented
1228 in that way (since it could be a signed value, we don't have the option
1229 of returning -1 like int_size_in_byte can. */
1232 int_byte_position (field
)
1235 return tree_low_cst (byte_position (field
), 0);
1238 /* Return the strictest alignment, in bits, that T is known to have. */
1244 unsigned int align0
, align1
;
1246 switch (TREE_CODE (t
))
1248 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1249 /* If we have conversions, we know that the alignment of the
1250 object must meet each of the alignments of the types. */
1251 align0
= expr_align (TREE_OPERAND (t
, 0));
1252 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1253 return MAX (align0
, align1
);
1255 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1256 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1257 case WITH_RECORD_EXPR
: case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
1258 /* These don't change the alignment of an object. */
1259 return expr_align (TREE_OPERAND (t
, 0));
1262 /* The best we can do is say that the alignment is the least aligned
1264 align0
= expr_align (TREE_OPERAND (t
, 1));
1265 align1
= expr_align (TREE_OPERAND (t
, 2));
1266 return MIN (align0
, align1
);
1268 case LABEL_DECL
: case CONST_DECL
:
1269 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1270 if (DECL_ALIGN (t
) != 0)
1271 return DECL_ALIGN (t
);
1275 return FUNCTION_BOUNDARY
;
1281 /* Otherwise take the alignment from that of the type. */
1282 return TYPE_ALIGN (TREE_TYPE (t
));
1285 /* Return, as a tree node, the number of elements for TYPE (which is an
1286 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1289 array_type_nelts (type
)
1292 tree index_type
, min
, max
;
1294 /* If they did it with unspecified bounds, then we should have already
1295 given an error about it before we got here. */
1296 if (! TYPE_DOMAIN (type
))
1297 return error_mark_node
;
1299 index_type
= TYPE_DOMAIN (type
);
1300 min
= TYPE_MIN_VALUE (index_type
);
1301 max
= TYPE_MAX_VALUE (index_type
);
1303 return (integer_zerop (min
)
1305 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1308 /* Return nonzero if arg is static -- a reference to an object in
1309 static storage. This is not the same as the C meaning of `static'. */
1315 switch (TREE_CODE (arg
))
1318 /* Nested functions aren't static, since taking their address
1319 involves a trampoline. */
1320 return ((decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1321 && ! DECL_NON_ADDR_CONST_P (arg
));
1324 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1325 && ! DECL_THREAD_LOCAL (arg
)
1326 && ! DECL_NON_ADDR_CONST_P (arg
));
1329 return TREE_STATIC (arg
);
1335 /* If we are referencing a bitfield, we can't evaluate an
1336 ADDR_EXPR at compile time and so it isn't a constant. */
1338 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
1339 && staticp (TREE_OPERAND (arg
, 0)));
1345 /* This case is technically correct, but results in setting
1346 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1349 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
1353 case ARRAY_RANGE_REF
:
1354 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1355 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1356 return staticp (TREE_OPERAND (arg
, 0));
1359 if ((unsigned int) TREE_CODE (arg
)
1360 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1361 return (*lang_hooks
.staticp
) (arg
);
1367 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1368 Do this to any expression which may be used in more than one place,
1369 but must be evaluated only once.
1371 Normally, expand_expr would reevaluate the expression each time.
1372 Calling save_expr produces something that is evaluated and recorded
1373 the first time expand_expr is called on it. Subsequent calls to
1374 expand_expr just reuse the recorded value.
1376 The call to expand_expr that generates code that actually computes
1377 the value is the first call *at compile time*. Subsequent calls
1378 *at compile time* generate code to use the saved value.
1379 This produces correct result provided that *at run time* control
1380 always flows through the insns made by the first expand_expr
1381 before reaching the other places where the save_expr was evaluated.
1382 You, the caller of save_expr, must make sure this is so.
1384 Constants, and certain read-only nodes, are returned with no
1385 SAVE_EXPR because that is safe. Expressions containing placeholders
1386 are not touched; see tree.def for an explanation of what these
1396 /* Don't fold a COMPONENT_EXPR: if the operand was a CONSTRUCTOR (the
1397 only time it will fold), it can cause problems with PLACEHOLDER_EXPRs
1398 in Ada. Moreover, it isn't at all clear why we fold here at all. */
1399 if (TREE_CODE (t
) != COMPONENT_REF
)
1402 /* If the tree evaluates to a constant, then we don't want to hide that
1403 fact (i.e. this allows further folding, and direct checks for constants).
1404 However, a read-only object that has side effects cannot be bypassed.
1405 Since it is no problem to reevaluate literals, we just return the
1407 inner
= skip_simple_arithmetic (t
);
1408 if (TREE_CONSTANT (inner
)
1409 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1410 || TREE_CODE (inner
) == SAVE_EXPR
1411 || TREE_CODE (inner
) == ERROR_MARK
)
1414 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1415 it means that the size or offset of some field of an object depends on
1416 the value within another field.
1418 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1419 and some variable since it would then need to be both evaluated once and
1420 evaluated more than once. Front-ends must assure this case cannot
1421 happen by surrounding any such subexpressions in their own SAVE_EXPR
1422 and forcing evaluation at the proper time. */
1423 if (contains_placeholder_p (inner
))
1426 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
1428 /* This expression might be placed ahead of a jump to ensure that the
1429 value was computed on both sides of the jump. So make sure it isn't
1430 eliminated as dead. */
1431 TREE_SIDE_EFFECTS (t
) = 1;
1432 TREE_READONLY (t
) = 1;
1436 /* Look inside EXPR and into any simple arithmetic operations. Return
1437 the innermost non-arithmetic node. */
1440 skip_simple_arithmetic (expr
)
1445 /* We don't care about whether this can be used as an lvalue in this
1447 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1448 expr
= TREE_OPERAND (expr
, 0);
1450 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1451 a constant, it will be more efficient to not make another SAVE_EXPR since
1452 it will allow better simplification and GCSE will be able to merge the
1453 computations if they actually occur. */
1457 if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '1')
1458 inner
= TREE_OPERAND (inner
, 0);
1459 else if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '2')
1461 if (TREE_CONSTANT (TREE_OPERAND (inner
, 1)))
1462 inner
= TREE_OPERAND (inner
, 0);
1463 else if (TREE_CONSTANT (TREE_OPERAND (inner
, 0)))
1464 inner
= TREE_OPERAND (inner
, 1);
1475 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
1476 SAVE_EXPR. Return FALSE otherwise. */
1482 return TREE_CODE (skip_simple_arithmetic (expr
)) == SAVE_EXPR
;
1485 /* Arrange for an expression to be expanded multiple independent
1486 times. This is useful for cleanup actions, as the backend can
1487 expand them multiple times in different places. */
1495 /* If this is already protected, no sense in protecting it again. */
1496 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
1499 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
1500 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
1504 /* Returns the index of the first non-tree operand for CODE, or the number
1505 of operands if all are trees. */
1509 enum tree_code code
;
1515 case GOTO_SUBROUTINE_EXPR
:
1518 case WITH_CLEANUP_EXPR
:
1520 case METHOD_CALL_EXPR
:
1523 return TREE_CODE_LENGTH (code
);
1527 /* Return which tree structure is used by T. */
1529 enum tree_node_structure_enum
1530 tree_node_structure (t
)
1533 enum tree_code code
= TREE_CODE (t
);
1535 switch (TREE_CODE_CLASS (code
))
1537 case 'd': return TS_DECL
;
1538 case 't': return TS_TYPE
;
1539 case 'b': return TS_BLOCK
;
1540 case 'r': case '<': case '1': case '2': case 'e': case 's':
1542 default: /* 'c' and 'x' */
1548 case INTEGER_CST
: return TS_INT_CST
;
1549 case REAL_CST
: return TS_REAL_CST
;
1550 case COMPLEX_CST
: return TS_COMPLEX
;
1551 case VECTOR_CST
: return TS_VECTOR
;
1552 case STRING_CST
: return TS_STRING
;
1554 case ERROR_MARK
: return TS_COMMON
;
1555 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1556 case TREE_LIST
: return TS_LIST
;
1557 case TREE_VEC
: return TS_VEC
;
1558 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1565 /* Perform any modifications to EXPR required when it is unsaved. Does
1566 not recurse into EXPR's subtrees. */
1569 unsave_expr_1 (expr
)
1572 switch (TREE_CODE (expr
))
1575 if (! SAVE_EXPR_PERSISTENT_P (expr
))
1576 SAVE_EXPR_RTL (expr
) = 0;
1580 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1581 It's OK for this to happen if it was part of a subtree that
1582 isn't immediately expanded, such as operand 2 of another
1584 if (TREE_OPERAND (expr
, 1))
1587 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
1588 TREE_OPERAND (expr
, 3) = NULL_TREE
;
1592 /* I don't yet know how to emit a sequence multiple times. */
1593 if (RTL_EXPR_SEQUENCE (expr
) != 0)
1602 /* Default lang hook for "unsave_expr_now". */
1605 lhd_unsave_expr_now (expr
)
1608 enum tree_code code
;
1610 /* There's nothing to do for NULL_TREE. */
1614 unsave_expr_1 (expr
);
1616 code
= TREE_CODE (expr
);
1617 switch (TREE_CODE_CLASS (code
))
1619 case 'c': /* a constant */
1620 case 't': /* a type node */
1621 case 'd': /* A decl node */
1622 case 'b': /* A block node */
1625 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1626 if (code
== TREE_LIST
)
1628 lhd_unsave_expr_now (TREE_VALUE (expr
));
1629 lhd_unsave_expr_now (TREE_CHAIN (expr
));
1633 case 'e': /* an expression */
1634 case 'r': /* a reference */
1635 case 's': /* an expression with side effects */
1636 case '<': /* a comparison expression */
1637 case '2': /* a binary arithmetic expression */
1638 case '1': /* a unary arithmetic expression */
1642 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
1643 lhd_unsave_expr_now (TREE_OPERAND (expr
, i
));
1654 /* Return 0 if it is safe to evaluate EXPR multiple times,
1655 return 1 if it is safe if EXPR is unsaved afterward, or
1656 return 2 if it is completely unsafe.
1658 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1659 an expression tree, so that it safe to unsave them and the surrounding
1660 context will be correct.
1662 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1663 occasionally across the whole of a function. It is therefore only
1664 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1665 below the UNSAVE_EXPR.
1667 RTL_EXPRs consume their rtl during evaluation. It is therefore
1668 never possible to unsave them. */
1671 unsafe_for_reeval (expr
)
1675 enum tree_code code
;
1680 if (expr
== NULL_TREE
)
1683 code
= TREE_CODE (expr
);
1684 first_rtl
= first_rtl_op (code
);
1693 for (exp
= expr
; exp
!= 0; exp
= TREE_CHAIN (exp
))
1695 tmp
= unsafe_for_reeval (TREE_VALUE (exp
));
1696 unsafeness
= MAX (tmp
, unsafeness
);
1702 tmp2
= unsafe_for_reeval (TREE_OPERAND (expr
, 0));
1703 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, 1));
1704 return MAX (MAX (tmp
, 1), tmp2
);
1711 tmp
= (*lang_hooks
.unsafe_for_reeval
) (expr
);
1717 switch (TREE_CODE_CLASS (code
))
1719 case 'c': /* a constant */
1720 case 't': /* a type node */
1721 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1722 case 'd': /* A decl node */
1723 case 'b': /* A block node */
1726 case 'e': /* an expression */
1727 case 'r': /* a reference */
1728 case 's': /* an expression with side effects */
1729 case '<': /* a comparison expression */
1730 case '2': /* a binary arithmetic expression */
1731 case '1': /* a unary arithmetic expression */
1732 for (i
= first_rtl
- 1; i
>= 0; i
--)
1734 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, i
));
1735 unsafeness
= MAX (tmp
, unsafeness
);
1745 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1746 or offset that depends on a field within a record. */
1749 contains_placeholder_p (exp
)
1752 enum tree_code code
;
1758 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1759 in it since it is supplying a value for it. */
1760 code
= TREE_CODE (exp
);
1761 if (code
== WITH_RECORD_EXPR
)
1763 else if (code
== PLACEHOLDER_EXPR
)
1766 switch (TREE_CODE_CLASS (code
))
1769 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1770 position computations since they will be converted into a
1771 WITH_RECORD_EXPR involving the reference, which will assume
1772 here will be valid. */
1773 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1776 if (code
== TREE_LIST
)
1777 return (contains_placeholder_p (TREE_VALUE (exp
))
1778 || (TREE_CHAIN (exp
) != 0
1779 && contains_placeholder_p (TREE_CHAIN (exp
))));
1788 /* Ignoring the first operand isn't quite right, but works best. */
1789 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
1796 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1797 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
1798 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
1801 /* If we already know this doesn't have a placeholder, don't
1803 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
1806 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
1807 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
1809 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
1814 return (TREE_OPERAND (exp
, 1) != 0
1815 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1821 switch (TREE_CODE_LENGTH (code
))
1824 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1826 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1827 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1838 /* Return 1 if EXP contains any expressions that produce cleanups for an
1839 outer scope to deal with. Used by fold. */
1847 if (! TREE_SIDE_EFFECTS (exp
))
1850 switch (TREE_CODE (exp
))
1853 case GOTO_SUBROUTINE_EXPR
:
1854 case WITH_CLEANUP_EXPR
:
1857 case CLEANUP_POINT_EXPR
:
1861 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
1863 cmp
= has_cleanups (TREE_VALUE (exp
));
1873 /* This general rule works for most tree codes. All exceptions should be
1874 handled above. If this is a language-specific tree code, we can't
1875 trust what might be in the operand, so say we don't know
1877 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
1880 nops
= first_rtl_op (TREE_CODE (exp
));
1881 for (i
= 0; i
< nops
; i
++)
1882 if (TREE_OPERAND (exp
, i
) != 0)
1884 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
1885 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
1886 || type
== 'r' || type
== 's')
1888 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
1897 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1898 return a tree with all occurrences of references to F in a
1899 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1900 contains only arithmetic expressions or a CALL_EXPR with a
1901 PLACEHOLDER_EXPR occurring only in its arglist. */
1904 substitute_in_expr (exp
, f
, r
)
1909 enum tree_code code
= TREE_CODE (exp
);
1914 switch (TREE_CODE_CLASS (code
))
1921 if (code
== PLACEHOLDER_EXPR
)
1923 else if (code
== TREE_LIST
)
1925 op0
= (TREE_CHAIN (exp
) == 0
1926 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
1927 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
1928 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1931 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1940 switch (TREE_CODE_LENGTH (code
))
1943 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1944 if (op0
== TREE_OPERAND (exp
, 0))
1947 if (code
== NON_LVALUE_EXPR
)
1950 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
1954 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
1955 could, but we don't support it. */
1956 if (code
== RTL_EXPR
)
1958 else if (code
== CONSTRUCTOR
)
1961 op0
= TREE_OPERAND (exp
, 0);
1962 op1
= TREE_OPERAND (exp
, 1);
1963 if (contains_placeholder_p (op0
))
1964 op0
= substitute_in_expr (op0
, f
, r
);
1965 if (contains_placeholder_p (op1
))
1966 op1
= substitute_in_expr (op1
, f
, r
);
1968 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
1971 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
1975 /* It cannot be that anything inside a SAVE_EXPR contains a
1976 PLACEHOLDER_EXPR. */
1977 if (code
== SAVE_EXPR
)
1980 else if (code
== CALL_EXPR
)
1982 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1983 if (op1
== TREE_OPERAND (exp
, 1))
1986 return build (code
, TREE_TYPE (exp
),
1987 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
1990 else if (code
!= COND_EXPR
)
1993 op0
= TREE_OPERAND (exp
, 0);
1994 op1
= TREE_OPERAND (exp
, 1);
1995 op2
= TREE_OPERAND (exp
, 2);
1997 if (contains_placeholder_p (op0
))
1998 op0
= substitute_in_expr (op0
, f
, r
);
1999 if (contains_placeholder_p (op1
))
2000 op1
= substitute_in_expr (op1
, f
, r
);
2001 if (contains_placeholder_p (op2
))
2002 op2
= substitute_in_expr (op2
, f
, r
);
2004 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2005 && op2
== TREE_OPERAND (exp
, 2))
2008 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2021 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2022 and it is the right field, replace it with R. */
2023 for (inner
= TREE_OPERAND (exp
, 0);
2024 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2025 inner
= TREE_OPERAND (inner
, 0))
2027 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2028 && TREE_OPERAND (exp
, 1) == f
)
2031 /* If this expression hasn't been completed let, leave it
2033 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2034 && TREE_TYPE (inner
) == 0)
2037 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2038 if (op0
== TREE_OPERAND (exp
, 0))
2041 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2042 TREE_OPERAND (exp
, 1)));
2046 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2047 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2048 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2049 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2050 && op2
== TREE_OPERAND (exp
, 2))
2053 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2058 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2059 if (op0
== TREE_OPERAND (exp
, 0))
2062 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2074 TREE_READONLY (new) = TREE_READONLY (exp
);
2078 /* Stabilize a reference so that we can use it any number of times
2079 without causing its operands to be evaluated more than once.
2080 Returns the stabilized reference. This works by means of save_expr,
2081 so see the caveats in the comments about save_expr.
2083 Also allows conversion expressions whose operands are references.
2084 Any other kind of expression is returned unchanged. */
2087 stabilize_reference (ref
)
2091 enum tree_code code
= TREE_CODE (ref
);
2098 /* No action is needed in this case. */
2104 case FIX_TRUNC_EXPR
:
2105 case FIX_FLOOR_EXPR
:
2106 case FIX_ROUND_EXPR
:
2108 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2112 result
= build_nt (INDIRECT_REF
,
2113 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2117 result
= build_nt (COMPONENT_REF
,
2118 stabilize_reference (TREE_OPERAND (ref
, 0)),
2119 TREE_OPERAND (ref
, 1));
2123 result
= build_nt (BIT_FIELD_REF
,
2124 stabilize_reference (TREE_OPERAND (ref
, 0)),
2125 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2126 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2130 result
= build_nt (ARRAY_REF
,
2131 stabilize_reference (TREE_OPERAND (ref
, 0)),
2132 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2135 case ARRAY_RANGE_REF
:
2136 result
= build_nt (ARRAY_RANGE_REF
,
2137 stabilize_reference (TREE_OPERAND (ref
, 0)),
2138 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2142 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2143 it wouldn't be ignored. This matters when dealing with
2145 return stabilize_reference_1 (ref
);
2148 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2149 save_expr (build1 (ADDR_EXPR
,
2150 build_pointer_type (TREE_TYPE (ref
)),
2154 /* If arg isn't a kind of lvalue we recognize, make no change.
2155 Caller should recognize the error for an invalid lvalue. */
2160 return error_mark_node
;
2163 TREE_TYPE (result
) = TREE_TYPE (ref
);
2164 TREE_READONLY (result
) = TREE_READONLY (ref
);
2165 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2166 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2171 /* Subroutine of stabilize_reference; this is called for subtrees of
2172 references. Any expression with side-effects must be put in a SAVE_EXPR
2173 to ensure that it is only evaluated once.
2175 We don't put SAVE_EXPR nodes around everything, because assigning very
2176 simple expressions to temporaries causes us to miss good opportunities
2177 for optimizations. Among other things, the opportunity to fold in the
2178 addition of a constant into an addressing mode often gets lost, e.g.
2179 "y[i+1] += x;". In general, we take the approach that we should not make
2180 an assignment unless we are forced into it - i.e., that any non-side effect
2181 operator should be allowed, and that cse should take care of coalescing
2182 multiple utterances of the same expression should that prove fruitful. */
2185 stabilize_reference_1 (e
)
2189 enum tree_code code
= TREE_CODE (e
);
2191 /* We cannot ignore const expressions because it might be a reference
2192 to a const array but whose index contains side-effects. But we can
2193 ignore things that are actual constant or that already have been
2194 handled by this function. */
2196 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2199 switch (TREE_CODE_CLASS (code
))
2209 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2210 so that it will only be evaluated once. */
2211 /* The reference (r) and comparison (<) classes could be handled as
2212 below, but it is generally faster to only evaluate them once. */
2213 if (TREE_SIDE_EFFECTS (e
))
2214 return save_expr (e
);
2218 /* Constants need no processing. In fact, we should never reach
2223 /* Division is slow and tends to be compiled with jumps,
2224 especially the division by powers of 2 that is often
2225 found inside of an array reference. So do it just once. */
2226 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2227 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2228 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2229 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2230 return save_expr (e
);
2231 /* Recursively stabilize each operand. */
2232 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2233 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2237 /* Recursively stabilize each operand. */
2238 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2245 TREE_TYPE (result
) = TREE_TYPE (e
);
2246 TREE_READONLY (result
) = TREE_READONLY (e
);
2247 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2248 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2253 /* Low-level constructors for expressions. */
2255 /* Build an expression of code CODE, data type TYPE,
2256 and operands as specified by the arguments ARG1 and following arguments.
2257 Expressions and reference nodes can be created this way.
2258 Constants, decls, types and misc nodes cannot be. */
2261 build (enum tree_code code
, tree tt
, ...)
2272 t
= make_node (code
);
2273 length
= TREE_CODE_LENGTH (code
);
2276 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2277 result based on those same flags for the arguments. But if the
2278 arguments aren't really even `tree' expressions, we shouldn't be trying
2280 fro
= first_rtl_op (code
);
2282 /* Expressions without side effects may be constant if their
2283 arguments are as well. */
2284 constant
= (TREE_CODE_CLASS (code
) == '<'
2285 || TREE_CODE_CLASS (code
) == '1'
2286 || TREE_CODE_CLASS (code
) == '2'
2287 || TREE_CODE_CLASS (code
) == 'c');
2291 /* This is equivalent to the loop below, but faster. */
2292 tree arg0
= va_arg (p
, tree
);
2293 tree arg1
= va_arg (p
, tree
);
2295 TREE_OPERAND (t
, 0) = arg0
;
2296 TREE_OPERAND (t
, 1) = arg1
;
2297 TREE_READONLY (t
) = 1;
2298 if (arg0
&& fro
> 0)
2300 if (TREE_SIDE_EFFECTS (arg0
))
2301 TREE_SIDE_EFFECTS (t
) = 1;
2302 if (!TREE_READONLY (arg0
))
2303 TREE_READONLY (t
) = 0;
2304 if (!TREE_CONSTANT (arg0
))
2308 if (arg1
&& fro
> 1)
2310 if (TREE_SIDE_EFFECTS (arg1
))
2311 TREE_SIDE_EFFECTS (t
) = 1;
2312 if (!TREE_READONLY (arg1
))
2313 TREE_READONLY (t
) = 0;
2314 if (!TREE_CONSTANT (arg1
))
2318 else if (length
== 1)
2320 tree arg0
= va_arg (p
, tree
);
2322 /* The only one-operand cases we handle here are those with side-effects.
2323 Others are handled with build1. So don't bother checked if the
2324 arg has side-effects since we'll already have set it.
2326 ??? This really should use build1 too. */
2327 if (TREE_CODE_CLASS (code
) != 's')
2329 TREE_OPERAND (t
, 0) = arg0
;
2333 for (i
= 0; i
< length
; i
++)
2335 tree operand
= va_arg (p
, tree
);
2337 TREE_OPERAND (t
, i
) = operand
;
2338 if (operand
&& fro
> i
)
2340 if (TREE_SIDE_EFFECTS (operand
))
2341 TREE_SIDE_EFFECTS (t
) = 1;
2342 if (!TREE_CONSTANT (operand
))
2349 TREE_CONSTANT (t
) = constant
;
2353 /* Same as above, but only builds for unary operators.
2354 Saves lions share of calls to `build'; cuts down use
2355 of varargs, which is expensive for RISC machines. */
2358 build1 (code
, type
, node
)
2359 enum tree_code code
;
2363 int length
= sizeof (struct tree_exp
);
2364 #ifdef GATHER_STATISTICS
2365 tree_node_kind kind
;
2369 #ifdef GATHER_STATISTICS
2370 switch (TREE_CODE_CLASS (code
))
2372 case 's': /* an expression with side effects */
2375 case 'r': /* a reference */
2383 tree_node_counts
[(int) kind
]++;
2384 tree_node_sizes
[(int) kind
] += length
;
2387 #ifdef ENABLE_CHECKING
2388 if (TREE_CODE_CLASS (code
) == '2'
2389 || TREE_CODE_CLASS (code
) == '<'
2390 || TREE_CODE_LENGTH (code
) != 1)
2392 #endif /* ENABLE_CHECKING */
2394 t
= ggc_alloc_tree (length
);
2396 memset ((PTR
) t
, 0, sizeof (struct tree_common
));
2398 TREE_SET_CODE (t
, code
);
2400 TREE_TYPE (t
) = type
;
2401 TREE_COMPLEXITY (t
) = 0;
2402 TREE_OPERAND (t
, 0) = node
;
2403 if (node
&& first_rtl_op (code
) != 0)
2405 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2406 TREE_READONLY (t
) = TREE_READONLY (node
);
2409 if (TREE_CODE_CLASS (code
) == 's')
2410 TREE_SIDE_EFFECTS (t
) = 1;
2417 case PREDECREMENT_EXPR
:
2418 case PREINCREMENT_EXPR
:
2419 case POSTDECREMENT_EXPR
:
2420 case POSTINCREMENT_EXPR
:
2421 /* All of these have side-effects, no matter what their
2423 TREE_SIDE_EFFECTS (t
) = 1;
2424 TREE_READONLY (t
) = 0;
2428 /* Whether a dereference is readonly has nothing to do with whether
2429 its operand is readonly. */
2430 TREE_READONLY (t
) = 0;
2434 if (TREE_CODE_CLASS (code
) == '1' && node
&& TREE_CONSTANT (node
))
2435 TREE_CONSTANT (t
) = 1;
2442 /* Similar except don't specify the TREE_TYPE
2443 and leave the TREE_SIDE_EFFECTS as 0.
2444 It is permissible for arguments to be null,
2445 or even garbage if their values do not matter. */
2448 build_nt (enum tree_code code
, ...)
2457 t
= make_node (code
);
2458 length
= TREE_CODE_LENGTH (code
);
2460 for (i
= 0; i
< length
; i
++)
2461 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2467 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2468 We do NOT enter this node in any sort of symbol table.
2470 layout_decl is used to set up the decl's storage layout.
2471 Other slots are initialized to 0 or null pointers. */
2474 build_decl (code
, name
, type
)
2475 enum tree_code code
;
2480 t
= make_node (code
);
2482 /* if (type == error_mark_node)
2483 type = integer_type_node; */
2484 /* That is not done, deliberately, so that having error_mark_node
2485 as the type can suppress useless errors in the use of this variable. */
2487 DECL_NAME (t
) = name
;
2488 TREE_TYPE (t
) = type
;
2490 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2492 else if (code
== FUNCTION_DECL
)
2493 DECL_MODE (t
) = FUNCTION_MODE
;
2498 /* BLOCK nodes are used to represent the structure of binding contours
2499 and declarations, once those contours have been exited and their contents
2500 compiled. This information is used for outputting debugging info. */
2503 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
2504 tree vars
, tags ATTRIBUTE_UNUSED
, subblocks
, supercontext
, chain
;
2506 tree block
= make_node (BLOCK
);
2508 BLOCK_VARS (block
) = vars
;
2509 BLOCK_SUBBLOCKS (block
) = subblocks
;
2510 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2511 BLOCK_CHAIN (block
) = chain
;
2515 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2516 location where an expression or an identifier were encountered. It
2517 is necessary for languages where the frontend parser will handle
2518 recursively more than one file (Java is one of them). */
2521 build_expr_wfl (node
, file
, line
, col
)
2526 static const char *last_file
= 0;
2527 static tree last_filenode
= NULL_TREE
;
2528 tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
2530 EXPR_WFL_NODE (wfl
) = node
;
2531 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
2532 if (file
!= last_file
)
2535 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
2538 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
2541 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
2542 TREE_TYPE (wfl
) = TREE_TYPE (node
);
2548 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2552 build_decl_attribute_variant (ddecl
, attribute
)
2553 tree ddecl
, attribute
;
2555 DECL_ATTRIBUTES (ddecl
) = attribute
;
2559 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2562 Record such modified types already made so we don't make duplicates. */
2565 build_type_attribute_variant (ttype
, attribute
)
2566 tree ttype
, attribute
;
2568 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2570 unsigned int hashcode
;
2573 ntype
= copy_node (ttype
);
2575 TYPE_POINTER_TO (ntype
) = 0;
2576 TYPE_REFERENCE_TO (ntype
) = 0;
2577 TYPE_ATTRIBUTES (ntype
) = attribute
;
2579 /* Create a new main variant of TYPE. */
2580 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2581 TYPE_NEXT_VARIANT (ntype
) = 0;
2582 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2584 hashcode
= (TYPE_HASH (TREE_CODE (ntype
))
2585 + TYPE_HASH (TREE_TYPE (ntype
))
2586 + attribute_hash_list (attribute
));
2588 switch (TREE_CODE (ntype
))
2591 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
2594 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
2597 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
2600 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
2606 ntype
= type_hash_canon (hashcode
, ntype
);
2607 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2613 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2616 We try both `text' and `__text__', ATTR may be either one. */
2617 /* ??? It might be a reasonable simplification to require ATTR to be only
2618 `text'. One might then also require attribute lists to be stored in
2619 their canonicalized form. */
2622 is_attribute_p (attr
, ident
)
2626 int ident_len
, attr_len
;
2629 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2632 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2635 p
= IDENTIFIER_POINTER (ident
);
2636 ident_len
= strlen (p
);
2637 attr_len
= strlen (attr
);
2639 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2643 || attr
[attr_len
- 2] != '_'
2644 || attr
[attr_len
- 1] != '_')
2646 if (ident_len
== attr_len
- 4
2647 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2652 if (ident_len
== attr_len
+ 4
2653 && p
[0] == '_' && p
[1] == '_'
2654 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2655 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2662 /* Given an attribute name and a list of attributes, return a pointer to the
2663 attribute's list element if the attribute is part of the list, or NULL_TREE
2664 if not found. If the attribute appears more than once, this only
2665 returns the first occurrence; the TREE_CHAIN of the return value should
2666 be passed back in if further occurrences are wanted. */
2669 lookup_attribute (attr_name
, list
)
2670 const char *attr_name
;
2675 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2677 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
2679 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2686 /* Return an attribute list that is the union of a1 and a2. */
2689 merge_attributes (a1
, a2
)
2694 /* Either one unset? Take the set one. */
2696 if ((attributes
= a1
) == 0)
2699 /* One that completely contains the other? Take it. */
2701 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2703 if (attribute_list_contained (a2
, a1
))
2707 /* Pick the longest list, and hang on the other list. */
2709 if (list_length (a1
) < list_length (a2
))
2710 attributes
= a2
, a2
= a1
;
2712 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
2715 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2718 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2721 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
2726 a1
= copy_node (a2
);
2727 TREE_CHAIN (a1
) = attributes
;
2736 /* Given types T1 and T2, merge their attributes and return
2740 merge_type_attributes (t1
, t2
)
2743 return merge_attributes (TYPE_ATTRIBUTES (t1
),
2744 TYPE_ATTRIBUTES (t2
));
2747 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2751 merge_decl_attributes (olddecl
, newdecl
)
2752 tree olddecl
, newdecl
;
2754 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
2755 DECL_ATTRIBUTES (newdecl
));
2758 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2760 /* Specialization of merge_decl_attributes for various Windows targets.
2762 This handles the following situation:
2764 __declspec (dllimport) int foo;
2767 The second instance of `foo' nullifies the dllimport. */
2770 merge_dllimport_decl_attributes (old
, new)
2775 int delete_dllimport_p
;
2777 old
= DECL_ATTRIBUTES (old
);
2778 new = DECL_ATTRIBUTES (new);
2780 /* What we need to do here is remove from `old' dllimport if it doesn't
2781 appear in `new'. dllimport behaves like extern: if a declaration is
2782 marked dllimport and a definition appears later, then the object
2783 is not dllimport'd. */
2784 if (lookup_attribute ("dllimport", old
) != NULL_TREE
2785 && lookup_attribute ("dllimport", new) == NULL_TREE
)
2786 delete_dllimport_p
= 1;
2788 delete_dllimport_p
= 0;
2790 a
= merge_attributes (old
, new);
2792 if (delete_dllimport_p
)
2796 /* Scan the list for dllimport and delete it. */
2797 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
2799 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
2801 if (prev
== NULL_TREE
)
2804 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
2813 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2815 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2816 of the various TYPE_QUAL values. */
2819 set_type_quals (type
, type_quals
)
2823 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
2824 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
2825 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
2828 /* Return a version of the TYPE, qualified as indicated by the
2829 TYPE_QUALS, if one exists. If no qualified version exists yet,
2830 return NULL_TREE. */
2833 get_qualified_type (type
, type_quals
)
2839 /* Search the chain of variants to see if there is already one there just
2840 like the one we need to have. If so, use that existing one. We must
2841 preserve the TYPE_NAME, since there is code that depends on this. */
2842 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2843 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
)
2844 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
))
2850 /* Like get_qualified_type, but creates the type if it does not
2851 exist. This function never returns NULL_TREE. */
2854 build_qualified_type (type
, type_quals
)
2860 /* See if we already have the appropriate qualified variant. */
2861 t
= get_qualified_type (type
, type_quals
);
2863 /* If not, build it. */
2866 t
= build_type_copy (type
);
2867 set_type_quals (t
, type_quals
);
2873 /* Create a new variant of TYPE, equivalent but distinct.
2874 This is so the caller can modify it. */
2877 build_type_copy (type
)
2880 tree t
, m
= TYPE_MAIN_VARIANT (type
);
2882 t
= copy_node (type
);
2884 TYPE_POINTER_TO (t
) = 0;
2885 TYPE_REFERENCE_TO (t
) = 0;
2887 /* Add this type to the chain of variants of TYPE. */
2888 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
2889 TYPE_NEXT_VARIANT (m
) = t
;
2894 /* Hashing of types so that we don't make duplicates.
2895 The entry point is `type_hash_canon'. */
2897 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2898 with types in the TREE_VALUE slots), by adding the hash codes
2899 of the individual types. */
2902 type_hash_list (list
)
2905 unsigned int hashcode
;
2908 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2909 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
2914 /* These are the Hashtable callback functions. */
2916 /* Returns true if the types are equal. */
2919 type_hash_eq (va
, vb
)
2923 const struct type_hash
*a
= va
, *b
= vb
;
2924 if (a
->hash
== b
->hash
2925 && TREE_CODE (a
->type
) == TREE_CODE (b
->type
)
2926 && TREE_TYPE (a
->type
) == TREE_TYPE (b
->type
)
2927 && attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
2928 TYPE_ATTRIBUTES (b
->type
))
2929 && TYPE_ALIGN (a
->type
) == TYPE_ALIGN (b
->type
)
2930 && (TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
2931 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
2932 TYPE_MAX_VALUE (b
->type
)))
2933 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
2934 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
2935 TYPE_MIN_VALUE (b
->type
)))
2936 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
2937 && (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
2938 || (TYPE_DOMAIN (a
->type
)
2939 && TREE_CODE (TYPE_DOMAIN (a
->type
)) == TREE_LIST
2940 && TYPE_DOMAIN (b
->type
)
2941 && TREE_CODE (TYPE_DOMAIN (b
->type
)) == TREE_LIST
2942 && type_list_equal (TYPE_DOMAIN (a
->type
),
2943 TYPE_DOMAIN (b
->type
)))))
2948 /* Return the cached hash value. */
2951 type_hash_hash (item
)
2954 return ((const struct type_hash
*) item
)->hash
;
2957 /* Look in the type hash table for a type isomorphic to TYPE.
2958 If one is found, return it. Otherwise return 0. */
2961 type_hash_lookup (hashcode
, type
)
2962 unsigned int hashcode
;
2965 struct type_hash
*h
, in
;
2967 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
2968 must call that routine before comparing TYPE_ALIGNs. */
2974 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
2980 /* Add an entry to the type-hash-table
2981 for a type TYPE whose hash code is HASHCODE. */
2984 type_hash_add (hashcode
, type
)
2985 unsigned int hashcode
;
2988 struct type_hash
*h
;
2991 h
= (struct type_hash
*) ggc_alloc (sizeof (struct type_hash
));
2994 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
2995 *(struct type_hash
**) loc
= h
;
2998 /* Given TYPE, and HASHCODE its hash code, return the canonical
2999 object for an identical type if one already exists.
3000 Otherwise, return TYPE, and record it as the canonical object
3001 if it is a permanent object.
3003 To use this function, first create a type of the sort you want.
3004 Then compute its hash code from the fields of the type that
3005 make it different from other similar types.
3006 Then call this function and use the value.
3007 This function frees the type you pass in if it is a duplicate. */
3009 /* Set to 1 to debug without canonicalization. Never set by program. */
3010 int debug_no_type_hash
= 0;
3013 type_hash_canon (hashcode
, type
)
3014 unsigned int hashcode
;
3019 if (debug_no_type_hash
)
3022 /* See if the type is in the hash table already. If so, return it.
3023 Otherwise, add the type. */
3024 t1
= type_hash_lookup (hashcode
, type
);
3027 #ifdef GATHER_STATISTICS
3028 tree_node_counts
[(int) t_kind
]--;
3029 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3035 type_hash_add (hashcode
, type
);
3040 /* See if the data pointed to by the type hash table is marked. We consider
3041 it marked if the type is marked or if a debug type number or symbol
3042 table entry has been made for the type. This reduces the amount of
3043 debugging output and eliminates that dependency of the debug output on
3044 the number of garbage collections. */
3047 type_hash_marked_p (p
)
3050 tree type
= ((struct type_hash
*) p
)->type
;
3052 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3056 print_type_hash_statistics ()
3058 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3059 (long) htab_size (type_hash_table
),
3060 (long) htab_elements (type_hash_table
),
3061 htab_collisions (type_hash_table
));
3064 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3065 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3066 by adding the hash codes of the individual attributes. */
3069 attribute_hash_list (list
)
3072 unsigned int hashcode
;
3075 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3076 /* ??? Do we want to add in TREE_VALUE too? */
3077 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3081 /* Given two lists of attributes, return true if list l2 is
3082 equivalent to l1. */
3085 attribute_list_equal (l1
, l2
)
3088 return attribute_list_contained (l1
, l2
)
3089 && attribute_list_contained (l2
, l1
);
3092 /* Given two lists of attributes, return true if list L2 is
3093 completely contained within L1. */
3094 /* ??? This would be faster if attribute names were stored in a canonicalized
3095 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3096 must be used to show these elements are equivalent (which they are). */
3097 /* ??? It's not clear that attributes with arguments will always be handled
3101 attribute_list_contained (l1
, l2
)
3106 /* First check the obvious, maybe the lists are identical. */
3110 /* Maybe the lists are similar. */
3111 for (t1
= l1
, t2
= l2
;
3113 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3114 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3115 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3117 /* Maybe the lists are equal. */
3118 if (t1
== 0 && t2
== 0)
3121 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3124 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3126 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3129 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3136 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3143 /* Given two lists of types
3144 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3145 return 1 if the lists contain the same types in the same order.
3146 Also, the TREE_PURPOSEs must match. */
3149 type_list_equal (l1
, l2
)
3154 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3155 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3156 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3157 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3158 && (TREE_TYPE (TREE_PURPOSE (t1
))
3159 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3165 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3166 given by TYPE. If the argument list accepts variable arguments,
3167 then this function counts only the ordinary arguments. */
3170 type_num_arguments (type
)
3176 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3177 /* If the function does not take a variable number of arguments,
3178 the last element in the list will have type `void'. */
3179 if (VOID_TYPE_P (TREE_VALUE (t
)))
3187 /* Nonzero if integer constants T1 and T2
3188 represent the same constant value. */
3191 tree_int_cst_equal (t1
, t2
)
3197 if (t1
== 0 || t2
== 0)
3200 if (TREE_CODE (t1
) == INTEGER_CST
3201 && TREE_CODE (t2
) == INTEGER_CST
3202 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3203 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3209 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3210 The precise way of comparison depends on their data type. */
3213 tree_int_cst_lt (t1
, t2
)
3219 if (TREE_UNSIGNED (TREE_TYPE (t1
)) != TREE_UNSIGNED (TREE_TYPE (t2
)))
3221 int t1_sgn
= tree_int_cst_sgn (t1
);
3222 int t2_sgn
= tree_int_cst_sgn (t2
);
3224 if (t1_sgn
< t2_sgn
)
3226 else if (t1_sgn
> t2_sgn
)
3228 /* Otherwise, both are non-negative, so we compare them as
3229 unsigned just in case one of them would overflow a signed
3232 else if (! TREE_UNSIGNED (TREE_TYPE (t1
)))
3233 return INT_CST_LT (t1
, t2
);
3235 return INT_CST_LT_UNSIGNED (t1
, t2
);
3238 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3241 tree_int_cst_compare (t1
, t2
)
3245 if (tree_int_cst_lt (t1
, t2
))
3247 else if (tree_int_cst_lt (t2
, t1
))
3253 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3254 the host. If POS is zero, the value can be represented in a single
3255 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3256 be represented in a single unsigned HOST_WIDE_INT. */
3259 host_integerp (t
, pos
)
3263 return (TREE_CODE (t
) == INTEGER_CST
3264 && ! TREE_OVERFLOW (t
)
3265 && ((TREE_INT_CST_HIGH (t
) == 0
3266 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3267 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3268 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3269 && ! TREE_UNSIGNED (TREE_TYPE (t
)))
3270 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3273 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3274 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3275 be positive. Abort if we cannot satisfy the above conditions. */
3278 tree_low_cst (t
, pos
)
3282 if (host_integerp (t
, pos
))
3283 return TREE_INT_CST_LOW (t
);
3288 /* Return the most significant bit of the integer constant T. */
3291 tree_int_cst_msb (t
)
3296 unsigned HOST_WIDE_INT l
;
3298 /* Note that using TYPE_PRECISION here is wrong. We care about the
3299 actual bits, not the (arbitrary) range of the type. */
3300 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3301 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3302 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3303 return (l
& 1) == 1;
3306 /* Return an indication of the sign of the integer constant T.
3307 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3308 Note that -1 will never be returned it T's type is unsigned. */
3311 tree_int_cst_sgn (t
)
3314 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3316 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3318 else if (TREE_INT_CST_HIGH (t
) < 0)
3324 /* Compare two constructor-element-type constants. Return 1 if the lists
3325 are known to be equal; otherwise return 0. */
3328 simple_cst_list_equal (l1
, l2
)
3331 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3333 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3336 l1
= TREE_CHAIN (l1
);
3337 l2
= TREE_CHAIN (l2
);
3343 /* Return truthvalue of whether T1 is the same tree structure as T2.
3344 Return 1 if they are the same.
3345 Return 0 if they are understandably different.
3346 Return -1 if either contains tree structure not understood by
3350 simple_cst_equal (t1
, t2
)
3353 enum tree_code code1
, code2
;
3359 if (t1
== 0 || t2
== 0)
3362 code1
= TREE_CODE (t1
);
3363 code2
= TREE_CODE (t2
);
3365 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3367 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3368 || code2
== NON_LVALUE_EXPR
)
3369 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3371 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3374 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3375 || code2
== NON_LVALUE_EXPR
)
3376 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3384 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3385 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3388 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3391 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3392 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3393 TREE_STRING_LENGTH (t1
)));
3396 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
3402 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3405 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3409 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3412 /* Special case: if either target is an unallocated VAR_DECL,
3413 it means that it's going to be unified with whatever the
3414 TARGET_EXPR is really supposed to initialize, so treat it
3415 as being equivalent to anything. */
3416 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3417 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3418 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3419 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3420 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3421 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3424 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3429 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3431 case WITH_CLEANUP_EXPR
:
3432 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3436 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3439 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3440 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3454 /* This general rule works for most tree codes. All exceptions should be
3455 handled above. If this is a language-specific tree code, we can't
3456 trust what might be in the operand, so say we don't know
3458 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3461 switch (TREE_CODE_CLASS (code1
))
3470 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3472 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3484 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3485 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3486 than U, respectively. */
3489 compare_tree_int (t
, u
)
3491 unsigned HOST_WIDE_INT u
;
3493 if (tree_int_cst_sgn (t
) < 0)
3495 else if (TREE_INT_CST_HIGH (t
) != 0)
3497 else if (TREE_INT_CST_LOW (t
) == u
)
3499 else if (TREE_INT_CST_LOW (t
) < u
)
3505 /* Generate a hash value for an expression. This can be used iteratively
3506 by passing a previous result as the "val" argument.
3508 This function is intended to produce the same hash for expressions which
3509 would compare equal using operand_equal_p. */
3512 iterative_hash_expr (tree t
, hashval_t val
)
3515 enum tree_code code
;
3519 return iterative_hash_object (t
, val
);
3521 code
= TREE_CODE (t
);
3522 class = TREE_CODE_CLASS (code
);
3526 /* Decls we can just compare by pointer. */
3527 val
= iterative_hash_object (t
, val
);
3529 else if (class == 'c')
3531 /* Alas, constants aren't shared, so we can't rely on pointer
3533 if (code
== INTEGER_CST
)
3535 val
= iterative_hash_object (TREE_INT_CST_LOW (t
), val
);
3536 val
= iterative_hash_object (TREE_INT_CST_HIGH (t
), val
);
3538 else if (code
== REAL_CST
)
3539 val
= iterative_hash (TREE_REAL_CST_PTR (t
),
3540 sizeof (REAL_VALUE_TYPE
), val
);
3541 else if (code
== STRING_CST
)
3542 val
= iterative_hash (TREE_STRING_POINTER (t
),
3543 TREE_STRING_LENGTH (t
), val
);
3544 else if (code
== COMPLEX_CST
)
3546 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
3547 val
= iterative_hash_expr (TREE_IMAGPART (t
), val
);
3549 else if (code
== VECTOR_CST
)
3550 val
= iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
3554 else if (IS_EXPR_CODE_CLASS (class) || class == 'r')
3556 val
= iterative_hash_object (code
, val
);
3558 if (code
== NOP_EXPR
|| code
== CONVERT_EXPR
3559 || code
== NON_LVALUE_EXPR
)
3560 val
= iterative_hash_object (TREE_TYPE (t
), val
);
3562 for (i
= first_rtl_op (code
) - 1; i
>= 0; --i
)
3563 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
3565 else if (code
== TREE_LIST
)
3567 /* A list of expressions, for a CALL_EXPR or as the elements of a
3569 for (; t
; t
= TREE_CHAIN (t
))
3570 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
3578 /* Constructors for pointer, array and function types.
3579 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3580 constructed by language-dependent code, not here.) */
3582 /* Construct, lay out and return the type of pointers to TO_TYPE
3583 with mode MODE. If such a type has already been constructed,
3587 build_pointer_type_for_mode (to_type
, mode
)
3589 enum machine_mode mode
;
3591 tree t
= TYPE_POINTER_TO (to_type
);
3593 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3594 if (t
!= 0 && mode
== ptr_mode
)
3597 t
= make_node (POINTER_TYPE
);
3599 TREE_TYPE (t
) = to_type
;
3600 TYPE_MODE (t
) = mode
;
3602 /* Record this type as the pointer to TO_TYPE. */
3603 if (mode
== ptr_mode
)
3604 TYPE_POINTER_TO (to_type
) = t
;
3606 /* Lay out the type. This function has many callers that are concerned
3607 with expression-construction, and this simplifies them all.
3608 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3614 /* By default build pointers in ptr_mode. */
3617 build_pointer_type (to_type
)
3620 return build_pointer_type_for_mode (to_type
, ptr_mode
);
3623 /* Construct, lay out and return the type of references to TO_TYPE
3624 with mode MODE. If such a type has already been constructed,
3628 build_reference_type_for_mode (to_type
, mode
)
3630 enum machine_mode mode
;
3632 tree t
= TYPE_REFERENCE_TO (to_type
);
3634 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3635 if (t
!= 0 && mode
== ptr_mode
)
3638 t
= make_node (REFERENCE_TYPE
);
3640 TREE_TYPE (t
) = to_type
;
3641 TYPE_MODE (t
) = mode
;
3643 /* Record this type as the pointer to TO_TYPE. */
3644 if (mode
== ptr_mode
)
3645 TYPE_REFERENCE_TO (to_type
) = t
;
3653 /* Build the node for the type of references-to-TO_TYPE by default
3657 build_reference_type (to_type
)
3660 return build_reference_type_for_mode (to_type
, ptr_mode
);
3663 /* Build a type that is compatible with t but has no cv quals anywhere
3666 const char *const *const * -> char ***. */
3669 build_type_no_quals (t
)
3672 switch (TREE_CODE (t
))
3675 return build_pointer_type (build_type_no_quals (TREE_TYPE (t
)));
3676 case REFERENCE_TYPE
:
3677 return build_reference_type (build_type_no_quals (TREE_TYPE (t
)));
3679 return TYPE_MAIN_VARIANT (t
);
3683 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3684 MAXVAL should be the maximum value in the domain
3685 (one less than the length of the array).
3687 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3688 We don't enforce this limit, that is up to caller (e.g. language front end).
3689 The limit exists because the result is a signed type and we don't handle
3690 sizes that use more than one HOST_WIDE_INT. */
3693 build_index_type (maxval
)
3696 tree itype
= make_node (INTEGER_TYPE
);
3698 TREE_TYPE (itype
) = sizetype
;
3699 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
3700 TYPE_MIN_VALUE (itype
) = size_zero_node
;
3701 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
3702 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
3703 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
3704 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
3705 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
3706 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
3708 if (host_integerp (maxval
, 1))
3709 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
3714 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3715 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3716 low bound LOWVAL and high bound HIGHVAL.
3717 if TYPE==NULL_TREE, sizetype is used. */
3720 build_range_type (type
, lowval
, highval
)
3721 tree type
, lowval
, highval
;
3723 tree itype
= make_node (INTEGER_TYPE
);
3725 TREE_TYPE (itype
) = type
;
3726 if (type
== NULL_TREE
)
3729 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
3730 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
3732 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
3733 TYPE_MODE (itype
) = TYPE_MODE (type
);
3734 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
3735 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
3736 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
3737 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
3739 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
3740 return type_hash_canon (tree_low_cst (highval
, 0)
3741 - tree_low_cst (lowval
, 0),
3747 /* Just like build_index_type, but takes lowval and highval instead
3748 of just highval (maxval). */
3751 build_index_2_type (lowval
, highval
)
3752 tree lowval
, highval
;
3754 return build_range_type (sizetype
, lowval
, highval
);
3757 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3758 and number of elements specified by the range of values of INDEX_TYPE.
3759 If such a type has already been constructed, reuse it. */
3762 build_array_type (elt_type
, index_type
)
3763 tree elt_type
, index_type
;
3766 unsigned int hashcode
;
3768 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
3770 error ("arrays of functions are not meaningful");
3771 elt_type
= integer_type_node
;
3774 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3775 build_pointer_type (elt_type
);
3777 /* Allocate the array after the pointer type,
3778 in case we free it in type_hash_canon. */
3779 t
= make_node (ARRAY_TYPE
);
3780 TREE_TYPE (t
) = elt_type
;
3781 TYPE_DOMAIN (t
) = index_type
;
3783 if (index_type
== 0)
3788 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
3789 t
= type_hash_canon (hashcode
, t
);
3791 if (!COMPLETE_TYPE_P (t
))
3796 /* Return the TYPE of the elements comprising
3797 the innermost dimension of ARRAY. */
3800 get_inner_array_type (array
)
3803 tree type
= TREE_TYPE (array
);
3805 while (TREE_CODE (type
) == ARRAY_TYPE
)
3806 type
= TREE_TYPE (type
);
3811 /* Construct, lay out and return
3812 the type of functions returning type VALUE_TYPE
3813 given arguments of types ARG_TYPES.
3814 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3815 are data type nodes for the arguments of the function.
3816 If such a type has already been constructed, reuse it. */
3819 build_function_type (value_type
, arg_types
)
3820 tree value_type
, arg_types
;
3823 unsigned int hashcode
;
3825 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
3827 error ("function return type cannot be function");
3828 value_type
= integer_type_node
;
3831 /* Make a node of the sort we want. */
3832 t
= make_node (FUNCTION_TYPE
);
3833 TREE_TYPE (t
) = value_type
;
3834 TYPE_ARG_TYPES (t
) = arg_types
;
3836 /* If we already have such a type, use the old one and free this one. */
3837 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
3838 t
= type_hash_canon (hashcode
, t
);
3840 if (!COMPLETE_TYPE_P (t
))
3845 /* Build a function type. The RETURN_TYPE is the type retured by the
3846 function. If additional arguments are provided, they are
3847 additional argument types. The list of argument types must always
3848 be terminated by NULL_TREE. */
3851 build_function_type_list (tree return_type
, ...)
3856 va_start (p
, return_type
);
3858 t
= va_arg (p
, tree
);
3859 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
3860 args
= tree_cons (NULL_TREE
, t
, args
);
3863 args
= nreverse (args
);
3864 TREE_CHAIN (last
) = void_list_node
;
3865 args
= build_function_type (return_type
, args
);
3871 /* Construct, lay out and return the type of methods belonging to class
3872 BASETYPE and whose arguments and values are described by TYPE.
3873 If that type exists already, reuse it.
3874 TYPE must be a FUNCTION_TYPE node. */
3877 build_method_type (basetype
, type
)
3878 tree basetype
, type
;
3881 unsigned int hashcode
;
3883 /* Make a node of the sort we want. */
3884 t
= make_node (METHOD_TYPE
);
3886 if (TREE_CODE (type
) != FUNCTION_TYPE
)
3889 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3890 TREE_TYPE (t
) = TREE_TYPE (type
);
3892 /* The actual arglist for this function includes a "hidden" argument
3893 which is "this". Put it into the list of argument types. */
3896 = tree_cons (NULL_TREE
,
3897 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
3899 /* If we already have such a type, use the old one and free this one. */
3900 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3901 t
= type_hash_canon (hashcode
, t
);
3903 if (!COMPLETE_TYPE_P (t
))
3909 /* Construct, lay out and return the type of offsets to a value
3910 of type TYPE, within an object of type BASETYPE.
3911 If a suitable offset type exists already, reuse it. */
3914 build_offset_type (basetype
, type
)
3915 tree basetype
, type
;
3918 unsigned int hashcode
;
3920 /* Make a node of the sort we want. */
3921 t
= make_node (OFFSET_TYPE
);
3923 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3924 TREE_TYPE (t
) = type
;
3926 /* If we already have such a type, use the old one and free this one. */
3927 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3928 t
= type_hash_canon (hashcode
, t
);
3930 if (!COMPLETE_TYPE_P (t
))
3936 /* Create a complex type whose components are COMPONENT_TYPE. */
3939 build_complex_type (component_type
)
3940 tree component_type
;
3943 unsigned int hashcode
;
3945 /* Make a node of the sort we want. */
3946 t
= make_node (COMPLEX_TYPE
);
3948 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
3949 set_type_quals (t
, TYPE_QUALS (component_type
));
3951 /* If we already have such a type, use the old one and free this one. */
3952 hashcode
= TYPE_HASH (component_type
);
3953 t
= type_hash_canon (hashcode
, t
);
3955 if (!COMPLETE_TYPE_P (t
))
3958 /* If we are writing Dwarf2 output we need to create a name,
3959 since complex is a fundamental type. */
3960 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
3964 if (component_type
== char_type_node
)
3965 name
= "complex char";
3966 else if (component_type
== signed_char_type_node
)
3967 name
= "complex signed char";
3968 else if (component_type
== unsigned_char_type_node
)
3969 name
= "complex unsigned char";
3970 else if (component_type
== short_integer_type_node
)
3971 name
= "complex short int";
3972 else if (component_type
== short_unsigned_type_node
)
3973 name
= "complex short unsigned int";
3974 else if (component_type
== integer_type_node
)
3975 name
= "complex int";
3976 else if (component_type
== unsigned_type_node
)
3977 name
= "complex unsigned int";
3978 else if (component_type
== long_integer_type_node
)
3979 name
= "complex long int";
3980 else if (component_type
== long_unsigned_type_node
)
3981 name
= "complex long unsigned int";
3982 else if (component_type
== long_long_integer_type_node
)
3983 name
= "complex long long int";
3984 else if (component_type
== long_long_unsigned_type_node
)
3985 name
= "complex long long unsigned int";
3990 TYPE_NAME (t
) = get_identifier (name
);
3996 /* Return OP, stripped of any conversions to wider types as much as is safe.
3997 Converting the value back to OP's type makes a value equivalent to OP.
3999 If FOR_TYPE is nonzero, we return a value which, if converted to
4000 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4002 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4003 narrowest type that can hold the value, even if they don't exactly fit.
4004 Otherwise, bit-field references are changed to a narrower type
4005 only if they can be fetched directly from memory in that type.
4007 OP must have integer, real or enumeral type. Pointers are not allowed!
4009 There are some cases where the obvious value we could return
4010 would regenerate to OP if converted to OP's type,
4011 but would not extend like OP to wider types.
4012 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4013 For example, if OP is (unsigned short)(signed char)-1,
4014 we avoid returning (signed char)-1 if FOR_TYPE is int,
4015 even though extending that to an unsigned short would regenerate OP,
4016 since the result of extending (signed char)-1 to (int)
4017 is different from (int) OP. */
4020 get_unwidened (op
, for_type
)
4024 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4025 tree type
= TREE_TYPE (op
);
4027 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4029 = (for_type
!= 0 && for_type
!= type
4030 && final_prec
> TYPE_PRECISION (type
)
4031 && TREE_UNSIGNED (type
));
4034 while (TREE_CODE (op
) == NOP_EXPR
)
4037 = TYPE_PRECISION (TREE_TYPE (op
))
4038 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4040 /* Truncations are many-one so cannot be removed.
4041 Unless we are later going to truncate down even farther. */
4043 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4046 /* See what's inside this conversion. If we decide to strip it,
4048 op
= TREE_OPERAND (op
, 0);
4050 /* If we have not stripped any zero-extensions (uns is 0),
4051 we can strip any kind of extension.
4052 If we have previously stripped a zero-extension,
4053 only zero-extensions can safely be stripped.
4054 Any extension can be stripped if the bits it would produce
4055 are all going to be discarded later by truncating to FOR_TYPE. */
4059 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4061 /* TREE_UNSIGNED says whether this is a zero-extension.
4062 Let's avoid computing it if it does not affect WIN
4063 and if UNS will not be needed again. */
4064 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4065 && TREE_UNSIGNED (TREE_TYPE (op
)))
4073 if (TREE_CODE (op
) == COMPONENT_REF
4074 /* Since type_for_size always gives an integer type. */
4075 && TREE_CODE (type
) != REAL_TYPE
4076 /* Don't crash if field not laid out yet. */
4077 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4078 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4080 unsigned int innerprec
4081 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4082 int unsignedp
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4083 type
= (*lang_hooks
.types
.type_for_size
) (innerprec
, unsignedp
);
4085 /* We can get this structure field in the narrowest type it fits in.
4086 If FOR_TYPE is 0, do this only for a field that matches the
4087 narrower type exactly and is aligned for it
4088 The resulting extension to its nominal type (a fullword type)
4089 must fit the same conditions as for other extensions. */
4091 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4092 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4093 && (! uns
|| final_prec
<= innerprec
|| unsignedp
)
4096 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4097 TREE_OPERAND (op
, 1));
4098 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4099 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4106 /* Return OP or a simpler expression for a narrower value
4107 which can be sign-extended or zero-extended to give back OP.
4108 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4109 or 0 if the value should be sign-extended. */
4112 get_narrower (op
, unsignedp_ptr
)
4120 while (TREE_CODE (op
) == NOP_EXPR
)
4123 = (TYPE_PRECISION (TREE_TYPE (op
))
4124 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4126 /* Truncations are many-one so cannot be removed. */
4130 /* See what's inside this conversion. If we decide to strip it,
4135 op
= TREE_OPERAND (op
, 0);
4136 /* An extension: the outermost one can be stripped,
4137 but remember whether it is zero or sign extension. */
4139 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4140 /* Otherwise, if a sign extension has been stripped,
4141 only sign extensions can now be stripped;
4142 if a zero extension has been stripped, only zero-extensions. */
4143 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4147 else /* bitschange == 0 */
4149 /* A change in nominal type can always be stripped, but we must
4150 preserve the unsignedness. */
4152 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4154 op
= TREE_OPERAND (op
, 0);
4160 if (TREE_CODE (op
) == COMPONENT_REF
4161 /* Since type_for_size always gives an integer type. */
4162 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4163 /* Ensure field is laid out already. */
4164 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4166 unsigned HOST_WIDE_INT innerprec
4167 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4168 tree type
= (*lang_hooks
.types
.type_for_size
) (innerprec
,
4169 TREE_UNSIGNED (op
));
4171 /* We can get this structure field in a narrower type that fits it,
4172 but the resulting extension to its nominal type (a fullword type)
4173 must satisfy the same conditions as for other extensions.
4175 Do this only for fields that are aligned (not bit-fields),
4176 because when bit-field insns will be used there is no
4177 advantage in doing this. */
4179 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4180 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4181 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4185 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4186 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4187 TREE_OPERAND (op
, 1));
4188 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4189 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4192 *unsignedp_ptr
= uns
;
4196 /* Nonzero if integer constant C has a value that is permissible
4197 for type TYPE (an INTEGER_TYPE). */
4200 int_fits_type_p (c
, type
)
4203 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4204 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4205 int ok_for_low_bound
, ok_for_high_bound
;
4207 /* Perform some generic filtering first, which may allow making a decision
4208 even if the bounds are not constant. First, negative integers never fit
4209 in unsigned types, */
4210 if ((TREE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4211 /* Also, unsigned integers with top bit set never fit signed types. */
4212 || (! TREE_UNSIGNED (type
)
4213 && TREE_UNSIGNED (TREE_TYPE (c
)) && tree_int_cst_msb (c
)))
4216 /* If at least one bound of the type is a constant integer, we can check
4217 ourselves and maybe make a decision. If no such decision is possible, but
4218 this type is a subtype, try checking against that. Otherwise, use
4219 force_fit_type, which checks against the precision.
4221 Compute the status for each possibly constant bound, and return if we see
4222 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4223 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4224 for "constant known to fit". */
4226 ok_for_low_bound
= -1;
4227 ok_for_high_bound
= -1;
4229 /* Check if C >= type_low_bound. */
4230 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4232 ok_for_low_bound
= ! tree_int_cst_lt (c
, type_low_bound
);
4233 if (! ok_for_low_bound
)
4237 /* Check if c <= type_high_bound. */
4238 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4240 ok_for_high_bound
= ! tree_int_cst_lt (type_high_bound
, c
);
4241 if (! ok_for_high_bound
)
4245 /* If the constant fits both bounds, the result is known. */
4246 if (ok_for_low_bound
== 1 && ok_for_high_bound
== 1)
4249 /* If we haven't been able to decide at this point, there nothing more we
4250 can check ourselves here. Look at the base type if we have one. */
4251 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4252 return int_fits_type_p (c
, TREE_TYPE (type
));
4254 /* Or to force_fit_type, if nothing else. */
4258 TREE_TYPE (c
) = type
;
4259 return !force_fit_type (c
, 0);
4263 /* Returns true if T is, contains, or refers to a type with variable
4264 size. This concept is more general than that of C99 'variably
4265 modified types': in C99, a struct type is never variably modified
4266 because a VLA may not appear as a structure member. However, in
4269 struct S { int i[f()]; };
4271 is valid, and other languages may define similar constructs. */
4274 variably_modified_type_p (type
)
4277 if (type
== error_mark_node
)
4280 /* If TYPE itself has variable size, it is variably modified.
4282 We do not yet have a representation of the C99 '[*]' syntax.
4283 When a representation is chosen, this function should be modified
4284 to test for that case as well. */
4285 if (TYPE_SIZE (type
)
4286 && TYPE_SIZE (type
) != error_mark_node
4287 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4290 /* If TYPE is a pointer or reference, it is variably modified if
4291 the type pointed to is variably modified. */
4292 if ((TREE_CODE (type
) == POINTER_TYPE
4293 || TREE_CODE (type
) == REFERENCE_TYPE
)
4294 && variably_modified_type_p (TREE_TYPE (type
)))
4297 /* If TYPE is an array, it is variably modified if the array
4298 elements are. (Note that the VLA case has already been checked
4300 if (TREE_CODE (type
) == ARRAY_TYPE
4301 && variably_modified_type_p (TREE_TYPE (type
)))
4304 /* If TYPE is a function type, it is variably modified if any of the
4305 parameters or the return type are variably modified. */
4306 if (TREE_CODE (type
) == FUNCTION_TYPE
4307 || TREE_CODE (type
) == METHOD_TYPE
)
4311 if (variably_modified_type_p (TREE_TYPE (type
)))
4313 for (parm
= TYPE_ARG_TYPES (type
);
4314 parm
&& parm
!= void_list_node
;
4315 parm
= TREE_CHAIN (parm
))
4316 if (variably_modified_type_p (TREE_VALUE (parm
)))
4320 /* The current language may have other cases to check, but in general,
4321 all other types are not variably modified. */
4322 return (*lang_hooks
.tree_inlining
.var_mod_type_p
) (type
);
4325 /* Given a DECL or TYPE, return the scope in which it was declared, or
4326 NULL_TREE if there is no containing scope. */
4329 get_containing_scope (t
)
4332 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4335 /* Return the innermost context enclosing DECL that is
4336 a FUNCTION_DECL, or zero if none. */
4339 decl_function_context (decl
)
4344 if (TREE_CODE (decl
) == ERROR_MARK
)
4347 if (TREE_CODE (decl
) == SAVE_EXPR
)
4348 context
= SAVE_EXPR_CONTEXT (decl
);
4350 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4351 where we look up the function at runtime. Such functions always take
4352 a first argument of type 'pointer to real context'.
4354 C++ should really be fixed to use DECL_CONTEXT for the real context,
4355 and use something else for the "virtual context". */
4356 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4359 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4361 context
= DECL_CONTEXT (decl
);
4363 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4365 if (TREE_CODE (context
) == BLOCK
)
4366 context
= BLOCK_SUPERCONTEXT (context
);
4368 context
= get_containing_scope (context
);
4374 /* Return the innermost context enclosing DECL that is
4375 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4376 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4379 decl_type_context (decl
)
4382 tree context
= DECL_CONTEXT (decl
);
4386 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4389 if (TREE_CODE (context
) == RECORD_TYPE
4390 || TREE_CODE (context
) == UNION_TYPE
4391 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4394 if (TREE_CODE (context
) == TYPE_DECL
4395 || TREE_CODE (context
) == FUNCTION_DECL
)
4396 context
= DECL_CONTEXT (context
);
4398 else if (TREE_CODE (context
) == BLOCK
)
4399 context
= BLOCK_SUPERCONTEXT (context
);
4402 /* Unhandled CONTEXT!? */
4408 /* CALL is a CALL_EXPR. Return the declaration for the function
4409 called, or NULL_TREE if the called function cannot be
4413 get_callee_fndecl (call
)
4418 /* It's invalid to call this function with anything but a
4420 if (TREE_CODE (call
) != CALL_EXPR
)
4423 /* The first operand to the CALL is the address of the function
4425 addr
= TREE_OPERAND (call
, 0);
4429 /* If this is a readonly function pointer, extract its initial value. */
4430 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
4431 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
4432 && DECL_INITIAL (addr
))
4433 addr
= DECL_INITIAL (addr
);
4435 /* If the address is just `&f' for some function `f', then we know
4436 that `f' is being called. */
4437 if (TREE_CODE (addr
) == ADDR_EXPR
4438 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4439 return TREE_OPERAND (addr
, 0);
4441 /* We couldn't figure out what was being called. */
4445 /* Print debugging information about tree nodes generated during the compile,
4446 and any language-specific information. */
4449 dump_tree_statistics ()
4451 #ifdef GATHER_STATISTICS
4453 int total_nodes
, total_bytes
;
4456 fprintf (stderr
, "\n??? tree nodes created\n\n");
4457 #ifdef GATHER_STATISTICS
4458 fprintf (stderr
, "Kind Nodes Bytes\n");
4459 fprintf (stderr
, "-------------------------------------\n");
4460 total_nodes
= total_bytes
= 0;
4461 for (i
= 0; i
< (int) all_kinds
; i
++)
4463 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4464 tree_node_counts
[i
], tree_node_sizes
[i
]);
4465 total_nodes
+= tree_node_counts
[i
];
4466 total_bytes
+= tree_node_sizes
[i
];
4468 fprintf (stderr
, "-------------------------------------\n");
4469 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4470 fprintf (stderr
, "-------------------------------------\n");
4472 fprintf (stderr
, "(No per-node statistics)\n");
4474 print_type_hash_statistics ();
4475 (*lang_hooks
.print_statistics
) ();
4478 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4480 const char *flag_random_seed
;
4482 /* Set up a default flag_random_seed value, if there wasn't one already. */
4485 default_flag_random_seed (void)
4487 unsigned HOST_WIDE_INT value
;
4488 char *new_random_seed
;
4490 if (flag_random_seed
!= NULL
)
4493 /* Get some more or less random data. */
4494 #ifdef HAVE_GETTIMEOFDAY
4498 gettimeofday (&tv
, NULL
);
4499 value
= (((unsigned HOST_WIDE_INT
) tv
.tv_usec
<< 16)
4500 ^ tv
.tv_sec
^ getpid ());
4506 /* This slightly overestimates the space required. */
4507 new_random_seed
= xmalloc (HOST_BITS_PER_WIDE_INT
/ 3 + 2);
4508 sprintf (new_random_seed
, HOST_WIDE_INT_PRINT_UNSIGNED
, value
);
4509 flag_random_seed
= new_random_seed
;
4512 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4513 clashes in cases where we can't reliably choose a unique name.
4515 Derived from mkstemp.c in libiberty. */
4518 append_random_chars (template)
4521 static const char letters
[]
4522 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4523 unsigned HOST_WIDE_INT v
;
4526 default_flag_random_seed ();
4528 /* This isn't a very good hash, but it does guarantee no collisions
4529 when the random string is generated by the code above and the time
4532 for (i
= 0; i
< strlen (flag_random_seed
); i
++)
4533 v
= (v
<< 4) ^ (v
>> (HOST_BITS_PER_WIDE_INT
- 4)) ^ flag_random_seed
[i
];
4535 template += strlen (template);
4537 /* Fill in the random bits. */
4538 template[0] = letters
[v
% 62];
4540 template[1] = letters
[v
% 62];
4542 template[2] = letters
[v
% 62];
4544 template[3] = letters
[v
% 62];
4546 template[4] = letters
[v
% 62];
4548 template[5] = letters
[v
% 62];
4553 /* P is a string that will be used in a symbol. Mask out any characters
4554 that are not valid in that context. */
4557 clean_symbol_name (p
)
4562 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4565 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4572 /* Generate a name for a function unique to this translation unit.
4573 TYPE is some string to identify the purpose of this function to the
4574 linker or collect2. */
4577 get_file_function_name_long (type
)
4584 if (first_global_object_name
)
4585 p
= first_global_object_name
;
4588 /* We don't have anything that we know to be unique to this translation
4589 unit, so use what we do have and throw in some randomness. */
4591 const char *name
= weak_global_object_name
;
4592 const char *file
= main_input_filename
;
4597 file
= input_filename
;
4599 q
= (char *) alloca (7 + strlen (name
) + strlen (file
));
4601 sprintf (q
, "%s%s", name
, file
);
4602 append_random_chars (q
);
4606 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
4609 /* Set up the name of the file-level functions we may need.
4610 Use a global object (which is already required to be unique over
4611 the program) rather than the file name (which imposes extra
4613 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
4615 /* Don't need to pull weird characters out of global names. */
4616 if (p
!= first_global_object_name
)
4617 clean_symbol_name (buf
+ 11);
4619 return get_identifier (buf
);
4622 /* If KIND=='I', return a suitable global initializer (constructor) name.
4623 If KIND=='D', return a suitable global clean-up (destructor) name. */
4626 get_file_function_name (kind
)
4634 return get_file_function_name_long (p
);
4637 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4638 The result is placed in BUFFER (which has length BIT_SIZE),
4639 with one bit in each char ('\000' or '\001').
4641 If the constructor is constant, NULL_TREE is returned.
4642 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4645 get_set_constructor_bits (init
, buffer
, bit_size
)
4652 HOST_WIDE_INT domain_min
4653 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
4654 tree non_const_bits
= NULL_TREE
;
4656 for (i
= 0; i
< bit_size
; i
++)
4659 for (vals
= TREE_OPERAND (init
, 1);
4660 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4662 if (!host_integerp (TREE_VALUE (vals
), 0)
4663 || (TREE_PURPOSE (vals
) != NULL_TREE
4664 && !host_integerp (TREE_PURPOSE (vals
), 0)))
4666 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4667 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4669 /* Set a range of bits to ones. */
4670 HOST_WIDE_INT lo_index
4671 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
4672 HOST_WIDE_INT hi_index
4673 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4675 if (lo_index
< 0 || lo_index
>= bit_size
4676 || hi_index
< 0 || hi_index
>= bit_size
)
4678 for (; lo_index
<= hi_index
; lo_index
++)
4679 buffer
[lo_index
] = 1;
4683 /* Set a single bit to one. */
4685 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4686 if (index
< 0 || index
>= bit_size
)
4688 error ("invalid initializer for bit string");
4694 return non_const_bits
;
4697 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4698 The result is placed in BUFFER (which is an array of bytes).
4699 If the constructor is constant, NULL_TREE is returned.
4700 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4703 get_set_constructor_bytes (init
, buffer
, wd_size
)
4705 unsigned char *buffer
;
4709 int set_word_size
= BITS_PER_UNIT
;
4710 int bit_size
= wd_size
* set_word_size
;
4712 unsigned char *bytep
= buffer
;
4713 char *bit_buffer
= (char *) alloca (bit_size
);
4714 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4716 for (i
= 0; i
< wd_size
; i
++)
4719 for (i
= 0; i
< bit_size
; i
++)
4723 if (BYTES_BIG_ENDIAN
)
4724 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4726 *bytep
|= 1 << bit_pos
;
4729 if (bit_pos
>= set_word_size
)
4730 bit_pos
= 0, bytep
++;
4732 return non_const_bits
;
4735 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4736 /* Complain that the tree code of NODE does not match the expected CODE.
4737 FILE, LINE, and FUNCTION are of the caller. */
4740 tree_check_failed (node
, code
, file
, line
, function
)
4742 enum tree_code code
;
4745 const char *function
;
4747 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4748 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
4749 function
, trim_filename (file
), line
);
4752 /* Similar to above, except that we check for a class of tree
4753 code, given in CL. */
4756 tree_class_check_failed (node
, cl
, file
, line
, function
)
4761 const char *function
;
4764 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4765 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
4766 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
4769 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
4770 (dynamically sized) vector. */
4773 tree_vec_elt_check_failed (idx
, len
, file
, line
, function
)
4778 const char *function
;
4781 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
4782 idx
+ 1, len
, function
, trim_filename (file
), line
);
4785 /* Similar to above, except that the check is for the bounds of the operand
4786 vector of an expression node. */
4789 tree_operand_check_failed (idx
, code
, file
, line
, function
)
4791 enum tree_code code
;
4794 const char *function
;
4797 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
4798 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
4799 function
, trim_filename (file
), line
);
4801 #endif /* ENABLE_TREE_CHECKING */
4803 /* For a new vector type node T, build the information necessary for
4804 debugging output. */
4807 finish_vector_type (t
)
4813 tree index
= build_int_2 (TYPE_VECTOR_SUBPARTS (t
) - 1, 0);
4814 tree array
= build_array_type (TREE_TYPE (t
),
4815 build_index_type (index
));
4816 tree rt
= make_node (RECORD_TYPE
);
4818 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
4819 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
4821 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
4822 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4823 the representation type, and we want to find that die when looking up
4824 the vector type. This is most easily achieved by making the TYPE_UID
4826 TYPE_UID (rt
) = TYPE_UID (t
);
4830 /* Create nodes for all integer types (and error_mark_node) using the sizes
4831 of C datatypes. The caller should call set_sizetype soon after calling
4832 this function to select one of the types as sizetype. */
4835 build_common_tree_nodes (signed_char
)
4838 error_mark_node
= make_node (ERROR_MARK
);
4839 TREE_TYPE (error_mark_node
) = error_mark_node
;
4841 initialize_sizetypes ();
4843 /* Define both `signed char' and `unsigned char'. */
4844 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
4845 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
4847 /* Define `char', which is like either `signed char' or `unsigned char'
4848 but not the same as either. */
4851 ? make_signed_type (CHAR_TYPE_SIZE
)
4852 : make_unsigned_type (CHAR_TYPE_SIZE
));
4854 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
4855 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
4856 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
4857 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
4858 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
4859 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
4860 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
4861 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
4863 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
4864 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
4865 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
4866 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
4867 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
4869 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
4870 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
4871 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
4872 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
4873 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
4876 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4877 It will create several other common tree nodes. */
4880 build_common_tree_nodes_2 (short_double
)
4883 /* Define these next since types below may used them. */
4884 integer_zero_node
= build_int_2 (0, 0);
4885 integer_one_node
= build_int_2 (1, 0);
4886 integer_minus_one_node
= build_int_2 (-1, -1);
4888 size_zero_node
= size_int (0);
4889 size_one_node
= size_int (1);
4890 bitsize_zero_node
= bitsize_int (0);
4891 bitsize_one_node
= bitsize_int (1);
4892 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
4894 void_type_node
= make_node (VOID_TYPE
);
4895 layout_type (void_type_node
);
4897 /* We are not going to have real types in C with less than byte alignment,
4898 so we might as well not have any types that claim to have it. */
4899 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
4900 TYPE_USER_ALIGN (void_type_node
) = 0;
4902 null_pointer_node
= build_int_2 (0, 0);
4903 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
4904 layout_type (TREE_TYPE (null_pointer_node
));
4906 ptr_type_node
= build_pointer_type (void_type_node
);
4908 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
4910 float_type_node
= make_node (REAL_TYPE
);
4911 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
4912 layout_type (float_type_node
);
4914 double_type_node
= make_node (REAL_TYPE
);
4916 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
4918 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
4919 layout_type (double_type_node
);
4921 long_double_type_node
= make_node (REAL_TYPE
);
4922 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
4923 layout_type (long_double_type_node
);
4925 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
4926 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
4927 layout_type (complex_integer_type_node
);
4929 complex_float_type_node
= make_node (COMPLEX_TYPE
);
4930 TREE_TYPE (complex_float_type_node
) = float_type_node
;
4931 layout_type (complex_float_type_node
);
4933 complex_double_type_node
= make_node (COMPLEX_TYPE
);
4934 TREE_TYPE (complex_double_type_node
) = double_type_node
;
4935 layout_type (complex_double_type_node
);
4937 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
4938 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
4939 layout_type (complex_long_double_type_node
);
4943 BUILD_VA_LIST_TYPE (t
);
4945 /* Many back-ends define record types without seting TYPE_NAME.
4946 If we copied the record type here, we'd keep the original
4947 record type without a name. This breaks name mangling. So,
4948 don't copy record types and let c_common_nodes_and_builtins()
4949 declare the type to be __builtin_va_list. */
4950 if (TREE_CODE (t
) != RECORD_TYPE
)
4951 t
= build_type_copy (t
);
4953 va_list_type_node
= t
;
4956 unsigned_V4SI_type_node
4957 = make_vector (V4SImode
, unsigned_intSI_type_node
, 1);
4958 unsigned_V2HI_type_node
4959 = make_vector (V2HImode
, unsigned_intHI_type_node
, 1);
4960 unsigned_V2SI_type_node
4961 = make_vector (V2SImode
, unsigned_intSI_type_node
, 1);
4962 unsigned_V2DI_type_node
4963 = make_vector (V2DImode
, unsigned_intDI_type_node
, 1);
4964 unsigned_V4HI_type_node
4965 = make_vector (V4HImode
, unsigned_intHI_type_node
, 1);
4966 unsigned_V8QI_type_node
4967 = make_vector (V8QImode
, unsigned_intQI_type_node
, 1);
4968 unsigned_V8HI_type_node
4969 = make_vector (V8HImode
, unsigned_intHI_type_node
, 1);
4970 unsigned_V16QI_type_node
4971 = make_vector (V16QImode
, unsigned_intQI_type_node
, 1);
4972 unsigned_V1DI_type_node
4973 = make_vector (V1DImode
, unsigned_intDI_type_node
, 1);
4975 V16SF_type_node
= make_vector (V16SFmode
, float_type_node
, 0);
4976 V4SF_type_node
= make_vector (V4SFmode
, float_type_node
, 0);
4977 V4SI_type_node
= make_vector (V4SImode
, intSI_type_node
, 0);
4978 V2HI_type_node
= make_vector (V2HImode
, intHI_type_node
, 0);
4979 V2SI_type_node
= make_vector (V2SImode
, intSI_type_node
, 0);
4980 V2DI_type_node
= make_vector (V2DImode
, intDI_type_node
, 0);
4981 V4HI_type_node
= make_vector (V4HImode
, intHI_type_node
, 0);
4982 V8QI_type_node
= make_vector (V8QImode
, intQI_type_node
, 0);
4983 V8HI_type_node
= make_vector (V8HImode
, intHI_type_node
, 0);
4984 V2SF_type_node
= make_vector (V2SFmode
, float_type_node
, 0);
4985 V2DF_type_node
= make_vector (V2DFmode
, double_type_node
, 0);
4986 V16QI_type_node
= make_vector (V16QImode
, intQI_type_node
, 0);
4987 V1DI_type_node
= make_vector (V1DImode
, intDI_type_node
, 0);
4990 /* Returns a vector tree node given a vector mode, the inner type, and
4994 make_vector (mode
, innertype
, unsignedp
)
4995 enum machine_mode mode
;
5001 t
= make_node (VECTOR_TYPE
);
5002 TREE_TYPE (t
) = innertype
;
5003 TYPE_MODE (t
) = mode
;
5004 TREE_UNSIGNED (TREE_TYPE (t
)) = unsignedp
;
5005 finish_vector_type (t
);
5010 /* Given an initializer INIT, return TRUE if INIT is zero or some
5011 aggregate of zeros. Otherwise return FALSE. */
5014 initializer_zerop (init
)
5019 switch (TREE_CODE (init
))
5022 return integer_zerop (init
);
5024 return real_zerop (init
)
5025 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
5027 return integer_zerop (init
)
5028 || (real_zerop (init
)
5029 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
5030 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
5033 if (AGGREGATE_TYPE_P (TREE_TYPE (init
)))
5035 tree aggr_init
= CONSTRUCTOR_ELTS (init
);
5039 if (! initializer_zerop (TREE_VALUE (aggr_init
)))
5041 aggr_init
= TREE_CHAIN (aggr_init
);
5052 #include "gt-tree.h"
projects / gcc.git / blob