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, 2003 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 GTY(()) int next_decl_uid;
96 /* Unique id for next type created. */
97 static GTY(()) 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) = input_line;
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 CONSTRUCTOR node whose type is TYPE and whose values
472 are in a list pointed to by VALS. */
474 build_constructor (type, vals)
477 tree c = make_node (CONSTRUCTOR);
478 TREE_TYPE (c) = type;
479 CONSTRUCTOR_ELTS (c) = vals;
481 /* ??? May not be necessary. Mirrors what build does. */
484 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
485 TREE_READONLY (c) = TREE_READONLY (vals);
486 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
489 TREE_CONSTANT (c) = 0; /* safe side */
494 /* Return a new REAL_CST node whose type is TYPE and value is D. */
505 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
506 Consider doing it via real_convert now. */
508 v = make_node (REAL_CST);
509 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
510 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
512 TREE_TYPE (v) = type;
513 TREE_REAL_CST_PTR (v) = dp;
514 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
518 /* Return a new REAL_CST node whose type is TYPE
519 and whose value is the integer value of the INTEGER_CST node I. */
522 real_value_from_int_cst (type, i)
523 tree type ATTRIBUTE_UNUSED, i;
527 /* Clear all bits of the real value type so that we can later do
528 bitwise comparisons to see if two values are the same. */
529 memset ((char *) &d, 0, sizeof d);
531 if (! TREE_UNSIGNED (TREE_TYPE (i)))
532 REAL_VALUE_FROM_INT (d, TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
535 REAL_VALUE_FROM_UNSIGNED_INT (d, TREE_INT_CST_LOW (i),
536 TREE_INT_CST_HIGH (i), TYPE_MODE (type));
540 /* Given a tree representing an integer constant I, return a tree
541 representing the same value as a floating-point constant of type TYPE. */
544 build_real_from_int_cst (type, i)
549 int overflow = TREE_OVERFLOW (i);
551 v = build_real (type, real_value_from_int_cst (type, i));
553 TREE_OVERFLOW (v) |= overflow;
554 TREE_CONSTANT_OVERFLOW (v) |= overflow;
558 /* Return a newly constructed STRING_CST node whose value is
559 the LEN characters at STR.
560 The TREE_TYPE is not initialized. */
563 build_string (len, str)
567 tree s = make_node (STRING_CST);
569 TREE_STRING_LENGTH (s) = len;
570 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
575 /* Return a newly constructed COMPLEX_CST node whose value is
576 specified by the real and imaginary parts REAL and IMAG.
577 Both REAL and IMAG should be constant nodes. TYPE, if specified,
578 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
581 build_complex (type, real, imag)
585 tree t = make_node (COMPLEX_CST);
587 TREE_REALPART (t) = real;
588 TREE_IMAGPART (t) = imag;
589 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
590 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
591 TREE_CONSTANT_OVERFLOW (t)
592 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
596 /* Build a newly constructed TREE_VEC node of length LEN. */
603 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
605 #ifdef GATHER_STATISTICS
606 tree_node_counts[(int) vec_kind]++;
607 tree_node_sizes[(int) vec_kind] += length;
610 t = ggc_alloc_tree (length);
612 memset ((PTR) t, 0, length);
613 TREE_SET_CODE (t, TREE_VEC);
614 TREE_VEC_LENGTH (t) = len;
619 /* Return 1 if EXPR is the integer constant zero or a complex constant
628 return ((TREE_CODE (expr) == INTEGER_CST
629 && ! TREE_CONSTANT_OVERFLOW (expr)
630 && TREE_INT_CST_LOW (expr) == 0
631 && TREE_INT_CST_HIGH (expr) == 0)
632 || (TREE_CODE (expr) == COMPLEX_CST
633 && integer_zerop (TREE_REALPART (expr))
634 && integer_zerop (TREE_IMAGPART (expr))));
637 /* Return 1 if EXPR is the integer constant one or the corresponding
646 return ((TREE_CODE (expr) == INTEGER_CST
647 && ! TREE_CONSTANT_OVERFLOW (expr)
648 && TREE_INT_CST_LOW (expr) == 1
649 && TREE_INT_CST_HIGH (expr) == 0)
650 || (TREE_CODE (expr) == COMPLEX_CST
651 && integer_onep (TREE_REALPART (expr))
652 && integer_zerop (TREE_IMAGPART (expr))));
655 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
656 it contains. Likewise for the corresponding complex constant. */
659 integer_all_onesp (expr)
667 if (TREE_CODE (expr) == COMPLEX_CST
668 && integer_all_onesp (TREE_REALPART (expr))
669 && integer_zerop (TREE_IMAGPART (expr)))
672 else if (TREE_CODE (expr) != INTEGER_CST
673 || TREE_CONSTANT_OVERFLOW (expr))
676 uns = TREE_UNSIGNED (TREE_TYPE (expr));
678 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
679 && TREE_INT_CST_HIGH (expr) == -1);
681 /* Note that using TYPE_PRECISION here is wrong. We care about the
682 actual bits, not the (arbitrary) range of the type. */
683 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
684 if (prec >= HOST_BITS_PER_WIDE_INT)
686 HOST_WIDE_INT high_value;
689 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
691 if (shift_amount > HOST_BITS_PER_WIDE_INT)
692 /* Can not handle precisions greater than twice the host int size. */
694 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
695 /* Shifting by the host word size is undefined according to the ANSI
696 standard, so we must handle this as a special case. */
699 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
701 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
702 && TREE_INT_CST_HIGH (expr) == high_value);
705 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
708 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
716 HOST_WIDE_INT high, low;
720 if (TREE_CODE (expr) == COMPLEX_CST
721 && integer_pow2p (TREE_REALPART (expr))
722 && integer_zerop (TREE_IMAGPART (expr)))
725 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
728 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
729 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
730 high = TREE_INT_CST_HIGH (expr);
731 low = TREE_INT_CST_LOW (expr);
733 /* First clear all bits that are beyond the type's precision in case
734 we've been sign extended. */
736 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
738 else if (prec > HOST_BITS_PER_WIDE_INT)
739 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
743 if (prec < HOST_BITS_PER_WIDE_INT)
744 low &= ~((HOST_WIDE_INT) (-1) << prec);
747 if (high == 0 && low == 0)
750 return ((high == 0 && (low & (low - 1)) == 0)
751 || (low == 0 && (high & (high - 1)) == 0));
754 /* Return 1 if EXPR is an integer constant other than zero or a
755 complex constant other than zero. */
758 integer_nonzerop (expr)
763 return ((TREE_CODE (expr) == INTEGER_CST
764 && ! TREE_CONSTANT_OVERFLOW (expr)
765 && (TREE_INT_CST_LOW (expr) != 0
766 || TREE_INT_CST_HIGH (expr) != 0))
767 || (TREE_CODE (expr) == COMPLEX_CST
768 && (integer_nonzerop (TREE_REALPART (expr))
769 || integer_nonzerop (TREE_IMAGPART (expr)))));
772 /* Return the power of two represented by a tree node known to be a
780 HOST_WIDE_INT high, low;
784 if (TREE_CODE (expr) == COMPLEX_CST)
785 return tree_log2 (TREE_REALPART (expr));
787 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
788 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
790 high = TREE_INT_CST_HIGH (expr);
791 low = TREE_INT_CST_LOW (expr);
793 /* First clear all bits that are beyond the type's precision in case
794 we've been sign extended. */
796 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
798 else if (prec > HOST_BITS_PER_WIDE_INT)
799 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
803 if (prec < HOST_BITS_PER_WIDE_INT)
804 low &= ~((HOST_WIDE_INT) (-1) << prec);
807 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
811 /* Similar, but return the largest integer Y such that 2 ** Y is less
812 than or equal to EXPR. */
815 tree_floor_log2 (expr)
819 HOST_WIDE_INT high, low;
823 if (TREE_CODE (expr) == COMPLEX_CST)
824 return tree_log2 (TREE_REALPART (expr));
826 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
827 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
829 high = TREE_INT_CST_HIGH (expr);
830 low = TREE_INT_CST_LOW (expr);
832 /* First clear all bits that are beyond the type's precision in case
833 we've been sign extended. Ignore if type's precision hasn't been set
834 since what we are doing is setting it. */
836 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
838 else if (prec > HOST_BITS_PER_WIDE_INT)
839 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
843 if (prec < HOST_BITS_PER_WIDE_INT)
844 low &= ~((HOST_WIDE_INT) (-1) << prec);
847 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
851 /* Return 1 if EXPR is the real constant zero. */
859 return ((TREE_CODE (expr) == REAL_CST
860 && ! TREE_CONSTANT_OVERFLOW (expr)
861 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
862 || (TREE_CODE (expr) == COMPLEX_CST
863 && real_zerop (TREE_REALPART (expr))
864 && real_zerop (TREE_IMAGPART (expr))));
867 /* Return 1 if EXPR is the real constant one in real or complex form. */
875 return ((TREE_CODE (expr) == REAL_CST
876 && ! TREE_CONSTANT_OVERFLOW (expr)
877 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
878 || (TREE_CODE (expr) == COMPLEX_CST
879 && real_onep (TREE_REALPART (expr))
880 && real_zerop (TREE_IMAGPART (expr))));
883 /* Return 1 if EXPR is the real constant two. */
891 return ((TREE_CODE (expr) == REAL_CST
892 && ! TREE_CONSTANT_OVERFLOW (expr)
893 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
894 || (TREE_CODE (expr) == COMPLEX_CST
895 && real_twop (TREE_REALPART (expr))
896 && real_zerop (TREE_IMAGPART (expr))));
899 /* Return 1 if EXPR is the real constant minus one. */
902 real_minus_onep (expr)
907 return ((TREE_CODE (expr) == REAL_CST
908 && ! TREE_CONSTANT_OVERFLOW (expr)
909 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
910 || (TREE_CODE (expr) == COMPLEX_CST
911 && real_minus_onep (TREE_REALPART (expr))
912 && real_zerop (TREE_IMAGPART (expr))));
915 /* Nonzero if EXP is a constant or a cast of a constant. */
918 really_constant_p (exp)
921 /* This is not quite the same as STRIP_NOPS. It does more. */
922 while (TREE_CODE (exp) == NOP_EXPR
923 || TREE_CODE (exp) == CONVERT_EXPR
924 || TREE_CODE (exp) == NON_LVALUE_EXPR)
925 exp = TREE_OPERAND (exp, 0);
926 return TREE_CONSTANT (exp);
929 /* Return first list element whose TREE_VALUE is ELEM.
930 Return 0 if ELEM is not in LIST. */
933 value_member (elem, list)
938 if (elem == TREE_VALUE (list))
940 list = TREE_CHAIN (list);
945 /* Return first list element whose TREE_PURPOSE is ELEM.
946 Return 0 if ELEM is not in LIST. */
949 purpose_member (elem, list)
954 if (elem == TREE_PURPOSE (list))
956 list = TREE_CHAIN (list);
961 /* Return first list element whose BINFO_TYPE is ELEM.
962 Return 0 if ELEM is not in LIST. */
965 binfo_member (elem, list)
970 if (elem == BINFO_TYPE (list))
972 list = TREE_CHAIN (list);
977 /* Return nonzero if ELEM is part of the chain CHAIN. */
980 chain_member (elem, chain)
987 chain = TREE_CHAIN (chain);
993 /* Return the length of a chain of nodes chained through TREE_CHAIN.
994 We expect a null pointer to mark the end of the chain.
995 This is the Lisp primitive `length'. */
1004 for (tail = t; tail; tail = TREE_CHAIN (tail))
1010 /* Returns the number of FIELD_DECLs in TYPE. */
1013 fields_length (type)
1016 tree t = TYPE_FIELDS (type);
1019 for (; t; t = TREE_CHAIN (t))
1020 if (TREE_CODE (t) == FIELD_DECL)
1026 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1027 by modifying the last node in chain 1 to point to chain 2.
1028 This is the Lisp primitive `nconc'. */
1041 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1043 TREE_CHAIN (t1) = op2;
1045 #ifdef ENABLE_TREE_CHECKING
1048 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1050 abort (); /* Circularity created. */
1057 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1065 while ((next = TREE_CHAIN (chain)))
1070 /* Reverse the order of elements in the chain T,
1071 and return the new head of the chain (old last element). */
1077 tree prev = 0, decl, next;
1078 for (decl = t; decl; decl = next)
1080 next = TREE_CHAIN (decl);
1081 TREE_CHAIN (decl) = prev;
1087 /* Return a newly created TREE_LIST node whose
1088 purpose and value fields are PARM and VALUE. */
1091 build_tree_list (parm, value)
1094 tree t = make_node (TREE_LIST);
1095 TREE_PURPOSE (t) = parm;
1096 TREE_VALUE (t) = value;
1100 /* Return a newly created TREE_LIST node whose
1101 purpose and value fields are PURPOSE and VALUE
1102 and whose TREE_CHAIN is CHAIN. */
1105 tree_cons (purpose, value, chain)
1106 tree purpose, value, chain;
1110 node = ggc_alloc_tree (sizeof (struct tree_list));
1112 memset (node, 0, sizeof (struct tree_common));
1114 #ifdef GATHER_STATISTICS
1115 tree_node_counts[(int) x_kind]++;
1116 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1119 TREE_SET_CODE (node, TREE_LIST);
1120 TREE_CHAIN (node) = chain;
1121 TREE_PURPOSE (node) = purpose;
1122 TREE_VALUE (node) = value;
1126 /* Return the last expression in a sequence of COMPOUND_EXPRs. */
1132 if (expr == NULL_TREE)
1134 while (TREE_CODE (expr) == COMPOUND_EXPR)
1135 expr = TREE_OPERAND (expr, 1);
1139 /* Return the size nominally occupied by an object of type TYPE
1140 when it resides in memory. The value is measured in units of bytes,
1141 and its data type is that normally used for type sizes
1142 (which is the first type created by make_signed_type or
1143 make_unsigned_type). */
1146 size_in_bytes (type)
1151 if (type == error_mark_node)
1152 return integer_zero_node;
1154 type = TYPE_MAIN_VARIANT (type);
1155 t = TYPE_SIZE_UNIT (type);
1159 (*lang_hooks.types.incomplete_type_error) (NULL_TREE, type);
1160 return size_zero_node;
1163 if (TREE_CODE (t) == INTEGER_CST)
1164 force_fit_type (t, 0);
1169 /* Return the size of TYPE (in bytes) as a wide integer
1170 or return -1 if the size can vary or is larger than an integer. */
1173 int_size_in_bytes (type)
1178 if (type == error_mark_node)
1181 type = TYPE_MAIN_VARIANT (type);
1182 t = TYPE_SIZE_UNIT (type);
1184 || TREE_CODE (t) != INTEGER_CST
1185 || TREE_OVERFLOW (t)
1186 || TREE_INT_CST_HIGH (t) != 0
1187 /* If the result would appear negative, it's too big to represent. */
1188 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1191 return TREE_INT_CST_LOW (t);
1194 /* Return the bit position of FIELD, in bits from the start of the record.
1195 This is a tree of type bitsizetype. */
1198 bit_position (field)
1201 return bit_from_pos (DECL_FIELD_OFFSET (field),
1202 DECL_FIELD_BIT_OFFSET (field));
1205 /* Likewise, but return as an integer. Abort if it cannot be represented
1206 in that way (since it could be a signed value, we don't have the option
1207 of returning -1 like int_size_in_byte can. */
1210 int_bit_position (field)
1213 return tree_low_cst (bit_position (field), 0);
1216 /* Return the byte position of FIELD, in bytes from the start of the record.
1217 This is a tree of type sizetype. */
1220 byte_position (field)
1223 return byte_from_pos (DECL_FIELD_OFFSET (field),
1224 DECL_FIELD_BIT_OFFSET (field));
1227 /* Likewise, but return as an integer. Abort if it cannot be represented
1228 in that way (since it could be a signed value, we don't have the option
1229 of returning -1 like int_size_in_byte can. */
1232 int_byte_position (field)
1235 return tree_low_cst (byte_position (field), 0);
1238 /* Return the strictest alignment, in bits, that T is known to have. */
1244 unsigned int align0, align1;
1246 switch (TREE_CODE (t))
1248 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1249 /* If we have conversions, we know that the alignment of the
1250 object must meet each of the alignments of the types. */
1251 align0 = expr_align (TREE_OPERAND (t, 0));
1252 align1 = TYPE_ALIGN (TREE_TYPE (t));
1253 return MAX (align0, align1);
1255 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1256 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1257 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1258 /* These don't change the alignment of an object. */
1259 return expr_align (TREE_OPERAND (t, 0));
1262 /* The best we can do is say that the alignment is the least aligned
1264 align0 = expr_align (TREE_OPERAND (t, 1));
1265 align1 = expr_align (TREE_OPERAND (t, 2));
1266 return MIN (align0, align1);
1268 case LABEL_DECL: case CONST_DECL:
1269 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1270 if (DECL_ALIGN (t) != 0)
1271 return DECL_ALIGN (t);
1275 return FUNCTION_BOUNDARY;
1281 /* Otherwise take the alignment from that of the type. */
1282 return TYPE_ALIGN (TREE_TYPE (t));
1285 /* Return, as a tree node, the number of elements for TYPE (which is an
1286 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1289 array_type_nelts (type)
1292 tree index_type, min, max;
1294 /* If they did it with unspecified bounds, then we should have already
1295 given an error about it before we got here. */
1296 if (! TYPE_DOMAIN (type))
1297 return error_mark_node;
1299 index_type = TYPE_DOMAIN (type);
1300 min = TYPE_MIN_VALUE (index_type);
1301 max = TYPE_MAX_VALUE (index_type);
1303 return (integer_zerop (min)
1305 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1308 /* Return nonzero if arg is static -- a reference to an object in
1309 static storage. This is not the same as the C meaning of `static'. */
1315 switch (TREE_CODE (arg))
1318 /* Nested functions aren't static, since taking their address
1319 involves a trampoline. */
1320 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1321 && ! DECL_NON_ADDR_CONST_P (arg));
1324 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1325 && ! DECL_THREAD_LOCAL (arg)
1326 && ! DECL_NON_ADDR_CONST_P (arg));
1329 return TREE_STATIC (arg);
1335 /* If we are referencing a bitfield, we can't evaluate an
1336 ADDR_EXPR at compile time and so it isn't a constant. */
1338 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1339 && staticp (TREE_OPERAND (arg, 0)));
1345 /* This case is technically correct, but results in setting
1346 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1349 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1353 case ARRAY_RANGE_REF:
1354 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1355 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1356 return staticp (TREE_OPERAND (arg, 0));
1359 if ((unsigned int) TREE_CODE (arg)
1360 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1361 return (*lang_hooks.staticp) (arg);
1367 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1368 Do this to any expression which may be used in more than one place,
1369 but must be evaluated only once.
1371 Normally, expand_expr would reevaluate the expression each time.
1372 Calling save_expr produces something that is evaluated and recorded
1373 the first time expand_expr is called on it. Subsequent calls to
1374 expand_expr just reuse the recorded value.
1376 The call to expand_expr that generates code that actually computes
1377 the value is the first call *at compile time*. Subsequent calls
1378 *at compile time* generate code to use the saved value.
1379 This produces correct result provided that *at run time* control
1380 always flows through the insns made by the first expand_expr
1381 before reaching the other places where the save_expr was evaluated.
1382 You, the caller of save_expr, must make sure this is so.
1384 Constants, and certain read-only nodes, are returned with no
1385 SAVE_EXPR because that is safe. Expressions containing placeholders
1386 are not touched; see tree.def for an explanation of what these
1393 tree t = fold (expr);
1396 /* If the tree evaluates to a constant, then we don't want to hide that
1397 fact (i.e. this allows further folding, and direct checks for constants).
1398 However, a read-only object that has side effects cannot be bypassed.
1399 Since it is no problem to reevaluate literals, we just return the
1401 inner = skip_simple_arithmetic (t);
1402 if (TREE_CONSTANT (inner)
1403 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1404 || TREE_CODE (inner) == SAVE_EXPR
1405 || TREE_CODE (inner) == ERROR_MARK)
1408 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1409 it means that the size or offset of some field of an object depends on
1410 the value within another field.
1412 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1413 and some variable since it would then need to be both evaluated once and
1414 evaluated more than once. Front-ends must assure this case cannot
1415 happen by surrounding any such subexpressions in their own SAVE_EXPR
1416 and forcing evaluation at the proper time. */
1417 if (contains_placeholder_p (inner))
1420 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1422 /* This expression might be placed ahead of a jump to ensure that the
1423 value was computed on both sides of the jump. So make sure it isn't
1424 eliminated as dead. */
1425 TREE_SIDE_EFFECTS (t) = 1;
1426 TREE_READONLY (t) = 1;
1430 /* Look inside EXPR and into any simple arithmetic operations. Return
1431 the innermost non-arithmetic node. */
1434 skip_simple_arithmetic (expr)
1439 /* We don't care about whether this can be used as an lvalue in this
1441 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1442 expr = TREE_OPERAND (expr, 0);
1444 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1445 a constant, it will be more efficient to not make another SAVE_EXPR since
1446 it will allow better simplification and GCSE will be able to merge the
1447 computations if they actually occur. */
1451 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1452 inner = TREE_OPERAND (inner, 0);
1453 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1455 if (TREE_CONSTANT (TREE_OPERAND (inner, 1)))
1456 inner = TREE_OPERAND (inner, 0);
1457 else if (TREE_CONSTANT (TREE_OPERAND (inner, 0)))
1458 inner = TREE_OPERAND (inner, 1);
1469 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
1470 SAVE_EXPR. Return FALSE otherwise. */
1476 return TREE_CODE (skip_simple_arithmetic (expr)) == SAVE_EXPR;
1479 /* Arrange for an expression to be expanded multiple independent
1480 times. This is useful for cleanup actions, as the backend can
1481 expand them multiple times in different places. */
1489 /* If this is already protected, no sense in protecting it again. */
1490 if (TREE_CODE (expr) == UNSAVE_EXPR)
1493 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1494 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1498 /* Returns the index of the first non-tree operand for CODE, or the number
1499 of operands if all are trees. */
1503 enum tree_code code;
1509 case GOTO_SUBROUTINE_EXPR:
1512 case WITH_CLEANUP_EXPR:
1514 case METHOD_CALL_EXPR:
1517 return TREE_CODE_LENGTH (code);
1521 /* Return which tree structure is used by T. */
1523 enum tree_node_structure_enum
1524 tree_node_structure (t)
1527 enum tree_code code = TREE_CODE (t);
1529 switch (TREE_CODE_CLASS (code))
1531 case 'd': return TS_DECL;
1532 case 't': return TS_TYPE;
1533 case 'b': return TS_BLOCK;
1534 case 'r': case '<': case '1': case '2': case 'e': case 's':
1536 default: /* 'c' and 'x' */
1542 case INTEGER_CST: return TS_INT_CST;
1543 case REAL_CST: return TS_REAL_CST;
1544 case COMPLEX_CST: return TS_COMPLEX;
1545 case VECTOR_CST: return TS_VECTOR;
1546 case STRING_CST: return TS_STRING;
1548 case ERROR_MARK: return TS_COMMON;
1549 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1550 case TREE_LIST: return TS_LIST;
1551 case TREE_VEC: return TS_VEC;
1552 case PLACEHOLDER_EXPR: return TS_COMMON;
1559 /* Perform any modifications to EXPR required when it is unsaved. Does
1560 not recurse into EXPR's subtrees. */
1563 unsave_expr_1 (expr)
1566 switch (TREE_CODE (expr))
1569 if (! SAVE_EXPR_PERSISTENT_P (expr))
1570 SAVE_EXPR_RTL (expr) = 0;
1574 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1575 It's OK for this to happen if it was part of a subtree that
1576 isn't immediately expanded, such as operand 2 of another
1578 if (TREE_OPERAND (expr, 1))
1581 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1582 TREE_OPERAND (expr, 3) = NULL_TREE;
1586 /* I don't yet know how to emit a sequence multiple times. */
1587 if (RTL_EXPR_SEQUENCE (expr) != 0)
1596 /* Default lang hook for "unsave_expr_now". */
1599 lhd_unsave_expr_now (expr)
1602 enum tree_code code;
1604 /* There's nothing to do for NULL_TREE. */
1608 unsave_expr_1 (expr);
1610 code = TREE_CODE (expr);
1611 switch (TREE_CODE_CLASS (code))
1613 case 'c': /* a constant */
1614 case 't': /* a type node */
1615 case 'd': /* A decl node */
1616 case 'b': /* A block node */
1619 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1620 if (code == TREE_LIST)
1622 lhd_unsave_expr_now (TREE_VALUE (expr));
1623 lhd_unsave_expr_now (TREE_CHAIN (expr));
1627 case 'e': /* an expression */
1628 case 'r': /* a reference */
1629 case 's': /* an expression with side effects */
1630 case '<': /* a comparison expression */
1631 case '2': /* a binary arithmetic expression */
1632 case '1': /* a unary arithmetic expression */
1636 for (i = first_rtl_op (code) - 1; i >= 0; i--)
1637 lhd_unsave_expr_now (TREE_OPERAND (expr, i));
1648 /* Return 0 if it is safe to evaluate EXPR multiple times,
1649 return 1 if it is safe if EXPR is unsaved afterward, or
1650 return 2 if it is completely unsafe.
1652 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1653 an expression tree, so that it safe to unsave them and the surrounding
1654 context will be correct.
1656 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1657 occasionally across the whole of a function. It is therefore only
1658 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1659 below the UNSAVE_EXPR.
1661 RTL_EXPRs consume their rtl during evaluation. It is therefore
1662 never possible to unsave them. */
1665 unsafe_for_reeval (expr)
1669 enum tree_code code;
1674 if (expr == NULL_TREE)
1677 code = TREE_CODE (expr);
1678 first_rtl = first_rtl_op (code);
1687 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1689 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1690 unsafeness = MAX (tmp, unsafeness);
1696 tmp2 = unsafe_for_reeval (TREE_OPERAND (expr, 0));
1697 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1698 return MAX (MAX (tmp, 1), tmp2);
1705 tmp = (*lang_hooks.unsafe_for_reeval) (expr);
1711 switch (TREE_CODE_CLASS (code))
1713 case 'c': /* a constant */
1714 case 't': /* a type node */
1715 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1716 case 'd': /* A decl node */
1717 case 'b': /* A block node */
1720 case 'e': /* an expression */
1721 case 'r': /* a reference */
1722 case 's': /* an expression with side effects */
1723 case '<': /* a comparison expression */
1724 case '2': /* a binary arithmetic expression */
1725 case '1': /* a unary arithmetic expression */
1726 for (i = first_rtl - 1; i >= 0; i--)
1728 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1729 unsafeness = MAX (tmp, unsafeness);
1739 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1740 or offset that depends on a field within a record. */
1743 contains_placeholder_p (exp)
1746 enum tree_code code;
1752 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1753 in it since it is supplying a value for it. */
1754 code = TREE_CODE (exp);
1755 if (code == WITH_RECORD_EXPR)
1757 else if (code == PLACEHOLDER_EXPR)
1760 switch (TREE_CODE_CLASS (code))
1763 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1764 position computations since they will be converted into a
1765 WITH_RECORD_EXPR involving the reference, which will assume
1766 here will be valid. */
1767 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1770 if (code == TREE_LIST)
1771 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1772 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1781 /* Ignoring the first operand isn't quite right, but works best. */
1782 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1789 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1790 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1791 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1794 /* If we already know this doesn't have a placeholder, don't
1796 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1799 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1800 result = CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1802 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1807 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1813 switch (TREE_CODE_LENGTH (code))
1816 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1818 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1819 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1830 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1831 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1835 type_contains_placeholder_p (type)
1838 /* If the size contains a placeholder or the parent type (component type in
1839 the case of arrays) type involves a placeholder, this type does. */
1840 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1841 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1842 || (TREE_TYPE (type) != 0
1843 && type_contains_placeholder_p (TREE_TYPE (type))))
1846 /* Now do type-specific checks. Note that the last part of the check above
1847 greatly limits what we have to do below. */
1848 switch (TREE_CODE (type))
1858 case REFERENCE_TYPE:
1866 /* Here we just check the bounds. */
1867 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1868 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1872 /* We're already checked the component type (TREE_TYPE), so just check
1874 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1878 case QUAL_UNION_TYPE:
1880 static tree seen_types = 0;
1884 /* We have to be careful here that we don't end up in infinite
1885 recursions due to a field of a type being a pointer to that type
1886 or to a mutually-recursive type. So we store a list of record
1887 types that we've seen and see if this type is in them. To save
1888 memory, we don't use a list for just one type. Here we check
1889 whether we've seen this type before and store it if not. */
1890 if (seen_types == 0)
1892 else if (TREE_CODE (seen_types) != TREE_LIST)
1894 if (seen_types == type)
1897 seen_types = tree_cons (NULL_TREE, type,
1898 build_tree_list (NULL_TREE, seen_types));
1902 if (value_member (type, seen_types) != 0)
1905 seen_types = tree_cons (NULL_TREE, type, seen_types);
1908 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1909 if (TREE_CODE (field) == FIELD_DECL
1910 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1911 || (TREE_CODE (type) == QUAL_UNION_TYPE
1912 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1913 || type_contains_placeholder_p (TREE_TYPE (field))))
1919 /* Now remove us from seen_types and return the result. */
1920 if (seen_types == type)
1923 seen_types = TREE_CHAIN (seen_types);
1933 /* Return 1 if EXP contains any expressions that produce cleanups for an
1934 outer scope to deal with. Used by fold. */
1942 if (! TREE_SIDE_EFFECTS (exp))
1945 switch (TREE_CODE (exp))
1948 case GOTO_SUBROUTINE_EXPR:
1949 case WITH_CLEANUP_EXPR:
1952 case CLEANUP_POINT_EXPR:
1956 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1958 cmp = has_cleanups (TREE_VALUE (exp));
1968 /* This general rule works for most tree codes. All exceptions should be
1969 handled above. If this is a language-specific tree code, we can't
1970 trust what might be in the operand, so say we don't know
1972 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1975 nops = first_rtl_op (TREE_CODE (exp));
1976 for (i = 0; i < nops; i++)
1977 if (TREE_OPERAND (exp, i) != 0)
1979 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1980 if (type == 'e' || type == '<' || type == '1' || type == '2'
1981 || type == 'r' || type == 's')
1983 cmp = has_cleanups (TREE_OPERAND (exp, i));
1992 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1993 return a tree with all occurrences of references to F in a
1994 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1995 contains only arithmetic expressions or a CALL_EXPR with a
1996 PLACEHOLDER_EXPR occurring only in its arglist. */
1999 substitute_in_expr (exp, f, r)
2004 enum tree_code code = TREE_CODE (exp);
2009 switch (TREE_CODE_CLASS (code))
2016 if (code == PLACEHOLDER_EXPR)
2018 else if (code == TREE_LIST)
2020 op0 = (TREE_CHAIN (exp) == 0
2021 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
2022 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
2023 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2026 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2035 switch (TREE_CODE_LENGTH (code))
2038 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2039 if (op0 == TREE_OPERAND (exp, 0))
2042 if (code == NON_LVALUE_EXPR)
2045 new = fold (build1 (code, TREE_TYPE (exp), op0));
2049 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2050 could, but we don't support it. */
2051 if (code == RTL_EXPR)
2053 else if (code == CONSTRUCTOR)
2056 op0 = TREE_OPERAND (exp, 0);
2057 op1 = TREE_OPERAND (exp, 1);
2058 if (CONTAINS_PLACEHOLDER_P (op0))
2059 op0 = substitute_in_expr (op0, f, r);
2060 if (CONTAINS_PLACEHOLDER_P (op1))
2061 op1 = substitute_in_expr (op1, f, r);
2063 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2066 new = fold (build (code, TREE_TYPE (exp), op0, op1));
2070 /* It cannot be that anything inside a SAVE_EXPR contains a
2071 PLACEHOLDER_EXPR. */
2072 if (code == SAVE_EXPR)
2075 else if (code == CALL_EXPR)
2077 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2078 if (op1 == TREE_OPERAND (exp, 1))
2081 return build (code, TREE_TYPE (exp),
2082 TREE_OPERAND (exp, 0), op1, NULL_TREE);
2085 else if (code != COND_EXPR)
2088 op0 = TREE_OPERAND (exp, 0);
2089 op1 = TREE_OPERAND (exp, 1);
2090 op2 = TREE_OPERAND (exp, 2);
2092 if (CONTAINS_PLACEHOLDER_P (op0))
2093 op0 = substitute_in_expr (op0, f, r);
2094 if (CONTAINS_PLACEHOLDER_P (op1))
2095 op1 = substitute_in_expr (op1, f, r);
2096 if (CONTAINS_PLACEHOLDER_P (op2))
2097 op2 = substitute_in_expr (op2, f, r);
2099 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2100 && op2 == TREE_OPERAND (exp, 2))
2103 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2116 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2117 and it is the right field, replace it with R. */
2118 for (inner = TREE_OPERAND (exp, 0);
2119 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2120 inner = TREE_OPERAND (inner, 0))
2122 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2123 && TREE_OPERAND (exp, 1) == f)
2126 /* If this expression hasn't been completed let, leave it
2128 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2129 && TREE_TYPE (inner) == 0)
2132 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2133 if (op0 == TREE_OPERAND (exp, 0))
2136 new = fold (build (code, TREE_TYPE (exp), op0,
2137 TREE_OPERAND (exp, 1)));
2141 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2142 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2143 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2144 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2145 && op2 == TREE_OPERAND (exp, 2))
2148 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2153 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2154 if (op0 == TREE_OPERAND (exp, 0))
2157 new = fold (build1 (code, TREE_TYPE (exp), op0));
2169 TREE_READONLY (new) = TREE_READONLY (exp);
2173 /* Stabilize a reference so that we can use it any number of times
2174 without causing its operands to be evaluated more than once.
2175 Returns the stabilized reference. This works by means of save_expr,
2176 so see the caveats in the comments about save_expr.
2178 Also allows conversion expressions whose operands are references.
2179 Any other kind of expression is returned unchanged. */
2182 stabilize_reference (ref)
2186 enum tree_code code = TREE_CODE (ref);
2193 /* No action is needed in this case. */
2199 case FIX_TRUNC_EXPR:
2200 case FIX_FLOOR_EXPR:
2201 case FIX_ROUND_EXPR:
2203 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2207 result = build_nt (INDIRECT_REF,
2208 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2212 result = build_nt (COMPONENT_REF,
2213 stabilize_reference (TREE_OPERAND (ref, 0)),
2214 TREE_OPERAND (ref, 1));
2218 result = build_nt (BIT_FIELD_REF,
2219 stabilize_reference (TREE_OPERAND (ref, 0)),
2220 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2221 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2225 result = build_nt (ARRAY_REF,
2226 stabilize_reference (TREE_OPERAND (ref, 0)),
2227 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2230 case ARRAY_RANGE_REF:
2231 result = build_nt (ARRAY_RANGE_REF,
2232 stabilize_reference (TREE_OPERAND (ref, 0)),
2233 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2237 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2238 it wouldn't be ignored. This matters when dealing with
2240 return stabilize_reference_1 (ref);
2243 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2244 save_expr (build1 (ADDR_EXPR,
2245 build_pointer_type (TREE_TYPE (ref)),
2249 /* If arg isn't a kind of lvalue we recognize, make no change.
2250 Caller should recognize the error for an invalid lvalue. */
2255 return error_mark_node;
2258 TREE_TYPE (result) = TREE_TYPE (ref);
2259 TREE_READONLY (result) = TREE_READONLY (ref);
2260 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2261 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2266 /* Subroutine of stabilize_reference; this is called for subtrees of
2267 references. Any expression with side-effects must be put in a SAVE_EXPR
2268 to ensure that it is only evaluated once.
2270 We don't put SAVE_EXPR nodes around everything, because assigning very
2271 simple expressions to temporaries causes us to miss good opportunities
2272 for optimizations. Among other things, the opportunity to fold in the
2273 addition of a constant into an addressing mode often gets lost, e.g.
2274 "y[i+1] += x;". In general, we take the approach that we should not make
2275 an assignment unless we are forced into it - i.e., that any non-side effect
2276 operator should be allowed, and that cse should take care of coalescing
2277 multiple utterances of the same expression should that prove fruitful. */
2280 stabilize_reference_1 (e)
2284 enum tree_code code = TREE_CODE (e);
2286 /* We cannot ignore const expressions because it might be a reference
2287 to a const array but whose index contains side-effects. But we can
2288 ignore things that are actual constant or that already have been
2289 handled by this function. */
2291 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2294 switch (TREE_CODE_CLASS (code))
2304 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2305 so that it will only be evaluated once. */
2306 /* The reference (r) and comparison (<) classes could be handled as
2307 below, but it is generally faster to only evaluate them once. */
2308 if (TREE_SIDE_EFFECTS (e))
2309 return save_expr (e);
2313 /* Constants need no processing. In fact, we should never reach
2318 /* Division is slow and tends to be compiled with jumps,
2319 especially the division by powers of 2 that is often
2320 found inside of an array reference. So do it just once. */
2321 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2322 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2323 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2324 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2325 return save_expr (e);
2326 /* Recursively stabilize each operand. */
2327 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2328 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2332 /* Recursively stabilize each operand. */
2333 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2340 TREE_TYPE (result) = TREE_TYPE (e);
2341 TREE_READONLY (result) = TREE_READONLY (e);
2342 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2343 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2348 /* Low-level constructors for expressions. */
2350 /* Build an expression of code CODE, data type TYPE,
2351 and operands as specified by the arguments ARG1 and following arguments.
2352 Expressions and reference nodes can be created this way.
2353 Constants, decls, types and misc nodes cannot be. */
2356 build (enum tree_code code, tree tt, ...)
2367 t = make_node (code);
2368 length = TREE_CODE_LENGTH (code);
2371 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2372 result based on those same flags for the arguments. But if the
2373 arguments aren't really even `tree' expressions, we shouldn't be trying
2375 fro = first_rtl_op (code);
2377 /* Expressions without side effects may be constant if their
2378 arguments are as well. */
2379 constant = (TREE_CODE_CLASS (code) == '<'
2380 || TREE_CODE_CLASS (code) == '1'
2381 || TREE_CODE_CLASS (code) == '2'
2382 || TREE_CODE_CLASS (code) == 'c');
2386 /* This is equivalent to the loop below, but faster. */
2387 tree arg0 = va_arg (p, tree);
2388 tree arg1 = va_arg (p, tree);
2390 TREE_OPERAND (t, 0) = arg0;
2391 TREE_OPERAND (t, 1) = arg1;
2392 TREE_READONLY (t) = 1;
2393 if (arg0 && fro > 0)
2395 if (TREE_SIDE_EFFECTS (arg0))
2396 TREE_SIDE_EFFECTS (t) = 1;
2397 if (!TREE_READONLY (arg0))
2398 TREE_READONLY (t) = 0;
2399 if (!TREE_CONSTANT (arg0))
2403 if (arg1 && fro > 1)
2405 if (TREE_SIDE_EFFECTS (arg1))
2406 TREE_SIDE_EFFECTS (t) = 1;
2407 if (!TREE_READONLY (arg1))
2408 TREE_READONLY (t) = 0;
2409 if (!TREE_CONSTANT (arg1))
2413 else if (length == 1)
2415 tree arg0 = va_arg (p, tree);
2417 /* The only one-operand cases we handle here are those with side-effects.
2418 Others are handled with build1. So don't bother checked if the
2419 arg has side-effects since we'll already have set it.
2421 ??? This really should use build1 too. */
2422 if (TREE_CODE_CLASS (code) != 's')
2424 TREE_OPERAND (t, 0) = arg0;
2428 for (i = 0; i < length; i++)
2430 tree operand = va_arg (p, tree);
2432 TREE_OPERAND (t, i) = operand;
2433 if (operand && fro > i)
2435 if (TREE_SIDE_EFFECTS (operand))
2436 TREE_SIDE_EFFECTS (t) = 1;
2437 if (!TREE_CONSTANT (operand))
2444 TREE_CONSTANT (t) = constant;
2448 /* Same as above, but only builds for unary operators.
2449 Saves lions share of calls to `build'; cuts down use
2450 of varargs, which is expensive for RISC machines. */
2453 build1 (code, type, node)
2454 enum tree_code code;
2458 int length = sizeof (struct tree_exp);
2459 #ifdef GATHER_STATISTICS
2460 tree_node_kind kind;
2464 #ifdef GATHER_STATISTICS
2465 switch (TREE_CODE_CLASS (code))
2467 case 's': /* an expression with side effects */
2470 case 'r': /* a reference */
2478 tree_node_counts[(int) kind]++;
2479 tree_node_sizes[(int) kind] += length;
2482 #ifdef ENABLE_CHECKING
2483 if (TREE_CODE_CLASS (code) == '2'
2484 || TREE_CODE_CLASS (code) == '<'
2485 || TREE_CODE_LENGTH (code) != 1)
2487 #endif /* ENABLE_CHECKING */
2489 t = ggc_alloc_tree (length);
2491 memset ((PTR) t, 0, sizeof (struct tree_common));
2493 TREE_SET_CODE (t, code);
2495 TREE_TYPE (t) = type;
2496 TREE_COMPLEXITY (t) = 0;
2497 TREE_OPERAND (t, 0) = node;
2498 if (node && first_rtl_op (code) != 0)
2500 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2501 TREE_READONLY (t) = TREE_READONLY (node);
2504 if (TREE_CODE_CLASS (code) == 's')
2505 TREE_SIDE_EFFECTS (t) = 1;
2512 case PREDECREMENT_EXPR:
2513 case PREINCREMENT_EXPR:
2514 case POSTDECREMENT_EXPR:
2515 case POSTINCREMENT_EXPR:
2516 /* All of these have side-effects, no matter what their
2518 TREE_SIDE_EFFECTS (t) = 1;
2519 TREE_READONLY (t) = 0;
2523 /* Whether a dereference is readonly has nothing to do with whether
2524 its operand is readonly. */
2525 TREE_READONLY (t) = 0;
2529 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2530 TREE_CONSTANT (t) = 1;
2537 /* Similar except don't specify the TREE_TYPE
2538 and leave the TREE_SIDE_EFFECTS as 0.
2539 It is permissible for arguments to be null,
2540 or even garbage if their values do not matter. */
2543 build_nt (enum tree_code code, ...)
2552 t = make_node (code);
2553 length = TREE_CODE_LENGTH (code);
2555 for (i = 0; i < length; i++)
2556 TREE_OPERAND (t, i) = va_arg (p, tree);
2562 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2563 We do NOT enter this node in any sort of symbol table.
2565 layout_decl is used to set up the decl's storage layout.
2566 Other slots are initialized to 0 or null pointers. */
2569 build_decl (code, name, type)
2570 enum tree_code code;
2575 t = make_node (code);
2577 /* if (type == error_mark_node)
2578 type = integer_type_node; */
2579 /* That is not done, deliberately, so that having error_mark_node
2580 as the type can suppress useless errors in the use of this variable. */
2582 DECL_NAME (t) = name;
2583 TREE_TYPE (t) = type;
2585 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2587 else if (code == FUNCTION_DECL)
2588 DECL_MODE (t) = FUNCTION_MODE;
2593 /* BLOCK nodes are used to represent the structure of binding contours
2594 and declarations, once those contours have been exited and their contents
2595 compiled. This information is used for outputting debugging info. */
2598 build_block (vars, tags, subblocks, supercontext, chain)
2599 tree vars, tags ATTRIBUTE_UNUSED, subblocks, supercontext, chain;
2601 tree block = make_node (BLOCK);
2603 BLOCK_VARS (block) = vars;
2604 BLOCK_SUBBLOCKS (block) = subblocks;
2605 BLOCK_SUPERCONTEXT (block) = supercontext;
2606 BLOCK_CHAIN (block) = chain;
2610 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2611 location where an expression or an identifier were encountered. It
2612 is necessary for languages where the frontend parser will handle
2613 recursively more than one file (Java is one of them). */
2616 build_expr_wfl (node, file, line, col)
2621 static const char *last_file = 0;
2622 static tree last_filenode = NULL_TREE;
2623 tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2625 EXPR_WFL_NODE (wfl) = node;
2626 EXPR_WFL_SET_LINECOL (wfl, line, col);
2627 if (file != last_file)
2630 last_filenode = file ? get_identifier (file) : NULL_TREE;
2633 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2636 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2637 TREE_TYPE (wfl) = TREE_TYPE (node);
2643 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2647 build_decl_attribute_variant (ddecl, attribute)
2648 tree ddecl, attribute;
2650 DECL_ATTRIBUTES (ddecl) = attribute;
2654 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2657 Record such modified types already made so we don't make duplicates. */
2660 build_type_attribute_variant (ttype, attribute)
2661 tree ttype, attribute;
2663 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2665 unsigned int hashcode;
2668 ntype = copy_node (ttype);
2670 TYPE_POINTER_TO (ntype) = 0;
2671 TYPE_REFERENCE_TO (ntype) = 0;
2672 TYPE_ATTRIBUTES (ntype) = attribute;
2674 /* Create a new main variant of TYPE. */
2675 TYPE_MAIN_VARIANT (ntype) = ntype;
2676 TYPE_NEXT_VARIANT (ntype) = 0;
2677 set_type_quals (ntype, TYPE_UNQUALIFIED);
2679 hashcode = (TYPE_HASH (TREE_CODE (ntype))
2680 + TYPE_HASH (TREE_TYPE (ntype))
2681 + attribute_hash_list (attribute));
2683 switch (TREE_CODE (ntype))
2686 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2689 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2692 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2695 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2701 ntype = type_hash_canon (hashcode, ntype);
2702 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2708 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2711 We try both `text' and `__text__', ATTR may be either one. */
2712 /* ??? It might be a reasonable simplification to require ATTR to be only
2713 `text'. One might then also require attribute lists to be stored in
2714 their canonicalized form. */
2717 is_attribute_p (attr, ident)
2721 int ident_len, attr_len;
2724 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2727 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2730 p = IDENTIFIER_POINTER (ident);
2731 ident_len = strlen (p);
2732 attr_len = strlen (attr);
2734 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2738 || attr[attr_len - 2] != '_'
2739 || attr[attr_len - 1] != '_')
2741 if (ident_len == attr_len - 4
2742 && strncmp (attr + 2, p, attr_len - 4) == 0)
2747 if (ident_len == attr_len + 4
2748 && p[0] == '_' && p[1] == '_'
2749 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2750 && strncmp (attr, p + 2, attr_len) == 0)
2757 /* Given an attribute name and a list of attributes, return a pointer to the
2758 attribute's list element if the attribute is part of the list, or NULL_TREE
2759 if not found. If the attribute appears more than once, this only
2760 returns the first occurrence; the TREE_CHAIN of the return value should
2761 be passed back in if further occurrences are wanted. */
2764 lookup_attribute (attr_name, list)
2765 const char *attr_name;
2770 for (l = list; l; l = TREE_CHAIN (l))
2772 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2774 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2781 /* Return an attribute list that is the union of a1 and a2. */
2784 merge_attributes (a1, a2)
2789 /* Either one unset? Take the set one. */
2791 if ((attributes = a1) == 0)
2794 /* One that completely contains the other? Take it. */
2796 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2798 if (attribute_list_contained (a2, a1))
2802 /* Pick the longest list, and hang on the other list. */
2804 if (list_length (a1) < list_length (a2))
2805 attributes = a2, a2 = a1;
2807 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2810 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2813 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2816 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2821 a1 = copy_node (a2);
2822 TREE_CHAIN (a1) = attributes;
2831 /* Given types T1 and T2, merge their attributes and return
2835 merge_type_attributes (t1, t2)
2838 return merge_attributes (TYPE_ATTRIBUTES (t1),
2839 TYPE_ATTRIBUTES (t2));
2842 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2846 merge_decl_attributes (olddecl, newdecl)
2847 tree olddecl, newdecl;
2849 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2850 DECL_ATTRIBUTES (newdecl));
2853 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2855 /* Specialization of merge_decl_attributes for various Windows targets.
2857 This handles the following situation:
2859 __declspec (dllimport) int foo;
2862 The second instance of `foo' nullifies the dllimport. */
2865 merge_dllimport_decl_attributes (old, new)
2870 int delete_dllimport_p;
2872 old = DECL_ATTRIBUTES (old);
2873 new = DECL_ATTRIBUTES (new);
2875 /* What we need to do here is remove from `old' dllimport if it doesn't
2876 appear in `new'. dllimport behaves like extern: if a declaration is
2877 marked dllimport and a definition appears later, then the object
2878 is not dllimport'd. */
2879 if (lookup_attribute ("dllimport", old) != NULL_TREE
2880 && lookup_attribute ("dllimport", new) == NULL_TREE)
2881 delete_dllimport_p = 1;
2883 delete_dllimport_p = 0;
2885 a = merge_attributes (old, new);
2887 if (delete_dllimport_p)
2891 /* Scan the list for dllimport and delete it. */
2892 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
2894 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
2896 if (prev == NULL_TREE)
2899 TREE_CHAIN (prev) = TREE_CHAIN (t);
2908 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2910 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2911 of the various TYPE_QUAL values. */
2914 set_type_quals (type, type_quals)
2918 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
2919 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
2920 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
2923 /* Return a version of the TYPE, qualified as indicated by the
2924 TYPE_QUALS, if one exists. If no qualified version exists yet,
2925 return NULL_TREE. */
2928 get_qualified_type (type, type_quals)
2934 /* Search the chain of variants to see if there is already one there just
2935 like the one we need to have. If so, use that existing one. We must
2936 preserve the TYPE_NAME, since there is code that depends on this. */
2937 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2938 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type)
2939 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type))
2945 /* Like get_qualified_type, but creates the type if it does not
2946 exist. This function never returns NULL_TREE. */
2949 build_qualified_type (type, type_quals)
2955 /* See if we already have the appropriate qualified variant. */
2956 t = get_qualified_type (type, type_quals);
2958 /* If not, build it. */
2961 t = build_type_copy (type);
2962 set_type_quals (t, type_quals);
2968 /* Create a new variant of TYPE, equivalent but distinct.
2969 This is so the caller can modify it. */
2972 build_type_copy (type)
2975 tree t, m = TYPE_MAIN_VARIANT (type);
2977 t = copy_node (type);
2979 TYPE_POINTER_TO (t) = 0;
2980 TYPE_REFERENCE_TO (t) = 0;
2982 /* Add this type to the chain of variants of TYPE. */
2983 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
2984 TYPE_NEXT_VARIANT (m) = t;
2989 /* Hashing of types so that we don't make duplicates.
2990 The entry point is `type_hash_canon'. */
2992 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2993 with types in the TREE_VALUE slots), by adding the hash codes
2994 of the individual types. */
2997 type_hash_list (list)
3000 unsigned int hashcode;
3003 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3004 hashcode += TYPE_HASH (TREE_VALUE (tail));
3009 /* These are the Hashtable callback functions. */
3011 /* Returns true if the types are equal. */
3014 type_hash_eq (va, vb)
3018 const struct type_hash *a = va, *b = vb;
3019 if (a->hash == b->hash
3020 && TREE_CODE (a->type) == TREE_CODE (b->type)
3021 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
3022 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3023 TYPE_ATTRIBUTES (b->type))
3024 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
3025 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3026 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3027 TYPE_MAX_VALUE (b->type)))
3028 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3029 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3030 TYPE_MIN_VALUE (b->type)))
3031 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3032 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
3033 || (TYPE_DOMAIN (a->type)
3034 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
3035 && TYPE_DOMAIN (b->type)
3036 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
3037 && type_list_equal (TYPE_DOMAIN (a->type),
3038 TYPE_DOMAIN (b->type)))))
3043 /* Return the cached hash value. */
3046 type_hash_hash (item)
3049 return ((const struct type_hash *) item)->hash;
3052 /* Look in the type hash table for a type isomorphic to TYPE.
3053 If one is found, return it. Otherwise return 0. */
3056 type_hash_lookup (hashcode, type)
3057 unsigned int hashcode;
3060 struct type_hash *h, in;
3062 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3063 must call that routine before comparing TYPE_ALIGNs. */
3069 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3075 /* Add an entry to the type-hash-table
3076 for a type TYPE whose hash code is HASHCODE. */
3079 type_hash_add (hashcode, type)
3080 unsigned int hashcode;
3083 struct type_hash *h;
3086 h = (struct type_hash *) ggc_alloc (sizeof (struct type_hash));
3089 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3090 *(struct type_hash **) loc = h;
3093 /* Given TYPE, and HASHCODE its hash code, return the canonical
3094 object for an identical type if one already exists.
3095 Otherwise, return TYPE, and record it as the canonical object
3096 if it is a permanent object.
3098 To use this function, first create a type of the sort you want.
3099 Then compute its hash code from the fields of the type that
3100 make it different from other similar types.
3101 Then call this function and use the value.
3102 This function frees the type you pass in if it is a duplicate. */
3104 /* Set to 1 to debug without canonicalization. Never set by program. */
3105 int debug_no_type_hash = 0;
3108 type_hash_canon (hashcode, type)
3109 unsigned int hashcode;
3114 if (debug_no_type_hash)
3117 /* See if the type is in the hash table already. If so, return it.
3118 Otherwise, add the type. */
3119 t1 = type_hash_lookup (hashcode, type);
3122 #ifdef GATHER_STATISTICS
3123 tree_node_counts[(int) t_kind]--;
3124 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3130 type_hash_add (hashcode, type);
3135 /* See if the data pointed to by the type hash table is marked. We consider
3136 it marked if the type is marked or if a debug type number or symbol
3137 table entry has been made for the type. This reduces the amount of
3138 debugging output and eliminates that dependency of the debug output on
3139 the number of garbage collections. */
3142 type_hash_marked_p (p)
3145 tree type = ((struct type_hash *) p)->type;
3147 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3151 print_type_hash_statistics ()
3153 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3154 (long) htab_size (type_hash_table),
3155 (long) htab_elements (type_hash_table),
3156 htab_collisions (type_hash_table));
3159 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3160 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3161 by adding the hash codes of the individual attributes. */
3164 attribute_hash_list (list)
3167 unsigned int hashcode;
3170 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3171 /* ??? Do we want to add in TREE_VALUE too? */
3172 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3176 /* Given two lists of attributes, return true if list l2 is
3177 equivalent to l1. */
3180 attribute_list_equal (l1, l2)
3183 return attribute_list_contained (l1, l2)
3184 && attribute_list_contained (l2, l1);
3187 /* Given two lists of attributes, return true if list L2 is
3188 completely contained within L1. */
3189 /* ??? This would be faster if attribute names were stored in a canonicalized
3190 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3191 must be used to show these elements are equivalent (which they are). */
3192 /* ??? It's not clear that attributes with arguments will always be handled
3196 attribute_list_contained (l1, l2)
3201 /* First check the obvious, maybe the lists are identical. */
3205 /* Maybe the lists are similar. */
3206 for (t1 = l1, t2 = l2;
3208 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3209 && TREE_VALUE (t1) == TREE_VALUE (t2);
3210 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3212 /* Maybe the lists are equal. */
3213 if (t1 == 0 && t2 == 0)
3216 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3219 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3221 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3224 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3231 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3238 /* Given two lists of types
3239 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3240 return 1 if the lists contain the same types in the same order.
3241 Also, the TREE_PURPOSEs must match. */
3244 type_list_equal (l1, l2)
3249 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3250 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3251 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3252 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3253 && (TREE_TYPE (TREE_PURPOSE (t1))
3254 == TREE_TYPE (TREE_PURPOSE (t2))))))
3260 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3261 given by TYPE. If the argument list accepts variable arguments,
3262 then this function counts only the ordinary arguments. */
3265 type_num_arguments (type)
3271 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3272 /* If the function does not take a variable number of arguments,
3273 the last element in the list will have type `void'. */
3274 if (VOID_TYPE_P (TREE_VALUE (t)))
3282 /* Nonzero if integer constants T1 and T2
3283 represent the same constant value. */
3286 tree_int_cst_equal (t1, t2)
3292 if (t1 == 0 || t2 == 0)
3295 if (TREE_CODE (t1) == INTEGER_CST
3296 && TREE_CODE (t2) == INTEGER_CST
3297 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3298 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3304 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3305 The precise way of comparison depends on their data type. */
3308 tree_int_cst_lt (t1, t2)
3314 if (TREE_UNSIGNED (TREE_TYPE (t1)) != TREE_UNSIGNED (TREE_TYPE (t2)))
3316 int t1_sgn = tree_int_cst_sgn (t1);
3317 int t2_sgn = tree_int_cst_sgn (t2);
3319 if (t1_sgn < t2_sgn)
3321 else if (t1_sgn > t2_sgn)
3323 /* Otherwise, both are non-negative, so we compare them as
3324 unsigned just in case one of them would overflow a signed
3327 else if (! TREE_UNSIGNED (TREE_TYPE (t1)))
3328 return INT_CST_LT (t1, t2);
3330 return INT_CST_LT_UNSIGNED (t1, t2);
3333 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3336 tree_int_cst_compare (t1, t2)
3340 if (tree_int_cst_lt (t1, t2))
3342 else if (tree_int_cst_lt (t2, t1))
3348 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3349 the host. If POS is zero, the value can be represented in a single
3350 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3351 be represented in a single unsigned HOST_WIDE_INT. */
3354 host_integerp (t, pos)
3358 return (TREE_CODE (t) == INTEGER_CST
3359 && ! TREE_OVERFLOW (t)
3360 && ((TREE_INT_CST_HIGH (t) == 0
3361 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3362 || (! pos && TREE_INT_CST_HIGH (t) == -1
3363 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3364 && ! TREE_UNSIGNED (TREE_TYPE (t)))
3365 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3368 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3369 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3370 be positive. Abort if we cannot satisfy the above conditions. */
3373 tree_low_cst (t, pos)
3377 if (host_integerp (t, pos))
3378 return TREE_INT_CST_LOW (t);
3383 /* Return the most significant bit of the integer constant T. */
3386 tree_int_cst_msb (t)
3391 unsigned HOST_WIDE_INT l;
3393 /* Note that using TYPE_PRECISION here is wrong. We care about the
3394 actual bits, not the (arbitrary) range of the type. */
3395 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3396 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3397 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3398 return (l & 1) == 1;
3401 /* Return an indication of the sign of the integer constant T.
3402 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3403 Note that -1 will never be returned it T's type is unsigned. */
3406 tree_int_cst_sgn (t)
3409 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3411 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3413 else if (TREE_INT_CST_HIGH (t) < 0)
3419 /* Compare two constructor-element-type constants. Return 1 if the lists
3420 are known to be equal; otherwise return 0. */
3423 simple_cst_list_equal (l1, l2)
3426 while (l1 != NULL_TREE && l2 != NULL_TREE)
3428 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3431 l1 = TREE_CHAIN (l1);
3432 l2 = TREE_CHAIN (l2);
3438 /* Return truthvalue of whether T1 is the same tree structure as T2.
3439 Return 1 if they are the same.
3440 Return 0 if they are understandably different.
3441 Return -1 if either contains tree structure not understood by
3445 simple_cst_equal (t1, t2)
3448 enum tree_code code1, code2;
3454 if (t1 == 0 || t2 == 0)
3457 code1 = TREE_CODE (t1);
3458 code2 = TREE_CODE (t2);
3460 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3462 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3463 || code2 == NON_LVALUE_EXPR)
3464 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3466 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3469 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3470 || code2 == NON_LVALUE_EXPR)
3471 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3479 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3480 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3483 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3486 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3487 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3488 TREE_STRING_LENGTH (t1)));
3491 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3497 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3500 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3504 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3507 /* Special case: if either target is an unallocated VAR_DECL,
3508 it means that it's going to be unified with whatever the
3509 TARGET_EXPR is really supposed to initialize, so treat it
3510 as being equivalent to anything. */
3511 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3512 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3513 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3514 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3515 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3516 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3519 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3524 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3526 case WITH_CLEANUP_EXPR:
3527 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3531 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3534 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3535 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3549 /* This general rule works for most tree codes. All exceptions should be
3550 handled above. If this is a language-specific tree code, we can't
3551 trust what might be in the operand, so say we don't know
3553 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3556 switch (TREE_CODE_CLASS (code1))
3565 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3567 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3579 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3580 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3581 than U, respectively. */
3584 compare_tree_int (t, u)
3586 unsigned HOST_WIDE_INT u;
3588 if (tree_int_cst_sgn (t) < 0)
3590 else if (TREE_INT_CST_HIGH (t) != 0)
3592 else if (TREE_INT_CST_LOW (t) == u)
3594 else if (TREE_INT_CST_LOW (t) < u)
3600 /* Generate a hash value for an expression. This can be used iteratively
3601 by passing a previous result as the "val" argument.
3603 This function is intended to produce the same hash for expressions which
3604 would compare equal using operand_equal_p. */
3607 iterative_hash_expr (tree t, hashval_t val)
3610 enum tree_code code;
3614 return iterative_hash_object (t, val);
3616 code = TREE_CODE (t);
3617 class = TREE_CODE_CLASS (code);
3621 /* Decls we can just compare by pointer. */
3622 val = iterative_hash_object (t, val);
3624 else if (class == 'c')
3626 /* Alas, constants aren't shared, so we can't rely on pointer
3628 if (code == INTEGER_CST)
3630 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3631 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3633 else if (code == REAL_CST)
3634 val = iterative_hash (TREE_REAL_CST_PTR (t),
3635 sizeof (REAL_VALUE_TYPE), val);
3636 else if (code == STRING_CST)
3637 val = iterative_hash (TREE_STRING_POINTER (t),
3638 TREE_STRING_LENGTH (t), val);
3639 else if (code == COMPLEX_CST)
3641 val = iterative_hash_expr (TREE_REALPART (t), val);
3642 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3644 else if (code == VECTOR_CST)
3645 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3649 else if (IS_EXPR_CODE_CLASS (class) || class == 'r')
3651 val = iterative_hash_object (code, val);
3653 if (code == NOP_EXPR || code == CONVERT_EXPR
3654 || code == NON_LVALUE_EXPR)
3655 val = iterative_hash_object (TREE_TYPE (t), val);
3657 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3658 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3660 else if (code == TREE_LIST)
3662 /* A list of expressions, for a CALL_EXPR or as the elements of a
3664 for (; t; t = TREE_CHAIN (t))
3665 val = iterative_hash_expr (TREE_VALUE (t), val);
3673 /* Constructors for pointer, array and function types.
3674 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3675 constructed by language-dependent code, not here.) */
3677 /* Construct, lay out and return the type of pointers to TO_TYPE
3678 with mode MODE. If such a type has already been constructed,
3682 build_pointer_type_for_mode (to_type, mode)
3684 enum machine_mode mode;
3686 tree t = TYPE_POINTER_TO (to_type);
3688 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3689 if (t != 0 && mode == ptr_mode)
3692 t = make_node (POINTER_TYPE);
3694 TREE_TYPE (t) = to_type;
3695 TYPE_MODE (t) = mode;
3697 /* Record this type as the pointer to TO_TYPE. */
3698 if (mode == ptr_mode)
3699 TYPE_POINTER_TO (to_type) = t;
3701 /* Lay out the type. This function has many callers that are concerned
3702 with expression-construction, and this simplifies them all.
3703 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3709 /* By default build pointers in ptr_mode. */
3712 build_pointer_type (to_type)
3715 return build_pointer_type_for_mode (to_type, ptr_mode);
3718 /* Construct, lay out and return the type of references to TO_TYPE
3719 with mode MODE. If such a type has already been constructed,
3723 build_reference_type_for_mode (to_type, mode)
3725 enum machine_mode mode;
3727 tree t = TYPE_REFERENCE_TO (to_type);
3729 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3730 if (t != 0 && mode == ptr_mode)
3733 t = make_node (REFERENCE_TYPE);
3735 TREE_TYPE (t) = to_type;
3736 TYPE_MODE (t) = mode;
3738 /* Record this type as the pointer to TO_TYPE. */
3739 if (mode == ptr_mode)
3740 TYPE_REFERENCE_TO (to_type) = t;
3748 /* Build the node for the type of references-to-TO_TYPE by default
3752 build_reference_type (to_type)
3755 return build_reference_type_for_mode (to_type, ptr_mode);
3758 /* Build a type that is compatible with t but has no cv quals anywhere
3761 const char *const *const * -> char ***. */
3764 build_type_no_quals (t)
3767 switch (TREE_CODE (t))
3770 return build_pointer_type (build_type_no_quals (TREE_TYPE (t)));
3771 case REFERENCE_TYPE:
3772 return build_reference_type (build_type_no_quals (TREE_TYPE (t)));
3774 return TYPE_MAIN_VARIANT (t);
3778 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3779 MAXVAL should be the maximum value in the domain
3780 (one less than the length of the array).
3782 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3783 We don't enforce this limit, that is up to caller (e.g. language front end).
3784 The limit exists because the result is a signed type and we don't handle
3785 sizes that use more than one HOST_WIDE_INT. */
3788 build_index_type (maxval)
3791 tree itype = make_node (INTEGER_TYPE);
3793 TREE_TYPE (itype) = sizetype;
3794 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3795 TYPE_MIN_VALUE (itype) = size_zero_node;
3796 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3797 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3798 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3799 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
3800 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3801 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
3803 if (host_integerp (maxval, 1))
3804 return type_hash_canon (tree_low_cst (maxval, 1), itype);
3809 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3810 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3811 low bound LOWVAL and high bound HIGHVAL.
3812 if TYPE==NULL_TREE, sizetype is used. */
3815 build_range_type (type, lowval, highval)
3816 tree type, lowval, highval;
3818 tree itype = make_node (INTEGER_TYPE);
3820 TREE_TYPE (itype) = type;
3821 if (type == NULL_TREE)
3824 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3825 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
3827 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3828 TYPE_MODE (itype) = TYPE_MODE (type);
3829 TYPE_SIZE (itype) = TYPE_SIZE (type);
3830 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
3831 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3832 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
3834 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
3835 return type_hash_canon (tree_low_cst (highval, 0)
3836 - tree_low_cst (lowval, 0),
3842 /* Just like build_index_type, but takes lowval and highval instead
3843 of just highval (maxval). */
3846 build_index_2_type (lowval, highval)
3847 tree lowval, highval;
3849 return build_range_type (sizetype, lowval, highval);
3852 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3853 and number of elements specified by the range of values of INDEX_TYPE.
3854 If such a type has already been constructed, reuse it. */
3857 build_array_type (elt_type, index_type)
3858 tree elt_type, index_type;
3861 unsigned int hashcode;
3863 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3865 error ("arrays of functions are not meaningful");
3866 elt_type = integer_type_node;
3869 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3870 build_pointer_type (elt_type);
3872 /* Allocate the array after the pointer type,
3873 in case we free it in type_hash_canon. */
3874 t = make_node (ARRAY_TYPE);
3875 TREE_TYPE (t) = elt_type;
3876 TYPE_DOMAIN (t) = index_type;
3878 if (index_type == 0)
3883 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3884 t = type_hash_canon (hashcode, t);
3886 if (!COMPLETE_TYPE_P (t))
3891 /* Return the TYPE of the elements comprising
3892 the innermost dimension of ARRAY. */
3895 get_inner_array_type (array)
3898 tree type = TREE_TYPE (array);
3900 while (TREE_CODE (type) == ARRAY_TYPE)
3901 type = TREE_TYPE (type);
3906 /* Construct, lay out and return
3907 the type of functions returning type VALUE_TYPE
3908 given arguments of types ARG_TYPES.
3909 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3910 are data type nodes for the arguments of the function.
3911 If such a type has already been constructed, reuse it. */
3914 build_function_type (value_type, arg_types)
3915 tree value_type, arg_types;
3918 unsigned int hashcode;
3920 if (TREE_CODE (value_type) == FUNCTION_TYPE)
3922 error ("function return type cannot be function");
3923 value_type = integer_type_node;
3926 /* Make a node of the sort we want. */
3927 t = make_node (FUNCTION_TYPE);
3928 TREE_TYPE (t) = value_type;
3929 TYPE_ARG_TYPES (t) = arg_types;
3931 /* If we already have such a type, use the old one and free this one. */
3932 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
3933 t = type_hash_canon (hashcode, t);
3935 if (!COMPLETE_TYPE_P (t))
3940 /* Build a function type. The RETURN_TYPE is the type retured by the
3941 function. If additional arguments are provided, they are
3942 additional argument types. The list of argument types must always
3943 be terminated by NULL_TREE. */
3946 build_function_type_list (tree return_type, ...)
3951 va_start (p, return_type);
3953 t = va_arg (p, tree);
3954 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
3955 args = tree_cons (NULL_TREE, t, args);
3958 args = nreverse (args);
3959 TREE_CHAIN (last) = void_list_node;
3960 args = build_function_type (return_type, args);
3966 /* Construct, lay out and return the type of methods belonging to class
3967 BASETYPE and whose arguments and values are described by TYPE.
3968 If that type exists already, reuse it.
3969 TYPE must be a FUNCTION_TYPE node. */
3972 build_method_type (basetype, type)
3973 tree basetype, type;
3976 unsigned int hashcode;
3978 /* Make a node of the sort we want. */
3979 t = make_node (METHOD_TYPE);
3981 if (TREE_CODE (type) != FUNCTION_TYPE)
3984 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3985 TREE_TYPE (t) = TREE_TYPE (type);
3987 /* The actual arglist for this function includes a "hidden" argument
3988 which is "this". Put it into the list of argument types. */
3991 = tree_cons (NULL_TREE,
3992 build_pointer_type (basetype), TYPE_ARG_TYPES (type));
3994 /* If we already have such a type, use the old one and free this one. */
3995 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3996 t = type_hash_canon (hashcode, t);
3998 if (!COMPLETE_TYPE_P (t))
4004 /* Construct, lay out and return the type of offsets to a value
4005 of type TYPE, within an object of type BASETYPE.
4006 If a suitable offset type exists already, reuse it. */
4009 build_offset_type (basetype, type)
4010 tree basetype, type;
4013 unsigned int hashcode;
4015 /* Make a node of the sort we want. */
4016 t = make_node (OFFSET_TYPE);
4018 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4019 TREE_TYPE (t) = type;
4021 /* If we already have such a type, use the old one and free this one. */
4022 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
4023 t = type_hash_canon (hashcode, t);
4025 if (!COMPLETE_TYPE_P (t))
4031 /* Create a complex type whose components are COMPONENT_TYPE. */
4034 build_complex_type (component_type)
4035 tree component_type;
4038 unsigned int hashcode;
4040 /* Make a node of the sort we want. */
4041 t = make_node (COMPLEX_TYPE);
4043 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4044 set_type_quals (t, TYPE_QUALS (component_type));
4046 /* If we already have such a type, use the old one and free this one. */
4047 hashcode = TYPE_HASH (component_type);
4048 t = type_hash_canon (hashcode, t);
4050 if (!COMPLETE_TYPE_P (t))
4053 /* If we are writing Dwarf2 output we need to create a name,
4054 since complex is a fundamental type. */
4055 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4059 if (component_type == char_type_node)
4060 name = "complex char";
4061 else if (component_type == signed_char_type_node)
4062 name = "complex signed char";
4063 else if (component_type == unsigned_char_type_node)
4064 name = "complex unsigned char";
4065 else if (component_type == short_integer_type_node)
4066 name = "complex short int";
4067 else if (component_type == short_unsigned_type_node)
4068 name = "complex short unsigned int";
4069 else if (component_type == integer_type_node)
4070 name = "complex int";
4071 else if (component_type == unsigned_type_node)
4072 name = "complex unsigned int";
4073 else if (component_type == long_integer_type_node)
4074 name = "complex long int";
4075 else if (component_type == long_unsigned_type_node)
4076 name = "complex long unsigned int";
4077 else if (component_type == long_long_integer_type_node)
4078 name = "complex long long int";
4079 else if (component_type == long_long_unsigned_type_node)
4080 name = "complex long long unsigned int";
4085 TYPE_NAME (t) = get_identifier (name);
4091 /* Return OP, stripped of any conversions to wider types as much as is safe.
4092 Converting the value back to OP's type makes a value equivalent to OP.
4094 If FOR_TYPE is nonzero, we return a value which, if converted to
4095 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4097 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4098 narrowest type that can hold the value, even if they don't exactly fit.
4099 Otherwise, bit-field references are changed to a narrower type
4100 only if they can be fetched directly from memory in that type.
4102 OP must have integer, real or enumeral type. Pointers are not allowed!
4104 There are some cases where the obvious value we could return
4105 would regenerate to OP if converted to OP's type,
4106 but would not extend like OP to wider types.
4107 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4108 For example, if OP is (unsigned short)(signed char)-1,
4109 we avoid returning (signed char)-1 if FOR_TYPE is int,
4110 even though extending that to an unsigned short would regenerate OP,
4111 since the result of extending (signed char)-1 to (int)
4112 is different from (int) OP. */
4115 get_unwidened (op, for_type)
4119 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4120 tree type = TREE_TYPE (op);
4122 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4124 = (for_type != 0 && for_type != type
4125 && final_prec > TYPE_PRECISION (type)
4126 && TREE_UNSIGNED (type));
4129 while (TREE_CODE (op) == NOP_EXPR)
4132 = TYPE_PRECISION (TREE_TYPE (op))
4133 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4135 /* Truncations are many-one so cannot be removed.
4136 Unless we are later going to truncate down even farther. */
4138 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4141 /* See what's inside this conversion. If we decide to strip it,
4143 op = TREE_OPERAND (op, 0);
4145 /* If we have not stripped any zero-extensions (uns is 0),
4146 we can strip any kind of extension.
4147 If we have previously stripped a zero-extension,
4148 only zero-extensions can safely be stripped.
4149 Any extension can be stripped if the bits it would produce
4150 are all going to be discarded later by truncating to FOR_TYPE. */
4154 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4156 /* TREE_UNSIGNED says whether this is a zero-extension.
4157 Let's avoid computing it if it does not affect WIN
4158 and if UNS will not be needed again. */
4159 if ((uns || TREE_CODE (op) == NOP_EXPR)
4160 && TREE_UNSIGNED (TREE_TYPE (op)))
4168 if (TREE_CODE (op) == COMPONENT_REF
4169 /* Since type_for_size always gives an integer type. */
4170 && TREE_CODE (type) != REAL_TYPE
4171 /* Don't crash if field not laid out yet. */
4172 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4173 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4175 unsigned int innerprec
4176 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4177 int unsignedp = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4178 type = (*lang_hooks.types.type_for_size) (innerprec, unsignedp);
4180 /* We can get this structure field in the narrowest type it fits in.
4181 If FOR_TYPE is 0, do this only for a field that matches the
4182 narrower type exactly and is aligned for it
4183 The resulting extension to its nominal type (a fullword type)
4184 must fit the same conditions as for other extensions. */
4186 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4187 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4188 && (! uns || final_prec <= innerprec || unsignedp)
4191 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4192 TREE_OPERAND (op, 1));
4193 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4194 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4201 /* Return OP or a simpler expression for a narrower value
4202 which can be sign-extended or zero-extended to give back OP.
4203 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4204 or 0 if the value should be sign-extended. */
4207 get_narrower (op, unsignedp_ptr)
4215 while (TREE_CODE (op) == NOP_EXPR)
4218 = (TYPE_PRECISION (TREE_TYPE (op))
4219 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4221 /* Truncations are many-one so cannot be removed. */
4225 /* See what's inside this conversion. If we decide to strip it,
4230 op = TREE_OPERAND (op, 0);
4231 /* An extension: the outermost one can be stripped,
4232 but remember whether it is zero or sign extension. */
4234 uns = TREE_UNSIGNED (TREE_TYPE (op));
4235 /* Otherwise, if a sign extension has been stripped,
4236 only sign extensions can now be stripped;
4237 if a zero extension has been stripped, only zero-extensions. */
4238 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4242 else /* bitschange == 0 */
4244 /* A change in nominal type can always be stripped, but we must
4245 preserve the unsignedness. */
4247 uns = TREE_UNSIGNED (TREE_TYPE (op));
4249 op = TREE_OPERAND (op, 0);
4255 if (TREE_CODE (op) == COMPONENT_REF
4256 /* Since type_for_size always gives an integer type. */
4257 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4258 /* Ensure field is laid out already. */
4259 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4261 unsigned HOST_WIDE_INT innerprec
4262 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4263 tree type = (*lang_hooks.types.type_for_size) (innerprec,
4264 TREE_UNSIGNED (op));
4266 /* We can get this structure field in a narrower type that fits it,
4267 but the resulting extension to its nominal type (a fullword type)
4268 must satisfy the same conditions as for other extensions.
4270 Do this only for fields that are aligned (not bit-fields),
4271 because when bit-field insns will be used there is no
4272 advantage in doing this. */
4274 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4275 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4276 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4280 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4281 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4282 TREE_OPERAND (op, 1));
4283 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4284 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4287 *unsignedp_ptr = uns;
4291 /* Nonzero if integer constant C has a value that is permissible
4292 for type TYPE (an INTEGER_TYPE). */
4295 int_fits_type_p (c, type)
4298 tree type_low_bound = TYPE_MIN_VALUE (type);
4299 tree type_high_bound = TYPE_MAX_VALUE (type);
4300 int ok_for_low_bound, ok_for_high_bound;
4302 /* Perform some generic filtering first, which may allow making a decision
4303 even if the bounds are not constant. First, negative integers never fit
4304 in unsigned types, */
4305 if ((TREE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4306 /* Also, unsigned integers with top bit set never fit signed types. */
4307 || (! TREE_UNSIGNED (type)
4308 && TREE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4311 /* If at least one bound of the type is a constant integer, we can check
4312 ourselves and maybe make a decision. If no such decision is possible, but
4313 this type is a subtype, try checking against that. Otherwise, use
4314 force_fit_type, which checks against the precision.
4316 Compute the status for each possibly constant bound, and return if we see
4317 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4318 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4319 for "constant known to fit". */
4321 ok_for_low_bound = -1;
4322 ok_for_high_bound = -1;
4324 /* Check if C >= type_low_bound. */
4325 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4327 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4328 if (! ok_for_low_bound)
4332 /* Check if c <= type_high_bound. */
4333 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4335 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4336 if (! ok_for_high_bound)
4340 /* If the constant fits both bounds, the result is known. */
4341 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4344 /* If we haven't been able to decide at this point, there nothing more we
4345 can check ourselves here. Look at the base type if we have one. */
4346 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4347 return int_fits_type_p (c, TREE_TYPE (type));
4349 /* Or to force_fit_type, if nothing else. */
4353 TREE_TYPE (c) = type;
4354 return !force_fit_type (c, 0);
4358 /* Returns true if T is, contains, or refers to a type with variable
4359 size. This concept is more general than that of C99 'variably
4360 modified types': in C99, a struct type is never variably modified
4361 because a VLA may not appear as a structure member. However, in
4364 struct S { int i[f()]; };
4366 is valid, and other languages may define similar constructs. */
4369 variably_modified_type_p (type)
4372 if (type == error_mark_node)
4375 /* If TYPE itself has variable size, it is variably modified.
4377 We do not yet have a representation of the C99 '[*]' syntax.
4378 When a representation is chosen, this function should be modified
4379 to test for that case as well. */
4380 if (TYPE_SIZE (type)
4381 && TYPE_SIZE (type) != error_mark_node
4382 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4385 /* If TYPE is a pointer or reference, it is variably modified if
4386 the type pointed to is variably modified. */
4387 if ((TREE_CODE (type) == POINTER_TYPE
4388 || TREE_CODE (type) == REFERENCE_TYPE)
4389 && variably_modified_type_p (TREE_TYPE (type)))
4392 /* If TYPE is an array, it is variably modified if the array
4393 elements are. (Note that the VLA case has already been checked
4395 if (TREE_CODE (type) == ARRAY_TYPE
4396 && variably_modified_type_p (TREE_TYPE (type)))
4399 /* If TYPE is a function type, it is variably modified if any of the
4400 parameters or the return type are variably modified. */
4401 if (TREE_CODE (type) == FUNCTION_TYPE
4402 || TREE_CODE (type) == METHOD_TYPE)
4406 if (variably_modified_type_p (TREE_TYPE (type)))
4408 for (parm = TYPE_ARG_TYPES (type);
4409 parm && parm != void_list_node;
4410 parm = TREE_CHAIN (parm))
4411 if (variably_modified_type_p (TREE_VALUE (parm)))
4415 /* The current language may have other cases to check, but in general,
4416 all other types are not variably modified. */
4417 return (*lang_hooks.tree_inlining.var_mod_type_p) (type);
4420 /* Given a DECL or TYPE, return the scope in which it was declared, or
4421 NULL_TREE if there is no containing scope. */
4424 get_containing_scope (t)
4427 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4430 /* Return the innermost context enclosing DECL that is
4431 a FUNCTION_DECL, or zero if none. */
4434 decl_function_context (decl)
4439 if (TREE_CODE (decl) == ERROR_MARK)
4442 if (TREE_CODE (decl) == SAVE_EXPR)
4443 context = SAVE_EXPR_CONTEXT (decl);
4445 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4446 where we look up the function at runtime. Such functions always take
4447 a first argument of type 'pointer to real context'.
4449 C++ should really be fixed to use DECL_CONTEXT for the real context,
4450 and use something else for the "virtual context". */
4451 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4454 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4456 context = DECL_CONTEXT (decl);
4458 while (context && TREE_CODE (context) != FUNCTION_DECL)
4460 if (TREE_CODE (context) == BLOCK)
4461 context = BLOCK_SUPERCONTEXT (context);
4463 context = get_containing_scope (context);
4469 /* Return the innermost context enclosing DECL that is
4470 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4471 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4474 decl_type_context (decl)
4477 tree context = DECL_CONTEXT (decl);
4481 if (TREE_CODE (context) == NAMESPACE_DECL)
4484 if (TREE_CODE (context) == RECORD_TYPE
4485 || TREE_CODE (context) == UNION_TYPE
4486 || TREE_CODE (context) == QUAL_UNION_TYPE)
4489 if (TREE_CODE (context) == TYPE_DECL
4490 || TREE_CODE (context) == FUNCTION_DECL)
4491 context = DECL_CONTEXT (context);
4493 else if (TREE_CODE (context) == BLOCK)
4494 context = BLOCK_SUPERCONTEXT (context);
4497 /* Unhandled CONTEXT!? */
4503 /* CALL is a CALL_EXPR. Return the declaration for the function
4504 called, or NULL_TREE if the called function cannot be
4508 get_callee_fndecl (call)
4513 /* It's invalid to call this function with anything but a
4515 if (TREE_CODE (call) != CALL_EXPR)
4518 /* The first operand to the CALL is the address of the function
4520 addr = TREE_OPERAND (call, 0);
4524 /* If this is a readonly function pointer, extract its initial value. */
4525 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4526 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4527 && DECL_INITIAL (addr))
4528 addr = DECL_INITIAL (addr);
4530 /* If the address is just `&f' for some function `f', then we know
4531 that `f' is being called. */
4532 if (TREE_CODE (addr) == ADDR_EXPR
4533 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4534 return TREE_OPERAND (addr, 0);
4536 /* We couldn't figure out what was being called. */
4540 /* Print debugging information about tree nodes generated during the compile,
4541 and any language-specific information. */
4544 dump_tree_statistics ()
4546 #ifdef GATHER_STATISTICS
4548 int total_nodes, total_bytes;
4551 fprintf (stderr, "\n??? tree nodes created\n\n");
4552 #ifdef GATHER_STATISTICS
4553 fprintf (stderr, "Kind Nodes Bytes\n");
4554 fprintf (stderr, "-------------------------------------\n");
4555 total_nodes = total_bytes = 0;
4556 for (i = 0; i < (int) all_kinds; i++)
4558 fprintf (stderr, "%-20s %6d %9d\n", tree_node_kind_names[i],
4559 tree_node_counts[i], tree_node_sizes[i]);
4560 total_nodes += tree_node_counts[i];
4561 total_bytes += tree_node_sizes[i];
4563 fprintf (stderr, "-------------------------------------\n");
4564 fprintf (stderr, "%-20s %6d %9d\n", "Total", total_nodes, total_bytes);
4565 fprintf (stderr, "-------------------------------------\n");
4567 fprintf (stderr, "(No per-node statistics)\n");
4569 print_type_hash_statistics ();
4570 (*lang_hooks.print_statistics) ();
4573 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4575 const char *flag_random_seed;
4577 /* Set up a default flag_random_seed value, if there wasn't one already. */
4580 default_flag_random_seed (void)
4582 unsigned HOST_WIDE_INT value;
4583 char *new_random_seed;
4585 if (flag_random_seed != NULL)
4588 /* Get some more or less random data. */
4589 #ifdef HAVE_GETTIMEOFDAY
4593 gettimeofday (&tv, NULL);
4594 value = (((unsigned HOST_WIDE_INT) tv.tv_usec << 16)
4595 ^ tv.tv_sec ^ getpid ());
4601 /* This slightly overestimates the space required. */
4602 new_random_seed = xmalloc (HOST_BITS_PER_WIDE_INT / 3 + 2);
4603 sprintf (new_random_seed, HOST_WIDE_INT_PRINT_UNSIGNED, value);
4604 flag_random_seed = new_random_seed;
4607 /* Appends 6 random characters to TEMPLATE to (hopefully) avoid name
4608 clashes in cases where we can't reliably choose a unique name.
4610 Derived from mkstemp.c in libiberty. */
4613 append_random_chars (template)
4616 static const char letters[]
4617 = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
4618 unsigned HOST_WIDE_INT v;
4621 default_flag_random_seed ();
4623 /* This isn't a very good hash, but it does guarantee no collisions
4624 when the random string is generated by the code above and the time
4627 for (i = 0; i < strlen (flag_random_seed); i++)
4628 v = (v << 4) ^ (v >> (HOST_BITS_PER_WIDE_INT - 4)) ^ flag_random_seed[i];
4630 template += strlen (template);
4632 /* Fill in the random bits. */
4633 template[0] = letters[v % 62];
4635 template[1] = letters[v % 62];
4637 template[2] = letters[v % 62];
4639 template[3] = letters[v % 62];
4641 template[4] = letters[v % 62];
4643 template[5] = letters[v % 62];
4648 /* P is a string that will be used in a symbol. Mask out any characters
4649 that are not valid in that context. */
4652 clean_symbol_name (p)
4657 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4660 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4667 /* Generate a name for a function unique to this translation unit.
4668 TYPE is some string to identify the purpose of this function to the
4669 linker or collect2. */
4672 get_file_function_name_long (type)
4679 if (first_global_object_name)
4680 p = first_global_object_name;
4683 /* We don't have anything that we know to be unique to this translation
4684 unit, so use what we do have and throw in some randomness. */
4686 const char *name = weak_global_object_name;
4687 const char *file = main_input_filename;
4692 file = input_filename;
4694 q = (char *) alloca (7 + strlen (name) + strlen (file));
4696 sprintf (q, "%s%s", name, file);
4697 append_random_chars (q);
4701 buf = (char *) alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p)
4704 /* Set up the name of the file-level functions we may need.
4705 Use a global object (which is already required to be unique over
4706 the program) rather than the file name (which imposes extra
4708 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4710 /* Don't need to pull weird characters out of global names. */
4711 if (p != first_global_object_name)
4712 clean_symbol_name (buf + 11);
4714 return get_identifier (buf);
4717 /* If KIND=='I', return a suitable global initializer (constructor) name.
4718 If KIND=='D', return a suitable global clean-up (destructor) name. */
4721 get_file_function_name (kind)
4729 return get_file_function_name_long (p);
4732 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4733 The result is placed in BUFFER (which has length BIT_SIZE),
4734 with one bit in each char ('\000' or '\001').
4736 If the constructor is constant, NULL_TREE is returned.
4737 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4740 get_set_constructor_bits (init, buffer, bit_size)
4747 HOST_WIDE_INT domain_min
4748 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4749 tree non_const_bits = NULL_TREE;
4751 for (i = 0; i < bit_size; i++)
4754 for (vals = TREE_OPERAND (init, 1);
4755 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4757 if (!host_integerp (TREE_VALUE (vals), 0)
4758 || (TREE_PURPOSE (vals) != NULL_TREE
4759 && !host_integerp (TREE_PURPOSE (vals), 0)))
4761 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4762 else if (TREE_PURPOSE (vals) != NULL_TREE)
4764 /* Set a range of bits to ones. */
4765 HOST_WIDE_INT lo_index
4766 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4767 HOST_WIDE_INT hi_index
4768 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4770 if (lo_index < 0 || lo_index >= bit_size
4771 || hi_index < 0 || hi_index >= bit_size)
4773 for (; lo_index <= hi_index; lo_index++)
4774 buffer[lo_index] = 1;
4778 /* Set a single bit to one. */
4780 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4781 if (index < 0 || index >= bit_size)
4783 error ("invalid initializer for bit string");
4789 return non_const_bits;
4792 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4793 The result is placed in BUFFER (which is an array of bytes).
4794 If the constructor is constant, NULL_TREE is returned.
4795 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4798 get_set_constructor_bytes (init, buffer, wd_size)
4800 unsigned char *buffer;
4804 int set_word_size = BITS_PER_UNIT;
4805 int bit_size = wd_size * set_word_size;
4807 unsigned char *bytep = buffer;
4808 char *bit_buffer = (char *) alloca (bit_size);
4809 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4811 for (i = 0; i < wd_size; i++)
4814 for (i = 0; i < bit_size; i++)
4818 if (BYTES_BIG_ENDIAN)
4819 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4821 *bytep |= 1 << bit_pos;
4824 if (bit_pos >= set_word_size)
4825 bit_pos = 0, bytep++;
4827 return non_const_bits;
4830 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4831 /* Complain that the tree code of NODE does not match the expected CODE.
4832 FILE, LINE, and FUNCTION are of the caller. */
4835 tree_check_failed (node, code, file, line, function)
4837 enum tree_code code;
4840 const char *function;
4842 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4843 tree_code_name[code], tree_code_name[TREE_CODE (node)],
4844 function, trim_filename (file), line);
4847 /* Similar to above, except that we check for a class of tree
4848 code, given in CL. */
4851 tree_class_check_failed (node, cl, file, line, function)
4856 const char *function;
4859 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4860 cl, TREE_CODE_CLASS (TREE_CODE (node)),
4861 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
4864 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
4865 (dynamically sized) vector. */
4868 tree_vec_elt_check_failed (idx, len, file, line, function)
4873 const char *function;
4876 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
4877 idx + 1, len, function, trim_filename (file), line);
4880 /* Similar to above, except that the check is for the bounds of the operand
4881 vector of an expression node. */
4884 tree_operand_check_failed (idx, code, file, line, function)
4886 enum tree_code code;
4889 const char *function;
4892 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
4893 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
4894 function, trim_filename (file), line);
4896 #endif /* ENABLE_TREE_CHECKING */
4898 /* For a new vector type node T, build the information necessary for
4899 debugging output. */
4902 finish_vector_type (t)
4908 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
4909 tree array = build_array_type (TREE_TYPE (t),
4910 build_index_type (index));
4911 tree rt = make_node (RECORD_TYPE);
4913 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
4914 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
4916 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
4917 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4918 the representation type, and we want to find that die when looking up
4919 the vector type. This is most easily achieved by making the TYPE_UID
4921 TYPE_UID (rt) = TYPE_UID (t);
4925 /* Create nodes for all integer types (and error_mark_node) using the sizes
4926 of C datatypes. The caller should call set_sizetype soon after calling
4927 this function to select one of the types as sizetype. */
4930 build_common_tree_nodes (signed_char)
4933 error_mark_node = make_node (ERROR_MARK);
4934 TREE_TYPE (error_mark_node) = error_mark_node;
4936 initialize_sizetypes ();
4938 /* Define both `signed char' and `unsigned char'. */
4939 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
4940 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
4942 /* Define `char', which is like either `signed char' or `unsigned char'
4943 but not the same as either. */
4946 ? make_signed_type (CHAR_TYPE_SIZE)
4947 : make_unsigned_type (CHAR_TYPE_SIZE));
4949 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
4950 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
4951 integer_type_node = make_signed_type (INT_TYPE_SIZE);
4952 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
4953 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
4954 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
4955 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
4956 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
4958 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
4959 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
4960 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
4961 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
4962 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
4964 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
4965 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
4966 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
4967 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
4968 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
4971 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4972 It will create several other common tree nodes. */
4975 build_common_tree_nodes_2 (short_double)
4978 /* Define these next since types below may used them. */
4979 integer_zero_node = build_int_2 (0, 0);
4980 integer_one_node = build_int_2 (1, 0);
4981 integer_minus_one_node = build_int_2 (-1, -1);
4983 size_zero_node = size_int (0);
4984 size_one_node = size_int (1);
4985 bitsize_zero_node = bitsize_int (0);
4986 bitsize_one_node = bitsize_int (1);
4987 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
4989 void_type_node = make_node (VOID_TYPE);
4990 layout_type (void_type_node);
4992 /* We are not going to have real types in C with less than byte alignment,
4993 so we might as well not have any types that claim to have it. */
4994 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
4995 TYPE_USER_ALIGN (void_type_node) = 0;
4997 null_pointer_node = build_int_2 (0, 0);
4998 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
4999 layout_type (TREE_TYPE (null_pointer_node));
5001 ptr_type_node = build_pointer_type (void_type_node);
5003 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5005 float_type_node = make_node (REAL_TYPE);
5006 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5007 layout_type (float_type_node);
5009 double_type_node = make_node (REAL_TYPE);
5011 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5013 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5014 layout_type (double_type_node);
5016 long_double_type_node = make_node (REAL_TYPE);
5017 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5018 layout_type (long_double_type_node);
5020 complex_integer_type_node = make_node (COMPLEX_TYPE);
5021 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5022 layout_type (complex_integer_type_node);
5024 complex_float_type_node = make_node (COMPLEX_TYPE);
5025 TREE_TYPE (complex_float_type_node) = float_type_node;
5026 layout_type (complex_float_type_node);
5028 complex_double_type_node = make_node (COMPLEX_TYPE);
5029 TREE_TYPE (complex_double_type_node) = double_type_node;
5030 layout_type (complex_double_type_node);
5032 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5033 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5034 layout_type (complex_long_double_type_node);
5038 BUILD_VA_LIST_TYPE (t);
5040 /* Many back-ends define record types without seting TYPE_NAME.
5041 If we copied the record type here, we'd keep the original
5042 record type without a name. This breaks name mangling. So,
5043 don't copy record types and let c_common_nodes_and_builtins()
5044 declare the type to be __builtin_va_list. */
5045 if (TREE_CODE (t) != RECORD_TYPE)
5046 t = build_type_copy (t);
5048 va_list_type_node = t;
5051 unsigned_V4SI_type_node
5052 = make_vector (V4SImode, unsigned_intSI_type_node, 1);
5053 unsigned_V2HI_type_node
5054 = make_vector (V2HImode, unsigned_intHI_type_node, 1);
5055 unsigned_V2SI_type_node
5056 = make_vector (V2SImode, unsigned_intSI_type_node, 1);
5057 unsigned_V2DI_type_node
5058 = make_vector (V2DImode, unsigned_intDI_type_node, 1);
5059 unsigned_V4HI_type_node
5060 = make_vector (V4HImode, unsigned_intHI_type_node, 1);
5061 unsigned_V8QI_type_node
5062 = make_vector (V8QImode, unsigned_intQI_type_node, 1);
5063 unsigned_V8HI_type_node
5064 = make_vector (V8HImode, unsigned_intHI_type_node, 1);
5065 unsigned_V16QI_type_node
5066 = make_vector (V16QImode, unsigned_intQI_type_node, 1);
5067 unsigned_V1DI_type_node
5068 = make_vector (V1DImode, unsigned_intDI_type_node, 1);
5070 V16SF_type_node = make_vector (V16SFmode, float_type_node, 0);
5071 V4SF_type_node = make_vector (V4SFmode, float_type_node, 0);
5072 V4SI_type_node = make_vector (V4SImode, intSI_type_node, 0);
5073 V2HI_type_node = make_vector (V2HImode, intHI_type_node, 0);
5074 V2SI_type_node = make_vector (V2SImode, intSI_type_node, 0);
5075 V2DI_type_node = make_vector (V2DImode, intDI_type_node, 0);
5076 V4HI_type_node = make_vector (V4HImode, intHI_type_node, 0);
5077 V8QI_type_node = make_vector (V8QImode, intQI_type_node, 0);
5078 V8HI_type_node = make_vector (V8HImode, intHI_type_node, 0);
5079 V2SF_type_node = make_vector (V2SFmode, float_type_node, 0);
5080 V2DF_type_node = make_vector (V2DFmode, double_type_node, 0);
5081 V16QI_type_node = make_vector (V16QImode, intQI_type_node, 0);
5082 V1DI_type_node = make_vector (V1DImode, intDI_type_node, 0);
5085 /* Returns a vector tree node given a vector mode, the inner type, and
5089 make_vector (mode, innertype, unsignedp)
5090 enum machine_mode mode;
5096 t = make_node (VECTOR_TYPE);
5097 TREE_TYPE (t) = innertype;
5098 TYPE_MODE (t) = mode;
5099 TREE_UNSIGNED (TREE_TYPE (t)) = unsignedp;
5100 finish_vector_type (t);
5105 /* Given an initializer INIT, return TRUE if INIT is zero or some
5106 aggregate of zeros. Otherwise return FALSE. */
5109 initializer_zerop (init)
5114 switch (TREE_CODE (init))
5117 return integer_zerop (init);
5119 return real_zerop (init)
5120 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5122 return integer_zerop (init)
5123 || (real_zerop (init)
5124 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5125 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5128 if (AGGREGATE_TYPE_P (TREE_TYPE (init)))
5130 tree aggr_init = CONSTRUCTOR_ELTS (init);
5134 if (! initializer_zerop (TREE_VALUE (aggr_init)))
5136 aggr_init = TREE_CHAIN (aggr_init);
5147 #include "gt-tree.h"