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));
1863 /* This general rule works for most tree codes. All exceptions should be
1864 handled above. If this is a language-specific tree code, we can't
1865 trust what might be in the operand, so say we don't know
1867 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1870 nops = first_rtl_op (TREE_CODE (exp));
1871 for (i = 0; i < nops; i++)
1872 if (TREE_OPERAND (exp, i) != 0)
1874 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1875 if (type == 'e' || type == '<' || type == '1' || type == '2'
1876 || type == 'r' || type == 's')
1878 cmp = has_cleanups (TREE_OPERAND (exp, i));
1887 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1888 return a tree with all occurrences of references to F in a
1889 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1890 contains only arithmetic expressions or a CALL_EXPR with a
1891 PLACEHOLDER_EXPR occurring only in its arglist. */
1894 substitute_in_expr (tree exp, tree f, tree r)
1896 enum tree_code code = TREE_CODE (exp);
1901 /* We handle TREE_LIST and COMPONENT_REF separately. */
1902 if (code == TREE_LIST)
1904 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1905 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1906 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1909 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1911 else if (code == COMPONENT_REF)
1913 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1914 and it is the right field, replace it with R. */
1915 for (inner = TREE_OPERAND (exp, 0);
1916 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1917 inner = TREE_OPERAND (inner, 0))
1919 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1920 && TREE_OPERAND (exp, 1) == f)
1923 /* If this expression hasn't been completed let, leave it
1925 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1928 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1929 if (op0 == TREE_OPERAND (exp, 0))
1932 new = fold (build (code, TREE_TYPE (exp), op0, TREE_OPERAND (exp, 1),
1936 switch (TREE_CODE_CLASS (code))
1948 switch (first_rtl_op (code))
1954 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1955 if (op0 == TREE_OPERAND (exp, 0))
1958 new = fold (build1 (code, TREE_TYPE (exp), op0));
1962 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1963 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1965 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1968 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
1972 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1973 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1974 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
1976 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1977 && op2 == TREE_OPERAND (exp, 2))
1980 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
1992 TREE_READONLY (new) = TREE_READONLY (exp);
1996 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1997 for it within OBJ, a tree that is an object or a chain of references. */
2000 substitute_placeholder_in_expr (tree exp, tree obj)
2002 enum tree_code code = TREE_CODE (exp);
2003 tree op0, op1, op2, op3;
2005 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2006 in the chain of OBJ. */
2007 if (code == PLACEHOLDER_EXPR)
2009 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
2012 for (elt = obj; elt != 0;
2013 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2014 || TREE_CODE (elt) == COND_EXPR)
2015 ? TREE_OPERAND (elt, 1)
2016 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2017 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2018 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2019 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2020 ? TREE_OPERAND (elt, 0) : 0))
2021 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2024 for (elt = obj; elt != 0;
2025 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2026 || TREE_CODE (elt) == COND_EXPR)
2027 ? TREE_OPERAND (elt, 1)
2028 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2029 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2030 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2031 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2032 ? TREE_OPERAND (elt, 0) : 0))
2033 if (POINTER_TYPE_P (TREE_TYPE (elt))
2034 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2036 return fold (build1 (INDIRECT_REF, need_type, elt));
2038 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2039 survives until RTL generation, there will be an error. */
2043 /* TREE_LIST is special because we need to look at TREE_VALUE
2044 and TREE_CHAIN, not TREE_OPERANDS. */
2045 else if (code == TREE_LIST)
2047 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2048 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2049 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2052 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2055 switch (TREE_CODE_CLASS (code))
2068 switch (first_rtl_op (code))
2074 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2075 if (op0 == TREE_OPERAND (exp, 0))
2078 return fold (build1 (code, TREE_TYPE (exp), op0));
2081 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2082 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2084 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2087 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2090 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2091 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2092 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2094 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2095 && op2 == TREE_OPERAND (exp, 2))
2098 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2101 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2102 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2103 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2104 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2106 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2107 && op2 == TREE_OPERAND (exp, 2)
2108 && op3 == TREE_OPERAND (exp, 3))
2111 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2123 /* Stabilize a reference so that we can use it any number of times
2124 without causing its operands to be evaluated more than once.
2125 Returns the stabilized reference. This works by means of save_expr,
2126 so see the caveats in the comments about save_expr.
2128 Also allows conversion expressions whose operands are references.
2129 Any other kind of expression is returned unchanged. */
2132 stabilize_reference (tree ref)
2135 enum tree_code code = TREE_CODE (ref);
2142 /* No action is needed in this case. */
2148 case FIX_TRUNC_EXPR:
2149 case FIX_FLOOR_EXPR:
2150 case FIX_ROUND_EXPR:
2152 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2156 result = build_nt (INDIRECT_REF,
2157 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2161 result = build_nt (COMPONENT_REF,
2162 stabilize_reference (TREE_OPERAND (ref, 0)),
2163 TREE_OPERAND (ref, 1), NULL_TREE);
2167 result = build_nt (BIT_FIELD_REF,
2168 stabilize_reference (TREE_OPERAND (ref, 0)),
2169 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2170 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2174 result = build_nt (ARRAY_REF,
2175 stabilize_reference (TREE_OPERAND (ref, 0)),
2176 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2177 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2180 case ARRAY_RANGE_REF:
2181 result = build_nt (ARRAY_RANGE_REF,
2182 stabilize_reference (TREE_OPERAND (ref, 0)),
2183 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2184 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2188 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2189 it wouldn't be ignored. This matters when dealing with
2191 return stabilize_reference_1 (ref);
2194 result = build1 (INDIRECT_REF, TREE_TYPE (ref),
2195 save_expr (build1 (ADDR_EXPR,
2196 build_pointer_type (TREE_TYPE (ref)),
2200 /* If arg isn't a kind of lvalue we recognize, make no change.
2201 Caller should recognize the error for an invalid lvalue. */
2206 return error_mark_node;
2209 TREE_TYPE (result) = TREE_TYPE (ref);
2210 TREE_READONLY (result) = TREE_READONLY (ref);
2211 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2212 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2217 /* Subroutine of stabilize_reference; this is called for subtrees of
2218 references. Any expression with side-effects must be put in a SAVE_EXPR
2219 to ensure that it is only evaluated once.
2221 We don't put SAVE_EXPR nodes around everything, because assigning very
2222 simple expressions to temporaries causes us to miss good opportunities
2223 for optimizations. Among other things, the opportunity to fold in the
2224 addition of a constant into an addressing mode often gets lost, e.g.
2225 "y[i+1] += x;". In general, we take the approach that we should not make
2226 an assignment unless we are forced into it - i.e., that any non-side effect
2227 operator should be allowed, and that cse should take care of coalescing
2228 multiple utterances of the same expression should that prove fruitful. */
2231 stabilize_reference_1 (tree e)
2234 enum tree_code code = TREE_CODE (e);
2236 /* We cannot ignore const expressions because it might be a reference
2237 to a const array but whose index contains side-effects. But we can
2238 ignore things that are actual constant or that already have been
2239 handled by this function. */
2241 if (TREE_INVARIANT (e))
2244 switch (TREE_CODE_CLASS (code))
2253 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2254 so that it will only be evaluated once. */
2255 /* The reference (r) and comparison (<) classes could be handled as
2256 below, but it is generally faster to only evaluate them once. */
2257 if (TREE_SIDE_EFFECTS (e))
2258 return save_expr (e);
2262 /* Constants need no processing. In fact, we should never reach
2267 /* Division is slow and tends to be compiled with jumps,
2268 especially the division by powers of 2 that is often
2269 found inside of an array reference. So do it just once. */
2270 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2271 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2272 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2273 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2274 return save_expr (e);
2275 /* Recursively stabilize each operand. */
2276 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2277 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2281 /* Recursively stabilize each operand. */
2282 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2289 TREE_TYPE (result) = TREE_TYPE (e);
2290 TREE_READONLY (result) = TREE_READONLY (e);
2291 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2292 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2293 TREE_INVARIANT (result) = 1;
2298 /* Low-level constructors for expressions. */
2300 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2301 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2304 recompute_tree_invarant_for_addr_expr (tree t)
2307 bool tc = true, ti = true, se = false;
2309 /* We started out assuming this address is both invariant and constant, but
2310 does not have side effects. Now go down any handled components and see if
2311 any of them involve offsets that are either non-constant or non-invariant.
2312 Also check for side-effects.
2314 ??? Note that this code makes no attempt to deal with the case where
2315 taking the address of something causes a copy due to misalignment. */
2317 #define UPDATE_TITCSE(NODE) \
2318 do { tree _node = (NODE); \
2319 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2320 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2321 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2323 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2324 node = TREE_OPERAND (node, 0))
2326 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2327 array reference (probably made temporarily by the G++ front end),
2328 so ignore all the operands. */
2329 if ((TREE_CODE (node) == ARRAY_REF
2330 || TREE_CODE (node) == ARRAY_RANGE_REF)
2331 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2333 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2334 UPDATE_TITCSE (array_ref_low_bound (node));
2335 UPDATE_TITCSE (array_ref_element_size (node));
2337 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2338 FIELD_DECL, apparently. The G++ front end can put something else
2339 there, at least temporarily. */
2340 else if (TREE_CODE (node) == COMPONENT_REF
2341 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2342 UPDATE_TITCSE (component_ref_field_offset (node));
2343 else if (TREE_CODE (node) == BIT_FIELD_REF)
2344 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2347 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2348 it. If it's a decl, it's definitely invariant and it's constant if the
2349 decl is static. (Taking the address of a volatile variable is not
2350 volatile.) If it's a constant, the address is both invariant and
2351 constant. Otherwise it's neither. */
2352 if (TREE_CODE (node) == INDIRECT_REF)
2353 UPDATE_TITCSE (node);
2354 else if (DECL_P (node))
2356 if (!staticp (node))
2359 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 'c')
2364 se |= TREE_SIDE_EFFECTS (node);
2367 TREE_CONSTANT (t) = tc;
2368 TREE_INVARIANT (t) = ti;
2369 TREE_SIDE_EFFECTS (t) = se;
2370 #undef UPDATE_TITCSE
2373 /* Build an expression of code CODE, data type TYPE, and operands as
2374 specified. Expressions and reference nodes can be created this way.
2375 Constants, decls, types and misc nodes cannot be.
2377 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2378 enough for all extant tree codes. These functions can be called
2379 directly (preferably!), but can also be obtained via GCC preprocessor
2380 magic within the build macro. */
2383 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2387 #ifdef ENABLE_CHECKING
2388 if (TREE_CODE_LENGTH (code) != 0)
2392 t = make_node_stat (code PASS_MEM_STAT);
2399 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2401 int length = sizeof (struct tree_exp);
2402 #ifdef GATHER_STATISTICS
2403 tree_node_kind kind;
2407 #ifdef GATHER_STATISTICS
2408 switch (TREE_CODE_CLASS (code))
2410 case 's': /* an expression with side effects */
2413 case 'r': /* a reference */
2421 tree_node_counts[(int) kind]++;
2422 tree_node_sizes[(int) kind] += length;
2425 #ifdef ENABLE_CHECKING
2426 if (TREE_CODE_LENGTH (code) != 1)
2428 #endif /* ENABLE_CHECKING */
2430 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2432 memset (t, 0, sizeof (struct tree_common));
2434 TREE_SET_CODE (t, code);
2436 TREE_TYPE (t) = type;
2437 SET_EXPR_LOCUS (t, NULL);
2438 TREE_COMPLEXITY (t) = 0;
2439 TREE_OPERAND (t, 0) = node;
2440 TREE_BLOCK (t) = NULL_TREE;
2441 if (node && !TYPE_P (node) && first_rtl_op (code) != 0)
2443 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2444 TREE_READONLY (t) = TREE_READONLY (node);
2447 if (TREE_CODE_CLASS (code) == 's')
2448 TREE_SIDE_EFFECTS (t) = 1;
2455 case PREDECREMENT_EXPR:
2456 case PREINCREMENT_EXPR:
2457 case POSTDECREMENT_EXPR:
2458 case POSTINCREMENT_EXPR:
2459 /* All of these have side-effects, no matter what their
2461 TREE_SIDE_EFFECTS (t) = 1;
2462 TREE_READONLY (t) = 0;
2466 /* Whether a dereference is readonly has nothing to do with whether
2467 its operand is readonly. */
2468 TREE_READONLY (t) = 0;
2473 recompute_tree_invarant_for_addr_expr (t);
2477 if (TREE_CODE_CLASS (code) == '1' && node && !TYPE_P (node)
2478 && TREE_CONSTANT (node))
2479 TREE_CONSTANT (t) = 1;
2480 if (TREE_CODE_CLASS (code) == '1' && node && TREE_INVARIANT (node))
2481 TREE_INVARIANT (t) = 1;
2488 #define PROCESS_ARG(N) \
2490 TREE_OPERAND (t, N) = arg##N; \
2491 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2493 if (TREE_SIDE_EFFECTS (arg##N)) \
2495 if (!TREE_READONLY (arg##N)) \
2497 if (!TREE_CONSTANT (arg##N)) \
2499 if (!TREE_INVARIANT (arg##N)) \
2505 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2507 bool constant, read_only, side_effects, invariant;
2511 #ifdef ENABLE_CHECKING
2512 if (TREE_CODE_LENGTH (code) != 2)
2516 t = make_node_stat (code PASS_MEM_STAT);
2519 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2520 result based on those same flags for the arguments. But if the
2521 arguments aren't really even `tree' expressions, we shouldn't be trying
2523 fro = first_rtl_op (code);
2525 /* Expressions without side effects may be constant if their
2526 arguments are as well. */
2527 constant = (TREE_CODE_CLASS (code) == '<'
2528 || TREE_CODE_CLASS (code) == '2');
2530 side_effects = TREE_SIDE_EFFECTS (t);
2531 invariant = constant;
2536 TREE_READONLY (t) = read_only;
2537 TREE_CONSTANT (t) = constant;
2538 TREE_INVARIANT (t) = invariant;
2539 TREE_SIDE_EFFECTS (t) = side_effects;
2540 TREE_THIS_VOLATILE (t)
2541 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2547 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2548 tree arg2 MEM_STAT_DECL)
2550 bool constant, read_only, side_effects, invariant;
2554 #ifdef ENABLE_CHECKING
2555 if (TREE_CODE_LENGTH (code) != 3)
2559 t = make_node_stat (code PASS_MEM_STAT);
2562 fro = first_rtl_op (code);
2564 side_effects = TREE_SIDE_EFFECTS (t);
2570 if (code == CALL_EXPR && !side_effects)
2575 /* Calls have side-effects, except those to const or
2577 i = call_expr_flags (t);
2578 if (!(i & (ECF_CONST | ECF_PURE)))
2581 /* And even those have side-effects if their arguments do. */
2582 else for (node = arg1; node; node = TREE_CHAIN (node))
2583 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2590 TREE_SIDE_EFFECTS (t) = side_effects;
2591 TREE_THIS_VOLATILE (t)
2592 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2598 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2599 tree arg2, tree arg3 MEM_STAT_DECL)
2601 bool constant, read_only, side_effects, invariant;
2605 #ifdef ENABLE_CHECKING
2606 if (TREE_CODE_LENGTH (code) != 4)
2610 t = make_node_stat (code PASS_MEM_STAT);
2613 fro = first_rtl_op (code);
2615 side_effects = TREE_SIDE_EFFECTS (t);
2622 TREE_SIDE_EFFECTS (t) = side_effects;
2623 TREE_THIS_VOLATILE (t)
2624 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2629 /* Backup definition for non-gcc build compilers. */
2632 (build) (enum tree_code code, tree tt, ...)
2634 tree t, arg0, arg1, arg2, arg3;
2635 int length = TREE_CODE_LENGTH (code);
2642 t = build0 (code, tt);
2645 arg0 = va_arg (p, tree);
2646 t = build1 (code, tt, arg0);
2649 arg0 = va_arg (p, tree);
2650 arg1 = va_arg (p, tree);
2651 t = build2 (code, tt, arg0, arg1);
2654 arg0 = va_arg (p, tree);
2655 arg1 = va_arg (p, tree);
2656 arg2 = va_arg (p, tree);
2657 t = build3 (code, tt, arg0, arg1, arg2);
2660 arg0 = va_arg (p, tree);
2661 arg1 = va_arg (p, tree);
2662 arg2 = va_arg (p, tree);
2663 arg3 = va_arg (p, tree);
2664 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2674 /* Similar except don't specify the TREE_TYPE
2675 and leave the TREE_SIDE_EFFECTS as 0.
2676 It is permissible for arguments to be null,
2677 or even garbage if their values do not matter. */
2680 build_nt (enum tree_code code, ...)
2689 t = make_node (code);
2690 length = TREE_CODE_LENGTH (code);
2692 for (i = 0; i < length; i++)
2693 TREE_OPERAND (t, i) = va_arg (p, tree);
2699 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2700 We do NOT enter this node in any sort of symbol table.
2702 layout_decl is used to set up the decl's storage layout.
2703 Other slots are initialized to 0 or null pointers. */
2706 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2710 t = make_node_stat (code PASS_MEM_STAT);
2712 /* if (type == error_mark_node)
2713 type = integer_type_node; */
2714 /* That is not done, deliberately, so that having error_mark_node
2715 as the type can suppress useless errors in the use of this variable. */
2717 DECL_NAME (t) = name;
2718 TREE_TYPE (t) = type;
2720 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2722 else if (code == FUNCTION_DECL)
2723 DECL_MODE (t) = FUNCTION_MODE;
2728 /* BLOCK nodes are used to represent the structure of binding contours
2729 and declarations, once those contours have been exited and their contents
2730 compiled. This information is used for outputting debugging info. */
2733 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2734 tree supercontext, tree chain)
2736 tree block = make_node (BLOCK);
2738 BLOCK_VARS (block) = vars;
2739 BLOCK_SUBBLOCKS (block) = subblocks;
2740 BLOCK_SUPERCONTEXT (block) = supercontext;
2741 BLOCK_CHAIN (block) = chain;
2745 static GTY(()) tree last_annotated_node;
2747 /* Record the exact location where an expression or an identifier were
2751 annotate_with_file_line (tree node, const char *file, int line)
2753 /* Roughly one percent of the calls to this function are to annotate
2754 a node with the same information already attached to that node!
2755 Just return instead of wasting memory. */
2756 if (EXPR_LOCUS (node)
2757 && (EXPR_FILENAME (node) == file
2758 || ! strcmp (EXPR_FILENAME (node), file))
2759 && EXPR_LINENO (node) == line)
2761 last_annotated_node = node;
2765 /* In heavily macroized code (such as GCC itself) this single
2766 entry cache can reduce the number of allocations by more
2768 if (last_annotated_node
2769 && EXPR_LOCUS (last_annotated_node)
2770 && (EXPR_FILENAME (last_annotated_node) == file
2771 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
2772 && EXPR_LINENO (last_annotated_node) == line)
2774 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
2778 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
2779 EXPR_LINENO (node) = line;
2780 EXPR_FILENAME (node) = file;
2781 last_annotated_node = node;
2785 annotate_with_locus (tree node, location_t locus)
2787 annotate_with_file_line (node, locus.file, locus.line);
2790 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2794 build_decl_attribute_variant (tree ddecl, tree attribute)
2796 DECL_ATTRIBUTES (ddecl) = attribute;
2800 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2803 Record such modified types already made so we don't make duplicates. */
2806 build_type_attribute_variant (tree ttype, tree attribute)
2808 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2810 hashval_t hashcode = 0;
2812 enum tree_code code = TREE_CODE (ttype);
2814 ntype = copy_node (ttype);
2816 TYPE_POINTER_TO (ntype) = 0;
2817 TYPE_REFERENCE_TO (ntype) = 0;
2818 TYPE_ATTRIBUTES (ntype) = attribute;
2820 /* Create a new main variant of TYPE. */
2821 TYPE_MAIN_VARIANT (ntype) = ntype;
2822 TYPE_NEXT_VARIANT (ntype) = 0;
2823 set_type_quals (ntype, TYPE_UNQUALIFIED);
2825 hashcode = iterative_hash_object (code, hashcode);
2826 if (TREE_TYPE (ntype))
2827 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2829 hashcode = attribute_hash_list (attribute, hashcode);
2831 switch (TREE_CODE (ntype))
2834 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2837 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2841 hashcode = iterative_hash_object
2842 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2843 hashcode = iterative_hash_object
2844 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2848 unsigned int precision = TYPE_PRECISION (ntype);
2849 hashcode = iterative_hash_object (precision, hashcode);
2856 ntype = type_hash_canon (hashcode, ntype);
2857 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2863 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2866 We try both `text' and `__text__', ATTR may be either one. */
2867 /* ??? It might be a reasonable simplification to require ATTR to be only
2868 `text'. One might then also require attribute lists to be stored in
2869 their canonicalized form. */
2872 is_attribute_p (const char *attr, tree ident)
2874 int ident_len, attr_len;
2877 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2880 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2883 p = IDENTIFIER_POINTER (ident);
2884 ident_len = strlen (p);
2885 attr_len = strlen (attr);
2887 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2891 || attr[attr_len - 2] != '_'
2892 || attr[attr_len - 1] != '_')
2894 if (ident_len == attr_len - 4
2895 && strncmp (attr + 2, p, attr_len - 4) == 0)
2900 if (ident_len == attr_len + 4
2901 && p[0] == '_' && p[1] == '_'
2902 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2903 && strncmp (attr, p + 2, attr_len) == 0)
2910 /* Given an attribute name and a list of attributes, return a pointer to the
2911 attribute's list element if the attribute is part of the list, or NULL_TREE
2912 if not found. If the attribute appears more than once, this only
2913 returns the first occurrence; the TREE_CHAIN of the return value should
2914 be passed back in if further occurrences are wanted. */
2917 lookup_attribute (const char *attr_name, tree list)
2921 for (l = list; l; l = TREE_CHAIN (l))
2923 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2925 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2932 /* Return an attribute list that is the union of a1 and a2. */
2935 merge_attributes (tree a1, tree a2)
2939 /* Either one unset? Take the set one. */
2941 if ((attributes = a1) == 0)
2944 /* One that completely contains the other? Take it. */
2946 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2948 if (attribute_list_contained (a2, a1))
2952 /* Pick the longest list, and hang on the other list. */
2954 if (list_length (a1) < list_length (a2))
2955 attributes = a2, a2 = a1;
2957 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2960 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2963 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2966 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2971 a1 = copy_node (a2);
2972 TREE_CHAIN (a1) = attributes;
2981 /* Given types T1 and T2, merge their attributes and return
2985 merge_type_attributes (tree t1, tree t2)
2987 return merge_attributes (TYPE_ATTRIBUTES (t1),
2988 TYPE_ATTRIBUTES (t2));
2991 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2995 merge_decl_attributes (tree olddecl, tree newdecl)
2997 return merge_attributes (DECL_ATTRIBUTES (olddecl),
2998 DECL_ATTRIBUTES (newdecl));
3001 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
3003 /* Specialization of merge_decl_attributes for various Windows targets.
3005 This handles the following situation:
3007 __declspec (dllimport) int foo;
3010 The second instance of `foo' nullifies the dllimport. */
3013 merge_dllimport_decl_attributes (tree old, tree new)
3016 int delete_dllimport_p;
3018 old = DECL_ATTRIBUTES (old);
3019 new = DECL_ATTRIBUTES (new);
3021 /* What we need to do here is remove from `old' dllimport if it doesn't
3022 appear in `new'. dllimport behaves like extern: if a declaration is
3023 marked dllimport and a definition appears later, then the object
3024 is not dllimport'd. */
3025 if (lookup_attribute ("dllimport", old) != NULL_TREE
3026 && lookup_attribute ("dllimport", new) == NULL_TREE)
3027 delete_dllimport_p = 1;
3029 delete_dllimport_p = 0;
3031 a = merge_attributes (old, new);
3033 if (delete_dllimport_p)
3037 /* Scan the list for dllimport and delete it. */
3038 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3040 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3042 if (prev == NULL_TREE)
3045 TREE_CHAIN (prev) = TREE_CHAIN (t);
3054 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3056 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3057 of the various TYPE_QUAL values. */
3060 set_type_quals (tree type, int type_quals)
3062 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3063 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3064 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3067 /* Returns true iff cand is equivalent to base with type_quals. */
3070 check_qualified_type (tree cand, tree base, int type_quals)
3072 return (TYPE_QUALS (cand) == type_quals
3073 && TYPE_NAME (cand) == TYPE_NAME (base)
3074 /* Apparently this is needed for Objective-C. */
3075 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3076 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3077 TYPE_ATTRIBUTES (base)));
3080 /* Return a version of the TYPE, qualified as indicated by the
3081 TYPE_QUALS, if one exists. If no qualified version exists yet,
3082 return NULL_TREE. */
3085 get_qualified_type (tree type, int type_quals)
3089 if (TYPE_QUALS (type) == type_quals)
3092 /* Search the chain of variants to see if there is already one there just
3093 like the one we need to have. If so, use that existing one. We must
3094 preserve the TYPE_NAME, since there is code that depends on this. */
3095 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3096 if (check_qualified_type (t, type, type_quals))
3102 /* Like get_qualified_type, but creates the type if it does not
3103 exist. This function never returns NULL_TREE. */
3106 build_qualified_type (tree type, int type_quals)
3110 /* See if we already have the appropriate qualified variant. */
3111 t = get_qualified_type (type, type_quals);
3113 /* If not, build it. */
3116 t = build_type_copy (type);
3117 set_type_quals (t, type_quals);
3123 /* Create a new variant of TYPE, equivalent but distinct.
3124 This is so the caller can modify it. */
3127 build_type_copy (tree type)
3129 tree t, m = TYPE_MAIN_VARIANT (type);
3131 t = copy_node (type);
3133 TYPE_POINTER_TO (t) = 0;
3134 TYPE_REFERENCE_TO (t) = 0;
3136 /* Add this type to the chain of variants of TYPE. */
3137 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3138 TYPE_NEXT_VARIANT (m) = t;
3143 /* Hashing of types so that we don't make duplicates.
3144 The entry point is `type_hash_canon'. */
3146 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3147 with types in the TREE_VALUE slots), by adding the hash codes
3148 of the individual types. */
3151 type_hash_list (tree list, hashval_t hashcode)
3155 for (tail = list; tail; tail = TREE_CHAIN (tail))
3156 if (TREE_VALUE (tail) != error_mark_node)
3157 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3163 /* These are the Hashtable callback functions. */
3165 /* Returns true iff the types are equivalent. */
3168 type_hash_eq (const void *va, const void *vb)
3170 const struct type_hash *a = va, *b = vb;
3172 /* First test the things that are the same for all types. */
3173 if (a->hash != b->hash
3174 || TREE_CODE (a->type) != TREE_CODE (b->type)
3175 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3176 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3177 TYPE_ATTRIBUTES (b->type))
3178 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3179 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3182 switch (TREE_CODE (a->type))
3188 case REFERENCE_TYPE:
3192 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3193 && !(TYPE_VALUES (a->type)
3194 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3195 && TYPE_VALUES (b->type)
3196 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3197 && type_list_equal (TYPE_VALUES (a->type),
3198 TYPE_VALUES (b->type))))
3201 /* ... fall through ... */
3207 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3208 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3209 TYPE_MAX_VALUE (b->type)))
3210 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3211 && tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3212 TYPE_MIN_VALUE (b->type))));
3215 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3218 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3219 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3220 || (TYPE_ARG_TYPES (a->type)
3221 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3222 && TYPE_ARG_TYPES (b->type)
3223 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3224 && type_list_equal (TYPE_ARG_TYPES (a->type),
3225 TYPE_ARG_TYPES (b->type)))));
3229 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3233 case QUAL_UNION_TYPE:
3234 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3235 || (TYPE_FIELDS (a->type)
3236 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3237 && TYPE_FIELDS (b->type)
3238 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3239 && type_list_equal (TYPE_FIELDS (a->type),
3240 TYPE_FIELDS (b->type))));
3243 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3244 || (TYPE_ARG_TYPES (a->type)
3245 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3246 && TYPE_ARG_TYPES (b->type)
3247 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3248 && type_list_equal (TYPE_ARG_TYPES (a->type),
3249 TYPE_ARG_TYPES (b->type))));
3256 /* Return the cached hash value. */
3259 type_hash_hash (const void *item)
3261 return ((const struct type_hash *) item)->hash;
3264 /* Look in the type hash table for a type isomorphic to TYPE.
3265 If one is found, return it. Otherwise return 0. */
3268 type_hash_lookup (hashval_t hashcode, tree type)
3270 struct type_hash *h, in;
3272 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3273 must call that routine before comparing TYPE_ALIGNs. */
3279 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3285 /* Add an entry to the type-hash-table
3286 for a type TYPE whose hash code is HASHCODE. */
3289 type_hash_add (hashval_t hashcode, tree type)
3291 struct type_hash *h;
3294 h = ggc_alloc (sizeof (struct type_hash));
3297 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3298 *(struct type_hash **) loc = h;
3301 /* Given TYPE, and HASHCODE its hash code, return the canonical
3302 object for an identical type if one already exists.
3303 Otherwise, return TYPE, and record it as the canonical object.
3305 To use this function, first create a type of the sort you want.
3306 Then compute its hash code from the fields of the type that
3307 make it different from other similar types.
3308 Then call this function and use the value. */
3311 type_hash_canon (unsigned int hashcode, tree type)
3315 /* The hash table only contains main variants, so ensure that's what we're
3317 if (TYPE_MAIN_VARIANT (type) != type)
3320 if (!lang_hooks.types.hash_types)
3323 /* See if the type is in the hash table already. If so, return it.
3324 Otherwise, add the type. */
3325 t1 = type_hash_lookup (hashcode, type);
3328 #ifdef GATHER_STATISTICS
3329 tree_node_counts[(int) t_kind]--;
3330 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3336 type_hash_add (hashcode, type);
3341 /* See if the data pointed to by the type hash table is marked. We consider
3342 it marked if the type is marked or if a debug type number or symbol
3343 table entry has been made for the type. This reduces the amount of
3344 debugging output and eliminates that dependency of the debug output on
3345 the number of garbage collections. */
3348 type_hash_marked_p (const void *p)
3350 tree type = ((struct type_hash *) p)->type;
3352 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3356 print_type_hash_statistics (void)
3358 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3359 (long) htab_size (type_hash_table),
3360 (long) htab_elements (type_hash_table),
3361 htab_collisions (type_hash_table));
3364 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3365 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3366 by adding the hash codes of the individual attributes. */
3369 attribute_hash_list (tree list, hashval_t hashcode)
3373 for (tail = list; tail; tail = TREE_CHAIN (tail))
3374 /* ??? Do we want to add in TREE_VALUE too? */
3375 hashcode = iterative_hash_object
3376 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3380 /* Given two lists of attributes, return true if list l2 is
3381 equivalent to l1. */
3384 attribute_list_equal (tree l1, tree l2)
3386 return attribute_list_contained (l1, l2)
3387 && attribute_list_contained (l2, l1);
3390 /* Given two lists of attributes, return true if list L2 is
3391 completely contained within L1. */
3392 /* ??? This would be faster if attribute names were stored in a canonicalized
3393 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3394 must be used to show these elements are equivalent (which they are). */
3395 /* ??? It's not clear that attributes with arguments will always be handled
3399 attribute_list_contained (tree l1, tree l2)
3403 /* First check the obvious, maybe the lists are identical. */
3407 /* Maybe the lists are similar. */
3408 for (t1 = l1, t2 = l2;
3410 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3411 && TREE_VALUE (t1) == TREE_VALUE (t2);
3412 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3414 /* Maybe the lists are equal. */
3415 if (t1 == 0 && t2 == 0)
3418 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3421 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3423 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3426 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3433 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3440 /* Given two lists of types
3441 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3442 return 1 if the lists contain the same types in the same order.
3443 Also, the TREE_PURPOSEs must match. */
3446 type_list_equal (tree l1, tree l2)
3450 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3451 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3452 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3453 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3454 && (TREE_TYPE (TREE_PURPOSE (t1))
3455 == TREE_TYPE (TREE_PURPOSE (t2))))))
3461 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3462 given by TYPE. If the argument list accepts variable arguments,
3463 then this function counts only the ordinary arguments. */
3466 type_num_arguments (tree type)
3471 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3472 /* If the function does not take a variable number of arguments,
3473 the last element in the list will have type `void'. */
3474 if (VOID_TYPE_P (TREE_VALUE (t)))
3482 /* Nonzero if integer constants T1 and T2
3483 represent the same constant value. */
3486 tree_int_cst_equal (tree t1, tree t2)
3491 if (t1 == 0 || t2 == 0)
3494 if (TREE_CODE (t1) == INTEGER_CST
3495 && TREE_CODE (t2) == INTEGER_CST
3496 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3497 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3503 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3504 The precise way of comparison depends on their data type. */
3507 tree_int_cst_lt (tree t1, tree t2)
3512 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3514 int t1_sgn = tree_int_cst_sgn (t1);
3515 int t2_sgn = tree_int_cst_sgn (t2);
3517 if (t1_sgn < t2_sgn)
3519 else if (t1_sgn > t2_sgn)
3521 /* Otherwise, both are non-negative, so we compare them as
3522 unsigned just in case one of them would overflow a signed
3525 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3526 return INT_CST_LT (t1, t2);
3528 return INT_CST_LT_UNSIGNED (t1, t2);
3531 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3534 tree_int_cst_compare (tree t1, tree t2)
3536 if (tree_int_cst_lt (t1, t2))
3538 else if (tree_int_cst_lt (t2, t1))
3544 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3545 the host. If POS is zero, the value can be represented in a single
3546 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3547 be represented in a single unsigned HOST_WIDE_INT. */
3550 host_integerp (tree t, int pos)
3552 return (TREE_CODE (t) == INTEGER_CST
3553 && ! TREE_OVERFLOW (t)
3554 && ((TREE_INT_CST_HIGH (t) == 0
3555 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3556 || (! pos && TREE_INT_CST_HIGH (t) == -1
3557 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3558 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3559 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3562 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3563 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3564 be positive. Abort if we cannot satisfy the above conditions. */
3567 tree_low_cst (tree t, int pos)
3569 if (host_integerp (t, pos))
3570 return TREE_INT_CST_LOW (t);
3575 /* Return the most significant bit of the integer constant T. */
3578 tree_int_cst_msb (tree t)
3582 unsigned HOST_WIDE_INT l;
3584 /* Note that using TYPE_PRECISION here is wrong. We care about the
3585 actual bits, not the (arbitrary) range of the type. */
3586 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3587 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3588 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3589 return (l & 1) == 1;
3592 /* Return an indication of the sign of the integer constant T.
3593 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3594 Note that -1 will never be returned it T's type is unsigned. */
3597 tree_int_cst_sgn (tree t)
3599 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3601 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3603 else if (TREE_INT_CST_HIGH (t) < 0)
3609 /* Compare two constructor-element-type constants. Return 1 if the lists
3610 are known to be equal; otherwise return 0. */
3613 simple_cst_list_equal (tree l1, tree l2)
3615 while (l1 != NULL_TREE && l2 != NULL_TREE)
3617 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3620 l1 = TREE_CHAIN (l1);
3621 l2 = TREE_CHAIN (l2);
3627 /* Return truthvalue of whether T1 is the same tree structure as T2.
3628 Return 1 if they are the same.
3629 Return 0 if they are understandably different.
3630 Return -1 if either contains tree structure not understood by
3634 simple_cst_equal (tree t1, tree t2)
3636 enum tree_code code1, code2;
3642 if (t1 == 0 || t2 == 0)
3645 code1 = TREE_CODE (t1);
3646 code2 = TREE_CODE (t2);
3648 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3650 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3651 || code2 == NON_LVALUE_EXPR)
3652 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3654 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3657 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3658 || code2 == NON_LVALUE_EXPR)
3659 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3667 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3668 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3671 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3674 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3675 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3676 TREE_STRING_LENGTH (t1)));
3679 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1),
3680 CONSTRUCTOR_ELTS (t2));
3683 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3686 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3690 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3693 /* Special case: if either target is an unallocated VAR_DECL,
3694 it means that it's going to be unified with whatever the
3695 TARGET_EXPR is really supposed to initialize, so treat it
3696 as being equivalent to anything. */
3697 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3698 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3699 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3700 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3701 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3702 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3705 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3710 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3712 case WITH_CLEANUP_EXPR:
3713 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3717 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3720 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3721 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3735 /* This general rule works for most tree codes. All exceptions should be
3736 handled above. If this is a language-specific tree code, we can't
3737 trust what might be in the operand, so say we don't know
3739 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3742 switch (TREE_CODE_CLASS (code1))
3751 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3753 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3765 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3766 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3767 than U, respectively. */
3770 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3772 if (tree_int_cst_sgn (t) < 0)
3774 else if (TREE_INT_CST_HIGH (t) != 0)
3776 else if (TREE_INT_CST_LOW (t) == u)
3778 else if (TREE_INT_CST_LOW (t) < u)
3784 /* Return true if CODE represents an associative tree code. Otherwise
3787 associative_tree_code (enum tree_code code)
3806 /* Return true if CODE represents an commutative tree code. Otherwise
3809 commutative_tree_code (enum tree_code code)
3822 case UNORDERED_EXPR:
3826 case TRUTH_AND_EXPR:
3827 case TRUTH_XOR_EXPR:
3837 /* Generate a hash value for an expression. This can be used iteratively
3838 by passing a previous result as the "val" argument.
3840 This function is intended to produce the same hash for expressions which
3841 would compare equal using operand_equal_p. */
3844 iterative_hash_expr (tree t, hashval_t val)
3847 enum tree_code code;
3851 return iterative_hash_object (t, val);
3853 code = TREE_CODE (t);
3854 class = TREE_CODE_CLASS (code);
3857 || TREE_CODE (t) == VALUE_HANDLE)
3859 /* Decls we can just compare by pointer. */
3860 val = iterative_hash_object (t, val);
3862 else if (class == 'c')
3864 /* Alas, constants aren't shared, so we can't rely on pointer
3866 if (code == INTEGER_CST)
3868 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3869 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3871 else if (code == REAL_CST)
3873 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
3875 val = iterative_hash (&val2, sizeof (unsigned int), val);
3877 else if (code == STRING_CST)
3878 val = iterative_hash (TREE_STRING_POINTER (t),
3879 TREE_STRING_LENGTH (t), val);
3880 else if (code == COMPLEX_CST)
3882 val = iterative_hash_expr (TREE_REALPART (t), val);
3883 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3885 else if (code == VECTOR_CST)
3886 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3890 else if (IS_EXPR_CODE_CLASS (class))
3892 val = iterative_hash_object (code, val);
3894 /* Don't hash the type, that can lead to having nodes which
3895 compare equal according to operand_equal_p, but which
3896 have different hash codes. */
3897 if (code == NOP_EXPR
3898 || code == CONVERT_EXPR
3899 || code == NON_LVALUE_EXPR)
3901 /* Make sure to include signness in the hash computation. */
3902 val += TYPE_UNSIGNED (TREE_TYPE (t));
3903 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
3906 if (commutative_tree_code (code))
3908 /* It's a commutative expression. We want to hash it the same
3909 however it appears. We do this by first hashing both operands
3910 and then rehashing based on the order of their independent
3912 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
3913 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
3917 t = one, one = two, two = t;
3919 val = iterative_hash_object (one, val);
3920 val = iterative_hash_object (two, val);
3923 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3924 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3926 else if (code == TREE_LIST)
3928 /* A list of expressions, for a CALL_EXPR or as the elements of a
3930 for (; t; t = TREE_CHAIN (t))
3931 val = iterative_hash_expr (TREE_VALUE (t), val);
3933 else if (code == SSA_NAME)
3935 val = iterative_hash_object (SSA_NAME_VERSION (t), val);
3936 val = iterative_hash_expr (SSA_NAME_VAR (t), val);
3944 /* Constructors for pointer, array and function types.
3945 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3946 constructed by language-dependent code, not here.) */
3948 /* Construct, lay out and return the type of pointers to TO_TYPE with
3949 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
3950 reference all of memory. If such a type has already been
3951 constructed, reuse it. */
3954 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
3959 /* In some cases, languages will have things that aren't a POINTER_TYPE
3960 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
3961 In that case, return that type without regard to the rest of our
3964 ??? This is a kludge, but consistent with the way this function has
3965 always operated and there doesn't seem to be a good way to avoid this
3967 if (TYPE_POINTER_TO (to_type) != 0
3968 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
3969 return TYPE_POINTER_TO (to_type);
3971 /* First, if we already have a type for pointers to TO_TYPE and it's
3972 the proper mode, use it. */
3973 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
3974 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
3977 t = make_node (POINTER_TYPE);
3979 TREE_TYPE (t) = to_type;
3980 TYPE_MODE (t) = mode;
3981 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
3982 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
3983 TYPE_POINTER_TO (to_type) = t;
3985 /* Lay out the type. This function has many callers that are concerned
3986 with expression-construction, and this simplifies them all. */
3992 /* By default build pointers in ptr_mode. */
3995 build_pointer_type (tree to_type)
3997 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4000 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4003 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4008 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4009 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4010 In that case, return that type without regard to the rest of our
4013 ??? This is a kludge, but consistent with the way this function has
4014 always operated and there doesn't seem to be a good way to avoid this
4016 if (TYPE_REFERENCE_TO (to_type) != 0
4017 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4018 return TYPE_REFERENCE_TO (to_type);
4020 /* First, if we already have a type for pointers to TO_TYPE and it's
4021 the proper mode, use it. */
4022 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4023 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4026 t = make_node (REFERENCE_TYPE);
4028 TREE_TYPE (t) = to_type;
4029 TYPE_MODE (t) = mode;
4030 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4031 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4032 TYPE_REFERENCE_TO (to_type) = t;
4040 /* Build the node for the type of references-to-TO_TYPE by default
4044 build_reference_type (tree to_type)
4046 return build_reference_type_for_mode (to_type, ptr_mode, false);
4049 /* Build a type that is compatible with t but has no cv quals anywhere
4052 const char *const *const * -> char ***. */
4055 build_type_no_quals (tree t)
4057 switch (TREE_CODE (t))
4060 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4062 TYPE_REF_CAN_ALIAS_ALL (t));
4063 case REFERENCE_TYPE:
4065 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4067 TYPE_REF_CAN_ALIAS_ALL (t));
4069 return TYPE_MAIN_VARIANT (t);
4073 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4074 MAXVAL should be the maximum value in the domain
4075 (one less than the length of the array).
4077 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4078 We don't enforce this limit, that is up to caller (e.g. language front end).
4079 The limit exists because the result is a signed type and we don't handle
4080 sizes that use more than one HOST_WIDE_INT. */
4083 build_index_type (tree maxval)
4085 tree itype = make_node (INTEGER_TYPE);
4087 TREE_TYPE (itype) = sizetype;
4088 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4089 TYPE_MIN_VALUE (itype) = size_zero_node;
4090 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4091 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4092 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4093 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4094 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4095 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4097 if (host_integerp (maxval, 1))
4098 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4103 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4104 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4105 low bound LOWVAL and high bound HIGHVAL.
4106 if TYPE==NULL_TREE, sizetype is used. */
4109 build_range_type (tree type, tree lowval, tree highval)
4111 tree itype = make_node (INTEGER_TYPE);
4113 TREE_TYPE (itype) = type;
4114 if (type == NULL_TREE)
4117 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4118 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4120 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4121 TYPE_MODE (itype) = TYPE_MODE (type);
4122 TYPE_SIZE (itype) = TYPE_SIZE (type);
4123 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4124 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4125 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4127 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4128 return type_hash_canon (tree_low_cst (highval, 0)
4129 - tree_low_cst (lowval, 0),
4135 /* Just like build_index_type, but takes lowval and highval instead
4136 of just highval (maxval). */
4139 build_index_2_type (tree lowval, tree highval)
4141 return build_range_type (sizetype, lowval, highval);
4144 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4145 and number of elements specified by the range of values of INDEX_TYPE.
4146 If such a type has already been constructed, reuse it. */
4149 build_array_type (tree elt_type, tree index_type)
4152 hashval_t hashcode = 0;
4154 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4156 error ("arrays of functions are not meaningful");
4157 elt_type = integer_type_node;
4160 t = make_node (ARRAY_TYPE);
4161 TREE_TYPE (t) = elt_type;
4162 TYPE_DOMAIN (t) = index_type;
4164 if (index_type == 0)
4167 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4168 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4169 t = type_hash_canon (hashcode, t);
4171 if (!COMPLETE_TYPE_P (t))
4176 /* Return the TYPE of the elements comprising
4177 the innermost dimension of ARRAY. */
4180 get_inner_array_type (tree array)
4182 tree type = TREE_TYPE (array);
4184 while (TREE_CODE (type) == ARRAY_TYPE)
4185 type = TREE_TYPE (type);
4190 /* Construct, lay out and return
4191 the type of functions returning type VALUE_TYPE
4192 given arguments of types ARG_TYPES.
4193 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4194 are data type nodes for the arguments of the function.
4195 If such a type has already been constructed, reuse it. */
4198 build_function_type (tree value_type, tree arg_types)
4201 hashval_t hashcode = 0;
4203 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4205 error ("function return type cannot be function");
4206 value_type = integer_type_node;
4209 /* Make a node of the sort we want. */
4210 t = make_node (FUNCTION_TYPE);
4211 TREE_TYPE (t) = value_type;
4212 TYPE_ARG_TYPES (t) = arg_types;
4214 /* If we already have such a type, use the old one. */
4215 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4216 hashcode = type_hash_list (arg_types, hashcode);
4217 t = type_hash_canon (hashcode, t);
4219 if (!COMPLETE_TYPE_P (t))
4224 /* Build a function type. The RETURN_TYPE is the type returned by the
4225 function. If additional arguments are provided, they are
4226 additional argument types. The list of argument types must always
4227 be terminated by NULL_TREE. */
4230 build_function_type_list (tree return_type, ...)
4235 va_start (p, return_type);
4237 t = va_arg (p, tree);
4238 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4239 args = tree_cons (NULL_TREE, t, args);
4242 args = nreverse (args);
4243 TREE_CHAIN (last) = void_list_node;
4244 args = build_function_type (return_type, args);
4250 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4251 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4252 for the method. An implicit additional parameter (of type
4253 pointer-to-BASETYPE) is added to the ARGTYPES. */
4256 build_method_type_directly (tree basetype,
4264 /* Make a node of the sort we want. */
4265 t = make_node (METHOD_TYPE);
4267 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4268 TREE_TYPE (t) = rettype;
4269 ptype = build_pointer_type (basetype);
4271 /* The actual arglist for this function includes a "hidden" argument
4272 which is "this". Put it into the list of argument types. */
4273 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4274 TYPE_ARG_TYPES (t) = argtypes;
4276 /* If we already have such a type, use the old one. */
4277 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4278 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4279 hashcode = type_hash_list (argtypes, hashcode);
4280 t = type_hash_canon (hashcode, t);
4282 if (!COMPLETE_TYPE_P (t))
4288 /* Construct, lay out and return the type of methods belonging to class
4289 BASETYPE and whose arguments and values are described by TYPE.
4290 If that type exists already, reuse it.
4291 TYPE must be a FUNCTION_TYPE node. */
4294 build_method_type (tree basetype, tree type)
4296 if (TREE_CODE (type) != FUNCTION_TYPE)
4299 return build_method_type_directly (basetype,
4301 TYPE_ARG_TYPES (type));
4304 /* Construct, lay out and return the type of offsets to a value
4305 of type TYPE, within an object of type BASETYPE.
4306 If a suitable offset type exists already, reuse it. */
4309 build_offset_type (tree basetype, tree type)
4312 hashval_t hashcode = 0;
4314 /* Make a node of the sort we want. */
4315 t = make_node (OFFSET_TYPE);
4317 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4318 TREE_TYPE (t) = type;
4320 /* If we already have such a type, use the old one. */
4321 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4322 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4323 t = type_hash_canon (hashcode, t);
4325 if (!COMPLETE_TYPE_P (t))
4331 /* Create a complex type whose components are COMPONENT_TYPE. */
4334 build_complex_type (tree component_type)
4339 /* Make a node of the sort we want. */
4340 t = make_node (COMPLEX_TYPE);
4342 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4344 /* If we already have such a type, use the old one. */
4345 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4346 t = type_hash_canon (hashcode, t);
4348 if (!COMPLETE_TYPE_P (t))
4351 /* If we are writing Dwarf2 output we need to create a name,
4352 since complex is a fundamental type. */
4353 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4357 if (component_type == char_type_node)
4358 name = "complex char";
4359 else if (component_type == signed_char_type_node)
4360 name = "complex signed char";
4361 else if (component_type == unsigned_char_type_node)
4362 name = "complex unsigned char";
4363 else if (component_type == short_integer_type_node)
4364 name = "complex short int";
4365 else if (component_type == short_unsigned_type_node)
4366 name = "complex short unsigned int";
4367 else if (component_type == integer_type_node)
4368 name = "complex int";
4369 else if (component_type == unsigned_type_node)
4370 name = "complex unsigned int";
4371 else if (component_type == long_integer_type_node)
4372 name = "complex long int";
4373 else if (component_type == long_unsigned_type_node)
4374 name = "complex long unsigned int";
4375 else if (component_type == long_long_integer_type_node)
4376 name = "complex long long int";
4377 else if (component_type == long_long_unsigned_type_node)
4378 name = "complex long long unsigned int";
4383 TYPE_NAME (t) = get_identifier (name);
4386 return build_qualified_type (t, TYPE_QUALS (component_type));
4389 /* Return OP, stripped of any conversions to wider types as much as is safe.
4390 Converting the value back to OP's type makes a value equivalent to OP.
4392 If FOR_TYPE is nonzero, we return a value which, if converted to
4393 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4395 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4396 narrowest type that can hold the value, even if they don't exactly fit.
4397 Otherwise, bit-field references are changed to a narrower type
4398 only if they can be fetched directly from memory in that type.
4400 OP must have integer, real or enumeral type. Pointers are not allowed!
4402 There are some cases where the obvious value we could return
4403 would regenerate to OP if converted to OP's type,
4404 but would not extend like OP to wider types.
4405 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4406 For example, if OP is (unsigned short)(signed char)-1,
4407 we avoid returning (signed char)-1 if FOR_TYPE is int,
4408 even though extending that to an unsigned short would regenerate OP,
4409 since the result of extending (signed char)-1 to (int)
4410 is different from (int) OP. */
4413 get_unwidened (tree op, tree for_type)
4415 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4416 tree type = TREE_TYPE (op);
4418 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4420 = (for_type != 0 && for_type != type
4421 && final_prec > TYPE_PRECISION (type)
4422 && TYPE_UNSIGNED (type));
4425 while (TREE_CODE (op) == NOP_EXPR)
4428 = TYPE_PRECISION (TREE_TYPE (op))
4429 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4431 /* Truncations are many-one so cannot be removed.
4432 Unless we are later going to truncate down even farther. */
4434 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4437 /* See what's inside this conversion. If we decide to strip it,
4439 op = TREE_OPERAND (op, 0);
4441 /* If we have not stripped any zero-extensions (uns is 0),
4442 we can strip any kind of extension.
4443 If we have previously stripped a zero-extension,
4444 only zero-extensions can safely be stripped.
4445 Any extension can be stripped if the bits it would produce
4446 are all going to be discarded later by truncating to FOR_TYPE. */
4450 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4452 /* TYPE_UNSIGNED says whether this is a zero-extension.
4453 Let's avoid computing it if it does not affect WIN
4454 and if UNS will not be needed again. */
4455 if ((uns || TREE_CODE (op) == NOP_EXPR)
4456 && TYPE_UNSIGNED (TREE_TYPE (op)))
4464 if (TREE_CODE (op) == COMPONENT_REF
4465 /* Since type_for_size always gives an integer type. */
4466 && TREE_CODE (type) != REAL_TYPE
4467 /* Don't crash if field not laid out yet. */
4468 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4469 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4471 unsigned int innerprec
4472 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4473 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4474 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4475 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4477 /* We can get this structure field in the narrowest type it fits in.
4478 If FOR_TYPE is 0, do this only for a field that matches the
4479 narrower type exactly and is aligned for it
4480 The resulting extension to its nominal type (a fullword type)
4481 must fit the same conditions as for other extensions. */
4484 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4485 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4486 && (! uns || final_prec <= innerprec || unsignedp))
4488 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4489 TREE_OPERAND (op, 1), NULL_TREE);
4490 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4491 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4498 /* Return OP or a simpler expression for a narrower value
4499 which can be sign-extended or zero-extended to give back OP.
4500 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4501 or 0 if the value should be sign-extended. */
4504 get_narrower (tree op, int *unsignedp_ptr)
4510 while (TREE_CODE (op) == NOP_EXPR)
4513 = (TYPE_PRECISION (TREE_TYPE (op))
4514 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4516 /* Truncations are many-one so cannot be removed. */
4520 /* See what's inside this conversion. If we decide to strip it,
4525 op = TREE_OPERAND (op, 0);
4526 /* An extension: the outermost one can be stripped,
4527 but remember whether it is zero or sign extension. */
4529 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4530 /* Otherwise, if a sign extension has been stripped,
4531 only sign extensions can now be stripped;
4532 if a zero extension has been stripped, only zero-extensions. */
4533 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4537 else /* bitschange == 0 */
4539 /* A change in nominal type can always be stripped, but we must
4540 preserve the unsignedness. */
4542 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4544 op = TREE_OPERAND (op, 0);
4550 if (TREE_CODE (op) == COMPONENT_REF
4551 /* Since type_for_size always gives an integer type. */
4552 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4553 /* Ensure field is laid out already. */
4554 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4555 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4557 unsigned HOST_WIDE_INT innerprec
4558 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4559 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4560 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4561 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4563 /* We can get this structure field in a narrower type that fits it,
4564 but the resulting extension to its nominal type (a fullword type)
4565 must satisfy the same conditions as for other extensions.
4567 Do this only for fields that are aligned (not bit-fields),
4568 because when bit-field insns will be used there is no
4569 advantage in doing this. */
4571 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4572 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4573 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
4577 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
4578 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4579 TREE_OPERAND (op, 1), NULL_TREE);
4580 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4581 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4584 *unsignedp_ptr = uns;
4588 /* Nonzero if integer constant C has a value that is permissible
4589 for type TYPE (an INTEGER_TYPE). */
4592 int_fits_type_p (tree c, tree type)
4594 tree type_low_bound = TYPE_MIN_VALUE (type);
4595 tree type_high_bound = TYPE_MAX_VALUE (type);
4596 int ok_for_low_bound, ok_for_high_bound;
4598 /* Perform some generic filtering first, which may allow making a decision
4599 even if the bounds are not constant. First, negative integers never fit
4600 in unsigned types, */
4601 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4602 /* Also, unsigned integers with top bit set never fit signed types. */
4603 || (! TYPE_UNSIGNED (type)
4604 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4607 /* If at least one bound of the type is a constant integer, we can check
4608 ourselves and maybe make a decision. If no such decision is possible, but
4609 this type is a subtype, try checking against that. Otherwise, use
4610 force_fit_type, which checks against the precision.
4612 Compute the status for each possibly constant bound, and return if we see
4613 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4614 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4615 for "constant known to fit". */
4617 ok_for_low_bound = -1;
4618 ok_for_high_bound = -1;
4620 /* Check if C >= type_low_bound. */
4621 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4623 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4624 if (! ok_for_low_bound)
4628 /* Check if c <= type_high_bound. */
4629 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4631 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4632 if (! ok_for_high_bound)
4636 /* If the constant fits both bounds, the result is known. */
4637 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4640 /* If we haven't been able to decide at this point, there nothing more we
4641 can check ourselves here. Look at the base type if we have one. */
4642 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4643 return int_fits_type_p (c, TREE_TYPE (type));
4645 /* Or to force_fit_type, if nothing else. */
4649 TREE_TYPE (c) = type;
4650 return !force_fit_type (c, 0);
4654 /* Returns true if T is, contains, or refers to a type with variable
4655 size. This concept is more general than that of C99 'variably
4656 modified types': in C99, a struct type is never variably modified
4657 because a VLA may not appear as a structure member. However, in
4660 struct S { int i[f()]; };
4662 is valid, and other languages may define similar constructs. */
4665 variably_modified_type_p (tree type)
4669 if (type == error_mark_node)
4672 /* If TYPE itself has variable size, it is variably modified.
4674 We do not yet have a representation of the C99 '[*]' syntax.
4675 When a representation is chosen, this function should be modified
4676 to test for that case as well. */
4677 t = TYPE_SIZE (type);
4678 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4681 switch (TREE_CODE (type))
4684 case REFERENCE_TYPE:
4688 if (variably_modified_type_p (TREE_TYPE (type)))
4694 /* If TYPE is a function type, it is variably modified if any of the
4695 parameters or the return type are variably modified. */
4696 if (variably_modified_type_p (TREE_TYPE (type)))
4699 for (t = TYPE_ARG_TYPES (type);
4700 t && t != void_list_node;
4702 if (variably_modified_type_p (TREE_VALUE (t)))
4711 /* Scalar types are variably modified if their end points
4713 t = TYPE_MIN_VALUE (type);
4714 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4717 t = TYPE_MAX_VALUE (type);
4718 if (t && t != error_mark_node && TREE_CODE (t) != INTEGER_CST)
4724 case QUAL_UNION_TYPE:
4725 /* We can't see if any of the field are variably-modified by the
4726 definition we normally use, since that would produce infinite
4727 recursion via pointers. */
4728 /* This is variably modified if some field's type is. */
4729 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
4730 if (TREE_CODE (t) == FIELD_DECL)
4732 tree t1 = DECL_FIELD_OFFSET (t);
4734 if (t1 && t1 != error_mark_node && TREE_CODE (t1) != INTEGER_CST)
4738 if (t1 && t1 != error_mark_node && TREE_CODE (t1) != INTEGER_CST)
4747 /* The current language may have other cases to check, but in general,
4748 all other types are not variably modified. */
4749 return lang_hooks.tree_inlining.var_mod_type_p (type);
4752 /* Given a DECL or TYPE, return the scope in which it was declared, or
4753 NULL_TREE if there is no containing scope. */
4756 get_containing_scope (tree t)
4758 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4761 /* Return the innermost context enclosing DECL that is
4762 a FUNCTION_DECL, or zero if none. */
4765 decl_function_context (tree decl)
4769 if (TREE_CODE (decl) == ERROR_MARK)
4772 if (TREE_CODE (decl) == SAVE_EXPR)
4773 context = SAVE_EXPR_CONTEXT (decl);
4775 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4776 where we look up the function at runtime. Such functions always take
4777 a first argument of type 'pointer to real context'.
4779 C++ should really be fixed to use DECL_CONTEXT for the real context,
4780 and use something else for the "virtual context". */
4781 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4784 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4786 context = DECL_CONTEXT (decl);
4788 while (context && TREE_CODE (context) != FUNCTION_DECL)
4790 if (TREE_CODE (context) == BLOCK)
4791 context = BLOCK_SUPERCONTEXT (context);
4793 context = get_containing_scope (context);
4799 /* Return the innermost context enclosing DECL that is
4800 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4801 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4804 decl_type_context (tree decl)
4806 tree context = DECL_CONTEXT (decl);
4809 switch (TREE_CODE (context))
4811 case NAMESPACE_DECL:
4812 case TRANSLATION_UNIT_DECL:
4817 case QUAL_UNION_TYPE:
4822 context = DECL_CONTEXT (context);
4826 context = BLOCK_SUPERCONTEXT (context);
4836 /* CALL is a CALL_EXPR. Return the declaration for the function
4837 called, or NULL_TREE if the called function cannot be
4841 get_callee_fndecl (tree call)
4845 /* It's invalid to call this function with anything but a
4847 if (TREE_CODE (call) != CALL_EXPR)
4850 /* The first operand to the CALL is the address of the function
4852 addr = TREE_OPERAND (call, 0);
4856 /* If this is a readonly function pointer, extract its initial value. */
4857 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4858 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4859 && DECL_INITIAL (addr))
4860 addr = DECL_INITIAL (addr);
4862 /* If the address is just `&f' for some function `f', then we know
4863 that `f' is being called. */
4864 if (TREE_CODE (addr) == ADDR_EXPR
4865 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4866 return TREE_OPERAND (addr, 0);
4868 /* We couldn't figure out what was being called. Maybe the front
4869 end has some idea. */
4870 return lang_hooks.lang_get_callee_fndecl (call);
4873 /* Print debugging information about tree nodes generated during the compile,
4874 and any language-specific information. */
4877 dump_tree_statistics (void)
4879 #ifdef GATHER_STATISTICS
4881 int total_nodes, total_bytes;
4884 fprintf (stderr, "\n??? tree nodes created\n\n");
4885 #ifdef GATHER_STATISTICS
4886 fprintf (stderr, "Kind Nodes Bytes\n");
4887 fprintf (stderr, "---------------------------------------\n");
4888 total_nodes = total_bytes = 0;
4889 for (i = 0; i < (int) all_kinds; i++)
4891 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
4892 tree_node_counts[i], tree_node_sizes[i]);
4893 total_nodes += tree_node_counts[i];
4894 total_bytes += tree_node_sizes[i];
4896 fprintf (stderr, "---------------------------------------\n");
4897 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
4898 fprintf (stderr, "---------------------------------------\n");
4899 ssanames_print_statistics ();
4900 phinodes_print_statistics ();
4902 fprintf (stderr, "(No per-node statistics)\n");
4904 print_type_hash_statistics ();
4905 lang_hooks.print_statistics ();
4908 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4910 /* Generate a crc32 of a string. */
4913 crc32_string (unsigned chksum, const char *string)
4917 unsigned value = *string << 24;
4920 for (ix = 8; ix--; value <<= 1)
4924 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
4933 /* P is a string that will be used in a symbol. Mask out any characters
4934 that are not valid in that context. */
4937 clean_symbol_name (char *p)
4941 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4944 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
4951 /* Generate a name for a function unique to this translation unit.
4952 TYPE is some string to identify the purpose of this function to the
4953 linker or collect2. */
4956 get_file_function_name_long (const char *type)
4962 if (first_global_object_name)
4963 p = first_global_object_name;
4966 /* We don't have anything that we know to be unique to this translation
4967 unit, so use what we do have and throw in some randomness. */
4969 const char *name = weak_global_object_name;
4970 const char *file = main_input_filename;
4975 file = input_filename;
4977 len = strlen (file);
4978 q = alloca (9 * 2 + len + 1);
4979 memcpy (q, file, len + 1);
4980 clean_symbol_name (q);
4982 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
4983 crc32_string (0, flag_random_seed));
4988 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
4990 /* Set up the name of the file-level functions we may need.
4991 Use a global object (which is already required to be unique over
4992 the program) rather than the file name (which imposes extra
4994 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
4996 return get_identifier (buf);
4999 /* If KIND=='I', return a suitable global initializer (constructor) name.
5000 If KIND=='D', return a suitable global clean-up (destructor) name. */
5003 get_file_function_name (int kind)
5010 return get_file_function_name_long (p);
5013 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5014 The result is placed in BUFFER (which has length BIT_SIZE),
5015 with one bit in each char ('\000' or '\001').
5017 If the constructor is constant, NULL_TREE is returned.
5018 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5021 get_set_constructor_bits (tree init, char *buffer, int bit_size)
5025 HOST_WIDE_INT domain_min
5026 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
5027 tree non_const_bits = NULL_TREE;
5029 for (i = 0; i < bit_size; i++)
5032 for (vals = TREE_OPERAND (init, 1);
5033 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5035 if (!host_integerp (TREE_VALUE (vals), 0)
5036 || (TREE_PURPOSE (vals) != NULL_TREE
5037 && !host_integerp (TREE_PURPOSE (vals), 0)))
5039 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5040 else if (TREE_PURPOSE (vals) != NULL_TREE)
5042 /* Set a range of bits to ones. */
5043 HOST_WIDE_INT lo_index
5044 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
5045 HOST_WIDE_INT hi_index
5046 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5048 if (lo_index < 0 || lo_index >= bit_size
5049 || hi_index < 0 || hi_index >= bit_size)
5051 for (; lo_index <= hi_index; lo_index++)
5052 buffer[lo_index] = 1;
5056 /* Set a single bit to one. */
5058 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5059 if (index < 0 || index >= bit_size)
5061 error ("invalid initializer for bit string");
5067 return non_const_bits;
5070 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5071 The result is placed in BUFFER (which is an array of bytes).
5072 If the constructor is constant, NULL_TREE is returned.
5073 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5076 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
5079 int set_word_size = BITS_PER_UNIT;
5080 int bit_size = wd_size * set_word_size;
5082 unsigned char *bytep = buffer;
5083 char *bit_buffer = alloca (bit_size);
5084 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5086 for (i = 0; i < wd_size; i++)
5089 for (i = 0; i < bit_size; i++)
5093 if (BYTES_BIG_ENDIAN)
5094 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5096 *bytep |= 1 << bit_pos;
5099 if (bit_pos >= set_word_size)
5100 bit_pos = 0, bytep++;
5102 return non_const_bits;
5105 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5107 /* Complain that the tree code of NODE does not match the expected CODE.
5108 FILE, LINE, and FUNCTION are of the caller. */
5111 tree_check_failed (const tree node, enum tree_code code, const char *file,
5112 int line, const char *function)
5114 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5115 tree_code_name[code], tree_code_name[TREE_CODE (node)],
5116 function, trim_filename (file), line);
5119 /* Similar to above except that we allowed the code to be one of two
5123 tree_check2_failed (const tree node, enum tree_code code1,
5124 enum tree_code code2, const char *file,
5125 int line, const char *function)
5127 internal_error ("tree check: expected %s or %s, have %s in %s, at %s:%d",
5128 tree_code_name[code1], tree_code_name[code2],
5129 tree_code_name[TREE_CODE (node)],
5130 function, trim_filename (file), line);
5133 /* Likewise for three different codes. */
5136 tree_check3_failed (const tree node, enum tree_code code1,
5137 enum tree_code code2, enum tree_code code3,
5138 const char *file, int line, const char *function)
5140 internal_error ("tree check: expected %s, %s or %s; have %s in %s, at %s:%d",
5141 tree_code_name[code1], tree_code_name[code2],
5142 tree_code_name[code3], tree_code_name[TREE_CODE (node)],
5143 function, trim_filename (file), line);
5146 /* ... and for four different codes. */
5149 tree_check4_failed (const tree node, enum tree_code code1,
5150 enum tree_code code2, enum tree_code code3,
5151 enum tree_code code4, const char *file, int line,
5152 const char *function)
5155 ("tree check: expected %s, %s, %s or %s; have %s in %s, at %s:%d",
5156 tree_code_name[code1], tree_code_name[code2], tree_code_name[code3],
5157 tree_code_name[code4], tree_code_name[TREE_CODE (node)], function,
5158 trim_filename (file), line);
5161 /* ... and for five different codes. */
5164 tree_check5_failed (const tree node, enum tree_code code1,
5165 enum tree_code code2, enum tree_code code3,
5166 enum tree_code code4, enum tree_code code5,
5167 const char *file, int line, const char *function)
5170 ("tree check: expected %s, %s, %s, %s or %s; have %s in %s, at %s:%d",
5171 tree_code_name[code1], tree_code_name[code2], tree_code_name[code3],
5172 tree_code_name[code4], tree_code_name[code5],
5173 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5176 /* Similar to tree_check_failed, except that we check for a class of tree
5177 code, given in CL. */
5180 tree_class_check_failed (const tree node, int cl, const char *file,
5181 int line, const char *function)
5184 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5185 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5186 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5189 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5190 (dynamically sized) vector. */
5193 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5194 const char *function)
5197 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5198 idx + 1, len, function, trim_filename (file), line);
5201 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5202 (dynamically sized) vector. */
5205 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5206 const char *function)
5209 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5210 idx + 1, len, function, trim_filename (file), line);
5213 /* Similar to above, except that the check is for the bounds of the operand
5214 vector of an expression node. */
5217 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5218 int line, const char *function)
5221 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5222 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5223 function, trim_filename (file), line);
5225 #endif /* ENABLE_TREE_CHECKING */
5227 /* For a new vector type node T, build the information necessary for
5228 debugging output. */
5231 finish_vector_type (tree t)
5236 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
5237 tree array = build_array_type (TREE_TYPE (t),
5238 build_index_type (index));
5239 tree rt = make_node (RECORD_TYPE);
5241 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5242 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5244 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5245 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5246 the representation type, and we want to find that die when looking up
5247 the vector type. This is most easily achieved by making the TYPE_UID
5249 TYPE_UID (rt) = TYPE_UID (t);
5254 make_or_reuse_type (unsigned size, int unsignedp)
5256 if (size == INT_TYPE_SIZE)
5257 return unsignedp ? unsigned_type_node : integer_type_node;
5258 if (size == CHAR_TYPE_SIZE)
5259 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5260 if (size == SHORT_TYPE_SIZE)
5261 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5262 if (size == LONG_TYPE_SIZE)
5263 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5264 if (size == LONG_LONG_TYPE_SIZE)
5265 return (unsignedp ? long_long_unsigned_type_node
5266 : long_long_integer_type_node);
5269 return make_unsigned_type (size);
5271 return make_signed_type (size);
5274 /* Create nodes for all integer types (and error_mark_node) using the sizes
5275 of C datatypes. The caller should call set_sizetype soon after calling
5276 this function to select one of the types as sizetype. */
5279 build_common_tree_nodes (int signed_char)
5281 error_mark_node = make_node (ERROR_MARK);
5282 TREE_TYPE (error_mark_node) = error_mark_node;
5284 initialize_sizetypes ();
5286 /* Define both `signed char' and `unsigned char'. */
5287 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5288 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5290 /* Define `char', which is like either `signed char' or `unsigned char'
5291 but not the same as either. */
5294 ? make_signed_type (CHAR_TYPE_SIZE)
5295 : make_unsigned_type (CHAR_TYPE_SIZE));
5297 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5298 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5299 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5300 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5301 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5302 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5303 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5304 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5306 /* Define a boolean type. This type only represents boolean values but
5307 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5308 Front ends which want to override this size (i.e. Java) can redefine
5309 boolean_type_node before calling build_common_tree_nodes_2. */
5310 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5311 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5312 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
5313 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
5314 TYPE_PRECISION (boolean_type_node) = 1;
5316 /* Fill in the rest of the sized types. Reuse existing type nodes
5318 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
5319 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
5320 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
5321 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
5322 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
5324 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
5325 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
5326 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
5327 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
5328 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
5330 access_public_node = get_identifier ("public");
5331 access_protected_node = get_identifier ("protected");
5332 access_private_node = get_identifier ("private");
5335 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5336 It will create several other common tree nodes. */
5339 build_common_tree_nodes_2 (int short_double)
5341 /* Define these next since types below may used them. */
5342 integer_zero_node = build_int_2 (0, 0);
5343 integer_one_node = build_int_2 (1, 0);
5344 integer_minus_one_node = build_int_2 (-1, -1);
5346 size_zero_node = size_int (0);
5347 size_one_node = size_int (1);
5348 bitsize_zero_node = bitsize_int (0);
5349 bitsize_one_node = bitsize_int (1);
5350 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5352 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5353 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5355 void_type_node = make_node (VOID_TYPE);
5356 layout_type (void_type_node);
5358 /* We are not going to have real types in C with less than byte alignment,
5359 so we might as well not have any types that claim to have it. */
5360 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5361 TYPE_USER_ALIGN (void_type_node) = 0;
5363 null_pointer_node = build_int_2 (0, 0);
5364 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5365 layout_type (TREE_TYPE (null_pointer_node));
5367 ptr_type_node = build_pointer_type (void_type_node);
5369 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5370 fileptr_type_node = ptr_type_node;
5372 float_type_node = make_node (REAL_TYPE);
5373 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5374 layout_type (float_type_node);
5376 double_type_node = make_node (REAL_TYPE);
5378 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5380 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5381 layout_type (double_type_node);
5383 long_double_type_node = make_node (REAL_TYPE);
5384 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5385 layout_type (long_double_type_node);
5387 float_ptr_type_node = build_pointer_type (float_type_node);
5388 double_ptr_type_node = build_pointer_type (double_type_node);
5389 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5390 integer_ptr_type_node = build_pointer_type (integer_type_node);
5392 complex_integer_type_node = make_node (COMPLEX_TYPE);
5393 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5394 layout_type (complex_integer_type_node);
5396 complex_float_type_node = make_node (COMPLEX_TYPE);
5397 TREE_TYPE (complex_float_type_node) = float_type_node;
5398 layout_type (complex_float_type_node);
5400 complex_double_type_node = make_node (COMPLEX_TYPE);
5401 TREE_TYPE (complex_double_type_node) = double_type_node;
5402 layout_type (complex_double_type_node);
5404 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5405 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5406 layout_type (complex_long_double_type_node);
5409 tree t = targetm.build_builtin_va_list ();
5411 /* Many back-ends define record types without setting TYPE_NAME.
5412 If we copied the record type here, we'd keep the original
5413 record type without a name. This breaks name mangling. So,
5414 don't copy record types and let c_common_nodes_and_builtins()
5415 declare the type to be __builtin_va_list. */
5416 if (TREE_CODE (t) != RECORD_TYPE)
5417 t = build_type_copy (t);
5419 va_list_type_node = t;
5423 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5426 If we requested a pointer to a vector, build up the pointers that
5427 we stripped off while looking for the inner type. Similarly for
5428 return values from functions.
5430 The argument TYPE is the top of the chain, and BOTTOM is the
5431 new type which we will point to. */
5434 reconstruct_complex_type (tree type, tree bottom)
5438 if (POINTER_TYPE_P (type))
5440 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5441 outer = build_pointer_type (inner);
5443 else if (TREE_CODE (type) == ARRAY_TYPE)
5445 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5446 outer = build_array_type (inner, TYPE_DOMAIN (type));
5448 else if (TREE_CODE (type) == FUNCTION_TYPE)
5450 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5451 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5453 else if (TREE_CODE (type) == METHOD_TYPE)
5455 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5456 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5458 TYPE_ARG_TYPES (type));
5463 TYPE_READONLY (outer) = TYPE_READONLY (type);
5464 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
5469 /* Returns a vector tree node given a vector mode and inner type. */
5471 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5474 t = make_node (VECTOR_TYPE);
5475 TREE_TYPE (t) = innertype;
5476 TYPE_MODE (t) = mode;
5477 finish_vector_type (t);
5481 /* Similarly, but takes inner type and units. */
5484 build_vector_type (tree innertype, int nunits)
5486 enum machine_mode innermode = TYPE_MODE (innertype);
5487 enum machine_mode mode;
5489 if (GET_MODE_CLASS (innermode) == MODE_FLOAT)
5490 mode = MIN_MODE_VECTOR_FLOAT;
5492 mode = MIN_MODE_VECTOR_INT;
5494 for (; mode != VOIDmode ; mode = GET_MODE_WIDER_MODE (mode))
5495 if (GET_MODE_NUNITS (mode) == nunits && GET_MODE_INNER (mode) == innermode)
5496 return build_vector_type_for_mode (innertype, mode);
5501 /* Given an initializer INIT, return TRUE if INIT is zero or some
5502 aggregate of zeros. Otherwise return FALSE. */
5504 initializer_zerop (tree init)
5510 switch (TREE_CODE (init))
5513 return integer_zerop (init);
5516 /* ??? Note that this is not correct for C4X float formats. There,
5517 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5518 negative exponent. */
5519 return real_zerop (init)
5520 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5523 return integer_zerop (init)
5524 || (real_zerop (init)
5525 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5526 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5529 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
5530 if (!initializer_zerop (TREE_VALUE (elt)))
5535 elt = CONSTRUCTOR_ELTS (init);
5536 if (elt == NULL_TREE)
5539 /* A set is empty only if it has no elements. */
5540 if (TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5543 for (; elt ; elt = TREE_CHAIN (elt))
5544 if (! initializer_zerop (TREE_VALUE (elt)))
5554 add_var_to_bind_expr (tree bind_expr, tree var)
5556 BIND_EXPR_VARS (bind_expr)
5557 = chainon (BIND_EXPR_VARS (bind_expr), var);
5558 if (BIND_EXPR_BLOCK (bind_expr))
5559 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
5560 = BIND_EXPR_VARS (bind_expr);
5563 /* Build an empty statement. */
5566 build_empty_stmt (void)
5568 return build1 (NOP_EXPR, void_type_node, size_zero_node);
5572 /* Return true if T (assumed to be a DECL) must be assigned a memory
5576 needs_to_live_in_memory (tree t)
5578 return (DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL (t)
5580 || DECL_EXTERNAL (t)
5581 || DECL_NONLOCAL (t)
5582 || (TREE_CODE (t) == RESULT_DECL
5583 && aggregate_value_p (t, current_function_decl))
5584 || decl_function_context (t) != current_function_decl);
5587 #include "gt-tree.h"