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"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 /* obstack.[ch] explicitly declined to prototype this. */
53 extern int _obstack_allocated_p (struct obstack *h, void *obj);
55 #ifdef GATHER_STATISTICS
56 /* Statistics-gathering stuff. */
58 int tree_node_counts[(int) all_kinds];
59 int tree_node_sizes[(int) all_kinds];
61 /* Keep in sync with tree.h:enum tree_node_kind. */
62 static const char * const tree_node_kind_names[] = {
80 #endif /* GATHER_STATISTICS */
82 /* Unique id for next decl created. */
83 static GTY(()) int next_decl_uid;
84 /* Unique id for next type created. */
85 static GTY(()) int next_type_uid = 1;
87 /* Since we cannot rehash a type after it is in the table, we have to
88 keep the hash code. */
90 struct type_hash GTY(())
96 /* Initial size of the hash table (rounded to next prime). */
97 #define TYPE_HASH_INITIAL_SIZE 1000
99 /* Now here is the hash table. When recording a type, it is added to
100 the slot whose index is the hash code. Note that the hash table is
101 used for several kinds of types (function types, array types and
102 array index range types, for now). While all these live in the
103 same table, they are completely independent, and the hash code is
104 computed differently for each of these. */
106 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
107 htab_t type_hash_table;
109 static void set_type_quals (tree, int);
110 static int type_hash_eq (const void *, const void *);
111 static hashval_t type_hash_hash (const void *);
112 static void print_type_hash_statistics (void);
113 static void finish_vector_type (tree);
114 static int type_hash_marked_p (const void *);
115 static unsigned int type_hash_list (tree, hashval_t);
116 static unsigned int attribute_hash_list (tree, hashval_t);
118 tree global_trees[TI_MAX];
119 tree integer_types[itk_none];
126 /* Initialize the hash table of types. */
127 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
132 /* The name of the object as the assembler will see it (but before any
133 translations made by ASM_OUTPUT_LABELREF). Often this is the same
134 as DECL_NAME. It is an IDENTIFIER_NODE. */
136 decl_assembler_name (tree decl)
138 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
139 lang_hooks.set_decl_assembler_name (decl);
140 return DECL_CHECK (decl)->decl.assembler_name;
143 /* Compute the number of bytes occupied by 'node'. This routine only
144 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
146 tree_size (tree node)
148 enum tree_code code = TREE_CODE (node);
150 switch (TREE_CODE_CLASS (code))
152 case 'd': /* A decl node */
153 return sizeof (struct tree_decl);
155 case 't': /* a type node */
156 return sizeof (struct tree_type);
158 case 'r': /* a reference */
159 case 'e': /* an expression */
160 case 's': /* an expression with side effects */
161 case '<': /* a comparison expression */
162 case '1': /* a unary arithmetic expression */
163 case '2': /* a binary arithmetic expression */
164 return (sizeof (struct tree_exp)
165 + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
167 case 'c': /* a constant */
170 case INTEGER_CST: return sizeof (struct tree_int_cst);
171 case REAL_CST: return sizeof (struct tree_real_cst);
172 case COMPLEX_CST: return sizeof (struct tree_complex);
173 case VECTOR_CST: return sizeof (struct tree_vector);
174 case STRING_CST: return sizeof (struct tree_string);
176 return lang_hooks.tree_size (code);
179 case 'x': /* something random, like an identifier. */
182 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
183 case TREE_LIST: return sizeof (struct tree_list);
184 case TREE_VEC: return (sizeof (struct tree_vec)
185 + TREE_VEC_LENGTH(node) * sizeof(char *)
189 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
191 case PHI_NODE: return (sizeof (struct tree_phi_node)
192 + (PHI_ARG_CAPACITY (node) - 1) *
193 sizeof (struct phi_arg_d));
195 case SSA_NAME: return sizeof (struct tree_ssa_name);
197 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
198 case BLOCK: return sizeof (struct tree_block);
199 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
202 return lang_hooks.tree_size (code);
210 /* Return a newly allocated node of code CODE.
211 For decl and type nodes, some other fields are initialized.
212 The rest of the node is initialized to zero.
214 Achoo! I got a code in the node. */
217 make_node_stat (enum tree_code code MEM_STAT_DECL)
220 int type = TREE_CODE_CLASS (code);
222 #ifdef GATHER_STATISTICS
225 struct tree_common ttmp;
227 /* We can't allocate a TREE_VEC, PHI_NODE, or STRING_CST
228 without knowing how many elements it will have. */
229 if (code == TREE_VEC || code == PHI_NODE)
232 TREE_SET_CODE ((tree)&ttmp, code);
233 length = tree_size ((tree)&ttmp);
235 #ifdef GATHER_STATISTICS
238 case 'd': /* A decl node */
242 case 't': /* a type node */
246 case 's': /* an expression with side effects */
250 case 'r': /* a reference */
254 case 'e': /* an expression */
255 case '<': /* a comparison expression */
256 case '1': /* a unary arithmetic expression */
257 case '2': /* a binary arithmetic expression */
261 case 'c': /* a constant */
265 case 'x': /* something random, like an identifier. */
266 if (code == IDENTIFIER_NODE)
268 else if (code == TREE_VEC)
270 else if (code == PHI_NODE)
272 else if (code == SSA_NAME)
273 kind = ssa_name_kind;
274 else if (code == BLOCK)
284 tree_node_counts[(int) kind]++;
285 tree_node_sizes[(int) kind] += length;
288 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
290 memset (t, 0, length);
292 TREE_SET_CODE (t, code);
297 TREE_SIDE_EFFECTS (t) = 1;
301 if (code != FUNCTION_DECL)
303 DECL_USER_ALIGN (t) = 0;
304 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
305 DECL_SOURCE_LOCATION (t) = input_location;
306 DECL_UID (t) = next_decl_uid++;
308 /* We have not yet computed the alias set for this declaration. */
309 DECL_POINTER_ALIAS_SET (t) = -1;
313 TYPE_UID (t) = next_type_uid++;
314 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
315 TYPE_USER_ALIGN (t) = 0;
316 TYPE_MAIN_VARIANT (t) = t;
318 /* Default to no attributes for type, but let target change that. */
319 TYPE_ATTRIBUTES (t) = NULL_TREE;
320 targetm.set_default_type_attributes (t);
322 /* We have not yet computed the alias set for this type. */
323 TYPE_ALIAS_SET (t) = -1;
327 TREE_CONSTANT (t) = 1;
328 TREE_INVARIANT (t) = 1;
338 case PREDECREMENT_EXPR:
339 case PREINCREMENT_EXPR:
340 case POSTDECREMENT_EXPR:
341 case POSTINCREMENT_EXPR:
342 /* All of these have side-effects, no matter what their
344 TREE_SIDE_EFFECTS (t) = 1;
356 /* Return a new node with the same contents as NODE except that its
357 TREE_CHAIN is zero and it has a fresh uid. */
360 copy_node_stat (tree node MEM_STAT_DECL)
363 enum tree_code code = TREE_CODE (node);
366 #ifdef ENABLE_CHECKING
367 if (code == STATEMENT_LIST)
371 length = tree_size (node);
372 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
373 memcpy (t, node, length);
376 TREE_ASM_WRITTEN (t) = 0;
377 TREE_VISITED (t) = 0;
380 if (TREE_CODE_CLASS (code) == 'd')
381 DECL_UID (t) = next_decl_uid++;
382 else if (TREE_CODE_CLASS (code) == 't')
384 TYPE_UID (t) = next_type_uid++;
385 /* The following is so that the debug code for
386 the copy is different from the original type.
387 The two statements usually duplicate each other
388 (because they clear fields of the same union),
389 but the optimizer should catch that. */
390 TYPE_SYMTAB_POINTER (t) = 0;
391 TYPE_SYMTAB_ADDRESS (t) = 0;
397 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
398 For example, this can copy a list made of TREE_LIST nodes. */
401 copy_list (tree list)
409 head = prev = copy_node (list);
410 next = TREE_CHAIN (list);
413 TREE_CHAIN (prev) = copy_node (next);
414 prev = TREE_CHAIN (prev);
415 next = TREE_CHAIN (next);
421 /* Return a newly constructed INTEGER_CST node whose constant value
422 is specified by the two ints LOW and HI.
423 The TREE_TYPE is set to `int'.
425 This function should be used via the `build_int_2' macro. */
428 build_int_2_wide (unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
430 tree t = make_node (INTEGER_CST);
432 TREE_INT_CST_LOW (t) = low;
433 TREE_INT_CST_HIGH (t) = hi;
434 TREE_TYPE (t) = integer_type_node;
438 /* Return a new VECTOR_CST node whose type is TYPE and whose values
439 are in a list pointed by VALS. */
442 build_vector (tree type, tree vals)
444 tree v = make_node (VECTOR_CST);
445 int over1 = 0, over2 = 0;
448 TREE_VECTOR_CST_ELTS (v) = vals;
449 TREE_TYPE (v) = type;
451 /* Iterate through elements and check for overflow. */
452 for (link = vals; link; link = TREE_CHAIN (link))
454 tree value = TREE_VALUE (link);
456 over1 |= TREE_OVERFLOW (value);
457 over2 |= TREE_CONSTANT_OVERFLOW (value);
460 TREE_OVERFLOW (v) = over1;
461 TREE_CONSTANT_OVERFLOW (v) = over2;
466 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
467 are in a list pointed to by VALS. */
469 build_constructor (tree type, tree vals)
471 tree c = make_node (CONSTRUCTOR);
472 TREE_TYPE (c) = type;
473 CONSTRUCTOR_ELTS (c) = vals;
475 /* ??? May not be necessary. Mirrors what build does. */
478 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
479 TREE_READONLY (c) = TREE_READONLY (vals);
480 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
481 TREE_INVARIANT (c) = TREE_INVARIANT (vals);
487 /* Return a new REAL_CST node whose type is TYPE and value is D. */
490 build_real (tree type, REAL_VALUE_TYPE d)
496 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
497 Consider doing it via real_convert now. */
499 v = make_node (REAL_CST);
500 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
501 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
503 TREE_TYPE (v) = type;
504 TREE_REAL_CST_PTR (v) = dp;
505 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
509 /* Return a new REAL_CST node whose type is TYPE
510 and whose value is the integer value of the INTEGER_CST node I. */
513 real_value_from_int_cst (tree type, tree i)
517 /* Clear all bits of the real value type so that we can later do
518 bitwise comparisons to see if two values are the same. */
519 memset (&d, 0, sizeof d);
521 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
522 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
523 TYPE_UNSIGNED (TREE_TYPE (i)));
527 /* Given a tree representing an integer constant I, return a tree
528 representing the same value as a floating-point constant of type TYPE. */
531 build_real_from_int_cst (tree type, tree i)
534 int overflow = TREE_OVERFLOW (i);
536 v = build_real (type, real_value_from_int_cst (type, i));
538 TREE_OVERFLOW (v) |= overflow;
539 TREE_CONSTANT_OVERFLOW (v) |= overflow;
543 /* Return a newly constructed STRING_CST node whose value is
544 the LEN characters at STR.
545 The TREE_TYPE is not initialized. */
548 build_string (int len, const char *str)
550 tree s = make_node (STRING_CST);
552 TREE_STRING_LENGTH (s) = len;
553 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
558 /* Return a newly constructed COMPLEX_CST node whose value is
559 specified by the real and imaginary parts REAL and IMAG.
560 Both REAL and IMAG should be constant nodes. TYPE, if specified,
561 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
564 build_complex (tree type, tree real, tree imag)
566 tree t = make_node (COMPLEX_CST);
568 TREE_REALPART (t) = real;
569 TREE_IMAGPART (t) = imag;
570 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
571 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
572 TREE_CONSTANT_OVERFLOW (t)
573 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
577 /* Build a newly constructed TREE_VEC node of length LEN. */
580 make_tree_vec_stat (int len MEM_STAT_DECL)
583 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
585 #ifdef GATHER_STATISTICS
586 tree_node_counts[(int) vec_kind]++;
587 tree_node_sizes[(int) vec_kind] += length;
590 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
592 memset (t, 0, length);
594 TREE_SET_CODE (t, TREE_VEC);
595 TREE_VEC_LENGTH (t) = len;
600 /* Return 1 if EXPR is the integer constant zero or a complex constant
604 integer_zerop (tree expr)
608 return ((TREE_CODE (expr) == INTEGER_CST
609 && ! TREE_CONSTANT_OVERFLOW (expr)
610 && TREE_INT_CST_LOW (expr) == 0
611 && TREE_INT_CST_HIGH (expr) == 0)
612 || (TREE_CODE (expr) == COMPLEX_CST
613 && integer_zerop (TREE_REALPART (expr))
614 && integer_zerop (TREE_IMAGPART (expr))));
617 /* Return 1 if EXPR is the integer constant one or the corresponding
621 integer_onep (tree expr)
625 return ((TREE_CODE (expr) == INTEGER_CST
626 && ! TREE_CONSTANT_OVERFLOW (expr)
627 && TREE_INT_CST_LOW (expr) == 1
628 && TREE_INT_CST_HIGH (expr) == 0)
629 || (TREE_CODE (expr) == COMPLEX_CST
630 && integer_onep (TREE_REALPART (expr))
631 && integer_zerop (TREE_IMAGPART (expr))));
634 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
635 it contains. Likewise for the corresponding complex constant. */
638 integer_all_onesp (tree expr)
645 if (TREE_CODE (expr) == COMPLEX_CST
646 && integer_all_onesp (TREE_REALPART (expr))
647 && integer_zerop (TREE_IMAGPART (expr)))
650 else if (TREE_CODE (expr) != INTEGER_CST
651 || TREE_CONSTANT_OVERFLOW (expr))
654 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
656 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
657 && TREE_INT_CST_HIGH (expr) == -1);
659 /* Note that using TYPE_PRECISION here is wrong. We care about the
660 actual bits, not the (arbitrary) range of the type. */
661 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
662 if (prec >= HOST_BITS_PER_WIDE_INT)
664 HOST_WIDE_INT high_value;
667 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
669 if (shift_amount > HOST_BITS_PER_WIDE_INT)
670 /* Can not handle precisions greater than twice the host int size. */
672 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
673 /* Shifting by the host word size is undefined according to the ANSI
674 standard, so we must handle this as a special case. */
677 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
679 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
680 && TREE_INT_CST_HIGH (expr) == high_value);
683 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
686 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
690 integer_pow2p (tree expr)
693 HOST_WIDE_INT high, low;
697 if (TREE_CODE (expr) == COMPLEX_CST
698 && integer_pow2p (TREE_REALPART (expr))
699 && integer_zerop (TREE_IMAGPART (expr)))
702 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
705 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
706 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
707 high = TREE_INT_CST_HIGH (expr);
708 low = TREE_INT_CST_LOW (expr);
710 /* First clear all bits that are beyond the type's precision in case
711 we've been sign extended. */
713 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
715 else if (prec > HOST_BITS_PER_WIDE_INT)
716 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
720 if (prec < HOST_BITS_PER_WIDE_INT)
721 low &= ~((HOST_WIDE_INT) (-1) << prec);
724 if (high == 0 && low == 0)
727 return ((high == 0 && (low & (low - 1)) == 0)
728 || (low == 0 && (high & (high - 1)) == 0));
731 /* Return 1 if EXPR is an integer constant other than zero or a
732 complex constant other than zero. */
735 integer_nonzerop (tree expr)
739 return ((TREE_CODE (expr) == INTEGER_CST
740 && ! TREE_CONSTANT_OVERFLOW (expr)
741 && (TREE_INT_CST_LOW (expr) != 0
742 || TREE_INT_CST_HIGH (expr) != 0))
743 || (TREE_CODE (expr) == COMPLEX_CST
744 && (integer_nonzerop (TREE_REALPART (expr))
745 || integer_nonzerop (TREE_IMAGPART (expr)))));
748 /* Return the power of two represented by a tree node known to be a
752 tree_log2 (tree expr)
755 HOST_WIDE_INT high, low;
759 if (TREE_CODE (expr) == COMPLEX_CST)
760 return tree_log2 (TREE_REALPART (expr));
762 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
763 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
765 high = TREE_INT_CST_HIGH (expr);
766 low = TREE_INT_CST_LOW (expr);
768 /* First clear all bits that are beyond the type's precision in case
769 we've been sign extended. */
771 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
773 else if (prec > HOST_BITS_PER_WIDE_INT)
774 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
778 if (prec < HOST_BITS_PER_WIDE_INT)
779 low &= ~((HOST_WIDE_INT) (-1) << prec);
782 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
786 /* Similar, but return the largest integer Y such that 2 ** Y is less
787 than or equal to EXPR. */
790 tree_floor_log2 (tree expr)
793 HOST_WIDE_INT high, low;
797 if (TREE_CODE (expr) == COMPLEX_CST)
798 return tree_log2 (TREE_REALPART (expr));
800 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
801 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
803 high = TREE_INT_CST_HIGH (expr);
804 low = TREE_INT_CST_LOW (expr);
806 /* First clear all bits that are beyond the type's precision in case
807 we've been sign extended. Ignore if type's precision hasn't been set
808 since what we are doing is setting it. */
810 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
812 else if (prec > HOST_BITS_PER_WIDE_INT)
813 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
817 if (prec < HOST_BITS_PER_WIDE_INT)
818 low &= ~((HOST_WIDE_INT) (-1) << prec);
821 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
825 /* Return 1 if EXPR is the real constant zero. */
828 real_zerop (tree expr)
832 return ((TREE_CODE (expr) == REAL_CST
833 && ! TREE_CONSTANT_OVERFLOW (expr)
834 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
835 || (TREE_CODE (expr) == COMPLEX_CST
836 && real_zerop (TREE_REALPART (expr))
837 && real_zerop (TREE_IMAGPART (expr))));
840 /* Return 1 if EXPR is the real constant one in real or complex form. */
843 real_onep (tree expr)
847 return ((TREE_CODE (expr) == REAL_CST
848 && ! TREE_CONSTANT_OVERFLOW (expr)
849 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
850 || (TREE_CODE (expr) == COMPLEX_CST
851 && real_onep (TREE_REALPART (expr))
852 && real_zerop (TREE_IMAGPART (expr))));
855 /* Return 1 if EXPR is the real constant two. */
858 real_twop (tree expr)
862 return ((TREE_CODE (expr) == REAL_CST
863 && ! TREE_CONSTANT_OVERFLOW (expr)
864 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
865 || (TREE_CODE (expr) == COMPLEX_CST
866 && real_twop (TREE_REALPART (expr))
867 && real_zerop (TREE_IMAGPART (expr))));
870 /* Return 1 if EXPR is the real constant minus one. */
873 real_minus_onep (tree expr)
877 return ((TREE_CODE (expr) == REAL_CST
878 && ! TREE_CONSTANT_OVERFLOW (expr)
879 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
880 || (TREE_CODE (expr) == COMPLEX_CST
881 && real_minus_onep (TREE_REALPART (expr))
882 && real_zerop (TREE_IMAGPART (expr))));
885 /* Nonzero if EXP is a constant or a cast of a constant. */
888 really_constant_p (tree exp)
890 /* This is not quite the same as STRIP_NOPS. It does more. */
891 while (TREE_CODE (exp) == NOP_EXPR
892 || TREE_CODE (exp) == CONVERT_EXPR
893 || TREE_CODE (exp) == NON_LVALUE_EXPR)
894 exp = TREE_OPERAND (exp, 0);
895 return TREE_CONSTANT (exp);
898 /* Return first list element whose TREE_VALUE is ELEM.
899 Return 0 if ELEM is not in LIST. */
902 value_member (tree elem, tree list)
906 if (elem == TREE_VALUE (list))
908 list = TREE_CHAIN (list);
913 /* Return first list element whose TREE_PURPOSE is ELEM.
914 Return 0 if ELEM is not in LIST. */
917 purpose_member (tree elem, tree list)
921 if (elem == TREE_PURPOSE (list))
923 list = TREE_CHAIN (list);
928 /* Return first list element whose BINFO_TYPE is ELEM.
929 Return 0 if ELEM is not in LIST. */
932 binfo_member (tree elem, tree list)
936 if (elem == BINFO_TYPE (list))
938 list = TREE_CHAIN (list);
943 /* Return nonzero if ELEM is part of the chain CHAIN. */
946 chain_member (tree elem, tree chain)
952 chain = TREE_CHAIN (chain);
958 /* Return the length of a chain of nodes chained through TREE_CHAIN.
959 We expect a null pointer to mark the end of the chain.
960 This is the Lisp primitive `length'. */
966 #ifdef ENABLE_TREE_CHECKING
974 #ifdef ENABLE_TREE_CHECKING
986 /* Returns the number of FIELD_DECLs in TYPE. */
989 fields_length (tree type)
991 tree t = TYPE_FIELDS (type);
994 for (; t; t = TREE_CHAIN (t))
995 if (TREE_CODE (t) == FIELD_DECL)
1001 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1002 by modifying the last node in chain 1 to point to chain 2.
1003 This is the Lisp primitive `nconc'. */
1006 chainon (tree op1, tree op2)
1015 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1017 TREE_CHAIN (t1) = op2;
1019 #ifdef ENABLE_TREE_CHECKING
1022 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1024 abort (); /* Circularity created. */
1031 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1034 tree_last (tree chain)
1038 while ((next = TREE_CHAIN (chain)))
1043 /* Reverse the order of elements in the chain T,
1044 and return the new head of the chain (old last element). */
1049 tree prev = 0, decl, next;
1050 for (decl = t; decl; decl = next)
1052 next = TREE_CHAIN (decl);
1053 TREE_CHAIN (decl) = prev;
1059 /* Return a newly created TREE_LIST node whose
1060 purpose and value fields are PARM and VALUE. */
1063 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1065 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1066 TREE_PURPOSE (t) = parm;
1067 TREE_VALUE (t) = value;
1071 /* Return a newly created TREE_LIST node whose
1072 purpose and value fields are PURPOSE and VALUE
1073 and whose TREE_CHAIN is CHAIN. */
1076 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1080 node = ggc_alloc_zone_stat (sizeof (struct tree_list),
1081 tree_zone PASS_MEM_STAT);
1083 memset (node, 0, sizeof (struct tree_common));
1085 #ifdef GATHER_STATISTICS
1086 tree_node_counts[(int) x_kind]++;
1087 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1090 TREE_SET_CODE (node, TREE_LIST);
1091 TREE_CHAIN (node) = chain;
1092 TREE_PURPOSE (node) = purpose;
1093 TREE_VALUE (node) = value;
1098 /* Return the size nominally occupied by an object of type TYPE
1099 when it resides in memory. The value is measured in units of bytes,
1100 and its data type is that normally used for type sizes
1101 (which is the first type created by make_signed_type or
1102 make_unsigned_type). */
1105 size_in_bytes (tree type)
1109 if (type == error_mark_node)
1110 return integer_zero_node;
1112 type = TYPE_MAIN_VARIANT (type);
1113 t = TYPE_SIZE_UNIT (type);
1117 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1118 return size_zero_node;
1121 if (TREE_CODE (t) == INTEGER_CST)
1122 force_fit_type (t, 0);
1127 /* Return the size of TYPE (in bytes) as a wide integer
1128 or return -1 if the size can vary or is larger than an integer. */
1131 int_size_in_bytes (tree type)
1135 if (type == error_mark_node)
1138 type = TYPE_MAIN_VARIANT (type);
1139 t = TYPE_SIZE_UNIT (type);
1141 || TREE_CODE (t) != INTEGER_CST
1142 || TREE_OVERFLOW (t)
1143 || TREE_INT_CST_HIGH (t) != 0
1144 /* If the result would appear negative, it's too big to represent. */
1145 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1148 return TREE_INT_CST_LOW (t);
1151 /* Return the bit position of FIELD, in bits from the start of the record.
1152 This is a tree of type bitsizetype. */
1155 bit_position (tree field)
1157 return bit_from_pos (DECL_FIELD_OFFSET (field),
1158 DECL_FIELD_BIT_OFFSET (field));
1161 /* Likewise, but return as an integer. Abort if it cannot be represented
1162 in that way (since it could be a signed value, we don't have the option
1163 of returning -1 like int_size_in_byte can. */
1166 int_bit_position (tree field)
1168 return tree_low_cst (bit_position (field), 0);
1171 /* Return the byte position of FIELD, in bytes from the start of the record.
1172 This is a tree of type sizetype. */
1175 byte_position (tree field)
1177 return byte_from_pos (DECL_FIELD_OFFSET (field),
1178 DECL_FIELD_BIT_OFFSET (field));
1181 /* Likewise, but return as an integer. Abort if it cannot be represented
1182 in that way (since it could be a signed value, we don't have the option
1183 of returning -1 like int_size_in_byte can. */
1186 int_byte_position (tree field)
1188 return tree_low_cst (byte_position (field), 0);
1191 /* Return the strictest alignment, in bits, that T is known to have. */
1196 unsigned int align0, align1;
1198 switch (TREE_CODE (t))
1200 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1201 /* If we have conversions, we know that the alignment of the
1202 object must meet each of the alignments of the types. */
1203 align0 = expr_align (TREE_OPERAND (t, 0));
1204 align1 = TYPE_ALIGN (TREE_TYPE (t));
1205 return MAX (align0, align1);
1207 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1208 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1209 case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1210 /* These don't change the alignment of an object. */
1211 return expr_align (TREE_OPERAND (t, 0));
1214 /* The best we can do is say that the alignment is the least aligned
1216 align0 = expr_align (TREE_OPERAND (t, 1));
1217 align1 = expr_align (TREE_OPERAND (t, 2));
1218 return MIN (align0, align1);
1220 case LABEL_DECL: case CONST_DECL:
1221 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1222 if (DECL_ALIGN (t) != 0)
1223 return DECL_ALIGN (t);
1227 return FUNCTION_BOUNDARY;
1233 /* Otherwise take the alignment from that of the type. */
1234 return TYPE_ALIGN (TREE_TYPE (t));
1237 /* Return, as a tree node, the number of elements for TYPE (which is an
1238 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1241 array_type_nelts (tree type)
1243 tree index_type, min, max;
1245 /* If they did it with unspecified bounds, then we should have already
1246 given an error about it before we got here. */
1247 if (! TYPE_DOMAIN (type))
1248 return error_mark_node;
1250 index_type = TYPE_DOMAIN (type);
1251 min = TYPE_MIN_VALUE (index_type);
1252 max = TYPE_MAX_VALUE (index_type);
1254 return (integer_zerop (min)
1256 : fold (build2 (MINUS_EXPR, TREE_TYPE (max), max, min)));
1259 /* Return nonzero if arg is static -- a reference to an object in
1260 static storage. This is not the same as the C meaning of `static'. */
1265 switch (TREE_CODE (arg))
1268 /* Nested functions aren't static, since taking their address
1269 involves a trampoline. */
1270 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1271 && ! DECL_NON_ADDR_CONST_P (arg));
1274 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1275 && ! DECL_THREAD_LOCAL (arg)
1276 && ! DECL_NON_ADDR_CONST_P (arg));
1279 return TREE_STATIC (arg);
1286 /* If the thing being referenced is not a field, then it is
1287 something language specific. */
1288 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1289 return (*lang_hooks.staticp) (arg);
1291 /* If we are referencing a bitfield, we can't evaluate an
1292 ADDR_EXPR at compile time and so it isn't a constant. */
1293 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1296 return staticp (TREE_OPERAND (arg, 0));
1302 /* This case is technically correct, but results in setting
1303 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1306 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1310 case ARRAY_RANGE_REF:
1311 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1312 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1313 return staticp (TREE_OPERAND (arg, 0));
1318 if ((unsigned int) TREE_CODE (arg)
1319 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1320 return lang_hooks.staticp (arg);
1326 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1327 Do this to any expression which may be used in more than one place,
1328 but must be evaluated only once.
1330 Normally, expand_expr would reevaluate the expression each time.
1331 Calling save_expr produces something that is evaluated and recorded
1332 the first time expand_expr is called on it. Subsequent calls to
1333 expand_expr just reuse the recorded value.
1335 The call to expand_expr that generates code that actually computes
1336 the value is the first call *at compile time*. Subsequent calls
1337 *at compile time* generate code to use the saved value.
1338 This produces correct result provided that *at run time* control
1339 always flows through the insns made by the first expand_expr
1340 before reaching the other places where the save_expr was evaluated.
1341 You, the caller of save_expr, must make sure this is so.
1343 Constants, and certain read-only nodes, are returned with no
1344 SAVE_EXPR because that is safe. Expressions containing placeholders
1345 are not touched; see tree.def for an explanation of what these
1349 save_expr (tree expr)
1351 tree t = fold (expr);
1354 /* If the tree evaluates to a constant, then we don't want to hide that
1355 fact (i.e. this allows further folding, and direct checks for constants).
1356 However, a read-only object that has side effects cannot be bypassed.
1357 Since it is no problem to reevaluate literals, we just return the
1359 inner = skip_simple_arithmetic (t);
1361 if (TREE_INVARIANT (inner)
1362 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1363 || TREE_CODE (inner) == SAVE_EXPR
1364 || TREE_CODE (inner) == ERROR_MARK)
1367 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1368 it means that the size or offset of some field of an object depends on
1369 the value within another field.
1371 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1372 and some variable since it would then need to be both evaluated once and
1373 evaluated more than once. Front-ends must assure this case cannot
1374 happen by surrounding any such subexpressions in their own SAVE_EXPR
1375 and forcing evaluation at the proper time. */
1376 if (contains_placeholder_p (inner))
1379 t = build3 (SAVE_EXPR, TREE_TYPE (expr), t, current_function_decl,
1382 /* This expression might be placed ahead of a jump to ensure that the
1383 value was computed on both sides of the jump. So make sure it isn't
1384 eliminated as dead. */
1385 TREE_SIDE_EFFECTS (t) = 1;
1386 TREE_READONLY (t) = 1;
1387 TREE_INVARIANT (t) = 1;
1391 /* Look inside EXPR and into any simple arithmetic operations. Return
1392 the innermost non-arithmetic node. */
1395 skip_simple_arithmetic (tree expr)
1399 /* We don't care about whether this can be used as an lvalue in this
1401 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1402 expr = TREE_OPERAND (expr, 0);
1404 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1405 a constant, it will be more efficient to not make another SAVE_EXPR since
1406 it will allow better simplification and GCSE will be able to merge the
1407 computations if they actually occur. */
1411 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1412 inner = TREE_OPERAND (inner, 0);
1413 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1415 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1416 inner = TREE_OPERAND (inner, 0);
1417 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1418 inner = TREE_OPERAND (inner, 1);
1429 /* Arrange for an expression to be expanded multiple independent
1430 times. This is useful for cleanup actions, as the backend can
1431 expand them multiple times in different places. */
1434 unsave_expr (tree expr)
1438 /* If this is already protected, no sense in protecting it again. */
1439 if (TREE_CODE (expr) == UNSAVE_EXPR)
1442 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1443 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1447 /* Returns the index of the first non-tree operand for CODE, or the number
1448 of operands if all are trees. */
1451 first_rtl_op (enum tree_code code)
1457 case GOTO_SUBROUTINE_EXPR:
1460 case WITH_CLEANUP_EXPR:
1463 return TREE_CODE_LENGTH (code);
1467 /* Return which tree structure is used by T. */
1469 enum tree_node_structure_enum
1470 tree_node_structure (tree t)
1472 enum tree_code code = TREE_CODE (t);
1474 switch (TREE_CODE_CLASS (code))
1476 case 'd': return TS_DECL;
1477 case 't': return TS_TYPE;
1478 case 'r': case '<': case '1': case '2': case 'e': case 's':
1480 default: /* 'c' and 'x' */
1486 case INTEGER_CST: return TS_INT_CST;
1487 case REAL_CST: return TS_REAL_CST;
1488 case COMPLEX_CST: return TS_COMPLEX;
1489 case VECTOR_CST: return TS_VECTOR;
1490 case STRING_CST: return TS_STRING;
1492 case ERROR_MARK: return TS_COMMON;
1493 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1494 case TREE_LIST: return TS_LIST;
1495 case TREE_VEC: return TS_VEC;
1496 case PHI_NODE: return TS_PHI_NODE;
1497 case SSA_NAME: return TS_SSA_NAME;
1498 case PLACEHOLDER_EXPR: return TS_COMMON;
1499 case STATEMENT_LIST: return TS_STATEMENT_LIST;
1500 case BLOCK: return TS_BLOCK;
1501 case VALUE_HANDLE: return TS_VALUE_HANDLE;
1508 /* Perform any modifications to EXPR required when it is unsaved. Does
1509 not recurse into EXPR's subtrees. */
1512 unsave_expr_1 (tree expr)
1514 switch (TREE_CODE (expr))
1517 if (! SAVE_EXPR_PERSISTENT_P (expr))
1518 SAVE_EXPR_RTL (expr) = 0;
1522 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1523 It's OK for this to happen if it was part of a subtree that
1524 isn't immediately expanded, such as operand 2 of another
1526 if (TREE_OPERAND (expr, 1))
1529 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1530 TREE_OPERAND (expr, 3) = NULL_TREE;
1534 /* I don't yet know how to emit a sequence multiple times. */
1535 if (RTL_EXPR_SEQUENCE (expr) != 0)
1544 /* Return 0 if it is safe to evaluate EXPR multiple times,
1545 return 1 if it is safe if EXPR is unsaved afterward, or
1546 return 2 if it is completely unsafe.
1548 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1549 an expression tree, so that it safe to unsave them and the surrounding
1550 context will be correct.
1552 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1553 occasionally across the whole of a function. It is therefore only
1554 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1555 below the UNSAVE_EXPR.
1557 RTL_EXPRs consume their rtl during evaluation. It is therefore
1558 never possible to unsave them. */
1561 unsafe_for_reeval (tree expr)
1564 enum tree_code code;
1569 if (expr == NULL_TREE)
1572 code = TREE_CODE (expr);
1573 first_rtl = first_rtl_op (code);
1581 /* A label can only be emitted once. */
1590 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1592 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1593 unsafeness = MAX (tmp, unsafeness);
1599 tmp2 = unsafe_for_reeval (TREE_OPERAND (expr, 0));
1600 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1601 return MAX (MAX (tmp, 1), tmp2);
1607 case EXIT_BLOCK_EXPR:
1608 /* EXIT_BLOCK_LABELED_BLOCK, a.k.a. TREE_OPERAND (expr, 0), holds
1609 a reference to an ancestor LABELED_BLOCK, so we need to avoid
1610 unbounded recursion in the 'e' traversal code below. */
1611 exp = EXIT_BLOCK_RETURN (expr);
1612 return exp ? unsafe_for_reeval (exp) : 0;
1615 tmp = lang_hooks.unsafe_for_reeval (expr);
1621 switch (TREE_CODE_CLASS (code))
1623 case 'c': /* a constant */
1624 case 't': /* a type node */
1625 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1626 case 'd': /* A decl node */
1629 case 'e': /* an expression */
1630 case 'r': /* a reference */
1631 case 's': /* an expression with side effects */
1632 case '<': /* a comparison expression */
1633 case '2': /* a binary arithmetic expression */
1634 case '1': /* a unary arithmetic expression */
1635 for (i = first_rtl - 1; i >= 0; i--)
1637 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1638 unsafeness = MAX (tmp, unsafeness);
1648 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1649 or offset that depends on a field within a record. */
1652 contains_placeholder_p (tree exp)
1654 enum tree_code code;
1660 code = TREE_CODE (exp);
1661 if (code == PLACEHOLDER_EXPR)
1664 switch (TREE_CODE_CLASS (code))
1667 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1668 position computations since they will be converted into a
1669 WITH_RECORD_EXPR involving the reference, which will assume
1670 here will be valid. */
1671 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1674 if (code == TREE_LIST)
1675 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1676 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1685 /* Ignoring the first operand isn't quite right, but works best. */
1686 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1689 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1690 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1691 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1694 /* If we already know this doesn't have a placeholder, don't
1696 if (SAVE_EXPR_NOPLACEHOLDER (exp) || SAVE_EXPR_RTL (exp) != 0)
1699 SAVE_EXPR_NOPLACEHOLDER (exp) = 1;
1700 result = CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1702 SAVE_EXPR_NOPLACEHOLDER (exp) = 0;
1710 switch (first_rtl_op (code))
1713 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1715 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1716 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1727 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1728 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1732 type_contains_placeholder_p (tree type)
1734 /* If the size contains a placeholder or the parent type (component type in
1735 the case of arrays) type involves a placeholder, this type does. */
1736 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1737 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1738 || (TREE_TYPE (type) != 0
1739 && type_contains_placeholder_p (TREE_TYPE (type))))
1742 /* Now do type-specific checks. Note that the last part of the check above
1743 greatly limits what we have to do below. */
1744 switch (TREE_CODE (type))
1753 case REFERENCE_TYPE:
1761 /* Here we just check the bounds. */
1762 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1763 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1768 /* We're already checked the component type (TREE_TYPE), so just check
1770 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1774 case QUAL_UNION_TYPE:
1776 static tree seen_types = 0;
1780 /* We have to be careful here that we don't end up in infinite
1781 recursions due to a field of a type being a pointer to that type
1782 or to a mutually-recursive type. So we store a list of record
1783 types that we've seen and see if this type is in them. To save
1784 memory, we don't use a list for just one type. Here we check
1785 whether we've seen this type before and store it if not. */
1786 if (seen_types == 0)
1788 else if (TREE_CODE (seen_types) != TREE_LIST)
1790 if (seen_types == type)
1793 seen_types = tree_cons (NULL_TREE, type,
1794 build_tree_list (NULL_TREE, seen_types));
1798 if (value_member (type, seen_types) != 0)
1801 seen_types = tree_cons (NULL_TREE, type, seen_types);
1804 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1805 if (TREE_CODE (field) == FIELD_DECL
1806 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1807 || (TREE_CODE (type) == QUAL_UNION_TYPE
1808 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1809 || type_contains_placeholder_p (TREE_TYPE (field))))
1815 /* Now remove us from seen_types and return the result. */
1816 if (seen_types == type)
1819 seen_types = TREE_CHAIN (seen_types);
1829 /* Return 1 if EXP contains any expressions that produce cleanups for an
1830 outer scope to deal with. Used by fold. */
1833 has_cleanups (tree exp)
1837 if (! TREE_SIDE_EFFECTS (exp))
1840 switch (TREE_CODE (exp))
1843 case GOTO_SUBROUTINE_EXPR:
1844 case WITH_CLEANUP_EXPR:
1847 case CLEANUP_POINT_EXPR:
1851 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1853 cmp = has_cleanups (TREE_VALUE (exp));
1860 return (DECL_INITIAL (DECL_EXPR_DECL (exp))
1861 && has_cleanups (DECL_INITIAL (DECL_EXPR_DECL (exp))));
1867 /* This general rule works for most tree codes. All exceptions should be
1868 handled above. If this is a language-specific tree code, we can't
1869 trust what might be in the operand, so say we don't know
1871 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1874 nops = first_rtl_op (TREE_CODE (exp));
1875 for (i = 0; i < nops; i++)
1876 if (TREE_OPERAND (exp, i) != 0)
1878 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1879 if (type == 'e' || type == '<' || type == '1' || type == '2'
1880 || type == 'r' || type == 's')
1882 cmp = has_cleanups (TREE_OPERAND (exp, i));
1891 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1892 return a tree with all occurrences of references to F in a
1893 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1894 contains only arithmetic expressions or a CALL_EXPR with a
1895 PLACEHOLDER_EXPR occurring only in its arglist. */
1898 substitute_in_expr (tree exp, tree f, tree r)
1900 enum tree_code code = TREE_CODE (exp);
1905 /* We handle TREE_LIST and COMPONENT_REF separately. */
1906 if (code == TREE_LIST)
1908 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1909 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1910 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1913 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1915 else if (code == COMPONENT_REF)
1917 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1918 and it is the right field, replace it with R. */
1919 for (inner = TREE_OPERAND (exp, 0);
1920 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1921 inner = TREE_OPERAND (inner, 0))
1923 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1924 && TREE_OPERAND (exp, 1) == f)
1927 /* If this expression hasn't been completed let, leave it
1929 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1932 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1933 if (op0 == TREE_OPERAND (exp, 0))
1936 new = fold (build (code, TREE_TYPE (exp), op0, TREE_OPERAND (exp, 1),
1940 switch (TREE_CODE_CLASS (code))
1952 switch (first_rtl_op (code))
1958 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1959 if (op0 == TREE_OPERAND (exp, 0))
1962 new = fold (build1 (code, TREE_TYPE (exp), op0));
1966 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1967 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1969 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1972 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
1976 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1977 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1978 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
1980 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1981 && op2 == TREE_OPERAND (exp, 2))
1984 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
1996 TREE_READONLY (new) = TREE_READONLY (exp);
2000 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2001 for it within OBJ, a tree that is an object or a chain of references. */
2004 substitute_placeholder_in_expr (tree exp, tree obj)
2006 enum tree_code code = TREE_CODE (exp);
2007 tree op0, op1, op2, op3;
2009 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2010 in the chain of OBJ. */
2011 if (code == PLACEHOLDER_EXPR)
2013 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2016 for (elt = obj; elt != 0;
2017 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2018 || TREE_CODE (elt) == COND_EXPR)
2019 ? TREE_OPERAND (elt, 1)
2020 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2021 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2022 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2023 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2024 ? TREE_OPERAND (elt, 0) : 0))
2025 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2028 for (elt = obj; elt != 0;
2029 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2030 || TREE_CODE (elt) == COND_EXPR)
2031 ? TREE_OPERAND (elt, 1)
2032 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2033 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2034 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2035 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2036 ? TREE_OPERAND (elt, 0) : 0))
2037 if (POINTER_TYPE_P (TREE_TYPE (elt))
2038 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2040 return fold (build1 (INDIRECT_REF, need_type, elt));
2042 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2043 survives until RTL generation, there will be an error. */
2047 /* TREE_LIST is special because we need to look at TREE_VALUE
2048 and TREE_CHAIN, not TREE_OPERANDS. */
2049 else if (code == TREE_LIST)
2051 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2052 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2053 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2056 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2059 switch (TREE_CODE_CLASS (code))
2072 switch (first_rtl_op (code))
2078 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2079 if (op0 == TREE_OPERAND (exp, 0))
2082 return fold (build1 (code, TREE_TYPE (exp), op0));
2085 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2086 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2088 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2091 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2094 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2095 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2096 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2098 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2099 && op2 == TREE_OPERAND (exp, 2))
2102 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2105 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2106 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2107 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2108 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2110 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2111 && op2 == TREE_OPERAND (exp, 2)
2112 && op3 == TREE_OPERAND (exp, 3))
2115 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2127 /* Stabilize a reference so that we can use it any number of times
2128 without causing its operands to be evaluated more than once.
2129 Returns the stabilized reference. This works by means of save_expr,
2130 so see the caveats in the comments about save_expr.
2132 Also allows conversion expressions whose operands are references.
2133 Any other kind of expression is returned unchanged. */
2136 stabilize_reference (tree ref)
2139 enum tree_code code = TREE_CODE (ref);
2146 /* No action is needed in this case. */
2152 case FIX_TRUNC_EXPR:
2153 case FIX_FLOOR_EXPR:
2154 case FIX_ROUND_EXPR:
2156 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2160 result = build_nt (INDIRECT_REF,
2161 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2165 result = build_nt (COMPONENT_REF,
2166 stabilize_reference (TREE_OPERAND (ref, 0)),
2167 TREE_OPERAND (ref, 1), NULL_TREE);
2171 result = build_nt (BIT_FIELD_REF,
2172 stabilize_reference (TREE_OPERAND (ref, 0)),
2173 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2174 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2178 result = build_nt (ARRAY_REF,
2179 stabilize_reference (TREE_OPERAND (ref, 0)),
2180 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2181 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2184 case ARRAY_RANGE_REF:
2185 result = build_nt (ARRAY_RANGE_REF,
2186 stabilize_reference (TREE_OPERAND (ref, 0)),
2187 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2188 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
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_INVARIANT (e))
2248 switch (TREE_CODE_CLASS (code))
2257 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2258 so that it will only be evaluated once. */
2259 /* The reference (r) and comparison (<) classes could be handled as
2260 below, but it is generally faster to only evaluate them once. */
2261 if (TREE_SIDE_EFFECTS (e))
2262 return save_expr (e);
2266 /* Constants need no processing. In fact, we should never reach
2271 /* Division is slow and tends to be compiled with jumps,
2272 especially the division by powers of 2 that is often
2273 found inside of an array reference. So do it just once. */
2274 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2275 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2276 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2277 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2278 return save_expr (e);
2279 /* Recursively stabilize each operand. */
2280 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2281 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2285 /* Recursively stabilize each operand. */
2286 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2293 TREE_TYPE (result) = TREE_TYPE (e);
2294 TREE_READONLY (result) = TREE_READONLY (e);
2295 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2296 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2297 TREE_INVARIANT (result) = 1;
2302 /* Low-level constructors for expressions. */
2304 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2305 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2308 recompute_tree_invarant_for_addr_expr (tree t)
2311 bool tc = true, ti = true, se = false;
2313 /* We started out assuming this address is both invariant and constant, but
2314 does not have side effects. Now go down any handled components and see if
2315 any of them involve offsets that are either non-constant or non-invariant.
2316 Also check for side-effects.
2318 ??? Note that this code makes no attempt to deal with the case where
2319 taking the address of something causes a copy due to misalignment. */
2321 #define UPDATE_TITCSE(NODE) \
2322 do { tree _node = (NODE); \
2323 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2324 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2325 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2327 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2328 node = TREE_OPERAND (node, 0))
2330 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2331 array reference (probably made temporarily by the G++ front end),
2332 so ignore all the operands. */
2333 if ((TREE_CODE (node) == ARRAY_REF
2334 || TREE_CODE (node) == ARRAY_RANGE_REF)
2335 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2337 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2338 UPDATE_TITCSE (array_ref_low_bound (node));
2339 UPDATE_TITCSE (array_ref_element_size (node));
2341 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2342 FIELD_DECL, apparently. The G++ front end can put something else
2343 there, at least temporarily. */
2344 else if (TREE_CODE (node) == COMPONENT_REF
2345 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2346 UPDATE_TITCSE (component_ref_field_offset (node));
2347 else if (TREE_CODE (node) == BIT_FIELD_REF)
2348 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2351 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2352 it. If it's a decl, it's definitely invariant and it's constant if the
2353 decl is static. (Taking the address of a volatile variable is not
2354 volatile.) If it's a constant, the address is both invariant and
2355 constant. Otherwise it's neither. */
2356 if (TREE_CODE (node) == INDIRECT_REF)
2357 UPDATE_TITCSE (node);
2358 else if (DECL_P (node))
2360 if (!staticp (node))
2363 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 'c')
2368 se |= TREE_SIDE_EFFECTS (node);
2371 TREE_CONSTANT (t) = tc;
2372 TREE_INVARIANT (t) = ti;
2373 TREE_SIDE_EFFECTS (t) = se;
2374 #undef UPDATE_TITCSE
2377 /* Build an expression of code CODE, data type TYPE, and operands as
2378 specified. Expressions and reference nodes can be created this way.
2379 Constants, decls, types and misc nodes cannot be.
2381 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2382 enough for all extant tree codes. These functions can be called
2383 directly (preferably!), but can also be obtained via GCC preprocessor
2384 magic within the build macro. */
2387 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2391 #ifdef ENABLE_CHECKING
2392 if (TREE_CODE_LENGTH (code) != 0)
2396 t = make_node_stat (code PASS_MEM_STAT);
2403 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2405 int length = sizeof (struct tree_exp);
2406 #ifdef GATHER_STATISTICS
2407 tree_node_kind kind;
2411 #ifdef GATHER_STATISTICS
2412 switch (TREE_CODE_CLASS (code))
2414 case 's': /* an expression with side effects */
2417 case 'r': /* a reference */
2425 tree_node_counts[(int) kind]++;
2426 tree_node_sizes[(int) kind] += length;
2429 #ifdef ENABLE_CHECKING
2430 if (TREE_CODE_LENGTH (code) != 1)
2432 #endif /* ENABLE_CHECKING */
2434 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2436 memset (t, 0, sizeof (struct tree_common));
2438 TREE_SET_CODE (t, code);
2440 TREE_TYPE (t) = type;
2441 SET_EXPR_LOCUS (t, NULL);
2442 TREE_COMPLEXITY (t) = 0;
2443 TREE_OPERAND (t, 0) = node;
2444 TREE_BLOCK (t) = NULL_TREE;
2445 if (node && !TYPE_P (node) && first_rtl_op (code) != 0)
2447 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2448 TREE_READONLY (t) = TREE_READONLY (node);
2451 if (TREE_CODE_CLASS (code) == 's')
2452 TREE_SIDE_EFFECTS (t) = 1;
2459 case PREDECREMENT_EXPR:
2460 case PREINCREMENT_EXPR:
2461 case POSTDECREMENT_EXPR:
2462 case POSTINCREMENT_EXPR:
2463 /* All of these have side-effects, no matter what their
2465 TREE_SIDE_EFFECTS (t) = 1;
2466 TREE_READONLY (t) = 0;
2470 /* Whether a dereference is readonly has nothing to do with whether
2471 its operand is readonly. */
2472 TREE_READONLY (t) = 0;
2477 recompute_tree_invarant_for_addr_expr (t);
2481 if (TREE_CODE_CLASS (code) == '1' && node && !TYPE_P (node)
2482 && TREE_CONSTANT (node))
2483 TREE_CONSTANT (t) = 1;
2484 if (TREE_CODE_CLASS (code) == '1' && node && TREE_INVARIANT (node))
2485 TREE_INVARIANT (t) = 1;
2492 #define PROCESS_ARG(N) \
2494 TREE_OPERAND (t, N) = arg##N; \
2495 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2497 if (TREE_SIDE_EFFECTS (arg##N)) \
2499 if (!TREE_READONLY (arg##N)) \
2501 if (!TREE_CONSTANT (arg##N)) \
2503 if (!TREE_INVARIANT (arg##N)) \
2509 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2511 bool constant, read_only, side_effects, invariant;
2515 #ifdef ENABLE_CHECKING
2516 if (TREE_CODE_LENGTH (code) != 2)
2520 t = make_node_stat (code PASS_MEM_STAT);
2523 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2524 result based on those same flags for the arguments. But if the
2525 arguments aren't really even `tree' expressions, we shouldn't be trying
2527 fro = first_rtl_op (code);
2529 /* Expressions without side effects may be constant if their
2530 arguments are as well. */
2531 constant = (TREE_CODE_CLASS (code) == '<'
2532 || TREE_CODE_CLASS (code) == '2');
2534 side_effects = TREE_SIDE_EFFECTS (t);
2535 invariant = constant;
2540 TREE_READONLY (t) = read_only;
2541 TREE_CONSTANT (t) = constant;
2542 TREE_INVARIANT (t) = invariant;
2543 TREE_SIDE_EFFECTS (t) = side_effects;
2544 TREE_THIS_VOLATILE (t)
2545 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2551 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2552 tree arg2 MEM_STAT_DECL)
2554 bool constant, read_only, side_effects, invariant;
2558 #ifdef ENABLE_CHECKING
2559 if (TREE_CODE_LENGTH (code) != 3)
2563 t = make_node_stat (code PASS_MEM_STAT);
2566 fro = first_rtl_op (code);
2568 side_effects = TREE_SIDE_EFFECTS (t);
2574 if (code == CALL_EXPR && !side_effects)
2579 /* Calls have side-effects, except those to const or
2581 i = call_expr_flags (t);
2582 if (!(i & (ECF_CONST | ECF_PURE)))
2585 /* And even those have side-effects if their arguments do. */
2586 else for (node = arg1; node; node = TREE_CHAIN (node))
2587 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2594 TREE_SIDE_EFFECTS (t) = side_effects;
2595 TREE_THIS_VOLATILE (t)
2596 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2602 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2603 tree arg2, tree arg3 MEM_STAT_DECL)
2605 bool constant, read_only, side_effects, invariant;
2609 #ifdef ENABLE_CHECKING
2610 if (TREE_CODE_LENGTH (code) != 4)
2614 t = make_node_stat (code PASS_MEM_STAT);
2617 fro = first_rtl_op (code);
2619 side_effects = TREE_SIDE_EFFECTS (t);
2626 TREE_SIDE_EFFECTS (t) = side_effects;
2627 TREE_THIS_VOLATILE (t)
2628 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2633 /* Backup definition for non-gcc build compilers. */
2636 (build) (enum tree_code code, tree tt, ...)
2638 tree t, arg0, arg1, arg2, arg3;
2639 int length = TREE_CODE_LENGTH (code);
2646 t = build0 (code, tt);
2649 arg0 = va_arg (p, tree);
2650 t = build1 (code, tt, arg0);
2653 arg0 = va_arg (p, tree);
2654 arg1 = va_arg (p, tree);
2655 t = build2 (code, tt, arg0, arg1);
2658 arg0 = va_arg (p, tree);
2659 arg1 = va_arg (p, tree);
2660 arg2 = va_arg (p, tree);
2661 t = build3 (code, tt, arg0, arg1, arg2);
2664 arg0 = va_arg (p, tree);
2665 arg1 = va_arg (p, tree);
2666 arg2 = va_arg (p, tree);
2667 arg3 = va_arg (p, tree);
2668 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2678 /* Similar except don't specify the TREE_TYPE
2679 and leave the TREE_SIDE_EFFECTS as 0.
2680 It is permissible for arguments to be null,
2681 or even garbage if their values do not matter. */
2684 build_nt (enum tree_code code, ...)
2693 t = make_node (code);
2694 length = TREE_CODE_LENGTH (code);
2696 for (i = 0; i < length; i++)
2697 TREE_OPERAND (t, i) = va_arg (p, tree);
2703 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2704 We do NOT enter this node in any sort of symbol table.
2706 layout_decl is used to set up the decl's storage layout.
2707 Other slots are initialized to 0 or null pointers. */
2710 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2714 t = make_node_stat (code PASS_MEM_STAT);
2716 /* if (type == error_mark_node)
2717 type = integer_type_node; */
2718 /* That is not done, deliberately, so that having error_mark_node
2719 as the type can suppress useless errors in the use of this variable. */
2721 DECL_NAME (t) = name;
2722 TREE_TYPE (t) = type;
2724 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2726 else if (code == FUNCTION_DECL)
2727 DECL_MODE (t) = FUNCTION_MODE;
2732 /* BLOCK nodes are used to represent the structure of binding contours
2733 and declarations, once those contours have been exited and their contents
2734 compiled. This information is used for outputting debugging info. */
2737 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2738 tree supercontext, tree chain)
2740 tree block = make_node (BLOCK);
2742 BLOCK_VARS (block) = vars;
2743 BLOCK_SUBBLOCKS (block) = subblocks;
2744 BLOCK_SUPERCONTEXT (block) = supercontext;
2745 BLOCK_CHAIN (block) = chain;
2749 static GTY(()) tree last_annotated_node;
2751 /* Record the exact location where an expression or an identifier were
2755 annotate_with_file_line (tree node, const char *file, int line)
2757 /* Roughly one percent of the calls to this function are to annotate
2758 a node with the same information already attached to that node!
2759 Just return instead of wasting memory. */
2760 if (EXPR_LOCUS (node)
2761 && (EXPR_FILENAME (node) == file
2762 || ! strcmp (EXPR_FILENAME (node), file))
2763 && EXPR_LINENO (node) == line)
2765 last_annotated_node = node;
2769 /* In heavily macroized code (such as GCC itself) this single
2770 entry cache can reduce the number of allocations by more
2772 if (last_annotated_node
2773 && EXPR_LOCUS (last_annotated_node)
2774 && (EXPR_FILENAME (last_annotated_node) == file
2775 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
2776 && EXPR_LINENO (last_annotated_node) == line)
2778 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
2782 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
2783 EXPR_LINENO (node) = line;
2784 EXPR_FILENAME (node) = file;
2785 last_annotated_node = node;
2789 annotate_with_locus (tree node, location_t locus)
2791 annotate_with_file_line (node, locus.file, locus.line);
2794 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2798 build_decl_attribute_variant (tree ddecl, tree attribute)
2800 DECL_ATTRIBUTES (ddecl) = attribute;
2804 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2807 Record such modified types already made so we don't make duplicates. */
2810 build_type_attribute_variant (tree ttype, tree attribute)
2812 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2814 hashval_t hashcode = 0;
2816 enum tree_code code = TREE_CODE (ttype);
2818 ntype = copy_node (ttype);
2820 TYPE_POINTER_TO (ntype) = 0;
2821 TYPE_REFERENCE_TO (ntype) = 0;
2822 TYPE_ATTRIBUTES (ntype) = attribute;
2824 /* Create a new main variant of TYPE. */
2825 TYPE_MAIN_VARIANT (ntype) = ntype;
2826 TYPE_NEXT_VARIANT (ntype) = 0;
2827 set_type_quals (ntype, TYPE_UNQUALIFIED);
2829 hashcode = iterative_hash_object (code, hashcode);
2830 if (TREE_TYPE (ntype))
2831 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2833 hashcode = attribute_hash_list (attribute, hashcode);
2835 switch (TREE_CODE (ntype))
2838 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2841 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2845 hashcode = iterative_hash_object
2846 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2847 hashcode = iterative_hash_object
2848 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2852 unsigned int precision = TYPE_PRECISION (ntype);
2853 hashcode = iterative_hash_object (precision, hashcode);
2860 ntype = type_hash_canon (hashcode, ntype);
2861 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2867 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2870 We try both `text' and `__text__', ATTR may be either one. */
2871 /* ??? It might be a reasonable simplification to require ATTR to be only
2872 `text'. One might then also require attribute lists to be stored in
2873 their canonicalized form. */
2876 is_attribute_p (const char *attr, tree ident)
2878 int ident_len, attr_len;
2881 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2884 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2887 p = IDENTIFIER_POINTER (ident);
2888 ident_len = strlen (p);
2889 attr_len = strlen (attr);
2891 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2895 || attr[attr_len - 2] != '_'
2896 || attr[attr_len - 1] != '_')
2898 if (ident_len == attr_len - 4
2899 && strncmp (attr + 2, p, attr_len - 4) == 0)
2904 if (ident_len == attr_len + 4
2905 && p[0] == '_' && p[1] == '_'
2906 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2907 && strncmp (attr, p + 2, attr_len) == 0)
2914 /* Given an attribute name and a list of attributes, return a pointer to the
2915 attribute's list element if the attribute is part of the list, or NULL_TREE
2916 if not found. If the attribute appears more than once, this only
2917 returns the first occurrence; the TREE_CHAIN of the return value should
2918 be passed back in if further occurrences are wanted. */
2921 lookup_attribute (const char *attr_name, tree list)
2925 for (l = list; l; l = TREE_CHAIN (l))
2927 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2929 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2936 /* Return an attribute list that is the union of a1 and a2. */
2939 merge_attributes (tree a1, tree a2)
2943 /* Either one unset? Take the set one. */
2945 if ((attributes = a1) == 0)
2948 /* One that completely contains the other? Take it. */
2950 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2952 if (attribute_list_contained (a2, a1))
2956 /* Pick the longest list, and hang on the other list. */
2958 if (list_length (a1) < list_length (a2))
2959 attributes = a2, a2 = a1;
2961 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2964 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2967 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2970 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2975 a1 = copy_node (a2);
2976 TREE_CHAIN (a1) = attributes;
2985 /* Given types T1 and T2, merge their attributes and return
2989 merge_type_attributes (tree t1, tree t2)
2991 return merge_attributes (TYPE_ATTRIBUTES (t1),
2992 TYPE_ATTRIBUTES (t2));
2995 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2999 merge_decl_attributes (tree olddecl, tree newdecl)
3001 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3002 DECL_ATTRIBUTES (newdecl));
3005 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
3007 /* Specialization of merge_decl_attributes for various Windows targets.
3009 This handles the following situation:
3011 __declspec (dllimport) int foo;
3014 The second instance of `foo' nullifies the dllimport. */
3017 merge_dllimport_decl_attributes (tree old, tree new)
3020 int delete_dllimport_p;
3022 old = DECL_ATTRIBUTES (old);
3023 new = DECL_ATTRIBUTES (new);
3025 /* What we need to do here is remove from `old' dllimport if it doesn't
3026 appear in `new'. dllimport behaves like extern: if a declaration is
3027 marked dllimport and a definition appears later, then the object
3028 is not dllimport'd. */
3029 if (lookup_attribute ("dllimport", old) != NULL_TREE
3030 && lookup_attribute ("dllimport", new) == NULL_TREE)
3031 delete_dllimport_p = 1;
3033 delete_dllimport_p = 0;
3035 a = merge_attributes (old, new);
3037 if (delete_dllimport_p)
3041 /* Scan the list for dllimport and delete it. */
3042 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3044 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3046 if (prev == NULL_TREE)
3049 TREE_CHAIN (prev) = TREE_CHAIN (t);
3058 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3060 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3061 of the various TYPE_QUAL values. */
3064 set_type_quals (tree type, int type_quals)
3066 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3067 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3068 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3071 /* Returns true iff cand is equivalent to base with type_quals. */
3074 check_qualified_type (tree cand, tree base, int type_quals)
3076 return (TYPE_QUALS (cand) == type_quals
3077 && TYPE_NAME (cand) == TYPE_NAME (base)
3078 /* Apparently this is needed for Objective-C. */
3079 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3080 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3081 TYPE_ATTRIBUTES (base)));
3084 /* Return a version of the TYPE, qualified as indicated by the
3085 TYPE_QUALS, if one exists. If no qualified version exists yet,
3086 return NULL_TREE. */
3089 get_qualified_type (tree type, int type_quals)
3093 if (TYPE_QUALS (type) == type_quals)
3096 /* Search the chain of variants to see if there is already one there just
3097 like the one we need to have. If so, use that existing one. We must
3098 preserve the TYPE_NAME, since there is code that depends on this. */
3099 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3100 if (check_qualified_type (t, type, type_quals))
3106 /* Like get_qualified_type, but creates the type if it does not
3107 exist. This function never returns NULL_TREE. */
3110 build_qualified_type (tree type, int type_quals)
3114 /* See if we already have the appropriate qualified variant. */
3115 t = get_qualified_type (type, type_quals);
3117 /* If not, build it. */
3120 t = build_type_copy (type);
3121 set_type_quals (t, type_quals);
3127 /* Create a new variant of TYPE, equivalent but distinct.
3128 This is so the caller can modify it. */
3131 build_type_copy (tree type)
3133 tree t, m = TYPE_MAIN_VARIANT (type);
3135 t = copy_node (type);
3137 TYPE_POINTER_TO (t) = 0;
3138 TYPE_REFERENCE_TO (t) = 0;
3140 /* Add this type to the chain of variants of TYPE. */
3141 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3142 TYPE_NEXT_VARIANT (m) = t;
3147 /* Hashing of types so that we don't make duplicates.
3148 The entry point is `type_hash_canon'. */
3150 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3151 with types in the TREE_VALUE slots), by adding the hash codes
3152 of the individual types. */
3155 type_hash_list (tree list, hashval_t hashcode)
3159 for (tail = list; tail; tail = TREE_CHAIN (tail))
3160 if (TREE_VALUE (tail) != error_mark_node)
3161 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3167 /* These are the Hashtable callback functions. */
3169 /* Returns true iff the types are equivalent. */
3172 type_hash_eq (const void *va, const void *vb)
3174 const struct type_hash *a = va, *b = vb;
3176 /* First test the things that are the same for all types. */
3177 if (a->hash != b->hash
3178 || TREE_CODE (a->type) != TREE_CODE (b->type)
3179 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3180 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3181 TYPE_ATTRIBUTES (b->type))
3182 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3183 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3186 switch (TREE_CODE (a->type))
3192 case REFERENCE_TYPE:
3196 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3197 && !(TYPE_VALUES (a->type)
3198 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3199 && TYPE_VALUES (b->type)
3200 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3201 && type_list_equal (TYPE_VALUES (a->type),
3202 TYPE_VALUES (b->type))))
3205 /* ... fall through ... */
3211 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3212 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3213 TYPE_MAX_VALUE (b->type)))
3214 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3215 && tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3216 TYPE_MIN_VALUE (b->type))));
3219 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3222 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3223 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3224 || (TYPE_ARG_TYPES (a->type)
3225 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3226 && TYPE_ARG_TYPES (b->type)
3227 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3228 && type_list_equal (TYPE_ARG_TYPES (a->type),
3229 TYPE_ARG_TYPES (b->type)))));
3233 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3237 case QUAL_UNION_TYPE:
3238 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3239 || (TYPE_FIELDS (a->type)
3240 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3241 && TYPE_FIELDS (b->type)
3242 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3243 && type_list_equal (TYPE_FIELDS (a->type),
3244 TYPE_FIELDS (b->type))));
3247 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3248 || (TYPE_ARG_TYPES (a->type)
3249 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3250 && TYPE_ARG_TYPES (b->type)
3251 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3252 && type_list_equal (TYPE_ARG_TYPES (a->type),
3253 TYPE_ARG_TYPES (b->type))));
3260 /* Return the cached hash value. */
3263 type_hash_hash (const void *item)
3265 return ((const struct type_hash *) item)->hash;
3268 /* Look in the type hash table for a type isomorphic to TYPE.
3269 If one is found, return it. Otherwise return 0. */
3272 type_hash_lookup (hashval_t hashcode, tree type)
3274 struct type_hash *h, in;
3276 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3277 must call that routine before comparing TYPE_ALIGNs. */
3283 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3289 /* Add an entry to the type-hash-table
3290 for a type TYPE whose hash code is HASHCODE. */
3293 type_hash_add (hashval_t hashcode, tree type)
3295 struct type_hash *h;
3298 h = ggc_alloc (sizeof (struct type_hash));
3301 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3302 *(struct type_hash **) loc = h;
3305 /* Given TYPE, and HASHCODE its hash code, return the canonical
3306 object for an identical type if one already exists.
3307 Otherwise, return TYPE, and record it as the canonical object.
3309 To use this function, first create a type of the sort you want.
3310 Then compute its hash code from the fields of the type that
3311 make it different from other similar types.
3312 Then call this function and use the value. */
3315 type_hash_canon (unsigned int hashcode, tree type)
3319 /* The hash table only contains main variants, so ensure that's what we're
3321 if (TYPE_MAIN_VARIANT (type) != type)
3324 if (!lang_hooks.types.hash_types)
3327 /* See if the type is in the hash table already. If so, return it.
3328 Otherwise, add the type. */
3329 t1 = type_hash_lookup (hashcode, type);
3332 #ifdef GATHER_STATISTICS
3333 tree_node_counts[(int) t_kind]--;
3334 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3340 type_hash_add (hashcode, type);
3345 /* See if the data pointed to by the type hash table is marked. We consider
3346 it marked if the type is marked or if a debug type number or symbol
3347 table entry has been made for the type. This reduces the amount of
3348 debugging output and eliminates that dependency of the debug output on
3349 the number of garbage collections. */
3352 type_hash_marked_p (const void *p)
3354 tree type = ((struct type_hash *) p)->type;
3356 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3360 print_type_hash_statistics (void)
3362 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3363 (long) htab_size (type_hash_table),
3364 (long) htab_elements (type_hash_table),
3365 htab_collisions (type_hash_table));
3368 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3369 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3370 by adding the hash codes of the individual attributes. */
3373 attribute_hash_list (tree list, hashval_t hashcode)
3377 for (tail = list; tail; tail = TREE_CHAIN (tail))
3378 /* ??? Do we want to add in TREE_VALUE too? */
3379 hashcode = iterative_hash_object
3380 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3384 /* Given two lists of attributes, return true if list l2 is
3385 equivalent to l1. */
3388 attribute_list_equal (tree l1, tree l2)
3390 return attribute_list_contained (l1, l2)
3391 && attribute_list_contained (l2, l1);
3394 /* Given two lists of attributes, return true if list L2 is
3395 completely contained within L1. */
3396 /* ??? This would be faster if attribute names were stored in a canonicalized
3397 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3398 must be used to show these elements are equivalent (which they are). */
3399 /* ??? It's not clear that attributes with arguments will always be handled
3403 attribute_list_contained (tree l1, tree l2)
3407 /* First check the obvious, maybe the lists are identical. */
3411 /* Maybe the lists are similar. */
3412 for (t1 = l1, t2 = l2;
3414 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3415 && TREE_VALUE (t1) == TREE_VALUE (t2);
3416 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3418 /* Maybe the lists are equal. */
3419 if (t1 == 0 && t2 == 0)
3422 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3425 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3427 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3430 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3437 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3444 /* Given two lists of types
3445 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3446 return 1 if the lists contain the same types in the same order.
3447 Also, the TREE_PURPOSEs must match. */
3450 type_list_equal (tree l1, tree l2)
3454 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3455 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3456 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3457 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3458 && (TREE_TYPE (TREE_PURPOSE (t1))
3459 == TREE_TYPE (TREE_PURPOSE (t2))))))
3465 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3466 given by TYPE. If the argument list accepts variable arguments,
3467 then this function counts only the ordinary arguments. */
3470 type_num_arguments (tree type)
3475 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3476 /* If the function does not take a variable number of arguments,
3477 the last element in the list will have type `void'. */
3478 if (VOID_TYPE_P (TREE_VALUE (t)))
3486 /* Nonzero if integer constants T1 and T2
3487 represent the same constant value. */
3490 tree_int_cst_equal (tree t1, tree t2)
3495 if (t1 == 0 || t2 == 0)
3498 if (TREE_CODE (t1) == INTEGER_CST
3499 && TREE_CODE (t2) == INTEGER_CST
3500 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3501 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3507 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3508 The precise way of comparison depends on their data type. */
3511 tree_int_cst_lt (tree t1, tree t2)
3516 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3518 int t1_sgn = tree_int_cst_sgn (t1);
3519 int t2_sgn = tree_int_cst_sgn (t2);
3521 if (t1_sgn < t2_sgn)
3523 else if (t1_sgn > t2_sgn)
3525 /* Otherwise, both are non-negative, so we compare them as
3526 unsigned just in case one of them would overflow a signed
3529 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3530 return INT_CST_LT (t1, t2);
3532 return INT_CST_LT_UNSIGNED (t1, t2);
3535 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3538 tree_int_cst_compare (tree t1, tree t2)
3540 if (tree_int_cst_lt (t1, t2))
3542 else if (tree_int_cst_lt (t2, t1))
3548 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3549 the host. If POS is zero, the value can be represented in a single
3550 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3551 be represented in a single unsigned HOST_WIDE_INT. */
3554 host_integerp (tree t, int pos)
3556 return (TREE_CODE (t) == INTEGER_CST
3557 && ! TREE_OVERFLOW (t)
3558 && ((TREE_INT_CST_HIGH (t) == 0
3559 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3560 || (! pos && TREE_INT_CST_HIGH (t) == -1
3561 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3562 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3563 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3566 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3567 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3568 be positive. Abort if we cannot satisfy the above conditions. */
3571 tree_low_cst (tree t, int pos)
3573 if (host_integerp (t, pos))
3574 return TREE_INT_CST_LOW (t);
3579 /* Return the most significant bit of the integer constant T. */
3582 tree_int_cst_msb (tree t)
3586 unsigned HOST_WIDE_INT l;
3588 /* Note that using TYPE_PRECISION here is wrong. We care about the
3589 actual bits, not the (arbitrary) range of the type. */
3590 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3591 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3592 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3593 return (l & 1) == 1;
3596 /* Return an indication of the sign of the integer constant T.
3597 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3598 Note that -1 will never be returned it T's type is unsigned. */
3601 tree_int_cst_sgn (tree t)
3603 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3605 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3607 else if (TREE_INT_CST_HIGH (t) < 0)
3613 /* Compare two constructor-element-type constants. Return 1 if the lists
3614 are known to be equal; otherwise return 0. */
3617 simple_cst_list_equal (tree l1, tree l2)
3619 while (l1 != NULL_TREE && l2 != NULL_TREE)
3621 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3624 l1 = TREE_CHAIN (l1);
3625 l2 = TREE_CHAIN (l2);
3631 /* Return truthvalue of whether T1 is the same tree structure as T2.
3632 Return 1 if they are the same.
3633 Return 0 if they are understandably different.
3634 Return -1 if either contains tree structure not understood by
3638 simple_cst_equal (tree t1, tree t2)
3640 enum tree_code code1, code2;
3646 if (t1 == 0 || t2 == 0)
3649 code1 = TREE_CODE (t1);
3650 code2 = TREE_CODE (t2);
3652 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3654 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3655 || code2 == NON_LVALUE_EXPR)
3656 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3658 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3661 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3662 || code2 == NON_LVALUE_EXPR)
3663 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3671 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3672 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3675 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3678 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3679 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3680 TREE_STRING_LENGTH (t1)));
3683 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1),
3684 CONSTRUCTOR_ELTS (t2));
3687 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3690 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3694 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3697 /* Special case: if either target is an unallocated VAR_DECL,
3698 it means that it's going to be unified with whatever the
3699 TARGET_EXPR is really supposed to initialize, so treat it
3700 as being equivalent to anything. */
3701 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3702 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3703 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3704 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3705 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3706 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3709 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3714 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3716 case WITH_CLEANUP_EXPR:
3717 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3721 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3724 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3725 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3739 /* This general rule works for most tree codes. All exceptions should be
3740 handled above. If this is a language-specific tree code, we can't
3741 trust what might be in the operand, so say we don't know
3743 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3746 switch (TREE_CODE_CLASS (code1))
3755 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3757 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3769 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3770 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3771 than U, respectively. */
3774 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3776 if (tree_int_cst_sgn (t) < 0)
3778 else if (TREE_INT_CST_HIGH (t) != 0)
3780 else if (TREE_INT_CST_LOW (t) == u)
3782 else if (TREE_INT_CST_LOW (t) < u)
3788 /* Return true if CODE represents an associative tree code. Otherwise
3791 associative_tree_code (enum tree_code code)
3810 /* Return true if CODE represents an commutative tree code. Otherwise
3813 commutative_tree_code (enum tree_code code)
3826 case UNORDERED_EXPR:
3830 case TRUTH_AND_EXPR:
3831 case TRUTH_XOR_EXPR:
3841 /* Generate a hash value for an expression. This can be used iteratively
3842 by passing a previous result as the "val" argument.
3844 This function is intended to produce the same hash for expressions which
3845 would compare equal using operand_equal_p. */
3848 iterative_hash_expr (tree t, hashval_t val)
3851 enum tree_code code;
3855 return iterative_hash_object (t, val);
3857 code = TREE_CODE (t);
3858 class = TREE_CODE_CLASS (code);
3861 || TREE_CODE (t) == VALUE_HANDLE)
3863 /* Decls we can just compare by pointer. */
3864 val = iterative_hash_object (t, val);
3866 else if (class == 'c')
3868 /* Alas, constants aren't shared, so we can't rely on pointer
3870 if (code == INTEGER_CST)
3872 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3873 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3875 else if (code == REAL_CST)
3877 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
3879 val = iterative_hash (&val2, sizeof (unsigned int), val);
3881 else if (code == STRING_CST)
3882 val = iterative_hash (TREE_STRING_POINTER (t),
3883 TREE_STRING_LENGTH (t), val);
3884 else if (code == COMPLEX_CST)
3886 val = iterative_hash_expr (TREE_REALPART (t), val);
3887 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3889 else if (code == VECTOR_CST)
3890 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3894 else if (IS_EXPR_CODE_CLASS (class))
3896 val = iterative_hash_object (code, val);
3898 /* Don't hash the type, that can lead to having nodes which
3899 compare equal according to operand_equal_p, but which
3900 have different hash codes. */
3901 if (code == NOP_EXPR
3902 || code == CONVERT_EXPR
3903 || code == NON_LVALUE_EXPR)
3905 /* Make sure to include signness in the hash computation. */
3906 val += TYPE_UNSIGNED (TREE_TYPE (t));
3907 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
3910 if (commutative_tree_code (code))
3912 /* It's a commutative expression. We want to hash it the same
3913 however it appears. We do this by first hashing both operands
3914 and then rehashing based on the order of their independent
3916 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
3917 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
3921 t = one, one = two, two = t;
3923 val = iterative_hash_object (one, val);
3924 val = iterative_hash_object (two, val);
3927 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3928 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3930 else if (code == TREE_LIST)
3932 /* A list of expressions, for a CALL_EXPR or as the elements of a
3934 for (; t; t = TREE_CHAIN (t))
3935 val = iterative_hash_expr (TREE_VALUE (t), val);
3937 else if (code == SSA_NAME)
3939 val = iterative_hash_object (SSA_NAME_VERSION (t), val);
3940 val = iterative_hash_expr (SSA_NAME_VAR (t), val);
3948 /* Constructors for pointer, array and function types.
3949 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3950 constructed by language-dependent code, not here.) */
3952 /* Construct, lay out and return the type of pointers to TO_TYPE with
3953 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
3954 reference all of memory. If such a type has already been
3955 constructed, reuse it. */
3958 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
3963 /* In some cases, languages will have things that aren't a POINTER_TYPE
3964 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
3965 In that case, return that type without regard to the rest of our
3968 ??? This is a kludge, but consistent with the way this function has
3969 always operated and there doesn't seem to be a good way to avoid this
3971 if (TYPE_POINTER_TO (to_type) != 0
3972 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
3973 return TYPE_POINTER_TO (to_type);
3975 /* First, if we already have a type for pointers to TO_TYPE and it's
3976 the proper mode, use it. */
3977 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
3978 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
3981 t = make_node (POINTER_TYPE);
3983 TREE_TYPE (t) = to_type;
3984 TYPE_MODE (t) = mode;
3985 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
3986 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
3987 TYPE_POINTER_TO (to_type) = t;
3989 /* Lay out the type. This function has many callers that are concerned
3990 with expression-construction, and this simplifies them all. */
3996 /* By default build pointers in ptr_mode. */
3999 build_pointer_type (tree to_type)
4001 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4004 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4007 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4012 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4013 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4014 In that case, return that type without regard to the rest of our
4017 ??? This is a kludge, but consistent with the way this function has
4018 always operated and there doesn't seem to be a good way to avoid this
4020 if (TYPE_REFERENCE_TO (to_type) != 0
4021 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4022 return TYPE_REFERENCE_TO (to_type);
4024 /* First, if we already have a type for pointers to TO_TYPE and it's
4025 the proper mode, use it. */
4026 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4027 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4030 t = make_node (REFERENCE_TYPE);
4032 TREE_TYPE (t) = to_type;
4033 TYPE_MODE (t) = mode;
4034 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4035 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4036 TYPE_REFERENCE_TO (to_type) = t;
4044 /* Build the node for the type of references-to-TO_TYPE by default
4048 build_reference_type (tree to_type)
4050 return build_reference_type_for_mode (to_type, ptr_mode, false);
4053 /* Build a type that is compatible with t but has no cv quals anywhere
4056 const char *const *const * -> char ***. */
4059 build_type_no_quals (tree t)
4061 switch (TREE_CODE (t))
4064 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4066 TYPE_REF_CAN_ALIAS_ALL (t));
4067 case REFERENCE_TYPE:
4069 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4071 TYPE_REF_CAN_ALIAS_ALL (t));
4073 return TYPE_MAIN_VARIANT (t);
4077 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4078 MAXVAL should be the maximum value in the domain
4079 (one less than the length of the array).
4081 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4082 We don't enforce this limit, that is up to caller (e.g. language front end).
4083 The limit exists because the result is a signed type and we don't handle
4084 sizes that use more than one HOST_WIDE_INT. */
4087 build_index_type (tree maxval)
4089 tree itype = make_node (INTEGER_TYPE);
4091 TREE_TYPE (itype) = sizetype;
4092 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4093 TYPE_MIN_VALUE (itype) = size_zero_node;
4094 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4095 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4096 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4097 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4098 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4099 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4101 if (host_integerp (maxval, 1))
4102 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4107 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4108 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4109 low bound LOWVAL and high bound HIGHVAL.
4110 if TYPE==NULL_TREE, sizetype is used. */
4113 build_range_type (tree type, tree lowval, tree highval)
4115 tree itype = make_node (INTEGER_TYPE);
4117 TREE_TYPE (itype) = type;
4118 if (type == NULL_TREE)
4121 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4122 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4124 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4125 TYPE_MODE (itype) = TYPE_MODE (type);
4126 TYPE_SIZE (itype) = TYPE_SIZE (type);
4127 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4128 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4129 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4131 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4132 return type_hash_canon (tree_low_cst (highval, 0)
4133 - tree_low_cst (lowval, 0),
4139 /* Just like build_index_type, but takes lowval and highval instead
4140 of just highval (maxval). */
4143 build_index_2_type (tree lowval, tree highval)
4145 return build_range_type (sizetype, lowval, highval);
4148 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4149 and number of elements specified by the range of values of INDEX_TYPE.
4150 If such a type has already been constructed, reuse it. */
4153 build_array_type (tree elt_type, tree index_type)
4156 hashval_t hashcode = 0;
4158 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4160 error ("arrays of functions are not meaningful");
4161 elt_type = integer_type_node;
4164 t = make_node (ARRAY_TYPE);
4165 TREE_TYPE (t) = elt_type;
4166 TYPE_DOMAIN (t) = index_type;
4168 if (index_type == 0)
4171 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4172 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4173 t = type_hash_canon (hashcode, t);
4175 if (!COMPLETE_TYPE_P (t))
4180 /* Return the TYPE of the elements comprising
4181 the innermost dimension of ARRAY. */
4184 get_inner_array_type (tree array)
4186 tree type = TREE_TYPE (array);
4188 while (TREE_CODE (type) == ARRAY_TYPE)
4189 type = TREE_TYPE (type);
4194 /* Construct, lay out and return
4195 the type of functions returning type VALUE_TYPE
4196 given arguments of types ARG_TYPES.
4197 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4198 are data type nodes for the arguments of the function.
4199 If such a type has already been constructed, reuse it. */
4202 build_function_type (tree value_type, tree arg_types)
4205 hashval_t hashcode = 0;
4207 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4209 error ("function return type cannot be function");
4210 value_type = integer_type_node;
4213 /* Make a node of the sort we want. */
4214 t = make_node (FUNCTION_TYPE);
4215 TREE_TYPE (t) = value_type;
4216 TYPE_ARG_TYPES (t) = arg_types;
4218 /* If we already have such a type, use the old one. */
4219 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4220 hashcode = type_hash_list (arg_types, hashcode);
4221 t = type_hash_canon (hashcode, t);
4223 if (!COMPLETE_TYPE_P (t))
4228 /* Build a function type. The RETURN_TYPE is the type returned by the
4229 function. If additional arguments are provided, they are
4230 additional argument types. The list of argument types must always
4231 be terminated by NULL_TREE. */
4234 build_function_type_list (tree return_type, ...)
4239 va_start (p, return_type);
4241 t = va_arg (p, tree);
4242 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4243 args = tree_cons (NULL_TREE, t, args);
4246 args = nreverse (args);
4247 TREE_CHAIN (last) = void_list_node;
4248 args = build_function_type (return_type, args);
4254 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4255 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4256 for the method. An implicit additional parameter (of type
4257 pointer-to-BASETYPE) is added to the ARGTYPES. */
4260 build_method_type_directly (tree basetype,
4268 /* Make a node of the sort we want. */
4269 t = make_node (METHOD_TYPE);
4271 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4272 TREE_TYPE (t) = rettype;
4273 ptype = build_pointer_type (basetype);
4275 /* The actual arglist for this function includes a "hidden" argument
4276 which is "this". Put it into the list of argument types. */
4277 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4278 TYPE_ARG_TYPES (t) = argtypes;
4280 /* If we already have such a type, use the old one. */
4281 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4282 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4283 hashcode = type_hash_list (argtypes, hashcode);
4284 t = type_hash_canon (hashcode, t);
4286 if (!COMPLETE_TYPE_P (t))
4292 /* Construct, lay out and return the type of methods belonging to class
4293 BASETYPE and whose arguments and values are described by TYPE.
4294 If that type exists already, reuse it.
4295 TYPE must be a FUNCTION_TYPE node. */
4298 build_method_type (tree basetype, tree type)
4300 if (TREE_CODE (type) != FUNCTION_TYPE)
4303 return build_method_type_directly (basetype,
4305 TYPE_ARG_TYPES (type));
4308 /* Construct, lay out and return the type of offsets to a value
4309 of type TYPE, within an object of type BASETYPE.
4310 If a suitable offset type exists already, reuse it. */
4313 build_offset_type (tree basetype, tree type)
4316 hashval_t hashcode = 0;
4318 /* Make a node of the sort we want. */
4319 t = make_node (OFFSET_TYPE);
4321 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4322 TREE_TYPE (t) = type;
4324 /* If we already have such a type, use the old one. */
4325 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4326 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4327 t = type_hash_canon (hashcode, t);
4329 if (!COMPLETE_TYPE_P (t))
4335 /* Create a complex type whose components are COMPONENT_TYPE. */
4338 build_complex_type (tree component_type)
4343 /* Make a node of the sort we want. */
4344 t = make_node (COMPLEX_TYPE);
4346 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4348 /* If we already have such a type, use the old one. */
4349 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4350 t = type_hash_canon (hashcode, t);
4352 if (!COMPLETE_TYPE_P (t))
4355 /* If we are writing Dwarf2 output we need to create a name,
4356 since complex is a fundamental type. */
4357 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4361 if (component_type == char_type_node)
4362 name = "complex char";
4363 else if (component_type == signed_char_type_node)
4364 name = "complex signed char";
4365 else if (component_type == unsigned_char_type_node)
4366 name = "complex unsigned char";
4367 else if (component_type == short_integer_type_node)
4368 name = "complex short int";
4369 else if (component_type == short_unsigned_type_node)
4370 name = "complex short unsigned int";
4371 else if (component_type == integer_type_node)
4372 name = "complex int";
4373 else if (component_type == unsigned_type_node)
4374 name = "complex unsigned int";
4375 else if (component_type == long_integer_type_node)
4376 name = "complex long int";
4377 else if (component_type == long_unsigned_type_node)
4378 name = "complex long unsigned int";
4379 else if (component_type == long_long_integer_type_node)
4380 name = "complex long long int";
4381 else if (component_type == long_long_unsigned_type_node)
4382 name = "complex long long unsigned int";
4387 TYPE_NAME (t) = get_identifier (name);
4390 return build_qualified_type (t, TYPE_QUALS (component_type));
4393 /* Return OP, stripped of any conversions to wider types as much as is safe.
4394 Converting the value back to OP's type makes a value equivalent to OP.
4396 If FOR_TYPE is nonzero, we return a value which, if converted to
4397 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4399 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4400 narrowest type that can hold the value, even if they don't exactly fit.
4401 Otherwise, bit-field references are changed to a narrower type
4402 only if they can be fetched directly from memory in that type.
4404 OP must have integer, real or enumeral type. Pointers are not allowed!
4406 There are some cases where the obvious value we could return
4407 would regenerate to OP if converted to OP's type,
4408 but would not extend like OP to wider types.
4409 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4410 For example, if OP is (unsigned short)(signed char)-1,
4411 we avoid returning (signed char)-1 if FOR_TYPE is int,
4412 even though extending that to an unsigned short would regenerate OP,
4413 since the result of extending (signed char)-1 to (int)
4414 is different from (int) OP. */
4417 get_unwidened (tree op, tree for_type)
4419 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4420 tree type = TREE_TYPE (op);
4422 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4424 = (for_type != 0 && for_type != type
4425 && final_prec > TYPE_PRECISION (type)
4426 && TYPE_UNSIGNED (type));
4429 while (TREE_CODE (op) == NOP_EXPR)
4432 = TYPE_PRECISION (TREE_TYPE (op))
4433 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4435 /* Truncations are many-one so cannot be removed.
4436 Unless we are later going to truncate down even farther. */
4438 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4441 /* See what's inside this conversion. If we decide to strip it,
4443 op = TREE_OPERAND (op, 0);
4445 /* If we have not stripped any zero-extensions (uns is 0),
4446 we can strip any kind of extension.
4447 If we have previously stripped a zero-extension,
4448 only zero-extensions can safely be stripped.
4449 Any extension can be stripped if the bits it would produce
4450 are all going to be discarded later by truncating to FOR_TYPE. */
4454 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4456 /* TYPE_UNSIGNED says whether this is a zero-extension.
4457 Let's avoid computing it if it does not affect WIN
4458 and if UNS will not be needed again. */
4459 if ((uns || TREE_CODE (op) == NOP_EXPR)
4460 && TYPE_UNSIGNED (TREE_TYPE (op)))
4468 if (TREE_CODE (op) == COMPONENT_REF
4469 /* Since type_for_size always gives an integer type. */
4470 && TREE_CODE (type) != REAL_TYPE
4471 /* Don't crash if field not laid out yet. */
4472 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4473 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4475 unsigned int innerprec
4476 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4477 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4478 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4479 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4481 /* We can get this structure field in the narrowest type it fits in.
4482 If FOR_TYPE is 0, do this only for a field that matches the
4483 narrower type exactly and is aligned for it
4484 The resulting extension to its nominal type (a fullword type)
4485 must fit the same conditions as for other extensions. */
4488 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4489 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4490 && (! uns || final_prec <= innerprec || unsignedp))
4492 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4493 TREE_OPERAND (op, 1), NULL_TREE);
4494 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4495 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4502 /* Return OP or a simpler expression for a narrower value
4503 which can be sign-extended or zero-extended to give back OP.
4504 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4505 or 0 if the value should be sign-extended. */
4508 get_narrower (tree op, int *unsignedp_ptr)
4514 while (TREE_CODE (op) == NOP_EXPR)
4517 = (TYPE_PRECISION (TREE_TYPE (op))
4518 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4520 /* Truncations are many-one so cannot be removed. */
4524 /* See what's inside this conversion. If we decide to strip it,
4529 op = TREE_OPERAND (op, 0);
4530 /* An extension: the outermost one can be stripped,
4531 but remember whether it is zero or sign extension. */
4533 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4534 /* Otherwise, if a sign extension has been stripped,
4535 only sign extensions can now be stripped;
4536 if a zero extension has been stripped, only zero-extensions. */
4537 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4541 else /* bitschange == 0 */
4543 /* A change in nominal type can always be stripped, but we must
4544 preserve the unsignedness. */
4546 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4548 op = TREE_OPERAND (op, 0);
4554 if (TREE_CODE (op) == COMPONENT_REF
4555 /* Since type_for_size always gives an integer type. */
4556 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4557 /* Ensure field is laid out already. */
4558 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4559 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4561 unsigned HOST_WIDE_INT innerprec
4562 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4563 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4564 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4565 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4567 /* We can get this structure field in a narrower type that fits it,
4568 but the resulting extension to its nominal type (a fullword type)
4569 must satisfy the same conditions as for other extensions.
4571 Do this only for fields that are aligned (not bit-fields),
4572 because when bit-field insns will be used there is no
4573 advantage in doing this. */
4575 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4576 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4577 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
4581 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
4582 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4583 TREE_OPERAND (op, 1), NULL_TREE);
4584 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4585 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4588 *unsignedp_ptr = uns;
4592 /* Nonzero if integer constant C has a value that is permissible
4593 for type TYPE (an INTEGER_TYPE). */
4596 int_fits_type_p (tree c, tree type)
4598 tree type_low_bound = TYPE_MIN_VALUE (type);
4599 tree type_high_bound = TYPE_MAX_VALUE (type);
4600 int ok_for_low_bound, ok_for_high_bound;
4602 /* Perform some generic filtering first, which may allow making a decision
4603 even if the bounds are not constant. First, negative integers never fit
4604 in unsigned types, */
4605 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4606 /* Also, unsigned integers with top bit set never fit signed types. */
4607 || (! TYPE_UNSIGNED (type)
4608 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4611 /* If at least one bound of the type is a constant integer, we can check
4612 ourselves and maybe make a decision. If no such decision is possible, but
4613 this type is a subtype, try checking against that. Otherwise, use
4614 force_fit_type, which checks against the precision.
4616 Compute the status for each possibly constant bound, and return if we see
4617 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4618 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4619 for "constant known to fit". */
4621 ok_for_low_bound = -1;
4622 ok_for_high_bound = -1;
4624 /* Check if C >= type_low_bound. */
4625 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4627 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4628 if (! ok_for_low_bound)
4632 /* Check if c <= type_high_bound. */
4633 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4635 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4636 if (! ok_for_high_bound)
4640 /* If the constant fits both bounds, the result is known. */
4641 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4644 /* If we haven't been able to decide at this point, there nothing more we
4645 can check ourselves here. Look at the base type if we have one. */
4646 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4647 return int_fits_type_p (c, TREE_TYPE (type));
4649 /* Or to force_fit_type, if nothing else. */
4653 TREE_TYPE (c) = type;
4654 return !force_fit_type (c, 0);
4658 /* Returns true if T is, contains, or refers to a type with variable
4659 size. This concept is more general than that of C99 'variably
4660 modified types': in C99, a struct type is never variably modified
4661 because a VLA may not appear as a structure member. However, in
4664 struct S { int i[f()]; };
4666 is valid, and other languages may define similar constructs. */
4669 variably_modified_type_p (tree type)
4673 if (type == error_mark_node)
4676 /* If TYPE itself has variable size, it is variably modified.
4678 We do not yet have a representation of the C99 '[*]' syntax.
4679 When a representation is chosen, this function should be modified
4680 to test for that case as well. */
4681 t = TYPE_SIZE (type);
4682 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4685 switch (TREE_CODE (type))
4688 case REFERENCE_TYPE:
4692 if (variably_modified_type_p (TREE_TYPE (type)))
4698 /* If TYPE is a function type, it is variably modified if any of the
4699 parameters or the return type are variably modified. */
4700 if (variably_modified_type_p (TREE_TYPE (type)))
4703 for (t = TYPE_ARG_TYPES (type);
4704 t && t != void_list_node;
4706 if (variably_modified_type_p (TREE_VALUE (t)))
4715 /* Scalar types are variably modified if their end points
4717 t = TYPE_MIN_VALUE (type);
4718 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4721 t = TYPE_MAX_VALUE (type);
4722 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4728 case QUAL_UNION_TYPE:
4729 /* We can't see if any of the field are variably-modified by the
4730 definition we normally use, since that would produce infinite
4731 recursion via pointers. */
4732 /* This is variably modified if some field's type is. */
4733 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
4734 if (TREE_CODE (t) == FIELD_DECL)
4736 tree t1 = DECL_FIELD_OFFSET (t);
4738 if (t1 && t1 != error_mark_node && TREE_CODE (t1) != INTEGER_CST)
4742 if (t1 && t1 != error_mark_node && TREE_CODE (t1) != INTEGER_CST)
4751 /* The current language may have other cases to check, but in general,
4752 all other types are not variably modified. */
4753 return lang_hooks.tree_inlining.var_mod_type_p (type);
4756 /* Given a DECL or TYPE, return the scope in which it was declared, or
4757 NULL_TREE if there is no containing scope. */
4760 get_containing_scope (tree t)
4762 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4765 /* Return the innermost context enclosing DECL that is
4766 a FUNCTION_DECL, or zero if none. */
4769 decl_function_context (tree decl)
4773 if (TREE_CODE (decl) == ERROR_MARK)
4776 if (TREE_CODE (decl) == SAVE_EXPR)
4777 context = SAVE_EXPR_CONTEXT (decl);
4779 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4780 where we look up the function at runtime. Such functions always take
4781 a first argument of type 'pointer to real context'.
4783 C++ should really be fixed to use DECL_CONTEXT for the real context,
4784 and use something else for the "virtual context". */
4785 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4788 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4790 context = DECL_CONTEXT (decl);
4792 while (context && TREE_CODE (context) != FUNCTION_DECL)
4794 if (TREE_CODE (context) == BLOCK)
4795 context = BLOCK_SUPERCONTEXT (context);
4797 context = get_containing_scope (context);
4803 /* Return the innermost context enclosing DECL that is
4804 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4805 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4808 decl_type_context (tree decl)
4810 tree context = DECL_CONTEXT (decl);
4813 switch (TREE_CODE (context))
4815 case NAMESPACE_DECL:
4816 case TRANSLATION_UNIT_DECL:
4821 case QUAL_UNION_TYPE:
4826 context = DECL_CONTEXT (context);
4830 context = BLOCK_SUPERCONTEXT (context);
4840 /* CALL is a CALL_EXPR. Return the declaration for the function
4841 called, or NULL_TREE if the called function cannot be
4845 get_callee_fndecl (tree call)
4849 /* It's invalid to call this function with anything but a
4851 if (TREE_CODE (call) != CALL_EXPR)
4854 /* The first operand to the CALL is the address of the function
4856 addr = TREE_OPERAND (call, 0);
4860 /* If this is a readonly function pointer, extract its initial value. */
4861 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4862 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4863 && DECL_INITIAL (addr))
4864 addr = DECL_INITIAL (addr);
4866 /* If the address is just `&f' for some function `f', then we know
4867 that `f' is being called. */
4868 if (TREE_CODE (addr) == ADDR_EXPR
4869 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4870 return TREE_OPERAND (addr, 0);
4872 /* We couldn't figure out what was being called. Maybe the front
4873 end has some idea. */
4874 return lang_hooks.lang_get_callee_fndecl (call);
4877 /* Print debugging information about tree nodes generated during the compile,
4878 and any language-specific information. */
4881 dump_tree_statistics (void)
4883 #ifdef GATHER_STATISTICS
4885 int total_nodes, total_bytes;
4888 fprintf (stderr, "\n??? tree nodes created\n\n");
4889 #ifdef GATHER_STATISTICS
4890 fprintf (stderr, "Kind Nodes Bytes\n");
4891 fprintf (stderr, "---------------------------------------\n");
4892 total_nodes = total_bytes = 0;
4893 for (i = 0; i < (int) all_kinds; i++)
4895 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
4896 tree_node_counts[i], tree_node_sizes[i]);
4897 total_nodes += tree_node_counts[i];
4898 total_bytes += tree_node_sizes[i];
4900 fprintf (stderr, "---------------------------------------\n");
4901 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
4902 fprintf (stderr, "---------------------------------------\n");
4903 ssanames_print_statistics ();
4904 phinodes_print_statistics ();
4906 fprintf (stderr, "(No per-node statistics)\n");
4908 print_type_hash_statistics ();
4909 lang_hooks.print_statistics ();
4912 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4914 /* Generate a crc32 of a string. */
4917 crc32_string (unsigned chksum, const char *string)
4921 unsigned value = *string << 24;
4924 for (ix = 8; ix--; value <<= 1)
4928 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
4937 /* P is a string that will be used in a symbol. Mask out any characters
4938 that are not valid in that context. */
4941 clean_symbol_name (char *p)
4945 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4948 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4955 /* Generate a name for a function unique to this translation unit.
4956 TYPE is some string to identify the purpose of this function to the
4957 linker or collect2. */
4960 get_file_function_name_long (const char *type)
4966 if (first_global_object_name)
4967 p = first_global_object_name;
4970 /* We don't have anything that we know to be unique to this translation
4971 unit, so use what we do have and throw in some randomness. */
4973 const char *name = weak_global_object_name;
4974 const char *file = main_input_filename;
4979 file = input_filename;
4981 len = strlen (file);
4982 q = alloca (9 * 2 + len + 1);
4983 memcpy (q, file, len + 1);
4984 clean_symbol_name (q);
4986 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
4987 crc32_string (0, flag_random_seed));
4992 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
4994 /* Set up the name of the file-level functions we may need.
4995 Use a global object (which is already required to be unique over
4996 the program) rather than the file name (which imposes extra
4998 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5000 return get_identifier (buf);
5003 /* If KIND=='I', return a suitable global initializer (constructor) name.
5004 If KIND=='D', return a suitable global clean-up (destructor) name. */
5007 get_file_function_name (int kind)
5014 return get_file_function_name_long (p);
5017 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5018 The result is placed in BUFFER (which has length BIT_SIZE),
5019 with one bit in each char ('\000' or '\001').
5021 If the constructor is constant, NULL_TREE is returned.
5022 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5025 get_set_constructor_bits (tree init, char *buffer, int bit_size)
5029 HOST_WIDE_INT domain_min
5030 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
5031 tree non_const_bits = NULL_TREE;
5033 for (i = 0; i < bit_size; i++)
5036 for (vals = TREE_OPERAND (init, 1);
5037 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5039 if (!host_integerp (TREE_VALUE (vals), 0)
5040 || (TREE_PURPOSE (vals) != NULL_TREE
5041 && !host_integerp (TREE_PURPOSE (vals), 0)))
5043 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5044 else if (TREE_PURPOSE (vals) != NULL_TREE)
5046 /* Set a range of bits to ones. */
5047 HOST_WIDE_INT lo_index
5048 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
5049 HOST_WIDE_INT hi_index
5050 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5052 if (lo_index < 0 || lo_index >= bit_size
5053 || hi_index < 0 || hi_index >= bit_size)
5055 for (; lo_index <= hi_index; lo_index++)
5056 buffer[lo_index] = 1;
5060 /* Set a single bit to one. */
5062 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5063 if (index < 0 || index >= bit_size)
5065 error ("invalid initializer for bit string");
5071 return non_const_bits;
5074 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5075 The result is placed in BUFFER (which is an array of bytes).
5076 If the constructor is constant, NULL_TREE is returned.
5077 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5080 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
5083 int set_word_size = BITS_PER_UNIT;
5084 int bit_size = wd_size * set_word_size;
5086 unsigned char *bytep = buffer;
5087 char *bit_buffer = alloca (bit_size);
5088 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5090 for (i = 0; i < wd_size; i++)
5093 for (i = 0; i < bit_size; i++)
5097 if (BYTES_BIG_ENDIAN)
5098 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5100 *bytep |= 1 << bit_pos;
5103 if (bit_pos >= set_word_size)
5104 bit_pos = 0, bytep++;
5106 return non_const_bits;
5109 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5111 /* Complain that the tree code of NODE does not match the expected CODE.
5112 FILE, LINE, and FUNCTION are of the caller. */
5115 tree_check_failed (const tree node, enum tree_code code, const char *file,
5116 int line, const char *function)
5118 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5119 tree_code_name[code], tree_code_name[TREE_CODE (node)],
5120 function, trim_filename (file), line);
5123 /* Similar to above except that we allowed the code to be one of two
5127 tree_check2_failed (const tree node, enum tree_code code1,
5128 enum tree_code code2, const char *file,
5129 int line, const char *function)
5131 internal_error ("tree check: expected %s or %s, have %s in %s, at %s:%d",
5132 tree_code_name[code1], tree_code_name[code2],
5133 tree_code_name[TREE_CODE (node)],
5134 function, trim_filename (file), line);
5137 /* Likewise for three different codes. */
5140 tree_check3_failed (const tree node, enum tree_code code1,
5141 enum tree_code code2, enum tree_code code3,
5142 const char *file, int line, const char *function)
5144 internal_error ("tree check: expected %s, %s or %s; have %s in %s, at %s:%d",
5145 tree_code_name[code1], tree_code_name[code2],
5146 tree_code_name[code3], tree_code_name[TREE_CODE (node)],
5147 function, trim_filename (file), line);
5150 /* ... and for four different codes. */
5153 tree_check4_failed (const tree node, enum tree_code code1,
5154 enum tree_code code2, enum tree_code code3,
5155 enum tree_code code4, const char *file, int line,
5156 const char *function)
5159 ("tree check: expected %s, %s, %s or %s; have %s in %s, at %s:%d",
5160 tree_code_name[code1], tree_code_name[code2], tree_code_name[code3],
5161 tree_code_name[code4], tree_code_name[TREE_CODE (node)], function,
5162 trim_filename (file), line);
5165 /* ... and for five different codes. */
5168 tree_check5_failed (const tree node, enum tree_code code1,
5169 enum tree_code code2, enum tree_code code3,
5170 enum tree_code code4, enum tree_code code5,
5171 const char *file, int line, const char *function)
5174 ("tree check: expected %s, %s, %s, %s or %s; have %s in %s, at %s:%d",
5175 tree_code_name[code1], tree_code_name[code2], tree_code_name[code3],
5176 tree_code_name[code4], tree_code_name[code5],
5177 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5180 /* Similar to tree_check_failed, except that we check for a class of tree
5181 code, given in CL. */
5184 tree_class_check_failed (const tree node, int cl, const char *file,
5185 int line, const char *function)
5188 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5189 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5190 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5193 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5194 (dynamically sized) vector. */
5197 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5198 const char *function)
5201 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5202 idx + 1, len, function, trim_filename (file), line);
5205 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5206 (dynamically sized) vector. */
5209 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5210 const char *function)
5213 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5214 idx + 1, len, function, trim_filename (file), line);
5217 /* Similar to above, except that the check is for the bounds of the operand
5218 vector of an expression node. */
5221 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5222 int line, const char *function)
5225 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5226 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5227 function, trim_filename (file), line);
5229 #endif /* ENABLE_TREE_CHECKING */
5231 /* For a new vector type node T, build the information necessary for
5232 debugging output. */
5235 finish_vector_type (tree t)
5240 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
5241 tree array = build_array_type (TREE_TYPE (t),
5242 build_index_type (index));
5243 tree rt = make_node (RECORD_TYPE);
5245 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5246 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5248 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5249 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5250 the representation type, and we want to find that die when looking up
5251 the vector type. This is most easily achieved by making the TYPE_UID
5253 TYPE_UID (rt) = TYPE_UID (t);
5258 make_or_reuse_type (unsigned size, int unsignedp)
5260 if (size == INT_TYPE_SIZE)
5261 return unsignedp ? unsigned_type_node : integer_type_node;
5262 if (size == CHAR_TYPE_SIZE)
5263 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5264 if (size == SHORT_TYPE_SIZE)
5265 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5266 if (size == LONG_TYPE_SIZE)
5267 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5268 if (size == LONG_LONG_TYPE_SIZE)
5269 return (unsignedp ? long_long_unsigned_type_node
5270 : long_long_integer_type_node);
5273 return make_unsigned_type (size);
5275 return make_signed_type (size);
5278 /* Create nodes for all integer types (and error_mark_node) using the sizes
5279 of C datatypes. The caller should call set_sizetype soon after calling
5280 this function to select one of the types as sizetype. */
5283 build_common_tree_nodes (int signed_char)
5285 error_mark_node = make_node (ERROR_MARK);
5286 TREE_TYPE (error_mark_node) = error_mark_node;
5288 initialize_sizetypes ();
5290 /* Define both `signed char' and `unsigned char'. */
5291 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5292 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5294 /* Define `char', which is like either `signed char' or `unsigned char'
5295 but not the same as either. */
5298 ? make_signed_type (CHAR_TYPE_SIZE)
5299 : make_unsigned_type (CHAR_TYPE_SIZE));
5301 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5302 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5303 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5304 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5305 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5306 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5307 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5308 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5310 /* Define a boolean type. This type only represents boolean values but
5311 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5312 Front ends which want to override this size (i.e. Java) can redefine
5313 boolean_type_node before calling build_common_tree_nodes_2. */
5314 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5315 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5316 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
5317 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
5318 TYPE_PRECISION (boolean_type_node) = 1;
5320 /* Fill in the rest of the sized types. Reuse existing type nodes
5322 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
5323 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
5324 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
5325 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
5326 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
5328 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
5329 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
5330 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
5331 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
5332 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
5334 access_public_node = get_identifier ("public");
5335 access_protected_node = get_identifier ("protected");
5336 access_private_node = get_identifier ("private");
5339 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5340 It will create several other common tree nodes. */
5343 build_common_tree_nodes_2 (int short_double)
5345 /* Define these next since types below may used them. */
5346 integer_zero_node = build_int_2 (0, 0);
5347 integer_one_node = build_int_2 (1, 0);
5348 integer_minus_one_node = build_int_2 (-1, -1);
5350 size_zero_node = size_int (0);
5351 size_one_node = size_int (1);
5352 bitsize_zero_node = bitsize_int (0);
5353 bitsize_one_node = bitsize_int (1);
5354 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5356 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5357 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5359 void_type_node = make_node (VOID_TYPE);
5360 layout_type (void_type_node);
5362 /* We are not going to have real types in C with less than byte alignment,
5363 so we might as well not have any types that claim to have it. */
5364 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5365 TYPE_USER_ALIGN (void_type_node) = 0;
5367 null_pointer_node = build_int_2 (0, 0);
5368 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5369 layout_type (TREE_TYPE (null_pointer_node));
5371 ptr_type_node = build_pointer_type (void_type_node);
5373 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5374 fileptr_type_node = ptr_type_node;
5376 float_type_node = make_node (REAL_TYPE);
5377 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5378 layout_type (float_type_node);
5380 double_type_node = make_node (REAL_TYPE);
5382 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5384 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5385 layout_type (double_type_node);
5387 long_double_type_node = make_node (REAL_TYPE);
5388 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5389 layout_type (long_double_type_node);
5391 float_ptr_type_node = build_pointer_type (float_type_node);
5392 double_ptr_type_node = build_pointer_type (double_type_node);
5393 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5394 integer_ptr_type_node = build_pointer_type (integer_type_node);
5396 complex_integer_type_node = make_node (COMPLEX_TYPE);
5397 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5398 layout_type (complex_integer_type_node);
5400 complex_float_type_node = make_node (COMPLEX_TYPE);
5401 TREE_TYPE (complex_float_type_node) = float_type_node;
5402 layout_type (complex_float_type_node);
5404 complex_double_type_node = make_node (COMPLEX_TYPE);
5405 TREE_TYPE (complex_double_type_node) = double_type_node;
5406 layout_type (complex_double_type_node);
5408 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5409 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5410 layout_type (complex_long_double_type_node);
5413 tree t = targetm.build_builtin_va_list ();
5415 /* Many back-ends define record types without setting TYPE_NAME.
5416 If we copied the record type here, we'd keep the original
5417 record type without a name. This breaks name mangling. So,
5418 don't copy record types and let c_common_nodes_and_builtins()
5419 declare the type to be __builtin_va_list. */
5420 if (TREE_CODE (t) != RECORD_TYPE)
5421 t = build_type_copy (t);
5423 va_list_type_node = t;
5427 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5430 If we requested a pointer to a vector, build up the pointers that
5431 we stripped off while looking for the inner type. Similarly for
5432 return values from functions.
5434 The argument TYPE is the top of the chain, and BOTTOM is the
5435 new type which we will point to. */
5438 reconstruct_complex_type (tree type, tree bottom)
5442 if (POINTER_TYPE_P (type))
5444 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5445 outer = build_pointer_type (inner);
5447 else if (TREE_CODE (type) == ARRAY_TYPE)
5449 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5450 outer = build_array_type (inner, TYPE_DOMAIN (type));
5452 else if (TREE_CODE (type) == FUNCTION_TYPE)
5454 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5455 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5457 else if (TREE_CODE (type) == METHOD_TYPE)
5459 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5460 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5462 TYPE_ARG_TYPES (type));
5467 TYPE_READONLY (outer) = TYPE_READONLY (type);
5468 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
5473 /* Returns a vector tree node given a vector mode and inner type. */
5475 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5478 t = make_node (VECTOR_TYPE);
5479 TREE_TYPE (t) = innertype;
5480 TYPE_MODE (t) = mode;
5481 finish_vector_type (t);
5485 /* Similarly, but takes inner type and units. */
5488 build_vector_type (tree innertype, int nunits)
5490 enum machine_mode innermode = TYPE_MODE (innertype);
5491 enum machine_mode mode;
5493 if (GET_MODE_CLASS (innermode) == MODE_FLOAT)
5494 mode = MIN_MODE_VECTOR_FLOAT;
5496 mode = MIN_MODE_VECTOR_INT;
5498 for (; mode != VOIDmode ; mode = GET_MODE_WIDER_MODE (mode))
5499 if (GET_MODE_NUNITS (mode) == nunits && GET_MODE_INNER (mode) == innermode)
5500 return build_vector_type_for_mode (innertype, mode);
5505 /* Given an initializer INIT, return TRUE if INIT is zero or some
5506 aggregate of zeros. Otherwise return FALSE. */
5508 initializer_zerop (tree init)
5514 switch (TREE_CODE (init))
5517 return integer_zerop (init);
5520 /* ??? Note that this is not correct for C4X float formats. There,
5521 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5522 negative exponent. */
5523 return real_zerop (init)
5524 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5527 return integer_zerop (init)
5528 || (real_zerop (init)
5529 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5530 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5533 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
5534 if (!initializer_zerop (TREE_VALUE (elt)))
5539 elt = CONSTRUCTOR_ELTS (init);
5540 if (elt == NULL_TREE)
5543 /* A set is empty only if it has no elements. */
5544 if (TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5547 for (; elt ; elt = TREE_CHAIN (elt))
5548 if (! initializer_zerop (TREE_VALUE (elt)))
5558 add_var_to_bind_expr (tree bind_expr, tree var)
5560 BIND_EXPR_VARS (bind_expr)
5561 = chainon (BIND_EXPR_VARS (bind_expr), var);
5562 if (BIND_EXPR_BLOCK (bind_expr))
5563 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
5564 = BIND_EXPR_VARS (bind_expr);
5567 /* Build an empty statement. */
5570 build_empty_stmt (void)
5572 return build1 (NOP_EXPR, void_type_node, size_zero_node);
5576 /* Return true if T (assumed to be a DECL) must be assigned a memory
5580 needs_to_live_in_memory (tree t)
5582 return (DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL (t)
5584 || DECL_EXTERNAL (t)
5585 || DECL_NONLOCAL (t)
5586 || (TREE_CODE (t) == RESULT_DECL
5587 && aggregate_value_p (t, current_function_decl))
5588 || decl_function_context (t) != current_function_decl);
5591 #include "gt-tree.h"