1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
49 #define obstack_chunk_alloc xmalloc
50 #define obstack_chunk_free free
51 /* obstack.[ch] explicitly declined to prototype this. */
52 extern int _obstack_allocated_p PARAMS ((struct obstack *h, PTR obj));
54 static void unsave_expr_now_r PARAMS ((tree));
56 /* Objects allocated on this obstack last forever. */
58 struct obstack permanent_obstack;
60 /* Table indexed by tree code giving a string containing a character
61 classifying the tree code. Possibilities are
62 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
64 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
66 char tree_code_type[MAX_TREE_CODES] = {
71 /* Table indexed by tree code giving number of expression
72 operands beyond the fixed part of the node structure.
73 Not used for types or decls. */
75 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
77 int tree_code_length[MAX_TREE_CODES] = {
82 /* Names of tree components.
83 Used for printing out the tree and error messages. */
84 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
86 const char *tree_code_name[MAX_TREE_CODES] = {
91 /* Statistics-gathering stuff. */
112 int tree_node_counts[(int) all_kinds];
113 int tree_node_sizes[(int) all_kinds];
114 int id_string_size = 0;
116 static const char * const tree_node_kind_names[] = {
134 /* Unique id for next decl created. */
135 static int next_decl_uid;
136 /* Unique id for next type created. */
137 static int next_type_uid = 1;
139 /* Since we cannot rehash a type after it is in the table, we have to
140 keep the hash code. */
148 /* Initial size of the hash table (rounded to next prime). */
149 #define TYPE_HASH_INITIAL_SIZE 1000
151 /* Now here is the hash table. When recording a type, it is added to
152 the slot whose index is the hash code. Note that the hash table is
153 used for several kinds of types (function types, array types and
154 array index range types, for now). While all these live in the
155 same table, they are completely independent, and the hash code is
156 computed differently for each of these. */
158 htab_t type_hash_table;
160 static void build_real_from_int_cst_1 PARAMS ((PTR));
161 static void set_type_quals PARAMS ((tree, int));
162 static void append_random_chars PARAMS ((char *));
163 static void mark_type_hash PARAMS ((void *));
164 static int type_hash_eq PARAMS ((const void*, const void*));
165 static unsigned int type_hash_hash PARAMS ((const void*));
166 static void print_type_hash_statistics PARAMS((void));
167 static int mark_hash_entry PARAMS((void **, void *));
168 static void finish_vector_type PARAMS((tree));
169 static int mark_tree_hashtable_entry PARAMS((void **, void *));
171 /* If non-null, these are language-specific helper functions for
172 unsave_expr_now. If present, LANG_UNSAVE is called before its
173 argument (an UNSAVE_EXPR) is to be unsaved, and all other
174 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
175 called from unsave_expr_1 for language-specific tree codes. */
176 void (*lang_unsave) PARAMS ((tree *));
177 void (*lang_unsave_expr_now) PARAMS ((tree));
179 /* If non-null, these are language-specific helper functions for
180 unsafe_for_reeval. Return negative to not handle some tree. */
181 int (*lang_unsafe_for_reeval) PARAMS ((tree));
183 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
184 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
185 appropriate IDENTIFIER_NODE. Otherwise, set it to the
186 ERROR_MARK_NODE to ensure that the assembler does not talk about
188 void (*lang_set_decl_assembler_name) PARAMS ((tree));
190 tree global_trees[TI_MAX];
191 tree integer_types[itk_none];
193 /* Set the DECL_ASSEMBLER_NAME for DECL. */
195 set_decl_assembler_name (decl)
198 /* The language-independent code should never use the
199 DECL_ASSEMBLER_NAME for lots of DECLs. Only FUNCTION_DECLs and
200 VAR_DECLs for variables with static storage duration need a real
201 DECL_ASSEMBLER_NAME. */
202 if (TREE_CODE (decl) == FUNCTION_DECL
203 || (TREE_CODE (decl) == VAR_DECL
204 && (TREE_STATIC (decl)
205 || DECL_EXTERNAL (decl)
206 || TREE_PUBLIC (decl))))
207 /* By default, assume the name to use in assembly code is the
208 same as that used in the source language. (That's correct
209 for C, and GCC used to set DECL_ASSEMBLER_NAME to the same
210 value as DECL_NAME in build_decl, so this choice provides
211 backwards compatibility with existing front-ends. */
212 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
214 /* Nobody should ever be asking for the DECL_ASSEMBLER_NAME of
215 these DECLs -- unless they're in language-dependent code, in
216 which case lang_set_decl_assembler_name should handle things. */
220 /* Init the principal obstacks. */
225 gcc_obstack_init (&permanent_obstack);
227 /* Initialize the hash table of types. */
228 type_hash_table = htab_create (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
230 ggc_add_root (&type_hash_table, 1, sizeof type_hash_table, mark_type_hash);
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 register int type = TREE_CODE_CLASS (code);
332 register size_t length;
333 #ifdef GATHER_STATISTICS
334 register tree_node_kind kind;
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 == OP_IDENTIFIER)
385 else if (code == TREE_VEC)
395 tree_node_counts[(int) kind]++;
396 tree_node_sizes[(int) kind] += length;
399 t = ggc_alloc_tree (length);
401 memset ((PTR) t, 0, length);
403 TREE_SET_CODE (t, code);
408 TREE_SIDE_EFFECTS (t) = 1;
409 TREE_TYPE (t) = void_type_node;
413 if (code != FUNCTION_DECL)
415 DECL_USER_ALIGN (t) = 0;
416 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
417 DECL_SOURCE_LINE (t) = lineno;
418 DECL_SOURCE_FILE (t) =
419 (input_filename) ? input_filename : "<built-in>";
420 DECL_UID (t) = next_decl_uid++;
422 /* We have not yet computed the alias set for this declaration. */
423 DECL_POINTER_ALIAS_SET (t) = -1;
427 TYPE_UID (t) = next_type_uid++;
428 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
429 TYPE_USER_ALIGN (t) = 0;
430 TYPE_MAIN_VARIANT (t) = t;
432 /* Default to no attributes for type, but let target change that. */
433 TYPE_ATTRIBUTES (t) = NULL_TREE;
434 (*targetm.set_default_type_attributes) (t);
436 /* We have not yet computed the alias set for this type. */
437 TYPE_ALIAS_SET (t) = -1;
441 TREE_CONSTANT (t) = 1;
451 case PREDECREMENT_EXPR:
452 case PREINCREMENT_EXPR:
453 case POSTDECREMENT_EXPR:
454 case POSTINCREMENT_EXPR:
455 /* All of these have side-effects, no matter what their
457 TREE_SIDE_EFFECTS (t) = 1;
469 /* A front-end can reset this to an appropriate function if types need
472 tree (*make_lang_type_fn) PARAMS ((enum tree_code)) = make_node;
474 /* Return a new type (with the indicated CODE), doing whatever
475 language-specific processing is required. */
478 make_lang_type (code)
481 return (*make_lang_type_fn) (code);
484 /* Return a new node with the same contents as NODE except that its
485 TREE_CHAIN is zero and it has a fresh uid. */
492 register enum tree_code code = TREE_CODE (node);
493 register size_t length;
495 length = tree_size (node);
496 t = ggc_alloc_tree (length);
497 memcpy (t, node, length);
500 TREE_ASM_WRITTEN (t) = 0;
502 if (TREE_CODE_CLASS (code) == 'd')
503 DECL_UID (t) = next_decl_uid++;
504 else if (TREE_CODE_CLASS (code) == 't')
506 TYPE_UID (t) = next_type_uid++;
507 /* The following is so that the debug code for
508 the copy is different from the original type.
509 The two statements usually duplicate each other
510 (because they clear fields of the same union),
511 but the optimizer should catch that. */
512 TYPE_SYMTAB_POINTER (t) = 0;
513 TYPE_SYMTAB_ADDRESS (t) = 0;
519 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
520 For example, this can copy a list made of TREE_LIST nodes. */
527 register tree prev, next;
532 head = prev = copy_node (list);
533 next = TREE_CHAIN (list);
536 TREE_CHAIN (prev) = copy_node (next);
537 prev = TREE_CHAIN (prev);
538 next = TREE_CHAIN (next);
544 /* Return a newly constructed INTEGER_CST node whose constant value
545 is specified by the two ints LOW and HI.
546 The TREE_TYPE is set to `int'.
548 This function should be used via the `build_int_2' macro. */
551 build_int_2_wide (low, hi)
552 unsigned HOST_WIDE_INT low;
555 register tree t = make_node (INTEGER_CST);
557 TREE_INT_CST_LOW (t) = low;
558 TREE_INT_CST_HIGH (t) = hi;
559 TREE_TYPE (t) = integer_type_node;
563 /* Return a new REAL_CST node whose type is TYPE and value is D. */
573 /* Check for valid float value for this type on this target machine;
574 if not, can print error message and store a valid value in D. */
575 #ifdef CHECK_FLOAT_VALUE
576 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
579 v = make_node (REAL_CST);
580 TREE_TYPE (v) = type;
581 TREE_REAL_CST (v) = d;
582 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
586 /* Return a new REAL_CST node whose type is TYPE
587 and whose value is the integer value of the INTEGER_CST node I. */
589 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
592 real_value_from_int_cst (type, i)
593 tree type ATTRIBUTE_UNUSED, i;
597 #ifdef REAL_ARITHMETIC
598 /* Clear all bits of the real value type so that we can later do
599 bitwise comparisons to see if two values are the same. */
600 memset ((char *) &d, 0, sizeof d);
602 if (! TREE_UNSIGNED (TREE_TYPE (i)))
603 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
606 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
607 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
608 #else /* not REAL_ARITHMETIC */
609 /* Some 386 compilers mishandle unsigned int to float conversions,
610 so introduce a temporary variable E to avoid those bugs. */
611 if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i)))
615 d = (double) (~TREE_INT_CST_HIGH (i));
616 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
617 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
619 e = (double) (~TREE_INT_CST_LOW (i));
627 d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i);
628 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
629 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
631 e = (double) TREE_INT_CST_LOW (i);
634 #endif /* not REAL_ARITHMETIC */
638 /* Args to pass to and from build_real_from_int_cst_1. */
642 tree type; /* Input: type to conver to. */
643 tree i; /* Input: operand to convert. */
644 REAL_VALUE_TYPE d; /* Output: floating point value. */
647 /* Convert an integer to a floating point value while protected by a floating
648 point exception handler. */
651 build_real_from_int_cst_1 (data)
654 struct brfic_args *args = (struct brfic_args *) data;
656 #ifdef REAL_ARITHMETIC
657 args->d = real_value_from_int_cst (args->type, args->i);
660 = REAL_VALUE_TRUNCATE (TYPE_MODE (args->type),
661 real_value_from_int_cst (args->type, args->i));
665 /* Given a tree representing an integer constant I, return a tree
666 representing the same value as a floating-point constant of type TYPE.
667 We cannot perform this operation if there is no way of doing arithmetic
668 on floating-point values. */
671 build_real_from_int_cst (type, i)
676 int overflow = TREE_OVERFLOW (i);
678 struct brfic_args args;
680 v = make_node (REAL_CST);
681 TREE_TYPE (v) = type;
683 /* Setup input for build_real_from_int_cst_1() */
687 if (do_float_handler (build_real_from_int_cst_1, (PTR) &args))
688 /* Receive output from build_real_from_int_cst_1() */
692 /* We got an exception from build_real_from_int_cst_1() */
697 /* Check for valid float value for this type on this target machine. */
699 #ifdef CHECK_FLOAT_VALUE
700 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
703 TREE_REAL_CST (v) = d;
704 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
708 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
710 /* Return a newly constructed STRING_CST node whose value is
711 the LEN characters at STR.
712 The TREE_TYPE is not initialized. */
715 build_string (len, str)
719 register tree s = make_node (STRING_CST);
721 TREE_STRING_LENGTH (s) = len;
722 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
727 /* Return a newly constructed COMPLEX_CST node whose value is
728 specified by the real and imaginary parts REAL and IMAG.
729 Both REAL and IMAG should be constant nodes. TYPE, if specified,
730 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
733 build_complex (type, real, imag)
737 register tree t = make_node (COMPLEX_CST);
739 TREE_REALPART (t) = real;
740 TREE_IMAGPART (t) = imag;
741 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
742 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
743 TREE_CONSTANT_OVERFLOW (t)
744 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
748 /* Build a newly constructed TREE_VEC node of length LEN. */
755 register int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec);
757 #ifdef GATHER_STATISTICS
758 tree_node_counts[(int)vec_kind]++;
759 tree_node_sizes[(int)vec_kind] += length;
762 t = ggc_alloc_tree (length);
764 memset ((PTR) t, 0, length);
765 TREE_SET_CODE (t, TREE_VEC);
766 TREE_VEC_LENGTH (t) = len;
771 /* Return 1 if EXPR is the integer constant zero or a complex constant
780 return ((TREE_CODE (expr) == INTEGER_CST
781 && ! TREE_CONSTANT_OVERFLOW (expr)
782 && TREE_INT_CST_LOW (expr) == 0
783 && TREE_INT_CST_HIGH (expr) == 0)
784 || (TREE_CODE (expr) == COMPLEX_CST
785 && integer_zerop (TREE_REALPART (expr))
786 && integer_zerop (TREE_IMAGPART (expr))));
789 /* Return 1 if EXPR is the integer constant one or the corresponding
798 return ((TREE_CODE (expr) == INTEGER_CST
799 && ! TREE_CONSTANT_OVERFLOW (expr)
800 && TREE_INT_CST_LOW (expr) == 1
801 && TREE_INT_CST_HIGH (expr) == 0)
802 || (TREE_CODE (expr) == COMPLEX_CST
803 && integer_onep (TREE_REALPART (expr))
804 && integer_zerop (TREE_IMAGPART (expr))));
807 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
808 it contains. Likewise for the corresponding complex constant. */
811 integer_all_onesp (expr)
819 if (TREE_CODE (expr) == COMPLEX_CST
820 && integer_all_onesp (TREE_REALPART (expr))
821 && integer_zerop (TREE_IMAGPART (expr)))
824 else if (TREE_CODE (expr) != INTEGER_CST
825 || TREE_CONSTANT_OVERFLOW (expr))
828 uns = TREE_UNSIGNED (TREE_TYPE (expr));
830 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
831 && TREE_INT_CST_HIGH (expr) == -1);
833 /* Note that using TYPE_PRECISION here is wrong. We care about the
834 actual bits, not the (arbitrary) range of the type. */
835 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
836 if (prec >= HOST_BITS_PER_WIDE_INT)
838 HOST_WIDE_INT high_value;
841 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
843 if (shift_amount > HOST_BITS_PER_WIDE_INT)
844 /* Can not handle precisions greater than twice the host int size. */
846 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
847 /* Shifting by the host word size is undefined according to the ANSI
848 standard, so we must handle this as a special case. */
851 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
853 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
854 && TREE_INT_CST_HIGH (expr) == high_value);
857 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
860 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
868 HOST_WIDE_INT high, low;
872 if (TREE_CODE (expr) == COMPLEX_CST
873 && integer_pow2p (TREE_REALPART (expr))
874 && integer_zerop (TREE_IMAGPART (expr)))
877 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
880 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
881 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
882 high = TREE_INT_CST_HIGH (expr);
883 low = TREE_INT_CST_LOW (expr);
885 /* First clear all bits that are beyond the type's precision in case
886 we've been sign extended. */
888 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
890 else if (prec > HOST_BITS_PER_WIDE_INT)
891 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
895 if (prec < HOST_BITS_PER_WIDE_INT)
896 low &= ~((HOST_WIDE_INT) (-1) << prec);
899 if (high == 0 && low == 0)
902 return ((high == 0 && (low & (low - 1)) == 0)
903 || (low == 0 && (high & (high - 1)) == 0));
906 /* Return the power of two represented by a tree node known to be a
914 HOST_WIDE_INT high, low;
918 if (TREE_CODE (expr) == COMPLEX_CST)
919 return tree_log2 (TREE_REALPART (expr));
921 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
922 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
924 high = TREE_INT_CST_HIGH (expr);
925 low = TREE_INT_CST_LOW (expr);
927 /* First clear all bits that are beyond the type's precision in case
928 we've been sign extended. */
930 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
932 else if (prec > HOST_BITS_PER_WIDE_INT)
933 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
937 if (prec < HOST_BITS_PER_WIDE_INT)
938 low &= ~((HOST_WIDE_INT) (-1) << prec);
941 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
945 /* Similar, but return the largest integer Y such that 2 ** Y is less
946 than or equal to EXPR. */
949 tree_floor_log2 (expr)
953 HOST_WIDE_INT high, low;
957 if (TREE_CODE (expr) == COMPLEX_CST)
958 return tree_log2 (TREE_REALPART (expr));
960 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
961 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
963 high = TREE_INT_CST_HIGH (expr);
964 low = TREE_INT_CST_LOW (expr);
966 /* First clear all bits that are beyond the type's precision in case
967 we've been sign extended. Ignore if type's precision hasn't been set
968 since what we are doing is setting it. */
970 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
972 else if (prec > HOST_BITS_PER_WIDE_INT)
973 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
977 if (prec < HOST_BITS_PER_WIDE_INT)
978 low &= ~((HOST_WIDE_INT) (-1) << prec);
981 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
985 /* Return 1 if EXPR is the real constant zero. */
993 return ((TREE_CODE (expr) == REAL_CST
994 && ! TREE_CONSTANT_OVERFLOW (expr)
995 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
996 || (TREE_CODE (expr) == COMPLEX_CST
997 && real_zerop (TREE_REALPART (expr))
998 && real_zerop (TREE_IMAGPART (expr))));
1001 /* Return 1 if EXPR is the real constant one in real or complex form. */
1009 return ((TREE_CODE (expr) == REAL_CST
1010 && ! TREE_CONSTANT_OVERFLOW (expr)
1011 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1012 || (TREE_CODE (expr) == COMPLEX_CST
1013 && real_onep (TREE_REALPART (expr))
1014 && real_zerop (TREE_IMAGPART (expr))));
1017 /* Return 1 if EXPR is the real constant two. */
1025 return ((TREE_CODE (expr) == REAL_CST
1026 && ! TREE_CONSTANT_OVERFLOW (expr)
1027 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1028 || (TREE_CODE (expr) == COMPLEX_CST
1029 && real_twop (TREE_REALPART (expr))
1030 && real_zerop (TREE_IMAGPART (expr))));
1033 /* Nonzero if EXP is a constant or a cast of a constant. */
1036 really_constant_p (exp)
1039 /* This is not quite the same as STRIP_NOPS. It does more. */
1040 while (TREE_CODE (exp) == NOP_EXPR
1041 || TREE_CODE (exp) == CONVERT_EXPR
1042 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1043 exp = TREE_OPERAND (exp, 0);
1044 return TREE_CONSTANT (exp);
1047 /* Return first list element whose TREE_VALUE is ELEM.
1048 Return 0 if ELEM is not in LIST. */
1051 value_member (elem, list)
1056 if (elem == TREE_VALUE (list))
1058 list = TREE_CHAIN (list);
1063 /* Return first list element whose TREE_PURPOSE is ELEM.
1064 Return 0 if ELEM is not in LIST. */
1067 purpose_member (elem, list)
1072 if (elem == TREE_PURPOSE (list))
1074 list = TREE_CHAIN (list);
1079 /* Return first list element whose BINFO_TYPE is ELEM.
1080 Return 0 if ELEM is not in LIST. */
1083 binfo_member (elem, list)
1088 if (elem == BINFO_TYPE (list))
1090 list = TREE_CHAIN (list);
1095 /* Return nonzero if ELEM is part of the chain CHAIN. */
1098 chain_member (elem, chain)
1105 chain = TREE_CHAIN (chain);
1111 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1112 chain CHAIN. This and the next function are currently unused, but
1113 are retained for completeness. */
1116 chain_member_value (elem, chain)
1121 if (elem == TREE_VALUE (chain))
1123 chain = TREE_CHAIN (chain);
1129 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1130 for any piece of chain CHAIN. */
1133 chain_member_purpose (elem, chain)
1138 if (elem == TREE_PURPOSE (chain))
1140 chain = TREE_CHAIN (chain);
1146 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1147 We expect a null pointer to mark the end of the chain.
1148 This is the Lisp primitive `length'. */
1155 register int len = 0;
1157 for (tail = t; tail; tail = TREE_CHAIN (tail))
1163 /* Returns the number of FIELD_DECLs in TYPE. */
1166 fields_length (type)
1169 tree t = TYPE_FIELDS (type);
1172 for (; t; t = TREE_CHAIN (t))
1173 if (TREE_CODE (t) == FIELD_DECL)
1179 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1180 by modifying the last node in chain 1 to point to chain 2.
1181 This is the Lisp primitive `nconc'. */
1191 #ifdef ENABLE_TREE_CHECKING
1195 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1197 TREE_CHAIN (t1) = op2;
1198 #ifdef ENABLE_TREE_CHECKING
1199 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1201 abort (); /* Circularity created. */
1209 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1213 register tree chain;
1217 while ((next = TREE_CHAIN (chain)))
1222 /* Reverse the order of elements in the chain T,
1223 and return the new head of the chain (old last element). */
1229 register tree prev = 0, decl, next;
1230 for (decl = t; decl; decl = next)
1232 next = TREE_CHAIN (decl);
1233 TREE_CHAIN (decl) = prev;
1239 /* Given a chain CHAIN of tree nodes,
1240 construct and return a list of those nodes. */
1246 tree result = NULL_TREE;
1247 tree in_tail = chain;
1248 tree out_tail = NULL_TREE;
1252 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
1254 TREE_CHAIN (out_tail) = next;
1258 in_tail = TREE_CHAIN (in_tail);
1264 /* Return a newly created TREE_LIST node whose
1265 purpose and value fields are PARM and VALUE. */
1268 build_tree_list (parm, value)
1271 register tree t = make_node (TREE_LIST);
1272 TREE_PURPOSE (t) = parm;
1273 TREE_VALUE (t) = value;
1277 /* Return a newly created TREE_LIST node whose
1278 purpose and value fields are PARM and VALUE
1279 and whose TREE_CHAIN is CHAIN. */
1282 tree_cons (purpose, value, chain)
1283 tree purpose, value, chain;
1287 node = ggc_alloc_tree (sizeof (struct tree_list));
1289 memset (node, 0, sizeof (struct tree_common));
1291 #ifdef GATHER_STATISTICS
1292 tree_node_counts[(int) x_kind]++;
1293 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1296 TREE_SET_CODE (node, TREE_LIST);
1297 TREE_CHAIN (node) = chain;
1298 TREE_PURPOSE (node) = purpose;
1299 TREE_VALUE (node) = value;
1304 /* Return the size nominally occupied by an object of type TYPE
1305 when it resides in memory. The value is measured in units of bytes,
1306 and its data type is that normally used for type sizes
1307 (which is the first type created by make_signed_type or
1308 make_unsigned_type). */
1311 size_in_bytes (type)
1316 if (type == error_mark_node)
1317 return integer_zero_node;
1319 type = TYPE_MAIN_VARIANT (type);
1320 t = TYPE_SIZE_UNIT (type);
1324 incomplete_type_error (NULL_TREE, type);
1325 return size_zero_node;
1328 if (TREE_CODE (t) == INTEGER_CST)
1329 force_fit_type (t, 0);
1334 /* Return the size of TYPE (in bytes) as a wide integer
1335 or return -1 if the size can vary or is larger than an integer. */
1338 int_size_in_bytes (type)
1343 if (type == error_mark_node)
1346 type = TYPE_MAIN_VARIANT (type);
1347 t = TYPE_SIZE_UNIT (type);
1349 || TREE_CODE (t) != INTEGER_CST
1350 || TREE_OVERFLOW (t)
1351 || TREE_INT_CST_HIGH (t) != 0
1352 /* If the result would appear negative, it's too big to represent. */
1353 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1356 return TREE_INT_CST_LOW (t);
1359 /* Return the bit position of FIELD, in bits from the start of the record.
1360 This is a tree of type bitsizetype. */
1363 bit_position (field)
1367 return bit_from_pos (DECL_FIELD_OFFSET (field),
1368 DECL_FIELD_BIT_OFFSET (field));
1371 /* Likewise, but return as an integer. Abort if it cannot be represented
1372 in that way (since it could be a signed value, we don't have the option
1373 of returning -1 like int_size_in_byte can. */
1376 int_bit_position (field)
1379 return tree_low_cst (bit_position (field), 0);
1382 /* Return the byte position of FIELD, in bytes from the start of the record.
1383 This is a tree of type sizetype. */
1386 byte_position (field)
1389 return byte_from_pos (DECL_FIELD_OFFSET (field),
1390 DECL_FIELD_BIT_OFFSET (field));
1393 /* Likewise, but return as an integer. Abort if it cannot be represented
1394 in that way (since it could be a signed value, we don't have the option
1395 of returning -1 like int_size_in_byte can. */
1398 int_byte_position (field)
1401 return tree_low_cst (byte_position (field), 0);
1404 /* Return the strictest alignment, in bits, that T is known to have. */
1410 unsigned int align0, align1;
1412 switch (TREE_CODE (t))
1414 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1415 /* If we have conversions, we know that the alignment of the
1416 object must meet each of the alignments of the types. */
1417 align0 = expr_align (TREE_OPERAND (t, 0));
1418 align1 = TYPE_ALIGN (TREE_TYPE (t));
1419 return MAX (align0, align1);
1421 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1422 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1423 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1424 /* These don't change the alignment of an object. */
1425 return expr_align (TREE_OPERAND (t, 0));
1428 /* The best we can do is say that the alignment is the least aligned
1430 align0 = expr_align (TREE_OPERAND (t, 1));
1431 align1 = expr_align (TREE_OPERAND (t, 2));
1432 return MIN (align0, align1);
1434 case LABEL_DECL: case CONST_DECL:
1435 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1436 if (DECL_ALIGN (t) != 0)
1437 return DECL_ALIGN (t);
1441 return FUNCTION_BOUNDARY;
1447 /* Otherwise take the alignment from that of the type. */
1448 return TYPE_ALIGN (TREE_TYPE (t));
1451 /* Return, as a tree node, the number of elements for TYPE (which is an
1452 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1455 array_type_nelts (type)
1458 tree index_type, min, max;
1460 /* If they did it with unspecified bounds, then we should have already
1461 given an error about it before we got here. */
1462 if (! TYPE_DOMAIN (type))
1463 return error_mark_node;
1465 index_type = TYPE_DOMAIN (type);
1466 min = TYPE_MIN_VALUE (index_type);
1467 max = TYPE_MAX_VALUE (index_type);
1469 return (integer_zerop (min)
1471 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1474 /* Return nonzero if arg is static -- a reference to an object in
1475 static storage. This is not the same as the C meaning of `static'. */
1481 switch (TREE_CODE (arg))
1484 /* Nested functions aren't static, since taking their address
1485 involves a trampoline. */
1486 return (decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1487 && ! DECL_NON_ADDR_CONST_P (arg);
1490 return (TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1491 && ! DECL_NON_ADDR_CONST_P (arg);
1494 return TREE_STATIC (arg);
1500 /* If we are referencing a bitfield, we can't evaluate an
1501 ADDR_EXPR at compile time and so it isn't a constant. */
1503 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1504 && staticp (TREE_OPERAND (arg, 0)));
1510 /* This case is technically correct, but results in setting
1511 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1514 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1518 case ARRAY_RANGE_REF:
1519 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1520 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1521 return staticp (TREE_OPERAND (arg, 0));
1528 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1529 Do this to any expression which may be used in more than one place,
1530 but must be evaluated only once.
1532 Normally, expand_expr would reevaluate the expression each time.
1533 Calling save_expr produces something that is evaluated and recorded
1534 the first time expand_expr is called on it. Subsequent calls to
1535 expand_expr just reuse the recorded value.
1537 The call to expand_expr that generates code that actually computes
1538 the value is the first call *at compile time*. Subsequent calls
1539 *at compile time* generate code to use the saved value.
1540 This produces correct result provided that *at run time* control
1541 always flows through the insns made by the first expand_expr
1542 before reaching the other places where the save_expr was evaluated.
1543 You, the caller of save_expr, must make sure this is so.
1545 Constants, and certain read-only nodes, are returned with no
1546 SAVE_EXPR because that is safe. Expressions containing placeholders
1547 are not touched; see tree.def for an explanation of what these
1554 register tree t = fold (expr);
1556 /* We don't care about whether this can be used as an lvalue in this
1558 while (TREE_CODE (t) == NON_LVALUE_EXPR)
1559 t = TREE_OPERAND (t, 0);
1561 /* If the tree evaluates to a constant, then we don't want to hide that
1562 fact (i.e. this allows further folding, and direct checks for constants).
1563 However, a read-only object that has side effects cannot be bypassed.
1564 Since it is no problem to reevaluate literals, we just return the
1567 if (TREE_CONSTANT (t) || (TREE_READONLY (t) && ! TREE_SIDE_EFFECTS (t))
1568 || TREE_CODE (t) == SAVE_EXPR || TREE_CODE (t) == ERROR_MARK)
1571 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1572 it means that the size or offset of some field of an object depends on
1573 the value within another field.
1575 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1576 and some variable since it would then need to be both evaluated once and
1577 evaluated more than once. Front-ends must assure this case cannot
1578 happen by surrounding any such subexpressions in their own SAVE_EXPR
1579 and forcing evaluation at the proper time. */
1580 if (contains_placeholder_p (t))
1583 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1585 /* This expression might be placed ahead of a jump to ensure that the
1586 value was computed on both sides of the jump. So make sure it isn't
1587 eliminated as dead. */
1588 TREE_SIDE_EFFECTS (t) = 1;
1589 TREE_READONLY (t) = 1;
1593 /* Arrange for an expression to be expanded multiple independent
1594 times. This is useful for cleanup actions, as the backend can
1595 expand them multiple times in different places. */
1603 /* If this is already protected, no sense in protecting it again. */
1604 if (TREE_CODE (expr) == UNSAVE_EXPR)
1607 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1608 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1612 /* Returns the index of the first non-tree operand for CODE, or the number
1613 of operands if all are trees. */
1617 enum tree_code code;
1623 case GOTO_SUBROUTINE_EXPR:
1626 case WITH_CLEANUP_EXPR:
1628 case METHOD_CALL_EXPR:
1631 return TREE_CODE_LENGTH (code);
1635 /* Perform any modifications to EXPR required when it is unsaved. Does
1636 not recurse into EXPR's subtrees. */
1639 unsave_expr_1 (expr)
1642 switch (TREE_CODE (expr))
1645 if (! SAVE_EXPR_PERSISTENT_P (expr))
1646 SAVE_EXPR_RTL (expr) = 0;
1650 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1651 It's OK for this to happen if it was part of a subtree that
1652 isn't immediately expanded, such as operand 2 of another
1654 if (TREE_OPERAND (expr, 1))
1657 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1658 TREE_OPERAND (expr, 3) = NULL_TREE;
1662 /* I don't yet know how to emit a sequence multiple times. */
1663 if (RTL_EXPR_SEQUENCE (expr) != 0)
1668 if (lang_unsave_expr_now != 0)
1669 (*lang_unsave_expr_now) (expr);
1674 /* Helper function for unsave_expr_now. */
1677 unsave_expr_now_r (expr)
1680 enum tree_code code;
1682 /* There's nothing to do for NULL_TREE. */
1686 unsave_expr_1 (expr);
1688 code = TREE_CODE (expr);
1689 switch (TREE_CODE_CLASS (code))
1691 case 'c': /* a constant */
1692 case 't': /* a type node */
1693 case 'd': /* A decl node */
1694 case 'b': /* A block node */
1697 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1698 if (code == TREE_LIST)
1700 unsave_expr_now_r (TREE_VALUE (expr));
1701 unsave_expr_now_r (TREE_CHAIN (expr));
1705 case 'e': /* an expression */
1706 case 'r': /* a reference */
1707 case 's': /* an expression with side effects */
1708 case '<': /* a comparison expression */
1709 case '2': /* a binary arithmetic expression */
1710 case '1': /* a unary arithmetic expression */
1714 for (i = first_rtl_op (code) - 1; i >= 0; i--)
1715 unsave_expr_now_r (TREE_OPERAND (expr, i));
1724 /* Modify a tree in place so that all the evaluate only once things
1725 are cleared out. Return the EXPR given. */
1728 unsave_expr_now (expr)
1731 if (lang_unsave!= 0)
1732 (*lang_unsave) (&expr);
1734 unsave_expr_now_r (expr);
1739 /* Return 0 if it is safe to evaluate EXPR multiple times,
1740 return 1 if it is safe if EXPR is unsaved afterward, or
1741 return 2 if it is completely unsafe.
1743 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1744 an expression tree, so that it safe to unsave them and the surrounding
1745 context will be correct.
1747 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1748 occasionally across the whole of a function. It is therefore only
1749 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1750 below the UNSAVE_EXPR.
1752 RTL_EXPRs consume their rtl during evaluation. It is therefore
1753 never possible to unsave them. */
1756 unsafe_for_reeval (expr)
1760 enum tree_code code;
1765 if (expr == NULL_TREE)
1768 code = TREE_CODE (expr);
1769 first_rtl = first_rtl_op (code);
1778 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1780 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1781 unsafeness = MAX (tmp, unsafeness);
1787 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1788 return MAX (tmp, 1);
1795 if (lang_unsafe_for_reeval != 0)
1797 tmp = (*lang_unsafe_for_reeval) (expr);
1804 switch (TREE_CODE_CLASS (code))
1806 case 'c': /* a constant */
1807 case 't': /* a type node */
1808 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1809 case 'd': /* A decl node */
1810 case 'b': /* A block node */
1813 case 'e': /* an expression */
1814 case 'r': /* a reference */
1815 case 's': /* an expression with side effects */
1816 case '<': /* a comparison expression */
1817 case '2': /* a binary arithmetic expression */
1818 case '1': /* a unary arithmetic expression */
1819 for (i = first_rtl - 1; i >= 0; i--)
1821 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1822 unsafeness = MAX (tmp, unsafeness);
1832 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1833 or offset that depends on a field within a record. */
1836 contains_placeholder_p (exp)
1839 register enum tree_code code;
1845 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1846 in it since it is supplying a value for it. */
1847 code = TREE_CODE (exp);
1848 if (code == WITH_RECORD_EXPR)
1850 else if (code == PLACEHOLDER_EXPR)
1853 switch (TREE_CODE_CLASS (code))
1856 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1857 position computations since they will be converted into a
1858 WITH_RECORD_EXPR involving the reference, which will assume
1859 here will be valid. */
1860 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1863 if (code == TREE_LIST)
1864 return (contains_placeholder_p (TREE_VALUE (exp))
1865 || (TREE_CHAIN (exp) != 0
1866 && contains_placeholder_p (TREE_CHAIN (exp))));
1875 /* Ignoring the first operand isn't quite right, but works best. */
1876 return contains_placeholder_p (TREE_OPERAND (exp, 1));
1883 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1884 || contains_placeholder_p (TREE_OPERAND (exp, 1))
1885 || contains_placeholder_p (TREE_OPERAND (exp, 2)));
1888 /* If we already know this doesn't have a placeholder, don't
1890 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1893 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1894 result = contains_placeholder_p (TREE_OPERAND (exp, 0));
1896 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1901 return (TREE_OPERAND (exp, 1) != 0
1902 && contains_placeholder_p (TREE_OPERAND (exp, 1)));
1908 switch (TREE_CODE_LENGTH (code))
1911 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1913 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1914 || contains_placeholder_p (TREE_OPERAND (exp, 1)));
1925 /* Return 1 if EXP contains any expressions that produce cleanups for an
1926 outer scope to deal with. Used by fold. */
1934 if (! TREE_SIDE_EFFECTS (exp))
1937 switch (TREE_CODE (exp))
1940 case GOTO_SUBROUTINE_EXPR:
1941 case WITH_CLEANUP_EXPR:
1944 case CLEANUP_POINT_EXPR:
1948 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1950 cmp = has_cleanups (TREE_VALUE (exp));
1960 /* This general rule works for most tree codes. All exceptions should be
1961 handled above. If this is a language-specific tree code, we can't
1962 trust what might be in the operand, so say we don't know
1964 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1967 nops = first_rtl_op (TREE_CODE (exp));
1968 for (i = 0; i < nops; i++)
1969 if (TREE_OPERAND (exp, i) != 0)
1971 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1972 if (type == 'e' || type == '<' || type == '1' || type == '2'
1973 || type == 'r' || type == 's')
1975 cmp = has_cleanups (TREE_OPERAND (exp, i));
1984 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1985 return a tree with all occurrences of references to F in a
1986 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1987 contains only arithmetic expressions or a CALL_EXPR with a
1988 PLACEHOLDER_EXPR occurring only in its arglist. */
1991 substitute_in_expr (exp, f, r)
1996 enum tree_code code = TREE_CODE (exp);
2001 switch (TREE_CODE_CLASS (code))
2008 if (code == PLACEHOLDER_EXPR)
2010 else if (code == TREE_LIST)
2012 op0 = (TREE_CHAIN (exp) == 0
2013 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
2014 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
2015 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2018 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2027 switch (TREE_CODE_LENGTH (code))
2030 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2031 if (op0 == TREE_OPERAND (exp, 0))
2034 if (code == NON_LVALUE_EXPR)
2037 new = fold (build1 (code, TREE_TYPE (exp), op0));
2041 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2042 could, but we don't support it. */
2043 if (code == RTL_EXPR)
2045 else if (code == CONSTRUCTOR)
2048 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2049 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2050 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2053 new = fold (build (code, TREE_TYPE (exp), op0, op1));
2057 /* It cannot be that anything inside a SAVE_EXPR contains a
2058 PLACEHOLDER_EXPR. */
2059 if (code == SAVE_EXPR)
2062 else if (code == CALL_EXPR)
2064 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2065 if (op1 == TREE_OPERAND (exp, 1))
2068 return build (code, TREE_TYPE (exp),
2069 TREE_OPERAND (exp, 0), op1, NULL_TREE);
2072 else if (code != COND_EXPR)
2075 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2076 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2077 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2078 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2079 && op2 == TREE_OPERAND (exp, 2))
2082 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2095 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2096 and it is the right field, replace it with R. */
2097 for (inner = TREE_OPERAND (exp, 0);
2098 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2099 inner = TREE_OPERAND (inner, 0))
2101 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2102 && TREE_OPERAND (exp, 1) == f)
2105 /* If this expression hasn't been completed let, leave it
2107 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2108 && TREE_TYPE (inner) == 0)
2111 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2112 if (op0 == TREE_OPERAND (exp, 0))
2115 new = fold (build (code, TREE_TYPE (exp), op0,
2116 TREE_OPERAND (exp, 1)));
2120 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2121 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2122 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2123 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2124 && op2 == TREE_OPERAND (exp, 2))
2127 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2132 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2133 if (op0 == TREE_OPERAND (exp, 0))
2136 new = fold (build1 (code, TREE_TYPE (exp), op0));
2148 TREE_READONLY (new) = TREE_READONLY (exp);
2152 /* Stabilize a reference so that we can use it any number of times
2153 without causing its operands to be evaluated more than once.
2154 Returns the stabilized reference. This works by means of save_expr,
2155 so see the caveats in the comments about save_expr.
2157 Also allows conversion expressions whose operands are references.
2158 Any other kind of expression is returned unchanged. */
2161 stabilize_reference (ref)
2164 register tree result;
2165 register enum tree_code code = TREE_CODE (ref);
2172 /* No action is needed in this case. */
2178 case FIX_TRUNC_EXPR:
2179 case FIX_FLOOR_EXPR:
2180 case FIX_ROUND_EXPR:
2182 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2186 result = build_nt (INDIRECT_REF,
2187 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2191 result = build_nt (COMPONENT_REF,
2192 stabilize_reference (TREE_OPERAND (ref, 0)),
2193 TREE_OPERAND (ref, 1));
2197 result = build_nt (BIT_FIELD_REF,
2198 stabilize_reference (TREE_OPERAND (ref, 0)),
2199 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2200 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2204 result = build_nt (ARRAY_REF,
2205 stabilize_reference (TREE_OPERAND (ref, 0)),
2206 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2209 case ARRAY_RANGE_REF:
2210 result = build_nt (ARRAY_RANGE_REF,
2211 stabilize_reference (TREE_OPERAND (ref, 0)),
2212 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2216 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2217 it wouldn't be ignored. This matters when dealing with
2219 return stabilize_reference_1 (ref);
2222 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2223 save_expr (build1 (ADDR_EXPR,
2224 build_pointer_type (TREE_TYPE (ref)),
2228 /* If arg isn't a kind of lvalue we recognize, make no change.
2229 Caller should recognize the error for an invalid lvalue. */
2234 return error_mark_node;
2237 TREE_TYPE (result) = TREE_TYPE (ref);
2238 TREE_READONLY (result) = TREE_READONLY (ref);
2239 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2240 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2245 /* Subroutine of stabilize_reference; this is called for subtrees of
2246 references. Any expression with side-effects must be put in a SAVE_EXPR
2247 to ensure that it is only evaluated once.
2249 We don't put SAVE_EXPR nodes around everything, because assigning very
2250 simple expressions to temporaries causes us to miss good opportunities
2251 for optimizations. Among other things, the opportunity to fold in the
2252 addition of a constant into an addressing mode often gets lost, e.g.
2253 "y[i+1] += x;". In general, we take the approach that we should not make
2254 an assignment unless we are forced into it - i.e., that any non-side effect
2255 operator should be allowed, and that cse should take care of coalescing
2256 multiple utterances of the same expression should that prove fruitful. */
2259 stabilize_reference_1 (e)
2262 register tree result;
2263 register enum tree_code code = TREE_CODE (e);
2265 /* We cannot ignore const expressions because it might be a reference
2266 to a const array but whose index contains side-effects. But we can
2267 ignore things that are actual constant or that already have been
2268 handled by this function. */
2270 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2273 switch (TREE_CODE_CLASS (code))
2283 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2284 so that it will only be evaluated once. */
2285 /* The reference (r) and comparison (<) classes could be handled as
2286 below, but it is generally faster to only evaluate them once. */
2287 if (TREE_SIDE_EFFECTS (e))
2288 return save_expr (e);
2292 /* Constants need no processing. In fact, we should never reach
2297 /* Division is slow and tends to be compiled with jumps,
2298 especially the division by powers of 2 that is often
2299 found inside of an array reference. So do it just once. */
2300 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2301 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2302 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2303 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2304 return save_expr (e);
2305 /* Recursively stabilize each operand. */
2306 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2307 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2311 /* Recursively stabilize each operand. */
2312 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2319 TREE_TYPE (result) = TREE_TYPE (e);
2320 TREE_READONLY (result) = TREE_READONLY (e);
2321 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2322 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2327 /* Low-level constructors for expressions. */
2329 /* Build an expression of code CODE, data type TYPE,
2330 and operands as specified by the arguments ARG1 and following arguments.
2331 Expressions and reference nodes can be created this way.
2332 Constants, decls, types and misc nodes cannot be. */
2335 build VPARAMS ((enum tree_code code, tree tt, ...))
2337 #ifndef ANSI_PROTOTYPES
2338 enum tree_code code;
2343 register int length;
2350 #ifndef ANSI_PROTOTYPES
2351 code = va_arg (p, enum tree_code);
2352 tt = va_arg (p, tree);
2355 t = make_node (code);
2356 length = TREE_CODE_LENGTH (code);
2359 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2360 result based on those same flags for the arguments. But if the
2361 arguments aren't really even `tree' expressions, we shouldn't be trying
2363 fro = first_rtl_op (code);
2365 /* Expressions without side effects may be constant if their
2366 arguments are as well. */
2367 constant = (TREE_CODE_CLASS (code) == '<'
2368 || TREE_CODE_CLASS (code) == '1'
2369 || TREE_CODE_CLASS (code) == '2'
2370 || TREE_CODE_CLASS (code) == 'c');
2374 /* This is equivalent to the loop below, but faster. */
2375 register tree arg0 = va_arg (p, tree);
2376 register tree arg1 = va_arg (p, tree);
2378 TREE_OPERAND (t, 0) = arg0;
2379 TREE_OPERAND (t, 1) = arg1;
2380 TREE_READONLY (t) = 1;
2381 if (arg0 && fro > 0)
2383 if (TREE_SIDE_EFFECTS (arg0))
2384 TREE_SIDE_EFFECTS (t) = 1;
2385 if (!TREE_READONLY (arg0))
2386 TREE_READONLY (t) = 0;
2387 if (!TREE_CONSTANT (arg0))
2391 if (arg1 && fro > 1)
2393 if (TREE_SIDE_EFFECTS (arg1))
2394 TREE_SIDE_EFFECTS (t) = 1;
2395 if (!TREE_READONLY (arg1))
2396 TREE_READONLY (t) = 0;
2397 if (!TREE_CONSTANT (arg1))
2401 else if (length == 1)
2403 register tree arg0 = va_arg (p, tree);
2405 /* The only one-operand cases we handle here are those with side-effects.
2406 Others are handled with build1. So don't bother checked if the
2407 arg has side-effects since we'll already have set it.
2409 ??? This really should use build1 too. */
2410 if (TREE_CODE_CLASS (code) != 's')
2412 TREE_OPERAND (t, 0) = arg0;
2416 for (i = 0; i < length; i++)
2418 register tree operand = va_arg (p, tree);
2420 TREE_OPERAND (t, i) = operand;
2421 if (operand && fro > i)
2423 if (TREE_SIDE_EFFECTS (operand))
2424 TREE_SIDE_EFFECTS (t) = 1;
2425 if (!TREE_CONSTANT (operand))
2432 TREE_CONSTANT (t) = constant;
2436 /* Same as above, but only builds for unary operators.
2437 Saves lions share of calls to `build'; cuts down use
2438 of varargs, which is expensive for RISC machines. */
2441 build1 (code, type, node)
2442 enum tree_code code;
2446 register int length;
2447 #ifdef GATHER_STATISTICS
2448 register tree_node_kind kind;
2452 #ifdef GATHER_STATISTICS
2453 if (TREE_CODE_CLASS (code) == 'r')
2459 #ifdef ENABLE_CHECKING
2460 if (TREE_CODE_CLASS (code) == '2'
2461 || TREE_CODE_CLASS (code) == '<'
2462 || TREE_CODE_LENGTH (code) != 1)
2464 #endif /* ENABLE_CHECKING */
2466 length = sizeof (struct tree_exp);
2468 t = ggc_alloc_tree (length);
2470 memset ((PTR) t, 0, sizeof (struct tree_common));
2472 #ifdef GATHER_STATISTICS
2473 tree_node_counts[(int) kind]++;
2474 tree_node_sizes[(int) kind] += length;
2477 TREE_SET_CODE (t, code);
2479 TREE_TYPE (t) = type;
2480 TREE_COMPLEXITY (t) = 0;
2481 TREE_OPERAND (t, 0) = node;
2482 if (node && first_rtl_op (code) != 0)
2484 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2485 TREE_READONLY (t) = TREE_READONLY (node);
2494 case PREDECREMENT_EXPR:
2495 case PREINCREMENT_EXPR:
2496 case POSTDECREMENT_EXPR:
2497 case POSTINCREMENT_EXPR:
2498 /* All of these have side-effects, no matter what their
2500 TREE_SIDE_EFFECTS (t) = 1;
2501 TREE_READONLY (t) = 0;
2505 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2506 TREE_CONSTANT (t) = 1;
2513 /* Similar except don't specify the TREE_TYPE
2514 and leave the TREE_SIDE_EFFECTS as 0.
2515 It is permissible for arguments to be null,
2516 or even garbage if their values do not matter. */
2519 build_nt VPARAMS ((enum tree_code code, ...))
2521 #ifndef ANSI_PROTOTYPES
2522 enum tree_code code;
2526 register int length;
2531 #ifndef ANSI_PROTOTYPES
2532 code = va_arg (p, enum tree_code);
2535 t = make_node (code);
2536 length = TREE_CODE_LENGTH (code);
2538 for (i = 0; i < length; i++)
2539 TREE_OPERAND (t, i) = va_arg (p, tree);
2546 /* Commented out because this wants to be done very
2547 differently. See cp-lex.c. */
2549 build_op_identifier (op1, op2)
2552 register tree t = make_node (OP_IDENTIFIER);
2553 TREE_PURPOSE (t) = op1;
2554 TREE_VALUE (t) = op2;
2559 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2560 We do NOT enter this node in any sort of symbol table.
2562 layout_decl is used to set up the decl's storage layout.
2563 Other slots are initialized to 0 or null pointers. */
2566 build_decl (code, name, type)
2567 enum tree_code code;
2572 t = make_node (code);
2574 /* if (type == error_mark_node)
2575 type = integer_type_node; */
2576 /* That is not done, deliberately, so that having error_mark_node
2577 as the type can suppress useless errors in the use of this variable. */
2579 DECL_NAME (t) = name;
2580 TREE_TYPE (t) = type;
2582 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2584 else if (code == FUNCTION_DECL)
2585 DECL_MODE (t) = FUNCTION_MODE;
2590 /* BLOCK nodes are used to represent the structure of binding contours
2591 and declarations, once those contours have been exited and their contents
2592 compiled. This information is used for outputting debugging info. */
2595 build_block (vars, tags, subblocks, supercontext, chain)
2596 tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain;
2598 register tree block = make_node (BLOCK);
2600 BLOCK_VARS (block) = vars;
2601 BLOCK_SUBBLOCKS (block) = subblocks;
2602 BLOCK_SUPERCONTEXT (block) = supercontext;
2603 BLOCK_CHAIN (block) = chain;
2607 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2608 location where an expression or an identifier were encountered. It
2609 is necessary for languages where the frontend parser will handle
2610 recursively more than one file (Java is one of them). */
2613 build_expr_wfl (node, file, line, col)
2618 static const char *last_file = 0;
2619 static tree last_filenode = NULL_TREE;
2620 register tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2622 EXPR_WFL_NODE (wfl) = node;
2623 EXPR_WFL_SET_LINECOL (wfl, line, col);
2624 if (file != last_file)
2627 last_filenode = file ? get_identifier (file) : NULL_TREE;
2630 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2633 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2634 TREE_TYPE (wfl) = TREE_TYPE (node);
2640 /* Return a declaration like DDECL except that its DECL_MACHINE_ATTRIBUTE
2644 build_decl_attribute_variant (ddecl, attribute)
2645 tree ddecl, attribute;
2647 DECL_MACHINE_ATTRIBUTES (ddecl) = attribute;
2651 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2654 Record such modified types already made so we don't make duplicates. */
2657 build_type_attribute_variant (ttype, attribute)
2658 tree ttype, attribute;
2660 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2662 unsigned int hashcode;
2665 ntype = copy_node (ttype);
2667 TYPE_POINTER_TO (ntype) = 0;
2668 TYPE_REFERENCE_TO (ntype) = 0;
2669 TYPE_ATTRIBUTES (ntype) = attribute;
2671 /* Create a new main variant of TYPE. */
2672 TYPE_MAIN_VARIANT (ntype) = ntype;
2673 TYPE_NEXT_VARIANT (ntype) = 0;
2674 set_type_quals (ntype, TYPE_UNQUALIFIED);
2676 hashcode = (TYPE_HASH (TREE_CODE (ntype))
2677 + TYPE_HASH (TREE_TYPE (ntype))
2678 + attribute_hash_list (attribute));
2680 switch (TREE_CODE (ntype))
2683 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2686 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2689 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2692 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2698 ntype = type_hash_canon (hashcode, ntype);
2699 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2705 /* Default value of targetm.valid_decl_attribute_p and
2706 targetm.valid_type_attribute_p that always returns false. */
2709 default_valid_attribute_p PARAMS ((attr_name, attr_args, decl, type))
2710 tree attr_name ATTRIBUTE_UNUSED;
2711 tree attr_args ATTRIBUTE_UNUSED;
2712 tree decl ATTRIBUTE_UNUSED;
2713 tree type ATTRIBUTE_UNUSED;
2718 /* Default value of targetm.comp_type_attributes that always returns 1. */
2721 default_comp_type_attributes (type1, type2)
2722 tree type1 ATTRIBUTE_UNUSED;
2723 tree type2 ATTRIBUTE_UNUSED;
2728 /* Default version of targetm.set_default_type_attributes that always does
2732 default_set_default_type_attributes (type)
2733 tree type ATTRIBUTE_UNUSED;
2737 /* Default version of targetm.insert_attributes that always does nothing. */
2739 default_insert_attributes (decl, attr_ptr)
2740 tree decl ATTRIBUTE_UNUSED;
2741 tree *attr_ptr ATTRIBUTE_UNUSED;
2745 /* Return 1 if ATTR_NAME and ATTR_ARGS is valid for either declaration
2746 DECL or type TYPE and 0 otherwise. Validity is determined the
2747 target functions valid_decl_attribute and valid_machine_attribute. */
2750 valid_machine_attribute (attr_name, attr_args, decl, type)
2758 if (TREE_CODE (attr_name) != IDENTIFIER_NODE)
2763 tree decl_attrs = DECL_MACHINE_ATTRIBUTES (decl);
2765 if ((*targetm.valid_decl_attribute) (decl, decl_attrs, attr_name,
2768 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
2771 if (attr != NULL_TREE)
2773 /* Override existing arguments. Declarations are unique
2774 so we can modify this in place. */
2775 TREE_VALUE (attr) = attr_args;
2779 decl_attrs = tree_cons (attr_name, attr_args, decl_attrs);
2780 decl = build_decl_attribute_variant (decl, decl_attrs);
2783 /* Don't apply the attribute to both the decl and the type. */
2788 type_attrs = TYPE_ATTRIBUTES (type);
2789 if ((*targetm.valid_type_attribute) (type, type_attrs, attr_name,
2792 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
2795 if (attr != NULL_TREE)
2797 /* Override existing arguments. ??? This currently
2798 works since attribute arguments are not included in
2799 `attribute_hash_list'. Something more complicated
2800 may be needed in the future. */
2801 TREE_VALUE (attr) = attr_args;
2805 /* If this is part of a declaration, create a type variant,
2806 otherwise, this is part of a type definition, so add it
2807 to the base type. */
2808 type_attrs = tree_cons (attr_name, attr_args, type_attrs);
2810 type = build_type_attribute_variant (type, type_attrs);
2812 TYPE_ATTRIBUTES (type) = type_attrs;
2816 TREE_TYPE (decl) = type;
2820 /* Handle putting a type attribute on pointer-to-function-type
2821 by putting the attribute on the function type. */
2822 else if (POINTER_TYPE_P (type)
2823 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
2824 && (*targetm.valid_type_attribute) (TREE_TYPE (type), type_attrs,
2825 attr_name, attr_args))
2827 tree inner_type = TREE_TYPE (type);
2828 tree inner_attrs = TYPE_ATTRIBUTES (inner_type);
2829 tree attr = lookup_attribute (IDENTIFIER_POINTER (attr_name),
2832 if (attr != NULL_TREE)
2833 TREE_VALUE (attr) = attr_args;
2836 inner_attrs = tree_cons (attr_name, attr_args, inner_attrs);
2837 inner_type = build_type_attribute_variant (inner_type,
2842 TREE_TYPE (decl) = build_pointer_type (inner_type);
2845 /* Clear TYPE_POINTER_TO for the old inner type, since
2846 `type' won't be pointing to it anymore. */
2847 TYPE_POINTER_TO (TREE_TYPE (type)) = NULL_TREE;
2848 TREE_TYPE (type) = inner_type;
2857 /* Return non-zero if IDENT is a valid name for attribute ATTR,
2860 We try both `text' and `__text__', ATTR may be either one. */
2861 /* ??? It might be a reasonable simplification to require ATTR to be only
2862 `text'. One might then also require attribute lists to be stored in
2863 their canonicalized form. */
2866 is_attribute_p (attr, ident)
2870 int ident_len, attr_len;
2873 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2876 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2879 p = IDENTIFIER_POINTER (ident);
2880 ident_len = strlen (p);
2881 attr_len = strlen (attr);
2883 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2887 || attr[attr_len - 2] != '_'
2888 || attr[attr_len - 1] != '_')
2890 if (ident_len == attr_len - 4
2891 && strncmp (attr + 2, p, attr_len - 4) == 0)
2896 if (ident_len == attr_len + 4
2897 && p[0] == '_' && p[1] == '_'
2898 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2899 && strncmp (attr, p + 2, attr_len) == 0)
2906 /* Given an attribute name and a list of attributes, return a pointer to the
2907 attribute's list element if the attribute is part of the list, or NULL_TREE
2911 lookup_attribute (attr_name, list)
2912 const char *attr_name;
2917 for (l = list; l; l = TREE_CHAIN (l))
2919 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2921 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2928 /* Return an attribute list that is the union of a1 and a2. */
2931 merge_attributes (a1, a2)
2932 register tree a1, a2;
2936 /* Either one unset? Take the set one. */
2938 if ((attributes = a1) == 0)
2941 /* One that completely contains the other? Take it. */
2943 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2945 if (attribute_list_contained (a2, a1))
2949 /* Pick the longest list, and hang on the other list. */
2950 /* ??? For the moment we punt on the issue of attrs with args. */
2952 if (list_length (a1) < list_length (a2))
2953 attributes = a2, a2 = a1;
2955 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2956 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2957 attributes) == NULL_TREE)
2959 a1 = copy_node (a2);
2960 TREE_CHAIN (a1) = attributes;
2968 /* Given types T1 and T2, merge their attributes and return
2972 merge_type_attributes (t1, t2)
2975 return merge_attributes (TYPE_ATTRIBUTES (t1),
2976 TYPE_ATTRIBUTES (t2));
2979 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2983 merge_decl_attributes (olddecl, newdecl)
2984 tree olddecl, newdecl;
2986 return merge_attributes (DECL_MACHINE_ATTRIBUTES (olddecl),
2987 DECL_MACHINE_ATTRIBUTES (newdecl));
2990 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2992 /* Specialization of merge_decl_attributes for various Windows targets.
2994 This handles the following situation:
2996 __declspec (dllimport) int foo;
2999 The second instance of `foo' nullifies the dllimport. */
3002 merge_dllimport_decl_attributes (old, new)
3007 int delete_dllimport_p;
3009 old = DECL_MACHINE_ATTRIBUTES (old);
3010 new = DECL_MACHINE_ATTRIBUTES (new);
3012 /* What we need to do here is remove from `old' dllimport if it doesn't
3013 appear in `new'. dllimport behaves like extern: if a declaration is
3014 marked dllimport and a definition appears later, then the object
3015 is not dllimport'd. */
3016 if (lookup_attribute ("dllimport", old) != NULL_TREE
3017 && lookup_attribute ("dllimport", new) == NULL_TREE)
3018 delete_dllimport_p = 1;
3020 delete_dllimport_p = 0;
3022 a = merge_attributes (old, new);
3024 if (delete_dllimport_p)
3028 /* Scan the list for dllimport and delete it. */
3029 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3031 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3033 if (prev == NULL_TREE)
3036 TREE_CHAIN (prev) = TREE_CHAIN (t);
3045 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3047 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3048 of the various TYPE_QUAL values. */
3051 set_type_quals (type, type_quals)
3055 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3056 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3057 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3060 /* Return a version of the TYPE, qualified as indicated by the
3061 TYPE_QUALS, if one exists. If no qualified version exists yet,
3062 return NULL_TREE. */
3065 get_qualified_type (type, type_quals)
3071 /* Search the chain of variants to see if there is already one there just
3072 like the one we need to have. If so, use that existing one. We must
3073 preserve the TYPE_NAME, since there is code that depends on this. */
3074 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3075 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type))
3081 /* Like get_qualified_type, but creates the type if it does not
3082 exist. This function never returns NULL_TREE. */
3085 build_qualified_type (type, type_quals)
3091 /* See if we already have the appropriate qualified variant. */
3092 t = get_qualified_type (type, type_quals);
3094 /* If not, build it. */
3097 t = build_type_copy (type);
3098 set_type_quals (t, type_quals);
3104 /* Create a new variant of TYPE, equivalent but distinct.
3105 This is so the caller can modify it. */
3108 build_type_copy (type)
3111 register tree t, m = TYPE_MAIN_VARIANT (type);
3113 t = copy_node (type);
3115 TYPE_POINTER_TO (t) = 0;
3116 TYPE_REFERENCE_TO (t) = 0;
3118 /* Add this type to the chain of variants of TYPE. */
3119 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3120 TYPE_NEXT_VARIANT (m) = t;
3125 /* Hashing of types so that we don't make duplicates.
3126 The entry point is `type_hash_canon'. */
3128 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3129 with types in the TREE_VALUE slots), by adding the hash codes
3130 of the individual types. */
3133 type_hash_list (list)
3136 unsigned int hashcode;
3139 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3140 hashcode += TYPE_HASH (TREE_VALUE (tail));
3145 /* These are the Hashtable callback functions. */
3147 /* Returns true if the types are equal. */
3150 type_hash_eq (va, vb)
3154 const struct type_hash *a = va, *b = vb;
3155 if (a->hash == b->hash
3156 && TREE_CODE (a->type) == TREE_CODE (b->type)
3157 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
3158 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3159 TYPE_ATTRIBUTES (b->type))
3160 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
3161 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3162 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3163 TYPE_MAX_VALUE (b->type)))
3164 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3165 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3166 TYPE_MIN_VALUE (b->type)))
3167 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3168 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
3169 || (TYPE_DOMAIN (a->type)
3170 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
3171 && TYPE_DOMAIN (b->type)
3172 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
3173 && type_list_equal (TYPE_DOMAIN (a->type),
3174 TYPE_DOMAIN (b->type)))))
3179 /* Return the cached hash value. */
3182 type_hash_hash (item)
3185 return ((const struct type_hash *) item)->hash;
3188 /* Look in the type hash table for a type isomorphic to TYPE.
3189 If one is found, return it. Otherwise return 0. */
3192 type_hash_lookup (hashcode, type)
3193 unsigned int hashcode;
3196 struct type_hash *h, in;
3198 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3199 must call that routine before comparing TYPE_ALIGNs. */
3205 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3211 /* Add an entry to the type-hash-table
3212 for a type TYPE whose hash code is HASHCODE. */
3215 type_hash_add (hashcode, type)
3216 unsigned int hashcode;
3219 struct type_hash *h;
3222 h = (struct type_hash *) permalloc (sizeof (struct type_hash));
3225 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3226 *(struct type_hash **) loc = h;
3229 /* Given TYPE, and HASHCODE its hash code, return the canonical
3230 object for an identical type if one already exists.
3231 Otherwise, return TYPE, and record it as the canonical object
3232 if it is a permanent object.
3234 To use this function, first create a type of the sort you want.
3235 Then compute its hash code from the fields of the type that
3236 make it different from other similar types.
3237 Then call this function and use the value.
3238 This function frees the type you pass in if it is a duplicate. */
3240 /* Set to 1 to debug without canonicalization. Never set by program. */
3241 int debug_no_type_hash = 0;
3244 type_hash_canon (hashcode, type)
3245 unsigned int hashcode;
3250 if (debug_no_type_hash)
3253 t1 = type_hash_lookup (hashcode, type);
3256 #ifdef GATHER_STATISTICS
3257 tree_node_counts[(int) t_kind]--;
3258 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3263 /* If this is a permanent type, record it for later reuse. */
3264 type_hash_add (hashcode, type);
3269 /* Callback function for htab_traverse. */
3272 mark_hash_entry (entry, param)
3274 void *param ATTRIBUTE_UNUSED;
3276 struct type_hash *p = *(struct type_hash **) entry;
3278 ggc_mark_tree (p->type);
3280 /* Continue scan. */
3284 /* Mark ARG (which is really a htab_t *) for GC. */
3287 mark_type_hash (arg)
3290 htab_t t = *(htab_t *) arg;
3292 htab_traverse (t, mark_hash_entry, 0);
3295 /* Mark the hashtable slot pointed to by ENTRY (which is really a
3296 `tree**') for GC. */
3299 mark_tree_hashtable_entry (entry, data)
3301 void *data ATTRIBUTE_UNUSED;
3303 ggc_mark_tree ((tree) *entry);
3307 /* Mark ARG (which is really a htab_t whose slots are trees) for
3311 mark_tree_hashtable (arg)
3314 htab_t t = *(htab_t *) arg;
3315 htab_traverse (t, mark_tree_hashtable_entry, 0);
3319 print_type_hash_statistics ()
3321 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3322 (long) htab_size (type_hash_table),
3323 (long) htab_elements (type_hash_table),
3324 htab_collisions (type_hash_table));
3327 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3328 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3329 by adding the hash codes of the individual attributes. */
3332 attribute_hash_list (list)
3335 unsigned int hashcode;
3338 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3339 /* ??? Do we want to add in TREE_VALUE too? */
3340 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3344 /* Given two lists of attributes, return true if list l2 is
3345 equivalent to l1. */
3348 attribute_list_equal (l1, l2)
3351 return attribute_list_contained (l1, l2)
3352 && attribute_list_contained (l2, l1);
3355 /* Given two lists of attributes, return true if list L2 is
3356 completely contained within L1. */
3357 /* ??? This would be faster if attribute names were stored in a canonicalized
3358 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3359 must be used to show these elements are equivalent (which they are). */
3360 /* ??? It's not clear that attributes with arguments will always be handled
3364 attribute_list_contained (l1, l2)
3367 register tree t1, t2;
3369 /* First check the obvious, maybe the lists are identical. */
3373 /* Maybe the lists are similar. */
3374 for (t1 = l1, t2 = l2;
3376 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3377 && TREE_VALUE (t1) == TREE_VALUE (t2);
3378 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3380 /* Maybe the lists are equal. */
3381 if (t1 == 0 && t2 == 0)
3384 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3387 = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3392 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3399 /* Given two lists of types
3400 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3401 return 1 if the lists contain the same types in the same order.
3402 Also, the TREE_PURPOSEs must match. */
3405 type_list_equal (l1, l2)
3408 register tree t1, t2;
3410 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3411 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3412 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3413 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3414 && (TREE_TYPE (TREE_PURPOSE (t1))
3415 == TREE_TYPE (TREE_PURPOSE (t2))))))
3421 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3422 given by TYPE. If the argument list accepts variable arguments,
3423 then this function counts only the ordinary arguments. */
3426 type_num_arguments (type)
3432 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3433 /* If the function does not take a variable number of arguments,
3434 the last element in the list will have type `void'. */
3435 if (VOID_TYPE_P (TREE_VALUE (t)))
3443 /* Nonzero if integer constants T1 and T2
3444 represent the same constant value. */
3447 tree_int_cst_equal (t1, t2)
3453 if (t1 == 0 || t2 == 0)
3456 if (TREE_CODE (t1) == INTEGER_CST
3457 && TREE_CODE (t2) == INTEGER_CST
3458 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3459 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3465 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3466 The precise way of comparison depends on their data type. */
3469 tree_int_cst_lt (t1, t2)
3475 if (! TREE_UNSIGNED (TREE_TYPE (t1)))
3476 return INT_CST_LT (t1, t2);
3478 return INT_CST_LT_UNSIGNED (t1, t2);
3481 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3484 tree_int_cst_compare (t1, t2)
3488 if (tree_int_cst_lt (t1, t2))
3490 else if (tree_int_cst_lt (t2, t1))
3496 /* Return 1 if T is an INTEGER_CST that can be represented in a single
3497 HOST_WIDE_INT value. If POS is nonzero, the result must be positive. */
3500 host_integerp (t, pos)
3504 return (TREE_CODE (t) == INTEGER_CST
3505 && ! TREE_OVERFLOW (t)
3506 && ((TREE_INT_CST_HIGH (t) == 0
3507 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3508 || (! pos && TREE_INT_CST_HIGH (t) == -1
3509 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
3510 || (! pos && TREE_INT_CST_HIGH (t) == 0
3511 && TREE_UNSIGNED (TREE_TYPE (t)))));
3514 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3515 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3516 be positive. Abort if we cannot satisfy the above conditions. */
3519 tree_low_cst (t, pos)
3523 if (host_integerp (t, pos))
3524 return TREE_INT_CST_LOW (t);
3529 /* Return the most significant bit of the integer constant T. */
3532 tree_int_cst_msb (t)
3537 unsigned HOST_WIDE_INT l;
3539 /* Note that using TYPE_PRECISION here is wrong. We care about the
3540 actual bits, not the (arbitrary) range of the type. */
3541 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3542 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3543 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3544 return (l & 1) == 1;
3547 /* Return an indication of the sign of the integer constant T.
3548 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3549 Note that -1 will never be returned it T's type is unsigned. */
3552 tree_int_cst_sgn (t)
3555 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3557 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3559 else if (TREE_INT_CST_HIGH (t) < 0)
3565 /* Compare two constructor-element-type constants. Return 1 if the lists
3566 are known to be equal; otherwise return 0. */
3569 simple_cst_list_equal (l1, l2)
3572 while (l1 != NULL_TREE && l2 != NULL_TREE)
3574 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3577 l1 = TREE_CHAIN (l1);
3578 l2 = TREE_CHAIN (l2);
3584 /* Return truthvalue of whether T1 is the same tree structure as T2.
3585 Return 1 if they are the same.
3586 Return 0 if they are understandably different.
3587 Return -1 if either contains tree structure not understood by
3591 simple_cst_equal (t1, t2)
3594 register enum tree_code code1, code2;
3600 if (t1 == 0 || t2 == 0)
3603 code1 = TREE_CODE (t1);
3604 code2 = TREE_CODE (t2);
3606 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3608 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3609 || code2 == NON_LVALUE_EXPR)
3610 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3612 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3615 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3616 || code2 == NON_LVALUE_EXPR)
3617 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3625 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3626 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3629 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3632 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3633 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3634 TREE_STRING_LENGTH (t1)));
3637 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3643 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3646 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3650 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3653 /* Special case: if either target is an unallocated VAR_DECL,
3654 it means that it's going to be unified with whatever the
3655 TARGET_EXPR is really supposed to initialize, so treat it
3656 as being equivalent to anything. */
3657 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3658 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3659 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3660 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3661 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3662 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3665 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3670 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3672 case WITH_CLEANUP_EXPR:
3673 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3677 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3680 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3681 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3695 /* This general rule works for most tree codes. All exceptions should be
3696 handled above. If this is a language-specific tree code, we can't
3697 trust what might be in the operand, so say we don't know
3699 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3702 switch (TREE_CODE_CLASS (code1))
3711 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3713 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3725 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3726 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3727 than U, respectively. */
3730 compare_tree_int (t, u)
3734 if (tree_int_cst_sgn (t) < 0)
3736 else if (TREE_INT_CST_HIGH (t) != 0)
3738 else if (TREE_INT_CST_LOW (t) == u)
3740 else if (TREE_INT_CST_LOW (t) < u)
3746 /* Constructors for pointer, array and function types.
3747 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3748 constructed by language-dependent code, not here.) */
3750 /* Construct, lay out and return the type of pointers to TO_TYPE.
3751 If such a type has already been constructed, reuse it. */
3754 build_pointer_type (to_type)
3757 register tree t = TYPE_POINTER_TO (to_type);
3759 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3764 /* We need a new one. */
3765 t = make_node (POINTER_TYPE);
3767 TREE_TYPE (t) = to_type;
3769 /* Record this type as the pointer to TO_TYPE. */
3770 TYPE_POINTER_TO (to_type) = t;
3772 /* Lay out the type. This function has many callers that are concerned
3773 with expression-construction, and this simplifies them all.
3774 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3780 /* Build the node for the type of references-to-TO_TYPE. */
3783 build_reference_type (to_type)
3786 register tree t = TYPE_REFERENCE_TO (to_type);
3788 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3793 /* We need a new one. */
3794 t = make_node (REFERENCE_TYPE);
3796 TREE_TYPE (t) = to_type;
3798 /* Record this type as the pointer to TO_TYPE. */
3799 TYPE_REFERENCE_TO (to_type) = t;
3806 /* Build a type that is compatible with t but has no cv quals anywhere
3809 const char *const *const * -> char ***. */
3812 build_type_no_quals (t)
3815 switch (TREE_CODE (t))
3818 return build_pointer_type (build_type_no_quals (TREE_TYPE (t)));
3819 case REFERENCE_TYPE:
3820 return build_reference_type (build_type_no_quals (TREE_TYPE (t)));
3822 return TYPE_MAIN_VARIANT (t);
3826 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3827 MAXVAL should be the maximum value in the domain
3828 (one less than the length of the array).
3830 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3831 We don't enforce this limit, that is up to caller (e.g. language front end).
3832 The limit exists because the result is a signed type and we don't handle
3833 sizes that use more than one HOST_WIDE_INT. */
3836 build_index_type (maxval)
3839 register tree itype = make_node (INTEGER_TYPE);
3841 TREE_TYPE (itype) = sizetype;
3842 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3843 TYPE_MIN_VALUE (itype) = size_zero_node;
3844 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3845 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3846 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3847 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
3848 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3849 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
3851 if (host_integerp (maxval, 1))
3852 return type_hash_canon (tree_low_cst (maxval, 1), itype);
3857 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3858 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3859 low bound LOWVAL and high bound HIGHVAL.
3860 if TYPE==NULL_TREE, sizetype is used. */
3863 build_range_type (type, lowval, highval)
3864 tree type, lowval, highval;
3866 register tree itype = make_node (INTEGER_TYPE);
3868 TREE_TYPE (itype) = type;
3869 if (type == NULL_TREE)
3872 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3873 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
3875 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3876 TYPE_MODE (itype) = TYPE_MODE (type);
3877 TYPE_SIZE (itype) = TYPE_SIZE (type);
3878 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
3879 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3880 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
3882 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
3883 return type_hash_canon (tree_low_cst (highval, 0)
3884 - tree_low_cst (lowval, 0),
3890 /* Just like build_index_type, but takes lowval and highval instead
3891 of just highval (maxval). */
3894 build_index_2_type (lowval,highval)
3895 tree lowval, highval;
3897 return build_range_type (sizetype, lowval, highval);
3900 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
3901 Needed because when index types are not hashed, equal index types
3902 built at different times appear distinct, even though structurally,
3906 index_type_equal (itype1, itype2)
3907 tree itype1, itype2;
3909 if (TREE_CODE (itype1) != TREE_CODE (itype2))
3912 if (TREE_CODE (itype1) == INTEGER_TYPE)
3914 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
3915 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
3916 || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1
3917 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
3920 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1),
3921 TYPE_MIN_VALUE (itype2))
3922 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1),
3923 TYPE_MAX_VALUE (itype2)))
3930 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3931 and number of elements specified by the range of values of INDEX_TYPE.
3932 If such a type has already been constructed, reuse it. */
3935 build_array_type (elt_type, index_type)
3936 tree elt_type, index_type;
3939 unsigned int hashcode;
3941 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3943 error ("arrays of functions are not meaningful");
3944 elt_type = integer_type_node;
3947 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3948 build_pointer_type (elt_type);
3950 /* Allocate the array after the pointer type,
3951 in case we free it in type_hash_canon. */
3952 t = make_node (ARRAY_TYPE);
3953 TREE_TYPE (t) = elt_type;
3954 TYPE_DOMAIN (t) = index_type;
3956 if (index_type == 0)
3961 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3962 t = type_hash_canon (hashcode, t);
3964 if (!COMPLETE_TYPE_P (t))
3969 /* Return the TYPE of the elements comprising
3970 the innermost dimension of ARRAY. */
3973 get_inner_array_type (array)
3976 tree type = TREE_TYPE (array);
3978 while (TREE_CODE (type) == ARRAY_TYPE)
3979 type = TREE_TYPE (type);
3984 /* Construct, lay out and return
3985 the type of functions returning type VALUE_TYPE
3986 given arguments of types ARG_TYPES.
3987 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3988 are data type nodes for the arguments of the function.
3989 If such a type has already been constructed, reuse it. */
3992 build_function_type (value_type, arg_types)
3993 tree value_type, arg_types;
3996 unsigned int hashcode;
3998 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4000 error ("function return type cannot be function");
4001 value_type = integer_type_node;
4004 /* Make a node of the sort we want. */
4005 t = make_node (FUNCTION_TYPE);
4006 TREE_TYPE (t) = value_type;
4007 TYPE_ARG_TYPES (t) = arg_types;
4009 /* If we already have such a type, use the old one and free this one. */
4010 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
4011 t = type_hash_canon (hashcode, t);
4013 if (!COMPLETE_TYPE_P (t))
4018 /* Construct, lay out and return the type of methods belonging to class
4019 BASETYPE and whose arguments and values are described by TYPE.
4020 If that type exists already, reuse it.
4021 TYPE must be a FUNCTION_TYPE node. */
4024 build_method_type (basetype, type)
4025 tree basetype, type;
4028 unsigned int hashcode;
4030 /* Make a node of the sort we want. */
4031 t = make_node (METHOD_TYPE);
4033 if (TREE_CODE (type) != FUNCTION_TYPE)
4036 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4037 TREE_TYPE (t) = TREE_TYPE (type);
4039 /* The actual arglist for this function includes a "hidden" argument
4040 which is "this". Put it into the list of argument types. */
4043 = tree_cons (NULL_TREE,
4044 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
4046 /* If we already have such a type, use the old one and free this one. */
4047 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4048 t = type_hash_canon (hashcode, t);
4050 if (!COMPLETE_TYPE_P (t))
4056 /* Construct, lay out and return the type of offsets to a value
4057 of type TYPE, within an object of type BASETYPE.
4058 If a suitable offset type exists already, reuse it. */
4061 build_offset_type (basetype, type)
4062 tree basetype, type;
4065 unsigned int hashcode;
4067 /* Make a node of the sort we want. */
4068 t = make_node (OFFSET_TYPE);
4070 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4071 TREE_TYPE (t) = type;
4073 /* If we already have such a type, use the old one and free this one. */
4074 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4075 t = type_hash_canon (hashcode, t);
4077 if (!COMPLETE_TYPE_P (t))
4083 /* Create a complex type whose components are COMPONENT_TYPE. */
4086 build_complex_type (component_type)
4087 tree component_type;
4090 unsigned int hashcode;
4092 /* Make a node of the sort we want. */
4093 t = make_node (COMPLEX_TYPE);
4095 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4096 set_type_quals (t, TYPE_QUALS (component_type));
4098 /* If we already have such a type, use the old one and free this one. */
4099 hashcode = TYPE_HASH (component_type);
4100 t = type_hash_canon (hashcode, t);
4102 if (!COMPLETE_TYPE_P (t))
4105 /* If we are writing Dwarf2 output we need to create a name,
4106 since complex is a fundamental type. */
4107 if (write_symbols == DWARF2_DEBUG && ! TYPE_NAME (t))
4110 if (component_type == char_type_node)
4111 name = "complex char";
4112 else if (component_type == signed_char_type_node)
4113 name = "complex signed char";
4114 else if (component_type == unsigned_char_type_node)
4115 name = "complex unsigned char";
4116 else if (component_type == short_integer_type_node)
4117 name = "complex short int";
4118 else if (component_type == short_unsigned_type_node)
4119 name = "complex short unsigned int";
4120 else if (component_type == integer_type_node)
4121 name = "complex int";
4122 else if (component_type == unsigned_type_node)
4123 name = "complex unsigned int";
4124 else if (component_type == long_integer_type_node)
4125 name = "complex long int";
4126 else if (component_type == long_unsigned_type_node)
4127 name = "complex long unsigned int";
4128 else if (component_type == long_long_integer_type_node)
4129 name = "complex long long int";
4130 else if (component_type == long_long_unsigned_type_node)
4131 name = "complex long long unsigned int";
4136 TYPE_NAME (t) = get_identifier (name);
4142 /* Return OP, stripped of any conversions to wider types as much as is safe.
4143 Converting the value back to OP's type makes a value equivalent to OP.
4145 If FOR_TYPE is nonzero, we return a value which, if converted to
4146 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4148 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4149 narrowest type that can hold the value, even if they don't exactly fit.
4150 Otherwise, bit-field references are changed to a narrower type
4151 only if they can be fetched directly from memory in that type.
4153 OP must have integer, real or enumeral type. Pointers are not allowed!
4155 There are some cases where the obvious value we could return
4156 would regenerate to OP if converted to OP's type,
4157 but would not extend like OP to wider types.
4158 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4159 For example, if OP is (unsigned short)(signed char)-1,
4160 we avoid returning (signed char)-1 if FOR_TYPE is int,
4161 even though extending that to an unsigned short would regenerate OP,
4162 since the result of extending (signed char)-1 to (int)
4163 is different from (int) OP. */
4166 get_unwidened (op, for_type)
4170 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4171 register tree type = TREE_TYPE (op);
4172 register unsigned final_prec
4173 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4175 = (for_type != 0 && for_type != type
4176 && final_prec > TYPE_PRECISION (type)
4177 && TREE_UNSIGNED (type));
4178 register tree win = op;
4180 while (TREE_CODE (op) == NOP_EXPR)
4182 register int bitschange
4183 = TYPE_PRECISION (TREE_TYPE (op))
4184 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4186 /* Truncations are many-one so cannot be removed.
4187 Unless we are later going to truncate down even farther. */
4189 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4192 /* See what's inside this conversion. If we decide to strip it,
4194 op = TREE_OPERAND (op, 0);
4196 /* If we have not stripped any zero-extensions (uns is 0),
4197 we can strip any kind of extension.
4198 If we have previously stripped a zero-extension,
4199 only zero-extensions can safely be stripped.
4200 Any extension can be stripped if the bits it would produce
4201 are all going to be discarded later by truncating to FOR_TYPE. */
4205 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4207 /* TREE_UNSIGNED says whether this is a zero-extension.
4208 Let's avoid computing it if it does not affect WIN
4209 and if UNS will not be needed again. */
4210 if ((uns || TREE_CODE (op) == NOP_EXPR)
4211 && TREE_UNSIGNED (TREE_TYPE (op)))
4219 if (TREE_CODE (op) == COMPONENT_REF
4220 /* Since type_for_size always gives an integer type. */
4221 && TREE_CODE (type) != REAL_TYPE
4222 /* Don't crash if field not laid out yet. */
4223 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4224 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4226 unsigned int innerprec
4227 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4229 type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1)));
4231 /* We can get this structure field in the narrowest type it fits in.
4232 If FOR_TYPE is 0, do this only for a field that matches the
4233 narrower type exactly and is aligned for it
4234 The resulting extension to its nominal type (a fullword type)
4235 must fit the same conditions as for other extensions. */
4237 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4238 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4239 && (! uns || final_prec <= innerprec
4240 || TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4243 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4244 TREE_OPERAND (op, 1));
4245 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4246 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4253 /* Return OP or a simpler expression for a narrower value
4254 which can be sign-extended or zero-extended to give back OP.
4255 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4256 or 0 if the value should be sign-extended. */
4259 get_narrower (op, unsignedp_ptr)
4263 register int uns = 0;
4265 register tree win = op;
4267 while (TREE_CODE (op) == NOP_EXPR)
4269 register int bitschange
4270 = (TYPE_PRECISION (TREE_TYPE (op))
4271 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4273 /* Truncations are many-one so cannot be removed. */
4277 /* See what's inside this conversion. If we decide to strip it,
4279 op = TREE_OPERAND (op, 0);
4283 /* An extension: the outermost one can be stripped,
4284 but remember whether it is zero or sign extension. */
4286 uns = TREE_UNSIGNED (TREE_TYPE (op));
4287 /* Otherwise, if a sign extension has been stripped,
4288 only sign extensions can now be stripped;
4289 if a zero extension has been stripped, only zero-extensions. */
4290 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4294 else /* bitschange == 0 */
4296 /* A change in nominal type can always be stripped, but we must
4297 preserve the unsignedness. */
4299 uns = TREE_UNSIGNED (TREE_TYPE (op));
4306 if (TREE_CODE (op) == COMPONENT_REF
4307 /* Since type_for_size always gives an integer type. */
4308 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4309 /* Ensure field is laid out already. */
4310 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4312 unsigned HOST_WIDE_INT innerprec
4313 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4314 tree type = type_for_size (innerprec, TREE_UNSIGNED (op));
4316 /* We can get this structure field in a narrower type that fits it,
4317 but the resulting extension to its nominal type (a fullword type)
4318 must satisfy the same conditions as for other extensions.
4320 Do this only for fields that are aligned (not bit-fields),
4321 because when bit-field insns will be used there is no
4322 advantage in doing this. */
4324 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4325 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4326 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4330 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4331 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4332 TREE_OPERAND (op, 1));
4333 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4334 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4337 *unsignedp_ptr = uns;
4341 /* Nonzero if integer constant C has a value that is permissible
4342 for type TYPE (an INTEGER_TYPE). */
4345 int_fits_type_p (c, type)
4348 /* If the bounds of the type are integers, we can check ourselves.
4349 Otherwise,. use force_fit_type, which checks against the precision. */
4350 if (TYPE_MAX_VALUE (type) != NULL_TREE
4351 && TYPE_MIN_VALUE (type) != NULL_TREE
4352 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4353 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
4355 if (TREE_UNSIGNED (type))
4356 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c)
4357 && ! INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type))
4358 /* Negative ints never fit unsigned types. */
4359 && ! (TREE_INT_CST_HIGH (c) < 0
4360 && ! TREE_UNSIGNED (TREE_TYPE (c))));
4362 return (! INT_CST_LT (TYPE_MAX_VALUE (type), c)
4363 && ! INT_CST_LT (c, TYPE_MIN_VALUE (type))
4364 /* Unsigned ints with top bit set never fit signed types. */
4365 && ! (TREE_INT_CST_HIGH (c) < 0
4366 && TREE_UNSIGNED (TREE_TYPE (c))));
4371 TREE_TYPE (c) = type;
4372 return !force_fit_type (c, 0);
4376 /* Given a DECL or TYPE, return the scope in which it was declared, or
4377 NULL_TREE if there is no containing scope. */
4380 get_containing_scope (t)
4383 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4386 /* Return the innermost context enclosing DECL that is
4387 a FUNCTION_DECL, or zero if none. */
4390 decl_function_context (decl)
4395 if (TREE_CODE (decl) == ERROR_MARK)
4398 if (TREE_CODE (decl) == SAVE_EXPR)
4399 context = SAVE_EXPR_CONTEXT (decl);
4401 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4402 where we look up the function at runtime. Such functions always take
4403 a first argument of type 'pointer to real context'.
4405 C++ should really be fixed to use DECL_CONTEXT for the real context,
4406 and use something else for the "virtual context". */
4407 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4410 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4412 context = DECL_CONTEXT (decl);
4414 while (context && TREE_CODE (context) != FUNCTION_DECL)
4416 if (TREE_CODE (context) == BLOCK)
4417 context = BLOCK_SUPERCONTEXT (context);
4419 context = get_containing_scope (context);
4425 /* Return the innermost context enclosing DECL that is
4426 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4427 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4430 decl_type_context (decl)
4433 tree context = DECL_CONTEXT (decl);
4437 if (TREE_CODE (context) == RECORD_TYPE
4438 || TREE_CODE (context) == UNION_TYPE
4439 || TREE_CODE (context) == QUAL_UNION_TYPE)
4442 if (TREE_CODE (context) == TYPE_DECL
4443 || TREE_CODE (context) == FUNCTION_DECL)
4444 context = DECL_CONTEXT (context);
4446 else if (TREE_CODE (context) == BLOCK)
4447 context = BLOCK_SUPERCONTEXT (context);
4450 /* Unhandled CONTEXT!? */
4456 /* CALL is a CALL_EXPR. Return the declaration for the function
4457 called, or NULL_TREE if the called function cannot be
4461 get_callee_fndecl (call)
4466 /* It's invalid to call this function with anything but a
4468 if (TREE_CODE (call) != CALL_EXPR)
4471 /* The first operand to the CALL is the address of the function
4473 addr = TREE_OPERAND (call, 0);
4477 /* If this is a readonly function pointer, extract its initial value. */
4478 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4479 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4480 && DECL_INITIAL (addr))
4481 addr = DECL_INITIAL (addr);
4483 /* If the address is just `&f' for some function `f', then we know
4484 that `f' is being called. */
4485 if (TREE_CODE (addr) == ADDR_EXPR
4486 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4487 return TREE_OPERAND (addr, 0);
4489 /* We couldn't figure out what was being called. */
4493 /* Print debugging information about the obstack O, named STR. */
4496 print_obstack_statistics (str, o)
4500 struct _obstack_chunk *chunk = o->chunk;
4504 n_alloc += o->next_free - chunk->contents;
4505 chunk = chunk->prev;
4509 n_alloc += chunk->limit - &chunk->contents[0];
4510 chunk = chunk->prev;
4512 fprintf (stderr, "obstack %s: %u bytes, %d chunks\n",
4513 str, n_alloc, n_chunks);
4516 /* Print debugging information about tree nodes generated during the compile,
4517 and any language-specific information. */
4520 dump_tree_statistics ()
4522 #ifdef GATHER_STATISTICS
4524 int total_nodes, total_bytes;
4527 fprintf (stderr, "\n??? tree nodes created\n\n");
4528 #ifdef GATHER_STATISTICS
4529 fprintf (stderr, "Kind Nodes Bytes\n");
4530 fprintf (stderr, "-------------------------------------\n");
4531 total_nodes = total_bytes = 0;
4532 for (i = 0; i < (int) all_kinds; i++)
4534 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4535 tree_node_counts[i], tree_node_sizes[i]);
4536 total_nodes += tree_node_counts[i];
4537 total_bytes += tree_node_sizes[i];
4539 fprintf (stderr, "%-20s %9d\n", "identifier names", id_string_size);
4540 fprintf (stderr, "-------------------------------------\n");
4541 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4542 fprintf (stderr, "-------------------------------------\n");
4544 fprintf (stderr, "(No per-node statistics)\n");
4546 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
4547 print_type_hash_statistics ();
4548 print_lang_statistics ();
4551 #define FILE_FUNCTION_PREFIX_LEN 9
4553 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4555 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4556 clashes in cases where we can't reliably choose a unique name.
4558 Derived from mkstemp.c in libiberty. */
4561 append_random_chars (template)
4564 static const char letters[]
4565 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4566 static unsigned HOST_WIDE_INT value;
4567 unsigned HOST_WIDE_INT v;
4569 #ifdef HAVE_GETTIMEOFDAY
4573 template += strlen (template);
4575 #ifdef HAVE_GETTIMEOFDAY
4576 /* Get some more or less random data. */
4577 gettimeofday (&tv, NULL);
4578 value += ((unsigned HOST_WIDE_INT) tv.tv_usec << 16) ^ tv.tv_sec ^ getpid ();
4585 /* Fill in the random bits. */
4586 template[0] = letters[v % 62];
4588 template[1] = letters[v % 62];
4590 template[2] = letters[v % 62];
4592 template[3] = letters[v % 62];
4594 template[4] = letters[v % 62];
4596 template[5] = letters[v % 62];
4601 /* P is a string that will be used in a symbol. Mask out any characters
4602 that are not valid in that context. */
4605 clean_symbol_name (p)
4610 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4613 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4621 /* Generate a name for a function unique to this translation unit.
4622 TYPE is some string to identify the purpose of this function to the
4623 linker or collect2. */
4626 get_file_function_name_long (type)
4633 if (first_global_object_name)
4634 p = first_global_object_name;
4637 /* We don't have anything that we know to be unique to this translation
4638 unit, so use what we do have and throw in some randomness. */
4640 const char *name = weak_global_object_name;
4641 const char *file = main_input_filename;
4646 file = input_filename;
4648 q = (char *) alloca (7 + strlen (name) + strlen (file));
4650 sprintf (q, "%s%s", name, file);
4651 append_random_chars (q);
4655 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
4658 /* Set up the name of the file-level functions we may need.
4659 Use a global object (which is already required to be unique over
4660 the program) rather than the file name (which imposes extra
4662 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4664 /* Don't need to pull weird characters out of global names. */
4665 if (p != first_global_object_name)
4666 clean_symbol_name (buf + 11);
4668 return get_identifier (buf);
4671 /* If KIND=='I', return a suitable global initializer (constructor) name.
4672 If KIND=='D', return a suitable global clean-up (destructor) name. */
4675 get_file_function_name (kind)
4683 return get_file_function_name_long (p);
4686 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4687 The result is placed in BUFFER (which has length BIT_SIZE),
4688 with one bit in each char ('\000' or '\001').
4690 If the constructor is constant, NULL_TREE is returned.
4691 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4694 get_set_constructor_bits (init, buffer, bit_size)
4701 HOST_WIDE_INT domain_min
4702 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4703 tree non_const_bits = NULL_TREE;
4705 for (i = 0; i < bit_size; i++)
4708 for (vals = TREE_OPERAND (init, 1);
4709 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4711 if (!host_integerp (TREE_VALUE (vals), 0)
4712 || (TREE_PURPOSE (vals) != NULL_TREE
4713 && !host_integerp (TREE_PURPOSE (vals), 0)))
4715 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4716 else if (TREE_PURPOSE (vals) != NULL_TREE)
4718 /* Set a range of bits to ones. */
4719 HOST_WIDE_INT lo_index
4720 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4721 HOST_WIDE_INT hi_index
4722 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4724 if (lo_index < 0 || lo_index >= bit_size
4725 || hi_index < 0 || hi_index >= bit_size)
4727 for (; lo_index <= hi_index; lo_index++)
4728 buffer[lo_index] = 1;
4732 /* Set a single bit to one. */
4734 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4735 if (index < 0 || index >= bit_size)
4737 error ("invalid initializer for bit string");
4743 return non_const_bits;
4746 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4747 The result is placed in BUFFER (which is an array of bytes).
4748 If the constructor is constant, NULL_TREE is returned.
4749 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4752 get_set_constructor_bytes (init, buffer, wd_size)
4754 unsigned char *buffer;
4758 int set_word_size = BITS_PER_UNIT;
4759 int bit_size = wd_size * set_word_size;
4761 unsigned char *bytep = buffer;
4762 char *bit_buffer = (char *) alloca (bit_size);
4763 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4765 for (i = 0; i < wd_size; i++)
4768 for (i = 0; i < bit_size; i++)
4772 if (BYTES_BIG_ENDIAN)
4773 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4775 *bytep |= 1 << bit_pos;
4778 if (bit_pos >= set_word_size)
4779 bit_pos = 0, bytep++;
4781 return non_const_bits;
4784 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4785 /* Complain that the tree code of NODE does not match the expected CODE.
4786 FILE, LINE, and FUNCTION are of the caller. */
4789 tree_check_failed (node, code, file, line, function)
4791 enum tree_code code;
4794 const char *function;
4796 internal_error ("Tree check: expected %s, have %s in %s, at %s:%d",
4797 tree_code_name[code], tree_code_name[TREE_CODE (node)],
4798 function, trim_filename (file), line);
4801 /* Similar to above, except that we check for a class of tree
4802 code, given in CL. */
4805 tree_class_check_failed (node, cl, file, line, function)
4810 const char *function;
4813 ("Tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4814 cl, TREE_CODE_CLASS (TREE_CODE (node)),
4815 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
4818 #endif /* ENABLE_TREE_CHECKING */
4820 /* For a new vector type node T, build the information necessary for
4821 debuggint output. */
4824 finish_vector_type (t)
4830 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
4831 tree array = build_array_type (TREE_TYPE (t),
4832 build_index_type (index));
4833 tree rt = make_node (RECORD_TYPE);
4835 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
4836 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
4838 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
4839 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4840 the representation type, and we want to find that die when looking up
4841 the vector type. This is most easily achieved by making the TYPE_UID
4843 TYPE_UID (rt) = TYPE_UID (t);
4847 /* Create nodes for all integer types (and error_mark_node) using the sizes
4848 of C datatypes. The caller should call set_sizetype soon after calling
4849 this function to select one of the types as sizetype. */
4852 build_common_tree_nodes (signed_char)
4855 error_mark_node = make_node (ERROR_MARK);
4856 TREE_TYPE (error_mark_node) = error_mark_node;
4858 initialize_sizetypes ();
4860 /* Define both `signed char' and `unsigned char'. */
4861 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
4862 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
4864 /* Define `char', which is like either `signed char' or `unsigned char'
4865 but not the same as either. */
4868 ? make_signed_type (CHAR_TYPE_SIZE)
4869 : make_unsigned_type (CHAR_TYPE_SIZE));
4871 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
4872 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
4873 integer_type_node = make_signed_type (INT_TYPE_SIZE);
4874 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
4875 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
4876 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
4877 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
4878 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
4880 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
4881 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
4882 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
4883 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
4884 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
4886 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
4887 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
4888 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
4889 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
4890 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
4893 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4894 It will create several other common tree nodes. */
4897 build_common_tree_nodes_2 (short_double)
4900 /* Define these next since types below may used them. */
4901 integer_zero_node = build_int_2 (0, 0);
4902 integer_one_node = build_int_2 (1, 0);
4903 integer_minus_one_node = build_int_2 (-1, -1);
4905 size_zero_node = size_int (0);
4906 size_one_node = size_int (1);
4907 bitsize_zero_node = bitsize_int (0);
4908 bitsize_one_node = bitsize_int (1);
4909 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
4911 void_type_node = make_node (VOID_TYPE);
4912 layout_type (void_type_node);
4914 /* We are not going to have real types in C with less than byte alignment,
4915 so we might as well not have any types that claim to have it. */
4916 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
4917 TYPE_USER_ALIGN (void_type_node) = 0;
4919 null_pointer_node = build_int_2 (0, 0);
4920 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
4921 layout_type (TREE_TYPE (null_pointer_node));
4923 ptr_type_node = build_pointer_type (void_type_node);
4925 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
4927 float_type_node = make_node (REAL_TYPE);
4928 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
4929 layout_type (float_type_node);
4931 double_type_node = make_node (REAL_TYPE);
4933 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
4935 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
4936 layout_type (double_type_node);
4938 long_double_type_node = make_node (REAL_TYPE);
4939 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
4940 layout_type (long_double_type_node);
4942 complex_integer_type_node = make_node (COMPLEX_TYPE);
4943 TREE_TYPE (complex_integer_type_node) = integer_type_node;
4944 layout_type (complex_integer_type_node);
4946 complex_float_type_node = make_node (COMPLEX_TYPE);
4947 TREE_TYPE (complex_float_type_node) = float_type_node;
4948 layout_type (complex_float_type_node);
4950 complex_double_type_node = make_node (COMPLEX_TYPE);
4951 TREE_TYPE (complex_double_type_node) = double_type_node;
4952 layout_type (complex_double_type_node);
4954 complex_long_double_type_node = make_node (COMPLEX_TYPE);
4955 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
4956 layout_type (complex_long_double_type_node);
4960 BUILD_VA_LIST_TYPE (t);
4962 /* Many back-ends define record types without seting TYPE_NAME.
4963 If we copied the record type here, we'd keep the original
4964 record type without a name. This breaks name mangling. So,
4965 don't copy record types and let c_common_nodes_and_builtins()
4966 declare the type to be __builtin_va_list. */
4967 if (TREE_CODE (t) != RECORD_TYPE)
4968 t = build_type_copy (t);
4970 va_list_type_node = t;
4973 V4SF_type_node = make_node (VECTOR_TYPE);
4974 TREE_TYPE (V4SF_type_node) = float_type_node;
4975 TYPE_MODE (V4SF_type_node) = V4SFmode;
4976 finish_vector_type (V4SF_type_node);
4978 V4SI_type_node = make_node (VECTOR_TYPE);
4979 TREE_TYPE (V4SI_type_node) = intSI_type_node;
4980 TYPE_MODE (V4SI_type_node) = V4SImode;
4981 finish_vector_type (V4SI_type_node);
4983 V2SI_type_node = make_node (VECTOR_TYPE);
4984 TREE_TYPE (V2SI_type_node) = intSI_type_node;
4985 TYPE_MODE (V2SI_type_node) = V2SImode;
4986 finish_vector_type (V2SI_type_node);
4988 V4HI_type_node = make_node (VECTOR_TYPE);
4989 TREE_TYPE (V4HI_type_node) = intHI_type_node;
4990 TYPE_MODE (V4HI_type_node) = V4HImode;
4991 finish_vector_type (V4HI_type_node);
4993 V8QI_type_node = make_node (VECTOR_TYPE);
4994 TREE_TYPE (V8QI_type_node) = intQI_type_node;
4995 TYPE_MODE (V8QI_type_node) = V8QImode;
4996 finish_vector_type (V8QI_type_node);