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.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
49 #include "langhooks.h"
51 #define obstack_chunk_alloc xmalloc
52 #define obstack_chunk_free free
53 /* obstack.[ch] explicitly declined to prototype this. */
54 extern int _obstack_allocated_p
PARAMS ((struct obstack
*h
, PTR obj
));
56 /* Objects allocated on this obstack last forever. */
58 struct obstack permanent_obstack
;
60 /* Statistics-gathering stuff. */
80 int tree_node_counts
[(int) all_kinds
];
81 int tree_node_sizes
[(int) all_kinds
];
83 static const char * const tree_node_kind_names
[] = {
100 /* Unique id for next decl created. */
101 static int next_decl_uid
;
102 /* Unique id for next type created. */
103 static int next_type_uid
= 1;
105 /* Since we cannot rehash a type after it is in the table, we have to
106 keep the hash code. */
114 /* Initial size of the hash table (rounded to next prime). */
115 #define TYPE_HASH_INITIAL_SIZE 1000
117 /* Now here is the hash table. When recording a type, it is added to
118 the slot whose index is the hash code. Note that the hash table is
119 used for several kinds of types (function types, array types and
120 array index range types, for now). While all these live in the
121 same table, they are completely independent, and the hash code is
122 computed differently for each of these. */
124 htab_t type_hash_table
;
126 static void set_type_quals
PARAMS ((tree
, int));
127 static void append_random_chars
PARAMS ((char *));
128 static int type_hash_eq
PARAMS ((const void *, const void *));
129 static unsigned int type_hash_hash
PARAMS ((const void *));
130 static void print_type_hash_statistics
PARAMS((void));
131 static void finish_vector_type
PARAMS((tree
));
132 static tree make_vector
PARAMS ((enum machine_mode
, tree
, int));
133 static int type_hash_marked_p
PARAMS ((const void *));
134 static void type_hash_mark
PARAMS ((const void *));
135 static int mark_tree_hashtable_entry
PARAMS((void **, void *));
137 tree global_trees
[TI_MAX
];
138 tree integer_types
[itk_none
];
140 /* Init the principal obstacks. */
145 gcc_obstack_init (&permanent_obstack
);
147 /* Initialize the hash table of types. */
148 type_hash_table
= htab_create (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
150 ggc_add_deletable_htab (type_hash_table
, type_hash_marked_p
,
152 ggc_add_tree_root (global_trees
, TI_MAX
);
153 ggc_add_tree_root (integer_types
, itk_none
);
157 /* Allocate SIZE bytes in the permanent obstack
158 and return a pointer to them. */
164 return (char *) obstack_alloc (&permanent_obstack
, size
);
167 /* Allocate NELEM items of SIZE bytes in the permanent obstack
168 and return a pointer to them. The storage is cleared before
169 returning the value. */
172 perm_calloc (nelem
, size
)
176 char *rval
= (char *) obstack_alloc (&permanent_obstack
, nelem
* size
);
177 memset (rval
, 0, nelem
* size
);
181 /* The name of the object as the assembler will see it (but before any
182 translations made by ASM_OUTPUT_LABELREF). Often this is the same
183 as DECL_NAME. It is an IDENTIFIER_NODE. */
185 decl_assembler_name (decl
)
188 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
189 (*lang_hooks
.set_decl_assembler_name
) (decl
);
190 return DECL_CHECK (decl
)->decl
.assembler_name
;
193 /* Compute the number of bytes occupied by 'node'. This routine only
194 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
199 enum tree_code code
= TREE_CODE (node
);
201 switch (TREE_CODE_CLASS (code
))
203 case 'd': /* A decl node */
204 return sizeof (struct tree_decl
);
206 case 't': /* a type node */
207 return sizeof (struct tree_type
);
209 case 'b': /* a lexical block node */
210 return sizeof (struct tree_block
);
212 case 'r': /* a reference */
213 case 'e': /* an expression */
214 case 's': /* an expression with side effects */
215 case '<': /* a comparison expression */
216 case '1': /* a unary arithmetic expression */
217 case '2': /* a binary arithmetic expression */
218 return (sizeof (struct tree_exp
)
219 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
221 case 'c': /* a constant */
222 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
223 words is machine-dependent due to varying length of HOST_WIDE_INT,
224 which might be wider than a pointer (e.g., long long). Similarly
225 for REAL_CST, since the number of words is machine-dependent due
226 to varying size and alignment of `double'. */
227 if (code
== INTEGER_CST
)
228 return sizeof (struct tree_int_cst
);
229 else if (code
== REAL_CST
)
230 return sizeof (struct tree_real_cst
);
232 return (sizeof (struct tree_common
)
233 + TREE_CODE_LENGTH (code
) * sizeof (char *));
235 case 'x': /* something random, like an identifier. */
238 length
= (sizeof (struct tree_common
)
239 + TREE_CODE_LENGTH (code
) * sizeof (char *));
240 if (code
== TREE_VEC
)
241 length
+= (TREE_VEC_LENGTH (node
) - 1) * sizeof (char *);
250 /* Return a newly allocated node of code CODE.
251 For decl and type nodes, some other fields are initialized.
252 The rest of the node is initialized to zero.
254 Achoo! I got a code in the node. */
261 int type
= TREE_CODE_CLASS (code
);
263 #ifdef GATHER_STATISTICS
266 struct tree_common ttmp
;
268 /* We can't allocate a TREE_VEC without knowing how many elements
270 if (code
== TREE_VEC
)
273 TREE_SET_CODE ((tree
)&ttmp
, code
);
274 length
= tree_size ((tree
)&ttmp
);
276 #ifdef GATHER_STATISTICS
279 case 'd': /* A decl node */
283 case 't': /* a type node */
287 case 'b': /* a lexical block */
291 case 's': /* an expression with side effects */
295 case 'r': /* a reference */
299 case 'e': /* an expression */
300 case '<': /* a comparison expression */
301 case '1': /* a unary arithmetic expression */
302 case '2': /* a binary arithmetic expression */
306 case 'c': /* a constant */
310 case 'x': /* something random, like an identifier. */
311 if (code
== IDENTIFIER_NODE
)
313 else if (code
== TREE_VEC
)
323 tree_node_counts
[(int) kind
]++;
324 tree_node_sizes
[(int) kind
] += length
;
327 t
= ggc_alloc_tree (length
);
329 memset ((PTR
) t
, 0, length
);
331 TREE_SET_CODE (t
, code
);
336 TREE_SIDE_EFFECTS (t
) = 1;
337 TREE_TYPE (t
) = void_type_node
;
341 if (code
!= FUNCTION_DECL
)
343 DECL_USER_ALIGN (t
) = 0;
344 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
345 DECL_SOURCE_LINE (t
) = lineno
;
346 DECL_SOURCE_FILE (t
) =
347 (input_filename
) ? input_filename
: "<built-in>";
348 DECL_UID (t
) = next_decl_uid
++;
350 /* We have not yet computed the alias set for this declaration. */
351 DECL_POINTER_ALIAS_SET (t
) = -1;
355 TYPE_UID (t
) = next_type_uid
++;
356 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
357 TYPE_USER_ALIGN (t
) = 0;
358 TYPE_MAIN_VARIANT (t
) = t
;
360 /* Default to no attributes for type, but let target change that. */
361 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
362 (*targetm
.set_default_type_attributes
) (t
);
364 /* We have not yet computed the alias set for this type. */
365 TYPE_ALIAS_SET (t
) = -1;
369 TREE_CONSTANT (t
) = 1;
379 case PREDECREMENT_EXPR
:
380 case PREINCREMENT_EXPR
:
381 case POSTDECREMENT_EXPR
:
382 case POSTINCREMENT_EXPR
:
383 /* All of these have side-effects, no matter what their
385 TREE_SIDE_EFFECTS (t
) = 1;
397 /* Return a new node with the same contents as NODE except that its
398 TREE_CHAIN is zero and it has a fresh uid. */
405 enum tree_code code
= TREE_CODE (node
);
408 length
= tree_size (node
);
409 t
= ggc_alloc_tree (length
);
410 memcpy (t
, node
, length
);
413 TREE_ASM_WRITTEN (t
) = 0;
415 if (TREE_CODE_CLASS (code
) == 'd')
416 DECL_UID (t
) = next_decl_uid
++;
417 else if (TREE_CODE_CLASS (code
) == 't')
419 TYPE_UID (t
) = next_type_uid
++;
420 /* The following is so that the debug code for
421 the copy is different from the original type.
422 The two statements usually duplicate each other
423 (because they clear fields of the same union),
424 but the optimizer should catch that. */
425 TYPE_SYMTAB_POINTER (t
) = 0;
426 TYPE_SYMTAB_ADDRESS (t
) = 0;
432 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
433 For example, this can copy a list made of TREE_LIST nodes. */
445 head
= prev
= copy_node (list
);
446 next
= TREE_CHAIN (list
);
449 TREE_CHAIN (prev
) = copy_node (next
);
450 prev
= TREE_CHAIN (prev
);
451 next
= TREE_CHAIN (next
);
457 /* Return a newly constructed INTEGER_CST node whose constant value
458 is specified by the two ints LOW and HI.
459 The TREE_TYPE is set to `int'.
461 This function should be used via the `build_int_2' macro. */
464 build_int_2_wide (low
, hi
)
465 unsigned HOST_WIDE_INT low
;
468 tree t
= make_node (INTEGER_CST
);
470 TREE_INT_CST_LOW (t
) = low
;
471 TREE_INT_CST_HIGH (t
) = hi
;
472 TREE_TYPE (t
) = integer_type_node
;
476 /* Return a new VECTOR_CST node whose type is TYPE and whose values
477 are in a list pointed by VALS. */
480 build_vector (type
, vals
)
483 tree v
= make_node (VECTOR_CST
);
484 int over1
= 0, over2
= 0;
487 TREE_VECTOR_CST_ELTS (v
) = vals
;
488 TREE_TYPE (v
) = type
;
490 /* Iterate through elements and check for overflow. */
491 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
493 tree value
= TREE_VALUE (link
);
495 over1
|= TREE_OVERFLOW (value
);
496 over2
|= TREE_CONSTANT_OVERFLOW (value
);
499 TREE_OVERFLOW (v
) = over1
;
500 TREE_CONSTANT_OVERFLOW (v
) = over2
;
505 /* Return a new REAL_CST node whose type is TYPE and value is D. */
516 /* Check for valid float value for this type on this target machine;
517 if not, can print error message and store a valid value in D. */
518 #ifdef CHECK_FLOAT_VALUE
519 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
522 v
= make_node (REAL_CST
);
523 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
524 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
526 TREE_TYPE (v
) = type
;
527 TREE_REAL_CST_PTR (v
) = dp
;
528 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
532 /* Return a new REAL_CST node whose type is TYPE
533 and whose value is the integer value of the INTEGER_CST node I. */
536 real_value_from_int_cst (type
, i
)
537 tree type ATTRIBUTE_UNUSED
, i
;
541 /* Clear all bits of the real value type so that we can later do
542 bitwise comparisons to see if two values are the same. */
543 memset ((char *) &d
, 0, sizeof d
);
545 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
546 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
549 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
550 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
554 /* Given a tree representing an integer constant I, return a tree
555 representing the same value as a floating-point constant of type TYPE. */
558 build_real_from_int_cst (type
, i
)
563 int overflow
= TREE_OVERFLOW (i
);
565 v
= build_real (type
, real_value_from_int_cst (type
, i
));
567 TREE_OVERFLOW (v
) |= overflow
;
568 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
572 /* Return a newly constructed STRING_CST node whose value is
573 the LEN characters at STR.
574 The TREE_TYPE is not initialized. */
577 build_string (len
, str
)
581 tree s
= make_node (STRING_CST
);
583 TREE_STRING_LENGTH (s
) = len
;
584 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
589 /* Return a newly constructed COMPLEX_CST node whose value is
590 specified by the real and imaginary parts REAL and IMAG.
591 Both REAL and IMAG should be constant nodes. TYPE, if specified,
592 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
595 build_complex (type
, real
, imag
)
599 tree t
= make_node (COMPLEX_CST
);
601 TREE_REALPART (t
) = real
;
602 TREE_IMAGPART (t
) = imag
;
603 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
604 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
605 TREE_CONSTANT_OVERFLOW (t
)
606 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
610 /* Build a newly constructed TREE_VEC node of length LEN. */
617 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
619 #ifdef GATHER_STATISTICS
620 tree_node_counts
[(int) vec_kind
]++;
621 tree_node_sizes
[(int) vec_kind
] += length
;
624 t
= ggc_alloc_tree (length
);
626 memset ((PTR
) t
, 0, length
);
627 TREE_SET_CODE (t
, TREE_VEC
);
628 TREE_VEC_LENGTH (t
) = len
;
633 /* Return 1 if EXPR is the integer constant zero or a complex constant
642 return ((TREE_CODE (expr
) == INTEGER_CST
643 && ! TREE_CONSTANT_OVERFLOW (expr
)
644 && TREE_INT_CST_LOW (expr
) == 0
645 && TREE_INT_CST_HIGH (expr
) == 0)
646 || (TREE_CODE (expr
) == COMPLEX_CST
647 && integer_zerop (TREE_REALPART (expr
))
648 && integer_zerop (TREE_IMAGPART (expr
))));
651 /* Return 1 if EXPR is the integer constant one or the corresponding
660 return ((TREE_CODE (expr
) == INTEGER_CST
661 && ! TREE_CONSTANT_OVERFLOW (expr
)
662 && TREE_INT_CST_LOW (expr
) == 1
663 && TREE_INT_CST_HIGH (expr
) == 0)
664 || (TREE_CODE (expr
) == COMPLEX_CST
665 && integer_onep (TREE_REALPART (expr
))
666 && integer_zerop (TREE_IMAGPART (expr
))));
669 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
670 it contains. Likewise for the corresponding complex constant. */
673 integer_all_onesp (expr
)
681 if (TREE_CODE (expr
) == COMPLEX_CST
682 && integer_all_onesp (TREE_REALPART (expr
))
683 && integer_zerop (TREE_IMAGPART (expr
)))
686 else if (TREE_CODE (expr
) != INTEGER_CST
687 || TREE_CONSTANT_OVERFLOW (expr
))
690 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
692 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
693 && TREE_INT_CST_HIGH (expr
) == -1);
695 /* Note that using TYPE_PRECISION here is wrong. We care about the
696 actual bits, not the (arbitrary) range of the type. */
697 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
698 if (prec
>= HOST_BITS_PER_WIDE_INT
)
700 HOST_WIDE_INT high_value
;
703 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
705 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
706 /* Can not handle precisions greater than twice the host int size. */
708 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
709 /* Shifting by the host word size is undefined according to the ANSI
710 standard, so we must handle this as a special case. */
713 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
715 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
716 && TREE_INT_CST_HIGH (expr
) == high_value
);
719 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
722 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
730 HOST_WIDE_INT high
, low
;
734 if (TREE_CODE (expr
) == COMPLEX_CST
735 && integer_pow2p (TREE_REALPART (expr
))
736 && integer_zerop (TREE_IMAGPART (expr
)))
739 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
742 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
743 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
744 high
= TREE_INT_CST_HIGH (expr
);
745 low
= TREE_INT_CST_LOW (expr
);
747 /* First clear all bits that are beyond the type's precision in case
748 we've been sign extended. */
750 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
752 else if (prec
> HOST_BITS_PER_WIDE_INT
)
753 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
757 if (prec
< HOST_BITS_PER_WIDE_INT
)
758 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
761 if (high
== 0 && low
== 0)
764 return ((high
== 0 && (low
& (low
- 1)) == 0)
765 || (low
== 0 && (high
& (high
- 1)) == 0));
768 /* Return the power of two represented by a tree node known to be a
776 HOST_WIDE_INT high
, low
;
780 if (TREE_CODE (expr
) == COMPLEX_CST
)
781 return tree_log2 (TREE_REALPART (expr
));
783 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
784 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
786 high
= TREE_INT_CST_HIGH (expr
);
787 low
= TREE_INT_CST_LOW (expr
);
789 /* First clear all bits that are beyond the type's precision in case
790 we've been sign extended. */
792 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
794 else if (prec
> HOST_BITS_PER_WIDE_INT
)
795 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
799 if (prec
< HOST_BITS_PER_WIDE_INT
)
800 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
803 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
807 /* Similar, but return the largest integer Y such that 2 ** Y is less
808 than or equal to EXPR. */
811 tree_floor_log2 (expr
)
815 HOST_WIDE_INT high
, low
;
819 if (TREE_CODE (expr
) == COMPLEX_CST
)
820 return tree_log2 (TREE_REALPART (expr
));
822 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
823 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
825 high
= TREE_INT_CST_HIGH (expr
);
826 low
= TREE_INT_CST_LOW (expr
);
828 /* First clear all bits that are beyond the type's precision in case
829 we've been sign extended. Ignore if type's precision hasn't been set
830 since what we are doing is setting it. */
832 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
834 else if (prec
> HOST_BITS_PER_WIDE_INT
)
835 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
839 if (prec
< HOST_BITS_PER_WIDE_INT
)
840 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
843 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
847 /* Return 1 if EXPR is the real constant zero. */
855 return ((TREE_CODE (expr
) == REAL_CST
856 && ! TREE_CONSTANT_OVERFLOW (expr
)
857 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
858 || (TREE_CODE (expr
) == COMPLEX_CST
859 && real_zerop (TREE_REALPART (expr
))
860 && real_zerop (TREE_IMAGPART (expr
))));
863 /* Return 1 if EXPR is the real constant one in real or complex form. */
871 return ((TREE_CODE (expr
) == REAL_CST
872 && ! TREE_CONSTANT_OVERFLOW (expr
)
873 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
874 || (TREE_CODE (expr
) == COMPLEX_CST
875 && real_onep (TREE_REALPART (expr
))
876 && real_zerop (TREE_IMAGPART (expr
))));
879 /* Return 1 if EXPR is the real constant two. */
887 return ((TREE_CODE (expr
) == REAL_CST
888 && ! TREE_CONSTANT_OVERFLOW (expr
)
889 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
890 || (TREE_CODE (expr
) == COMPLEX_CST
891 && real_twop (TREE_REALPART (expr
))
892 && real_zerop (TREE_IMAGPART (expr
))));
895 /* Nonzero if EXP is a constant or a cast of a constant. */
898 really_constant_p (exp
)
901 /* This is not quite the same as STRIP_NOPS. It does more. */
902 while (TREE_CODE (exp
) == NOP_EXPR
903 || TREE_CODE (exp
) == CONVERT_EXPR
904 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
905 exp
= TREE_OPERAND (exp
, 0);
906 return TREE_CONSTANT (exp
);
909 /* Return first list element whose TREE_VALUE is ELEM.
910 Return 0 if ELEM is not in LIST. */
913 value_member (elem
, list
)
918 if (elem
== TREE_VALUE (list
))
920 list
= TREE_CHAIN (list
);
925 /* Return first list element whose TREE_PURPOSE is ELEM.
926 Return 0 if ELEM is not in LIST. */
929 purpose_member (elem
, list
)
934 if (elem
== TREE_PURPOSE (list
))
936 list
= TREE_CHAIN (list
);
941 /* Return first list element whose BINFO_TYPE is ELEM.
942 Return 0 if ELEM is not in LIST. */
945 binfo_member (elem
, list
)
950 if (elem
== BINFO_TYPE (list
))
952 list
= TREE_CHAIN (list
);
957 /* Return nonzero if ELEM is part of the chain CHAIN. */
960 chain_member (elem
, chain
)
967 chain
= TREE_CHAIN (chain
);
973 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
974 chain CHAIN. This and the next function are currently unused, but
975 are retained for completeness. */
978 chain_member_value (elem
, chain
)
983 if (elem
== TREE_VALUE (chain
))
985 chain
= TREE_CHAIN (chain
);
991 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
992 for any piece of chain CHAIN. */
995 chain_member_purpose (elem
, chain
)
1000 if (elem
== TREE_PURPOSE (chain
))
1002 chain
= TREE_CHAIN (chain
);
1008 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1009 We expect a null pointer to mark the end of the chain.
1010 This is the Lisp primitive `length'. */
1019 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1025 /* Returns the number of FIELD_DECLs in TYPE. */
1028 fields_length (type
)
1031 tree t
= TYPE_FIELDS (type
);
1034 for (; t
; t
= TREE_CHAIN (t
))
1035 if (TREE_CODE (t
) == FIELD_DECL
)
1041 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1042 by modifying the last node in chain 1 to point to chain 2.
1043 This is the Lisp primitive `nconc'. */
1053 #ifdef ENABLE_TREE_CHECKING
1057 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1059 TREE_CHAIN (t1
) = op2
;
1060 #ifdef ENABLE_TREE_CHECKING
1061 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1063 abort (); /* Circularity created. */
1071 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1079 while ((next
= TREE_CHAIN (chain
)))
1084 /* Reverse the order of elements in the chain T,
1085 and return the new head of the chain (old last element). */
1091 tree prev
= 0, decl
, next
;
1092 for (decl
= t
; decl
; decl
= next
)
1094 next
= TREE_CHAIN (decl
);
1095 TREE_CHAIN (decl
) = prev
;
1101 /* Given a chain CHAIN of tree nodes,
1102 construct and return a list of those nodes. */
1108 tree result
= NULL_TREE
;
1109 tree in_tail
= chain
;
1110 tree out_tail
= NULL_TREE
;
1114 tree next
= tree_cons (NULL_TREE
, in_tail
, NULL_TREE
);
1116 TREE_CHAIN (out_tail
) = next
;
1120 in_tail
= TREE_CHAIN (in_tail
);
1126 /* Return a newly created TREE_LIST node whose
1127 purpose and value fields are PARM and VALUE. */
1130 build_tree_list (parm
, value
)
1133 tree t
= make_node (TREE_LIST
);
1134 TREE_PURPOSE (t
) = parm
;
1135 TREE_VALUE (t
) = value
;
1139 /* Return a newly created TREE_LIST node whose
1140 purpose and value fields are PARM and VALUE
1141 and whose TREE_CHAIN is CHAIN. */
1144 tree_cons (purpose
, value
, chain
)
1145 tree purpose
, value
, chain
;
1149 node
= ggc_alloc_tree (sizeof (struct tree_list
));
1151 memset (node
, 0, sizeof (struct tree_common
));
1153 #ifdef GATHER_STATISTICS
1154 tree_node_counts
[(int) x_kind
]++;
1155 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1158 TREE_SET_CODE (node
, TREE_LIST
);
1159 TREE_CHAIN (node
) = chain
;
1160 TREE_PURPOSE (node
) = purpose
;
1161 TREE_VALUE (node
) = value
;
1166 /* Return the size nominally occupied by an object of type TYPE
1167 when it resides in memory. The value is measured in units of bytes,
1168 and its data type is that normally used for type sizes
1169 (which is the first type created by make_signed_type or
1170 make_unsigned_type). */
1173 size_in_bytes (type
)
1178 if (type
== error_mark_node
)
1179 return integer_zero_node
;
1181 type
= TYPE_MAIN_VARIANT (type
);
1182 t
= TYPE_SIZE_UNIT (type
);
1186 (*lang_hooks
.types
.incomplete_type_error
) (NULL_TREE
, type
);
1187 return size_zero_node
;
1190 if (TREE_CODE (t
) == INTEGER_CST
)
1191 force_fit_type (t
, 0);
1196 /* Return the size of TYPE (in bytes) as a wide integer
1197 or return -1 if the size can vary or is larger than an integer. */
1200 int_size_in_bytes (type
)
1205 if (type
== error_mark_node
)
1208 type
= TYPE_MAIN_VARIANT (type
);
1209 t
= TYPE_SIZE_UNIT (type
);
1211 || TREE_CODE (t
) != INTEGER_CST
1212 || TREE_OVERFLOW (t
)
1213 || TREE_INT_CST_HIGH (t
) != 0
1214 /* If the result would appear negative, it's too big to represent. */
1215 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1218 return TREE_INT_CST_LOW (t
);
1221 /* Return the bit position of FIELD, in bits from the start of the record.
1222 This is a tree of type bitsizetype. */
1225 bit_position (field
)
1229 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1230 DECL_FIELD_BIT_OFFSET (field
));
1233 /* Likewise, but return as an integer. Abort if it cannot be represented
1234 in that way (since it could be a signed value, we don't have the option
1235 of returning -1 like int_size_in_byte can. */
1238 int_bit_position (field
)
1241 return tree_low_cst (bit_position (field
), 0);
1244 /* Return the byte position of FIELD, in bytes from the start of the record.
1245 This is a tree of type sizetype. */
1248 byte_position (field
)
1251 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1252 DECL_FIELD_BIT_OFFSET (field
));
1255 /* Likewise, but return as an integer. Abort if it cannot be represented
1256 in that way (since it could be a signed value, we don't have the option
1257 of returning -1 like int_size_in_byte can. */
1260 int_byte_position (field
)
1263 return tree_low_cst (byte_position (field
), 0);
1266 /* Return the strictest alignment, in bits, that T is known to have. */
1272 unsigned int align0
, align1
;
1274 switch (TREE_CODE (t
))
1276 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1277 /* If we have conversions, we know that the alignment of the
1278 object must meet each of the alignments of the types. */
1279 align0
= expr_align (TREE_OPERAND (t
, 0));
1280 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1281 return MAX (align0
, align1
);
1283 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1284 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1285 case WITH_RECORD_EXPR
: case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
1286 /* These don't change the alignment of an object. */
1287 return expr_align (TREE_OPERAND (t
, 0));
1290 /* The best we can do is say that the alignment is the least aligned
1292 align0
= expr_align (TREE_OPERAND (t
, 1));
1293 align1
= expr_align (TREE_OPERAND (t
, 2));
1294 return MIN (align0
, align1
);
1296 case LABEL_DECL
: case CONST_DECL
:
1297 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1298 if (DECL_ALIGN (t
) != 0)
1299 return DECL_ALIGN (t
);
1303 return FUNCTION_BOUNDARY
;
1309 /* Otherwise take the alignment from that of the type. */
1310 return TYPE_ALIGN (TREE_TYPE (t
));
1313 /* Return, as a tree node, the number of elements for TYPE (which is an
1314 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1317 array_type_nelts (type
)
1320 tree index_type
, min
, max
;
1322 /* If they did it with unspecified bounds, then we should have already
1323 given an error about it before we got here. */
1324 if (! TYPE_DOMAIN (type
))
1325 return error_mark_node
;
1327 index_type
= TYPE_DOMAIN (type
);
1328 min
= TYPE_MIN_VALUE (index_type
);
1329 max
= TYPE_MAX_VALUE (index_type
);
1331 return (integer_zerop (min
)
1333 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1336 /* Return nonzero if arg is static -- a reference to an object in
1337 static storage. This is not the same as the C meaning of `static'. */
1343 switch (TREE_CODE (arg
))
1346 /* Nested functions aren't static, since taking their address
1347 involves a trampoline. */
1348 return ((decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1349 && ! DECL_NON_ADDR_CONST_P (arg
));
1352 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1353 && ! DECL_THREAD_LOCAL (arg
)
1354 && ! DECL_NON_ADDR_CONST_P (arg
));
1357 return TREE_STATIC (arg
);
1363 /* If we are referencing a bitfield, we can't evaluate an
1364 ADDR_EXPR at compile time and so it isn't a constant. */
1366 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
1367 && staticp (TREE_OPERAND (arg
, 0)));
1373 /* This case is technically correct, but results in setting
1374 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1377 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
1381 case ARRAY_RANGE_REF
:
1382 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1383 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1384 return staticp (TREE_OPERAND (arg
, 0));
1387 if ((unsigned int) TREE_CODE (arg
)
1388 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1389 return (*lang_hooks
.staticp
) (arg
);
1395 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1396 Do this to any expression which may be used in more than one place,
1397 but must be evaluated only once.
1399 Normally, expand_expr would reevaluate the expression each time.
1400 Calling save_expr produces something that is evaluated and recorded
1401 the first time expand_expr is called on it. Subsequent calls to
1402 expand_expr just reuse the recorded value.
1404 The call to expand_expr that generates code that actually computes
1405 the value is the first call *at compile time*. Subsequent calls
1406 *at compile time* generate code to use the saved value.
1407 This produces correct result provided that *at run time* control
1408 always flows through the insns made by the first expand_expr
1409 before reaching the other places where the save_expr was evaluated.
1410 You, the caller of save_expr, must make sure this is so.
1412 Constants, and certain read-only nodes, are returned with no
1413 SAVE_EXPR because that is safe. Expressions containing placeholders
1414 are not touched; see tree.def for an explanation of what these
1421 tree t
= fold (expr
);
1424 /* We don't care about whether this can be used as an lvalue in this
1426 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
1427 t
= TREE_OPERAND (t
, 0);
1429 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1430 a constant, it will be more efficient to not make another SAVE_EXPR since
1431 it will allow better simplification and GCSE will be able to merge the
1432 computations if they actualy occur. */
1434 (TREE_CODE_CLASS (TREE_CODE (inner
)) == '1'
1435 || (TREE_CODE_CLASS (TREE_CODE (inner
)) == '2'
1436 && TREE_CONSTANT (TREE_OPERAND (inner
, 1))));
1437 inner
= TREE_OPERAND (inner
, 0))
1440 /* If the tree evaluates to a constant, then we don't want to hide that
1441 fact (i.e. this allows further folding, and direct checks for constants).
1442 However, a read-only object that has side effects cannot be bypassed.
1443 Since it is no problem to reevaluate literals, we just return the
1445 if (TREE_CONSTANT (inner
)
1446 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1447 || TREE_CODE (inner
) == SAVE_EXPR
|| TREE_CODE (inner
) == ERROR_MARK
)
1450 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1451 it means that the size or offset of some field of an object depends on
1452 the value within another field.
1454 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1455 and some variable since it would then need to be both evaluated once and
1456 evaluated more than once. Front-ends must assure this case cannot
1457 happen by surrounding any such subexpressions in their own SAVE_EXPR
1458 and forcing evaluation at the proper time. */
1459 if (contains_placeholder_p (t
))
1462 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
1464 /* This expression might be placed ahead of a jump to ensure that the
1465 value was computed on both sides of the jump. So make sure it isn't
1466 eliminated as dead. */
1467 TREE_SIDE_EFFECTS (t
) = 1;
1468 TREE_READONLY (t
) = 1;
1472 /* Arrange for an expression to be expanded multiple independent
1473 times. This is useful for cleanup actions, as the backend can
1474 expand them multiple times in different places. */
1482 /* If this is already protected, no sense in protecting it again. */
1483 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
1486 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
1487 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
1491 /* Returns the index of the first non-tree operand for CODE, or the number
1492 of operands if all are trees. */
1496 enum tree_code code
;
1502 case GOTO_SUBROUTINE_EXPR
:
1505 case WITH_CLEANUP_EXPR
:
1507 case METHOD_CALL_EXPR
:
1510 return TREE_CODE_LENGTH (code
);
1514 /* Perform any modifications to EXPR required when it is unsaved. Does
1515 not recurse into EXPR's subtrees. */
1518 unsave_expr_1 (expr
)
1521 switch (TREE_CODE (expr
))
1524 if (! SAVE_EXPR_PERSISTENT_P (expr
))
1525 SAVE_EXPR_RTL (expr
) = 0;
1529 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1530 It's OK for this to happen if it was part of a subtree that
1531 isn't immediately expanded, such as operand 2 of another
1533 if (TREE_OPERAND (expr
, 1))
1536 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
1537 TREE_OPERAND (expr
, 3) = NULL_TREE
;
1541 /* I don't yet know how to emit a sequence multiple times. */
1542 if (RTL_EXPR_SEQUENCE (expr
) != 0)
1551 /* Default lang hook for "unsave_expr_now". */
1554 lhd_unsave_expr_now (expr
)
1557 enum tree_code code
;
1559 /* There's nothing to do for NULL_TREE. */
1563 unsave_expr_1 (expr
);
1565 code
= TREE_CODE (expr
);
1566 switch (TREE_CODE_CLASS (code
))
1568 case 'c': /* a constant */
1569 case 't': /* a type node */
1570 case 'd': /* A decl node */
1571 case 'b': /* A block node */
1574 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1575 if (code
== TREE_LIST
)
1577 lhd_unsave_expr_now (TREE_VALUE (expr
));
1578 lhd_unsave_expr_now (TREE_CHAIN (expr
));
1582 case 'e': /* an expression */
1583 case 'r': /* a reference */
1584 case 's': /* an expression with side effects */
1585 case '<': /* a comparison expression */
1586 case '2': /* a binary arithmetic expression */
1587 case '1': /* a unary arithmetic expression */
1591 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
1592 lhd_unsave_expr_now (TREE_OPERAND (expr
, i
));
1603 /* Return 0 if it is safe to evaluate EXPR multiple times,
1604 return 1 if it is safe if EXPR is unsaved afterward, or
1605 return 2 if it is completely unsafe.
1607 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1608 an expression tree, so that it safe to unsave them and the surrounding
1609 context will be correct.
1611 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1612 occasionally across the whole of a function. It is therefore only
1613 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1614 below the UNSAVE_EXPR.
1616 RTL_EXPRs consume their rtl during evaluation. It is therefore
1617 never possible to unsave them. */
1620 unsafe_for_reeval (expr
)
1624 enum tree_code code
;
1629 if (expr
== NULL_TREE
)
1632 code
= TREE_CODE (expr
);
1633 first_rtl
= first_rtl_op (code
);
1642 for (exp
= expr
; exp
!= 0; exp
= TREE_CHAIN (exp
))
1644 tmp
= unsafe_for_reeval (TREE_VALUE (exp
));
1645 unsafeness
= MAX (tmp
, unsafeness
);
1651 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, 1));
1652 return MAX (tmp
, 1);
1659 tmp
= (*lang_hooks
.unsafe_for_reeval
) (expr
);
1665 switch (TREE_CODE_CLASS (code
))
1667 case 'c': /* a constant */
1668 case 't': /* a type node */
1669 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1670 case 'd': /* A decl node */
1671 case 'b': /* A block node */
1674 case 'e': /* an expression */
1675 case 'r': /* a reference */
1676 case 's': /* an expression with side effects */
1677 case '<': /* a comparison expression */
1678 case '2': /* a binary arithmetic expression */
1679 case '1': /* a unary arithmetic expression */
1680 for (i
= first_rtl
- 1; i
>= 0; i
--)
1682 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, i
));
1683 unsafeness
= MAX (tmp
, unsafeness
);
1693 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1694 or offset that depends on a field within a record. */
1697 contains_placeholder_p (exp
)
1700 enum tree_code code
;
1706 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1707 in it since it is supplying a value for it. */
1708 code
= TREE_CODE (exp
);
1709 if (code
== WITH_RECORD_EXPR
)
1711 else if (code
== PLACEHOLDER_EXPR
)
1714 switch (TREE_CODE_CLASS (code
))
1717 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1718 position computations since they will be converted into a
1719 WITH_RECORD_EXPR involving the reference, which will assume
1720 here will be valid. */
1721 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1724 if (code
== TREE_LIST
)
1725 return (contains_placeholder_p (TREE_VALUE (exp
))
1726 || (TREE_CHAIN (exp
) != 0
1727 && contains_placeholder_p (TREE_CHAIN (exp
))));
1736 /* Ignoring the first operand isn't quite right, but works best. */
1737 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
1744 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1745 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
1746 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
1749 /* If we already know this doesn't have a placeholder, don't
1751 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
1754 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
1755 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
1757 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
1762 return (TREE_OPERAND (exp
, 1) != 0
1763 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1769 switch (TREE_CODE_LENGTH (code
))
1772 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1774 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1775 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1786 /* Return 1 if EXP contains any expressions that produce cleanups for an
1787 outer scope to deal with. Used by fold. */
1795 if (! TREE_SIDE_EFFECTS (exp
))
1798 switch (TREE_CODE (exp
))
1801 case GOTO_SUBROUTINE_EXPR
:
1802 case WITH_CLEANUP_EXPR
:
1805 case CLEANUP_POINT_EXPR
:
1809 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
1811 cmp
= has_cleanups (TREE_VALUE (exp
));
1821 /* This general rule works for most tree codes. All exceptions should be
1822 handled above. If this is a language-specific tree code, we can't
1823 trust what might be in the operand, so say we don't know
1825 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
1828 nops
= first_rtl_op (TREE_CODE (exp
));
1829 for (i
= 0; i
< nops
; i
++)
1830 if (TREE_OPERAND (exp
, i
) != 0)
1832 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
1833 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
1834 || type
== 'r' || type
== 's')
1836 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
1845 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1846 return a tree with all occurrences of references to F in a
1847 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1848 contains only arithmetic expressions or a CALL_EXPR with a
1849 PLACEHOLDER_EXPR occurring only in its arglist. */
1852 substitute_in_expr (exp
, f
, r
)
1857 enum tree_code code
= TREE_CODE (exp
);
1862 switch (TREE_CODE_CLASS (code
))
1869 if (code
== PLACEHOLDER_EXPR
)
1871 else if (code
== TREE_LIST
)
1873 op0
= (TREE_CHAIN (exp
) == 0
1874 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
1875 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
1876 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1879 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1888 switch (TREE_CODE_LENGTH (code
))
1891 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1892 if (op0
== TREE_OPERAND (exp
, 0))
1895 if (code
== NON_LVALUE_EXPR
)
1898 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
1902 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
1903 could, but we don't support it. */
1904 if (code
== RTL_EXPR
)
1906 else if (code
== CONSTRUCTOR
)
1909 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1910 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1911 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
1914 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
1918 /* It cannot be that anything inside a SAVE_EXPR contains a
1919 PLACEHOLDER_EXPR. */
1920 if (code
== SAVE_EXPR
)
1923 else if (code
== CALL_EXPR
)
1925 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1926 if (op1
== TREE_OPERAND (exp
, 1))
1929 return build (code
, TREE_TYPE (exp
),
1930 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
1933 else if (code
!= COND_EXPR
)
1936 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1937 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1938 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
1939 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
1940 && op2
== TREE_OPERAND (exp
, 2))
1943 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
1956 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1957 and it is the right field, replace it with R. */
1958 for (inner
= TREE_OPERAND (exp
, 0);
1959 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
1960 inner
= TREE_OPERAND (inner
, 0))
1962 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
1963 && TREE_OPERAND (exp
, 1) == f
)
1966 /* If this expression hasn't been completed let, leave it
1968 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
1969 && TREE_TYPE (inner
) == 0)
1972 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1973 if (op0
== TREE_OPERAND (exp
, 0))
1976 new = fold (build (code
, TREE_TYPE (exp
), op0
,
1977 TREE_OPERAND (exp
, 1)));
1981 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1982 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1983 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
1984 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
1985 && op2
== TREE_OPERAND (exp
, 2))
1988 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
1993 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1994 if (op0
== TREE_OPERAND (exp
, 0))
1997 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2009 TREE_READONLY (new) = TREE_READONLY (exp
);
2013 /* Stabilize a reference so that we can use it any number of times
2014 without causing its operands to be evaluated more than once.
2015 Returns the stabilized reference. This works by means of save_expr,
2016 so see the caveats in the comments about save_expr.
2018 Also allows conversion expressions whose operands are references.
2019 Any other kind of expression is returned unchanged. */
2022 stabilize_reference (ref
)
2026 enum tree_code code
= TREE_CODE (ref
);
2033 /* No action is needed in this case. */
2039 case FIX_TRUNC_EXPR
:
2040 case FIX_FLOOR_EXPR
:
2041 case FIX_ROUND_EXPR
:
2043 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2047 result
= build_nt (INDIRECT_REF
,
2048 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2052 result
= build_nt (COMPONENT_REF
,
2053 stabilize_reference (TREE_OPERAND (ref
, 0)),
2054 TREE_OPERAND (ref
, 1));
2058 result
= build_nt (BIT_FIELD_REF
,
2059 stabilize_reference (TREE_OPERAND (ref
, 0)),
2060 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2061 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2065 result
= build_nt (ARRAY_REF
,
2066 stabilize_reference (TREE_OPERAND (ref
, 0)),
2067 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2070 case ARRAY_RANGE_REF
:
2071 result
= build_nt (ARRAY_RANGE_REF
,
2072 stabilize_reference (TREE_OPERAND (ref
, 0)),
2073 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2077 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2078 it wouldn't be ignored. This matters when dealing with
2080 return stabilize_reference_1 (ref
);
2083 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2084 save_expr (build1 (ADDR_EXPR
,
2085 build_pointer_type (TREE_TYPE (ref
)),
2089 /* If arg isn't a kind of lvalue we recognize, make no change.
2090 Caller should recognize the error for an invalid lvalue. */
2095 return error_mark_node
;
2098 TREE_TYPE (result
) = TREE_TYPE (ref
);
2099 TREE_READONLY (result
) = TREE_READONLY (ref
);
2100 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2101 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2106 /* Subroutine of stabilize_reference; this is called for subtrees of
2107 references. Any expression with side-effects must be put in a SAVE_EXPR
2108 to ensure that it is only evaluated once.
2110 We don't put SAVE_EXPR nodes around everything, because assigning very
2111 simple expressions to temporaries causes us to miss good opportunities
2112 for optimizations. Among other things, the opportunity to fold in the
2113 addition of a constant into an addressing mode often gets lost, e.g.
2114 "y[i+1] += x;". In general, we take the approach that we should not make
2115 an assignment unless we are forced into it - i.e., that any non-side effect
2116 operator should be allowed, and that cse should take care of coalescing
2117 multiple utterances of the same expression should that prove fruitful. */
2120 stabilize_reference_1 (e
)
2124 enum tree_code code
= TREE_CODE (e
);
2126 /* We cannot ignore const expressions because it might be a reference
2127 to a const array but whose index contains side-effects. But we can
2128 ignore things that are actual constant or that already have been
2129 handled by this function. */
2131 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2134 switch (TREE_CODE_CLASS (code
))
2144 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2145 so that it will only be evaluated once. */
2146 /* The reference (r) and comparison (<) classes could be handled as
2147 below, but it is generally faster to only evaluate them once. */
2148 if (TREE_SIDE_EFFECTS (e
))
2149 return save_expr (e
);
2153 /* Constants need no processing. In fact, we should never reach
2158 /* Division is slow and tends to be compiled with jumps,
2159 especially the division by powers of 2 that is often
2160 found inside of an array reference. So do it just once. */
2161 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2162 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2163 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2164 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2165 return save_expr (e
);
2166 /* Recursively stabilize each operand. */
2167 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2168 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2172 /* Recursively stabilize each operand. */
2173 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2180 TREE_TYPE (result
) = TREE_TYPE (e
);
2181 TREE_READONLY (result
) = TREE_READONLY (e
);
2182 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2183 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2188 /* Low-level constructors for expressions. */
2190 /* Build an expression of code CODE, data type TYPE,
2191 and operands as specified by the arguments ARG1 and following arguments.
2192 Expressions and reference nodes can be created this way.
2193 Constants, decls, types and misc nodes cannot be. */
2196 build
VPARAMS ((enum tree_code code
, tree tt
, ...))
2205 VA_FIXEDARG (p
, enum tree_code
, code
);
2206 VA_FIXEDARG (p
, tree
, tt
);
2208 t
= make_node (code
);
2209 length
= TREE_CODE_LENGTH (code
);
2212 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2213 result based on those same flags for the arguments. But if the
2214 arguments aren't really even `tree' expressions, we shouldn't be trying
2216 fro
= first_rtl_op (code
);
2218 /* Expressions without side effects may be constant if their
2219 arguments are as well. */
2220 constant
= (TREE_CODE_CLASS (code
) == '<'
2221 || TREE_CODE_CLASS (code
) == '1'
2222 || TREE_CODE_CLASS (code
) == '2'
2223 || TREE_CODE_CLASS (code
) == 'c');
2227 /* This is equivalent to the loop below, but faster. */
2228 tree arg0
= va_arg (p
, tree
);
2229 tree arg1
= va_arg (p
, tree
);
2231 TREE_OPERAND (t
, 0) = arg0
;
2232 TREE_OPERAND (t
, 1) = arg1
;
2233 TREE_READONLY (t
) = 1;
2234 if (arg0
&& fro
> 0)
2236 if (TREE_SIDE_EFFECTS (arg0
))
2237 TREE_SIDE_EFFECTS (t
) = 1;
2238 if (!TREE_READONLY (arg0
))
2239 TREE_READONLY (t
) = 0;
2240 if (!TREE_CONSTANT (arg0
))
2244 if (arg1
&& fro
> 1)
2246 if (TREE_SIDE_EFFECTS (arg1
))
2247 TREE_SIDE_EFFECTS (t
) = 1;
2248 if (!TREE_READONLY (arg1
))
2249 TREE_READONLY (t
) = 0;
2250 if (!TREE_CONSTANT (arg1
))
2254 else if (length
== 1)
2256 tree arg0
= va_arg (p
, tree
);
2258 /* The only one-operand cases we handle here are those with side-effects.
2259 Others are handled with build1. So don't bother checked if the
2260 arg has side-effects since we'll already have set it.
2262 ??? This really should use build1 too. */
2263 if (TREE_CODE_CLASS (code
) != 's')
2265 TREE_OPERAND (t
, 0) = arg0
;
2269 for (i
= 0; i
< length
; i
++)
2271 tree operand
= va_arg (p
, tree
);
2273 TREE_OPERAND (t
, i
) = operand
;
2274 if (operand
&& fro
> i
)
2276 if (TREE_SIDE_EFFECTS (operand
))
2277 TREE_SIDE_EFFECTS (t
) = 1;
2278 if (!TREE_CONSTANT (operand
))
2285 TREE_CONSTANT (t
) = constant
;
2289 /* Same as above, but only builds for unary operators.
2290 Saves lions share of calls to `build'; cuts down use
2291 of varargs, which is expensive for RISC machines. */
2294 build1 (code
, type
, node
)
2295 enum tree_code code
;
2300 #ifdef GATHER_STATISTICS
2301 tree_node_kind kind
;
2305 #ifdef GATHER_STATISTICS
2306 if (TREE_CODE_CLASS (code
) == 'r')
2312 #ifdef ENABLE_CHECKING
2313 if (TREE_CODE_CLASS (code
) == '2'
2314 || TREE_CODE_CLASS (code
) == '<'
2315 || TREE_CODE_LENGTH (code
) != 1)
2317 #endif /* ENABLE_CHECKING */
2319 length
= sizeof (struct tree_exp
);
2321 t
= ggc_alloc_tree (length
);
2323 memset ((PTR
) t
, 0, sizeof (struct tree_common
));
2325 #ifdef GATHER_STATISTICS
2326 tree_node_counts
[(int) kind
]++;
2327 tree_node_sizes
[(int) kind
] += length
;
2330 TREE_SET_CODE (t
, code
);
2332 TREE_TYPE (t
) = type
;
2333 TREE_COMPLEXITY (t
) = 0;
2334 TREE_OPERAND (t
, 0) = node
;
2335 if (node
&& first_rtl_op (code
) != 0)
2337 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2338 TREE_READONLY (t
) = TREE_READONLY (node
);
2347 case PREDECREMENT_EXPR
:
2348 case PREINCREMENT_EXPR
:
2349 case POSTDECREMENT_EXPR
:
2350 case POSTINCREMENT_EXPR
:
2351 /* All of these have side-effects, no matter what their
2353 TREE_SIDE_EFFECTS (t
) = 1;
2354 TREE_READONLY (t
) = 0;
2358 /* Whether a dereference is readonly has nothing to do with whether
2359 its operand is readonly. */
2360 TREE_READONLY (t
) = 0;
2364 if (TREE_CODE_CLASS (code
) == '1' && node
&& TREE_CONSTANT (node
))
2365 TREE_CONSTANT (t
) = 1;
2372 /* Similar except don't specify the TREE_TYPE
2373 and leave the TREE_SIDE_EFFECTS as 0.
2374 It is permissible for arguments to be null,
2375 or even garbage if their values do not matter. */
2378 build_nt
VPARAMS ((enum tree_code code
, ...))
2385 VA_FIXEDARG (p
, enum tree_code
, code
);
2387 t
= make_node (code
);
2388 length
= TREE_CODE_LENGTH (code
);
2390 for (i
= 0; i
< length
; i
++)
2391 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2397 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2398 We do NOT enter this node in any sort of symbol table.
2400 layout_decl is used to set up the decl's storage layout.
2401 Other slots are initialized to 0 or null pointers. */
2404 build_decl (code
, name
, type
)
2405 enum tree_code code
;
2410 t
= make_node (code
);
2412 /* if (type == error_mark_node)
2413 type = integer_type_node; */
2414 /* That is not done, deliberately, so that having error_mark_node
2415 as the type can suppress useless errors in the use of this variable. */
2417 DECL_NAME (t
) = name
;
2418 TREE_TYPE (t
) = type
;
2420 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2422 else if (code
== FUNCTION_DECL
)
2423 DECL_MODE (t
) = FUNCTION_MODE
;
2428 /* BLOCK nodes are used to represent the structure of binding contours
2429 and declarations, once those contours have been exited and their contents
2430 compiled. This information is used for outputting debugging info. */
2433 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
2434 tree vars
, tags ATTRIBUTE_UNUSED
, subblocks
, supercontext
, chain
;
2436 tree block
= make_node (BLOCK
);
2438 BLOCK_VARS (block
) = vars
;
2439 BLOCK_SUBBLOCKS (block
) = subblocks
;
2440 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2441 BLOCK_CHAIN (block
) = chain
;
2445 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2446 location where an expression or an identifier were encountered. It
2447 is necessary for languages where the frontend parser will handle
2448 recursively more than one file (Java is one of them). */
2451 build_expr_wfl (node
, file
, line
, col
)
2456 static const char *last_file
= 0;
2457 static tree last_filenode
= NULL_TREE
;
2458 tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
2460 EXPR_WFL_NODE (wfl
) = node
;
2461 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
2462 if (file
!= last_file
)
2465 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
2468 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
2471 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
2472 TREE_TYPE (wfl
) = TREE_TYPE (node
);
2478 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2482 build_decl_attribute_variant (ddecl
, attribute
)
2483 tree ddecl
, attribute
;
2485 DECL_ATTRIBUTES (ddecl
) = attribute
;
2489 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2492 Record such modified types already made so we don't make duplicates. */
2495 build_type_attribute_variant (ttype
, attribute
)
2496 tree ttype
, attribute
;
2498 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2500 unsigned int hashcode
;
2503 ntype
= copy_node (ttype
);
2505 TYPE_POINTER_TO (ntype
) = 0;
2506 TYPE_REFERENCE_TO (ntype
) = 0;
2507 TYPE_ATTRIBUTES (ntype
) = attribute
;
2509 /* Create a new main variant of TYPE. */
2510 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2511 TYPE_NEXT_VARIANT (ntype
) = 0;
2512 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2514 hashcode
= (TYPE_HASH (TREE_CODE (ntype
))
2515 + TYPE_HASH (TREE_TYPE (ntype
))
2516 + attribute_hash_list (attribute
));
2518 switch (TREE_CODE (ntype
))
2521 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
2524 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
2527 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
2530 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
2536 ntype
= type_hash_canon (hashcode
, ntype
);
2537 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2543 /* Default value of targetm.comp_type_attributes that always returns 1. */
2546 default_comp_type_attributes (type1
, type2
)
2547 tree type1 ATTRIBUTE_UNUSED
;
2548 tree type2 ATTRIBUTE_UNUSED
;
2553 /* Default version of targetm.set_default_type_attributes that always does
2557 default_set_default_type_attributes (type
)
2558 tree type ATTRIBUTE_UNUSED
;
2562 /* Default version of targetm.insert_attributes that always does nothing. */
2564 default_insert_attributes (decl
, attr_ptr
)
2565 tree decl ATTRIBUTE_UNUSED
;
2566 tree
*attr_ptr ATTRIBUTE_UNUSED
;
2570 /* Default value of targetm.function_attribute_inlinable_p that always
2573 default_function_attribute_inlinable_p (fndecl
)
2574 tree fndecl ATTRIBUTE_UNUSED
;
2576 /* By default, functions with machine attributes cannot be inlined. */
2580 /* Default value of targetm.ms_bitfield_layout_p that always returns
2583 default_ms_bitfield_layout_p (record
)
2584 tree record ATTRIBUTE_UNUSED
;
2586 /* By default, GCC does not use the MS VC++ bitfield layout rules. */
2590 /* Return non-zero if IDENT is a valid name for attribute ATTR,
2593 We try both `text' and `__text__', ATTR may be either one. */
2594 /* ??? It might be a reasonable simplification to require ATTR to be only
2595 `text'. One might then also require attribute lists to be stored in
2596 their canonicalized form. */
2599 is_attribute_p (attr
, ident
)
2603 int ident_len
, attr_len
;
2606 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2609 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2612 p
= IDENTIFIER_POINTER (ident
);
2613 ident_len
= strlen (p
);
2614 attr_len
= strlen (attr
);
2616 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2620 || attr
[attr_len
- 2] != '_'
2621 || attr
[attr_len
- 1] != '_')
2623 if (ident_len
== attr_len
- 4
2624 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2629 if (ident_len
== attr_len
+ 4
2630 && p
[0] == '_' && p
[1] == '_'
2631 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2632 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2639 /* Given an attribute name and a list of attributes, return a pointer to the
2640 attribute's list element if the attribute is part of the list, or NULL_TREE
2641 if not found. If the attribute appears more than once, this only
2642 returns the first occurrence; the TREE_CHAIN of the return value should
2643 be passed back in if further occurrences are wanted. */
2646 lookup_attribute (attr_name
, list
)
2647 const char *attr_name
;
2652 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2654 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
2656 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2663 /* Return an attribute list that is the union of a1 and a2. */
2666 merge_attributes (a1
, a2
)
2671 /* Either one unset? Take the set one. */
2673 if ((attributes
= a1
) == 0)
2676 /* One that completely contains the other? Take it. */
2678 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2680 if (attribute_list_contained (a2
, a1
))
2684 /* Pick the longest list, and hang on the other list. */
2686 if (list_length (a1
) < list_length (a2
))
2687 attributes
= a2
, a2
= a1
;
2689 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
2692 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2695 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2698 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
2703 a1
= copy_node (a2
);
2704 TREE_CHAIN (a1
) = attributes
;
2713 /* Given types T1 and T2, merge their attributes and return
2717 merge_type_attributes (t1
, t2
)
2720 return merge_attributes (TYPE_ATTRIBUTES (t1
),
2721 TYPE_ATTRIBUTES (t2
));
2724 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2728 merge_decl_attributes (olddecl
, newdecl
)
2729 tree olddecl
, newdecl
;
2731 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
2732 DECL_ATTRIBUTES (newdecl
));
2735 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2737 /* Specialization of merge_decl_attributes for various Windows targets.
2739 This handles the following situation:
2741 __declspec (dllimport) int foo;
2744 The second instance of `foo' nullifies the dllimport. */
2747 merge_dllimport_decl_attributes (old
, new)
2752 int delete_dllimport_p
;
2754 old
= DECL_ATTRIBUTES (old
);
2755 new = DECL_ATTRIBUTES (new);
2757 /* What we need to do here is remove from `old' dllimport if it doesn't
2758 appear in `new'. dllimport behaves like extern: if a declaration is
2759 marked dllimport and a definition appears later, then the object
2760 is not dllimport'd. */
2761 if (lookup_attribute ("dllimport", old
) != NULL_TREE
2762 && lookup_attribute ("dllimport", new) == NULL_TREE
)
2763 delete_dllimport_p
= 1;
2765 delete_dllimport_p
= 0;
2767 a
= merge_attributes (old
, new);
2769 if (delete_dllimport_p
)
2773 /* Scan the list for dllimport and delete it. */
2774 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
2776 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
2778 if (prev
== NULL_TREE
)
2781 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
2790 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2792 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2793 of the various TYPE_QUAL values. */
2796 set_type_quals (type
, type_quals
)
2800 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
2801 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
2802 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
2805 /* Return a version of the TYPE, qualified as indicated by the
2806 TYPE_QUALS, if one exists. If no qualified version exists yet,
2807 return NULL_TREE. */
2810 get_qualified_type (type
, type_quals
)
2816 /* Search the chain of variants to see if there is already one there just
2817 like the one we need to have. If so, use that existing one. We must
2818 preserve the TYPE_NAME, since there is code that depends on this. */
2819 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2820 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
))
2826 /* Like get_qualified_type, but creates the type if it does not
2827 exist. This function never returns NULL_TREE. */
2830 build_qualified_type (type
, type_quals
)
2836 /* See if we already have the appropriate qualified variant. */
2837 t
= get_qualified_type (type
, type_quals
);
2839 /* If not, build it. */
2842 t
= build_type_copy (type
);
2843 set_type_quals (t
, type_quals
);
2849 /* Create a new variant of TYPE, equivalent but distinct.
2850 This is so the caller can modify it. */
2853 build_type_copy (type
)
2856 tree t
, m
= TYPE_MAIN_VARIANT (type
);
2858 t
= copy_node (type
);
2860 TYPE_POINTER_TO (t
) = 0;
2861 TYPE_REFERENCE_TO (t
) = 0;
2863 /* Add this type to the chain of variants of TYPE. */
2864 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
2865 TYPE_NEXT_VARIANT (m
) = t
;
2870 /* Hashing of types so that we don't make duplicates.
2871 The entry point is `type_hash_canon'. */
2873 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2874 with types in the TREE_VALUE slots), by adding the hash codes
2875 of the individual types. */
2878 type_hash_list (list
)
2881 unsigned int hashcode
;
2884 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2885 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
2890 /* These are the Hashtable callback functions. */
2892 /* Returns true if the types are equal. */
2895 type_hash_eq (va
, vb
)
2899 const struct type_hash
*a
= va
, *b
= vb
;
2900 if (a
->hash
== b
->hash
2901 && TREE_CODE (a
->type
) == TREE_CODE (b
->type
)
2902 && TREE_TYPE (a
->type
) == TREE_TYPE (b
->type
)
2903 && attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
2904 TYPE_ATTRIBUTES (b
->type
))
2905 && TYPE_ALIGN (a
->type
) == TYPE_ALIGN (b
->type
)
2906 && (TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
2907 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
2908 TYPE_MAX_VALUE (b
->type
)))
2909 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
2910 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
2911 TYPE_MIN_VALUE (b
->type
)))
2912 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
2913 && (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
2914 || (TYPE_DOMAIN (a
->type
)
2915 && TREE_CODE (TYPE_DOMAIN (a
->type
)) == TREE_LIST
2916 && TYPE_DOMAIN (b
->type
)
2917 && TREE_CODE (TYPE_DOMAIN (b
->type
)) == TREE_LIST
2918 && type_list_equal (TYPE_DOMAIN (a
->type
),
2919 TYPE_DOMAIN (b
->type
)))))
2924 /* Return the cached hash value. */
2927 type_hash_hash (item
)
2930 return ((const struct type_hash
*) item
)->hash
;
2933 /* Look in the type hash table for a type isomorphic to TYPE.
2934 If one is found, return it. Otherwise return 0. */
2937 type_hash_lookup (hashcode
, type
)
2938 unsigned int hashcode
;
2941 struct type_hash
*h
, in
;
2943 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
2944 must call that routine before comparing TYPE_ALIGNs. */
2950 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
2956 /* Add an entry to the type-hash-table
2957 for a type TYPE whose hash code is HASHCODE. */
2960 type_hash_add (hashcode
, type
)
2961 unsigned int hashcode
;
2964 struct type_hash
*h
;
2967 h
= (struct type_hash
*) ggc_alloc (sizeof (struct type_hash
));
2970 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
2971 *(struct type_hash
**) loc
= h
;
2974 /* Given TYPE, and HASHCODE its hash code, return the canonical
2975 object for an identical type if one already exists.
2976 Otherwise, return TYPE, and record it as the canonical object
2977 if it is a permanent object.
2979 To use this function, first create a type of the sort you want.
2980 Then compute its hash code from the fields of the type that
2981 make it different from other similar types.
2982 Then call this function and use the value.
2983 This function frees the type you pass in if it is a duplicate. */
2985 /* Set to 1 to debug without canonicalization. Never set by program. */
2986 int debug_no_type_hash
= 0;
2989 type_hash_canon (hashcode
, type
)
2990 unsigned int hashcode
;
2995 if (debug_no_type_hash
)
2998 /* See if the type is in the hash table already. If so, return it.
2999 Otherwise, add the type. */
3000 t1
= type_hash_lookup (hashcode
, type
);
3003 #ifdef GATHER_STATISTICS
3004 tree_node_counts
[(int) t_kind
]--;
3005 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3011 type_hash_add (hashcode
, type
);
3016 /* See if the data pointed to by the type hash table is marked. We consider
3017 it marked if the type is marked or if a debug type number or symbol
3018 table entry has been made for the type. This reduces the amount of
3019 debugging output and eliminates that dependency of the debug output on
3020 the number of garbage collections. */
3023 type_hash_marked_p (p
)
3026 tree type
= ((struct type_hash
*) p
)->type
;
3028 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3031 /* Mark the entry in the type hash table the type it points to is marked.
3032 Also mark the type in case we are considering this entry "marked" by
3033 virtue of TYPE_SYMTAB_POINTER being set. */
3040 ggc_mark_tree (((struct type_hash
*) p
)->type
);
3043 /* Mark the hashtable slot pointed to by ENTRY (which is really a
3044 `tree**') for GC. */
3047 mark_tree_hashtable_entry (entry
, data
)
3049 void *data ATTRIBUTE_UNUSED
;
3051 ggc_mark_tree ((tree
) *entry
);
3055 /* Mark ARG (which is really a htab_t whose slots are trees) for
3059 mark_tree_hashtable (arg
)
3062 htab_t t
= *(htab_t
*) arg
;
3063 htab_traverse (t
, mark_tree_hashtable_entry
, 0);
3067 print_type_hash_statistics ()
3069 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3070 (long) htab_size (type_hash_table
),
3071 (long) htab_elements (type_hash_table
),
3072 htab_collisions (type_hash_table
));
3075 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3076 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3077 by adding the hash codes of the individual attributes. */
3080 attribute_hash_list (list
)
3083 unsigned int hashcode
;
3086 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3087 /* ??? Do we want to add in TREE_VALUE too? */
3088 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3092 /* Given two lists of attributes, return true if list l2 is
3093 equivalent to l1. */
3096 attribute_list_equal (l1
, l2
)
3099 return attribute_list_contained (l1
, l2
)
3100 && attribute_list_contained (l2
, l1
);
3103 /* Given two lists of attributes, return true if list L2 is
3104 completely contained within L1. */
3105 /* ??? This would be faster if attribute names were stored in a canonicalized
3106 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3107 must be used to show these elements are equivalent (which they are). */
3108 /* ??? It's not clear that attributes with arguments will always be handled
3112 attribute_list_contained (l1
, l2
)
3117 /* First check the obvious, maybe the lists are identical. */
3121 /* Maybe the lists are similar. */
3122 for (t1
= l1
, t2
= l2
;
3124 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3125 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3126 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3128 /* Maybe the lists are equal. */
3129 if (t1
== 0 && t2
== 0)
3132 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3135 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3137 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3140 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3147 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3154 /* Given two lists of types
3155 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3156 return 1 if the lists contain the same types in the same order.
3157 Also, the TREE_PURPOSEs must match. */
3160 type_list_equal (l1
, l2
)
3165 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3166 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3167 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3168 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3169 && (TREE_TYPE (TREE_PURPOSE (t1
))
3170 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3176 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3177 given by TYPE. If the argument list accepts variable arguments,
3178 then this function counts only the ordinary arguments. */
3181 type_num_arguments (type
)
3187 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3188 /* If the function does not take a variable number of arguments,
3189 the last element in the list will have type `void'. */
3190 if (VOID_TYPE_P (TREE_VALUE (t
)))
3198 /* Nonzero if integer constants T1 and T2
3199 represent the same constant value. */
3202 tree_int_cst_equal (t1
, t2
)
3208 if (t1
== 0 || t2
== 0)
3211 if (TREE_CODE (t1
) == INTEGER_CST
3212 && TREE_CODE (t2
) == INTEGER_CST
3213 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3214 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3220 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3221 The precise way of comparison depends on their data type. */
3224 tree_int_cst_lt (t1
, t2
)
3230 if (TREE_UNSIGNED (TREE_TYPE (t1
)) != TREE_UNSIGNED (TREE_TYPE (t2
)))
3232 int t1_sgn
= tree_int_cst_sgn (t1
);
3233 int t2_sgn
= tree_int_cst_sgn (t2
);
3235 if (t1_sgn
< t2_sgn
)
3237 else if (t1_sgn
> t2_sgn
)
3239 /* Otherwise, both are non-negative, so we compare them as
3240 unsigned just in case one of them would overflow a signed
3243 else if (! TREE_UNSIGNED (TREE_TYPE (t1
)))
3244 return INT_CST_LT (t1
, t2
);
3246 return INT_CST_LT_UNSIGNED (t1
, t2
);
3249 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3252 tree_int_cst_compare (t1
, t2
)
3256 if (tree_int_cst_lt (t1
, t2
))
3258 else if (tree_int_cst_lt (t2
, t1
))
3264 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3265 the host. If POS is zero, the value can be represented in a single
3266 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3267 be represented in a single unsigned HOST_WIDE_INT. */
3270 host_integerp (t
, pos
)
3274 return (TREE_CODE (t
) == INTEGER_CST
3275 && ! TREE_OVERFLOW (t
)
3276 && ((TREE_INT_CST_HIGH (t
) == 0
3277 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3278 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3279 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3280 && ! TREE_UNSIGNED (TREE_TYPE (t
)))
3281 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3284 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3285 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3286 be positive. Abort if we cannot satisfy the above conditions. */
3289 tree_low_cst (t
, pos
)
3293 if (host_integerp (t
, pos
))
3294 return TREE_INT_CST_LOW (t
);
3299 /* Return the most significant bit of the integer constant T. */
3302 tree_int_cst_msb (t
)
3307 unsigned HOST_WIDE_INT l
;
3309 /* Note that using TYPE_PRECISION here is wrong. We care about the
3310 actual bits, not the (arbitrary) range of the type. */
3311 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3312 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3313 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3314 return (l
& 1) == 1;
3317 /* Return an indication of the sign of the integer constant T.
3318 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3319 Note that -1 will never be returned it T's type is unsigned. */
3322 tree_int_cst_sgn (t
)
3325 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3327 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3329 else if (TREE_INT_CST_HIGH (t
) < 0)
3335 /* Compare two constructor-element-type constants. Return 1 if the lists
3336 are known to be equal; otherwise return 0. */
3339 simple_cst_list_equal (l1
, l2
)
3342 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3344 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3347 l1
= TREE_CHAIN (l1
);
3348 l2
= TREE_CHAIN (l2
);
3354 /* Return truthvalue of whether T1 is the same tree structure as T2.
3355 Return 1 if they are the same.
3356 Return 0 if they are understandably different.
3357 Return -1 if either contains tree structure not understood by
3361 simple_cst_equal (t1
, t2
)
3364 enum tree_code code1
, code2
;
3370 if (t1
== 0 || t2
== 0)
3373 code1
= TREE_CODE (t1
);
3374 code2
= TREE_CODE (t2
);
3376 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3378 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3379 || code2
== NON_LVALUE_EXPR
)
3380 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3382 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3385 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3386 || code2
== NON_LVALUE_EXPR
)
3387 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3395 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3396 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3399 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3402 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3403 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3404 TREE_STRING_LENGTH (t1
)));
3407 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
3413 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3416 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3420 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3423 /* Special case: if either target is an unallocated VAR_DECL,
3424 it means that it's going to be unified with whatever the
3425 TARGET_EXPR is really supposed to initialize, so treat it
3426 as being equivalent to anything. */
3427 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3428 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3429 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3430 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3431 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3432 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3435 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3440 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3442 case WITH_CLEANUP_EXPR
:
3443 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3447 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3450 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3451 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3465 /* This general rule works for most tree codes. All exceptions should be
3466 handled above. If this is a language-specific tree code, we can't
3467 trust what might be in the operand, so say we don't know
3469 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3472 switch (TREE_CODE_CLASS (code1
))
3481 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3483 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3495 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3496 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3497 than U, respectively. */
3500 compare_tree_int (t
, u
)
3502 unsigned HOST_WIDE_INT u
;
3504 if (tree_int_cst_sgn (t
) < 0)
3506 else if (TREE_INT_CST_HIGH (t
) != 0)
3508 else if (TREE_INT_CST_LOW (t
) == u
)
3510 else if (TREE_INT_CST_LOW (t
) < u
)
3516 /* Constructors for pointer, array and function types.
3517 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3518 constructed by language-dependent code, not here.) */
3520 /* Construct, lay out and return the type of pointers to TO_TYPE.
3521 If such a type has already been constructed, reuse it. */
3524 build_pointer_type (to_type
)
3527 tree t
= TYPE_POINTER_TO (to_type
);
3529 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3534 /* We need a new one. */
3535 t
= make_node (POINTER_TYPE
);
3537 TREE_TYPE (t
) = to_type
;
3539 /* Record this type as the pointer to TO_TYPE. */
3540 TYPE_POINTER_TO (to_type
) = t
;
3542 /* Lay out the type. This function has many callers that are concerned
3543 with expression-construction, and this simplifies them all.
3544 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3550 /* Build the node for the type of references-to-TO_TYPE. */
3553 build_reference_type (to_type
)
3556 tree t
= TYPE_REFERENCE_TO (to_type
);
3558 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3563 /* We need a new one. */
3564 t
= make_node (REFERENCE_TYPE
);
3566 TREE_TYPE (t
) = to_type
;
3568 /* Record this type as the pointer to TO_TYPE. */
3569 TYPE_REFERENCE_TO (to_type
) = t
;
3576 /* Build a type that is compatible with t but has no cv quals anywhere
3579 const char *const *const * -> char ***. */
3582 build_type_no_quals (t
)
3585 switch (TREE_CODE (t
))
3588 return build_pointer_type (build_type_no_quals (TREE_TYPE (t
)));
3589 case REFERENCE_TYPE
:
3590 return build_reference_type (build_type_no_quals (TREE_TYPE (t
)));
3592 return TYPE_MAIN_VARIANT (t
);
3596 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3597 MAXVAL should be the maximum value in the domain
3598 (one less than the length of the array).
3600 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3601 We don't enforce this limit, that is up to caller (e.g. language front end).
3602 The limit exists because the result is a signed type and we don't handle
3603 sizes that use more than one HOST_WIDE_INT. */
3606 build_index_type (maxval
)
3609 tree itype
= make_node (INTEGER_TYPE
);
3611 TREE_TYPE (itype
) = sizetype
;
3612 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
3613 TYPE_MIN_VALUE (itype
) = size_zero_node
;
3614 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
3615 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
3616 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
3617 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
3618 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
3619 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
3621 if (host_integerp (maxval
, 1))
3622 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
3627 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3628 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3629 low bound LOWVAL and high bound HIGHVAL.
3630 if TYPE==NULL_TREE, sizetype is used. */
3633 build_range_type (type
, lowval
, highval
)
3634 tree type
, lowval
, highval
;
3636 tree itype
= make_node (INTEGER_TYPE
);
3638 TREE_TYPE (itype
) = type
;
3639 if (type
== NULL_TREE
)
3642 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
3643 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
3645 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
3646 TYPE_MODE (itype
) = TYPE_MODE (type
);
3647 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
3648 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
3649 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
3650 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
3652 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
3653 return type_hash_canon (tree_low_cst (highval
, 0)
3654 - tree_low_cst (lowval
, 0),
3660 /* Just like build_index_type, but takes lowval and highval instead
3661 of just highval (maxval). */
3664 build_index_2_type (lowval
, highval
)
3665 tree lowval
, highval
;
3667 return build_range_type (sizetype
, lowval
, highval
);
3670 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
3671 Needed because when index types are not hashed, equal index types
3672 built at different times appear distinct, even though structurally,
3676 index_type_equal (itype1
, itype2
)
3677 tree itype1
, itype2
;
3679 if (TREE_CODE (itype1
) != TREE_CODE (itype2
))
3682 if (TREE_CODE (itype1
) == INTEGER_TYPE
)
3684 if (TYPE_PRECISION (itype1
) != TYPE_PRECISION (itype2
)
3685 || TYPE_MODE (itype1
) != TYPE_MODE (itype2
)
3686 || simple_cst_equal (TYPE_SIZE (itype1
), TYPE_SIZE (itype2
)) != 1
3687 || TYPE_ALIGN (itype1
) != TYPE_ALIGN (itype2
))
3690 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1
),
3691 TYPE_MIN_VALUE (itype2
))
3692 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1
),
3693 TYPE_MAX_VALUE (itype2
)))
3700 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3701 and number of elements specified by the range of values of INDEX_TYPE.
3702 If such a type has already been constructed, reuse it. */
3705 build_array_type (elt_type
, index_type
)
3706 tree elt_type
, index_type
;
3709 unsigned int hashcode
;
3711 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
3713 error ("arrays of functions are not meaningful");
3714 elt_type
= integer_type_node
;
3717 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3718 build_pointer_type (elt_type
);
3720 /* Allocate the array after the pointer type,
3721 in case we free it in type_hash_canon. */
3722 t
= make_node (ARRAY_TYPE
);
3723 TREE_TYPE (t
) = elt_type
;
3724 TYPE_DOMAIN (t
) = index_type
;
3726 if (index_type
== 0)
3731 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
3732 t
= type_hash_canon (hashcode
, t
);
3734 if (!COMPLETE_TYPE_P (t
))
3739 /* Return the TYPE of the elements comprising
3740 the innermost dimension of ARRAY. */
3743 get_inner_array_type (array
)
3746 tree type
= TREE_TYPE (array
);
3748 while (TREE_CODE (type
) == ARRAY_TYPE
)
3749 type
= TREE_TYPE (type
);
3754 /* Construct, lay out and return
3755 the type of functions returning type VALUE_TYPE
3756 given arguments of types ARG_TYPES.
3757 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3758 are data type nodes for the arguments of the function.
3759 If such a type has already been constructed, reuse it. */
3762 build_function_type (value_type
, arg_types
)
3763 tree value_type
, arg_types
;
3766 unsigned int hashcode
;
3768 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
3770 error ("function return type cannot be function");
3771 value_type
= integer_type_node
;
3774 /* Make a node of the sort we want. */
3775 t
= make_node (FUNCTION_TYPE
);
3776 TREE_TYPE (t
) = value_type
;
3777 TYPE_ARG_TYPES (t
) = arg_types
;
3779 /* If we already have such a type, use the old one and free this one. */
3780 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
3781 t
= type_hash_canon (hashcode
, t
);
3783 if (!COMPLETE_TYPE_P (t
))
3788 /* Construct, lay out and return the type of methods belonging to class
3789 BASETYPE and whose arguments and values are described by TYPE.
3790 If that type exists already, reuse it.
3791 TYPE must be a FUNCTION_TYPE node. */
3794 build_method_type (basetype
, type
)
3795 tree basetype
, type
;
3798 unsigned int hashcode
;
3800 /* Make a node of the sort we want. */
3801 t
= make_node (METHOD_TYPE
);
3803 if (TREE_CODE (type
) != FUNCTION_TYPE
)
3806 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3807 TREE_TYPE (t
) = TREE_TYPE (type
);
3809 /* The actual arglist for this function includes a "hidden" argument
3810 which is "this". Put it into the list of argument types. */
3813 = tree_cons (NULL_TREE
,
3814 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
3816 /* If we already have such a type, use the old one and free this one. */
3817 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3818 t
= type_hash_canon (hashcode
, t
);
3820 if (!COMPLETE_TYPE_P (t
))
3826 /* Construct, lay out and return the type of offsets to a value
3827 of type TYPE, within an object of type BASETYPE.
3828 If a suitable offset type exists already, reuse it. */
3831 build_offset_type (basetype
, type
)
3832 tree basetype
, type
;
3835 unsigned int hashcode
;
3837 /* Make a node of the sort we want. */
3838 t
= make_node (OFFSET_TYPE
);
3840 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3841 TREE_TYPE (t
) = type
;
3843 /* If we already have such a type, use the old one and free this one. */
3844 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3845 t
= type_hash_canon (hashcode
, t
);
3847 if (!COMPLETE_TYPE_P (t
))
3853 /* Create a complex type whose components are COMPONENT_TYPE. */
3856 build_complex_type (component_type
)
3857 tree component_type
;
3860 unsigned int hashcode
;
3862 /* Make a node of the sort we want. */
3863 t
= make_node (COMPLEX_TYPE
);
3865 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
3866 set_type_quals (t
, TYPE_QUALS (component_type
));
3868 /* If we already have such a type, use the old one and free this one. */
3869 hashcode
= TYPE_HASH (component_type
);
3870 t
= type_hash_canon (hashcode
, t
);
3872 if (!COMPLETE_TYPE_P (t
))
3875 /* If we are writing Dwarf2 output we need to create a name,
3876 since complex is a fundamental type. */
3877 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
3881 if (component_type
== char_type_node
)
3882 name
= "complex char";
3883 else if (component_type
== signed_char_type_node
)
3884 name
= "complex signed char";
3885 else if (component_type
== unsigned_char_type_node
)
3886 name
= "complex unsigned char";
3887 else if (component_type
== short_integer_type_node
)
3888 name
= "complex short int";
3889 else if (component_type
== short_unsigned_type_node
)
3890 name
= "complex short unsigned int";
3891 else if (component_type
== integer_type_node
)
3892 name
= "complex int";
3893 else if (component_type
== unsigned_type_node
)
3894 name
= "complex unsigned int";
3895 else if (component_type
== long_integer_type_node
)
3896 name
= "complex long int";
3897 else if (component_type
== long_unsigned_type_node
)
3898 name
= "complex long unsigned int";
3899 else if (component_type
== long_long_integer_type_node
)
3900 name
= "complex long long int";
3901 else if (component_type
== long_long_unsigned_type_node
)
3902 name
= "complex long long unsigned int";
3907 TYPE_NAME (t
) = get_identifier (name
);
3913 /* Return OP, stripped of any conversions to wider types as much as is safe.
3914 Converting the value back to OP's type makes a value equivalent to OP.
3916 If FOR_TYPE is nonzero, we return a value which, if converted to
3917 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
3919 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
3920 narrowest type that can hold the value, even if they don't exactly fit.
3921 Otherwise, bit-field references are changed to a narrower type
3922 only if they can be fetched directly from memory in that type.
3924 OP must have integer, real or enumeral type. Pointers are not allowed!
3926 There are some cases where the obvious value we could return
3927 would regenerate to OP if converted to OP's type,
3928 but would not extend like OP to wider types.
3929 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
3930 For example, if OP is (unsigned short)(signed char)-1,
3931 we avoid returning (signed char)-1 if FOR_TYPE is int,
3932 even though extending that to an unsigned short would regenerate OP,
3933 since the result of extending (signed char)-1 to (int)
3934 is different from (int) OP. */
3937 get_unwidened (op
, for_type
)
3941 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
3942 tree type
= TREE_TYPE (op
);
3944 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
3946 = (for_type
!= 0 && for_type
!= type
3947 && final_prec
> TYPE_PRECISION (type
)
3948 && TREE_UNSIGNED (type
));
3951 while (TREE_CODE (op
) == NOP_EXPR
)
3954 = TYPE_PRECISION (TREE_TYPE (op
))
3955 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
3957 /* Truncations are many-one so cannot be removed.
3958 Unless we are later going to truncate down even farther. */
3960 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
3963 /* See what's inside this conversion. If we decide to strip it,
3965 op
= TREE_OPERAND (op
, 0);
3967 /* If we have not stripped any zero-extensions (uns is 0),
3968 we can strip any kind of extension.
3969 If we have previously stripped a zero-extension,
3970 only zero-extensions can safely be stripped.
3971 Any extension can be stripped if the bits it would produce
3972 are all going to be discarded later by truncating to FOR_TYPE. */
3976 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
3978 /* TREE_UNSIGNED says whether this is a zero-extension.
3979 Let's avoid computing it if it does not affect WIN
3980 and if UNS will not be needed again. */
3981 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
3982 && TREE_UNSIGNED (TREE_TYPE (op
)))
3990 if (TREE_CODE (op
) == COMPONENT_REF
3991 /* Since type_for_size always gives an integer type. */
3992 && TREE_CODE (type
) != REAL_TYPE
3993 /* Don't crash if field not laid out yet. */
3994 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
3995 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
3997 unsigned int innerprec
3998 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
3999 int unsignedp
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4000 type
= (*lang_hooks
.types
.type_for_size
) (innerprec
, unsignedp
);
4002 /* We can get this structure field in the narrowest type it fits in.
4003 If FOR_TYPE is 0, do this only for a field that matches the
4004 narrower type exactly and is aligned for it
4005 The resulting extension to its nominal type (a fullword type)
4006 must fit the same conditions as for other extensions. */
4008 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4009 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4010 && (! uns
|| final_prec
<= innerprec
|| unsignedp
)
4013 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4014 TREE_OPERAND (op
, 1));
4015 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4016 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4023 /* Return OP or a simpler expression for a narrower value
4024 which can be sign-extended or zero-extended to give back OP.
4025 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4026 or 0 if the value should be sign-extended. */
4029 get_narrower (op
, unsignedp_ptr
)
4037 while (TREE_CODE (op
) == NOP_EXPR
)
4040 = (TYPE_PRECISION (TREE_TYPE (op
))
4041 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4043 /* Truncations are many-one so cannot be removed. */
4047 /* See what's inside this conversion. If we decide to strip it,
4049 op
= TREE_OPERAND (op
, 0);
4053 /* An extension: the outermost one can be stripped,
4054 but remember whether it is zero or sign extension. */
4056 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4057 /* Otherwise, if a sign extension has been stripped,
4058 only sign extensions can now be stripped;
4059 if a zero extension has been stripped, only zero-extensions. */
4060 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4064 else /* bitschange == 0 */
4066 /* A change in nominal type can always be stripped, but we must
4067 preserve the unsignedness. */
4069 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4076 if (TREE_CODE (op
) == COMPONENT_REF
4077 /* Since type_for_size always gives an integer type. */
4078 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4079 /* Ensure field is laid out already. */
4080 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4082 unsigned HOST_WIDE_INT innerprec
4083 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4084 tree type
= (*lang_hooks
.types
.type_for_size
) (innerprec
,
4085 TREE_UNSIGNED (op
));
4087 /* We can get this structure field in a narrower type that fits it,
4088 but the resulting extension to its nominal type (a fullword type)
4089 must satisfy the same conditions as for other extensions.
4091 Do this only for fields that are aligned (not bit-fields),
4092 because when bit-field insns will be used there is no
4093 advantage in doing this. */
4095 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4096 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4097 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4101 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4102 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4103 TREE_OPERAND (op
, 1));
4104 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4105 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4108 *unsignedp_ptr
= uns
;
4112 /* Nonzero if integer constant C has a value that is permissible
4113 for type TYPE (an INTEGER_TYPE). */
4116 int_fits_type_p (c
, type
)
4119 /* If the bounds of the type are integers, we can check ourselves.
4120 If not, but this type is a subtype, try checking against that.
4121 Otherwise, use force_fit_type, which checks against the precision. */
4122 if (TYPE_MAX_VALUE (type
) != NULL_TREE
4123 && TYPE_MIN_VALUE (type
) != NULL_TREE
4124 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4125 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
4127 if (TREE_UNSIGNED (type
))
4128 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
)
4129 && ! INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
))
4130 /* Negative ints never fit unsigned types. */
4131 && ! (TREE_INT_CST_HIGH (c
) < 0
4132 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4134 return (! INT_CST_LT (TYPE_MAX_VALUE (type
), c
)
4135 && ! INT_CST_LT (c
, TYPE_MIN_VALUE (type
))
4136 /* Unsigned ints with top bit set never fit signed types. */
4137 && ! (TREE_INT_CST_HIGH (c
) < 0
4138 && TREE_UNSIGNED (TREE_TYPE (c
))));
4140 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4141 return int_fits_type_p (c
, TREE_TYPE (type
));
4145 TREE_TYPE (c
) = type
;
4146 return !force_fit_type (c
, 0);
4150 /* Given a DECL or TYPE, return the scope in which it was declared, or
4151 NULL_TREE if there is no containing scope. */
4154 get_containing_scope (t
)
4157 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4160 /* Return the innermost context enclosing DECL that is
4161 a FUNCTION_DECL, or zero if none. */
4164 decl_function_context (decl
)
4169 if (TREE_CODE (decl
) == ERROR_MARK
)
4172 if (TREE_CODE (decl
) == SAVE_EXPR
)
4173 context
= SAVE_EXPR_CONTEXT (decl
);
4175 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4176 where we look up the function at runtime. Such functions always take
4177 a first argument of type 'pointer to real context'.
4179 C++ should really be fixed to use DECL_CONTEXT for the real context,
4180 and use something else for the "virtual context". */
4181 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4184 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4186 context
= DECL_CONTEXT (decl
);
4188 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4190 if (TREE_CODE (context
) == BLOCK
)
4191 context
= BLOCK_SUPERCONTEXT (context
);
4193 context
= get_containing_scope (context
);
4199 /* Return the innermost context enclosing DECL that is
4200 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4201 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4204 decl_type_context (decl
)
4207 tree context
= DECL_CONTEXT (decl
);
4211 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4214 if (TREE_CODE (context
) == RECORD_TYPE
4215 || TREE_CODE (context
) == UNION_TYPE
4216 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4219 if (TREE_CODE (context
) == TYPE_DECL
4220 || TREE_CODE (context
) == FUNCTION_DECL
)
4221 context
= DECL_CONTEXT (context
);
4223 else if (TREE_CODE (context
) == BLOCK
)
4224 context
= BLOCK_SUPERCONTEXT (context
);
4227 /* Unhandled CONTEXT!? */
4233 /* CALL is a CALL_EXPR. Return the declaration for the function
4234 called, or NULL_TREE if the called function cannot be
4238 get_callee_fndecl (call
)
4243 /* It's invalid to call this function with anything but a
4245 if (TREE_CODE (call
) != CALL_EXPR
)
4248 /* The first operand to the CALL is the address of the function
4250 addr
= TREE_OPERAND (call
, 0);
4254 /* If this is a readonly function pointer, extract its initial value. */
4255 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
4256 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
4257 && DECL_INITIAL (addr
))
4258 addr
= DECL_INITIAL (addr
);
4260 /* If the address is just `&f' for some function `f', then we know
4261 that `f' is being called. */
4262 if (TREE_CODE (addr
) == ADDR_EXPR
4263 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4264 return TREE_OPERAND (addr
, 0);
4266 /* We couldn't figure out what was being called. */
4270 /* Print debugging information about the obstack O, named STR. */
4273 print_obstack_statistics (str
, o
)
4277 struct _obstack_chunk
*chunk
= o
->chunk
;
4281 n_alloc
+= o
->next_free
- chunk
->contents
;
4282 chunk
= chunk
->prev
;
4286 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4287 chunk
= chunk
->prev
;
4289 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
4290 str
, n_alloc
, n_chunks
);
4293 /* Print debugging information about tree nodes generated during the compile,
4294 and any language-specific information. */
4297 dump_tree_statistics ()
4299 #ifdef GATHER_STATISTICS
4301 int total_nodes
, total_bytes
;
4304 fprintf (stderr
, "\n??? tree nodes created\n\n");
4305 #ifdef GATHER_STATISTICS
4306 fprintf (stderr
, "Kind Nodes Bytes\n");
4307 fprintf (stderr
, "-------------------------------------\n");
4308 total_nodes
= total_bytes
= 0;
4309 for (i
= 0; i
< (int) all_kinds
; i
++)
4311 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4312 tree_node_counts
[i
], tree_node_sizes
[i
]);
4313 total_nodes
+= tree_node_counts
[i
];
4314 total_bytes
+= tree_node_sizes
[i
];
4316 fprintf (stderr
, "-------------------------------------\n");
4317 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4318 fprintf (stderr
, "-------------------------------------\n");
4320 fprintf (stderr
, "(No per-node statistics)\n");
4322 print_obstack_statistics ("permanent_obstack", &permanent_obstack
);
4323 print_type_hash_statistics ();
4324 (*lang_hooks
.print_statistics
) ();
4327 #define FILE_FUNCTION_PREFIX_LEN 9
4329 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4331 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4332 clashes in cases where we can't reliably choose a unique name.
4334 Derived from mkstemp.c in libiberty. */
4337 append_random_chars (template)
4340 static const char letters
[]
4341 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4342 static unsigned HOST_WIDE_INT value
;
4343 unsigned HOST_WIDE_INT v
;
4349 /* VALUE should be unique for each file and must not change between
4350 compiles since this can cause bootstrap comparison errors. */
4352 if (stat (main_input_filename
, &st
) < 0)
4354 /* This can happen when preprocessed text is shipped between
4355 machines, e.g. with bug reports. Assume that uniqueness
4356 isn't actually an issue. */
4361 /* In VMS, ino is an array, so we have to use both values. We
4362 conditionalize that. */
4364 #define INO_TO_INT(INO) ((int) (INO)[1] << 16 ^ (int) (INO)[2])
4366 #define INO_TO_INT(INO) INO
4368 value
= st
.st_dev
^ INO_TO_INT (st
.st_ino
) ^ st
.st_mtime
;
4372 template += strlen (template);
4376 /* Fill in the random bits. */
4377 template[0] = letters
[v
% 62];
4379 template[1] = letters
[v
% 62];
4381 template[2] = letters
[v
% 62];
4383 template[3] = letters
[v
% 62];
4385 template[4] = letters
[v
% 62];
4387 template[5] = letters
[v
% 62];
4392 /* P is a string that will be used in a symbol. Mask out any characters
4393 that are not valid in that context. */
4396 clean_symbol_name (p
)
4401 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4404 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4411 /* Generate a name for a function unique to this translation unit.
4412 TYPE is some string to identify the purpose of this function to the
4413 linker or collect2. */
4416 get_file_function_name_long (type
)
4423 if (first_global_object_name
)
4424 p
= first_global_object_name
;
4427 /* We don't have anything that we know to be unique to this translation
4428 unit, so use what we do have and throw in some randomness. */
4430 const char *name
= weak_global_object_name
;
4431 const char *file
= main_input_filename
;
4436 file
= input_filename
;
4438 q
= (char *) alloca (7 + strlen (name
) + strlen (file
));
4440 sprintf (q
, "%s%s", name
, file
);
4441 append_random_chars (q
);
4445 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
4448 /* Set up the name of the file-level functions we may need.
4449 Use a global object (which is already required to be unique over
4450 the program) rather than the file name (which imposes extra
4452 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
4454 /* Don't need to pull weird characters out of global names. */
4455 if (p
!= first_global_object_name
)
4456 clean_symbol_name (buf
+ 11);
4458 return get_identifier (buf
);
4461 /* If KIND=='I', return a suitable global initializer (constructor) name.
4462 If KIND=='D', return a suitable global clean-up (destructor) name. */
4465 get_file_function_name (kind
)
4473 return get_file_function_name_long (p
);
4476 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4477 The result is placed in BUFFER (which has length BIT_SIZE),
4478 with one bit in each char ('\000' or '\001').
4480 If the constructor is constant, NULL_TREE is returned.
4481 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4484 get_set_constructor_bits (init
, buffer
, bit_size
)
4491 HOST_WIDE_INT domain_min
4492 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
4493 tree non_const_bits
= NULL_TREE
;
4495 for (i
= 0; i
< bit_size
; i
++)
4498 for (vals
= TREE_OPERAND (init
, 1);
4499 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4501 if (!host_integerp (TREE_VALUE (vals
), 0)
4502 || (TREE_PURPOSE (vals
) != NULL_TREE
4503 && !host_integerp (TREE_PURPOSE (vals
), 0)))
4505 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4506 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4508 /* Set a range of bits to ones. */
4509 HOST_WIDE_INT lo_index
4510 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
4511 HOST_WIDE_INT hi_index
4512 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4514 if (lo_index
< 0 || lo_index
>= bit_size
4515 || hi_index
< 0 || hi_index
>= bit_size
)
4517 for (; lo_index
<= hi_index
; lo_index
++)
4518 buffer
[lo_index
] = 1;
4522 /* Set a single bit to one. */
4524 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4525 if (index
< 0 || index
>= bit_size
)
4527 error ("invalid initializer for bit string");
4533 return non_const_bits
;
4536 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4537 The result is placed in BUFFER (which is an array of bytes).
4538 If the constructor is constant, NULL_TREE is returned.
4539 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4542 get_set_constructor_bytes (init
, buffer
, wd_size
)
4544 unsigned char *buffer
;
4548 int set_word_size
= BITS_PER_UNIT
;
4549 int bit_size
= wd_size
* set_word_size
;
4551 unsigned char *bytep
= buffer
;
4552 char *bit_buffer
= (char *) alloca (bit_size
);
4553 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4555 for (i
= 0; i
< wd_size
; i
++)
4558 for (i
= 0; i
< bit_size
; i
++)
4562 if (BYTES_BIG_ENDIAN
)
4563 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4565 *bytep
|= 1 << bit_pos
;
4568 if (bit_pos
>= set_word_size
)
4569 bit_pos
= 0, bytep
++;
4571 return non_const_bits
;
4574 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4575 /* Complain that the tree code of NODE does not match the expected CODE.
4576 FILE, LINE, and FUNCTION are of the caller. */
4579 tree_check_failed (node
, code
, file
, line
, function
)
4581 enum tree_code code
;
4584 const char *function
;
4586 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4587 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
4588 function
, trim_filename (file
), line
);
4591 /* Similar to above, except that we check for a class of tree
4592 code, given in CL. */
4595 tree_class_check_failed (node
, cl
, file
, line
, function
)
4600 const char *function
;
4603 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4604 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
4605 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
4608 #endif /* ENABLE_TREE_CHECKING */
4610 /* For a new vector type node T, build the information necessary for
4611 debuggint output. */
4614 finish_vector_type (t
)
4620 tree index
= build_int_2 (TYPE_VECTOR_SUBPARTS (t
) - 1, 0);
4621 tree array
= build_array_type (TREE_TYPE (t
),
4622 build_index_type (index
));
4623 tree rt
= make_node (RECORD_TYPE
);
4625 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
4626 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
4628 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
4629 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4630 the representation type, and we want to find that die when looking up
4631 the vector type. This is most easily achieved by making the TYPE_UID
4633 TYPE_UID (rt
) = TYPE_UID (t
);
4637 /* Create nodes for all integer types (and error_mark_node) using the sizes
4638 of C datatypes. The caller should call set_sizetype soon after calling
4639 this function to select one of the types as sizetype. */
4642 build_common_tree_nodes (signed_char
)
4645 error_mark_node
= make_node (ERROR_MARK
);
4646 TREE_TYPE (error_mark_node
) = error_mark_node
;
4648 initialize_sizetypes ();
4650 /* Define both `signed char' and `unsigned char'. */
4651 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
4652 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
4654 /* Define `char', which is like either `signed char' or `unsigned char'
4655 but not the same as either. */
4658 ? make_signed_type (CHAR_TYPE_SIZE
)
4659 : make_unsigned_type (CHAR_TYPE_SIZE
));
4661 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
4662 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
4663 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
4664 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
4665 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
4666 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
4667 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
4668 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
4670 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
4671 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
4672 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
4673 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
4674 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
4676 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
4677 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
4678 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
4679 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
4680 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
4683 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4684 It will create several other common tree nodes. */
4687 build_common_tree_nodes_2 (short_double
)
4690 /* Define these next since types below may used them. */
4691 integer_zero_node
= build_int_2 (0, 0);
4692 integer_one_node
= build_int_2 (1, 0);
4693 integer_minus_one_node
= build_int_2 (-1, -1);
4695 size_zero_node
= size_int (0);
4696 size_one_node
= size_int (1);
4697 bitsize_zero_node
= bitsize_int (0);
4698 bitsize_one_node
= bitsize_int (1);
4699 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
4701 void_type_node
= make_node (VOID_TYPE
);
4702 layout_type (void_type_node
);
4704 /* We are not going to have real types in C with less than byte alignment,
4705 so we might as well not have any types that claim to have it. */
4706 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
4707 TYPE_USER_ALIGN (void_type_node
) = 0;
4709 null_pointer_node
= build_int_2 (0, 0);
4710 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
4711 layout_type (TREE_TYPE (null_pointer_node
));
4713 ptr_type_node
= build_pointer_type (void_type_node
);
4715 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
4717 float_type_node
= make_node (REAL_TYPE
);
4718 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
4719 layout_type (float_type_node
);
4721 double_type_node
= make_node (REAL_TYPE
);
4723 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
4725 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
4726 layout_type (double_type_node
);
4728 long_double_type_node
= make_node (REAL_TYPE
);
4729 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
4730 layout_type (long_double_type_node
);
4732 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
4733 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
4734 layout_type (complex_integer_type_node
);
4736 complex_float_type_node
= make_node (COMPLEX_TYPE
);
4737 TREE_TYPE (complex_float_type_node
) = float_type_node
;
4738 layout_type (complex_float_type_node
);
4740 complex_double_type_node
= make_node (COMPLEX_TYPE
);
4741 TREE_TYPE (complex_double_type_node
) = double_type_node
;
4742 layout_type (complex_double_type_node
);
4744 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
4745 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
4746 layout_type (complex_long_double_type_node
);
4750 BUILD_VA_LIST_TYPE (t
);
4752 /* Many back-ends define record types without seting TYPE_NAME.
4753 If we copied the record type here, we'd keep the original
4754 record type without a name. This breaks name mangling. So,
4755 don't copy record types and let c_common_nodes_and_builtins()
4756 declare the type to be __builtin_va_list. */
4757 if (TREE_CODE (t
) != RECORD_TYPE
)
4758 t
= build_type_copy (t
);
4760 va_list_type_node
= t
;
4763 unsigned_V4SI_type_node
4764 = make_vector (V4SImode
, unsigned_intSI_type_node
, 1);
4765 unsigned_V2SI_type_node
4766 = make_vector (V2SImode
, unsigned_intSI_type_node
, 1);
4767 unsigned_V2DI_type_node
4768 = make_vector (V2DImode
, unsigned_intDI_type_node
, 1);
4769 unsigned_V4HI_type_node
4770 = make_vector (V4HImode
, unsigned_intHI_type_node
, 1);
4771 unsigned_V8QI_type_node
4772 = make_vector (V8QImode
, unsigned_intQI_type_node
, 1);
4773 unsigned_V8HI_type_node
4774 = make_vector (V8HImode
, unsigned_intHI_type_node
, 1);
4775 unsigned_V16QI_type_node
4776 = make_vector (V16QImode
, unsigned_intQI_type_node
, 1);
4778 V16SF_type_node
= make_vector (V16SFmode
, float_type_node
, 0);
4779 V4SF_type_node
= make_vector (V4SFmode
, float_type_node
, 0);
4780 V4SI_type_node
= make_vector (V4SImode
, intSI_type_node
, 0);
4781 V2SI_type_node
= make_vector (V2SImode
, intSI_type_node
, 0);
4782 V2DI_type_node
= make_vector (V2DImode
, intDI_type_node
, 0);
4783 V4HI_type_node
= make_vector (V4HImode
, intHI_type_node
, 0);
4784 V8QI_type_node
= make_vector (V8QImode
, intQI_type_node
, 0);
4785 V8HI_type_node
= make_vector (V8HImode
, intHI_type_node
, 0);
4786 V2SF_type_node
= make_vector (V2SFmode
, float_type_node
, 0);
4787 V2DF_type_node
= make_vector (V2DFmode
, double_type_node
, 0);
4788 V16QI_type_node
= make_vector (V16QImode
, intQI_type_node
, 0);
4791 /* Returns a vector tree node given a vector mode, the inner type, and
4795 make_vector (mode
, innertype
, unsignedp
)
4796 enum machine_mode mode
;
4802 t
= make_node (VECTOR_TYPE
);
4803 TREE_TYPE (t
) = innertype
;
4804 TYPE_MODE (t
) = mode
;
4805 TREE_UNSIGNED (TREE_TYPE (t
)) = unsignedp
;
4806 finish_vector_type (t
);
4811 /* Given an initializer INIT, return TRUE if INIT is zero or some
4812 aggregate of zeros. Otherwise return FALSE. */
4815 initializer_zerop (init
)
4820 switch (TREE_CODE (init
))
4823 return integer_zerop (init
);
4825 return real_zerop (init
)
4826 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
4828 return integer_zerop (init
)
4829 || (real_zerop (init
)
4830 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
4831 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
4834 if (AGGREGATE_TYPE_P (TREE_TYPE (init
)))
4836 tree aggr_init
= TREE_OPERAND (init
, 1);
4840 if (! initializer_zerop (TREE_VALUE (aggr_init
)))
4842 aggr_init
= TREE_CHAIN (aggr_init
);