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"
53 /* obstack.[ch] explicitly declined to prototype this. */
54 extern int _obstack_allocated_p (struct obstack *h, void *obj);
56 #ifdef GATHER_STATISTICS
57 /* Statistics-gathering stuff. */
59 int tree_node_counts[(int) all_kinds];
60 int tree_node_sizes[(int) all_kinds];
62 /* Keep in sync with tree.h:enum tree_node_kind. */
63 static const char * const tree_node_kind_names[] = {
82 #endif /* GATHER_STATISTICS */
84 /* Unique id for next decl created. */
85 static GTY(()) int next_decl_uid;
86 /* Unique id for next type created. */
87 static GTY(()) int next_type_uid = 1;
89 /* Since we cannot rehash a type after it is in the table, we have to
90 keep the hash code. */
92 struct type_hash GTY(())
98 /* Initial size of the hash table (rounded to next prime). */
99 #define TYPE_HASH_INITIAL_SIZE 1000
101 /* Now here is the hash table. When recording a type, it is added to
102 the slot whose index is the hash code. Note that the hash table is
103 used for several kinds of types (function types, array types and
104 array index range types, for now). While all these live in the
105 same table, they are completely independent, and the hash code is
106 computed differently for each of these. */
108 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
109 htab_t type_hash_table;
111 static void set_type_quals (tree, int);
112 static int type_hash_eq (const void *, const void *);
113 static hashval_t type_hash_hash (const void *);
114 static void print_type_hash_statistics (void);
115 static tree make_vector_type (tree, int, enum machine_mode);
116 static int type_hash_marked_p (const void *);
117 static unsigned int type_hash_list (tree, hashval_t);
118 static unsigned int attribute_hash_list (tree, hashval_t);
120 tree global_trees[TI_MAX];
121 tree integer_types[itk_none];
128 /* Initialize the hash table of types. */
129 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
134 /* The name of the object as the assembler will see it (but before any
135 translations made by ASM_OUTPUT_LABELREF). Often this is the same
136 as DECL_NAME. It is an IDENTIFIER_NODE. */
138 decl_assembler_name (tree decl)
140 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
141 lang_hooks.set_decl_assembler_name (decl);
142 return DECL_CHECK (decl)->decl.assembler_name;
145 /* Compute the number of bytes occupied by 'node'. This routine only
146 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
148 tree_size (tree node)
150 enum tree_code code = TREE_CODE (node);
152 switch (TREE_CODE_CLASS (code))
154 case 'd': /* A decl node */
155 return sizeof (struct tree_decl);
157 case 't': /* a type node */
158 return sizeof (struct tree_type);
160 case 'r': /* a reference */
161 case 'e': /* an expression */
162 case 's': /* an expression with side effects */
163 case '<': /* a comparison expression */
164 case '1': /* a unary arithmetic expression */
165 case '2': /* a binary arithmetic expression */
166 return (sizeof (struct tree_exp)
167 + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
169 case 'c': /* a constant */
172 case INTEGER_CST: return sizeof (struct tree_int_cst);
173 case REAL_CST: return sizeof (struct tree_real_cst);
174 case COMPLEX_CST: return sizeof (struct tree_complex);
175 case VECTOR_CST: return sizeof (struct tree_vector);
176 case STRING_CST: return sizeof (struct tree_string);
178 return lang_hooks.tree_size (code);
181 case 'x': /* something random, like an identifier. */
184 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
185 case TREE_LIST: return sizeof (struct tree_list);
186 case TREE_VEC: return (sizeof (struct tree_vec)
187 + TREE_VEC_LENGTH(node) * sizeof(char *)
191 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
193 case PHI_NODE: return (sizeof (struct tree_phi_node)
194 + (PHI_ARG_CAPACITY (node) - 1) *
195 sizeof (struct phi_arg_d));
197 case SSA_NAME: return sizeof (struct tree_ssa_name);
199 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
200 case BLOCK: return sizeof (struct tree_block);
201 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
204 return lang_hooks.tree_size (code);
212 /* Return a newly allocated node of code CODE.
213 For decl and type nodes, some other fields are initialized.
214 The rest of the node is initialized to zero.
216 Achoo! I got a code in the node. */
219 make_node_stat (enum tree_code code MEM_STAT_DECL)
222 int type = TREE_CODE_CLASS (code);
224 #ifdef GATHER_STATISTICS
227 struct tree_common ttmp;
229 /* We can't allocate a TREE_VEC, PHI_NODE, or STRING_CST
230 without knowing how many elements it will have. */
231 if (code == TREE_VEC || code == PHI_NODE)
234 TREE_SET_CODE ((tree)&ttmp, code);
235 length = tree_size ((tree)&ttmp);
237 #ifdef GATHER_STATISTICS
240 case 'd': /* A decl node */
244 case 't': /* a type node */
248 case 's': /* an expression with side effects */
252 case 'r': /* a reference */
256 case 'e': /* an expression */
257 case '<': /* a comparison expression */
258 case '1': /* a unary arithmetic expression */
259 case '2': /* a binary arithmetic expression */
263 case 'c': /* a constant */
267 case 'x': /* something random, like an identifier. */
268 if (code == IDENTIFIER_NODE)
270 else if (code == TREE_VEC)
272 else if (code == TREE_BINFO)
274 else if (code == PHI_NODE)
276 else if (code == SSA_NAME)
277 kind = ssa_name_kind;
278 else if (code == BLOCK)
288 tree_node_counts[(int) kind]++;
289 tree_node_sizes[(int) kind] += length;
292 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
294 memset (t, 0, length);
296 TREE_SET_CODE (t, code);
301 TREE_SIDE_EFFECTS (t) = 1;
305 if (code != FUNCTION_DECL)
307 DECL_USER_ALIGN (t) = 0;
308 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
309 DECL_SOURCE_LOCATION (t) = input_location;
310 DECL_UID (t) = next_decl_uid++;
312 /* We have not yet computed the alias set for this declaration. */
313 DECL_POINTER_ALIAS_SET (t) = -1;
317 TYPE_UID (t) = next_type_uid++;
318 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
319 TYPE_USER_ALIGN (t) = 0;
320 TYPE_MAIN_VARIANT (t) = t;
322 /* Default to no attributes for type, but let target change that. */
323 TYPE_ATTRIBUTES (t) = NULL_TREE;
324 targetm.set_default_type_attributes (t);
326 /* We have not yet computed the alias set for this type. */
327 TYPE_ALIAS_SET (t) = -1;
331 TREE_CONSTANT (t) = 1;
332 TREE_INVARIANT (t) = 1;
341 case PREDECREMENT_EXPR:
342 case PREINCREMENT_EXPR:
343 case POSTDECREMENT_EXPR:
344 case POSTINCREMENT_EXPR:
345 /* All of these have side-effects, no matter what their
347 TREE_SIDE_EFFECTS (t) = 1;
359 /* Return a new node with the same contents as NODE except that its
360 TREE_CHAIN is zero and it has a fresh uid. */
363 copy_node_stat (tree node MEM_STAT_DECL)
366 enum tree_code code = TREE_CODE (node);
369 #ifdef ENABLE_CHECKING
370 if (code == STATEMENT_LIST)
374 length = tree_size (node);
375 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
376 memcpy (t, node, length);
379 TREE_ASM_WRITTEN (t) = 0;
380 TREE_VISITED (t) = 0;
383 if (TREE_CODE_CLASS (code) == 'd')
384 DECL_UID (t) = next_decl_uid++;
385 else if (TREE_CODE_CLASS (code) == 't')
387 TYPE_UID (t) = next_type_uid++;
388 /* The following is so that the debug code for
389 the copy is different from the original type.
390 The two statements usually duplicate each other
391 (because they clear fields of the same union),
392 but the optimizer should catch that. */
393 TYPE_SYMTAB_POINTER (t) = 0;
394 TYPE_SYMTAB_ADDRESS (t) = 0;
396 /* Do not copy the values cache. */
397 if (TYPE_CACHED_VALUES_P(t))
399 TYPE_CACHED_VALUES_P (t) = 0;
400 TYPE_CACHED_VALUES (t) = NULL_TREE;
407 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
408 For example, this can copy a list made of TREE_LIST nodes. */
411 copy_list (tree list)
419 head = prev = copy_node (list);
420 next = TREE_CHAIN (list);
423 TREE_CHAIN (prev) = copy_node (next);
424 prev = TREE_CHAIN (prev);
425 next = TREE_CHAIN (next);
431 /* Create an INT_CST node with a LOW value sign extended. */
434 build_int_cst (tree type, HOST_WIDE_INT low)
436 return build_int_cst_wide (type, low,
440 /* Create an INT_CST node with a LOW value zero extended. */
443 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
445 return build_int_cst_wide (type, low, 0);
448 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
449 integer_type_node is used. */
452 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
459 type = integer_type_node;
461 switch (TREE_CODE (type))
465 /* Cache NULL pointer. */
474 /* Cache false or true. */
483 if (TYPE_UNSIGNED (type))
486 limit = INTEGER_SHARE_LIMIT;
487 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
493 limit = INTEGER_SHARE_LIMIT + 1;
494 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
496 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
506 if (!TYPE_CACHED_VALUES_P (type))
508 TYPE_CACHED_VALUES_P (type) = 1;
509 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
512 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
515 /* Make sure no one is clobbering the shared constant. */
516 if (TREE_TYPE (t) != type)
518 if (TREE_INT_CST_LOW (t) != low || TREE_INT_CST_HIGH (t) != hi)
524 t = make_node (INTEGER_CST);
526 TREE_INT_CST_LOW (t) = low;
527 TREE_INT_CST_HIGH (t) = hi;
528 TREE_TYPE (t) = type;
531 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
536 /* Return a new VECTOR_CST node whose type is TYPE and whose values
537 are in a list pointed by VALS. */
540 build_vector (tree type, tree vals)
542 tree v = make_node (VECTOR_CST);
543 int over1 = 0, over2 = 0;
546 TREE_VECTOR_CST_ELTS (v) = vals;
547 TREE_TYPE (v) = type;
549 /* Iterate through elements and check for overflow. */
550 for (link = vals; link; link = TREE_CHAIN (link))
552 tree value = TREE_VALUE (link);
554 over1 |= TREE_OVERFLOW (value);
555 over2 |= TREE_CONSTANT_OVERFLOW (value);
558 TREE_OVERFLOW (v) = over1;
559 TREE_CONSTANT_OVERFLOW (v) = over2;
564 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
565 are in a list pointed to by VALS. */
567 build_constructor (tree type, tree vals)
569 tree c = make_node (CONSTRUCTOR);
570 TREE_TYPE (c) = type;
571 CONSTRUCTOR_ELTS (c) = vals;
573 /* ??? May not be necessary. Mirrors what build does. */
576 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
577 TREE_READONLY (c) = TREE_READONLY (vals);
578 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
579 TREE_INVARIANT (c) = TREE_INVARIANT (vals);
585 /* Return a new REAL_CST node whose type is TYPE and value is D. */
588 build_real (tree type, REAL_VALUE_TYPE d)
594 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
595 Consider doing it via real_convert now. */
597 v = make_node (REAL_CST);
598 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
599 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
601 TREE_TYPE (v) = type;
602 TREE_REAL_CST_PTR (v) = dp;
603 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
607 /* Return a new REAL_CST node whose type is TYPE
608 and whose value is the integer value of the INTEGER_CST node I. */
611 real_value_from_int_cst (tree type, tree i)
615 /* Clear all bits of the real value type so that we can later do
616 bitwise comparisons to see if two values are the same. */
617 memset (&d, 0, sizeof d);
619 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
620 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
621 TYPE_UNSIGNED (TREE_TYPE (i)));
625 /* Given a tree representing an integer constant I, return a tree
626 representing the same value as a floating-point constant of type TYPE. */
629 build_real_from_int_cst (tree type, tree i)
632 int overflow = TREE_OVERFLOW (i);
634 v = build_real (type, real_value_from_int_cst (type, i));
636 TREE_OVERFLOW (v) |= overflow;
637 TREE_CONSTANT_OVERFLOW (v) |= overflow;
641 /* Return a newly constructed STRING_CST node whose value is
642 the LEN characters at STR.
643 The TREE_TYPE is not initialized. */
646 build_string (int len, const char *str)
648 tree s = make_node (STRING_CST);
650 TREE_STRING_LENGTH (s) = len;
651 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
656 /* Return a newly constructed COMPLEX_CST node whose value is
657 specified by the real and imaginary parts REAL and IMAG.
658 Both REAL and IMAG should be constant nodes. TYPE, if specified,
659 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
662 build_complex (tree type, tree real, tree imag)
664 tree t = make_node (COMPLEX_CST);
666 TREE_REALPART (t) = real;
667 TREE_IMAGPART (t) = imag;
668 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
669 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
670 TREE_CONSTANT_OVERFLOW (t)
671 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
675 /* Build a BINFO with LEN language slots. */
678 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
681 size_t length = (offsetof (struct tree_binfo, base_binfos)
682 + VEC_embedded_size (tree, base_binfos));
684 #ifdef GATHER_STATISTICS
685 tree_node_counts[(int) binfo_kind]++;
686 tree_node_sizes[(int) binfo_kind] += length;
689 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
691 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
693 TREE_SET_CODE (t, TREE_BINFO);
695 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
701 /* Build a newly constructed TREE_VEC node of length LEN. */
704 make_tree_vec_stat (int len MEM_STAT_DECL)
707 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
709 #ifdef GATHER_STATISTICS
710 tree_node_counts[(int) vec_kind]++;
711 tree_node_sizes[(int) vec_kind] += length;
714 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
716 memset (t, 0, length);
718 TREE_SET_CODE (t, TREE_VEC);
719 TREE_VEC_LENGTH (t) = len;
724 /* Return 1 if EXPR is the integer constant zero or a complex constant
728 integer_zerop (tree expr)
732 return ((TREE_CODE (expr) == INTEGER_CST
733 && ! TREE_CONSTANT_OVERFLOW (expr)
734 && TREE_INT_CST_LOW (expr) == 0
735 && TREE_INT_CST_HIGH (expr) == 0)
736 || (TREE_CODE (expr) == COMPLEX_CST
737 && integer_zerop (TREE_REALPART (expr))
738 && integer_zerop (TREE_IMAGPART (expr))));
741 /* Return 1 if EXPR is the integer constant one or the corresponding
745 integer_onep (tree expr)
749 return ((TREE_CODE (expr) == INTEGER_CST
750 && ! TREE_CONSTANT_OVERFLOW (expr)
751 && TREE_INT_CST_LOW (expr) == 1
752 && TREE_INT_CST_HIGH (expr) == 0)
753 || (TREE_CODE (expr) == COMPLEX_CST
754 && integer_onep (TREE_REALPART (expr))
755 && integer_zerop (TREE_IMAGPART (expr))));
758 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
759 it contains. Likewise for the corresponding complex constant. */
762 integer_all_onesp (tree expr)
769 if (TREE_CODE (expr) == COMPLEX_CST
770 && integer_all_onesp (TREE_REALPART (expr))
771 && integer_zerop (TREE_IMAGPART (expr)))
774 else if (TREE_CODE (expr) != INTEGER_CST
775 || TREE_CONSTANT_OVERFLOW (expr))
778 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
780 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
781 && TREE_INT_CST_HIGH (expr) == -1);
783 /* Note that using TYPE_PRECISION here is wrong. We care about the
784 actual bits, not the (arbitrary) range of the type. */
785 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
786 if (prec >= HOST_BITS_PER_WIDE_INT)
788 HOST_WIDE_INT high_value;
791 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
793 if (shift_amount > HOST_BITS_PER_WIDE_INT)
794 /* Can not handle precisions greater than twice the host int size. */
796 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
797 /* Shifting by the host word size is undefined according to the ANSI
798 standard, so we must handle this as a special case. */
801 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
803 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
804 && TREE_INT_CST_HIGH (expr) == high_value);
807 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
810 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
814 integer_pow2p (tree expr)
817 HOST_WIDE_INT high, low;
821 if (TREE_CODE (expr) == COMPLEX_CST
822 && integer_pow2p (TREE_REALPART (expr))
823 && integer_zerop (TREE_IMAGPART (expr)))
826 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
829 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
830 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
831 high = TREE_INT_CST_HIGH (expr);
832 low = TREE_INT_CST_LOW (expr);
834 /* First clear all bits that are beyond the type's precision in case
835 we've been sign extended. */
837 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
839 else if (prec > HOST_BITS_PER_WIDE_INT)
840 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
844 if (prec < HOST_BITS_PER_WIDE_INT)
845 low &= ~((HOST_WIDE_INT) (-1) << prec);
848 if (high == 0 && low == 0)
851 return ((high == 0 && (low & (low - 1)) == 0)
852 || (low == 0 && (high & (high - 1)) == 0));
855 /* Return 1 if EXPR is an integer constant other than zero or a
856 complex constant other than zero. */
859 integer_nonzerop (tree expr)
863 return ((TREE_CODE (expr) == INTEGER_CST
864 && ! TREE_CONSTANT_OVERFLOW (expr)
865 && (TREE_INT_CST_LOW (expr) != 0
866 || TREE_INT_CST_HIGH (expr) != 0))
867 || (TREE_CODE (expr) == COMPLEX_CST
868 && (integer_nonzerop (TREE_REALPART (expr))
869 || integer_nonzerop (TREE_IMAGPART (expr)))));
872 /* Return the power of two represented by a tree node known to be a
876 tree_log2 (tree expr)
879 HOST_WIDE_INT high, low;
883 if (TREE_CODE (expr) == COMPLEX_CST)
884 return tree_log2 (TREE_REALPART (expr));
886 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
887 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
889 high = TREE_INT_CST_HIGH (expr);
890 low = TREE_INT_CST_LOW (expr);
892 /* First clear all bits that are beyond the type's precision in case
893 we've been sign extended. */
895 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
897 else if (prec > HOST_BITS_PER_WIDE_INT)
898 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
902 if (prec < HOST_BITS_PER_WIDE_INT)
903 low &= ~((HOST_WIDE_INT) (-1) << prec);
906 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
910 /* Similar, but return the largest integer Y such that 2 ** Y is less
911 than or equal to EXPR. */
914 tree_floor_log2 (tree expr)
917 HOST_WIDE_INT high, low;
921 if (TREE_CODE (expr) == COMPLEX_CST)
922 return tree_log2 (TREE_REALPART (expr));
924 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
925 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
927 high = TREE_INT_CST_HIGH (expr);
928 low = TREE_INT_CST_LOW (expr);
930 /* First clear all bits that are beyond the type's precision in case
931 we've been sign extended. Ignore if type's precision hasn't been set
932 since what we are doing is setting it. */
934 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
936 else if (prec > HOST_BITS_PER_WIDE_INT)
937 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
941 if (prec < HOST_BITS_PER_WIDE_INT)
942 low &= ~((HOST_WIDE_INT) (-1) << prec);
945 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
949 /* Return 1 if EXPR is the real constant zero. */
952 real_zerop (tree expr)
956 return ((TREE_CODE (expr) == REAL_CST
957 && ! TREE_CONSTANT_OVERFLOW (expr)
958 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
959 || (TREE_CODE (expr) == COMPLEX_CST
960 && real_zerop (TREE_REALPART (expr))
961 && real_zerop (TREE_IMAGPART (expr))));
964 /* Return 1 if EXPR is the real constant one in real or complex form. */
967 real_onep (tree expr)
971 return ((TREE_CODE (expr) == REAL_CST
972 && ! TREE_CONSTANT_OVERFLOW (expr)
973 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
974 || (TREE_CODE (expr) == COMPLEX_CST
975 && real_onep (TREE_REALPART (expr))
976 && real_zerop (TREE_IMAGPART (expr))));
979 /* Return 1 if EXPR is the real constant two. */
982 real_twop (tree expr)
986 return ((TREE_CODE (expr) == REAL_CST
987 && ! TREE_CONSTANT_OVERFLOW (expr)
988 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
989 || (TREE_CODE (expr) == COMPLEX_CST
990 && real_twop (TREE_REALPART (expr))
991 && real_zerop (TREE_IMAGPART (expr))));
994 /* Return 1 if EXPR is the real constant minus one. */
997 real_minus_onep (tree expr)
1001 return ((TREE_CODE (expr) == REAL_CST
1002 && ! TREE_CONSTANT_OVERFLOW (expr)
1003 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1004 || (TREE_CODE (expr) == COMPLEX_CST
1005 && real_minus_onep (TREE_REALPART (expr))
1006 && real_zerop (TREE_IMAGPART (expr))));
1009 /* Nonzero if EXP is a constant or a cast of a constant. */
1012 really_constant_p (tree exp)
1014 /* This is not quite the same as STRIP_NOPS. It does more. */
1015 while (TREE_CODE (exp) == NOP_EXPR
1016 || TREE_CODE (exp) == CONVERT_EXPR
1017 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1018 exp = TREE_OPERAND (exp, 0);
1019 return TREE_CONSTANT (exp);
1022 /* Return first list element whose TREE_VALUE is ELEM.
1023 Return 0 if ELEM is not in LIST. */
1026 value_member (tree elem, tree list)
1030 if (elem == TREE_VALUE (list))
1032 list = TREE_CHAIN (list);
1037 /* Return first list element whose TREE_PURPOSE is ELEM.
1038 Return 0 if ELEM is not in LIST. */
1041 purpose_member (tree elem, tree list)
1045 if (elem == TREE_PURPOSE (list))
1047 list = TREE_CHAIN (list);
1052 /* Return nonzero if ELEM is part of the chain CHAIN. */
1055 chain_member (tree elem, tree chain)
1061 chain = TREE_CHAIN (chain);
1067 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1068 We expect a null pointer to mark the end of the chain.
1069 This is the Lisp primitive `length'. */
1072 list_length (tree t)
1075 #ifdef ENABLE_TREE_CHECKING
1083 #ifdef ENABLE_TREE_CHECKING
1095 /* Returns the number of FIELD_DECLs in TYPE. */
1098 fields_length (tree type)
1100 tree t = TYPE_FIELDS (type);
1103 for (; t; t = TREE_CHAIN (t))
1104 if (TREE_CODE (t) == FIELD_DECL)
1110 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1111 by modifying the last node in chain 1 to point to chain 2.
1112 This is the Lisp primitive `nconc'. */
1115 chainon (tree op1, tree op2)
1124 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1126 TREE_CHAIN (t1) = op2;
1128 #ifdef ENABLE_TREE_CHECKING
1131 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1133 abort (); /* Circularity created. */
1140 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1143 tree_last (tree chain)
1147 while ((next = TREE_CHAIN (chain)))
1152 /* Reverse the order of elements in the chain T,
1153 and return the new head of the chain (old last element). */
1158 tree prev = 0, decl, next;
1159 for (decl = t; decl; decl = next)
1161 next = TREE_CHAIN (decl);
1162 TREE_CHAIN (decl) = prev;
1168 /* Return a newly created TREE_LIST node whose
1169 purpose and value fields are PARM and VALUE. */
1172 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1174 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1175 TREE_PURPOSE (t) = parm;
1176 TREE_VALUE (t) = value;
1180 /* Return a newly created TREE_LIST node whose
1181 purpose and value fields are PURPOSE and VALUE
1182 and whose TREE_CHAIN is CHAIN. */
1185 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1189 node = ggc_alloc_zone_stat (sizeof (struct tree_list),
1190 tree_zone PASS_MEM_STAT);
1192 memset (node, 0, sizeof (struct tree_common));
1194 #ifdef GATHER_STATISTICS
1195 tree_node_counts[(int) x_kind]++;
1196 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1199 TREE_SET_CODE (node, TREE_LIST);
1200 TREE_CHAIN (node) = chain;
1201 TREE_PURPOSE (node) = purpose;
1202 TREE_VALUE (node) = value;
1207 /* Return the size nominally occupied by an object of type TYPE
1208 when it resides in memory. The value is measured in units of bytes,
1209 and its data type is that normally used for type sizes
1210 (which is the first type created by make_signed_type or
1211 make_unsigned_type). */
1214 size_in_bytes (tree type)
1218 if (type == error_mark_node)
1219 return integer_zero_node;
1221 type = TYPE_MAIN_VARIANT (type);
1222 t = TYPE_SIZE_UNIT (type);
1226 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1227 return size_zero_node;
1230 if (TREE_CODE (t) == INTEGER_CST)
1231 t = force_fit_type (t, 0, false, false);
1236 /* Return the size of TYPE (in bytes) as a wide integer
1237 or return -1 if the size can vary or is larger than an integer. */
1240 int_size_in_bytes (tree type)
1244 if (type == error_mark_node)
1247 type = TYPE_MAIN_VARIANT (type);
1248 t = TYPE_SIZE_UNIT (type);
1250 || TREE_CODE (t) != INTEGER_CST
1251 || TREE_OVERFLOW (t)
1252 || TREE_INT_CST_HIGH (t) != 0
1253 /* If the result would appear negative, it's too big to represent. */
1254 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1257 return TREE_INT_CST_LOW (t);
1260 /* Return the bit position of FIELD, in bits from the start of the record.
1261 This is a tree of type bitsizetype. */
1264 bit_position (tree field)
1266 return bit_from_pos (DECL_FIELD_OFFSET (field),
1267 DECL_FIELD_BIT_OFFSET (field));
1270 /* Likewise, but return as an integer. Abort if it cannot be represented
1271 in that way (since it could be a signed value, we don't have the option
1272 of returning -1 like int_size_in_byte can. */
1275 int_bit_position (tree field)
1277 return tree_low_cst (bit_position (field), 0);
1280 /* Return the byte position of FIELD, in bytes from the start of the record.
1281 This is a tree of type sizetype. */
1284 byte_position (tree field)
1286 return byte_from_pos (DECL_FIELD_OFFSET (field),
1287 DECL_FIELD_BIT_OFFSET (field));
1290 /* Likewise, but return as an integer. Abort if it cannot be represented
1291 in that way (since it could be a signed value, we don't have the option
1292 of returning -1 like int_size_in_byte can. */
1295 int_byte_position (tree field)
1297 return tree_low_cst (byte_position (field), 0);
1300 /* Return the strictest alignment, in bits, that T is known to have. */
1305 unsigned int align0, align1;
1307 switch (TREE_CODE (t))
1309 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1310 /* If we have conversions, we know that the alignment of the
1311 object must meet each of the alignments of the types. */
1312 align0 = expr_align (TREE_OPERAND (t, 0));
1313 align1 = TYPE_ALIGN (TREE_TYPE (t));
1314 return MAX (align0, align1);
1316 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1317 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1318 case CLEANUP_POINT_EXPR:
1319 /* These don't change the alignment of an object. */
1320 return expr_align (TREE_OPERAND (t, 0));
1323 /* The best we can do is say that the alignment is the least aligned
1325 align0 = expr_align (TREE_OPERAND (t, 1));
1326 align1 = expr_align (TREE_OPERAND (t, 2));
1327 return MIN (align0, align1);
1329 case LABEL_DECL: case CONST_DECL:
1330 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1331 if (DECL_ALIGN (t) != 0)
1332 return DECL_ALIGN (t);
1336 return FUNCTION_BOUNDARY;
1342 /* Otherwise take the alignment from that of the type. */
1343 return TYPE_ALIGN (TREE_TYPE (t));
1346 /* Return, as a tree node, the number of elements for TYPE (which is an
1347 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1350 array_type_nelts (tree type)
1352 tree index_type, min, max;
1354 /* If they did it with unspecified bounds, then we should have already
1355 given an error about it before we got here. */
1356 if (! TYPE_DOMAIN (type))
1357 return error_mark_node;
1359 index_type = TYPE_DOMAIN (type);
1360 min = TYPE_MIN_VALUE (index_type);
1361 max = TYPE_MAX_VALUE (index_type);
1363 return (integer_zerop (min)
1365 : fold (build2 (MINUS_EXPR, TREE_TYPE (max), max, min)));
1368 /* If arg is static -- a reference to an object in static storage -- then
1369 return the object. This is not the same as the C meaning of `static'.
1370 If arg isn't static, return NULL. */
1375 switch (TREE_CODE (arg))
1378 /* Nested functions aren't static, since taking their address
1379 involves a trampoline. */
1380 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1381 && ! DECL_NON_ADDR_CONST_P (arg)
1385 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1386 && ! DECL_THREAD_LOCAL (arg)
1387 && ! DECL_NON_ADDR_CONST_P (arg)
1391 return TREE_STATIC (arg) ? arg : NULL;
1398 /* If the thing being referenced is not a field, then it is
1399 something language specific. */
1400 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1401 return (*lang_hooks.staticp) (arg);
1403 /* If we are referencing a bitfield, we can't evaluate an
1404 ADDR_EXPR at compile time and so it isn't a constant. */
1405 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1408 return staticp (TREE_OPERAND (arg, 0));
1414 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
1417 case ARRAY_RANGE_REF:
1418 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1419 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1420 return staticp (TREE_OPERAND (arg, 0));
1425 if ((unsigned int) TREE_CODE (arg)
1426 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1427 return lang_hooks.staticp (arg);
1433 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1434 Do this to any expression which may be used in more than one place,
1435 but must be evaluated only once.
1437 Normally, expand_expr would reevaluate the expression each time.
1438 Calling save_expr produces something that is evaluated and recorded
1439 the first time expand_expr is called on it. Subsequent calls to
1440 expand_expr just reuse the recorded value.
1442 The call to expand_expr that generates code that actually computes
1443 the value is the first call *at compile time*. Subsequent calls
1444 *at compile time* generate code to use the saved value.
1445 This produces correct result provided that *at run time* control
1446 always flows through the insns made by the first expand_expr
1447 before reaching the other places where the save_expr was evaluated.
1448 You, the caller of save_expr, must make sure this is so.
1450 Constants, and certain read-only nodes, are returned with no
1451 SAVE_EXPR because that is safe. Expressions containing placeholders
1452 are not touched; see tree.def for an explanation of what these
1456 save_expr (tree expr)
1458 tree t = fold (expr);
1461 /* If the tree evaluates to a constant, then we don't want to hide that
1462 fact (i.e. this allows further folding, and direct checks for constants).
1463 However, a read-only object that has side effects cannot be bypassed.
1464 Since it is no problem to reevaluate literals, we just return the
1466 inner = skip_simple_arithmetic (t);
1468 if (TREE_INVARIANT (inner)
1469 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1470 || TREE_CODE (inner) == SAVE_EXPR
1471 || TREE_CODE (inner) == ERROR_MARK)
1474 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1475 it means that the size or offset of some field of an object depends on
1476 the value within another field.
1478 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1479 and some variable since it would then need to be both evaluated once and
1480 evaluated more than once. Front-ends must assure this case cannot
1481 happen by surrounding any such subexpressions in their own SAVE_EXPR
1482 and forcing evaluation at the proper time. */
1483 if (contains_placeholder_p (inner))
1486 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
1488 /* This expression might be placed ahead of a jump to ensure that the
1489 value was computed on both sides of the jump. So make sure it isn't
1490 eliminated as dead. */
1491 TREE_SIDE_EFFECTS (t) = 1;
1492 TREE_READONLY (t) = 1;
1493 TREE_INVARIANT (t) = 1;
1497 /* Look inside EXPR and into any simple arithmetic operations. Return
1498 the innermost non-arithmetic node. */
1501 skip_simple_arithmetic (tree expr)
1505 /* We don't care about whether this can be used as an lvalue in this
1507 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1508 expr = TREE_OPERAND (expr, 0);
1510 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1511 a constant, it will be more efficient to not make another SAVE_EXPR since
1512 it will allow better simplification and GCSE will be able to merge the
1513 computations if they actually occur. */
1517 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1518 inner = TREE_OPERAND (inner, 0);
1519 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1521 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1522 inner = TREE_OPERAND (inner, 0);
1523 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1524 inner = TREE_OPERAND (inner, 1);
1535 /* Returns the index of the first non-tree operand for CODE, or the number
1536 of operands if all are trees. */
1539 first_rtl_op (enum tree_code code)
1544 return TREE_CODE_LENGTH (code);
1548 /* Return which tree structure is used by T. */
1550 enum tree_node_structure_enum
1551 tree_node_structure (tree t)
1553 enum tree_code code = TREE_CODE (t);
1555 switch (TREE_CODE_CLASS (code))
1557 case 'd': return TS_DECL;
1558 case 't': return TS_TYPE;
1559 case 'r': case '<': case '1': case '2': case 'e': case 's':
1561 default: /* 'c' and 'x' */
1567 case INTEGER_CST: return TS_INT_CST;
1568 case REAL_CST: return TS_REAL_CST;
1569 case COMPLEX_CST: return TS_COMPLEX;
1570 case VECTOR_CST: return TS_VECTOR;
1571 case STRING_CST: return TS_STRING;
1573 case ERROR_MARK: return TS_COMMON;
1574 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1575 case TREE_LIST: return TS_LIST;
1576 case TREE_VEC: return TS_VEC;
1577 case PHI_NODE: return TS_PHI_NODE;
1578 case SSA_NAME: return TS_SSA_NAME;
1579 case PLACEHOLDER_EXPR: return TS_COMMON;
1580 case STATEMENT_LIST: return TS_STATEMENT_LIST;
1581 case BLOCK: return TS_BLOCK;
1582 case TREE_BINFO: return TS_BINFO;
1583 case VALUE_HANDLE: return TS_VALUE_HANDLE;
1590 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1591 or offset that depends on a field within a record. */
1594 contains_placeholder_p (tree exp)
1596 enum tree_code code;
1601 code = TREE_CODE (exp);
1602 if (code == PLACEHOLDER_EXPR)
1605 switch (TREE_CODE_CLASS (code))
1608 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1609 position computations since they will be converted into a
1610 WITH_RECORD_EXPR involving the reference, which will assume
1611 here will be valid. */
1612 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1615 if (code == TREE_LIST)
1616 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1617 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1626 /* Ignoring the first operand isn't quite right, but works best. */
1627 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1630 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1631 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1632 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1638 switch (first_rtl_op (code))
1641 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1643 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1644 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1655 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1656 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1660 type_contains_placeholder_p (tree type)
1662 /* If the size contains a placeholder or the parent type (component type in
1663 the case of arrays) type involves a placeholder, this type does. */
1664 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1665 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1666 || (TREE_TYPE (type) != 0
1667 && type_contains_placeholder_p (TREE_TYPE (type))))
1670 /* Now do type-specific checks. Note that the last part of the check above
1671 greatly limits what we have to do below. */
1672 switch (TREE_CODE (type))
1681 case REFERENCE_TYPE:
1689 /* Here we just check the bounds. */
1690 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1691 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1696 /* We're already checked the component type (TREE_TYPE), so just check
1698 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1702 case QUAL_UNION_TYPE:
1704 static tree seen_types = 0;
1708 /* We have to be careful here that we don't end up in infinite
1709 recursions due to a field of a type being a pointer to that type
1710 or to a mutually-recursive type. So we store a list of record
1711 types that we've seen and see if this type is in them. To save
1712 memory, we don't use a list for just one type. Here we check
1713 whether we've seen this type before and store it if not. */
1714 if (seen_types == 0)
1716 else if (TREE_CODE (seen_types) != TREE_LIST)
1718 if (seen_types == type)
1721 seen_types = tree_cons (NULL_TREE, type,
1722 build_tree_list (NULL_TREE, seen_types));
1726 if (value_member (type, seen_types) != 0)
1729 seen_types = tree_cons (NULL_TREE, type, seen_types);
1732 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1733 if (TREE_CODE (field) == FIELD_DECL
1734 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1735 || (TREE_CODE (type) == QUAL_UNION_TYPE
1736 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1737 || type_contains_placeholder_p (TREE_TYPE (field))))
1743 /* Now remove us from seen_types and return the result. */
1744 if (seen_types == type)
1747 seen_types = TREE_CHAIN (seen_types);
1757 /* Return 1 if EXP contains any expressions that produce cleanups for an
1758 outer scope to deal with. Used by fold. */
1761 has_cleanups (tree exp)
1765 if (! TREE_SIDE_EFFECTS (exp))
1768 switch (TREE_CODE (exp))
1771 case WITH_CLEANUP_EXPR:
1774 case CLEANUP_POINT_EXPR:
1778 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1780 cmp = has_cleanups (TREE_VALUE (exp));
1787 return (DECL_INITIAL (DECL_EXPR_DECL (exp))
1788 && has_cleanups (DECL_INITIAL (DECL_EXPR_DECL (exp))));
1794 /* This general rule works for most tree codes. All exceptions should be
1795 handled above. If this is a language-specific tree code, we can't
1796 trust what might be in the operand, so say we don't know
1798 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1801 nops = first_rtl_op (TREE_CODE (exp));
1802 for (i = 0; i < nops; i++)
1803 if (TREE_OPERAND (exp, i) != 0)
1805 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1806 if (type == 'e' || type == '<' || type == '1' || type == '2'
1807 || type == 'r' || type == 's')
1809 cmp = has_cleanups (TREE_OPERAND (exp, i));
1818 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1819 return a tree with all occurrences of references to F in a
1820 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1821 contains only arithmetic expressions or a CALL_EXPR with a
1822 PLACEHOLDER_EXPR occurring only in its arglist. */
1825 substitute_in_expr (tree exp, tree f, tree r)
1827 enum tree_code code = TREE_CODE (exp);
1832 /* We handle TREE_LIST and COMPONENT_REF separately. */
1833 if (code == TREE_LIST)
1835 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1836 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1837 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1840 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1842 else if (code == COMPONENT_REF)
1844 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1845 and it is the right field, replace it with R. */
1846 for (inner = TREE_OPERAND (exp, 0);
1847 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1848 inner = TREE_OPERAND (inner, 0))
1850 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1851 && TREE_OPERAND (exp, 1) == f)
1854 /* If this expression hasn't been completed let, leave it alone. */
1855 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1858 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1859 if (op0 == TREE_OPERAND (exp, 0))
1862 new = fold (build3 (COMPONENT_REF, TREE_TYPE (exp),
1863 op0, TREE_OPERAND (exp, 1), NULL_TREE));
1866 switch (TREE_CODE_CLASS (code))
1878 switch (first_rtl_op (code))
1884 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1885 if (op0 == TREE_OPERAND (exp, 0))
1888 new = fold (build1 (code, TREE_TYPE (exp), op0));
1892 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1893 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1895 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1898 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
1902 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1903 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1904 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
1906 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1907 && op2 == TREE_OPERAND (exp, 2))
1910 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
1922 TREE_READONLY (new) = TREE_READONLY (exp);
1926 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1927 for it within OBJ, a tree that is an object or a chain of references. */
1930 substitute_placeholder_in_expr (tree exp, tree obj)
1932 enum tree_code code = TREE_CODE (exp);
1933 tree op0, op1, op2, op3;
1935 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
1936 in the chain of OBJ. */
1937 if (code == PLACEHOLDER_EXPR)
1939 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
1942 for (elt = obj; elt != 0;
1943 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
1944 || TREE_CODE (elt) == COND_EXPR)
1945 ? TREE_OPERAND (elt, 1)
1946 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
1947 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
1948 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
1949 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
1950 ? TREE_OPERAND (elt, 0) : 0))
1951 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
1954 for (elt = obj; elt != 0;
1955 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
1956 || TREE_CODE (elt) == COND_EXPR)
1957 ? TREE_OPERAND (elt, 1)
1958 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
1959 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
1960 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
1961 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
1962 ? TREE_OPERAND (elt, 0) : 0))
1963 if (POINTER_TYPE_P (TREE_TYPE (elt))
1964 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
1966 return fold (build1 (INDIRECT_REF, need_type, elt));
1968 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
1969 survives until RTL generation, there will be an error. */
1973 /* TREE_LIST is special because we need to look at TREE_VALUE
1974 and TREE_CHAIN, not TREE_OPERANDS. */
1975 else if (code == TREE_LIST)
1977 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
1978 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
1979 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1982 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1985 switch (TREE_CODE_CLASS (code))
1998 switch (first_rtl_op (code))
2004 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2005 if (op0 == TREE_OPERAND (exp, 0))
2008 return fold (build1 (code, TREE_TYPE (exp), op0));
2011 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2012 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2014 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2017 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2020 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2021 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2022 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2024 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2025 && op2 == TREE_OPERAND (exp, 2))
2028 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2031 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2032 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2033 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2034 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2036 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2037 && op2 == TREE_OPERAND (exp, 2)
2038 && op3 == TREE_OPERAND (exp, 3))
2041 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2053 /* Stabilize a reference so that we can use it any number of times
2054 without causing its operands to be evaluated more than once.
2055 Returns the stabilized reference. This works by means of save_expr,
2056 so see the caveats in the comments about save_expr.
2058 Also allows conversion expressions whose operands are references.
2059 Any other kind of expression is returned unchanged. */
2062 stabilize_reference (tree ref)
2065 enum tree_code code = TREE_CODE (ref);
2072 /* No action is needed in this case. */
2078 case FIX_TRUNC_EXPR:
2079 case FIX_FLOOR_EXPR:
2080 case FIX_ROUND_EXPR:
2082 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2086 result = build_nt (INDIRECT_REF,
2087 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2091 result = build_nt (COMPONENT_REF,
2092 stabilize_reference (TREE_OPERAND (ref, 0)),
2093 TREE_OPERAND (ref, 1), NULL_TREE);
2097 result = build_nt (BIT_FIELD_REF,
2098 stabilize_reference (TREE_OPERAND (ref, 0)),
2099 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2100 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2104 result = build_nt (ARRAY_REF,
2105 stabilize_reference (TREE_OPERAND (ref, 0)),
2106 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2107 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2110 case ARRAY_RANGE_REF:
2111 result = build_nt (ARRAY_RANGE_REF,
2112 stabilize_reference (TREE_OPERAND (ref, 0)),
2113 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2114 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2118 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2119 it wouldn't be ignored. This matters when dealing with
2121 return stabilize_reference_1 (ref);
2123 /* If arg isn't a kind of lvalue we recognize, make no change.
2124 Caller should recognize the error for an invalid lvalue. */
2129 return error_mark_node;
2132 TREE_TYPE (result) = TREE_TYPE (ref);
2133 TREE_READONLY (result) = TREE_READONLY (ref);
2134 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2135 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2140 /* Subroutine of stabilize_reference; this is called for subtrees of
2141 references. Any expression with side-effects must be put in a SAVE_EXPR
2142 to ensure that it is only evaluated once.
2144 We don't put SAVE_EXPR nodes around everything, because assigning very
2145 simple expressions to temporaries causes us to miss good opportunities
2146 for optimizations. Among other things, the opportunity to fold in the
2147 addition of a constant into an addressing mode often gets lost, e.g.
2148 "y[i+1] += x;". In general, we take the approach that we should not make
2149 an assignment unless we are forced into it - i.e., that any non-side effect
2150 operator should be allowed, and that cse should take care of coalescing
2151 multiple utterances of the same expression should that prove fruitful. */
2154 stabilize_reference_1 (tree e)
2157 enum tree_code code = TREE_CODE (e);
2159 /* We cannot ignore const expressions because it might be a reference
2160 to a const array but whose index contains side-effects. But we can
2161 ignore things that are actual constant or that already have been
2162 handled by this function. */
2164 if (TREE_INVARIANT (e))
2167 switch (TREE_CODE_CLASS (code))
2176 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2177 so that it will only be evaluated once. */
2178 /* The reference (r) and comparison (<) classes could be handled as
2179 below, but it is generally faster to only evaluate them once. */
2180 if (TREE_SIDE_EFFECTS (e))
2181 return save_expr (e);
2185 /* Constants need no processing. In fact, we should never reach
2190 /* Division is slow and tends to be compiled with jumps,
2191 especially the division by powers of 2 that is often
2192 found inside of an array reference. So do it just once. */
2193 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2194 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2195 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2196 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2197 return save_expr (e);
2198 /* Recursively stabilize each operand. */
2199 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2200 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2204 /* Recursively stabilize each operand. */
2205 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2212 TREE_TYPE (result) = TREE_TYPE (e);
2213 TREE_READONLY (result) = TREE_READONLY (e);
2214 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2215 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2216 TREE_INVARIANT (result) = 1;
2221 /* Low-level constructors for expressions. */
2223 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2224 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2227 recompute_tree_invarant_for_addr_expr (tree t)
2230 bool tc = true, ti = true, se = false;
2232 /* We started out assuming this address is both invariant and constant, but
2233 does not have side effects. Now go down any handled components and see if
2234 any of them involve offsets that are either non-constant or non-invariant.
2235 Also check for side-effects.
2237 ??? Note that this code makes no attempt to deal with the case where
2238 taking the address of something causes a copy due to misalignment. */
2240 #define UPDATE_TITCSE(NODE) \
2241 do { tree _node = (NODE); \
2242 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2243 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2244 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2246 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2247 node = TREE_OPERAND (node, 0))
2249 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2250 array reference (probably made temporarily by the G++ front end),
2251 so ignore all the operands. */
2252 if ((TREE_CODE (node) == ARRAY_REF
2253 || TREE_CODE (node) == ARRAY_RANGE_REF)
2254 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2256 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2257 if (TREE_OPERAND (node, 2))
2258 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2259 if (TREE_OPERAND (node, 3))
2260 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2262 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2263 FIELD_DECL, apparently. The G++ front end can put something else
2264 there, at least temporarily. */
2265 else if (TREE_CODE (node) == COMPONENT_REF
2266 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2268 if (TREE_OPERAND (node, 2))
2269 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2271 else if (TREE_CODE (node) == BIT_FIELD_REF)
2272 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2275 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2276 it. If it's a decl, it's invariant and constant if the decl is static.
2277 It's also invariant if it's a decl in the current function. (Taking the
2278 address of a volatile variable is not volatile.) If it's a constant,
2279 the address is both invariant and constant. Otherwise it's neither. */
2280 if (TREE_CODE (node) == INDIRECT_REF)
2282 /* If this is &((T*)0)->field, then this is a form of addition. */
2283 if (TREE_CODE (TREE_OPERAND (node, 0)) != INTEGER_CST)
2284 UPDATE_TITCSE (node);
2286 else if (DECL_P (node))
2290 else if (decl_function_context (node) == current_function_decl)
2295 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 'c')
2300 se |= TREE_SIDE_EFFECTS (node);
2303 TREE_CONSTANT (t) = tc;
2304 TREE_INVARIANT (t) = ti;
2305 TREE_SIDE_EFFECTS (t) = se;
2306 #undef UPDATE_TITCSE
2309 /* Build an expression of code CODE, data type TYPE, and operands as
2310 specified. Expressions and reference nodes can be created this way.
2311 Constants, decls, types and misc nodes cannot be.
2313 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2314 enough for all extant tree codes. These functions can be called
2315 directly (preferably!), but can also be obtained via GCC preprocessor
2316 magic within the build macro. */
2319 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2323 #ifdef ENABLE_CHECKING
2324 if (TREE_CODE_LENGTH (code) != 0)
2328 t = make_node_stat (code PASS_MEM_STAT);
2335 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2337 int length = sizeof (struct tree_exp);
2338 #ifdef GATHER_STATISTICS
2339 tree_node_kind kind;
2343 #ifdef GATHER_STATISTICS
2344 switch (TREE_CODE_CLASS (code))
2346 case 's': /* an expression with side effects */
2349 case 'r': /* a reference */
2357 tree_node_counts[(int) kind]++;
2358 tree_node_sizes[(int) kind] += length;
2361 #ifdef ENABLE_CHECKING
2362 if (TREE_CODE_LENGTH (code) != 1)
2364 #endif /* ENABLE_CHECKING */
2366 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2368 memset (t, 0, sizeof (struct tree_common));
2370 TREE_SET_CODE (t, code);
2372 TREE_TYPE (t) = type;
2373 #ifdef USE_MAPPED_LOCATION
2374 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2376 SET_EXPR_LOCUS (t, NULL);
2378 TREE_COMPLEXITY (t) = 0;
2379 TREE_OPERAND (t, 0) = node;
2380 TREE_BLOCK (t) = NULL_TREE;
2381 if (node && !TYPE_P (node) && first_rtl_op (code) != 0)
2383 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2384 TREE_READONLY (t) = TREE_READONLY (node);
2387 if (TREE_CODE_CLASS (code) == 's')
2388 TREE_SIDE_EFFECTS (t) = 1;
2394 case PREDECREMENT_EXPR:
2395 case PREINCREMENT_EXPR:
2396 case POSTDECREMENT_EXPR:
2397 case POSTINCREMENT_EXPR:
2398 /* All of these have side-effects, no matter what their
2400 TREE_SIDE_EFFECTS (t) = 1;
2401 TREE_READONLY (t) = 0;
2405 /* Whether a dereference is readonly has nothing to do with whether
2406 its operand is readonly. */
2407 TREE_READONLY (t) = 0;
2412 recompute_tree_invarant_for_addr_expr (t);
2416 if (TREE_CODE_CLASS (code) == '1' && node && !TYPE_P (node)
2417 && TREE_CONSTANT (node))
2418 TREE_CONSTANT (t) = 1;
2419 if (TREE_CODE_CLASS (code) == '1' && node && TREE_INVARIANT (node))
2420 TREE_INVARIANT (t) = 1;
2421 if (TREE_CODE_CLASS (code) == 'r' && node && TREE_THIS_VOLATILE (node))
2422 TREE_THIS_VOLATILE (t) = 1;
2429 #define PROCESS_ARG(N) \
2431 TREE_OPERAND (t, N) = arg##N; \
2432 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2434 if (TREE_SIDE_EFFECTS (arg##N)) \
2436 if (!TREE_READONLY (arg##N)) \
2438 if (!TREE_CONSTANT (arg##N)) \
2440 if (!TREE_INVARIANT (arg##N)) \
2446 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2448 bool constant, read_only, side_effects, invariant;
2452 #ifdef ENABLE_CHECKING
2453 if (TREE_CODE_LENGTH (code) != 2)
2457 t = make_node_stat (code PASS_MEM_STAT);
2460 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2461 result based on those same flags for the arguments. But if the
2462 arguments aren't really even `tree' expressions, we shouldn't be trying
2464 fro = first_rtl_op (code);
2466 /* Expressions without side effects may be constant if their
2467 arguments are as well. */
2468 constant = (TREE_CODE_CLASS (code) == '<'
2469 || TREE_CODE_CLASS (code) == '2');
2471 side_effects = TREE_SIDE_EFFECTS (t);
2472 invariant = constant;
2477 TREE_READONLY (t) = read_only;
2478 TREE_CONSTANT (t) = constant;
2479 TREE_INVARIANT (t) = invariant;
2480 TREE_SIDE_EFFECTS (t) = side_effects;
2481 TREE_THIS_VOLATILE (t)
2482 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2488 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2489 tree arg2 MEM_STAT_DECL)
2491 bool constant, read_only, side_effects, invariant;
2495 #ifdef ENABLE_CHECKING
2496 if (TREE_CODE_LENGTH (code) != 3)
2500 t = make_node_stat (code PASS_MEM_STAT);
2503 fro = first_rtl_op (code);
2505 side_effects = TREE_SIDE_EFFECTS (t);
2511 if (code == CALL_EXPR && !side_effects)
2516 /* Calls have side-effects, except those to const or
2518 i = call_expr_flags (t);
2519 if (!(i & (ECF_CONST | ECF_PURE)))
2522 /* And even those have side-effects if their arguments do. */
2523 else for (node = arg1; node; node = TREE_CHAIN (node))
2524 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2531 TREE_SIDE_EFFECTS (t) = side_effects;
2532 TREE_THIS_VOLATILE (t)
2533 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2539 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2540 tree arg2, tree arg3 MEM_STAT_DECL)
2542 bool constant, read_only, side_effects, invariant;
2546 #ifdef ENABLE_CHECKING
2547 if (TREE_CODE_LENGTH (code) != 4)
2551 t = make_node_stat (code PASS_MEM_STAT);
2554 fro = first_rtl_op (code);
2556 side_effects = TREE_SIDE_EFFECTS (t);
2563 TREE_SIDE_EFFECTS (t) = side_effects;
2564 TREE_THIS_VOLATILE (t)
2565 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2570 /* Backup definition for non-gcc build compilers. */
2573 (build) (enum tree_code code, tree tt, ...)
2575 tree t, arg0, arg1, arg2, arg3;
2576 int length = TREE_CODE_LENGTH (code);
2583 t = build0 (code, tt);
2586 arg0 = va_arg (p, tree);
2587 t = build1 (code, tt, arg0);
2590 arg0 = va_arg (p, tree);
2591 arg1 = va_arg (p, tree);
2592 t = build2 (code, tt, arg0, arg1);
2595 arg0 = va_arg (p, tree);
2596 arg1 = va_arg (p, tree);
2597 arg2 = va_arg (p, tree);
2598 t = build3 (code, tt, arg0, arg1, arg2);
2601 arg0 = va_arg (p, tree);
2602 arg1 = va_arg (p, tree);
2603 arg2 = va_arg (p, tree);
2604 arg3 = va_arg (p, tree);
2605 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2615 /* Similar except don't specify the TREE_TYPE
2616 and leave the TREE_SIDE_EFFECTS as 0.
2617 It is permissible for arguments to be null,
2618 or even garbage if their values do not matter. */
2621 build_nt (enum tree_code code, ...)
2630 t = make_node (code);
2631 length = TREE_CODE_LENGTH (code);
2633 for (i = 0; i < length; i++)
2634 TREE_OPERAND (t, i) = va_arg (p, tree);
2640 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2641 We do NOT enter this node in any sort of symbol table.
2643 layout_decl is used to set up the decl's storage layout.
2644 Other slots are initialized to 0 or null pointers. */
2647 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2651 t = make_node_stat (code PASS_MEM_STAT);
2653 /* if (type == error_mark_node)
2654 type = integer_type_node; */
2655 /* That is not done, deliberately, so that having error_mark_node
2656 as the type can suppress useless errors in the use of this variable. */
2658 DECL_NAME (t) = name;
2659 TREE_TYPE (t) = type;
2661 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2663 else if (code == FUNCTION_DECL)
2664 DECL_MODE (t) = FUNCTION_MODE;
2666 /* Set default visibility to whatever the user supplied with
2667 visibility_specified depending on #pragma GCC visibility. */
2668 DECL_VISIBILITY (t) = default_visibility;
2669 DECL_VISIBILITY_SPECIFIED (t) = visibility_options.inpragma;
2674 /* BLOCK nodes are used to represent the structure of binding contours
2675 and declarations, once those contours have been exited and their contents
2676 compiled. This information is used for outputting debugging info. */
2679 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2680 tree supercontext, tree chain)
2682 tree block = make_node (BLOCK);
2684 BLOCK_VARS (block) = vars;
2685 BLOCK_SUBBLOCKS (block) = subblocks;
2686 BLOCK_SUPERCONTEXT (block) = supercontext;
2687 BLOCK_CHAIN (block) = chain;
2691 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2692 /* ??? gengtype doesn't handle conditionals */
2693 static GTY(()) tree last_annotated_node;
2696 #ifdef USE_MAPPED_LOCATION
2699 expand_location (source_location loc)
2701 expanded_location xloc;
2702 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
2705 const struct line_map *map = linemap_lookup (&line_table, loc);
2706 xloc.file = map->to_file;
2707 xloc.line = SOURCE_LINE (map, loc);
2708 xloc.column = SOURCE_COLUMN (map, loc);
2715 /* Record the exact location where an expression or an identifier were
2719 annotate_with_file_line (tree node, const char *file, int line)
2721 /* Roughly one percent of the calls to this function are to annotate
2722 a node with the same information already attached to that node!
2723 Just return instead of wasting memory. */
2724 if (EXPR_LOCUS (node)
2725 && (EXPR_FILENAME (node) == file
2726 || ! strcmp (EXPR_FILENAME (node), file))
2727 && EXPR_LINENO (node) == line)
2729 last_annotated_node = node;
2733 /* In heavily macroized code (such as GCC itself) this single
2734 entry cache can reduce the number of allocations by more
2736 if (last_annotated_node
2737 && EXPR_LOCUS (last_annotated_node)
2738 && (EXPR_FILENAME (last_annotated_node) == file
2739 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
2740 && EXPR_LINENO (last_annotated_node) == line)
2742 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
2746 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
2747 EXPR_LINENO (node) = line;
2748 EXPR_FILENAME (node) = file;
2749 last_annotated_node = node;
2753 annotate_with_locus (tree node, location_t locus)
2755 annotate_with_file_line (node, locus.file, locus.line);
2759 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2763 build_decl_attribute_variant (tree ddecl, tree attribute)
2765 DECL_ATTRIBUTES (ddecl) = attribute;
2769 /* Borrowed from hashtab.c iterative_hash implementation. */
2770 #define mix(a,b,c) \
2772 a -= b; a -= c; a ^= (c>>13); \
2773 b -= c; b -= a; b ^= (a<< 8); \
2774 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2775 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2776 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2777 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2778 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2779 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2780 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2784 /* Produce good hash value combining VAL and VAL2. */
2785 static inline hashval_t
2786 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
2788 /* the golden ratio; an arbitrary value. */
2789 hashval_t a = 0x9e3779b9;
2795 /* Produce good hash value combining PTR and VAL2. */
2796 static inline hashval_t
2797 iterative_hash_pointer (void *ptr, hashval_t val2)
2799 if (sizeof (ptr) == sizeof (hashval_t))
2800 return iterative_hash_hashval_t ((size_t) ptr, val2);
2803 hashval_t a = (hashval_t) (size_t) ptr;
2804 /* Avoid warnings about shifting of more than the width of the type on
2805 hosts that won't execute this path. */
2807 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
2813 /* Produce good hash value combining VAL and VAL2. */
2814 static inline hashval_t
2815 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
2817 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
2818 return iterative_hash_hashval_t (val, val2);
2821 hashval_t a = (hashval_t) val;
2822 /* Avoid warnings about shifting of more than the width of the type on
2823 hosts that won't execute this path. */
2825 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
2827 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
2829 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
2830 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
2837 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2840 Record such modified types already made so we don't make duplicates. */
2843 build_type_attribute_variant (tree ttype, tree attribute)
2845 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2847 hashval_t hashcode = 0;
2849 enum tree_code code = TREE_CODE (ttype);
2851 ntype = copy_node (ttype);
2853 TYPE_POINTER_TO (ntype) = 0;
2854 TYPE_REFERENCE_TO (ntype) = 0;
2855 TYPE_ATTRIBUTES (ntype) = attribute;
2857 /* Create a new main variant of TYPE. */
2858 TYPE_MAIN_VARIANT (ntype) = ntype;
2859 TYPE_NEXT_VARIANT (ntype) = 0;
2860 set_type_quals (ntype, TYPE_UNQUALIFIED);
2862 hashcode = iterative_hash_object (code, hashcode);
2863 if (TREE_TYPE (ntype))
2864 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2866 hashcode = attribute_hash_list (attribute, hashcode);
2868 switch (TREE_CODE (ntype))
2871 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2874 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2878 hashcode = iterative_hash_object
2879 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2880 hashcode = iterative_hash_object
2881 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2885 unsigned int precision = TYPE_PRECISION (ntype);
2886 hashcode = iterative_hash_object (precision, hashcode);
2893 ntype = type_hash_canon (hashcode, ntype);
2894 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2900 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2903 We try both `text' and `__text__', ATTR may be either one. */
2904 /* ??? It might be a reasonable simplification to require ATTR to be only
2905 `text'. One might then also require attribute lists to be stored in
2906 their canonicalized form. */
2909 is_attribute_p (const char *attr, tree ident)
2911 int ident_len, attr_len;
2914 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2917 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2920 p = IDENTIFIER_POINTER (ident);
2921 ident_len = strlen (p);
2922 attr_len = strlen (attr);
2924 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2928 || attr[attr_len - 2] != '_'
2929 || attr[attr_len - 1] != '_')
2931 if (ident_len == attr_len - 4
2932 && strncmp (attr + 2, p, attr_len - 4) == 0)
2937 if (ident_len == attr_len + 4
2938 && p[0] == '_' && p[1] == '_'
2939 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2940 && strncmp (attr, p + 2, attr_len) == 0)
2947 /* Given an attribute name and a list of attributes, return a pointer to the
2948 attribute's list element if the attribute is part of the list, or NULL_TREE
2949 if not found. If the attribute appears more than once, this only
2950 returns the first occurrence; the TREE_CHAIN of the return value should
2951 be passed back in if further occurrences are wanted. */
2954 lookup_attribute (const char *attr_name, tree list)
2958 for (l = list; l; l = TREE_CHAIN (l))
2960 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2962 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2969 /* Return an attribute list that is the union of a1 and a2. */
2972 merge_attributes (tree a1, tree a2)
2976 /* Either one unset? Take the set one. */
2978 if ((attributes = a1) == 0)
2981 /* One that completely contains the other? Take it. */
2983 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2985 if (attribute_list_contained (a2, a1))
2989 /* Pick the longest list, and hang on the other list. */
2991 if (list_length (a1) < list_length (a2))
2992 attributes = a2, a2 = a1;
2994 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2997 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3000 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3003 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
3008 a1 = copy_node (a2);
3009 TREE_CHAIN (a1) = attributes;
3018 /* Given types T1 and T2, merge their attributes and return
3022 merge_type_attributes (tree t1, tree t2)
3024 return merge_attributes (TYPE_ATTRIBUTES (t1),
3025 TYPE_ATTRIBUTES (t2));
3028 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3032 merge_decl_attributes (tree olddecl, tree newdecl)
3034 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3035 DECL_ATTRIBUTES (newdecl));
3038 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3040 /* Specialization of merge_decl_attributes for various Windows targets.
3042 This handles the following situation:
3044 __declspec (dllimport) int foo;
3047 The second instance of `foo' nullifies the dllimport. */
3050 merge_dllimport_decl_attributes (tree old, tree new)
3053 int delete_dllimport_p;
3055 old = DECL_ATTRIBUTES (old);
3056 new = DECL_ATTRIBUTES (new);
3058 /* What we need to do here is remove from `old' dllimport if it doesn't
3059 appear in `new'. dllimport behaves like extern: if a declaration is
3060 marked dllimport and a definition appears later, then the object
3061 is not dllimport'd. */
3062 if (lookup_attribute ("dllimport", old) != NULL_TREE
3063 && lookup_attribute ("dllimport", new) == NULL_TREE)
3064 delete_dllimport_p = 1;
3066 delete_dllimport_p = 0;
3068 a = merge_attributes (old, new);
3070 if (delete_dllimport_p)
3074 /* Scan the list for dllimport and delete it. */
3075 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3077 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3079 if (prev == NULL_TREE)
3082 TREE_CHAIN (prev) = TREE_CHAIN (t);
3091 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3092 struct attribute_spec.handler. */
3095 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3100 /* These attributes may apply to structure and union types being created,
3101 but otherwise should pass to the declaration involved. */
3104 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3105 | (int) ATTR_FLAG_ARRAY_NEXT))
3107 *no_add_attrs = true;
3108 return tree_cons (name, args, NULL_TREE);
3110 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3112 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3113 *no_add_attrs = true;
3119 /* Report error on dllimport ambiguities seen now before they cause
3121 if (is_attribute_p ("dllimport", name))
3123 /* Like MS, treat definition of dllimported variables and
3124 non-inlined functions on declaration as syntax errors. We
3125 allow the attribute for function definitions if declared
3127 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node)
3128 && !DECL_DECLARED_INLINE_P (node))
3130 error ("%Jfunction `%D' definition is marked dllimport.", node, node);
3131 *no_add_attrs = true;
3134 else if (TREE_CODE (node) == VAR_DECL)
3136 if (DECL_INITIAL (node))
3138 error ("%Jvariable `%D' definition is marked dllimport.",
3140 *no_add_attrs = true;
3143 /* `extern' needn't be specified with dllimport.
3144 Specify `extern' now and hope for the best. Sigh. */
3145 DECL_EXTERNAL (node) = 1;
3146 /* Also, implicitly give dllimport'd variables declared within
3147 a function global scope, unless declared static. */
3148 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3149 TREE_PUBLIC (node) = 1;
3153 /* Report error if symbol is not accessible at global scope. */
3154 if (!TREE_PUBLIC (node)
3155 && (TREE_CODE (node) == VAR_DECL
3156 || TREE_CODE (node) == FUNCTION_DECL))
3158 error ("%Jexternal linkage required for symbol '%D' because of "
3159 "'%s' attribute.", node, node, IDENTIFIER_POINTER (name));
3160 *no_add_attrs = true;
3166 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3168 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3169 of the various TYPE_QUAL values. */
3172 set_type_quals (tree type, int type_quals)
3174 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3175 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3176 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3179 /* Returns true iff cand is equivalent to base with type_quals. */
3182 check_qualified_type (tree cand, tree base, int type_quals)
3184 return (TYPE_QUALS (cand) == type_quals
3185 && TYPE_NAME (cand) == TYPE_NAME (base)
3186 /* Apparently this is needed for Objective-C. */
3187 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3188 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3189 TYPE_ATTRIBUTES (base)));
3192 /* Return a version of the TYPE, qualified as indicated by the
3193 TYPE_QUALS, if one exists. If no qualified version exists yet,
3194 return NULL_TREE. */
3197 get_qualified_type (tree type, int type_quals)
3201 if (TYPE_QUALS (type) == type_quals)
3204 /* Search the chain of variants to see if there is already one there just
3205 like the one we need to have. If so, use that existing one. We must
3206 preserve the TYPE_NAME, since there is code that depends on this. */
3207 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3208 if (check_qualified_type (t, type, type_quals))
3214 /* Like get_qualified_type, but creates the type if it does not
3215 exist. This function never returns NULL_TREE. */
3218 build_qualified_type (tree type, int type_quals)
3222 /* See if we already have the appropriate qualified variant. */
3223 t = get_qualified_type (type, type_quals);
3225 /* If not, build it. */
3228 t = build_variant_type_copy (type);
3229 set_type_quals (t, type_quals);
3235 /* Create a new distinct copy of TYPE. The new type is made its own
3239 build_distinct_type_copy (tree type)
3241 tree t = copy_node (type);
3243 TYPE_POINTER_TO (t) = 0;
3244 TYPE_REFERENCE_TO (t) = 0;
3246 /* Make it its own variant. */
3247 TYPE_MAIN_VARIANT (t) = t;
3248 TYPE_NEXT_VARIANT (t) = 0;
3253 /* Create a new variant of TYPE, equivalent but distinct.
3254 This is so the caller can modify it. */
3257 build_variant_type_copy (tree type)
3259 tree t, m = TYPE_MAIN_VARIANT (type);
3261 t = build_distinct_type_copy (type);
3263 /* Add the new type to the chain of variants of TYPE. */
3264 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3265 TYPE_NEXT_VARIANT (m) = t;
3266 TYPE_MAIN_VARIANT (t) = m;
3271 /* Hashing of types so that we don't make duplicates.
3272 The entry point is `type_hash_canon'. */
3274 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3275 with types in the TREE_VALUE slots), by adding the hash codes
3276 of the individual types. */
3279 type_hash_list (tree list, hashval_t hashcode)
3283 for (tail = list; tail; tail = TREE_CHAIN (tail))
3284 if (TREE_VALUE (tail) != error_mark_node)
3285 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3291 /* These are the Hashtable callback functions. */
3293 /* Returns true iff the types are equivalent. */
3296 type_hash_eq (const void *va, const void *vb)
3298 const struct type_hash *a = va, *b = vb;
3300 /* First test the things that are the same for all types. */
3301 if (a->hash != b->hash
3302 || TREE_CODE (a->type) != TREE_CODE (b->type)
3303 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3304 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3305 TYPE_ATTRIBUTES (b->type))
3306 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3307 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3310 switch (TREE_CODE (a->type))
3316 case REFERENCE_TYPE:
3320 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3321 && !(TYPE_VALUES (a->type)
3322 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3323 && TYPE_VALUES (b->type)
3324 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3325 && type_list_equal (TYPE_VALUES (a->type),
3326 TYPE_VALUES (b->type))))
3329 /* ... fall through ... */
3335 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3336 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3337 TYPE_MAX_VALUE (b->type)))
3338 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3339 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3340 TYPE_MIN_VALUE (b->type))));
3343 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3346 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3347 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3348 || (TYPE_ARG_TYPES (a->type)
3349 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3350 && TYPE_ARG_TYPES (b->type)
3351 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3352 && type_list_equal (TYPE_ARG_TYPES (a->type),
3353 TYPE_ARG_TYPES (b->type)))));
3357 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3361 case QUAL_UNION_TYPE:
3362 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3363 || (TYPE_FIELDS (a->type)
3364 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3365 && TYPE_FIELDS (b->type)
3366 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3367 && type_list_equal (TYPE_FIELDS (a->type),
3368 TYPE_FIELDS (b->type))));
3371 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3372 || (TYPE_ARG_TYPES (a->type)
3373 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3374 && TYPE_ARG_TYPES (b->type)
3375 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3376 && type_list_equal (TYPE_ARG_TYPES (a->type),
3377 TYPE_ARG_TYPES (b->type))));
3384 /* Return the cached hash value. */
3387 type_hash_hash (const void *item)
3389 return ((const struct type_hash *) item)->hash;
3392 /* Look in the type hash table for a type isomorphic to TYPE.
3393 If one is found, return it. Otherwise return 0. */
3396 type_hash_lookup (hashval_t hashcode, tree type)
3398 struct type_hash *h, in;
3400 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3401 must call that routine before comparing TYPE_ALIGNs. */
3407 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3413 /* Add an entry to the type-hash-table
3414 for a type TYPE whose hash code is HASHCODE. */
3417 type_hash_add (hashval_t hashcode, tree type)
3419 struct type_hash *h;
3422 h = ggc_alloc (sizeof (struct type_hash));
3425 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3426 *(struct type_hash **) loc = h;
3429 /* Given TYPE, and HASHCODE its hash code, return the canonical
3430 object for an identical type if one already exists.
3431 Otherwise, return TYPE, and record it as the canonical object.
3433 To use this function, first create a type of the sort you want.
3434 Then compute its hash code from the fields of the type that
3435 make it different from other similar types.
3436 Then call this function and use the value. */
3439 type_hash_canon (unsigned int hashcode, tree type)
3443 /* The hash table only contains main variants, so ensure that's what we're
3445 if (TYPE_MAIN_VARIANT (type) != type)
3448 if (!lang_hooks.types.hash_types)
3451 /* See if the type is in the hash table already. If so, return it.
3452 Otherwise, add the type. */
3453 t1 = type_hash_lookup (hashcode, type);
3456 #ifdef GATHER_STATISTICS
3457 tree_node_counts[(int) t_kind]--;
3458 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3464 type_hash_add (hashcode, type);
3469 /* See if the data pointed to by the type hash table is marked. We consider
3470 it marked if the type is marked or if a debug type number or symbol
3471 table entry has been made for the type. This reduces the amount of
3472 debugging output and eliminates that dependency of the debug output on
3473 the number of garbage collections. */
3476 type_hash_marked_p (const void *p)
3478 tree type = ((struct type_hash *) p)->type;
3480 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3484 print_type_hash_statistics (void)
3486 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3487 (long) htab_size (type_hash_table),
3488 (long) htab_elements (type_hash_table),
3489 htab_collisions (type_hash_table));
3492 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3493 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3494 by adding the hash codes of the individual attributes. */
3497 attribute_hash_list (tree list, hashval_t hashcode)
3501 for (tail = list; tail; tail = TREE_CHAIN (tail))
3502 /* ??? Do we want to add in TREE_VALUE too? */
3503 hashcode = iterative_hash_object
3504 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3508 /* Given two lists of attributes, return true if list l2 is
3509 equivalent to l1. */
3512 attribute_list_equal (tree l1, tree l2)
3514 return attribute_list_contained (l1, l2)
3515 && attribute_list_contained (l2, l1);
3518 /* Given two lists of attributes, return true if list L2 is
3519 completely contained within L1. */
3520 /* ??? This would be faster if attribute names were stored in a canonicalized
3521 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3522 must be used to show these elements are equivalent (which they are). */
3523 /* ??? It's not clear that attributes with arguments will always be handled
3527 attribute_list_contained (tree l1, tree l2)
3531 /* First check the obvious, maybe the lists are identical. */
3535 /* Maybe the lists are similar. */
3536 for (t1 = l1, t2 = l2;
3538 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3539 && TREE_VALUE (t1) == TREE_VALUE (t2);
3540 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3542 /* Maybe the lists are equal. */
3543 if (t1 == 0 && t2 == 0)
3546 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3549 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3551 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3554 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3561 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3568 /* Given two lists of types
3569 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3570 return 1 if the lists contain the same types in the same order.
3571 Also, the TREE_PURPOSEs must match. */
3574 type_list_equal (tree l1, tree l2)
3578 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3579 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3580 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3581 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3582 && (TREE_TYPE (TREE_PURPOSE (t1))
3583 == TREE_TYPE (TREE_PURPOSE (t2))))))
3589 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3590 given by TYPE. If the argument list accepts variable arguments,
3591 then this function counts only the ordinary arguments. */
3594 type_num_arguments (tree type)
3599 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3600 /* If the function does not take a variable number of arguments,
3601 the last element in the list will have type `void'. */
3602 if (VOID_TYPE_P (TREE_VALUE (t)))
3610 /* Nonzero if integer constants T1 and T2
3611 represent the same constant value. */
3614 tree_int_cst_equal (tree t1, tree t2)
3619 if (t1 == 0 || t2 == 0)
3622 if (TREE_CODE (t1) == INTEGER_CST
3623 && TREE_CODE (t2) == INTEGER_CST
3624 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3625 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3631 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3632 The precise way of comparison depends on their data type. */
3635 tree_int_cst_lt (tree t1, tree t2)
3640 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3642 int t1_sgn = tree_int_cst_sgn (t1);
3643 int t2_sgn = tree_int_cst_sgn (t2);
3645 if (t1_sgn < t2_sgn)
3647 else if (t1_sgn > t2_sgn)
3649 /* Otherwise, both are non-negative, so we compare them as
3650 unsigned just in case one of them would overflow a signed
3653 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3654 return INT_CST_LT (t1, t2);
3656 return INT_CST_LT_UNSIGNED (t1, t2);
3659 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3662 tree_int_cst_compare (tree t1, tree t2)
3664 if (tree_int_cst_lt (t1, t2))
3666 else if (tree_int_cst_lt (t2, t1))
3672 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3673 the host. If POS is zero, the value can be represented in a single
3674 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3675 be represented in a single unsigned HOST_WIDE_INT. */
3678 host_integerp (tree t, int pos)
3680 return (TREE_CODE (t) == INTEGER_CST
3681 && ! TREE_OVERFLOW (t)
3682 && ((TREE_INT_CST_HIGH (t) == 0
3683 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3684 || (! pos && TREE_INT_CST_HIGH (t) == -1
3685 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3686 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3687 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3690 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3691 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3692 be positive. Abort if we cannot satisfy the above conditions. */
3695 tree_low_cst (tree t, int pos)
3697 if (host_integerp (t, pos))
3698 return TREE_INT_CST_LOW (t);
3703 /* Return the most significant bit of the integer constant T. */
3706 tree_int_cst_msb (tree t)
3710 unsigned HOST_WIDE_INT l;
3712 /* Note that using TYPE_PRECISION here is wrong. We care about the
3713 actual bits, not the (arbitrary) range of the type. */
3714 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3715 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3716 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3717 return (l & 1) == 1;
3720 /* Return an indication of the sign of the integer constant T.
3721 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3722 Note that -1 will never be returned it T's type is unsigned. */
3725 tree_int_cst_sgn (tree t)
3727 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3729 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3731 else if (TREE_INT_CST_HIGH (t) < 0)
3737 /* Compare two constructor-element-type constants. Return 1 if the lists
3738 are known to be equal; otherwise return 0. */
3741 simple_cst_list_equal (tree l1, tree l2)
3743 while (l1 != NULL_TREE && l2 != NULL_TREE)
3745 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3748 l1 = TREE_CHAIN (l1);
3749 l2 = TREE_CHAIN (l2);
3755 /* Return truthvalue of whether T1 is the same tree structure as T2.
3756 Return 1 if they are the same.
3757 Return 0 if they are understandably different.
3758 Return -1 if either contains tree structure not understood by
3762 simple_cst_equal (tree t1, tree t2)
3764 enum tree_code code1, code2;
3770 if (t1 == 0 || t2 == 0)
3773 code1 = TREE_CODE (t1);
3774 code2 = TREE_CODE (t2);
3776 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3778 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3779 || code2 == NON_LVALUE_EXPR)
3780 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3782 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3785 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3786 || code2 == NON_LVALUE_EXPR)
3787 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3795 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3796 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3799 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3802 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3803 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3804 TREE_STRING_LENGTH (t1)));
3807 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1),
3808 CONSTRUCTOR_ELTS (t2));
3811 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3814 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3818 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3821 /* Special case: if either target is an unallocated VAR_DECL,
3822 it means that it's going to be unified with whatever the
3823 TARGET_EXPR is really supposed to initialize, so treat it
3824 as being equivalent to anything. */
3825 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3826 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3827 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3828 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3829 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3830 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3833 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3838 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3840 case WITH_CLEANUP_EXPR:
3841 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3845 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3848 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3849 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3863 /* This general rule works for most tree codes. All exceptions should be
3864 handled above. If this is a language-specific tree code, we can't
3865 trust what might be in the operand, so say we don't know
3867 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3870 switch (TREE_CODE_CLASS (code1))
3879 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3881 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3893 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3894 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3895 than U, respectively. */
3898 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3900 if (tree_int_cst_sgn (t) < 0)
3902 else if (TREE_INT_CST_HIGH (t) != 0)
3904 else if (TREE_INT_CST_LOW (t) == u)
3906 else if (TREE_INT_CST_LOW (t) < u)
3912 /* Return true if CODE represents an associative tree code. Otherwise
3915 associative_tree_code (enum tree_code code)
3934 /* Return true if CODE represents an commutative tree code. Otherwise
3937 commutative_tree_code (enum tree_code code)
3950 case UNORDERED_EXPR:
3954 case TRUTH_AND_EXPR:
3955 case TRUTH_XOR_EXPR:
3965 /* Generate a hash value for an expression. This can be used iteratively
3966 by passing a previous result as the "val" argument.
3968 This function is intended to produce the same hash for expressions which
3969 would compare equal using operand_equal_p. */
3972 iterative_hash_expr (tree t, hashval_t val)
3975 enum tree_code code;
3979 return iterative_hash_pointer (t, val);
3981 code = TREE_CODE (t);
3985 /* Alas, constants aren't shared, so we can't rely on pointer
3988 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
3989 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
3992 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
3994 return iterative_hash_hashval_t (val2, val);
3997 return iterative_hash (TREE_STRING_POINTER (t),
3998 TREE_STRING_LENGTH (t), val);
4000 val = iterative_hash_expr (TREE_REALPART (t), val);
4001 return iterative_hash_expr (TREE_IMAGPART (t), val);
4003 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
4007 /* we can just compare by pointer. */
4008 return iterative_hash_pointer (t, val);
4011 /* A list of expressions, for a CALL_EXPR or as the elements of a
4013 for (; t; t = TREE_CHAIN (t))
4014 val = iterative_hash_expr (TREE_VALUE (t), val);
4017 class = TREE_CODE_CLASS (code);
4021 /* Decls we can just compare by pointer. */
4022 val = iterative_hash_pointer (t, val);
4024 else if (IS_EXPR_CODE_CLASS (class))
4026 val = iterative_hash_object (code, val);
4028 /* Don't hash the type, that can lead to having nodes which
4029 compare equal according to operand_equal_p, but which
4030 have different hash codes. */
4031 if (code == NOP_EXPR
4032 || code == CONVERT_EXPR
4033 || code == NON_LVALUE_EXPR)
4035 /* Make sure to include signness in the hash computation. */
4036 val += TYPE_UNSIGNED (TREE_TYPE (t));
4037 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
4040 else if (commutative_tree_code (code))
4042 /* It's a commutative expression. We want to hash it the same
4043 however it appears. We do this by first hashing both operands
4044 and then rehashing based on the order of their independent
4046 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
4047 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
4051 t = one, one = two, two = t;
4053 val = iterative_hash_hashval_t (one, val);
4054 val = iterative_hash_hashval_t (two, val);
4057 for (i = first_rtl_op (code) - 1; i >= 0; --i)
4058 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
4067 /* Constructors for pointer, array and function types.
4068 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4069 constructed by language-dependent code, not here.) */
4071 /* Construct, lay out and return the type of pointers to TO_TYPE with
4072 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4073 reference all of memory. If such a type has already been
4074 constructed, reuse it. */
4077 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
4082 /* In some cases, languages will have things that aren't a POINTER_TYPE
4083 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4084 In that case, return that type without regard to the rest of our
4087 ??? This is a kludge, but consistent with the way this function has
4088 always operated and there doesn't seem to be a good way to avoid this
4090 if (TYPE_POINTER_TO (to_type) != 0
4091 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4092 return TYPE_POINTER_TO (to_type);
4094 /* First, if we already have a type for pointers to TO_TYPE and it's
4095 the proper mode, use it. */
4096 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4097 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4100 t = make_node (POINTER_TYPE);
4102 TREE_TYPE (t) = to_type;
4103 TYPE_MODE (t) = mode;
4104 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4105 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
4106 TYPE_POINTER_TO (to_type) = t;
4108 /* Lay out the type. This function has many callers that are concerned
4109 with expression-construction, and this simplifies them all. */
4115 /* By default build pointers in ptr_mode. */
4118 build_pointer_type (tree to_type)
4120 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4123 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4126 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4131 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4132 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4133 In that case, return that type without regard to the rest of our
4136 ??? This is a kludge, but consistent with the way this function has
4137 always operated and there doesn't seem to be a good way to avoid this
4139 if (TYPE_REFERENCE_TO (to_type) != 0
4140 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4141 return TYPE_REFERENCE_TO (to_type);
4143 /* First, if we already have a type for pointers to TO_TYPE and it's
4144 the proper mode, use it. */
4145 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4146 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4149 t = make_node (REFERENCE_TYPE);
4151 TREE_TYPE (t) = to_type;
4152 TYPE_MODE (t) = mode;
4153 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4154 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4155 TYPE_REFERENCE_TO (to_type) = t;
4163 /* Build the node for the type of references-to-TO_TYPE by default
4167 build_reference_type (tree to_type)
4169 return build_reference_type_for_mode (to_type, ptr_mode, false);
4172 /* Build a type that is compatible with t but has no cv quals anywhere
4175 const char *const *const * -> char ***. */
4178 build_type_no_quals (tree t)
4180 switch (TREE_CODE (t))
4183 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4185 TYPE_REF_CAN_ALIAS_ALL (t));
4186 case REFERENCE_TYPE:
4188 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4190 TYPE_REF_CAN_ALIAS_ALL (t));
4192 return TYPE_MAIN_VARIANT (t);
4196 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4197 MAXVAL should be the maximum value in the domain
4198 (one less than the length of the array).
4200 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4201 We don't enforce this limit, that is up to caller (e.g. language front end).
4202 The limit exists because the result is a signed type and we don't handle
4203 sizes that use more than one HOST_WIDE_INT. */
4206 build_index_type (tree maxval)
4208 tree itype = make_node (INTEGER_TYPE);
4210 TREE_TYPE (itype) = sizetype;
4211 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4212 TYPE_MIN_VALUE (itype) = size_zero_node;
4213 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4214 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4215 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4216 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4217 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4218 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4220 if (host_integerp (maxval, 1))
4221 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4226 /* Builds a signed or unsigned integer type of precision PRECISION.
4227 Used for C bitfields whose precision does not match that of
4228 built-in target types. */
4230 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
4233 tree itype = make_node (INTEGER_TYPE);
4235 TYPE_PRECISION (itype) = precision;
4238 fixup_unsigned_type (itype);
4240 fixup_signed_type (itype);
4242 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
4243 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
4248 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4249 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4250 low bound LOWVAL and high bound HIGHVAL.
4251 if TYPE==NULL_TREE, sizetype is used. */
4254 build_range_type (tree type, tree lowval, tree highval)
4256 tree itype = make_node (INTEGER_TYPE);
4258 TREE_TYPE (itype) = type;
4259 if (type == NULL_TREE)
4262 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4263 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4265 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4266 TYPE_MODE (itype) = TYPE_MODE (type);
4267 TYPE_SIZE (itype) = TYPE_SIZE (type);
4268 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4269 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4270 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4272 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4273 return type_hash_canon (tree_low_cst (highval, 0)
4274 - tree_low_cst (lowval, 0),
4280 /* Just like build_index_type, but takes lowval and highval instead
4281 of just highval (maxval). */
4284 build_index_2_type (tree lowval, tree highval)
4286 return build_range_type (sizetype, lowval, highval);
4289 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4290 and number of elements specified by the range of values of INDEX_TYPE.
4291 If such a type has already been constructed, reuse it. */
4294 build_array_type (tree elt_type, tree index_type)
4297 hashval_t hashcode = 0;
4299 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4301 error ("arrays of functions are not meaningful");
4302 elt_type = integer_type_node;
4305 t = make_node (ARRAY_TYPE);
4306 TREE_TYPE (t) = elt_type;
4307 TYPE_DOMAIN (t) = index_type;
4309 if (index_type == 0)
4312 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4313 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4314 t = type_hash_canon (hashcode, t);
4316 if (!COMPLETE_TYPE_P (t))
4321 /* Return the TYPE of the elements comprising
4322 the innermost dimension of ARRAY. */
4325 get_inner_array_type (tree array)
4327 tree type = TREE_TYPE (array);
4329 while (TREE_CODE (type) == ARRAY_TYPE)
4330 type = TREE_TYPE (type);
4335 /* Construct, lay out and return
4336 the type of functions returning type VALUE_TYPE
4337 given arguments of types ARG_TYPES.
4338 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4339 are data type nodes for the arguments of the function.
4340 If such a type has already been constructed, reuse it. */
4343 build_function_type (tree value_type, tree arg_types)
4346 hashval_t hashcode = 0;
4348 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4350 error ("function return type cannot be function");
4351 value_type = integer_type_node;
4354 /* Make a node of the sort we want. */
4355 t = make_node (FUNCTION_TYPE);
4356 TREE_TYPE (t) = value_type;
4357 TYPE_ARG_TYPES (t) = arg_types;
4359 /* If we already have such a type, use the old one. */
4360 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4361 hashcode = type_hash_list (arg_types, hashcode);
4362 t = type_hash_canon (hashcode, t);
4364 if (!COMPLETE_TYPE_P (t))
4369 /* Build a function type. The RETURN_TYPE is the type returned by the
4370 function. If additional arguments are provided, they are
4371 additional argument types. The list of argument types must always
4372 be terminated by NULL_TREE. */
4375 build_function_type_list (tree return_type, ...)
4380 va_start (p, return_type);
4382 t = va_arg (p, tree);
4383 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4384 args = tree_cons (NULL_TREE, t, args);
4387 args = nreverse (args);
4388 TREE_CHAIN (last) = void_list_node;
4389 args = build_function_type (return_type, args);
4395 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4396 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4397 for the method. An implicit additional parameter (of type
4398 pointer-to-BASETYPE) is added to the ARGTYPES. */
4401 build_method_type_directly (tree basetype,
4409 /* Make a node of the sort we want. */
4410 t = make_node (METHOD_TYPE);
4412 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4413 TREE_TYPE (t) = rettype;
4414 ptype = build_pointer_type (basetype);
4416 /* The actual arglist for this function includes a "hidden" argument
4417 which is "this". Put it into the list of argument types. */
4418 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4419 TYPE_ARG_TYPES (t) = argtypes;
4421 /* If we already have such a type, use the old one. */
4422 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4423 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4424 hashcode = type_hash_list (argtypes, hashcode);
4425 t = type_hash_canon (hashcode, t);
4427 if (!COMPLETE_TYPE_P (t))
4433 /* Construct, lay out and return the type of methods belonging to class
4434 BASETYPE and whose arguments and values are described by TYPE.
4435 If that type exists already, reuse it.
4436 TYPE must be a FUNCTION_TYPE node. */
4439 build_method_type (tree basetype, tree type)
4441 if (TREE_CODE (type) != FUNCTION_TYPE)
4444 return build_method_type_directly (basetype,
4446 TYPE_ARG_TYPES (type));
4449 /* Construct, lay out and return the type of offsets to a value
4450 of type TYPE, within an object of type BASETYPE.
4451 If a suitable offset type exists already, reuse it. */
4454 build_offset_type (tree basetype, tree type)
4457 hashval_t hashcode = 0;
4459 /* Make a node of the sort we want. */
4460 t = make_node (OFFSET_TYPE);
4462 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4463 TREE_TYPE (t) = type;
4465 /* If we already have such a type, use the old one. */
4466 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4467 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4468 t = type_hash_canon (hashcode, t);
4470 if (!COMPLETE_TYPE_P (t))
4476 /* Create a complex type whose components are COMPONENT_TYPE. */
4479 build_complex_type (tree component_type)
4484 /* Make a node of the sort we want. */
4485 t = make_node (COMPLEX_TYPE);
4487 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4489 /* If we already have such a type, use the old one. */
4490 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4491 t = type_hash_canon (hashcode, t);
4493 if (!COMPLETE_TYPE_P (t))
4496 /* If we are writing Dwarf2 output we need to create a name,
4497 since complex is a fundamental type. */
4498 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4502 if (component_type == char_type_node)
4503 name = "complex char";
4504 else if (component_type == signed_char_type_node)
4505 name = "complex signed char";
4506 else if (component_type == unsigned_char_type_node)
4507 name = "complex unsigned char";
4508 else if (component_type == short_integer_type_node)
4509 name = "complex short int";
4510 else if (component_type == short_unsigned_type_node)
4511 name = "complex short unsigned int";
4512 else if (component_type == integer_type_node)
4513 name = "complex int";
4514 else if (component_type == unsigned_type_node)
4515 name = "complex unsigned int";
4516 else if (component_type == long_integer_type_node)
4517 name = "complex long int";
4518 else if (component_type == long_unsigned_type_node)
4519 name = "complex long unsigned int";
4520 else if (component_type == long_long_integer_type_node)
4521 name = "complex long long int";
4522 else if (component_type == long_long_unsigned_type_node)
4523 name = "complex long long unsigned int";
4528 TYPE_NAME (t) = get_identifier (name);
4531 return build_qualified_type (t, TYPE_QUALS (component_type));
4534 /* Return OP, stripped of any conversions to wider types as much as is safe.
4535 Converting the value back to OP's type makes a value equivalent to OP.
4537 If FOR_TYPE is nonzero, we return a value which, if converted to
4538 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4540 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4541 narrowest type that can hold the value, even if they don't exactly fit.
4542 Otherwise, bit-field references are changed to a narrower type
4543 only if they can be fetched directly from memory in that type.
4545 OP must have integer, real or enumeral type. Pointers are not allowed!
4547 There are some cases where the obvious value we could return
4548 would regenerate to OP if converted to OP's type,
4549 but would not extend like OP to wider types.
4550 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4551 For example, if OP is (unsigned short)(signed char)-1,
4552 we avoid returning (signed char)-1 if FOR_TYPE is int,
4553 even though extending that to an unsigned short would regenerate OP,
4554 since the result of extending (signed char)-1 to (int)
4555 is different from (int) OP. */
4558 get_unwidened (tree op, tree for_type)
4560 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4561 tree type = TREE_TYPE (op);
4563 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4565 = (for_type != 0 && for_type != type
4566 && final_prec > TYPE_PRECISION (type)
4567 && TYPE_UNSIGNED (type));
4570 while (TREE_CODE (op) == NOP_EXPR)
4573 = TYPE_PRECISION (TREE_TYPE (op))
4574 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4576 /* Truncations are many-one so cannot be removed.
4577 Unless we are later going to truncate down even farther. */
4579 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4582 /* See what's inside this conversion. If we decide to strip it,
4584 op = TREE_OPERAND (op, 0);
4586 /* If we have not stripped any zero-extensions (uns is 0),
4587 we can strip any kind of extension.
4588 If we have previously stripped a zero-extension,
4589 only zero-extensions can safely be stripped.
4590 Any extension can be stripped if the bits it would produce
4591 are all going to be discarded later by truncating to FOR_TYPE. */
4595 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4597 /* TYPE_UNSIGNED says whether this is a zero-extension.
4598 Let's avoid computing it if it does not affect WIN
4599 and if UNS will not be needed again. */
4600 if ((uns || TREE_CODE (op) == NOP_EXPR)
4601 && TYPE_UNSIGNED (TREE_TYPE (op)))
4609 if (TREE_CODE (op) == COMPONENT_REF
4610 /* Since type_for_size always gives an integer type. */
4611 && TREE_CODE (type) != REAL_TYPE
4612 /* Don't crash if field not laid out yet. */
4613 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4614 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4616 unsigned int innerprec
4617 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4618 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4619 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4620 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4622 /* We can get this structure field in the narrowest type it fits in.
4623 If FOR_TYPE is 0, do this only for a field that matches the
4624 narrower type exactly and is aligned for it
4625 The resulting extension to its nominal type (a fullword type)
4626 must fit the same conditions as for other extensions. */
4629 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4630 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4631 && (! uns || final_prec <= innerprec || unsignedp))
4633 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4634 TREE_OPERAND (op, 1), NULL_TREE);
4635 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4636 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4643 /* Return OP or a simpler expression for a narrower value
4644 which can be sign-extended or zero-extended to give back OP.
4645 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4646 or 0 if the value should be sign-extended. */
4649 get_narrower (tree op, int *unsignedp_ptr)
4654 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
4656 while (TREE_CODE (op) == NOP_EXPR)
4659 = (TYPE_PRECISION (TREE_TYPE (op))
4660 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4662 /* Truncations are many-one so cannot be removed. */
4666 /* See what's inside this conversion. If we decide to strip it,
4671 op = TREE_OPERAND (op, 0);
4672 /* An extension: the outermost one can be stripped,
4673 but remember whether it is zero or sign extension. */
4675 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4676 /* Otherwise, if a sign extension has been stripped,
4677 only sign extensions can now be stripped;
4678 if a zero extension has been stripped, only zero-extensions. */
4679 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4683 else /* bitschange == 0 */
4685 /* A change in nominal type can always be stripped, but we must
4686 preserve the unsignedness. */
4688 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4690 op = TREE_OPERAND (op, 0);
4691 /* Keep trying to narrow, but don't assign op to win if it
4692 would turn an integral type into something else. */
4693 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
4700 if (TREE_CODE (op) == COMPONENT_REF
4701 /* Since type_for_size always gives an integer type. */
4702 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4703 /* Ensure field is laid out already. */
4704 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4705 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4707 unsigned HOST_WIDE_INT innerprec
4708 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4709 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4710 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4711 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4713 /* We can get this structure field in a narrower type that fits it,
4714 but the resulting extension to its nominal type (a fullword type)
4715 must satisfy the same conditions as for other extensions.
4717 Do this only for fields that are aligned (not bit-fields),
4718 because when bit-field insns will be used there is no
4719 advantage in doing this. */
4721 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4722 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4723 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
4727 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
4728 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4729 TREE_OPERAND (op, 1), NULL_TREE);
4730 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4731 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4734 *unsignedp_ptr = uns;
4738 /* Nonzero if integer constant C has a value that is permissible
4739 for type TYPE (an INTEGER_TYPE). */
4742 int_fits_type_p (tree c, tree type)
4744 tree type_low_bound = TYPE_MIN_VALUE (type);
4745 tree type_high_bound = TYPE_MAX_VALUE (type);
4746 int ok_for_low_bound, ok_for_high_bound;
4748 /* Perform some generic filtering first, which may allow making a decision
4749 even if the bounds are not constant. First, negative integers never fit
4750 in unsigned types, */
4751 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4752 /* Also, unsigned integers with top bit set never fit signed types. */
4753 || (! TYPE_UNSIGNED (type)
4754 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4757 /* If at least one bound of the type is a constant integer, we can check
4758 ourselves and maybe make a decision. If no such decision is possible, but
4759 this type is a subtype, try checking against that. Otherwise, use
4760 force_fit_type, which checks against the precision.
4762 Compute the status for each possibly constant bound, and return if we see
4763 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4764 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4765 for "constant known to fit". */
4767 ok_for_low_bound = -1;
4768 ok_for_high_bound = -1;
4770 /* Check if C >= type_low_bound. */
4771 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4773 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4774 if (! ok_for_low_bound)
4778 /* Check if c <= type_high_bound. */
4779 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4781 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4782 if (! ok_for_high_bound)
4786 /* If the constant fits both bounds, the result is known. */
4787 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4790 /* If we haven't been able to decide at this point, there nothing more we
4791 can check ourselves here. Look at the base type if we have one. */
4792 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4793 return int_fits_type_p (c, TREE_TYPE (type));
4795 /* Or to force_fit_type, if nothing else. */
4799 TREE_TYPE (c) = type;
4800 c = force_fit_type (c, -1, false, false);
4801 return !TREE_OVERFLOW (c);
4805 /* Subprogram of following function. Called by walk_tree.
4807 Return *TP if it is an automatic variable or parameter of the
4808 function passed in as DATA. */
4811 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
4813 tree fn = (tree) data;
4818 else if (DECL_P (*tp) && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
4824 /* Returns true if T is, contains, or refers to a type with variable
4825 size. If FN is nonzero, only return true if a modifier of the type
4826 or position of FN is a variable or parameter inside FN.
4828 This concept is more general than that of C99 'variably modified types':
4829 in C99, a struct type is never variably modified because a VLA may not
4830 appear as a structure member. However, in GNU C code like:
4832 struct S { int i[f()]; };
4834 is valid, and other languages may define similar constructs. */
4837 variably_modified_type_p (tree type, tree fn)
4841 /* Test if T is either variable (if FN is zero) or an expression containing
4842 a variable in FN. */
4843 #define RETURN_TRUE_IF_VAR(T) \
4844 do { tree _t = (T); \
4845 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4846 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4847 return true; } while (0)
4849 if (type == error_mark_node)
4852 /* If TYPE itself has variable size, it is variably modified.
4854 We do not yet have a representation of the C99 '[*]' syntax.
4855 When a representation is chosen, this function should be modified
4856 to test for that case as well. */
4857 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
4858 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type));
4860 switch (TREE_CODE (type))
4863 case REFERENCE_TYPE:
4867 if (variably_modified_type_p (TREE_TYPE (type), fn))
4873 /* If TYPE is a function type, it is variably modified if any of the
4874 parameters or the return type are variably modified. */
4875 if (variably_modified_type_p (TREE_TYPE (type), fn))
4878 for (t = TYPE_ARG_TYPES (type);
4879 t && t != void_list_node;
4881 if (variably_modified_type_p (TREE_VALUE (t), fn))
4890 /* Scalar types are variably modified if their end points
4892 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
4893 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
4898 case QUAL_UNION_TYPE:
4899 /* We can't see if any of the field are variably-modified by the
4900 definition we normally use, since that would produce infinite
4901 recursion via pointers. */
4902 /* This is variably modified if some field's type is. */
4903 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
4904 if (TREE_CODE (t) == FIELD_DECL)
4906 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
4907 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
4908 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
4910 if (TREE_CODE (type) == QUAL_UNION_TYPE)
4911 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
4919 /* The current language may have other cases to check, but in general,
4920 all other types are not variably modified. */
4921 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
4923 #undef RETURN_TRUE_IF_VAR
4926 /* Given a DECL or TYPE, return the scope in which it was declared, or
4927 NULL_TREE if there is no containing scope. */
4930 get_containing_scope (tree t)
4932 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4935 /* Return the innermost context enclosing DECL that is
4936 a FUNCTION_DECL, or zero if none. */
4939 decl_function_context (tree decl)
4943 if (TREE_CODE (decl) == ERROR_MARK)
4946 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4947 where we look up the function at runtime. Such functions always take
4948 a first argument of type 'pointer to real context'.
4950 C++ should really be fixed to use DECL_CONTEXT for the real context,
4951 and use something else for the "virtual context". */
4952 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4955 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4957 context = DECL_CONTEXT (decl);
4959 while (context && TREE_CODE (context) != FUNCTION_DECL)
4961 if (TREE_CODE (context) == BLOCK)
4962 context = BLOCK_SUPERCONTEXT (context);
4964 context = get_containing_scope (context);
4970 /* Return the innermost context enclosing DECL that is
4971 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4972 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4975 decl_type_context (tree decl)
4977 tree context = DECL_CONTEXT (decl);
4980 switch (TREE_CODE (context))
4982 case NAMESPACE_DECL:
4983 case TRANSLATION_UNIT_DECL:
4988 case QUAL_UNION_TYPE:
4993 context = DECL_CONTEXT (context);
4997 context = BLOCK_SUPERCONTEXT (context);
5007 /* CALL is a CALL_EXPR. Return the declaration for the function
5008 called, or NULL_TREE if the called function cannot be
5012 get_callee_fndecl (tree call)
5016 /* It's invalid to call this function with anything but a
5018 if (TREE_CODE (call) != CALL_EXPR)
5021 /* The first operand to the CALL is the address of the function
5023 addr = TREE_OPERAND (call, 0);
5027 /* If this is a readonly function pointer, extract its initial value. */
5028 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5029 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5030 && DECL_INITIAL (addr))
5031 addr = DECL_INITIAL (addr);
5033 /* If the address is just `&f' for some function `f', then we know
5034 that `f' is being called. */
5035 if (TREE_CODE (addr) == ADDR_EXPR
5036 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5037 return TREE_OPERAND (addr, 0);
5039 /* We couldn't figure out what was being called. Maybe the front
5040 end has some idea. */
5041 return lang_hooks.lang_get_callee_fndecl (call);
5044 /* Print debugging information about tree nodes generated during the compile,
5045 and any language-specific information. */
5048 dump_tree_statistics (void)
5050 #ifdef GATHER_STATISTICS
5052 int total_nodes, total_bytes;
5055 fprintf (stderr, "\n??? tree nodes created\n\n");
5056 #ifdef GATHER_STATISTICS
5057 fprintf (stderr, "Kind Nodes Bytes\n");
5058 fprintf (stderr, "---------------------------------------\n");
5059 total_nodes = total_bytes = 0;
5060 for (i = 0; i < (int) all_kinds; i++)
5062 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
5063 tree_node_counts[i], tree_node_sizes[i]);
5064 total_nodes += tree_node_counts[i];
5065 total_bytes += tree_node_sizes[i];
5067 fprintf (stderr, "---------------------------------------\n");
5068 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
5069 fprintf (stderr, "---------------------------------------\n");
5070 ssanames_print_statistics ();
5071 phinodes_print_statistics ();
5073 fprintf (stderr, "(No per-node statistics)\n");
5075 print_type_hash_statistics ();
5076 lang_hooks.print_statistics ();
5079 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5081 /* Generate a crc32 of a string. */
5084 crc32_string (unsigned chksum, const char *string)
5088 unsigned value = *string << 24;
5091 for (ix = 8; ix--; value <<= 1)
5095 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
5104 /* P is a string that will be used in a symbol. Mask out any characters
5105 that are not valid in that context. */
5108 clean_symbol_name (char *p)
5112 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5115 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5122 /* Generate a name for a function unique to this translation unit.
5123 TYPE is some string to identify the purpose of this function to the
5124 linker or collect2. */
5127 get_file_function_name_long (const char *type)
5133 if (first_global_object_name)
5134 p = first_global_object_name;
5137 /* We don't have anything that we know to be unique to this translation
5138 unit, so use what we do have and throw in some randomness. */
5140 const char *name = weak_global_object_name;
5141 const char *file = main_input_filename;
5146 file = input_filename;
5148 len = strlen (file);
5149 q = alloca (9 * 2 + len + 1);
5150 memcpy (q, file, len + 1);
5151 clean_symbol_name (q);
5153 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
5154 crc32_string (0, flag_random_seed));
5159 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
5161 /* Set up the name of the file-level functions we may need.
5162 Use a global object (which is already required to be unique over
5163 the program) rather than the file name (which imposes extra
5165 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5167 return get_identifier (buf);
5170 /* If KIND=='I', return a suitable global initializer (constructor) name.
5171 If KIND=='D', return a suitable global clean-up (destructor) name. */
5174 get_file_function_name (int kind)
5181 return get_file_function_name_long (p);
5184 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5185 The result is placed in BUFFER (which has length BIT_SIZE),
5186 with one bit in each char ('\000' or '\001').
5188 If the constructor is constant, NULL_TREE is returned.
5189 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5192 get_set_constructor_bits (tree init, char *buffer, int bit_size)
5196 HOST_WIDE_INT domain_min
5197 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
5198 tree non_const_bits = NULL_TREE;
5200 for (i = 0; i < bit_size; i++)
5203 for (vals = TREE_OPERAND (init, 1);
5204 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5206 if (!host_integerp (TREE_VALUE (vals), 0)
5207 || (TREE_PURPOSE (vals) != NULL_TREE
5208 && !host_integerp (TREE_PURPOSE (vals), 0)))
5210 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5211 else if (TREE_PURPOSE (vals) != NULL_TREE)
5213 /* Set a range of bits to ones. */
5214 HOST_WIDE_INT lo_index
5215 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
5216 HOST_WIDE_INT hi_index
5217 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5219 if (lo_index < 0 || lo_index >= bit_size
5220 || hi_index < 0 || hi_index >= bit_size)
5222 for (; lo_index <= hi_index; lo_index++)
5223 buffer[lo_index] = 1;
5227 /* Set a single bit to one. */
5229 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5230 if (index < 0 || index >= bit_size)
5232 error ("invalid initializer for bit string");
5238 return non_const_bits;
5241 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5242 The result is placed in BUFFER (which is an array of bytes).
5243 If the constructor is constant, NULL_TREE is returned.
5244 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5247 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
5250 int set_word_size = BITS_PER_UNIT;
5251 int bit_size = wd_size * set_word_size;
5253 unsigned char *bytep = buffer;
5254 char *bit_buffer = alloca (bit_size);
5255 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5257 for (i = 0; i < wd_size; i++)
5260 for (i = 0; i < bit_size; i++)
5264 if (BYTES_BIG_ENDIAN)
5265 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5267 *bytep |= 1 << bit_pos;
5270 if (bit_pos >= set_word_size)
5271 bit_pos = 0, bytep++;
5273 return non_const_bits;
5276 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5278 /* Complain that the tree code of NODE does not match the expected 0
5279 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5283 tree_check_failed (const tree node, const char *file,
5284 int line, const char *function, ...)
5288 unsigned length = 0;
5291 va_start (args, function);
5292 while ((code = va_arg (args, int)))
5293 length += 4 + strlen (tree_code_name[code]);
5295 va_start (args, function);
5296 buffer = alloca (length);
5298 while ((code = va_arg (args, int)))
5302 strcpy (buffer + length, " or ");
5305 strcpy (buffer + length, tree_code_name[code]);
5306 length += strlen (tree_code_name[code]);
5310 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5311 buffer, tree_code_name[TREE_CODE (node)],
5312 function, trim_filename (file), line);
5315 /* Complain that the tree code of NODE does match the expected 0
5316 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5320 tree_not_check_failed (const tree node, const char *file,
5321 int line, const char *function, ...)
5325 unsigned length = 0;
5328 va_start (args, function);
5329 while ((code = va_arg (args, int)))
5330 length += 4 + strlen (tree_code_name[code]);
5332 va_start (args, function);
5333 buffer = alloca (length);
5335 while ((code = va_arg (args, int)))
5339 strcpy (buffer + length, " or ");
5342 strcpy (buffer + length, tree_code_name[code]);
5343 length += strlen (tree_code_name[code]);
5347 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5348 buffer, tree_code_name[TREE_CODE (node)],
5349 function, trim_filename (file), line);
5352 /* Similar to tree_check_failed, except that we check for a class of tree
5353 code, given in CL. */
5356 tree_class_check_failed (const tree node, int cl, const char *file,
5357 int line, const char *function)
5360 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5361 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5362 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5365 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5366 (dynamically sized) vector. */
5369 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5370 const char *function)
5373 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5374 idx + 1, len, function, trim_filename (file), line);
5377 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5378 (dynamically sized) vector. */
5381 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5382 const char *function)
5385 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5386 idx + 1, len, function, trim_filename (file), line);
5389 /* Similar to above, except that the check is for the bounds of the operand
5390 vector of an expression node. */
5393 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5394 int line, const char *function)
5397 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5398 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5399 function, trim_filename (file), line);
5401 #endif /* ENABLE_TREE_CHECKING */
5403 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5404 and mapped to the machine mode MODE. Initialize its fields and build
5405 the information necessary for debugging output. */
5408 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
5410 tree t = make_node (VECTOR_TYPE);
5412 TREE_TYPE (t) = innertype;
5413 TYPE_VECTOR_SUBPARTS (t) = nunits;
5414 TYPE_MODE (t) = mode;
5418 tree index = build_int_cst (NULL_TREE, nunits - 1);
5419 tree array = build_array_type (innertype, build_index_type (index));
5420 tree rt = make_node (RECORD_TYPE);
5422 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5423 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5425 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5426 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5427 the representation type, and we want to find that die when looking up
5428 the vector type. This is most easily achieved by making the TYPE_UID
5430 TYPE_UID (rt) = TYPE_UID (t);
5437 make_or_reuse_type (unsigned size, int unsignedp)
5439 if (size == INT_TYPE_SIZE)
5440 return unsignedp ? unsigned_type_node : integer_type_node;
5441 if (size == CHAR_TYPE_SIZE)
5442 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5443 if (size == SHORT_TYPE_SIZE)
5444 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5445 if (size == LONG_TYPE_SIZE)
5446 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5447 if (size == LONG_LONG_TYPE_SIZE)
5448 return (unsignedp ? long_long_unsigned_type_node
5449 : long_long_integer_type_node);
5452 return make_unsigned_type (size);
5454 return make_signed_type (size);
5457 /* Create nodes for all integer types (and error_mark_node) using the sizes
5458 of C datatypes. The caller should call set_sizetype soon after calling
5459 this function to select one of the types as sizetype. */
5462 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
5464 error_mark_node = make_node (ERROR_MARK);
5465 TREE_TYPE (error_mark_node) = error_mark_node;
5467 initialize_sizetypes (signed_sizetype);
5469 /* Define both `signed char' and `unsigned char'. */
5470 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5471 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5473 /* Define `char', which is like either `signed char' or `unsigned char'
5474 but not the same as either. */
5477 ? make_signed_type (CHAR_TYPE_SIZE)
5478 : make_unsigned_type (CHAR_TYPE_SIZE));
5480 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5481 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5482 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5483 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5484 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5485 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5486 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5487 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5489 /* Define a boolean type. This type only represents boolean values but
5490 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5491 Front ends which want to override this size (i.e. Java) can redefine
5492 boolean_type_node before calling build_common_tree_nodes_2. */
5493 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5494 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5495 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5496 TYPE_PRECISION (boolean_type_node) = 1;
5498 /* Fill in the rest of the sized types. Reuse existing type nodes
5500 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
5501 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
5502 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
5503 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
5504 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
5506 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
5507 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
5508 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
5509 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
5510 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
5512 access_public_node = get_identifier ("public");
5513 access_protected_node = get_identifier ("protected");
5514 access_private_node = get_identifier ("private");
5517 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5518 It will create several other common tree nodes. */
5521 build_common_tree_nodes_2 (int short_double)
5523 /* Define these next since types below may used them. */
5524 integer_zero_node = build_int_cst (NULL_TREE, 0);
5525 integer_one_node = build_int_cst (NULL_TREE, 1);
5526 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
5528 size_zero_node = size_int (0);
5529 size_one_node = size_int (1);
5530 bitsize_zero_node = bitsize_int (0);
5531 bitsize_one_node = bitsize_int (1);
5532 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5534 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5535 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5537 void_type_node = make_node (VOID_TYPE);
5538 layout_type (void_type_node);
5540 /* We are not going to have real types in C with less than byte alignment,
5541 so we might as well not have any types that claim to have it. */
5542 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5543 TYPE_USER_ALIGN (void_type_node) = 0;
5545 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
5546 layout_type (TREE_TYPE (null_pointer_node));
5548 ptr_type_node = build_pointer_type (void_type_node);
5550 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5551 fileptr_type_node = ptr_type_node;
5553 float_type_node = make_node (REAL_TYPE);
5554 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5555 layout_type (float_type_node);
5557 double_type_node = make_node (REAL_TYPE);
5559 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5561 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5562 layout_type (double_type_node);
5564 long_double_type_node = make_node (REAL_TYPE);
5565 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5566 layout_type (long_double_type_node);
5568 float_ptr_type_node = build_pointer_type (float_type_node);
5569 double_ptr_type_node = build_pointer_type (double_type_node);
5570 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5571 integer_ptr_type_node = build_pointer_type (integer_type_node);
5573 complex_integer_type_node = make_node (COMPLEX_TYPE);
5574 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5575 layout_type (complex_integer_type_node);
5577 complex_float_type_node = make_node (COMPLEX_TYPE);
5578 TREE_TYPE (complex_float_type_node) = float_type_node;
5579 layout_type (complex_float_type_node);
5581 complex_double_type_node = make_node (COMPLEX_TYPE);
5582 TREE_TYPE (complex_double_type_node) = double_type_node;
5583 layout_type (complex_double_type_node);
5585 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5586 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5587 layout_type (complex_long_double_type_node);
5590 tree t = targetm.build_builtin_va_list ();
5592 /* Many back-ends define record types without setting TYPE_NAME.
5593 If we copied the record type here, we'd keep the original
5594 record type without a name. This breaks name mangling. So,
5595 don't copy record types and let c_common_nodes_and_builtins()
5596 declare the type to be __builtin_va_list. */
5597 if (TREE_CODE (t) != RECORD_TYPE)
5598 t = build_variant_type_copy (t);
5600 va_list_type_node = t;
5604 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5607 If we requested a pointer to a vector, build up the pointers that
5608 we stripped off while looking for the inner type. Similarly for
5609 return values from functions.
5611 The argument TYPE is the top of the chain, and BOTTOM is the
5612 new type which we will point to. */
5615 reconstruct_complex_type (tree type, tree bottom)
5619 if (POINTER_TYPE_P (type))
5621 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5622 outer = build_pointer_type (inner);
5624 else if (TREE_CODE (type) == ARRAY_TYPE)
5626 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5627 outer = build_array_type (inner, TYPE_DOMAIN (type));
5629 else if (TREE_CODE (type) == FUNCTION_TYPE)
5631 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5632 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5634 else if (TREE_CODE (type) == METHOD_TYPE)
5636 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5637 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5639 TYPE_ARG_TYPES (type));
5644 TYPE_READONLY (outer) = TYPE_READONLY (type);
5645 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
5650 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5653 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5657 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5658 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5659 nunits = GET_MODE_NUNITS (mode);
5661 else if (GET_MODE_CLASS (mode) == MODE_INT)
5663 /* Check that there are no leftover bits. */
5664 if (GET_MODE_BITSIZE (mode) % TREE_INT_CST_LOW (TYPE_SIZE (innertype)))
5667 nunits = GET_MODE_BITSIZE (mode)
5668 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
5673 return make_vector_type (innertype, nunits, mode);
5676 /* Similarly, but takes the inner type and number of units, which must be
5680 build_vector_type (tree innertype, int nunits)
5682 return make_vector_type (innertype, nunits, VOIDmode);
5685 /* Given an initializer INIT, return TRUE if INIT is zero or some
5686 aggregate of zeros. Otherwise return FALSE. */
5688 initializer_zerop (tree init)
5694 switch (TREE_CODE (init))
5697 return integer_zerop (init);
5700 /* ??? Note that this is not correct for C4X float formats. There,
5701 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5702 negative exponent. */
5703 return real_zerop (init)
5704 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5707 return integer_zerop (init)
5708 || (real_zerop (init)
5709 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5710 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5713 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
5714 if (!initializer_zerop (TREE_VALUE (elt)))
5719 elt = CONSTRUCTOR_ELTS (init);
5720 if (elt == NULL_TREE)
5723 /* A set is empty only if it has no elements. */
5724 if (TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5727 for (; elt ; elt = TREE_CHAIN (elt))
5728 if (! initializer_zerop (TREE_VALUE (elt)))
5738 add_var_to_bind_expr (tree bind_expr, tree var)
5740 BIND_EXPR_VARS (bind_expr)
5741 = chainon (BIND_EXPR_VARS (bind_expr), var);
5742 if (BIND_EXPR_BLOCK (bind_expr))
5743 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
5744 = BIND_EXPR_VARS (bind_expr);
5747 /* Build an empty statement. */
5750 build_empty_stmt (void)
5752 return build1 (NOP_EXPR, void_type_node, size_zero_node);
5756 /* Returns true if it is possible to prove that the index of
5757 an array access REF (an ARRAY_REF expression) falls into the
5761 in_array_bounds_p (tree ref)
5763 tree idx = TREE_OPERAND (ref, 1);
5766 if (TREE_CODE (idx) != INTEGER_CST)
5769 min = array_ref_low_bound (ref);
5770 max = array_ref_up_bound (ref);
5773 || TREE_CODE (min) != INTEGER_CST
5774 || TREE_CODE (max) != INTEGER_CST)
5777 if (tree_int_cst_lt (idx, min)
5778 || tree_int_cst_lt (max, idx))
5784 /* Return true if T (assumed to be a DECL) is a global variable. */
5787 is_global_var (tree t)
5789 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
5792 /* Return true if T (assumed to be a DECL) must be assigned a memory
5796 needs_to_live_in_memory (tree t)
5798 return (TREE_ADDRESSABLE (t)
5799 || is_global_var (t)
5800 || (TREE_CODE (t) == RESULT_DECL
5801 && aggregate_value_p (t, current_function_decl)));
5804 /* There are situations in which a language considers record types
5805 compatible which have different field lists. Decide if two fields
5806 are compatible. It is assumed that the parent records are compatible. */
5809 fields_compatible_p (tree f1, tree f2)
5811 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
5812 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
5815 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
5816 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
5819 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
5825 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5828 find_compatible_field (tree record, tree orig_field)
5832 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
5833 if (TREE_CODE (f) == FIELD_DECL
5834 && fields_compatible_p (f, orig_field))
5837 /* ??? Why isn't this on the main fields list? */
5838 f = TYPE_VFIELD (record);
5839 if (f && TREE_CODE (f) == FIELD_DECL
5840 && fields_compatible_p (f, orig_field))
5843 /* ??? We should abort here, but Java appears to do Bad Things
5844 with inherited fields. */
5848 /* Return value of a constant X. */
5851 int_cst_value (tree x)
5853 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
5854 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
5855 bool negative = ((val >> (bits - 1)) & 1) != 0;
5857 if (bits > HOST_BITS_PER_WIDE_INT)
5861 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
5863 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
5868 /* Returns the greatest common divisor of A and B, which must be
5872 tree_fold_gcd (tree a, tree b)
5875 tree type = TREE_TYPE (a);
5877 #if defined ENABLE_CHECKING
5878 if (TREE_CODE (a) != INTEGER_CST
5879 || TREE_CODE (b) != INTEGER_CST)
5883 if (integer_zerop (a))
5886 if (integer_zerop (b))
5889 if (tree_int_cst_sgn (a) == -1)
5890 a = fold (build2 (MULT_EXPR, type, a,
5891 convert (type, integer_minus_one_node)));
5893 if (tree_int_cst_sgn (b) == -1)
5894 b = fold (build2 (MULT_EXPR, type, b,
5895 convert (type, integer_minus_one_node)));
5899 a_mod_b = fold (build2 (CEIL_MOD_EXPR, type, a, b));
5901 if (!TREE_INT_CST_LOW (a_mod_b)
5902 && !TREE_INT_CST_HIGH (a_mod_b))
5910 #include "gt-tree.h"