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, 2004 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 (struct obstack *h, void *obj);
52 #ifdef GATHER_STATISTICS
53 /* Statistics-gathering stuff. */
55 int tree_node_counts[(int) all_kinds];
56 int tree_node_sizes[(int) all_kinds];
58 /* Keep in sync with tree.h:enum tree_node_kind. */
59 static const char * const tree_node_kind_names[] = {
75 #endif /* GATHER_STATISTICS */
77 /* Unique id for next decl created. */
78 static GTY(()) int next_decl_uid;
79 /* Unique id for next type created. */
80 static GTY(()) int next_type_uid = 1;
82 /* Since we cannot rehash a type after it is in the table, we have to
83 keep the hash code. */
85 struct type_hash GTY(())
91 /* Initial size of the hash table (rounded to next prime). */
92 #define TYPE_HASH_INITIAL_SIZE 1000
94 /* Now here is the hash table. When recording a type, it is added to
95 the slot whose index is the hash code. Note that the hash table is
96 used for several kinds of types (function types, array types and
97 array index range types, for now). While all these live in the
98 same table, they are completely independent, and the hash code is
99 computed differently for each of these. */
101 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
102 htab_t type_hash_table;
104 static void set_type_quals (tree, int);
105 static int type_hash_eq (const void *, const void *);
106 static hashval_t type_hash_hash (const void *);
107 static void print_type_hash_statistics (void);
108 static void finish_vector_type (tree);
109 static tree make_vector (enum machine_mode, tree, int);
110 static int type_hash_marked_p (const void *);
112 tree global_trees[TI_MAX];
113 tree integer_types[itk_none];
120 /* Initialize the hash table of types. */
121 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
126 /* The name of the object as the assembler will see it (but before any
127 translations made by ASM_OUTPUT_LABELREF). Often this is the same
128 as DECL_NAME. It is an IDENTIFIER_NODE. */
130 decl_assembler_name (tree decl)
132 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
133 (*lang_hooks.set_decl_assembler_name) (decl);
134 return DECL_CHECK (decl)->decl.assembler_name;
137 /* Compute the number of bytes occupied by 'node'. This routine only
138 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
140 tree_size (tree node)
142 enum tree_code code = TREE_CODE (node);
144 switch (TREE_CODE_CLASS (code))
146 case 'd': /* A decl node */
147 return sizeof (struct tree_decl);
149 case 't': /* a type node */
150 return sizeof (struct tree_type);
152 case 'b': /* a lexical block node */
153 return sizeof (struct tree_block);
155 case 'r': /* a reference */
156 case 'e': /* an expression */
157 case 's': /* an expression with side effects */
158 case '<': /* a comparison expression */
159 case '1': /* a unary arithmetic expression */
160 case '2': /* a binary arithmetic expression */
161 return (sizeof (struct tree_exp)
162 + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
164 case 'c': /* a constant */
167 case INTEGER_CST: return sizeof (struct tree_int_cst);
168 case REAL_CST: return sizeof (struct tree_real_cst);
169 case COMPLEX_CST: return sizeof (struct tree_complex);
170 case VECTOR_CST: return sizeof (struct tree_vector);
172 return sizeof (struct tree_string) + TREE_STRING_LENGTH (node);
174 return (*lang_hooks.tree_size) (code);
177 case 'x': /* something random, like an identifier. */
180 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
181 case TREE_LIST: return sizeof (struct tree_list);
182 case TREE_VEC: return (sizeof (struct tree_vec)
183 + TREE_VEC_LENGTH(node) * sizeof(char *)
187 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
190 return (*lang_hooks.tree_size) (code);
198 /* Return a newly allocated node of code CODE.
199 For decl and type nodes, some other fields are initialized.
200 The rest of the node is initialized to zero.
202 Achoo! I got a code in the node. */
205 make_node (enum tree_code code)
208 int type = TREE_CODE_CLASS (code);
210 #ifdef GATHER_STATISTICS
213 struct tree_common ttmp;
215 /* We can't allocate a TREE_VEC without knowing how many elements
216 it will have; likewise a STRING_CST without knowing the length. */
217 if (code == TREE_VEC || code == STRING_CST)
220 TREE_SET_CODE ((tree)&ttmp, code);
221 length = tree_size ((tree)&ttmp);
223 #ifdef GATHER_STATISTICS
226 case 'd': /* A decl node */
230 case 't': /* a type node */
234 case 'b': /* a lexical block */
238 case 's': /* an expression with side effects */
242 case 'r': /* a reference */
246 case 'e': /* an expression */
247 case '<': /* a comparison expression */
248 case '1': /* a unary arithmetic expression */
249 case '2': /* a binary arithmetic expression */
253 case 'c': /* a constant */
257 case 'x': /* something random, like an identifier. */
258 if (code == IDENTIFIER_NODE)
260 else if (code == TREE_VEC)
270 tree_node_counts[(int) kind]++;
271 tree_node_sizes[(int) kind] += length;
274 t = ggc_alloc_tree (length);
276 memset (t, 0, length);
278 TREE_SET_CODE (t, code);
283 TREE_SIDE_EFFECTS (t) = 1;
287 if (code != FUNCTION_DECL)
289 DECL_USER_ALIGN (t) = 0;
290 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
291 DECL_SOURCE_LOCATION (t) = input_location;
292 DECL_UID (t) = next_decl_uid++;
294 /* We have not yet computed the alias set for this declaration. */
295 DECL_POINTER_ALIAS_SET (t) = -1;
299 TYPE_UID (t) = next_type_uid++;
300 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
301 TYPE_USER_ALIGN (t) = 0;
302 TYPE_MAIN_VARIANT (t) = t;
304 /* Default to no attributes for type, but let target change that. */
305 TYPE_ATTRIBUTES (t) = NULL_TREE;
306 (*targetm.set_default_type_attributes) (t);
308 /* We have not yet computed the alias set for this type. */
309 TYPE_ALIAS_SET (t) = -1;
313 TREE_CONSTANT (t) = 1;
323 case PREDECREMENT_EXPR:
324 case PREINCREMENT_EXPR:
325 case POSTDECREMENT_EXPR:
326 case POSTINCREMENT_EXPR:
327 /* All of these have side-effects, no matter what their
329 TREE_SIDE_EFFECTS (t) = 1;
341 /* Return a new node with the same contents as NODE except that its
342 TREE_CHAIN is zero and it has a fresh uid. */
345 copy_node (tree node)
348 enum tree_code code = TREE_CODE (node);
351 length = tree_size (node);
352 t = ggc_alloc_tree (length);
353 memcpy (t, node, length);
356 TREE_ASM_WRITTEN (t) = 0;
358 if (TREE_CODE_CLASS (code) == 'd')
359 DECL_UID (t) = next_decl_uid++;
360 else if (TREE_CODE_CLASS (code) == 't')
362 TYPE_UID (t) = next_type_uid++;
363 /* The following is so that the debug code for
364 the copy is different from the original type.
365 The two statements usually duplicate each other
366 (because they clear fields of the same union),
367 but the optimizer should catch that. */
368 TYPE_SYMTAB_POINTER (t) = 0;
369 TYPE_SYMTAB_ADDRESS (t) = 0;
375 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
376 For example, this can copy a list made of TREE_LIST nodes. */
379 copy_list (tree list)
387 head = prev = copy_node (list);
388 next = TREE_CHAIN (list);
391 TREE_CHAIN (prev) = copy_node (next);
392 prev = TREE_CHAIN (prev);
393 next = TREE_CHAIN (next);
399 /* Return a newly constructed INTEGER_CST node whose constant value
400 is specified by the two ints LOW and HI.
401 The TREE_TYPE is set to `int'.
403 This function should be used via the `build_int_2' macro. */
406 build_int_2_wide (unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
408 tree t = make_node (INTEGER_CST);
410 TREE_INT_CST_LOW (t) = low;
411 TREE_INT_CST_HIGH (t) = hi;
412 TREE_TYPE (t) = integer_type_node;
416 /* Return a new VECTOR_CST node whose type is TYPE and whose values
417 are in a list pointed by VALS. */
420 build_vector (tree type, tree vals)
422 tree v = make_node (VECTOR_CST);
423 int over1 = 0, over2 = 0;
426 TREE_VECTOR_CST_ELTS (v) = vals;
427 TREE_TYPE (v) = type;
429 /* Iterate through elements and check for overflow. */
430 for (link = vals; link; link = TREE_CHAIN (link))
432 tree value = TREE_VALUE (link);
434 over1 |= TREE_OVERFLOW (value);
435 over2 |= TREE_CONSTANT_OVERFLOW (value);
438 TREE_OVERFLOW (v) = over1;
439 TREE_CONSTANT_OVERFLOW (v) = over2;
444 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
445 are in a list pointed to by VALS. */
447 build_constructor (tree type, tree vals)
449 tree c = make_node (CONSTRUCTOR);
450 TREE_TYPE (c) = type;
451 CONSTRUCTOR_ELTS (c) = vals;
453 /* ??? May not be necessary. Mirrors what build does. */
456 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
457 TREE_READONLY (c) = TREE_READONLY (vals);
458 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
461 TREE_CONSTANT (c) = 0; /* safe side */
466 /* Return a new REAL_CST node whose type is TYPE and value is D. */
469 build_real (tree type, REAL_VALUE_TYPE d)
475 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
476 Consider doing it via real_convert now. */
478 v = make_node (REAL_CST);
479 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
480 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
482 TREE_TYPE (v) = type;
483 TREE_REAL_CST_PTR (v) = dp;
484 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
488 /* Return a new REAL_CST node whose type is TYPE
489 and whose value is the integer value of the INTEGER_CST node I. */
492 real_value_from_int_cst (tree type, tree i)
496 /* Clear all bits of the real value type so that we can later do
497 bitwise comparisons to see if two values are the same. */
498 memset (&d, 0, sizeof d);
500 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
501 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
502 TREE_UNSIGNED (TREE_TYPE (i)));
506 /* Given a tree representing an integer constant I, return a tree
507 representing the same value as a floating-point constant of type TYPE. */
510 build_real_from_int_cst (tree type, tree i)
513 int overflow = TREE_OVERFLOW (i);
515 v = build_real (type, real_value_from_int_cst (type, i));
517 TREE_OVERFLOW (v) |= overflow;
518 TREE_CONSTANT_OVERFLOW (v) |= overflow;
522 /* Return a newly constructed STRING_CST node whose value is
523 the LEN characters at STR.
524 The TREE_TYPE is not initialized. */
527 build_string (int len, const char *str)
532 length = len + sizeof (struct tree_string);
534 #ifdef GATHER_STATISTICS
535 tree_node_counts[(int) c_kind]++;
536 tree_node_sizes[(int) c_kind] += length;
539 s = ggc_alloc_tree (length);
541 memset (s, 0, sizeof (struct tree_common));
542 TREE_SET_CODE (s, STRING_CST);
543 TREE_STRING_LENGTH (s) = len;
544 memcpy ((char *) TREE_STRING_POINTER (s), str, len);
545 ((char *) TREE_STRING_POINTER (s))[len] = '\0';
550 /* Return a newly constructed COMPLEX_CST node whose value is
551 specified by the real and imaginary parts REAL and IMAG.
552 Both REAL and IMAG should be constant nodes. TYPE, if specified,
553 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
556 build_complex (tree type, tree real, tree imag)
558 tree t = make_node (COMPLEX_CST);
560 TREE_REALPART (t) = real;
561 TREE_IMAGPART (t) = imag;
562 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
563 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
564 TREE_CONSTANT_OVERFLOW (t)
565 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
569 /* Build a newly constructed TREE_VEC node of length LEN. */
572 make_tree_vec (int len)
575 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
577 #ifdef GATHER_STATISTICS
578 tree_node_counts[(int) vec_kind]++;
579 tree_node_sizes[(int) vec_kind] += length;
582 t = ggc_alloc_tree (length);
584 memset (t, 0, length);
585 TREE_SET_CODE (t, TREE_VEC);
586 TREE_VEC_LENGTH (t) = len;
591 /* Return 1 if EXPR is the integer constant zero or a complex constant
595 integer_zerop (tree expr)
599 return ((TREE_CODE (expr) == INTEGER_CST
600 && ! TREE_CONSTANT_OVERFLOW (expr)
601 && TREE_INT_CST_LOW (expr) == 0
602 && TREE_INT_CST_HIGH (expr) == 0)
603 || (TREE_CODE (expr) == COMPLEX_CST
604 && integer_zerop (TREE_REALPART (expr))
605 && integer_zerop (TREE_IMAGPART (expr))));
608 /* Return 1 if EXPR is the integer constant one or the corresponding
612 integer_onep (tree expr)
616 return ((TREE_CODE (expr) == INTEGER_CST
617 && ! TREE_CONSTANT_OVERFLOW (expr)
618 && TREE_INT_CST_LOW (expr) == 1
619 && TREE_INT_CST_HIGH (expr) == 0)
620 || (TREE_CODE (expr) == COMPLEX_CST
621 && integer_onep (TREE_REALPART (expr))
622 && integer_zerop (TREE_IMAGPART (expr))));
625 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
626 it contains. Likewise for the corresponding complex constant. */
629 integer_all_onesp (tree expr)
636 if (TREE_CODE (expr) == COMPLEX_CST
637 && integer_all_onesp (TREE_REALPART (expr))
638 && integer_zerop (TREE_IMAGPART (expr)))
641 else if (TREE_CODE (expr) != INTEGER_CST
642 || TREE_CONSTANT_OVERFLOW (expr))
645 uns = TREE_UNSIGNED (TREE_TYPE (expr));
647 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
648 && TREE_INT_CST_HIGH (expr) == -1);
650 /* Note that using TYPE_PRECISION here is wrong. We care about the
651 actual bits, not the (arbitrary) range of the type. */
652 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
653 if (prec >= HOST_BITS_PER_WIDE_INT)
655 HOST_WIDE_INT high_value;
658 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
660 if (shift_amount > HOST_BITS_PER_WIDE_INT)
661 /* Can not handle precisions greater than twice the host int size. */
663 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
664 /* Shifting by the host word size is undefined according to the ANSI
665 standard, so we must handle this as a special case. */
668 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
670 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
671 && TREE_INT_CST_HIGH (expr) == high_value);
674 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
677 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
681 integer_pow2p (tree expr)
684 HOST_WIDE_INT high, low;
688 if (TREE_CODE (expr) == COMPLEX_CST
689 && integer_pow2p (TREE_REALPART (expr))
690 && integer_zerop (TREE_IMAGPART (expr)))
693 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
696 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
697 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
698 high = TREE_INT_CST_HIGH (expr);
699 low = TREE_INT_CST_LOW (expr);
701 /* First clear all bits that are beyond the type's precision in case
702 we've been sign extended. */
704 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
706 else if (prec > HOST_BITS_PER_WIDE_INT)
707 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
711 if (prec < HOST_BITS_PER_WIDE_INT)
712 low &= ~((HOST_WIDE_INT) (-1) << prec);
715 if (high == 0 && low == 0)
718 return ((high == 0 && (low & (low - 1)) == 0)
719 || (low == 0 && (high & (high - 1)) == 0));
722 /* Return 1 if EXPR is an integer constant other than zero or a
723 complex constant other than zero. */
726 integer_nonzerop (tree expr)
730 return ((TREE_CODE (expr) == INTEGER_CST
731 && ! TREE_CONSTANT_OVERFLOW (expr)
732 && (TREE_INT_CST_LOW (expr) != 0
733 || TREE_INT_CST_HIGH (expr) != 0))
734 || (TREE_CODE (expr) == COMPLEX_CST
735 && (integer_nonzerop (TREE_REALPART (expr))
736 || integer_nonzerop (TREE_IMAGPART (expr)))));
739 /* Return the power of two represented by a tree node known to be a
743 tree_log2 (tree expr)
746 HOST_WIDE_INT high, low;
750 if (TREE_CODE (expr) == COMPLEX_CST)
751 return tree_log2 (TREE_REALPART (expr));
753 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
754 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
756 high = TREE_INT_CST_HIGH (expr);
757 low = TREE_INT_CST_LOW (expr);
759 /* First clear all bits that are beyond the type's precision in case
760 we've been sign extended. */
762 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
764 else if (prec > HOST_BITS_PER_WIDE_INT)
765 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
769 if (prec < HOST_BITS_PER_WIDE_INT)
770 low &= ~((HOST_WIDE_INT) (-1) << prec);
773 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
777 /* Similar, but return the largest integer Y such that 2 ** Y is less
778 than or equal to EXPR. */
781 tree_floor_log2 (tree expr)
784 HOST_WIDE_INT high, low;
788 if (TREE_CODE (expr) == COMPLEX_CST)
789 return tree_log2 (TREE_REALPART (expr));
791 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
792 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
794 high = TREE_INT_CST_HIGH (expr);
795 low = TREE_INT_CST_LOW (expr);
797 /* First clear all bits that are beyond the type's precision in case
798 we've been sign extended. Ignore if type's precision hasn't been set
799 since what we are doing is setting it. */
801 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
803 else if (prec > HOST_BITS_PER_WIDE_INT)
804 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
808 if (prec < HOST_BITS_PER_WIDE_INT)
809 low &= ~((HOST_WIDE_INT) (-1) << prec);
812 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
816 /* Return 1 if EXPR is the real constant zero. */
819 real_zerop (tree expr)
823 return ((TREE_CODE (expr) == REAL_CST
824 && ! TREE_CONSTANT_OVERFLOW (expr)
825 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
826 || (TREE_CODE (expr) == COMPLEX_CST
827 && real_zerop (TREE_REALPART (expr))
828 && real_zerop (TREE_IMAGPART (expr))));
831 /* Return 1 if EXPR is the real constant one in real or complex form. */
834 real_onep (tree expr)
838 return ((TREE_CODE (expr) == REAL_CST
839 && ! TREE_CONSTANT_OVERFLOW (expr)
840 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
841 || (TREE_CODE (expr) == COMPLEX_CST
842 && real_onep (TREE_REALPART (expr))
843 && real_zerop (TREE_IMAGPART (expr))));
846 /* Return 1 if EXPR is the real constant two. */
849 real_twop (tree expr)
853 return ((TREE_CODE (expr) == REAL_CST
854 && ! TREE_CONSTANT_OVERFLOW (expr)
855 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
856 || (TREE_CODE (expr) == COMPLEX_CST
857 && real_twop (TREE_REALPART (expr))
858 && real_zerop (TREE_IMAGPART (expr))));
861 /* Return 1 if EXPR is the real constant minus one. */
864 real_minus_onep (tree expr)
868 return ((TREE_CODE (expr) == REAL_CST
869 && ! TREE_CONSTANT_OVERFLOW (expr)
870 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
871 || (TREE_CODE (expr) == COMPLEX_CST
872 && real_minus_onep (TREE_REALPART (expr))
873 && real_zerop (TREE_IMAGPART (expr))));
876 /* Nonzero if EXP is a constant or a cast of a constant. */
879 really_constant_p (tree exp)
881 /* This is not quite the same as STRIP_NOPS. It does more. */
882 while (TREE_CODE (exp) == NOP_EXPR
883 || TREE_CODE (exp) == CONVERT_EXPR
884 || TREE_CODE (exp) == NON_LVALUE_EXPR)
885 exp = TREE_OPERAND (exp, 0);
886 return TREE_CONSTANT (exp);
889 /* Return first list element whose TREE_VALUE is ELEM.
890 Return 0 if ELEM is not in LIST. */
893 value_member (tree elem, tree list)
897 if (elem == TREE_VALUE (list))
899 list = TREE_CHAIN (list);
904 /* Return first list element whose TREE_PURPOSE is ELEM.
905 Return 0 if ELEM is not in LIST. */
908 purpose_member (tree elem, tree list)
912 if (elem == TREE_PURPOSE (list))
914 list = TREE_CHAIN (list);
919 /* Return first list element whose BINFO_TYPE is ELEM.
920 Return 0 if ELEM is not in LIST. */
923 binfo_member (tree elem, tree list)
927 if (elem == BINFO_TYPE (list))
929 list = TREE_CHAIN (list);
934 /* Return nonzero if ELEM is part of the chain CHAIN. */
937 chain_member (tree elem, tree chain)
943 chain = TREE_CHAIN (chain);
949 /* Return the length of a chain of nodes chained through TREE_CHAIN.
950 We expect a null pointer to mark the end of the chain.
951 This is the Lisp primitive `length'. */
959 for (tail = t; tail; tail = TREE_CHAIN (tail))
965 /* Returns the number of FIELD_DECLs in TYPE. */
968 fields_length (tree type)
970 tree t = TYPE_FIELDS (type);
973 for (; t; t = TREE_CHAIN (t))
974 if (TREE_CODE (t) == FIELD_DECL)
980 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
981 by modifying the last node in chain 1 to point to chain 2.
982 This is the Lisp primitive `nconc'. */
985 chainon (tree op1, tree op2)
994 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
996 TREE_CHAIN (t1) = op2;
998 #ifdef ENABLE_TREE_CHECKING
1001 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1003 abort (); /* Circularity created. */
1010 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1013 tree_last (tree chain)
1017 while ((next = TREE_CHAIN (chain)))
1022 /* Reverse the order of elements in the chain T,
1023 and return the new head of the chain (old last element). */
1028 tree prev = 0, decl, next;
1029 for (decl = t; decl; decl = next)
1031 next = TREE_CHAIN (decl);
1032 TREE_CHAIN (decl) = prev;
1038 /* Return a newly created TREE_LIST node whose
1039 purpose and value fields are PARM and VALUE. */
1042 build_tree_list (tree parm, tree value)
1044 tree t = make_node (TREE_LIST);
1045 TREE_PURPOSE (t) = parm;
1046 TREE_VALUE (t) = value;
1050 /* Return a newly created TREE_LIST node whose
1051 purpose and value fields are PURPOSE and VALUE
1052 and whose TREE_CHAIN is CHAIN. */
1055 tree_cons (tree purpose, tree value, tree chain)
1059 node = ggc_alloc_tree (sizeof (struct tree_list));
1061 memset (node, 0, sizeof (struct tree_common));
1063 #ifdef GATHER_STATISTICS
1064 tree_node_counts[(int) x_kind]++;
1065 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1068 TREE_SET_CODE (node, TREE_LIST);
1069 TREE_CHAIN (node) = chain;
1070 TREE_PURPOSE (node) = purpose;
1071 TREE_VALUE (node) = value;
1075 /* Return the first expression in a sequence of COMPOUND_EXPRs. */
1078 expr_first (tree expr)
1080 if (expr == NULL_TREE)
1082 while (TREE_CODE (expr) == COMPOUND_EXPR)
1083 expr = TREE_OPERAND (expr, 0);
1087 /* Return the last expression in a sequence of COMPOUND_EXPRs. */
1090 expr_last (tree expr)
1092 if (expr == NULL_TREE)
1094 while (TREE_CODE (expr) == COMPOUND_EXPR)
1095 expr = TREE_OPERAND (expr, 1);
1099 /* Return the number of subexpressions in a sequence of COMPOUND_EXPRs. */
1102 expr_length (tree expr)
1106 if (expr == NULL_TREE)
1108 for (; TREE_CODE (expr) == COMPOUND_EXPR; expr = TREE_OPERAND (expr, 1))
1109 len += expr_length (TREE_OPERAND (expr, 0));
1114 /* Return the size nominally occupied by an object of type TYPE
1115 when it resides in memory. The value is measured in units of bytes,
1116 and its data type is that normally used for type sizes
1117 (which is the first type created by make_signed_type or
1118 make_unsigned_type). */
1121 size_in_bytes (tree type)
1125 if (type == error_mark_node)
1126 return integer_zero_node;
1128 type = TYPE_MAIN_VARIANT (type);
1129 t = TYPE_SIZE_UNIT (type);
1133 (*lang_hooks.types.incomplete_type_error) (NULL_TREE, type);
1134 return size_zero_node;
1137 if (TREE_CODE (t) == INTEGER_CST)
1138 force_fit_type (t, 0);
1143 /* Return the size of TYPE (in bytes) as a wide integer
1144 or return -1 if the size can vary or is larger than an integer. */
1147 int_size_in_bytes (tree type)
1151 if (type == error_mark_node)
1154 type = TYPE_MAIN_VARIANT (type);
1155 t = TYPE_SIZE_UNIT (type);
1157 || TREE_CODE (t) != INTEGER_CST
1158 || TREE_OVERFLOW (t)
1159 || TREE_INT_CST_HIGH (t) != 0
1160 /* If the result would appear negative, it's too big to represent. */
1161 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1164 return TREE_INT_CST_LOW (t);
1167 /* Return the bit position of FIELD, in bits from the start of the record.
1168 This is a tree of type bitsizetype. */
1171 bit_position (tree field)
1173 return bit_from_pos (DECL_FIELD_OFFSET (field),
1174 DECL_FIELD_BIT_OFFSET (field));
1177 /* Likewise, but return as an integer. Abort if it cannot be represented
1178 in that way (since it could be a signed value, we don't have the option
1179 of returning -1 like int_size_in_byte can. */
1182 int_bit_position (tree field)
1184 return tree_low_cst (bit_position (field), 0);
1187 /* Return the byte position of FIELD, in bytes from the start of the record.
1188 This is a tree of type sizetype. */
1191 byte_position (tree field)
1193 return byte_from_pos (DECL_FIELD_OFFSET (field),
1194 DECL_FIELD_BIT_OFFSET (field));
1197 /* Likewise, but return as an integer. Abort if it cannot be represented
1198 in that way (since it could be a signed value, we don't have the option
1199 of returning -1 like int_size_in_byte can. */
1202 int_byte_position (tree field)
1204 return tree_low_cst (byte_position (field), 0);
1207 /* Return the strictest alignment, in bits, that T is known to have. */
1212 unsigned int align0, align1;
1214 switch (TREE_CODE (t))
1216 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1217 /* If we have conversions, we know that the alignment of the
1218 object must meet each of the alignments of the types. */
1219 align0 = expr_align (TREE_OPERAND (t, 0));
1220 align1 = TYPE_ALIGN (TREE_TYPE (t));
1221 return MAX (align0, align1);
1223 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1224 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1225 case WITH_RECORD_EXPR: case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1226 /* These don't change the alignment of an object. */
1227 return expr_align (TREE_OPERAND (t, 0));
1230 /* The best we can do is say that the alignment is the least aligned
1232 align0 = expr_align (TREE_OPERAND (t, 1));
1233 align1 = expr_align (TREE_OPERAND (t, 2));
1234 return MIN (align0, align1);
1236 case LABEL_DECL: case CONST_DECL:
1237 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1238 if (DECL_ALIGN (t) != 0)
1239 return DECL_ALIGN (t);
1243 return FUNCTION_BOUNDARY;
1249 /* Otherwise take the alignment from that of the type. */
1250 return TYPE_ALIGN (TREE_TYPE (t));
1253 /* Return, as a tree node, the number of elements for TYPE (which is an
1254 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1257 array_type_nelts (tree type)
1259 tree index_type, min, max;
1261 /* If they did it with unspecified bounds, then we should have already
1262 given an error about it before we got here. */
1263 if (! TYPE_DOMAIN (type))
1264 return error_mark_node;
1266 index_type = TYPE_DOMAIN (type);
1267 min = TYPE_MIN_VALUE (index_type);
1268 max = TYPE_MAX_VALUE (index_type);
1270 return (integer_zerop (min)
1272 : fold (build (MINUS_EXPR, TREE_TYPE (max), max, min)));
1275 /* Return nonzero if arg is static -- a reference to an object in
1276 static storage. This is not the same as the C meaning of `static'. */
1281 switch (TREE_CODE (arg))
1284 /* Nested functions aren't static, since taking their address
1285 involves a trampoline. */
1286 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1287 && ! DECL_NON_ADDR_CONST_P (arg));
1290 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1291 && ! DECL_THREAD_LOCAL (arg)
1292 && ! DECL_NON_ADDR_CONST_P (arg));
1295 return TREE_STATIC (arg);
1301 /* If we are referencing a bitfield, we can't evaluate an
1302 ADDR_EXPR at compile time and so it isn't a constant. */
1304 return (! DECL_BIT_FIELD (TREE_OPERAND (arg, 1))
1305 && staticp (TREE_OPERAND (arg, 0)));
1311 /* This case is technically correct, but results in setting
1312 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1315 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1319 case ARRAY_RANGE_REF:
1320 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1321 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1322 return staticp (TREE_OPERAND (arg, 0));
1325 if ((unsigned int) TREE_CODE (arg)
1326 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1327 return (*lang_hooks.staticp) (arg);
1333 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1334 Do this to any expression which may be used in more than one place,
1335 but must be evaluated only once.
1337 Normally, expand_expr would reevaluate the expression each time.
1338 Calling save_expr produces something that is evaluated and recorded
1339 the first time expand_expr is called on it. Subsequent calls to
1340 expand_expr just reuse the recorded value.
1342 The call to expand_expr that generates code that actually computes
1343 the value is the first call *at compile time*. Subsequent calls
1344 *at compile time* generate code to use the saved value.
1345 This produces correct result provided that *at run time* control
1346 always flows through the insns made by the first expand_expr
1347 before reaching the other places where the save_expr was evaluated.
1348 You, the caller of save_expr, must make sure this is so.
1350 Constants, and certain read-only nodes, are returned with no
1351 SAVE_EXPR because that is safe. Expressions containing placeholders
1352 are not touched; see tree.def for an explanation of what these
1356 save_expr (tree expr)
1358 tree t = fold (expr);
1361 /* If the tree evaluates to a constant, then we don't want to hide that
1362 fact (i.e. this allows further folding, and direct checks for constants).
1363 However, a read-only object that has side effects cannot be bypassed.
1364 Since it is no problem to reevaluate literals, we just return the
1366 inner = skip_simple_arithmetic (t);
1367 if (TREE_CONSTANT (inner)
1368 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1369 || TREE_CODE (inner) == SAVE_EXPR
1370 || TREE_CODE (inner) == ERROR_MARK)
1373 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1374 it means that the size or offset of some field of an object depends on
1375 the value within another field.
1377 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1378 and some variable since it would then need to be both evaluated once and
1379 evaluated more than once. Front-ends must assure this case cannot
1380 happen by surrounding any such subexpressions in their own SAVE_EXPR
1381 and forcing evaluation at the proper time. */
1382 if (contains_placeholder_p (inner))
1385 t = build (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl, NULL_TREE);
1387 /* This expression might be placed ahead of a jump to ensure that the
1388 value was computed on both sides of the jump. So make sure it isn't
1389 eliminated as dead. */
1390 TREE_SIDE_EFFECTS (t) = 1;
1391 TREE_READONLY (t) = 1;
1395 /* Look inside EXPR and into any simple arithmetic operations. Return
1396 the innermost non-arithmetic node. */
1399 skip_simple_arithmetic (tree expr)
1403 /* We don't care about whether this can be used as an lvalue in this
1405 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1406 expr = TREE_OPERAND (expr, 0);
1408 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1409 a constant, it will be more efficient to not make another SAVE_EXPR since
1410 it will allow better simplification and GCSE will be able to merge the
1411 computations if they actually occur. */
1415 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1416 inner = TREE_OPERAND (inner, 0);
1417 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1419 if (TREE_CONSTANT (TREE_OPERAND (inner, 1)))
1420 inner = TREE_OPERAND (inner, 0);
1421 else if (TREE_CONSTANT (TREE_OPERAND (inner, 0)))
1422 inner = TREE_OPERAND (inner, 1);
1433 /* Return TRUE if EXPR is a SAVE_EXPR or wraps simple arithmetic around a
1434 SAVE_EXPR. Return FALSE otherwise. */
1437 saved_expr_p (tree expr)
1439 return TREE_CODE (skip_simple_arithmetic (expr)) == SAVE_EXPR;
1442 /* Arrange for an expression to be expanded multiple independent
1443 times. This is useful for cleanup actions, as the backend can
1444 expand them multiple times in different places. */
1447 unsave_expr (tree expr)
1451 /* If this is already protected, no sense in protecting it again. */
1452 if (TREE_CODE (expr) == UNSAVE_EXPR)
1455 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1456 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1460 /* Returns the index of the first non-tree operand for CODE, or the number
1461 of operands if all are trees. */
1464 first_rtl_op (enum tree_code code)
1470 case GOTO_SUBROUTINE_EXPR:
1473 case WITH_CLEANUP_EXPR:
1476 return TREE_CODE_LENGTH (code);
1480 /* Return which tree structure is used by T. */
1482 enum tree_node_structure_enum
1483 tree_node_structure (tree t)
1485 enum tree_code code = TREE_CODE (t);
1487 switch (TREE_CODE_CLASS (code))
1489 case 'd': return TS_DECL;
1490 case 't': return TS_TYPE;
1491 case 'b': return TS_BLOCK;
1492 case 'r': case '<': case '1': case '2': case 'e': case 's':
1494 default: /* 'c' and 'x' */
1500 case INTEGER_CST: return TS_INT_CST;
1501 case REAL_CST: return TS_REAL_CST;
1502 case COMPLEX_CST: return TS_COMPLEX;
1503 case VECTOR_CST: return TS_VECTOR;
1504 case STRING_CST: return TS_STRING;
1506 case ERROR_MARK: return TS_COMMON;
1507 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1508 case TREE_LIST: return TS_LIST;
1509 case TREE_VEC: return TS_VEC;
1510 case PLACEHOLDER_EXPR: return TS_COMMON;
1517 /* Perform any modifications to EXPR required when it is unsaved. Does
1518 not recurse into EXPR's subtrees. */
1521 unsave_expr_1 (tree expr)
1523 switch (TREE_CODE (expr))
1526 if (! SAVE_EXPR_PERSISTENT_P (expr))
1527 SAVE_EXPR_RTL (expr) = 0;
1531 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1532 It's OK for this to happen if it was part of a subtree that
1533 isn't immediately expanded, such as operand 2 of another
1535 if (TREE_OPERAND (expr, 1))
1538 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1539 TREE_OPERAND (expr, 3) = NULL_TREE;
1543 /* I don't yet know how to emit a sequence multiple times. */
1544 if (RTL_EXPR_SEQUENCE (expr) != 0)
1553 /* Default lang hook for "unsave_expr_now". */
1556 lhd_unsave_expr_now (tree expr)
1558 enum tree_code code;
1560 /* There's nothing to do for NULL_TREE. */
1564 unsave_expr_1 (expr);
1566 code = TREE_CODE (expr);
1567 switch (TREE_CODE_CLASS (code))
1569 case 'c': /* a constant */
1570 case 't': /* a type node */
1571 case 'd': /* A decl node */
1572 case 'b': /* A block node */
1575 case 'x': /* miscellaneous: e.g., identifier, TREE_LIST or ERROR_MARK. */
1576 if (code == TREE_LIST)
1578 lhd_unsave_expr_now (TREE_VALUE (expr));
1579 lhd_unsave_expr_now (TREE_CHAIN (expr));
1583 case 'e': /* an expression */
1584 case 'r': /* a reference */
1585 case 's': /* an expression with side effects */
1586 case '<': /* a comparison expression */
1587 case '2': /* a binary arithmetic expression */
1588 case '1': /* a unary arithmetic expression */
1592 for (i = first_rtl_op (code) - 1; i >= 0; i--)
1593 lhd_unsave_expr_now (TREE_OPERAND (expr, i));
1604 /* Return 0 if it is safe to evaluate EXPR multiple times,
1605 return 1 if it is safe if EXPR is unsaved afterward, or
1606 return 2 if it is completely unsafe.
1608 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1609 an expression tree, so that it safe to unsave them and the surrounding
1610 context will be correct.
1612 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1613 occasionally across the whole of a function. It is therefore only
1614 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1615 below the UNSAVE_EXPR.
1617 RTL_EXPRs consume their rtl during evaluation. It is therefore
1618 never possible to unsave them. */
1621 unsafe_for_reeval (tree expr)
1624 enum tree_code code;
1629 if (expr == NULL_TREE)
1632 code = TREE_CODE (expr);
1633 first_rtl = first_rtl_op (code);
1642 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1644 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1645 unsafeness = MAX (tmp, unsafeness);
1651 tmp2 = unsafe_for_reeval (TREE_OPERAND (expr, 0));
1652 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1653 return MAX (MAX (tmp, 1), tmp2);
1659 case EXIT_BLOCK_EXPR:
1660 /* EXIT_BLOCK_LABELED_BLOCK, a.k.a. TREE_OPERAND (expr, 0), holds
1661 a reference to an ancestor LABELED_BLOCK, so we need to avoid
1662 unbounded recursion in the 'e' traversal code below. */
1663 exp = EXIT_BLOCK_RETURN (expr);
1664 return exp ? unsafe_for_reeval (exp) : 0;
1667 tmp = (*lang_hooks.unsafe_for_reeval) (expr);
1673 switch (TREE_CODE_CLASS (code))
1675 case 'c': /* a constant */
1676 case 't': /* a type node */
1677 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1678 case 'd': /* A decl node */
1679 case 'b': /* A block node */
1682 case 'e': /* an expression */
1683 case 'r': /* a reference */
1684 case 's': /* an expression with side effects */
1685 case '<': /* a comparison expression */
1686 case '2': /* a binary arithmetic expression */
1687 case '1': /* a unary arithmetic expression */
1688 for (i = first_rtl - 1; i >= 0; i--)
1690 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1691 unsafeness = MAX (tmp, unsafeness);
1701 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1702 or offset that depends on a field within a record. */
1705 contains_placeholder_p (tree exp)
1707 enum tree_code code;
1713 /* If we have a WITH_RECORD_EXPR, it "cancels" any PLACEHOLDER_EXPR
1714 in it since it is supplying a value for it. */
1715 code = TREE_CODE (exp);
1716 if (code == WITH_RECORD_EXPR)
1718 else if (code == PLACEHOLDER_EXPR)
1721 switch (TREE_CODE_CLASS (code))
1724 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1725 position computations since they will be converted into a
1726 WITH_RECORD_EXPR involving the reference, which will assume
1727 here will be valid. */
1728 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1731 if (code == TREE_LIST)
1732 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1733 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1742 /* Ignoring the first operand isn't quite right, but works best. */
1743 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1750 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1751 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1752 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1755 /* If we already know this doesn't have a placeholder, don't
1757 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1760 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1761 result = CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1763 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1768 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1774 switch (TREE_CODE_LENGTH (code))
1777 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1779 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1780 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1791 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1792 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1796 type_contains_placeholder_p (tree type)
1798 /* If the size contains a placeholder or the parent type (component type in
1799 the case of arrays) type involves a placeholder, this type does. */
1800 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1801 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1802 || (TREE_TYPE (type) != 0
1803 && type_contains_placeholder_p (TREE_TYPE (type))))
1806 /* Now do type-specific checks. Note that the last part of the check above
1807 greatly limits what we have to do below. */
1808 switch (TREE_CODE (type))
1818 case REFERENCE_TYPE:
1826 /* Here we just check the bounds. */
1827 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1828 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1832 /* We're already checked the component type (TREE_TYPE), so just check
1834 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1838 case QUAL_UNION_TYPE:
1840 static tree seen_types = 0;
1844 /* We have to be careful here that we don't end up in infinite
1845 recursions due to a field of a type being a pointer to that type
1846 or to a mutually-recursive type. So we store a list of record
1847 types that we've seen and see if this type is in them. To save
1848 memory, we don't use a list for just one type. Here we check
1849 whether we've seen this type before and store it if not. */
1850 if (seen_types == 0)
1852 else if (TREE_CODE (seen_types) != TREE_LIST)
1854 if (seen_types == type)
1857 seen_types = tree_cons (NULL_TREE, type,
1858 build_tree_list (NULL_TREE, seen_types));
1862 if (value_member (type, seen_types) != 0)
1865 seen_types = tree_cons (NULL_TREE, type, seen_types);
1868 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1869 if (TREE_CODE (field) == FIELD_DECL
1870 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1871 || (TREE_CODE (type) == QUAL_UNION_TYPE
1872 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1873 || type_contains_placeholder_p (TREE_TYPE (field))))
1879 /* Now remove us from seen_types and return the result. */
1880 if (seen_types == type)
1883 seen_types = TREE_CHAIN (seen_types);
1893 /* Return 1 if EXP contains any expressions that produce cleanups for an
1894 outer scope to deal with. Used by fold. */
1897 has_cleanups (tree exp)
1901 if (! TREE_SIDE_EFFECTS (exp))
1904 switch (TREE_CODE (exp))
1907 case GOTO_SUBROUTINE_EXPR:
1908 case WITH_CLEANUP_EXPR:
1911 case CLEANUP_POINT_EXPR:
1915 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1917 cmp = has_cleanups (TREE_VALUE (exp));
1927 /* This general rule works for most tree codes. All exceptions should be
1928 handled above. If this is a language-specific tree code, we can't
1929 trust what might be in the operand, so say we don't know
1931 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1934 nops = first_rtl_op (TREE_CODE (exp));
1935 for (i = 0; i < nops; i++)
1936 if (TREE_OPERAND (exp, i) != 0)
1938 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1939 if (type == 'e' || type == '<' || type == '1' || type == '2'
1940 || type == 'r' || type == 's')
1942 cmp = has_cleanups (TREE_OPERAND (exp, i));
1951 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1952 return a tree with all occurrences of references to F in a
1953 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1954 contains only arithmetic expressions or a CALL_EXPR with a
1955 PLACEHOLDER_EXPR occurring only in its arglist. */
1958 substitute_in_expr (tree exp, tree f, tree r)
1960 enum tree_code code = TREE_CODE (exp);
1965 switch (TREE_CODE_CLASS (code))
1972 if (code == PLACEHOLDER_EXPR)
1974 else if (code == TREE_LIST)
1976 op0 = (TREE_CHAIN (exp) == 0
1977 ? 0 : substitute_in_expr (TREE_CHAIN (exp), f, r));
1978 op1 = substitute_in_expr (TREE_VALUE (exp), f, r);
1979 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1982 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1991 switch (TREE_CODE_LENGTH (code))
1994 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
1995 if (op0 == TREE_OPERAND (exp, 0))
1998 if (code == NON_LVALUE_EXPR)
2001 new = fold (build1 (code, TREE_TYPE (exp), op0));
2005 /* An RTL_EXPR cannot contain a PLACEHOLDER_EXPR; a CONSTRUCTOR
2006 could, but we don't support it. */
2007 if (code == RTL_EXPR)
2009 else if (code == CONSTRUCTOR)
2012 op0 = TREE_OPERAND (exp, 0);
2013 op1 = TREE_OPERAND (exp, 1);
2014 if (CONTAINS_PLACEHOLDER_P (op0))
2015 op0 = substitute_in_expr (op0, f, r);
2016 if (CONTAINS_PLACEHOLDER_P (op1))
2017 op1 = substitute_in_expr (op1, f, r);
2019 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2022 new = fold (build (code, TREE_TYPE (exp), op0, op1));
2026 /* It cannot be that anything inside a SAVE_EXPR contains a
2027 PLACEHOLDER_EXPR. */
2028 if (code == SAVE_EXPR)
2031 else if (code == CALL_EXPR)
2033 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2034 if (op1 == TREE_OPERAND (exp, 1))
2037 return build (code, TREE_TYPE (exp),
2038 TREE_OPERAND (exp, 0), op1, NULL_TREE);
2041 else if (code != COND_EXPR)
2044 op0 = TREE_OPERAND (exp, 0);
2045 op1 = TREE_OPERAND (exp, 1);
2046 op2 = TREE_OPERAND (exp, 2);
2048 if (CONTAINS_PLACEHOLDER_P (op0))
2049 op0 = substitute_in_expr (op0, f, r);
2050 if (CONTAINS_PLACEHOLDER_P (op1))
2051 op1 = substitute_in_expr (op1, f, r);
2052 if (CONTAINS_PLACEHOLDER_P (op2))
2053 op2 = substitute_in_expr (op2, f, r);
2055 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2056 && op2 == TREE_OPERAND (exp, 2))
2059 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2072 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2073 and it is the right field, replace it with R. */
2074 for (inner = TREE_OPERAND (exp, 0);
2075 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
2076 inner = TREE_OPERAND (inner, 0))
2078 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2079 && TREE_OPERAND (exp, 1) == f)
2082 /* If this expression hasn't been completed let, leave it
2084 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
2085 && TREE_TYPE (inner) == 0)
2088 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2089 if (op0 == TREE_OPERAND (exp, 0))
2092 new = fold (build (code, TREE_TYPE (exp), op0,
2093 TREE_OPERAND (exp, 1)));
2097 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2098 op1 = substitute_in_expr (TREE_OPERAND (exp, 1), f, r);
2099 op2 = substitute_in_expr (TREE_OPERAND (exp, 2), f, r);
2100 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2101 && op2 == TREE_OPERAND (exp, 2))
2104 new = fold (build (code, TREE_TYPE (exp), op0, op1, op2));
2109 op0 = substitute_in_expr (TREE_OPERAND (exp, 0), f, r);
2110 if (op0 == TREE_OPERAND (exp, 0))
2113 new = fold (build1 (code, TREE_TYPE (exp), op0));
2125 TREE_READONLY (new) = TREE_READONLY (exp);
2129 /* Stabilize a reference so that we can use it any number of times
2130 without causing its operands to be evaluated more than once.
2131 Returns the stabilized reference. This works by means of save_expr,
2132 so see the caveats in the comments about save_expr.
2134 Also allows conversion expressions whose operands are references.
2135 Any other kind of expression is returned unchanged. */
2138 stabilize_reference (tree ref)
2141 enum tree_code code = TREE_CODE (ref);
2148 /* No action is needed in this case. */
2154 case FIX_TRUNC_EXPR:
2155 case FIX_FLOOR_EXPR:
2156 case FIX_ROUND_EXPR:
2158 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2162 result = build_nt (INDIRECT_REF,
2163 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2167 result = build_nt (COMPONENT_REF,
2168 stabilize_reference (TREE_OPERAND (ref, 0)),
2169 TREE_OPERAND (ref, 1));
2173 result = build_nt (BIT_FIELD_REF,
2174 stabilize_reference (TREE_OPERAND (ref, 0)),
2175 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2176 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2180 result = build_nt (ARRAY_REF,
2181 stabilize_reference (TREE_OPERAND (ref, 0)),
2182 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2185 case ARRAY_RANGE_REF:
2186 result = build_nt (ARRAY_RANGE_REF,
2187 stabilize_reference (TREE_OPERAND (ref, 0)),
2188 stabilize_reference_1 (TREE_OPERAND (ref, 1)));
2192 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2193 it wouldn't be ignored. This matters when dealing with
2195 return stabilize_reference_1 (ref);
2198 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2199 save_expr (build1 (ADDR_EXPR,
2200 build_pointer_type (TREE_TYPE (ref)),
2204 /* If arg isn't a kind of lvalue we recognize, make no change.
2205 Caller should recognize the error for an invalid lvalue. */
2210 return error_mark_node;
2213 TREE_TYPE (result) = TREE_TYPE (ref);
2214 TREE_READONLY (result) = TREE_READONLY (ref);
2215 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2216 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2221 /* Subroutine of stabilize_reference; this is called for subtrees of
2222 references. Any expression with side-effects must be put in a SAVE_EXPR
2223 to ensure that it is only evaluated once.
2225 We don't put SAVE_EXPR nodes around everything, because assigning very
2226 simple expressions to temporaries causes us to miss good opportunities
2227 for optimizations. Among other things, the opportunity to fold in the
2228 addition of a constant into an addressing mode often gets lost, e.g.
2229 "y[i+1] += x;". In general, we take the approach that we should not make
2230 an assignment unless we are forced into it - i.e., that any non-side effect
2231 operator should be allowed, and that cse should take care of coalescing
2232 multiple utterances of the same expression should that prove fruitful. */
2235 stabilize_reference_1 (tree e)
2238 enum tree_code code = TREE_CODE (e);
2240 /* We cannot ignore const expressions because it might be a reference
2241 to a const array but whose index contains side-effects. But we can
2242 ignore things that are actual constant or that already have been
2243 handled by this function. */
2245 if (TREE_CONSTANT (e) || code == SAVE_EXPR)
2248 switch (TREE_CODE_CLASS (code))
2258 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2259 so that it will only be evaluated once. */
2260 /* The reference (r) and comparison (<) classes could be handled as
2261 below, but it is generally faster to only evaluate them once. */
2262 if (TREE_SIDE_EFFECTS (e))
2263 return save_expr (e);
2267 /* Constants need no processing. In fact, we should never reach
2272 /* Division is slow and tends to be compiled with jumps,
2273 especially the division by powers of 2 that is often
2274 found inside of an array reference. So do it just once. */
2275 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2276 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2277 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2278 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2279 return save_expr (e);
2280 /* Recursively stabilize each operand. */
2281 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2282 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2286 /* Recursively stabilize each operand. */
2287 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2294 TREE_TYPE (result) = TREE_TYPE (e);
2295 TREE_READONLY (result) = TREE_READONLY (e);
2296 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2297 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2302 /* Low-level constructors for expressions. */
2304 /* Build an expression of code CODE, data type TYPE,
2305 and operands as specified by the arguments ARG1 and following arguments.
2306 Expressions and reference nodes can be created this way.
2307 Constants, decls, types and misc nodes cannot be. */
2310 build (enum tree_code code, tree tt, ...)
2322 t = make_node (code);
2323 length = TREE_CODE_LENGTH (code);
2326 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2327 result based on those same flags for the arguments. But if the
2328 arguments aren't really even `tree' expressions, we shouldn't be trying
2330 fro = first_rtl_op (code);
2332 /* Expressions without side effects may be constant if their
2333 arguments are as well. */
2334 constant = (TREE_CODE_CLASS (code) == '<'
2335 || TREE_CODE_CLASS (code) == '1'
2336 || TREE_CODE_CLASS (code) == '2'
2337 || TREE_CODE_CLASS (code) == 'c');
2341 /* This is equivalent to the loop below, but faster. */
2342 tree arg0 = va_arg (p, tree);
2343 tree arg1 = va_arg (p, tree);
2345 TREE_OPERAND (t, 0) = arg0;
2346 TREE_OPERAND (t, 1) = arg1;
2347 TREE_READONLY (t) = 1;
2348 if (arg0 && fro > 0)
2350 if (TREE_SIDE_EFFECTS (arg0))
2351 TREE_SIDE_EFFECTS (t) = 1;
2352 if (!TREE_READONLY (arg0))
2353 TREE_READONLY (t) = 0;
2354 if (!TREE_CONSTANT (arg0))
2358 if (arg1 && fro > 1)
2360 if (TREE_SIDE_EFFECTS (arg1))
2361 TREE_SIDE_EFFECTS (t) = 1;
2362 if (!TREE_READONLY (arg1))
2363 TREE_READONLY (t) = 0;
2364 if (!TREE_CONSTANT (arg1))
2368 else if (length == 1)
2370 tree arg0 = va_arg (p, tree);
2372 /* The only one-operand cases we handle here are those with side-effects.
2373 Others are handled with build1. So don't bother checked if the
2374 arg has side-effects since we'll already have set it.
2376 ??? This really should use build1 too. */
2377 if (TREE_CODE_CLASS (code) != 's')
2379 TREE_OPERAND (t, 0) = arg0;
2383 for (i = 0; i < length; i++)
2385 tree operand = va_arg (p, tree);
2387 TREE_OPERAND (t, i) = operand;
2388 if (operand && fro > i)
2390 if (TREE_SIDE_EFFECTS (operand))
2391 TREE_SIDE_EFFECTS (t) = 1;
2392 if (!TREE_CONSTANT (operand))
2399 TREE_CONSTANT (t) = constant;
2401 if (code == CALL_EXPR && !TREE_SIDE_EFFECTS (t))
2403 /* Calls have side-effects, except those to const or
2405 i = call_expr_flags (t);
2406 if (!(i & (ECF_CONST | ECF_PURE)))
2407 TREE_SIDE_EFFECTS (t) = 1;
2409 /* And even those have side-effects if their arguments do. */
2410 else for (node = TREE_OPERAND (t, 1); node; node = TREE_CHAIN (node))
2411 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2413 TREE_SIDE_EFFECTS (t) = 1;
2421 /* Same as above, but only builds for unary operators.
2422 Saves lions share of calls to `build'; cuts down use
2423 of varargs, which is expensive for RISC machines. */
2426 build1 (enum tree_code code, tree type, tree node)
2428 int length = sizeof (struct tree_exp);
2429 #ifdef GATHER_STATISTICS
2430 tree_node_kind kind;
2434 #ifdef GATHER_STATISTICS
2435 switch (TREE_CODE_CLASS (code))
2437 case 's': /* an expression with side effects */
2440 case 'r': /* a reference */
2448 tree_node_counts[(int) kind]++;
2449 tree_node_sizes[(int) kind] += length;
2452 #ifdef ENABLE_CHECKING
2453 if (TREE_CODE_CLASS (code) == '2'
2454 || TREE_CODE_CLASS (code) == '<'
2455 || TREE_CODE_LENGTH (code) != 1)
2457 #endif /* ENABLE_CHECKING */
2459 t = ggc_alloc_tree (length);
2461 memset (t, 0, sizeof (struct tree_common));
2463 TREE_SET_CODE (t, code);
2465 TREE_TYPE (t) = type;
2466 TREE_COMPLEXITY (t) = 0;
2467 TREE_OPERAND (t, 0) = node;
2468 if (node && first_rtl_op (code) != 0)
2470 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2471 TREE_READONLY (t) = TREE_READONLY (node);
2474 if (TREE_CODE_CLASS (code) == 's')
2475 TREE_SIDE_EFFECTS (t) = 1;
2482 case PREDECREMENT_EXPR:
2483 case PREINCREMENT_EXPR:
2484 case POSTDECREMENT_EXPR:
2485 case POSTINCREMENT_EXPR:
2486 /* All of these have side-effects, no matter what their
2488 TREE_SIDE_EFFECTS (t) = 1;
2489 TREE_READONLY (t) = 0;
2493 /* Whether a dereference is readonly has nothing to do with whether
2494 its operand is readonly. */
2495 TREE_READONLY (t) = 0;
2501 /* The address of a volatile decl or reference does not have
2502 side-effects. But be careful not to ignore side-effects from
2503 other sources deeper in the expression--if node is a _REF and
2504 one of its operands has side-effects, so do we. */
2505 if (TREE_THIS_VOLATILE (node))
2507 TREE_SIDE_EFFECTS (t) = 0;
2510 int i = first_rtl_op (TREE_CODE (node)) - 1;
2513 if (TREE_SIDE_EFFECTS (TREE_OPERAND (node, i)))
2514 TREE_SIDE_EFFECTS (t) = 1;
2522 if (TREE_CODE_CLASS (code) == '1' && node && TREE_CONSTANT (node))
2523 TREE_CONSTANT (t) = 1;
2530 /* Similar except don't specify the TREE_TYPE
2531 and leave the TREE_SIDE_EFFECTS as 0.
2532 It is permissible for arguments to be null,
2533 or even garbage if their values do not matter. */
2536 build_nt (enum tree_code code, ...)
2545 t = make_node (code);
2546 length = TREE_CODE_LENGTH (code);
2548 for (i = 0; i < length; i++)
2549 TREE_OPERAND (t, i) = va_arg (p, tree);
2555 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2556 We do NOT enter this node in any sort of symbol table.
2558 layout_decl is used to set up the decl's storage layout.
2559 Other slots are initialized to 0 or null pointers. */
2562 build_decl (enum tree_code code, tree name, tree type)
2566 t = make_node (code);
2568 /* if (type == error_mark_node)
2569 type = integer_type_node; */
2570 /* That is not done, deliberately, so that having error_mark_node
2571 as the type can suppress useless errors in the use of this variable. */
2573 DECL_NAME (t) = name;
2574 TREE_TYPE (t) = type;
2576 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2578 else if (code == FUNCTION_DECL)
2579 DECL_MODE (t) = FUNCTION_MODE;
2584 /* BLOCK nodes are used to represent the structure of binding contours
2585 and declarations, once those contours have been exited and their contents
2586 compiled. This information is used for outputting debugging info. */
2589 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2590 tree supercontext, tree chain)
2592 tree block = make_node (BLOCK);
2594 BLOCK_VARS (block) = vars;
2595 BLOCK_SUBBLOCKS (block) = subblocks;
2596 BLOCK_SUPERCONTEXT (block) = supercontext;
2597 BLOCK_CHAIN (block) = chain;
2601 /* EXPR_WITH_FILE_LOCATION are used to keep track of the exact
2602 location where an expression or an identifier were encountered. It
2603 is necessary for languages where the frontend parser will handle
2604 recursively more than one file (Java is one of them). */
2607 build_expr_wfl (tree node, const char *file, int line, int col)
2609 static const char *last_file = 0;
2610 static tree last_filenode = NULL_TREE;
2611 tree wfl = make_node (EXPR_WITH_FILE_LOCATION);
2613 EXPR_WFL_NODE (wfl) = node;
2614 EXPR_WFL_SET_LINECOL (wfl, line, col);
2615 if (file != last_file)
2618 last_filenode = file ? get_identifier (file) : NULL_TREE;
2621 EXPR_WFL_FILENAME_NODE (wfl) = last_filenode;
2624 TREE_SIDE_EFFECTS (wfl) = TREE_SIDE_EFFECTS (node);
2625 TREE_TYPE (wfl) = TREE_TYPE (node);
2631 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2635 build_decl_attribute_variant (tree ddecl, tree attribute)
2637 DECL_ATTRIBUTES (ddecl) = attribute;
2641 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2644 Record such modified types already made so we don't make duplicates. */
2647 build_type_attribute_variant (tree ttype, tree attribute)
2649 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2651 unsigned int hashcode;
2654 ntype = copy_node (ttype);
2656 TYPE_POINTER_TO (ntype) = 0;
2657 TYPE_REFERENCE_TO (ntype) = 0;
2658 TYPE_ATTRIBUTES (ntype) = attribute;
2660 /* Create a new main variant of TYPE. */
2661 TYPE_MAIN_VARIANT (ntype) = ntype;
2662 TYPE_NEXT_VARIANT (ntype) = 0;
2663 set_type_quals (ntype, TYPE_UNQUALIFIED);
2665 hashcode = (TYPE_HASH (TREE_CODE (ntype))
2666 + TYPE_HASH (TREE_TYPE (ntype))
2667 + attribute_hash_list (attribute));
2669 switch (TREE_CODE (ntype))
2672 hashcode += TYPE_HASH (TYPE_ARG_TYPES (ntype));
2675 hashcode += TYPE_HASH (TYPE_DOMAIN (ntype));
2678 hashcode += TYPE_HASH (TYPE_MAX_VALUE (ntype));
2681 hashcode += TYPE_HASH (TYPE_PRECISION (ntype));
2687 ntype = type_hash_canon (hashcode, ntype);
2688 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2694 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2697 We try both `text' and `__text__', ATTR may be either one. */
2698 /* ??? It might be a reasonable simplification to require ATTR to be only
2699 `text'. One might then also require attribute lists to be stored in
2700 their canonicalized form. */
2703 is_attribute_p (const char *attr, tree ident)
2705 int ident_len, attr_len;
2708 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2711 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2714 p = IDENTIFIER_POINTER (ident);
2715 ident_len = strlen (p);
2716 attr_len = strlen (attr);
2718 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2722 || attr[attr_len - 2] != '_'
2723 || attr[attr_len - 1] != '_')
2725 if (ident_len == attr_len - 4
2726 && strncmp (attr + 2, p, attr_len - 4) == 0)
2731 if (ident_len == attr_len + 4
2732 && p[0] == '_' && p[1] == '_'
2733 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2734 && strncmp (attr, p + 2, attr_len) == 0)
2741 /* Given an attribute name and a list of attributes, return a pointer to the
2742 attribute's list element if the attribute is part of the list, or NULL_TREE
2743 if not found. If the attribute appears more than once, this only
2744 returns the first occurrence; the TREE_CHAIN of the return value should
2745 be passed back in if further occurrences are wanted. */
2748 lookup_attribute (const char *attr_name, tree list)
2752 for (l = list; l; l = TREE_CHAIN (l))
2754 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2756 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2763 /* Return an attribute list that is the union of a1 and a2. */
2766 merge_attributes (tree a1, tree a2)
2770 /* Either one unset? Take the set one. */
2772 if ((attributes = a1) == 0)
2775 /* One that completely contains the other? Take it. */
2777 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2779 if (attribute_list_contained (a2, a1))
2783 /* Pick the longest list, and hang on the other list. */
2785 if (list_length (a1) < list_length (a2))
2786 attributes = a2, a2 = a1;
2788 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2791 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2794 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2797 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2802 a1 = copy_node (a2);
2803 TREE_CHAIN (a1) = attributes;
2812 /* Given types T1 and T2, merge their attributes and return
2816 merge_type_attributes (tree t1, tree t2)
2818 return merge_attributes (TYPE_ATTRIBUTES (t1),
2819 TYPE_ATTRIBUTES (t2));
2822 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2826 merge_decl_attributes (tree olddecl, tree newdecl)
2828 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2829 DECL_ATTRIBUTES (newdecl));
2832 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
2834 /* Specialization of merge_decl_attributes for various Windows targets.
2836 This handles the following situation:
2838 __declspec (dllimport) int foo;
2841 The second instance of `foo' nullifies the dllimport. */
2844 merge_dllimport_decl_attributes (tree old, tree new)
2847 int delete_dllimport_p;
2849 old = DECL_ATTRIBUTES (old);
2850 new = DECL_ATTRIBUTES (new);
2852 /* What we need to do here is remove from `old' dllimport if it doesn't
2853 appear in `new'. dllimport behaves like extern: if a declaration is
2854 marked dllimport and a definition appears later, then the object
2855 is not dllimport'd. */
2856 if (lookup_attribute ("dllimport", old) != NULL_TREE
2857 && lookup_attribute ("dllimport", new) == NULL_TREE)
2858 delete_dllimport_p = 1;
2860 delete_dllimport_p = 0;
2862 a = merge_attributes (old, new);
2864 if (delete_dllimport_p)
2868 /* Scan the list for dllimport and delete it. */
2869 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
2871 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
2873 if (prev == NULL_TREE)
2876 TREE_CHAIN (prev) = TREE_CHAIN (t);
2885 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
2887 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
2888 of the various TYPE_QUAL values. */
2891 set_type_quals (tree type, int type_quals)
2893 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
2894 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
2895 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
2898 /* Return a version of the TYPE, qualified as indicated by the
2899 TYPE_QUALS, if one exists. If no qualified version exists yet,
2900 return NULL_TREE. */
2903 get_qualified_type (tree type, int type_quals)
2907 /* Search the chain of variants to see if there is already one there just
2908 like the one we need to have. If so, use that existing one. We must
2909 preserve the TYPE_NAME, since there is code that depends on this. */
2910 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
2911 if (TYPE_QUALS (t) == type_quals && TYPE_NAME (t) == TYPE_NAME (type)
2912 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
2913 && attribute_list_equal (TYPE_ATTRIBUTES (t), TYPE_ATTRIBUTES (type)))
2919 /* Like get_qualified_type, but creates the type if it does not
2920 exist. This function never returns NULL_TREE. */
2923 build_qualified_type (tree type, int type_quals)
2927 /* See if we already have the appropriate qualified variant. */
2928 t = get_qualified_type (type, type_quals);
2930 /* If not, build it. */
2933 t = build_type_copy (type);
2934 set_type_quals (t, type_quals);
2940 /* Create a new variant of TYPE, equivalent but distinct.
2941 This is so the caller can modify it. */
2944 build_type_copy (tree type)
2946 tree t, m = TYPE_MAIN_VARIANT (type);
2948 t = copy_node (type);
2950 TYPE_POINTER_TO (t) = 0;
2951 TYPE_REFERENCE_TO (t) = 0;
2953 /* Add this type to the chain of variants of TYPE. */
2954 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
2955 TYPE_NEXT_VARIANT (m) = t;
2960 /* Hashing of types so that we don't make duplicates.
2961 The entry point is `type_hash_canon'. */
2963 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
2964 with types in the TREE_VALUE slots), by adding the hash codes
2965 of the individual types. */
2968 type_hash_list (tree list)
2970 unsigned int hashcode;
2973 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
2974 hashcode += TYPE_HASH (TREE_VALUE (tail));
2979 /* These are the Hashtable callback functions. */
2981 /* Returns true if the types are equal. */
2984 type_hash_eq (const void *va, const void *vb)
2986 const struct type_hash *a = va, *b = vb;
2987 if (a->hash == b->hash
2988 && TREE_CODE (a->type) == TREE_CODE (b->type)
2989 && TREE_TYPE (a->type) == TREE_TYPE (b->type)
2990 && attribute_list_equal (TYPE_ATTRIBUTES (a->type),
2991 TYPE_ATTRIBUTES (b->type))
2992 && TYPE_ALIGN (a->type) == TYPE_ALIGN (b->type)
2993 && (TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
2994 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
2995 TYPE_MAX_VALUE (b->type)))
2996 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
2997 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
2998 TYPE_MIN_VALUE (b->type)))
2999 /* Note that TYPE_DOMAIN is TYPE_ARG_TYPES for FUNCTION_TYPE. */
3000 && (TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type)
3001 || (TYPE_DOMAIN (a->type)
3002 && TREE_CODE (TYPE_DOMAIN (a->type)) == TREE_LIST
3003 && TYPE_DOMAIN (b->type)
3004 && TREE_CODE (TYPE_DOMAIN (b->type)) == TREE_LIST
3005 && type_list_equal (TYPE_DOMAIN (a->type),
3006 TYPE_DOMAIN (b->type)))))
3011 /* Return the cached hash value. */
3014 type_hash_hash (const void *item)
3016 return ((const struct type_hash *) item)->hash;
3019 /* Look in the type hash table for a type isomorphic to TYPE.
3020 If one is found, return it. Otherwise return 0. */
3023 type_hash_lookup (unsigned int hashcode, tree type)
3025 struct type_hash *h, in;
3027 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3028 must call that routine before comparing TYPE_ALIGNs. */
3034 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3040 /* Add an entry to the type-hash-table
3041 for a type TYPE whose hash code is HASHCODE. */
3044 type_hash_add (unsigned int hashcode, tree type)
3046 struct type_hash *h;
3049 h = ggc_alloc (sizeof (struct type_hash));
3052 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3053 *(struct type_hash **) loc = h;
3056 /* Given TYPE, and HASHCODE its hash code, return the canonical
3057 object for an identical type if one already exists.
3058 Otherwise, return TYPE, and record it as the canonical object
3059 if it is a permanent object.
3061 To use this function, first create a type of the sort you want.
3062 Then compute its hash code from the fields of the type that
3063 make it different from other similar types.
3064 Then call this function and use the value.
3065 This function frees the type you pass in if it is a duplicate. */
3067 /* Set to 1 to debug without canonicalization. Never set by program. */
3068 int debug_no_type_hash = 0;
3071 type_hash_canon (unsigned int hashcode, tree type)
3075 if (debug_no_type_hash)
3078 /* See if the type is in the hash table already. If so, return it.
3079 Otherwise, add the type. */
3080 t1 = type_hash_lookup (hashcode, type);
3083 #ifdef GATHER_STATISTICS
3084 tree_node_counts[(int) t_kind]--;
3085 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3091 type_hash_add (hashcode, type);
3096 /* See if the data pointed to by the type hash table is marked. We consider
3097 it marked if the type is marked or if a debug type number or symbol
3098 table entry has been made for the type. This reduces the amount of
3099 debugging output and eliminates that dependency of the debug output on
3100 the number of garbage collections. */
3103 type_hash_marked_p (const void *p)
3105 tree type = ((struct type_hash *) p)->type;
3107 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3111 print_type_hash_statistics (void)
3113 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3114 (long) htab_size (type_hash_table),
3115 (long) htab_elements (type_hash_table),
3116 htab_collisions (type_hash_table));
3119 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3120 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3121 by adding the hash codes of the individual attributes. */
3124 attribute_hash_list (tree list)
3126 unsigned int hashcode;
3129 for (hashcode = 0, tail = list; tail; tail = TREE_CHAIN (tail))
3130 /* ??? Do we want to add in TREE_VALUE too? */
3131 hashcode += TYPE_HASH (TREE_PURPOSE (tail));
3135 /* Given two lists of attributes, return true if list l2 is
3136 equivalent to l1. */
3139 attribute_list_equal (tree l1, tree l2)
3141 return attribute_list_contained (l1, l2)
3142 && attribute_list_contained (l2, l1);
3145 /* Given two lists of attributes, return true if list L2 is
3146 completely contained within L1. */
3147 /* ??? This would be faster if attribute names were stored in a canonicalized
3148 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3149 must be used to show these elements are equivalent (which they are). */
3150 /* ??? It's not clear that attributes with arguments will always be handled
3154 attribute_list_contained (tree l1, tree l2)
3158 /* First check the obvious, maybe the lists are identical. */
3162 /* Maybe the lists are similar. */
3163 for (t1 = l1, t2 = l2;
3165 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3166 && TREE_VALUE (t1) == TREE_VALUE (t2);
3167 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3169 /* Maybe the lists are equal. */
3170 if (t1 == 0 && t2 == 0)
3173 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3176 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3178 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3181 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3188 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3195 /* Given two lists of types
3196 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3197 return 1 if the lists contain the same types in the same order.
3198 Also, the TREE_PURPOSEs must match. */
3201 type_list_equal (tree l1, tree l2)
3205 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3206 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3207 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3208 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3209 && (TREE_TYPE (TREE_PURPOSE (t1))
3210 == TREE_TYPE (TREE_PURPOSE (t2))))))
3216 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3217 given by TYPE. If the argument list accepts variable arguments,
3218 then this function counts only the ordinary arguments. */
3221 type_num_arguments (tree type)
3226 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3227 /* If the function does not take a variable number of arguments,
3228 the last element in the list will have type `void'. */
3229 if (VOID_TYPE_P (TREE_VALUE (t)))
3237 /* Nonzero if integer constants T1 and T2
3238 represent the same constant value. */
3241 tree_int_cst_equal (tree t1, tree t2)
3246 if (t1 == 0 || t2 == 0)
3249 if (TREE_CODE (t1) == INTEGER_CST
3250 && TREE_CODE (t2) == INTEGER_CST
3251 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3252 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3258 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3259 The precise way of comparison depends on their data type. */
3262 tree_int_cst_lt (tree t1, tree t2)
3267 if (TREE_UNSIGNED (TREE_TYPE (t1)) != TREE_UNSIGNED (TREE_TYPE (t2)))
3269 int t1_sgn = tree_int_cst_sgn (t1);
3270 int t2_sgn = tree_int_cst_sgn (t2);
3272 if (t1_sgn < t2_sgn)
3274 else if (t1_sgn > t2_sgn)
3276 /* Otherwise, both are non-negative, so we compare them as
3277 unsigned just in case one of them would overflow a signed
3280 else if (! TREE_UNSIGNED (TREE_TYPE (t1)))
3281 return INT_CST_LT (t1, t2);
3283 return INT_CST_LT_UNSIGNED (t1, t2);
3286 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3289 tree_int_cst_compare (tree t1, tree t2)
3291 if (tree_int_cst_lt (t1, t2))
3293 else if (tree_int_cst_lt (t2, t1))
3299 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3300 the host. If POS is zero, the value can be represented in a single
3301 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3302 be represented in a single unsigned HOST_WIDE_INT. */
3305 host_integerp (tree t, int pos)
3307 return (TREE_CODE (t) == INTEGER_CST
3308 && ! TREE_OVERFLOW (t)
3309 && ((TREE_INT_CST_HIGH (t) == 0
3310 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3311 || (! pos && TREE_INT_CST_HIGH (t) == -1
3312 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3313 && ! TREE_UNSIGNED (TREE_TYPE (t)))
3314 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3317 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3318 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3319 be positive. Abort if we cannot satisfy the above conditions. */
3322 tree_low_cst (tree t, int pos)
3324 if (host_integerp (t, pos))
3325 return TREE_INT_CST_LOW (t);
3330 /* Return the most significant bit of the integer constant T. */
3333 tree_int_cst_msb (tree t)
3337 unsigned HOST_WIDE_INT l;
3339 /* Note that using TYPE_PRECISION here is wrong. We care about the
3340 actual bits, not the (arbitrary) range of the type. */
3341 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3342 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3343 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3344 return (l & 1) == 1;
3347 /* Return an indication of the sign of the integer constant T.
3348 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3349 Note that -1 will never be returned it T's type is unsigned. */
3352 tree_int_cst_sgn (tree t)
3354 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3356 else if (TREE_UNSIGNED (TREE_TYPE (t)))
3358 else if (TREE_INT_CST_HIGH (t) < 0)
3364 /* Compare two constructor-element-type constants. Return 1 if the lists
3365 are known to be equal; otherwise return 0. */
3368 simple_cst_list_equal (tree l1, tree l2)
3370 while (l1 != NULL_TREE && l2 != NULL_TREE)
3372 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3375 l1 = TREE_CHAIN (l1);
3376 l2 = TREE_CHAIN (l2);
3382 /* Return truthvalue of whether T1 is the same tree structure as T2.
3383 Return 1 if they are the same.
3384 Return 0 if they are understandably different.
3385 Return -1 if either contains tree structure not understood by
3389 simple_cst_equal (tree t1, tree t2)
3391 enum tree_code code1, code2;
3397 if (t1 == 0 || t2 == 0)
3400 code1 = TREE_CODE (t1);
3401 code2 = TREE_CODE (t2);
3403 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3405 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3406 || code2 == NON_LVALUE_EXPR)
3407 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3409 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3412 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3413 || code2 == NON_LVALUE_EXPR)
3414 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3422 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3423 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3426 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3429 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3430 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3431 TREE_STRING_LENGTH (t1)));
3434 if (CONSTRUCTOR_ELTS (t1) == CONSTRUCTOR_ELTS (t2))
3440 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3443 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3447 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3450 /* Special case: if either target is an unallocated VAR_DECL,
3451 it means that it's going to be unified with whatever the
3452 TARGET_EXPR is really supposed to initialize, so treat it
3453 as being equivalent to anything. */
3454 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3455 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3456 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3457 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3458 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3459 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3462 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3467 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3469 case WITH_CLEANUP_EXPR:
3470 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3474 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3477 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3478 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3492 /* This general rule works for most tree codes. All exceptions should be
3493 handled above. If this is a language-specific tree code, we can't
3494 trust what might be in the operand, so say we don't know
3496 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3499 switch (TREE_CODE_CLASS (code1))
3508 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3510 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3522 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3523 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3524 than U, respectively. */
3527 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3529 if (tree_int_cst_sgn (t) < 0)
3531 else if (TREE_INT_CST_HIGH (t) != 0)
3533 else if (TREE_INT_CST_LOW (t) == u)
3535 else if (TREE_INT_CST_LOW (t) < u)
3541 /* Generate a hash value for an expression. This can be used iteratively
3542 by passing a previous result as the "val" argument.
3544 This function is intended to produce the same hash for expressions which
3545 would compare equal using operand_equal_p. */
3548 iterative_hash_expr (tree t, hashval_t val)
3551 enum tree_code code;
3555 return iterative_hash_object (t, val);
3557 code = TREE_CODE (t);
3558 class = TREE_CODE_CLASS (code);
3562 /* Decls we can just compare by pointer. */
3563 val = iterative_hash_object (t, val);
3565 else if (class == 'c')
3567 /* Alas, constants aren't shared, so we can't rely on pointer
3569 if (code == INTEGER_CST)
3571 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3572 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3574 else if (code == REAL_CST)
3575 val = iterative_hash (TREE_REAL_CST_PTR (t),
3576 sizeof (REAL_VALUE_TYPE), val);
3577 else if (code == STRING_CST)
3578 val = iterative_hash (TREE_STRING_POINTER (t),
3579 TREE_STRING_LENGTH (t), val);
3580 else if (code == COMPLEX_CST)
3582 val = iterative_hash_expr (TREE_REALPART (t), val);
3583 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3585 else if (code == VECTOR_CST)
3586 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3590 else if (IS_EXPR_CODE_CLASS (class))
3592 val = iterative_hash_object (code, val);
3594 if (code == NOP_EXPR || code == CONVERT_EXPR
3595 || code == NON_LVALUE_EXPR)
3596 val = iterative_hash_object (TREE_TYPE (t), val);
3598 if (code == PLUS_EXPR || code == MULT_EXPR || code == MIN_EXPR
3599 || code == MAX_EXPR || code == BIT_IOR_EXPR || code == BIT_XOR_EXPR
3600 || code == BIT_AND_EXPR || code == NE_EXPR || code == EQ_EXPR)
3602 /* It's a commutative expression. We want to hash it the same
3603 however it appears. We do this by first hashing both operands
3604 and then rehashing based on the order of their independent
3606 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
3607 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
3611 t = one, one = two, two = t;
3613 val = iterative_hash_object (one, val);
3614 val = iterative_hash_object (two, val);
3617 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3618 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3620 else if (code == TREE_LIST)
3622 /* A list of expressions, for a CALL_EXPR or as the elements of a
3624 for (; t; t = TREE_CHAIN (t))
3625 val = iterative_hash_expr (TREE_VALUE (t), val);
3633 /* Constructors for pointer, array and function types.
3634 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3635 constructed by language-dependent code, not here.) */
3637 /* Construct, lay out and return the type of pointers to TO_TYPE
3638 with mode MODE. If such a type has already been constructed,
3642 build_pointer_type_for_mode (tree to_type, enum machine_mode mode)
3644 tree t = TYPE_POINTER_TO (to_type);
3646 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3647 if (t != 0 && mode == ptr_mode)
3650 t = make_node (POINTER_TYPE);
3652 TREE_TYPE (t) = to_type;
3653 TYPE_MODE (t) = mode;
3655 /* Record this type as the pointer to TO_TYPE. */
3656 if (mode == ptr_mode)
3657 TYPE_POINTER_TO (to_type) = t;
3659 /* Lay out the type. This function has many callers that are concerned
3660 with expression-construction, and this simplifies them all.
3661 Also, it guarantees the TYPE_SIZE is in the same obstack as the type. */
3667 /* By default build pointers in ptr_mode. */
3670 build_pointer_type (tree to_type)
3672 return build_pointer_type_for_mode (to_type, ptr_mode);
3675 /* Construct, lay out and return the type of references to TO_TYPE
3676 with mode MODE. If such a type has already been constructed,
3680 build_reference_type_for_mode (tree to_type, enum machine_mode mode)
3682 tree t = TYPE_REFERENCE_TO (to_type);
3684 /* First, if we already have a type for pointers to TO_TYPE, use it. */
3685 if (t != 0 && mode == ptr_mode)
3688 t = make_node (REFERENCE_TYPE);
3690 TREE_TYPE (t) = to_type;
3691 TYPE_MODE (t) = mode;
3693 /* Record this type as the pointer to TO_TYPE. */
3694 if (mode == ptr_mode)
3695 TYPE_REFERENCE_TO (to_type) = t;
3703 /* Build the node for the type of references-to-TO_TYPE by default
3707 build_reference_type (tree to_type)
3709 return build_reference_type_for_mode (to_type, ptr_mode);
3712 /* Build a type that is compatible with t but has no cv quals anywhere
3715 const char *const *const * -> char ***. */
3718 build_type_no_quals (tree t)
3720 switch (TREE_CODE (t))
3723 return build_pointer_type (build_type_no_quals (TREE_TYPE (t)));
3724 case REFERENCE_TYPE:
3725 return build_reference_type (build_type_no_quals (TREE_TYPE (t)));
3727 return TYPE_MAIN_VARIANT (t);
3731 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
3732 MAXVAL should be the maximum value in the domain
3733 (one less than the length of the array).
3735 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
3736 We don't enforce this limit, that is up to caller (e.g. language front end).
3737 The limit exists because the result is a signed type and we don't handle
3738 sizes that use more than one HOST_WIDE_INT. */
3741 build_index_type (tree maxval)
3743 tree itype = make_node (INTEGER_TYPE);
3745 TREE_TYPE (itype) = sizetype;
3746 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
3747 TYPE_MIN_VALUE (itype) = size_zero_node;
3748 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
3749 TYPE_MODE (itype) = TYPE_MODE (sizetype);
3750 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
3751 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
3752 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
3753 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
3755 if (host_integerp (maxval, 1))
3756 return type_hash_canon (tree_low_cst (maxval, 1), itype);
3761 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
3762 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
3763 low bound LOWVAL and high bound HIGHVAL.
3764 if TYPE==NULL_TREE, sizetype is used. */
3767 build_range_type (tree type, tree lowval, tree highval)
3769 tree itype = make_node (INTEGER_TYPE);
3771 TREE_TYPE (itype) = type;
3772 if (type == NULL_TREE)
3775 TYPE_MIN_VALUE (itype) = convert (type, lowval);
3776 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
3778 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
3779 TYPE_MODE (itype) = TYPE_MODE (type);
3780 TYPE_SIZE (itype) = TYPE_SIZE (type);
3781 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
3782 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
3783 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
3785 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
3786 return type_hash_canon (tree_low_cst (highval, 0)
3787 - tree_low_cst (lowval, 0),
3793 /* Just like build_index_type, but takes lowval and highval instead
3794 of just highval (maxval). */
3797 build_index_2_type (tree lowval, tree highval)
3799 return build_range_type (sizetype, lowval, highval);
3802 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
3803 and number of elements specified by the range of values of INDEX_TYPE.
3804 If such a type has already been constructed, reuse it. */
3807 build_array_type (tree elt_type, tree index_type)
3810 unsigned int hashcode;
3812 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
3814 error ("arrays of functions are not meaningful");
3815 elt_type = integer_type_node;
3818 /* Make sure TYPE_POINTER_TO (elt_type) is filled in. */
3819 build_pointer_type (elt_type);
3821 /* Allocate the array after the pointer type,
3822 in case we free it in type_hash_canon. */
3823 t = make_node (ARRAY_TYPE);
3824 TREE_TYPE (t) = elt_type;
3825 TYPE_DOMAIN (t) = index_type;
3827 if (index_type == 0)
3832 hashcode = TYPE_HASH (elt_type) + TYPE_HASH (index_type);
3833 t = type_hash_canon (hashcode, t);
3835 if (!COMPLETE_TYPE_P (t))
3840 /* Return the TYPE of the elements comprising
3841 the innermost dimension of ARRAY. */
3844 get_inner_array_type (tree array)
3846 tree type = TREE_TYPE (array);
3848 while (TREE_CODE (type) == ARRAY_TYPE)
3849 type = TREE_TYPE (type);
3854 /* Construct, lay out and return
3855 the type of functions returning type VALUE_TYPE
3856 given arguments of types ARG_TYPES.
3857 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
3858 are data type nodes for the arguments of the function.
3859 If such a type has already been constructed, reuse it. */
3862 build_function_type (tree value_type, tree arg_types)
3865 unsigned int hashcode;
3867 if (TREE_CODE (value_type) == FUNCTION_TYPE)
3869 error ("function return type cannot be function");
3870 value_type = integer_type_node;
3873 /* Make a node of the sort we want. */
3874 t = make_node (FUNCTION_TYPE);
3875 TREE_TYPE (t) = value_type;
3876 TYPE_ARG_TYPES (t) = arg_types;
3878 /* If we already have such a type, use the old one and free this one. */
3879 hashcode = TYPE_HASH (value_type) + type_hash_list (arg_types);
3880 t = type_hash_canon (hashcode, t);
3882 if (!COMPLETE_TYPE_P (t))
3887 /* Build a function type. The RETURN_TYPE is the type returned by the
3888 function. If additional arguments are provided, they are
3889 additional argument types. The list of argument types must always
3890 be terminated by NULL_TREE. */
3893 build_function_type_list (tree return_type, ...)
3898 va_start (p, return_type);
3900 t = va_arg (p, tree);
3901 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
3902 args = tree_cons (NULL_TREE, t, args);
3905 args = nreverse (args);
3906 TREE_CHAIN (last) = void_list_node;
3907 args = build_function_type (return_type, args);
3913 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
3914 and ARGTYPES (a TREE_LIST) are the return type and arguments types
3915 for the method. An implicit additional parameter (of type
3916 pointer-to-BASETYPE) is added to the ARGTYPES. */
3919 build_method_type_directly (tree basetype,
3927 /* Make a node of the sort we want. */
3928 t = make_node (METHOD_TYPE);
3930 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3931 TREE_TYPE (t) = rettype;
3932 ptype = build_pointer_type (basetype);
3934 /* The actual arglist for this function includes a "hidden" argument
3935 which is "this". Put it into the list of argument types. */
3936 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
3937 TYPE_ARG_TYPES (t) = argtypes;
3939 /* If we already have such a type, use the old one and free this one.
3940 Note that it also frees up the above cons cell if found. */
3941 hashcode = TYPE_HASH (basetype) + TYPE_HASH (rettype) +
3942 type_hash_list (argtypes);
3944 t = type_hash_canon (hashcode, t);
3946 if (!COMPLETE_TYPE_P (t))
3952 /* Construct, lay out and return the type of methods belonging to class
3953 BASETYPE and whose arguments and values are described by TYPE.
3954 If that type exists already, reuse it.
3955 TYPE must be a FUNCTION_TYPE node. */
3958 build_method_type (tree basetype, tree type)
3960 if (TREE_CODE (type) != FUNCTION_TYPE)
3963 return build_method_type_directly (basetype,
3965 TYPE_ARG_TYPES (type));
3968 /* Construct, lay out and return the type of offsets to a value
3969 of type TYPE, within an object of type BASETYPE.
3970 If a suitable offset type exists already, reuse it. */
3973 build_offset_type (tree basetype, tree type)
3976 unsigned int hashcode;
3978 /* Make a node of the sort we want. */
3979 t = make_node (OFFSET_TYPE);
3981 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
3982 TREE_TYPE (t) = type;
3984 /* If we already have such a type, use the old one and free this one. */
3985 hashcode = TYPE_HASH (basetype) + TYPE_HASH (type);
3986 t = type_hash_canon (hashcode, t);
3988 if (!COMPLETE_TYPE_P (t))
3994 /* Create a complex type whose components are COMPONENT_TYPE. */
3997 build_complex_type (tree component_type)
4000 unsigned int hashcode;
4002 /* Make a node of the sort we want. */
4003 t = make_node (COMPLEX_TYPE);
4005 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4006 set_type_quals (t, TYPE_QUALS (component_type));
4008 /* If we already have such a type, use the old one and free this one. */
4009 hashcode = TYPE_HASH (component_type);
4010 t = type_hash_canon (hashcode, t);
4012 if (!COMPLETE_TYPE_P (t))
4015 /* If we are writing Dwarf2 output we need to create a name,
4016 since complex is a fundamental type. */
4017 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4021 if (component_type == char_type_node)
4022 name = "complex char";
4023 else if (component_type == signed_char_type_node)
4024 name = "complex signed char";
4025 else if (component_type == unsigned_char_type_node)
4026 name = "complex unsigned char";
4027 else if (component_type == short_integer_type_node)
4028 name = "complex short int";
4029 else if (component_type == short_unsigned_type_node)
4030 name = "complex short unsigned int";
4031 else if (component_type == integer_type_node)
4032 name = "complex int";
4033 else if (component_type == unsigned_type_node)
4034 name = "complex unsigned int";
4035 else if (component_type == long_integer_type_node)
4036 name = "complex long int";
4037 else if (component_type == long_unsigned_type_node)
4038 name = "complex long unsigned int";
4039 else if (component_type == long_long_integer_type_node)
4040 name = "complex long long int";
4041 else if (component_type == long_long_unsigned_type_node)
4042 name = "complex long long unsigned int";
4047 TYPE_NAME (t) = get_identifier (name);
4053 /* Return OP, stripped of any conversions to wider types as much as is safe.
4054 Converting the value back to OP's type makes a value equivalent to OP.
4056 If FOR_TYPE is nonzero, we return a value which, if converted to
4057 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4059 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4060 narrowest type that can hold the value, even if they don't exactly fit.
4061 Otherwise, bit-field references are changed to a narrower type
4062 only if they can be fetched directly from memory in that type.
4064 OP must have integer, real or enumeral type. Pointers are not allowed!
4066 There are some cases where the obvious value we could return
4067 would regenerate to OP if converted to OP's type,
4068 but would not extend like OP to wider types.
4069 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4070 For example, if OP is (unsigned short)(signed char)-1,
4071 we avoid returning (signed char)-1 if FOR_TYPE is int,
4072 even though extending that to an unsigned short would regenerate OP,
4073 since the result of extending (signed char)-1 to (int)
4074 is different from (int) OP. */
4077 get_unwidened (tree op, tree for_type)
4079 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4080 tree type = TREE_TYPE (op);
4082 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4084 = (for_type != 0 && for_type != type
4085 && final_prec > TYPE_PRECISION (type)
4086 && TREE_UNSIGNED (type));
4089 while (TREE_CODE (op) == NOP_EXPR)
4092 = TYPE_PRECISION (TREE_TYPE (op))
4093 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4095 /* Truncations are many-one so cannot be removed.
4096 Unless we are later going to truncate down even farther. */
4098 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4101 /* See what's inside this conversion. If we decide to strip it,
4103 op = TREE_OPERAND (op, 0);
4105 /* If we have not stripped any zero-extensions (uns is 0),
4106 we can strip any kind of extension.
4107 If we have previously stripped a zero-extension,
4108 only zero-extensions can safely be stripped.
4109 Any extension can be stripped if the bits it would produce
4110 are all going to be discarded later by truncating to FOR_TYPE. */
4114 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4116 /* TREE_UNSIGNED says whether this is a zero-extension.
4117 Let's avoid computing it if it does not affect WIN
4118 and if UNS will not be needed again. */
4119 if ((uns || TREE_CODE (op) == NOP_EXPR)
4120 && TREE_UNSIGNED (TREE_TYPE (op)))
4128 if (TREE_CODE (op) == COMPONENT_REF
4129 /* Since type_for_size always gives an integer type. */
4130 && TREE_CODE (type) != REAL_TYPE
4131 /* Don't crash if field not laid out yet. */
4132 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4133 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4135 unsigned int innerprec
4136 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4137 int unsignedp = (TREE_UNSIGNED (TREE_OPERAND (op, 1))
4138 || TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4139 type = (*lang_hooks.types.type_for_size) (innerprec, unsignedp);
4141 /* We can get this structure field in the narrowest type it fits in.
4142 If FOR_TYPE is 0, do this only for a field that matches the
4143 narrower type exactly and is aligned for it
4144 The resulting extension to its nominal type (a fullword type)
4145 must fit the same conditions as for other extensions. */
4148 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4149 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4150 && (! uns || final_prec <= innerprec || unsignedp))
4152 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4153 TREE_OPERAND (op, 1));
4154 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4155 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4162 /* Return OP or a simpler expression for a narrower value
4163 which can be sign-extended or zero-extended to give back OP.
4164 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4165 or 0 if the value should be sign-extended. */
4168 get_narrower (tree op, int *unsignedp_ptr)
4174 while (TREE_CODE (op) == NOP_EXPR)
4177 = (TYPE_PRECISION (TREE_TYPE (op))
4178 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4180 /* Truncations are many-one so cannot be removed. */
4184 /* See what's inside this conversion. If we decide to strip it,
4189 op = TREE_OPERAND (op, 0);
4190 /* An extension: the outermost one can be stripped,
4191 but remember whether it is zero or sign extension. */
4193 uns = TREE_UNSIGNED (TREE_TYPE (op));
4194 /* Otherwise, if a sign extension has been stripped,
4195 only sign extensions can now be stripped;
4196 if a zero extension has been stripped, only zero-extensions. */
4197 else if (uns != TREE_UNSIGNED (TREE_TYPE (op)))
4201 else /* bitschange == 0 */
4203 /* A change in nominal type can always be stripped, but we must
4204 preserve the unsignedness. */
4206 uns = TREE_UNSIGNED (TREE_TYPE (op));
4208 op = TREE_OPERAND (op, 0);
4214 if (TREE_CODE (op) == COMPONENT_REF
4215 /* Since type_for_size always gives an integer type. */
4216 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4217 /* Ensure field is laid out already. */
4218 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0)
4220 unsigned HOST_WIDE_INT innerprec
4221 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4222 int unsignedp = (TREE_UNSIGNED (TREE_OPERAND (op, 1))
4223 || TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4224 tree type = (*lang_hooks.types.type_for_size) (innerprec, unsignedp);
4226 /* We can get this structure field in a narrower type that fits it,
4227 but the resulting extension to its nominal type (a fullword type)
4228 must satisfy the same conditions as for other extensions.
4230 Do this only for fields that are aligned (not bit-fields),
4231 because when bit-field insns will be used there is no
4232 advantage in doing this. */
4234 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4235 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4236 && (first || uns == TREE_UNSIGNED (TREE_OPERAND (op, 1)))
4240 uns = TREE_UNSIGNED (TREE_OPERAND (op, 1));
4241 win = build (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4242 TREE_OPERAND (op, 1));
4243 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4244 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4247 *unsignedp_ptr = uns;
4251 /* Nonzero if integer constant C has a value that is permissible
4252 for type TYPE (an INTEGER_TYPE). */
4255 int_fits_type_p (tree c, tree type)
4257 tree type_low_bound = TYPE_MIN_VALUE (type);
4258 tree type_high_bound = TYPE_MAX_VALUE (type);
4259 int ok_for_low_bound, ok_for_high_bound;
4261 /* Perform some generic filtering first, which may allow making a decision
4262 even if the bounds are not constant. First, negative integers never fit
4263 in unsigned types, */
4264 if ((TREE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4265 /* Also, unsigned integers with top bit set never fit signed types. */
4266 || (! TREE_UNSIGNED (type)
4267 && TREE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4270 /* If at least one bound of the type is a constant integer, we can check
4271 ourselves and maybe make a decision. If no such decision is possible, but
4272 this type is a subtype, try checking against that. Otherwise, use
4273 force_fit_type, which checks against the precision.
4275 Compute the status for each possibly constant bound, and return if we see
4276 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4277 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4278 for "constant known to fit". */
4280 ok_for_low_bound = -1;
4281 ok_for_high_bound = -1;
4283 /* Check if C >= type_low_bound. */
4284 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4286 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4287 if (! ok_for_low_bound)
4291 /* Check if c <= type_high_bound. */
4292 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4294 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4295 if (! ok_for_high_bound)
4299 /* If the constant fits both bounds, the result is known. */
4300 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4303 /* If we haven't been able to decide at this point, there nothing more we
4304 can check ourselves here. Look at the base type if we have one. */
4305 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4306 return int_fits_type_p (c, TREE_TYPE (type));
4308 /* Or to force_fit_type, if nothing else. */
4312 TREE_TYPE (c) = type;
4313 return !force_fit_type (c, 0);
4317 /* Returns true if T is, contains, or refers to a type with variable
4318 size. This concept is more general than that of C99 'variably
4319 modified types': in C99, a struct type is never variably modified
4320 because a VLA may not appear as a structure member. However, in
4323 struct S { int i[f()]; };
4325 is valid, and other languages may define similar constructs. */
4328 variably_modified_type_p (tree type)
4332 if (type == error_mark_node)
4335 /* If TYPE itself has variable size, it is variably modified.
4337 We do not yet have a representation of the C99 '[*]' syntax.
4338 When a representation is chosen, this function should be modified
4339 to test for that case as well. */
4340 t = TYPE_SIZE (type);
4341 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4344 switch (TREE_CODE (type))
4347 case REFERENCE_TYPE:
4349 /* If TYPE is a pointer or reference, it is variably modified if
4350 the type pointed to is variably modified. Similarly for arrays;
4351 note that VLAs are handled by the TYPE_SIZE check above. */
4352 return variably_modified_type_p (TREE_TYPE (type));
4356 /* If TYPE is a function type, it is variably modified if any of the
4357 parameters or the return type are variably modified. */
4361 if (variably_modified_type_p (TREE_TYPE (type)))
4363 for (parm = TYPE_ARG_TYPES (type);
4364 parm && parm != void_list_node;
4365 parm = TREE_CHAIN (parm))
4366 if (variably_modified_type_p (TREE_VALUE (parm)))
4372 /* Scalar types are variably modified if their end points
4374 t = TYPE_MIN_VALUE (type);
4375 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4377 t = TYPE_MAX_VALUE (type);
4378 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4386 /* The current language may have other cases to check, but in general,
4387 all other types are not variably modified. */
4388 return (*lang_hooks.tree_inlining.var_mod_type_p) (type);
4391 /* Given a DECL or TYPE, return the scope in which it was declared, or
4392 NULL_TREE if there is no containing scope. */
4395 get_containing_scope (tree t)
4397 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4400 /* Return the innermost context enclosing DECL that is
4401 a FUNCTION_DECL, or zero if none. */
4404 decl_function_context (tree decl)
4408 if (TREE_CODE (decl) == ERROR_MARK)
4411 if (TREE_CODE (decl) == SAVE_EXPR)
4412 context = SAVE_EXPR_CONTEXT (decl);
4414 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4415 where we look up the function at runtime. Such functions always take
4416 a first argument of type 'pointer to real context'.
4418 C++ should really be fixed to use DECL_CONTEXT for the real context,
4419 and use something else for the "virtual context". */
4420 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4423 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4425 context = DECL_CONTEXT (decl);
4427 while (context && TREE_CODE (context) != FUNCTION_DECL)
4429 if (TREE_CODE (context) == BLOCK)
4430 context = BLOCK_SUPERCONTEXT (context);
4432 context = get_containing_scope (context);
4438 /* Return the innermost context enclosing DECL that is
4439 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4440 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4443 decl_type_context (tree decl)
4445 tree context = DECL_CONTEXT (decl);
4448 switch (TREE_CODE (context))
4450 case NAMESPACE_DECL:
4451 case TRANSLATION_UNIT_DECL:
4456 case QUAL_UNION_TYPE:
4461 context = DECL_CONTEXT (context);
4465 context = BLOCK_SUPERCONTEXT (context);
4475 /* CALL is a CALL_EXPR. Return the declaration for the function
4476 called, or NULL_TREE if the called function cannot be
4480 get_callee_fndecl (tree call)
4484 /* It's invalid to call this function with anything but a
4486 if (TREE_CODE (call) != CALL_EXPR)
4489 /* The first operand to the CALL is the address of the function
4491 addr = TREE_OPERAND (call, 0);
4495 /* If this is a readonly function pointer, extract its initial value. */
4496 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4497 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4498 && DECL_INITIAL (addr))
4499 addr = DECL_INITIAL (addr);
4501 /* If the address is just `&f' for some function `f', then we know
4502 that `f' is being called. */
4503 if (TREE_CODE (addr) == ADDR_EXPR
4504 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4505 return TREE_OPERAND (addr, 0);
4507 /* We couldn't figure out what was being called. Maybe the front
4508 end has some idea. */
4509 return (*lang_hooks.lang_get_callee_fndecl) (call);
4512 /* Print debugging information about tree nodes generated during the compile,
4513 and any language-specific information. */
4516 dump_tree_statistics (void)
4518 #ifdef GATHER_STATISTICS
4520 int total_nodes, total_bytes;
4523 fprintf (stderr, "\n??? tree nodes created\n\n");
4524 #ifdef GATHER_STATISTICS
4525 fprintf (stderr, "Kind Nodes Bytes\n");
4526 fprintf (stderr, "---------------------------------------\n");
4527 total_nodes = total_bytes = 0;
4528 for (i = 0; i < (int) all_kinds; i++)
4530 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
4531 tree_node_counts[i], tree_node_sizes[i]);
4532 total_nodes += tree_node_counts[i];
4533 total_bytes += tree_node_sizes[i];
4535 fprintf (stderr, "---------------------------------------\n");
4536 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
4537 fprintf (stderr, "---------------------------------------\n");
4539 fprintf (stderr, "(No per-node statistics)\n");
4541 print_type_hash_statistics ();
4542 (*lang_hooks.print_statistics) ();
4545 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4547 /* Generate a crc32 of a string. */
4550 crc32_string (unsigned chksum, const char *string)
4554 unsigned value = *string << 24;
4557 for (ix = 8; ix--; value <<= 1)
4561 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
4570 /* P is a string that will be used in a symbol. Mask out any characters
4571 that are not valid in that context. */
4574 clean_symbol_name (char *p)
4578 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4581 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4588 /* Generate a name for a function unique to this translation unit.
4589 TYPE is some string to identify the purpose of this function to the
4590 linker or collect2. */
4593 get_file_function_name_long (const char *type)
4599 if (first_global_object_name)
4600 p = first_global_object_name;
4603 /* We don't have anything that we know to be unique to this translation
4604 unit, so use what we do have and throw in some randomness. */
4606 const char *name = weak_global_object_name;
4607 const char *file = main_input_filename;
4612 file = input_filename;
4614 len = strlen (file);
4615 q = alloca (9 * 2 + len + 1);
4616 memcpy (q, file, len + 1);
4617 clean_symbol_name (q);
4619 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
4620 crc32_string (0, flag_random_seed));
4625 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
4627 /* Set up the name of the file-level functions we may need.
4628 Use a global object (which is already required to be unique over
4629 the program) rather than the file name (which imposes extra
4631 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4633 return get_identifier (buf);
4636 /* If KIND=='I', return a suitable global initializer (constructor) name.
4637 If KIND=='D', return a suitable global clean-up (destructor) name. */
4640 get_file_function_name (int kind)
4647 return get_file_function_name_long (p);
4650 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4651 The result is placed in BUFFER (which has length BIT_SIZE),
4652 with one bit in each char ('\000' or '\001').
4654 If the constructor is constant, NULL_TREE is returned.
4655 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4658 get_set_constructor_bits (tree init, char *buffer, int bit_size)
4662 HOST_WIDE_INT domain_min
4663 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
4664 tree non_const_bits = NULL_TREE;
4666 for (i = 0; i < bit_size; i++)
4669 for (vals = TREE_OPERAND (init, 1);
4670 vals != NULL_TREE; vals = TREE_CHAIN (vals))
4672 if (!host_integerp (TREE_VALUE (vals), 0)
4673 || (TREE_PURPOSE (vals) != NULL_TREE
4674 && !host_integerp (TREE_PURPOSE (vals), 0)))
4676 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
4677 else if (TREE_PURPOSE (vals) != NULL_TREE)
4679 /* Set a range of bits to ones. */
4680 HOST_WIDE_INT lo_index
4681 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
4682 HOST_WIDE_INT hi_index
4683 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4685 if (lo_index < 0 || lo_index >= bit_size
4686 || hi_index < 0 || hi_index >= bit_size)
4688 for (; lo_index <= hi_index; lo_index++)
4689 buffer[lo_index] = 1;
4693 /* Set a single bit to one. */
4695 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
4696 if (index < 0 || index >= bit_size)
4698 error ("invalid initializer for bit string");
4704 return non_const_bits;
4707 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
4708 The result is placed in BUFFER (which is an array of bytes).
4709 If the constructor is constant, NULL_TREE is returned.
4710 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
4713 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
4716 int set_word_size = BITS_PER_UNIT;
4717 int bit_size = wd_size * set_word_size;
4719 unsigned char *bytep = buffer;
4720 char *bit_buffer = alloca (bit_size);
4721 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
4723 for (i = 0; i < wd_size; i++)
4726 for (i = 0; i < bit_size; i++)
4730 if (BYTES_BIG_ENDIAN)
4731 *bytep |= (1 << (set_word_size - 1 - bit_pos));
4733 *bytep |= 1 << bit_pos;
4736 if (bit_pos >= set_word_size)
4737 bit_pos = 0, bytep++;
4739 return non_const_bits;
4742 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4743 /* Complain that the tree code of NODE does not match the expected CODE.
4744 FILE, LINE, and FUNCTION are of the caller. */
4747 tree_check_failed (const tree node, enum tree_code code, const char *file,
4748 int line, const char *function)
4750 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
4751 tree_code_name[code], tree_code_name[TREE_CODE (node)],
4752 function, trim_filename (file), line);
4755 /* Similar to above, except that we check for a class of tree
4756 code, given in CL. */
4759 tree_class_check_failed (const tree node, int cl, const char *file,
4760 int line, const char *function)
4763 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
4764 cl, TREE_CODE_CLASS (TREE_CODE (node)),
4765 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
4768 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
4769 (dynamically sized) vector. */
4772 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
4773 const char *function)
4776 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
4777 idx + 1, len, function, trim_filename (file), line);
4780 /* Similar to above, except that the check is for the bounds of the operand
4781 vector of an expression node. */
4784 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
4785 int line, const char *function)
4788 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
4789 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
4790 function, trim_filename (file), line);
4792 #endif /* ENABLE_TREE_CHECKING */
4794 /* For a new vector type node T, build the information necessary for
4795 debugging output. */
4798 finish_vector_type (tree t)
4803 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
4804 tree array = build_array_type (TREE_TYPE (t),
4805 build_index_type (index));
4806 tree rt = make_node (RECORD_TYPE);
4808 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
4809 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
4811 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
4812 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
4813 the representation type, and we want to find that die when looking up
4814 the vector type. This is most easily achieved by making the TYPE_UID
4816 TYPE_UID (rt) = TYPE_UID (t);
4820 /* Create nodes for all integer types (and error_mark_node) using the sizes
4821 of C datatypes. The caller should call set_sizetype soon after calling
4822 this function to select one of the types as sizetype. */
4825 build_common_tree_nodes (int signed_char)
4827 error_mark_node = make_node (ERROR_MARK);
4828 TREE_TYPE (error_mark_node) = error_mark_node;
4830 initialize_sizetypes ();
4832 /* Define both `signed char' and `unsigned char'. */
4833 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
4834 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
4836 /* Define `char', which is like either `signed char' or `unsigned char'
4837 but not the same as either. */
4840 ? make_signed_type (CHAR_TYPE_SIZE)
4841 : make_unsigned_type (CHAR_TYPE_SIZE));
4843 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
4844 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
4845 integer_type_node = make_signed_type (INT_TYPE_SIZE);
4846 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
4847 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
4848 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
4849 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
4850 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
4852 /* Define a boolean type. This type only represents boolean values but
4853 may be larger than char depending on the value of BOOL_TYPE_SIZE.
4854 Front ends which want to override this size (i.e. Java) can redefine
4855 boolean_type_node before calling build_common_tree_nodes_2. */
4856 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
4857 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
4858 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
4859 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
4860 TYPE_PRECISION (boolean_type_node) = 1;
4862 intQI_type_node = make_signed_type (GET_MODE_BITSIZE (QImode));
4863 intHI_type_node = make_signed_type (GET_MODE_BITSIZE (HImode));
4864 intSI_type_node = make_signed_type (GET_MODE_BITSIZE (SImode));
4865 intDI_type_node = make_signed_type (GET_MODE_BITSIZE (DImode));
4866 intTI_type_node = make_signed_type (GET_MODE_BITSIZE (TImode));
4868 unsigned_intQI_type_node = make_unsigned_type (GET_MODE_BITSIZE (QImode));
4869 unsigned_intHI_type_node = make_unsigned_type (GET_MODE_BITSIZE (HImode));
4870 unsigned_intSI_type_node = make_unsigned_type (GET_MODE_BITSIZE (SImode));
4871 unsigned_intDI_type_node = make_unsigned_type (GET_MODE_BITSIZE (DImode));
4872 unsigned_intTI_type_node = make_unsigned_type (GET_MODE_BITSIZE (TImode));
4875 /* Call this function after calling build_common_tree_nodes and set_sizetype.
4876 It will create several other common tree nodes. */
4879 build_common_tree_nodes_2 (int short_double)
4881 /* Define these next since types below may used them. */
4882 integer_zero_node = build_int_2 (0, 0);
4883 integer_one_node = build_int_2 (1, 0);
4884 integer_minus_one_node = build_int_2 (-1, -1);
4886 size_zero_node = size_int (0);
4887 size_one_node = size_int (1);
4888 bitsize_zero_node = bitsize_int (0);
4889 bitsize_one_node = bitsize_int (1);
4890 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
4892 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
4893 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
4895 void_type_node = make_node (VOID_TYPE);
4896 layout_type (void_type_node);
4898 /* We are not going to have real types in C with less than byte alignment,
4899 so we might as well not have any types that claim to have it. */
4900 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
4901 TYPE_USER_ALIGN (void_type_node) = 0;
4903 null_pointer_node = build_int_2 (0, 0);
4904 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
4905 layout_type (TREE_TYPE (null_pointer_node));
4907 ptr_type_node = build_pointer_type (void_type_node);
4909 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
4911 float_type_node = make_node (REAL_TYPE);
4912 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
4913 layout_type (float_type_node);
4915 double_type_node = make_node (REAL_TYPE);
4917 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
4919 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
4920 layout_type (double_type_node);
4922 long_double_type_node = make_node (REAL_TYPE);
4923 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
4924 layout_type (long_double_type_node);
4926 float_ptr_type_node = build_pointer_type (float_type_node);
4927 double_ptr_type_node = build_pointer_type (double_type_node);
4928 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
4929 integer_ptr_type_node = build_pointer_type (integer_type_node);
4931 complex_integer_type_node = make_node (COMPLEX_TYPE);
4932 TREE_TYPE (complex_integer_type_node) = integer_type_node;
4933 layout_type (complex_integer_type_node);
4935 complex_float_type_node = make_node (COMPLEX_TYPE);
4936 TREE_TYPE (complex_float_type_node) = float_type_node;
4937 layout_type (complex_float_type_node);
4939 complex_double_type_node = make_node (COMPLEX_TYPE);
4940 TREE_TYPE (complex_double_type_node) = double_type_node;
4941 layout_type (complex_double_type_node);
4943 complex_long_double_type_node = make_node (COMPLEX_TYPE);
4944 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
4945 layout_type (complex_long_double_type_node);
4948 tree t = (*targetm.build_builtin_va_list) ();
4950 /* Many back-ends define record types without setting TYPE_NAME.
4951 If we copied the record type here, we'd keep the original
4952 record type without a name. This breaks name mangling. So,
4953 don't copy record types and let c_common_nodes_and_builtins()
4954 declare the type to be __builtin_va_list. */
4955 if (TREE_CODE (t) != RECORD_TYPE)
4956 t = build_type_copy (t);
4958 va_list_type_node = t;
4961 unsigned_V4SI_type_node
4962 = make_vector (V4SImode, unsigned_intSI_type_node, 1);
4963 unsigned_V2HI_type_node
4964 = make_vector (V2HImode, unsigned_intHI_type_node, 1);
4965 unsigned_V2SI_type_node
4966 = make_vector (V2SImode, unsigned_intSI_type_node, 1);
4967 unsigned_V2DI_type_node
4968 = make_vector (V2DImode, unsigned_intDI_type_node, 1);
4969 unsigned_V4HI_type_node
4970 = make_vector (V4HImode, unsigned_intHI_type_node, 1);
4971 unsigned_V8QI_type_node
4972 = make_vector (V8QImode, unsigned_intQI_type_node, 1);
4973 unsigned_V8HI_type_node
4974 = make_vector (V8HImode, unsigned_intHI_type_node, 1);
4975 unsigned_V16QI_type_node
4976 = make_vector (V16QImode, unsigned_intQI_type_node, 1);
4977 unsigned_V1DI_type_node
4978 = make_vector (V1DImode, unsigned_intDI_type_node, 1);
4980 V16SF_type_node = make_vector (V16SFmode, float_type_node, 0);
4981 V4SF_type_node = make_vector (V4SFmode, float_type_node, 0);
4982 V4SI_type_node = make_vector (V4SImode, intSI_type_node, 0);
4983 V2HI_type_node = make_vector (V2HImode, intHI_type_node, 0);
4984 V2SI_type_node = make_vector (V2SImode, intSI_type_node, 0);
4985 V2DI_type_node = make_vector (V2DImode, intDI_type_node, 0);
4986 V4HI_type_node = make_vector (V4HImode, intHI_type_node, 0);
4987 V8QI_type_node = make_vector (V8QImode, intQI_type_node, 0);
4988 V8HI_type_node = make_vector (V8HImode, intHI_type_node, 0);
4989 V2SF_type_node = make_vector (V2SFmode, float_type_node, 0);
4990 V2DF_type_node = make_vector (V2DFmode, double_type_node, 0);
4991 V16QI_type_node = make_vector (V16QImode, intQI_type_node, 0);
4992 V1DI_type_node = make_vector (V1DImode, intDI_type_node, 0);
4993 V4DF_type_node = make_vector (V4DFmode, double_type_node, 0);
4996 /* Returns a vector tree node given a vector mode, the inner type, and
5000 make_vector (enum machine_mode mode, tree innertype, int unsignedp)
5004 t = make_node (VECTOR_TYPE);
5005 TREE_TYPE (t) = innertype;
5006 TYPE_MODE (t) = mode;
5007 TREE_UNSIGNED (TREE_TYPE (t)) = unsignedp;
5008 finish_vector_type (t);
5013 /* Given an initializer INIT, return TRUE if INIT is zero or some
5014 aggregate of zeros. Otherwise return FALSE. */
5017 initializer_zerop (tree init)
5021 switch (TREE_CODE (init))
5024 return integer_zerop (init);
5026 return real_zerop (init)
5027 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5029 return integer_zerop (init)
5030 || (real_zerop (init)
5031 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5032 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5035 /* Set is empty if it has no elements. */
5036 if ((TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5037 && CONSTRUCTOR_ELTS (init))
5040 if (AGGREGATE_TYPE_P (TREE_TYPE (init)))
5042 tree aggr_init = CONSTRUCTOR_ELTS (init);
5046 if (! initializer_zerop (TREE_VALUE (aggr_init)))
5048 aggr_init = TREE_CHAIN (aggr_init);
5059 #include "gt-tree.h"