1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c.
32 The low-level allocation routines oballoc and permalloc
33 are used also for allocating many other kinds of objects
34 by all passes of the compiler. */
48 #include "langhooks.h"
50 #define obstack_chunk_alloc xmalloc
51 #define obstack_chunk_free free
52 /* obstack.[ch] explicitly declined to prototype this. */
53 extern int _obstack_allocated_p PARAMS ((struct obstack *h, PTR obj));
55 static void unsave_expr_now_r PARAMS ((tree));
57 /* Objects allocated on this obstack last forever. */
59 struct obstack permanent_obstack;
61 /* Table indexed by tree code giving a string containing a character
62 classifying the tree code. Possibilities are
63 t, d, s, c, r, <, 1, 2 and e. See tree.def for details. */
65 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
67 char tree_code_type[MAX_TREE_CODES] = {
72 /* Table indexed by tree code giving number of expression
73 operands beyond the fixed part of the node structure.
74 Not used for types or decls. */
76 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
78 int tree_code_length[MAX_TREE_CODES] = {
83 /* Names of tree components.
84 Used for printing out the tree and error messages. */
85 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
87 const char *tree_code_name[MAX_TREE_CODES] = {
92 /* Statistics-gathering stuff. */
112 int tree_node_counts[(int) all_kinds];
113 int tree_node_sizes[(int) all_kinds];
115 static const char * const tree_node_kind_names[] = {
132 /* Unique id for next decl created. */
133 static int next_decl_uid;
134 /* Unique id for next type created. */
135 static int next_type_uid = 1;
137 /* Since we cannot rehash a type after it is in the table, we have to
138 keep the hash code. */
146 /* Initial size of the hash table (rounded to next prime). */
147 #define TYPE_HASH_INITIAL_SIZE 1000
149 /* Now here is the hash table. When recording a type, it is added to
150 the slot whose index is the hash code. Note that the hash table is
151 used for several kinds of types (function types, array types and
152 array index range types, for now). While all these live in the
153 same table, they are completely independent, and the hash code is
154 computed differently for each of these. */
156 htab_t type_hash_table;
158 static void build_real_from_int_cst_1 PARAMS ((PTR));
159 static void set_type_quals PARAMS ((tree, int));
160 static void append_random_chars PARAMS ((char *));
161 static int type_hash_eq PARAMS ((const void*, const void*));
162 static unsigned int type_hash_hash PARAMS ((const void*));
163 static void print_type_hash_statistics PARAMS((void));
164 static void finish_vector_type PARAMS((tree));
165 static tree make_vector PARAMS ((enum machine_mode, tree, int));
166 static int type_hash_marked_p PARAMS ((const void *));
167 static void type_hash_mark PARAMS ((const void *));
168 static int mark_tree_hashtable_entry PARAMS((void **, void *));
170 /* If non-null, these are language-specific helper functions for
171 unsave_expr_now. If present, LANG_UNSAVE is called before its
172 argument (an UNSAVE_EXPR) is to be unsaved, and all other
173 processing in unsave_expr_now is aborted. LANG_UNSAVE_EXPR_NOW is
174 called from unsave_expr_1 for language-specific tree codes. */
175 void (*lang_unsave) PARAMS ((tree *));
176 void (*lang_unsave_expr_now) PARAMS ((tree));
178 /* If non-null, these are language-specific helper functions for
179 unsafe_for_reeval. Return negative to not handle some tree. */
180 int (*lang_unsafe_for_reeval) PARAMS ((tree));
182 /* Set the DECL_ASSEMBLER_NAME for a node. If it is the sort of thing
183 that the assembler should talk about, set DECL_ASSEMBLER_NAME to an
184 appropriate IDENTIFIER_NODE. Otherwise, set it to the
185 ERROR_MARK_NODE to ensure that the assembler does not talk about
187 void (*lang_set_decl_assembler_name) PARAMS ((tree));
189 tree global_trees[TI_MAX];
190 tree integer_types[itk_none];
192 /* Set the DECL_ASSEMBLER_NAME for DECL. */
194 set_decl_assembler_name (decl)
197 /* The language-independent code should never use the
198 DECL_ASSEMBLER_NAME for lots of DECLs. Only FUNCTION_DECLs and
199 VAR_DECLs for variables with static storage duration need a real
200 DECL_ASSEMBLER_NAME. */
201 if (TREE_CODE (decl) == FUNCTION_DECL
202 || (TREE_CODE (decl) == VAR_DECL
203 && (TREE_STATIC (decl)
204 || DECL_EXTERNAL (decl)
205 || TREE_PUBLIC (decl))))
206 /* By default, assume the name to use in assembly code is the
207 same as that used in the source language. (That's correct
208 for C, and GCC used to set DECL_ASSEMBLER_NAME to the same
209 value as DECL_NAME in build_decl, so this choice provides
210 backwards compatibility with existing front-ends. */
211 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
213 /* Nobody should ever be asking for the DECL_ASSEMBLER_NAME of
214 these DECLs -- unless they're in language-dependent code, in
215 which case lang_set_decl_assembler_name should handle things. */
219 /* Init the principal obstacks. */
224 gcc_obstack_init (&permanent_obstack);
226 /* Initialize the hash table of types. */
227 type_hash_table = htab_create (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
229 ggc_add_deletable_htab (type_hash_table, type_hash_marked_p,
231 ggc_add_tree_root (global_trees, TI_MAX);
232 ggc_add_tree_root (integer_types, itk_none);
234 /* Set lang_set_decl_set_assembler_name to a default value. */
235 lang_set_decl_assembler_name = set_decl_assembler_name;
239 /* Allocate SIZE bytes in the permanent obstack
240 and return a pointer to them. */
246 return (char *) obstack_alloc (&permanent_obstack, size);
249 /* Allocate NELEM items of SIZE bytes in the permanent obstack
250 and return a pointer to them. The storage is cleared before
251 returning the value. */
254 perm_calloc (nelem, size)
258 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
259 memset (rval, 0, nelem * size);
263 /* Compute the number of bytes occupied by 'node'. This routine only
264 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
269 enum tree_code code = TREE_CODE (node);
271 switch (TREE_CODE_CLASS (code))
273 case 'd': /* A decl node */
274 return sizeof (struct tree_decl);
276 case 't': /* a type node */
277 return sizeof (struct tree_type);
279 case 'b': /* a lexical block node */
280 return sizeof (struct tree_block);
282 case 'r': /* a reference */
283 case 'e': /* an expression */
284 case 's': /* an expression with side effects */
285 case '<': /* a comparison expression */
286 case '1': /* a unary arithmetic expression */
287 case '2': /* a binary arithmetic expression */
288 return (sizeof (struct tree_exp)
289 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
291 case 'c': /* a constant */
292 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
293 words is machine-dependent due to varying length of HOST_WIDE_INT,
294 which might be wider than a pointer (e.g., long long). Similarly
295 for REAL_CST, since the number of words is machine-dependent due
296 to varying size and alignment of `double'. */
297 if (code == INTEGER_CST)
298 return sizeof (struct tree_int_cst);
299 else if (code == REAL_CST)
300 return sizeof (struct tree_real_cst);
302 return (sizeof (struct tree_common)
303 + TREE_CODE_LENGTH (code) * sizeof (char *));
305 case 'x': /* something random, like an identifier. */
308 length = (sizeof (struct tree_common)
309 + TREE_CODE_LENGTH (code) * sizeof (char *));
310 if (code == TREE_VEC)
311 length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
320 /* Return a newly allocated node of code CODE.
321 For decl and type nodes, some other fields are initialized.
322 The rest of the node is initialized to zero.
324 Achoo! I got a code in the node. */
331 int type = TREE_CODE_CLASS (code);
333 #ifdef GATHER_STATISTICS
336 struct tree_common ttmp;
338 /* We can't allocate a TREE_VEC without knowing how many elements
340 if (code == TREE_VEC)
343 TREE_SET_CODE ((tree)&ttmp, code);
344 length = tree_size ((tree)&ttmp);
346 #ifdef GATHER_STATISTICS
349 case 'd': /* A decl node */
353 case 't': /* a type node */
357 case 'b': /* a lexical block */
361 case 's': /* an expression with side effects */
365 case 'r': /* a reference */
369 case 'e': /* an expression */
370 case '<': /* a comparison expression */
371 case '1': /* a unary arithmetic expression */
372 case '2': /* a binary arithmetic expression */
376 case 'c': /* a constant */
380 case 'x': /* something random, like an identifier. */
381 if (code == IDENTIFIER_NODE)
383 else if (code == TREE_VEC)
393 tree_node_counts[(int) kind]++;
394 tree_node_sizes[(int) kind] += length;
397 t = ggc_alloc_tree (length);
399 memset ((PTR) t, 0, length);
401 TREE_SET_CODE (t, code);
406 TREE_SIDE_EFFECTS (t) = 1;
407 TREE_TYPE (t) = void_type_node;
411 if (code != FUNCTION_DECL)
413 DECL_USER_ALIGN (t) = 0;
414 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
415 DECL_SOURCE_LINE (t) = lineno;
416 DECL_SOURCE_FILE (t) =
417 (input_filename) ? input_filename : "<built-in>";
418 DECL_UID (t) = next_decl_uid++;
420 /* We have not yet computed the alias set for this declaration. */
421 DECL_POINTER_ALIAS_SET (t) = -1;
425 TYPE_UID (t) = next_type_uid++;
426 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
427 TYPE_USER_ALIGN (t) = 0;
428 TYPE_MAIN_VARIANT (t) = t;
430 /* Default to no attributes for type, but let target change that. */
431 TYPE_ATTRIBUTES (t) = NULL_TREE;
432 (*targetm.set_default_type_attributes) (t);
434 /* We have not yet computed the alias set for this type. */
435 TYPE_ALIAS_SET (t) = -1;
439 TREE_CONSTANT (t) = 1;
449 case PREDECREMENT_EXPR:
450 case PREINCREMENT_EXPR:
451 case POSTDECREMENT_EXPR:
452 case POSTINCREMENT_EXPR:
453 /* All of these have side-effects, no matter what their
455 TREE_SIDE_EFFECTS (t) = 1;
467 /* A front-end can reset this to an appropriate function if types need
470 tree (*make_lang_type_fn) PARAMS ((enum tree_code)) = make_node;
472 /* Return a new type (with the indicated CODE), doing whatever
473 language-specific processing is required. */
476 make_lang_type (code)
479 return (*make_lang_type_fn) (code);
482 /* Return a new node with the same contents as NODE except that its
483 TREE_CHAIN is zero and it has a fresh uid. */
490 enum tree_code code = TREE_CODE (node);
493 length = tree_size (node);
494 t = ggc_alloc_tree (length);
495 memcpy (t, node, length);
498 TREE_ASM_WRITTEN (t) = 0;
500 if (TREE_CODE_CLASS (code) == 'd')
501 DECL_UID (t) = next_decl_uid++;
502 else if (TREE_CODE_CLASS (code) == 't')
504 TYPE_UID (t) = next_type_uid++;
505 /* The following is so that the debug code for
506 the copy is different from the original type.
507 The two statements usually duplicate each other
508 (because they clear fields of the same union),
509 but the optimizer should catch that. */
510 TYPE_SYMTAB_POINTER (t) = 0;
511 TYPE_SYMTAB_ADDRESS (t) = 0;
517 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
518 For example, this can copy a list made of TREE_LIST nodes. */
530 head = prev = copy_node (list);
531 next = TREE_CHAIN (list);
534 TREE_CHAIN (prev) = copy_node (next);
535 prev = TREE_CHAIN (prev);
536 next = TREE_CHAIN (next);
542 /* Return a newly constructed INTEGER_CST node whose constant value
543 is specified by the two ints LOW and HI.
544 The TREE_TYPE is set to `int'.
546 This function should be used via the `build_int_2' macro. */
549 build_int_2_wide (low, hi)
550 unsigned HOST_WIDE_INT low;
553 tree t = make_node (INTEGER_CST);
555 TREE_INT_CST_LOW (t) = low;
556 TREE_INT_CST_HIGH (t) = hi;
557 TREE_TYPE (t) = integer_type_node;
561 /* Return a new REAL_CST node whose type is TYPE and value is D. */
571 /* Check for valid float value for this type on this target machine;
572 if not, can print error message and store a valid value in D. */
573 #ifdef CHECK_FLOAT_VALUE
574 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
577 v = make_node (REAL_CST);
578 TREE_TYPE (v) = type;
579 TREE_REAL_CST (v) = d;
580 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
584 /* Return a new REAL_CST node whose type is TYPE
585 and whose value is the integer value of the INTEGER_CST node I. */
587 #if !defined (REAL_IS_NOT_DOUBLE) || defined (REAL_ARITHMETIC)
590 real_value_from_int_cst (type, i)
591 tree type ATTRIBUTE_UNUSED, i;
595 #ifdef REAL_ARITHMETIC
596 /* Clear all bits of the real value type so that we can later do
597 bitwise comparisons to see if two values are the same. */
598 memset ((char *) &d, 0, sizeof d);
600 if (! TREE_UNSIGNED (TREE_TYPE (i)))
601 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
604 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
605 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
606 #else /* not REAL_ARITHMETIC */
607 /* Some 386 compilers mishandle unsigned int to float conversions,
608 so introduce a temporary variable E to avoid those bugs. */
609 if (TREE_INT_CST_HIGH (i) < 0 && ! TREE_UNSIGNED (TREE_TYPE (i)))
613 d = (double) (~TREE_INT_CST_HIGH (i));
614 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
615 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
617 e = (double) (~TREE_INT_CST_LOW (i));
625 d = (double) (unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (i);
626 e = ((double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2))
627 * (double) ((HOST_WIDE_INT) 1 << (HOST_BITS_PER_WIDE_INT / 2)));
629 e = (double) TREE_INT_CST_LOW (i);
632 #endif /* not REAL_ARITHMETIC */
636 /* Args to pass to and from build_real_from_int_cst_1. */
640 tree type; /* Input: type to conver to. */
641 tree i; /* Input: operand to convert. */
642 REAL_VALUE_TYPE d; /* Output: floating point value. */
645 /* Convert an integer to a floating point value while protected by a floating
646 point exception handler. */
649 build_real_from_int_cst_1 (data)
652 struct brfic_args *args = (struct brfic_args *) data;
654 #ifdef REAL_ARITHMETIC
655 args->d = real_value_from_int_cst (args->type, args->i);
658 = REAL_VALUE_TRUNCATE (TYPE_MODE (args->type),
659 real_value_from_int_cst (args->type, args->i));
663 /* Given a tree representing an integer constant I, return a tree
664 representing the same value as a floating-point constant of type TYPE.
665 We cannot perform this operation if there is no way of doing arithmetic
666 on floating-point values. */
669 build_real_from_int_cst (type, i)
674 int overflow = TREE_OVERFLOW (i);
676 struct brfic_args args;
678 v = make_node (REAL_CST);
679 TREE_TYPE (v) = type;
681 /* Setup input for build_real_from_int_cst_1() */
685 if (do_float_handler (build_real_from_int_cst_1, (PTR) &args))
686 /* Receive output from build_real_from_int_cst_1() */
690 /* We got an exception from build_real_from_int_cst_1() */
695 /* Check for valid float value for this type on this target machine. */
697 #ifdef CHECK_FLOAT_VALUE
698 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
701 TREE_REAL_CST (v) = d;
702 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
706 #endif /* not REAL_IS_NOT_DOUBLE, or REAL_ARITHMETIC */
708 /* Return a newly constructed STRING_CST node whose value is
709 the LEN characters at STR.
710 The TREE_TYPE is not initialized. */
713 build_string (len, str)
717 tree s = make_node (STRING_CST);
719 TREE_STRING_LENGTH (s) = len;
720 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
725 /* Return a newly constructed COMPLEX_CST node whose value is
726 specified by the real and imaginary parts REAL and IMAG.
727 Both REAL and IMAG should be constant nodes. TYPE, if specified,
728 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
731 build_complex (type, real, imag)
735 tree t = make_node (COMPLEX_CST);
737 TREE_REALPART (t) = real;
738 TREE_IMAGPART (t) = imag;
739 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
740 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
741 TREE_CONSTANT_OVERFLOW (t)
742 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
746 /* Build a newly constructed TREE_VEC node of length LEN. */
753 int length = (len-1) * sizeof (tree) + sizeof (struct tree_vec);
755 #ifdef GATHER_STATISTICS
756 tree_node_counts[(int)vec_kind]++;
757 tree_node_sizes[(int)vec_kind] += length;
760 t = ggc_alloc_tree (length);
762 memset ((PTR) t, 0, length);
763 TREE_SET_CODE (t, TREE_VEC);
764 TREE_VEC_LENGTH (t) = len;
769 /* Return 1 if EXPR is the integer constant zero or a complex constant
778 return ((TREE_CODE (expr) == INTEGER_CST
779 && ! TREE_CONSTANT_OVERFLOW (expr)
780 && TREE_INT_CST_LOW (expr) == 0
781 && TREE_INT_CST_HIGH (expr) == 0)
782 || (TREE_CODE (expr) == COMPLEX_CST
783 && integer_zerop (TREE_REALPART (expr))
784 && integer_zerop (TREE_IMAGPART (expr))));
787 /* Return 1 if EXPR is the integer constant one or the corresponding
796 return ((TREE_CODE (expr) == INTEGER_CST
797 && ! TREE_CONSTANT_OVERFLOW (expr)
798 && TREE_INT_CST_LOW (expr) == 1
799 && TREE_INT_CST_HIGH (expr) == 0)
800 || (TREE_CODE (expr) == COMPLEX_CST
801 && integer_onep (TREE_REALPART (expr))
802 && integer_zerop (TREE_IMAGPART (expr))));
805 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
806 it contains. Likewise for the corresponding complex constant. */
809 integer_all_onesp (expr)
817 if (TREE_CODE (expr) == COMPLEX_CST
818 && integer_all_onesp (TREE_REALPART (expr))
819 && integer_zerop (TREE_IMAGPART (expr)))
822 else if (TREE_CODE (expr) != INTEGER_CST
823 || TREE_CONSTANT_OVERFLOW (expr))
826 uns = TREE_UNSIGNED (TREE_TYPE (expr));
828 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
829 && TREE_INT_CST_HIGH (expr) == -1);
831 /* Note that using TYPE_PRECISION here is wrong. We care about the
832 actual bits, not the (arbitrary) range of the type. */
833 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
834 if (prec >= HOST_BITS_PER_WIDE_INT)
836 HOST_WIDE_INT high_value;
839 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
841 if (shift_amount > HOST_BITS_PER_WIDE_INT)
842 /* Can not handle precisions greater than twice the host int size. */
844 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
845 /* Shifting by the host word size is undefined according to the ANSI
846 standard, so we must handle this as a special case. */
849 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
851 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
852 && TREE_INT_CST_HIGH (expr) == high_value);
855 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
858 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
866 HOST_WIDE_INT high, low;
870 if (TREE_CODE (expr) == COMPLEX_CST
871 && integer_pow2p (TREE_REALPART (expr))
872 && integer_zerop (TREE_IMAGPART (expr)))
875 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
878 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
879 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
880 high = TREE_INT_CST_HIGH (expr);
881 low = TREE_INT_CST_LOW (expr);
883 /* First clear all bits that are beyond the type's precision in case
884 we've been sign extended. */
886 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
888 else if (prec > HOST_BITS_PER_WIDE_INT)
889 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
893 if (prec < HOST_BITS_PER_WIDE_INT)
894 low &= ~((HOST_WIDE_INT) (-1) << prec);
897 if (high == 0 && low == 0)
900 return ((high == 0 && (low & (low - 1)) == 0)
901 || (low == 0 && (high & (high - 1)) == 0));
904 /* Return the power of two represented by a tree node known to be a
912 HOST_WIDE_INT high, low;
916 if (TREE_CODE (expr) == COMPLEX_CST)
917 return tree_log2 (TREE_REALPART (expr));
919 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
920 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
922 high = TREE_INT_CST_HIGH (expr);
923 low = TREE_INT_CST_LOW (expr);
925 /* First clear all bits that are beyond the type's precision in case
926 we've been sign extended. */
928 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
930 else if (prec > HOST_BITS_PER_WIDE_INT)
931 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
935 if (prec < HOST_BITS_PER_WIDE_INT)
936 low &= ~((HOST_WIDE_INT) (-1) << prec);
939 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
943 /* Similar, but return the largest integer Y such that 2 ** Y is less
944 than or equal to EXPR. */
947 tree_floor_log2 (expr)
951 HOST_WIDE_INT high, low;
955 if (TREE_CODE (expr) == COMPLEX_CST)
956 return tree_log2 (TREE_REALPART (expr));
958 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
959 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
961 high = TREE_INT_CST_HIGH (expr);
962 low = TREE_INT_CST_LOW (expr);
964 /* First clear all bits that are beyond the type's precision in case
965 we've been sign extended. Ignore if type's precision hasn't been set
966 since what we are doing is setting it. */
968 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
970 else if (prec > HOST_BITS_PER_WIDE_INT)
971 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
975 if (prec < HOST_BITS_PER_WIDE_INT)
976 low &= ~((HOST_WIDE_INT) (-1) << prec);
979 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
983 /* Return 1 if EXPR is the real constant zero. */
991 return ((TREE_CODE (expr) == REAL_CST
992 && ! TREE_CONSTANT_OVERFLOW (expr)
993 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
994 || (TREE_CODE (expr) == COMPLEX_CST
995 && real_zerop (TREE_REALPART (expr))
996 && real_zerop (TREE_IMAGPART (expr))));
999 /* Return 1 if EXPR is the real constant one in real or complex form. */
1007 return ((TREE_CODE (expr) == REAL_CST
1008 && ! TREE_CONSTANT_OVERFLOW (expr)
1009 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1010 || (TREE_CODE (expr) == COMPLEX_CST
1011 && real_onep (TREE_REALPART (expr))
1012 && real_zerop (TREE_IMAGPART (expr))));
1015 /* Return 1 if EXPR is the real constant two. */
1023 return ((TREE_CODE (expr) == REAL_CST
1024 && ! TREE_CONSTANT_OVERFLOW (expr)
1025 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1026 || (TREE_CODE (expr) == COMPLEX_CST
1027 && real_twop (TREE_REALPART (expr))
1028 && real_zerop (TREE_IMAGPART (expr))));
1031 /* Nonzero if EXP is a constant or a cast of a constant. */
1034 really_constant_p (exp)
1037 /* This is not quite the same as STRIP_NOPS. It does more. */
1038 while (TREE_CODE (exp) == NOP_EXPR
1039 || TREE_CODE (exp) == CONVERT_EXPR
1040 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1041 exp = TREE_OPERAND (exp, 0);
1042 return TREE_CONSTANT (exp);
1045 /* Return first list element whose TREE_VALUE is ELEM.
1046 Return 0 if ELEM is not in LIST. */
1049 value_member (elem, list)
1054 if (elem == TREE_VALUE (list))
1056 list = TREE_CHAIN (list);
1061 /* Return first list element whose TREE_PURPOSE is ELEM.
1062 Return 0 if ELEM is not in LIST. */
1065 purpose_member (elem, list)
1070 if (elem == TREE_PURPOSE (list))
1072 list = TREE_CHAIN (list);
1077 /* Return first list element whose BINFO_TYPE is ELEM.
1078 Return 0 if ELEM is not in LIST. */
1081 binfo_member (elem, list)
1086 if (elem == BINFO_TYPE (list))
1088 list = TREE_CHAIN (list);
1093 /* Return nonzero if ELEM is part of the chain CHAIN. */
1096 chain_member (elem, chain)
1103 chain = TREE_CHAIN (chain);
1109 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
1110 chain CHAIN. This and the next function are currently unused, but
1111 are retained for completeness. */
1114 chain_member_value (elem, chain)
1119 if (elem == TREE_VALUE (chain))
1121 chain = TREE_CHAIN (chain);
1127 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1128 for any piece of chain CHAIN. */
1131 chain_member_purpose (elem, chain)
1136 if (elem == TREE_PURPOSE (chain))
1138 chain = TREE_CHAIN (chain);
1144 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1145 We expect a null pointer to mark the end of the chain.
1146 This is the Lisp primitive `length'. */
1155 for (tail = t; tail; tail = TREE_CHAIN (tail))
1161 /* Returns the number of FIELD_DECLs in TYPE. */
1164 fields_length (type)
1167 tree t = TYPE_FIELDS (type);
1170 for (; t; t = TREE_CHAIN (t))
1171 if (TREE_CODE (t) == FIELD_DECL)
1177 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1178 by modifying the last node in chain 1 to point to chain 2.
1179 This is the Lisp primitive `nconc'. */
1189 #ifdef ENABLE_TREE_CHECKING
1193 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1195 TREE_CHAIN (t1) = op2;
1196 #ifdef ENABLE_TREE_CHECKING
1197 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1199 abort (); /* Circularity created. */
1207 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1215 while ((next = TREE_CHAIN (chain)))
1220 /* Reverse the order of elements in the chain T,
1221 and return the new head of the chain (old last element). */
1227 tree prev = 0, decl, next;
1228 for (decl = t; decl; decl = next)
1230 next = TREE_CHAIN (decl);
1231 TREE_CHAIN (decl) = prev;
1237 /* Given a chain CHAIN of tree nodes,
1238 construct and return a list of those nodes. */
1244 tree result = NULL_TREE;
1245 tree in_tail = chain;
1246 tree out_tail = NULL_TREE;
1250 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
1252 TREE_CHAIN (out_tail) = next;
1256 in_tail = TREE_CHAIN (in_tail);
1262 /* Return a newly created TREE_LIST node whose
1263 purpose and value fields are PARM and VALUE. */
1266 build_tree_list (parm, value)
1269 tree t = make_node (TREE_LIST);
1270 TREE_PURPOSE (t) = parm;
1271 TREE_VALUE (t) = value;
1275 /* Return a newly created TREE_LIST node whose
1276 purpose and value fields are PARM and VALUE
1277 and whose TREE_CHAIN is CHAIN. */
1280 tree_cons (purpose, value, chain)
1281 tree purpose, value, chain;
1285 node = ggc_alloc_tree (sizeof (struct tree_list));
1287 memset (node, 0, sizeof (struct tree_common));
1289 #ifdef GATHER_STATISTICS
1290 tree_node_counts[(int) x_kind]++;
1291 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1294 TREE_SET_CODE (node, TREE_LIST);
1295 TREE_CHAIN (node) = chain;
1296 TREE_PURPOSE (node) = purpose;
1297 TREE_VALUE (node) = value;
1302 /* Return the size nominally occupied by an object of type TYPE
1303 when it resides in memory. The value is measured in units of bytes,
1304 and its data type is that normally used for type sizes
1305 (which is the first type created by make_signed_type or
1306 make_unsigned_type). */
1309 size_in_bytes (type)
1314 if (type == error_mark_node)
1315 return integer_zero_node;
1317 type = TYPE_MAIN_VARIANT (type);
1318 t = TYPE_SIZE_UNIT (type);
1322 incomplete_type_error (NULL_TREE, type);
1323 return size_zero_node;
1326 if (TREE_CODE (t) == INTEGER_CST)
1327 force_fit_type (t, 0);
1332 /* Return the size of TYPE (in bytes) as a wide integer
1333 or return -1 if the size can vary or is larger than an integer. */
1336 int_size_in_bytes (type)
1341 if (type == error_mark_node)
1344 type = TYPE_MAIN_VARIANT (type);
1345 t = TYPE_SIZE_UNIT (type);
1347 || TREE_CODE (t) != INTEGER_CST
1348 || TREE_OVERFLOW (t)
1349 || TREE_INT_CST_HIGH (t) != 0
1350 /* If the result would appear negative, it's too big to represent. */
1351 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1354 return TREE_INT_CST_LOW (t);
1357 /* Return the bit position of FIELD, in bits from the start of the record.
1358 This is a tree of type bitsizetype. */
1361 bit_position (field)
1365 return bit_from_pos (DECL_FIELD_OFFSET (field),
1366 DECL_FIELD_BIT_OFFSET (field));
1369 /* Likewise, but return as an integer. Abort if it cannot be represented
1370 in that way (since it could be a signed value, we don't have the option
1371 of returning -1 like int_size_in_byte can. */
1374 int_bit_position (field)
1377 return tree_low_cst (bit_position (field), 0);
1380 /* Return the byte position of FIELD, in bytes from the start of the record.
1381 This is a tree of type sizetype. */
1384 byte_position (field)
1387 return byte_from_pos (DECL_FIELD_OFFSET (field),
1388 DECL_FIELD_BIT_OFFSET (field));
1391 /* Likewise, but return as an integer. Abort if it cannot be represented
1392 in that way (since it could be a signed value, we don't have the option
1393 of returning -1 like int_size_in_byte can. */
1396 int_byte_position (field)
1399 return tree_low_cst (byte_position (field), 0);
1402 /* Return the strictest alignment, in bits, that T is known to have. */
1408 unsigned int align0, align1;
1410 switch (TREE_CODE (t))
1412 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1413 /* If we have conversions, we know that the alignment of the
1414 object must meet each of the alignments of the types. */
1415 align0 = expr_align (TREE_OPERAND (t, 0));
1416 align1 = TYPE_ALIGN (TREE_TYPE (t));
1417 return MAX (align0, align1);
1419 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1420 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1421 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1422 /* These don't change the alignment of an object. */
1423 return expr_align (TREE_OPERAND (t, 0));
1426 /* The best we can do is say that the alignment is the least aligned
1428 align0 = expr_align (TREE_OPERAND (t, 1));
1429 align1 = expr_align (TREE_OPERAND (t, 2));
1430 return MIN (align0, align1);
1432 case LABEL_DECL: case CONST_DECL:
1433 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1434 if (DECL_ALIGN (t) != 0)
1435 return DECL_ALIGN (t);
1439 return FUNCTION_BOUNDARY;
1445 /* Otherwise take the alignment from that of the type. */
1446 return TYPE_ALIGN (TREE_TYPE (t));
1449 /* Return, as a tree node, the number of elements for TYPE (which is an
1450 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1453 array_type_nelts (type)
1456 tree index_type, min, max;
1458 /* If they did it with unspecified bounds, then we should have already
1459 given an error about it before we got here. */
1460 if (! TYPE_DOMAIN (type))
1461 return error_mark_node;
1463 index_type = TYPE_DOMAIN (type);
1464 min = TYPE_MIN_VALUE (index_type);
1465 max = TYPE_MAX_VALUE (index_type);
1467 return (integer_zerop (min)
1469 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1472 /* Return nonzero if arg is static -- a reference to an object in
1473 static storage. This is not the same as the C meaning of `static'. */
1479 switch (TREE_CODE (arg))
1482 /* Nested functions aren't static, since taking their address
1483 involves a trampoline. */
1484 return (decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1485 && ! DECL_NON_ADDR_CONST_P (arg);
1488 return (TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1489 && ! DECL_NON_ADDR_CONST_P (arg);
1492 return TREE_STATIC (arg);
1498 /* If we are referencing a bitfield, we can't evaluate an
1499 ADDR_EXPR at compile time and so it isn't a constant. */
1501 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1502 && staticp (TREE_OPERAND (arg, 0)));
1508 /* This case is technically correct, but results in setting
1509 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1512 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1516 case ARRAY_RANGE_REF:
1517 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1518 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1519 return staticp (TREE_OPERAND (arg, 0));
1522 if ((unsigned int) TREE_CODE (arg)
1523 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1524 return (*lang_hooks.staticp) (arg);
1530 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1531 Do this to any expression which may be used in more than one place,
1532 but must be evaluated only once.
1534 Normally, expand_expr would reevaluate the expression each time.
1535 Calling save_expr produces something that is evaluated and recorded
1536 the first time expand_expr is called on it. Subsequent calls to
1537 expand_expr just reuse the recorded value.
1539 The call to expand_expr that generates code that actually computes
1540 the value is the first call *at compile time*. Subsequent calls
1541 *at compile time* generate code to use the saved value.
1542 This produces correct result provided that *at run time* control
1543 always flows through the insns made by the first expand_expr
1544 before reaching the other places where the save_expr was evaluated.
1545 You, the caller of save_expr, must make sure this is so.
1547 Constants, and certain read-only nodes, are returned with no
1548 SAVE_EXPR because that is safe. Expressions containing placeholders
1549 are not touched; see tree.def for an explanation of what these
1556 tree t = fold (expr);
1559 /* We don't care about whether this can be used as an lvalue in this
1561 while (TREE_CODE (t) == NON_LVALUE_EXPR)
1562 t = TREE_OPERAND (t, 0);
1564 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1565 a constant, it will be more efficient to not make another SAVE_EXPR since
1566 it will allow better simplification and GCSE will be able to merge the
1567 computations if they actualy occur. */
1569 (TREE_CODE_CLASS (TREE_CODE (inner)) == '1'
1570 || (TREE_CODE_CLASS (TREE_CODE (inner)) == '2'
1571 && TREE_CONSTANT (TREE_OPERAND (inner, 1))));
1572 inner = TREE_OPERAND (inner, 0))
1575 /* If the tree evaluates to a constant, then we don't want to hide that
1576 fact (i.e. this allows further folding, and direct checks for constants).
1577 However, a read-only object that has side effects cannot be bypassed.
1578 Since it is no problem to reevaluate literals, we just return the
1580 if (TREE_CONSTANT (inner)
1581 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1582 || TREE_CODE (inner) == SAVE_EXPR || TREE_CODE (inner) == ERROR_MARK)
1585 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1586 it means that the size or offset of some field of an object depends on
1587 the value within another field.
1589 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1590 and some variable since it would then need to be both evaluated once and
1591 evaluated more than once. Front-ends must assure this case cannot
1592 happen by surrounding any such subexpressions in their own SAVE_EXPR
1593 and forcing evaluation at the proper time. */
1594 if (contains_placeholder_p (t))
1597 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1599 /* This expression might be placed ahead of a jump to ensure that the
1600 value was computed on both sides of the jump. So make sure it isn't
1601 eliminated as dead. */
1602 TREE_SIDE_EFFECTS (t) = 1;
1603 TREE_READONLY (t) = 1;
1607 /* Arrange for an expression to be expanded multiple independent
1608 times. This is useful for cleanup actions, as the backend can
1609 expand them multiple times in different places. */
1617 /* If this is already protected, no sense in protecting it again. */
1618 if (TREE_CODE (expr) == UNSAVE_EXPR)
1621 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1622 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1626 /* Returns the index of the first non-tree operand for CODE, or the number
1627 of operands if all are trees. */
1631 enum tree_code code;
1637 case GOTO_SUBROUTINE_EXPR:
1640 case WITH_CLEANUP_EXPR:
1642 case METHOD_CALL_EXPR:
1645 return TREE_CODE_LENGTH (code);
1649 /* Perform any modifications to EXPR required when it is unsaved. Does
1650 not recurse into EXPR's subtrees. */
1653 unsave_expr_1 (expr)
1656 switch (TREE_CODE (expr))
1659 if (! SAVE_EXPR_PERSISTENT_P (expr))
1660 SAVE_EXPR_RTL (expr) = 0;
1664 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1665 It's OK for this to happen if it was part of a subtree that
1666 isn't immediately expanded, such as operand 2 of another
1668 if (TREE_OPERAND (expr, 1))
1671 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1672 TREE_OPERAND (expr, 3) = NULL_TREE;
1676 /* I don't yet know how to emit a sequence multiple times. */
1677 if (RTL_EXPR_SEQUENCE (expr) != 0)
1682 if (lang_unsave_expr_now != 0)
1683 (*lang_unsave_expr_now) (expr);
1688 /* Helper function for unsave_expr_now. */
1691 unsave_expr_now_r (expr)
1694 enum tree_code code;
1696 /* There's nothing to do for NULL_TREE. */
1700 unsave_expr_1 (expr);
1702 code = TREE_CODE (expr);
1703 switch (TREE_CODE_CLASS (code))
1705 case 'c': /* a constant */
1706 case 't': /* a type node */
1707 case 'd': /* A decl node */
1708 case 'b': /* A block node */
1711 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1712 if (code == TREE_LIST)
1714 unsave_expr_now_r (TREE_VALUE (expr));
1715 unsave_expr_now_r (TREE_CHAIN (expr));
1719 case 'e': /* an expression */
1720 case 'r': /* a reference */
1721 case 's': /* an expression with side effects */
1722 case '<': /* a comparison expression */
1723 case '2': /* a binary arithmetic expression */
1724 case '1': /* a unary arithmetic expression */
1728 for (i = first_rtl_op (code) - 1; i >= 0; i--)
1729 unsave_expr_now_r (TREE_OPERAND (expr, i));
1738 /* Modify a tree in place so that all the evaluate only once things
1739 are cleared out. Return the EXPR given. */
1742 unsave_expr_now (expr)
1745 if (lang_unsave!= 0)
1746 (*lang_unsave) (&expr);
1748 unsave_expr_now_r (expr);
1753 /* Return 0 if it is safe to evaluate EXPR multiple times,
1754 return 1 if it is safe if EXPR is unsaved afterward, or
1755 return 2 if it is completely unsafe.
1757 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1758 an expression tree, so that it safe to unsave them and the surrounding
1759 context will be correct.
1761 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1762 occasionally across the whole of a function. It is therefore only
1763 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1764 below the UNSAVE_EXPR.
1766 RTL_EXPRs consume their rtl during evaluation. It is therefore
1767 never possible to unsave them. */
1770 unsafe_for_reeval (expr)
1774 enum tree_code code;
1779 if (expr == NULL_TREE)
1782 code = TREE_CODE (expr);
1783 first_rtl = first_rtl_op (code);
1792 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1794 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1795 unsafeness = MAX (tmp, unsafeness);
1801 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1802 return MAX (tmp, 1);
1809 if (lang_unsafe_for_reeval != 0)
1811 tmp = (*lang_unsafe_for_reeval) (expr);
1818 switch (TREE_CODE_CLASS (code))
1820 case 'c': /* a constant */
1821 case 't': /* a type node */
1822 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1823 case 'd': /* A decl node */
1824 case 'b': /* A block node */
1827 case 'e': /* an expression */
1828 case 'r': /* a reference */
1829 case 's': /* an expression with side effects */
1830 case '<': /* a comparison expression */
1831 case '2': /* a binary arithmetic expression */
1832 case '1': /* a unary arithmetic expression */
1833 for (i = first_rtl - 1; i >= 0; i--)
1835 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1836 unsafeness = MAX (tmp, unsafeness);
1846 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1847 or offset that depends on a field within a record. */
1850 contains_placeholder_p (exp)
1853 enum tree_code code;
1859 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1860 in it since it is supplying a value for it. */
1861 code = TREE_CODE (exp);
1862 if (code == WITH_RECORD_EXPR)
1864 else if (code == PLACEHOLDER_EXPR)
1867 switch (TREE_CODE_CLASS (code))
1870 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1871 position computations since they will be converted into a
1872 WITH_RECORD_EXPR involving the reference, which will assume
1873 here will be valid. */
1874 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1877 if (code == TREE_LIST)
1878 return (contains_placeholder_p (TREE_VALUE (exp))
1879 || (TREE_CHAIN (exp) != 0
1880 && contains_placeholder_p (TREE_CHAIN (exp))));
1889 /* Ignoring the first operand isn't quite right, but works best. */
1890 return contains_placeholder_p (TREE_OPERAND (exp, 1));
1897 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1898 || contains_placeholder_p (TREE_OPERAND (exp, 1))
1899 || contains_placeholder_p (TREE_OPERAND (exp, 2)));
1902 /* If we already know this doesn't have a placeholder, don't
1904 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1907 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1908 result = contains_placeholder_p (TREE_OPERAND (exp, 0));
1910 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1915 return (TREE_OPERAND (exp, 1) != 0
1916 && contains_placeholder_p (TREE_OPERAND (exp, 1)));
1922 switch (TREE_CODE_LENGTH (code))
1925 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1927 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1928 || contains_placeholder_p (TREE_OPERAND (exp, 1)));
1939 /* Return 1 if EXP contains any expressions that produce cleanups for an
1940 outer scope to deal with. Used by fold. */
1948 if (! TREE_SIDE_EFFECTS (exp))
1951 switch (TREE_CODE (exp))
1954 case GOTO_SUBROUTINE_EXPR:
1955 case WITH_CLEANUP_EXPR:
1958 case CLEANUP_POINT_EXPR:
1962 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1964 cmp = has_cleanups (TREE_VALUE (exp));
1974 /* This general rule works for most tree codes. All exceptions should be
1975 handled above. If this is a language-specific tree code, we can't
1976 trust what might be in the operand, so say we don't know
1978 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1981 nops = first_rtl_op (TREE_CODE (exp));
1982 for (i = 0; i < nops; i++)
1983 if (TREE_OPERAND (exp, i) != 0)
1985 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1986 if (type == 'e' || type == '<' || type == '1' || type == '2'
1987 || type == 'r' || type == 's')
1989 cmp = has_cleanups (TREE_OPERAND (exp, i));
1998 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1999 return a tree with all occurrences of references to F in a
2000 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
2001 contains only arithmetic expressions or a CALL_EXPR with a
2002 PLACEHOLDER_EXPR occurring only in its arglist. */
2005 substitute_in_expr (exp, f, r)
2010 enum tree_code code = TREE_CODE (exp);
2015 switch (TREE_CODE_CLASS (code))
2022 if (code == PLACEHOLDER_EXPR)
2024 else if (code == TREE_LIST)
2026 op0 = (TREE_CHAIN (exp) == 0
2027 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
2028 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
2029 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2032 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2041 switch (TREE_CODE_LENGTH (code))
2044 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2045 if (op0 == TREE_OPERAND (exp, 0))
2048 if (code == NON_LVALUE_EXPR)
2051 new = fold (build1 (code, TREE_TYPE (exp), op0));
2055 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2056 could, but we don't support it. */
2057 if (code == RTL_EXPR)
2059 else if (code == CONSTRUCTOR)
2062 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2063 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2064 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2067 new = fold (build (code, TREE_TYPE (exp), op0, op1));
2071 /* It cannot be that anything inside a SAVE_EXPR contains a
2072 PLACEHOLDER_EXPR. */
2073 if (code == SAVE_EXPR)
2076 else if (code == CALL_EXPR)
2078 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2079 if (op1 == TREE_OPERAND (exp, 1))
2082 return build (code, TREE_TYPE (exp),
2083 TREE_OPERAND (exp, 0), op1, NULL_TREE);
2086 else if (code != COND_EXPR)
2089 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2090 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2091 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2092 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2093 && op2 == TREE_OPERAND (exp, 2))
2096 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2109 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2110 and it is the right field, replace it with R. */
2111 for (inner = TREE_OPERAND (exp, 0);
2112 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2113 inner = TREE_OPERAND (inner, 0))
2115 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2116 && TREE_OPERAND (exp, 1) == f)
2119 /* If this expression hasn't been completed let, leave it
2121 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2122 && TREE_TYPE (inner) == 0)
2125 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2126 if (op0 == TREE_OPERAND (exp, 0))
2129 new = fold (build (code, TREE_TYPE (exp), op0,
2130 TREE_OPERAND (exp, 1)));
2134 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2135 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2136 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2137 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2138 && op2 == TREE_OPERAND (exp, 2))
2141 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2146 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2147 if (op0 == TREE_OPERAND (exp, 0))
2150 new = fold (build1 (code, TREE_TYPE (exp), op0));
2162 TREE_READONLY (new) = TREE_READONLY (exp);
2166 /* Stabilize a reference so that we can use it any number of times
2167 without causing its operands to be evaluated more than once.
2168 Returns the stabilized reference. This works by means of save_expr,
2169 so see the caveats in the comments about save_expr.
2171 Also allows conversion expressions whose operands are references.
2172 Any other kind of expression is returned unchanged. */
2175 stabilize_reference (ref)
2179 enum tree_code code = TREE_CODE (ref);
2186 /* No action is needed in this case. */
2192 case FIX_TRUNC_EXPR:
2193 case FIX_FLOOR_EXPR:
2194 case FIX_ROUND_EXPR:
2196 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2200 result = build_nt (INDIRECT_REF,
2201 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2205 result = build_nt (COMPONENT_REF,
2206 stabilize_reference (TREE_OPERAND (ref, 0)),
2207 TREE_OPERAND (ref, 1));
2211 result = build_nt (BIT_FIELD_REF,
2212 stabilize_reference (TREE_OPERAND (ref, 0)),
2213 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2214 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2218 result = build_nt (ARRAY_REF,
2219 stabilize_reference (TREE_OPERAND (ref, 0)),
2220 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2223 case ARRAY_RANGE_REF:
2224 result = build_nt (ARRAY_RANGE_REF,
2225 stabilize_reference (TREE_OPERAND (ref, 0)),
2226 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2230 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2231 it wouldn't be ignored. This matters when dealing with
2233 return stabilize_reference_1 (ref);
2236 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2237 save_expr (build1 (ADDR_EXPR,
2238 build_pointer_type (TREE_TYPE (ref)),
2242 /* If arg isn't a kind of lvalue we recognize, make no change.
2243 Caller should recognize the error for an invalid lvalue. */
2248 return error_mark_node;
2251 TREE_TYPE (result) = TREE_TYPE (ref);
2252 TREE_READONLY (result) = TREE_READONLY (ref);
2253 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2254 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2259 /* Subroutine of stabilize_reference; this is called for subtrees of
2260 references. Any expression with side-effects must be put in a SAVE_EXPR
2261 to ensure that it is only evaluated once.
2263 We don't put SAVE_EXPR nodes around everything, because assigning very
2264 simple expressions to temporaries causes us to miss good opportunities
2265 for optimizations. Among other things, the opportunity to fold in the
2266 addition of a constant into an addressing mode often gets lost, e.g.
2267 "y[i+1] += x;". In general, we take the approach that we should not make
2268 an assignment unless we are forced into it - i.e., that any non-side effect
2269 operator should be allowed, and that cse should take care of coalescing
2270 multiple utterances of the same expression should that prove fruitful. */
2273 stabilize_reference_1 (e)
2277 enum tree_code code = TREE_CODE (e);
2279 /* We cannot ignore const expressions because it might be a reference
2280 to a const array but whose index contains side-effects. But we can
2281 ignore things that are actual constant or that already have been
2282 handled by this function. */
2284 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2287 switch (TREE_CODE_CLASS (code))
2297 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2298 so that it will only be evaluated once. */
2299 /* The reference (r) and comparison (<) classes could be handled as
2300 below, but it is generally faster to only evaluate them once. */
2301 if (TREE_SIDE_EFFECTS (e))
2302 return save_expr (e);
2306 /* Constants need no processing. In fact, we should never reach
2311 /* Division is slow and tends to be compiled with jumps,
2312 especially the division by powers of 2 that is often
2313 found inside of an array reference. So do it just once. */
2314 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2315 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2316 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2317 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2318 return save_expr (e);
2319 /* Recursively stabilize each operand. */
2320 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2321 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2325 /* Recursively stabilize each operand. */
2326 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2333 TREE_TYPE (result) = TREE_TYPE (e);
2334 TREE_READONLY (result) = TREE_READONLY (e);
2335 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2336 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2341 /* Low-level constructors for expressions. */
2343 /* Build an expression of code CODE, data type TYPE,
2344 and operands as specified by the arguments ARG1 and following arguments.
2345 Expressions and reference nodes can be created this way.
2346 Constants, decls, types and misc nodes cannot be. */
2349 build VPARAMS ((enum tree_code code, tree tt, ...))
2358 VA_FIXEDARG (p, enum tree_code, code);
2359 VA_FIXEDARG (p, tree, tt);
2361 t = make_node (code);
2362 length = TREE_CODE_LENGTH (code);
2365 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2366 result based on those same flags for the arguments. But if the
2367 arguments aren't really even `tree' expressions, we shouldn't be trying
2369 fro = first_rtl_op (code);
2371 /* Expressions without side effects may be constant if their
2372 arguments are as well. */
2373 constant = (TREE_CODE_CLASS (code) == '<'
2374 || TREE_CODE_CLASS (code) == '1'
2375 || TREE_CODE_CLASS (code) == '2'
2376 || TREE_CODE_CLASS (code) == 'c');
2380 /* This is equivalent to the loop below, but faster. */
2381 tree arg0 = va_arg (p, tree);
2382 tree arg1 = va_arg (p, tree);
2384 TREE_OPERAND (t, 0) = arg0;
2385 TREE_OPERAND (t, 1) = arg1;
2386 TREE_READONLY (t) = 1;
2387 if (arg0 && fro > 0)
2389 if (TREE_SIDE_EFFECTS (arg0))
2390 TREE_SIDE_EFFECTS (t) = 1;
2391 if (!TREE_READONLY (arg0))
2392 TREE_READONLY (t) = 0;
2393 if (!TREE_CONSTANT (arg0))
2397 if (arg1 && fro > 1)
2399 if (TREE_SIDE_EFFECTS (arg1))
2400 TREE_SIDE_EFFECTS (t) = 1;
2401 if (!TREE_READONLY (arg1))
2402 TREE_READONLY (t) = 0;
2403 if (!TREE_CONSTANT (arg1))
2407 else if (length == 1)
2409 tree arg0 = va_arg (p, tree);
2411 /* The only one-operand cases we handle here are those with side-effects.
2412 Others are handled with build1. So don't bother checked if the
2413 arg has side-effects since we'll already have set it.
2415 ??? This really should use build1 too. */
2416 if (TREE_CODE_CLASS (code) != 's')
2418 TREE_OPERAND (t, 0) = arg0;
2422 for (i = 0; i < length; i++)
2424 tree operand = va_arg (p, tree);
2426 TREE_OPERAND (t, i) = operand;
2427 if (operand && fro > i)
2429 if (TREE_SIDE_EFFECTS (operand))
2430 TREE_SIDE_EFFECTS (t) = 1;
2431 if (!TREE_CONSTANT (operand))
2438 TREE_CONSTANT (t) = constant;
2442 /* Same as above, but only builds for unary operators.
2443 Saves lions share of calls to `build'; cuts down use
2444 of varargs, which is expensive for RISC machines. */
2447 build1 (code, type, node)
2448 enum tree_code code;
2453 #ifdef GATHER_STATISTICS
2454 tree_node_kind kind;
2458 #ifdef GATHER_STATISTICS
2459 if (TREE_CODE_CLASS (code) == 'r')
2465 #ifdef ENABLE_CHECKING
2466 if (TREE_CODE_CLASS (code) == '2'
2467 || TREE_CODE_CLASS (code) == '<'
2468 || TREE_CODE_LENGTH (code) != 1)
2470 #endif /* ENABLE_CHECKING */
2472 length = sizeof (struct tree_exp);
2474 t = ggc_alloc_tree (length);
2476 memset ((PTR) t, 0, sizeof (struct tree_common));
2478 #ifdef GATHER_STATISTICS
2479 tree_node_counts[(int) kind]++;
2480 tree_node_sizes[(int) kind] += length;
2483 TREE_SET_CODE (t, code);
2485 TREE_TYPE (t) = type;
2486 TREE_COMPLEXITY (t) = 0;
2487 TREE_OPERAND (t, 0) = node;
2488 if (node && first_rtl_op (code) != 0)
2490 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2491 TREE_READONLY (t) = TREE_READONLY (node);
2500 case PREDECREMENT_EXPR:
2501 case PREINCREMENT_EXPR:
2502 case POSTDECREMENT_EXPR:
2503 case POSTINCREMENT_EXPR:
2504 /* All of these have side-effects, no matter what their
2506 TREE_SIDE_EFFECTS (t) = 1;
2507 TREE_READONLY (t) = 0;
2511 /* Whether a dereference is readonly has nothing to do with whether
2512 its operand is readonly. */
2513 TREE_READONLY (t) = 0;
2517 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2518 TREE_CONSTANT (t) = 1;
2525 /* Similar except don't specify the TREE_TYPE
2526 and leave the TREE_SIDE_EFFECTS as 0.
2527 It is permissible for arguments to be null,
2528 or even garbage if their values do not matter. */
2531 build_nt VPARAMS ((enum tree_code code, ...))
2538 VA_FIXEDARG (p, enum tree_code, code);
2540 t = make_node (code);
2541 length = TREE_CODE_LENGTH (code);
2543 for (i = 0; i < length; i++)
2544 TREE_OPERAND (t, i) = va_arg (p, tree);
2550 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2551 We do NOT enter this node in any sort of symbol table.
2553 layout_decl is used to set up the decl's storage layout.
2554 Other slots are initialized to 0 or null pointers. */
2557 build_decl (code, name, type)
2558 enum tree_code code;
2563 t = make_node (code);
2565 /* if (type == error_mark_node)
2566 type = integer_type_node; */
2567 /* That is not done, deliberately, so that having error_mark_node
2568 as the type can suppress useless errors in the use of this variable. */
2570 DECL_NAME (t) = name;
2571 TREE_TYPE (t) = type;
2573 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2575 else if (code == FUNCTION_DECL)
2576 DECL_MODE (t) = FUNCTION_MODE;
2581 /* BLOCK nodes are used to represent the structure of binding contours
2582 and declarations, once those contours have been exited and their contents
2583 compiled. This information is used for outputting debugging info. */
2586 build_block (vars, tags, subblocks, supercontext, chain)
2587 tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain;
2589 tree block = make_node (BLOCK);
2591 BLOCK_VARS (block) = vars;
2592 BLOCK_SUBBLOCKS (block) = subblocks;
2593 BLOCK_SUPERCONTEXT (block) = supercontext;
2594 BLOCK_CHAIN (block) = chain;
2598 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2599 location where an expression or an identifier were encountered. It
2600 is necessary for languages where the frontend parser will handle
2601 recursively more than one file (Java is one of them). */
2604 build_expr_wfl (node, file, line, col)
2609 static const char *last_file = 0;
2610 static tree last_filenode = NULL_TREE;
2611 tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2613 EXPR_WFL_NODE (wfl) = node;
2614 EXPR_WFL_SET_LINECOL (wfl, line, col);
2615 if (file != last_file)
2618 last_filenode = file ? get_identifier (file) : NULL_TREE;
2621 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2624 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2625 TREE_TYPE (wfl) = TREE_TYPE (node);
2631 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2635 build_decl_attribute_variant (ddecl, attribute)
2636 tree ddecl, attribute;
2638 DECL_ATTRIBUTES (ddecl) = attribute;
2642 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2645 Record such modified types already made so we don't make duplicates. */
2648 build_type_attribute_variant (ttype, attribute)
2649 tree ttype, attribute;
2651 if ( ! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2653 unsigned int hashcode;
2656 ntype = copy_node (ttype);
2658 TYPE_POINTER_TO (ntype) = 0;
2659 TYPE_REFERENCE_TO (ntype) = 0;
2660 TYPE_ATTRIBUTES (ntype) = attribute;
2662 /* Create a new main variant of TYPE. */
2663 TYPE_MAIN_VARIANT (ntype) = ntype;
2664 TYPE_NEXT_VARIANT (ntype) = 0;
2665 set_type_quals (ntype, TYPE_UNQUALIFIED);
2667 hashcode = (TYPE_HASH (TREE_CODE (ntype))
2668 + TYPE_HASH (TREE_TYPE (ntype))
2669 + attribute_hash_list (attribute));
2671 switch (TREE_CODE (ntype))
2674 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2677 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2680 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2683 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2689 ntype = type_hash_canon (hashcode, ntype);
2690 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2696 /* Default value of targetm.comp_type_attributes that always returns 1. */
2699 default_comp_type_attributes (type1, type2)
2700 tree type1 ATTRIBUTE_UNUSED;
2701 tree type2 ATTRIBUTE_UNUSED;
2706 /* Default version of targetm.set_default_type_attributes that always does
2710 default_set_default_type_attributes (type)
2711 tree type ATTRIBUTE_UNUSED;
2715 /* Default version of targetm.insert_attributes that always does nothing. */
2717 default_insert_attributes (decl, attr_ptr)
2718 tree decl ATTRIBUTE_UNUSED;
2719 tree *attr_ptr ATTRIBUTE_UNUSED;
2723 /* Default value of targetm.attribute_table that is empty. */
2724 const struct attribute_spec default_target_attribute_table[] =
2726 { NULL, 0, 0, false, false, false, NULL }
2729 /* Default value of targetm.function_attribute_inlinable_p that always
2732 default_function_attribute_inlinable_p (fndecl)
2733 tree fndecl ATTRIBUTE_UNUSED;
2735 /* By default, functions with machine attributes cannot be inlined. */
2739 /* Return non-zero if IDENT is a valid name for attribute ATTR,
2742 We try both `text' and `__text__', ATTR may be either one. */
2743 /* ??? It might be a reasonable simplification to require ATTR to be only
2744 `text'. One might then also require attribute lists to be stored in
2745 their canonicalized form. */
2748 is_attribute_p (attr, ident)
2752 int ident_len, attr_len;
2755 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2758 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2761 p = IDENTIFIER_POINTER (ident);
2762 ident_len = strlen (p);
2763 attr_len = strlen (attr);
2765 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2769 || attr[attr_len - 2] != '_'
2770 || attr[attr_len - 1] != '_')
2772 if (ident_len == attr_len - 4
2773 && strncmp (attr + 2, p, attr_len - 4) == 0)
2778 if (ident_len == attr_len + 4
2779 && p[0] == '_' && p[1] == '_'
2780 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2781 && strncmp (attr, p + 2, attr_len) == 0)
2788 /* Given an attribute name and a list of attributes, return a pointer to the
2789 attribute's list element if the attribute is part of the list, or NULL_TREE
2790 if not found. If the attribute appears more than once, this only
2791 returns the first occurrence; the TREE_CHAIN of the return value should
2792 be passed back in if further occurrences are wanted. */
2795 lookup_attribute (attr_name, list)
2796 const char *attr_name;
2801 for (l = list; l; l = TREE_CHAIN (l))
2803 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2805 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2812 /* Return an attribute list that is the union of a1 and a2. */
2815 merge_attributes (a1, a2)
2820 /* Either one unset? Take the set one. */
2822 if ((attributes = a1) == 0)
2825 /* One that completely contains the other? Take it. */
2827 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2829 if (attribute_list_contained (a2, a1))
2833 /* Pick the longest list, and hang on the other list. */
2835 if (list_length (a1) < list_length (a2))
2836 attributes = a2, a2 = a1;
2838 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2841 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2844 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2847 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2852 a1 = copy_node (a2);
2853 TREE_CHAIN (a1) = attributes;
2862 /* Given types T1 and T2, merge their attributes and return
2866 merge_type_attributes (t1, t2)
2869 return merge_attributes (TYPE_ATTRIBUTES (t1),
2870 TYPE_ATTRIBUTES (t2));
2873 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2877 merge_decl_attributes (olddecl, newdecl)
2878 tree olddecl, newdecl;
2880 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2881 DECL_ATTRIBUTES (newdecl));
2884 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2886 /* Specialization of merge_decl_attributes for various Windows targets.
2888 This handles the following situation:
2890 __declspec (dllimport) int foo;
2893 The second instance of `foo' nullifies the dllimport. */
2896 merge_dllimport_decl_attributes (old, new)
2901 int delete_dllimport_p;
2903 old = DECL_ATTRIBUTES (old);
2904 new = DECL_ATTRIBUTES (new);
2906 /* What we need to do here is remove from `old' dllimport if it doesn't
2907 appear in `new'. dllimport behaves like extern: if a declaration is
2908 marked dllimport and a definition appears later, then the object
2909 is not dllimport'd. */
2910 if (lookup_attribute ("dllimport", old) != NULL_TREE
2911 && lookup_attribute ("dllimport", new) == NULL_TREE)
2912 delete_dllimport_p = 1;
2914 delete_dllimport_p = 0;
2916 a = merge_attributes (old, new);
2918 if (delete_dllimport_p)
2922 /* Scan the list for dllimport and delete it. */
2923 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
2925 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
2927 if (prev == NULL_TREE)
2930 TREE_CHAIN (prev) = TREE_CHAIN (t);
2939 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2941 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2942 of the various TYPE_QUAL values. */
2945 set_type_quals (type, type_quals)
2949 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
2950 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
2951 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
2954 /* Return a version of the TYPE, qualified as indicated by the
2955 TYPE_QUALS, if one exists. If no qualified version exists yet,
2956 return NULL_TREE. */
2959 get_qualified_type (type, type_quals)
2965 /* Search the chain of variants to see if there is already one there just
2966 like the one we need to have. If so, use that existing one. We must
2967 preserve the TYPE_NAME, since there is code that depends on this. */
2968 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2969 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type))
2975 /* Like get_qualified_type, but creates the type if it does not
2976 exist. This function never returns NULL_TREE. */
2979 build_qualified_type (type, type_quals)
2985 /* See if we already have the appropriate qualified variant. */
2986 t = get_qualified_type (type, type_quals);
2988 /* If not, build it. */
2991 t = build_type_copy (type);
2992 set_type_quals (t, type_quals);
2998 /* Create a new variant of TYPE, equivalent but distinct.
2999 This is so the caller can modify it. */
3002 build_type_copy (type)
3005 tree t, m = TYPE_MAIN_VARIANT (type);
3007 t = copy_node (type);
3009 TYPE_POINTER_TO (t) = 0;
3010 TYPE_REFERENCE_TO (t) = 0;
3012 /* Add this type to the chain of variants of TYPE. */
3013 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3014 TYPE_NEXT_VARIANT (m) = t;
3019 /* Hashing of types so that we don't make duplicates.
3020 The entry point is `type_hash_canon'. */
3022 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3023 with types in the TREE_VALUE slots), by adding the hash codes
3024 of the individual types. */
3027 type_hash_list (list)
3030 unsigned int hashcode;
3033 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3034 hashcode += TYPE_HASH (TREE_VALUE (tail));
3039 /* These are the Hashtable callback functions. */
3041 /* Returns true if the types are equal. */
3044 type_hash_eq (va, vb)
3048 const struct type_hash *a = va, *b = vb;
3049 if (a->hash == b->hash
3050 && TREE_CODE (a->type) == TREE_CODE (b->type)
3051 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
3052 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3053 TYPE_ATTRIBUTES (b->type))
3054 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
3055 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3056 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3057 TYPE_MAX_VALUE (b->type)))
3058 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3059 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3060 TYPE_MIN_VALUE (b->type)))
3061 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3062 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
3063 || (TYPE_DOMAIN (a->type)
3064 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
3065 && TYPE_DOMAIN (b->type)
3066 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
3067 && type_list_equal (TYPE_DOMAIN (a->type),
3068 TYPE_DOMAIN (b->type)))))
3073 /* Return the cached hash value. */
3076 type_hash_hash (item)
3079 return ((const struct type_hash *) item)->hash;
3082 /* Look in the type hash table for a type isomorphic to TYPE.
3083 If one is found, return it. Otherwise return 0. */
3086 type_hash_lookup (hashcode, type)
3087 unsigned int hashcode;
3090 struct type_hash *h, in;
3092 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3093 must call that routine before comparing TYPE_ALIGNs. */
3099 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3105 /* Add an entry to the type-hash-table
3106 for a type TYPE whose hash code is HASHCODE. */
3109 type_hash_add (hashcode, type)
3110 unsigned int hashcode;
3113 struct type_hash *h;
3116 h = (struct type_hash *) ggc_alloc (sizeof (struct type_hash));
3119 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3120 *(struct type_hash **) loc = h;
3123 /* Given TYPE, and HASHCODE its hash code, return the canonical
3124 object for an identical type if one already exists.
3125 Otherwise, return TYPE, and record it as the canonical object
3126 if it is a permanent object.
3128 To use this function, first create a type of the sort you want.
3129 Then compute its hash code from the fields of the type that
3130 make it different from other similar types.
3131 Then call this function and use the value.
3132 This function frees the type you pass in if it is a duplicate. */
3134 /* Set to 1 to debug without canonicalization. Never set by program. */
3135 int debug_no_type_hash = 0;
3138 type_hash_canon (hashcode, type)
3139 unsigned int hashcode;
3144 if (debug_no_type_hash)
3147 /* See if the type is in the hash table already. If so, return it.
3148 Otherwise, add the type. */
3149 t1 = type_hash_lookup (hashcode, type);
3152 #ifdef GATHER_STATISTICS
3153 tree_node_counts[(int) t_kind]--;
3154 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3160 type_hash_add (hashcode, type);
3165 /* See if the data pointed to by the type hash table is marked. We consider
3166 it marked if the type is marked or if a debug type number or symbol
3167 table entry has been made for the type. This reduces the amount of
3168 debugging output and eliminates that dependency of the debug output on
3169 the number of garbage collections. */
3172 type_hash_marked_p (p)
3175 tree type = ((struct type_hash *) p)->type;
3177 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3180 /* Mark the entry in the type hash table the type it points to is marked.
3181 Also mark the type in case we are considering this entry "marked" by
3182 virtue of TYPE_SYMTAB_POINTER being set. */
3189 ggc_mark_tree (((struct type_hash *) p)->type);
3192 /* Mark the hashtable slot pointed to by ENTRY (which is really a
3193 `tree**') for GC. */
3196 mark_tree_hashtable_entry (entry, data)
3198 void *data ATTRIBUTE_UNUSED;
3200 ggc_mark_tree ((tree) *entry);
3204 /* Mark ARG (which is really a htab_t whose slots are trees) for
3208 mark_tree_hashtable (arg)
3211 htab_t t = *(htab_t *) arg;
3212 htab_traverse (t, mark_tree_hashtable_entry, 0);
3216 print_type_hash_statistics ()
3218 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3219 (long) htab_size (type_hash_table),
3220 (long) htab_elements (type_hash_table),
3221 htab_collisions (type_hash_table));
3224 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3225 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3226 by adding the hash codes of the individual attributes. */
3229 attribute_hash_list (list)
3232 unsigned int hashcode;
3235 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3236 /* ??? Do we want to add in TREE_VALUE too? */
3237 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3241 /* Given two lists of attributes, return true if list l2 is
3242 equivalent to l1. */
3245 attribute_list_equal (l1, l2)
3248 return attribute_list_contained (l1, l2)
3249 && attribute_list_contained (l2, l1);
3252 /* Given two lists of attributes, return true if list L2 is
3253 completely contained within L1. */
3254 /* ??? This would be faster if attribute names were stored in a canonicalized
3255 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3256 must be used to show these elements are equivalent (which they are). */
3257 /* ??? It's not clear that attributes with arguments will always be handled
3261 attribute_list_contained (l1, l2)
3266 /* First check the obvious, maybe the lists are identical. */
3270 /* Maybe the lists are similar. */
3271 for (t1 = l1, t2 = l2;
3273 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3274 && TREE_VALUE (t1) == TREE_VALUE (t2);
3275 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3277 /* Maybe the lists are equal. */
3278 if (t1 == 0 && t2 == 0)
3281 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3284 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3286 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3289 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3296 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3303 /* Given two lists of types
3304 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3305 return 1 if the lists contain the same types in the same order.
3306 Also, the TREE_PURPOSEs must match. */
3309 type_list_equal (l1, l2)
3314 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3315 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3316 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3317 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3318 && (TREE_TYPE (TREE_PURPOSE (t1))
3319 == TREE_TYPE (TREE_PURPOSE (t2))))))
3325 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3326 given by TYPE. If the argument list accepts variable arguments,
3327 then this function counts only the ordinary arguments. */
3330 type_num_arguments (type)
3336 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3337 /* If the function does not take a variable number of arguments,
3338 the last element in the list will have type `void'. */
3339 if (VOID_TYPE_P (TREE_VALUE (t)))
3347 /* Nonzero if integer constants T1 and T2
3348 represent the same constant value. */
3351 tree_int_cst_equal (t1, t2)
3357 if (t1 == 0 || t2 == 0)
3360 if (TREE_CODE (t1) == INTEGER_CST
3361 && TREE_CODE (t2) == INTEGER_CST
3362 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3363 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3369 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3370 The precise way of comparison depends on their data type. */
3373 tree_int_cst_lt (t1, t2)
3379 if (! TREE_UNSIGNED (TREE_TYPE (t1)))
3380 return INT_CST_LT (t1, t2);
3382 return INT_CST_LT_UNSIGNED (t1, t2);
3385 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3388 tree_int_cst_compare (t1, t2)
3392 if (tree_int_cst_lt (t1, t2))
3394 else if (tree_int_cst_lt (t2, t1))
3400 /* Return 1 if T is an INTEGER_CST that can be represented in a single
3401 HOST_WIDE_INT value. If POS is nonzero, the result must be positive. */
3404 host_integerp (t, pos)
3408 return (TREE_CODE (t) == INTEGER_CST
3409 && ! TREE_OVERFLOW (t)
3410 && ((TREE_INT_CST_HIGH (t) == 0
3411 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3412 || (! pos && TREE_INT_CST_HIGH (t) == -1
3413 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
3414 || (! pos && TREE_INT_CST_HIGH (t) == 0
3415 && TREE_UNSIGNED (TREE_TYPE (t)))));
3418 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3419 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3420 be positive. Abort if we cannot satisfy the above conditions. */
3423 tree_low_cst (t, pos)
3427 if (host_integerp (t, pos))
3428 return TREE_INT_CST_LOW (t);
3433 /* Return the most significant bit of the integer constant T. */
3436 tree_int_cst_msb (t)
3441 unsigned HOST_WIDE_INT l;
3443 /* Note that using TYPE_PRECISION here is wrong. We care about the
3444 actual bits, not the (arbitrary) range of the type. */
3445 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3446 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3447 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3448 return (l & 1) == 1;
3451 /* Return an indication of the sign of the integer constant T.
3452 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3453 Note that -1 will never be returned it T's type is unsigned. */
3456 tree_int_cst_sgn (t)
3459 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3461 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3463 else if (TREE_INT_CST_HIGH (t) < 0)
3469 /* Compare two constructor-element-type constants. Return 1 if the lists
3470 are known to be equal; otherwise return 0. */
3473 simple_cst_list_equal (l1, l2)
3476 while (l1 != NULL_TREE && l2 != NULL_TREE)
3478 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3481 l1 = TREE_CHAIN (l1);
3482 l2 = TREE_CHAIN (l2);
3488 /* Return truthvalue of whether T1 is the same tree structure as T2.
3489 Return 1 if they are the same.
3490 Return 0 if they are understandably different.
3491 Return -1 if either contains tree structure not understood by
3495 simple_cst_equal (t1, t2)
3498 enum tree_code code1, code2;
3504 if (t1 == 0 || t2 == 0)
3507 code1 = TREE_CODE (t1);
3508 code2 = TREE_CODE (t2);
3510 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3512 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3513 || code2 == NON_LVALUE_EXPR)
3514 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3516 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3519 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3520 || code2 == NON_LVALUE_EXPR)
3521 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3529 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3530 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3533 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3536 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3537 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3538 TREE_STRING_LENGTH (t1)));
3541 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3547 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3550 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3554 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3557 /* Special case: if either target is an unallocated VAR_DECL,
3558 it means that it's going to be unified with whatever the
3559 TARGET_EXPR is really supposed to initialize, so treat it
3560 as being equivalent to anything. */
3561 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3562 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3563 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3564 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3565 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3566 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3569 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3574 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3576 case WITH_CLEANUP_EXPR:
3577 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3581 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3584 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3585 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3599 /* This general rule works for most tree codes. All exceptions should be
3600 handled above. If this is a language-specific tree code, we can't
3601 trust what might be in the operand, so say we don't know
3603 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3606 switch (TREE_CODE_CLASS (code1))
3615 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3617 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3629 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3630 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3631 than U, respectively. */
3634 compare_tree_int (t, u)
3636 unsigned HOST_WIDE_INT u;
3638 if (tree_int_cst_sgn (t) < 0)
3640 else if (TREE_INT_CST_HIGH (t) != 0)
3642 else if (TREE_INT_CST_LOW (t) == u)
3644 else if (TREE_INT_CST_LOW (t) < u)
3650 /* Constructors for pointer, array and function types.
3651 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3652 constructed by language-dependent code, not here.) */
3654 /* Construct, lay out and return the type of pointers to TO_TYPE.
3655 If such a type has already been constructed, reuse it. */
3658 build_pointer_type (to_type)
3661 tree t = TYPE_POINTER_TO (to_type);
3663 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3668 /* We need a new one. */
3669 t = make_node (POINTER_TYPE);
3671 TREE_TYPE (t) = to_type;
3673 /* Record this type as the pointer to TO_TYPE. */
3674 TYPE_POINTER_TO (to_type) = t;
3676 /* Lay out the type. This function has many callers that are concerned
3677 with expression-construction, and this simplifies them all.
3678 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3684 /* Build the node for the type of references-to-TO_TYPE. */
3687 build_reference_type (to_type)
3690 tree t = TYPE_REFERENCE_TO (to_type);
3692 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3697 /* We need a new one. */
3698 t = make_node (REFERENCE_TYPE);
3700 TREE_TYPE (t) = to_type;
3702 /* Record this type as the pointer to TO_TYPE. */
3703 TYPE_REFERENCE_TO (to_type) = t;
3710 /* Build a type that is compatible with t but has no cv quals anywhere
3713 const char *const *const * -> char ***. */
3716 build_type_no_quals (t)
3719 switch (TREE_CODE (t))
3722 return build_pointer_type (build_type_no_quals (TREE_TYPE (t)));
3723 case REFERENCE_TYPE:
3724 return build_reference_type (build_type_no_quals (TREE_TYPE (t)));
3726 return TYPE_MAIN_VARIANT (t);
3730 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3731 MAXVAL should be the maximum value in the domain
3732 (one less than the length of the array).
3734 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3735 We don't enforce this limit, that is up to caller (e.g. language front end).
3736 The limit exists because the result is a signed type and we don't handle
3737 sizes that use more than one HOST_WIDE_INT. */
3740 build_index_type (maxval)
3743 tree itype = make_node (INTEGER_TYPE);
3745 TREE_TYPE (itype) = sizetype;
3746 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3747 TYPE_MIN_VALUE (itype) = size_zero_node;
3748 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3749 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3750 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3751 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
3752 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3753 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
3755 if (host_integerp (maxval, 1))
3756 return type_hash_canon (tree_low_cst (maxval, 1), itype);
3761 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3762 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3763 low bound LOWVAL and high bound HIGHVAL.
3764 if TYPE==NULL_TREE, sizetype is used. */
3767 build_range_type (type, lowval, highval)
3768 tree type, lowval, highval;
3770 tree itype = make_node (INTEGER_TYPE);
3772 TREE_TYPE (itype) = type;
3773 if (type == NULL_TREE)
3776 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3777 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
3779 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3780 TYPE_MODE (itype) = TYPE_MODE (type);
3781 TYPE_SIZE (itype) = TYPE_SIZE (type);
3782 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
3783 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3784 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
3786 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
3787 return type_hash_canon (tree_low_cst (highval, 0)
3788 - tree_low_cst (lowval, 0),
3794 /* Just like build_index_type, but takes lowval and highval instead
3795 of just highval (maxval). */
3798 build_index_2_type (lowval, highval)
3799 tree lowval, highval;
3801 return build_range_type (sizetype, lowval, highval);
3804 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
3805 Needed because when index types are not hashed, equal index types
3806 built at different times appear distinct, even though structurally,
3810 index_type_equal (itype1, itype2)
3811 tree itype1, itype2;
3813 if (TREE_CODE (itype1) != TREE_CODE (itype2))
3816 if (TREE_CODE (itype1) == INTEGER_TYPE)
3818 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
3819 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
3820 || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1
3821 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
3824 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1),
3825 TYPE_MIN_VALUE (itype2))
3826 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1),
3827 TYPE_MAX_VALUE (itype2)))
3834 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3835 and number of elements specified by the range of values of INDEX_TYPE.
3836 If such a type has already been constructed, reuse it. */
3839 build_array_type (elt_type, index_type)
3840 tree elt_type, index_type;
3843 unsigned int hashcode;
3845 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3847 error ("arrays of functions are not meaningful");
3848 elt_type = integer_type_node;
3851 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3852 build_pointer_type (elt_type);
3854 /* Allocate the array after the pointer type,
3855 in case we free it in type_hash_canon. */
3856 t = make_node (ARRAY_TYPE);
3857 TREE_TYPE (t) = elt_type;
3858 TYPE_DOMAIN (t) = index_type;
3860 if (index_type == 0)
3865 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3866 t = type_hash_canon (hashcode, t);
3868 if (!COMPLETE_TYPE_P (t))
3873 /* Return the TYPE of the elements comprising
3874 the innermost dimension of ARRAY. */
3877 get_inner_array_type (array)
3880 tree type = TREE_TYPE (array);
3882 while (TREE_CODE (type) == ARRAY_TYPE)
3883 type = TREE_TYPE (type);
3888 /* Construct, lay out and return
3889 the type of functions returning type VALUE_TYPE
3890 given arguments of types ARG_TYPES.
3891 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3892 are data type nodes for the arguments of the function.
3893 If such a type has already been constructed, reuse it. */
3896 build_function_type (value_type, arg_types)
3897 tree value_type, arg_types;
3900 unsigned int hashcode;
3902 if (TREE_CODE (value_type) == FUNCTION_TYPE)
3904 error ("function return type cannot be function");
3905 value_type = integer_type_node;
3908 /* Make a node of the sort we want. */
3909 t = make_node (FUNCTION_TYPE);
3910 TREE_TYPE (t) = value_type;
3911 TYPE_ARG_TYPES (t) = arg_types;
3913 /* If we already have such a type, use the old one and free this one. */
3914 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
3915 t = type_hash_canon (hashcode, t);
3917 if (!COMPLETE_TYPE_P (t))
3922 /* Construct, lay out and return the type of methods belonging to class
3923 BASETYPE and whose arguments and values are described by TYPE.
3924 If that type exists already, reuse it.
3925 TYPE must be a FUNCTION_TYPE node. */
3928 build_method_type (basetype, type)
3929 tree basetype, type;
3932 unsigned int hashcode;
3934 /* Make a node of the sort we want. */
3935 t = make_node (METHOD_TYPE);
3937 if (TREE_CODE (type) != FUNCTION_TYPE)
3940 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3941 TREE_TYPE (t) = TREE_TYPE (type);
3943 /* The actual arglist for this function includes a "hidden" argument
3944 which is "this". Put it into the list of argument types. */
3947 = tree_cons (NULL_TREE,
3948 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
3950 /* If we already have such a type, use the old one and free this one. */
3951 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3952 t = type_hash_canon (hashcode, t);
3954 if (!COMPLETE_TYPE_P (t))
3960 /* Construct, lay out and return the type of offsets to a value
3961 of type TYPE, within an object of type BASETYPE.
3962 If a suitable offset type exists already, reuse it. */
3965 build_offset_type (basetype, type)
3966 tree basetype, type;
3969 unsigned int hashcode;
3971 /* Make a node of the sort we want. */
3972 t = make_node (OFFSET_TYPE);
3974 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3975 TREE_TYPE (t) = type;
3977 /* If we already have such a type, use the old one and free this one. */
3978 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3979 t = type_hash_canon (hashcode, t);
3981 if (!COMPLETE_TYPE_P (t))
3987 /* Create a complex type whose components are COMPONENT_TYPE. */
3990 build_complex_type (component_type)
3991 tree component_type;
3994 unsigned int hashcode;
3996 /* Make a node of the sort we want. */
3997 t = make_node (COMPLEX_TYPE);
3999 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4000 set_type_quals (t, TYPE_QUALS (component_type));
4002 /* If we already have such a type, use the old one and free this one. */
4003 hashcode = TYPE_HASH (component_type);
4004 t = type_hash_canon (hashcode, t);
4006 if (!COMPLETE_TYPE_P (t))
4009 /* If we are writing Dwarf2 output we need to create a name,
4010 since complex is a fundamental type. */
4011 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4015 if (component_type == char_type_node)
4016 name = "complex char";
4017 else if (component_type == signed_char_type_node)
4018 name = "complex signed char";
4019 else if (component_type == unsigned_char_type_node)
4020 name = "complex unsigned char";
4021 else if (component_type == short_integer_type_node)
4022 name = "complex short int";
4023 else if (component_type == short_unsigned_type_node)
4024 name = "complex short unsigned int";
4025 else if (component_type == integer_type_node)
4026 name = "complex int";
4027 else if (component_type == unsigned_type_node)
4028 name = "complex unsigned int";
4029 else if (component_type == long_integer_type_node)
4030 name = "complex long int";
4031 else if (component_type == long_unsigned_type_node)
4032 name = "complex long unsigned int";
4033 else if (component_type == long_long_integer_type_node)
4034 name = "complex long long int";
4035 else if (component_type == long_long_unsigned_type_node)
4036 name = "complex long long unsigned int";
4041 TYPE_NAME (t) = get_identifier (name);
4047 /* Return OP, stripped of any conversions to wider types as much as is safe.
4048 Converting the value back to OP's type makes a value equivalent to OP.
4050 If FOR_TYPE is nonzero, we return a value which, if converted to
4051 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4053 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4054 narrowest type that can hold the value, even if they don't exactly fit.
4055 Otherwise, bit-field references are changed to a narrower type
4056 only if they can be fetched directly from memory in that type.
4058 OP must have integer, real or enumeral type. Pointers are not allowed!
4060 There are some cases where the obvious value we could return
4061 would regenerate to OP if converted to OP's type,
4062 but would not extend like OP to wider types.
4063 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4064 For example, if OP is (unsigned short)(signed char)-1,
4065 we avoid returning (signed char)-1 if FOR_TYPE is int,
4066 even though extending that to an unsigned short would regenerate OP,
4067 since the result of extending (signed char)-1 to (int)
4068 is different from (int) OP. */
4071 get_unwidened (op, for_type)
4075 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4076 tree type = TREE_TYPE (op);
4078 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4080 = (for_type != 0 && for_type != type
4081 && final_prec > TYPE_PRECISION (type)
4082 && TREE_UNSIGNED (type));
4085 while (TREE_CODE (op) == NOP_EXPR)
4088 = TYPE_PRECISION (TREE_TYPE (op))
4089 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4091 /* Truncations are many-one so cannot be removed.
4092 Unless we are later going to truncate down even farther. */
4094 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4097 /* See what's inside this conversion. If we decide to strip it,
4099 op = TREE_OPERAND (op, 0);
4101 /* If we have not stripped any zero-extensions (uns is 0),
4102 we can strip any kind of extension.
4103 If we have previously stripped a zero-extension,
4104 only zero-extensions can safely be stripped.
4105 Any extension can be stripped if the bits it would produce
4106 are all going to be discarded later by truncating to FOR_TYPE. */
4110 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4112 /* TREE_UNSIGNED says whether this is a zero-extension.
4113 Let's avoid computing it if it does not affect WIN
4114 and if UNS will not be needed again. */
4115 if ((uns || TREE_CODE (op) == NOP_EXPR)
4116 && TREE_UNSIGNED (TREE_TYPE (op)))
4124 if (TREE_CODE (op) == COMPONENT_REF
4125 /* Since type_for_size always gives an integer type. */
4126 && TREE_CODE (type) != REAL_TYPE
4127 /* Don't crash if field not laid out yet. */
4128 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4129 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4131 unsigned int innerprec
4132 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4134 type = type_for_size (innerprec, TREE_UNSIGNED (TREE_OPERAND (op, 1)));
4136 /* We can get this structure field in the narrowest type it fits in.
4137 If FOR_TYPE is 0, do this only for a field that matches the
4138 narrower type exactly and is aligned for it
4139 The resulting extension to its nominal type (a fullword type)
4140 must fit the same conditions as for other extensions. */
4142 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4143 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4144 && (! uns || final_prec <= innerprec
4145 || TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4148 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4149 TREE_OPERAND (op, 1));
4150 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4151 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4158 /* Return OP or a simpler expression for a narrower value
4159 which can be sign-extended or zero-extended to give back OP.
4160 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4161 or 0 if the value should be sign-extended. */
4164 get_narrower (op, unsignedp_ptr)
4172 while (TREE_CODE (op) == NOP_EXPR)
4175 = (TYPE_PRECISION (TREE_TYPE (op))
4176 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4178 /* Truncations are many-one so cannot be removed. */
4182 /* See what's inside this conversion. If we decide to strip it,
4184 op = TREE_OPERAND (op, 0);
4188 /* An extension: the outermost one can be stripped,
4189 but remember whether it is zero or sign extension. */
4191 uns = TREE_UNSIGNED (TREE_TYPE (op));
4192 /* Otherwise, if a sign extension has been stripped,
4193 only sign extensions can now be stripped;
4194 if a zero extension has been stripped, only zero-extensions. */
4195 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4199 else /* bitschange == 0 */
4201 /* A change in nominal type can always be stripped, but we must
4202 preserve the unsignedness. */
4204 uns = TREE_UNSIGNED (TREE_TYPE (op));
4211 if (TREE_CODE (op) == COMPONENT_REF
4212 /* Since type_for_size always gives an integer type. */
4213 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4214 /* Ensure field is laid out already. */
4215 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4217 unsigned HOST_WIDE_INT innerprec
4218 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4219 tree type = type_for_size (innerprec, TREE_UNSIGNED (op));
4221 /* We can get this structure field in a narrower type that fits it,
4222 but the resulting extension to its nominal type (a fullword type)
4223 must satisfy the same conditions as for other extensions.
4225 Do this only for fields that are aligned (not bit-fields),
4226 because when bit-field insns will be used there is no
4227 advantage in doing this. */
4229 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4230 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4231 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4235 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4236 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4237 TREE_OPERAND (op, 1));
4238 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4239 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4242 *unsignedp_ptr = uns;
4246 /* Nonzero if integer constant C has a value that is permissible
4247 for type TYPE (an INTEGER_TYPE). */
4250 int_fits_type_p (c, type)
4253 /* If the bounds of the type are integers, we can check ourselves.
4254 If not, but this type is a subtype, try checking against that.
4255 Otherwise, use force_fit_type, which checks against the precision. */
4256 if (TYPE_MAX_VALUE (type) != NULL_TREE
4257 && TYPE_MIN_VALUE (type) != NULL_TREE
4258 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4259 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
4261 if (TREE_UNSIGNED (type))
4262 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c)
4263 && ! INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type))
4264 /* Negative ints never fit unsigned types. */
4265 && ! (TREE_INT_CST_HIGH (c) < 0
4266 && ! TREE_UNSIGNED (TREE_TYPE (c))));
4268 return (! INT_CST_LT (TYPE_MAX_VALUE (type), c)
4269 && ! INT_CST_LT (c, TYPE_MIN_VALUE (type))
4270 /* Unsigned ints with top bit set never fit signed types. */
4271 && ! (TREE_INT_CST_HIGH (c) < 0
4272 && TREE_UNSIGNED (TREE_TYPE (c))));
4274 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4275 return int_fits_type_p (c, TREE_TYPE (type));
4279 TREE_TYPE (c) = type;
4280 return !force_fit_type (c, 0);
4284 /* Given a DECL or TYPE, return the scope in which it was declared, or
4285 NULL_TREE if there is no containing scope. */
4288 get_containing_scope (t)
4291 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4294 /* Return the innermost context enclosing DECL that is
4295 a FUNCTION_DECL, or zero if none. */
4298 decl_function_context (decl)
4303 if (TREE_CODE (decl) == ERROR_MARK)
4306 if (TREE_CODE (decl) == SAVE_EXPR)
4307 context = SAVE_EXPR_CONTEXT (decl);
4309 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4310 where we look up the function at runtime. Such functions always take
4311 a first argument of type 'pointer to real context'.
4313 C++ should really be fixed to use DECL_CONTEXT for the real context,
4314 and use something else for the "virtual context". */
4315 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4318 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4320 context = DECL_CONTEXT (decl);
4322 while (context && TREE_CODE (context) != FUNCTION_DECL)
4324 if (TREE_CODE (context) == BLOCK)
4325 context = BLOCK_SUPERCONTEXT (context);
4327 context = get_containing_scope (context);
4333 /* Return the innermost context enclosing DECL that is
4334 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4335 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4338 decl_type_context (decl)
4341 tree context = DECL_CONTEXT (decl);
4345 if (TREE_CODE (context) == RECORD_TYPE
4346 || TREE_CODE (context) == UNION_TYPE
4347 || TREE_CODE (context) == QUAL_UNION_TYPE)
4350 if (TREE_CODE (context) == TYPE_DECL
4351 || TREE_CODE (context) == FUNCTION_DECL)
4352 context = DECL_CONTEXT (context);
4354 else if (TREE_CODE (context) == BLOCK)
4355 context = BLOCK_SUPERCONTEXT (context);
4358 /* Unhandled CONTEXT!? */
4364 /* CALL is a CALL_EXPR. Return the declaration for the function
4365 called, or NULL_TREE if the called function cannot be
4369 get_callee_fndecl (call)
4374 /* It's invalid to call this function with anything but a
4376 if (TREE_CODE (call) != CALL_EXPR)
4379 /* The first operand to the CALL is the address of the function
4381 addr = TREE_OPERAND (call, 0);
4385 /* If this is a readonly function pointer, extract its initial value. */
4386 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4387 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4388 && DECL_INITIAL (addr))
4389 addr = DECL_INITIAL (addr);
4391 /* If the address is just `&f' for some function `f', then we know
4392 that `f' is being called. */
4393 if (TREE_CODE (addr) == ADDR_EXPR
4394 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4395 return TREE_OPERAND (addr, 0);
4397 /* We couldn't figure out what was being called. */
4401 /* Print debugging information about the obstack O, named STR. */
4404 print_obstack_statistics (str, o)
4408 struct _obstack_chunk *chunk = o->chunk;
4412 n_alloc += o->next_free - chunk->contents;
4413 chunk = chunk->prev;
4417 n_alloc += chunk->limit - &chunk->contents[0];
4418 chunk = chunk->prev;
4420 fprintf (stderr, "obstack %s: %u bytes, %d chunks\n",
4421 str, n_alloc, n_chunks);
4424 /* Print debugging information about tree nodes generated during the compile,
4425 and any language-specific information. */
4428 dump_tree_statistics ()
4430 #ifdef GATHER_STATISTICS
4432 int total_nodes, total_bytes;
4435 fprintf (stderr, "\n??? tree nodes created\n\n");
4436 #ifdef GATHER_STATISTICS
4437 fprintf (stderr, "Kind Nodes Bytes\n");
4438 fprintf (stderr, "-------------------------------------\n");
4439 total_nodes = total_bytes = 0;
4440 for (i = 0; i < (int) all_kinds; i++)
4442 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4443 tree_node_counts[i], tree_node_sizes[i]);
4444 total_nodes += tree_node_counts[i];
4445 total_bytes += tree_node_sizes[i];
4447 fprintf (stderr, "-------------------------------------\n");
4448 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4449 fprintf (stderr, "-------------------------------------\n");
4451 fprintf (stderr, "(No per-node statistics)\n");
4453 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
4454 print_type_hash_statistics ();
4455 (*lang_hooks.print_statistics) ();
4458 #define FILE_FUNCTION_PREFIX_LEN 9
4460 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4462 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4463 clashes in cases where we can't reliably choose a unique name.
4465 Derived from mkstemp.c in libiberty. */
4468 append_random_chars (template)
4471 static const char letters[]
4472 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4473 static unsigned HOST_WIDE_INT value;
4474 unsigned HOST_WIDE_INT v;
4480 /* VALUE should be unique for each file and must not change between
4481 compiles since this can cause bootstrap comparison errors. */
4483 if (stat (main_input_filename, &st) < 0)
4486 /* In VMS, ino is an array, so we have to use both values. We
4487 conditionalize that. */
4489 #define INO_TO_INT(INO) ((int) (INO)[1] << 16 ^ (int) (INO)[2])
4491 #define INO_TO_INT(INO) INO
4493 value = st.st_dev ^ INO_TO_INT (st.st_ino) ^ st.st_mtime;
4496 template += strlen (template);
4500 /* Fill in the random bits. */
4501 template[0] = letters[v % 62];
4503 template[1] = letters[v % 62];
4505 template[2] = letters[v % 62];
4507 template[3] = letters[v % 62];
4509 template[4] = letters[v % 62];
4511 template[5] = letters[v % 62];
4516 /* P is a string that will be used in a symbol. Mask out any characters
4517 that are not valid in that context. */
4520 clean_symbol_name (p)
4525 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4528 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4535 /* Generate a name for a function unique to this translation unit.
4536 TYPE is some string to identify the purpose of this function to the
4537 linker or collect2. */
4540 get_file_function_name_long (type)
4547 if (first_global_object_name)
4548 p = first_global_object_name;
4551 /* We don't have anything that we know to be unique to this translation
4552 unit, so use what we do have and throw in some randomness. */
4554 const char *name = weak_global_object_name;
4555 const char *file = main_input_filename;
4560 file = input_filename;
4562 q = (char *) alloca (7 + strlen (name) + strlen (file));
4564 sprintf (q, "%s%s", name, file);
4565 append_random_chars (q);
4569 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
4572 /* Set up the name of the file-level functions we may need.
4573 Use a global object (which is already required to be unique over
4574 the program) rather than the file name (which imposes extra
4576 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4578 /* Don't need to pull weird characters out of global names. */
4579 if (p != first_global_object_name)
4580 clean_symbol_name (buf + 11);
4582 return get_identifier (buf);
4585 /* If KIND=='I', return a suitable global initializer (constructor) name.
4586 If KIND=='D', return a suitable global clean-up (destructor) name. */
4589 get_file_function_name (kind)
4597 return get_file_function_name_long (p);
4600 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4601 The result is placed in BUFFER (which has length BIT_SIZE),
4602 with one bit in each char ('\000' or '\001').
4604 If the constructor is constant, NULL_TREE is returned.
4605 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4608 get_set_constructor_bits (init, buffer, bit_size)
4615 HOST_WIDE_INT domain_min
4616 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4617 tree non_const_bits = NULL_TREE;
4619 for (i = 0; i < bit_size; i++)
4622 for (vals = TREE_OPERAND (init, 1);
4623 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4625 if (!host_integerp (TREE_VALUE (vals), 0)
4626 || (TREE_PURPOSE (vals) != NULL_TREE
4627 && !host_integerp (TREE_PURPOSE (vals), 0)))
4629 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4630 else if (TREE_PURPOSE (vals) != NULL_TREE)
4632 /* Set a range of bits to ones. */
4633 HOST_WIDE_INT lo_index
4634 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4635 HOST_WIDE_INT hi_index
4636 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4638 if (lo_index < 0 || lo_index >= bit_size
4639 || hi_index < 0 || hi_index >= bit_size)
4641 for (; lo_index <= hi_index; lo_index++)
4642 buffer[lo_index] = 1;
4646 /* Set a single bit to one. */
4648 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4649 if (index < 0 || index >= bit_size)
4651 error ("invalid initializer for bit string");
4657 return non_const_bits;
4660 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4661 The result is placed in BUFFER (which is an array of bytes).
4662 If the constructor is constant, NULL_TREE is returned.
4663 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4666 get_set_constructor_bytes (init, buffer, wd_size)
4668 unsigned char *buffer;
4672 int set_word_size = BITS_PER_UNIT;
4673 int bit_size = wd_size * set_word_size;
4675 unsigned char *bytep = buffer;
4676 char *bit_buffer = (char *) alloca (bit_size);
4677 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4679 for (i = 0; i < wd_size; i++)
4682 for (i = 0; i < bit_size; i++)
4686 if (BYTES_BIG_ENDIAN)
4687 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4689 *bytep |= 1 << bit_pos;
4692 if (bit_pos >= set_word_size)
4693 bit_pos = 0, bytep++;
4695 return non_const_bits;
4698 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4699 /* Complain that the tree code of NODE does not match the expected CODE.
4700 FILE, LINE, and FUNCTION are of the caller. */
4703 tree_check_failed (node, code, file, line, function)
4705 enum tree_code code;
4708 const char *function;
4710 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4711 tree_code_name[code], tree_code_name[TREE_CODE (node)],
4712 function, trim_filename (file), line);
4715 /* Similar to above, except that we check for a class of tree
4716 code, given in CL. */
4719 tree_class_check_failed (node, cl, file, line, function)
4724 const char *function;
4727 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4728 cl, TREE_CODE_CLASS (TREE_CODE (node)),
4729 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
4732 #endif /* ENABLE_TREE_CHECKING */
4734 /* For a new vector type node T, build the information necessary for
4735 debuggint output. */
4738 finish_vector_type (t)
4744 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
4745 tree array = build_array_type (TREE_TYPE (t),
4746 build_index_type (index));
4747 tree rt = make_node (RECORD_TYPE);
4749 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
4750 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
4752 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
4753 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4754 the representation type, and we want to find that die when looking up
4755 the vector type. This is most easily achieved by making the TYPE_UID
4757 TYPE_UID (rt) = TYPE_UID (t);
4761 /* Create nodes for all integer types (and error_mark_node) using the sizes
4762 of C datatypes. The caller should call set_sizetype soon after calling
4763 this function to select one of the types as sizetype. */
4766 build_common_tree_nodes (signed_char)
4769 error_mark_node = make_node (ERROR_MARK);
4770 TREE_TYPE (error_mark_node) = error_mark_node;
4772 initialize_sizetypes ();
4774 /* Define both `signed char' and `unsigned char'. */
4775 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
4776 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
4778 /* Define `char', which is like either `signed char' or `unsigned char'
4779 but not the same as either. */
4782 ? make_signed_type (CHAR_TYPE_SIZE)
4783 : make_unsigned_type (CHAR_TYPE_SIZE));
4785 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
4786 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
4787 integer_type_node = make_signed_type (INT_TYPE_SIZE);
4788 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
4789 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
4790 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
4791 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
4792 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
4794 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
4795 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
4796 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
4797 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
4798 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
4800 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
4801 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
4802 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
4803 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
4804 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
4807 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4808 It will create several other common tree nodes. */
4811 build_common_tree_nodes_2 (short_double)
4814 /* Define these next since types below may used them. */
4815 integer_zero_node = build_int_2 (0, 0);
4816 integer_one_node = build_int_2 (1, 0);
4817 integer_minus_one_node = build_int_2 (-1, -1);
4819 size_zero_node = size_int (0);
4820 size_one_node = size_int (1);
4821 bitsize_zero_node = bitsize_int (0);
4822 bitsize_one_node = bitsize_int (1);
4823 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
4825 void_type_node = make_node (VOID_TYPE);
4826 layout_type (void_type_node);
4828 /* We are not going to have real types in C with less than byte alignment,
4829 so we might as well not have any types that claim to have it. */
4830 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
4831 TYPE_USER_ALIGN (void_type_node) = 0;
4833 null_pointer_node = build_int_2 (0, 0);
4834 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
4835 layout_type (TREE_TYPE (null_pointer_node));
4837 ptr_type_node = build_pointer_type (void_type_node);
4839 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
4841 float_type_node = make_node (REAL_TYPE);
4842 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
4843 layout_type (float_type_node);
4845 double_type_node = make_node (REAL_TYPE);
4847 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
4849 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
4850 layout_type (double_type_node);
4852 long_double_type_node = make_node (REAL_TYPE);
4853 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
4854 layout_type (long_double_type_node);
4856 complex_integer_type_node = make_node (COMPLEX_TYPE);
4857 TREE_TYPE (complex_integer_type_node) = integer_type_node;
4858 layout_type (complex_integer_type_node);
4860 complex_float_type_node = make_node (COMPLEX_TYPE);
4861 TREE_TYPE (complex_float_type_node) = float_type_node;
4862 layout_type (complex_float_type_node);
4864 complex_double_type_node = make_node (COMPLEX_TYPE);
4865 TREE_TYPE (complex_double_type_node) = double_type_node;
4866 layout_type (complex_double_type_node);
4868 complex_long_double_type_node = make_node (COMPLEX_TYPE);
4869 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
4870 layout_type (complex_long_double_type_node);
4874 BUILD_VA_LIST_TYPE (t);
4876 /* Many back-ends define record types without seting TYPE_NAME.
4877 If we copied the record type here, we'd keep the original
4878 record type without a name. This breaks name mangling. So,
4879 don't copy record types and let c_common_nodes_and_builtins()
4880 declare the type to be __builtin_va_list. */
4881 if (TREE_CODE (t) != RECORD_TYPE)
4882 t = build_type_copy (t);
4884 va_list_type_node = t;
4887 unsigned_V4SI_type_node
4888 = make_vector (V4SImode, unsigned_intSI_type_node, 1);
4889 unsigned_V2SI_type_node
4890 = make_vector (V2SImode, unsigned_intSI_type_node, 1);
4891 unsigned_V4HI_type_node
4892 = make_vector (V4HImode, unsigned_intHI_type_node, 1);
4893 unsigned_V8QI_type_node
4894 = make_vector (V8QImode, unsigned_intQI_type_node, 1);
4895 unsigned_V8HI_type_node
4896 = make_vector (V8HImode, unsigned_intHI_type_node, 1);
4897 unsigned_V16QI_type_node
4898 = make_vector (V16QImode, unsigned_intQI_type_node, 1);
4900 V4SF_type_node = make_vector (V4SFmode, float_type_node, 0);
4901 V4SI_type_node = make_vector (V4SImode, intSI_type_node, 0);
4902 V2SI_type_node = make_vector (V2SImode, intSI_type_node, 0);
4903 V4HI_type_node = make_vector (V4HImode, intHI_type_node, 0);
4904 V8QI_type_node = make_vector (V8QImode, intQI_type_node, 0);
4905 V8HI_type_node = make_vector (V8HImode, intHI_type_node, 0);
4906 V2SF_type_node = make_vector (V2SFmode, float_type_node, 0);
4907 V16QI_type_node = make_vector (V16QImode, intQI_type_node, 0);
4910 /* Returns a vector tree node given a vector mode, the inner type, and
4914 make_vector (mode, innertype, unsignedp)
4915 enum machine_mode mode;
4921 t = make_node (VECTOR_TYPE);
4922 TREE_TYPE (t) = innertype;
4923 TYPE_MODE (t) = mode;
4924 TREE_UNSIGNED (TREE_TYPE (t)) = unsignedp;
4925 finish_vector_type (t);