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. */
49 #include "langhooks.h"
51 /* obstack.[ch] explicitly declined to prototype this. */
52 extern int _obstack_allocated_p PARAMS ((struct obstack *h, PTR obj));
54 /* Objects allocated on this obstack last forever. */
56 struct obstack permanent_obstack;
58 #ifdef GATHER_STATISTICS
59 /* Statistics-gathering stuff. */
79 int tree_node_counts[(int) all_kinds];
80 int tree_node_sizes[(int) all_kinds];
82 static const char * const tree_node_kind_names[] = {
98 #endif /* GATHER_STATISTICS */
100 /* Unique id for next decl created. */
101 static int next_decl_uid;
102 /* Unique id for next type created. */
103 static int next_type_uid = 1;
105 /* Since we cannot rehash a type after it is in the table, we have to
106 keep the hash code. */
108 struct type_hash GTY(())
114 /* Initial size of the hash table (rounded to next prime). */
115 #define TYPE_HASH_INITIAL_SIZE 1000
117 /* Now here is the hash table. When recording a type, it is added to
118 the slot whose index is the hash code. Note that the hash table is
119 used for several kinds of types (function types, array types and
120 array index range types, for now). While all these live in the
121 same table, they are completely independent, and the hash code is
122 computed differently for each of these. */
124 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
125 htab_t type_hash_table;
127 static void set_type_quals PARAMS ((tree, int));
128 static void append_random_chars PARAMS ((char *));
129 static int type_hash_eq PARAMS ((const void *, const void *));
130 static unsigned int type_hash_hash PARAMS ((const void *));
131 static void print_type_hash_statistics PARAMS((void));
132 static void finish_vector_type PARAMS((tree));
133 static tree make_vector PARAMS ((enum machine_mode, tree, int));
134 static int type_hash_marked_p PARAMS ((const void *));
136 tree global_trees[TI_MAX];
137 tree integer_types[itk_none];
139 /* Init the principal obstacks. */
144 gcc_obstack_init (&permanent_obstack);
146 /* Initialize the hash table of types. */
147 type_hash_table = htab_create (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
152 /* Allocate SIZE bytes in the permanent obstack
153 and return a pointer to them. */
159 return (char *) obstack_alloc (&permanent_obstack, size);
162 /* Allocate NELEM items of SIZE bytes in the permanent obstack
163 and return a pointer to them. The storage is cleared before
164 returning the value. */
167 perm_calloc (nelem, size)
171 char *rval = (char *) obstack_alloc (&permanent_obstack, nelem * size);
172 memset (rval, 0, nelem * size);
176 /* The name of the object as the assembler will see it (but before any
177 translations made by ASM_OUTPUT_LABELREF). Often this is the same
178 as DECL_NAME. It is an IDENTIFIER_NODE. */
180 decl_assembler_name (decl)
183 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
184 (*lang_hooks.set_decl_assembler_name) (decl);
185 return DECL_CHECK (decl)->decl.assembler_name;
188 /* Compute the number of bytes occupied by 'node'. This routine only
189 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
194 enum tree_code code = TREE_CODE (node);
196 switch (TREE_CODE_CLASS (code))
198 case 'd': /* A decl node */
199 return sizeof (struct tree_decl);
201 case 't': /* a type node */
202 return sizeof (struct tree_type);
204 case 'b': /* a lexical block node */
205 return sizeof (struct tree_block);
207 case 'r': /* a reference */
208 case 'e': /* an expression */
209 case 's': /* an expression with side effects */
210 case '<': /* a comparison expression */
211 case '1': /* a unary arithmetic expression */
212 case '2': /* a binary arithmetic expression */
213 return (sizeof (struct tree_exp)
214 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
216 case 'c': /* a constant */
217 /* We can't use TREE_CODE_LENGTH for INTEGER_CST, since the number of
218 words is machine-dependent due to varying length of HOST_WIDE_INT,
219 which might be wider than a pointer (e.g., long long). Similarly
220 for REAL_CST, since the number of words is machine-dependent due
221 to varying size and alignment of `double'. */
222 if (code == INTEGER_CST)
223 return sizeof (struct tree_int_cst);
224 else if (code == REAL_CST)
225 return sizeof (struct tree_real_cst);
227 return (sizeof (struct tree_common)
228 + TREE_CODE_LENGTH (code) * sizeof (char *));
230 case 'x': /* something random, like an identifier. */
233 length = (sizeof (struct tree_common)
234 + TREE_CODE_LENGTH (code) * sizeof (char *));
235 if (code == TREE_VEC)
236 length += (TREE_VEC_LENGTH (node) - 1) * sizeof (char *);
245 /* Return a newly allocated node of code CODE.
246 For decl and type nodes, some other fields are initialized.
247 The rest of the node is initialized to zero.
249 Achoo! I got a code in the node. */
256 int type = TREE_CODE_CLASS (code);
258 #ifdef GATHER_STATISTICS
261 struct tree_common ttmp;
263 /* We can't allocate a TREE_VEC without knowing how many elements
265 if (code == TREE_VEC)
268 TREE_SET_CODE ((tree)&ttmp, code);
269 length = tree_size ((tree)&ttmp);
271 #ifdef GATHER_STATISTICS
274 case 'd': /* A decl node */
278 case 't': /* a type node */
282 case 'b': /* a lexical block */
286 case 's': /* an expression with side effects */
290 case 'r': /* a reference */
294 case 'e': /* an expression */
295 case '<': /* a comparison expression */
296 case '1': /* a unary arithmetic expression */
297 case '2': /* a binary arithmetic expression */
301 case 'c': /* a constant */
305 case 'x': /* something random, like an identifier. */
306 if (code == IDENTIFIER_NODE)
308 else if (code == TREE_VEC)
318 tree_node_counts[(int) kind]++;
319 tree_node_sizes[(int) kind] += length;
322 t = ggc_alloc_tree (length);
324 memset ((PTR) t, 0, length);
326 TREE_SET_CODE (t, code);
331 TREE_SIDE_EFFECTS (t) = 1;
332 TREE_TYPE (t) = void_type_node;
336 if (code != FUNCTION_DECL)
338 DECL_USER_ALIGN (t) = 0;
339 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
340 DECL_SOURCE_LINE (t) = lineno;
341 DECL_SOURCE_FILE (t) =
342 (input_filename) ? input_filename : "<built-in>";
343 DECL_UID (t) = next_decl_uid++;
345 /* We have not yet computed the alias set for this declaration. */
346 DECL_POINTER_ALIAS_SET (t) = -1;
350 TYPE_UID (t) = next_type_uid++;
351 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
352 TYPE_USER_ALIGN (t) = 0;
353 TYPE_MAIN_VARIANT (t) = t;
355 /* Default to no attributes for type, but let target change that. */
356 TYPE_ATTRIBUTES (t) = NULL_TREE;
357 (*targetm.set_default_type_attributes) (t);
359 /* We have not yet computed the alias set for this type. */
360 TYPE_ALIAS_SET (t) = -1;
364 TREE_CONSTANT (t) = 1;
374 case PREDECREMENT_EXPR:
375 case PREINCREMENT_EXPR:
376 case POSTDECREMENT_EXPR:
377 case POSTINCREMENT_EXPR:
378 /* All of these have side-effects, no matter what their
380 TREE_SIDE_EFFECTS (t) = 1;
392 /* Return a new node with the same contents as NODE except that its
393 TREE_CHAIN is zero and it has a fresh uid. */
400 enum tree_code code = TREE_CODE (node);
403 length = tree_size (node);
404 t = ggc_alloc_tree (length);
405 memcpy (t, node, length);
408 TREE_ASM_WRITTEN (t) = 0;
410 if (TREE_CODE_CLASS (code) == 'd')
411 DECL_UID (t) = next_decl_uid++;
412 else if (TREE_CODE_CLASS (code) == 't')
414 TYPE_UID (t) = next_type_uid++;
415 /* The following is so that the debug code for
416 the copy is different from the original type.
417 The two statements usually duplicate each other
418 (because they clear fields of the same union),
419 but the optimizer should catch that. */
420 TYPE_SYMTAB_POINTER (t) = 0;
421 TYPE_SYMTAB_ADDRESS (t) = 0;
427 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
428 For example, this can copy a list made of TREE_LIST nodes. */
440 head = prev = copy_node (list);
441 next = TREE_CHAIN (list);
444 TREE_CHAIN (prev) = copy_node (next);
445 prev = TREE_CHAIN (prev);
446 next = TREE_CHAIN (next);
452 /* Return a newly constructed INTEGER_CST node whose constant value
453 is specified by the two ints LOW and HI.
454 The TREE_TYPE is set to `int'.
456 This function should be used via the `build_int_2' macro. */
459 build_int_2_wide (low, hi)
460 unsigned HOST_WIDE_INT low;
463 tree t = make_node (INTEGER_CST);
465 TREE_INT_CST_LOW (t) = low;
466 TREE_INT_CST_HIGH (t) = hi;
467 TREE_TYPE (t) = integer_type_node;
471 /* Return a new VECTOR_CST node whose type is TYPE and whose values
472 are in a list pointed by VALS. */
475 build_vector (type, vals)
478 tree v = make_node (VECTOR_CST);
479 int over1 = 0, over2 = 0;
482 TREE_VECTOR_CST_ELTS (v) = vals;
483 TREE_TYPE (v) = type;
485 /* Iterate through elements and check for overflow. */
486 for (link = vals; link; link = TREE_CHAIN (link))
488 tree value = TREE_VALUE (link);
490 over1 |= TREE_OVERFLOW (value);
491 over2 |= TREE_CONSTANT_OVERFLOW (value);
494 TREE_OVERFLOW (v) = over1;
495 TREE_CONSTANT_OVERFLOW (v) = over2;
500 /* Return a new REAL_CST node whose type is TYPE and value is D. */
511 /* Check for valid float value for this type on this target machine;
512 if not, can print error message and store a valid value in D. */
513 #ifdef CHECK_FLOAT_VALUE
514 CHECK_FLOAT_VALUE (TYPE_MODE (type), d, overflow);
517 v = make_node (REAL_CST);
518 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
519 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
521 TREE_TYPE (v) = type;
522 TREE_REAL_CST_PTR (v) = dp;
523 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
527 /* Return a new REAL_CST node whose type is TYPE
528 and whose value is the integer value of the INTEGER_CST node I. */
531 real_value_from_int_cst (type, i)
532 tree type ATTRIBUTE_UNUSED, i;
536 /* Clear all bits of the real value type so that we can later do
537 bitwise comparisons to see if two values are the same. */
538 memset ((char *) &d, 0, sizeof d);
540 if (! TREE_UNSIGNED (TREE_TYPE (i)))
541 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
544 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
545 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
549 /* Given a tree representing an integer constant I, return a tree
550 representing the same value as a floating-point constant of type TYPE. */
553 build_real_from_int_cst (type, i)
558 int overflow = TREE_OVERFLOW (i);
560 v = build_real (type, real_value_from_int_cst (type, i));
562 TREE_OVERFLOW (v) |= overflow;
563 TREE_CONSTANT_OVERFLOW (v) |= overflow;
567 /* Return a newly constructed STRING_CST node whose value is
568 the LEN characters at STR.
569 The TREE_TYPE is not initialized. */
572 build_string (len, str)
576 tree s = make_node (STRING_CST);
578 TREE_STRING_LENGTH (s) = len;
579 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
584 /* Return a newly constructed COMPLEX_CST node whose value is
585 specified by the real and imaginary parts REAL and IMAG.
586 Both REAL and IMAG should be constant nodes. TYPE, if specified,
587 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
590 build_complex (type, real, imag)
594 tree t = make_node (COMPLEX_CST);
596 TREE_REALPART (t) = real;
597 TREE_IMAGPART (t) = imag;
598 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
599 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
600 TREE_CONSTANT_OVERFLOW (t)
601 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
605 /* Build a newly constructed TREE_VEC node of length LEN. */
612 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
614 #ifdef GATHER_STATISTICS
615 tree_node_counts[(int) vec_kind]++;
616 tree_node_sizes[(int) vec_kind] += length;
619 t = ggc_alloc_tree (length);
621 memset ((PTR) t, 0, length);
622 TREE_SET_CODE (t, TREE_VEC);
623 TREE_VEC_LENGTH (t) = len;
628 /* Return 1 if EXPR is the integer constant zero or a complex constant
637 return ((TREE_CODE (expr) == INTEGER_CST
638 && ! TREE_CONSTANT_OVERFLOW (expr)
639 && TREE_INT_CST_LOW (expr) == 0
640 && TREE_INT_CST_HIGH (expr) == 0)
641 || (TREE_CODE (expr) == COMPLEX_CST
642 && integer_zerop (TREE_REALPART (expr))
643 && integer_zerop (TREE_IMAGPART (expr))));
646 /* Return 1 if EXPR is the integer constant one or the corresponding
655 return ((TREE_CODE (expr) == INTEGER_CST
656 && ! TREE_CONSTANT_OVERFLOW (expr)
657 && TREE_INT_CST_LOW (expr) == 1
658 && TREE_INT_CST_HIGH (expr) == 0)
659 || (TREE_CODE (expr) == COMPLEX_CST
660 && integer_onep (TREE_REALPART (expr))
661 && integer_zerop (TREE_IMAGPART (expr))));
664 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
665 it contains. Likewise for the corresponding complex constant. */
668 integer_all_onesp (expr)
676 if (TREE_CODE (expr) == COMPLEX_CST
677 && integer_all_onesp (TREE_REALPART (expr))
678 && integer_zerop (TREE_IMAGPART (expr)))
681 else if (TREE_CODE (expr) != INTEGER_CST
682 || TREE_CONSTANT_OVERFLOW (expr))
685 uns = TREE_UNSIGNED (TREE_TYPE (expr));
687 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
688 && TREE_INT_CST_HIGH (expr) == -1);
690 /* Note that using TYPE_PRECISION here is wrong. We care about the
691 actual bits, not the (arbitrary) range of the type. */
692 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
693 if (prec >= HOST_BITS_PER_WIDE_INT)
695 HOST_WIDE_INT high_value;
698 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
700 if (shift_amount > HOST_BITS_PER_WIDE_INT)
701 /* Can not handle precisions greater than twice the host int size. */
703 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
704 /* Shifting by the host word size is undefined according to the ANSI
705 standard, so we must handle this as a special case. */
708 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
710 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
711 && TREE_INT_CST_HIGH (expr) == high_value);
714 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
717 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
725 HOST_WIDE_INT high, low;
729 if (TREE_CODE (expr) == COMPLEX_CST
730 && integer_pow2p (TREE_REALPART (expr))
731 && integer_zerop (TREE_IMAGPART (expr)))
734 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
737 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
738 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
739 high = TREE_INT_CST_HIGH (expr);
740 low = TREE_INT_CST_LOW (expr);
742 /* First clear all bits that are beyond the type's precision in case
743 we've been sign extended. */
745 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
747 else if (prec > HOST_BITS_PER_WIDE_INT)
748 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
752 if (prec < HOST_BITS_PER_WIDE_INT)
753 low &= ~((HOST_WIDE_INT) (-1) << prec);
756 if (high == 0 && low == 0)
759 return ((high == 0 && (low & (low - 1)) == 0)
760 || (low == 0 && (high & (high - 1)) == 0));
763 /* Return the power of two represented by a tree node known to be a
771 HOST_WIDE_INT high, low;
775 if (TREE_CODE (expr) == COMPLEX_CST)
776 return tree_log2 (TREE_REALPART (expr));
778 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
779 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
781 high = TREE_INT_CST_HIGH (expr);
782 low = TREE_INT_CST_LOW (expr);
784 /* First clear all bits that are beyond the type's precision in case
785 we've been sign extended. */
787 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
789 else if (prec > HOST_BITS_PER_WIDE_INT)
790 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
794 if (prec < HOST_BITS_PER_WIDE_INT)
795 low &= ~((HOST_WIDE_INT) (-1) << prec);
798 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
802 /* Similar, but return the largest integer Y such that 2 ** Y is less
803 than or equal to EXPR. */
806 tree_floor_log2 (expr)
810 HOST_WIDE_INT high, low;
814 if (TREE_CODE (expr) == COMPLEX_CST)
815 return tree_log2 (TREE_REALPART (expr));
817 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
818 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
820 high = TREE_INT_CST_HIGH (expr);
821 low = TREE_INT_CST_LOW (expr);
823 /* First clear all bits that are beyond the type's precision in case
824 we've been sign extended. Ignore if type's precision hasn't been set
825 since what we are doing is setting it. */
827 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
829 else if (prec > HOST_BITS_PER_WIDE_INT)
830 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
834 if (prec < HOST_BITS_PER_WIDE_INT)
835 low &= ~((HOST_WIDE_INT) (-1) << prec);
838 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
842 /* Return 1 if EXPR is the real constant zero. */
850 return ((TREE_CODE (expr) == REAL_CST
851 && ! TREE_CONSTANT_OVERFLOW (expr)
852 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
853 || (TREE_CODE (expr) == COMPLEX_CST
854 && real_zerop (TREE_REALPART (expr))
855 && real_zerop (TREE_IMAGPART (expr))));
858 /* Return 1 if EXPR is the real constant one in real or complex form. */
866 return ((TREE_CODE (expr) == REAL_CST
867 && ! TREE_CONSTANT_OVERFLOW (expr)
868 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
869 || (TREE_CODE (expr) == COMPLEX_CST
870 && real_onep (TREE_REALPART (expr))
871 && real_zerop (TREE_IMAGPART (expr))));
874 /* Return 1 if EXPR is the real constant two. */
882 return ((TREE_CODE (expr) == REAL_CST
883 && ! TREE_CONSTANT_OVERFLOW (expr)
884 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
885 || (TREE_CODE (expr) == COMPLEX_CST
886 && real_twop (TREE_REALPART (expr))
887 && real_zerop (TREE_IMAGPART (expr))));
890 /* Return 1 if EXPR is the real constant minus one. */
893 real_minus_onep (expr)
898 return ((TREE_CODE (expr) == REAL_CST
899 && ! TREE_CONSTANT_OVERFLOW (expr)
900 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
901 || (TREE_CODE (expr) == COMPLEX_CST
902 && real_minus_onep (TREE_REALPART (expr))
903 && real_zerop (TREE_IMAGPART (expr))));
906 /* Nonzero if EXP is a constant or a cast of a constant. */
909 really_constant_p (exp)
912 /* This is not quite the same as STRIP_NOPS. It does more. */
913 while (TREE_CODE (exp) == NOP_EXPR
914 || TREE_CODE (exp) == CONVERT_EXPR
915 || TREE_CODE (exp) == NON_LVALUE_EXPR)
916 exp = TREE_OPERAND (exp, 0);
917 return TREE_CONSTANT (exp);
920 /* Return first list element whose TREE_VALUE is ELEM.
921 Return 0 if ELEM is not in LIST. */
924 value_member (elem, list)
929 if (elem == TREE_VALUE (list))
931 list = TREE_CHAIN (list);
936 /* Return first list element whose TREE_PURPOSE is ELEM.
937 Return 0 if ELEM is not in LIST. */
940 purpose_member (elem, list)
945 if (elem == TREE_PURPOSE (list))
947 list = TREE_CHAIN (list);
952 /* Return first list element whose BINFO_TYPE is ELEM.
953 Return 0 if ELEM is not in LIST. */
956 binfo_member (elem, list)
961 if (elem == BINFO_TYPE (list))
963 list = TREE_CHAIN (list);
968 /* Return nonzero if ELEM is part of the chain CHAIN. */
971 chain_member (elem, chain)
978 chain = TREE_CHAIN (chain);
984 /* Return nonzero if ELEM is equal to TREE_VALUE (CHAIN) for any piece of
985 chain CHAIN. This and the next function are currently unused, but
986 are retained for completeness. */
989 chain_member_value (elem, chain)
994 if (elem == TREE_VALUE (chain))
996 chain = TREE_CHAIN (chain);
1002 /* Return nonzero if ELEM is equal to TREE_PURPOSE (CHAIN)
1003 for any piece of chain CHAIN. */
1006 chain_member_purpose (elem, chain)
1011 if (elem == TREE_PURPOSE (chain))
1013 chain = TREE_CHAIN (chain);
1019 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1020 We expect a null pointer to mark the end of the chain.
1021 This is the Lisp primitive `length'. */
1030 for (tail = t; tail; tail = TREE_CHAIN (tail))
1036 /* Returns the number of FIELD_DECLs in TYPE. */
1039 fields_length (type)
1042 tree t = TYPE_FIELDS (type);
1045 for (; t; t = TREE_CHAIN (t))
1046 if (TREE_CODE (t) == FIELD_DECL)
1052 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1053 by modifying the last node in chain 1 to point to chain 2.
1054 This is the Lisp primitive `nconc'. */
1064 #ifdef ENABLE_TREE_CHECKING
1068 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1070 TREE_CHAIN (t1) = op2;
1071 #ifdef ENABLE_TREE_CHECKING
1072 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1074 abort (); /* Circularity created. */
1082 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1090 while ((next = TREE_CHAIN (chain)))
1095 /* Reverse the order of elements in the chain T,
1096 and return the new head of the chain (old last element). */
1102 tree prev = 0, decl, next;
1103 for (decl = t; decl; decl = next)
1105 next = TREE_CHAIN (decl);
1106 TREE_CHAIN (decl) = prev;
1112 /* Given a chain CHAIN of tree nodes,
1113 construct and return a list of those nodes. */
1119 tree result = NULL_TREE;
1120 tree in_tail = chain;
1121 tree out_tail = NULL_TREE;
1125 tree next = tree_cons (NULL_TREE, in_tail, NULL_TREE);
1127 TREE_CHAIN (out_tail) = next;
1131 in_tail = TREE_CHAIN (in_tail);
1137 /* Return a newly created TREE_LIST node whose
1138 purpose and value fields are PARM and VALUE. */
1141 build_tree_list (parm, value)
1144 tree t = make_node (TREE_LIST);
1145 TREE_PURPOSE (t) = parm;
1146 TREE_VALUE (t) = value;
1150 /* Return a newly created TREE_LIST node whose
1151 purpose and value fields are PARM and VALUE
1152 and whose TREE_CHAIN is CHAIN. */
1155 tree_cons (purpose, value, chain)
1156 tree purpose, value, chain;
1160 node = ggc_alloc_tree (sizeof (struct tree_list));
1162 memset (node, 0, sizeof (struct tree_common));
1164 #ifdef GATHER_STATISTICS
1165 tree_node_counts[(int) x_kind]++;
1166 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1169 TREE_SET_CODE (node, TREE_LIST);
1170 TREE_CHAIN (node) = chain;
1171 TREE_PURPOSE (node) = purpose;
1172 TREE_VALUE (node) = value;
1177 /* Return the size nominally occupied by an object of type TYPE
1178 when it resides in memory. The value is measured in units of bytes,
1179 and its data type is that normally used for type sizes
1180 (which is the first type created by make_signed_type or
1181 make_unsigned_type). */
1184 size_in_bytes (type)
1189 if (type == error_mark_node)
1190 return integer_zero_node;
1192 type = TYPE_MAIN_VARIANT (type);
1193 t = TYPE_SIZE_UNIT (type);
1197 (*lang_hooks.types.incomplete_type_error) (NULL_TREE, type);
1198 return size_zero_node;
1201 if (TREE_CODE (t) == INTEGER_CST)
1202 force_fit_type (t, 0);
1207 /* Return the size of TYPE (in bytes) as a wide integer
1208 or return -1 if the size can vary or is larger than an integer. */
1211 int_size_in_bytes (type)
1216 if (type == error_mark_node)
1219 type = TYPE_MAIN_VARIANT (type);
1220 t = TYPE_SIZE_UNIT (type);
1222 || TREE_CODE (t) != INTEGER_CST
1223 || TREE_OVERFLOW (t)
1224 || TREE_INT_CST_HIGH (t) != 0
1225 /* If the result would appear negative, it's too big to represent. */
1226 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1229 return TREE_INT_CST_LOW (t);
1232 /* Return the bit position of FIELD, in bits from the start of the record.
1233 This is a tree of type bitsizetype. */
1236 bit_position (field)
1240 return bit_from_pos (DECL_FIELD_OFFSET (field),
1241 DECL_FIELD_BIT_OFFSET (field));
1244 /* Likewise, but return as an integer. Abort if it cannot be represented
1245 in that way (since it could be a signed value, we don't have the option
1246 of returning -1 like int_size_in_byte can. */
1249 int_bit_position (field)
1252 return tree_low_cst (bit_position (field), 0);
1255 /* Return the byte position of FIELD, in bytes from the start of the record.
1256 This is a tree of type sizetype. */
1259 byte_position (field)
1262 return byte_from_pos (DECL_FIELD_OFFSET (field),
1263 DECL_FIELD_BIT_OFFSET (field));
1266 /* Likewise, but return as an integer. Abort if it cannot be represented
1267 in that way (since it could be a signed value, we don't have the option
1268 of returning -1 like int_size_in_byte can. */
1271 int_byte_position (field)
1274 return tree_low_cst (byte_position (field), 0);
1277 /* Return the strictest alignment, in bits, that T is known to have. */
1283 unsigned int align0, align1;
1285 switch (TREE_CODE (t))
1287 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1288 /* If we have conversions, we know that the alignment of the
1289 object must meet each of the alignments of the types. */
1290 align0 = expr_align (TREE_OPERAND (t, 0));
1291 align1 = TYPE_ALIGN (TREE_TYPE (t));
1292 return MAX (align0, align1);
1294 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1295 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1296 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1297 /* These don't change the alignment of an object. */
1298 return expr_align (TREE_OPERAND (t, 0));
1301 /* The best we can do is say that the alignment is the least aligned
1303 align0 = expr_align (TREE_OPERAND (t, 1));
1304 align1 = expr_align (TREE_OPERAND (t, 2));
1305 return MIN (align0, align1);
1307 case LABEL_DECL: case CONST_DECL:
1308 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1309 if (DECL_ALIGN (t) != 0)
1310 return DECL_ALIGN (t);
1314 return FUNCTION_BOUNDARY;
1320 /* Otherwise take the alignment from that of the type. */
1321 return TYPE_ALIGN (TREE_TYPE (t));
1324 /* Return, as a tree node, the number of elements for TYPE (which is an
1325 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1328 array_type_nelts (type)
1331 tree index_type, min, max;
1333 /* If they did it with unspecified bounds, then we should have already
1334 given an error about it before we got here. */
1335 if (! TYPE_DOMAIN (type))
1336 return error_mark_node;
1338 index_type = TYPE_DOMAIN (type);
1339 min = TYPE_MIN_VALUE (index_type);
1340 max = TYPE_MAX_VALUE (index_type);
1342 return (integer_zerop (min)
1344 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1347 /* Return nonzero if arg is static -- a reference to an object in
1348 static storage. This is not the same as the C meaning of `static'. */
1354 switch (TREE_CODE (arg))
1357 /* Nested functions aren't static, since taking their address
1358 involves a trampoline. */
1359 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1360 && ! DECL_NON_ADDR_CONST_P (arg));
1363 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1364 && ! DECL_THREAD_LOCAL (arg)
1365 && ! DECL_NON_ADDR_CONST_P (arg));
1368 return TREE_STATIC (arg);
1374 /* If we are referencing a bitfield, we can't evaluate an
1375 ADDR_EXPR at compile time and so it isn't a constant. */
1377 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1378 && staticp (TREE_OPERAND (arg, 0)));
1384 /* This case is technically correct, but results in setting
1385 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1388 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1392 case ARRAY_RANGE_REF:
1393 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1394 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1395 return staticp (TREE_OPERAND (arg, 0));
1398 if ((unsigned int) TREE_CODE (arg)
1399 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1400 return (*lang_hooks.staticp) (arg);
1406 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1407 Do this to any expression which may be used in more than one place,
1408 but must be evaluated only once.
1410 Normally, expand_expr would reevaluate the expression each time.
1411 Calling save_expr produces something that is evaluated and recorded
1412 the first time expand_expr is called on it. Subsequent calls to
1413 expand_expr just reuse the recorded value.
1415 The call to expand_expr that generates code that actually computes
1416 the value is the first call *at compile time*. Subsequent calls
1417 *at compile time* generate code to use the saved value.
1418 This produces correct result provided that *at run time* control
1419 always flows through the insns made by the first expand_expr
1420 before reaching the other places where the save_expr was evaluated.
1421 You, the caller of save_expr, must make sure this is so.
1423 Constants, and certain read-only nodes, are returned with no
1424 SAVE_EXPR because that is safe. Expressions containing placeholders
1425 are not touched; see tree.def for an explanation of what these
1432 tree t = fold (expr);
1435 /* We don't care about whether this can be used as an lvalue in this
1437 while (TREE_CODE (t) == NON_LVALUE_EXPR)
1438 t = TREE_OPERAND (t, 0);
1440 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1441 a constant, it will be more efficient to not make another SAVE_EXPR since
1442 it will allow better simplification and GCSE will be able to merge the
1443 computations if they actualy occur. */
1445 (TREE_CODE_CLASS (TREE_CODE (inner)) == '1'
1446 || (TREE_CODE_CLASS (TREE_CODE (inner)) == '2'
1447 && TREE_CONSTANT (TREE_OPERAND (inner, 1))));
1448 inner = TREE_OPERAND (inner, 0))
1451 /* If the tree evaluates to a constant, then we don't want to hide that
1452 fact (i.e. this allows further folding, and direct checks for constants).
1453 However, a read-only object that has side effects cannot be bypassed.
1454 Since it is no problem to reevaluate literals, we just return the
1456 if (TREE_CONSTANT (inner)
1457 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1458 || TREE_CODE (inner) == SAVE_EXPR || TREE_CODE (inner) == ERROR_MARK)
1461 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1462 it means that the size or offset of some field of an object depends on
1463 the value within another field.
1465 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1466 and some variable since it would then need to be both evaluated once and
1467 evaluated more than once. Front-ends must assure this case cannot
1468 happen by surrounding any such subexpressions in their own SAVE_EXPR
1469 and forcing evaluation at the proper time. */
1470 if (contains_placeholder_p (t))
1473 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1475 /* This expression might be placed ahead of a jump to ensure that the
1476 value was computed on both sides of the jump. So make sure it isn't
1477 eliminated as dead. */
1478 TREE_SIDE_EFFECTS (t) = 1;
1479 TREE_READONLY (t) = 1;
1483 /* Arrange for an expression to be expanded multiple independent
1484 times. This is useful for cleanup actions, as the backend can
1485 expand them multiple times in different places. */
1493 /* If this is already protected, no sense in protecting it again. */
1494 if (TREE_CODE (expr) == UNSAVE_EXPR)
1497 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1498 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1502 /* Returns the index of the first non-tree operand for CODE, or the number
1503 of operands if all are trees. */
1507 enum tree_code code;
1513 case GOTO_SUBROUTINE_EXPR:
1516 case WITH_CLEANUP_EXPR:
1518 case METHOD_CALL_EXPR:
1521 return TREE_CODE_LENGTH (code);
1525 /* Return which tree structure is used by T. */
1527 enum tree_node_structure_enum
1528 tree_node_structure (t)
1531 enum tree_code code = TREE_CODE (t);
1533 switch (TREE_CODE_CLASS (code))
1535 case 'd': return TS_DECL;
1536 case 't': return TS_TYPE;
1537 case 'b': return TS_BLOCK;
1538 case 'r': case '<': case '1': case '2': case 'e': case 's':
1540 default: /* 'c' and 'x' */
1546 case INTEGER_CST: return TS_INT_CST;
1547 case REAL_CST: return TS_REAL_CST;
1548 case COMPLEX_CST: return TS_COMPLEX;
1549 case VECTOR_CST: return TS_VECTOR;
1550 case STRING_CST: return TS_STRING;
1552 case ERROR_MARK: return TS_COMMON;
1553 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1554 case TREE_LIST: return TS_LIST;
1555 case TREE_VEC: return TS_VEC;
1556 case PLACEHOLDER_EXPR: return TS_COMMON;
1563 /* Perform any modifications to EXPR required when it is unsaved. Does
1564 not recurse into EXPR's subtrees. */
1567 unsave_expr_1 (expr)
1570 switch (TREE_CODE (expr))
1573 if (! SAVE_EXPR_PERSISTENT_P (expr))
1574 SAVE_EXPR_RTL (expr) = 0;
1578 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1579 It's OK for this to happen if it was part of a subtree that
1580 isn't immediately expanded, such as operand 2 of another
1582 if (TREE_OPERAND (expr, 1))
1585 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1586 TREE_OPERAND (expr, 3) = NULL_TREE;
1590 /* I don't yet know how to emit a sequence multiple times. */
1591 if (RTL_EXPR_SEQUENCE (expr) != 0)
1600 /* Default lang hook for "unsave_expr_now". */
1603 lhd_unsave_expr_now (expr)
1606 enum tree_code code;
1608 /* There's nothing to do for NULL_TREE. */
1612 unsave_expr_1 (expr);
1614 code = TREE_CODE (expr);
1615 switch (TREE_CODE_CLASS (code))
1617 case 'c': /* a constant */
1618 case 't': /* a type node */
1619 case 'd': /* A decl node */
1620 case 'b': /* A block node */
1623 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1624 if (code == TREE_LIST)
1626 lhd_unsave_expr_now (TREE_VALUE (expr));
1627 lhd_unsave_expr_now (TREE_CHAIN (expr));
1631 case 'e': /* an expression */
1632 case 'r': /* a reference */
1633 case 's': /* an expression with side effects */
1634 case '<': /* a comparison expression */
1635 case '2': /* a binary arithmetic expression */
1636 case '1': /* a unary arithmetic expression */
1640 for (i = first_rtl_op (code) - 1; i >= 0; i--)
1641 lhd_unsave_expr_now (TREE_OPERAND (expr, i));
1652 /* Return 0 if it is safe to evaluate EXPR multiple times,
1653 return 1 if it is safe if EXPR is unsaved afterward, or
1654 return 2 if it is completely unsafe.
1656 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1657 an expression tree, so that it safe to unsave them and the surrounding
1658 context will be correct.
1660 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1661 occasionally across the whole of a function. It is therefore only
1662 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1663 below the UNSAVE_EXPR.
1665 RTL_EXPRs consume their rtl during evaluation. It is therefore
1666 never possible to unsave them. */
1669 unsafe_for_reeval (expr)
1673 enum tree_code code;
1678 if (expr == NULL_TREE)
1681 code = TREE_CODE (expr);
1682 first_rtl = first_rtl_op (code);
1691 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1693 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1694 unsafeness = MAX (tmp, unsafeness);
1700 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1701 return MAX (tmp, 1);
1708 tmp = (*lang_hooks.unsafe_for_reeval) (expr);
1714 switch (TREE_CODE_CLASS (code))
1716 case 'c': /* a constant */
1717 case 't': /* a type node */
1718 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1719 case 'd': /* A decl node */
1720 case 'b': /* A block node */
1723 case 'e': /* an expression */
1724 case 'r': /* a reference */
1725 case 's': /* an expression with side effects */
1726 case '<': /* a comparison expression */
1727 case '2': /* a binary arithmetic expression */
1728 case '1': /* a unary arithmetic expression */
1729 for (i = first_rtl - 1; i >= 0; i--)
1731 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1732 unsafeness = MAX (tmp, unsafeness);
1742 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1743 or offset that depends on a field within a record. */
1746 contains_placeholder_p (exp)
1749 enum tree_code code;
1755 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1756 in it since it is supplying a value for it. */
1757 code = TREE_CODE (exp);
1758 if (code == WITH_RECORD_EXPR)
1760 else if (code == PLACEHOLDER_EXPR)
1763 switch (TREE_CODE_CLASS (code))
1766 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1767 position computations since they will be converted into a
1768 WITH_RECORD_EXPR involving the reference, which will assume
1769 here will be valid. */
1770 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1773 if (code == TREE_LIST)
1774 return (contains_placeholder_p (TREE_VALUE (exp))
1775 || (TREE_CHAIN (exp) != 0
1776 && contains_placeholder_p (TREE_CHAIN (exp))));
1785 /* Ignoring the first operand isn't quite right, but works best. */
1786 return contains_placeholder_p (TREE_OPERAND (exp, 1));
1793 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1794 || contains_placeholder_p (TREE_OPERAND (exp, 1))
1795 || contains_placeholder_p (TREE_OPERAND (exp, 2)));
1798 /* If we already know this doesn't have a placeholder, don't
1800 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1803 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1804 result = contains_placeholder_p (TREE_OPERAND (exp, 0));
1806 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1811 return (TREE_OPERAND (exp, 1) != 0
1812 && contains_placeholder_p (TREE_OPERAND (exp, 1)));
1818 switch (TREE_CODE_LENGTH (code))
1821 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1823 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1824 || contains_placeholder_p (TREE_OPERAND (exp, 1)));
1835 /* Return 1 if EXP contains any expressions that produce cleanups for an
1836 outer scope to deal with. Used by fold. */
1844 if (! TREE_SIDE_EFFECTS (exp))
1847 switch (TREE_CODE (exp))
1850 case GOTO_SUBROUTINE_EXPR:
1851 case WITH_CLEANUP_EXPR:
1854 case CLEANUP_POINT_EXPR:
1858 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1860 cmp = has_cleanups (TREE_VALUE (exp));
1870 /* This general rule works for most tree codes. All exceptions should be
1871 handled above. If this is a language-specific tree code, we can't
1872 trust what might be in the operand, so say we don't know
1874 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1877 nops = first_rtl_op (TREE_CODE (exp));
1878 for (i = 0; i < nops; i++)
1879 if (TREE_OPERAND (exp, i) != 0)
1881 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1882 if (type == 'e' || type == '<' || type == '1' || type == '2'
1883 || type == 'r' || type == 's')
1885 cmp = has_cleanups (TREE_OPERAND (exp, i));
1894 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1895 return a tree with all occurrences of references to F in a
1896 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1897 contains only arithmetic expressions or a CALL_EXPR with a
1898 PLACEHOLDER_EXPR occurring only in its arglist. */
1901 substitute_in_expr (exp, f, r)
1906 enum tree_code code = TREE_CODE (exp);
1911 switch (TREE_CODE_CLASS (code))
1918 if (code == PLACEHOLDER_EXPR)
1920 else if (code == TREE_LIST)
1922 op0 = (TREE_CHAIN (exp) == 0
1923 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
1924 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
1925 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1928 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1937 switch (TREE_CODE_LENGTH (code))
1940 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1941 if (op0 == TREE_OPERAND (exp, 0))
1944 if (code == NON_LVALUE_EXPR)
1947 new = fold (build1 (code, TREE_TYPE (exp), op0));
1951 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
1952 could, but we don't support it. */
1953 if (code == RTL_EXPR)
1955 else if (code == CONSTRUCTOR)
1958 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1959 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
1960 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1963 new = fold (build (code, TREE_TYPE (exp), op0, op1));
1967 /* It cannot be that anything inside a SAVE_EXPR contains a
1968 PLACEHOLDER_EXPR. */
1969 if (code == SAVE_EXPR)
1972 else if (code == CALL_EXPR)
1974 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
1975 if (op1 == TREE_OPERAND (exp, 1))
1978 return build (code, TREE_TYPE (exp),
1979 TREE_OPERAND (exp, 0), op1, NULL_TREE);
1982 else if (code != COND_EXPR)
1985 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1986 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
1987 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
1988 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1989 && op2 == TREE_OPERAND (exp, 2))
1992 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2005 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2006 and it is the right field, replace it with R. */
2007 for (inner = TREE_OPERAND (exp, 0);
2008 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2009 inner = TREE_OPERAND (inner, 0))
2011 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2012 && TREE_OPERAND (exp, 1) == f)
2015 /* If this expression hasn't been completed let, leave it
2017 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2018 && TREE_TYPE (inner) == 0)
2021 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2022 if (op0 == TREE_OPERAND (exp, 0))
2025 new = fold (build (code, TREE_TYPE (exp), op0,
2026 TREE_OPERAND (exp, 1)));
2030 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2031 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2032 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2033 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2034 && op2 == TREE_OPERAND (exp, 2))
2037 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2042 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2043 if (op0 == TREE_OPERAND (exp, 0))
2046 new = fold (build1 (code, TREE_TYPE (exp), op0));
2058 TREE_READONLY (new) = TREE_READONLY (exp);
2062 /* Stabilize a reference so that we can use it any number of times
2063 without causing its operands to be evaluated more than once.
2064 Returns the stabilized reference. This works by means of save_expr,
2065 so see the caveats in the comments about save_expr.
2067 Also allows conversion expressions whose operands are references.
2068 Any other kind of expression is returned unchanged. */
2071 stabilize_reference (ref)
2075 enum tree_code code = TREE_CODE (ref);
2082 /* No action is needed in this case. */
2088 case FIX_TRUNC_EXPR:
2089 case FIX_FLOOR_EXPR:
2090 case FIX_ROUND_EXPR:
2092 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2096 result = build_nt (INDIRECT_REF,
2097 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2101 result = build_nt (COMPONENT_REF,
2102 stabilize_reference (TREE_OPERAND (ref, 0)),
2103 TREE_OPERAND (ref, 1));
2107 result = build_nt (BIT_FIELD_REF,
2108 stabilize_reference (TREE_OPERAND (ref, 0)),
2109 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2110 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2114 result = build_nt (ARRAY_REF,
2115 stabilize_reference (TREE_OPERAND (ref, 0)),
2116 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2119 case ARRAY_RANGE_REF:
2120 result = build_nt (ARRAY_RANGE_REF,
2121 stabilize_reference (TREE_OPERAND (ref, 0)),
2122 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2126 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2127 it wouldn't be ignored. This matters when dealing with
2129 return stabilize_reference_1 (ref);
2132 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2133 save_expr (build1 (ADDR_EXPR,
2134 build_pointer_type (TREE_TYPE (ref)),
2138 /* If arg isn't a kind of lvalue we recognize, make no change.
2139 Caller should recognize the error for an invalid lvalue. */
2144 return error_mark_node;
2147 TREE_TYPE (result) = TREE_TYPE (ref);
2148 TREE_READONLY (result) = TREE_READONLY (ref);
2149 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2150 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2155 /* Subroutine of stabilize_reference; this is called for subtrees of
2156 references. Any expression with side-effects must be put in a SAVE_EXPR
2157 to ensure that it is only evaluated once.
2159 We don't put SAVE_EXPR nodes around everything, because assigning very
2160 simple expressions to temporaries causes us to miss good opportunities
2161 for optimizations. Among other things, the opportunity to fold in the
2162 addition of a constant into an addressing mode often gets lost, e.g.
2163 "y[i+1] += x;". In general, we take the approach that we should not make
2164 an assignment unless we are forced into it - i.e., that any non-side effect
2165 operator should be allowed, and that cse should take care of coalescing
2166 multiple utterances of the same expression should that prove fruitful. */
2169 stabilize_reference_1 (e)
2173 enum tree_code code = TREE_CODE (e);
2175 /* We cannot ignore const expressions because it might be a reference
2176 to a const array but whose index contains side-effects. But we can
2177 ignore things that are actual constant or that already have been
2178 handled by this function. */
2180 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2183 switch (TREE_CODE_CLASS (code))
2193 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2194 so that it will only be evaluated once. */
2195 /* The reference (r) and comparison (<) classes could be handled as
2196 below, but it is generally faster to only evaluate them once. */
2197 if (TREE_SIDE_EFFECTS (e))
2198 return save_expr (e);
2202 /* Constants need no processing. In fact, we should never reach
2207 /* Division is slow and tends to be compiled with jumps,
2208 especially the division by powers of 2 that is often
2209 found inside of an array reference. So do it just once. */
2210 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2211 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2212 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2213 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2214 return save_expr (e);
2215 /* Recursively stabilize each operand. */
2216 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2217 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2221 /* Recursively stabilize each operand. */
2222 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2229 TREE_TYPE (result) = TREE_TYPE (e);
2230 TREE_READONLY (result) = TREE_READONLY (e);
2231 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2232 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2237 /* Low-level constructors for expressions. */
2239 /* Build an expression of code CODE, data type TYPE,
2240 and operands as specified by the arguments ARG1 and following arguments.
2241 Expressions and reference nodes can be created this way.
2242 Constants, decls, types and misc nodes cannot be. */
2245 build VPARAMS ((enum tree_code code, tree tt, ...))
2254 VA_FIXEDARG (p, enum tree_code, code);
2255 VA_FIXEDARG (p, tree, tt);
2257 t = make_node (code);
2258 length = TREE_CODE_LENGTH (code);
2261 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2262 result based on those same flags for the arguments. But if the
2263 arguments aren't really even `tree' expressions, we shouldn't be trying
2265 fro = first_rtl_op (code);
2267 /* Expressions without side effects may be constant if their
2268 arguments are as well. */
2269 constant = (TREE_CODE_CLASS (code) == '<'
2270 || TREE_CODE_CLASS (code) == '1'
2271 || TREE_CODE_CLASS (code) == '2'
2272 || TREE_CODE_CLASS (code) == 'c');
2276 /* This is equivalent to the loop below, but faster. */
2277 tree arg0 = va_arg (p, tree);
2278 tree arg1 = va_arg (p, tree);
2280 TREE_OPERAND (t, 0) = arg0;
2281 TREE_OPERAND (t, 1) = arg1;
2282 TREE_READONLY (t) = 1;
2283 if (arg0 && fro > 0)
2285 if (TREE_SIDE_EFFECTS (arg0))
2286 TREE_SIDE_EFFECTS (t) = 1;
2287 if (!TREE_READONLY (arg0))
2288 TREE_READONLY (t) = 0;
2289 if (!TREE_CONSTANT (arg0))
2293 if (arg1 && fro > 1)
2295 if (TREE_SIDE_EFFECTS (arg1))
2296 TREE_SIDE_EFFECTS (t) = 1;
2297 if (!TREE_READONLY (arg1))
2298 TREE_READONLY (t) = 0;
2299 if (!TREE_CONSTANT (arg1))
2303 else if (length == 1)
2305 tree arg0 = va_arg (p, tree);
2307 /* The only one-operand cases we handle here are those with side-effects.
2308 Others are handled with build1. So don't bother checked if the
2309 arg has side-effects since we'll already have set it.
2311 ??? This really should use build1 too. */
2312 if (TREE_CODE_CLASS (code) != 's')
2314 TREE_OPERAND (t, 0) = arg0;
2318 for (i = 0; i < length; i++)
2320 tree operand = va_arg (p, tree);
2322 TREE_OPERAND (t, i) = operand;
2323 if (operand && fro > i)
2325 if (TREE_SIDE_EFFECTS (operand))
2326 TREE_SIDE_EFFECTS (t) = 1;
2327 if (!TREE_CONSTANT (operand))
2334 TREE_CONSTANT (t) = constant;
2338 /* Same as above, but only builds for unary operators.
2339 Saves lions share of calls to `build'; cuts down use
2340 of varargs, which is expensive for RISC machines. */
2343 build1 (code, type, node)
2344 enum tree_code code;
2349 #ifdef GATHER_STATISTICS
2350 tree_node_kind kind;
2354 #ifdef GATHER_STATISTICS
2355 if (TREE_CODE_CLASS (code) == 'r')
2361 #ifdef ENABLE_CHECKING
2362 if (TREE_CODE_CLASS (code) == '2'
2363 || TREE_CODE_CLASS (code) == '<'
2364 || TREE_CODE_LENGTH (code) != 1)
2366 #endif /* ENABLE_CHECKING */
2368 length = sizeof (struct tree_exp);
2370 t = ggc_alloc_tree (length);
2372 memset ((PTR) t, 0, sizeof (struct tree_common));
2374 #ifdef GATHER_STATISTICS
2375 tree_node_counts[(int) kind]++;
2376 tree_node_sizes[(int) kind] += length;
2379 TREE_SET_CODE (t, code);
2381 TREE_TYPE (t) = type;
2382 TREE_COMPLEXITY (t) = 0;
2383 TREE_OPERAND (t, 0) = node;
2384 if (node && first_rtl_op (code) != 0)
2386 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2387 TREE_READONLY (t) = TREE_READONLY (node);
2396 case PREDECREMENT_EXPR:
2397 case PREINCREMENT_EXPR:
2398 case POSTDECREMENT_EXPR:
2399 case POSTINCREMENT_EXPR:
2400 /* All of these have side-effects, no matter what their
2402 TREE_SIDE_EFFECTS (t) = 1;
2403 TREE_READONLY (t) = 0;
2407 /* Whether a dereference is readonly has nothing to do with whether
2408 its operand is readonly. */
2409 TREE_READONLY (t) = 0;
2413 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2414 TREE_CONSTANT (t) = 1;
2421 /* Similar except don't specify the TREE_TYPE
2422 and leave the TREE_SIDE_EFFECTS as 0.
2423 It is permissible for arguments to be null,
2424 or even garbage if their values do not matter. */
2427 build_nt VPARAMS ((enum tree_code code, ...))
2434 VA_FIXEDARG (p, enum tree_code, code);
2436 t = make_node (code);
2437 length = TREE_CODE_LENGTH (code);
2439 for (i = 0; i < length; i++)
2440 TREE_OPERAND (t, i) = va_arg (p, tree);
2446 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2447 We do NOT enter this node in any sort of symbol table.
2449 layout_decl is used to set up the decl's storage layout.
2450 Other slots are initialized to 0 or null pointers. */
2453 build_decl (code, name, type)
2454 enum tree_code code;
2459 t = make_node (code);
2461 /* if (type == error_mark_node)
2462 type = integer_type_node; */
2463 /* That is not done, deliberately, so that having error_mark_node
2464 as the type can suppress useless errors in the use of this variable. */
2466 DECL_NAME (t) = name;
2467 TREE_TYPE (t) = type;
2469 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2471 else if (code == FUNCTION_DECL)
2472 DECL_MODE (t) = FUNCTION_MODE;
2477 /* BLOCK nodes are used to represent the structure of binding contours
2478 and declarations, once those contours have been exited and their contents
2479 compiled. This information is used for outputting debugging info. */
2482 build_block (vars, tags, subblocks, supercontext, chain)
2483 tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain;
2485 tree block = make_node (BLOCK);
2487 BLOCK_VARS (block) = vars;
2488 BLOCK_SUBBLOCKS (block) = subblocks;
2489 BLOCK_SUPERCONTEXT (block) = supercontext;
2490 BLOCK_CHAIN (block) = chain;
2494 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2495 location where an expression or an identifier were encountered. It
2496 is necessary for languages where the frontend parser will handle
2497 recursively more than one file (Java is one of them). */
2500 build_expr_wfl (node, file, line, col)
2505 static const char *last_file = 0;
2506 static tree last_filenode = NULL_TREE;
2507 tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2509 EXPR_WFL_NODE (wfl) = node;
2510 EXPR_WFL_SET_LINECOL (wfl, line, col);
2511 if (file != last_file)
2514 last_filenode = file ? get_identifier (file) : NULL_TREE;
2517 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2520 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2521 TREE_TYPE (wfl) = TREE_TYPE (node);
2527 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2531 build_decl_attribute_variant (ddecl, attribute)
2532 tree ddecl, attribute;
2534 DECL_ATTRIBUTES (ddecl) = attribute;
2538 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2541 Record such modified types already made so we don't make duplicates. */
2544 build_type_attribute_variant (ttype, attribute)
2545 tree ttype, attribute;
2547 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2549 unsigned int hashcode;
2552 ntype = copy_node (ttype);
2554 TYPE_POINTER_TO (ntype) = 0;
2555 TYPE_REFERENCE_TO (ntype) = 0;
2556 TYPE_ATTRIBUTES (ntype) = attribute;
2558 /* Create a new main variant of TYPE. */
2559 TYPE_MAIN_VARIANT (ntype) = ntype;
2560 TYPE_NEXT_VARIANT (ntype) = 0;
2561 set_type_quals (ntype, TYPE_UNQUALIFIED);
2563 hashcode = (TYPE_HASH (TREE_CODE (ntype))
2564 + TYPE_HASH (TREE_TYPE (ntype))
2565 + attribute_hash_list (attribute));
2567 switch (TREE_CODE (ntype))
2570 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2573 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2576 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2579 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2585 ntype = type_hash_canon (hashcode, ntype);
2586 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2592 /* Default value of targetm.comp_type_attributes that always returns 1. */
2595 default_comp_type_attributes (type1, type2)
2596 tree type1 ATTRIBUTE_UNUSED;
2597 tree type2 ATTRIBUTE_UNUSED;
2602 /* Default version of targetm.set_default_type_attributes that always does
2606 default_set_default_type_attributes (type)
2607 tree type ATTRIBUTE_UNUSED;
2611 /* Default version of targetm.insert_attributes that always does nothing. */
2613 default_insert_attributes (decl, attr_ptr)
2614 tree decl ATTRIBUTE_UNUSED;
2615 tree *attr_ptr ATTRIBUTE_UNUSED;
2619 /* Default value of targetm.function_attribute_inlinable_p that always
2622 default_function_attribute_inlinable_p (fndecl)
2623 tree fndecl ATTRIBUTE_UNUSED;
2625 /* By default, functions with machine attributes cannot be inlined. */
2629 /* Default value of targetm.ms_bitfield_layout_p that always returns
2632 default_ms_bitfield_layout_p (record)
2633 tree record ATTRIBUTE_UNUSED;
2635 /* By default, GCC does not use the MS VC++ bitfield layout rules. */
2639 /* Return non-zero if IDENT is a valid name for attribute ATTR,
2642 We try both `text' and `__text__', ATTR may be either one. */
2643 /* ??? It might be a reasonable simplification to require ATTR to be only
2644 `text'. One might then also require attribute lists to be stored in
2645 their canonicalized form. */
2648 is_attribute_p (attr, ident)
2652 int ident_len, attr_len;
2655 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2658 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2661 p = IDENTIFIER_POINTER (ident);
2662 ident_len = strlen (p);
2663 attr_len = strlen (attr);
2665 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2669 || attr[attr_len - 2] != '_'
2670 || attr[attr_len - 1] != '_')
2672 if (ident_len == attr_len - 4
2673 && strncmp (attr + 2, p, attr_len - 4) == 0)
2678 if (ident_len == attr_len + 4
2679 && p[0] == '_' && p[1] == '_'
2680 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2681 && strncmp (attr, p + 2, attr_len) == 0)
2688 /* Given an attribute name and a list of attributes, return a pointer to the
2689 attribute's list element if the attribute is part of the list, or NULL_TREE
2690 if not found. If the attribute appears more than once, this only
2691 returns the first occurrence; the TREE_CHAIN of the return value should
2692 be passed back in if further occurrences are wanted. */
2695 lookup_attribute (attr_name, list)
2696 const char *attr_name;
2701 for (l = list; l; l = TREE_CHAIN (l))
2703 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2705 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2712 /* Return an attribute list that is the union of a1 and a2. */
2715 merge_attributes (a1, a2)
2720 /* Either one unset? Take the set one. */
2722 if ((attributes = a1) == 0)
2725 /* One that completely contains the other? Take it. */
2727 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2729 if (attribute_list_contained (a2, a1))
2733 /* Pick the longest list, and hang on the other list. */
2735 if (list_length (a1) < list_length (a2))
2736 attributes = a2, a2 = a1;
2738 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2741 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2744 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2747 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2752 a1 = copy_node (a2);
2753 TREE_CHAIN (a1) = attributes;
2762 /* Given types T1 and T2, merge their attributes and return
2766 merge_type_attributes (t1, t2)
2769 return merge_attributes (TYPE_ATTRIBUTES (t1),
2770 TYPE_ATTRIBUTES (t2));
2773 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2777 merge_decl_attributes (olddecl, newdecl)
2778 tree olddecl, newdecl;
2780 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2781 DECL_ATTRIBUTES (newdecl));
2784 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2786 /* Specialization of merge_decl_attributes for various Windows targets.
2788 This handles the following situation:
2790 __declspec (dllimport) int foo;
2793 The second instance of `foo' nullifies the dllimport. */
2796 merge_dllimport_decl_attributes (old, new)
2801 int delete_dllimport_p;
2803 old = DECL_ATTRIBUTES (old);
2804 new = DECL_ATTRIBUTES (new);
2806 /* What we need to do here is remove from `old' dllimport if it doesn't
2807 appear in `new'. dllimport behaves like extern: if a declaration is
2808 marked dllimport and a definition appears later, then the object
2809 is not dllimport'd. */
2810 if (lookup_attribute ("dllimport", old) != NULL_TREE
2811 && lookup_attribute ("dllimport", new) == NULL_TREE)
2812 delete_dllimport_p = 1;
2814 delete_dllimport_p = 0;
2816 a = merge_attributes (old, new);
2818 if (delete_dllimport_p)
2822 /* Scan the list for dllimport and delete it. */
2823 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
2825 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
2827 if (prev == NULL_TREE)
2830 TREE_CHAIN (prev) = TREE_CHAIN (t);
2839 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2841 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2842 of the various TYPE_QUAL values. */
2845 set_type_quals (type, type_quals)
2849 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
2850 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
2851 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
2854 /* Return a version of the TYPE, qualified as indicated by the
2855 TYPE_QUALS, if one exists. If no qualified version exists yet,
2856 return NULL_TREE. */
2859 get_qualified_type (type, type_quals)
2865 /* Search the chain of variants to see if there is already one there just
2866 like the one we need to have. If so, use that existing one. We must
2867 preserve the TYPE_NAME, since there is code that depends on this. */
2868 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2869 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type))
2875 /* Like get_qualified_type, but creates the type if it does not
2876 exist. This function never returns NULL_TREE. */
2879 build_qualified_type (type, type_quals)
2885 /* See if we already have the appropriate qualified variant. */
2886 t = get_qualified_type (type, type_quals);
2888 /* If not, build it. */
2891 t = build_type_copy (type);
2892 set_type_quals (t, type_quals);
2898 /* Create a new variant of TYPE, equivalent but distinct.
2899 This is so the caller can modify it. */
2902 build_type_copy (type)
2905 tree t, m = TYPE_MAIN_VARIANT (type);
2907 t = copy_node (type);
2909 TYPE_POINTER_TO (t) = 0;
2910 TYPE_REFERENCE_TO (t) = 0;
2912 /* Add this type to the chain of variants of TYPE. */
2913 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
2914 TYPE_NEXT_VARIANT (m) = t;
2919 /* Hashing of types so that we don't make duplicates.
2920 The entry point is `type_hash_canon'. */
2922 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2923 with types in the TREE_VALUE slots), by adding the hash codes
2924 of the individual types. */
2927 type_hash_list (list)
2930 unsigned int hashcode;
2933 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
2934 hashcode += TYPE_HASH (TREE_VALUE (tail));
2939 /* These are the Hashtable callback functions. */
2941 /* Returns true if the types are equal. */
2944 type_hash_eq (va, vb)
2948 const struct type_hash *a = va, *b = vb;
2949 if (a->hash == b->hash
2950 && TREE_CODE (a->type) == TREE_CODE (b->type)
2951 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
2952 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
2953 TYPE_ATTRIBUTES (b->type))
2954 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
2955 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
2956 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
2957 TYPE_MAX_VALUE (b->type)))
2958 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
2959 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
2960 TYPE_MIN_VALUE (b->type)))
2961 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
2962 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
2963 || (TYPE_DOMAIN (a->type)
2964 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
2965 && TYPE_DOMAIN (b->type)
2966 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
2967 && type_list_equal (TYPE_DOMAIN (a->type),
2968 TYPE_DOMAIN (b->type)))))
2973 /* Return the cached hash value. */
2976 type_hash_hash (item)
2979 return ((const struct type_hash *) item)->hash;
2982 /* Look in the type hash table for a type isomorphic to TYPE.
2983 If one is found, return it. Otherwise return 0. */
2986 type_hash_lookup (hashcode, type)
2987 unsigned int hashcode;
2990 struct type_hash *h, in;
2992 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
2993 must call that routine before comparing TYPE_ALIGNs. */
2999 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3005 /* Add an entry to the type-hash-table
3006 for a type TYPE whose hash code is HASHCODE. */
3009 type_hash_add (hashcode, type)
3010 unsigned int hashcode;
3013 struct type_hash *h;
3016 h = (struct type_hash *) ggc_alloc (sizeof (struct type_hash));
3019 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3020 *(struct type_hash **) loc = h;
3023 /* Given TYPE, and HASHCODE its hash code, return the canonical
3024 object for an identical type if one already exists.
3025 Otherwise, return TYPE, and record it as the canonical object
3026 if it is a permanent object.
3028 To use this function, first create a type of the sort you want.
3029 Then compute its hash code from the fields of the type that
3030 make it different from other similar types.
3031 Then call this function and use the value.
3032 This function frees the type you pass in if it is a duplicate. */
3034 /* Set to 1 to debug without canonicalization. Never set by program. */
3035 int debug_no_type_hash = 0;
3038 type_hash_canon (hashcode, type)
3039 unsigned int hashcode;
3044 if (debug_no_type_hash)
3047 /* See if the type is in the hash table already. If so, return it.
3048 Otherwise, add the type. */
3049 t1 = type_hash_lookup (hashcode, type);
3052 #ifdef GATHER_STATISTICS
3053 tree_node_counts[(int) t_kind]--;
3054 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3060 type_hash_add (hashcode, type);
3065 /* See if the data pointed to by the type hash table is marked. We consider
3066 it marked if the type is marked or if a debug type number or symbol
3067 table entry has been made for the type. This reduces the amount of
3068 debugging output and eliminates that dependency of the debug output on
3069 the number of garbage collections. */
3072 type_hash_marked_p (p)
3075 tree type = ((struct type_hash *) p)->type;
3077 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3081 print_type_hash_statistics ()
3083 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3084 (long) htab_size (type_hash_table),
3085 (long) htab_elements (type_hash_table),
3086 htab_collisions (type_hash_table));
3089 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3090 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3091 by adding the hash codes of the individual attributes. */
3094 attribute_hash_list (list)
3097 unsigned int hashcode;
3100 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3101 /* ??? Do we want to add in TREE_VALUE too? */
3102 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3106 /* Given two lists of attributes, return true if list l2 is
3107 equivalent to l1. */
3110 attribute_list_equal (l1, l2)
3113 return attribute_list_contained (l1, l2)
3114 && attribute_list_contained (l2, l1);
3117 /* Given two lists of attributes, return true if list L2 is
3118 completely contained within L1. */
3119 /* ??? This would be faster if attribute names were stored in a canonicalized
3120 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3121 must be used to show these elements are equivalent (which they are). */
3122 /* ??? It's not clear that attributes with arguments will always be handled
3126 attribute_list_contained (l1, l2)
3131 /* First check the obvious, maybe the lists are identical. */
3135 /* Maybe the lists are similar. */
3136 for (t1 = l1, t2 = l2;
3138 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3139 && TREE_VALUE (t1) == TREE_VALUE (t2);
3140 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3142 /* Maybe the lists are equal. */
3143 if (t1 == 0 && t2 == 0)
3146 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3149 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3151 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3154 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3161 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3168 /* Given two lists of types
3169 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3170 return 1 if the lists contain the same types in the same order.
3171 Also, the TREE_PURPOSEs must match. */
3174 type_list_equal (l1, l2)
3179 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3180 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3181 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3182 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3183 && (TREE_TYPE (TREE_PURPOSE (t1))
3184 == TREE_TYPE (TREE_PURPOSE (t2))))))
3190 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3191 given by TYPE. If the argument list accepts variable arguments,
3192 then this function counts only the ordinary arguments. */
3195 type_num_arguments (type)
3201 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3202 /* If the function does not take a variable number of arguments,
3203 the last element in the list will have type `void'. */
3204 if (VOID_TYPE_P (TREE_VALUE (t)))
3212 /* Nonzero if integer constants T1 and T2
3213 represent the same constant value. */
3216 tree_int_cst_equal (t1, t2)
3222 if (t1 == 0 || t2 == 0)
3225 if (TREE_CODE (t1) == INTEGER_CST
3226 && TREE_CODE (t2) == INTEGER_CST
3227 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3228 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3234 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3235 The precise way of comparison depends on their data type. */
3238 tree_int_cst_lt (t1, t2)
3244 if (TREE_UNSIGNED (TREE_TYPE (t1)) != TREE_UNSIGNED (TREE_TYPE (t2)))
3246 int t1_sgn = tree_int_cst_sgn (t1);
3247 int t2_sgn = tree_int_cst_sgn (t2);
3249 if (t1_sgn < t2_sgn)
3251 else if (t1_sgn > t2_sgn)
3253 /* Otherwise, both are non-negative, so we compare them as
3254 unsigned just in case one of them would overflow a signed
3257 else if (! TREE_UNSIGNED (TREE_TYPE (t1)))
3258 return INT_CST_LT (t1, t2);
3260 return INT_CST_LT_UNSIGNED (t1, t2);
3263 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3266 tree_int_cst_compare (t1, t2)
3270 if (tree_int_cst_lt (t1, t2))
3272 else if (tree_int_cst_lt (t2, t1))
3278 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3279 the host. If POS is zero, the value can be represented in a single
3280 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3281 be represented in a single unsigned HOST_WIDE_INT. */
3284 host_integerp (t, pos)
3288 return (TREE_CODE (t) == INTEGER_CST
3289 && ! TREE_OVERFLOW (t)
3290 && ((TREE_INT_CST_HIGH (t) == 0
3291 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3292 || (! pos && TREE_INT_CST_HIGH (t) == -1
3293 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3294 && ! TREE_UNSIGNED (TREE_TYPE (t)))
3295 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3298 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3299 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3300 be positive. Abort if we cannot satisfy the above conditions. */
3303 tree_low_cst (t, pos)
3307 if (host_integerp (t, pos))
3308 return TREE_INT_CST_LOW (t);
3313 /* Return the most significant bit of the integer constant T. */
3316 tree_int_cst_msb (t)
3321 unsigned HOST_WIDE_INT l;
3323 /* Note that using TYPE_PRECISION here is wrong. We care about the
3324 actual bits, not the (arbitrary) range of the type. */
3325 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3326 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3327 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3328 return (l & 1) == 1;
3331 /* Return an indication of the sign of the integer constant T.
3332 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3333 Note that -1 will never be returned it T's type is unsigned. */
3336 tree_int_cst_sgn (t)
3339 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3341 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3343 else if (TREE_INT_CST_HIGH (t) < 0)
3349 /* Compare two constructor-element-type constants. Return 1 if the lists
3350 are known to be equal; otherwise return 0. */
3353 simple_cst_list_equal (l1, l2)
3356 while (l1 != NULL_TREE && l2 != NULL_TREE)
3358 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3361 l1 = TREE_CHAIN (l1);
3362 l2 = TREE_CHAIN (l2);
3368 /* Return truthvalue of whether T1 is the same tree structure as T2.
3369 Return 1 if they are the same.
3370 Return 0 if they are understandably different.
3371 Return -1 if either contains tree structure not understood by
3375 simple_cst_equal (t1, t2)
3378 enum tree_code code1, code2;
3384 if (t1 == 0 || t2 == 0)
3387 code1 = TREE_CODE (t1);
3388 code2 = TREE_CODE (t2);
3390 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3392 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3393 || code2 == NON_LVALUE_EXPR)
3394 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3396 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3399 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3400 || code2 == NON_LVALUE_EXPR)
3401 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3409 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3410 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3413 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3416 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3417 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3418 TREE_STRING_LENGTH (t1)));
3421 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3427 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3430 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3434 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3437 /* Special case: if either target is an unallocated VAR_DECL,
3438 it means that it's going to be unified with whatever the
3439 TARGET_EXPR is really supposed to initialize, so treat it
3440 as being equivalent to anything. */
3441 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3442 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3443 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3444 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3445 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3446 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3449 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3454 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3456 case WITH_CLEANUP_EXPR:
3457 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3461 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3464 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3465 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3479 /* This general rule works for most tree codes. All exceptions should be
3480 handled above. If this is a language-specific tree code, we can't
3481 trust what might be in the operand, so say we don't know
3483 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3486 switch (TREE_CODE_CLASS (code1))
3495 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3497 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3509 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3510 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3511 than U, respectively. */
3514 compare_tree_int (t, u)
3516 unsigned HOST_WIDE_INT u;
3518 if (tree_int_cst_sgn (t) < 0)
3520 else if (TREE_INT_CST_HIGH (t) != 0)
3522 else if (TREE_INT_CST_LOW (t) == u)
3524 else if (TREE_INT_CST_LOW (t) < u)
3530 /* Constructors for pointer, array and function types.
3531 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3532 constructed by language-dependent code, not here.) */
3534 /* Construct, lay out and return the type of pointers to TO_TYPE.
3535 If such a type has already been constructed, reuse it. */
3538 build_pointer_type (to_type)
3541 tree t = TYPE_POINTER_TO (to_type);
3543 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3548 /* We need a new one. */
3549 t = make_node (POINTER_TYPE);
3551 TREE_TYPE (t) = to_type;
3553 /* Record this type as the pointer to TO_TYPE. */
3554 TYPE_POINTER_TO (to_type) = t;
3556 /* Lay out the type. This function has many callers that are concerned
3557 with expression-construction, and this simplifies them all.
3558 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3564 /* Build the node for the type of references-to-TO_TYPE. */
3567 build_reference_type (to_type)
3570 tree t = TYPE_REFERENCE_TO (to_type);
3572 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3577 /* We need a new one. */
3578 t = make_node (REFERENCE_TYPE);
3580 TREE_TYPE (t) = to_type;
3582 /* Record this type as the pointer to TO_TYPE. */
3583 TYPE_REFERENCE_TO (to_type) = t;
3590 /* Build a type that is compatible with t but has no cv quals anywhere
3593 const char *const *const * -> char ***. */
3596 build_type_no_quals (t)
3599 switch (TREE_CODE (t))
3602 return build_pointer_type (build_type_no_quals (TREE_TYPE (t)));
3603 case REFERENCE_TYPE:
3604 return build_reference_type (build_type_no_quals (TREE_TYPE (t)));
3606 return TYPE_MAIN_VARIANT (t);
3610 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3611 MAXVAL should be the maximum value in the domain
3612 (one less than the length of the array).
3614 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3615 We don't enforce this limit, that is up to caller (e.g. language front end).
3616 The limit exists because the result is a signed type and we don't handle
3617 sizes that use more than one HOST_WIDE_INT. */
3620 build_index_type (maxval)
3623 tree itype = make_node (INTEGER_TYPE);
3625 TREE_TYPE (itype) = sizetype;
3626 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3627 TYPE_MIN_VALUE (itype) = size_zero_node;
3628 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3629 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3630 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3631 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
3632 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3633 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
3635 if (host_integerp (maxval, 1))
3636 return type_hash_canon (tree_low_cst (maxval, 1), itype);
3641 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3642 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3643 low bound LOWVAL and high bound HIGHVAL.
3644 if TYPE==NULL_TREE, sizetype is used. */
3647 build_range_type (type, lowval, highval)
3648 tree type, lowval, highval;
3650 tree itype = make_node (INTEGER_TYPE);
3652 TREE_TYPE (itype) = type;
3653 if (type == NULL_TREE)
3656 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3657 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
3659 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3660 TYPE_MODE (itype) = TYPE_MODE (type);
3661 TYPE_SIZE (itype) = TYPE_SIZE (type);
3662 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
3663 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3664 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
3666 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
3667 return type_hash_canon (tree_low_cst (highval, 0)
3668 - tree_low_cst (lowval, 0),
3674 /* Just like build_index_type, but takes lowval and highval instead
3675 of just highval (maxval). */
3678 build_index_2_type (lowval, highval)
3679 tree lowval, highval;
3681 return build_range_type (sizetype, lowval, highval);
3684 /* Return nonzero iff ITYPE1 and ITYPE2 are equal (in the LISP sense).
3685 Needed because when index types are not hashed, equal index types
3686 built at different times appear distinct, even though structurally,
3690 index_type_equal (itype1, itype2)
3691 tree itype1, itype2;
3693 if (TREE_CODE (itype1) != TREE_CODE (itype2))
3696 if (TREE_CODE (itype1) == INTEGER_TYPE)
3698 if (TYPE_PRECISION (itype1) != TYPE_PRECISION (itype2)
3699 || TYPE_MODE (itype1) != TYPE_MODE (itype2)
3700 || simple_cst_equal (TYPE_SIZE (itype1), TYPE_SIZE (itype2)) != 1
3701 || TYPE_ALIGN (itype1) != TYPE_ALIGN (itype2))
3704 if (1 == simple_cst_equal (TYPE_MIN_VALUE (itype1),
3705 TYPE_MIN_VALUE (itype2))
3706 && 1 == simple_cst_equal (TYPE_MAX_VALUE (itype1),
3707 TYPE_MAX_VALUE (itype2)))
3714 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3715 and number of elements specified by the range of values of INDEX_TYPE.
3716 If such a type has already been constructed, reuse it. */
3719 build_array_type (elt_type, index_type)
3720 tree elt_type, index_type;
3723 unsigned int hashcode;
3725 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3727 error ("arrays of functions are not meaningful");
3728 elt_type = integer_type_node;
3731 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3732 build_pointer_type (elt_type);
3734 /* Allocate the array after the pointer type,
3735 in case we free it in type_hash_canon. */
3736 t = make_node (ARRAY_TYPE);
3737 TREE_TYPE (t) = elt_type;
3738 TYPE_DOMAIN (t) = index_type;
3740 if (index_type == 0)
3745 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3746 t = type_hash_canon (hashcode, t);
3748 if (!COMPLETE_TYPE_P (t))
3753 /* Return the TYPE of the elements comprising
3754 the innermost dimension of ARRAY. */
3757 get_inner_array_type (array)
3760 tree type = TREE_TYPE (array);
3762 while (TREE_CODE (type) == ARRAY_TYPE)
3763 type = TREE_TYPE (type);
3768 /* Construct, lay out and return
3769 the type of functions returning type VALUE_TYPE
3770 given arguments of types ARG_TYPES.
3771 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3772 are data type nodes for the arguments of the function.
3773 If such a type has already been constructed, reuse it. */
3776 build_function_type (value_type, arg_types)
3777 tree value_type, arg_types;
3780 unsigned int hashcode;
3782 if (TREE_CODE (value_type) == FUNCTION_TYPE)
3784 error ("function return type cannot be function");
3785 value_type = integer_type_node;
3788 /* Make a node of the sort we want. */
3789 t = make_node (FUNCTION_TYPE);
3790 TREE_TYPE (t) = value_type;
3791 TYPE_ARG_TYPES (t) = arg_types;
3793 /* If we already have such a type, use the old one and free this one. */
3794 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
3795 t = type_hash_canon (hashcode, t);
3797 if (!COMPLETE_TYPE_P (t))
3802 /* Build a function type. The RETURN_TYPE is the type retured by the
3803 function. If additional arguments are provided, they are
3804 additional argument types. The list of argument types must always
3805 be terminated by NULL_TREE. */
3808 build_function_type_list VPARAMS ((tree return_type, ...))
3812 VA_OPEN (p, return_type);
3813 VA_FIXEDARG (p, tree, return_type);
3815 t = va_arg (p, tree);
3816 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
3817 args = tree_cons (NULL_TREE, t, args);
3820 args = nreverse (args);
3821 TREE_CHAIN (last) = void_list_node;
3822 args = build_function_type (return_type, args);
3828 /* Construct, lay out and return the type of methods belonging to class
3829 BASETYPE and whose arguments and values are described by TYPE.
3830 If that type exists already, reuse it.
3831 TYPE must be a FUNCTION_TYPE node. */
3834 build_method_type (basetype, type)
3835 tree basetype, type;
3838 unsigned int hashcode;
3840 /* Make a node of the sort we want. */
3841 t = make_node (METHOD_TYPE);
3843 if (TREE_CODE (type) != FUNCTION_TYPE)
3846 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3847 TREE_TYPE (t) = TREE_TYPE (type);
3849 /* The actual arglist for this function includes a "hidden" argument
3850 which is "this". Put it into the list of argument types. */
3853 = tree_cons (NULL_TREE,
3854 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
3856 /* If we already have such a type, use the old one and free this one. */
3857 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3858 t = type_hash_canon (hashcode, t);
3860 if (!COMPLETE_TYPE_P (t))
3866 /* Construct, lay out and return the type of offsets to a value
3867 of type TYPE, within an object of type BASETYPE.
3868 If a suitable offset type exists already, reuse it. */
3871 build_offset_type (basetype, type)
3872 tree basetype, type;
3875 unsigned int hashcode;
3877 /* Make a node of the sort we want. */
3878 t = make_node (OFFSET_TYPE);
3880 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3881 TREE_TYPE (t) = type;
3883 /* If we already have such a type, use the old one and free this one. */
3884 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3885 t = type_hash_canon (hashcode, t);
3887 if (!COMPLETE_TYPE_P (t))
3893 /* Create a complex type whose components are COMPONENT_TYPE. */
3896 build_complex_type (component_type)
3897 tree component_type;
3900 unsigned int hashcode;
3902 /* Make a node of the sort we want. */
3903 t = make_node (COMPLEX_TYPE);
3905 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
3906 set_type_quals (t, TYPE_QUALS (component_type));
3908 /* If we already have such a type, use the old one and free this one. */
3909 hashcode = TYPE_HASH (component_type);
3910 t = type_hash_canon (hashcode, t);
3912 if (!COMPLETE_TYPE_P (t))
3915 /* If we are writing Dwarf2 output we need to create a name,
3916 since complex is a fundamental type. */
3917 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
3921 if (component_type == char_type_node)
3922 name = "complex char";
3923 else if (component_type == signed_char_type_node)
3924 name = "complex signed char";
3925 else if (component_type == unsigned_char_type_node)
3926 name = "complex unsigned char";
3927 else if (component_type == short_integer_type_node)
3928 name = "complex short int";
3929 else if (component_type == short_unsigned_type_node)
3930 name = "complex short unsigned int";
3931 else if (component_type == integer_type_node)
3932 name = "complex int";
3933 else if (component_type == unsigned_type_node)
3934 name = "complex unsigned int";
3935 else if (component_type == long_integer_type_node)
3936 name = "complex long int";
3937 else if (component_type == long_unsigned_type_node)
3938 name = "complex long unsigned int";
3939 else if (component_type == long_long_integer_type_node)
3940 name = "complex long long int";
3941 else if (component_type == long_long_unsigned_type_node)
3942 name = "complex long long unsigned int";
3947 TYPE_NAME (t) = get_identifier (name);
3953 /* Return OP, stripped of any conversions to wider types as much as is safe.
3954 Converting the value back to OP's type makes a value equivalent to OP.
3956 If FOR_TYPE is nonzero, we return a value which, if converted to
3957 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
3959 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
3960 narrowest type that can hold the value, even if they don't exactly fit.
3961 Otherwise, bit-field references are changed to a narrower type
3962 only if they can be fetched directly from memory in that type.
3964 OP must have integer, real or enumeral type. Pointers are not allowed!
3966 There are some cases where the obvious value we could return
3967 would regenerate to OP if converted to OP's type,
3968 but would not extend like OP to wider types.
3969 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
3970 For example, if OP is (unsigned short)(signed char)-1,
3971 we avoid returning (signed char)-1 if FOR_TYPE is int,
3972 even though extending that to an unsigned short would regenerate OP,
3973 since the result of extending (signed char)-1 to (int)
3974 is different from (int) OP. */
3977 get_unwidened (op, for_type)
3981 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
3982 tree type = TREE_TYPE (op);
3984 = TYPE_PRECISION (for_type != 0 ? for_type : type);
3986 = (for_type != 0 && for_type != type
3987 && final_prec > TYPE_PRECISION (type)
3988 && TREE_UNSIGNED (type));
3991 while (TREE_CODE (op) == NOP_EXPR)
3994 = TYPE_PRECISION (TREE_TYPE (op))
3995 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
3997 /* Truncations are many-one so cannot be removed.
3998 Unless we are later going to truncate down even farther. */
4000 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4003 /* See what's inside this conversion. If we decide to strip it,
4005 op = TREE_OPERAND (op, 0);
4007 /* If we have not stripped any zero-extensions (uns is 0),
4008 we can strip any kind of extension.
4009 If we have previously stripped a zero-extension,
4010 only zero-extensions can safely be stripped.
4011 Any extension can be stripped if the bits it would produce
4012 are all going to be discarded later by truncating to FOR_TYPE. */
4016 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4018 /* TREE_UNSIGNED says whether this is a zero-extension.
4019 Let's avoid computing it if it does not affect WIN
4020 and if UNS will not be needed again. */
4021 if ((uns || TREE_CODE (op) == NOP_EXPR)
4022 && TREE_UNSIGNED (TREE_TYPE (op)))
4030 if (TREE_CODE (op) == COMPONENT_REF
4031 /* Since type_for_size always gives an integer type. */
4032 && TREE_CODE (type) != REAL_TYPE
4033 /* Don't crash if field not laid out yet. */
4034 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4035 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4037 unsigned int innerprec
4038 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4039 int unsignedp = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4040 type = (*lang_hooks.types.type_for_size) (innerprec, unsignedp);
4042 /* We can get this structure field in the narrowest type it fits in.
4043 If FOR_TYPE is 0, do this only for a field that matches the
4044 narrower type exactly and is aligned for it
4045 The resulting extension to its nominal type (a fullword type)
4046 must fit the same conditions as for other extensions. */
4048 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4049 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4050 && (! uns || final_prec <= innerprec || unsignedp)
4053 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4054 TREE_OPERAND (op, 1));
4055 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4056 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4063 /* Return OP or a simpler expression for a narrower value
4064 which can be sign-extended or zero-extended to give back OP.
4065 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4066 or 0 if the value should be sign-extended. */
4069 get_narrower (op, unsignedp_ptr)
4077 while (TREE_CODE (op) == NOP_EXPR)
4080 = (TYPE_PRECISION (TREE_TYPE (op))
4081 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4083 /* Truncations are many-one so cannot be removed. */
4087 /* See what's inside this conversion. If we decide to strip it,
4089 op = TREE_OPERAND (op, 0);
4093 /* An extension: the outermost one can be stripped,
4094 but remember whether it is zero or sign extension. */
4096 uns = TREE_UNSIGNED (TREE_TYPE (op));
4097 /* Otherwise, if a sign extension has been stripped,
4098 only sign extensions can now be stripped;
4099 if a zero extension has been stripped, only zero-extensions. */
4100 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4104 else /* bitschange == 0 */
4106 /* A change in nominal type can always be stripped, but we must
4107 preserve the unsignedness. */
4109 uns = TREE_UNSIGNED (TREE_TYPE (op));
4116 if (TREE_CODE (op) == COMPONENT_REF
4117 /* Since type_for_size always gives an integer type. */
4118 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4119 /* Ensure field is laid out already. */
4120 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4122 unsigned HOST_WIDE_INT innerprec
4123 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4124 tree type = (*lang_hooks.types.type_for_size) (innerprec,
4125 TREE_UNSIGNED (op));
4127 /* We can get this structure field in a narrower type that fits it,
4128 but the resulting extension to its nominal type (a fullword type)
4129 must satisfy the same conditions as for other extensions.
4131 Do this only for fields that are aligned (not bit-fields),
4132 because when bit-field insns will be used there is no
4133 advantage in doing this. */
4135 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4136 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4137 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4141 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4142 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4143 TREE_OPERAND (op, 1));
4144 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4145 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4148 *unsignedp_ptr = uns;
4152 /* Nonzero if integer constant C has a value that is permissible
4153 for type TYPE (an INTEGER_TYPE). */
4156 int_fits_type_p (c, type)
4159 /* If the bounds of the type are integers, we can check ourselves.
4160 If not, but this type is a subtype, try checking against that.
4161 Otherwise, use force_fit_type, which checks against the precision. */
4162 if (TYPE_MAX_VALUE (type) != NULL_TREE
4163 && TYPE_MIN_VALUE (type) != NULL_TREE
4164 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4165 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
4167 if (TREE_UNSIGNED (type))
4168 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c)
4169 && ! INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type))
4170 /* Negative ints never fit unsigned types. */
4171 && ! (TREE_INT_CST_HIGH (c) < 0
4172 && ! TREE_UNSIGNED (TREE_TYPE (c))));
4174 return (! INT_CST_LT (TYPE_MAX_VALUE (type), c)
4175 && ! INT_CST_LT (c, TYPE_MIN_VALUE (type))
4176 /* Unsigned ints with top bit set never fit signed types. */
4177 && ! (TREE_INT_CST_HIGH (c) < 0
4178 && TREE_UNSIGNED (TREE_TYPE (c))));
4180 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4181 return int_fits_type_p (c, TREE_TYPE (type));
4185 TREE_TYPE (c) = type;
4186 return !force_fit_type (c, 0);
4190 /* Given a DECL or TYPE, return the scope in which it was declared, or
4191 NULL_TREE if there is no containing scope. */
4194 get_containing_scope (t)
4197 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4200 /* Return the innermost context enclosing DECL that is
4201 a FUNCTION_DECL, or zero if none. */
4204 decl_function_context (decl)
4209 if (TREE_CODE (decl) == ERROR_MARK)
4212 if (TREE_CODE (decl) == SAVE_EXPR)
4213 context = SAVE_EXPR_CONTEXT (decl);
4215 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4216 where we look up the function at runtime. Such functions always take
4217 a first argument of type 'pointer to real context'.
4219 C++ should really be fixed to use DECL_CONTEXT for the real context,
4220 and use something else for the "virtual context". */
4221 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4224 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4226 context = DECL_CONTEXT (decl);
4228 while (context && TREE_CODE (context) != FUNCTION_DECL)
4230 if (TREE_CODE (context) == BLOCK)
4231 context = BLOCK_SUPERCONTEXT (context);
4233 context = get_containing_scope (context);
4239 /* Return the innermost context enclosing DECL that is
4240 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4241 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4244 decl_type_context (decl)
4247 tree context = DECL_CONTEXT (decl);
4251 if (TREE_CODE (context) == NAMESPACE_DECL)
4254 if (TREE_CODE (context) == RECORD_TYPE
4255 || TREE_CODE (context) == UNION_TYPE
4256 || TREE_CODE (context) == QUAL_UNION_TYPE)
4259 if (TREE_CODE (context) == TYPE_DECL
4260 || TREE_CODE (context) == FUNCTION_DECL)
4261 context = DECL_CONTEXT (context);
4263 else if (TREE_CODE (context) == BLOCK)
4264 context = BLOCK_SUPERCONTEXT (context);
4267 /* Unhandled CONTEXT!? */
4273 /* CALL is a CALL_EXPR. Return the declaration for the function
4274 called, or NULL_TREE if the called function cannot be
4278 get_callee_fndecl (call)
4283 /* It's invalid to call this function with anything but a
4285 if (TREE_CODE (call) != CALL_EXPR)
4288 /* The first operand to the CALL is the address of the function
4290 addr = TREE_OPERAND (call, 0);
4294 /* If this is a readonly function pointer, extract its initial value. */
4295 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4296 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4297 && DECL_INITIAL (addr))
4298 addr = DECL_INITIAL (addr);
4300 /* If the address is just `&f' for some function `f', then we know
4301 that `f' is being called. */
4302 if (TREE_CODE (addr) == ADDR_EXPR
4303 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4304 return TREE_OPERAND (addr, 0);
4306 /* We couldn't figure out what was being called. */
4310 /* Print debugging information about the obstack O, named STR. */
4313 print_obstack_statistics (str, o)
4317 struct _obstack_chunk *chunk = o->chunk;
4321 n_alloc += o->next_free - chunk->contents;
4322 chunk = chunk->prev;
4326 n_alloc += chunk->limit - &chunk->contents[0];
4327 chunk = chunk->prev;
4329 fprintf (stderr, "obstack %s: %u bytes, %d chunks\n",
4330 str, n_alloc, n_chunks);
4333 /* Print debugging information about tree nodes generated during the compile,
4334 and any language-specific information. */
4337 dump_tree_statistics ()
4339 #ifdef GATHER_STATISTICS
4341 int total_nodes, total_bytes;
4344 fprintf (stderr, "\n??? tree nodes created\n\n");
4345 #ifdef GATHER_STATISTICS
4346 fprintf (stderr, "Kind Nodes Bytes\n");
4347 fprintf (stderr, "-------------------------------------\n");
4348 total_nodes = total_bytes = 0;
4349 for (i = 0; i < (int) all_kinds; i++)
4351 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4352 tree_node_counts[i], tree_node_sizes[i]);
4353 total_nodes += tree_node_counts[i];
4354 total_bytes += tree_node_sizes[i];
4356 fprintf (stderr, "-------------------------------------\n");
4357 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4358 fprintf (stderr, "-------------------------------------\n");
4360 fprintf (stderr, "(No per-node statistics)\n");
4362 print_obstack_statistics ("permanent_obstack", &permanent_obstack);
4363 print_type_hash_statistics ();
4364 (*lang_hooks.print_statistics) ();
4367 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4369 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4370 clashes in cases where we can't reliably choose a unique name.
4372 Derived from mkstemp.c in libiberty. */
4375 append_random_chars (template)
4378 static const char letters[]
4379 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4380 static unsigned HOST_WIDE_INT value;
4381 unsigned HOST_WIDE_INT v;
4387 /* VALUE should be unique for each file and must not change between
4388 compiles since this can cause bootstrap comparison errors. */
4390 if (stat (main_input_filename, &st) < 0)
4392 /* This can happen when preprocessed text is shipped between
4393 machines, e.g. with bug reports. Assume that uniqueness
4394 isn't actually an issue. */
4399 /* In VMS, ino is an array, so we have to use both values. We
4400 conditionalize that. */
4402 #define INO_TO_INT(INO) ((int) (INO)[1] << 16 ^ (int) (INO)[2])
4404 #define INO_TO_INT(INO) INO
4406 value = st.st_dev ^ INO_TO_INT (st.st_ino) ^ st.st_mtime;
4410 template += strlen (template);
4414 /* Fill in the random bits. */
4415 template[0] = letters[v % 62];
4417 template[1] = letters[v % 62];
4419 template[2] = letters[v % 62];
4421 template[3] = letters[v % 62];
4423 template[4] = letters[v % 62];
4425 template[5] = letters[v % 62];
4430 /* P is a string that will be used in a symbol. Mask out any characters
4431 that are not valid in that context. */
4434 clean_symbol_name (p)
4439 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4442 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4449 /* Generate a name for a function unique to this translation unit.
4450 TYPE is some string to identify the purpose of this function to the
4451 linker or collect2. */
4454 get_file_function_name_long (type)
4461 if (first_global_object_name)
4462 p = first_global_object_name;
4465 /* We don't have anything that we know to be unique to this translation
4466 unit, so use what we do have and throw in some randomness. */
4468 const char *name = weak_global_object_name;
4469 const char *file = main_input_filename;
4474 file = input_filename;
4476 q = (char *) alloca (7 + strlen (name) + strlen (file));
4478 sprintf (q, "%s%s", name, file);
4479 append_random_chars (q);
4483 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
4486 /* Set up the name of the file-level functions we may need.
4487 Use a global object (which is already required to be unique over
4488 the program) rather than the file name (which imposes extra
4490 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4492 /* Don't need to pull weird characters out of global names. */
4493 if (p != first_global_object_name)
4494 clean_symbol_name (buf + 11);
4496 return get_identifier (buf);
4499 /* If KIND=='I', return a suitable global initializer (constructor) name.
4500 If KIND=='D', return a suitable global clean-up (destructor) name. */
4503 get_file_function_name (kind)
4511 return get_file_function_name_long (p);
4514 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4515 The result is placed in BUFFER (which has length BIT_SIZE),
4516 with one bit in each char ('\000' or '\001').
4518 If the constructor is constant, NULL_TREE is returned.
4519 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4522 get_set_constructor_bits (init, buffer, bit_size)
4529 HOST_WIDE_INT domain_min
4530 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4531 tree non_const_bits = NULL_TREE;
4533 for (i = 0; i < bit_size; i++)
4536 for (vals = TREE_OPERAND (init, 1);
4537 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4539 if (!host_integerp (TREE_VALUE (vals), 0)
4540 || (TREE_PURPOSE (vals) != NULL_TREE
4541 && !host_integerp (TREE_PURPOSE (vals), 0)))
4543 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4544 else if (TREE_PURPOSE (vals) != NULL_TREE)
4546 /* Set a range of bits to ones. */
4547 HOST_WIDE_INT lo_index
4548 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4549 HOST_WIDE_INT hi_index
4550 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4552 if (lo_index < 0 || lo_index >= bit_size
4553 || hi_index < 0 || hi_index >= bit_size)
4555 for (; lo_index <= hi_index; lo_index++)
4556 buffer[lo_index] = 1;
4560 /* Set a single bit to one. */
4562 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4563 if (index < 0 || index >= bit_size)
4565 error ("invalid initializer for bit string");
4571 return non_const_bits;
4574 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4575 The result is placed in BUFFER (which is an array of bytes).
4576 If the constructor is constant, NULL_TREE is returned.
4577 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4580 get_set_constructor_bytes (init, buffer, wd_size)
4582 unsigned char *buffer;
4586 int set_word_size = BITS_PER_UNIT;
4587 int bit_size = wd_size * set_word_size;
4589 unsigned char *bytep = buffer;
4590 char *bit_buffer = (char *) alloca (bit_size);
4591 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4593 for (i = 0; i < wd_size; i++)
4596 for (i = 0; i < bit_size; i++)
4600 if (BYTES_BIG_ENDIAN)
4601 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4603 *bytep |= 1 << bit_pos;
4606 if (bit_pos >= set_word_size)
4607 bit_pos = 0, bytep++;
4609 return non_const_bits;
4612 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4613 /* Complain that the tree code of NODE does not match the expected CODE.
4614 FILE, LINE, and FUNCTION are of the caller. */
4617 tree_check_failed (node, code, file, line, function)
4619 enum tree_code code;
4622 const char *function;
4624 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4625 tree_code_name[code], tree_code_name[TREE_CODE (node)],
4626 function, trim_filename (file), line);
4629 /* Similar to above, except that we check for a class of tree
4630 code, given in CL. */
4633 tree_class_check_failed (node, cl, file, line, function)
4638 const char *function;
4641 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4642 cl, TREE_CODE_CLASS (TREE_CODE (node)),
4643 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
4646 #endif /* ENABLE_TREE_CHECKING */
4648 /* For a new vector type node T, build the information necessary for
4649 debuggint output. */
4652 finish_vector_type (t)
4658 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
4659 tree array = build_array_type (TREE_TYPE (t),
4660 build_index_type (index));
4661 tree rt = make_node (RECORD_TYPE);
4663 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
4664 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
4666 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
4667 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4668 the representation type, and we want to find that die when looking up
4669 the vector type. This is most easily achieved by making the TYPE_UID
4671 TYPE_UID (rt) = TYPE_UID (t);
4675 /* Create nodes for all integer types (and error_mark_node) using the sizes
4676 of C datatypes. The caller should call set_sizetype soon after calling
4677 this function to select one of the types as sizetype. */
4680 build_common_tree_nodes (signed_char)
4683 error_mark_node = make_node (ERROR_MARK);
4684 TREE_TYPE (error_mark_node) = error_mark_node;
4686 initialize_sizetypes ();
4688 /* Define both `signed char' and `unsigned char'. */
4689 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
4690 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
4692 /* Define `char', which is like either `signed char' or `unsigned char'
4693 but not the same as either. */
4696 ? make_signed_type (CHAR_TYPE_SIZE)
4697 : make_unsigned_type (CHAR_TYPE_SIZE));
4699 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
4700 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
4701 integer_type_node = make_signed_type (INT_TYPE_SIZE);
4702 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
4703 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
4704 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
4705 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
4706 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
4708 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
4709 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
4710 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
4711 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
4712 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
4714 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
4715 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
4716 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
4717 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
4718 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
4721 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4722 It will create several other common tree nodes. */
4725 build_common_tree_nodes_2 (short_double)
4728 /* Define these next since types below may used them. */
4729 integer_zero_node = build_int_2 (0, 0);
4730 integer_one_node = build_int_2 (1, 0);
4731 integer_minus_one_node = build_int_2 (-1, -1);
4733 size_zero_node = size_int (0);
4734 size_one_node = size_int (1);
4735 bitsize_zero_node = bitsize_int (0);
4736 bitsize_one_node = bitsize_int (1);
4737 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
4739 void_type_node = make_node (VOID_TYPE);
4740 layout_type (void_type_node);
4742 /* We are not going to have real types in C with less than byte alignment,
4743 so we might as well not have any types that claim to have it. */
4744 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
4745 TYPE_USER_ALIGN (void_type_node) = 0;
4747 null_pointer_node = build_int_2 (0, 0);
4748 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
4749 layout_type (TREE_TYPE (null_pointer_node));
4751 ptr_type_node = build_pointer_type (void_type_node);
4753 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
4755 float_type_node = make_node (REAL_TYPE);
4756 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
4757 layout_type (float_type_node);
4759 double_type_node = make_node (REAL_TYPE);
4761 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
4763 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
4764 layout_type (double_type_node);
4766 long_double_type_node = make_node (REAL_TYPE);
4767 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
4768 layout_type (long_double_type_node);
4770 complex_integer_type_node = make_node (COMPLEX_TYPE);
4771 TREE_TYPE (complex_integer_type_node) = integer_type_node;
4772 layout_type (complex_integer_type_node);
4774 complex_float_type_node = make_node (COMPLEX_TYPE);
4775 TREE_TYPE (complex_float_type_node) = float_type_node;
4776 layout_type (complex_float_type_node);
4778 complex_double_type_node = make_node (COMPLEX_TYPE);
4779 TREE_TYPE (complex_double_type_node) = double_type_node;
4780 layout_type (complex_double_type_node);
4782 complex_long_double_type_node = make_node (COMPLEX_TYPE);
4783 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
4784 layout_type (complex_long_double_type_node);
4788 BUILD_VA_LIST_TYPE (t);
4790 /* Many back-ends define record types without seting TYPE_NAME.
4791 If we copied the record type here, we'd keep the original
4792 record type without a name. This breaks name mangling. So,
4793 don't copy record types and let c_common_nodes_and_builtins()
4794 declare the type to be __builtin_va_list. */
4795 if (TREE_CODE (t) != RECORD_TYPE)
4796 t = build_type_copy (t);
4798 va_list_type_node = t;
4801 unsigned_V4SI_type_node
4802 = make_vector (V4SImode, unsigned_intSI_type_node, 1);
4803 unsigned_V2SI_type_node
4804 = make_vector (V2SImode, unsigned_intSI_type_node, 1);
4805 unsigned_V2DI_type_node
4806 = make_vector (V2DImode, unsigned_intDI_type_node, 1);
4807 unsigned_V4HI_type_node
4808 = make_vector (V4HImode, unsigned_intHI_type_node, 1);
4809 unsigned_V8QI_type_node
4810 = make_vector (V8QImode, unsigned_intQI_type_node, 1);
4811 unsigned_V8HI_type_node
4812 = make_vector (V8HImode, unsigned_intHI_type_node, 1);
4813 unsigned_V16QI_type_node
4814 = make_vector (V16QImode, unsigned_intQI_type_node, 1);
4816 V16SF_type_node = make_vector (V16SFmode, float_type_node, 0);
4817 V4SF_type_node = make_vector (V4SFmode, float_type_node, 0);
4818 V4SI_type_node = make_vector (V4SImode, intSI_type_node, 0);
4819 V2SI_type_node = make_vector (V2SImode, intSI_type_node, 0);
4820 V2DI_type_node = make_vector (V2DImode, intDI_type_node, 0);
4821 V4HI_type_node = make_vector (V4HImode, intHI_type_node, 0);
4822 V8QI_type_node = make_vector (V8QImode, intQI_type_node, 0);
4823 V8HI_type_node = make_vector (V8HImode, intHI_type_node, 0);
4824 V2SF_type_node = make_vector (V2SFmode, float_type_node, 0);
4825 V2DF_type_node = make_vector (V2DFmode, double_type_node, 0);
4826 V16QI_type_node = make_vector (V16QImode, intQI_type_node, 0);
4829 /* Returns a vector tree node given a vector mode, the inner type, and
4833 make_vector (mode, innertype, unsignedp)
4834 enum machine_mode mode;
4840 t = make_node (VECTOR_TYPE);
4841 TREE_TYPE (t) = innertype;
4842 TYPE_MODE (t) = mode;
4843 TREE_UNSIGNED (TREE_TYPE (t)) = unsignedp;
4844 finish_vector_type (t);
4849 /* Given an initializer INIT, return TRUE if INIT is zero or some
4850 aggregate of zeros. Otherwise return FALSE. */
4853 initializer_zerop (init)
4858 switch (TREE_CODE (init))
4861 return integer_zerop (init);
4863 return real_zerop (init)
4864 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
4866 return integer_zerop (init)
4867 || (real_zerop (init)
4868 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
4869 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
4872 if (AGGREGATE_TYPE_P (TREE_TYPE (init)))
4874 tree aggr_init = TREE_OPERAND (init, 1);
4878 if (! initializer_zerop (TREE_VALUE (aggr_init)))
4880 aggr_init = TREE_CHAIN (aggr_init);
4891 #include "gt-tree.h"