1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
49 /* obstack.[ch] explicitly declined to prototype this. */
50 extern int _obstack_allocated_p
PARAMS ((struct obstack
*h
, PTR obj
));
52 #ifdef GATHER_STATISTICS
53 /* Statistics-gathering stuff. */
73 int tree_node_counts
[(int) all_kinds
];
74 int tree_node_sizes
[(int) all_kinds
];
76 static const char * const tree_node_kind_names
[] = {
92 #endif /* GATHER_STATISTICS */
94 /* Unique id for next decl created. */
95 static int next_decl_uid
;
96 /* Unique id for next type created. */
97 static int next_type_uid
= 1;
99 /* Since we cannot rehash a type after it is in the table, we have to
100 keep the hash code. */
102 struct type_hash
GTY(())
108 /* Initial size of the hash table (rounded to next prime). */
109 #define TYPE_HASH_INITIAL_SIZE 1000
111 /* Now here is the hash table. When recording a type, it is added to
112 the slot whose index is the hash code. Note that the hash table is
113 used for several kinds of types (function types, array types and
114 array index range types, for now). While all these live in the
115 same table, they are completely independent, and the hash code is
116 computed differently for each of these. */
118 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
119 htab_t type_hash_table
;
121 static void set_type_quals
PARAMS ((tree
, int));
122 static void append_random_chars
PARAMS ((char *));
123 static int type_hash_eq
PARAMS ((const void *, const void *));
124 static hashval_t type_hash_hash
PARAMS ((const void *));
125 static void print_type_hash_statistics
PARAMS((void));
126 static void finish_vector_type
PARAMS((tree
));
127 static tree make_vector
PARAMS ((enum machine_mode
, tree
, int));
128 static int type_hash_marked_p
PARAMS ((const void *));
130 tree global_trees
[TI_MAX
];
131 tree integer_types
[itk_none
];
138 /* Initialize the hash table of types. */
139 type_hash_table
= htab_create (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
144 /* The name of the object as the assembler will see it (but before any
145 translations made by ASM_OUTPUT_LABELREF). Often this is the same
146 as DECL_NAME. It is an IDENTIFIER_NODE. */
148 decl_assembler_name (decl
)
151 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
152 (*lang_hooks
.set_decl_assembler_name
) (decl
);
153 return DECL_CHECK (decl
)->decl
.assembler_name
;
156 /* Compute the number of bytes occupied by 'node'. This routine only
157 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
162 enum tree_code code
= TREE_CODE (node
);
164 switch (TREE_CODE_CLASS (code
))
166 case 'd': /* A decl node */
167 return sizeof (struct tree_decl
);
169 case 't': /* a type node */
170 return sizeof (struct tree_type
);
172 case 'b': /* a lexical block node */
173 return sizeof (struct tree_block
);
175 case 'r': /* a reference */
176 case 'e': /* an expression */
177 case 's': /* an expression with side effects */
178 case '<': /* a comparison expression */
179 case '1': /* a unary arithmetic expression */
180 case '2': /* a binary arithmetic expression */
181 return (sizeof (struct tree_exp
)
182 + TREE_CODE_LENGTH (code
) * sizeof (char *) - sizeof (char *));
184 case 'c': /* a constant */
185 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
186 words is machine-dependent due to varying length of HOST_WIDE_INT,
187 which might be wider than a pointer (e.g., long long). Similarly
188 for REAL_CST, since the number of words is machine-dependent due
189 to varying size and alignment of `double'. */
190 if (code
== INTEGER_CST
)
191 return sizeof (struct tree_int_cst
);
192 else if (code
== REAL_CST
)
193 return sizeof (struct tree_real_cst
);
195 return (sizeof (struct tree_common
)
196 + TREE_CODE_LENGTH (code
) * sizeof (char *));
198 case 'x': /* something random, like an identifier. */
201 length
= (sizeof (struct tree_common
)
202 + TREE_CODE_LENGTH (code
) * sizeof (char *));
203 if (code
== TREE_VEC
)
204 length
+= TREE_VEC_LENGTH (node
) * sizeof (char *) - sizeof (char *);
213 /* Return a newly allocated node of code CODE.
214 For decl and type nodes, some other fields are initialized.
215 The rest of the node is initialized to zero.
217 Achoo! I got a code in the node. */
224 int type
= TREE_CODE_CLASS (code
);
226 #ifdef GATHER_STATISTICS
229 struct tree_common ttmp
;
231 /* We can't allocate a TREE_VEC without knowing how many elements
233 if (code
== TREE_VEC
)
236 TREE_SET_CODE ((tree
)&ttmp
, code
);
237 length
= tree_size ((tree
)&ttmp
);
239 #ifdef GATHER_STATISTICS
242 case 'd': /* A decl node */
246 case 't': /* a type node */
250 case 'b': /* a lexical block */
254 case 's': /* an expression with side effects */
258 case 'r': /* a reference */
262 case 'e': /* an expression */
263 case '<': /* a comparison expression */
264 case '1': /* a unary arithmetic expression */
265 case '2': /* a binary arithmetic expression */
269 case 'c': /* a constant */
273 case 'x': /* something random, like an identifier. */
274 if (code
== IDENTIFIER_NODE
)
276 else if (code
== TREE_VEC
)
286 tree_node_counts
[(int) kind
]++;
287 tree_node_sizes
[(int) kind
] += length
;
290 t
= ggc_alloc_tree (length
);
292 memset ((PTR
) t
, 0, length
);
294 TREE_SET_CODE (t
, code
);
299 TREE_SIDE_EFFECTS (t
) = 1;
300 TREE_TYPE (t
) = void_type_node
;
304 if (code
!= FUNCTION_DECL
)
306 DECL_USER_ALIGN (t
) = 0;
307 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
308 DECL_SOURCE_LINE (t
) = lineno
;
309 DECL_SOURCE_FILE (t
) =
310 (input_filename
) ? input_filename
: "<built-in>";
311 DECL_UID (t
) = next_decl_uid
++;
313 /* We have not yet computed the alias set for this declaration. */
314 DECL_POINTER_ALIAS_SET (t
) = -1;
318 TYPE_UID (t
) = next_type_uid
++;
319 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
320 TYPE_USER_ALIGN (t
) = 0;
321 TYPE_MAIN_VARIANT (t
) = t
;
323 /* Default to no attributes for type, but let target change that. */
324 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
325 (*targetm
.set_default_type_attributes
) (t
);
327 /* We have not yet computed the alias set for this type. */
328 TYPE_ALIAS_SET (t
) = -1;
332 TREE_CONSTANT (t
) = 1;
342 case PREDECREMENT_EXPR
:
343 case PREINCREMENT_EXPR
:
344 case POSTDECREMENT_EXPR
:
345 case POSTINCREMENT_EXPR
:
346 /* All of these have side-effects, no matter what their
348 TREE_SIDE_EFFECTS (t
) = 1;
360 /* Return a new node with the same contents as NODE except that its
361 TREE_CHAIN is zero and it has a fresh uid. */
368 enum tree_code code
= TREE_CODE (node
);
371 length
= tree_size (node
);
372 t
= ggc_alloc_tree (length
);
373 memcpy (t
, node
, length
);
376 TREE_ASM_WRITTEN (t
) = 0;
378 if (TREE_CODE_CLASS (code
) == 'd')
379 DECL_UID (t
) = next_decl_uid
++;
380 else if (TREE_CODE_CLASS (code
) == 't')
382 TYPE_UID (t
) = next_type_uid
++;
383 /* The following is so that the debug code for
384 the copy is different from the original type.
385 The two statements usually duplicate each other
386 (because they clear fields of the same union),
387 but the optimizer should catch that. */
388 TYPE_SYMTAB_POINTER (t
) = 0;
389 TYPE_SYMTAB_ADDRESS (t
) = 0;
395 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
396 For example, this can copy a list made of TREE_LIST nodes. */
408 head
= prev
= copy_node (list
);
409 next
= TREE_CHAIN (list
);
412 TREE_CHAIN (prev
) = copy_node (next
);
413 prev
= TREE_CHAIN (prev
);
414 next
= TREE_CHAIN (next
);
420 /* Return a newly constructed INTEGER_CST node whose constant value
421 is specified by the two ints LOW and HI.
422 The TREE_TYPE is set to `int'.
424 This function should be used via the `build_int_2' macro. */
427 build_int_2_wide (low
, hi
)
428 unsigned HOST_WIDE_INT low
;
431 tree t
= make_node (INTEGER_CST
);
433 TREE_INT_CST_LOW (t
) = low
;
434 TREE_INT_CST_HIGH (t
) = hi
;
435 TREE_TYPE (t
) = integer_type_node
;
439 /* Return a new VECTOR_CST node whose type is TYPE and whose values
440 are in a list pointed by VALS. */
443 build_vector (type
, vals
)
446 tree v
= make_node (VECTOR_CST
);
447 int over1
= 0, over2
= 0;
450 TREE_VECTOR_CST_ELTS (v
) = vals
;
451 TREE_TYPE (v
) = type
;
453 /* Iterate through elements and check for overflow. */
454 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
456 tree value
= TREE_VALUE (link
);
458 over1
|= TREE_OVERFLOW (value
);
459 over2
|= TREE_CONSTANT_OVERFLOW (value
);
462 TREE_OVERFLOW (v
) = over1
;
463 TREE_CONSTANT_OVERFLOW (v
) = over2
;
468 /* Return a new REAL_CST node whose type is TYPE and value is D. */
479 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
480 Consider doing it via real_convert now. */
482 v
= make_node (REAL_CST
);
483 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
484 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
486 TREE_TYPE (v
) = type
;
487 TREE_REAL_CST_PTR (v
) = dp
;
488 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
492 /* Return a new REAL_CST node whose type is TYPE
493 and whose value is the integer value of the INTEGER_CST node I. */
496 real_value_from_int_cst (type
, i
)
497 tree type ATTRIBUTE_UNUSED
, i
;
501 /* Clear all bits of the real value type so that we can later do
502 bitwise comparisons to see if two values are the same. */
503 memset ((char *) &d
, 0, sizeof d
);
505 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
506 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
509 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
510 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
514 /* Given a tree representing an integer constant I, return a tree
515 representing the same value as a floating-point constant of type TYPE. */
518 build_real_from_int_cst (type
, i
)
523 int overflow
= TREE_OVERFLOW (i
);
525 v
= build_real (type
, real_value_from_int_cst (type
, i
));
527 TREE_OVERFLOW (v
) |= overflow
;
528 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
532 /* Return a newly constructed STRING_CST node whose value is
533 the LEN characters at STR.
534 The TREE_TYPE is not initialized. */
537 build_string (len
, str
)
541 tree s
= make_node (STRING_CST
);
543 TREE_STRING_LENGTH (s
) = len
;
544 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
549 /* Return a newly constructed COMPLEX_CST node whose value is
550 specified by the real and imaginary parts REAL and IMAG.
551 Both REAL and IMAG should be constant nodes. TYPE, if specified,
552 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
555 build_complex (type
, real
, imag
)
559 tree t
= make_node (COMPLEX_CST
);
561 TREE_REALPART (t
) = real
;
562 TREE_IMAGPART (t
) = imag
;
563 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
564 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
565 TREE_CONSTANT_OVERFLOW (t
)
566 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
570 /* Build a newly constructed TREE_VEC node of length LEN. */
577 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
579 #ifdef GATHER_STATISTICS
580 tree_node_counts
[(int) vec_kind
]++;
581 tree_node_sizes
[(int) vec_kind
] += length
;
584 t
= ggc_alloc_tree (length
);
586 memset ((PTR
) t
, 0, length
);
587 TREE_SET_CODE (t
, TREE_VEC
);
588 TREE_VEC_LENGTH (t
) = len
;
593 /* Return 1 if EXPR is the integer constant zero or a complex constant
602 return ((TREE_CODE (expr
) == INTEGER_CST
603 && ! TREE_CONSTANT_OVERFLOW (expr
)
604 && TREE_INT_CST_LOW (expr
) == 0
605 && TREE_INT_CST_HIGH (expr
) == 0)
606 || (TREE_CODE (expr
) == COMPLEX_CST
607 && integer_zerop (TREE_REALPART (expr
))
608 && integer_zerop (TREE_IMAGPART (expr
))));
611 /* Return 1 if EXPR is the integer constant one or the corresponding
620 return ((TREE_CODE (expr
) == INTEGER_CST
621 && ! TREE_CONSTANT_OVERFLOW (expr
)
622 && TREE_INT_CST_LOW (expr
) == 1
623 && TREE_INT_CST_HIGH (expr
) == 0)
624 || (TREE_CODE (expr
) == COMPLEX_CST
625 && integer_onep (TREE_REALPART (expr
))
626 && integer_zerop (TREE_IMAGPART (expr
))));
629 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
630 it contains. Likewise for the corresponding complex constant. */
633 integer_all_onesp (expr
)
641 if (TREE_CODE (expr
) == COMPLEX_CST
642 && integer_all_onesp (TREE_REALPART (expr
))
643 && integer_zerop (TREE_IMAGPART (expr
)))
646 else if (TREE_CODE (expr
) != INTEGER_CST
647 || TREE_CONSTANT_OVERFLOW (expr
))
650 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
652 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
653 && TREE_INT_CST_HIGH (expr
) == -1);
655 /* Note that using TYPE_PRECISION here is wrong. We care about the
656 actual bits, not the (arbitrary) range of the type. */
657 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
658 if (prec
>= HOST_BITS_PER_WIDE_INT
)
660 HOST_WIDE_INT high_value
;
663 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
665 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
666 /* Can not handle precisions greater than twice the host int size. */
668 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
669 /* Shifting by the host word size is undefined according to the ANSI
670 standard, so we must handle this as a special case. */
673 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
675 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
676 && TREE_INT_CST_HIGH (expr
) == high_value
);
679 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
682 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
690 HOST_WIDE_INT high
, low
;
694 if (TREE_CODE (expr
) == COMPLEX_CST
695 && integer_pow2p (TREE_REALPART (expr
))
696 && integer_zerop (TREE_IMAGPART (expr
)))
699 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
702 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
703 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
704 high
= TREE_INT_CST_HIGH (expr
);
705 low
= TREE_INT_CST_LOW (expr
);
707 /* First clear all bits that are beyond the type's precision in case
708 we've been sign extended. */
710 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
712 else if (prec
> HOST_BITS_PER_WIDE_INT
)
713 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
717 if (prec
< HOST_BITS_PER_WIDE_INT
)
718 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
721 if (high
== 0 && low
== 0)
724 return ((high
== 0 && (low
& (low
- 1)) == 0)
725 || (low
== 0 && (high
& (high
- 1)) == 0));
728 /* Return 1 if EXPR is an integer constant other than zero or a
729 complex constant other than zero. */
732 integer_nonzerop (expr
)
737 return ((TREE_CODE (expr
) == INTEGER_CST
738 && ! TREE_CONSTANT_OVERFLOW (expr
)
739 && (TREE_INT_CST_LOW (expr
) != 0
740 || TREE_INT_CST_HIGH (expr
) != 0))
741 || (TREE_CODE (expr
) == COMPLEX_CST
742 && (integer_nonzerop (TREE_REALPART (expr
))
743 || integer_nonzerop (TREE_IMAGPART (expr
)))));
746 /* Return the power of two represented by a tree node known to be a
754 HOST_WIDE_INT high
, low
;
758 if (TREE_CODE (expr
) == COMPLEX_CST
)
759 return tree_log2 (TREE_REALPART (expr
));
761 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
762 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
764 high
= TREE_INT_CST_HIGH (expr
);
765 low
= TREE_INT_CST_LOW (expr
);
767 /* First clear all bits that are beyond the type's precision in case
768 we've been sign extended. */
770 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
772 else if (prec
> HOST_BITS_PER_WIDE_INT
)
773 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
777 if (prec
< HOST_BITS_PER_WIDE_INT
)
778 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
781 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
785 /* Similar, but return the largest integer Y such that 2 ** Y is less
786 than or equal to EXPR. */
789 tree_floor_log2 (expr
)
793 HOST_WIDE_INT high
, low
;
797 if (TREE_CODE (expr
) == COMPLEX_CST
)
798 return tree_log2 (TREE_REALPART (expr
));
800 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
801 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
803 high
= TREE_INT_CST_HIGH (expr
);
804 low
= TREE_INT_CST_LOW (expr
);
806 /* First clear all bits that are beyond the type's precision in case
807 we've been sign extended. Ignore if type's precision hasn't been set
808 since what we are doing is setting it. */
810 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
812 else if (prec
> HOST_BITS_PER_WIDE_INT
)
813 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
817 if (prec
< HOST_BITS_PER_WIDE_INT
)
818 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
821 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
825 /* Return 1 if EXPR is the real constant zero. */
833 return ((TREE_CODE (expr
) == REAL_CST
834 && ! TREE_CONSTANT_OVERFLOW (expr
)
835 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
836 || (TREE_CODE (expr
) == COMPLEX_CST
837 && real_zerop (TREE_REALPART (expr
))
838 && real_zerop (TREE_IMAGPART (expr
))));
841 /* Return 1 if EXPR is the real constant one in real or complex form. */
849 return ((TREE_CODE (expr
) == REAL_CST
850 && ! TREE_CONSTANT_OVERFLOW (expr
)
851 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
852 || (TREE_CODE (expr
) == COMPLEX_CST
853 && real_onep (TREE_REALPART (expr
))
854 && real_zerop (TREE_IMAGPART (expr
))));
857 /* Return 1 if EXPR is the real constant two. */
865 return ((TREE_CODE (expr
) == REAL_CST
866 && ! TREE_CONSTANT_OVERFLOW (expr
)
867 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
868 || (TREE_CODE (expr
) == COMPLEX_CST
869 && real_twop (TREE_REALPART (expr
))
870 && real_zerop (TREE_IMAGPART (expr
))));
873 /* Return 1 if EXPR is the real constant minus one. */
876 real_minus_onep (expr
)
881 return ((TREE_CODE (expr
) == REAL_CST
882 && ! TREE_CONSTANT_OVERFLOW (expr
)
883 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
884 || (TREE_CODE (expr
) == COMPLEX_CST
885 && real_minus_onep (TREE_REALPART (expr
))
886 && real_zerop (TREE_IMAGPART (expr
))));
889 /* Nonzero if EXP is a constant or a cast of a constant. */
892 really_constant_p (exp
)
895 /* This is not quite the same as STRIP_NOPS. It does more. */
896 while (TREE_CODE (exp
) == NOP_EXPR
897 || TREE_CODE (exp
) == CONVERT_EXPR
898 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
899 exp
= TREE_OPERAND (exp
, 0);
900 return TREE_CONSTANT (exp
);
903 /* Return first list element whose TREE_VALUE is ELEM.
904 Return 0 if ELEM is not in LIST. */
907 value_member (elem
, list
)
912 if (elem
== TREE_VALUE (list
))
914 list
= TREE_CHAIN (list
);
919 /* Return first list element whose TREE_PURPOSE is ELEM.
920 Return 0 if ELEM is not in LIST. */
923 purpose_member (elem
, list
)
928 if (elem
== TREE_PURPOSE (list
))
930 list
= TREE_CHAIN (list
);
935 /* Return first list element whose BINFO_TYPE is ELEM.
936 Return 0 if ELEM is not in LIST. */
939 binfo_member (elem
, list
)
944 if (elem
== BINFO_TYPE (list
))
946 list
= TREE_CHAIN (list
);
951 /* Return nonzero if ELEM is part of the chain CHAIN. */
954 chain_member (elem
, chain
)
961 chain
= TREE_CHAIN (chain
);
967 /* Return the length of a chain of nodes chained through TREE_CHAIN.
968 We expect a null pointer to mark the end of the chain.
969 This is the Lisp primitive `length'. */
978 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
984 /* Returns the number of FIELD_DECLs in TYPE. */
990 tree t
= TYPE_FIELDS (type
);
993 for (; t
; t
= TREE_CHAIN (t
))
994 if (TREE_CODE (t
) == FIELD_DECL
)
1000 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1001 by modifying the last node in chain 1 to point to chain 2.
1002 This is the Lisp primitive `nconc'. */
1012 #ifdef ENABLE_TREE_CHECKING
1016 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1018 TREE_CHAIN (t1
) = op2
;
1019 #ifdef ENABLE_TREE_CHECKING
1020 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1022 abort (); /* Circularity created. */
1030 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1038 while ((next
= TREE_CHAIN (chain
)))
1043 /* Reverse the order of elements in the chain T,
1044 and return the new head of the chain (old last element). */
1050 tree prev
= 0, decl
, next
;
1051 for (decl
= t
; decl
; decl
= next
)
1053 next
= TREE_CHAIN (decl
);
1054 TREE_CHAIN (decl
) = prev
;
1060 /* Return a newly created TREE_LIST node whose
1061 purpose and value fields are PARM and VALUE. */
1064 build_tree_list (parm
, value
)
1067 tree t
= make_node (TREE_LIST
);
1068 TREE_PURPOSE (t
) = parm
;
1069 TREE_VALUE (t
) = value
;
1073 /* Return a newly created TREE_LIST node whose
1074 purpose and value fields are PARM and VALUE
1075 and whose TREE_CHAIN is CHAIN. */
1078 tree_cons (purpose
, value
, chain
)
1079 tree purpose
, value
, chain
;
1083 node
= ggc_alloc_tree (sizeof (struct tree_list
));
1085 memset (node
, 0, sizeof (struct tree_common
));
1087 #ifdef GATHER_STATISTICS
1088 tree_node_counts
[(int) x_kind
]++;
1089 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1092 TREE_SET_CODE (node
, TREE_LIST
);
1093 TREE_CHAIN (node
) = chain
;
1094 TREE_PURPOSE (node
) = purpose
;
1095 TREE_VALUE (node
) = value
;
1100 /* Return the size nominally occupied by an object of type TYPE
1101 when it resides in memory. The value is measured in units of bytes,
1102 and its data type is that normally used for type sizes
1103 (which is the first type created by make_signed_type or
1104 make_unsigned_type). */
1107 size_in_bytes (type
)
1112 if (type
== error_mark_node
)
1113 return integer_zero_node
;
1115 type
= TYPE_MAIN_VARIANT (type
);
1116 t
= TYPE_SIZE_UNIT (type
);
1120 (*lang_hooks
.types
.incomplete_type_error
) (NULL_TREE
, type
);
1121 return size_zero_node
;
1124 if (TREE_CODE (t
) == INTEGER_CST
)
1125 force_fit_type (t
, 0);
1130 /* Return the size of TYPE (in bytes) as a wide integer
1131 or return -1 if the size can vary or is larger than an integer. */
1134 int_size_in_bytes (type
)
1139 if (type
== error_mark_node
)
1142 type
= TYPE_MAIN_VARIANT (type
);
1143 t
= TYPE_SIZE_UNIT (type
);
1145 || TREE_CODE (t
) != INTEGER_CST
1146 || TREE_OVERFLOW (t
)
1147 || TREE_INT_CST_HIGH (t
) != 0
1148 /* If the result would appear negative, it's too big to represent. */
1149 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1152 return TREE_INT_CST_LOW (t
);
1155 /* Return the bit position of FIELD, in bits from the start of the record.
1156 This is a tree of type bitsizetype. */
1159 bit_position (field
)
1163 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1164 DECL_FIELD_BIT_OFFSET (field
));
1167 /* Likewise, but return as an integer. Abort if it cannot be represented
1168 in that way (since it could be a signed value, we don't have the option
1169 of returning -1 like int_size_in_byte can. */
1172 int_bit_position (field
)
1175 return tree_low_cst (bit_position (field
), 0);
1178 /* Return the byte position of FIELD, in bytes from the start of the record.
1179 This is a tree of type sizetype. */
1182 byte_position (field
)
1185 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1186 DECL_FIELD_BIT_OFFSET (field
));
1189 /* Likewise, but return as an integer. Abort if it cannot be represented
1190 in that way (since it could be a signed value, we don't have the option
1191 of returning -1 like int_size_in_byte can. */
1194 int_byte_position (field
)
1197 return tree_low_cst (byte_position (field
), 0);
1200 /* Return the strictest alignment, in bits, that T is known to have. */
1206 unsigned int align0
, align1
;
1208 switch (TREE_CODE (t
))
1210 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1211 /* If we have conversions, we know that the alignment of the
1212 object must meet each of the alignments of the types. */
1213 align0
= expr_align (TREE_OPERAND (t
, 0));
1214 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1215 return MAX (align0
, align1
);
1217 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1218 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1219 case WITH_RECORD_EXPR
: case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
1220 /* These don't change the alignment of an object. */
1221 return expr_align (TREE_OPERAND (t
, 0));
1224 /* The best we can do is say that the alignment is the least aligned
1226 align0
= expr_align (TREE_OPERAND (t
, 1));
1227 align1
= expr_align (TREE_OPERAND (t
, 2));
1228 return MIN (align0
, align1
);
1230 case LABEL_DECL
: case CONST_DECL
:
1231 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1232 if (DECL_ALIGN (t
) != 0)
1233 return DECL_ALIGN (t
);
1237 return FUNCTION_BOUNDARY
;
1243 /* Otherwise take the alignment from that of the type. */
1244 return TYPE_ALIGN (TREE_TYPE (t
));
1247 /* Return, as a tree node, the number of elements for TYPE (which is an
1248 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1251 array_type_nelts (type
)
1254 tree index_type
, min
, max
;
1256 /* If they did it with unspecified bounds, then we should have already
1257 given an error about it before we got here. */
1258 if (! TYPE_DOMAIN (type
))
1259 return error_mark_node
;
1261 index_type
= TYPE_DOMAIN (type
);
1262 min
= TYPE_MIN_VALUE (index_type
);
1263 max
= TYPE_MAX_VALUE (index_type
);
1265 return (integer_zerop (min
)
1267 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1270 /* Return nonzero if arg is static -- a reference to an object in
1271 static storage. This is not the same as the C meaning of `static'. */
1277 switch (TREE_CODE (arg
))
1280 /* Nested functions aren't static, since taking their address
1281 involves a trampoline. */
1282 return ((decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1283 && ! DECL_NON_ADDR_CONST_P (arg
));
1286 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1287 && ! DECL_THREAD_LOCAL (arg
)
1288 && ! DECL_NON_ADDR_CONST_P (arg
));
1291 return TREE_STATIC (arg
);
1297 /* If we are referencing a bitfield, we can't evaluate an
1298 ADDR_EXPR at compile time and so it isn't a constant. */
1300 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
1301 && staticp (TREE_OPERAND (arg
, 0)));
1307 /* This case is technically correct, but results in setting
1308 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1311 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
1315 case ARRAY_RANGE_REF
:
1316 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1317 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1318 return staticp (TREE_OPERAND (arg
, 0));
1321 if ((unsigned int) TREE_CODE (arg
)
1322 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1323 return (*lang_hooks
.staticp
) (arg
);
1329 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1330 Do this to any expression which may be used in more than one place,
1331 but must be evaluated only once.
1333 Normally, expand_expr would reevaluate the expression each time.
1334 Calling save_expr produces something that is evaluated and recorded
1335 the first time expand_expr is called on it. Subsequent calls to
1336 expand_expr just reuse the recorded value.
1338 The call to expand_expr that generates code that actually computes
1339 the value is the first call *at compile time*. Subsequent calls
1340 *at compile time* generate code to use the saved value.
1341 This produces correct result provided that *at run time* control
1342 always flows through the insns made by the first expand_expr
1343 before reaching the other places where the save_expr was evaluated.
1344 You, the caller of save_expr, must make sure this is so.
1346 Constants, and certain read-only nodes, are returned with no
1347 SAVE_EXPR because that is safe. Expressions containing placeholders
1348 are not touched; see tree.def for an explanation of what these
1355 tree t
= fold (expr
);
1358 /* We don't care about whether this can be used as an lvalue in this
1360 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
1361 t
= TREE_OPERAND (t
, 0);
1363 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1364 a constant, it will be more efficient to not make another SAVE_EXPR since
1365 it will allow better simplification and GCSE will be able to merge the
1366 computations if they actualy occur. */
1368 (TREE_CODE_CLASS (TREE_CODE (inner
)) == '1'
1369 || (TREE_CODE_CLASS (TREE_CODE (inner
)) == '2'
1370 && TREE_CONSTANT (TREE_OPERAND (inner
, 1))));
1371 inner
= TREE_OPERAND (inner
, 0))
1374 /* If the tree evaluates to a constant, then we don't want to hide that
1375 fact (i.e. this allows further folding, and direct checks for constants).
1376 However, a read-only object that has side effects cannot be bypassed.
1377 Since it is no problem to reevaluate literals, we just return the
1379 if (TREE_CONSTANT (inner
)
1380 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1381 || TREE_CODE (inner
) == SAVE_EXPR
|| TREE_CODE (inner
) == ERROR_MARK
)
1384 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1385 it means that the size or offset of some field of an object depends on
1386 the value within another field.
1388 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1389 and some variable since it would then need to be both evaluated once and
1390 evaluated more than once. Front-ends must assure this case cannot
1391 happen by surrounding any such subexpressions in their own SAVE_EXPR
1392 and forcing evaluation at the proper time. */
1393 if (contains_placeholder_p (t
))
1396 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
1398 /* This expression might be placed ahead of a jump to ensure that the
1399 value was computed on both sides of the jump. So make sure it isn't
1400 eliminated as dead. */
1401 TREE_SIDE_EFFECTS (t
) = 1;
1402 TREE_READONLY (t
) = 1;
1406 /* Arrange for an expression to be expanded multiple independent
1407 times. This is useful for cleanup actions, as the backend can
1408 expand them multiple times in different places. */
1416 /* If this is already protected, no sense in protecting it again. */
1417 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
1420 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
1421 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
1425 /* Returns the index of the first non-tree operand for CODE, or the number
1426 of operands if all are trees. */
1430 enum tree_code code
;
1436 case GOTO_SUBROUTINE_EXPR
:
1439 case WITH_CLEANUP_EXPR
:
1441 case METHOD_CALL_EXPR
:
1444 return TREE_CODE_LENGTH (code
);
1448 /* Return which tree structure is used by T. */
1450 enum tree_node_structure_enum
1451 tree_node_structure (t
)
1454 enum tree_code code
= TREE_CODE (t
);
1456 switch (TREE_CODE_CLASS (code
))
1458 case 'd': return TS_DECL
;
1459 case 't': return TS_TYPE
;
1460 case 'b': return TS_BLOCK
;
1461 case 'r': case '<': case '1': case '2': case 'e': case 's':
1463 default: /* 'c' and 'x' */
1469 case INTEGER_CST
: return TS_INT_CST
;
1470 case REAL_CST
: return TS_REAL_CST
;
1471 case COMPLEX_CST
: return TS_COMPLEX
;
1472 case VECTOR_CST
: return TS_VECTOR
;
1473 case STRING_CST
: return TS_STRING
;
1475 case ERROR_MARK
: return TS_COMMON
;
1476 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1477 case TREE_LIST
: return TS_LIST
;
1478 case TREE_VEC
: return TS_VEC
;
1479 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1486 /* Perform any modifications to EXPR required when it is unsaved. Does
1487 not recurse into EXPR's subtrees. */
1490 unsave_expr_1 (expr
)
1493 switch (TREE_CODE (expr
))
1496 if (! SAVE_EXPR_PERSISTENT_P (expr
))
1497 SAVE_EXPR_RTL (expr
) = 0;
1501 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1502 It's OK for this to happen if it was part of a subtree that
1503 isn't immediately expanded, such as operand 2 of another
1505 if (TREE_OPERAND (expr
, 1))
1508 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
1509 TREE_OPERAND (expr
, 3) = NULL_TREE
;
1513 /* I don't yet know how to emit a sequence multiple times. */
1514 if (RTL_EXPR_SEQUENCE (expr
) != 0)
1523 /* Default lang hook for "unsave_expr_now". */
1526 lhd_unsave_expr_now (expr
)
1529 enum tree_code code
;
1531 /* There's nothing to do for NULL_TREE. */
1535 unsave_expr_1 (expr
);
1537 code
= TREE_CODE (expr
);
1538 switch (TREE_CODE_CLASS (code
))
1540 case 'c': /* a constant */
1541 case 't': /* a type node */
1542 case 'd': /* A decl node */
1543 case 'b': /* A block node */
1546 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1547 if (code
== TREE_LIST
)
1549 lhd_unsave_expr_now (TREE_VALUE (expr
));
1550 lhd_unsave_expr_now (TREE_CHAIN (expr
));
1554 case 'e': /* an expression */
1555 case 'r': /* a reference */
1556 case 's': /* an expression with side effects */
1557 case '<': /* a comparison expression */
1558 case '2': /* a binary arithmetic expression */
1559 case '1': /* a unary arithmetic expression */
1563 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
1564 lhd_unsave_expr_now (TREE_OPERAND (expr
, i
));
1575 /* Return 0 if it is safe to evaluate EXPR multiple times,
1576 return 1 if it is safe if EXPR is unsaved afterward, or
1577 return 2 if it is completely unsafe.
1579 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1580 an expression tree, so that it safe to unsave them and the surrounding
1581 context will be correct.
1583 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1584 occasionally across the whole of a function. It is therefore only
1585 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1586 below the UNSAVE_EXPR.
1588 RTL_EXPRs consume their rtl during evaluation. It is therefore
1589 never possible to unsave them. */
1592 unsafe_for_reeval (expr
)
1596 enum tree_code code
;
1601 if (expr
== NULL_TREE
)
1604 code
= TREE_CODE (expr
);
1605 first_rtl
= first_rtl_op (code
);
1614 for (exp
= expr
; exp
!= 0; exp
= TREE_CHAIN (exp
))
1616 tmp
= unsafe_for_reeval (TREE_VALUE (exp
));
1617 unsafeness
= MAX (tmp
, unsafeness
);
1623 tmp2
= unsafe_for_reeval (TREE_OPERAND (expr
, 0));
1624 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, 1));
1625 return MAX (MAX (tmp
, 1), tmp2
);
1632 tmp
= (*lang_hooks
.unsafe_for_reeval
) (expr
);
1638 switch (TREE_CODE_CLASS (code
))
1640 case 'c': /* a constant */
1641 case 't': /* a type node */
1642 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1643 case 'd': /* A decl node */
1644 case 'b': /* A block node */
1647 case 'e': /* an expression */
1648 case 'r': /* a reference */
1649 case 's': /* an expression with side effects */
1650 case '<': /* a comparison expression */
1651 case '2': /* a binary arithmetic expression */
1652 case '1': /* a unary arithmetic expression */
1653 for (i
= first_rtl
- 1; i
>= 0; i
--)
1655 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, i
));
1656 unsafeness
= MAX (tmp
, unsafeness
);
1666 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1667 or offset that depends on a field within a record. */
1670 contains_placeholder_p (exp
)
1673 enum tree_code code
;
1679 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1680 in it since it is supplying a value for it. */
1681 code
= TREE_CODE (exp
);
1682 if (code
== WITH_RECORD_EXPR
)
1684 else if (code
== PLACEHOLDER_EXPR
)
1687 switch (TREE_CODE_CLASS (code
))
1690 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1691 position computations since they will be converted into a
1692 WITH_RECORD_EXPR involving the reference, which will assume
1693 here will be valid. */
1694 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1697 if (code
== TREE_LIST
)
1698 return (contains_placeholder_p (TREE_VALUE (exp
))
1699 || (TREE_CHAIN (exp
) != 0
1700 && contains_placeholder_p (TREE_CHAIN (exp
))));
1709 /* Ignoring the first operand isn't quite right, but works best. */
1710 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
1717 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1718 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
1719 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
1722 /* If we already know this doesn't have a placeholder, don't
1724 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
1727 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
1728 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
1730 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
1735 return (TREE_OPERAND (exp
, 1) != 0
1736 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1742 switch (TREE_CODE_LENGTH (code
))
1745 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1747 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1748 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1759 /* Return 1 if EXP contains any expressions that produce cleanups for an
1760 outer scope to deal with. Used by fold. */
1768 if (! TREE_SIDE_EFFECTS (exp
))
1771 switch (TREE_CODE (exp
))
1774 case GOTO_SUBROUTINE_EXPR
:
1775 case WITH_CLEANUP_EXPR
:
1778 case CLEANUP_POINT_EXPR
:
1782 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
1784 cmp
= has_cleanups (TREE_VALUE (exp
));
1794 /* This general rule works for most tree codes. All exceptions should be
1795 handled above. If this is a language-specific tree code, we can't
1796 trust what might be in the operand, so say we don't know
1798 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
1801 nops
= first_rtl_op (TREE_CODE (exp
));
1802 for (i
= 0; i
< nops
; i
++)
1803 if (TREE_OPERAND (exp
, i
) != 0)
1805 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
1806 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
1807 || type
== 'r' || type
== 's')
1809 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
1818 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1819 return a tree with all occurrences of references to F in a
1820 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1821 contains only arithmetic expressions or a CALL_EXPR with a
1822 PLACEHOLDER_EXPR occurring only in its arglist. */
1825 substitute_in_expr (exp
, f
, r
)
1830 enum tree_code code
= TREE_CODE (exp
);
1835 switch (TREE_CODE_CLASS (code
))
1842 if (code
== PLACEHOLDER_EXPR
)
1844 else if (code
== TREE_LIST
)
1846 op0
= (TREE_CHAIN (exp
) == 0
1847 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
1848 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
1849 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1852 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1861 switch (TREE_CODE_LENGTH (code
))
1864 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1865 if (op0
== TREE_OPERAND (exp
, 0))
1868 if (code
== NON_LVALUE_EXPR
)
1871 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
1875 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
1876 could, but we don't support it. */
1877 if (code
== RTL_EXPR
)
1879 else if (code
== CONSTRUCTOR
)
1882 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1883 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1884 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
1887 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
1891 /* It cannot be that anything inside a SAVE_EXPR contains a
1892 PLACEHOLDER_EXPR. */
1893 if (code
== SAVE_EXPR
)
1896 else if (code
== CALL_EXPR
)
1898 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1899 if (op1
== TREE_OPERAND (exp
, 1))
1902 return build (code
, TREE_TYPE (exp
),
1903 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
1906 else if (code
!= COND_EXPR
)
1909 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1910 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1911 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
1912 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
1913 && op2
== TREE_OPERAND (exp
, 2))
1916 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
1929 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1930 and it is the right field, replace it with R. */
1931 for (inner
= TREE_OPERAND (exp
, 0);
1932 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
1933 inner
= TREE_OPERAND (inner
, 0))
1935 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
1936 && TREE_OPERAND (exp
, 1) == f
)
1939 /* If this expression hasn't been completed let, leave it
1941 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
1942 && TREE_TYPE (inner
) == 0)
1945 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1946 if (op0
== TREE_OPERAND (exp
, 0))
1949 new = fold (build (code
, TREE_TYPE (exp
), op0
,
1950 TREE_OPERAND (exp
, 1)));
1954 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1955 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
1956 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
1957 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
1958 && op2
== TREE_OPERAND (exp
, 2))
1961 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
1966 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
1967 if (op0
== TREE_OPERAND (exp
, 0))
1970 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
1982 TREE_READONLY (new) = TREE_READONLY (exp
);
1986 /* Stabilize a reference so that we can use it any number of times
1987 without causing its operands to be evaluated more than once.
1988 Returns the stabilized reference. This works by means of save_expr,
1989 so see the caveats in the comments about save_expr.
1991 Also allows conversion expressions whose operands are references.
1992 Any other kind of expression is returned unchanged. */
1995 stabilize_reference (ref
)
1999 enum tree_code code
= TREE_CODE (ref
);
2006 /* No action is needed in this case. */
2012 case FIX_TRUNC_EXPR
:
2013 case FIX_FLOOR_EXPR
:
2014 case FIX_ROUND_EXPR
:
2016 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2020 result
= build_nt (INDIRECT_REF
,
2021 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2025 result
= build_nt (COMPONENT_REF
,
2026 stabilize_reference (TREE_OPERAND (ref
, 0)),
2027 TREE_OPERAND (ref
, 1));
2031 result
= build_nt (BIT_FIELD_REF
,
2032 stabilize_reference (TREE_OPERAND (ref
, 0)),
2033 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2034 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2038 result
= build_nt (ARRAY_REF
,
2039 stabilize_reference (TREE_OPERAND (ref
, 0)),
2040 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2043 case ARRAY_RANGE_REF
:
2044 result
= build_nt (ARRAY_RANGE_REF
,
2045 stabilize_reference (TREE_OPERAND (ref
, 0)),
2046 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2050 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2051 it wouldn't be ignored. This matters when dealing with
2053 return stabilize_reference_1 (ref
);
2056 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2057 save_expr (build1 (ADDR_EXPR
,
2058 build_pointer_type (TREE_TYPE (ref
)),
2062 /* If arg isn't a kind of lvalue we recognize, make no change.
2063 Caller should recognize the error for an invalid lvalue. */
2068 return error_mark_node
;
2071 TREE_TYPE (result
) = TREE_TYPE (ref
);
2072 TREE_READONLY (result
) = TREE_READONLY (ref
);
2073 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2074 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2079 /* Subroutine of stabilize_reference; this is called for subtrees of
2080 references. Any expression with side-effects must be put in a SAVE_EXPR
2081 to ensure that it is only evaluated once.
2083 We don't put SAVE_EXPR nodes around everything, because assigning very
2084 simple expressions to temporaries causes us to miss good opportunities
2085 for optimizations. Among other things, the opportunity to fold in the
2086 addition of a constant into an addressing mode often gets lost, e.g.
2087 "y[i+1] += x;". In general, we take the approach that we should not make
2088 an assignment unless we are forced into it - i.e., that any non-side effect
2089 operator should be allowed, and that cse should take care of coalescing
2090 multiple utterances of the same expression should that prove fruitful. */
2093 stabilize_reference_1 (e
)
2097 enum tree_code code
= TREE_CODE (e
);
2099 /* We cannot ignore const expressions because it might be a reference
2100 to a const array but whose index contains side-effects. But we can
2101 ignore things that are actual constant or that already have been
2102 handled by this function. */
2104 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2107 switch (TREE_CODE_CLASS (code
))
2117 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2118 so that it will only be evaluated once. */
2119 /* The reference (r) and comparison (<) classes could be handled as
2120 below, but it is generally faster to only evaluate them once. */
2121 if (TREE_SIDE_EFFECTS (e
))
2122 return save_expr (e
);
2126 /* Constants need no processing. In fact, we should never reach
2131 /* Division is slow and tends to be compiled with jumps,
2132 especially the division by powers of 2 that is often
2133 found inside of an array reference. So do it just once. */
2134 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2135 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2136 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2137 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2138 return save_expr (e
);
2139 /* Recursively stabilize each operand. */
2140 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2141 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2145 /* Recursively stabilize each operand. */
2146 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2153 TREE_TYPE (result
) = TREE_TYPE (e
);
2154 TREE_READONLY (result
) = TREE_READONLY (e
);
2155 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2156 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2161 /* Low-level constructors for expressions. */
2163 /* Build an expression of code CODE, data type TYPE,
2164 and operands as specified by the arguments ARG1 and following arguments.
2165 Expressions and reference nodes can be created this way.
2166 Constants, decls, types and misc nodes cannot be. */
2169 build
VPARAMS ((enum tree_code code
, tree tt
, ...))
2178 VA_FIXEDARG (p
, enum tree_code
, code
);
2179 VA_FIXEDARG (p
, tree
, tt
);
2181 t
= make_node (code
);
2182 length
= TREE_CODE_LENGTH (code
);
2185 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2186 result based on those same flags for the arguments. But if the
2187 arguments aren't really even `tree' expressions, we shouldn't be trying
2189 fro
= first_rtl_op (code
);
2191 /* Expressions without side effects may be constant if their
2192 arguments are as well. */
2193 constant
= (TREE_CODE_CLASS (code
) == '<'
2194 || TREE_CODE_CLASS (code
) == '1'
2195 || TREE_CODE_CLASS (code
) == '2'
2196 || TREE_CODE_CLASS (code
) == 'c');
2200 /* This is equivalent to the loop below, but faster. */
2201 tree arg0
= va_arg (p
, tree
);
2202 tree arg1
= va_arg (p
, tree
);
2204 TREE_OPERAND (t
, 0) = arg0
;
2205 TREE_OPERAND (t
, 1) = arg1
;
2206 TREE_READONLY (t
) = 1;
2207 if (arg0
&& fro
> 0)
2209 if (TREE_SIDE_EFFECTS (arg0
))
2210 TREE_SIDE_EFFECTS (t
) = 1;
2211 if (!TREE_READONLY (arg0
))
2212 TREE_READONLY (t
) = 0;
2213 if (!TREE_CONSTANT (arg0
))
2217 if (arg1
&& fro
> 1)
2219 if (TREE_SIDE_EFFECTS (arg1
))
2220 TREE_SIDE_EFFECTS (t
) = 1;
2221 if (!TREE_READONLY (arg1
))
2222 TREE_READONLY (t
) = 0;
2223 if (!TREE_CONSTANT (arg1
))
2227 else if (length
== 1)
2229 tree arg0
= va_arg (p
, tree
);
2231 /* The only one-operand cases we handle here are those with side-effects.
2232 Others are handled with build1. So don't bother checked if the
2233 arg has side-effects since we'll already have set it.
2235 ??? This really should use build1 too. */
2236 if (TREE_CODE_CLASS (code
) != 's')
2238 TREE_OPERAND (t
, 0) = arg0
;
2242 for (i
= 0; i
< length
; i
++)
2244 tree operand
= va_arg (p
, tree
);
2246 TREE_OPERAND (t
, i
) = operand
;
2247 if (operand
&& fro
> i
)
2249 if (TREE_SIDE_EFFECTS (operand
))
2250 TREE_SIDE_EFFECTS (t
) = 1;
2251 if (!TREE_CONSTANT (operand
))
2258 TREE_CONSTANT (t
) = constant
;
2262 /* Same as above, but only builds for unary operators.
2263 Saves lions share of calls to `build'; cuts down use
2264 of varargs, which is expensive for RISC machines. */
2267 build1 (code
, type
, node
)
2268 enum tree_code code
;
2273 #ifdef GATHER_STATISTICS
2274 tree_node_kind kind
;
2278 #ifdef GATHER_STATISTICS
2279 if (TREE_CODE_CLASS (code
) == 'r')
2285 #ifdef ENABLE_CHECKING
2286 if (TREE_CODE_CLASS (code
) == '2'
2287 || TREE_CODE_CLASS (code
) == '<'
2288 || TREE_CODE_LENGTH (code
) != 1)
2290 #endif /* ENABLE_CHECKING */
2292 length
= sizeof (struct tree_exp
);
2294 t
= ggc_alloc_tree (length
);
2296 memset ((PTR
) t
, 0, sizeof (struct tree_common
));
2298 #ifdef GATHER_STATISTICS
2299 tree_node_counts
[(int) kind
]++;
2300 tree_node_sizes
[(int) kind
] += length
;
2303 TREE_SET_CODE (t
, code
);
2305 TREE_TYPE (t
) = type
;
2306 TREE_COMPLEXITY (t
) = 0;
2307 TREE_OPERAND (t
, 0) = node
;
2308 if (node
&& first_rtl_op (code
) != 0)
2310 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2311 TREE_READONLY (t
) = TREE_READONLY (node
);
2320 case PREDECREMENT_EXPR
:
2321 case PREINCREMENT_EXPR
:
2322 case POSTDECREMENT_EXPR
:
2323 case POSTINCREMENT_EXPR
:
2324 /* All of these have side-effects, no matter what their
2326 TREE_SIDE_EFFECTS (t
) = 1;
2327 TREE_READONLY (t
) = 0;
2331 /* Whether a dereference is readonly has nothing to do with whether
2332 its operand is readonly. */
2333 TREE_READONLY (t
) = 0;
2337 if (TREE_CODE_CLASS (code
) == '1' && node
&& TREE_CONSTANT (node
))
2338 TREE_CONSTANT (t
) = 1;
2345 /* Similar except don't specify the TREE_TYPE
2346 and leave the TREE_SIDE_EFFECTS as 0.
2347 It is permissible for arguments to be null,
2348 or even garbage if their values do not matter. */
2351 build_nt
VPARAMS ((enum tree_code code
, ...))
2358 VA_FIXEDARG (p
, enum tree_code
, code
);
2360 t
= make_node (code
);
2361 length
= TREE_CODE_LENGTH (code
);
2363 for (i
= 0; i
< length
; i
++)
2364 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2370 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2371 We do NOT enter this node in any sort of symbol table.
2373 layout_decl is used to set up the decl's storage layout.
2374 Other slots are initialized to 0 or null pointers. */
2377 build_decl (code
, name
, type
)
2378 enum tree_code code
;
2383 t
= make_node (code
);
2385 /* if (type == error_mark_node)
2386 type = integer_type_node; */
2387 /* That is not done, deliberately, so that having error_mark_node
2388 as the type can suppress useless errors in the use of this variable. */
2390 DECL_NAME (t
) = name
;
2391 TREE_TYPE (t
) = type
;
2393 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2395 else if (code
== FUNCTION_DECL
)
2396 DECL_MODE (t
) = FUNCTION_MODE
;
2401 /* BLOCK nodes are used to represent the structure of binding contours
2402 and declarations, once those contours have been exited and their contents
2403 compiled. This information is used for outputting debugging info. */
2406 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
2407 tree vars
, tags ATTRIBUTE_UNUSED
, subblocks
, supercontext
, chain
;
2409 tree block
= make_node (BLOCK
);
2411 BLOCK_VARS (block
) = vars
;
2412 BLOCK_SUBBLOCKS (block
) = subblocks
;
2413 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2414 BLOCK_CHAIN (block
) = chain
;
2418 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2419 location where an expression or an identifier were encountered. It
2420 is necessary for languages where the frontend parser will handle
2421 recursively more than one file (Java is one of them). */
2424 build_expr_wfl (node
, file
, line
, col
)
2429 static const char *last_file
= 0;
2430 static tree last_filenode
= NULL_TREE
;
2431 tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
2433 EXPR_WFL_NODE (wfl
) = node
;
2434 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
2435 if (file
!= last_file
)
2438 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
2441 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
2444 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
2445 TREE_TYPE (wfl
) = TREE_TYPE (node
);
2451 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2455 build_decl_attribute_variant (ddecl
, attribute
)
2456 tree ddecl
, attribute
;
2458 DECL_ATTRIBUTES (ddecl
) = attribute
;
2462 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2465 Record such modified types already made so we don't make duplicates. */
2468 build_type_attribute_variant (ttype
, attribute
)
2469 tree ttype
, attribute
;
2471 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2473 unsigned int hashcode
;
2476 ntype
= copy_node (ttype
);
2478 TYPE_POINTER_TO (ntype
) = 0;
2479 TYPE_REFERENCE_TO (ntype
) = 0;
2480 TYPE_ATTRIBUTES (ntype
) = attribute
;
2482 /* Create a new main variant of TYPE. */
2483 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2484 TYPE_NEXT_VARIANT (ntype
) = 0;
2485 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2487 hashcode
= (TYPE_HASH (TREE_CODE (ntype
))
2488 + TYPE_HASH (TREE_TYPE (ntype
))
2489 + attribute_hash_list (attribute
));
2491 switch (TREE_CODE (ntype
))
2494 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
2497 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
2500 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
2503 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
2509 ntype
= type_hash_canon (hashcode
, ntype
);
2510 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2516 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2519 We try both `text' and `__text__', ATTR may be either one. */
2520 /* ??? It might be a reasonable simplification to require ATTR to be only
2521 `text'. One might then also require attribute lists to be stored in
2522 their canonicalized form. */
2525 is_attribute_p (attr
, ident
)
2529 int ident_len
, attr_len
;
2532 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2535 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2538 p
= IDENTIFIER_POINTER (ident
);
2539 ident_len
= strlen (p
);
2540 attr_len
= strlen (attr
);
2542 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2546 || attr
[attr_len
- 2] != '_'
2547 || attr
[attr_len
- 1] != '_')
2549 if (ident_len
== attr_len
- 4
2550 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2555 if (ident_len
== attr_len
+ 4
2556 && p
[0] == '_' && p
[1] == '_'
2557 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2558 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2565 /* Given an attribute name and a list of attributes, return a pointer to the
2566 attribute's list element if the attribute is part of the list, or NULL_TREE
2567 if not found. If the attribute appears more than once, this only
2568 returns the first occurrence; the TREE_CHAIN of the return value should
2569 be passed back in if further occurrences are wanted. */
2572 lookup_attribute (attr_name
, list
)
2573 const char *attr_name
;
2578 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2580 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
2582 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2589 /* Return an attribute list that is the union of a1 and a2. */
2592 merge_attributes (a1
, a2
)
2597 /* Either one unset? Take the set one. */
2599 if ((attributes
= a1
) == 0)
2602 /* One that completely contains the other? Take it. */
2604 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2606 if (attribute_list_contained (a2
, a1
))
2610 /* Pick the longest list, and hang on the other list. */
2612 if (list_length (a1
) < list_length (a2
))
2613 attributes
= a2
, a2
= a1
;
2615 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
2618 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2621 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2624 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
2629 a1
= copy_node (a2
);
2630 TREE_CHAIN (a1
) = attributes
;
2639 /* Given types T1 and T2, merge their attributes and return
2643 merge_type_attributes (t1
, t2
)
2646 return merge_attributes (TYPE_ATTRIBUTES (t1
),
2647 TYPE_ATTRIBUTES (t2
));
2650 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2654 merge_decl_attributes (olddecl
, newdecl
)
2655 tree olddecl
, newdecl
;
2657 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
2658 DECL_ATTRIBUTES (newdecl
));
2661 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2663 /* Specialization of merge_decl_attributes for various Windows targets.
2665 This handles the following situation:
2667 __declspec (dllimport) int foo;
2670 The second instance of `foo' nullifies the dllimport. */
2673 merge_dllimport_decl_attributes (old
, new)
2678 int delete_dllimport_p
;
2680 old
= DECL_ATTRIBUTES (old
);
2681 new = DECL_ATTRIBUTES (new);
2683 /* What we need to do here is remove from `old' dllimport if it doesn't
2684 appear in `new'. dllimport behaves like extern: if a declaration is
2685 marked dllimport and a definition appears later, then the object
2686 is not dllimport'd. */
2687 if (lookup_attribute ("dllimport", old
) != NULL_TREE
2688 && lookup_attribute ("dllimport", new) == NULL_TREE
)
2689 delete_dllimport_p
= 1;
2691 delete_dllimport_p
= 0;
2693 a
= merge_attributes (old
, new);
2695 if (delete_dllimport_p
)
2699 /* Scan the list for dllimport and delete it. */
2700 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
2702 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
2704 if (prev
== NULL_TREE
)
2707 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
2716 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2718 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2719 of the various TYPE_QUAL values. */
2722 set_type_quals (type
, type_quals
)
2726 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
2727 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
2728 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
2731 /* Return a version of the TYPE, qualified as indicated by the
2732 TYPE_QUALS, if one exists. If no qualified version exists yet,
2733 return NULL_TREE. */
2736 get_qualified_type (type
, type_quals
)
2742 /* Search the chain of variants to see if there is already one there just
2743 like the one we need to have. If so, use that existing one. We must
2744 preserve the TYPE_NAME, since there is code that depends on this. */
2745 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
2746 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
)
2747 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
))
2753 /* Like get_qualified_type, but creates the type if it does not
2754 exist. This function never returns NULL_TREE. */
2757 build_qualified_type (type
, type_quals
)
2763 /* See if we already have the appropriate qualified variant. */
2764 t
= get_qualified_type (type
, type_quals
);
2766 /* If not, build it. */
2769 t
= build_type_copy (type
);
2770 set_type_quals (t
, type_quals
);
2776 /* Create a new variant of TYPE, equivalent but distinct.
2777 This is so the caller can modify it. */
2780 build_type_copy (type
)
2783 tree t
, m
= TYPE_MAIN_VARIANT (type
);
2785 t
= copy_node (type
);
2787 TYPE_POINTER_TO (t
) = 0;
2788 TYPE_REFERENCE_TO (t
) = 0;
2790 /* Add this type to the chain of variants of TYPE. */
2791 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
2792 TYPE_NEXT_VARIANT (m
) = t
;
2797 /* Hashing of types so that we don't make duplicates.
2798 The entry point is `type_hash_canon'. */
2800 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2801 with types in the TREE_VALUE slots), by adding the hash codes
2802 of the individual types. */
2805 type_hash_list (list
)
2808 unsigned int hashcode
;
2811 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2812 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
2817 /* These are the Hashtable callback functions. */
2819 /* Returns true if the types are equal. */
2822 type_hash_eq (va
, vb
)
2826 const struct type_hash
*a
= va
, *b
= vb
;
2827 if (a
->hash
== b
->hash
2828 && TREE_CODE (a
->type
) == TREE_CODE (b
->type
)
2829 && TREE_TYPE (a
->type
) == TREE_TYPE (b
->type
)
2830 && attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
2831 TYPE_ATTRIBUTES (b
->type
))
2832 && TYPE_ALIGN (a
->type
) == TYPE_ALIGN (b
->type
)
2833 && (TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
2834 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
2835 TYPE_MAX_VALUE (b
->type
)))
2836 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
2837 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
2838 TYPE_MIN_VALUE (b
->type
)))
2839 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
2840 && (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
2841 || (TYPE_DOMAIN (a
->type
)
2842 && TREE_CODE (TYPE_DOMAIN (a
->type
)) == TREE_LIST
2843 && TYPE_DOMAIN (b
->type
)
2844 && TREE_CODE (TYPE_DOMAIN (b
->type
)) == TREE_LIST
2845 && type_list_equal (TYPE_DOMAIN (a
->type
),
2846 TYPE_DOMAIN (b
->type
)))))
2851 /* Return the cached hash value. */
2854 type_hash_hash (item
)
2857 return ((const struct type_hash
*) item
)->hash
;
2860 /* Look in the type hash table for a type isomorphic to TYPE.
2861 If one is found, return it. Otherwise return 0. */
2864 type_hash_lookup (hashcode
, type
)
2865 unsigned int hashcode
;
2868 struct type_hash
*h
, in
;
2870 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
2871 must call that routine before comparing TYPE_ALIGNs. */
2877 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
2883 /* Add an entry to the type-hash-table
2884 for a type TYPE whose hash code is HASHCODE. */
2887 type_hash_add (hashcode
, type
)
2888 unsigned int hashcode
;
2891 struct type_hash
*h
;
2894 h
= (struct type_hash
*) ggc_alloc (sizeof (struct type_hash
));
2897 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
2898 *(struct type_hash
**) loc
= h
;
2901 /* Given TYPE, and HASHCODE its hash code, return the canonical
2902 object for an identical type if one already exists.
2903 Otherwise, return TYPE, and record it as the canonical object
2904 if it is a permanent object.
2906 To use this function, first create a type of the sort you want.
2907 Then compute its hash code from the fields of the type that
2908 make it different from other similar types.
2909 Then call this function and use the value.
2910 This function frees the type you pass in if it is a duplicate. */
2912 /* Set to 1 to debug without canonicalization. Never set by program. */
2913 int debug_no_type_hash
= 0;
2916 type_hash_canon (hashcode
, type
)
2917 unsigned int hashcode
;
2922 if (debug_no_type_hash
)
2925 /* See if the type is in the hash table already. If so, return it.
2926 Otherwise, add the type. */
2927 t1
= type_hash_lookup (hashcode
, type
);
2930 #ifdef GATHER_STATISTICS
2931 tree_node_counts
[(int) t_kind
]--;
2932 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
2938 type_hash_add (hashcode
, type
);
2943 /* See if the data pointed to by the type hash table is marked. We consider
2944 it marked if the type is marked or if a debug type number or symbol
2945 table entry has been made for the type. This reduces the amount of
2946 debugging output and eliminates that dependency of the debug output on
2947 the number of garbage collections. */
2950 type_hash_marked_p (p
)
2953 tree type
= ((struct type_hash
*) p
)->type
;
2955 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
2959 print_type_hash_statistics ()
2961 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
2962 (long) htab_size (type_hash_table
),
2963 (long) htab_elements (type_hash_table
),
2964 htab_collisions (type_hash_table
));
2967 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
2968 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
2969 by adding the hash codes of the individual attributes. */
2972 attribute_hash_list (list
)
2975 unsigned int hashcode
;
2978 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2979 /* ??? Do we want to add in TREE_VALUE too? */
2980 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
2984 /* Given two lists of attributes, return true if list l2 is
2985 equivalent to l1. */
2988 attribute_list_equal (l1
, l2
)
2991 return attribute_list_contained (l1
, l2
)
2992 && attribute_list_contained (l2
, l1
);
2995 /* Given two lists of attributes, return true if list L2 is
2996 completely contained within L1. */
2997 /* ??? This would be faster if attribute names were stored in a canonicalized
2998 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
2999 must be used to show these elements are equivalent (which they are). */
3000 /* ??? It's not clear that attributes with arguments will always be handled
3004 attribute_list_contained (l1
, l2
)
3009 /* First check the obvious, maybe the lists are identical. */
3013 /* Maybe the lists are similar. */
3014 for (t1
= l1
, t2
= l2
;
3016 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3017 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3018 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3020 /* Maybe the lists are equal. */
3021 if (t1
== 0 && t2
== 0)
3024 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3027 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3029 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3032 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3039 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3046 /* Given two lists of types
3047 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3048 return 1 if the lists contain the same types in the same order.
3049 Also, the TREE_PURPOSEs must match. */
3052 type_list_equal (l1
, l2
)
3057 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3058 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3059 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3060 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3061 && (TREE_TYPE (TREE_PURPOSE (t1
))
3062 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3068 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3069 given by TYPE. If the argument list accepts variable arguments,
3070 then this function counts only the ordinary arguments. */
3073 type_num_arguments (type
)
3079 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3080 /* If the function does not take a variable number of arguments,
3081 the last element in the list will have type `void'. */
3082 if (VOID_TYPE_P (TREE_VALUE (t
)))
3090 /* Nonzero if integer constants T1 and T2
3091 represent the same constant value. */
3094 tree_int_cst_equal (t1
, t2
)
3100 if (t1
== 0 || t2
== 0)
3103 if (TREE_CODE (t1
) == INTEGER_CST
3104 && TREE_CODE (t2
) == INTEGER_CST
3105 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3106 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3112 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3113 The precise way of comparison depends on their data type. */
3116 tree_int_cst_lt (t1
, t2
)
3122 if (TREE_UNSIGNED (TREE_TYPE (t1
)) != TREE_UNSIGNED (TREE_TYPE (t2
)))
3124 int t1_sgn
= tree_int_cst_sgn (t1
);
3125 int t2_sgn
= tree_int_cst_sgn (t2
);
3127 if (t1_sgn
< t2_sgn
)
3129 else if (t1_sgn
> t2_sgn
)
3131 /* Otherwise, both are non-negative, so we compare them as
3132 unsigned just in case one of them would overflow a signed
3135 else if (! TREE_UNSIGNED (TREE_TYPE (t1
)))
3136 return INT_CST_LT (t1
, t2
);
3138 return INT_CST_LT_UNSIGNED (t1
, t2
);
3141 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3144 tree_int_cst_compare (t1
, t2
)
3148 if (tree_int_cst_lt (t1
, t2
))
3150 else if (tree_int_cst_lt (t2
, t1
))
3156 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3157 the host. If POS is zero, the value can be represented in a single
3158 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3159 be represented in a single unsigned HOST_WIDE_INT. */
3162 host_integerp (t
, pos
)
3166 return (TREE_CODE (t
) == INTEGER_CST
3167 && ! TREE_OVERFLOW (t
)
3168 && ((TREE_INT_CST_HIGH (t
) == 0
3169 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3170 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3171 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3172 && ! TREE_UNSIGNED (TREE_TYPE (t
)))
3173 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3176 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3177 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3178 be positive. Abort if we cannot satisfy the above conditions. */
3181 tree_low_cst (t
, pos
)
3185 if (host_integerp (t
, pos
))
3186 return TREE_INT_CST_LOW (t
);
3191 /* Return an indication of the sign of the integer constant T.
3192 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3193 Note that -1 will never be returned it T's type is unsigned. */
3196 tree_int_cst_sgn (t
)
3199 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3201 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3203 else if (TREE_INT_CST_HIGH (t
) < 0)
3209 /* Compare two constructor-element-type constants. Return 1 if the lists
3210 are known to be equal; otherwise return 0. */
3213 simple_cst_list_equal (l1
, l2
)
3216 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3218 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3221 l1
= TREE_CHAIN (l1
);
3222 l2
= TREE_CHAIN (l2
);
3228 /* Return truthvalue of whether T1 is the same tree structure as T2.
3229 Return 1 if they are the same.
3230 Return 0 if they are understandably different.
3231 Return -1 if either contains tree structure not understood by
3235 simple_cst_equal (t1
, t2
)
3238 enum tree_code code1
, code2
;
3244 if (t1
== 0 || t2
== 0)
3247 code1
= TREE_CODE (t1
);
3248 code2
= TREE_CODE (t2
);
3250 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3252 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3253 || code2
== NON_LVALUE_EXPR
)
3254 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3256 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3259 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3260 || code2
== NON_LVALUE_EXPR
)
3261 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3269 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3270 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3273 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3276 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3277 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3278 TREE_STRING_LENGTH (t1
)));
3281 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
3287 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3290 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3294 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3297 /* Special case: if either target is an unallocated VAR_DECL,
3298 it means that it's going to be unified with whatever the
3299 TARGET_EXPR is really supposed to initialize, so treat it
3300 as being equivalent to anything. */
3301 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3302 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3303 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3304 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3305 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3306 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3309 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3314 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3316 case WITH_CLEANUP_EXPR
:
3317 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3321 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3324 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3325 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3339 /* This general rule works for most tree codes. All exceptions should be
3340 handled above. If this is a language-specific tree code, we can't
3341 trust what might be in the operand, so say we don't know
3343 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3346 switch (TREE_CODE_CLASS (code1
))
3355 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3357 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3369 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3370 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3371 than U, respectively. */
3374 compare_tree_int (t
, u
)
3376 unsigned HOST_WIDE_INT u
;
3378 if (tree_int_cst_sgn (t
) < 0)
3380 else if (TREE_INT_CST_HIGH (t
) != 0)
3382 else if (TREE_INT_CST_LOW (t
) == u
)
3384 else if (TREE_INT_CST_LOW (t
) < u
)
3390 /* Constructors for pointer, array and function types.
3391 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3392 constructed by language-dependent code, not here.) */
3394 /* Construct, lay out and return the type of pointers to TO_TYPE
3395 with mode MODE. If such a type has already been constructed,
3399 build_pointer_type_for_mode (to_type
, mode
)
3401 enum machine_mode mode
;
3403 tree t
= TYPE_POINTER_TO (to_type
);
3405 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3406 if (t
!= 0 && mode
== ptr_mode
)
3409 t
= make_node (POINTER_TYPE
);
3411 TREE_TYPE (t
) = to_type
;
3412 TYPE_MODE (t
) = mode
;
3414 /* Record this type as the pointer to TO_TYPE. */
3415 if (mode
== ptr_mode
)
3416 TYPE_POINTER_TO (to_type
) = t
;
3418 /* Lay out the type. This function has many callers that are concerned
3419 with expression-construction, and this simplifies them all.
3420 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3426 /* By default build pointers in ptr_mode. */
3429 build_pointer_type (to_type
)
3432 return build_pointer_type_for_mode (to_type
, ptr_mode
);
3435 /* Construct, lay out and return the type of references to TO_TYPE
3436 with mode MODE. If such a type has already been constructed,
3440 build_reference_type_for_mode (to_type
, mode
)
3442 enum machine_mode mode
;
3444 tree t
= TYPE_REFERENCE_TO (to_type
);
3446 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3447 if (t
!= 0 && mode
== ptr_mode
)
3450 t
= make_node (REFERENCE_TYPE
);
3452 TREE_TYPE (t
) = to_type
;
3453 TYPE_MODE (t
) = mode
;
3455 /* Record this type as the pointer to TO_TYPE. */
3456 if (mode
== ptr_mode
)
3457 TYPE_REFERENCE_TO (to_type
) = t
;
3465 /* Build the node for the type of references-to-TO_TYPE by default
3469 build_reference_type (to_type
)
3472 return build_reference_type_for_mode (to_type
, ptr_mode
);
3475 /* Build a type that is compatible with t but has no cv quals anywhere
3478 const char *const *const * -> char ***. */
3481 build_type_no_quals (t
)
3484 switch (TREE_CODE (t
))
3487 return build_pointer_type (build_type_no_quals (TREE_TYPE (t
)));
3488 case REFERENCE_TYPE
:
3489 return build_reference_type (build_type_no_quals (TREE_TYPE (t
)));
3491 return TYPE_MAIN_VARIANT (t
);
3495 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3496 MAXVAL should be the maximum value in the domain
3497 (one less than the length of the array).
3499 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3500 We don't enforce this limit, that is up to caller (e.g. language front end).
3501 The limit exists because the result is a signed type and we don't handle
3502 sizes that use more than one HOST_WIDE_INT. */
3505 build_index_type (maxval
)
3508 tree itype
= make_node (INTEGER_TYPE
);
3510 TREE_TYPE (itype
) = sizetype
;
3511 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
3512 TYPE_MIN_VALUE (itype
) = size_zero_node
;
3513 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
3514 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
3515 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
3516 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
3517 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
3518 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
3520 if (host_integerp (maxval
, 1))
3521 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
3526 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3527 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3528 low bound LOWVAL and high bound HIGHVAL.
3529 if TYPE==NULL_TREE, sizetype is used. */
3532 build_range_type (type
, lowval
, highval
)
3533 tree type
, lowval
, highval
;
3535 tree itype
= make_node (INTEGER_TYPE
);
3537 TREE_TYPE (itype
) = type
;
3538 if (type
== NULL_TREE
)
3541 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
3542 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
3544 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
3545 TYPE_MODE (itype
) = TYPE_MODE (type
);
3546 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
3547 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
3548 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
3549 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
3551 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
3552 return type_hash_canon (tree_low_cst (highval
, 0)
3553 - tree_low_cst (lowval
, 0),
3559 /* Just like build_index_type, but takes lowval and highval instead
3560 of just highval (maxval). */
3563 build_index_2_type (lowval
, highval
)
3564 tree lowval
, highval
;
3566 return build_range_type (sizetype
, lowval
, highval
);
3569 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3570 and number of elements specified by the range of values of INDEX_TYPE.
3571 If such a type has already been constructed, reuse it. */
3574 build_array_type (elt_type
, index_type
)
3575 tree elt_type
, index_type
;
3578 unsigned int hashcode
;
3580 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
3582 error ("arrays of functions are not meaningful");
3583 elt_type
= integer_type_node
;
3586 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3587 build_pointer_type (elt_type
);
3589 /* Allocate the array after the pointer type,
3590 in case we free it in type_hash_canon. */
3591 t
= make_node (ARRAY_TYPE
);
3592 TREE_TYPE (t
) = elt_type
;
3593 TYPE_DOMAIN (t
) = index_type
;
3595 if (index_type
== 0)
3600 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
3601 t
= type_hash_canon (hashcode
, t
);
3603 if (!COMPLETE_TYPE_P (t
))
3608 /* Return the TYPE of the elements comprising
3609 the innermost dimension of ARRAY. */
3612 get_inner_array_type (array
)
3615 tree type
= TREE_TYPE (array
);
3617 while (TREE_CODE (type
) == ARRAY_TYPE
)
3618 type
= TREE_TYPE (type
);
3623 /* Construct, lay out and return
3624 the type of functions returning type VALUE_TYPE
3625 given arguments of types ARG_TYPES.
3626 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3627 are data type nodes for the arguments of the function.
3628 If such a type has already been constructed, reuse it. */
3631 build_function_type (value_type
, arg_types
)
3632 tree value_type
, arg_types
;
3635 unsigned int hashcode
;
3637 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
3639 error ("function return type cannot be function");
3640 value_type
= integer_type_node
;
3643 /* Make a node of the sort we want. */
3644 t
= make_node (FUNCTION_TYPE
);
3645 TREE_TYPE (t
) = value_type
;
3646 TYPE_ARG_TYPES (t
) = arg_types
;
3648 /* If we already have such a type, use the old one and free this one. */
3649 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
3650 t
= type_hash_canon (hashcode
, t
);
3652 if (!COMPLETE_TYPE_P (t
))
3657 /* Build a function type. The RETURN_TYPE is the type retured by the
3658 function. If additional arguments are provided, they are
3659 additional argument types. The list of argument types must always
3660 be terminated by NULL_TREE. */
3663 build_function_type_list
VPARAMS ((tree return_type
, ...))
3667 VA_OPEN (p
, return_type
);
3668 VA_FIXEDARG (p
, tree
, return_type
);
3670 t
= va_arg (p
, tree
);
3671 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
3672 args
= tree_cons (NULL_TREE
, t
, args
);
3675 args
= nreverse (args
);
3676 TREE_CHAIN (last
) = void_list_node
;
3677 args
= build_function_type (return_type
, args
);
3683 /* Construct, lay out and return the type of methods belonging to class
3684 BASETYPE and whose arguments and values are described by TYPE.
3685 If that type exists already, reuse it.
3686 TYPE must be a FUNCTION_TYPE node. */
3689 build_method_type (basetype
, type
)
3690 tree basetype
, type
;
3693 unsigned int hashcode
;
3695 /* Make a node of the sort we want. */
3696 t
= make_node (METHOD_TYPE
);
3698 if (TREE_CODE (type
) != FUNCTION_TYPE
)
3701 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3702 TREE_TYPE (t
) = TREE_TYPE (type
);
3704 /* The actual arglist for this function includes a "hidden" argument
3705 which is "this". Put it into the list of argument types. */
3708 = tree_cons (NULL_TREE
,
3709 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
3711 /* If we already have such a type, use the old one and free this one. */
3712 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3713 t
= type_hash_canon (hashcode
, t
);
3715 if (!COMPLETE_TYPE_P (t
))
3721 /* Construct, lay out and return the type of offsets to a value
3722 of type TYPE, within an object of type BASETYPE.
3723 If a suitable offset type exists already, reuse it. */
3726 build_offset_type (basetype
, type
)
3727 tree basetype
, type
;
3730 unsigned int hashcode
;
3732 /* Make a node of the sort we want. */
3733 t
= make_node (OFFSET_TYPE
);
3735 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
3736 TREE_TYPE (t
) = type
;
3738 /* If we already have such a type, use the old one and free this one. */
3739 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
3740 t
= type_hash_canon (hashcode
, t
);
3742 if (!COMPLETE_TYPE_P (t
))
3748 /* Create a complex type whose components are COMPONENT_TYPE. */
3751 build_complex_type (component_type
)
3752 tree component_type
;
3755 unsigned int hashcode
;
3757 /* Make a node of the sort we want. */
3758 t
= make_node (COMPLEX_TYPE
);
3760 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
3761 set_type_quals (t
, TYPE_QUALS (component_type
));
3763 /* If we already have such a type, use the old one and free this one. */
3764 hashcode
= TYPE_HASH (component_type
);
3765 t
= type_hash_canon (hashcode
, t
);
3767 if (!COMPLETE_TYPE_P (t
))
3770 /* If we are writing Dwarf2 output we need to create a name,
3771 since complex is a fundamental type. */
3772 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
3776 if (component_type
== char_type_node
)
3777 name
= "complex char";
3778 else if (component_type
== signed_char_type_node
)
3779 name
= "complex signed char";
3780 else if (component_type
== unsigned_char_type_node
)
3781 name
= "complex unsigned char";
3782 else if (component_type
== short_integer_type_node
)
3783 name
= "complex short int";
3784 else if (component_type
== short_unsigned_type_node
)
3785 name
= "complex short unsigned int";
3786 else if (component_type
== integer_type_node
)
3787 name
= "complex int";
3788 else if (component_type
== unsigned_type_node
)
3789 name
= "complex unsigned int";
3790 else if (component_type
== long_integer_type_node
)
3791 name
= "complex long int";
3792 else if (component_type
== long_unsigned_type_node
)
3793 name
= "complex long unsigned int";
3794 else if (component_type
== long_long_integer_type_node
)
3795 name
= "complex long long int";
3796 else if (component_type
== long_long_unsigned_type_node
)
3797 name
= "complex long long unsigned int";
3802 TYPE_NAME (t
) = get_identifier (name
);
3808 /* Return OP, stripped of any conversions to wider types as much as is safe.
3809 Converting the value back to OP's type makes a value equivalent to OP.
3811 If FOR_TYPE is nonzero, we return a value which, if converted to
3812 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
3814 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
3815 narrowest type that can hold the value, even if they don't exactly fit.
3816 Otherwise, bit-field references are changed to a narrower type
3817 only if they can be fetched directly from memory in that type.
3819 OP must have integer, real or enumeral type. Pointers are not allowed!
3821 There are some cases where the obvious value we could return
3822 would regenerate to OP if converted to OP's type,
3823 but would not extend like OP to wider types.
3824 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
3825 For example, if OP is (unsigned short)(signed char)-1,
3826 we avoid returning (signed char)-1 if FOR_TYPE is int,
3827 even though extending that to an unsigned short would regenerate OP,
3828 since the result of extending (signed char)-1 to (int)
3829 is different from (int) OP. */
3832 get_unwidened (op
, for_type
)
3836 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
3837 tree type
= TREE_TYPE (op
);
3839 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
3841 = (for_type
!= 0 && for_type
!= type
3842 && final_prec
> TYPE_PRECISION (type
)
3843 && TREE_UNSIGNED (type
));
3846 while (TREE_CODE (op
) == NOP_EXPR
)
3849 = TYPE_PRECISION (TREE_TYPE (op
))
3850 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
3852 /* Truncations are many-one so cannot be removed.
3853 Unless we are later going to truncate down even farther. */
3855 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
3858 /* See what's inside this conversion. If we decide to strip it,
3860 op
= TREE_OPERAND (op
, 0);
3862 /* If we have not stripped any zero-extensions (uns is 0),
3863 we can strip any kind of extension.
3864 If we have previously stripped a zero-extension,
3865 only zero-extensions can safely be stripped.
3866 Any extension can be stripped if the bits it would produce
3867 are all going to be discarded later by truncating to FOR_TYPE. */
3871 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
3873 /* TREE_UNSIGNED says whether this is a zero-extension.
3874 Let's avoid computing it if it does not affect WIN
3875 and if UNS will not be needed again. */
3876 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
3877 && TREE_UNSIGNED (TREE_TYPE (op
)))
3885 if (TREE_CODE (op
) == COMPONENT_REF
3886 /* Since type_for_size always gives an integer type. */
3887 && TREE_CODE (type
) != REAL_TYPE
3888 /* Don't crash if field not laid out yet. */
3889 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
3890 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
3892 unsigned int innerprec
3893 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
3894 int unsignedp
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
3895 type
= (*lang_hooks
.types
.type_for_size
) (innerprec
, unsignedp
);
3897 /* We can get this structure field in the narrowest type it fits in.
3898 If FOR_TYPE is 0, do this only for a field that matches the
3899 narrower type exactly and is aligned for it
3900 The resulting extension to its nominal type (a fullword type)
3901 must fit the same conditions as for other extensions. */
3903 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
3904 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
3905 && (! uns
|| final_prec
<= innerprec
|| unsignedp
)
3908 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
3909 TREE_OPERAND (op
, 1));
3910 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
3911 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
3918 /* Return OP or a simpler expression for a narrower value
3919 which can be sign-extended or zero-extended to give back OP.
3920 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3921 or 0 if the value should be sign-extended. */
3924 get_narrower (op
, unsignedp_ptr
)
3932 while (TREE_CODE (op
) == NOP_EXPR
)
3935 = (TYPE_PRECISION (TREE_TYPE (op
))
3936 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
3938 /* Truncations are many-one so cannot be removed. */
3942 /* See what's inside this conversion. If we decide to strip it,
3944 op
= TREE_OPERAND (op
, 0);
3948 /* An extension: the outermost one can be stripped,
3949 but remember whether it is zero or sign extension. */
3951 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
3952 /* Otherwise, if a sign extension has been stripped,
3953 only sign extensions can now be stripped;
3954 if a zero extension has been stripped, only zero-extensions. */
3955 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
3959 else /* bitschange == 0 */
3961 /* A change in nominal type can always be stripped, but we must
3962 preserve the unsignedness. */
3964 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
3971 if (TREE_CODE (op
) == COMPONENT_REF
3972 /* Since type_for_size always gives an integer type. */
3973 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
3974 /* Ensure field is laid out already. */
3975 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
3977 unsigned HOST_WIDE_INT innerprec
3978 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
3979 tree type
= (*lang_hooks
.types
.type_for_size
) (innerprec
,
3980 TREE_UNSIGNED (op
));
3982 /* We can get this structure field in a narrower type that fits it,
3983 but the resulting extension to its nominal type (a fullword type)
3984 must satisfy the same conditions as for other extensions.
3986 Do this only for fields that are aligned (not bit-fields),
3987 because when bit-field insns will be used there is no
3988 advantage in doing this. */
3990 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
3991 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
3992 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
3996 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
3997 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
3998 TREE_OPERAND (op
, 1));
3999 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4000 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4003 *unsignedp_ptr
= uns
;
4007 /* Nonzero if integer constant C has a value that is permissible
4008 for type TYPE (an INTEGER_TYPE). */
4011 int_fits_type_p (c
, type
)
4014 /* If the bounds of the type are integers, we can check ourselves.
4015 If not, but this type is a subtype, try checking against that.
4016 Otherwise, use force_fit_type, which checks against the precision. */
4017 if (TYPE_MAX_VALUE (type
) != NULL_TREE
4018 && TYPE_MIN_VALUE (type
) != NULL_TREE
4019 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4020 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
4022 if (TREE_UNSIGNED (type
))
4023 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
)
4024 && ! INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
))
4025 /* Negative ints never fit unsigned types. */
4026 && ! (TREE_INT_CST_HIGH (c
) < 0
4027 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4029 return (! INT_CST_LT (TYPE_MAX_VALUE (type
), c
)
4030 && ! INT_CST_LT (c
, TYPE_MIN_VALUE (type
))
4031 /* Unsigned ints with top bit set never fit signed types. */
4032 && ! (TREE_INT_CST_HIGH (c
) < 0
4033 && TREE_UNSIGNED (TREE_TYPE (c
))));
4035 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4036 return int_fits_type_p (c
, TREE_TYPE (type
));
4040 TREE_TYPE (c
) = type
;
4041 return !force_fit_type (c
, 0);
4045 /* Returns true if T is, contains, or refers to a type with variable
4046 size. This concept is more general than that of C99 'variably
4047 modified types': in C99, a struct type is never variably modified
4048 because a VLA may not appear as a structure member. However, in
4051 struct S { int i[f()]; };
4053 is valid, and other languages may define similar constructs. */
4056 variably_modified_type_p (type
)
4059 if (type
== error_mark_node
)
4062 /* If TYPE itself has variable size, it is variably modified.
4064 We do not yet have a representation of the C99 '[*]' syntax.
4065 When a representation is chosen, this function should be modified
4066 to test for that case as well. */
4067 if (TYPE_SIZE (type
)
4068 && TYPE_SIZE (type
) != error_mark_node
4069 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4072 /* If TYPE is a pointer or reference, it is variably modified if
4073 the type pointed to is variably modified. */
4074 if ((TREE_CODE (type
) == POINTER_TYPE
4075 || TREE_CODE (type
) == REFERENCE_TYPE
)
4076 && variably_modified_type_p (TREE_TYPE (type
)))
4079 /* If TYPE is an array, it is variably modified if the array
4080 elements are. (Note that the VLA case has already been checked
4082 if (TREE_CODE (type
) == ARRAY_TYPE
4083 && variably_modified_type_p (TREE_TYPE (type
)))
4086 /* If TYPE is a function type, it is variably modified if any of the
4087 parameters or the return type are variably modified. */
4088 if (TREE_CODE (type
) == FUNCTION_TYPE
4089 || TREE_CODE (type
) == METHOD_TYPE
)
4093 if (variably_modified_type_p (TREE_TYPE (type
)))
4095 for (parm
= TYPE_ARG_TYPES (type
);
4096 parm
&& parm
!= void_list_node
;
4097 parm
= TREE_CHAIN (parm
))
4098 if (variably_modified_type_p (TREE_VALUE (parm
)))
4102 /* The current language may have other cases to check, but in general,
4103 all other types are not variably modified. */
4104 return (*lang_hooks
.tree_inlining
.var_mod_type_p
) (type
);
4107 /* Given a DECL or TYPE, return the scope in which it was declared, or
4108 NULL_TREE if there is no containing scope. */
4111 get_containing_scope (t
)
4114 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4117 /* Return the innermost context enclosing DECL that is
4118 a FUNCTION_DECL, or zero if none. */
4121 decl_function_context (decl
)
4126 if (TREE_CODE (decl
) == ERROR_MARK
)
4129 if (TREE_CODE (decl
) == SAVE_EXPR
)
4130 context
= SAVE_EXPR_CONTEXT (decl
);
4132 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4133 where we look up the function at runtime. Such functions always take
4134 a first argument of type 'pointer to real context'.
4136 C++ should really be fixed to use DECL_CONTEXT for the real context,
4137 and use something else for the "virtual context". */
4138 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4141 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4143 context
= DECL_CONTEXT (decl
);
4145 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4147 if (TREE_CODE (context
) == BLOCK
)
4148 context
= BLOCK_SUPERCONTEXT (context
);
4150 context
= get_containing_scope (context
);
4156 /* Return the innermost context enclosing DECL that is
4157 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4158 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4161 decl_type_context (decl
)
4164 tree context
= DECL_CONTEXT (decl
);
4168 if (TREE_CODE (context
) == NAMESPACE_DECL
)
4171 if (TREE_CODE (context
) == RECORD_TYPE
4172 || TREE_CODE (context
) == UNION_TYPE
4173 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4176 if (TREE_CODE (context
) == TYPE_DECL
4177 || TREE_CODE (context
) == FUNCTION_DECL
)
4178 context
= DECL_CONTEXT (context
);
4180 else if (TREE_CODE (context
) == BLOCK
)
4181 context
= BLOCK_SUPERCONTEXT (context
);
4184 /* Unhandled CONTEXT!? */
4190 /* CALL is a CALL_EXPR. Return the declaration for the function
4191 called, or NULL_TREE if the called function cannot be
4195 get_callee_fndecl (call
)
4200 /* It's invalid to call this function with anything but a
4202 if (TREE_CODE (call
) != CALL_EXPR
)
4205 /* The first operand to the CALL is the address of the function
4207 addr
= TREE_OPERAND (call
, 0);
4211 /* If this is a readonly function pointer, extract its initial value. */
4212 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
4213 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
4214 && DECL_INITIAL (addr
))
4215 addr
= DECL_INITIAL (addr
);
4217 /* If the address is just `&f' for some function `f', then we know
4218 that `f' is being called. */
4219 if (TREE_CODE (addr
) == ADDR_EXPR
4220 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4221 return TREE_OPERAND (addr
, 0);
4223 /* We couldn't figure out what was being called. */
4227 /* Print debugging information about the obstack O, named STR. */
4230 print_obstack_statistics (str
, o
)
4234 struct _obstack_chunk
*chunk
= o
->chunk
;
4238 n_alloc
+= o
->next_free
- chunk
->contents
;
4239 chunk
= chunk
->prev
;
4243 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4244 chunk
= chunk
->prev
;
4246 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
4247 str
, n_alloc
, n_chunks
);
4250 /* Print debugging information about tree nodes generated during the compile,
4251 and any language-specific information. */
4254 dump_tree_statistics ()
4256 #ifdef GATHER_STATISTICS
4258 int total_nodes
, total_bytes
;
4261 fprintf (stderr
, "\n??? tree nodes created\n\n");
4262 #ifdef GATHER_STATISTICS
4263 fprintf (stderr
, "Kind Nodes Bytes\n");
4264 fprintf (stderr
, "-------------------------------------\n");
4265 total_nodes
= total_bytes
= 0;
4266 for (i
= 0; i
< (int) all_kinds
; i
++)
4268 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4269 tree_node_counts
[i
], tree_node_sizes
[i
]);
4270 total_nodes
+= tree_node_counts
[i
];
4271 total_bytes
+= tree_node_sizes
[i
];
4273 fprintf (stderr
, "-------------------------------------\n");
4274 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4275 fprintf (stderr
, "-------------------------------------\n");
4277 fprintf (stderr
, "(No per-node statistics)\n");
4279 print_type_hash_statistics ();
4280 (*lang_hooks
.print_statistics
) ();
4283 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4285 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4286 clashes in cases where we can't reliably choose a unique name.
4288 Derived from mkstemp.c in libiberty. */
4291 append_random_chars (template)
4294 static const char letters
[]
4295 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4296 static unsigned HOST_WIDE_INT value
;
4297 unsigned HOST_WIDE_INT v
;
4303 /* VALUE should be unique for each file and must not change between
4304 compiles since this can cause bootstrap comparison errors. */
4306 if (stat (main_input_filename
, &st
) < 0)
4308 /* This can happen when preprocessed text is shipped between
4309 machines, e.g. with bug reports. Assume that uniqueness
4310 isn't actually an issue. */
4315 /* In VMS, ino is an array, so we have to use both values. We
4316 conditionalize that. */
4318 #define INO_TO_INT(INO) ((int) (INO)[1] << 16 ^ (int) (INO)[2])
4320 #define INO_TO_INT(INO) INO
4322 value
= st
.st_dev
^ INO_TO_INT (st
.st_ino
) ^ st
.st_mtime
;
4326 template += strlen (template);
4330 /* Fill in the random bits. */
4331 template[0] = letters
[v
% 62];
4333 template[1] = letters
[v
% 62];
4335 template[2] = letters
[v
% 62];
4337 template[3] = letters
[v
% 62];
4339 template[4] = letters
[v
% 62];
4341 template[5] = letters
[v
% 62];
4346 /* P is a string that will be used in a symbol. Mask out any characters
4347 that are not valid in that context. */
4350 clean_symbol_name (p
)
4355 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4358 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4365 /* Generate a name for a function unique to this translation unit.
4366 TYPE is some string to identify the purpose of this function to the
4367 linker or collect2. */
4370 get_file_function_name_long (type
)
4377 if (first_global_object_name
)
4378 p
= first_global_object_name
;
4381 /* We don't have anything that we know to be unique to this translation
4382 unit, so use what we do have and throw in some randomness. */
4384 const char *name
= weak_global_object_name
;
4385 const char *file
= main_input_filename
;
4390 file
= input_filename
;
4392 q
= (char *) alloca (7 + strlen (name
) + strlen (file
));
4394 sprintf (q
, "%s%s", name
, file
);
4395 append_random_chars (q
);
4399 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
4402 /* Set up the name of the file-level functions we may need.
4403 Use a global object (which is already required to be unique over
4404 the program) rather than the file name (which imposes extra
4406 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
4408 /* Don't need to pull weird characters out of global names. */
4409 if (p
!= first_global_object_name
)
4410 clean_symbol_name (buf
+ 11);
4412 return get_identifier (buf
);
4415 /* If KIND=='I', return a suitable global initializer (constructor) name.
4416 If KIND=='D', return a suitable global clean-up (destructor) name. */
4419 get_file_function_name (kind
)
4427 return get_file_function_name_long (p
);
4430 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4431 The result is placed in BUFFER (which has length BIT_SIZE),
4432 with one bit in each char ('\000' or '\001').
4434 If the constructor is constant, NULL_TREE is returned.
4435 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4438 get_set_constructor_bits (init
, buffer
, bit_size
)
4445 HOST_WIDE_INT domain_min
4446 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
4447 tree non_const_bits
= NULL_TREE
;
4449 for (i
= 0; i
< bit_size
; i
++)
4452 for (vals
= TREE_OPERAND (init
, 1);
4453 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4455 if (!host_integerp (TREE_VALUE (vals
), 0)
4456 || (TREE_PURPOSE (vals
) != NULL_TREE
4457 && !host_integerp (TREE_PURPOSE (vals
), 0)))
4459 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4460 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4462 /* Set a range of bits to ones. */
4463 HOST_WIDE_INT lo_index
4464 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
4465 HOST_WIDE_INT hi_index
4466 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4468 if (lo_index
< 0 || lo_index
>= bit_size
4469 || hi_index
< 0 || hi_index
>= bit_size
)
4471 for (; lo_index
<= hi_index
; lo_index
++)
4472 buffer
[lo_index
] = 1;
4476 /* Set a single bit to one. */
4478 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4479 if (index
< 0 || index
>= bit_size
)
4481 error ("invalid initializer for bit string");
4487 return non_const_bits
;
4490 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4491 The result is placed in BUFFER (which is an array of bytes).
4492 If the constructor is constant, NULL_TREE is returned.
4493 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4496 get_set_constructor_bytes (init
, buffer
, wd_size
)
4498 unsigned char *buffer
;
4502 int set_word_size
= BITS_PER_UNIT
;
4503 int bit_size
= wd_size
* set_word_size
;
4505 unsigned char *bytep
= buffer
;
4506 char *bit_buffer
= (char *) alloca (bit_size
);
4507 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4509 for (i
= 0; i
< wd_size
; i
++)
4512 for (i
= 0; i
< bit_size
; i
++)
4516 if (BYTES_BIG_ENDIAN
)
4517 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4519 *bytep
|= 1 << bit_pos
;
4522 if (bit_pos
>= set_word_size
)
4523 bit_pos
= 0, bytep
++;
4525 return non_const_bits
;
4528 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4529 /* Complain that the tree code of NODE does not match the expected CODE.
4530 FILE, LINE, and FUNCTION are of the caller. */
4533 tree_check_failed (node
, code
, file
, line
, function
)
4535 enum tree_code code
;
4538 const char *function
;
4540 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4541 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
4542 function
, trim_filename (file
), line
);
4545 /* Similar to above, except that we check for a class of tree
4546 code, given in CL. */
4549 tree_class_check_failed (node
, cl
, file
, line
, function
)
4554 const char *function
;
4557 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4558 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
4559 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
4562 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
4563 (dynamically sized) vector. */
4566 tree_vec_elt_check_failed (idx
, len
, file
, line
, function
)
4571 const char *function
;
4574 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
4575 idx
+ 1, len
, function
, trim_filename (file
), line
);
4578 #endif /* ENABLE_TREE_CHECKING */
4580 /* For a new vector type node T, build the information necessary for
4581 debugging output. */
4584 finish_vector_type (t
)
4590 tree index
= build_int_2 (TYPE_VECTOR_SUBPARTS (t
) - 1, 0);
4591 tree array
= build_array_type (TREE_TYPE (t
),
4592 build_index_type (index
));
4593 tree rt
= make_node (RECORD_TYPE
);
4595 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
4596 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
4598 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
4599 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4600 the representation type, and we want to find that die when looking up
4601 the vector type. This is most easily achieved by making the TYPE_UID
4603 TYPE_UID (rt
) = TYPE_UID (t
);
4607 /* Create nodes for all integer types (and error_mark_node) using the sizes
4608 of C datatypes. The caller should call set_sizetype soon after calling
4609 this function to select one of the types as sizetype. */
4612 build_common_tree_nodes (signed_char
)
4615 error_mark_node
= make_node (ERROR_MARK
);
4616 TREE_TYPE (error_mark_node
) = error_mark_node
;
4618 initialize_sizetypes ();
4620 /* Define both `signed char' and `unsigned char'. */
4621 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
4622 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
4624 /* Define `char', which is like either `signed char' or `unsigned char'
4625 but not the same as either. */
4628 ? make_signed_type (CHAR_TYPE_SIZE
)
4629 : make_unsigned_type (CHAR_TYPE_SIZE
));
4631 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
4632 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
4633 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
4634 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
4635 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
4636 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
4637 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
4638 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
4640 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
4641 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
4642 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
4643 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
4644 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
4646 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
4647 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
4648 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
4649 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
4650 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
4653 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4654 It will create several other common tree nodes. */
4657 build_common_tree_nodes_2 (short_double
)
4660 /* Define these next since types below may used them. */
4661 integer_zero_node
= build_int_2 (0, 0);
4662 integer_one_node
= build_int_2 (1, 0);
4663 integer_minus_one_node
= build_int_2 (-1, -1);
4665 size_zero_node
= size_int (0);
4666 size_one_node
= size_int (1);
4667 bitsize_zero_node
= bitsize_int (0);
4668 bitsize_one_node
= bitsize_int (1);
4669 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
4671 void_type_node
= make_node (VOID_TYPE
);
4672 layout_type (void_type_node
);
4674 /* We are not going to have real types in C with less than byte alignment,
4675 so we might as well not have any types that claim to have it. */
4676 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
4677 TYPE_USER_ALIGN (void_type_node
) = 0;
4679 null_pointer_node
= build_int_2 (0, 0);
4680 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
4681 layout_type (TREE_TYPE (null_pointer_node
));
4683 ptr_type_node
= build_pointer_type (void_type_node
);
4685 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
4687 float_type_node
= make_node (REAL_TYPE
);
4688 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
4689 layout_type (float_type_node
);
4691 double_type_node
= make_node (REAL_TYPE
);
4693 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
4695 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
4696 layout_type (double_type_node
);
4698 long_double_type_node
= make_node (REAL_TYPE
);
4699 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
4700 layout_type (long_double_type_node
);
4702 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
4703 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
4704 layout_type (complex_integer_type_node
);
4706 complex_float_type_node
= make_node (COMPLEX_TYPE
);
4707 TREE_TYPE (complex_float_type_node
) = float_type_node
;
4708 layout_type (complex_float_type_node
);
4710 complex_double_type_node
= make_node (COMPLEX_TYPE
);
4711 TREE_TYPE (complex_double_type_node
) = double_type_node
;
4712 layout_type (complex_double_type_node
);
4714 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
4715 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
4716 layout_type (complex_long_double_type_node
);
4720 BUILD_VA_LIST_TYPE (t
);
4722 /* Many back-ends define record types without seting TYPE_NAME.
4723 If we copied the record type here, we'd keep the original
4724 record type without a name. This breaks name mangling. So,
4725 don't copy record types and let c_common_nodes_and_builtins()
4726 declare the type to be __builtin_va_list. */
4727 if (TREE_CODE (t
) != RECORD_TYPE
)
4728 t
= build_type_copy (t
);
4730 va_list_type_node
= t
;
4733 unsigned_V4SI_type_node
4734 = make_vector (V4SImode
, unsigned_intSI_type_node
, 1);
4735 unsigned_V2HI_type_node
4736 = make_vector (V2HImode
, unsigned_intHI_type_node
, 1);
4737 unsigned_V2SI_type_node
4738 = make_vector (V2SImode
, unsigned_intSI_type_node
, 1);
4739 unsigned_V2DI_type_node
4740 = make_vector (V2DImode
, unsigned_intDI_type_node
, 1);
4741 unsigned_V4HI_type_node
4742 = make_vector (V4HImode
, unsigned_intHI_type_node
, 1);
4743 unsigned_V8QI_type_node
4744 = make_vector (V8QImode
, unsigned_intQI_type_node
, 1);
4745 unsigned_V8HI_type_node
4746 = make_vector (V8HImode
, unsigned_intHI_type_node
, 1);
4747 unsigned_V16QI_type_node
4748 = make_vector (V16QImode
, unsigned_intQI_type_node
, 1);
4749 unsigned_V1DI_type_node
4750 = make_vector (V1DImode
, unsigned_intDI_type_node
, 1);
4752 V16SF_type_node
= make_vector (V16SFmode
, float_type_node
, 0);
4753 V4SF_type_node
= make_vector (V4SFmode
, float_type_node
, 0);
4754 V4SI_type_node
= make_vector (V4SImode
, intSI_type_node
, 0);
4755 V2HI_type_node
= make_vector (V2HImode
, intHI_type_node
, 0);
4756 V2SI_type_node
= make_vector (V2SImode
, intSI_type_node
, 0);
4757 V2DI_type_node
= make_vector (V2DImode
, intDI_type_node
, 0);
4758 V4HI_type_node
= make_vector (V4HImode
, intHI_type_node
, 0);
4759 V8QI_type_node
= make_vector (V8QImode
, intQI_type_node
, 0);
4760 V8HI_type_node
= make_vector (V8HImode
, intHI_type_node
, 0);
4761 V2SF_type_node
= make_vector (V2SFmode
, float_type_node
, 0);
4762 V2DF_type_node
= make_vector (V2DFmode
, double_type_node
, 0);
4763 V16QI_type_node
= make_vector (V16QImode
, intQI_type_node
, 0);
4764 V1DI_type_node
= make_vector (V1DImode
, intDI_type_node
, 0);
4767 /* Returns a vector tree node given a vector mode, the inner type, and
4771 make_vector (mode
, innertype
, unsignedp
)
4772 enum machine_mode mode
;
4778 t
= make_node (VECTOR_TYPE
);
4779 TREE_TYPE (t
) = innertype
;
4780 TYPE_MODE (t
) = mode
;
4781 TREE_UNSIGNED (TREE_TYPE (t
)) = unsignedp
;
4782 finish_vector_type (t
);
4787 /* Given an initializer INIT, return TRUE if INIT is zero or some
4788 aggregate of zeros. Otherwise return FALSE. */
4791 initializer_zerop (init
)
4796 switch (TREE_CODE (init
))
4799 return integer_zerop (init
);
4801 return real_zerop (init
)
4802 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
4804 return integer_zerop (init
)
4805 || (real_zerop (init
)
4806 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
4807 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
4810 if (AGGREGATE_TYPE_P (TREE_TYPE (init
)))
4812 tree aggr_init
= TREE_OPERAND (init
, 1);
4816 if (! initializer_zerop (TREE_VALUE (aggr_init
)))
4818 aggr_init
= TREE_CHAIN (aggr_init
);
4829 #include "gt-tree.h"
projects / thirdparty / gcc.git / blob