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 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
49 #define obstack_chunk_alloc xmalloc
50 #define obstack_chunk_free free
51 /* obstack.[ch] explicitly declined to prototype this. */
52 extern int _obstack_allocated_p
PARAMS ((struct obstack
*h
, PTR obj
));
54 static void unsave_expr_now_r
PARAMS ((tree
));
56 /* Objects allocated on this obstack last forever. */
58 struct obstack permanent_obstack
;
60 /* Table indexed by tree code giving a string containing a character
61 classifying the tree code. Possibilities are
62 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
64 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
66 char tree_code_type
[MAX_TREE_CODES
] = {
71 /* Table indexed by tree code giving number of expression
72 operands beyond the fixed part of the node structure.
73 Not used for types or decls. */
75 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
77 int tree_code_length
[MAX_TREE_CODES
] = {
82 /* Names of tree components.
83 Used for printing out the tree and error messages. */
84 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
86 const char *tree_code_name
[MAX_TREE_CODES
] = {
91 /* Statistics-gathering stuff. */
112 int tree_node_counts
[(int) all_kinds
];
113 int tree_node_sizes
[(int) all_kinds
];
114 int id_string_size
= 0;
116 static const char * const tree_node_kind_names
[] = {
134 /* Unique id for next decl created. */
135 static int next_decl_uid
;
136 /* Unique id for next type created. */
137 static int next_type_uid
= 1;
139 /* Here is how primitive or already-canonicalized types' hash
141 #define TYPE_HASH(TYPE) ((unsigned long) (TYPE) & 0777777)
143 /* Since we cannot rehash a type after it is in the table, we have to
144 keep the hash code. */
152 /* Initial size of the hash table (rounded to next prime). */
153 #define TYPE_HASH_INITIAL_SIZE 1000
155 /* Now here is the hash table. When recording a type, it is added to
156 the slot whose index is the hash code. Note that the hash table is
157 used for several kinds of types (function types, array types and
158 array index range types, for now). While all these live in the
159 same table, they are completely independent, and the hash code is
160 computed differently for each of these. */
162 htab_t type_hash_table
;
164 static void build_real_from_int_cst_1
PARAMS ((PTR
));
165 static void set_type_quals
PARAMS ((tree
, int));
166 static void append_random_chars
PARAMS ((char *));
167 static void mark_type_hash
PARAMS ((void *));
168 static int type_hash_eq
PARAMS ((const void*, const void*));
169 static unsigned int type_hash_hash
PARAMS ((const void*));
170 static void print_type_hash_statistics
PARAMS((void));
171 static int mark_hash_entry
PARAMS((void **, void *));
172 static void finish_vector_type
PARAMS((tree
));
173 static int mark_tree_hashtable_entry
PARAMS((void **, void *));
175 /* If non-null, these are language-specific helper functions for
176 unsave_expr_now. If present, LANG_UNSAVE is called before its
177 argument (an UNSAVE_EXPR) is to be unsaved, and all other
178 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
179 called from unsave_expr_1 for language-specific tree codes. */
180 void (*lang_unsave
) PARAMS ((tree
*));
181 void (*lang_unsave_expr_now
) PARAMS ((tree
));
183 /* If non-null, these are language-specific helper functions for
184 unsafe_for_reeval. Return negative to not handle some tree. */
185 int (*lang_unsafe_for_reeval
) PARAMS ((tree
));
187 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
188 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
189 appropriate IDENTIFIER_NODE. Otherwise, set it to the
190 ERROR_MARK_NODE to ensure that the assembler does not talk about
192 void (*lang_set_decl_assembler_name
) PARAMS ((tree
));
194 tree global_trees
[TI_MAX
];
195 tree integer_types
[itk_none
];
197 /* Set the DECL_ASSEMBLER_NAME for DECL. */
199 set_decl_assembler_name (decl
)
202 /* The language-independent code should never use the
203 DECL_ASSEMBLER_NAME for lots of DECLs. Only FUNCTION_DECLs and
204 VAR_DECLs for variables with static storage duration need a real
205 DECL_ASSEMBLER_NAME. */
206 if (TREE_CODE (decl
) == FUNCTION_DECL
207 || (TREE_CODE (decl
) == VAR_DECL
208 && (TREE_STATIC (decl
)
209 || DECL_EXTERNAL (decl
)
210 || TREE_PUBLIC (decl
))))
211 /* By default, assume the name to use in assembly code is the
212 same as that used in the source language. (That's correct
213 for C, and GCC used to set DECL_ASSEMBLER_NAME to the same
214 value as DECL_NAME in build_decl, so this choice provides
215 backwards compatibility with existing front-ends. */
216 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
218 /* Nobody should ever be asking for the DECL_ASSEMBLER_NAME of
219 these DECLs -- unless they're in language-dependent code, in
220 which case lang_set_decl_assembler_name should handle things. */
224 /* Init the principal obstacks. */
229 gcc_obstack_init (&permanent_obstack
);
231 /* Initialize the hash table of types. */
232 type_hash_table
= htab_create (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
234 ggc_add_root (&type_hash_table
, 1, sizeof type_hash_table
, mark_type_hash
);
235 ggc_add_tree_root (global_trees
, TI_MAX
);
236 ggc_add_tree_root (integer_types
, itk_none
);
238 /* Set lang_set_decl_set_assembler_name to a default value. */
239 lang_set_decl_assembler_name
= set_decl_assembler_name
;
243 /* Allocate SIZE bytes in the permanent obstack
244 and return a pointer to them. */
250 return (char *) obstack_alloc (&permanent_obstack
, size
);
253 /* Allocate NELEM items of SIZE bytes in the permanent obstack
254 and return a pointer to them. The storage is cleared before
255 returning the value. */
258 perm_calloc (nelem
, size
)
262 char *rval
= (char *) obstack_alloc (&permanent_obstack
, nelem
* size
);
263 memset (rval
, 0, nelem
* size
);
267 /* Compute the number of bytes occupied by 'node'. This routine only
268 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
273 enum tree_code code
= TREE_CODE (node
);
275 switch (TREE_CODE_CLASS (code
))
277 case 'd': /* A decl node */
278 return sizeof (struct tree_decl
);
280 case 't': /* a type node */
281 return sizeof (struct tree_type
);
283 case 'b': /* a lexical block node */
284 return sizeof (struct tree_block
);
286 case 'r': /* a reference */
287 case 'e': /* an expression */
288 case 's': /* an expression with side effects */
289 case '<': /* a comparison expression */
290 case '1': /* a unary arithmetic expression */
291 case '2': /* a binary arithmetic expression */
292 return (sizeof (struct tree_exp
)
293 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
295 case 'c': /* a constant */
296 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
297 words is machine-dependent due to varying length of HOST_WIDE_INT,
298 which might be wider than a pointer (e.g., long long). Similarly
299 for REAL_CST, since the number of words is machine-dependent due
300 to varying size and alignment of `double'. */
301 if (code
== INTEGER_CST
)
302 return sizeof (struct tree_int_cst
);
303 else if (code
== REAL_CST
)
304 return sizeof (struct tree_real_cst
);
306 return (sizeof (struct tree_common
)
307 + TREE_CODE_LENGTH (code
) * sizeof (char *));
309 case 'x': /* something random, like an identifier. */
312 length
= (sizeof (struct tree_common
)
313 + TREE_CODE_LENGTH (code
) * sizeof (char *));
314 if (code
== TREE_VEC
)
315 length
+= (TREE_VEC_LENGTH (node
) - 1) * sizeof (char *);
324 /* Return a newly allocated node of code CODE.
325 For decl and type nodes, some other fields are initialized.
326 The rest of the node is initialized to zero.
328 Achoo! I got a code in the node. */
335 register int type
= TREE_CODE_CLASS (code
);
336 register size_t length
;
337 #ifdef GATHER_STATISTICS
338 register tree_node_kind kind
;
340 struct tree_common ttmp
;
342 /* We can't allocate a TREE_VEC without knowing how many elements
344 if (code
== TREE_VEC
)
347 TREE_SET_CODE ((tree
)&ttmp
, code
);
348 length
= tree_size ((tree
)&ttmp
);
350 #ifdef GATHER_STATISTICS
353 case 'd': /* A decl node */
357 case 't': /* a type node */
361 case 'b': /* a lexical block */
365 case 's': /* an expression with side effects */
369 case 'r': /* a reference */
373 case 'e': /* an expression */
374 case '<': /* a comparison expression */
375 case '1': /* a unary arithmetic expression */
376 case '2': /* a binary arithmetic expression */
380 case 'c': /* a constant */
384 case 'x': /* something random, like an identifier. */
385 if (code
== IDENTIFIER_NODE
)
387 else if (code
== OP_IDENTIFIER
)
389 else if (code
== TREE_VEC
)
399 tree_node_counts
[(int) kind
]++;
400 tree_node_sizes
[(int) kind
] += length
;
403 t
= ggc_alloc_tree (length
);
405 memset ((PTR
) t
, 0, length
);
407 TREE_SET_CODE (t
, code
);
412 TREE_SIDE_EFFECTS (t
) = 1;
413 TREE_TYPE (t
) = void_type_node
;
417 if (code
!= FUNCTION_DECL
)
419 DECL_USER_ALIGN (t
) = 0;
420 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
421 DECL_SOURCE_LINE (t
) = lineno
;
422 DECL_SOURCE_FILE (t
) =
423 (input_filename
) ? input_filename
: "<built-in>";
424 DECL_UID (t
) = next_decl_uid
++;
425 /* Note that we have not yet computed the alias set for this
427 DECL_POINTER_ALIAS_SET (t
) = -1;
431 TYPE_UID (t
) = next_type_uid
++;
432 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
433 TYPE_USER_ALIGN (t
) = 0;
434 TYPE_MAIN_VARIANT (t
) = t
;
435 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
436 #ifdef SET_DEFAULT_TYPE_ATTRIBUTES
437 SET_DEFAULT_TYPE_ATTRIBUTES (t
);
439 /* Note that we have not yet computed the alias set for this
441 TYPE_ALIAS_SET (t
) = -1;
445 TREE_CONSTANT (t
) = 1;
455 case PREDECREMENT_EXPR
:
456 case PREINCREMENT_EXPR
:
457 case POSTDECREMENT_EXPR
:
458 case POSTINCREMENT_EXPR
:
459 /* All of these have side-effects, no matter what their
461 TREE_SIDE_EFFECTS (t
) = 1;
473 /* A front-end can reset this to an appropriate function if types need
476 tree (*make_lang_type_fn
) PARAMS ((enum tree_code
)) = make_node
;
478 /* Return a new type (with the indicated CODE), doing whatever
479 language-specific processing is required. */
482 make_lang_type (code
)
485 return (*make_lang_type_fn
) (code
);
488 /* Return a new node with the same contents as NODE except that its
489 TREE_CHAIN is zero and it has a fresh uid. */
496 register enum tree_code code
= TREE_CODE (node
);
497 register size_t length
;
499 length
= tree_size (node
);
500 t
= ggc_alloc_tree (length
);
501 memcpy (t
, node
, length
);
504 TREE_ASM_WRITTEN (t
) = 0;
506 if (TREE_CODE_CLASS (code
) == 'd')
507 DECL_UID (t
) = next_decl_uid
++;
508 else if (TREE_CODE_CLASS (code
) == 't')
510 TYPE_UID (t
) = next_type_uid
++;
511 /* The following is so that the debug code for
512 the copy is different from the original type.
513 The two statements usually duplicate each other
514 (because they clear fields of the same union),
515 but the optimizer should catch that. */
516 TYPE_SYMTAB_POINTER (t
) = 0;
517 TYPE_SYMTAB_ADDRESS (t
) = 0;
523 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
524 For example, this can copy a list made of TREE_LIST nodes. */
531 register tree prev
, next
;
536 head
= prev
= copy_node (list
);
537 next
= TREE_CHAIN (list
);
540 TREE_CHAIN (prev
) = copy_node (next
);
541 prev
= TREE_CHAIN (prev
);
542 next
= TREE_CHAIN (next
);
548 /* Return a newly constructed INTEGER_CST node whose constant value
549 is specified by the two ints LOW and HI.
550 The TREE_TYPE is set to `int'.
552 This function should be used via the `build_int_2' macro. */
555 build_int_2_wide (low
, hi
)
556 unsigned HOST_WIDE_INT low
;
559 register tree t
= make_node (INTEGER_CST
);
561 TREE_INT_CST_LOW (t
) = low
;
562 TREE_INT_CST_HIGH (t
) = hi
;
563 TREE_TYPE (t
) = integer_type_node
;
567 /* Return a new REAL_CST node whose type is TYPE and value is D. */
577 /* Check for valid float value for this type on this target machine;
578 if not, can print error message and store a valid value in D. */
579 #ifdef CHECK_FLOAT_VALUE
580 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
583 v
= make_node (REAL_CST
);
584 TREE_TYPE (v
) = type
;
585 TREE_REAL_CST (v
) = d
;
586 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
590 /* Return a new REAL_CST node whose type is TYPE
591 and whose value is the integer value of the INTEGER_CST node I. */
593 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
596 real_value_from_int_cst (type
, i
)
597 tree type ATTRIBUTE_UNUSED
, i
;
601 #ifdef REAL_ARITHMETIC
602 /* Clear all bits of the real value type so that we can later do
603 bitwise comparisons to see if two values are the same. */
604 memset ((char *) &d
, 0, sizeof d
);
606 if (! TREE_UNSIGNED (TREE_TYPE (i
)))
607 REAL_VALUE_FROM_INT (d
, TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
610 REAL_VALUE_FROM_UNSIGNED_INT (d
, TREE_INT_CST_LOW (i
),
611 TREE_INT_CST_HIGH (i
), TYPE_MODE (type
));
612 #else /* not REAL_ARITHMETIC */
613 /* Some 386 compilers mishandle unsigned int to float conversions,
614 so introduce a temporary variable E to avoid those bugs. */
615 if (TREE_INT_CST_HIGH (i
) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i
)))
619 d
= (double) (~TREE_INT_CST_HIGH (i
));
620 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
621 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
623 e
= (double) (~TREE_INT_CST_LOW (i
));
631 d
= (double) (unsigned HOST_WIDE_INT
) TREE_INT_CST_HIGH (i
);
632 e
= ((double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2))
633 * (double) ((HOST_WIDE_INT
) 1 << (HOST_BITS_PER_WIDE_INT
/ 2)));
635 e
= (double) TREE_INT_CST_LOW (i
);
638 #endif /* not REAL_ARITHMETIC */
642 /* Args to pass to and from build_real_from_int_cst_1. */
646 tree type
; /* Input: type to conver to. */
647 tree i
; /* Input: operand to convert. */
648 REAL_VALUE_TYPE d
; /* Output: floating point value. */
651 /* Convert an integer to a floating point value while protected by a floating
652 point exception handler. */
655 build_real_from_int_cst_1 (data
)
658 struct brfic_args
*args
= (struct brfic_args
*) data
;
660 #ifdef REAL_ARITHMETIC
661 args
->d
= real_value_from_int_cst (args
->type
, args
->i
);
664 = REAL_VALUE_TRUNCATE (TYPE_MODE (args
->type
),
665 real_value_from_int_cst (args
->type
, args
->i
));
669 /* Given a tree representing an integer constant I, return a tree
670 representing the same value as a floating-point constant of type TYPE.
671 We cannot perform this operation if there is no way of doing arithmetic
672 on floating-point values. */
675 build_real_from_int_cst (type
, i
)
680 int overflow
= TREE_OVERFLOW (i
);
682 struct brfic_args args
;
684 v
= make_node (REAL_CST
);
685 TREE_TYPE (v
) = type
;
687 /* Setup input for build_real_from_int_cst_1() */
691 if (do_float_handler (build_real_from_int_cst_1
, (PTR
) &args
))
692 /* Receive output from build_real_from_int_cst_1() */
696 /* We got an exception from build_real_from_int_cst_1() */
701 /* Check for valid float value for this type on this target machine. */
703 #ifdef CHECK_FLOAT_VALUE
704 CHECK_FLOAT_VALUE (TYPE_MODE (type
), d
, overflow
);
707 TREE_REAL_CST (v
) = d
;
708 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
712 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
714 /* Return a newly constructed STRING_CST node whose value is
715 the LEN characters at STR.
716 The TREE_TYPE is not initialized. */
719 build_string (len
, str
)
723 register tree s
= make_node (STRING_CST
);
725 TREE_STRING_LENGTH (s
) = len
;
726 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
731 /* Return a newly constructed COMPLEX_CST node whose value is
732 specified by the real and imaginary parts REAL and IMAG.
733 Both REAL and IMAG should be constant nodes. TYPE, if specified,
734 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
737 build_complex (type
, real
, imag
)
741 register tree t
= make_node (COMPLEX_CST
);
743 TREE_REALPART (t
) = real
;
744 TREE_IMAGPART (t
) = imag
;
745 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
746 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
747 TREE_CONSTANT_OVERFLOW (t
)
748 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
752 /* Build a newly constructed TREE_VEC node of length LEN. */
759 register int length
= (len
-1) * sizeof (tree
) + sizeof (struct tree_vec
);
761 #ifdef GATHER_STATISTICS
762 tree_node_counts
[(int)vec_kind
]++;
763 tree_node_sizes
[(int)vec_kind
] += length
;
766 t
= ggc_alloc_tree (length
);
768 memset ((PTR
) t
, 0, length
);
769 TREE_SET_CODE (t
, TREE_VEC
);
770 TREE_VEC_LENGTH (t
) = len
;
775 /* Return 1 if EXPR is the integer constant zero or a complex constant
784 return ((TREE_CODE (expr
) == INTEGER_CST
785 && ! TREE_CONSTANT_OVERFLOW (expr
)
786 && TREE_INT_CST_LOW (expr
) == 0
787 && TREE_INT_CST_HIGH (expr
) == 0)
788 || (TREE_CODE (expr
) == COMPLEX_CST
789 && integer_zerop (TREE_REALPART (expr
))
790 && integer_zerop (TREE_IMAGPART (expr
))));
793 /* Return 1 if EXPR is the integer constant one or the corresponding
802 return ((TREE_CODE (expr
) == INTEGER_CST
803 && ! TREE_CONSTANT_OVERFLOW (expr
)
804 && TREE_INT_CST_LOW (expr
) == 1
805 && TREE_INT_CST_HIGH (expr
) == 0)
806 || (TREE_CODE (expr
) == COMPLEX_CST
807 && integer_onep (TREE_REALPART (expr
))
808 && integer_zerop (TREE_IMAGPART (expr
))));
811 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
812 it contains. Likewise for the corresponding complex constant. */
815 integer_all_onesp (expr
)
823 if (TREE_CODE (expr
) == COMPLEX_CST
824 && integer_all_onesp (TREE_REALPART (expr
))
825 && integer_zerop (TREE_IMAGPART (expr
)))
828 else if (TREE_CODE (expr
) != INTEGER_CST
829 || TREE_CONSTANT_OVERFLOW (expr
))
832 uns
= TREE_UNSIGNED (TREE_TYPE (expr
));
834 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
835 && TREE_INT_CST_HIGH (expr
) == -1);
837 /* Note that using TYPE_PRECISION here is wrong. We care about the
838 actual bits, not the (arbitrary) range of the type. */
839 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
840 if (prec
>= HOST_BITS_PER_WIDE_INT
)
842 HOST_WIDE_INT high_value
;
845 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
847 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
848 /* Can not handle precisions greater than twice the host int size. */
850 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
851 /* Shifting by the host word size is undefined according to the ANSI
852 standard, so we must handle this as a special case. */
855 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
857 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
858 && TREE_INT_CST_HIGH (expr
) == high_value
);
861 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
864 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
872 HOST_WIDE_INT high
, low
;
876 if (TREE_CODE (expr
) == COMPLEX_CST
877 && integer_pow2p (TREE_REALPART (expr
))
878 && integer_zerop (TREE_IMAGPART (expr
)))
881 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
884 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
885 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
886 high
= TREE_INT_CST_HIGH (expr
);
887 low
= TREE_INT_CST_LOW (expr
);
889 /* First clear all bits that are beyond the type's precision in case
890 we've been sign extended. */
892 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
894 else if (prec
> HOST_BITS_PER_WIDE_INT
)
895 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
899 if (prec
< HOST_BITS_PER_WIDE_INT
)
900 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
903 if (high
== 0 && low
== 0)
906 return ((high
== 0 && (low
& (low
- 1)) == 0)
907 || (low
== 0 && (high
& (high
- 1)) == 0));
910 /* Return the power of two represented by a tree node known to be a
918 HOST_WIDE_INT high
, low
;
922 if (TREE_CODE (expr
) == COMPLEX_CST
)
923 return tree_log2 (TREE_REALPART (expr
));
925 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
926 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
928 high
= TREE_INT_CST_HIGH (expr
);
929 low
= TREE_INT_CST_LOW (expr
);
931 /* First clear all bits that are beyond the type's precision in case
932 we've been sign extended. */
934 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
936 else if (prec
> HOST_BITS_PER_WIDE_INT
)
937 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
941 if (prec
< HOST_BITS_PER_WIDE_INT
)
942 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
945 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
949 /* Similar, but return the largest integer Y such that 2 ** Y is less
950 than or equal to EXPR. */
953 tree_floor_log2 (expr
)
957 HOST_WIDE_INT high
, low
;
961 if (TREE_CODE (expr
) == COMPLEX_CST
)
962 return tree_log2 (TREE_REALPART (expr
));
964 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
965 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
967 high
= TREE_INT_CST_HIGH (expr
);
968 low
= TREE_INT_CST_LOW (expr
);
970 /* First clear all bits that are beyond the type's precision in case
971 we've been sign extended. Ignore if type's precision hasn't been set
972 since what we are doing is setting it. */
974 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
976 else if (prec
> HOST_BITS_PER_WIDE_INT
)
977 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
981 if (prec
< HOST_BITS_PER_WIDE_INT
)
982 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
985 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
989 /* Return 1 if EXPR is the real constant zero. */
997 return ((TREE_CODE (expr
) == REAL_CST
998 && ! TREE_CONSTANT_OVERFLOW (expr
)
999 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1000 || (TREE_CODE (expr
) == COMPLEX_CST
1001 && real_zerop (TREE_REALPART (expr
))
1002 && real_zerop (TREE_IMAGPART (expr
))));
1005 /* Return 1 if EXPR is the real constant one in real or complex form. */
1013 return ((TREE_CODE (expr
) == REAL_CST
1014 && ! TREE_CONSTANT_OVERFLOW (expr
)
1015 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1016 || (TREE_CODE (expr
) == COMPLEX_CST
1017 && real_onep (TREE_REALPART (expr
))
1018 && real_zerop (TREE_IMAGPART (expr
))));
1021 /* Return 1 if EXPR is the real constant two. */
1029 return ((TREE_CODE (expr
) == REAL_CST
1030 && ! TREE_CONSTANT_OVERFLOW (expr
)
1031 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1032 || (TREE_CODE (expr
) == COMPLEX_CST
1033 && real_twop (TREE_REALPART (expr
))
1034 && real_zerop (TREE_IMAGPART (expr
))));
1037 /* Nonzero if EXP is a constant or a cast of a constant. */
1040 really_constant_p (exp
)
1043 /* This is not quite the same as STRIP_NOPS. It does more. */
1044 while (TREE_CODE (exp
) == NOP_EXPR
1045 || TREE_CODE (exp
) == CONVERT_EXPR
1046 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1047 exp
= TREE_OPERAND (exp
, 0);
1048 return TREE_CONSTANT (exp
);
1051 /* Return first list element whose TREE_VALUE is ELEM.
1052 Return 0 if ELEM is not in LIST. */
1055 value_member (elem
, list
)
1060 if (elem
== TREE_VALUE (list
))
1062 list
= TREE_CHAIN (list
);
1067 /* Return first list element whose TREE_PURPOSE is ELEM.
1068 Return 0 if ELEM is not in LIST. */
1071 purpose_member (elem
, list
)
1076 if (elem
== TREE_PURPOSE (list
))
1078 list
= TREE_CHAIN (list
);
1083 /* Return first list element whose BINFO_TYPE is ELEM.
1084 Return 0 if ELEM is not in LIST. */
1087 binfo_member (elem
, list
)
1092 if (elem
== BINFO_TYPE (list
))
1094 list
= TREE_CHAIN (list
);
1099 /* Return nonzero if ELEM is part of the chain CHAIN. */
1102 chain_member (elem
, chain
)
1109 chain
= TREE_CHAIN (chain
);
1115 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1116 chain CHAIN. This and the next function are currently unused, but
1117 are retained for completeness. */
1120 chain_member_value (elem
, chain
)
1125 if (elem
== TREE_VALUE (chain
))
1127 chain
= TREE_CHAIN (chain
);
1133 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1134 for any piece of chain CHAIN. */
1137 chain_member_purpose (elem
, chain
)
1142 if (elem
== TREE_PURPOSE (chain
))
1144 chain
= TREE_CHAIN (chain
);
1150 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1151 We expect a null pointer to mark the end of the chain.
1152 This is the Lisp primitive `length'. */
1159 register int len
= 0;
1161 for (tail
= t
; tail
; tail
= TREE_CHAIN (tail
))
1167 /* Returns the number of FIELD_DECLs in TYPE. */
1170 fields_length (type
)
1173 tree t
= TYPE_FIELDS (type
);
1176 for (; t
; t
= TREE_CHAIN (t
))
1177 if (TREE_CODE (t
) == FIELD_DECL
)
1183 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1184 by modifying the last node in chain 1 to point to chain 2.
1185 This is the Lisp primitive `nconc'. */
1195 #ifdef ENABLE_TREE_CHECKING
1199 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1201 TREE_CHAIN (t1
) = op2
;
1202 #ifdef ENABLE_TREE_CHECKING
1203 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1205 abort (); /* Circularity created. */
1213 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1217 register tree chain
;
1221 while ((next
= TREE_CHAIN (chain
)))
1226 /* Reverse the order of elements in the chain T,
1227 and return the new head of the chain (old last element). */
1233 register tree prev
= 0, decl
, next
;
1234 for (decl
= t
; decl
; decl
= next
)
1236 next
= TREE_CHAIN (decl
);
1237 TREE_CHAIN (decl
) = prev
;
1243 /* Given a chain CHAIN of tree nodes,
1244 construct and return a list of those nodes. */
1250 tree result
= NULL_TREE
;
1251 tree in_tail
= chain
;
1252 tree out_tail
= NULL_TREE
;
1256 tree next
= tree_cons (NULL_TREE
, in_tail
, NULL_TREE
);
1258 TREE_CHAIN (out_tail
) = next
;
1262 in_tail
= TREE_CHAIN (in_tail
);
1268 /* Return a newly created TREE_LIST node whose
1269 purpose and value fields are PARM and VALUE. */
1272 build_tree_list (parm
, value
)
1275 register tree t
= make_node (TREE_LIST
);
1276 TREE_PURPOSE (t
) = parm
;
1277 TREE_VALUE (t
) = value
;
1281 /* Return a newly created TREE_LIST node whose
1282 purpose and value fields are PARM and VALUE
1283 and whose TREE_CHAIN is CHAIN. */
1286 tree_cons (purpose
, value
, chain
)
1287 tree purpose
, value
, chain
;
1291 node
= ggc_alloc_tree (sizeof (struct tree_list
));
1293 memset (node
, 0, sizeof (struct tree_common
));
1295 #ifdef GATHER_STATISTICS
1296 tree_node_counts
[(int) x_kind
]++;
1297 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1300 TREE_SET_CODE (node
, TREE_LIST
);
1301 TREE_CHAIN (node
) = chain
;
1302 TREE_PURPOSE (node
) = purpose
;
1303 TREE_VALUE (node
) = value
;
1308 /* Return the size nominally occupied by an object of type TYPE
1309 when it resides in memory. The value is measured in units of bytes,
1310 and its data type is that normally used for type sizes
1311 (which is the first type created by make_signed_type or
1312 make_unsigned_type). */
1315 size_in_bytes (type
)
1320 if (type
== error_mark_node
)
1321 return integer_zero_node
;
1323 type
= TYPE_MAIN_VARIANT (type
);
1324 t
= TYPE_SIZE_UNIT (type
);
1328 incomplete_type_error (NULL_TREE
, type
);
1329 return size_zero_node
;
1332 if (TREE_CODE (t
) == INTEGER_CST
)
1333 force_fit_type (t
, 0);
1338 /* Return the size of TYPE (in bytes) as a wide integer
1339 or return -1 if the size can vary or is larger than an integer. */
1342 int_size_in_bytes (type
)
1347 if (type
== error_mark_node
)
1350 type
= TYPE_MAIN_VARIANT (type
);
1351 t
= TYPE_SIZE_UNIT (type
);
1353 || TREE_CODE (t
) != INTEGER_CST
1354 || TREE_OVERFLOW (t
)
1355 || TREE_INT_CST_HIGH (t
) != 0
1356 /* If the result would appear negative, it's too big to represent. */
1357 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1360 return TREE_INT_CST_LOW (t
);
1363 /* Return the bit position of FIELD, in bits from the start of the record.
1364 This is a tree of type bitsizetype. */
1367 bit_position (field
)
1371 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1372 DECL_FIELD_BIT_OFFSET (field
));
1375 /* Likewise, but return as an integer. Abort if it cannot be represented
1376 in that way (since it could be a signed value, we don't have the option
1377 of returning -1 like int_size_in_byte can. */
1380 int_bit_position (field
)
1383 return tree_low_cst (bit_position (field
), 0);
1386 /* Return the byte position of FIELD, in bytes from the start of the record.
1387 This is a tree of type sizetype. */
1390 byte_position (field
)
1393 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1394 DECL_FIELD_BIT_OFFSET (field
));
1397 /* Likewise, but return as an integer. Abort if it cannot be represented
1398 in that way (since it could be a signed value, we don't have the option
1399 of returning -1 like int_size_in_byte can. */
1402 int_byte_position (field
)
1405 return tree_low_cst (byte_position (field
), 0);
1408 /* Return the strictest alignment, in bits, that T is known to have. */
1414 unsigned int align0
, align1
;
1416 switch (TREE_CODE (t
))
1418 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1419 /* If we have conversions, we know that the alignment of the
1420 object must meet each of the alignments of the types. */
1421 align0
= expr_align (TREE_OPERAND (t
, 0));
1422 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1423 return MAX (align0
, align1
);
1425 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1426 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1427 case WITH_RECORD_EXPR
: case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
1428 /* These don't change the alignment of an object. */
1429 return expr_align (TREE_OPERAND (t
, 0));
1432 /* The best we can do is say that the alignment is the least aligned
1434 align0
= expr_align (TREE_OPERAND (t
, 1));
1435 align1
= expr_align (TREE_OPERAND (t
, 2));
1436 return MIN (align0
, align1
);
1438 case LABEL_DECL
: case CONST_DECL
:
1439 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1440 if (DECL_ALIGN (t
) != 0)
1441 return DECL_ALIGN (t
);
1445 return FUNCTION_BOUNDARY
;
1451 /* Otherwise take the alignment from that of the type. */
1452 return TYPE_ALIGN (TREE_TYPE (t
));
1455 /* Return, as a tree node, the number of elements for TYPE (which is an
1456 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1459 array_type_nelts (type
)
1462 tree index_type
, min
, max
;
1464 /* If they did it with unspecified bounds, then we should have already
1465 given an error about it before we got here. */
1466 if (! TYPE_DOMAIN (type
))
1467 return error_mark_node
;
1469 index_type
= TYPE_DOMAIN (type
);
1470 min
= TYPE_MIN_VALUE (index_type
);
1471 max
= TYPE_MAX_VALUE (index_type
);
1473 return (integer_zerop (min
)
1475 : fold (build (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1478 /* Return nonzero if arg is static -- a reference to an object in
1479 static storage. This is not the same as the C meaning of `static'. */
1485 switch (TREE_CODE (arg
))
1488 /* Nested functions aren't static, since taking their address
1489 involves a trampoline. */
1490 return (decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1491 && ! DECL_NON_ADDR_CONST_P (arg
);
1494 return (TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1495 && ! DECL_NON_ADDR_CONST_P (arg
);
1498 return TREE_STATIC (arg
);
1504 /* If we are referencing a bitfield, we can't evaluate an
1505 ADDR_EXPR at compile time and so it isn't a constant. */
1507 return (! DECL_BIT_FIELD (TREE_OPERAND (arg
, 1))
1508 && staticp (TREE_OPERAND (arg
, 0)));
1514 /* This case is technically correct, but results in setting
1515 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1518 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
1522 case ARRAY_RANGE_REF
:
1523 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1524 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1525 return staticp (TREE_OPERAND (arg
, 0));
1532 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1533 Do this to any expression which may be used in more than one place,
1534 but must be evaluated only once.
1536 Normally, expand_expr would reevaluate the expression each time.
1537 Calling save_expr produces something that is evaluated and recorded
1538 the first time expand_expr is called on it. Subsequent calls to
1539 expand_expr just reuse the recorded value.
1541 The call to expand_expr that generates code that actually computes
1542 the value is the first call *at compile time*. Subsequent calls
1543 *at compile time* generate code to use the saved value.
1544 This produces correct result provided that *at run time* control
1545 always flows through the insns made by the first expand_expr
1546 before reaching the other places where the save_expr was evaluated.
1547 You, the caller of save_expr, must make sure this is so.
1549 Constants, and certain read-only nodes, are returned with no
1550 SAVE_EXPR because that is safe. Expressions containing placeholders
1551 are not touched; see tree.def for an explanation of what these
1558 register tree t
= fold (expr
);
1560 /* We don't care about whether this can be used as an lvalue in this
1562 while (TREE_CODE (t
) == NON_LVALUE_EXPR
)
1563 t
= TREE_OPERAND (t
, 0);
1565 /* If the tree evaluates to a constant, then we don't want to hide that
1566 fact (i.e. this allows further folding, and direct checks for constants).
1567 However, a read-only object that has side effects cannot be bypassed.
1568 Since it is no problem to reevaluate literals, we just return the
1571 if (TREE_CONSTANT (t
) || (TREE_READONLY (t
) && ! TREE_SIDE_EFFECTS (t
))
1572 || TREE_CODE (t
) == SAVE_EXPR
|| TREE_CODE (t
) == ERROR_MARK
)
1575 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1576 it means that the size or offset of some field of an object depends on
1577 the value within another field.
1579 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1580 and some variable since it would then need to be both evaluated once and
1581 evaluated more than once. Front-ends must assure this case cannot
1582 happen by surrounding any such subexpressions in their own SAVE_EXPR
1583 and forcing evaluation at the proper time. */
1584 if (contains_placeholder_p (t
))
1587 t
= build (SAVE_EXPR
, TREE_TYPE (expr
), t
, current_function_decl
, NULL_TREE
);
1589 /* This expression might be placed ahead of a jump to ensure that the
1590 value was computed on both sides of the jump. So make sure it isn't
1591 eliminated as dead. */
1592 TREE_SIDE_EFFECTS (t
) = 1;
1593 TREE_READONLY (t
) = 1;
1597 /* Arrange for an expression to be expanded multiple independent
1598 times. This is useful for cleanup actions, as the backend can
1599 expand them multiple times in different places. */
1607 /* If this is already protected, no sense in protecting it again. */
1608 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
1611 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
1612 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
1616 /* Returns the index of the first non-tree operand for CODE, or the number
1617 of operands if all are trees. */
1621 enum tree_code code
;
1627 case GOTO_SUBROUTINE_EXPR
:
1630 case WITH_CLEANUP_EXPR
:
1631 /* Should be defined to be 2. */
1633 case METHOD_CALL_EXPR
:
1636 return TREE_CODE_LENGTH (code
);
1640 /* Perform any modifications to EXPR required when it is unsaved. Does
1641 not recurse into EXPR's subtrees. */
1644 unsave_expr_1 (expr
)
1647 switch (TREE_CODE (expr
))
1650 if (! SAVE_EXPR_PERSISTENT_P (expr
))
1651 SAVE_EXPR_RTL (expr
) = 0;
1655 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1656 It's OK for this to happen if it was part of a subtree that
1657 isn't immediately expanded, such as operand 2 of another
1659 if (TREE_OPERAND (expr
, 1))
1662 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
1663 TREE_OPERAND (expr
, 3) = NULL_TREE
;
1667 /* I don't yet know how to emit a sequence multiple times. */
1668 if (RTL_EXPR_SEQUENCE (expr
) != 0)
1673 if (lang_unsave_expr_now
!= 0)
1674 (*lang_unsave_expr_now
) (expr
);
1679 /* Helper function for unsave_expr_now. */
1682 unsave_expr_now_r (expr
)
1685 enum tree_code code
;
1687 /* There's nothing to do for NULL_TREE. */
1691 unsave_expr_1 (expr
);
1693 code
= TREE_CODE (expr
);
1694 switch (TREE_CODE_CLASS (code
))
1696 case 'c': /* a constant */
1697 case 't': /* a type node */
1698 case 'd': /* A decl node */
1699 case 'b': /* A block node */
1702 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1703 if (code
== TREE_LIST
)
1705 unsave_expr_now_r (TREE_VALUE (expr
));
1706 unsave_expr_now_r (TREE_CHAIN (expr
));
1710 case 'e': /* an expression */
1711 case 'r': /* a reference */
1712 case 's': /* an expression with side effects */
1713 case '<': /* a comparison expression */
1714 case '2': /* a binary arithmetic expression */
1715 case '1': /* a unary arithmetic expression */
1719 for (i
= first_rtl_op (code
) - 1; i
>= 0; i
--)
1720 unsave_expr_now_r (TREE_OPERAND (expr
, i
));
1729 /* Modify a tree in place so that all the evaluate only once things
1730 are cleared out. Return the EXPR given. */
1733 unsave_expr_now (expr
)
1736 if (lang_unsave
!= 0)
1737 (*lang_unsave
) (&expr
);
1739 unsave_expr_now_r (expr
);
1744 /* Return 0 if it is safe to evaluate EXPR multiple times,
1745 return 1 if it is safe if EXPR is unsaved afterward, or
1746 return 2 if it is completely unsafe.
1748 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1749 an expression tree, so that it safe to unsave them and the surrounding
1750 context will be correct.
1752 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1753 occasionally across the whole of a function. It is therefore only
1754 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1755 below the UNSAVE_EXPR.
1757 RTL_EXPRs consume their rtl during evaluation. It is therefore
1758 never possible to unsave them. */
1761 unsafe_for_reeval (expr
)
1765 enum tree_code code
;
1770 if (expr
== NULL_TREE
)
1773 code
= TREE_CODE (expr
);
1774 first_rtl
= first_rtl_op (code
);
1783 for (exp
= expr
; exp
!= 0; exp
= TREE_CHAIN (exp
))
1785 tmp
= unsafe_for_reeval (TREE_VALUE (exp
));
1786 unsafeness
= MAX (tmp
, unsafeness
);
1792 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, 1));
1793 return MAX (tmp
, 1);
1800 if (lang_unsafe_for_reeval
!= 0)
1802 tmp
= (*lang_unsafe_for_reeval
) (expr
);
1809 switch (TREE_CODE_CLASS (code
))
1811 case 'c': /* a constant */
1812 case 't': /* a type node */
1813 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1814 case 'd': /* A decl node */
1815 case 'b': /* A block node */
1818 case 'e': /* an expression */
1819 case 'r': /* a reference */
1820 case 's': /* an expression with side effects */
1821 case '<': /* a comparison expression */
1822 case '2': /* a binary arithmetic expression */
1823 case '1': /* a unary arithmetic expression */
1824 for (i
= first_rtl
- 1; i
>= 0; i
--)
1826 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, i
));
1827 unsafeness
= MAX (tmp
, unsafeness
);
1837 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1838 or offset that depends on a field within a record. */
1841 contains_placeholder_p (exp
)
1844 register enum tree_code code
;
1850 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1851 in it since it is supplying a value for it. */
1852 code
= TREE_CODE (exp
);
1853 if (code
== WITH_RECORD_EXPR
)
1855 else if (code
== PLACEHOLDER_EXPR
)
1858 switch (TREE_CODE_CLASS (code
))
1861 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1862 position computations since they will be converted into a
1863 WITH_RECORD_EXPR involving the reference, which will assume
1864 here will be valid. */
1865 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1868 if (code
== TREE_LIST
)
1869 return (contains_placeholder_p (TREE_VALUE (exp
))
1870 || (TREE_CHAIN (exp
) != 0
1871 && contains_placeholder_p (TREE_CHAIN (exp
))));
1880 /* Ignoring the first operand isn't quite right, but works best. */
1881 return contains_placeholder_p (TREE_OPERAND (exp
, 1));
1888 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1889 || contains_placeholder_p (TREE_OPERAND (exp
, 1))
1890 || contains_placeholder_p (TREE_OPERAND (exp
, 2)));
1893 /* If we already know this doesn't have a placeholder, don't
1895 if (SAVE_EXPR_NOPLACEHOLDER (exp
) || SAVE_EXPR_RTL (exp
) != 0)
1898 SAVE_EXPR_NOPLACEHOLDER (exp
) = 1;
1899 result
= contains_placeholder_p (TREE_OPERAND (exp
, 0));
1901 SAVE_EXPR_NOPLACEHOLDER (exp
) = 0;
1906 return (TREE_OPERAND (exp
, 1) != 0
1907 && contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1913 switch (TREE_CODE_LENGTH (code
))
1916 return contains_placeholder_p (TREE_OPERAND (exp
, 0));
1918 return (contains_placeholder_p (TREE_OPERAND (exp
, 0))
1919 || contains_placeholder_p (TREE_OPERAND (exp
, 1)));
1930 /* Return 1 if EXP contains any expressions that produce cleanups for an
1931 outer scope to deal with. Used by fold. */
1939 if (! TREE_SIDE_EFFECTS (exp
))
1942 switch (TREE_CODE (exp
))
1945 case GOTO_SUBROUTINE_EXPR
:
1946 case WITH_CLEANUP_EXPR
:
1949 case CLEANUP_POINT_EXPR
:
1953 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
1955 cmp
= has_cleanups (TREE_VALUE (exp
));
1965 /* This general rule works for most tree codes. All exceptions should be
1966 handled above. If this is a language-specific tree code, we can't
1967 trust what might be in the operand, so say we don't know
1969 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
1972 nops
= first_rtl_op (TREE_CODE (exp
));
1973 for (i
= 0; i
< nops
; i
++)
1974 if (TREE_OPERAND (exp
, i
) != 0)
1976 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
1977 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
1978 || type
== 'r' || type
== 's')
1980 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
1989 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1990 return a tree with all occurrences of references to F in a
1991 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1992 contains only arithmetic expressions or a CALL_EXPR with a
1993 PLACEHOLDER_EXPR occurring only in its arglist. */
1996 substitute_in_expr (exp
, f
, r
)
2001 enum tree_code code
= TREE_CODE (exp
);
2006 switch (TREE_CODE_CLASS (code
))
2013 if (code
== PLACEHOLDER_EXPR
)
2015 else if (code
== TREE_LIST
)
2017 op0
= (TREE_CHAIN (exp
) == 0
2018 ? 0 : substitute_in_expr (TREE_CHAIN (exp
), f
, r
));
2019 op1
= substitute_in_expr (TREE_VALUE (exp
), f
, r
);
2020 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2023 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2032 switch (TREE_CODE_LENGTH (code
))
2035 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2036 if (op0
== TREE_OPERAND (exp
, 0))
2039 if (code
== NON_LVALUE_EXPR
)
2042 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2046 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2047 could, but we don't support it. */
2048 if (code
== RTL_EXPR
)
2050 else if (code
== CONSTRUCTOR
)
2053 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2054 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2055 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2058 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
));
2062 /* It cannot be that anything inside a SAVE_EXPR contains a
2063 PLACEHOLDER_EXPR. */
2064 if (code
== SAVE_EXPR
)
2067 else if (code
== CALL_EXPR
)
2069 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2070 if (op1
== TREE_OPERAND (exp
, 1))
2073 return build (code
, TREE_TYPE (exp
),
2074 TREE_OPERAND (exp
, 0), op1
, NULL_TREE
);
2077 else if (code
!= COND_EXPR
)
2080 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2081 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2082 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2083 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2084 && op2
== TREE_OPERAND (exp
, 2))
2087 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2100 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2101 and it is the right field, replace it with R. */
2102 for (inner
= TREE_OPERAND (exp
, 0);
2103 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
2104 inner
= TREE_OPERAND (inner
, 0))
2106 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2107 && TREE_OPERAND (exp
, 1) == f
)
2110 /* If this expression hasn't been completed let, leave it
2112 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2113 && TREE_TYPE (inner
) == 0)
2116 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2117 if (op0
== TREE_OPERAND (exp
, 0))
2120 new = fold (build (code
, TREE_TYPE (exp
), op0
,
2121 TREE_OPERAND (exp
, 1)));
2125 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2126 op1
= substitute_in_expr (TREE_OPERAND (exp
, 1), f
, r
);
2127 op2
= substitute_in_expr (TREE_OPERAND (exp
, 2), f
, r
);
2128 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2129 && op2
== TREE_OPERAND (exp
, 2))
2132 new = fold (build (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2137 op0
= substitute_in_expr (TREE_OPERAND (exp
, 0), f
, r
);
2138 if (op0
== TREE_OPERAND (exp
, 0))
2141 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2153 TREE_READONLY (new) = TREE_READONLY (exp
);
2157 /* Stabilize a reference so that we can use it any number of times
2158 without causing its operands to be evaluated more than once.
2159 Returns the stabilized reference. This works by means of save_expr,
2160 so see the caveats in the comments about save_expr.
2162 Also allows conversion expressions whose operands are references.
2163 Any other kind of expression is returned unchanged. */
2166 stabilize_reference (ref
)
2169 register tree result
;
2170 register enum tree_code code
= TREE_CODE (ref
);
2177 /* No action is needed in this case. */
2183 case FIX_TRUNC_EXPR
:
2184 case FIX_FLOOR_EXPR
:
2185 case FIX_ROUND_EXPR
:
2187 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2191 result
= build_nt (INDIRECT_REF
,
2192 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2196 result
= build_nt (COMPONENT_REF
,
2197 stabilize_reference (TREE_OPERAND (ref
, 0)),
2198 TREE_OPERAND (ref
, 1));
2202 result
= build_nt (BIT_FIELD_REF
,
2203 stabilize_reference (TREE_OPERAND (ref
, 0)),
2204 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2205 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2209 result
= build_nt (ARRAY_REF
,
2210 stabilize_reference (TREE_OPERAND (ref
, 0)),
2211 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2214 case ARRAY_RANGE_REF
:
2215 result
= build_nt (ARRAY_RANGE_REF
,
2216 stabilize_reference (TREE_OPERAND (ref
, 0)),
2217 stabilize_reference_1 (TREE_OPERAND (ref
, 1)));
2221 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2222 it wouldn't be ignored. This matters when dealing with
2224 return stabilize_reference_1 (ref
);
2227 result
= build1 (INDIRECT_REF
, TREE_TYPE (ref
),
2228 save_expr (build1 (ADDR_EXPR
,
2229 build_pointer_type (TREE_TYPE (ref
)),
2233 /* If arg isn't a kind of lvalue we recognize, make no change.
2234 Caller should recognize the error for an invalid lvalue. */
2239 return error_mark_node
;
2242 TREE_TYPE (result
) = TREE_TYPE (ref
);
2243 TREE_READONLY (result
) = TREE_READONLY (ref
);
2244 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2245 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2250 /* Subroutine of stabilize_reference; this is called for subtrees of
2251 references. Any expression with side-effects must be put in a SAVE_EXPR
2252 to ensure that it is only evaluated once.
2254 We don't put SAVE_EXPR nodes around everything, because assigning very
2255 simple expressions to temporaries causes us to miss good opportunities
2256 for optimizations. Among other things, the opportunity to fold in the
2257 addition of a constant into an addressing mode often gets lost, e.g.
2258 "y[i+1] += x;". In general, we take the approach that we should not make
2259 an assignment unless we are forced into it - i.e., that any non-side effect
2260 operator should be allowed, and that cse should take care of coalescing
2261 multiple utterances of the same expression should that prove fruitful. */
2264 stabilize_reference_1 (e
)
2267 register tree result
;
2268 register enum tree_code code
= TREE_CODE (e
);
2270 /* We cannot ignore const expressions because it might be a reference
2271 to a const array but whose index contains side-effects. But we can
2272 ignore things that are actual constant or that already have been
2273 handled by this function. */
2275 if (TREE_CONSTANT (e
) || code
== SAVE_EXPR
)
2278 switch (TREE_CODE_CLASS (code
))
2288 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2289 so that it will only be evaluated once. */
2290 /* The reference (r) and comparison (<) classes could be handled as
2291 below, but it is generally faster to only evaluate them once. */
2292 if (TREE_SIDE_EFFECTS (e
))
2293 return save_expr (e
);
2297 /* Constants need no processing. In fact, we should never reach
2302 /* Division is slow and tends to be compiled with jumps,
2303 especially the division by powers of 2 that is often
2304 found inside of an array reference. So do it just once. */
2305 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2306 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2307 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2308 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2309 return save_expr (e
);
2310 /* Recursively stabilize each operand. */
2311 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2312 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2316 /* Recursively stabilize each operand. */
2317 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2324 TREE_TYPE (result
) = TREE_TYPE (e
);
2325 TREE_READONLY (result
) = TREE_READONLY (e
);
2326 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2327 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2332 /* Low-level constructors for expressions. */
2334 /* Build an expression of code CODE, data type TYPE,
2335 and operands as specified by the arguments ARG1 and following arguments.
2336 Expressions and reference nodes can be created this way.
2337 Constants, decls, types and misc nodes cannot be. */
2340 build
VPARAMS ((enum tree_code code
, tree tt
, ...))
2342 #ifndef ANSI_PROTOTYPES
2343 enum tree_code code
;
2348 register int length
;
2355 #ifndef ANSI_PROTOTYPES
2356 code
= va_arg (p
, enum tree_code
);
2357 tt
= va_arg (p
, tree
);
2360 t
= make_node (code
);
2361 length
= TREE_CODE_LENGTH (code
);
2364 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2365 result based on those same flags for the arguments. But if the
2366 arguments aren't really even `tree' expressions, we shouldn't be trying
2368 fro
= first_rtl_op (code
);
2370 /* Expressions without side effects may be constant if their
2371 arguments are as well. */
2372 constant
= (TREE_CODE_CLASS (code
) == '<'
2373 || TREE_CODE_CLASS (code
) == '1'
2374 || TREE_CODE_CLASS (code
) == '2'
2375 || TREE_CODE_CLASS (code
) == 'c');
2379 /* This is equivalent to the loop below, but faster. */
2380 register tree arg0
= va_arg (p
, tree
);
2381 register tree arg1
= va_arg (p
, tree
);
2383 TREE_OPERAND (t
, 0) = arg0
;
2384 TREE_OPERAND (t
, 1) = arg1
;
2385 TREE_READONLY (t
) = 1;
2386 if (arg0
&& fro
> 0)
2388 if (TREE_SIDE_EFFECTS (arg0
))
2389 TREE_SIDE_EFFECTS (t
) = 1;
2390 if (!TREE_READONLY (arg0
))
2391 TREE_READONLY (t
) = 0;
2392 if (!TREE_CONSTANT (arg0
))
2396 if (arg1
&& fro
> 1)
2398 if (TREE_SIDE_EFFECTS (arg1
))
2399 TREE_SIDE_EFFECTS (t
) = 1;
2400 if (!TREE_READONLY (arg1
))
2401 TREE_READONLY (t
) = 0;
2402 if (!TREE_CONSTANT (arg1
))
2406 else if (length
== 1)
2408 register tree arg0
= va_arg (p
, tree
);
2410 /* The only one-operand cases we handle here are those with side-effects.
2411 Others are handled with build1. So don't bother checked if the
2412 arg has side-effects since we'll already have set it.
2414 ??? This really should use build1 too. */
2415 if (TREE_CODE_CLASS (code
) != 's')
2417 TREE_OPERAND (t
, 0) = arg0
;
2421 for (i
= 0; i
< length
; i
++)
2423 register tree operand
= va_arg (p
, tree
);
2425 TREE_OPERAND (t
, i
) = operand
;
2426 if (operand
&& fro
> i
)
2428 if (TREE_SIDE_EFFECTS (operand
))
2429 TREE_SIDE_EFFECTS (t
) = 1;
2430 if (!TREE_CONSTANT (operand
))
2437 TREE_CONSTANT (t
) = constant
;
2441 /* Same as above, but only builds for unary operators.
2442 Saves lions share of calls to `build'; cuts down use
2443 of varargs, which is expensive for RISC machines. */
2446 build1 (code
, type
, node
)
2447 enum tree_code code
;
2451 register int length
;
2452 #ifdef GATHER_STATISTICS
2453 register tree_node_kind kind
;
2457 #ifdef GATHER_STATISTICS
2458 if (TREE_CODE_CLASS (code
) == 'r')
2464 #ifdef ENABLE_CHECKING
2465 if (TREE_CODE_CLASS (code
) == '2'
2466 || TREE_CODE_CLASS (code
) == '<'
2467 || TREE_CODE_LENGTH (code
) != 1)
2469 #endif /* ENABLE_CHECKING */
2471 length
= sizeof (struct tree_exp
);
2473 t
= ggc_alloc_tree (length
);
2475 memset ((PTR
) t
, 0, sizeof (struct tree_common
));
2477 #ifdef GATHER_STATISTICS
2478 tree_node_counts
[(int) kind
]++;
2479 tree_node_sizes
[(int) kind
] += length
;
2482 TREE_SET_CODE (t
, code
);
2484 TREE_TYPE (t
) = type
;
2485 TREE_COMPLEXITY (t
) = 0;
2486 TREE_OPERAND (t
, 0) = node
;
2487 if (node
&& first_rtl_op (code
) != 0)
2489 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2490 TREE_READONLY (t
) = TREE_READONLY (node
);
2499 case PREDECREMENT_EXPR
:
2500 case PREINCREMENT_EXPR
:
2501 case POSTDECREMENT_EXPR
:
2502 case POSTINCREMENT_EXPR
:
2503 /* All of these have side-effects, no matter what their
2505 TREE_SIDE_EFFECTS (t
) = 1;
2506 TREE_READONLY (t
) = 0;
2510 if (TREE_CODE_CLASS (code
) == '1' && node
&& TREE_CONSTANT (node
))
2511 TREE_CONSTANT (t
) = 1;
2518 /* Similar except don't specify the TREE_TYPE
2519 and leave the TREE_SIDE_EFFECTS as 0.
2520 It is permissible for arguments to be null,
2521 or even garbage if their values do not matter. */
2524 build_nt
VPARAMS ((enum tree_code code
, ...))
2526 #ifndef ANSI_PROTOTYPES
2527 enum tree_code code
;
2531 register int length
;
2536 #ifndef ANSI_PROTOTYPES
2537 code
= va_arg (p
, enum tree_code
);
2540 t
= make_node (code
);
2541 length
= TREE_CODE_LENGTH (code
);
2543 for (i
= 0; i
< length
; i
++)
2544 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2551 /* Commented out because this wants to be done very
2552 differently. See cp-lex.c. */
2554 build_op_identifier (op1
, op2
)
2557 register tree t
= make_node (OP_IDENTIFIER
);
2558 TREE_PURPOSE (t
) = op1
;
2559 TREE_VALUE (t
) = op2
;
2564 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2565 We do NOT enter this node in any sort of symbol table.
2567 layout_decl is used to set up the decl's storage layout.
2568 Other slots are initialized to 0 or null pointers. */
2571 build_decl (code
, name
, type
)
2572 enum tree_code code
;
2577 t
= make_node (code
);
2579 /* if (type == error_mark_node)
2580 type = integer_type_node; */
2581 /* That is not done, deliberately, so that having error_mark_node
2582 as the type can suppress useless errors in the use of this variable. */
2584 DECL_NAME (t
) = name
;
2585 TREE_TYPE (t
) = type
;
2587 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2589 else if (code
== FUNCTION_DECL
)
2590 DECL_MODE (t
) = FUNCTION_MODE
;
2595 /* BLOCK nodes are used to represent the structure of binding contours
2596 and declarations, once those contours have been exited and their contents
2597 compiled. This information is used for outputting debugging info. */
2600 build_block (vars
, tags
, subblocks
, supercontext
, chain
)
2601 tree vars
, tags ATTRIBUTE_UNUSED
, subblocks
, supercontext
, chain
;
2603 register tree block
= make_node (BLOCK
);
2605 BLOCK_VARS (block
) = vars
;
2606 BLOCK_SUBBLOCKS (block
) = subblocks
;
2607 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2608 BLOCK_CHAIN (block
) = chain
;
2612 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2613 location where an expression or an identifier were encountered. It
2614 is necessary for languages where the frontend parser will handle
2615 recursively more than one file (Java is one of them). */
2618 build_expr_wfl (node
, file
, line
, col
)
2623 static const char *last_file
= 0;
2624 static tree last_filenode
= NULL_TREE
;
2625 register tree wfl
= make_node (EXPR_WITH_FILE_LOCATION
);
2627 EXPR_WFL_NODE (wfl
) = node
;
2628 EXPR_WFL_SET_LINECOL (wfl
, line
, col
);
2629 if (file
!= last_file
)
2632 last_filenode
= file
? get_identifier (file
) : NULL_TREE
;
2635 EXPR_WFL_FILENAME_NODE (wfl
) = last_filenode
;
2638 TREE_SIDE_EFFECTS (wfl
) = TREE_SIDE_EFFECTS (node
);
2639 TREE_TYPE (wfl
) = TREE_TYPE (node
);
2645 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
2649 build_decl_attribute_variant (ddecl
, attribute
)
2650 tree ddecl
, attribute
;
2652 DECL_MACHINE_ATTRIBUTES (ddecl
) = attribute
;
2656 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2659 Record such modified types already made so we don't make duplicates. */
2662 build_type_attribute_variant (ttype
, attribute
)
2663 tree ttype
, attribute
;
2665 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2667 unsigned int hashcode
;
2670 ntype
= copy_node (ttype
);
2672 TYPE_POINTER_TO (ntype
) = 0;
2673 TYPE_REFERENCE_TO (ntype
) = 0;
2674 TYPE_ATTRIBUTES (ntype
) = attribute
;
2676 /* Create a new main variant of TYPE. */
2677 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2678 TYPE_NEXT_VARIANT (ntype
) = 0;
2679 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2681 hashcode
= (TYPE_HASH (TREE_CODE (ntype
))
2682 + TYPE_HASH (TREE_TYPE (ntype
))
2683 + attribute_hash_list (attribute
));
2685 switch (TREE_CODE (ntype
))
2688 hashcode
+= TYPE_HASH (TYPE_ARG_TYPES (ntype
));
2691 hashcode
+= TYPE_HASH (TYPE_DOMAIN (ntype
));
2694 hashcode
+= TYPE_HASH (TYPE_MAX_VALUE (ntype
));
2697 hashcode
+= TYPE_HASH (TYPE_PRECISION (ntype
));
2703 ntype
= type_hash_canon (hashcode
, ntype
);
2704 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2710 /* Return 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration
2711 DECL or type TYPE and 0 otherwise. Validity is determined the
2712 target functions valid_decl_attribute and valid_machine_attribute. */
2715 valid_machine_attribute (attr_name
, attr_args
, decl
, type
)
2721 if (TREE_CODE (attr_name
) != IDENTIFIER_NODE
)
2724 if (decl
&& target
.valid_decl_attribute
!= NULL
)
2726 tree decl_attrs
= DECL_MACHINE_ATTRIBUTES (decl
);
2728 if ((*target
.valid_decl_attribute
) (decl
, decl_attrs
, attr_name
,
2731 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
2734 if (attr
!= NULL_TREE
)
2736 /* Override existing arguments. Declarations are unique
2737 so we can modify this in place. */
2738 TREE_VALUE (attr
) = attr_args
;
2742 decl_attrs
= tree_cons (attr_name
, attr_args
, decl_attrs
);
2743 decl
= build_decl_attribute_variant (decl
, decl_attrs
);
2746 /* Don't apply the attribute to both the decl and the type. */
2751 if (target
.valid_type_attribute
!= NULL
)
2753 tree type_attrs
= TYPE_ATTRIBUTES (type
);
2755 if ((*target
.valid_type_attribute
) (type
, type_attrs
, attr_name
,
2758 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
2761 if (attr
!= NULL_TREE
)
2763 /* Override existing arguments. ??? This currently
2764 works since attribute arguments are not included in
2765 `attribute_hash_list'. Something more complicated
2766 may be needed in the future. */
2767 TREE_VALUE (attr
) = attr_args
;
2771 /* If this is part of a declaration, create a type variant,
2772 otherwise, this is part of a type definition, so add it
2773 to the base type. */
2774 type_attrs
= tree_cons (attr_name
, attr_args
, type_attrs
);
2776 type
= build_type_attribute_variant (type
, type_attrs
);
2778 TYPE_ATTRIBUTES (type
) = type_attrs
;
2782 TREE_TYPE (decl
) = type
;
2787 /* Handle putting a type attribute on pointer-to-function-type
2788 by putting the attribute on the function type. */
2789 else if (POINTER_TYPE_P (type
)
2790 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
2791 && (*target
.valid_type_attribute
) (TREE_TYPE (type
), type_attrs
,
2792 attr_name
, attr_args
))
2794 tree inner_type
= TREE_TYPE (type
);
2795 tree inner_attrs
= TYPE_ATTRIBUTES (inner_type
);
2796 tree attr
= lookup_attribute (IDENTIFIER_POINTER (attr_name
),
2799 if (attr
!= NULL_TREE
)
2800 TREE_VALUE (attr
) = attr_args
;
2803 inner_attrs
= tree_cons (attr_name
, attr_args
, inner_attrs
);
2804 inner_type
= build_type_attribute_variant (inner_type
,
2809 TREE_TYPE (decl
) = build_pointer_type (inner_type
);
2812 /* Clear TYPE_POINTER_TO for the old inner type, since
2813 `type' won't be pointing to it anymore. */
2814 TYPE_POINTER_TO (TREE_TYPE (type
)) = NULL_TREE
;
2815 TREE_TYPE (type
) = inner_type
;
2825 /* Return non-zero if IDENT is a valid name for attribute ATTR,
2828 We try both `text' and `__text__', ATTR may be either one. */
2829 /* ??? It might be a reasonable simplification to require ATTR to be only
2830 `text'. One might then also require attribute lists to be stored in
2831 their canonicalized form. */
2834 is_attribute_p (attr
, ident
)
2838 int ident_len
, attr_len
;
2841 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2844 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2847 p
= IDENTIFIER_POINTER (ident
);
2848 ident_len
= strlen (p
);
2849 attr_len
= strlen (attr
);
2851 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2855 || attr
[attr_len
- 2] != '_'
2856 || attr
[attr_len
- 1] != '_')
2858 if (ident_len
== attr_len
- 4
2859 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2864 if (ident_len
== attr_len
+ 4
2865 && p
[0] == '_' && p
[1] == '_'
2866 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2867 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2874 /* Given an attribute name and a list of attributes, return a pointer to the
2875 attribute's list element if the attribute is part of the list, or NULL_TREE
2879 lookup_attribute (attr_name
, list
)
2880 const char *attr_name
;
2885 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2887 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
2889 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2896 /* Return an attribute list that is the union of a1 and a2. */
2899 merge_attributes (a1
, a2
)
2900 register tree a1
, a2
;
2904 /* Either one unset? Take the set one. */
2906 if ((attributes
= a1
) == 0)
2909 /* One that completely contains the other? Take it. */
2911 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2913 if (attribute_list_contained (a2
, a1
))
2917 /* Pick the longest list, and hang on the other list. */
2918 /* ??? For the moment we punt on the issue of attrs with args. */
2920 if (list_length (a1
) < list_length (a2
))
2921 attributes
= a2
, a2
= a1
;
2923 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
2924 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2925 attributes
) == NULL_TREE
)
2927 a1
= copy_node (a2
);
2928 TREE_CHAIN (a1
) = attributes
;
2936 /* Given types T1 and T2, merge their attributes and return
2940 merge_type_attributes (t1
, t2
)
2943 return merge_attributes (TYPE_ATTRIBUTES (t1
),
2944 TYPE_ATTRIBUTES (t2
));
2947 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2951 merge_decl_attributes (olddecl
, newdecl
)
2952 tree olddecl
, newdecl
;
2954 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl
),
2955 DECL_MACHINE_ATTRIBUTES (newdecl
));
2958 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2960 /* Specialization of merge_decl_attributes for various Windows targets.
2962 This handles the following situation:
2964 __declspec (dllimport) int foo;
2967 The second instance of `foo' nullifies the dllimport. */
2970 merge_dllimport_decl_attributes (old
, new)
2975 int delete_dllimport_p
;
2977 old
= DECL_MACHINE_ATTRIBUTES (old
);
2978 new = DECL_MACHINE_ATTRIBUTES (new);
2980 /* What we need to do here is remove from `old' dllimport if it doesn't
2981 appear in `new'. dllimport behaves like extern: if a declaration is
2982 marked dllimport and a definition appears later, then the object
2983 is not dllimport'd. */
2984 if (lookup_attribute ("dllimport", old
) != NULL_TREE
2985 && lookup_attribute ("dllimport", new) == NULL_TREE
)
2986 delete_dllimport_p
= 1;
2988 delete_dllimport_p
= 0;
2990 a
= merge_attributes (old
, new);
2992 if (delete_dllimport_p
)
2996 /* Scan the list for dllimport and delete it. */
2997 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
2999 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3001 if (prev
== NULL_TREE
)
3004 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3013 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3015 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3016 of the various TYPE_QUAL values. */
3019 set_type_quals (type
, type_quals
)
3023 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3024 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3025 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3028 /* Return a version of the TYPE, qualified as indicated by the
3029 TYPE_QUALS, if one exists. If no qualified version exists yet,
3030 return NULL_TREE. */
3033 get_qualified_type (type
, type_quals
)
3039 /* Search the chain of variants to see if there is already one there just
3040 like the one we need to have. If so, use that existing one. We must
3041 preserve the TYPE_NAME, since there is code that depends on this. */
3042 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3043 if (TYPE_QUALS (t
) == type_quals
&& TYPE_NAME (t
) == TYPE_NAME (type
))
3049 /* Like get_qualified_type, but creates the type if it does not
3050 exist. This function never returns NULL_TREE. */
3053 build_qualified_type (type
, type_quals
)
3059 /* See if we already have the appropriate qualified variant. */
3060 t
= get_qualified_type (type
, type_quals
);
3062 /* If not, build it. */
3065 t
= build_type_copy (type
);
3066 set_type_quals (t
, type_quals
);
3072 /* Create a new variant of TYPE, equivalent but distinct.
3073 This is so the caller can modify it. */
3076 build_type_copy (type
)
3079 register tree t
, m
= TYPE_MAIN_VARIANT (type
);
3081 t
= copy_node (type
);
3083 TYPE_POINTER_TO (t
) = 0;
3084 TYPE_REFERENCE_TO (t
) = 0;
3086 /* Add this type to the chain of variants of TYPE. */
3087 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3088 TYPE_NEXT_VARIANT (m
) = t
;
3093 /* Hashing of types so that we don't make duplicates.
3094 The entry point is `type_hash_canon'. */
3096 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3097 with types in the TREE_VALUE slots), by adding the hash codes
3098 of the individual types. */
3101 type_hash_list (list
)
3104 unsigned int hashcode
;
3107 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3108 hashcode
+= TYPE_HASH (TREE_VALUE (tail
));
3113 /* These are the Hashtable callback functions. */
3115 /* Returns true if the types are equal. */
3118 type_hash_eq (va
, vb
)
3122 const struct type_hash
*a
= va
, *b
= vb
;
3123 if (a
->hash
== b
->hash
3124 && TREE_CODE (a
->type
) == TREE_CODE (b
->type
)
3125 && TREE_TYPE (a
->type
) == TREE_TYPE (b
->type
)
3126 && attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3127 TYPE_ATTRIBUTES (b
->type
))
3128 && TYPE_ALIGN (a
->type
) == TYPE_ALIGN (b
->type
)
3129 && (TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3130 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3131 TYPE_MAX_VALUE (b
->type
)))
3132 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3133 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3134 TYPE_MIN_VALUE (b
->type
)))
3135 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3136 && (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
3137 || (TYPE_DOMAIN (a
->type
)
3138 && TREE_CODE (TYPE_DOMAIN (a
->type
)) == TREE_LIST
3139 && TYPE_DOMAIN (b
->type
)
3140 && TREE_CODE (TYPE_DOMAIN (b
->type
)) == TREE_LIST
3141 && type_list_equal (TYPE_DOMAIN (a
->type
),
3142 TYPE_DOMAIN (b
->type
)))))
3147 /* Return the cached hash value. */
3150 type_hash_hash (item
)
3153 return ((const struct type_hash
*) item
)->hash
;
3156 /* Look in the type hash table for a type isomorphic to TYPE.
3157 If one is found, return it. Otherwise return 0. */
3160 type_hash_lookup (hashcode
, type
)
3161 unsigned int hashcode
;
3164 struct type_hash
*h
, in
;
3166 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3167 must call that routine before comparing TYPE_ALIGNs. */
3173 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3179 /* Add an entry to the type-hash-table
3180 for a type TYPE whose hash code is HASHCODE. */
3183 type_hash_add (hashcode
, type
)
3184 unsigned int hashcode
;
3187 struct type_hash
*h
;
3190 h
= (struct type_hash
*) permalloc (sizeof (struct type_hash
));
3193 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3194 *(struct type_hash
**) loc
= h
;
3197 /* Given TYPE, and HASHCODE its hash code, return the canonical
3198 object for an identical type if one already exists.
3199 Otherwise, return TYPE, and record it as the canonical object
3200 if it is a permanent object.
3202 To use this function, first create a type of the sort you want.
3203 Then compute its hash code from the fields of the type that
3204 make it different from other similar types.
3205 Then call this function and use the value.
3206 This function frees the type you pass in if it is a duplicate. */
3208 /* Set to 1 to debug without canonicalization. Never set by program. */
3209 int debug_no_type_hash
= 0;
3212 type_hash_canon (hashcode
, type
)
3213 unsigned int hashcode
;
3218 if (debug_no_type_hash
)
3221 t1
= type_hash_lookup (hashcode
, type
);
3224 #ifdef GATHER_STATISTICS
3225 tree_node_counts
[(int) t_kind
]--;
3226 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3231 /* If this is a permanent type, record it for later reuse. */
3232 type_hash_add (hashcode
, type
);
3237 /* Callback function for htab_traverse. */
3240 mark_hash_entry (entry
, param
)
3242 void *param ATTRIBUTE_UNUSED
;
3244 struct type_hash
*p
= *(struct type_hash
**) entry
;
3246 ggc_mark_tree (p
->type
);
3248 /* Continue scan. */
3252 /* Mark ARG (which is really a htab_t *) for GC. */
3255 mark_type_hash (arg
)
3258 htab_t t
= *(htab_t
*) arg
;
3260 htab_traverse (t
, mark_hash_entry
, 0);
3263 /* Mark the hashtable slot pointed to by ENTRY (which is really a
3264 `tree**') for GC. */
3267 mark_tree_hashtable_entry (entry
, data
)
3269 void *data ATTRIBUTE_UNUSED
;
3271 ggc_mark_tree ((tree
) *entry
);
3275 /* Mark ARG (which is really a htab_t whose slots are trees) for
3279 mark_tree_hashtable (arg
)
3282 htab_t t
= *(htab_t
*) arg
;
3283 htab_traverse (t
, mark_tree_hashtable_entry
, 0);
3287 print_type_hash_statistics ()
3289 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3290 (long) htab_size (type_hash_table
),
3291 (long) htab_elements (type_hash_table
),
3292 htab_collisions (type_hash_table
));
3295 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3296 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3297 by adding the hash codes of the individual attributes. */
3300 attribute_hash_list (list
)
3303 unsigned int hashcode
;
3306 for (hashcode
= 0, tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3307 /* ??? Do we want to add in TREE_VALUE too? */
3308 hashcode
+= TYPE_HASH (TREE_PURPOSE (tail
));
3312 /* Given two lists of attributes, return true if list l2 is
3313 equivalent to l1. */
3316 attribute_list_equal (l1
, l2
)
3319 return attribute_list_contained (l1
, l2
)
3320 && attribute_list_contained (l2
, l1
);
3323 /* Given two lists of attributes, return true if list L2 is
3324 completely contained within L1. */
3325 /* ??? This would be faster if attribute names were stored in a canonicalized
3326 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3327 must be used to show these elements are equivalent (which they are). */
3328 /* ??? It's not clear that attributes with arguments will always be handled
3332 attribute_list_contained (l1
, l2
)
3335 register tree t1
, t2
;
3337 /* First check the obvious, maybe the lists are identical. */
3341 /* Maybe the lists are similar. */
3342 for (t1
= l1
, t2
= l2
;
3344 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3345 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3346 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3348 /* Maybe the lists are equal. */
3349 if (t1
== 0 && t2
== 0)
3352 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3355 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3360 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3367 /* Given two lists of types
3368 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3369 return 1 if the lists contain the same types in the same order.
3370 Also, the TREE_PURPOSEs must match. */
3373 type_list_equal (l1
, l2
)
3376 register tree t1
, t2
;
3378 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3379 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3380 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3381 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3382 && (TREE_TYPE (TREE_PURPOSE (t1
))
3383 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3389 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3390 given by TYPE. If the argument list accepts variable arguments,
3391 then this function counts only the ordinary arguments. */
3394 type_num_arguments (type
)
3400 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3401 /* If the function does not take a variable number of arguments,
3402 the last element in the list will have type `void'. */
3403 if (VOID_TYPE_P (TREE_VALUE (t
)))
3411 /* Nonzero if integer constants T1 and T2
3412 represent the same constant value. */
3415 tree_int_cst_equal (t1
, t2
)
3421 if (t1
== 0 || t2
== 0)
3424 if (TREE_CODE (t1
) == INTEGER_CST
3425 && TREE_CODE (t2
) == INTEGER_CST
3426 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3427 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3433 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3434 The precise way of comparison depends on their data type. */
3437 tree_int_cst_lt (t1
, t2
)
3443 if (! TREE_UNSIGNED (TREE_TYPE (t1
)))
3444 return INT_CST_LT (t1
, t2
);
3446 return INT_CST_LT_UNSIGNED (t1
, t2
);
3449 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3452 tree_int_cst_compare (t1
, t2
)
3456 if (tree_int_cst_lt (t1
, t2
))
3458 else if (tree_int_cst_lt (t2
, t1
))
3464 /* Return 1 if T is an INTEGER_CST that can be represented in a single
3465 HOST_WIDE_INT value. If POS is nonzero, the result must be positive. */
3468 host_integerp (t
, pos
)
3472 return (TREE_CODE (t
) == INTEGER_CST
3473 && ! TREE_OVERFLOW (t
)
3474 && ((TREE_INT_CST_HIGH (t
) == 0
3475 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3476 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3477 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
3478 || (! pos
&& TREE_INT_CST_HIGH (t
) == 0
3479 && TREE_UNSIGNED (TREE_TYPE (t
)))));
3482 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3483 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3484 be positive. Abort if we cannot satisfy the above conditions. */
3487 tree_low_cst (t
, pos
)
3491 if (host_integerp (t
, pos
))
3492 return TREE_INT_CST_LOW (t
);
3497 /* Return the most significant bit of the integer constant T. */
3500 tree_int_cst_msb (t
)
3505 unsigned HOST_WIDE_INT l
;
3507 /* Note that using TYPE_PRECISION here is wrong. We care about the
3508 actual bits, not the (arbitrary) range of the type. */
3509 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3510 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3511 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3512 return (l
& 1) == 1;
3515 /* Return an indication of the sign of the integer constant T.
3516 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3517 Note that -1 will never be returned it T's type is unsigned. */
3520 tree_int_cst_sgn (t
)
3523 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3525 else if (TREE_UNSIGNED (TREE_TYPE (t
)))
3527 else if (TREE_INT_CST_HIGH (t
) < 0)
3533 /* Compare two constructor-element-type constants. Return 1 if the lists
3534 are known to be equal; otherwise return 0. */
3537 simple_cst_list_equal (l1
, l2
)
3540 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3542 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3545 l1
= TREE_CHAIN (l1
);
3546 l2
= TREE_CHAIN (l2
);
3552 /* Return truthvalue of whether T1 is the same tree structure as T2.
3553 Return 1 if they are the same.
3554 Return 0 if they are understandably different.
3555 Return -1 if either contains tree structure not understood by
3559 simple_cst_equal (t1
, t2
)
3562 register enum tree_code code1
, code2
;
3568 if (t1
== 0 || t2
== 0)
3571 code1
= TREE_CODE (t1
);
3572 code2
= TREE_CODE (t2
);
3574 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3576 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3577 || code2
== NON_LVALUE_EXPR
)
3578 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3580 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3583 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3584 || code2
== NON_LVALUE_EXPR
)
3585 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3593 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3594 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3597 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3600 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3601 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3602 TREE_STRING_LENGTH (t1
)));
3605 if (CONSTRUCTOR_ELTS (t1
) == CONSTRUCTOR_ELTS (t2
))
3611 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3614 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3618 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3621 /* Special case: if either target is an unallocated VAR_DECL,
3622 it means that it's going to be unified with whatever the
3623 TARGET_EXPR is really supposed to initialize, so treat it
3624 as being equivalent to anything. */
3625 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3626 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3627 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3628 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3629 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3630 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3633 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3638 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3640 case WITH_CLEANUP_EXPR
:
3641 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3645 return simple_cst_equal (TREE_OPERAND (t1
, 2), TREE_OPERAND (t1
, 2));
3648 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3649 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3663 /* This general rule works for most tree codes. All exceptions should be
3664 handled above. If this is a language-specific tree code, we can't
3665 trust what might be in the operand, so say we don't know
3667 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3670 switch (TREE_CODE_CLASS (code1
))
3679 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3681 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3693 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3694 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3695 than U, respectively. */
3698 compare_tree_int (t
, u
)
3702 if (tree_int_cst_sgn (t
) < 0)
3704 else if (TREE_INT_CST_HIGH (t
) != 0)
3706 else if (TREE_INT_CST_LOW (t
) == u
)
3708 else if (TREE_INT_CST_LOW (t
) < u
)
3714 /* Constructors for pointer, array and function types.
3715 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3716 constructed by language-dependent code, not here.) */
3718 /* Construct, lay out and return the type of pointers to TO_TYPE.
3719 If such a type has already been constructed, reuse it. */
3722 build_pointer_type (to_type
)
3725 register tree t
= TYPE_POINTER_TO (to_type
);
3727 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3732 /* We need a new one. */
3733 t
= make_node (POINTER_TYPE
);
3735 TREE_TYPE (t
) = to_type
;
3737 /* Record this type as the pointer to TO_TYPE. */
3738 TYPE_POINTER_TO (to_type
) = t
;
3740 /* Lay out the type. This function has many callers that are concerned
3741 with expression-construction, and this simplifies them all.
3742 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3748 /* Build the node for the type of references-to-TO_TYPE. */
3751 build_reference_type (to_type
)
3754 register tree t
= TYPE_REFERENCE_TO (to_type
);
3756 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3761 /* We need a new one. */
3762 t
= make_node (REFERENCE_TYPE
);
3764 TREE_TYPE (t
) = to_type
;
3766 /* Record this type as the pointer to TO_TYPE. */
3767 TYPE_REFERENCE_TO (to_type
) = t
;
3774 /* Build a type that is compatible with t but has no cv quals anywhere
3777 const char *const *const * -> char ***. */
3780 build_type_no_quals (t
)
3783 switch (TREE_CODE (t
))
3786 return build_pointer_type (build_type_no_quals (TREE_TYPE (t
)));
3787 case REFERENCE_TYPE
:
3788 return build_reference_type (build_type_no_quals (TREE_TYPE (t
)));
3790 return TYPE_MAIN_VARIANT (t
);
3794 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3795 MAXVAL should be the maximum value in the domain
3796 (one less than the length of the array).
3798 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3799 We don't enforce this limit, that is up to caller (e.g. language front end).
3800 The limit exists because the result is a signed type and we don't handle
3801 sizes that use more than one HOST_WIDE_INT. */
3804 build_index_type (maxval
)
3807 register tree itype
= make_node (INTEGER_TYPE
);
3809 TREE_TYPE (itype
) = sizetype
;
3810 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
3811 TYPE_MIN_VALUE (itype
) = size_zero_node
;
3812 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
3813 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
3814 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
3815 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
3816 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
3817 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
3819 if (host_integerp (maxval
, 1))
3820 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
3825 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3826 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3827 low bound LOWVAL and high bound HIGHVAL.
3828 if TYPE==NULL_TREE, sizetype is used. */
3831 build_range_type (type
, lowval
, highval
)
3832 tree type
, lowval
, highval
;
3834 register tree itype
= make_node (INTEGER_TYPE
);
3836 TREE_TYPE (itype
) = type
;
3837 if (type
== NULL_TREE
)
3840 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
3841 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
3843 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
3844 TYPE_MODE (itype
) = TYPE_MODE (type
);
3845 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
3846 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
3847 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
3848 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
3850 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
3851 return type_hash_canon (tree_low_cst (highval
, 0)
3852 - tree_low_cst (lowval
, 0),
3858 /* Just like build_index_type, but takes lowval and highval instead
3859 of just highval (maxval). */
3862 build_index_2_type (lowval
,highval
)
3863 tree lowval
, highval
;
3865 return build_range_type (sizetype
, lowval
, highval
);
3868 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
3869 Needed because when index types are not hashed, equal index types
3870 built at different times appear distinct, even though structurally,
3874 index_type_equal (itype1
, itype2
)
3875 tree itype1
, itype2
;
3877 if (TREE_CODE (itype1
) != TREE_CODE (itype2
))
3880 if (TREE_CODE (itype1
) == INTEGER_TYPE
)
3882 if (TYPE_PRECISION (itype1
) != TYPE_PRECISION (itype2
)
3883 || TYPE_MODE (itype1
) != TYPE_MODE (itype2
)
3884 || simple_cst_equal (TYPE_SIZE (itype1
), TYPE_SIZE (itype2
)) != 1
3885 || TYPE_ALIGN (itype1
) != TYPE_ALIGN (itype2
))
3888 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1
),
3889 TYPE_MIN_VALUE (itype2
))
3890 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1
),
3891 TYPE_MAX_VALUE (itype2
)))
3898 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3899 and number of elements specified by the range of values of INDEX_TYPE.
3900 If such a type has already been constructed, reuse it. */
3903 build_array_type (elt_type
, index_type
)
3904 tree elt_type
, index_type
;
3907 unsigned int hashcode
;
3909 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
3911 error ("arrays of functions are not meaningful");
3912 elt_type
= integer_type_node
;
3915 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3916 build_pointer_type (elt_type
);
3918 /* Allocate the array after the pointer type,
3919 in case we free it in type_hash_canon. */
3920 t
= make_node (ARRAY_TYPE
);
3921 TREE_TYPE (t
) = elt_type
;
3922 TYPE_DOMAIN (t
) = index_type
;
3924 if (index_type
== 0)
3929 hashcode
= TYPE_HASH (elt_type
) + TYPE_HASH (index_type
);
3930 t
= type_hash_canon (hashcode
, t
);
3932 if (!COMPLETE_TYPE_P (t
))
3937 /* Return the TYPE of the elements comprising
3938 the innermost dimension of ARRAY. */
3941 get_inner_array_type (array
)
3944 tree type
= TREE_TYPE (array
);
3946 while (TREE_CODE (type
) == ARRAY_TYPE
)
3947 type
= TREE_TYPE (type
);
3952 /* Construct, lay out and return
3953 the type of functions returning type VALUE_TYPE
3954 given arguments of types ARG_TYPES.
3955 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3956 are data type nodes for the arguments of the function.
3957 If such a type has already been constructed, reuse it. */
3960 build_function_type (value_type
, arg_types
)
3961 tree value_type
, arg_types
;
3964 unsigned int hashcode
;
3966 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
3968 error ("function return type cannot be function");
3969 value_type
= integer_type_node
;
3972 /* Make a node of the sort we want. */
3973 t
= make_node (FUNCTION_TYPE
);
3974 TREE_TYPE (t
) = value_type
;
3975 TYPE_ARG_TYPES (t
) = arg_types
;
3977 /* If we already have such a type, use the old one and free this one. */
3978 hashcode
= TYPE_HASH (value_type
) + type_hash_list (arg_types
);
3979 t
= type_hash_canon (hashcode
, t
);
3981 if (!COMPLETE_TYPE_P (t
))
3986 /* Construct, lay out and return the type of methods belonging to class
3987 BASETYPE and whose arguments and values are described by TYPE.
3988 If that type exists already, reuse it.
3989 TYPE must be a FUNCTION_TYPE node. */
3992 build_method_type (basetype
, type
)
3993 tree basetype
, type
;
3996 unsigned int hashcode
;
3998 /* Make a node of the sort we want. */
3999 t
= make_node (METHOD_TYPE
);
4001 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4004 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4005 TREE_TYPE (t
) = TREE_TYPE (type
);
4007 /* The actual arglist for this function includes a "hidden" argument
4008 which is "this". Put it into the list of argument types. */
4011 = tree_cons (NULL_TREE
,
4012 build_pointer_type (basetype
), TYPE_ARG_TYPES (type
));
4014 /* If we already have such a type, use the old one and free this one. */
4015 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4016 t
= type_hash_canon (hashcode
, t
);
4018 if (!COMPLETE_TYPE_P (t
))
4024 /* Construct, lay out and return the type of offsets to a value
4025 of type TYPE, within an object of type BASETYPE.
4026 If a suitable offset type exists already, reuse it. */
4029 build_offset_type (basetype
, type
)
4030 tree basetype
, type
;
4033 unsigned int hashcode
;
4035 /* Make a node of the sort we want. */
4036 t
= make_node (OFFSET_TYPE
);
4038 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4039 TREE_TYPE (t
) = type
;
4041 /* If we already have such a type, use the old one and free this one. */
4042 hashcode
= TYPE_HASH (basetype
) + TYPE_HASH (type
);
4043 t
= type_hash_canon (hashcode
, t
);
4045 if (!COMPLETE_TYPE_P (t
))
4051 /* Create a complex type whose components are COMPONENT_TYPE. */
4054 build_complex_type (component_type
)
4055 tree component_type
;
4058 unsigned int hashcode
;
4060 /* Make a node of the sort we want. */
4061 t
= make_node (COMPLEX_TYPE
);
4063 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4064 set_type_quals (t
, TYPE_QUALS (component_type
));
4066 /* If we already have such a type, use the old one and free this one. */
4067 hashcode
= TYPE_HASH (component_type
);
4068 t
= type_hash_canon (hashcode
, t
);
4070 if (!COMPLETE_TYPE_P (t
))
4073 /* If we are writing Dwarf2 output we need to create a name,
4074 since complex is a fundamental type. */
4075 if (write_symbols
== DWARF2_DEBUG
&& ! TYPE_NAME (t
))
4078 if (component_type
== char_type_node
)
4079 name
= "complex char";
4080 else if (component_type
== signed_char_type_node
)
4081 name
= "complex signed char";
4082 else if (component_type
== unsigned_char_type_node
)
4083 name
= "complex unsigned char";
4084 else if (component_type
== short_integer_type_node
)
4085 name
= "complex short int";
4086 else if (component_type
== short_unsigned_type_node
)
4087 name
= "complex short unsigned int";
4088 else if (component_type
== integer_type_node
)
4089 name
= "complex int";
4090 else if (component_type
== unsigned_type_node
)
4091 name
= "complex unsigned int";
4092 else if (component_type
== long_integer_type_node
)
4093 name
= "complex long int";
4094 else if (component_type
== long_unsigned_type_node
)
4095 name
= "complex long unsigned int";
4096 else if (component_type
== long_long_integer_type_node
)
4097 name
= "complex long long int";
4098 else if (component_type
== long_long_unsigned_type_node
)
4099 name
= "complex long long unsigned int";
4104 TYPE_NAME (t
) = get_identifier (name
);
4110 /* Return OP, stripped of any conversions to wider types as much as is safe.
4111 Converting the value back to OP's type makes a value equivalent to OP.
4113 If FOR_TYPE is nonzero, we return a value which, if converted to
4114 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4116 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4117 narrowest type that can hold the value, even if they don't exactly fit.
4118 Otherwise, bit-field references are changed to a narrower type
4119 only if they can be fetched directly from memory in that type.
4121 OP must have integer, real or enumeral type. Pointers are not allowed!
4123 There are some cases where the obvious value we could return
4124 would regenerate to OP if converted to OP's type,
4125 but would not extend like OP to wider types.
4126 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4127 For example, if OP is (unsigned short)(signed char)-1,
4128 we avoid returning (signed char)-1 if FOR_TYPE is int,
4129 even though extending that to an unsigned short would regenerate OP,
4130 since the result of extending (signed char)-1 to (int)
4131 is different from (int) OP. */
4134 get_unwidened (op
, for_type
)
4138 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4139 register tree type
= TREE_TYPE (op
);
4140 register unsigned final_prec
4141 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4143 = (for_type
!= 0 && for_type
!= type
4144 && final_prec
> TYPE_PRECISION (type
)
4145 && TREE_UNSIGNED (type
));
4146 register tree win
= op
;
4148 while (TREE_CODE (op
) == NOP_EXPR
)
4150 register int bitschange
4151 = TYPE_PRECISION (TREE_TYPE (op
))
4152 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4154 /* Truncations are many-one so cannot be removed.
4155 Unless we are later going to truncate down even farther. */
4157 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4160 /* See what's inside this conversion. If we decide to strip it,
4162 op
= TREE_OPERAND (op
, 0);
4164 /* If we have not stripped any zero-extensions (uns is 0),
4165 we can strip any kind of extension.
4166 If we have previously stripped a zero-extension,
4167 only zero-extensions can safely be stripped.
4168 Any extension can be stripped if the bits it would produce
4169 are all going to be discarded later by truncating to FOR_TYPE. */
4173 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4175 /* TREE_UNSIGNED says whether this is a zero-extension.
4176 Let's avoid computing it if it does not affect WIN
4177 and if UNS will not be needed again. */
4178 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4179 && TREE_UNSIGNED (TREE_TYPE (op
)))
4187 if (TREE_CODE (op
) == COMPONENT_REF
4188 /* Since type_for_size always gives an integer type. */
4189 && TREE_CODE (type
) != REAL_TYPE
4190 /* Don't crash if field not laid out yet. */
4191 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4192 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4194 unsigned int innerprec
4195 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4197 type
= type_for_size (innerprec
, TREE_UNSIGNED (TREE_OPERAND (op
, 1)));
4199 /* We can get this structure field in the narrowest type it fits in.
4200 If FOR_TYPE is 0, do this only for a field that matches the
4201 narrower type exactly and is aligned for it
4202 The resulting extension to its nominal type (a fullword type)
4203 must fit the same conditions as for other extensions. */
4205 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4206 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4207 && (! uns
|| final_prec
<= innerprec
4208 || TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4211 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4212 TREE_OPERAND (op
, 1));
4213 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4214 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4221 /* Return OP or a simpler expression for a narrower value
4222 which can be sign-extended or zero-extended to give back OP.
4223 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4224 or 0 if the value should be sign-extended. */
4227 get_narrower (op
, unsignedp_ptr
)
4231 register int uns
= 0;
4233 register tree win
= op
;
4235 while (TREE_CODE (op
) == NOP_EXPR
)
4237 register int bitschange
4238 = (TYPE_PRECISION (TREE_TYPE (op
))
4239 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4241 /* Truncations are many-one so cannot be removed. */
4245 /* See what's inside this conversion. If we decide to strip it,
4247 op
= TREE_OPERAND (op
, 0);
4251 /* An extension: the outermost one can be stripped,
4252 but remember whether it is zero or sign extension. */
4254 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4255 /* Otherwise, if a sign extension has been stripped,
4256 only sign extensions can now be stripped;
4257 if a zero extension has been stripped, only zero-extensions. */
4258 else if (uns
!= TREE_UNSIGNED (TREE_TYPE (op
)))
4262 else /* bitschange == 0 */
4264 /* A change in nominal type can always be stripped, but we must
4265 preserve the unsignedness. */
4267 uns
= TREE_UNSIGNED (TREE_TYPE (op
));
4274 if (TREE_CODE (op
) == COMPONENT_REF
4275 /* Since type_for_size always gives an integer type. */
4276 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4277 /* Ensure field is laid out already. */
4278 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0)
4280 unsigned HOST_WIDE_INT innerprec
4281 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4282 tree type
= type_for_size (innerprec
, TREE_UNSIGNED (op
));
4284 /* We can get this structure field in a narrower type that fits it,
4285 but the resulting extension to its nominal type (a fullword type)
4286 must satisfy the same conditions as for other extensions.
4288 Do this only for fields that are aligned (not bit-fields),
4289 because when bit-field insns will be used there is no
4290 advantage in doing this. */
4292 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4293 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4294 && (first
|| uns
== TREE_UNSIGNED (TREE_OPERAND (op
, 1)))
4298 uns
= TREE_UNSIGNED (TREE_OPERAND (op
, 1));
4299 win
= build (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4300 TREE_OPERAND (op
, 1));
4301 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4302 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4305 *unsignedp_ptr
= uns
;
4309 /* Nonzero if integer constant C has a value that is permissible
4310 for type TYPE (an INTEGER_TYPE). */
4313 int_fits_type_p (c
, type
)
4316 /* If the bounds of the type are integers, we can check ourselves.
4317 Otherwise,. use force_fit_type, which checks against the precision. */
4318 if (TYPE_MAX_VALUE (type
) != NULL_TREE
4319 && TYPE_MIN_VALUE (type
) != NULL_TREE
4320 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
4321 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
4323 if (TREE_UNSIGNED (type
))
4324 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type
), c
)
4325 && ! INT_CST_LT_UNSIGNED (c
, TYPE_MIN_VALUE (type
))
4326 /* Negative ints never fit unsigned types. */
4327 && ! (TREE_INT_CST_HIGH (c
) < 0
4328 && ! TREE_UNSIGNED (TREE_TYPE (c
))));
4330 return (! INT_CST_LT (TYPE_MAX_VALUE (type
), c
)
4331 && ! INT_CST_LT (c
, TYPE_MIN_VALUE (type
))
4332 /* Unsigned ints with top bit set never fit signed types. */
4333 && ! (TREE_INT_CST_HIGH (c
) < 0
4334 && TREE_UNSIGNED (TREE_TYPE (c
))));
4339 TREE_TYPE (c
) = type
;
4340 return !force_fit_type (c
, 0);
4344 /* Given a DECL or TYPE, return the scope in which it was declared, or
4345 NULL_TREE if there is no containing scope. */
4348 get_containing_scope (t
)
4351 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4354 /* Return the innermost context enclosing DECL that is
4355 a FUNCTION_DECL, or zero if none. */
4358 decl_function_context (decl
)
4363 if (TREE_CODE (decl
) == ERROR_MARK
)
4366 if (TREE_CODE (decl
) == SAVE_EXPR
)
4367 context
= SAVE_EXPR_CONTEXT (decl
);
4369 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4370 where we look up the function at runtime. Such functions always take
4371 a first argument of type 'pointer to real context'.
4373 C++ should really be fixed to use DECL_CONTEXT for the real context,
4374 and use something else for the "virtual context". */
4375 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4378 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4380 context
= DECL_CONTEXT (decl
);
4382 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4384 if (TREE_CODE (context
) == BLOCK
)
4385 context
= BLOCK_SUPERCONTEXT (context
);
4387 context
= get_containing_scope (context
);
4393 /* Return the innermost context enclosing DECL that is
4394 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4395 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4398 decl_type_context (decl
)
4401 tree context
= DECL_CONTEXT (decl
);
4405 if (TREE_CODE (context
) == RECORD_TYPE
4406 || TREE_CODE (context
) == UNION_TYPE
4407 || TREE_CODE (context
) == QUAL_UNION_TYPE
)
4410 if (TREE_CODE (context
) == TYPE_DECL
4411 || TREE_CODE (context
) == FUNCTION_DECL
)
4412 context
= DECL_CONTEXT (context
);
4414 else if (TREE_CODE (context
) == BLOCK
)
4415 context
= BLOCK_SUPERCONTEXT (context
);
4418 /* Unhandled CONTEXT!? */
4424 /* CALL is a CALL_EXPR. Return the declaration for the function
4425 called, or NULL_TREE if the called function cannot be
4429 get_callee_fndecl (call
)
4434 /* It's invalid to call this function with anything but a
4436 if (TREE_CODE (call
) != CALL_EXPR
)
4439 /* The first operand to the CALL is the address of the function
4441 addr
= TREE_OPERAND (call
, 0);
4445 /* If this is a readonly function pointer, extract its initial value. */
4446 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
4447 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
4448 && DECL_INITIAL (addr
))
4449 addr
= DECL_INITIAL (addr
);
4451 /* If the address is just `&f' for some function `f', then we know
4452 that `f' is being called. */
4453 if (TREE_CODE (addr
) == ADDR_EXPR
4454 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4455 return TREE_OPERAND (addr
, 0);
4457 /* We couldn't figure out what was being called. */
4461 /* Print debugging information about the obstack O, named STR. */
4464 print_obstack_statistics (str
, o
)
4468 struct _obstack_chunk
*chunk
= o
->chunk
;
4472 n_alloc
+= o
->next_free
- chunk
->contents
;
4473 chunk
= chunk
->prev
;
4477 n_alloc
+= chunk
->limit
- &chunk
->contents
[0];
4478 chunk
= chunk
->prev
;
4480 fprintf (stderr
, "obstack %s: %u bytes, %d chunks\n",
4481 str
, n_alloc
, n_chunks
);
4484 /* Print debugging information about tree nodes generated during the compile,
4485 and any language-specific information. */
4488 dump_tree_statistics ()
4490 #ifdef GATHER_STATISTICS
4492 int total_nodes
, total_bytes
;
4495 fprintf (stderr
, "\n??? tree nodes created\n\n");
4496 #ifdef GATHER_STATISTICS
4497 fprintf (stderr
, "Kind Nodes Bytes\n");
4498 fprintf (stderr
, "-------------------------------------\n");
4499 total_nodes
= total_bytes
= 0;
4500 for (i
= 0; i
< (int) all_kinds
; i
++)
4502 fprintf (stderr
, "%-20s %6d %9d\n", tree_node_kind_names
[i
],
4503 tree_node_counts
[i
], tree_node_sizes
[i
]);
4504 total_nodes
+= tree_node_counts
[i
];
4505 total_bytes
+= tree_node_sizes
[i
];
4507 fprintf (stderr
, "%-20s %9d\n", "identifier names", id_string_size
);
4508 fprintf (stderr
, "-------------------------------------\n");
4509 fprintf (stderr
, "%-20s %6d %9d\n", "Total", total_nodes
, total_bytes
);
4510 fprintf (stderr
, "-------------------------------------\n");
4512 fprintf (stderr
, "(No per-node statistics)\n");
4514 print_obstack_statistics ("permanent_obstack", &permanent_obstack
);
4515 print_type_hash_statistics ();
4516 print_lang_statistics ();
4519 #define FILE_FUNCTION_PREFIX_LEN 9
4521 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4523 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4524 clashes in cases where we can't reliably choose a unique name.
4526 Derived from mkstemp.c in libiberty. */
4529 append_random_chars (template)
4532 static const char letters
[]
4533 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4534 static unsigned HOST_WIDE_INT value
;
4535 unsigned HOST_WIDE_INT v
;
4537 #ifdef HAVE_GETTIMEOFDAY
4541 template += strlen (template);
4543 #ifdef HAVE_GETTIMEOFDAY
4544 /* Get some more or less random data. */
4545 gettimeofday (&tv
, NULL
);
4546 value
+= ((unsigned HOST_WIDE_INT
) tv
.tv_usec
<< 16) ^ tv
.tv_sec
^ getpid ();
4553 /* Fill in the random bits. */
4554 template[0] = letters
[v
% 62];
4556 template[1] = letters
[v
% 62];
4558 template[2] = letters
[v
% 62];
4560 template[3] = letters
[v
% 62];
4562 template[4] = letters
[v
% 62];
4564 template[5] = letters
[v
% 62];
4569 /* P is a string that will be used in a symbol. Mask out any characters
4570 that are not valid in that context. */
4573 clean_symbol_name (p
)
4578 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4581 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4589 /* Generate a name for a function unique to this translation unit.
4590 TYPE is some string to identify the purpose of this function to the
4591 linker or collect2. */
4594 get_file_function_name_long (type
)
4601 if (first_global_object_name
)
4602 p
= first_global_object_name
;
4605 /* We don't have anything that we know to be unique to this translation
4606 unit, so use what we do have and throw in some randomness. */
4608 const char *name
= weak_global_object_name
;
4609 const char *file
= main_input_filename
;
4614 file
= input_filename
;
4616 q
= (char *) alloca (7 + strlen (name
) + strlen (file
));
4618 sprintf (q
, "%s%s", name
, file
);
4619 append_random_chars (q
);
4623 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
4626 /* Set up the name of the file-level functions we may need.
4627 Use a global object (which is already required to be unique over
4628 the program) rather than the file name (which imposes extra
4630 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
4632 /* Don't need to pull weird characters out of global names. */
4633 if (p
!= first_global_object_name
)
4634 clean_symbol_name (buf
+ 11);
4636 return get_identifier (buf
);
4639 /* If KIND=='I', return a suitable global initializer (constructor) name.
4640 If KIND=='D', return a suitable global clean-up (destructor) name. */
4643 get_file_function_name (kind
)
4651 return get_file_function_name_long (p
);
4654 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4655 The result is placed in BUFFER (which has length BIT_SIZE),
4656 with one bit in each char ('\000' or '\001').
4658 If the constructor is constant, NULL_TREE is returned.
4659 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4662 get_set_constructor_bits (init
, buffer
, bit_size
)
4669 HOST_WIDE_INT domain_min
4670 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
4671 tree non_const_bits
= NULL_TREE
;
4673 for (i
= 0; i
< bit_size
; i
++)
4676 for (vals
= TREE_OPERAND (init
, 1);
4677 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
4679 if (!host_integerp (TREE_VALUE (vals
), 0)
4680 || (TREE_PURPOSE (vals
) != NULL_TREE
4681 && !host_integerp (TREE_PURPOSE (vals
), 0)))
4683 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
4684 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
4686 /* Set a range of bits to ones. */
4687 HOST_WIDE_INT lo_index
4688 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
4689 HOST_WIDE_INT hi_index
4690 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4692 if (lo_index
< 0 || lo_index
>= bit_size
4693 || hi_index
< 0 || hi_index
>= bit_size
)
4695 for (; lo_index
<= hi_index
; lo_index
++)
4696 buffer
[lo_index
] = 1;
4700 /* Set a single bit to one. */
4702 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
4703 if (index
< 0 || index
>= bit_size
)
4705 error ("invalid initializer for bit string");
4711 return non_const_bits
;
4714 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4715 The result is placed in BUFFER (which is an array of bytes).
4716 If the constructor is constant, NULL_TREE is returned.
4717 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4720 get_set_constructor_bytes (init
, buffer
, wd_size
)
4722 unsigned char *buffer
;
4726 int set_word_size
= BITS_PER_UNIT
;
4727 int bit_size
= wd_size
* set_word_size
;
4729 unsigned char *bytep
= buffer
;
4730 char *bit_buffer
= (char *) alloca (bit_size
);
4731 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
4733 for (i
= 0; i
< wd_size
; i
++)
4736 for (i
= 0; i
< bit_size
; i
++)
4740 if (BYTES_BIG_ENDIAN
)
4741 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
4743 *bytep
|= 1 << bit_pos
;
4746 if (bit_pos
>= set_word_size
)
4747 bit_pos
= 0, bytep
++;
4749 return non_const_bits
;
4752 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4753 /* Complain that the tree code of NODE does not match the expected CODE.
4754 FILE, LINE, and FUNCTION are of the caller. */
4757 tree_check_failed (node
, code
, file
, line
, function
)
4759 enum tree_code code
;
4762 const char *function
;
4764 internal_error ("Tree check: expected %s, have %s in %s, at %s:%d",
4765 tree_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
4766 function
, trim_filename (file
), line
);
4769 /* Similar to above, except that we check for a class of tree
4770 code, given in CL. */
4773 tree_class_check_failed (node
, cl
, file
, line
, function
)
4778 const char *function
;
4781 ("Tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4782 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
4783 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
4786 #endif /* ENABLE_TREE_CHECKING */
4788 /* For a new vector type node T, build the information necessary for
4789 debuggint output. */
4792 finish_vector_type (t
)
4798 tree index
= build_int_2 (TYPE_VECTOR_SUBPARTS (t
) - 1, 0);
4799 tree array
= build_array_type (TREE_TYPE (t
),
4800 build_index_type (index
));
4801 tree rt
= make_node (RECORD_TYPE
);
4803 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
4804 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
4806 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
4807 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4808 the representation type, and we want to find that die when looking up
4809 the vector type. This is most easily achieved by making the TYPE_UID
4811 TYPE_UID (rt
) = TYPE_UID (t
);
4815 /* Create nodes for all integer types (and error_mark_node) using the sizes
4816 of C datatypes. The caller should call set_sizetype soon after calling
4817 this function to select one of the types as sizetype. */
4820 build_common_tree_nodes (signed_char
)
4823 error_mark_node
= make_node (ERROR_MARK
);
4824 TREE_TYPE (error_mark_node
) = error_mark_node
;
4826 initialize_sizetypes ();
4828 /* Define both `signed char' and `unsigned char'. */
4829 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
4830 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
4832 /* Define `char', which is like either `signed char' or `unsigned char'
4833 but not the same as either. */
4836 ? make_signed_type (CHAR_TYPE_SIZE
)
4837 : make_unsigned_type (CHAR_TYPE_SIZE
));
4839 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
4840 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
4841 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
4842 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
4843 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
4844 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
4845 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
4846 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
4848 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
4849 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
4850 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
4851 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
4852 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
4854 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
4855 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
4856 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
4857 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
4858 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
4861 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4862 It will create several other common tree nodes. */
4865 build_common_tree_nodes_2 (short_double
)
4868 /* Define these next since types below may used them. */
4869 integer_zero_node
= build_int_2 (0, 0);
4870 integer_one_node
= build_int_2 (1, 0);
4871 integer_minus_one_node
= build_int_2 (-1, -1);
4873 size_zero_node
= size_int (0);
4874 size_one_node
= size_int (1);
4875 bitsize_zero_node
= bitsize_int (0);
4876 bitsize_one_node
= bitsize_int (1);
4877 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
4879 void_type_node
= make_node (VOID_TYPE
);
4880 layout_type (void_type_node
);
4882 /* We are not going to have real types in C with less than byte alignment,
4883 so we might as well not have any types that claim to have it. */
4884 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
4885 TYPE_USER_ALIGN (void_type_node
) = 0;
4887 null_pointer_node
= build_int_2 (0, 0);
4888 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
4889 layout_type (TREE_TYPE (null_pointer_node
));
4891 ptr_type_node
= build_pointer_type (void_type_node
);
4893 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
4895 float_type_node
= make_node (REAL_TYPE
);
4896 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
4897 layout_type (float_type_node
);
4899 double_type_node
= make_node (REAL_TYPE
);
4901 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
4903 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
4904 layout_type (double_type_node
);
4906 long_double_type_node
= make_node (REAL_TYPE
);
4907 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
4908 layout_type (long_double_type_node
);
4910 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
4911 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
4912 layout_type (complex_integer_type_node
);
4914 complex_float_type_node
= make_node (COMPLEX_TYPE
);
4915 TREE_TYPE (complex_float_type_node
) = float_type_node
;
4916 layout_type (complex_float_type_node
);
4918 complex_double_type_node
= make_node (COMPLEX_TYPE
);
4919 TREE_TYPE (complex_double_type_node
) = double_type_node
;
4920 layout_type (complex_double_type_node
);
4922 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
4923 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
4924 layout_type (complex_long_double_type_node
);
4928 BUILD_VA_LIST_TYPE (t
);
4930 /* Many back-ends define record types without seting TYPE_NAME.
4931 If we copied the record type here, we'd keep the original
4932 record type without a name. This breaks name mangling. So,
4933 don't copy record types and let c_common_nodes_and_builtins()
4934 declare the type to be __builtin_va_list. */
4935 if (TREE_CODE (t
) != RECORD_TYPE
)
4936 t
= build_type_copy (t
);
4938 va_list_type_node
= t
;
4941 V4SF_type_node
= make_node (VECTOR_TYPE
);
4942 TREE_TYPE (V4SF_type_node
) = float_type_node
;
4943 TYPE_MODE (V4SF_type_node
) = V4SFmode
;
4944 finish_vector_type (V4SF_type_node
);
4946 V4SI_type_node
= make_node (VECTOR_TYPE
);
4947 TREE_TYPE (V4SI_type_node
) = intSI_type_node
;
4948 TYPE_MODE (V4SI_type_node
) = V4SImode
;
4949 finish_vector_type (V4SI_type_node
);
4951 V2SI_type_node
= make_node (VECTOR_TYPE
);
4952 TREE_TYPE (V2SI_type_node
) = intSI_type_node
;
4953 TYPE_MODE (V2SI_type_node
) = V2SImode
;
4954 finish_vector_type (V2SI_type_node
);
4956 V4HI_type_node
= make_node (VECTOR_TYPE
);
4957 TREE_TYPE (V4HI_type_node
) = intHI_type_node
;
4958 TYPE_MODE (V4HI_type_node
) = V4HImode
;
4959 finish_vector_type (V4HI_type_node
);
4961 V8QI_type_node
= make_node (VECTOR_TYPE
);
4962 TREE_TYPE (V8QI_type_node
) = intQI_type_node
;
4963 TYPE_MODE (V8QI_type_node
) = V8QImode
;
4964 finish_vector_type (V8QI_type_node
);