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 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
) = lineno
;
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'. */
1038 #ifdef ENABLE_TREE_CHECKING
1042 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1044 TREE_CHAIN (t1
) = op2
;
1045 #ifdef ENABLE_TREE_CHECKING
1046 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1048 abort (); /* Circularity created. */
1056 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1064 while ((next
= TREE_CHAIN (chain
)))
1069 /* Reverse the order of elements in the chain T,
1070 and return the new head of the chain (old last element). */
1076 tree prev
= 0, decl
, next
;
1077 for (decl
= t
; decl
; decl
= next
)
1079 next
= TREE_CHAIN (decl
);
1080 TREE_CHAIN (decl
) = prev
;
1086 /* Return a newly created TREE_LIST node whose
1087 purpose and value fields are PARM and VALUE. */
1090 build_tree_list (parm
, value
)
1093 tree t
= make_node (TREE_LIST
);
1094 TREE_PURPOSE (t
) = parm
;
1095 TREE_VALUE (t
) = value
;
1099 /* Return a newly created TREE_LIST node whose
1100 purpose and value fields are PURPOSE and VALUE
1101 and whose TREE_CHAIN is CHAIN. */
1104 tree_cons (purpose
, value
, chain
)
1105 tree purpose
, value
, chain
;
1109 node
= ggc_alloc_tree (sizeof (struct tree_list
));
1111 memset (node
, 0, sizeof (struct tree_common
));
1113 #ifdef GATHER_STATISTICS
1114 tree_node_counts
[(int) x_kind
]++;
1115 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1118 TREE_SET_CODE (node
, TREE_LIST
);
1119 TREE_CHAIN (node
) = chain
;
1120 TREE_PURPOSE (node
) = purpose
;
1121 TREE_VALUE (node
) = value
;
1126 /* Return the size nominally occupied by an object of type TYPE
1127 when it resides in memory. The value is measured in units of bytes,
1128 and its data type is that normally used for type sizes
1129 (which is the first type created by make_signed_type or
1130 make_unsigned_type). */
1133 size_in_bytes (type
)
1138 if (type
== error_mark_node
)
1139 return integer_zero_node
;
1141 type
= TYPE_MAIN_VARIANT (type
);
1142 t
= TYPE_SIZE_UNIT (type
);
1146 (*lang_hooks
.types
.incomplete_type_error
) (NULL_TREE
, type
);
1147 return size_zero_node
;
1150 if (TREE_CODE (t
) == INTEGER_CST
)
1151 force_fit_type (t
, 0);
1156 /* Return the size of TYPE (in bytes) as a wide integer
1157 or return -1 if the size can vary or is larger than an integer. */
1160 int_size_in_bytes (type
)
1165 if (type
== error_mark_node
)
1168 type
= TYPE_MAIN_VARIANT (type
);
1169 t
= TYPE_SIZE_UNIT (type
);
1171 || TREE_CODE (t
) != INTEGER_CST
1172 || TREE_OVERFLOW (t
)
1173 || TREE_INT_CST_HIGH (t
) != 0
1174 /* If the result would appear negative, it's too big to represent. */
1175 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1178 return TREE_INT_CST_LOW (t
);
1181 /* Return the bit position of FIELD, in bits from the start of the record.
1182 This is a tree of type bitsizetype. */
1185 bit_position (field
)
1189 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1190 DECL_FIELD_BIT_OFFSET (field
));
1193 /* Likewise, but return as an integer. Abort if it cannot be represented
1194 in that way (since it could be a signed value, we don't have the option
1195 of returning -1 like int_size_in_byte can. */
1198 int_bit_position (field
)
1201 return tree_low_cst (bit_position (field
), 0);
1204 /* Return the byte position of FIELD, in bytes from the start of the record.
1205 This is a tree of type sizetype. */
1208 byte_position (field
)
1211 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1212 DECL_FIELD_BIT_OFFSET (field
));
1215 /* Likewise, but return as an integer. Abort if it cannot be represented
1216 in that way (since it could be a signed value, we don't have the option
1217 of returning -1 like int_size_in_byte can. */
1220 int_byte_position (field
)
1223 return tree_low_cst (byte_position (field
), 0);
1226 /* Return the strictest alignment, in bits, that T is known to have. */
1232 unsigned int align0
, align1
;
1234 switch (TREE_CODE (t
))
1236 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1237 /* If we have conversions, we know that the alignment of the
1238 object must meet each of the alignments of the types. */
1239 align0
= expr_align (TREE_OPERAND (t
, 0));
1240 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1241 return MAX (align0
, align1
);
1243 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1244 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1245 case WITH_RECORD_EXPR
: case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
1246 /* These don't change the alignment of an object. */
1247 return expr_align (TREE_OPERAND (t
, 0));
1250 /* The best we can do is say that the alignment is the least aligned
1252 align0
= expr_align (TREE_OPERAND (t
, 1));
1253 align1
= expr_align (TREE_OPERAND (t
, 2));
1254 return MIN (align0
, align1
);
1256 case LABEL_DECL
: case CONST_DECL
:
1257 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1258 if (DECL_ALIGN (t
) != 0)
1259 return DECL_ALIGN (t
);
1263 return FUNCTION_BOUNDARY
;
1269 /* Otherwise take the alignment from that of the type. */
1270 return TYPE_ALIGN (TREE_TYPE (t
));
1273 /* Return, as a tree node, the number of elements for TYPE (which is an
1274 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1277 array_type_nelts (type
)
1280 tree index_type
, min
, max
;
1282 /* If they did it with unspecified bounds, then we should have already
1283 given an error about it before we got here. */
1284 if (! TYPE_DOMAIN (type
))
1285 return error_mark_node
;
1287 index_type
= TYPE_DOMAIN (type
);
1288 min
= TYPE_MIN_VALUE (index_type
);
1289 max
= TYPE_MAX_VALUE (index_type
);
1291 return (integer_zerop (min
)
1293 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1296 /* Return nonzero if arg is static -- a reference to an object in
1297 static storage. This is not the same as the C meaning of `static'. */
1303 switch (TREE_CODE (arg
))
1306 /* Nested functions aren't static, since taking their address
1307 involves a trampoline. */
1308 return ((decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1309 && ! DECL_NON_ADDR_CONST_P (arg
));
1312 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1313 && ! DECL_THREAD_LOCAL (arg
)
1314 && ! DECL_NON_ADDR_CONST_P (arg
));
1317 return TREE_STATIC (arg
);
1323 /* If we are referencing a bitfield, we can't evaluate an
1324 ADDR_EXPR at compile time and so it isn't a constant. */
1326 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
1327 && staticp (TREE_OPERAND (arg
, 0)));
1333 /* This case is technically correct, but results in setting
1334 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1337 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
1341 case ARRAY_RANGE_REF
:
1342 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1343 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1344 return staticp (TREE_OPERAND (arg
, 0));
1347 if ((unsigned int) TREE_CODE (arg
)
1348 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1349 return (*lang_hooks
.staticp
) (arg
);
1355 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1356 Do this to any expression which may be used in more than one place,
1357 but must be evaluated only once.
1359 Normally, expand_expr would reevaluate the expression each time.
1360 Calling save_expr produces something that is evaluated and recorded
1361 the first time expand_expr is called on it. Subsequent calls to
1362 expand_expr just reuse the recorded value.
1364 The call to expand_expr that generates code that actually computes
1365 the value is the first call *at compile time*. Subsequent calls
1366 *at compile time* generate code to use the saved value.
1367 This produces correct result provided that *at run time* control
1368 always flows through the insns made by the first expand_expr
1369 before reaching the other places where the save_expr was evaluated.
1370 You, the caller of save_expr, must make sure this is so.
1372 Constants, and certain read-only nodes, are returned with no
1373 SAVE_EXPR because that is safe. Expressions containing placeholders
1374 are not touched; see tree.def for an explanation of what these
1381 tree t
= fold (expr
);
1382 tree inner
= skip_simple_arithmetic (t
);
1384 /* If the tree evaluates to a constant, then we don't want to hide that
1385 fact (i.e. this allows further folding, and direct checks for constants).
1386 However, a read-only object that has side effects cannot be bypassed.
1387 Since it is no problem to reevaluate literals, we just return the
1389 if (TREE_CONSTANT (inner
)
1390 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1391 || TREE_CODE (inner
) == SAVE_EXPR
1392 || TREE_CODE (inner
) == ERROR_MARK
)
1395 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1396 it means that the size or offset of some field of an object depends on
1397 the value within another field.
1399 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1400 and some variable since it would then need to be both evaluated once and
1401 evaluated more than once. Front-ends must assure this case cannot
1402 happen by surrounding any such subexpressions in their own SAVE_EXPR
1403 and forcing evaluation at the proper time. */
1404 if (contains_placeholder_p (inner
))
1407 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
1409 /* This expression might be placed ahead of a jump to ensure that the
1410 value was computed on both sides of the jump. So make sure it isn't
1411 eliminated as dead. */
1412 TREE_SIDE_EFFECTS (t
) = 1;
1413 TREE_READONLY (t
) = 1;
1417 /* Look inside EXPR and into any simple arithmetic operations. Return
1418 the innermost non-arithmetic node. */
1421 skip_simple_arithmetic (expr
)
1426 /* We don't care about whether this can be used as an lvalue in this
1428 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1429 expr
= TREE_OPERAND (expr
, 0);
1431 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1432 a constant, it will be more efficient to not make another SAVE_EXPR since
1433 it will allow better simplification and GCSE will be able to merge the
1434 computations if they actually occur. */
1438 if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '1')
1439 inner
= TREE_OPERAND (inner
, 0);
1440 else if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '2')
1442 if (TREE_CONSTANT (TREE_OPERAND (inner
, 1)))
1443 inner
= TREE_OPERAND (inner
, 0);
1444 else if (TREE_CONSTANT (TREE_OPERAND (inner
, 0)))
1445 inner
= TREE_OPERAND (inner
, 1);
1456 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
1457 SAVE_EXPR. Return FALSE otherwise. */
1463 return TREE_CODE (skip_simple_arithmetic (expr
)) == SAVE_EXPR
;
1466 /* Arrange for an expression to be expanded multiple independent
1467 times. This is useful for cleanup actions, as the backend can
1468 expand them multiple times in different places. */
1476 /* If this is already protected, no sense in protecting it again. */
1477 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
1480 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
1481 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
1485 /* Returns the index of the first non-tree operand for CODE, or the number
1486 of operands if all are trees. */
1490 enum tree_code code
;
1496 case GOTO_SUBROUTINE_EXPR
:
1499 case WITH_CLEANUP_EXPR
:
1501 case METHOD_CALL_EXPR
:
1504 return TREE_CODE_LENGTH (code
);
1508 /* Return which tree structure is used by T. */
1510 enum tree_node_structure_enum
1511 tree_node_structure (t
)
1514 enum tree_code code
= TREE_CODE (t
);
1516 switch (TREE_CODE_CLASS (code
))
1518 case 'd': return TS_DECL
;
1519 case 't': return TS_TYPE
;
1520 case 'b': return TS_BLOCK
;
1521 case 'r': case '<': case '1': case '2': case 'e': case 's':
1523 default: /* 'c' and 'x' */
1529 case INTEGER_CST
: return TS_INT_CST
;
1530 case REAL_CST
: return TS_REAL_CST
;
1531 case COMPLEX_CST
: return TS_COMPLEX
;
1532 case VECTOR_CST
: return TS_VECTOR
;
1533 case STRING_CST
: return TS_STRING
;
1535 case ERROR_MARK
: return TS_COMMON
;
1536 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1537 case TREE_LIST
: return TS_LIST
;
1538 case TREE_VEC
: return TS_VEC
;
1539 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1546 /* Perform any modifications to EXPR required when it is unsaved. Does
1547 not recurse into EXPR's subtrees. */
1550 unsave_expr_1 (expr
)
1553 switch (TREE_CODE (expr
))
1556 if (! SAVE_EXPR_PERSISTENT_P (expr
))
1557 SAVE_EXPR_RTL (expr
) = 0;
1561 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1562 It's OK for this to happen if it was part of a subtree that
1563 isn't immediately expanded, such as operand 2 of another
1565 if (TREE_OPERAND (expr
, 1))
1568 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
1569 TREE_OPERAND (expr
, 3) = NULL_TREE
;
1573 /* I don't yet know how to emit a sequence multiple times. */
1574 if (RTL_EXPR_SEQUENCE (expr
) != 0)
1583 /* Default lang hook for "unsave_expr_now". */
1586 lhd_unsave_expr_now (expr
)
1589 enum tree_code code
;
1591 /* There's nothing to do for NULL_TREE. */
1595 unsave_expr_1 (expr
);
1597 code
= TREE_CODE (expr
);
1598 switch (TREE_CODE_CLASS (code
))
1600 case 'c': /* a constant */
1601 case 't': /* a type node */
1602 case 'd': /* A decl node */
1603 case 'b': /* A block node */
1606 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1607 if (code
== TREE_LIST
)
1609 lhd_unsave_expr_now (TREE_VALUE (expr
));
1610 lhd_unsave_expr_now (TREE_CHAIN (expr
));
1614 case 'e': /* an expression */
1615 case 'r': /* a reference */
1616 case 's': /* an expression with side effects */
1617 case '<': /* a comparison expression */
1618 case '2': /* a binary arithmetic expression */
1619 case '1': /* a unary arithmetic expression */
1623 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
1624 lhd_unsave_expr_now (TREE_OPERAND (expr
, i
));
1635 /* Return 0 if it is safe to evaluate EXPR multiple times,
1636 return 1 if it is safe if EXPR is unsaved afterward, or
1637 return 2 if it is completely unsafe.
1639 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1640 an expression tree, so that it safe to unsave them and the surrounding
1641 context will be correct.
1643 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1644 occasionally across the whole of a function. It is therefore only
1645 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1646 below the UNSAVE_EXPR.
1648 RTL_EXPRs consume their rtl during evaluation. It is therefore
1649 never possible to unsave them. */
1652 unsafe_for_reeval (expr
)
1656 enum tree_code code
;
1661 if (expr
== NULL_TREE
)
1664 code
= TREE_CODE (expr
);
1665 first_rtl
= first_rtl_op (code
);
1674 for (exp
= expr
; exp
!= 0; exp
= TREE_CHAIN (exp
))
1676 tmp
= unsafe_for_reeval (TREE_VALUE (exp
));
1677 unsafeness
= MAX (tmp
, unsafeness
);
1683 tmp2
= unsafe_for_reeval (TREE_OPERAND (expr
, 0));
1684 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, 1));
1685 return MAX (MAX (tmp
, 1), tmp2
);
1692 tmp
= (*lang_hooks
.unsafe_for_reeval
) (expr
);
1698 switch (TREE_CODE_CLASS (code
))
1700 case 'c': /* a constant */
1701 case 't': /* a type node */
1702 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1703 case 'd': /* A decl node */
1704 case 'b': /* A block node */
1707 case 'e': /* an expression */
1708 case 'r': /* a reference */
1709 case 's': /* an expression with side effects */
1710 case '<': /* a comparison expression */
1711 case '2': /* a binary arithmetic expression */
1712 case '1': /* a unary arithmetic expression */
1713 for (i
= first_rtl
- 1; i
>= 0; i
--)
1715 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, i
));
1716 unsafeness
= MAX (tmp
, unsafeness
);
1726 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1727 or offset that depends on a field within a record. */
1730 contains_placeholder_p (exp
)
1733 enum tree_code code
;
1739 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1740 in it since it is supplying a value for it. */
1741 code
= TREE_CODE (exp
);
1742 if (code
== WITH_RECORD_EXPR
)
1744 else if (code
== PLACEHOLDER_EXPR
)
1747 switch (TREE_CODE_CLASS (code
))
1750 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1751 position computations since they will be converted into a
1752 WITH_RECORD_EXPR involving the reference, which will assume
1753 here will be valid. */
1754 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1757 if (code
== TREE_LIST
)
1758 return (contains_placeholder_p (TREE_VALUE (exp
))
1759 || (TREE_CHAIN (exp
) != 0
1760 && contains_placeholder_p (TREE_CHAIN (exp
))));
1769 /* Ignoring the first operand isn't quite right, but works best. */
1770 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
1777 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1778 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
1779 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
1782 /* If we already know this doesn't have a placeholder, don't
1784 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
1787 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
1788 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
1790 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
1795 return (TREE_OPERAND (exp
, 1) != 0
1796 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1802 switch (TREE_CODE_LENGTH (code
))
1805 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1807 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1808 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1819 /* Return 1 if EXP contains any expressions that produce cleanups for an
1820 outer scope to deal with. Used by fold. */
1828 if (! TREE_SIDE_EFFECTS (exp
))
1831 switch (TREE_CODE (exp
))
1834 case GOTO_SUBROUTINE_EXPR
:
1835 case WITH_CLEANUP_EXPR
:
1838 case CLEANUP_POINT_EXPR
:
1842 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
1844 cmp
= has_cleanups (TREE_VALUE (exp
));
1854 /* This general rule works for most tree codes. All exceptions should be
1855 handled above. If this is a language-specific tree code, we can't
1856 trust what might be in the operand, so say we don't know
1858 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
1861 nops
= first_rtl_op (TREE_CODE (exp
));
1862 for (i
= 0; i
< nops
; i
++)
1863 if (TREE_OPERAND (exp
, i
) != 0)
1865 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
1866 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
1867 || type
== 'r' || type
== 's')
1869 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
1878 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1879 return a tree with all occurrences of references to F in a
1880 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1881 contains only arithmetic expressions or a CALL_EXPR with a
1882 PLACEHOLDER_EXPR occurring only in its arglist. */
1885 substitute_in_expr (exp
, f
, r
)
1890 enum tree_code code
= TREE_CODE (exp
);
1895 switch (TREE_CODE_CLASS (code
))
1902 if (code
== PLACEHOLDER_EXPR
)
1904 else if (code
== TREE_LIST
)
1906 op0
= (TREE_CHAIN (exp
) == 0
1907 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
1908 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
1909 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1912 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1921 switch (TREE_CODE_LENGTH (code
))
1924 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1925 if (op0
== TREE_OPERAND (exp
, 0))
1928 if (code
== NON_LVALUE_EXPR
)
1931 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
1935 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
1936 could, but we don't support it. */
1937 if (code
== RTL_EXPR
)
1939 else if (code
== CONSTRUCTOR
)
1942 op0
= TREE_OPERAND (exp
, 0);
1943 op1
= TREE_OPERAND (exp
, 1);
1944 if (contains_placeholder_p (op0
))
1945 op0
= substitute_in_expr (op0
, f
, r
);
1946 if (contains_placeholder_p (op1
))
1947 op1
= substitute_in_expr (op1
, f
, r
);
1949 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
1952 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
1956 /* It cannot be that anything inside a SAVE_EXPR contains a
1957 PLACEHOLDER_EXPR. */
1958 if (code
== SAVE_EXPR
)
1961 else if (code
== CALL_EXPR
)
1963 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1964 if (op1
== TREE_OPERAND (exp
, 1))
1967 return build (code
, TREE_TYPE (exp
),
1968 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
1971 else if (code
!= COND_EXPR
)
1974 op0
= TREE_OPERAND (exp
, 0);
1975 op1
= TREE_OPERAND (exp
, 1);
1976 op2
= TREE_OPERAND (exp
, 2);
1978 if (contains_placeholder_p (op0
))
1979 op0
= substitute_in_expr (op0
, f
, r
);
1980 if (contains_placeholder_p (op1
))
1981 op1
= substitute_in_expr (op1
, f
, r
);
1982 if (contains_placeholder_p (op2
))
1983 op2
= substitute_in_expr (op2
, f
, r
);
1985 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
1986 && op2
== TREE_OPERAND (exp
, 2))
1989 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2002 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2003 and it is the right field, replace it with R. */
2004 for (inner
= TREE_OPERAND (exp
, 0);
2005 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2006 inner
= TREE_OPERAND (inner
, 0))
2008 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2009 && TREE_OPERAND (exp
, 1) == f
)
2012 /* If this expression hasn't been completed let, leave it
2014 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2015 && TREE_TYPE (inner
) == 0)
2018 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2019 if (op0
== TREE_OPERAND (exp
, 0))
2022 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2023 TREE_OPERAND (exp
, 1)));
2027 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2028 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2029 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2030 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2031 && op2
== TREE_OPERAND (exp
, 2))
2034 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2039 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2040 if (op0
== TREE_OPERAND (exp
, 0))
2043 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2055 TREE_READONLY (new) = TREE_READONLY (exp
);
2059 /* Stabilize a reference so that we can use it any number of times
2060 without causing its operands to be evaluated more than once.
2061 Returns the stabilized reference. This works by means of save_expr,
2062 so see the caveats in the comments about save_expr.
2064 Also allows conversion expressions whose operands are references.
2065 Any other kind of expression is returned unchanged. */
2068 stabilize_reference (ref
)
2072 enum tree_code code
= TREE_CODE (ref
);
2079 /* No action is needed in this case. */
2085 case FIX_TRUNC_EXPR
:
2086 case FIX_FLOOR_EXPR
:
2087 case FIX_ROUND_EXPR
:
2089 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2093 result
= build_nt (INDIRECT_REF
,
2094 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2098 result
= build_nt (COMPONENT_REF
,
2099 stabilize_reference (TREE_OPERAND (ref
, 0)),
2100 TREE_OPERAND (ref
, 1));
2104 result
= build_nt (BIT_FIELD_REF
,
2105 stabilize_reference (TREE_OPERAND (ref
, 0)),
2106 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2107 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2111 result
= build_nt (ARRAY_REF
,
2112 stabilize_reference (TREE_OPERAND (ref
, 0)),
2113 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2116 case ARRAY_RANGE_REF
:
2117 result
= build_nt (ARRAY_RANGE_REF
,
2118 stabilize_reference (TREE_OPERAND (ref
, 0)),
2119 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2123 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2124 it wouldn't be ignored. This matters when dealing with
2126 return stabilize_reference_1 (ref
);
2129 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2130 save_expr (build1 (ADDR_EXPR
,
2131 build_pointer_type (TREE_TYPE (ref
)),
2135 /* If arg isn't a kind of lvalue we recognize, make no change.
2136 Caller should recognize the error for an invalid lvalue. */
2141 return error_mark_node
;
2144 TREE_TYPE (result
) = TREE_TYPE (ref
);
2145 TREE_READONLY (result
) = TREE_READONLY (ref
);
2146 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2147 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2152 /* Subroutine of stabilize_reference; this is called for subtrees of
2153 references. Any expression with side-effects must be put in a SAVE_EXPR
2154 to ensure that it is only evaluated once.
2156 We don't put SAVE_EXPR nodes around everything, because assigning very
2157 simple expressions to temporaries causes us to miss good opportunities
2158 for optimizations. Among other things, the opportunity to fold in the
2159 addition of a constant into an addressing mode often gets lost, e.g.
2160 "y[i+1] += x;". In general, we take the approach that we should not make
2161 an assignment unless we are forced into it - i.e., that any non-side effect
2162 operator should be allowed, and that cse should take care of coalescing
2163 multiple utterances of the same expression should that prove fruitful. */
2166 stabilize_reference_1 (e
)
2170 enum tree_code code
= TREE_CODE (e
);
2172 /* We cannot ignore const expressions because it might be a reference
2173 to a const array but whose index contains side-effects. But we can
2174 ignore things that are actual constant or that already have been
2175 handled by this function. */
2177 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2180 switch (TREE_CODE_CLASS (code
))
2190 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2191 so that it will only be evaluated once. */
2192 /* The reference (r) and comparison (<) classes could be handled as
2193 below, but it is generally faster to only evaluate them once. */
2194 if (TREE_SIDE_EFFECTS (e
))
2195 return save_expr (e
);
2199 /* Constants need no processing. In fact, we should never reach
2204 /* Division is slow and tends to be compiled with jumps,
2205 especially the division by powers of 2 that is often
2206 found inside of an array reference. So do it just once. */
2207 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2208 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2209 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2210 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2211 return save_expr (e
);
2212 /* Recursively stabilize each operand. */
2213 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2214 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2218 /* Recursively stabilize each operand. */
2219 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2226 TREE_TYPE (result
) = TREE_TYPE (e
);
2227 TREE_READONLY (result
) = TREE_READONLY (e
);
2228 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2229 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2234 /* Low-level constructors for expressions. */
2236 /* Build an expression of code CODE, data type TYPE,
2237 and operands as specified by the arguments ARG1 and following arguments.
2238 Expressions and reference nodes can be created this way.
2239 Constants, decls, types and misc nodes cannot be. */
2242 build
VPARAMS ((enum tree_code code
, tree tt
, ...))
2251 VA_FIXEDARG (p
, enum tree_code
, code
);
2252 VA_FIXEDARG (p
, tree
, tt
);
2254 t
= make_node (code
);
2255 length
= TREE_CODE_LENGTH (code
);
2258 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2259 result based on those same flags for the arguments. But if the
2260 arguments aren't really even `tree' expressions, we shouldn't be trying
2262 fro
= first_rtl_op (code
);
2264 /* Expressions without side effects may be constant if their
2265 arguments are as well. */
2266 constant
= (TREE_CODE_CLASS (code
) == '<'
2267 || TREE_CODE_CLASS (code
) == '1'
2268 || TREE_CODE_CLASS (code
) == '2'
2269 || TREE_CODE_CLASS (code
) == 'c');
2273 /* This is equivalent to the loop below, but faster. */
2274 tree arg0
= va_arg (p
, tree
);
2275 tree arg1
= va_arg (p
, tree
);
2277 TREE_OPERAND (t
, 0) = arg0
;
2278 TREE_OPERAND (t
, 1) = arg1
;
2279 TREE_READONLY (t
) = 1;
2280 if (arg0
&& fro
> 0)
2282 if (TREE_SIDE_EFFECTS (arg0
))
2283 TREE_SIDE_EFFECTS (t
) = 1;
2284 if (!TREE_READONLY (arg0
))
2285 TREE_READONLY (t
) = 0;
2286 if (!TREE_CONSTANT (arg0
))
2290 if (arg1
&& fro
> 1)
2292 if (TREE_SIDE_EFFECTS (arg1
))
2293 TREE_SIDE_EFFECTS (t
) = 1;
2294 if (!TREE_READONLY (arg1
))
2295 TREE_READONLY (t
) = 0;
2296 if (!TREE_CONSTANT (arg1
))
2300 else if (length
== 1)
2302 tree arg0
= va_arg (p
, tree
);
2304 /* The only one-operand cases we handle here are those with side-effects.
2305 Others are handled with build1. So don't bother checked if the
2306 arg has side-effects since we'll already have set it.
2308 ??? This really should use build1 too. */
2309 if (TREE_CODE_CLASS (code
) != 's')
2311 TREE_OPERAND (t
, 0) = arg0
;
2315 for (i
= 0; i
< length
; i
++)
2317 tree operand
= va_arg (p
, tree
);
2319 TREE_OPERAND (t
, i
) = operand
;
2320 if (operand
&& fro
> i
)
2322 if (TREE_SIDE_EFFECTS (operand
))
2323 TREE_SIDE_EFFECTS (t
) = 1;
2324 if (!TREE_CONSTANT (operand
))
2331 TREE_CONSTANT (t
) = constant
;
2335 /* Same as above, but only builds for unary operators.
2336 Saves lions share of calls to `build'; cuts down use
2337 of varargs, which is expensive for RISC machines. */
2340 build1 (code
, type
, node
)
2341 enum tree_code code
;
2345 int length
= sizeof (struct tree_exp
);
2346 #ifdef GATHER_STATISTICS
2347 tree_node_kind kind
;
2351 #ifdef GATHER_STATISTICS
2352 switch (TREE_CODE_CLASS (code
))
2354 case 's': /* an expression with side effects */
2357 case 'r': /* a reference */
2365 tree_node_counts
[(int) kind
]++;
2366 tree_node_sizes
[(int) kind
] += length
;
2369 #ifdef ENABLE_CHECKING
2370 if (TREE_CODE_CLASS (code
) == '2'
2371 || TREE_CODE_CLASS (code
) == '<'
2372 || TREE_CODE_LENGTH (code
) != 1)
2374 #endif /* ENABLE_CHECKING */
2376 t
= ggc_alloc_tree (length
);
2378 memset ((PTR
) t
, 0, sizeof (struct tree_common
));
2380 TREE_SET_CODE (t
, code
);
2382 TREE_TYPE (t
) = type
;
2383 TREE_COMPLEXITY (t
) = 0;
2384 TREE_OPERAND (t
, 0) = node
;
2385 if (node
&& first_rtl_op (code
) != 0)
2387 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2388 TREE_READONLY (t
) = TREE_READONLY (node
);
2391 if (TREE_CODE_CLASS (code
) == 's')
2392 TREE_SIDE_EFFECTS (t
) = 1;
2399 case PREDECREMENT_EXPR
:
2400 case PREINCREMENT_EXPR
:
2401 case POSTDECREMENT_EXPR
:
2402 case POSTINCREMENT_EXPR
:
2403 /* All of these have side-effects, no matter what their
2405 TREE_SIDE_EFFECTS (t
) = 1;
2406 TREE_READONLY (t
) = 0;
2410 /* Whether a dereference is readonly has nothing to do with whether
2411 its operand is readonly. */
2412 TREE_READONLY (t
) = 0;
2416 if (TREE_CODE_CLASS (code
) == '1' && node
&& TREE_CONSTANT (node
))
2417 TREE_CONSTANT (t
) = 1;
2424 /* Similar except don't specify the TREE_TYPE
2425 and leave the TREE_SIDE_EFFECTS as 0.
2426 It is permissible for arguments to be null,
2427 or even garbage if their values do not matter. */
2430 build_nt
VPARAMS ((enum tree_code code
, ...))
2437 VA_FIXEDARG (p
, enum tree_code
, code
);
2439 t
= make_node (code
);
2440 length
= TREE_CODE_LENGTH (code
);
2442 for (i
= 0; i
< length
; i
++)
2443 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2449 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2450 We do NOT enter this node in any sort of symbol table.
2452 layout_decl is used to set up the decl's storage layout.
2453 Other slots are initialized to 0 or null pointers. */
2456 build_decl (code
, name
, type
)
2457 enum tree_code code
;
2462 t
= make_node (code
);
2464 /* if (type == error_mark_node)
2465 type = integer_type_node; */
2466 /* That is not done, deliberately, so that having error_mark_node
2467 as the type can suppress useless errors in the use of this variable. */
2469 DECL_NAME (t
) = name
;
2470 TREE_TYPE (t
) = type
;
2472 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2474 else if (code
== FUNCTION_DECL
)
2475 DECL_MODE (t
) = FUNCTION_MODE
;
2480 /* BLOCK nodes are used to represent the structure of binding contours
2481 and declarations, once those contours have been exited and their contents
2482 compiled. This information is used for outputting debugging info. */
2485 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
2486 tree vars
, tags ATTRIBUTE_UNUSED
, subblocks
, supercontext
, chain
;
2488 tree block
= make_node (BLOCK
);
2490 BLOCK_VARS (block
) = vars
;
2491 BLOCK_SUBBLOCKS (block
) = subblocks
;
2492 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2493 BLOCK_CHAIN (block
) = chain
;
2497 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2498 location where an expression or an identifier were encountered. It
2499 is necessary for languages where the frontend parser will handle
2500 recursively more than one file (Java is one of them). */
2503 build_expr_wfl (node
, file
, line
, col
)
2508 static const char *last_file
= 0;
2509 static tree last_filenode
= NULL_TREE
;
2510 tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
2512 EXPR_WFL_NODE (wfl
) = node
;
2513 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
2514 if (file
!= last_file
)
2517 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
2520 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
2523 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
2524 TREE_TYPE (wfl
) = TREE_TYPE (node
);
2530 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2534 build_decl_attribute_variant (ddecl
, attribute
)
2535 tree ddecl
, attribute
;
2537 DECL_ATTRIBUTES (ddecl
) = attribute
;
2541 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2544 Record such modified types already made so we don't make duplicates. */
2547 build_type_attribute_variant (ttype
, attribute
)
2548 tree ttype
, attribute
;
2550 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2552 unsigned int hashcode
;
2555 ntype
= copy_node (ttype
);
2557 TYPE_POINTER_TO (ntype
) = 0;
2558 TYPE_REFERENCE_TO (ntype
) = 0;
2559 TYPE_ATTRIBUTES (ntype
) = attribute
;
2561 /* Create a new main variant of TYPE. */
2562 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2563 TYPE_NEXT_VARIANT (ntype
) = 0;
2564 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2566 hashcode
= (TYPE_HASH (TREE_CODE (ntype
))
2567 + TYPE_HASH (TREE_TYPE (ntype
))
2568 + attribute_hash_list (attribute
));
2570 switch (TREE_CODE (ntype
))
2573 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
2576 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
2579 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
2582 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
2588 ntype
= type_hash_canon (hashcode
, ntype
);
2589 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2595 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2598 We try both `text' and `__text__', ATTR may be either one. */
2599 /* ??? It might be a reasonable simplification to require ATTR to be only
2600 `text'. One might then also require attribute lists to be stored in
2601 their canonicalized form. */
2604 is_attribute_p (attr
, ident
)
2608 int ident_len
, attr_len
;
2611 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2614 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2617 p
= IDENTIFIER_POINTER (ident
);
2618 ident_len
= strlen (p
);
2619 attr_len
= strlen (attr
);
2621 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2625 || attr
[attr_len
- 2] != '_'
2626 || attr
[attr_len
- 1] != '_')
2628 if (ident_len
== attr_len
- 4
2629 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2634 if (ident_len
== attr_len
+ 4
2635 && p
[0] == '_' && p
[1] == '_'
2636 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2637 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2644 /* Given an attribute name and a list of attributes, return a pointer to the
2645 attribute's list element if the attribute is part of the list, or NULL_TREE
2646 if not found. If the attribute appears more than once, this only
2647 returns the first occurrence; the TREE_CHAIN of the return value should
2648 be passed back in if further occurrences are wanted. */
2651 lookup_attribute (attr_name
, list
)
2652 const char *attr_name
;
2657 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2659 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
2661 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2668 /* Return an attribute list that is the union of a1 and a2. */
2671 merge_attributes (a1
, a2
)
2676 /* Either one unset? Take the set one. */
2678 if ((attributes
= a1
) == 0)
2681 /* One that completely contains the other? Take it. */
2683 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2685 if (attribute_list_contained (a2
, a1
))
2689 /* Pick the longest list, and hang on the other list. */
2691 if (list_length (a1
) < list_length (a2
))
2692 attributes
= a2
, a2
= a1
;
2694 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
2697 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2700 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2703 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
2708 a1
= copy_node (a2
);
2709 TREE_CHAIN (a1
) = attributes
;
2718 /* Given types T1 and T2, merge their attributes and return
2722 merge_type_attributes (t1
, t2
)
2725 return merge_attributes (TYPE_ATTRIBUTES (t1
),
2726 TYPE_ATTRIBUTES (t2
));
2729 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2733 merge_decl_attributes (olddecl
, newdecl
)
2734 tree olddecl
, newdecl
;
2736 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
2737 DECL_ATTRIBUTES (newdecl
));
2740 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2742 /* Specialization of merge_decl_attributes for various Windows targets.
2744 This handles the following situation:
2746 __declspec (dllimport) int foo;
2749 The second instance of `foo' nullifies the dllimport. */
2752 merge_dllimport_decl_attributes (old
, new)
2757 int delete_dllimport_p
;
2759 old
= DECL_ATTRIBUTES (old
);
2760 new = DECL_ATTRIBUTES (new);
2762 /* What we need to do here is remove from `old' dllimport if it doesn't
2763 appear in `new'. dllimport behaves like extern: if a declaration is
2764 marked dllimport and a definition appears later, then the object
2765 is not dllimport'd. */
2766 if (lookup_attribute ("dllimport", old
) != NULL_TREE
2767 && lookup_attribute ("dllimport", new) == NULL_TREE
)
2768 delete_dllimport_p
= 1;
2770 delete_dllimport_p
= 0;
2772 a
= merge_attributes (old
, new);
2774 if (delete_dllimport_p
)
2778 /* Scan the list for dllimport and delete it. */
2779 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
2781 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
2783 if (prev
== NULL_TREE
)
2786 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
2795 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2797 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2798 of the various TYPE_QUAL values. */
2801 set_type_quals (type
, type_quals
)
2805 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
2806 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
2807 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
2810 /* Return a version of the TYPE, qualified as indicated by the
2811 TYPE_QUALS, if one exists. If no qualified version exists yet,
2812 return NULL_TREE. */
2815 get_qualified_type (type
, type_quals
)
2821 /* Search the chain of variants to see if there is already one there just
2822 like the one we need to have. If so, use that existing one. We must
2823 preserve the TYPE_NAME, since there is code that depends on this. */
2824 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2825 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
)
2826 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
))
2832 /* Like get_qualified_type, but creates the type if it does not
2833 exist. This function never returns NULL_TREE. */
2836 build_qualified_type (type
, type_quals
)
2842 /* See if we already have the appropriate qualified variant. */
2843 t
= get_qualified_type (type
, type_quals
);
2845 /* If not, build it. */
2848 t
= build_type_copy (type
);
2849 set_type_quals (t
, type_quals
);
2855 /* Create a new variant of TYPE, equivalent but distinct.
2856 This is so the caller can modify it. */
2859 build_type_copy (type
)
2862 tree t
, m
= TYPE_MAIN_VARIANT (type
);
2864 t
= copy_node (type
);
2866 TYPE_POINTER_TO (t
) = 0;
2867 TYPE_REFERENCE_TO (t
) = 0;
2869 /* Add this type to the chain of variants of TYPE. */
2870 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
2871 TYPE_NEXT_VARIANT (m
) = t
;
2876 /* Hashing of types so that we don't make duplicates.
2877 The entry point is `type_hash_canon'. */
2879 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2880 with types in the TREE_VALUE slots), by adding the hash codes
2881 of the individual types. */
2884 type_hash_list (list
)
2887 unsigned int hashcode
;
2890 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2891 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
2896 /* These are the Hashtable callback functions. */
2898 /* Returns true if the types are equal. */
2901 type_hash_eq (va
, vb
)
2905 const struct type_hash
*a
= va
, *b
= vb
;
2906 if (a
->hash
== b
->hash
2907 && TREE_CODE (a
->type
) == TREE_CODE (b
->type
)
2908 && TREE_TYPE (a
->type
) == TREE_TYPE (b
->type
)
2909 && attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
2910 TYPE_ATTRIBUTES (b
->type
))
2911 && TYPE_ALIGN (a
->type
) == TYPE_ALIGN (b
->type
)
2912 && (TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
2913 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
2914 TYPE_MAX_VALUE (b
->type
)))
2915 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
2916 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
2917 TYPE_MIN_VALUE (b
->type
)))
2918 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
2919 && (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
2920 || (TYPE_DOMAIN (a
->type
)
2921 && TREE_CODE (TYPE_DOMAIN (a
->type
)) == TREE_LIST
2922 && TYPE_DOMAIN (b
->type
)
2923 && TREE_CODE (TYPE_DOMAIN (b
->type
)) == TREE_LIST
2924 && type_list_equal (TYPE_DOMAIN (a
->type
),
2925 TYPE_DOMAIN (b
->type
)))))
2930 /* Return the cached hash value. */
2933 type_hash_hash (item
)
2936 return ((const struct type_hash
*) item
)->hash
;
2939 /* Look in the type hash table for a type isomorphic to TYPE.
2940 If one is found, return it. Otherwise return 0. */
2943 type_hash_lookup (hashcode
, type
)
2944 unsigned int hashcode
;
2947 struct type_hash
*h
, in
;
2949 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
2950 must call that routine before comparing TYPE_ALIGNs. */
2956 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
2962 /* Add an entry to the type-hash-table
2963 for a type TYPE whose hash code is HASHCODE. */
2966 type_hash_add (hashcode
, type
)
2967 unsigned int hashcode
;
2970 struct type_hash
*h
;
2973 h
= (struct type_hash
*) ggc_alloc (sizeof (struct type_hash
));
2976 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
2977 *(struct type_hash
**) loc
= h
;
2980 /* Given TYPE, and HASHCODE its hash code, return the canonical
2981 object for an identical type if one already exists.
2982 Otherwise, return TYPE, and record it as the canonical object
2983 if it is a permanent object.
2985 To use this function, first create a type of the sort you want.
2986 Then compute its hash code from the fields of the type that
2987 make it different from other similar types.
2988 Then call this function and use the value.
2989 This function frees the type you pass in if it is a duplicate. */
2991 /* Set to 1 to debug without canonicalization. Never set by program. */
2992 int debug_no_type_hash
= 0;
2995 type_hash_canon (hashcode
, type
)
2996 unsigned int hashcode
;
3001 if (debug_no_type_hash
)
3004 /* See if the type is in the hash table already. If so, return it.
3005 Otherwise, add the type. */
3006 t1
= type_hash_lookup (hashcode
, type
);
3009 #ifdef GATHER_STATISTICS
3010 tree_node_counts
[(int) t_kind
]--;
3011 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3017 type_hash_add (hashcode
, type
);
3022 /* See if the data pointed to by the type hash table is marked. We consider
3023 it marked if the type is marked or if a debug type number or symbol
3024 table entry has been made for the type. This reduces the amount of
3025 debugging output and eliminates that dependency of the debug output on
3026 the number of garbage collections. */
3029 type_hash_marked_p (p
)
3032 tree type
= ((struct type_hash
*) p
)->type
;
3034 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3038 print_type_hash_statistics ()
3040 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3041 (long) htab_size (type_hash_table
),
3042 (long) htab_elements (type_hash_table
),
3043 htab_collisions (type_hash_table
));
3046 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3047 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3048 by adding the hash codes of the individual attributes. */
3051 attribute_hash_list (list
)
3054 unsigned int hashcode
;
3057 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3058 /* ??? Do we want to add in TREE_VALUE too? */
3059 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3063 /* Given two lists of attributes, return true if list l2 is
3064 equivalent to l1. */
3067 attribute_list_equal (l1
, l2
)
3070 return attribute_list_contained (l1
, l2
)
3071 && attribute_list_contained (l2
, l1
);
3074 /* Given two lists of attributes, return true if list L2 is
3075 completely contained within L1. */
3076 /* ??? This would be faster if attribute names were stored in a canonicalized
3077 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3078 must be used to show these elements are equivalent (which they are). */
3079 /* ??? It's not clear that attributes with arguments will always be handled
3083 attribute_list_contained (l1
, l2
)
3088 /* First check the obvious, maybe the lists are identical. */
3092 /* Maybe the lists are similar. */
3093 for (t1
= l1
, t2
= l2
;
3095 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3096 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3097 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3099 /* Maybe the lists are equal. */
3100 if (t1
== 0 && t2
== 0)
3103 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3106 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3108 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3111 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3118 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3125 /* Given two lists of types
3126 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3127 return 1 if the lists contain the same types in the same order.
3128 Also, the TREE_PURPOSEs must match. */
3131 type_list_equal (l1
, l2
)
3136 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3137 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3138 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3139 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3140 && (TREE_TYPE (TREE_PURPOSE (t1
))
3141 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3147 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3148 given by TYPE. If the argument list accepts variable arguments,
3149 then this function counts only the ordinary arguments. */
3152 type_num_arguments (type
)
3158 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3159 /* If the function does not take a variable number of arguments,
3160 the last element in the list will have type `void'. */
3161 if (VOID_TYPE_P (TREE_VALUE (t
)))
3169 /* Nonzero if integer constants T1 and T2
3170 represent the same constant value. */
3173 tree_int_cst_equal (t1
, t2
)
3179 if (t1
== 0 || t2
== 0)
3182 if (TREE_CODE (t1
) == INTEGER_CST
3183 && TREE_CODE (t2
) == INTEGER_CST
3184 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3185 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3191 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3192 The precise way of comparison depends on their data type. */
3195 tree_int_cst_lt (t1
, t2
)
3201 if (TREE_UNSIGNED (TREE_TYPE (t1
)) != TREE_UNSIGNED (TREE_TYPE (t2
)))
3203 int t1_sgn
= tree_int_cst_sgn (t1
);
3204 int t2_sgn
= tree_int_cst_sgn (t2
);
3206 if (t1_sgn
< t2_sgn
)
3208 else if (t1_sgn
> t2_sgn
)
3210 /* Otherwise, both are non-negative, so we compare them as
3211 unsigned just in case one of them would overflow a signed
3214 else if (! TREE_UNSIGNED (TREE_TYPE (t1
)))
3215 return INT_CST_LT (t1
, t2
);
3217 return INT_CST_LT_UNSIGNED (t1
, t2
);
3220 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3223 tree_int_cst_compare (t1
, t2
)
3227 if (tree_int_cst_lt (t1
, t2
))
3229 else if (tree_int_cst_lt (t2
, t1
))
3235 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3236 the host. If POS is zero, the value can be represented in a single
3237 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3238 be represented in a single unsigned HOST_WIDE_INT. */
3241 host_integerp (t
, pos
)
3245 return (TREE_CODE (t
) == INTEGER_CST
3246 && ! TREE_OVERFLOW (t
)
3247 && ((TREE_INT_CST_HIGH (t
) == 0
3248 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3249 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3250 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3251 && ! TREE_UNSIGNED (TREE_TYPE (t
)))
3252 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3255 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3256 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3257 be positive. Abort if we cannot satisfy the above conditions. */
3260 tree_low_cst (t
, pos
)
3264 if (host_integerp (t
, pos
))
3265 return TREE_INT_CST_LOW (t
);
3270 /* Return the most significant bit of the integer constant T. */
3273 tree_int_cst_msb (t
)
3278 unsigned HOST_WIDE_INT l
;
3280 /* Note that using TYPE_PRECISION here is wrong. We care about the
3281 actual bits, not the (arbitrary) range of the type. */
3282 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3283 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3284 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3285 return (l
& 1) == 1;
3288 /* Return an indication of the sign of the integer constant T.
3289 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3290 Note that -1 will never be returned it T's type is unsigned. */
3293 tree_int_cst_sgn (t
)
3296 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3298 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3300 else if (TREE_INT_CST_HIGH (t
) < 0)
3306 /* Compare two constructor-element-type constants. Return 1 if the lists
3307 are known to be equal; otherwise return 0. */
3310 simple_cst_list_equal (l1
, l2
)
3313 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3315 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3318 l1
= TREE_CHAIN (l1
);
3319 l2
= TREE_CHAIN (l2
);
3325 /* Return truthvalue of whether T1 is the same tree structure as T2.
3326 Return 1 if they are the same.
3327 Return 0 if they are understandably different.
3328 Return -1 if either contains tree structure not understood by
3332 simple_cst_equal (t1
, t2
)
3335 enum tree_code code1
, code2
;
3341 if (t1
== 0 || t2
== 0)
3344 code1
= TREE_CODE (t1
);
3345 code2
= TREE_CODE (t2
);
3347 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3349 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3350 || code2
== NON_LVALUE_EXPR
)
3351 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3353 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3356 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3357 || code2
== NON_LVALUE_EXPR
)
3358 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3366 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3367 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3370 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3373 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3374 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3375 TREE_STRING_LENGTH (t1
)));
3378 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
3384 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3387 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3391 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3394 /* Special case: if either target is an unallocated VAR_DECL,
3395 it means that it's going to be unified with whatever the
3396 TARGET_EXPR is really supposed to initialize, so treat it
3397 as being equivalent to anything. */
3398 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3399 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3400 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3401 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3402 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3403 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3406 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3411 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3413 case WITH_CLEANUP_EXPR
:
3414 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3418 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3421 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3422 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3436 /* This general rule works for most tree codes. All exceptions should be
3437 handled above. If this is a language-specific tree code, we can't
3438 trust what might be in the operand, so say we don't know
3440 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3443 switch (TREE_CODE_CLASS (code1
))
3452 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3454 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3466 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3467 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3468 than U, respectively. */
3471 compare_tree_int (t
, u
)
3473 unsigned HOST_WIDE_INT u
;
3475 if (tree_int_cst_sgn (t
) < 0)
3477 else if (TREE_INT_CST_HIGH (t
) != 0)
3479 else if (TREE_INT_CST_LOW (t
) == u
)
3481 else if (TREE_INT_CST_LOW (t
) < u
)
3487 /* Constructors for pointer, array and function types.
3488 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3489 constructed by language-dependent code, not here.) */
3491 /* Construct, lay out and return the type of pointers to TO_TYPE
3492 with mode MODE. If such a type has already been constructed,
3496 build_pointer_type_for_mode (to_type
, mode
)
3498 enum machine_mode mode
;
3500 tree t
= TYPE_POINTER_TO (to_type
);
3502 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3503 if (t
!= 0 && mode
== ptr_mode
)
3506 t
= make_node (POINTER_TYPE
);
3508 TREE_TYPE (t
) = to_type
;
3509 TYPE_MODE (t
) = mode
;
3511 /* Record this type as the pointer to TO_TYPE. */
3512 if (mode
== ptr_mode
)
3513 TYPE_POINTER_TO (to_type
) = t
;
3515 /* Lay out the type. This function has many callers that are concerned
3516 with expression-construction, and this simplifies them all.
3517 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3523 /* By default build pointers in ptr_mode. */
3526 build_pointer_type (to_type
)
3529 return build_pointer_type_for_mode (to_type
, ptr_mode
);
3532 /* Construct, lay out and return the type of references to TO_TYPE
3533 with mode MODE. If such a type has already been constructed,
3537 build_reference_type_for_mode (to_type
, mode
)
3539 enum machine_mode mode
;
3541 tree t
= TYPE_REFERENCE_TO (to_type
);
3543 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3544 if (t
!= 0 && mode
== ptr_mode
)
3547 t
= make_node (REFERENCE_TYPE
);
3549 TREE_TYPE (t
) = to_type
;
3550 TYPE_MODE (t
) = mode
;
3552 /* Record this type as the pointer to TO_TYPE. */
3553 if (mode
== ptr_mode
)
3554 TYPE_REFERENCE_TO (to_type
) = t
;
3562 /* Build the node for the type of references-to-TO_TYPE by default
3566 build_reference_type (to_type
)
3569 return build_reference_type_for_mode (to_type
, ptr_mode
);
3572 /* Build a type that is compatible with t but has no cv quals anywhere
3575 const char *const *const * -> char ***. */
3578 build_type_no_quals (t
)
3581 switch (TREE_CODE (t
))
3584 return build_pointer_type (build_type_no_quals (TREE_TYPE (t
)));
3585 case REFERENCE_TYPE
:
3586 return build_reference_type (build_type_no_quals (TREE_TYPE (t
)));
3588 return TYPE_MAIN_VARIANT (t
);
3592 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3593 MAXVAL should be the maximum value in the domain
3594 (one less than the length of the array).
3596 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3597 We don't enforce this limit, that is up to caller (e.g. language front end).
3598 The limit exists because the result is a signed type and we don't handle
3599 sizes that use more than one HOST_WIDE_INT. */
3602 build_index_type (maxval
)
3605 tree itype
= make_node (INTEGER_TYPE
);
3607 TREE_TYPE (itype
) = sizetype
;
3608 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
3609 TYPE_MIN_VALUE (itype
) = size_zero_node
;
3610 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
3611 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
3612 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
3613 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
3614 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
3615 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
3617 if (host_integerp (maxval
, 1))
3618 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
3623 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3624 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3625 low bound LOWVAL and high bound HIGHVAL.
3626 if TYPE==NULL_TREE, sizetype is used. */
3629 build_range_type (type
, lowval
, highval
)
3630 tree type
, lowval
, highval
;
3632 tree itype
= make_node (INTEGER_TYPE
);
3634 TREE_TYPE (itype
) = type
;
3635 if (type
== NULL_TREE
)
3638 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
3639 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
3641 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
3642 TYPE_MODE (itype
) = TYPE_MODE (type
);
3643 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
3644 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
3645 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
3646 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
3648 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
3649 return type_hash_canon (tree_low_cst (highval
, 0)
3650 - tree_low_cst (lowval
, 0),
3656 /* Just like build_index_type, but takes lowval and highval instead
3657 of just highval (maxval). */
3660 build_index_2_type (lowval
, highval
)
3661 tree lowval
, highval
;
3663 return build_range_type (sizetype
, lowval
, highval
);
3666 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3667 and number of elements specified by the range of values of INDEX_TYPE.
3668 If such a type has already been constructed, reuse it. */
3671 build_array_type (elt_type
, index_type
)
3672 tree elt_type
, index_type
;
3675 unsigned int hashcode
;
3677 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
3679 error ("arrays of functions are not meaningful");
3680 elt_type
= integer_type_node
;
3683 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3684 build_pointer_type (elt_type
);
3686 /* Allocate the array after the pointer type,
3687 in case we free it in type_hash_canon. */
3688 t
= make_node (ARRAY_TYPE
);
3689 TREE_TYPE (t
) = elt_type
;
3690 TYPE_DOMAIN (t
) = index_type
;
3692 if (index_type
== 0)
3697 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
3698 t
= type_hash_canon (hashcode
, t
);
3700 if (!COMPLETE_TYPE_P (t
))
3705 /* Return the TYPE of the elements comprising
3706 the innermost dimension of ARRAY. */
3709 get_inner_array_type (array
)
3712 tree type
= TREE_TYPE (array
);
3714 while (TREE_CODE (type
) == ARRAY_TYPE
)
3715 type
= TREE_TYPE (type
);
3720 /* Construct, lay out and return
3721 the type of functions returning type VALUE_TYPE
3722 given arguments of types ARG_TYPES.
3723 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3724 are data type nodes for the arguments of the function.
3725 If such a type has already been constructed, reuse it. */
3728 build_function_type (value_type
, arg_types
)
3729 tree value_type
, arg_types
;
3732 unsigned int hashcode
;
3734 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
3736 error ("function return type cannot be function");
3737 value_type
= integer_type_node
;
3740 /* Make a node of the sort we want. */
3741 t
= make_node (FUNCTION_TYPE
);
3742 TREE_TYPE (t
) = value_type
;
3743 TYPE_ARG_TYPES (t
) = arg_types
;
3745 /* If we already have such a type, use the old one and free this one. */
3746 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
3747 t
= type_hash_canon (hashcode
, t
);
3749 if (!COMPLETE_TYPE_P (t
))
3754 /* Build a function type. The RETURN_TYPE is the type retured by the
3755 function. If additional arguments are provided, they are
3756 additional argument types. The list of argument types must always
3757 be terminated by NULL_TREE. */
3760 build_function_type_list
VPARAMS ((tree return_type
, ...))
3764 VA_OPEN (p
, return_type
);
3765 VA_FIXEDARG (p
, tree
, return_type
);
3767 t
= va_arg (p
, tree
);
3768 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
3769 args
= tree_cons (NULL_TREE
, t
, args
);
3772 args
= nreverse (args
);
3773 TREE_CHAIN (last
) = void_list_node
;
3774 args
= build_function_type (return_type
, args
);
3780 /* Construct, lay out and return the type of methods belonging to class
3781 BASETYPE and whose arguments and values are described by TYPE.
3782 If that type exists already, reuse it.
3783 TYPE must be a FUNCTION_TYPE node. */
3786 build_method_type (basetype
, type
)
3787 tree basetype
, type
;
3790 unsigned int hashcode
;
3792 /* Make a node of the sort we want. */
3793 t
= make_node (METHOD_TYPE
);
3795 if (TREE_CODE (type
) != FUNCTION_TYPE
)
3798 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3799 TREE_TYPE (t
) = TREE_TYPE (type
);
3801 /* The actual arglist for this function includes a "hidden" argument
3802 which is "this". Put it into the list of argument types. */
3805 = tree_cons (NULL_TREE
,
3806 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
3808 /* If we already have such a type, use the old one and free this one. */
3809 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3810 t
= type_hash_canon (hashcode
, t
);
3812 if (!COMPLETE_TYPE_P (t
))
3818 /* Construct, lay out and return the type of offsets to a value
3819 of type TYPE, within an object of type BASETYPE.
3820 If a suitable offset type exists already, reuse it. */
3823 build_offset_type (basetype
, type
)
3824 tree basetype
, type
;
3827 unsigned int hashcode
;
3829 /* Make a node of the sort we want. */
3830 t
= make_node (OFFSET_TYPE
);
3832 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3833 TREE_TYPE (t
) = type
;
3835 /* If we already have such a type, use the old one and free this one. */
3836 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3837 t
= type_hash_canon (hashcode
, t
);
3839 if (!COMPLETE_TYPE_P (t
))
3845 /* Create a complex type whose components are COMPONENT_TYPE. */
3848 build_complex_type (component_type
)
3849 tree component_type
;
3852 unsigned int hashcode
;
3854 /* Make a node of the sort we want. */
3855 t
= make_node (COMPLEX_TYPE
);
3857 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
3858 set_type_quals (t
, TYPE_QUALS (component_type
));
3860 /* If we already have such a type, use the old one and free this one. */
3861 hashcode
= TYPE_HASH (component_type
);
3862 t
= type_hash_canon (hashcode
, t
);
3864 if (!COMPLETE_TYPE_P (t
))
3867 /* If we are writing Dwarf2 output we need to create a name,
3868 since complex is a fundamental type. */
3869 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
3873 if (component_type
== char_type_node
)
3874 name
= "complex char";
3875 else if (component_type
== signed_char_type_node
)
3876 name
= "complex signed char";
3877 else if (component_type
== unsigned_char_type_node
)
3878 name
= "complex unsigned char";
3879 else if (component_type
== short_integer_type_node
)
3880 name
= "complex short int";
3881 else if (component_type
== short_unsigned_type_node
)
3882 name
= "complex short unsigned int";
3883 else if (component_type
== integer_type_node
)
3884 name
= "complex int";
3885 else if (component_type
== unsigned_type_node
)
3886 name
= "complex unsigned int";
3887 else if (component_type
== long_integer_type_node
)
3888 name
= "complex long int";
3889 else if (component_type
== long_unsigned_type_node
)
3890 name
= "complex long unsigned int";
3891 else if (component_type
== long_long_integer_type_node
)
3892 name
= "complex long long int";
3893 else if (component_type
== long_long_unsigned_type_node
)
3894 name
= "complex long long unsigned int";
3899 TYPE_NAME (t
) = get_identifier (name
);
3905 /* Return OP, stripped of any conversions to wider types as much as is safe.
3906 Converting the value back to OP's type makes a value equivalent to OP.
3908 If FOR_TYPE is nonzero, we return a value which, if converted to
3909 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
3911 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
3912 narrowest type that can hold the value, even if they don't exactly fit.
3913 Otherwise, bit-field references are changed to a narrower type
3914 only if they can be fetched directly from memory in that type.
3916 OP must have integer, real or enumeral type. Pointers are not allowed!
3918 There are some cases where the obvious value we could return
3919 would regenerate to OP if converted to OP's type,
3920 but would not extend like OP to wider types.
3921 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
3922 For example, if OP is (unsigned short)(signed char)-1,
3923 we avoid returning (signed char)-1 if FOR_TYPE is int,
3924 even though extending that to an unsigned short would regenerate OP,
3925 since the result of extending (signed char)-1 to (int)
3926 is different from (int) OP. */
3929 get_unwidened (op
, for_type
)
3933 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
3934 tree type
= TREE_TYPE (op
);
3936 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
3938 = (for_type
!= 0 && for_type
!= type
3939 && final_prec
> TYPE_PRECISION (type
)
3940 && TREE_UNSIGNED (type
));
3943 while (TREE_CODE (op
) == NOP_EXPR
)
3946 = TYPE_PRECISION (TREE_TYPE (op
))
3947 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
3949 /* Truncations are many-one so cannot be removed.
3950 Unless we are later going to truncate down even farther. */
3952 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
3955 /* See what's inside this conversion. If we decide to strip it,
3957 op
= TREE_OPERAND (op
, 0);
3959 /* If we have not stripped any zero-extensions (uns is 0),
3960 we can strip any kind of extension.
3961 If we have previously stripped a zero-extension,
3962 only zero-extensions can safely be stripped.
3963 Any extension can be stripped if the bits it would produce
3964 are all going to be discarded later by truncating to FOR_TYPE. */
3968 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
3970 /* TREE_UNSIGNED says whether this is a zero-extension.
3971 Let's avoid computing it if it does not affect WIN
3972 and if UNS will not be needed again. */
3973 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
3974 && TREE_UNSIGNED (TREE_TYPE (op
)))
3982 if (TREE_CODE (op
) == COMPONENT_REF
3983 /* Since type_for_size always gives an integer type. */
3984 && TREE_CODE (type
) != REAL_TYPE
3985 /* Don't crash if field not laid out yet. */
3986 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
3987 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
3989 unsigned int innerprec
3990 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
3991 int unsignedp
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
3992 type
= (*lang_hooks
.types
.type_for_size
) (innerprec
, unsignedp
);
3994 /* We can get this structure field in the narrowest type it fits in.
3995 If FOR_TYPE is 0, do this only for a field that matches the
3996 narrower type exactly and is aligned for it
3997 The resulting extension to its nominal type (a fullword type)
3998 must fit the same conditions as for other extensions. */
4000 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4001 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4002 && (! uns
|| final_prec
<= innerprec
|| unsignedp
)
4005 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4006 TREE_OPERAND (op
, 1));
4007 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4008 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4015 /* Return OP or a simpler expression for a narrower value
4016 which can be sign-extended or zero-extended to give back OP.
4017 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4018 or 0 if the value should be sign-extended. */
4021 get_narrower (op
, unsignedp_ptr
)
4029 while (TREE_CODE (op
) == NOP_EXPR
)
4032 = (TYPE_PRECISION (TREE_TYPE (op
))
4033 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4035 /* Truncations are many-one so cannot be removed. */
4039 /* See what's inside this conversion. If we decide to strip it,
4044 op
= TREE_OPERAND (op
, 0);
4045 /* An extension: the outermost one can be stripped,
4046 but remember whether it is zero or sign extension. */
4048 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4049 /* Otherwise, if a sign extension has been stripped,
4050 only sign extensions can now be stripped;
4051 if a zero extension has been stripped, only zero-extensions. */
4052 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4056 else /* bitschange == 0 */
4058 /* A change in nominal type can always be stripped, but we must
4059 preserve the unsignedness. */
4061 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4063 op
= TREE_OPERAND (op
, 0);
4069 if (TREE_CODE (op
) == COMPONENT_REF
4070 /* Since type_for_size always gives an integer type. */
4071 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4072 /* Ensure field is laid out already. */
4073 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4075 unsigned HOST_WIDE_INT innerprec
4076 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4077 tree type
= (*lang_hooks
.types
.type_for_size
) (innerprec
,
4078 TREE_UNSIGNED (op
));
4080 /* We can get this structure field in a narrower type that fits it,
4081 but the resulting extension to its nominal type (a fullword type)
4082 must satisfy the same conditions as for other extensions.
4084 Do this only for fields that are aligned (not bit-fields),
4085 because when bit-field insns will be used there is no
4086 advantage in doing this. */
4088 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4089 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4090 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4094 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4095 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4096 TREE_OPERAND (op
, 1));
4097 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4098 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4101 *unsignedp_ptr
= uns
;
4105 /* Nonzero if integer constant C has a value that is permissible
4106 for type TYPE (an INTEGER_TYPE). */
4109 int_fits_type_p (c
, type
)
4112 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4113 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4114 int ok_for_low_bound
, ok_for_high_bound
;
4116 /* Perform some generic filtering first, which may allow making a decision
4117 even if the bounds are not constant. First, negative integers never fit
4118 in unsigned types, */
4119 if ((TREE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4120 /* Also, unsigned integers with top bit set never fit signed types. */
4121 || (! TREE_UNSIGNED (type
)
4122 && TREE_UNSIGNED (TREE_TYPE (c
)) && tree_int_cst_msb (c
)))
4125 /* If at least one bound of the type is a constant integer, we can check
4126 ourselves and maybe make a decision. If no such decision is possible, but
4127 this type is a subtype, try checking against that. Otherwise, use
4128 force_fit_type, which checks against the precision.
4130 Compute the status for each possibly constant bound, and return if we see
4131 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4132 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4133 for "constant known to fit". */
4135 ok_for_low_bound
= -1;
4136 ok_for_high_bound
= -1;
4138 /* Check if C >= type_low_bound. */
4139 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4141 ok_for_low_bound
= ! tree_int_cst_lt (c
, type_low_bound
);
4142 if (! ok_for_low_bound
)
4146 /* Check if c <= type_high_bound. */
4147 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4149 ok_for_high_bound
= ! tree_int_cst_lt (type_high_bound
, c
);
4150 if (! ok_for_high_bound
)
4154 /* If the constant fits both bounds, the result is known. */
4155 if (ok_for_low_bound
== 1 && ok_for_high_bound
== 1)
4158 /* If we haven't been able to decide at this point, there nothing more we
4159 can check ourselves here. Look at the base type if we have one. */
4160 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4161 return int_fits_type_p (c
, TREE_TYPE (type
));
4163 /* Or to force_fit_type, if nothing else. */
4167 TREE_TYPE (c
) = type
;
4168 return !force_fit_type (c
, 0);
4172 /* Returns true if T is, contains, or refers to a type with variable
4173 size. This concept is more general than that of C99 'variably
4174 modified types': in C99, a struct type is never variably modified
4175 because a VLA may not appear as a structure member. However, in
4178 struct S { int i[f()]; };
4180 is valid, and other languages may define similar constructs. */
4183 variably_modified_type_p (type
)
4186 if (type
== error_mark_node
)
4189 /* If TYPE itself has variable size, it is variably modified.
4191 We do not yet have a representation of the C99 '[*]' syntax.
4192 When a representation is chosen, this function should be modified
4193 to test for that case as well. */
4194 if (TYPE_SIZE (type
)
4195 && TYPE_SIZE (type
) != error_mark_node
4196 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4199 /* If TYPE is a pointer or reference, it is variably modified if
4200 the type pointed to is variably modified. */
4201 if ((TREE_CODE (type
) == POINTER_TYPE
4202 || TREE_CODE (type
) == REFERENCE_TYPE
)
4203 && variably_modified_type_p (TREE_TYPE (type
)))
4206 /* If TYPE is an array, it is variably modified if the array
4207 elements are. (Note that the VLA case has already been checked
4209 if (TREE_CODE (type
) == ARRAY_TYPE
4210 && variably_modified_type_p (TREE_TYPE (type
)))
4213 /* If TYPE is a function type, it is variably modified if any of the
4214 parameters or the return type are variably modified. */
4215 if (TREE_CODE (type
) == FUNCTION_TYPE
4216 || TREE_CODE (type
) == METHOD_TYPE
)
4220 if (variably_modified_type_p (TREE_TYPE (type
)))
4222 for (parm
= TYPE_ARG_TYPES (type
);
4223 parm
&& parm
!= void_list_node
;
4224 parm
= TREE_CHAIN (parm
))
4225 if (variably_modified_type_p (TREE_VALUE (parm
)))
4229 /* The current language may have other cases to check, but in general,
4230 all other types are not variably modified. */
4231 return (*lang_hooks
.tree_inlining
.var_mod_type_p
) (type
);
4234 /* Given a DECL or TYPE, return the scope in which it was declared, or
4235 NULL_TREE if there is no containing scope. */
4238 get_containing_scope (t
)
4241 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4244 /* Return the innermost context enclosing DECL that is
4245 a FUNCTION_DECL, or zero if none. */
4248 decl_function_context (decl
)
4253 if (TREE_CODE (decl
) == ERROR_MARK
)
4256 if (TREE_CODE (decl
) == SAVE_EXPR
)
4257 context
= SAVE_EXPR_CONTEXT (decl
);
4259 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4260 where we look up the function at runtime. Such functions always take
4261 a first argument of type 'pointer to real context'.
4263 C++ should really be fixed to use DECL_CONTEXT for the real context,
4264 and use something else for the "virtual context". */
4265 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4268 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4270 context
= DECL_CONTEXT (decl
);
4272 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4274 if (TREE_CODE (context
) == BLOCK
)
4275 context
= BLOCK_SUPERCONTEXT (context
);
4277 context
= get_containing_scope (context
);
4283 /* Return the innermost context enclosing DECL that is
4284 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4285 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4288 decl_type_context (decl
)
4291 tree context
= DECL_CONTEXT (decl
);
4295 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4298 if (TREE_CODE (context
) == RECORD_TYPE
4299 || TREE_CODE (context
) == UNION_TYPE
4300 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4303 if (TREE_CODE (context
) == TYPE_DECL
4304 || TREE_CODE (context
) == FUNCTION_DECL
)
4305 context
= DECL_CONTEXT (context
);
4307 else if (TREE_CODE (context
) == BLOCK
)
4308 context
= BLOCK_SUPERCONTEXT (context
);
4311 /* Unhandled CONTEXT!? */
4317 /* CALL is a CALL_EXPR. Return the declaration for the function
4318 called, or NULL_TREE if the called function cannot be
4322 get_callee_fndecl (call
)
4327 /* It's invalid to call this function with anything but a
4329 if (TREE_CODE (call
) != CALL_EXPR
)
4332 /* The first operand to the CALL is the address of the function
4334 addr
= TREE_OPERAND (call
, 0);
4338 /* If this is a readonly function pointer, extract its initial value. */
4339 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
4340 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
4341 && DECL_INITIAL (addr
))
4342 addr
= DECL_INITIAL (addr
);
4344 /* If the address is just `&f' for some function `f', then we know
4345 that `f' is being called. */
4346 if (TREE_CODE (addr
) == ADDR_EXPR
4347 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4348 return TREE_OPERAND (addr
, 0);
4350 /* We couldn't figure out what was being called. */
4354 /* Print debugging information about tree nodes generated during the compile,
4355 and any language-specific information. */
4358 dump_tree_statistics ()
4360 #ifdef GATHER_STATISTICS
4362 int total_nodes
, total_bytes
;
4365 fprintf (stderr
, "\n??? tree nodes created\n\n");
4366 #ifdef GATHER_STATISTICS
4367 fprintf (stderr
, "Kind Nodes Bytes\n");
4368 fprintf (stderr
, "-------------------------------------\n");
4369 total_nodes
= total_bytes
= 0;
4370 for (i
= 0; i
< (int) all_kinds
; i
++)
4372 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4373 tree_node_counts
[i
], tree_node_sizes
[i
]);
4374 total_nodes
+= tree_node_counts
[i
];
4375 total_bytes
+= tree_node_sizes
[i
];
4377 fprintf (stderr
, "-------------------------------------\n");
4378 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4379 fprintf (stderr
, "-------------------------------------\n");
4381 fprintf (stderr
, "(No per-node statistics)\n");
4383 print_type_hash_statistics ();
4384 (*lang_hooks
.print_statistics
) ();
4387 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4389 const char *flag_random_seed
;
4391 /* Set up a default flag_random_seed value, if there wasn't one already. */
4394 default_flag_random_seed (void)
4396 unsigned HOST_WIDE_INT value
;
4397 char *new_random_seed
;
4399 if (flag_random_seed
!= NULL
)
4402 /* Get some more or less random data. */
4403 #ifdef HAVE_GETTIMEOFDAY
4407 gettimeofday (&tv
, NULL
);
4408 value
= (((unsigned HOST_WIDE_INT
) tv
.tv_usec
<< 16)
4409 ^ tv
.tv_sec
^ getpid ());
4415 /* This slightly overestimates the space required. */
4416 new_random_seed
= xmalloc (HOST_BITS_PER_WIDE_INT
/ 3 + 2);
4417 sprintf (new_random_seed
, HOST_WIDE_INT_PRINT_UNSIGNED
, value
);
4418 flag_random_seed
= new_random_seed
;
4421 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4422 clashes in cases where we can't reliably choose a unique name.
4424 Derived from mkstemp.c in libiberty. */
4427 append_random_chars (template)
4430 static const char letters
[]
4431 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4432 unsigned HOST_WIDE_INT v
;
4435 default_flag_random_seed ();
4437 /* This isn't a very good hash, but it does guarantee no collisions
4438 when the random string is generated by the code above and the time
4441 for (i
= 0; i
< strlen (flag_random_seed
); i
++)
4442 v
= (v
<< 4) ^ (v
>> (HOST_BITS_PER_WIDE_INT
- 4)) ^ flag_random_seed
[i
];
4444 template += strlen (template);
4446 /* Fill in the random bits. */
4447 template[0] = letters
[v
% 62];
4449 template[1] = letters
[v
% 62];
4451 template[2] = letters
[v
% 62];
4453 template[3] = letters
[v
% 62];
4455 template[4] = letters
[v
% 62];
4457 template[5] = letters
[v
% 62];
4462 /* P is a string that will be used in a symbol. Mask out any characters
4463 that are not valid in that context. */
4466 clean_symbol_name (p
)
4471 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4474 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4481 /* Generate a name for a function unique to this translation unit.
4482 TYPE is some string to identify the purpose of this function to the
4483 linker or collect2. */
4486 get_file_function_name_long (type
)
4493 if (first_global_object_name
)
4494 p
= first_global_object_name
;
4497 /* We don't have anything that we know to be unique to this translation
4498 unit, so use what we do have and throw in some randomness. */
4500 const char *name
= weak_global_object_name
;
4501 const char *file
= main_input_filename
;
4506 file
= input_filename
;
4508 q
= (char *) alloca (7 + strlen (name
) + strlen (file
));
4510 sprintf (q
, "%s%s", name
, file
);
4511 append_random_chars (q
);
4515 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
4518 /* Set up the name of the file-level functions we may need.
4519 Use a global object (which is already required to be unique over
4520 the program) rather than the file name (which imposes extra
4522 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
4524 /* Don't need to pull weird characters out of global names. */
4525 if (p
!= first_global_object_name
)
4526 clean_symbol_name (buf
+ 11);
4528 return get_identifier (buf
);
4531 /* If KIND=='I', return a suitable global initializer (constructor) name.
4532 If KIND=='D', return a suitable global clean-up (destructor) name. */
4535 get_file_function_name (kind
)
4543 return get_file_function_name_long (p
);
4546 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4547 The result is placed in BUFFER (which has length BIT_SIZE),
4548 with one bit in each char ('\000' or '\001').
4550 If the constructor is constant, NULL_TREE is returned.
4551 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4554 get_set_constructor_bits (init
, buffer
, bit_size
)
4561 HOST_WIDE_INT domain_min
4562 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
4563 tree non_const_bits
= NULL_TREE
;
4565 for (i
= 0; i
< bit_size
; i
++)
4568 for (vals
= TREE_OPERAND (init
, 1);
4569 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4571 if (!host_integerp (TREE_VALUE (vals
), 0)
4572 || (TREE_PURPOSE (vals
) != NULL_TREE
4573 && !host_integerp (TREE_PURPOSE (vals
), 0)))
4575 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4576 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4578 /* Set a range of bits to ones. */
4579 HOST_WIDE_INT lo_index
4580 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
4581 HOST_WIDE_INT hi_index
4582 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4584 if (lo_index
< 0 || lo_index
>= bit_size
4585 || hi_index
< 0 || hi_index
>= bit_size
)
4587 for (; lo_index
<= hi_index
; lo_index
++)
4588 buffer
[lo_index
] = 1;
4592 /* Set a single bit to one. */
4594 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4595 if (index
< 0 || index
>= bit_size
)
4597 error ("invalid initializer for bit string");
4603 return non_const_bits
;
4606 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4607 The result is placed in BUFFER (which is an array of bytes).
4608 If the constructor is constant, NULL_TREE is returned.
4609 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4612 get_set_constructor_bytes (init
, buffer
, wd_size
)
4614 unsigned char *buffer
;
4618 int set_word_size
= BITS_PER_UNIT
;
4619 int bit_size
= wd_size
* set_word_size
;
4621 unsigned char *bytep
= buffer
;
4622 char *bit_buffer
= (char *) alloca (bit_size
);
4623 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4625 for (i
= 0; i
< wd_size
; i
++)
4628 for (i
= 0; i
< bit_size
; i
++)
4632 if (BYTES_BIG_ENDIAN
)
4633 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4635 *bytep
|= 1 << bit_pos
;
4638 if (bit_pos
>= set_word_size
)
4639 bit_pos
= 0, bytep
++;
4641 return non_const_bits
;
4644 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4645 /* Complain that the tree code of NODE does not match the expected CODE.
4646 FILE, LINE, and FUNCTION are of the caller. */
4649 tree_check_failed (node
, code
, file
, line
, function
)
4651 enum tree_code code
;
4654 const char *function
;
4656 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4657 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
4658 function
, trim_filename (file
), line
);
4661 /* Similar to above, except that we check for a class of tree
4662 code, given in CL. */
4665 tree_class_check_failed (node
, cl
, file
, line
, function
)
4670 const char *function
;
4673 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4674 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
4675 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
4678 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
4679 (dynamically sized) vector. */
4682 tree_vec_elt_check_failed (idx
, len
, file
, line
, function
)
4687 const char *function
;
4690 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
4691 idx
+ 1, len
, function
, trim_filename (file
), line
);
4694 /* Similar to above, except that the check is for the bounds of the operand
4695 vector of an expression node. */
4698 tree_operand_check_failed (idx
, code
, file
, line
, function
)
4700 enum tree_code code
;
4703 const char *function
;
4706 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
4707 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
4708 function
, trim_filename (file
), line
);
4710 #endif /* ENABLE_TREE_CHECKING */
4712 /* For a new vector type node T, build the information necessary for
4713 debugging output. */
4716 finish_vector_type (t
)
4722 tree index
= build_int_2 (TYPE_VECTOR_SUBPARTS (t
) - 1, 0);
4723 tree array
= build_array_type (TREE_TYPE (t
),
4724 build_index_type (index
));
4725 tree rt
= make_node (RECORD_TYPE
);
4727 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
4728 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
4730 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
4731 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4732 the representation type, and we want to find that die when looking up
4733 the vector type. This is most easily achieved by making the TYPE_UID
4735 TYPE_UID (rt
) = TYPE_UID (t
);
4739 /* Create nodes for all integer types (and error_mark_node) using the sizes
4740 of C datatypes. The caller should call set_sizetype soon after calling
4741 this function to select one of the types as sizetype. */
4744 build_common_tree_nodes (signed_char
)
4747 error_mark_node
= make_node (ERROR_MARK
);
4748 TREE_TYPE (error_mark_node
) = error_mark_node
;
4750 initialize_sizetypes ();
4752 /* Define both `signed char' and `unsigned char'. */
4753 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
4754 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
4756 /* Define `char', which is like either `signed char' or `unsigned char'
4757 but not the same as either. */
4760 ? make_signed_type (CHAR_TYPE_SIZE
)
4761 : make_unsigned_type (CHAR_TYPE_SIZE
));
4763 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
4764 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
4765 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
4766 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
4767 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
4768 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
4769 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
4770 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
4772 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
4773 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
4774 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
4775 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
4776 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
4778 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
4779 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
4780 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
4781 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
4782 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
4785 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4786 It will create several other common tree nodes. */
4789 build_common_tree_nodes_2 (short_double
)
4792 /* Define these next since types below may used them. */
4793 integer_zero_node
= build_int_2 (0, 0);
4794 integer_one_node
= build_int_2 (1, 0);
4795 integer_minus_one_node
= build_int_2 (-1, -1);
4797 size_zero_node
= size_int (0);
4798 size_one_node
= size_int (1);
4799 bitsize_zero_node
= bitsize_int (0);
4800 bitsize_one_node
= bitsize_int (1);
4801 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
4803 void_type_node
= make_node (VOID_TYPE
);
4804 layout_type (void_type_node
);
4806 /* We are not going to have real types in C with less than byte alignment,
4807 so we might as well not have any types that claim to have it. */
4808 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
4809 TYPE_USER_ALIGN (void_type_node
) = 0;
4811 null_pointer_node
= build_int_2 (0, 0);
4812 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
4813 layout_type (TREE_TYPE (null_pointer_node
));
4815 ptr_type_node
= build_pointer_type (void_type_node
);
4817 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
4819 float_type_node
= make_node (REAL_TYPE
);
4820 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
4821 layout_type (float_type_node
);
4823 double_type_node
= make_node (REAL_TYPE
);
4825 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
4827 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
4828 layout_type (double_type_node
);
4830 long_double_type_node
= make_node (REAL_TYPE
);
4831 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
4832 layout_type (long_double_type_node
);
4834 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
4835 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
4836 layout_type (complex_integer_type_node
);
4838 complex_float_type_node
= make_node (COMPLEX_TYPE
);
4839 TREE_TYPE (complex_float_type_node
) = float_type_node
;
4840 layout_type (complex_float_type_node
);
4842 complex_double_type_node
= make_node (COMPLEX_TYPE
);
4843 TREE_TYPE (complex_double_type_node
) = double_type_node
;
4844 layout_type (complex_double_type_node
);
4846 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
4847 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
4848 layout_type (complex_long_double_type_node
);
4852 BUILD_VA_LIST_TYPE (t
);
4854 /* Many back-ends define record types without seting TYPE_NAME.
4855 If we copied the record type here, we'd keep the original
4856 record type without a name. This breaks name mangling. So,
4857 don't copy record types and let c_common_nodes_and_builtins()
4858 declare the type to be __builtin_va_list. */
4859 if (TREE_CODE (t
) != RECORD_TYPE
)
4860 t
= build_type_copy (t
);
4862 va_list_type_node
= t
;
4865 unsigned_V4SI_type_node
4866 = make_vector (V4SImode
, unsigned_intSI_type_node
, 1);
4867 unsigned_V2HI_type_node
4868 = make_vector (V2HImode
, unsigned_intHI_type_node
, 1);
4869 unsigned_V2SI_type_node
4870 = make_vector (V2SImode
, unsigned_intSI_type_node
, 1);
4871 unsigned_V2DI_type_node
4872 = make_vector (V2DImode
, unsigned_intDI_type_node
, 1);
4873 unsigned_V4HI_type_node
4874 = make_vector (V4HImode
, unsigned_intHI_type_node
, 1);
4875 unsigned_V8QI_type_node
4876 = make_vector (V8QImode
, unsigned_intQI_type_node
, 1);
4877 unsigned_V8HI_type_node
4878 = make_vector (V8HImode
, unsigned_intHI_type_node
, 1);
4879 unsigned_V16QI_type_node
4880 = make_vector (V16QImode
, unsigned_intQI_type_node
, 1);
4881 unsigned_V1DI_type_node
4882 = make_vector (V1DImode
, unsigned_intDI_type_node
, 1);
4884 V16SF_type_node
= make_vector (V16SFmode
, float_type_node
, 0);
4885 V4SF_type_node
= make_vector (V4SFmode
, float_type_node
, 0);
4886 V4SI_type_node
= make_vector (V4SImode
, intSI_type_node
, 0);
4887 V2HI_type_node
= make_vector (V2HImode
, intHI_type_node
, 0);
4888 V2SI_type_node
= make_vector (V2SImode
, intSI_type_node
, 0);
4889 V2DI_type_node
= make_vector (V2DImode
, intDI_type_node
, 0);
4890 V4HI_type_node
= make_vector (V4HImode
, intHI_type_node
, 0);
4891 V8QI_type_node
= make_vector (V8QImode
, intQI_type_node
, 0);
4892 V8HI_type_node
= make_vector (V8HImode
, intHI_type_node
, 0);
4893 V2SF_type_node
= make_vector (V2SFmode
, float_type_node
, 0);
4894 V2DF_type_node
= make_vector (V2DFmode
, double_type_node
, 0);
4895 V16QI_type_node
= make_vector (V16QImode
, intQI_type_node
, 0);
4896 V1DI_type_node
= make_vector (V1DImode
, intDI_type_node
, 0);
4899 /* Returns a vector tree node given a vector mode, the inner type, and
4903 make_vector (mode
, innertype
, unsignedp
)
4904 enum machine_mode mode
;
4910 t
= make_node (VECTOR_TYPE
);
4911 TREE_TYPE (t
) = innertype
;
4912 TYPE_MODE (t
) = mode
;
4913 TREE_UNSIGNED (TREE_TYPE (t
)) = unsignedp
;
4914 finish_vector_type (t
);
4919 /* Given an initializer INIT, return TRUE if INIT is zero or some
4920 aggregate of zeros. Otherwise return FALSE. */
4923 initializer_zerop (init
)
4928 switch (TREE_CODE (init
))
4931 return integer_zerop (init
);
4933 return real_zerop (init
)
4934 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
4936 return integer_zerop (init
)
4937 || (real_zerop (init
)
4938 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
4939 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
4942 if (AGGREGATE_TYPE_P (TREE_TYPE (init
)))
4944 tree aggr_init
= CONSTRUCTOR_ELTS (init
);
4948 if (! initializer_zerop (TREE_VALUE (aggr_init
)))
4950 aggr_init
= TREE_CHAIN (aggr_init
);
4961 #include "gt-tree.h"