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. */
34 #include "coretypes.h"
47 #include "langhooks.h"
49 /* obstack.[ch] explicitly declined to prototype this. */
50 extern int _obstack_allocated_p PARAMS ((struct obstack *h, PTR obj));
52 #ifdef GATHER_STATISTICS
53 /* Statistics-gathering stuff. */
73 int tree_node_counts[(int) all_kinds];
74 int tree_node_sizes[(int) all_kinds];
76 static const char * const tree_node_kind_names[] = {
92 #endif /* GATHER_STATISTICS */
94 /* Unique id for next decl created. */
95 static int next_decl_uid;
96 /* Unique id for next type created. */
97 static int next_type_uid = 1;
99 /* Since we cannot rehash a type after it is in the table, we have to
100 keep the hash code. */
102 struct type_hash GTY(())
108 /* Initial size of the hash table (rounded to next prime). */
109 #define TYPE_HASH_INITIAL_SIZE 1000
111 /* Now here is the hash table. When recording a type, it is added to
112 the slot whose index is the hash code. Note that the hash table is
113 used for several kinds of types (function types, array types and
114 array index range types, for now). While all these live in the
115 same table, they are completely independent, and the hash code is
116 computed differently for each of these. */
118 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
119 htab_t type_hash_table;
121 static void set_type_quals PARAMS ((tree, int));
122 static void append_random_chars PARAMS ((char *));
123 static int type_hash_eq PARAMS ((const void *, const void *));
124 static hashval_t type_hash_hash PARAMS ((const void *));
125 static void print_type_hash_statistics PARAMS((void));
126 static void finish_vector_type PARAMS((tree));
127 static tree make_vector PARAMS ((enum machine_mode, tree, int));
128 static int type_hash_marked_p PARAMS ((const void *));
130 tree global_trees[TI_MAX];
131 tree integer_types[itk_none];
138 /* Initialize the hash table of types. */
139 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
144 /* The name of the object as the assembler will see it (but before any
145 translations made by ASM_OUTPUT_LABELREF). Often this is the same
146 as DECL_NAME. It is an IDENTIFIER_NODE. */
148 decl_assembler_name (decl)
151 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
152 (*lang_hooks.set_decl_assembler_name) (decl);
153 return DECL_CHECK (decl)->decl.assembler_name;
156 /* Compute the number of bytes occupied by 'node'. This routine only
157 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
162 enum tree_code code = TREE_CODE (node);
164 switch (TREE_CODE_CLASS (code))
166 case 'd': /* A decl node */
167 return sizeof (struct tree_decl);
169 case 't': /* a type node */
170 return sizeof (struct tree_type);
172 case 'b': /* a lexical block node */
173 return sizeof (struct tree_block);
175 case 'r': /* a reference */
176 case 'e': /* an expression */
177 case 's': /* an expression with side effects */
178 case '<': /* a comparison expression */
179 case '1': /* a unary arithmetic expression */
180 case '2': /* a binary arithmetic expression */
181 return (sizeof (struct tree_exp)
182 + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
184 case 'c': /* a constant */
187 case INTEGER_CST: return sizeof (struct tree_int_cst);
188 case REAL_CST: return sizeof (struct tree_real_cst);
189 case COMPLEX_CST: return sizeof (struct tree_complex);
190 case VECTOR_CST: return sizeof (struct tree_vector);
191 case STRING_CST: return sizeof (struct tree_string);
193 return (*lang_hooks.tree_size) (code);
196 case 'x': /* something random, like an identifier. */
199 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
200 case TREE_LIST: return sizeof (struct tree_list);
201 case TREE_VEC: return (sizeof (struct tree_vec)
202 + TREE_VEC_LENGTH(node) * sizeof(char *)
206 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
209 return (*lang_hooks.tree_size) (code);
217 /* Return a newly allocated node of code CODE.
218 For decl and type nodes, some other fields are initialized.
219 The rest of the node is initialized to zero.
221 Achoo! I got a code in the node. */
228 int type = TREE_CODE_CLASS (code);
230 #ifdef GATHER_STATISTICS
233 struct tree_common ttmp;
235 /* We can't allocate a TREE_VEC without knowing how many elements
237 if (code == TREE_VEC)
240 TREE_SET_CODE ((tree)&ttmp, code);
241 length = tree_size ((tree)&ttmp);
243 #ifdef GATHER_STATISTICS
246 case 'd': /* A decl node */
250 case 't': /* a type node */
254 case 'b': /* a lexical block */
258 case 's': /* an expression with side effects */
262 case 'r': /* a reference */
266 case 'e': /* an expression */
267 case '<': /* a comparison expression */
268 case '1': /* a unary arithmetic expression */
269 case '2': /* a binary arithmetic expression */
273 case 'c': /* a constant */
277 case 'x': /* something random, like an identifier. */
278 if (code == IDENTIFIER_NODE)
280 else if (code == TREE_VEC)
290 tree_node_counts[(int) kind]++;
291 tree_node_sizes[(int) kind] += length;
294 t = ggc_alloc_tree (length);
296 memset ((PTR) t, 0, length);
298 TREE_SET_CODE (t, code);
303 TREE_SIDE_EFFECTS (t) = 1;
307 if (code != FUNCTION_DECL)
309 DECL_USER_ALIGN (t) = 0;
310 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
311 DECL_SOURCE_LINE (t) = lineno;
312 DECL_SOURCE_FILE (t) =
313 (input_filename) ? input_filename : "<built-in>";
314 DECL_UID (t) = next_decl_uid++;
316 /* We have not yet computed the alias set for this declaration. */
317 DECL_POINTER_ALIAS_SET (t) = -1;
321 TYPE_UID (t) = next_type_uid++;
322 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
323 TYPE_USER_ALIGN (t) = 0;
324 TYPE_MAIN_VARIANT (t) = t;
326 /* Default to no attributes for type, but let target change that. */
327 TYPE_ATTRIBUTES (t) = NULL_TREE;
328 (*targetm.set_default_type_attributes) (t);
330 /* We have not yet computed the alias set for this type. */
331 TYPE_ALIAS_SET (t) = -1;
335 TREE_CONSTANT (t) = 1;
345 case PREDECREMENT_EXPR:
346 case PREINCREMENT_EXPR:
347 case POSTDECREMENT_EXPR:
348 case POSTINCREMENT_EXPR:
349 /* All of these have side-effects, no matter what their
351 TREE_SIDE_EFFECTS (t) = 1;
363 /* Return a new node with the same contents as NODE except that its
364 TREE_CHAIN is zero and it has a fresh uid. */
371 enum tree_code code = TREE_CODE (node);
374 length = tree_size (node);
375 t = ggc_alloc_tree (length);
376 memcpy (t, node, length);
379 TREE_ASM_WRITTEN (t) = 0;
381 if (TREE_CODE_CLASS (code) == 'd')
382 DECL_UID (t) = next_decl_uid++;
383 else if (TREE_CODE_CLASS (code) == 't')
385 TYPE_UID (t) = next_type_uid++;
386 /* The following is so that the debug code for
387 the copy is different from the original type.
388 The two statements usually duplicate each other
389 (because they clear fields of the same union),
390 but the optimizer should catch that. */
391 TYPE_SYMTAB_POINTER (t) = 0;
392 TYPE_SYMTAB_ADDRESS (t) = 0;
398 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
399 For example, this can copy a list made of TREE_LIST nodes. */
411 head = prev = copy_node (list);
412 next = TREE_CHAIN (list);
415 TREE_CHAIN (prev) = copy_node (next);
416 prev = TREE_CHAIN (prev);
417 next = TREE_CHAIN (next);
423 /* Return a newly constructed INTEGER_CST node whose constant value
424 is specified by the two ints LOW and HI.
425 The TREE_TYPE is set to `int'.
427 This function should be used via the `build_int_2' macro. */
430 build_int_2_wide (low, hi)
431 unsigned HOST_WIDE_INT low;
434 tree t = make_node (INTEGER_CST);
436 TREE_INT_CST_LOW (t) = low;
437 TREE_INT_CST_HIGH (t) = hi;
438 TREE_TYPE (t) = integer_type_node;
442 /* Return a new VECTOR_CST node whose type is TYPE and whose values
443 are in a list pointed by VALS. */
446 build_vector (type, vals)
449 tree v = make_node (VECTOR_CST);
450 int over1 = 0, over2 = 0;
453 TREE_VECTOR_CST_ELTS (v) = vals;
454 TREE_TYPE (v) = type;
456 /* Iterate through elements and check for overflow. */
457 for (link = vals; link; link = TREE_CHAIN (link))
459 tree value = TREE_VALUE (link);
461 over1 |= TREE_OVERFLOW (value);
462 over2 |= TREE_CONSTANT_OVERFLOW (value);
465 TREE_OVERFLOW (v) = over1;
466 TREE_CONSTANT_OVERFLOW (v) = over2;
471 /* Return a new REAL_CST node whose type is TYPE and value is D. */
482 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
483 Consider doing it via real_convert now. */
485 v = make_node (REAL_CST);
486 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
487 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
489 TREE_TYPE (v) = type;
490 TREE_REAL_CST_PTR (v) = dp;
491 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
495 /* Return a new REAL_CST node whose type is TYPE
496 and whose value is the integer value of the INTEGER_CST node I. */
499 real_value_from_int_cst (type, i)
500 tree type ATTRIBUTE_UNUSED, i;
504 /* Clear all bits of the real value type so that we can later do
505 bitwise comparisons to see if two values are the same. */
506 memset ((char *) &d, 0, sizeof d);
508 if (! TREE_UNSIGNED (TREE_TYPE (i)))
509 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
512 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
513 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
517 /* Given a tree representing an integer constant I, return a tree
518 representing the same value as a floating-point constant of type TYPE. */
521 build_real_from_int_cst (type, i)
526 int overflow = TREE_OVERFLOW (i);
528 v = build_real (type, real_value_from_int_cst (type, i));
530 TREE_OVERFLOW (v) |= overflow;
531 TREE_CONSTANT_OVERFLOW (v) |= overflow;
535 /* Return a newly constructed STRING_CST node whose value is
536 the LEN characters at STR.
537 The TREE_TYPE is not initialized. */
540 build_string (len, str)
544 tree s = make_node (STRING_CST);
546 TREE_STRING_LENGTH (s) = len;
547 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
552 /* Return a newly constructed COMPLEX_CST node whose value is
553 specified by the real and imaginary parts REAL and IMAG.
554 Both REAL and IMAG should be constant nodes. TYPE, if specified,
555 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
558 build_complex (type, real, imag)
562 tree t = make_node (COMPLEX_CST);
564 TREE_REALPART (t) = real;
565 TREE_IMAGPART (t) = imag;
566 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
567 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
568 TREE_CONSTANT_OVERFLOW (t)
569 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
573 /* Build a newly constructed TREE_VEC node of length LEN. */
580 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
582 #ifdef GATHER_STATISTICS
583 tree_node_counts[(int) vec_kind]++;
584 tree_node_sizes[(int) vec_kind] += length;
587 t = ggc_alloc_tree (length);
589 memset ((PTR) t, 0, length);
590 TREE_SET_CODE (t, TREE_VEC);
591 TREE_VEC_LENGTH (t) = len;
596 /* Return 1 if EXPR is the integer constant zero or a complex constant
605 return ((TREE_CODE (expr) == INTEGER_CST
606 && ! TREE_CONSTANT_OVERFLOW (expr)
607 && TREE_INT_CST_LOW (expr) == 0
608 && TREE_INT_CST_HIGH (expr) == 0)
609 || (TREE_CODE (expr) == COMPLEX_CST
610 && integer_zerop (TREE_REALPART (expr))
611 && integer_zerop (TREE_IMAGPART (expr))));
614 /* Return 1 if EXPR is the integer constant one or the corresponding
623 return ((TREE_CODE (expr) == INTEGER_CST
624 && ! TREE_CONSTANT_OVERFLOW (expr)
625 && TREE_INT_CST_LOW (expr) == 1
626 && TREE_INT_CST_HIGH (expr) == 0)
627 || (TREE_CODE (expr) == COMPLEX_CST
628 && integer_onep (TREE_REALPART (expr))
629 && integer_zerop (TREE_IMAGPART (expr))));
632 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
633 it contains. Likewise for the corresponding complex constant. */
636 integer_all_onesp (expr)
644 if (TREE_CODE (expr) == COMPLEX_CST
645 && integer_all_onesp (TREE_REALPART (expr))
646 && integer_zerop (TREE_IMAGPART (expr)))
649 else if (TREE_CODE (expr) != INTEGER_CST
650 || TREE_CONSTANT_OVERFLOW (expr))
653 uns = TREE_UNSIGNED (TREE_TYPE (expr));
655 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
656 && TREE_INT_CST_HIGH (expr) == -1);
658 /* Note that using TYPE_PRECISION here is wrong. We care about the
659 actual bits, not the (arbitrary) range of the type. */
660 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
661 if (prec >= HOST_BITS_PER_WIDE_INT)
663 HOST_WIDE_INT high_value;
666 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
668 if (shift_amount > HOST_BITS_PER_WIDE_INT)
669 /* Can not handle precisions greater than twice the host int size. */
671 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
672 /* Shifting by the host word size is undefined according to the ANSI
673 standard, so we must handle this as a special case. */
676 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
678 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
679 && TREE_INT_CST_HIGH (expr) == high_value);
682 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
685 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
693 HOST_WIDE_INT high, low;
697 if (TREE_CODE (expr) == COMPLEX_CST
698 && integer_pow2p (TREE_REALPART (expr))
699 && integer_zerop (TREE_IMAGPART (expr)))
702 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
705 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
706 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
707 high = TREE_INT_CST_HIGH (expr);
708 low = TREE_INT_CST_LOW (expr);
710 /* First clear all bits that are beyond the type's precision in case
711 we've been sign extended. */
713 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
715 else if (prec > HOST_BITS_PER_WIDE_INT)
716 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
720 if (prec < HOST_BITS_PER_WIDE_INT)
721 low &= ~((HOST_WIDE_INT) (-1) << prec);
724 if (high == 0 && low == 0)
727 return ((high == 0 && (low & (low - 1)) == 0)
728 || (low == 0 && (high & (high - 1)) == 0));
731 /* Return 1 if EXPR is an integer constant other than zero or a
732 complex constant other than zero. */
735 integer_nonzerop (expr)
740 return ((TREE_CODE (expr) == INTEGER_CST
741 && ! TREE_CONSTANT_OVERFLOW (expr)
742 && (TREE_INT_CST_LOW (expr) != 0
743 || TREE_INT_CST_HIGH (expr) != 0))
744 || (TREE_CODE (expr) == COMPLEX_CST
745 && (integer_nonzerop (TREE_REALPART (expr))
746 || integer_nonzerop (TREE_IMAGPART (expr)))));
749 /* Return the power of two represented by a tree node known to be a
757 HOST_WIDE_INT high, low;
761 if (TREE_CODE (expr) == COMPLEX_CST)
762 return tree_log2 (TREE_REALPART (expr));
764 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
765 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
767 high = TREE_INT_CST_HIGH (expr);
768 low = TREE_INT_CST_LOW (expr);
770 /* First clear all bits that are beyond the type's precision in case
771 we've been sign extended. */
773 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
775 else if (prec > HOST_BITS_PER_WIDE_INT)
776 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
780 if (prec < HOST_BITS_PER_WIDE_INT)
781 low &= ~((HOST_WIDE_INT) (-1) << prec);
784 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
788 /* Similar, but return the largest integer Y such that 2 ** Y is less
789 than or equal to EXPR. */
792 tree_floor_log2 (expr)
796 HOST_WIDE_INT high, low;
800 if (TREE_CODE (expr) == COMPLEX_CST)
801 return tree_log2 (TREE_REALPART (expr));
803 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
804 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
806 high = TREE_INT_CST_HIGH (expr);
807 low = TREE_INT_CST_LOW (expr);
809 /* First clear all bits that are beyond the type's precision in case
810 we've been sign extended. Ignore if type's precision hasn't been set
811 since what we are doing is setting it. */
813 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
815 else if (prec > HOST_BITS_PER_WIDE_INT)
816 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
820 if (prec < HOST_BITS_PER_WIDE_INT)
821 low &= ~((HOST_WIDE_INT) (-1) << prec);
824 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
828 /* Return 1 if EXPR is the real constant zero. */
836 return ((TREE_CODE (expr) == REAL_CST
837 && ! TREE_CONSTANT_OVERFLOW (expr)
838 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
839 || (TREE_CODE (expr) == COMPLEX_CST
840 && real_zerop (TREE_REALPART (expr))
841 && real_zerop (TREE_IMAGPART (expr))));
844 /* Return 1 if EXPR is the real constant one in real or complex form. */
852 return ((TREE_CODE (expr) == REAL_CST
853 && ! TREE_CONSTANT_OVERFLOW (expr)
854 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
855 || (TREE_CODE (expr) == COMPLEX_CST
856 && real_onep (TREE_REALPART (expr))
857 && real_zerop (TREE_IMAGPART (expr))));
860 /* Return 1 if EXPR is the real constant two. */
868 return ((TREE_CODE (expr) == REAL_CST
869 && ! TREE_CONSTANT_OVERFLOW (expr)
870 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
871 || (TREE_CODE (expr) == COMPLEX_CST
872 && real_twop (TREE_REALPART (expr))
873 && real_zerop (TREE_IMAGPART (expr))));
876 /* Return 1 if EXPR is the real constant minus one. */
879 real_minus_onep (expr)
884 return ((TREE_CODE (expr) == REAL_CST
885 && ! TREE_CONSTANT_OVERFLOW (expr)
886 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
887 || (TREE_CODE (expr) == COMPLEX_CST
888 && real_minus_onep (TREE_REALPART (expr))
889 && real_zerop (TREE_IMAGPART (expr))));
892 /* Nonzero if EXP is a constant or a cast of a constant. */
895 really_constant_p (exp)
898 /* This is not quite the same as STRIP_NOPS. It does more. */
899 while (TREE_CODE (exp) == NOP_EXPR
900 || TREE_CODE (exp) == CONVERT_EXPR
901 || TREE_CODE (exp) == NON_LVALUE_EXPR)
902 exp = TREE_OPERAND (exp, 0);
903 return TREE_CONSTANT (exp);
906 /* Return first list element whose TREE_VALUE is ELEM.
907 Return 0 if ELEM is not in LIST. */
910 value_member (elem, list)
915 if (elem == TREE_VALUE (list))
917 list = TREE_CHAIN (list);
922 /* Return first list element whose TREE_PURPOSE is ELEM.
923 Return 0 if ELEM is not in LIST. */
926 purpose_member (elem, list)
931 if (elem == TREE_PURPOSE (list))
933 list = TREE_CHAIN (list);
938 /* Return first list element whose BINFO_TYPE is ELEM.
939 Return 0 if ELEM is not in LIST. */
942 binfo_member (elem, list)
947 if (elem == BINFO_TYPE (list))
949 list = TREE_CHAIN (list);
954 /* Return nonzero if ELEM is part of the chain CHAIN. */
957 chain_member (elem, chain)
964 chain = TREE_CHAIN (chain);
970 /* Return the length of a chain of nodes chained through TREE_CHAIN.
971 We expect a null pointer to mark the end of the chain.
972 This is the Lisp primitive `length'. */
981 for (tail = t; tail; tail = TREE_CHAIN (tail))
987 /* Returns the number of FIELD_DECLs in TYPE. */
993 tree t = TYPE_FIELDS (type);
996 for (; t; t = TREE_CHAIN (t))
997 if (TREE_CODE (t) == FIELD_DECL)
1003 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1004 by modifying the last node in chain 1 to point to chain 2.
1005 This is the Lisp primitive `nconc'. */
1015 #ifdef ENABLE_TREE_CHECKING
1019 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1021 TREE_CHAIN (t1) = op2;
1022 #ifdef ENABLE_TREE_CHECKING
1023 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1025 abort (); /* Circularity created. */
1033 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1041 while ((next = TREE_CHAIN (chain)))
1046 /* Reverse the order of elements in the chain T,
1047 and return the new head of the chain (old last element). */
1053 tree prev = 0, decl, next;
1054 for (decl = t; decl; decl = next)
1056 next = TREE_CHAIN (decl);
1057 TREE_CHAIN (decl) = prev;
1063 /* Return a newly created TREE_LIST node whose
1064 purpose and value fields are PARM and VALUE. */
1067 build_tree_list (parm, value)
1070 tree t = make_node (TREE_LIST);
1071 TREE_PURPOSE (t) = parm;
1072 TREE_VALUE (t) = value;
1076 /* Return a newly created TREE_LIST node whose
1077 purpose and value fields are PURPOSE and VALUE
1078 and whose TREE_CHAIN is CHAIN. */
1081 tree_cons (purpose, value, chain)
1082 tree purpose, value, chain;
1086 node = ggc_alloc_tree (sizeof (struct tree_list));
1088 memset (node, 0, sizeof (struct tree_common));
1090 #ifdef GATHER_STATISTICS
1091 tree_node_counts[(int) x_kind]++;
1092 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1095 TREE_SET_CODE (node, TREE_LIST);
1096 TREE_CHAIN (node) = chain;
1097 TREE_PURPOSE (node) = purpose;
1098 TREE_VALUE (node) = value;
1103 /* Return the size nominally occupied by an object of type TYPE
1104 when it resides in memory. The value is measured in units of bytes,
1105 and its data type is that normally used for type sizes
1106 (which is the first type created by make_signed_type or
1107 make_unsigned_type). */
1110 size_in_bytes (type)
1115 if (type == error_mark_node)
1116 return integer_zero_node;
1118 type = TYPE_MAIN_VARIANT (type);
1119 t = TYPE_SIZE_UNIT (type);
1123 (*lang_hooks.types.incomplete_type_error) (NULL_TREE, type);
1124 return size_zero_node;
1127 if (TREE_CODE (t) == INTEGER_CST)
1128 force_fit_type (t, 0);
1133 /* Return the size of TYPE (in bytes) as a wide integer
1134 or return -1 if the size can vary or is larger than an integer. */
1137 int_size_in_bytes (type)
1142 if (type == error_mark_node)
1145 type = TYPE_MAIN_VARIANT (type);
1146 t = TYPE_SIZE_UNIT (type);
1148 || TREE_CODE (t) != INTEGER_CST
1149 || TREE_OVERFLOW (t)
1150 || TREE_INT_CST_HIGH (t) != 0
1151 /* If the result would appear negative, it's too big to represent. */
1152 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1155 return TREE_INT_CST_LOW (t);
1158 /* Return the bit position of FIELD, in bits from the start of the record.
1159 This is a tree of type bitsizetype. */
1162 bit_position (field)
1166 return bit_from_pos (DECL_FIELD_OFFSET (field),
1167 DECL_FIELD_BIT_OFFSET (field));
1170 /* Likewise, but return as an integer. Abort if it cannot be represented
1171 in that way (since it could be a signed value, we don't have the option
1172 of returning -1 like int_size_in_byte can. */
1175 int_bit_position (field)
1178 return tree_low_cst (bit_position (field), 0);
1181 /* Return the byte position of FIELD, in bytes from the start of the record.
1182 This is a tree of type sizetype. */
1185 byte_position (field)
1188 return byte_from_pos (DECL_FIELD_OFFSET (field),
1189 DECL_FIELD_BIT_OFFSET (field));
1192 /* Likewise, but return as an integer. Abort if it cannot be represented
1193 in that way (since it could be a signed value, we don't have the option
1194 of returning -1 like int_size_in_byte can. */
1197 int_byte_position (field)
1200 return tree_low_cst (byte_position (field), 0);
1203 /* Return the strictest alignment, in bits, that T is known to have. */
1209 unsigned int align0, align1;
1211 switch (TREE_CODE (t))
1213 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1214 /* If we have conversions, we know that the alignment of the
1215 object must meet each of the alignments of the types. */
1216 align0 = expr_align (TREE_OPERAND (t, 0));
1217 align1 = TYPE_ALIGN (TREE_TYPE (t));
1218 return MAX (align0, align1);
1220 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1221 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1222 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1223 /* These don't change the alignment of an object. */
1224 return expr_align (TREE_OPERAND (t, 0));
1227 /* The best we can do is say that the alignment is the least aligned
1229 align0 = expr_align (TREE_OPERAND (t, 1));
1230 align1 = expr_align (TREE_OPERAND (t, 2));
1231 return MIN (align0, align1);
1233 case LABEL_DECL: case CONST_DECL:
1234 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1235 if (DECL_ALIGN (t) != 0)
1236 return DECL_ALIGN (t);
1240 return FUNCTION_BOUNDARY;
1246 /* Otherwise take the alignment from that of the type. */
1247 return TYPE_ALIGN (TREE_TYPE (t));
1250 /* Return, as a tree node, the number of elements for TYPE (which is an
1251 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1254 array_type_nelts (type)
1257 tree index_type, min, max;
1259 /* If they did it with unspecified bounds, then we should have already
1260 given an error about it before we got here. */
1261 if (! TYPE_DOMAIN (type))
1262 return error_mark_node;
1264 index_type = TYPE_DOMAIN (type);
1265 min = TYPE_MIN_VALUE (index_type);
1266 max = TYPE_MAX_VALUE (index_type);
1268 return (integer_zerop (min)
1270 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1273 /* Return nonzero if arg is static -- a reference to an object in
1274 static storage. This is not the same as the C meaning of `static'. */
1280 switch (TREE_CODE (arg))
1283 /* Nested functions aren't static, since taking their address
1284 involves a trampoline. */
1285 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1286 && ! DECL_NON_ADDR_CONST_P (arg));
1289 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1290 && ! DECL_THREAD_LOCAL (arg)
1291 && ! DECL_NON_ADDR_CONST_P (arg));
1294 return TREE_STATIC (arg);
1300 /* If we are referencing a bitfield, we can't evaluate an
1301 ADDR_EXPR at compile time and so it isn't a constant. */
1303 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1304 && staticp (TREE_OPERAND (arg, 0)));
1310 /* This case is technically correct, but results in setting
1311 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1314 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1318 case ARRAY_RANGE_REF:
1319 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1320 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1321 return staticp (TREE_OPERAND (arg, 0));
1324 if ((unsigned int) TREE_CODE (arg)
1325 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1326 return (*lang_hooks.staticp) (arg);
1332 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1333 Do this to any expression which may be used in more than one place,
1334 but must be evaluated only once.
1336 Normally, expand_expr would reevaluate the expression each time.
1337 Calling save_expr produces something that is evaluated and recorded
1338 the first time expand_expr is called on it. Subsequent calls to
1339 expand_expr just reuse the recorded value.
1341 The call to expand_expr that generates code that actually computes
1342 the value is the first call *at compile time*. Subsequent calls
1343 *at compile time* generate code to use the saved value.
1344 This produces correct result provided that *at run time* control
1345 always flows through the insns made by the first expand_expr
1346 before reaching the other places where the save_expr was evaluated.
1347 You, the caller of save_expr, must make sure this is so.
1349 Constants, and certain read-only nodes, are returned with no
1350 SAVE_EXPR because that is safe. Expressions containing placeholders
1351 are not touched; see tree.def for an explanation of what these
1358 tree t = fold (expr);
1361 /* We don't care about whether this can be used as an lvalue in this
1363 while (TREE_CODE (t) == NON_LVALUE_EXPR)
1364 t = TREE_OPERAND (t, 0);
1366 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1367 a constant, it will be more efficient to not make another SAVE_EXPR since
1368 it will allow better simplification and GCSE will be able to merge the
1369 computations if they actually occur. */
1373 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1374 inner = TREE_OPERAND (inner, 0);
1375 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1377 if (TREE_CONSTANT (TREE_OPERAND (inner, 1)))
1378 inner = TREE_OPERAND (inner, 0);
1379 else if (TREE_CONSTANT (TREE_OPERAND (inner, 0)))
1380 inner = TREE_OPERAND (inner, 1);
1388 /* If the tree evaluates to a constant, then we don't want to hide that
1389 fact (i.e. this allows further folding, and direct checks for constants).
1390 However, a read-only object that has side effects cannot be bypassed.
1391 Since it is no problem to reevaluate literals, we just return the
1393 if (TREE_CONSTANT (inner)
1394 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1395 || TREE_CODE (inner) == SAVE_EXPR
1396 || TREE_CODE (inner) == ERROR_MARK)
1399 /* If T contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1400 it means that the size or offset of some field of an object depends on
1401 the value within another field.
1403 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1404 and some variable since it would then need to be both evaluated once and
1405 evaluated more than once. Front-ends must assure this case cannot
1406 happen by surrounding any such subexpressions in their own SAVE_EXPR
1407 and forcing evaluation at the proper time. */
1408 if (contains_placeholder_p (t))
1411 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1413 /* This expression might be placed ahead of a jump to ensure that the
1414 value was computed on both sides of the jump. So make sure it isn't
1415 eliminated as dead. */
1416 TREE_SIDE_EFFECTS (t) = 1;
1417 TREE_READONLY (t) = 1;
1421 /* Arrange for an expression to be expanded multiple independent
1422 times. This is useful for cleanup actions, as the backend can
1423 expand them multiple times in different places. */
1431 /* If this is already protected, no sense in protecting it again. */
1432 if (TREE_CODE (expr) == UNSAVE_EXPR)
1435 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1436 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1440 /* Returns the index of the first non-tree operand for CODE, or the number
1441 of operands if all are trees. */
1445 enum tree_code code;
1451 case GOTO_SUBROUTINE_EXPR:
1454 case WITH_CLEANUP_EXPR:
1456 case METHOD_CALL_EXPR:
1459 return TREE_CODE_LENGTH (code);
1463 /* Return which tree structure is used by T. */
1465 enum tree_node_structure_enum
1466 tree_node_structure (t)
1469 enum tree_code code = TREE_CODE (t);
1471 switch (TREE_CODE_CLASS (code))
1473 case 'd': return TS_DECL;
1474 case 't': return TS_TYPE;
1475 case 'b': return TS_BLOCK;
1476 case 'r': case '<': case '1': case '2': case 'e': case 's':
1478 default: /* 'c' and 'x' */
1484 case INTEGER_CST: return TS_INT_CST;
1485 case REAL_CST: return TS_REAL_CST;
1486 case COMPLEX_CST: return TS_COMPLEX;
1487 case VECTOR_CST: return TS_VECTOR;
1488 case STRING_CST: return TS_STRING;
1490 case ERROR_MARK: return TS_COMMON;
1491 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1492 case TREE_LIST: return TS_LIST;
1493 case TREE_VEC: return TS_VEC;
1494 case PLACEHOLDER_EXPR: return TS_COMMON;
1501 /* Perform any modifications to EXPR required when it is unsaved. Does
1502 not recurse into EXPR's subtrees. */
1505 unsave_expr_1 (expr)
1508 switch (TREE_CODE (expr))
1511 if (! SAVE_EXPR_PERSISTENT_P (expr))
1512 SAVE_EXPR_RTL (expr) = 0;
1516 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1517 It's OK for this to happen if it was part of a subtree that
1518 isn't immediately expanded, such as operand 2 of another
1520 if (TREE_OPERAND (expr, 1))
1523 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1524 TREE_OPERAND (expr, 3) = NULL_TREE;
1528 /* I don't yet know how to emit a sequence multiple times. */
1529 if (RTL_EXPR_SEQUENCE (expr) != 0)
1538 /* Default lang hook for "unsave_expr_now". */
1541 lhd_unsave_expr_now (expr)
1544 enum tree_code code;
1546 /* There's nothing to do for NULL_TREE. */
1550 unsave_expr_1 (expr);
1552 code = TREE_CODE (expr);
1553 switch (TREE_CODE_CLASS (code))
1555 case 'c': /* a constant */
1556 case 't': /* a type node */
1557 case 'd': /* A decl node */
1558 case 'b': /* A block node */
1561 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1562 if (code == TREE_LIST)
1564 lhd_unsave_expr_now (TREE_VALUE (expr));
1565 lhd_unsave_expr_now (TREE_CHAIN (expr));
1569 case 'e': /* an expression */
1570 case 'r': /* a reference */
1571 case 's': /* an expression with side effects */
1572 case '<': /* a comparison expression */
1573 case '2': /* a binary arithmetic expression */
1574 case '1': /* a unary arithmetic expression */
1578 for (i = first_rtl_op (code) - 1; i >= 0; i--)
1579 lhd_unsave_expr_now (TREE_OPERAND (expr, i));
1590 /* Return 0 if it is safe to evaluate EXPR multiple times,
1591 return 1 if it is safe if EXPR is unsaved afterward, or
1592 return 2 if it is completely unsafe.
1594 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1595 an expression tree, so that it safe to unsave them and the surrounding
1596 context will be correct.
1598 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1599 occasionally across the whole of a function. It is therefore only
1600 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1601 below the UNSAVE_EXPR.
1603 RTL_EXPRs consume their rtl during evaluation. It is therefore
1604 never possible to unsave them. */
1607 unsafe_for_reeval (expr)
1611 enum tree_code code;
1616 if (expr == NULL_TREE)
1619 code = TREE_CODE (expr);
1620 first_rtl = first_rtl_op (code);
1629 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1631 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1632 unsafeness = MAX (tmp, unsafeness);
1638 tmp2 = unsafe_for_reeval (TREE_OPERAND (expr, 0));
1639 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1640 return MAX (MAX (tmp, 1), tmp2);
1647 tmp = (*lang_hooks.unsafe_for_reeval) (expr);
1653 switch (TREE_CODE_CLASS (code))
1655 case 'c': /* a constant */
1656 case 't': /* a type node */
1657 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1658 case 'd': /* A decl node */
1659 case 'b': /* A block node */
1662 case 'e': /* an expression */
1663 case 'r': /* a reference */
1664 case 's': /* an expression with side effects */
1665 case '<': /* a comparison expression */
1666 case '2': /* a binary arithmetic expression */
1667 case '1': /* a unary arithmetic expression */
1668 for (i = first_rtl - 1; i >= 0; i--)
1670 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1671 unsafeness = MAX (tmp, unsafeness);
1681 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1682 or offset that depends on a field within a record. */
1685 contains_placeholder_p (exp)
1688 enum tree_code code;
1694 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1695 in it since it is supplying a value for it. */
1696 code = TREE_CODE (exp);
1697 if (code == WITH_RECORD_EXPR)
1699 else if (code == PLACEHOLDER_EXPR)
1702 switch (TREE_CODE_CLASS (code))
1705 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1706 position computations since they will be converted into a
1707 WITH_RECORD_EXPR involving the reference, which will assume
1708 here will be valid. */
1709 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1712 if (code == TREE_LIST)
1713 return (contains_placeholder_p (TREE_VALUE (exp))
1714 || (TREE_CHAIN (exp) != 0
1715 && contains_placeholder_p (TREE_CHAIN (exp))));
1724 /* Ignoring the first operand isn't quite right, but works best. */
1725 return contains_placeholder_p (TREE_OPERAND (exp, 1));
1732 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1733 || contains_placeholder_p (TREE_OPERAND (exp, 1))
1734 || contains_placeholder_p (TREE_OPERAND (exp, 2)));
1737 /* If we already know this doesn't have a placeholder, don't
1739 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1742 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1743 result = contains_placeholder_p (TREE_OPERAND (exp, 0));
1745 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1750 return (TREE_OPERAND (exp, 1) != 0
1751 && contains_placeholder_p (TREE_OPERAND (exp, 1)));
1757 switch (TREE_CODE_LENGTH (code))
1760 return contains_placeholder_p (TREE_OPERAND (exp, 0));
1762 return (contains_placeholder_p (TREE_OPERAND (exp, 0))
1763 || contains_placeholder_p (TREE_OPERAND (exp, 1)));
1774 /* Return 1 if EXP contains any expressions that produce cleanups for an
1775 outer scope to deal with. Used by fold. */
1783 if (! TREE_SIDE_EFFECTS (exp))
1786 switch (TREE_CODE (exp))
1789 case GOTO_SUBROUTINE_EXPR:
1790 case WITH_CLEANUP_EXPR:
1793 case CLEANUP_POINT_EXPR:
1797 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1799 cmp = has_cleanups (TREE_VALUE (exp));
1809 /* This general rule works for most tree codes. All exceptions should be
1810 handled above. If this is a language-specific tree code, we can't
1811 trust what might be in the operand, so say we don't know
1813 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1816 nops = first_rtl_op (TREE_CODE (exp));
1817 for (i = 0; i < nops; i++)
1818 if (TREE_OPERAND (exp, i) != 0)
1820 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1821 if (type == 'e' || type == '<' || type == '1' || type == '2'
1822 || type == 'r' || type == 's')
1824 cmp = has_cleanups (TREE_OPERAND (exp, i));
1833 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1834 return a tree with all occurrences of references to F in a
1835 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1836 contains only arithmetic expressions or a CALL_EXPR with a
1837 PLACEHOLDER_EXPR occurring only in its arglist. */
1840 substitute_in_expr (exp, f, r)
1845 enum tree_code code = TREE_CODE (exp);
1850 switch (TREE_CODE_CLASS (code))
1857 if (code == PLACEHOLDER_EXPR)
1859 else if (code == TREE_LIST)
1861 op0 = (TREE_CHAIN (exp) == 0
1862 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
1863 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
1864 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1867 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1876 switch (TREE_CODE_LENGTH (code))
1879 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1880 if (op0 == TREE_OPERAND (exp, 0))
1883 if (code == NON_LVALUE_EXPR)
1886 new = fold (build1 (code, TREE_TYPE (exp), op0));
1890 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
1891 could, but we don't support it. */
1892 if (code == RTL_EXPR)
1894 else if (code == CONSTRUCTOR)
1897 op0 = TREE_OPERAND (exp, 0);
1898 op1 = TREE_OPERAND (exp, 1);
1899 if (contains_placeholder_p (op0))
1900 op0 = substitute_in_expr (op0, f, r);
1901 if (contains_placeholder_p (op1))
1902 op1 = substitute_in_expr (op1, f, r);
1904 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1907 new = fold (build (code, TREE_TYPE (exp), op0, op1));
1911 /* It cannot be that anything inside a SAVE_EXPR contains a
1912 PLACEHOLDER_EXPR. */
1913 if (code == SAVE_EXPR)
1916 else if (code == CALL_EXPR)
1918 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
1919 if (op1 == TREE_OPERAND (exp, 1))
1922 return build (code, TREE_TYPE (exp),
1923 TREE_OPERAND (exp, 0), op1, NULL_TREE);
1926 else if (code != COND_EXPR)
1929 op0 = TREE_OPERAND (exp, 0);
1930 op1 = TREE_OPERAND (exp, 1);
1931 op2 = TREE_OPERAND (exp, 2);
1933 if (contains_placeholder_p (op0))
1934 op0 = substitute_in_expr (op0, f, r);
1935 if (contains_placeholder_p (op1))
1936 op1 = substitute_in_expr (op1, f, r);
1937 if (contains_placeholder_p (op2))
1938 op2 = substitute_in_expr (op2, f, r);
1940 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1941 && op2 == TREE_OPERAND (exp, 2))
1944 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
1957 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1958 and it is the right field, replace it with R. */
1959 for (inner = TREE_OPERAND (exp, 0);
1960 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1961 inner = TREE_OPERAND (inner, 0))
1963 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1964 && TREE_OPERAND (exp, 1) == f)
1967 /* If this expression hasn't been completed let, leave it
1969 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1970 && TREE_TYPE (inner) == 0)
1973 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1974 if (op0 == TREE_OPERAND (exp, 0))
1977 new = fold (build (code, TREE_TYPE (exp), op0,
1978 TREE_OPERAND (exp, 1)));
1982 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1983 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
1984 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
1985 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1986 && op2 == TREE_OPERAND (exp, 2))
1989 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
1994 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1995 if (op0 == TREE_OPERAND (exp, 0))
1998 new = fold (build1 (code, TREE_TYPE (exp), op0));
2010 TREE_READONLY (new) = TREE_READONLY (exp);
2014 /* Stabilize a reference so that we can use it any number of times
2015 without causing its operands to be evaluated more than once.
2016 Returns the stabilized reference. This works by means of save_expr,
2017 so see the caveats in the comments about save_expr.
2019 Also allows conversion expressions whose operands are references.
2020 Any other kind of expression is returned unchanged. */
2023 stabilize_reference (ref)
2027 enum tree_code code = TREE_CODE (ref);
2034 /* No action is needed in this case. */
2040 case FIX_TRUNC_EXPR:
2041 case FIX_FLOOR_EXPR:
2042 case FIX_ROUND_EXPR:
2044 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2048 result = build_nt (INDIRECT_REF,
2049 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2053 result = build_nt (COMPONENT_REF,
2054 stabilize_reference (TREE_OPERAND (ref, 0)),
2055 TREE_OPERAND (ref, 1));
2059 result = build_nt (BIT_FIELD_REF,
2060 stabilize_reference (TREE_OPERAND (ref, 0)),
2061 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2062 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2066 result = build_nt (ARRAY_REF,
2067 stabilize_reference (TREE_OPERAND (ref, 0)),
2068 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2071 case ARRAY_RANGE_REF:
2072 result = build_nt (ARRAY_RANGE_REF,
2073 stabilize_reference (TREE_OPERAND (ref, 0)),
2074 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2078 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2079 it wouldn't be ignored. This matters when dealing with
2081 return stabilize_reference_1 (ref);
2084 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2085 save_expr (build1 (ADDR_EXPR,
2086 build_pointer_type (TREE_TYPE (ref)),
2090 /* If arg isn't a kind of lvalue we recognize, make no change.
2091 Caller should recognize the error for an invalid lvalue. */
2096 return error_mark_node;
2099 TREE_TYPE (result) = TREE_TYPE (ref);
2100 TREE_READONLY (result) = TREE_READONLY (ref);
2101 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2102 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2107 /* Subroutine of stabilize_reference; this is called for subtrees of
2108 references. Any expression with side-effects must be put in a SAVE_EXPR
2109 to ensure that it is only evaluated once.
2111 We don't put SAVE_EXPR nodes around everything, because assigning very
2112 simple expressions to temporaries causes us to miss good opportunities
2113 for optimizations. Among other things, the opportunity to fold in the
2114 addition of a constant into an addressing mode often gets lost, e.g.
2115 "y[i+1] += x;". In general, we take the approach that we should not make
2116 an assignment unless we are forced into it - i.e., that any non-side effect
2117 operator should be allowed, and that cse should take care of coalescing
2118 multiple utterances of the same expression should that prove fruitful. */
2121 stabilize_reference_1 (e)
2125 enum tree_code code = TREE_CODE (e);
2127 /* We cannot ignore const expressions because it might be a reference
2128 to a const array but whose index contains side-effects. But we can
2129 ignore things that are actual constant or that already have been
2130 handled by this function. */
2132 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2135 switch (TREE_CODE_CLASS (code))
2145 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2146 so that it will only be evaluated once. */
2147 /* The reference (r) and comparison (<) classes could be handled as
2148 below, but it is generally faster to only evaluate them once. */
2149 if (TREE_SIDE_EFFECTS (e))
2150 return save_expr (e);
2154 /* Constants need no processing. In fact, we should never reach
2159 /* Division is slow and tends to be compiled with jumps,
2160 especially the division by powers of 2 that is often
2161 found inside of an array reference. So do it just once. */
2162 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2163 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2164 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2165 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2166 return save_expr (e);
2167 /* Recursively stabilize each operand. */
2168 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2169 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2173 /* Recursively stabilize each operand. */
2174 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2181 TREE_TYPE (result) = TREE_TYPE (e);
2182 TREE_READONLY (result) = TREE_READONLY (e);
2183 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2184 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2189 /* Low-level constructors for expressions. */
2191 /* Build an expression of code CODE, data type TYPE,
2192 and operands as specified by the arguments ARG1 and following arguments.
2193 Expressions and reference nodes can be created this way.
2194 Constants, decls, types and misc nodes cannot be. */
2197 build VPARAMS ((enum tree_code code, tree tt, ...))
2206 VA_FIXEDARG (p, enum tree_code, code);
2207 VA_FIXEDARG (p, tree, tt);
2209 t = make_node (code);
2210 length = TREE_CODE_LENGTH (code);
2213 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2214 result based on those same flags for the arguments. But if the
2215 arguments aren't really even `tree' expressions, we shouldn't be trying
2217 fro = first_rtl_op (code);
2219 /* Expressions without side effects may be constant if their
2220 arguments are as well. */
2221 constant = (TREE_CODE_CLASS (code) == '<'
2222 || TREE_CODE_CLASS (code) == '1'
2223 || TREE_CODE_CLASS (code) == '2'
2224 || TREE_CODE_CLASS (code) == 'c');
2228 /* This is equivalent to the loop below, but faster. */
2229 tree arg0 = va_arg (p, tree);
2230 tree arg1 = va_arg (p, tree);
2232 TREE_OPERAND (t, 0) = arg0;
2233 TREE_OPERAND (t, 1) = arg1;
2234 TREE_READONLY (t) = 1;
2235 if (arg0 && fro > 0)
2237 if (TREE_SIDE_EFFECTS (arg0))
2238 TREE_SIDE_EFFECTS (t) = 1;
2239 if (!TREE_READONLY (arg0))
2240 TREE_READONLY (t) = 0;
2241 if (!TREE_CONSTANT (arg0))
2245 if (arg1 && fro > 1)
2247 if (TREE_SIDE_EFFECTS (arg1))
2248 TREE_SIDE_EFFECTS (t) = 1;
2249 if (!TREE_READONLY (arg1))
2250 TREE_READONLY (t) = 0;
2251 if (!TREE_CONSTANT (arg1))
2255 else if (length == 1)
2257 tree arg0 = va_arg (p, tree);
2259 /* The only one-operand cases we handle here are those with side-effects.
2260 Others are handled with build1. So don't bother checked if the
2261 arg has side-effects since we'll already have set it.
2263 ??? This really should use build1 too. */
2264 if (TREE_CODE_CLASS (code) != 's')
2266 TREE_OPERAND (t, 0) = arg0;
2270 for (i = 0; i < length; i++)
2272 tree operand = va_arg (p, tree);
2274 TREE_OPERAND (t, i) = operand;
2275 if (operand && fro > i)
2277 if (TREE_SIDE_EFFECTS (operand))
2278 TREE_SIDE_EFFECTS (t) = 1;
2279 if (!TREE_CONSTANT (operand))
2286 TREE_CONSTANT (t) = constant;
2290 /* Same as above, but only builds for unary operators.
2291 Saves lions share of calls to `build'; cuts down use
2292 of varargs, which is expensive for RISC machines. */
2295 build1 (code, type, node)
2296 enum tree_code code;
2300 int length = sizeof (struct tree_exp);
2301 #ifdef GATHER_STATISTICS
2302 tree_node_kind kind;
2306 #ifdef GATHER_STATISTICS
2307 switch (TREE_CODE_CLASS (code))
2309 case 's': /* an expression with side effects */
2312 case 'r': /* a reference */
2320 tree_node_counts[(int) kind]++;
2321 tree_node_sizes[(int) kind] += length;
2324 #ifdef ENABLE_CHECKING
2325 if (TREE_CODE_CLASS (code) == '2'
2326 || TREE_CODE_CLASS (code) == '<'
2327 || TREE_CODE_LENGTH (code) != 1)
2329 #endif /* ENABLE_CHECKING */
2331 t = ggc_alloc_tree (length);
2333 memset ((PTR) t, 0, sizeof (struct tree_common));
2335 TREE_SET_CODE (t, code);
2337 TREE_TYPE (t) = type;
2338 TREE_COMPLEXITY (t) = 0;
2339 TREE_OPERAND (t, 0) = node;
2340 if (node && first_rtl_op (code) != 0)
2342 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2343 TREE_READONLY (t) = TREE_READONLY (node);
2346 if (TREE_CODE_CLASS (code) == 's')
2347 TREE_SIDE_EFFECTS (t) = 1;
2354 case PREDECREMENT_EXPR:
2355 case PREINCREMENT_EXPR:
2356 case POSTDECREMENT_EXPR:
2357 case POSTINCREMENT_EXPR:
2358 /* All of these have side-effects, no matter what their
2360 TREE_SIDE_EFFECTS (t) = 1;
2361 TREE_READONLY (t) = 0;
2365 /* Whether a dereference is readonly has nothing to do with whether
2366 its operand is readonly. */
2367 TREE_READONLY (t) = 0;
2371 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2372 TREE_CONSTANT (t) = 1;
2379 /* Similar except don't specify the TREE_TYPE
2380 and leave the TREE_SIDE_EFFECTS as 0.
2381 It is permissible for arguments to be null,
2382 or even garbage if their values do not matter. */
2385 build_nt VPARAMS ((enum tree_code code, ...))
2392 VA_FIXEDARG (p, enum tree_code, code);
2394 t = make_node (code);
2395 length = TREE_CODE_LENGTH (code);
2397 for (i = 0; i < length; i++)
2398 TREE_OPERAND (t, i) = va_arg (p, tree);
2404 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2405 We do NOT enter this node in any sort of symbol table.
2407 layout_decl is used to set up the decl's storage layout.
2408 Other slots are initialized to 0 or null pointers. */
2411 build_decl (code, name, type)
2412 enum tree_code code;
2417 t = make_node (code);
2419 /* if (type == error_mark_node)
2420 type = integer_type_node; */
2421 /* That is not done, deliberately, so that having error_mark_node
2422 as the type can suppress useless errors in the use of this variable. */
2424 DECL_NAME (t) = name;
2425 TREE_TYPE (t) = type;
2427 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2429 else if (code == FUNCTION_DECL)
2430 DECL_MODE (t) = FUNCTION_MODE;
2435 /* BLOCK nodes are used to represent the structure of binding contours
2436 and declarations, once those contours have been exited and their contents
2437 compiled. This information is used for outputting debugging info. */
2440 build_block (vars, tags, subblocks, supercontext, chain)
2441 tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain;
2443 tree block = make_node (BLOCK);
2445 BLOCK_VARS (block) = vars;
2446 BLOCK_SUBBLOCKS (block) = subblocks;
2447 BLOCK_SUPERCONTEXT (block) = supercontext;
2448 BLOCK_CHAIN (block) = chain;
2452 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2453 location where an expression or an identifier were encountered. It
2454 is necessary for languages where the frontend parser will handle
2455 recursively more than one file (Java is one of them). */
2458 build_expr_wfl (node, file, line, col)
2463 static const char *last_file = 0;
2464 static tree last_filenode = NULL_TREE;
2465 tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2467 EXPR_WFL_NODE (wfl) = node;
2468 EXPR_WFL_SET_LINECOL (wfl, line, col);
2469 if (file != last_file)
2472 last_filenode = file ? get_identifier (file) : NULL_TREE;
2475 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2478 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2479 TREE_TYPE (wfl) = TREE_TYPE (node);
2485 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2489 build_decl_attribute_variant (ddecl, attribute)
2490 tree ddecl, attribute;
2492 DECL_ATTRIBUTES (ddecl) = attribute;
2496 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2499 Record such modified types already made so we don't make duplicates. */
2502 build_type_attribute_variant (ttype, attribute)
2503 tree ttype, attribute;
2505 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2507 unsigned int hashcode;
2510 ntype = copy_node (ttype);
2512 TYPE_POINTER_TO (ntype) = 0;
2513 TYPE_REFERENCE_TO (ntype) = 0;
2514 TYPE_ATTRIBUTES (ntype) = attribute;
2516 /* Create a new main variant of TYPE. */
2517 TYPE_MAIN_VARIANT (ntype) = ntype;
2518 TYPE_NEXT_VARIANT (ntype) = 0;
2519 set_type_quals (ntype, TYPE_UNQUALIFIED);
2521 hashcode = (TYPE_HASH (TREE_CODE (ntype))
2522 + TYPE_HASH (TREE_TYPE (ntype))
2523 + attribute_hash_list (attribute));
2525 switch (TREE_CODE (ntype))
2528 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2531 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2534 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2537 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2543 ntype = type_hash_canon (hashcode, ntype);
2544 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2550 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2553 We try both `text' and `__text__', ATTR may be either one. */
2554 /* ??? It might be a reasonable simplification to require ATTR to be only
2555 `text'. One might then also require attribute lists to be stored in
2556 their canonicalized form. */
2559 is_attribute_p (attr, ident)
2563 int ident_len, attr_len;
2566 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2569 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2572 p = IDENTIFIER_POINTER (ident);
2573 ident_len = strlen (p);
2574 attr_len = strlen (attr);
2576 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2580 || attr[attr_len - 2] != '_'
2581 || attr[attr_len - 1] != '_')
2583 if (ident_len == attr_len - 4
2584 && strncmp (attr + 2, p, attr_len - 4) == 0)
2589 if (ident_len == attr_len + 4
2590 && p[0] == '_' && p[1] == '_'
2591 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2592 && strncmp (attr, p + 2, attr_len) == 0)
2599 /* Given an attribute name and a list of attributes, return a pointer to the
2600 attribute's list element if the attribute is part of the list, or NULL_TREE
2601 if not found. If the attribute appears more than once, this only
2602 returns the first occurrence; the TREE_CHAIN of the return value should
2603 be passed back in if further occurrences are wanted. */
2606 lookup_attribute (attr_name, list)
2607 const char *attr_name;
2612 for (l = list; l; l = TREE_CHAIN (l))
2614 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2616 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2623 /* Return an attribute list that is the union of a1 and a2. */
2626 merge_attributes (a1, a2)
2631 /* Either one unset? Take the set one. */
2633 if ((attributes = a1) == 0)
2636 /* One that completely contains the other? Take it. */
2638 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2640 if (attribute_list_contained (a2, a1))
2644 /* Pick the longest list, and hang on the other list. */
2646 if (list_length (a1) < list_length (a2))
2647 attributes = a2, a2 = a1;
2649 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2652 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2655 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2658 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2663 a1 = copy_node (a2);
2664 TREE_CHAIN (a1) = attributes;
2673 /* Given types T1 and T2, merge their attributes and return
2677 merge_type_attributes (t1, t2)
2680 return merge_attributes (TYPE_ATTRIBUTES (t1),
2681 TYPE_ATTRIBUTES (t2));
2684 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2688 merge_decl_attributes (olddecl, newdecl)
2689 tree olddecl, newdecl;
2691 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2692 DECL_ATTRIBUTES (newdecl));
2695 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2697 /* Specialization of merge_decl_attributes for various Windows targets.
2699 This handles the following situation:
2701 __declspec (dllimport) int foo;
2704 The second instance of `foo' nullifies the dllimport. */
2707 merge_dllimport_decl_attributes (old, new)
2712 int delete_dllimport_p;
2714 old = DECL_ATTRIBUTES (old);
2715 new = DECL_ATTRIBUTES (new);
2717 /* What we need to do here is remove from `old' dllimport if it doesn't
2718 appear in `new'. dllimport behaves like extern: if a declaration is
2719 marked dllimport and a definition appears later, then the object
2720 is not dllimport'd. */
2721 if (lookup_attribute ("dllimport", old) != NULL_TREE
2722 && lookup_attribute ("dllimport", new) == NULL_TREE)
2723 delete_dllimport_p = 1;
2725 delete_dllimport_p = 0;
2727 a = merge_attributes (old, new);
2729 if (delete_dllimport_p)
2733 /* Scan the list for dllimport and delete it. */
2734 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
2736 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
2738 if (prev == NULL_TREE)
2741 TREE_CHAIN (prev) = TREE_CHAIN (t);
2750 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2752 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2753 of the various TYPE_QUAL values. */
2756 set_type_quals (type, type_quals)
2760 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
2761 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
2762 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
2765 /* Return a version of the TYPE, qualified as indicated by the
2766 TYPE_QUALS, if one exists. If no qualified version exists yet,
2767 return NULL_TREE. */
2770 get_qualified_type (type, type_quals)
2776 /* Search the chain of variants to see if there is already one there just
2777 like the one we need to have. If so, use that existing one. We must
2778 preserve the TYPE_NAME, since there is code that depends on this. */
2779 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2780 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type)
2781 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
2787 /* Like get_qualified_type, but creates the type if it does not
2788 exist. This function never returns NULL_TREE. */
2791 build_qualified_type (type, type_quals)
2797 /* See if we already have the appropriate qualified variant. */
2798 t = get_qualified_type (type, type_quals);
2800 /* If not, build it. */
2803 t = build_type_copy (type);
2804 set_type_quals (t, type_quals);
2810 /* Create a new variant of TYPE, equivalent but distinct.
2811 This is so the caller can modify it. */
2814 build_type_copy (type)
2817 tree t, m = TYPE_MAIN_VARIANT (type);
2819 t = copy_node (type);
2821 TYPE_POINTER_TO (t) = 0;
2822 TYPE_REFERENCE_TO (t) = 0;
2824 /* Add this type to the chain of variants of TYPE. */
2825 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
2826 TYPE_NEXT_VARIANT (m) = t;
2831 /* Hashing of types so that we don't make duplicates.
2832 The entry point is `type_hash_canon'. */
2834 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2835 with types in the TREE_VALUE slots), by adding the hash codes
2836 of the individual types. */
2839 type_hash_list (list)
2842 unsigned int hashcode;
2845 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
2846 hashcode += TYPE_HASH (TREE_VALUE (tail));
2851 /* These are the Hashtable callback functions. */
2853 /* Returns true if the types are equal. */
2856 type_hash_eq (va, vb)
2860 const struct type_hash *a = va, *b = vb;
2861 if (a->hash == b->hash
2862 && TREE_CODE (a->type) == TREE_CODE (b->type)
2863 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
2864 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
2865 TYPE_ATTRIBUTES (b->type))
2866 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
2867 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
2868 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
2869 TYPE_MAX_VALUE (b->type)))
2870 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
2871 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
2872 TYPE_MIN_VALUE (b->type)))
2873 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
2874 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
2875 || (TYPE_DOMAIN (a->type)
2876 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
2877 && TYPE_DOMAIN (b->type)
2878 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
2879 && type_list_equal (TYPE_DOMAIN (a->type),
2880 TYPE_DOMAIN (b->type)))))
2885 /* Return the cached hash value. */
2888 type_hash_hash (item)
2891 return ((const struct type_hash *) item)->hash;
2894 /* Look in the type hash table for a type isomorphic to TYPE.
2895 If one is found, return it. Otherwise return 0. */
2898 type_hash_lookup (hashcode, type)
2899 unsigned int hashcode;
2902 struct type_hash *h, in;
2904 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
2905 must call that routine before comparing TYPE_ALIGNs. */
2911 h = htab_find_with_hash (type_hash_table, &in, hashcode);
2917 /* Add an entry to the type-hash-table
2918 for a type TYPE whose hash code is HASHCODE. */
2921 type_hash_add (hashcode, type)
2922 unsigned int hashcode;
2925 struct type_hash *h;
2928 h = (struct type_hash *) ggc_alloc (sizeof (struct type_hash));
2931 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
2932 *(struct type_hash **) loc = h;
2935 /* Given TYPE, and HASHCODE its hash code, return the canonical
2936 object for an identical type if one already exists.
2937 Otherwise, return TYPE, and record it as the canonical object
2938 if it is a permanent object.
2940 To use this function, first create a type of the sort you want.
2941 Then compute its hash code from the fields of the type that
2942 make it different from other similar types.
2943 Then call this function and use the value.
2944 This function frees the type you pass in if it is a duplicate. */
2946 /* Set to 1 to debug without canonicalization. Never set by program. */
2947 int debug_no_type_hash = 0;
2950 type_hash_canon (hashcode, type)
2951 unsigned int hashcode;
2956 if (debug_no_type_hash)
2959 /* See if the type is in the hash table already. If so, return it.
2960 Otherwise, add the type. */
2961 t1 = type_hash_lookup (hashcode, type);
2964 #ifdef GATHER_STATISTICS
2965 tree_node_counts[(int) t_kind]--;
2966 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
2972 type_hash_add (hashcode, type);
2977 /* See if the data pointed to by the type hash table is marked. We consider
2978 it marked if the type is marked or if a debug type number or symbol
2979 table entry has been made for the type. This reduces the amount of
2980 debugging output and eliminates that dependency of the debug output on
2981 the number of garbage collections. */
2984 type_hash_marked_p (p)
2987 tree type = ((struct type_hash *) p)->type;
2989 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
2993 print_type_hash_statistics ()
2995 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
2996 (long) htab_size (type_hash_table),
2997 (long) htab_elements (type_hash_table),
2998 htab_collisions (type_hash_table));
3001 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3002 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3003 by adding the hash codes of the individual attributes. */
3006 attribute_hash_list (list)
3009 unsigned int hashcode;
3012 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3013 /* ??? Do we want to add in TREE_VALUE too? */
3014 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3018 /* Given two lists of attributes, return true if list l2 is
3019 equivalent to l1. */
3022 attribute_list_equal (l1, l2)
3025 return attribute_list_contained (l1, l2)
3026 && attribute_list_contained (l2, l1);
3029 /* Given two lists of attributes, return true if list L2 is
3030 completely contained within L1. */
3031 /* ??? This would be faster if attribute names were stored in a canonicalized
3032 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3033 must be used to show these elements are equivalent (which they are). */
3034 /* ??? It's not clear that attributes with arguments will always be handled
3038 attribute_list_contained (l1, l2)
3043 /* First check the obvious, maybe the lists are identical. */
3047 /* Maybe the lists are similar. */
3048 for (t1 = l1, t2 = l2;
3050 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3051 && TREE_VALUE (t1) == TREE_VALUE (t2);
3052 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3054 /* Maybe the lists are equal. */
3055 if (t1 == 0 && t2 == 0)
3058 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3061 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3063 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3066 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3073 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3080 /* Given two lists of types
3081 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3082 return 1 if the lists contain the same types in the same order.
3083 Also, the TREE_PURPOSEs must match. */
3086 type_list_equal (l1, l2)
3091 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3092 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3093 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3094 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3095 && (TREE_TYPE (TREE_PURPOSE (t1))
3096 == TREE_TYPE (TREE_PURPOSE (t2))))))
3102 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3103 given by TYPE. If the argument list accepts variable arguments,
3104 then this function counts only the ordinary arguments. */
3107 type_num_arguments (type)
3113 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3114 /* If the function does not take a variable number of arguments,
3115 the last element in the list will have type `void'. */
3116 if (VOID_TYPE_P (TREE_VALUE (t)))
3124 /* Nonzero if integer constants T1 and T2
3125 represent the same constant value. */
3128 tree_int_cst_equal (t1, t2)
3134 if (t1 == 0 || t2 == 0)
3137 if (TREE_CODE (t1) == INTEGER_CST
3138 && TREE_CODE (t2) == INTEGER_CST
3139 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3140 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3146 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3147 The precise way of comparison depends on their data type. */
3150 tree_int_cst_lt (t1, t2)
3156 if (TREE_UNSIGNED (TREE_TYPE (t1)) != TREE_UNSIGNED (TREE_TYPE (t2)))
3158 int t1_sgn = tree_int_cst_sgn (t1);
3159 int t2_sgn = tree_int_cst_sgn (t2);
3161 if (t1_sgn < t2_sgn)
3163 else if (t1_sgn > t2_sgn)
3165 /* Otherwise, both are non-negative, so we compare them as
3166 unsigned just in case one of them would overflow a signed
3169 else if (! TREE_UNSIGNED (TREE_TYPE (t1)))
3170 return INT_CST_LT (t1, t2);
3172 return INT_CST_LT_UNSIGNED (t1, t2);
3175 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3178 tree_int_cst_compare (t1, t2)
3182 if (tree_int_cst_lt (t1, t2))
3184 else if (tree_int_cst_lt (t2, t1))
3190 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3191 the host. If POS is zero, the value can be represented in a single
3192 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3193 be represented in a single unsigned HOST_WIDE_INT. */
3196 host_integerp (t, pos)
3200 return (TREE_CODE (t) == INTEGER_CST
3201 && ! TREE_OVERFLOW (t)
3202 && ((TREE_INT_CST_HIGH (t) == 0
3203 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3204 || (! pos && TREE_INT_CST_HIGH (t) == -1
3205 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3206 && ! TREE_UNSIGNED (TREE_TYPE (t)))
3207 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3210 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3211 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3212 be positive. Abort if we cannot satisfy the above conditions. */
3215 tree_low_cst (t, pos)
3219 if (host_integerp (t, pos))
3220 return TREE_INT_CST_LOW (t);
3225 /* Return an indication of the sign of the integer constant T.
3226 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3227 Note that -1 will never be returned it T's type is unsigned. */
3230 tree_int_cst_sgn (t)
3233 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3235 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3237 else if (TREE_INT_CST_HIGH (t) < 0)
3243 /* Compare two constructor-element-type constants. Return 1 if the lists
3244 are known to be equal; otherwise return 0. */
3247 simple_cst_list_equal (l1, l2)
3250 while (l1 != NULL_TREE && l2 != NULL_TREE)
3252 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3255 l1 = TREE_CHAIN (l1);
3256 l2 = TREE_CHAIN (l2);
3262 /* Return truthvalue of whether T1 is the same tree structure as T2.
3263 Return 1 if they are the same.
3264 Return 0 if they are understandably different.
3265 Return -1 if either contains tree structure not understood by
3269 simple_cst_equal (t1, t2)
3272 enum tree_code code1, code2;
3278 if (t1 == 0 || t2 == 0)
3281 code1 = TREE_CODE (t1);
3282 code2 = TREE_CODE (t2);
3284 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3286 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3287 || code2 == NON_LVALUE_EXPR)
3288 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3290 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3293 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3294 || code2 == NON_LVALUE_EXPR)
3295 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3303 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3304 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3307 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3310 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3311 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3312 TREE_STRING_LENGTH (t1)));
3315 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3321 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3324 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3328 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3331 /* Special case: if either target is an unallocated VAR_DECL,
3332 it means that it's going to be unified with whatever the
3333 TARGET_EXPR is really supposed to initialize, so treat it
3334 as being equivalent to anything. */
3335 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3336 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3337 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3338 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3339 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3340 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3343 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3348 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3350 case WITH_CLEANUP_EXPR:
3351 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3355 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3358 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3359 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3373 /* This general rule works for most tree codes. All exceptions should be
3374 handled above. If this is a language-specific tree code, we can't
3375 trust what might be in the operand, so say we don't know
3377 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3380 switch (TREE_CODE_CLASS (code1))
3389 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3391 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3403 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3404 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3405 than U, respectively. */
3408 compare_tree_int (t, u)
3410 unsigned HOST_WIDE_INT u;
3412 if (tree_int_cst_sgn (t) < 0)
3414 else if (TREE_INT_CST_HIGH (t) != 0)
3416 else if (TREE_INT_CST_LOW (t) == u)
3418 else if (TREE_INT_CST_LOW (t) < u)
3424 /* Constructors for pointer, array and function types.
3425 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3426 constructed by language-dependent code, not here.) */
3428 /* Construct, lay out and return the type of pointers to TO_TYPE
3429 with mode MODE. If such a type has already been constructed,
3433 build_pointer_type_for_mode (to_type, mode)
3435 enum machine_mode mode;
3437 tree t = TYPE_POINTER_TO (to_type);
3439 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3440 if (t != 0 && mode == ptr_mode)
3443 t = make_node (POINTER_TYPE);
3445 TREE_TYPE (t) = to_type;
3446 TYPE_MODE (t) = mode;
3448 /* Record this type as the pointer to TO_TYPE. */
3449 if (mode == ptr_mode)
3450 TYPE_POINTER_TO (to_type) = t;
3452 /* Lay out the type. This function has many callers that are concerned
3453 with expression-construction, and this simplifies them all.
3454 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3460 /* By default build pointers in ptr_mode. */
3463 build_pointer_type (to_type)
3466 return build_pointer_type_for_mode (to_type, ptr_mode);
3469 /* Construct, lay out and return the type of references to TO_TYPE
3470 with mode MODE. If such a type has already been constructed,
3474 build_reference_type_for_mode (to_type, mode)
3476 enum machine_mode mode;
3478 tree t = TYPE_REFERENCE_TO (to_type);
3480 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3481 if (t != 0 && mode == ptr_mode)
3484 t = make_node (REFERENCE_TYPE);
3486 TREE_TYPE (t) = to_type;
3487 TYPE_MODE (t) = mode;
3489 /* Record this type as the pointer to TO_TYPE. */
3490 if (mode == ptr_mode)
3491 TYPE_REFERENCE_TO (to_type) = t;
3499 /* Build the node for the type of references-to-TO_TYPE by default
3503 build_reference_type (to_type)
3506 return build_reference_type_for_mode (to_type, ptr_mode);
3509 /* Build a type that is compatible with t but has no cv quals anywhere
3512 const char *const *const * -> char ***. */
3515 build_type_no_quals (t)
3518 switch (TREE_CODE (t))
3521 return build_pointer_type (build_type_no_quals (TREE_TYPE (t)));
3522 case REFERENCE_TYPE:
3523 return build_reference_type (build_type_no_quals (TREE_TYPE (t)));
3525 return TYPE_MAIN_VARIANT (t);
3529 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3530 MAXVAL should be the maximum value in the domain
3531 (one less than the length of the array).
3533 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3534 We don't enforce this limit, that is up to caller (e.g. language front end).
3535 The limit exists because the result is a signed type and we don't handle
3536 sizes that use more than one HOST_WIDE_INT. */
3539 build_index_type (maxval)
3542 tree itype = make_node (INTEGER_TYPE);
3544 TREE_TYPE (itype) = sizetype;
3545 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3546 TYPE_MIN_VALUE (itype) = size_zero_node;
3547 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3548 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3549 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3550 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
3551 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3552 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
3554 if (host_integerp (maxval, 1))
3555 return type_hash_canon (tree_low_cst (maxval, 1), itype);
3560 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3561 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3562 low bound LOWVAL and high bound HIGHVAL.
3563 if TYPE==NULL_TREE, sizetype is used. */
3566 build_range_type (type, lowval, highval)
3567 tree type, lowval, highval;
3569 tree itype = make_node (INTEGER_TYPE);
3571 TREE_TYPE (itype) = type;
3572 if (type == NULL_TREE)
3575 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3576 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
3578 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3579 TYPE_MODE (itype) = TYPE_MODE (type);
3580 TYPE_SIZE (itype) = TYPE_SIZE (type);
3581 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
3582 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3583 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
3585 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
3586 return type_hash_canon (tree_low_cst (highval, 0)
3587 - tree_low_cst (lowval, 0),
3593 /* Just like build_index_type, but takes lowval and highval instead
3594 of just highval (maxval). */
3597 build_index_2_type (lowval, highval)
3598 tree lowval, highval;
3600 return build_range_type (sizetype, lowval, highval);
3603 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3604 and number of elements specified by the range of values of INDEX_TYPE.
3605 If such a type has already been constructed, reuse it. */
3608 build_array_type (elt_type, index_type)
3609 tree elt_type, index_type;
3612 unsigned int hashcode;
3614 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3616 error ("arrays of functions are not meaningful");
3617 elt_type = integer_type_node;
3620 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3621 build_pointer_type (elt_type);
3623 /* Allocate the array after the pointer type,
3624 in case we free it in type_hash_canon. */
3625 t = make_node (ARRAY_TYPE);
3626 TREE_TYPE (t) = elt_type;
3627 TYPE_DOMAIN (t) = index_type;
3629 if (index_type == 0)
3634 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3635 t = type_hash_canon (hashcode, t);
3637 if (!COMPLETE_TYPE_P (t))
3642 /* Return the TYPE of the elements comprising
3643 the innermost dimension of ARRAY. */
3646 get_inner_array_type (array)
3649 tree type = TREE_TYPE (array);
3651 while (TREE_CODE (type) == ARRAY_TYPE)
3652 type = TREE_TYPE (type);
3657 /* Construct, lay out and return
3658 the type of functions returning type VALUE_TYPE
3659 given arguments of types ARG_TYPES.
3660 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3661 are data type nodes for the arguments of the function.
3662 If such a type has already been constructed, reuse it. */
3665 build_function_type (value_type, arg_types)
3666 tree value_type, arg_types;
3669 unsigned int hashcode;
3671 if (TREE_CODE (value_type) == FUNCTION_TYPE)
3673 error ("function return type cannot be function");
3674 value_type = integer_type_node;
3677 /* Make a node of the sort we want. */
3678 t = make_node (FUNCTION_TYPE);
3679 TREE_TYPE (t) = value_type;
3680 TYPE_ARG_TYPES (t) = arg_types;
3682 /* If we already have such a type, use the old one and free this one. */
3683 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
3684 t = type_hash_canon (hashcode, t);
3686 if (!COMPLETE_TYPE_P (t))
3691 /* Build a function type. The RETURN_TYPE is the type retured by the
3692 function. If additional arguments are provided, they are
3693 additional argument types. The list of argument types must always
3694 be terminated by NULL_TREE. */
3697 build_function_type_list VPARAMS ((tree return_type, ...))
3701 VA_OPEN (p, return_type);
3702 VA_FIXEDARG (p, tree, return_type);
3704 t = va_arg (p, tree);
3705 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
3706 args = tree_cons (NULL_TREE, t, args);
3709 args = nreverse (args);
3710 TREE_CHAIN (last) = void_list_node;
3711 args = build_function_type (return_type, args);
3717 /* Construct, lay out and return the type of methods belonging to class
3718 BASETYPE and whose arguments and values are described by TYPE.
3719 If that type exists already, reuse it.
3720 TYPE must be a FUNCTION_TYPE node. */
3723 build_method_type (basetype, type)
3724 tree basetype, type;
3727 unsigned int hashcode;
3729 /* Make a node of the sort we want. */
3730 t = make_node (METHOD_TYPE);
3732 if (TREE_CODE (type) != FUNCTION_TYPE)
3735 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3736 TREE_TYPE (t) = TREE_TYPE (type);
3738 /* The actual arglist for this function includes a "hidden" argument
3739 which is "this". Put it into the list of argument types. */
3742 = tree_cons (NULL_TREE,
3743 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
3745 /* If we already have such a type, use the old one and free this one. */
3746 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3747 t = type_hash_canon (hashcode, t);
3749 if (!COMPLETE_TYPE_P (t))
3755 /* Construct, lay out and return the type of offsets to a value
3756 of type TYPE, within an object of type BASETYPE.
3757 If a suitable offset type exists already, reuse it. */
3760 build_offset_type (basetype, type)
3761 tree basetype, type;
3764 unsigned int hashcode;
3766 /* Make a node of the sort we want. */
3767 t = make_node (OFFSET_TYPE);
3769 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3770 TREE_TYPE (t) = type;
3772 /* If we already have such a type, use the old one and free this one. */
3773 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3774 t = type_hash_canon (hashcode, t);
3776 if (!COMPLETE_TYPE_P (t))
3782 /* Create a complex type whose components are COMPONENT_TYPE. */
3785 build_complex_type (component_type)
3786 tree component_type;
3789 unsigned int hashcode;
3791 /* Make a node of the sort we want. */
3792 t = make_node (COMPLEX_TYPE);
3794 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
3795 set_type_quals (t, TYPE_QUALS (component_type));
3797 /* If we already have such a type, use the old one and free this one. */
3798 hashcode = TYPE_HASH (component_type);
3799 t = type_hash_canon (hashcode, t);
3801 if (!COMPLETE_TYPE_P (t))
3804 /* If we are writing Dwarf2 output we need to create a name,
3805 since complex is a fundamental type. */
3806 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
3810 if (component_type == char_type_node)
3811 name = "complex char";
3812 else if (component_type == signed_char_type_node)
3813 name = "complex signed char";
3814 else if (component_type == unsigned_char_type_node)
3815 name = "complex unsigned char";
3816 else if (component_type == short_integer_type_node)
3817 name = "complex short int";
3818 else if (component_type == short_unsigned_type_node)
3819 name = "complex short unsigned int";
3820 else if (component_type == integer_type_node)
3821 name = "complex int";
3822 else if (component_type == unsigned_type_node)
3823 name = "complex unsigned int";
3824 else if (component_type == long_integer_type_node)
3825 name = "complex long int";
3826 else if (component_type == long_unsigned_type_node)
3827 name = "complex long unsigned int";
3828 else if (component_type == long_long_integer_type_node)
3829 name = "complex long long int";
3830 else if (component_type == long_long_unsigned_type_node)
3831 name = "complex long long unsigned int";
3836 TYPE_NAME (t) = get_identifier (name);
3842 /* Return OP, stripped of any conversions to wider types as much as is safe.
3843 Converting the value back to OP's type makes a value equivalent to OP.
3845 If FOR_TYPE is nonzero, we return a value which, if converted to
3846 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
3848 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
3849 narrowest type that can hold the value, even if they don't exactly fit.
3850 Otherwise, bit-field references are changed to a narrower type
3851 only if they can be fetched directly from memory in that type.
3853 OP must have integer, real or enumeral type. Pointers are not allowed!
3855 There are some cases where the obvious value we could return
3856 would regenerate to OP if converted to OP's type,
3857 but would not extend like OP to wider types.
3858 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
3859 For example, if OP is (unsigned short)(signed char)-1,
3860 we avoid returning (signed char)-1 if FOR_TYPE is int,
3861 even though extending that to an unsigned short would regenerate OP,
3862 since the result of extending (signed char)-1 to (int)
3863 is different from (int) OP. */
3866 get_unwidened (op, for_type)
3870 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
3871 tree type = TREE_TYPE (op);
3873 = TYPE_PRECISION (for_type != 0 ? for_type : type);
3875 = (for_type != 0 && for_type != type
3876 && final_prec > TYPE_PRECISION (type)
3877 && TREE_UNSIGNED (type));
3880 while (TREE_CODE (op) == NOP_EXPR)
3883 = TYPE_PRECISION (TREE_TYPE (op))
3884 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
3886 /* Truncations are many-one so cannot be removed.
3887 Unless we are later going to truncate down even farther. */
3889 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
3892 /* See what's inside this conversion. If we decide to strip it,
3894 op = TREE_OPERAND (op, 0);
3896 /* If we have not stripped any zero-extensions (uns is 0),
3897 we can strip any kind of extension.
3898 If we have previously stripped a zero-extension,
3899 only zero-extensions can safely be stripped.
3900 Any extension can be stripped if the bits it would produce
3901 are all going to be discarded later by truncating to FOR_TYPE. */
3905 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
3907 /* TREE_UNSIGNED says whether this is a zero-extension.
3908 Let's avoid computing it if it does not affect WIN
3909 and if UNS will not be needed again. */
3910 if ((uns || TREE_CODE (op) == NOP_EXPR)
3911 && TREE_UNSIGNED (TREE_TYPE (op)))
3919 if (TREE_CODE (op) == COMPONENT_REF
3920 /* Since type_for_size always gives an integer type. */
3921 && TREE_CODE (type) != REAL_TYPE
3922 /* Don't crash if field not laid out yet. */
3923 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
3924 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
3926 unsigned int innerprec
3927 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
3928 int unsignedp = TREE_UNSIGNED (TREE_OPERAND (op, 1));
3929 type = (*lang_hooks.types.type_for_size) (innerprec, unsignedp);
3931 /* We can get this structure field in the narrowest type it fits in.
3932 If FOR_TYPE is 0, do this only for a field that matches the
3933 narrower type exactly and is aligned for it
3934 The resulting extension to its nominal type (a fullword type)
3935 must fit the same conditions as for other extensions. */
3937 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
3938 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
3939 && (! uns || final_prec <= innerprec || unsignedp)
3942 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
3943 TREE_OPERAND (op, 1));
3944 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
3945 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
3952 /* Return OP or a simpler expression for a narrower value
3953 which can be sign-extended or zero-extended to give back OP.
3954 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
3955 or 0 if the value should be sign-extended. */
3958 get_narrower (op, unsignedp_ptr)
3966 while (TREE_CODE (op) == NOP_EXPR)
3969 = (TYPE_PRECISION (TREE_TYPE (op))
3970 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
3972 /* Truncations are many-one so cannot be removed. */
3976 /* See what's inside this conversion. If we decide to strip it,
3981 op = TREE_OPERAND (op, 0);
3982 /* An extension: the outermost one can be stripped,
3983 but remember whether it is zero or sign extension. */
3985 uns = TREE_UNSIGNED (TREE_TYPE (op));
3986 /* Otherwise, if a sign extension has been stripped,
3987 only sign extensions can now be stripped;
3988 if a zero extension has been stripped, only zero-extensions. */
3989 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
3993 else /* bitschange == 0 */
3995 /* A change in nominal type can always be stripped, but we must
3996 preserve the unsignedness. */
3998 uns = TREE_UNSIGNED (TREE_TYPE (op));
4000 op = TREE_OPERAND (op, 0);
4006 if (TREE_CODE (op) == COMPONENT_REF
4007 /* Since type_for_size always gives an integer type. */
4008 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4009 /* Ensure field is laid out already. */
4010 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4012 unsigned HOST_WIDE_INT innerprec
4013 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4014 tree type = (*lang_hooks.types.type_for_size) (innerprec,
4015 TREE_UNSIGNED (op));
4017 /* We can get this structure field in a narrower type that fits it,
4018 but the resulting extension to its nominal type (a fullword type)
4019 must satisfy the same conditions as for other extensions.
4021 Do this only for fields that are aligned (not bit-fields),
4022 because when bit-field insns will be used there is no
4023 advantage in doing this. */
4025 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4026 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4027 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4031 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4032 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4033 TREE_OPERAND (op, 1));
4034 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4035 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4038 *unsignedp_ptr = uns;
4042 /* Nonzero if integer constant C has a value that is permissible
4043 for type TYPE (an INTEGER_TYPE). */
4046 int_fits_type_p (c, type)
4049 /* If the bounds of the type are integers, we can check ourselves.
4050 If not, but this type is a subtype, try checking against that.
4051 Otherwise, use force_fit_type, which checks against the precision. */
4052 if (TYPE_MAX_VALUE (type) != NULL_TREE
4053 && TYPE_MIN_VALUE (type) != NULL_TREE
4054 && TREE_CODE (TYPE_MAX_VALUE (type)) == INTEGER_CST
4055 && TREE_CODE (TYPE_MIN_VALUE (type)) == INTEGER_CST)
4057 if (TREE_UNSIGNED (type))
4058 return (! INT_CST_LT_UNSIGNED (TYPE_MAX_VALUE (type), c)
4059 && ! INT_CST_LT_UNSIGNED (c, TYPE_MIN_VALUE (type))
4060 /* Negative ints never fit unsigned types. */
4061 && ! (TREE_INT_CST_HIGH (c) < 0
4062 && ! TREE_UNSIGNED (TREE_TYPE (c))));
4064 return (! INT_CST_LT (TYPE_MAX_VALUE (type), c)
4065 && ! INT_CST_LT (c, TYPE_MIN_VALUE (type))
4066 /* Unsigned ints with top bit set never fit signed types. */
4067 && ! (TREE_INT_CST_HIGH (c) < 0
4068 && TREE_UNSIGNED (TREE_TYPE (c))));
4070 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4071 return int_fits_type_p (c, TREE_TYPE (type));
4075 TREE_TYPE (c) = type;
4076 return !force_fit_type (c, 0);
4080 /* Returns true if T is, contains, or refers to a type with variable
4081 size. This concept is more general than that of C99 'variably
4082 modified types': in C99, a struct type is never variably modified
4083 because a VLA may not appear as a structure member. However, in
4086 struct S { int i[f()]; };
4088 is valid, and other languages may define similar constructs. */
4091 variably_modified_type_p (type)
4094 if (type == error_mark_node)
4097 /* If TYPE itself has variable size, it is variably modified.
4099 We do not yet have a representation of the C99 '[*]' syntax.
4100 When a representation is chosen, this function should be modified
4101 to test for that case as well. */
4102 if (TYPE_SIZE (type)
4103 && TYPE_SIZE (type) != error_mark_node
4104 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4107 /* If TYPE is a pointer or reference, it is variably modified if
4108 the type pointed to is variably modified. */
4109 if ((TREE_CODE (type) == POINTER_TYPE
4110 || TREE_CODE (type) == REFERENCE_TYPE)
4111 && variably_modified_type_p (TREE_TYPE (type)))
4114 /* If TYPE is an array, it is variably modified if the array
4115 elements are. (Note that the VLA case has already been checked
4117 if (TREE_CODE (type) == ARRAY_TYPE
4118 && variably_modified_type_p (TREE_TYPE (type)))
4121 /* If TYPE is a function type, it is variably modified if any of the
4122 parameters or the return type are variably modified. */
4123 if (TREE_CODE (type) == FUNCTION_TYPE
4124 || TREE_CODE (type) == METHOD_TYPE)
4128 if (variably_modified_type_p (TREE_TYPE (type)))
4130 for (parm = TYPE_ARG_TYPES (type);
4131 parm && parm != void_list_node;
4132 parm = TREE_CHAIN (parm))
4133 if (variably_modified_type_p (TREE_VALUE (parm)))
4137 /* The current language may have other cases to check, but in general,
4138 all other types are not variably modified. */
4139 return (*lang_hooks.tree_inlining.var_mod_type_p) (type);
4142 /* Given a DECL or TYPE, return the scope in which it was declared, or
4143 NULL_TREE if there is no containing scope. */
4146 get_containing_scope (t)
4149 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4152 /* Return the innermost context enclosing DECL that is
4153 a FUNCTION_DECL, or zero if none. */
4156 decl_function_context (decl)
4161 if (TREE_CODE (decl) == ERROR_MARK)
4164 if (TREE_CODE (decl) == SAVE_EXPR)
4165 context = SAVE_EXPR_CONTEXT (decl);
4167 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4168 where we look up the function at runtime. Such functions always take
4169 a first argument of type 'pointer to real context'.
4171 C++ should really be fixed to use DECL_CONTEXT for the real context,
4172 and use something else for the "virtual context". */
4173 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4176 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4178 context = DECL_CONTEXT (decl);
4180 while (context && TREE_CODE (context) != FUNCTION_DECL)
4182 if (TREE_CODE (context) == BLOCK)
4183 context = BLOCK_SUPERCONTEXT (context);
4185 context = get_containing_scope (context);
4191 /* Return the innermost context enclosing DECL that is
4192 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4193 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4196 decl_type_context (decl)
4199 tree context = DECL_CONTEXT (decl);
4203 if (TREE_CODE (context) == NAMESPACE_DECL)
4206 if (TREE_CODE (context) == RECORD_TYPE
4207 || TREE_CODE (context) == UNION_TYPE
4208 || TREE_CODE (context) == QUAL_UNION_TYPE)
4211 if (TREE_CODE (context) == TYPE_DECL
4212 || TREE_CODE (context) == FUNCTION_DECL)
4213 context = DECL_CONTEXT (context);
4215 else if (TREE_CODE (context) == BLOCK)
4216 context = BLOCK_SUPERCONTEXT (context);
4219 /* Unhandled CONTEXT!? */
4225 /* CALL is a CALL_EXPR. Return the declaration for the function
4226 called, or NULL_TREE if the called function cannot be
4230 get_callee_fndecl (call)
4235 /* It's invalid to call this function with anything but a
4237 if (TREE_CODE (call) != CALL_EXPR)
4240 /* The first operand to the CALL is the address of the function
4242 addr = TREE_OPERAND (call, 0);
4246 /* If this is a readonly function pointer, extract its initial value. */
4247 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4248 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4249 && DECL_INITIAL (addr))
4250 addr = DECL_INITIAL (addr);
4252 /* If the address is just `&f' for some function `f', then we know
4253 that `f' is being called. */
4254 if (TREE_CODE (addr) == ADDR_EXPR
4255 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4256 return TREE_OPERAND (addr, 0);
4258 /* We couldn't figure out what was being called. */
4262 /* Print debugging information about tree nodes generated during the compile,
4263 and any language-specific information. */
4266 dump_tree_statistics ()
4268 #ifdef GATHER_STATISTICS
4270 int total_nodes, total_bytes;
4273 fprintf (stderr, "\n??? tree nodes created\n\n");
4274 #ifdef GATHER_STATISTICS
4275 fprintf (stderr, "Kind Nodes Bytes\n");
4276 fprintf (stderr, "-------------------------------------\n");
4277 total_nodes = total_bytes = 0;
4278 for (i = 0; i < (int) all_kinds; i++)
4280 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4281 tree_node_counts[i], tree_node_sizes[i]);
4282 total_nodes += tree_node_counts[i];
4283 total_bytes += tree_node_sizes[i];
4285 fprintf (stderr, "-------------------------------------\n");
4286 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4287 fprintf (stderr, "-------------------------------------\n");
4289 fprintf (stderr, "(No per-node statistics)\n");
4291 print_type_hash_statistics ();
4292 (*lang_hooks.print_statistics) ();
4295 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4297 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4298 clashes in cases where we can't reliably choose a unique name.
4300 Derived from mkstemp.c in libiberty. */
4303 append_random_chars (template)
4306 static const char letters[]
4307 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4308 static unsigned HOST_WIDE_INT value;
4309 unsigned HOST_WIDE_INT v;
4315 /* VALUE should be unique for each file and must not change between
4316 compiles since this can cause bootstrap comparison errors. */
4318 if (stat (main_input_filename, &st) < 0)
4320 /* This can happen when preprocessed text is shipped between
4321 machines, e.g. with bug reports. Assume that uniqueness
4322 isn't actually an issue. */
4327 /* In VMS, ino is an array, so we have to use both values. We
4328 conditionalize that. */
4330 #define INO_TO_INT(INO) ((int) (INO)[1] << 16 ^ (int) (INO)[2])
4332 #define INO_TO_INT(INO) INO
4334 value = st.st_dev ^ INO_TO_INT (st.st_ino) ^ st.st_mtime;
4338 template += strlen (template);
4342 /* Fill in the random bits. */
4343 template[0] = letters[v % 62];
4345 template[1] = letters[v % 62];
4347 template[2] = letters[v % 62];
4349 template[3] = letters[v % 62];
4351 template[4] = letters[v % 62];
4353 template[5] = letters[v % 62];
4358 /* P is a string that will be used in a symbol. Mask out any characters
4359 that are not valid in that context. */
4362 clean_symbol_name (p)
4367 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4370 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4377 /* Generate a name for a function unique to this translation unit.
4378 TYPE is some string to identify the purpose of this function to the
4379 linker or collect2. */
4382 get_file_function_name_long (type)
4389 if (first_global_object_name)
4390 p = first_global_object_name;
4393 /* We don't have anything that we know to be unique to this translation
4394 unit, so use what we do have and throw in some randomness. */
4396 const char *name = weak_global_object_name;
4397 const char *file = main_input_filename;
4402 file = input_filename;
4404 q = (char *) alloca (7 + strlen (name) + strlen (file));
4406 sprintf (q, "%s%s", name, file);
4407 append_random_chars (q);
4411 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
4414 /* Set up the name of the file-level functions we may need.
4415 Use a global object (which is already required to be unique over
4416 the program) rather than the file name (which imposes extra
4418 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4420 /* Don't need to pull weird characters out of global names. */
4421 if (p != first_global_object_name)
4422 clean_symbol_name (buf + 11);
4424 return get_identifier (buf);
4427 /* If KIND=='I', return a suitable global initializer (constructor) name.
4428 If KIND=='D', return a suitable global clean-up (destructor) name. */
4431 get_file_function_name (kind)
4439 return get_file_function_name_long (p);
4442 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4443 The result is placed in BUFFER (which has length BIT_SIZE),
4444 with one bit in each char ('\000' or '\001').
4446 If the constructor is constant, NULL_TREE is returned.
4447 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4450 get_set_constructor_bits (init, buffer, bit_size)
4457 HOST_WIDE_INT domain_min
4458 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4459 tree non_const_bits = NULL_TREE;
4461 for (i = 0; i < bit_size; i++)
4464 for (vals = TREE_OPERAND (init, 1);
4465 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4467 if (!host_integerp (TREE_VALUE (vals), 0)
4468 || (TREE_PURPOSE (vals) != NULL_TREE
4469 && !host_integerp (TREE_PURPOSE (vals), 0)))
4471 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4472 else if (TREE_PURPOSE (vals) != NULL_TREE)
4474 /* Set a range of bits to ones. */
4475 HOST_WIDE_INT lo_index
4476 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4477 HOST_WIDE_INT hi_index
4478 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4480 if (lo_index < 0 || lo_index >= bit_size
4481 || hi_index < 0 || hi_index >= bit_size)
4483 for (; lo_index <= hi_index; lo_index++)
4484 buffer[lo_index] = 1;
4488 /* Set a single bit to one. */
4490 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4491 if (index < 0 || index >= bit_size)
4493 error ("invalid initializer for bit string");
4499 return non_const_bits;
4502 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4503 The result is placed in BUFFER (which is an array of bytes).
4504 If the constructor is constant, NULL_TREE is returned.
4505 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4508 get_set_constructor_bytes (init, buffer, wd_size)
4510 unsigned char *buffer;
4514 int set_word_size = BITS_PER_UNIT;
4515 int bit_size = wd_size * set_word_size;
4517 unsigned char *bytep = buffer;
4518 char *bit_buffer = (char *) alloca (bit_size);
4519 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4521 for (i = 0; i < wd_size; i++)
4524 for (i = 0; i < bit_size; i++)
4528 if (BYTES_BIG_ENDIAN)
4529 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4531 *bytep |= 1 << bit_pos;
4534 if (bit_pos >= set_word_size)
4535 bit_pos = 0, bytep++;
4537 return non_const_bits;
4540 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4541 /* Complain that the tree code of NODE does not match the expected CODE.
4542 FILE, LINE, and FUNCTION are of the caller. */
4545 tree_check_failed (node, code, file, line, function)
4547 enum tree_code code;
4550 const char *function;
4552 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4553 tree_code_name[code], tree_code_name[TREE_CODE (node)],
4554 function, trim_filename (file), line);
4557 /* Similar to above, except that we check for a class of tree
4558 code, given in CL. */
4561 tree_class_check_failed (node, cl, file, line, function)
4566 const char *function;
4569 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4570 cl, TREE_CODE_CLASS (TREE_CODE (node)),
4571 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
4574 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
4575 (dynamically sized) vector. */
4578 tree_vec_elt_check_failed (idx, len, file, line, function)
4583 const char *function;
4586 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
4587 idx + 1, len, function, trim_filename (file), line);
4590 #endif /* ENABLE_TREE_CHECKING */
4592 /* For a new vector type node T, build the information necessary for
4593 debugging output. */
4596 finish_vector_type (t)
4602 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
4603 tree array = build_array_type (TREE_TYPE (t),
4604 build_index_type (index));
4605 tree rt = make_node (RECORD_TYPE);
4607 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
4608 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
4610 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
4611 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4612 the representation type, and we want to find that die when looking up
4613 the vector type. This is most easily achieved by making the TYPE_UID
4615 TYPE_UID (rt) = TYPE_UID (t);
4619 /* Create nodes for all integer types (and error_mark_node) using the sizes
4620 of C datatypes. The caller should call set_sizetype soon after calling
4621 this function to select one of the types as sizetype. */
4624 build_common_tree_nodes (signed_char)
4627 error_mark_node = make_node (ERROR_MARK);
4628 TREE_TYPE (error_mark_node) = error_mark_node;
4630 initialize_sizetypes ();
4632 /* Define both `signed char' and `unsigned char'. */
4633 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
4634 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
4636 /* Define `char', which is like either `signed char' or `unsigned char'
4637 but not the same as either. */
4640 ? make_signed_type (CHAR_TYPE_SIZE)
4641 : make_unsigned_type (CHAR_TYPE_SIZE));
4643 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
4644 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
4645 integer_type_node = make_signed_type (INT_TYPE_SIZE);
4646 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
4647 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
4648 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
4649 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
4650 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
4652 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
4653 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
4654 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
4655 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
4656 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
4658 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
4659 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
4660 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
4661 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
4662 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
4665 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4666 It will create several other common tree nodes. */
4669 build_common_tree_nodes_2 (short_double)
4672 /* Define these next since types below may used them. */
4673 integer_zero_node = build_int_2 (0, 0);
4674 integer_one_node = build_int_2 (1, 0);
4675 integer_minus_one_node = build_int_2 (-1, -1);
4677 size_zero_node = size_int (0);
4678 size_one_node = size_int (1);
4679 bitsize_zero_node = bitsize_int (0);
4680 bitsize_one_node = bitsize_int (1);
4681 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
4683 void_type_node = make_node (VOID_TYPE);
4684 layout_type (void_type_node);
4686 /* We are not going to have real types in C with less than byte alignment,
4687 so we might as well not have any types that claim to have it. */
4688 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
4689 TYPE_USER_ALIGN (void_type_node) = 0;
4691 null_pointer_node = build_int_2 (0, 0);
4692 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
4693 layout_type (TREE_TYPE (null_pointer_node));
4695 ptr_type_node = build_pointer_type (void_type_node);
4697 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
4699 float_type_node = make_node (REAL_TYPE);
4700 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
4701 layout_type (float_type_node);
4703 double_type_node = make_node (REAL_TYPE);
4705 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
4707 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
4708 layout_type (double_type_node);
4710 long_double_type_node = make_node (REAL_TYPE);
4711 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
4712 layout_type (long_double_type_node);
4714 complex_integer_type_node = make_node (COMPLEX_TYPE);
4715 TREE_TYPE (complex_integer_type_node) = integer_type_node;
4716 layout_type (complex_integer_type_node);
4718 complex_float_type_node = make_node (COMPLEX_TYPE);
4719 TREE_TYPE (complex_float_type_node) = float_type_node;
4720 layout_type (complex_float_type_node);
4722 complex_double_type_node = make_node (COMPLEX_TYPE);
4723 TREE_TYPE (complex_double_type_node) = double_type_node;
4724 layout_type (complex_double_type_node);
4726 complex_long_double_type_node = make_node (COMPLEX_TYPE);
4727 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
4728 layout_type (complex_long_double_type_node);
4732 BUILD_VA_LIST_TYPE (t);
4734 /* Many back-ends define record types without seting TYPE_NAME.
4735 If we copied the record type here, we'd keep the original
4736 record type without a name. This breaks name mangling. So,
4737 don't copy record types and let c_common_nodes_and_builtins()
4738 declare the type to be __builtin_va_list. */
4739 if (TREE_CODE (t) != RECORD_TYPE)
4740 t = build_type_copy (t);
4742 va_list_type_node = t;
4745 unsigned_V4SI_type_node
4746 = make_vector (V4SImode, unsigned_intSI_type_node, 1);
4747 unsigned_V2HI_type_node
4748 = make_vector (V2HImode, unsigned_intHI_type_node, 1);
4749 unsigned_V2SI_type_node
4750 = make_vector (V2SImode, unsigned_intSI_type_node, 1);
4751 unsigned_V2DI_type_node
4752 = make_vector (V2DImode, unsigned_intDI_type_node, 1);
4753 unsigned_V4HI_type_node
4754 = make_vector (V4HImode, unsigned_intHI_type_node, 1);
4755 unsigned_V8QI_type_node
4756 = make_vector (V8QImode, unsigned_intQI_type_node, 1);
4757 unsigned_V8HI_type_node
4758 = make_vector (V8HImode, unsigned_intHI_type_node, 1);
4759 unsigned_V16QI_type_node
4760 = make_vector (V16QImode, unsigned_intQI_type_node, 1);
4761 unsigned_V1DI_type_node
4762 = make_vector (V1DImode, unsigned_intDI_type_node, 1);
4764 V16SF_type_node = make_vector (V16SFmode, float_type_node, 0);
4765 V4SF_type_node = make_vector (V4SFmode, float_type_node, 0);
4766 V4SI_type_node = make_vector (V4SImode, intSI_type_node, 0);
4767 V2HI_type_node = make_vector (V2HImode, intHI_type_node, 0);
4768 V2SI_type_node = make_vector (V2SImode, intSI_type_node, 0);
4769 V2DI_type_node = make_vector (V2DImode, intDI_type_node, 0);
4770 V4HI_type_node = make_vector (V4HImode, intHI_type_node, 0);
4771 V8QI_type_node = make_vector (V8QImode, intQI_type_node, 0);
4772 V8HI_type_node = make_vector (V8HImode, intHI_type_node, 0);
4773 V2SF_type_node = make_vector (V2SFmode, float_type_node, 0);
4774 V2DF_type_node = make_vector (V2DFmode, double_type_node, 0);
4775 V16QI_type_node = make_vector (V16QImode, intQI_type_node, 0);
4776 V1DI_type_node = make_vector (V1DImode, intDI_type_node, 0);
4779 /* Returns a vector tree node given a vector mode, the inner type, and
4783 make_vector (mode, innertype, unsignedp)
4784 enum machine_mode mode;
4790 t = make_node (VECTOR_TYPE);
4791 TREE_TYPE (t) = innertype;
4792 TYPE_MODE (t) = mode;
4793 TREE_UNSIGNED (TREE_TYPE (t)) = unsignedp;
4794 finish_vector_type (t);
4799 /* Given an initializer INIT, return TRUE if INIT is zero or some
4800 aggregate of zeros. Otherwise return FALSE. */
4803 initializer_zerop (init)
4808 switch (TREE_CODE (init))
4811 return integer_zerop (init);
4813 return real_zerop (init)
4814 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
4816 return integer_zerop (init)
4817 || (real_zerop (init)
4818 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
4819 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
4822 if (AGGREGATE_TYPE_P (TREE_TYPE (init)))
4824 tree aggr_init = CONSTRUCTOR_ELTS (init);
4828 if (! initializer_zerop (TREE_VALUE (aggr_init)))
4830 aggr_init = TREE_CHAIN (aggr_init);
4841 #include "gt-tree.h"