1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
48 #include "langhooks.h"
50 #define obstack_chunk_alloc xmalloc
51 #define obstack_chunk_free free
52 /* obstack.[ch] explicitly declined to prototype this. */
53 extern int _obstack_allocated_p PARAMS ((struct obstack *h, PTR obj));
55 static void unsave_expr_now_r PARAMS ((tree));
57 /* Objects allocated on this obstack last forever. */
59 struct obstack permanent_obstack;
61 /* Table indexed by tree code giving a string containing a character
62 classifying the tree code. Possibilities are
63 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
65 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 char tree_code_type[MAX_TREE_CODES] = {
72 /* Table indexed by tree code giving number of expression
73 operands beyond the fixed part of the node structure.
74 Not used for types or decls. */
76 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
78 int tree_code_length[MAX_TREE_CODES] = {
83 /* Names of tree components.
84 Used for printing out the tree and error messages. */
85 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
87 const char *tree_code_name[MAX_TREE_CODES] = {
92 /* Statistics-gathering stuff. */
112 int tree_node_counts[(int) all_kinds];
113 int tree_node_sizes[(int) all_kinds];
115 static const char * const tree_node_kind_names[] = {
132 /* Unique id for next decl created. */
133 static int next_decl_uid;
134 /* Unique id for next type created. */
135 static int next_type_uid = 1;
137 /* Since we cannot rehash a type after it is in the table, we have to
138 keep the hash code. */
146 /* Initial size of the hash table (rounded to next prime). */
147 #define TYPE_HASH_INITIAL_SIZE 1000
149 /* Now here is the hash table. When recording a type, it is added to
150 the slot whose index is the hash code. Note that the hash table is
151 used for several kinds of types (function types, array types and
152 array index range types, for now). While all these live in the
153 same table, they are completely independent, and the hash code is
154 computed differently for each of these. */
156 htab_t type_hash_table;
158 static void build_real_from_int_cst_1 PARAMS ((PTR));
159 static void set_type_quals PARAMS ((tree, int));
160 static void append_random_chars PARAMS ((char *));
161 static int type_hash_eq PARAMS ((const void*, const void*));
162 static unsigned int type_hash_hash PARAMS ((const void*));
163 static void print_type_hash_statistics PARAMS((void));
164 static void finish_vector_type PARAMS((tree));
165 static tree make_vector PARAMS ((enum machine_mode, tree, int));
166 static int type_hash_marked_p PARAMS ((const void *));
167 static void type_hash_mark PARAMS ((const void *));
168 static int mark_tree_hashtable_entry PARAMS((void **, void *));
170 /* If non-null, these are language-specific helper functions for
171 unsave_expr_now. If present, LANG_UNSAVE is called before its
172 argument (an UNSAVE_EXPR) is to be unsaved, and all other
173 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
174 called from unsave_expr_1 for language-specific tree codes. */
175 void (*lang_unsave) PARAMS ((tree *));
176 void (*lang_unsave_expr_now) PARAMS ((tree));
178 /* If non-null, these are language-specific helper functions for
179 unsafe_for_reeval. Return negative to not handle some tree. */
180 int (*lang_unsafe_for_reeval) PARAMS ((tree));
182 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
183 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
184 appropriate IDENTIFIER_NODE. Otherwise, set it to the
185 ERROR_MARK_NODE to ensure that the assembler does not talk about
187 void (*lang_set_decl_assembler_name) PARAMS ((tree));
189 tree global_trees[TI_MAX];
190 tree integer_types[itk_none];
192 /* Set the DECL_ASSEMBLER_NAME for DECL. */
194 set_decl_assembler_name (decl)
197 /* The language-independent code should never use the
198 DECL_ASSEMBLER_NAME for lots of DECLs. Only FUNCTION_DECLs and
199 VAR_DECLs for variables with static storage duration need a real
200 DECL_ASSEMBLER_NAME. */
201 if (TREE_CODE (decl) == FUNCTION_DECL
202 || (TREE_CODE (decl) == VAR_DECL
203 && (TREE_STATIC (decl)
204 || DECL_EXTERNAL (decl)
205 || TREE_PUBLIC (decl))))
206 /* By default, assume the name to use in assembly code is the
207 same as that used in the source language. (That's correct
208 for C, and GCC used to set DECL_ASSEMBLER_NAME to the same
209 value as DECL_NAME in build_decl, so this choice provides
210 backwards compatibility with existing front-ends. */
211 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
213 /* Nobody should ever be asking for the DECL_ASSEMBLER_NAME of
214 these DECLs -- unless they're in language-dependent code, in
215 which case lang_set_decl_assembler_name should handle things. */
219 /* Init the principal obstacks. */
224 gcc_obstack_init (&permanent_obstack);
226 /* Initialize the hash table of types. */
227 type_hash_table = htab_create (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
229 ggc_add_deletable_htab (type_hash_table, type_hash_marked_p,
231 ggc_add_tree_root (global_trees, TI_MAX);
232 ggc_add_tree_root (integer_types, itk_none);
234 /* Set lang_set_decl_set_assembler_name to a default value. */
235 lang_set_decl_assembler_name = set_decl_assembler_name;
239 /* Allocate SIZE bytes in the permanent obstack
240 and return a pointer to them. */
246 return (char *) obstack_alloc (&permanent_obstack, size);
249 /* Allocate NELEM items of SIZE bytes in the permanent obstack
250 and return a pointer to them. The storage is cleared before
251 returning the value. */
254 perm_calloc (nelem, size)
258 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
259 memset (rval, 0, nelem * size);
263 /* Compute the number of bytes occupied by 'node'. This routine only
264 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
269 enum tree_code code = TREE_CODE (node);
271 switch (TREE_CODE_CLASS (code))
273 case 'd': /* A decl node */
274 return sizeof (struct tree_decl);
276 case 't': /* a type node */
277 return sizeof (struct tree_type);
279 case 'b': /* a lexical block node */
280 return sizeof (struct tree_block);
282 case 'r': /* a reference */
283 case 'e': /* an expression */
284 case 's': /* an expression with side effects */
285 case '<': /* a comparison expression */
286 case '1': /* a unary arithmetic expression */
287 case '2': /* a binary arithmetic expression */
288 return (sizeof (struct tree_exp)
289 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
291 case 'c': /* a constant */
292 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
293 words is machine-dependent due to varying length of HOST_WIDE_INT,
294 which might be wider than a pointer (e.g., long long). Similarly
295 for REAL_CST, since the number of words is machine-dependent due
296 to varying size and alignment of `double'. */
297 if (code == INTEGER_CST)
298 return sizeof (struct tree_int_cst);
299 else if (code == REAL_CST)
300 return sizeof (struct tree_real_cst);
302 return (sizeof (struct tree_common)
303 + TREE_CODE_LENGTH (code) * sizeof (char *));
305 case 'x': /* something random, like an identifier. */
308 length = (sizeof (struct tree_common)
309 + TREE_CODE_LENGTH (code) * sizeof (char *));
310 if (code == TREE_VEC)
311 length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
320 /* Return a newly allocated node of code CODE.
321 For decl and type nodes, some other fields are initialized.
322 The rest of the node is initialized to zero.
324 Achoo! I got a code in the node. */
331 int type = TREE_CODE_CLASS (code);
333 #ifdef GATHER_STATISTICS
336 struct tree_common ttmp;
338 /* We can't allocate a TREE_VEC without knowing how many elements
340 if (code == TREE_VEC)
343 TREE_SET_CODE ((tree)&ttmp, code);
344 length = tree_size ((tree)&ttmp);
346 #ifdef GATHER_STATISTICS
349 case 'd': /* A decl node */
353 case 't': /* a type node */
357 case 'b': /* a lexical block */
361 case 's': /* an expression with side effects */
365 case 'r': /* a reference */
369 case 'e': /* an expression */
370 case '<': /* a comparison expression */
371 case '1': /* a unary arithmetic expression */
372 case '2': /* a binary arithmetic expression */
376 case 'c': /* a constant */
380 case 'x': /* something random, like an identifier. */
381 if (code == IDENTIFIER_NODE)
383 else if (code == TREE_VEC)
393 tree_node_counts[(int) kind]++;
394 tree_node_sizes[(int) kind] += length;
397 t = ggc_alloc_tree (length);
399 memset ((PTR) t, 0, length);
401 TREE_SET_CODE (t, code);
406 TREE_SIDE_EFFECTS (t) = 1;
407 TREE_TYPE (t) = void_type_node;
411 if (code != FUNCTION_DECL)
413 DECL_USER_ALIGN (t) = 0;
414 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
415 DECL_SOURCE_LINE (t) = lineno;
416 DECL_SOURCE_FILE (t) =
417 (input_filename) ? input_filename : "<built-in>";
418 DECL_UID (t) = next_decl_uid++;
420 /* We have not yet computed the alias set for this declaration. */
421 DECL_POINTER_ALIAS_SET (t) = -1;
425 TYPE_UID (t) = next_type_uid++;
426 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
427 TYPE_USER_ALIGN (t) = 0;
428 TYPE_MAIN_VARIANT (t) = t;
430 /* Default to no attributes for type, but let target change that. */
431 TYPE_ATTRIBUTES (t) = NULL_TREE;
432 (*targetm.set_default_type_attributes) (t);
434 /* We have not yet computed the alias set for this type. */
435 TYPE_ALIAS_SET (t) = -1;
439 TREE_CONSTANT (t) = 1;
449 case PREDECREMENT_EXPR:
450 case PREINCREMENT_EXPR:
451 case POSTDECREMENT_EXPR:
452 case POSTINCREMENT_EXPR:
453 /* All of these have side-effects, no matter what their
455 TREE_SIDE_EFFECTS (t) = 1;
467 /* A front-end can reset this to an appropriate function if types need
470 tree (*make_lang_type_fn) PARAMS ((enum tree_code)) = make_node;
472 /* Return a new type (with the indicated CODE), doing whatever
473 language-specific processing is required. */
476 make_lang_type (code)
479 return (*make_lang_type_fn) (code);
482 /* Return a new node with the same contents as NODE except that its
483 TREE_CHAIN is zero and it has a fresh uid. */
490 enum tree_code code = TREE_CODE (node);
493 length = tree_size (node);
494 t = ggc_alloc_tree (length);
495 memcpy (t, node, length);
498 TREE_ASM_WRITTEN (t) = 0;
500 if (TREE_CODE_CLASS (code) == 'd')
501 DECL_UID (t) = next_decl_uid++;
502 else if (TREE_CODE_CLASS (code) == 't')
504 TYPE_UID (t) = next_type_uid++;
505 /* The following is so that the debug code for
506 the copy is different from the original type.
507 The two statements usually duplicate each other
508 (because they clear fields of the same union),
509 but the optimizer should catch that. */
510 TYPE_SYMTAB_POINTER (t) = 0;
511 TYPE_SYMTAB_ADDRESS (t) = 0;
517 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
518 For example, this can copy a list made of TREE_LIST nodes. */
530 head = prev = copy_node (list);
531 next = TREE_CHAIN (list);
534 TREE_CHAIN (prev) = copy_node (next);
535 prev = TREE_CHAIN (prev);
536 next = TREE_CHAIN (next);
542 /* Return a newly constructed INTEGER_CST node whose constant value
543 is specified by the two ints LOW and HI.
544 The TREE_TYPE is set to `int'.
546 This function should be used via the `build_int_2' macro. */
549 build_int_2_wide (low, hi)
550 unsigned HOST_WIDE_INT low;
553 tree t = make_node (INTEGER_CST);
555 TREE_INT_CST_LOW (t) = low;
556 TREE_INT_CST_HIGH (t) = hi;
557 TREE_TYPE (t) = integer_type_node;
561 /* Return a new VECTOR_CST node whose type is TYPE and whose values
562 are in a list pointed by VALS. */
565 build_vector (type, vals)
568 tree v = make_node (VECTOR_CST);
569 int over1 = 0, over2 = 0;
572 TREE_VECTOR_CST_ELTS (v) = vals;
573 TREE_TYPE (v) = type;
575 /* Iterate through elements and check for overflow. */
576 for (link = vals; link; link = TREE_CHAIN (link))
578 tree value = TREE_VALUE (link);
580 over1 |= TREE_OVERFLOW (value);
581 over2 |= TREE_CONSTANT_OVERFLOW (value);
584 TREE_OVERFLOW (v) = over1;
585 TREE_CONSTANT_OVERFLOW (v) = over2;
590 /* Return a new REAL_CST node whose type is TYPE and value is D. */
600 /* Check for valid float value for this type on this target machine;
601 if not, can print error message and store a valid value in D. */
602 #ifdef CHECK_FLOAT_VALUE
603 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
606 v = make_node (REAL_CST);
607 TREE_TYPE (v) = type;
608 TREE_REAL_CST (v) = d;
609 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
613 /* Return a new REAL_CST node whose type is TYPE
614 and whose value is the integer value of the INTEGER_CST node I. */
617 real_value_from_int_cst (type, i)
618 tree type ATTRIBUTE_UNUSED, i;
622 /* Clear all bits of the real value type so that we can later do
623 bitwise comparisons to see if two values are the same. */
624 memset ((char *) &d, 0, sizeof d);
626 if (! TREE_UNSIGNED (TREE_TYPE (i)))
627 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
630 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
631 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
635 /* Args to pass to and from build_real_from_int_cst_1. */
639 tree type; /* Input: type to conver to. */
640 tree i; /* Input: operand to convert. */
641 REAL_VALUE_TYPE d; /* Output: floating point value. */
644 /* Convert an integer to a floating point value while protected by a floating
645 point exception handler. */
648 build_real_from_int_cst_1 (data)
651 struct brfic_args *args = (struct brfic_args *) data;
653 args->d = real_value_from_int_cst (args->type, args->i);
656 /* Given a tree representing an integer constant I, return a tree
657 representing the same value as a floating-point constant of type TYPE.
658 We cannot perform this operation if there is no way of doing arithmetic
659 on floating-point values. */
662 build_real_from_int_cst (type, i)
667 int overflow = TREE_OVERFLOW (i);
669 struct brfic_args args;
671 v = make_node (REAL_CST);
672 TREE_TYPE (v) = type;
674 /* Setup input for build_real_from_int_cst_1() */
678 if (do_float_handler (build_real_from_int_cst_1, (PTR) &args))
679 /* Receive output from build_real_from_int_cst_1() */
683 /* We got an exception from build_real_from_int_cst_1() */
688 /* Check for valid float value for this type on this target machine. */
690 #ifdef CHECK_FLOAT_VALUE
691 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
694 TREE_REAL_CST (v) = d;
695 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
699 /* Return a newly constructed STRING_CST node whose value is
700 the LEN characters at STR.
701 The TREE_TYPE is not initialized. */
704 build_string (len, str)
708 tree s = make_node (STRING_CST);
710 TREE_STRING_LENGTH (s) = len;
711 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
716 /* Return a newly constructed COMPLEX_CST node whose value is
717 specified by the real and imaginary parts REAL and IMAG.
718 Both REAL and IMAG should be constant nodes. TYPE, if specified,
719 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
722 build_complex (type, real, imag)
726 tree t = make_node (COMPLEX_CST);
728 TREE_REALPART (t) = real;
729 TREE_IMAGPART (t) = imag;
730 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
731 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
732 TREE_CONSTANT_OVERFLOW (t)
733 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
737 /* Build a newly constructed TREE_VEC node of length LEN. */
744 int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec);
746 #ifdef GATHER_STATISTICS
747 tree_node_counts[(int)vec_kind]++;
748 tree_node_sizes[(int)vec_kind] += length;
751 t = ggc_alloc_tree (length);
753 memset ((PTR) t, 0, length);
754 TREE_SET_CODE (t, TREE_VEC);
755 TREE_VEC_LENGTH (t) = len;
760 /* Return 1 if EXPR is the integer constant zero or a complex constant
769 return ((TREE_CODE (expr) == INTEGER_CST
770 && ! TREE_CONSTANT_OVERFLOW (expr)
771 && TREE_INT_CST_LOW (expr) == 0
772 && TREE_INT_CST_HIGH (expr) == 0)
773 || (TREE_CODE (expr) == COMPLEX_CST
774 && integer_zerop (TREE_REALPART (expr))
775 && integer_zerop (TREE_IMAGPART (expr))));
778 /* Return 1 if EXPR is the integer constant one or the corresponding
787 return ((TREE_CODE (expr) == INTEGER_CST
788 && ! TREE_CONSTANT_OVERFLOW (expr)
789 && TREE_INT_CST_LOW (expr) == 1
790 && TREE_INT_CST_HIGH (expr) == 0)
791 || (TREE_CODE (expr) == COMPLEX_CST
792 && integer_onep (TREE_REALPART (expr))
793 && integer_zerop (TREE_IMAGPART (expr))));
796 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
797 it contains. Likewise for the corresponding complex constant. */
800 integer_all_onesp (expr)
808 if (TREE_CODE (expr) == COMPLEX_CST
809 && integer_all_onesp (TREE_REALPART (expr))
810 && integer_zerop (TREE_IMAGPART (expr)))
813 else if (TREE_CODE (expr) != INTEGER_CST
814 || TREE_CONSTANT_OVERFLOW (expr))
817 uns = TREE_UNSIGNED (TREE_TYPE (expr));
819 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
820 && TREE_INT_CST_HIGH (expr) == -1);
822 /* Note that using TYPE_PRECISION here is wrong. We care about the
823 actual bits, not the (arbitrary) range of the type. */
824 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
825 if (prec >= HOST_BITS_PER_WIDE_INT)
827 HOST_WIDE_INT high_value;
830 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
832 if (shift_amount > HOST_BITS_PER_WIDE_INT)
833 /* Can not handle precisions greater than twice the host int size. */
835 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
836 /* Shifting by the host word size is undefined according to the ANSI
837 standard, so we must handle this as a special case. */
840 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
842 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
843 && TREE_INT_CST_HIGH (expr) == high_value);
846 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
849 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
857 HOST_WIDE_INT high, low;
861 if (TREE_CODE (expr) == COMPLEX_CST
862 && integer_pow2p (TREE_REALPART (expr))
863 && integer_zerop (TREE_IMAGPART (expr)))
866 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
869 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
870 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
871 high = TREE_INT_CST_HIGH (expr);
872 low = TREE_INT_CST_LOW (expr);
874 /* First clear all bits that are beyond the type's precision in case
875 we've been sign extended. */
877 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
879 else if (prec > HOST_BITS_PER_WIDE_INT)
880 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
884 if (prec < HOST_BITS_PER_WIDE_INT)
885 low &= ~((HOST_WIDE_INT) (-1) << prec);
888 if (high == 0 && low == 0)
891 return ((high == 0 && (low & (low - 1)) == 0)
892 || (low == 0 && (high & (high - 1)) == 0));
895 /* Return the power of two represented by a tree node known to be a
903 HOST_WIDE_INT high, low;
907 if (TREE_CODE (expr) == COMPLEX_CST)
908 return tree_log2 (TREE_REALPART (expr));
910 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
911 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
913 high = TREE_INT_CST_HIGH (expr);
914 low = TREE_INT_CST_LOW (expr);
916 /* First clear all bits that are beyond the type's precision in case
917 we've been sign extended. */
919 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
921 else if (prec > HOST_BITS_PER_WIDE_INT)
922 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
926 if (prec < HOST_BITS_PER_WIDE_INT)
927 low &= ~((HOST_WIDE_INT) (-1) << prec);
930 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
934 /* Similar, but return the largest integer Y such that 2 ** Y is less
935 than or equal to EXPR. */
938 tree_floor_log2 (expr)
942 HOST_WIDE_INT high, low;
946 if (TREE_CODE (expr) == COMPLEX_CST)
947 return tree_log2 (TREE_REALPART (expr));
949 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
950 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
952 high = TREE_INT_CST_HIGH (expr);
953 low = TREE_INT_CST_LOW (expr);
955 /* First clear all bits that are beyond the type's precision in case
956 we've been sign extended. Ignore if type's precision hasn't been set
957 since what we are doing is setting it. */
959 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
961 else if (prec > HOST_BITS_PER_WIDE_INT)
962 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
966 if (prec < HOST_BITS_PER_WIDE_INT)
967 low &= ~((HOST_WIDE_INT) (-1) << prec);
970 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
974 /* Return 1 if EXPR is the real constant zero. */
982 return ((TREE_CODE (expr) == REAL_CST
983 && ! TREE_CONSTANT_OVERFLOW (expr)
984 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
985 || (TREE_CODE (expr) == COMPLEX_CST
986 && real_zerop (TREE_REALPART (expr))
987 && real_zerop (TREE_IMAGPART (expr))));
990 /* Return 1 if EXPR is the real constant one in real or complex form. */
998 return ((TREE_CODE (expr) == REAL_CST
999 && ! TREE_CONSTANT_OVERFLOW (expr)
1000 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1001 || (TREE_CODE (expr) == COMPLEX_CST
1002 && real_onep (TREE_REALPART (expr))
1003 && real_zerop (TREE_IMAGPART (expr))));
1006 /* Return 1 if EXPR is the real constant two. */
1014 return ((TREE_CODE (expr) == REAL_CST
1015 && ! TREE_CONSTANT_OVERFLOW (expr)
1016 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1017 || (TREE_CODE (expr) == COMPLEX_CST
1018 && real_twop (TREE_REALPART (expr))
1019 && real_zerop (TREE_IMAGPART (expr))));
1022 /* Nonzero if EXP is a constant or a cast of a constant. */
1025 really_constant_p (exp)
1028 /* This is not quite the same as STRIP_NOPS. It does more. */
1029 while (TREE_CODE (exp) == NOP_EXPR
1030 || TREE_CODE (exp) == CONVERT_EXPR
1031 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1032 exp = TREE_OPERAND (exp, 0);
1033 return TREE_CONSTANT (exp);
1036 /* Return first list element whose TREE_VALUE is ELEM.
1037 Return 0 if ELEM is not in LIST. */
1040 value_member (elem, list)
1045 if (elem == TREE_VALUE (list))
1047 list = TREE_CHAIN (list);
1052 /* Return first list element whose TREE_PURPOSE is ELEM.
1053 Return 0 if ELEM is not in LIST. */
1056 purpose_member (elem, list)
1061 if (elem == TREE_PURPOSE (list))
1063 list = TREE_CHAIN (list);
1068 /* Return first list element whose BINFO_TYPE is ELEM.
1069 Return 0 if ELEM is not in LIST. */
1072 binfo_member (elem, list)
1077 if (elem == BINFO_TYPE (list))
1079 list = TREE_CHAIN (list);
1084 /* Return nonzero if ELEM is part of the chain CHAIN. */
1087 chain_member (elem, chain)
1094 chain = TREE_CHAIN (chain);
1100 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1101 chain CHAIN. This and the next function are currently unused, but
1102 are retained for completeness. */
1105 chain_member_value (elem, chain)
1110 if (elem == TREE_VALUE (chain))
1112 chain = TREE_CHAIN (chain);
1118 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1119 for any piece of chain CHAIN. */
1122 chain_member_purpose (elem, chain)
1127 if (elem == TREE_PURPOSE (chain))
1129 chain = TREE_CHAIN (chain);
1135 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1136 We expect a null pointer to mark the end of the chain.
1137 This is the Lisp primitive `length'. */
1146 for (tail = t; tail; tail = TREE_CHAIN (tail))
1152 /* Returns the number of FIELD_DECLs in TYPE. */
1155 fields_length (type)
1158 tree t = TYPE_FIELDS (type);
1161 for (; t; t = TREE_CHAIN (t))
1162 if (TREE_CODE (t) == FIELD_DECL)
1168 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1169 by modifying the last node in chain 1 to point to chain 2.
1170 This is the Lisp primitive `nconc'. */
1180 #ifdef ENABLE_TREE_CHECKING
1184 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1186 TREE_CHAIN (t1) = op2;
1187 #ifdef ENABLE_TREE_CHECKING
1188 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1190 abort (); /* Circularity created. */
1198 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1206 while ((next = TREE_CHAIN (chain)))
1211 /* Reverse the order of elements in the chain T,
1212 and return the new head of the chain (old last element). */
1218 tree prev = 0, decl, next;
1219 for (decl = t; decl; decl = next)
1221 next = TREE_CHAIN (decl);
1222 TREE_CHAIN (decl) = prev;
1228 /* Given a chain CHAIN of tree nodes,
1229 construct and return a list of those nodes. */
1235 tree result = NULL_TREE;
1236 tree in_tail = chain;
1237 tree out_tail = NULL_TREE;
1241 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
1243 TREE_CHAIN (out_tail) = next;
1247 in_tail = TREE_CHAIN (in_tail);
1253 /* Return a newly created TREE_LIST node whose
1254 purpose and value fields are PARM and VALUE. */
1257 build_tree_list (parm, value)
1260 tree t = make_node (TREE_LIST);
1261 TREE_PURPOSE (t) = parm;
1262 TREE_VALUE (t) = value;
1266 /* Return a newly created TREE_LIST node whose
1267 purpose and value fields are PARM and VALUE
1268 and whose TREE_CHAIN is CHAIN. */
1271 tree_cons (purpose, value, chain)
1272 tree purpose, value, chain;
1276 node = ggc_alloc_tree (sizeof (struct tree_list));
1278 memset (node, 0, sizeof (struct tree_common));
1280 #ifdef GATHER_STATISTICS
1281 tree_node_counts[(int) x_kind]++;
1282 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1285 TREE_SET_CODE (node, TREE_LIST);
1286 TREE_CHAIN (node) = chain;
1287 TREE_PURPOSE (node) = purpose;
1288 TREE_VALUE (node) = value;
1293 /* Return the size nominally occupied by an object of type TYPE
1294 when it resides in memory. The value is measured in units of bytes,
1295 and its data type is that normally used for type sizes
1296 (which is the first type created by make_signed_type or
1297 make_unsigned_type). */
1300 size_in_bytes (type)
1305 if (type == error_mark_node)
1306 return integer_zero_node;
1308 type = TYPE_MAIN_VARIANT (type);
1309 t = TYPE_SIZE_UNIT (type);
1313 incomplete_type_error (NULL_TREE, type);
1314 return size_zero_node;
1317 if (TREE_CODE (t) == INTEGER_CST)
1318 force_fit_type (t, 0);
1323 /* Return the size of TYPE (in bytes) as a wide integer
1324 or return -1 if the size can vary or is larger than an integer. */
1327 int_size_in_bytes (type)
1332 if (type == error_mark_node)
1335 type = TYPE_MAIN_VARIANT (type);
1336 t = TYPE_SIZE_UNIT (type);
1338 || TREE_CODE (t) != INTEGER_CST
1339 || TREE_OVERFLOW (t)
1340 || TREE_INT_CST_HIGH (t) != 0
1341 /* If the result would appear negative, it's too big to represent. */
1342 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1345 return TREE_INT_CST_LOW (t);
1348 /* Return the bit position of FIELD, in bits from the start of the record.
1349 This is a tree of type bitsizetype. */
1352 bit_position (field)
1356 return bit_from_pos (DECL_FIELD_OFFSET (field),
1357 DECL_FIELD_BIT_OFFSET (field));
1360 /* Likewise, but return as an integer. Abort if it cannot be represented
1361 in that way (since it could be a signed value, we don't have the option
1362 of returning -1 like int_size_in_byte can. */
1365 int_bit_position (field)
1368 return tree_low_cst (bit_position (field), 0);
1371 /* Return the byte position of FIELD, in bytes from the start of the record.
1372 This is a tree of type sizetype. */
1375 byte_position (field)
1378 return byte_from_pos (DECL_FIELD_OFFSET (field),
1379 DECL_FIELD_BIT_OFFSET (field));
1382 /* Likewise, but return as an integer. Abort if it cannot be represented
1383 in that way (since it could be a signed value, we don't have the option
1384 of returning -1 like int_size_in_byte can. */
1387 int_byte_position (field)
1390 return tree_low_cst (byte_position (field), 0);
1393 /* Return the strictest alignment, in bits, that T is known to have. */
1399 unsigned int align0, align1;
1401 switch (TREE_CODE (t))
1403 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1404 /* If we have conversions, we know that the alignment of the
1405 object must meet each of the alignments of the types. */
1406 align0 = expr_align (TREE_OPERAND (t, 0));
1407 align1 = TYPE_ALIGN (TREE_TYPE (t));
1408 return MAX (align0, align1);
1410 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1411 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1412 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1413 /* These don't change the alignment of an object. */
1414 return expr_align (TREE_OPERAND (t, 0));
1417 /* The best we can do is say that the alignment is the least aligned
1419 align0 = expr_align (TREE_OPERAND (t, 1));
1420 align1 = expr_align (TREE_OPERAND (t, 2));
1421 return MIN (align0, align1);
1423 case LABEL_DECL: case CONST_DECL:
1424 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1425 if (DECL_ALIGN (t) != 0)
1426 return DECL_ALIGN (t);
1430 return FUNCTION_BOUNDARY;
1436 /* Otherwise take the alignment from that of the type. */
1437 return TYPE_ALIGN (TREE_TYPE (t));
1440 /* Return, as a tree node, the number of elements for TYPE (which is an
1441 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1444 array_type_nelts (type)
1447 tree index_type, min, max;
1449 /* If they did it with unspecified bounds, then we should have already
1450 given an error about it before we got here. */
1451 if (! TYPE_DOMAIN (type))
1452 return error_mark_node;
1454 index_type = TYPE_DOMAIN (type);
1455 min = TYPE_MIN_VALUE (index_type);
1456 max = TYPE_MAX_VALUE (index_type);
1458 return (integer_zerop (min)
1460 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1463 /* Return nonzero if arg is static -- a reference to an object in
1464 static storage. This is not the same as the C meaning of `static'. */
1470 switch (TREE_CODE (arg))
1473 /* Nested functions aren't static, since taking their address
1474 involves a trampoline. */
1475 return (decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1476 && ! DECL_NON_ADDR_CONST_P (arg);
1479 return (TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1480 && ! DECL_NON_ADDR_CONST_P (arg);
1483 return TREE_STATIC (arg);
1489 /* If we are referencing a bitfield, we can't evaluate an
1490 ADDR_EXPR at compile time and so it isn't a constant. */
1492 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1493 && staticp (TREE_OPERAND (arg, 0)));
1499 /* This case is technically correct, but results in setting
1500 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1503 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1507 case ARRAY_RANGE_REF:
1508 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1509 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1510 return staticp (TREE_OPERAND (arg, 0));
1513 if ((unsigned int) TREE_CODE (arg)
1514 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1515 return (*lang_hooks.staticp) (arg);
1521 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1522 Do this to any expression which may be used in more than one place,
1523 but must be evaluated only once.
1525 Normally, expand_expr would reevaluate the expression each time.
1526 Calling save_expr produces something that is evaluated and recorded
1527 the first time expand_expr is called on it. Subsequent calls to
1528 expand_expr just reuse the recorded value.
1530 The call to expand_expr that generates code that actually computes
1531 the value is the first call *at compile time*. Subsequent calls
1532 *at compile time* generate code to use the saved value.
1533 This produces correct result provided that *at run time* control
1534 always flows through the insns made by the first expand_expr
1535 before reaching the other places where the save_expr was evaluated.
1536 You, the caller of save_expr, must make sure this is so.
1538 Constants, and certain read-only nodes, are returned with no
1539 SAVE_EXPR because that is safe. Expressions containing placeholders
1540 are not touched; see tree.def for an explanation of what these
1547 tree t = fold (expr);
1550 /* We don't care about whether this can be used as an lvalue in this
1552 while (TREE_CODE (t) == NON_LVALUE_EXPR)
1553 t = TREE_OPERAND (t, 0);
1555 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1556 a constant, it will be more efficient to not make another SAVE_EXPR since
1557 it will allow better simplification and GCSE will be able to merge the
1558 computations if they actualy occur. */
1560 (TREE_CODE_CLASS (TREE_CODE (inner)) == '1'
1561 || (TREE_CODE_CLASS (TREE_CODE (inner)) == '2'
1562 && TREE_CONSTANT (TREE_OPERAND (inner, 1))));
1563 inner = TREE_OPERAND (inner, 0))
1566 /* If the tree evaluates to a constant, then we don't want to hide that
1567 fact (i.e. this allows further folding, and direct checks for constants).
1568 However, a read-only object that has side effects cannot be bypassed.
1569 Since it is no problem to reevaluate literals, we just return the
1571 if (TREE_CONSTANT (inner)
1572 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1573 || TREE_CODE (inner) == SAVE_EXPR || TREE_CODE (inner) == ERROR_MARK)
1576 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1577 it means that the size or offset of some field of an object depends on
1578 the value within another field.
1580 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1581 and some variable since it would then need to be both evaluated once and
1582 evaluated more than once. Front-ends must assure this case cannot
1583 happen by surrounding any such subexpressions in their own SAVE_EXPR
1584 and forcing evaluation at the proper time. */
1585 if (contains_placeholder_p (t))
1588 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1590 /* This expression might be placed ahead of a jump to ensure that the
1591 value was computed on both sides of the jump. So make sure it isn't
1592 eliminated as dead. */
1593 TREE_SIDE_EFFECTS (t) = 1;
1594 TREE_READONLY (t) = 1;
1598 /* Arrange for an expression to be expanded multiple independent
1599 times. This is useful for cleanup actions, as the backend can
1600 expand them multiple times in different places. */
1608 /* If this is already protected, no sense in protecting it again. */
1609 if (TREE_CODE (expr) == UNSAVE_EXPR)
1612 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1613 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1617 /* Returns the index of the first non-tree operand for CODE, or the number
1618 of operands if all are trees. */
1622 enum tree_code code;
1628 case GOTO_SUBROUTINE_EXPR:
1631 case WITH_CLEANUP_EXPR:
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 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)
2170 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)
2268 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, ...))
2349 VA_FIXEDARG (p, enum tree_code, code);
2350 VA_FIXEDARG (p, tree, tt);
2352 t = make_node (code);
2353 length = TREE_CODE_LENGTH (code);
2356 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2357 result based on those same flags for the arguments. But if the
2358 arguments aren't really even `tree' expressions, we shouldn't be trying
2360 fro = first_rtl_op (code);
2362 /* Expressions without side effects may be constant if their
2363 arguments are as well. */
2364 constant = (TREE_CODE_CLASS (code) == '<'
2365 || TREE_CODE_CLASS (code) == '1'
2366 || TREE_CODE_CLASS (code) == '2'
2367 || TREE_CODE_CLASS (code) == 'c');
2371 /* This is equivalent to the loop below, but faster. */
2372 tree arg0 = va_arg (p, tree);
2373 tree arg1 = va_arg (p, tree);
2375 TREE_OPERAND (t, 0) = arg0;
2376 TREE_OPERAND (t, 1) = arg1;
2377 TREE_READONLY (t) = 1;
2378 if (arg0 && fro > 0)
2380 if (TREE_SIDE_EFFECTS (arg0))
2381 TREE_SIDE_EFFECTS (t) = 1;
2382 if (!TREE_READONLY (arg0))
2383 TREE_READONLY (t) = 0;
2384 if (!TREE_CONSTANT (arg0))
2388 if (arg1 && fro > 1)
2390 if (TREE_SIDE_EFFECTS (arg1))
2391 TREE_SIDE_EFFECTS (t) = 1;
2392 if (!TREE_READONLY (arg1))
2393 TREE_READONLY (t) = 0;
2394 if (!TREE_CONSTANT (arg1))
2398 else if (length == 1)
2400 tree arg0 = va_arg (p, tree);
2402 /* The only one-operand cases we handle here are those with side-effects.
2403 Others are handled with build1. So don't bother checked if the
2404 arg has side-effects since we'll already have set it.
2406 ??? This really should use build1 too. */
2407 if (TREE_CODE_CLASS (code) != 's')
2409 TREE_OPERAND (t, 0) = arg0;
2413 for (i = 0; i < length; i++)
2415 tree operand = va_arg (p, tree);
2417 TREE_OPERAND (t, i) = operand;
2418 if (operand && fro > i)
2420 if (TREE_SIDE_EFFECTS (operand))
2421 TREE_SIDE_EFFECTS (t) = 1;
2422 if (!TREE_CONSTANT (operand))
2429 TREE_CONSTANT (t) = constant;
2433 /* Same as above, but only builds for unary operators.
2434 Saves lions share of calls to `build'; cuts down use
2435 of varargs, which is expensive for RISC machines. */
2438 build1 (code, type, node)
2439 enum tree_code code;
2444 #ifdef GATHER_STATISTICS
2445 tree_node_kind kind;
2449 #ifdef GATHER_STATISTICS
2450 if (TREE_CODE_CLASS (code) == 'r')
2456 #ifdef ENABLE_CHECKING
2457 if (TREE_CODE_CLASS (code) == '2'
2458 || TREE_CODE_CLASS (code) == '<'
2459 || TREE_CODE_LENGTH (code) != 1)
2461 #endif /* ENABLE_CHECKING */
2463 length = sizeof (struct tree_exp);
2465 t = ggc_alloc_tree (length);
2467 memset ((PTR) t, 0, sizeof (struct tree_common));
2469 #ifdef GATHER_STATISTICS
2470 tree_node_counts[(int) kind]++;
2471 tree_node_sizes[(int) kind] += length;
2474 TREE_SET_CODE (t, code);
2476 TREE_TYPE (t) = type;
2477 TREE_COMPLEXITY (t) = 0;
2478 TREE_OPERAND (t, 0) = node;
2479 if (node && first_rtl_op (code) != 0)
2481 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2482 TREE_READONLY (t) = TREE_READONLY (node);
2491 case PREDECREMENT_EXPR:
2492 case PREINCREMENT_EXPR:
2493 case POSTDECREMENT_EXPR:
2494 case POSTINCREMENT_EXPR:
2495 /* All of these have side-effects, no matter what their
2497 TREE_SIDE_EFFECTS (t) = 1;
2498 TREE_READONLY (t) = 0;
2502 /* Whether a dereference is readonly has nothing to do with whether
2503 its operand is readonly. */
2504 TREE_READONLY (t) = 0;
2508 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2509 TREE_CONSTANT (t) = 1;
2516 /* Similar except don't specify the TREE_TYPE
2517 and leave the TREE_SIDE_EFFECTS as 0.
2518 It is permissible for arguments to be null,
2519 or even garbage if their values do not matter. */
2522 build_nt VPARAMS ((enum tree_code code, ...))
2529 VA_FIXEDARG (p, enum tree_code, code);
2531 t = make_node (code);
2532 length = TREE_CODE_LENGTH (code);
2534 for (i = 0; i < length; i++)
2535 TREE_OPERAND (t, i) = va_arg (p, tree);
2541 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2542 We do NOT enter this node in any sort of symbol table.
2544 layout_decl is used to set up the decl's storage layout.
2545 Other slots are initialized to 0 or null pointers. */
2548 build_decl (code, name, type)
2549 enum tree_code code;
2554 t = make_node (code);
2556 /* if (type == error_mark_node)
2557 type = integer_type_node; */
2558 /* That is not done, deliberately, so that having error_mark_node
2559 as the type can suppress useless errors in the use of this variable. */
2561 DECL_NAME (t) = name;
2562 TREE_TYPE (t) = type;
2564 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2566 else if (code == FUNCTION_DECL)
2567 DECL_MODE (t) = FUNCTION_MODE;
2572 /* BLOCK nodes are used to represent the structure of binding contours
2573 and declarations, once those contours have been exited and their contents
2574 compiled. This information is used for outputting debugging info. */
2577 build_block (vars, tags, subblocks, supercontext, chain)
2578 tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain;
2580 tree block = make_node (BLOCK);
2582 BLOCK_VARS (block) = vars;
2583 BLOCK_SUBBLOCKS (block) = subblocks;
2584 BLOCK_SUPERCONTEXT (block) = supercontext;
2585 BLOCK_CHAIN (block) = chain;
2589 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2590 location where an expression or an identifier were encountered. It
2591 is necessary for languages where the frontend parser will handle
2592 recursively more than one file (Java is one of them). */
2595 build_expr_wfl (node, file, line, col)
2600 static const char *last_file = 0;
2601 static tree last_filenode = NULL_TREE;
2602 tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2604 EXPR_WFL_NODE (wfl) = node;
2605 EXPR_WFL_SET_LINECOL (wfl, line, col);
2606 if (file != last_file)
2609 last_filenode = file ? get_identifier (file) : NULL_TREE;
2612 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2615 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2616 TREE_TYPE (wfl) = TREE_TYPE (node);
2622 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2626 build_decl_attribute_variant (ddecl, attribute)
2627 tree ddecl, attribute;
2629 DECL_ATTRIBUTES (ddecl) = attribute;
2633 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2636 Record such modified types already made so we don't make duplicates. */
2639 build_type_attribute_variant (ttype, attribute)
2640 tree ttype, attribute;
2642 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2644 unsigned int hashcode;
2647 ntype = copy_node (ttype);
2649 TYPE_POINTER_TO (ntype) = 0;
2650 TYPE_REFERENCE_TO (ntype) = 0;
2651 TYPE_ATTRIBUTES (ntype) = attribute;
2653 /* Create a new main variant of TYPE. */
2654 TYPE_MAIN_VARIANT (ntype) = ntype;
2655 TYPE_NEXT_VARIANT (ntype) = 0;
2656 set_type_quals (ntype, TYPE_UNQUALIFIED);
2658 hashcode = (TYPE_HASH (TREE_CODE (ntype))
2659 + TYPE_HASH (TREE_TYPE (ntype))
2660 + attribute_hash_list (attribute));
2662 switch (TREE_CODE (ntype))
2665 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2668 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2671 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2674 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2680 ntype = type_hash_canon (hashcode, ntype);
2681 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2687 /* Default value of targetm.comp_type_attributes that always returns 1. */
2690 default_comp_type_attributes (type1, type2)
2691 tree type1 ATTRIBUTE_UNUSED;
2692 tree type2 ATTRIBUTE_UNUSED;
2697 /* Default version of targetm.set_default_type_attributes that always does
2701 default_set_default_type_attributes (type)
2702 tree type ATTRIBUTE_UNUSED;
2706 /* Default version of targetm.insert_attributes that always does nothing. */
2708 default_insert_attributes (decl, attr_ptr)
2709 tree decl ATTRIBUTE_UNUSED;
2710 tree *attr_ptr ATTRIBUTE_UNUSED;
2714 /* Default value of targetm.attribute_table that is empty. */
2715 const struct attribute_spec default_target_attribute_table[] =
2717 { NULL, 0, 0, false, false, false, NULL }
2720 /* Default value of targetm.function_attribute_inlinable_p that always
2723 default_function_attribute_inlinable_p (fndecl)
2724 tree fndecl ATTRIBUTE_UNUSED;
2726 /* By default, functions with machine attributes cannot be inlined. */
2730 /* Default value of targetm.ms_bitfield_layout_p that always returns
2733 default_ms_bitfield_layout_p (record)
2734 tree record ATTRIBUTE_UNUSED;
2736 /* By default, GCC does not use the MS VC++ bitfield layout rules. */
2740 /* Return non-zero if IDENT is a valid name for attribute ATTR,
2743 We try both `text' and `__text__', ATTR may be either one. */
2744 /* ??? It might be a reasonable simplification to require ATTR to be only
2745 `text'. One might then also require attribute lists to be stored in
2746 their canonicalized form. */
2749 is_attribute_p (attr, ident)
2753 int ident_len, attr_len;
2756 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2759 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2762 p = IDENTIFIER_POINTER (ident);
2763 ident_len = strlen (p);
2764 attr_len = strlen (attr);
2766 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2770 || attr[attr_len - 2] != '_'
2771 || attr[attr_len - 1] != '_')
2773 if (ident_len == attr_len - 4
2774 && strncmp (attr + 2, p, attr_len - 4) == 0)
2779 if (ident_len == attr_len + 4
2780 && p[0] == '_' && p[1] == '_'
2781 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2782 && strncmp (attr, p + 2, attr_len) == 0)
2789 /* Given an attribute name and a list of attributes, return a pointer to the
2790 attribute's list element if the attribute is part of the list, or NULL_TREE
2791 if not found. If the attribute appears more than once, this only
2792 returns the first occurrence; the TREE_CHAIN of the return value should
2793 be passed back in if further occurrences are wanted. */
2796 lookup_attribute (attr_name, list)
2797 const char *attr_name;
2802 for (l = list; l; l = TREE_CHAIN (l))
2804 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2806 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2813 /* Return an attribute list that is the union of a1 and a2. */
2816 merge_attributes (a1, a2)
2821 /* Either one unset? Take the set one. */
2823 if ((attributes = a1) == 0)
2826 /* One that completely contains the other? Take it. */
2828 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2830 if (attribute_list_contained (a2, a1))
2834 /* Pick the longest list, and hang on the other list. */
2836 if (list_length (a1) < list_length (a2))
2837 attributes = a2, a2 = a1;
2839 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2842 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2845 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2848 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2853 a1 = copy_node (a2);
2854 TREE_CHAIN (a1) = attributes;
2863 /* Given types T1 and T2, merge their attributes and return
2867 merge_type_attributes (t1, t2)
2870 return merge_attributes (TYPE_ATTRIBUTES (t1),
2871 TYPE_ATTRIBUTES (t2));
2874 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2878 merge_decl_attributes (olddecl, newdecl)
2879 tree olddecl, newdecl;
2881 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2882 DECL_ATTRIBUTES (newdecl));
2885 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2887 /* Specialization of merge_decl_attributes for various Windows targets.
2889 This handles the following situation:
2891 __declspec (dllimport) int foo;
2894 The second instance of `foo' nullifies the dllimport. */
2897 merge_dllimport_decl_attributes (old, new)
2902 int delete_dllimport_p;
2904 old = DECL_ATTRIBUTES (old);
2905 new = DECL_ATTRIBUTES (new);
2907 /* What we need to do here is remove from `old' dllimport if it doesn't
2908 appear in `new'. dllimport behaves like extern: if a declaration is
2909 marked dllimport and a definition appears later, then the object
2910 is not dllimport'd. */
2911 if (lookup_attribute ("dllimport", old) != NULL_TREE
2912 && lookup_attribute ("dllimport", new) == NULL_TREE)
2913 delete_dllimport_p = 1;
2915 delete_dllimport_p = 0;
2917 a = merge_attributes (old, new);
2919 if (delete_dllimport_p)
2923 /* Scan the list for dllimport and delete it. */
2924 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
2926 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
2928 if (prev == NULL_TREE)
2931 TREE_CHAIN (prev) = TREE_CHAIN (t);
2940 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2942 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2943 of the various TYPE_QUAL values. */
2946 set_type_quals (type, type_quals)
2950 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
2951 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
2952 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
2955 /* Return a version of the TYPE, qualified as indicated by the
2956 TYPE_QUALS, if one exists. If no qualified version exists yet,
2957 return NULL_TREE. */
2960 get_qualified_type (type, type_quals)
2966 /* Search the chain of variants to see if there is already one there just
2967 like the one we need to have. If so, use that existing one. We must
2968 preserve the TYPE_NAME, since there is code that depends on this. */
2969 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2970 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type))
2976 /* Like get_qualified_type, but creates the type if it does not
2977 exist. This function never returns NULL_TREE. */
2980 build_qualified_type (type, type_quals)
2986 /* See if we already have the appropriate qualified variant. */
2987 t = get_qualified_type (type, type_quals);
2989 /* If not, build it. */
2992 t = build_type_copy (type);
2993 set_type_quals (t, type_quals);
2999 /* Create a new variant of TYPE, equivalent but distinct.
3000 This is so the caller can modify it. */
3003 build_type_copy (type)
3006 tree t, m = TYPE_MAIN_VARIANT (type);
3008 t = copy_node (type);
3010 TYPE_POINTER_TO (t) = 0;
3011 TYPE_REFERENCE_TO (t) = 0;
3013 /* Add this type to the chain of variants of TYPE. */
3014 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3015 TYPE_NEXT_VARIANT (m) = t;
3020 /* Hashing of types so that we don't make duplicates.
3021 The entry point is `type_hash_canon'. */
3023 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3024 with types in the TREE_VALUE slots), by adding the hash codes
3025 of the individual types. */
3028 type_hash_list (list)
3031 unsigned int hashcode;
3034 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3035 hashcode += TYPE_HASH (TREE_VALUE (tail));
3040 /* These are the Hashtable callback functions. */
3042 /* Returns true if the types are equal. */
3045 type_hash_eq (va, vb)
3049 const struct type_hash *a = va, *b = vb;
3050 if (a->hash == b->hash
3051 && TREE_CODE (a->type) == TREE_CODE (b->type)
3052 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
3053 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3054 TYPE_ATTRIBUTES (b->type))
3055 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
3056 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3057 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3058 TYPE_MAX_VALUE (b->type)))
3059 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3060 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3061 TYPE_MIN_VALUE (b->type)))
3062 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3063 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
3064 || (TYPE_DOMAIN (a->type)
3065 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
3066 && TYPE_DOMAIN (b->type)
3067 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
3068 && type_list_equal (TYPE_DOMAIN (a->type),
3069 TYPE_DOMAIN (b->type)))))
3074 /* Return the cached hash value. */
3077 type_hash_hash (item)
3080 return ((const struct type_hash *) item)->hash;
3083 /* Look in the type hash table for a type isomorphic to TYPE.
3084 If one is found, return it. Otherwise return 0. */
3087 type_hash_lookup (hashcode, type)
3088 unsigned int hashcode;
3091 struct type_hash *h, in;
3093 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3094 must call that routine before comparing TYPE_ALIGNs. */
3100 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3106 /* Add an entry to the type-hash-table
3107 for a type TYPE whose hash code is HASHCODE. */
3110 type_hash_add (hashcode, type)
3111 unsigned int hashcode;
3114 struct type_hash *h;
3117 h = (struct type_hash *) ggc_alloc (sizeof (struct type_hash));
3120 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3121 *(struct type_hash **) loc = h;
3124 /* Given TYPE, and HASHCODE its hash code, return the canonical
3125 object for an identical type if one already exists.
3126 Otherwise, return TYPE, and record it as the canonical object
3127 if it is a permanent object.
3129 To use this function, first create a type of the sort you want.
3130 Then compute its hash code from the fields of the type that
3131 make it different from other similar types.
3132 Then call this function and use the value.
3133 This function frees the type you pass in if it is a duplicate. */
3135 /* Set to 1 to debug without canonicalization. Never set by program. */
3136 int debug_no_type_hash = 0;
3139 type_hash_canon (hashcode, type)
3140 unsigned int hashcode;
3145 if (debug_no_type_hash)
3148 /* See if the type is in the hash table already. If so, return it.
3149 Otherwise, add the type. */
3150 t1 = type_hash_lookup (hashcode, type);
3153 #ifdef GATHER_STATISTICS
3154 tree_node_counts[(int) t_kind]--;
3155 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3161 type_hash_add (hashcode, type);
3166 /* See if the data pointed to by the type hash table is marked. We consider
3167 it marked if the type is marked or if a debug type number or symbol
3168 table entry has been made for the type. This reduces the amount of
3169 debugging output and eliminates that dependency of the debug output on
3170 the number of garbage collections. */
3173 type_hash_marked_p (p)
3176 tree type = ((struct type_hash *) p)->type;
3178 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3181 /* Mark the entry in the type hash table the type it points to is marked.
3182 Also mark the type in case we are considering this entry "marked" by
3183 virtue of TYPE_SYMTAB_POINTER being set. */
3190 ggc_mark_tree (((struct type_hash *) p)->type);
3193 /* Mark the hashtable slot pointed to by ENTRY (which is really a
3194 `tree**') for GC. */
3197 mark_tree_hashtable_entry (entry, data)
3199 void *data ATTRIBUTE_UNUSED;
3201 ggc_mark_tree ((tree) *entry);
3205 /* Mark ARG (which is really a htab_t whose slots are trees) for
3209 mark_tree_hashtable (arg)
3212 htab_t t = *(htab_t *) arg;
3213 htab_traverse (t, mark_tree_hashtable_entry, 0);
3217 print_type_hash_statistics ()
3219 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3220 (long) htab_size (type_hash_table),
3221 (long) htab_elements (type_hash_table),
3222 htab_collisions (type_hash_table));
3225 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3226 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3227 by adding the hash codes of the individual attributes. */
3230 attribute_hash_list (list)
3233 unsigned int hashcode;
3236 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3237 /* ??? Do we want to add in TREE_VALUE too? */
3238 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3242 /* Given two lists of attributes, return true if list l2 is
3243 equivalent to l1. */
3246 attribute_list_equal (l1, l2)
3249 return attribute_list_contained (l1, l2)
3250 && attribute_list_contained (l2, l1);
3253 /* Given two lists of attributes, return true if list L2 is
3254 completely contained within L1. */
3255 /* ??? This would be faster if attribute names were stored in a canonicalized
3256 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3257 must be used to show these elements are equivalent (which they are). */
3258 /* ??? It's not clear that attributes with arguments will always be handled
3262 attribute_list_contained (l1, l2)
3267 /* First check the obvious, maybe the lists are identical. */
3271 /* Maybe the lists are similar. */
3272 for (t1 = l1, t2 = l2;
3274 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3275 && TREE_VALUE (t1) == TREE_VALUE (t2);
3276 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3278 /* Maybe the lists are equal. */
3279 if (t1 == 0 && t2 == 0)
3282 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3285 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3287 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3290 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3297 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3304 /* Given two lists of types
3305 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3306 return 1 if the lists contain the same types in the same order.
3307 Also, the TREE_PURPOSEs must match. */
3310 type_list_equal (l1, l2)
3315 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3316 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3317 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3318 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3319 && (TREE_TYPE (TREE_PURPOSE (t1))
3320 == TREE_TYPE (TREE_PURPOSE (t2))))))
3326 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3327 given by TYPE. If the argument list accepts variable arguments,
3328 then this function counts only the ordinary arguments. */
3331 type_num_arguments (type)
3337 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3338 /* If the function does not take a variable number of arguments,
3339 the last element in the list will have type `void'. */
3340 if (VOID_TYPE_P (TREE_VALUE (t)))
3348 /* Nonzero if integer constants T1 and T2
3349 represent the same constant value. */
3352 tree_int_cst_equal (t1, t2)
3358 if (t1 == 0 || t2 == 0)
3361 if (TREE_CODE (t1) == INTEGER_CST
3362 && TREE_CODE (t2) == INTEGER_CST
3363 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3364 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3370 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3371 The precise way of comparison depends on their data type. */
3374 tree_int_cst_lt (t1, t2)
3380 if (! TREE_UNSIGNED (TREE_TYPE (t1)))
3381 return INT_CST_LT (t1, t2);
3383 return INT_CST_LT_UNSIGNED (t1, t2);
3386 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3389 tree_int_cst_compare (t1, t2)
3393 if (tree_int_cst_lt (t1, t2))
3395 else if (tree_int_cst_lt (t2, t1))
3401 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3402 the host. If POS is zero, the value can be represented in a single
3403 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3404 be represented in a single unsigned HOST_WIDE_INT. */
3407 host_integerp (t, pos)
3411 return (TREE_CODE (t) == INTEGER_CST
3412 && ! TREE_OVERFLOW (t)
3413 && ((TREE_INT_CST_HIGH (t) == 0
3414 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3415 || (! pos && TREE_INT_CST_HIGH (t) == -1
3416 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3417 && ! TREE_UNSIGNED (TREE_TYPE (t)))
3418 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3421 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3422 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3423 be positive. Abort if we cannot satisfy the above conditions. */
3426 tree_low_cst (t, pos)
3430 if (host_integerp (t, pos))
3431 return TREE_INT_CST_LOW (t);
3436 /* Return the most significant bit of the integer constant T. */
3439 tree_int_cst_msb (t)
3444 unsigned HOST_WIDE_INT l;
3446 /* Note that using TYPE_PRECISION here is wrong. We care about the
3447 actual bits, not the (arbitrary) range of the type. */
3448 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3449 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3450 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3451 return (l & 1) == 1;
3454 /* Return an indication of the sign of the integer constant T.
3455 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3456 Note that -1 will never be returned it T's type is unsigned. */
3459 tree_int_cst_sgn (t)
3462 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3464 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3466 else if (TREE_INT_CST_HIGH (t) < 0)
3472 /* Compare two constructor-element-type constants. Return 1 if the lists
3473 are known to be equal; otherwise return 0. */
3476 simple_cst_list_equal (l1, l2)
3479 while (l1 != NULL_TREE && l2 != NULL_TREE)
3481 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3484 l1 = TREE_CHAIN (l1);
3485 l2 = TREE_CHAIN (l2);
3491 /* Return truthvalue of whether T1 is the same tree structure as T2.
3492 Return 1 if they are the same.
3493 Return 0 if they are understandably different.
3494 Return -1 if either contains tree structure not understood by
3498 simple_cst_equal (t1, t2)
3501 enum tree_code code1, code2;
3507 if (t1 == 0 || t2 == 0)
3510 code1 = TREE_CODE (t1);
3511 code2 = TREE_CODE (t2);
3513 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3515 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3516 || code2 == NON_LVALUE_EXPR)
3517 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3519 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3522 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3523 || code2 == NON_LVALUE_EXPR)
3524 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3532 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3533 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3536 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3539 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3540 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3541 TREE_STRING_LENGTH (t1)));
3544 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3550 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3553 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3557 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3560 /* Special case: if either target is an unallocated VAR_DECL,
3561 it means that it's going to be unified with whatever the
3562 TARGET_EXPR is really supposed to initialize, so treat it
3563 as being equivalent to anything. */
3564 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3565 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3566 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3567 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3568 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3569 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3572 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3577 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3579 case WITH_CLEANUP_EXPR:
3580 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3584 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3587 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3588 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3602 /* This general rule works for most tree codes. All exceptions should be
3603 handled above. If this is a language-specific tree code, we can't
3604 trust what might be in the operand, so say we don't know
3606 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3609 switch (TREE_CODE_CLASS (code1))
3618 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3620 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3632 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3633 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3634 than U, respectively. */
3637 compare_tree_int (t, u)
3639 unsigned HOST_WIDE_INT u;
3641 if (tree_int_cst_sgn (t) < 0)
3643 else if (TREE_INT_CST_HIGH (t) != 0)
3645 else if (TREE_INT_CST_LOW (t) == u)
3647 else if (TREE_INT_CST_LOW (t) < u)
3653 /* Constructors for pointer, array and function types.
3654 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3655 constructed by language-dependent code, not here.) */
3657 /* Construct, lay out and return the type of pointers to TO_TYPE.
3658 If such a type has already been constructed, reuse it. */
3661 build_pointer_type (to_type)
3664 tree t = TYPE_POINTER_TO (to_type);
3666 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3671 /* We need a new one. */
3672 t = make_node (POINTER_TYPE);
3674 TREE_TYPE (t) = to_type;
3676 /* Record this type as the pointer to TO_TYPE. */
3677 TYPE_POINTER_TO (to_type) = t;
3679 /* Lay out the type. This function has many callers that are concerned
3680 with expression-construction, and this simplifies them all.
3681 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3687 /* Build the node for the type of references-to-TO_TYPE. */
3690 build_reference_type (to_type)
3693 tree t = TYPE_REFERENCE_TO (to_type);
3695 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3700 /* We need a new one. */
3701 t = make_node (REFERENCE_TYPE);
3703 TREE_TYPE (t) = to_type;
3705 /* Record this type as the pointer to TO_TYPE. */
3706 TYPE_REFERENCE_TO (to_type) = t;
3713 /* Build a type that is compatible with t but has no cv quals anywhere
3716 const char *const *const * -> char ***. */
3719 build_type_no_quals (t)
3722 switch (TREE_CODE (t))
3725 return build_pointer_type (build_type_no_quals (TREE_TYPE (t)));
3726 case REFERENCE_TYPE:
3727 return build_reference_type (build_type_no_quals (TREE_TYPE (t)));
3729 return TYPE_MAIN_VARIANT (t);
3733 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3734 MAXVAL should be the maximum value in the domain
3735 (one less than the length of the array).
3737 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3738 We don't enforce this limit, that is up to caller (e.g. language front end).
3739 The limit exists because the result is a signed type and we don't handle
3740 sizes that use more than one HOST_WIDE_INT. */
3743 build_index_type (maxval)
3746 tree itype = make_node (INTEGER_TYPE);
3748 TREE_TYPE (itype) = sizetype;
3749 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3750 TYPE_MIN_VALUE (itype) = size_zero_node;
3751 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3752 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3753 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3754 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
3755 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3756 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
3758 if (host_integerp (maxval, 1))
3759 return type_hash_canon (tree_low_cst (maxval, 1), itype);
3764 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3765 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3766 low bound LOWVAL and high bound HIGHVAL.
3767 if TYPE==NULL_TREE, sizetype is used. */
3770 build_range_type (type, lowval, highval)
3771 tree type, lowval, highval;
3773 tree itype = make_node (INTEGER_TYPE);
3775 TREE_TYPE (itype) = type;
3776 if (type == NULL_TREE)
3779 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3780 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
3782 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3783 TYPE_MODE (itype) = TYPE_MODE (type);
3784 TYPE_SIZE (itype) = TYPE_SIZE (type);
3785 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
3786 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3787 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
3789 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
3790 return type_hash_canon (tree_low_cst (highval, 0)
3791 - tree_low_cst (lowval, 0),
3797 /* Just like build_index_type, but takes lowval and highval instead
3798 of just highval (maxval). */
3801 build_index_2_type (lowval, highval)
3802 tree lowval, highval;
3804 return build_range_type (sizetype, lowval, highval);
3807 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
3808 Needed because when index types are not hashed, equal index types
3809 built at different times appear distinct, even though structurally,
3813 index_type_equal (itype1, itype2)
3814 tree itype1, itype2;
3816 if (TREE_CODE (itype1) != TREE_CODE (itype2))
3819 if (TREE_CODE (itype1) == INTEGER_TYPE)
3821 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
3822 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
3823 || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1
3824 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
3827 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1),
3828 TYPE_MIN_VALUE (itype2))
3829 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1),
3830 TYPE_MAX_VALUE (itype2)))
3837 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3838 and number of elements specified by the range of values of INDEX_TYPE.
3839 If such a type has already been constructed, reuse it. */
3842 build_array_type (elt_type, index_type)
3843 tree elt_type, index_type;
3846 unsigned int hashcode;
3848 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3850 error ("arrays of functions are not meaningful");
3851 elt_type = integer_type_node;
3854 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3855 build_pointer_type (elt_type);
3857 /* Allocate the array after the pointer type,
3858 in case we free it in type_hash_canon. */
3859 t = make_node (ARRAY_TYPE);
3860 TREE_TYPE (t) = elt_type;
3861 TYPE_DOMAIN (t) = index_type;
3863 if (index_type == 0)
3868 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3869 t = type_hash_canon (hashcode, t);
3871 if (!COMPLETE_TYPE_P (t))
3876 /* Return the TYPE of the elements comprising
3877 the innermost dimension of ARRAY. */
3880 get_inner_array_type (array)
3883 tree type = TREE_TYPE (array);
3885 while (TREE_CODE (type) == ARRAY_TYPE)
3886 type = TREE_TYPE (type);
3891 /* Construct, lay out and return
3892 the type of functions returning type VALUE_TYPE
3893 given arguments of types ARG_TYPES.
3894 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3895 are data type nodes for the arguments of the function.
3896 If such a type has already been constructed, reuse it. */
3899 build_function_type (value_type, arg_types)
3900 tree value_type, arg_types;
3903 unsigned int hashcode;
3905 if (TREE_CODE (value_type) == FUNCTION_TYPE)
3907 error ("function return type cannot be function");
3908 value_type = integer_type_node;
3911 /* Make a node of the sort we want. */
3912 t = make_node (FUNCTION_TYPE);
3913 TREE_TYPE (t) = value_type;
3914 TYPE_ARG_TYPES (t) = arg_types;
3916 /* If we already have such a type, use the old one and free this one. */
3917 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
3918 t = type_hash_canon (hashcode, t);
3920 if (!COMPLETE_TYPE_P (t))
3925 /* Construct, lay out and return the type of methods belonging to class
3926 BASETYPE and whose arguments and values are described by TYPE.
3927 If that type exists already, reuse it.
3928 TYPE must be a FUNCTION_TYPE node. */
3931 build_method_type (basetype, type)
3932 tree basetype, type;
3935 unsigned int hashcode;
3937 /* Make a node of the sort we want. */
3938 t = make_node (METHOD_TYPE);
3940 if (TREE_CODE (type) != FUNCTION_TYPE)
3943 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3944 TREE_TYPE (t) = TREE_TYPE (type);
3946 /* The actual arglist for this function includes a "hidden" argument
3947 which is "this". Put it into the list of argument types. */
3950 = tree_cons (NULL_TREE,
3951 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
3953 /* If we already have such a type, use the old one and free this one. */
3954 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3955 t = type_hash_canon (hashcode, t);
3957 if (!COMPLETE_TYPE_P (t))
3963 /* Construct, lay out and return the type of offsets to a value
3964 of type TYPE, within an object of type BASETYPE.
3965 If a suitable offset type exists already, reuse it. */
3968 build_offset_type (basetype, type)
3969 tree basetype, type;
3972 unsigned int hashcode;
3974 /* Make a node of the sort we want. */
3975 t = make_node (OFFSET_TYPE);
3977 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3978 TREE_TYPE (t) = type;
3980 /* If we already have such a type, use the old one and free this one. */
3981 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3982 t = type_hash_canon (hashcode, t);
3984 if (!COMPLETE_TYPE_P (t))
3990 /* Create a complex type whose components are COMPONENT_TYPE. */
3993 build_complex_type (component_type)
3994 tree component_type;
3997 unsigned int hashcode;
3999 /* Make a node of the sort we want. */
4000 t = make_node (COMPLEX_TYPE);
4002 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4003 set_type_quals (t, TYPE_QUALS (component_type));
4005 /* If we already have such a type, use the old one and free this one. */
4006 hashcode = TYPE_HASH (component_type);
4007 t = type_hash_canon (hashcode, t);
4009 if (!COMPLETE_TYPE_P (t))
4012 /* If we are writing Dwarf2 output we need to create a name,
4013 since complex is a fundamental type. */
4014 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4018 if (component_type == char_type_node)
4019 name = "complex char";
4020 else if (component_type == signed_char_type_node)
4021 name = "complex signed char";
4022 else if (component_type == unsigned_char_type_node)
4023 name = "complex unsigned char";
4024 else if (component_type == short_integer_type_node)
4025 name = "complex short int";
4026 else if (component_type == short_unsigned_type_node)
4027 name = "complex short unsigned int";
4028 else if (component_type == integer_type_node)
4029 name = "complex int";
4030 else if (component_type == unsigned_type_node)
4031 name = "complex unsigned int";
4032 else if (component_type == long_integer_type_node)
4033 name = "complex long int";
4034 else if (component_type == long_unsigned_type_node)
4035 name = "complex long unsigned int";
4036 else if (component_type == long_long_integer_type_node)
4037 name = "complex long long int";
4038 else if (component_type == long_long_unsigned_type_node)
4039 name = "complex long long unsigned int";
4044 TYPE_NAME (t) = get_identifier (name);
4050 /* Return OP, stripped of any conversions to wider types as much as is safe.
4051 Converting the value back to OP's type makes a value equivalent to OP.
4053 If FOR_TYPE is nonzero, we return a value which, if converted to
4054 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4056 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4057 narrowest type that can hold the value, even if they don't exactly fit.
4058 Otherwise, bit-field references are changed to a narrower type
4059 only if they can be fetched directly from memory in that type.
4061 OP must have integer, real or enumeral type. Pointers are not allowed!
4063 There are some cases where the obvious value we could return
4064 would regenerate to OP if converted to OP's type,
4065 but would not extend like OP to wider types.
4066 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4067 For example, if OP is (unsigned short)(signed char)-1,
4068 we avoid returning (signed char)-1 if FOR_TYPE is int,
4069 even though extending that to an unsigned short would regenerate OP,
4070 since the result of extending (signed char)-1 to (int)
4071 is different from (int) OP. */
4074 get_unwidened (op, for_type)
4078 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4079 tree type = TREE_TYPE (op);
4081 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4083 = (for_type != 0 && for_type != type
4084 && final_prec > TYPE_PRECISION (type)
4085 && TREE_UNSIGNED (type));
4088 while (TREE_CODE (op) == NOP_EXPR)
4091 = TYPE_PRECISION (TREE_TYPE (op))
4092 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4094 /* Truncations are many-one so cannot be removed.
4095 Unless we are later going to truncate down even farther. */
4097 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4100 /* See what's inside this conversion. If we decide to strip it,
4102 op = TREE_OPERAND (op, 0);
4104 /* If we have not stripped any zero-extensions (uns is 0),
4105 we can strip any kind of extension.
4106 If we have previously stripped a zero-extension,
4107 only zero-extensions can safely be stripped.
4108 Any extension can be stripped if the bits it would produce
4109 are all going to be discarded later by truncating to FOR_TYPE. */
4113 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4115 /* TREE_UNSIGNED says whether this is a zero-extension.
4116 Let's avoid computing it if it does not affect WIN
4117 and if UNS will not be needed again. */
4118 if ((uns || TREE_CODE (op) == NOP_EXPR)
4119 && TREE_UNSIGNED (TREE_TYPE (op)))
4127 if (TREE_CODE (op) == COMPONENT_REF
4128 /* Since type_for_size always gives an integer type. */
4129 && TREE_CODE (type) != REAL_TYPE
4130 /* Don't crash if field not laid out yet. */
4131 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4132 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4134 unsigned int innerprec
4135 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4137 type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1)));
4139 /* We can get this structure field in the narrowest type it fits in.
4140 If FOR_TYPE is 0, do this only for a field that matches the
4141 narrower type exactly and is aligned for it
4142 The resulting extension to its nominal type (a fullword type)
4143 must fit the same conditions as for other extensions. */
4145 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4146 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4147 && (! uns || final_prec <= innerprec
4148 || TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4151 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4152 TREE_OPERAND (op, 1));
4153 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4154 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4161 /* Return OP or a simpler expression for a narrower value
4162 which can be sign-extended or zero-extended to give back OP.
4163 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4164 or 0 if the value should be sign-extended. */
4167 get_narrower (op, unsignedp_ptr)
4175 while (TREE_CODE (op) == NOP_EXPR)
4178 = (TYPE_PRECISION (TREE_TYPE (op))
4179 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4181 /* Truncations are many-one so cannot be removed. */
4185 /* See what's inside this conversion. If we decide to strip it,
4187 op = TREE_OPERAND (op, 0);
4191 /* An extension: the outermost one can be stripped,
4192 but remember whether it is zero or sign extension. */
4194 uns = TREE_UNSIGNED (TREE_TYPE (op));
4195 /* Otherwise, if a sign extension has been stripped,
4196 only sign extensions can now be stripped;
4197 if a zero extension has been stripped, only zero-extensions. */
4198 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4202 else /* bitschange == 0 */
4204 /* A change in nominal type can always be stripped, but we must
4205 preserve the unsignedness. */
4207 uns = TREE_UNSIGNED (TREE_TYPE (op));
4214 if (TREE_CODE (op) == COMPONENT_REF
4215 /* Since type_for_size always gives an integer type. */
4216 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4217 /* Ensure field is laid out already. */
4218 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4220 unsigned HOST_WIDE_INT innerprec
4221 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4222 tree type = type_for_size (innerprec, TREE_UNSIGNED (op));
4224 /* We can get this structure field in a narrower type that fits it,
4225 but the resulting extension to its nominal type (a fullword type)
4226 must satisfy the same conditions as for other extensions.
4228 Do this only for fields that are aligned (not bit-fields),
4229 because when bit-field insns will be used there is no
4230 advantage in doing this. */
4232 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4233 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4234 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4238 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4239 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4240 TREE_OPERAND (op, 1));
4241 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4242 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4245 *unsignedp_ptr = uns;
4249 /* Nonzero if integer constant C has a value that is permissible
4250 for type TYPE (an INTEGER_TYPE). */
4253 int_fits_type_p (c, type)
4256 /* If the bounds of the type are integers, we can check ourselves.
4257 If not, but this type is a subtype, try checking against that.
4258 Otherwise, use force_fit_type, which checks against the precision. */
4259 if (TYPE_MAX_VALUE (type) != NULL_TREE
4260 && TYPE_MIN_VALUE (type) != NULL_TREE
4261 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4262 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
4264 if (TREE_UNSIGNED (type))
4265 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c)
4266 && ! INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type))
4267 /* Negative ints never fit unsigned types. */
4268 && ! (TREE_INT_CST_HIGH (c) < 0
4269 && ! TREE_UNSIGNED (TREE_TYPE (c))));
4271 return (! INT_CST_LT (TYPE_MAX_VALUE (type), c)
4272 && ! INT_CST_LT (c, TYPE_MIN_VALUE (type))
4273 /* Unsigned ints with top bit set never fit signed types. */
4274 && ! (TREE_INT_CST_HIGH (c) < 0
4275 && TREE_UNSIGNED (TREE_TYPE (c))));
4277 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4278 return int_fits_type_p (c, TREE_TYPE (type));
4282 TREE_TYPE (c) = type;
4283 return !force_fit_type (c, 0);
4287 /* Given a DECL or TYPE, return the scope in which it was declared, or
4288 NULL_TREE if there is no containing scope. */
4291 get_containing_scope (t)
4294 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4297 /* Return the innermost context enclosing DECL that is
4298 a FUNCTION_DECL, or zero if none. */
4301 decl_function_context (decl)
4306 if (TREE_CODE (decl) == ERROR_MARK)
4309 if (TREE_CODE (decl) == SAVE_EXPR)
4310 context = SAVE_EXPR_CONTEXT (decl);
4312 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4313 where we look up the function at runtime. Such functions always take
4314 a first argument of type 'pointer to real context'.
4316 C++ should really be fixed to use DECL_CONTEXT for the real context,
4317 and use something else for the "virtual context". */
4318 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4321 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4323 context = DECL_CONTEXT (decl);
4325 while (context && TREE_CODE (context) != FUNCTION_DECL)
4327 if (TREE_CODE (context) == BLOCK)
4328 context = BLOCK_SUPERCONTEXT (context);
4330 context = get_containing_scope (context);
4336 /* Return the innermost context enclosing DECL that is
4337 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4338 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4341 decl_type_context (decl)
4344 tree context = DECL_CONTEXT (decl);
4348 if (TREE_CODE (context) == RECORD_TYPE
4349 || TREE_CODE (context) == UNION_TYPE
4350 || TREE_CODE (context) == QUAL_UNION_TYPE)
4353 if (TREE_CODE (context) == TYPE_DECL
4354 || TREE_CODE (context) == FUNCTION_DECL)
4355 context = DECL_CONTEXT (context);
4357 else if (TREE_CODE (context) == BLOCK)
4358 context = BLOCK_SUPERCONTEXT (context);
4361 /* Unhandled CONTEXT!? */
4367 /* CALL is a CALL_EXPR. Return the declaration for the function
4368 called, or NULL_TREE if the called function cannot be
4372 get_callee_fndecl (call)
4377 /* It's invalid to call this function with anything but a
4379 if (TREE_CODE (call) != CALL_EXPR)
4382 /* The first operand to the CALL is the address of the function
4384 addr = TREE_OPERAND (call, 0);
4388 /* If this is a readonly function pointer, extract its initial value. */
4389 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4390 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4391 && DECL_INITIAL (addr))
4392 addr = DECL_INITIAL (addr);
4394 /* If the address is just `&f' for some function `f', then we know
4395 that `f' is being called. */
4396 if (TREE_CODE (addr) == ADDR_EXPR
4397 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4398 return TREE_OPERAND (addr, 0);
4400 /* We couldn't figure out what was being called. */
4404 /* Print debugging information about the obstack O, named STR. */
4407 print_obstack_statistics (str, o)
4411 struct _obstack_chunk *chunk = o->chunk;
4415 n_alloc += o->next_free - chunk->contents;
4416 chunk = chunk->prev;
4420 n_alloc += chunk->limit - &chunk->contents[0];
4421 chunk = chunk->prev;
4423 fprintf (stderr, "obstack %s: %u bytes, %d chunks\n",
4424 str, n_alloc, n_chunks);
4427 /* Print debugging information about tree nodes generated during the compile,
4428 and any language-specific information. */
4431 dump_tree_statistics ()
4433 #ifdef GATHER_STATISTICS
4435 int total_nodes, total_bytes;
4438 fprintf (stderr, "\n??? tree nodes created\n\n");
4439 #ifdef GATHER_STATISTICS
4440 fprintf (stderr, "Kind Nodes Bytes\n");
4441 fprintf (stderr, "-------------------------------------\n");
4442 total_nodes = total_bytes = 0;
4443 for (i = 0; i < (int) all_kinds; i++)
4445 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4446 tree_node_counts[i], tree_node_sizes[i]);
4447 total_nodes += tree_node_counts[i];
4448 total_bytes += tree_node_sizes[i];
4450 fprintf (stderr, "-------------------------------------\n");
4451 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4452 fprintf (stderr, "-------------------------------------\n");
4454 fprintf (stderr, "(No per-node statistics)\n");
4456 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
4457 print_type_hash_statistics ();
4458 (*lang_hooks.print_statistics) ();
4461 #define FILE_FUNCTION_PREFIX_LEN 9
4463 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4465 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4466 clashes in cases where we can't reliably choose a unique name.
4468 Derived from mkstemp.c in libiberty. */
4471 append_random_chars (template)
4474 static const char letters[]
4475 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4476 static unsigned HOST_WIDE_INT value;
4477 unsigned HOST_WIDE_INT v;
4483 /* VALUE should be unique for each file and must not change between
4484 compiles since this can cause bootstrap comparison errors. */
4486 if (stat (main_input_filename, &st) < 0)
4488 /* This can happen when preprocessed text is shipped between
4489 machines, e.g. with bug reports. Assume that uniqueness
4490 isn't actually an issue. */
4495 /* In VMS, ino is an array, so we have to use both values. We
4496 conditionalize that. */
4498 #define INO_TO_INT(INO) ((int) (INO)[1] << 16 ^ (int) (INO)[2])
4500 #define INO_TO_INT(INO) INO
4502 value = st.st_dev ^ INO_TO_INT (st.st_ino) ^ st.st_mtime;
4506 template += strlen (template);
4510 /* Fill in the random bits. */
4511 template[0] = letters[v % 62];
4513 template[1] = letters[v % 62];
4515 template[2] = letters[v % 62];
4517 template[3] = letters[v % 62];
4519 template[4] = letters[v % 62];
4521 template[5] = letters[v % 62];
4526 /* P is a string that will be used in a symbol. Mask out any characters
4527 that are not valid in that context. */
4530 clean_symbol_name (p)
4535 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4538 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4545 /* Generate a name for a function unique to this translation unit.
4546 TYPE is some string to identify the purpose of this function to the
4547 linker or collect2. */
4550 get_file_function_name_long (type)
4557 if (first_global_object_name)
4558 p = first_global_object_name;
4561 /* We don't have anything that we know to be unique to this translation
4562 unit, so use what we do have and throw in some randomness. */
4564 const char *name = weak_global_object_name;
4565 const char *file = main_input_filename;
4570 file = input_filename;
4572 q = (char *) alloca (7 + strlen (name) + strlen (file));
4574 sprintf (q, "%s%s", name, file);
4575 append_random_chars (q);
4579 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
4582 /* Set up the name of the file-level functions we may need.
4583 Use a global object (which is already required to be unique over
4584 the program) rather than the file name (which imposes extra
4586 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4588 /* Don't need to pull weird characters out of global names. */
4589 if (p != first_global_object_name)
4590 clean_symbol_name (buf + 11);
4592 return get_identifier (buf);
4595 /* If KIND=='I', return a suitable global initializer (constructor) name.
4596 If KIND=='D', return a suitable global clean-up (destructor) name. */
4599 get_file_function_name (kind)
4607 return get_file_function_name_long (p);
4610 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4611 The result is placed in BUFFER (which has length BIT_SIZE),
4612 with one bit in each char ('\000' or '\001').
4614 If the constructor is constant, NULL_TREE is returned.
4615 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4618 get_set_constructor_bits (init, buffer, bit_size)
4625 HOST_WIDE_INT domain_min
4626 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4627 tree non_const_bits = NULL_TREE;
4629 for (i = 0; i < bit_size; i++)
4632 for (vals = TREE_OPERAND (init, 1);
4633 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4635 if (!host_integerp (TREE_VALUE (vals), 0)
4636 || (TREE_PURPOSE (vals) != NULL_TREE
4637 && !host_integerp (TREE_PURPOSE (vals), 0)))
4639 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4640 else if (TREE_PURPOSE (vals) != NULL_TREE)
4642 /* Set a range of bits to ones. */
4643 HOST_WIDE_INT lo_index
4644 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4645 HOST_WIDE_INT hi_index
4646 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4648 if (lo_index < 0 || lo_index >= bit_size
4649 || hi_index < 0 || hi_index >= bit_size)
4651 for (; lo_index <= hi_index; lo_index++)
4652 buffer[lo_index] = 1;
4656 /* Set a single bit to one. */
4658 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4659 if (index < 0 || index >= bit_size)
4661 error ("invalid initializer for bit string");
4667 return non_const_bits;
4670 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4671 The result is placed in BUFFER (which is an array of bytes).
4672 If the constructor is constant, NULL_TREE is returned.
4673 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4676 get_set_constructor_bytes (init, buffer, wd_size)
4678 unsigned char *buffer;
4682 int set_word_size = BITS_PER_UNIT;
4683 int bit_size = wd_size * set_word_size;
4685 unsigned char *bytep = buffer;
4686 char *bit_buffer = (char *) alloca (bit_size);
4687 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4689 for (i = 0; i < wd_size; i++)
4692 for (i = 0; i < bit_size; i++)
4696 if (BYTES_BIG_ENDIAN)
4697 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4699 *bytep |= 1 << bit_pos;
4702 if (bit_pos >= set_word_size)
4703 bit_pos = 0, bytep++;
4705 return non_const_bits;
4708 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4709 /* Complain that the tree code of NODE does not match the expected CODE.
4710 FILE, LINE, and FUNCTION are of the caller. */
4713 tree_check_failed (node, code, file, line, function)
4715 enum tree_code code;
4718 const char *function;
4720 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4721 tree_code_name[code], tree_code_name[TREE_CODE (node)],
4722 function, trim_filename (file), line);
4725 /* Similar to above, except that we check for a class of tree
4726 code, given in CL. */
4729 tree_class_check_failed (node, cl, file, line, function)
4734 const char *function;
4737 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4738 cl, TREE_CODE_CLASS (TREE_CODE (node)),
4739 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
4742 #endif /* ENABLE_TREE_CHECKING */
4744 /* For a new vector type node T, build the information necessary for
4745 debuggint output. */
4748 finish_vector_type (t)
4754 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
4755 tree array = build_array_type (TREE_TYPE (t),
4756 build_index_type (index));
4757 tree rt = make_node (RECORD_TYPE);
4759 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
4760 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
4762 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
4763 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4764 the representation type, and we want to find that die when looking up
4765 the vector type. This is most easily achieved by making the TYPE_UID
4767 TYPE_UID (rt) = TYPE_UID (t);
4771 /* Create nodes for all integer types (and error_mark_node) using the sizes
4772 of C datatypes. The caller should call set_sizetype soon after calling
4773 this function to select one of the types as sizetype. */
4776 build_common_tree_nodes (signed_char)
4779 error_mark_node = make_node (ERROR_MARK);
4780 TREE_TYPE (error_mark_node) = error_mark_node;
4782 initialize_sizetypes ();
4784 /* Define both `signed char' and `unsigned char'. */
4785 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
4786 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
4788 /* Define `char', which is like either `signed char' or `unsigned char'
4789 but not the same as either. */
4792 ? make_signed_type (CHAR_TYPE_SIZE)
4793 : make_unsigned_type (CHAR_TYPE_SIZE));
4795 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
4796 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
4797 integer_type_node = make_signed_type (INT_TYPE_SIZE);
4798 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
4799 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
4800 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
4801 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
4802 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
4804 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
4805 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
4806 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
4807 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
4808 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
4810 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
4811 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
4812 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
4813 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
4814 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
4817 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4818 It will create several other common tree nodes. */
4821 build_common_tree_nodes_2 (short_double)
4824 /* Define these next since types below may used them. */
4825 integer_zero_node = build_int_2 (0, 0);
4826 integer_one_node = build_int_2 (1, 0);
4827 integer_minus_one_node = build_int_2 (-1, -1);
4829 size_zero_node = size_int (0);
4830 size_one_node = size_int (1);
4831 bitsize_zero_node = bitsize_int (0);
4832 bitsize_one_node = bitsize_int (1);
4833 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
4835 void_type_node = make_node (VOID_TYPE);
4836 layout_type (void_type_node);
4838 /* We are not going to have real types in C with less than byte alignment,
4839 so we might as well not have any types that claim to have it. */
4840 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
4841 TYPE_USER_ALIGN (void_type_node) = 0;
4843 null_pointer_node = build_int_2 (0, 0);
4844 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
4845 layout_type (TREE_TYPE (null_pointer_node));
4847 ptr_type_node = build_pointer_type (void_type_node);
4849 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
4851 float_type_node = make_node (REAL_TYPE);
4852 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
4853 layout_type (float_type_node);
4855 double_type_node = make_node (REAL_TYPE);
4857 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
4859 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
4860 layout_type (double_type_node);
4862 long_double_type_node = make_node (REAL_TYPE);
4863 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
4864 layout_type (long_double_type_node);
4866 complex_integer_type_node = make_node (COMPLEX_TYPE);
4867 TREE_TYPE (complex_integer_type_node) = integer_type_node;
4868 layout_type (complex_integer_type_node);
4870 complex_float_type_node = make_node (COMPLEX_TYPE);
4871 TREE_TYPE (complex_float_type_node) = float_type_node;
4872 layout_type (complex_float_type_node);
4874 complex_double_type_node = make_node (COMPLEX_TYPE);
4875 TREE_TYPE (complex_double_type_node) = double_type_node;
4876 layout_type (complex_double_type_node);
4878 complex_long_double_type_node = make_node (COMPLEX_TYPE);
4879 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
4880 layout_type (complex_long_double_type_node);
4884 BUILD_VA_LIST_TYPE (t);
4886 /* Many back-ends define record types without seting TYPE_NAME.
4887 If we copied the record type here, we'd keep the original
4888 record type without a name. This breaks name mangling. So,
4889 don't copy record types and let c_common_nodes_and_builtins()
4890 declare the type to be __builtin_va_list. */
4891 if (TREE_CODE (t) != RECORD_TYPE)
4892 t = build_type_copy (t);
4894 va_list_type_node = t;
4897 unsigned_V4SI_type_node
4898 = make_vector (V4SImode, unsigned_intSI_type_node, 1);
4899 unsigned_V2SI_type_node
4900 = make_vector (V2SImode, unsigned_intSI_type_node, 1);
4901 unsigned_V4HI_type_node
4902 = make_vector (V4HImode, unsigned_intHI_type_node, 1);
4903 unsigned_V8QI_type_node
4904 = make_vector (V8QImode, unsigned_intQI_type_node, 1);
4905 unsigned_V8HI_type_node
4906 = make_vector (V8HImode, unsigned_intHI_type_node, 1);
4907 unsigned_V16QI_type_node
4908 = make_vector (V16QImode, unsigned_intQI_type_node, 1);
4910 V16SF_type_node = make_vector (V16SFmode, float_type_node, 0);
4911 V4SF_type_node = make_vector (V4SFmode, float_type_node, 0);
4912 V4SI_type_node = make_vector (V4SImode, intSI_type_node, 0);
4913 V2SI_type_node = make_vector (V2SImode, intSI_type_node, 0);
4914 V4HI_type_node = make_vector (V4HImode, intHI_type_node, 0);
4915 V8QI_type_node = make_vector (V8QImode, intQI_type_node, 0);
4916 V8HI_type_node = make_vector (V8HImode, intHI_type_node, 0);
4917 V2SF_type_node = make_vector (V2SFmode, float_type_node, 0);
4918 V16QI_type_node = make_vector (V16QImode, intQI_type_node, 0);
4921 /* Returns a vector tree node given a vector mode, the inner type, and
4925 make_vector (mode, innertype, unsignedp)
4926 enum machine_mode mode;
4932 t = make_node (VECTOR_TYPE);
4933 TREE_TYPE (t) = innertype;
4934 TYPE_MODE (t) = mode;
4935 TREE_UNSIGNED (TREE_TYPE (t)) = unsignedp;
4936 finish_vector_type (t);
4941 /* Given an initializer INIT, return TRUE if INIT is zero or some
4942 aggregate of zeros. Otherwise return FALSE. */
4945 initializer_zerop (init)
4950 switch (TREE_CODE (init))
4953 return integer_zerop (init);
4955 return real_zerop (init)
4956 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
4958 return integer_zerop (init)
4959 || (real_zerop (init)
4960 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
4961 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
4964 if (AGGREGATE_TYPE_P (TREE_TYPE (init)))
4966 tree aggr_init = TREE_OPERAND (init, 1);
4970 if (! initializer_zerop (TREE_VALUE (aggr_init)))
4972 aggr_init = TREE_CHAIN (aggr_init);