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 a tree with code CODE. This
146 function cannot be used for TREE_VEC or PHI_NODE codes, which are of
149 tree_code_size (enum tree_code code)
151 /* We can't state the size of a TREE_VEC or PHI_NODE
152 without knowing how many elements it will have. */
153 gcc_assert (code != TREE_VEC);
154 gcc_assert (code != PHI_NODE);
156 switch (TREE_CODE_CLASS (code))
158 case 'd': /* A decl node */
159 return sizeof (struct tree_decl);
161 case 't': /* a type node */
162 return sizeof (struct tree_type);
164 case 'r': /* a reference */
165 case 'e': /* an expression */
166 case 's': /* an expression with side effects */
167 case '<': /* a comparison expression */
168 case '1': /* a unary arithmetic expression */
169 case '2': /* a binary arithmetic expression */
170 return (sizeof (struct tree_exp)
171 + (TREE_CODE_LENGTH (code) - 1) * sizeof (char *));
173 case 'c': /* a constant */
176 case INTEGER_CST: return sizeof (struct tree_int_cst);
177 case REAL_CST: return sizeof (struct tree_real_cst);
178 case COMPLEX_CST: return sizeof (struct tree_complex);
179 case VECTOR_CST: return sizeof (struct tree_vector);
180 case STRING_CST: return sizeof (struct tree_string);
182 return lang_hooks.tree_size (code);
185 case 'x': /* something random, like an identifier. */
188 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
189 case TREE_LIST: return sizeof (struct tree_list);
192 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
196 case SSA_NAME: return sizeof (struct tree_ssa_name);
198 case STATEMENT_LIST: return sizeof (struct tree_statement_list);
199 case BLOCK: return sizeof (struct tree_block);
200 case VALUE_HANDLE: return sizeof (struct tree_value_handle);
203 return lang_hooks.tree_size (code);
211 /* Compute the number of bytes occupied by NODE. This routine only
212 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
214 tree_size (tree node)
216 enum tree_code code = TREE_CODE (node);
220 return (sizeof (struct tree_phi_node)
221 + (PHI_ARG_CAPACITY (node) - 1) * sizeof (struct phi_arg_d));
224 return (sizeof (struct tree_vec)
225 + (TREE_VEC_LENGTH (node) - 1) * sizeof(char *));
228 return tree_code_size (code);
232 /* Return a newly allocated node of code CODE. For decl and type
233 nodes, some other fields are initialized. The rest of the node is
234 initialized to zero. This function cannot be used for PHI_NODE or
235 TREE_VEC nodes, which is enforced by asserts in tree_code_size.
237 Achoo! I got a code in the node. */
240 make_node_stat (enum tree_code code MEM_STAT_DECL)
243 int type = TREE_CODE_CLASS (code);
244 size_t length = tree_code_size (code);
245 #ifdef GATHER_STATISTICS
250 case 'd': /* A decl node */
254 case 't': /* a type node */
258 case 's': /* an expression with side effects */
262 case 'r': /* a reference */
266 case 'e': /* an expression */
267 case '<': /* a comparison expression */
268 case '1': /* a unary arithmetic expression */
269 case '2': /* a binary arithmetic expression */
273 case 'c': /* a constant */
277 case 'x': /* something random, like an identifier. */
278 if (code == IDENTIFIER_NODE)
280 else if (code == TREE_VEC)
282 else if (code == TREE_BINFO)
284 else if (code == PHI_NODE)
286 else if (code == SSA_NAME)
287 kind = ssa_name_kind;
288 else if (code == BLOCK)
298 tree_node_counts[(int) kind]++;
299 tree_node_sizes[(int) kind] += length;
302 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
304 memset (t, 0, length);
306 TREE_SET_CODE (t, code);
311 TREE_SIDE_EFFECTS (t) = 1;
315 if (code != FUNCTION_DECL)
317 DECL_USER_ALIGN (t) = 0;
318 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
319 DECL_SOURCE_LOCATION (t) = input_location;
320 DECL_UID (t) = next_decl_uid++;
322 /* We have not yet computed the alias set for this declaration. */
323 DECL_POINTER_ALIAS_SET (t) = -1;
327 TYPE_UID (t) = next_type_uid++;
328 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
329 TYPE_USER_ALIGN (t) = 0;
330 TYPE_MAIN_VARIANT (t) = t;
332 /* Default to no attributes for type, but let target change that. */
333 TYPE_ATTRIBUTES (t) = NULL_TREE;
334 targetm.set_default_type_attributes (t);
336 /* We have not yet computed the alias set for this type. */
337 TYPE_ALIAS_SET (t) = -1;
341 TREE_CONSTANT (t) = 1;
342 TREE_INVARIANT (t) = 1;
351 case PREDECREMENT_EXPR:
352 case PREINCREMENT_EXPR:
353 case POSTDECREMENT_EXPR:
354 case POSTINCREMENT_EXPR:
355 /* All of these have side-effects, no matter what their
357 TREE_SIDE_EFFECTS (t) = 1;
369 /* Return a new node with the same contents as NODE except that its
370 TREE_CHAIN is zero and it has a fresh uid. */
373 copy_node_stat (tree node MEM_STAT_DECL)
376 enum tree_code code = TREE_CODE (node);
379 gcc_assert (code != STATEMENT_LIST);
381 length = tree_size (node);
382 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
383 memcpy (t, node, length);
386 TREE_ASM_WRITTEN (t) = 0;
387 TREE_VISITED (t) = 0;
390 if (TREE_CODE_CLASS (code) == 'd')
391 DECL_UID (t) = next_decl_uid++;
392 else if (TREE_CODE_CLASS (code) == 't')
394 TYPE_UID (t) = next_type_uid++;
395 /* The following is so that the debug code for
396 the copy is different from the original type.
397 The two statements usually duplicate each other
398 (because they clear fields of the same union),
399 but the optimizer should catch that. */
400 TYPE_SYMTAB_POINTER (t) = 0;
401 TYPE_SYMTAB_ADDRESS (t) = 0;
403 /* Do not copy the values cache. */
404 if (TYPE_CACHED_VALUES_P(t))
406 TYPE_CACHED_VALUES_P (t) = 0;
407 TYPE_CACHED_VALUES (t) = NULL_TREE;
414 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
415 For example, this can copy a list made of TREE_LIST nodes. */
418 copy_list (tree list)
426 head = prev = copy_node (list);
427 next = TREE_CHAIN (list);
430 TREE_CHAIN (prev) = copy_node (next);
431 prev = TREE_CHAIN (prev);
432 next = TREE_CHAIN (next);
438 /* Create an INT_CST node with a LOW value sign extended. */
441 build_int_cst (tree type, HOST_WIDE_INT low)
443 return build_int_cst_wide (type, low, low < 0 ? -1 : 0);
446 /* Create an INT_CST node with a LOW value zero extended. */
449 build_int_cstu (tree type, unsigned HOST_WIDE_INT low)
451 return build_int_cst_wide (type, low, 0);
454 /* Create an INT_CST node with a LOW value zero or sign extended depending
458 build_int_cst_type (tree type, HOST_WIDE_INT low)
460 unsigned HOST_WIDE_INT val = (unsigned HOST_WIDE_INT) low;
467 type = integer_type_node;
469 bits = TYPE_PRECISION (type);
470 signed_p = !TYPE_UNSIGNED (type);
471 negative = ((val >> (bits - 1)) & 1) != 0;
473 if (signed_p && negative)
475 if (bits < HOST_BITS_PER_WIDE_INT)
476 val = val | ((~(unsigned HOST_WIDE_INT) 0) << bits);
477 ret = build_int_cst_wide (type, val, ~(unsigned HOST_WIDE_INT) 0);
481 if (bits < HOST_BITS_PER_WIDE_INT)
482 val = val & ~((~(unsigned HOST_WIDE_INT) 0) << bits);
483 ret = build_int_cst_wide (type, val, 0);
489 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
490 integer_type_node is used. */
493 build_int_cst_wide (tree type, unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
500 type = integer_type_node;
502 switch (TREE_CODE (type))
506 /* Cache NULL pointer. */
515 /* Cache false or true. */
524 if (TYPE_UNSIGNED (type))
527 limit = INTEGER_SHARE_LIMIT;
528 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
534 limit = INTEGER_SHARE_LIMIT + 1;
535 if (!hi && low < (unsigned HOST_WIDE_INT)INTEGER_SHARE_LIMIT)
537 else if (hi == -1 && low == -(unsigned HOST_WIDE_INT)1)
547 if (!TYPE_CACHED_VALUES_P (type))
549 TYPE_CACHED_VALUES_P (type) = 1;
550 TYPE_CACHED_VALUES (type) = make_tree_vec (limit);
553 t = TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix);
556 /* Make sure no one is clobbering the shared constant. */
557 gcc_assert (TREE_TYPE (t) == type);
558 gcc_assert (TREE_INT_CST_LOW (t) == low);
559 gcc_assert (TREE_INT_CST_HIGH (t) == hi);
564 t = make_node (INTEGER_CST);
566 TREE_INT_CST_LOW (t) = low;
567 TREE_INT_CST_HIGH (t) = hi;
568 TREE_TYPE (t) = type;
571 TREE_VEC_ELT (TYPE_CACHED_VALUES (type), ix) = t;
576 /* Checks that X is integer constant that can be expressed in (unsigned)
577 HOST_WIDE_INT without loss of precision. */
580 cst_and_fits_in_hwi (tree x)
582 if (TREE_CODE (x) != INTEGER_CST)
585 if (TYPE_PRECISION (TREE_TYPE (x)) > HOST_BITS_PER_WIDE_INT)
588 return (TREE_INT_CST_HIGH (x) == 0
589 || TREE_INT_CST_HIGH (x) == -1);
592 /* Return a new VECTOR_CST node whose type is TYPE and whose values
593 are in a list pointed by VALS. */
596 build_vector (tree type, tree vals)
598 tree v = make_node (VECTOR_CST);
599 int over1 = 0, over2 = 0;
602 TREE_VECTOR_CST_ELTS (v) = vals;
603 TREE_TYPE (v) = type;
605 /* Iterate through elements and check for overflow. */
606 for (link = vals; link; link = TREE_CHAIN (link))
608 tree value = TREE_VALUE (link);
610 over1 |= TREE_OVERFLOW (value);
611 over2 |= TREE_CONSTANT_OVERFLOW (value);
614 TREE_OVERFLOW (v) = over1;
615 TREE_CONSTANT_OVERFLOW (v) = over2;
620 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
621 are in a list pointed to by VALS. */
623 build_constructor (tree type, tree vals)
625 tree c = make_node (CONSTRUCTOR);
626 TREE_TYPE (c) = type;
627 CONSTRUCTOR_ELTS (c) = vals;
629 /* ??? May not be necessary. Mirrors what build does. */
632 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
633 TREE_READONLY (c) = TREE_READONLY (vals);
634 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
635 TREE_INVARIANT (c) = TREE_INVARIANT (vals);
641 /* Return a new REAL_CST node whose type is TYPE and value is D. */
644 build_real (tree type, REAL_VALUE_TYPE d)
650 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
651 Consider doing it via real_convert now. */
653 v = make_node (REAL_CST);
654 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
655 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
657 TREE_TYPE (v) = type;
658 TREE_REAL_CST_PTR (v) = dp;
659 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
663 /* Return a new REAL_CST node whose type is TYPE
664 and whose value is the integer value of the INTEGER_CST node I. */
667 real_value_from_int_cst (tree type, tree i)
671 /* Clear all bits of the real value type so that we can later do
672 bitwise comparisons to see if two values are the same. */
673 memset (&d, 0, sizeof d);
675 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
676 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
677 TYPE_UNSIGNED (TREE_TYPE (i)));
681 /* Given a tree representing an integer constant I, return a tree
682 representing the same value as a floating-point constant of type TYPE. */
685 build_real_from_int_cst (tree type, tree i)
688 int overflow = TREE_OVERFLOW (i);
690 v = build_real (type, real_value_from_int_cst (type, i));
692 TREE_OVERFLOW (v) |= overflow;
693 TREE_CONSTANT_OVERFLOW (v) |= overflow;
697 /* Return a newly constructed STRING_CST node whose value is
698 the LEN characters at STR.
699 The TREE_TYPE is not initialized. */
702 build_string (int len, const char *str)
704 tree s = make_node (STRING_CST);
706 TREE_STRING_LENGTH (s) = len;
707 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
712 /* Return a newly constructed COMPLEX_CST node whose value is
713 specified by the real and imaginary parts REAL and IMAG.
714 Both REAL and IMAG should be constant nodes. TYPE, if specified,
715 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
718 build_complex (tree type, tree real, tree imag)
720 tree t = make_node (COMPLEX_CST);
722 TREE_REALPART (t) = real;
723 TREE_IMAGPART (t) = imag;
724 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
725 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
726 TREE_CONSTANT_OVERFLOW (t)
727 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
731 /* Build a BINFO with LEN language slots. */
734 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
737 size_t length = (offsetof (struct tree_binfo, base_binfos)
738 + VEC_embedded_size (tree, base_binfos));
740 #ifdef GATHER_STATISTICS
741 tree_node_counts[(int) binfo_kind]++;
742 tree_node_sizes[(int) binfo_kind] += length;
745 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
747 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
749 TREE_SET_CODE (t, TREE_BINFO);
751 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
757 /* Build a newly constructed TREE_VEC node of length LEN. */
760 make_tree_vec_stat (int len MEM_STAT_DECL)
763 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
765 #ifdef GATHER_STATISTICS
766 tree_node_counts[(int) vec_kind]++;
767 tree_node_sizes[(int) vec_kind] += length;
770 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
772 memset (t, 0, length);
774 TREE_SET_CODE (t, TREE_VEC);
775 TREE_VEC_LENGTH (t) = len;
780 /* Return 1 if EXPR is the integer constant zero or a complex constant
784 integer_zerop (tree expr)
788 return ((TREE_CODE (expr) == INTEGER_CST
789 && ! TREE_CONSTANT_OVERFLOW (expr)
790 && TREE_INT_CST_LOW (expr) == 0
791 && TREE_INT_CST_HIGH (expr) == 0)
792 || (TREE_CODE (expr) == COMPLEX_CST
793 && integer_zerop (TREE_REALPART (expr))
794 && integer_zerop (TREE_IMAGPART (expr))));
797 /* Return 1 if EXPR is the integer constant one or the corresponding
801 integer_onep (tree expr)
805 return ((TREE_CODE (expr) == INTEGER_CST
806 && ! TREE_CONSTANT_OVERFLOW (expr)
807 && TREE_INT_CST_LOW (expr) == 1
808 && TREE_INT_CST_HIGH (expr) == 0)
809 || (TREE_CODE (expr) == COMPLEX_CST
810 && integer_onep (TREE_REALPART (expr))
811 && integer_zerop (TREE_IMAGPART (expr))));
814 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
815 it contains. Likewise for the corresponding complex constant. */
818 integer_all_onesp (tree expr)
825 if (TREE_CODE (expr) == COMPLEX_CST
826 && integer_all_onesp (TREE_REALPART (expr))
827 && integer_zerop (TREE_IMAGPART (expr)))
830 else if (TREE_CODE (expr) != INTEGER_CST
831 || TREE_CONSTANT_OVERFLOW (expr))
834 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
836 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
837 && TREE_INT_CST_HIGH (expr) == -1);
839 /* Note that using TYPE_PRECISION here is wrong. We care about the
840 actual bits, not the (arbitrary) range of the type. */
841 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
842 if (prec >= HOST_BITS_PER_WIDE_INT)
844 HOST_WIDE_INT high_value;
847 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
849 /* Can not handle precisions greater than twice the host int size. */
850 gcc_assert (shift_amount <= HOST_BITS_PER_WIDE_INT);
851 if (shift_amount == HOST_BITS_PER_WIDE_INT)
852 /* Shifting by the host word size is undefined according to the ANSI
853 standard, so we must handle this as a special case. */
856 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
858 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
859 && TREE_INT_CST_HIGH (expr) == high_value);
862 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
865 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
869 integer_pow2p (tree expr)
872 HOST_WIDE_INT high, low;
876 if (TREE_CODE (expr) == COMPLEX_CST
877 && integer_pow2p (TREE_REALPART (expr))
878 && integer_zerop (TREE_IMAGPART (expr)))
881 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
884 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
885 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
886 high = TREE_INT_CST_HIGH (expr);
887 low = TREE_INT_CST_LOW (expr);
889 /* First clear all bits that are beyond the type's precision in case
890 we've been sign extended. */
892 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
894 else if (prec > HOST_BITS_PER_WIDE_INT)
895 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
899 if (prec < HOST_BITS_PER_WIDE_INT)
900 low &= ~((HOST_WIDE_INT) (-1) << prec);
903 if (high == 0 && low == 0)
906 return ((high == 0 && (low & (low - 1)) == 0)
907 || (low == 0 && (high & (high - 1)) == 0));
910 /* Return 1 if EXPR is an integer constant other than zero or a
911 complex constant other than zero. */
914 integer_nonzerop (tree expr)
918 return ((TREE_CODE (expr) == INTEGER_CST
919 && ! TREE_CONSTANT_OVERFLOW (expr)
920 && (TREE_INT_CST_LOW (expr) != 0
921 || TREE_INT_CST_HIGH (expr) != 0))
922 || (TREE_CODE (expr) == COMPLEX_CST
923 && (integer_nonzerop (TREE_REALPART (expr))
924 || integer_nonzerop (TREE_IMAGPART (expr)))));
927 /* Return the power of two represented by a tree node known to be a
931 tree_log2 (tree expr)
934 HOST_WIDE_INT high, low;
938 if (TREE_CODE (expr) == COMPLEX_CST)
939 return tree_log2 (TREE_REALPART (expr));
941 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
942 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
944 high = TREE_INT_CST_HIGH (expr);
945 low = TREE_INT_CST_LOW (expr);
947 /* First clear all bits that are beyond the type's precision in case
948 we've been sign extended. */
950 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
952 else if (prec > HOST_BITS_PER_WIDE_INT)
953 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
957 if (prec < HOST_BITS_PER_WIDE_INT)
958 low &= ~((HOST_WIDE_INT) (-1) << prec);
961 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
965 /* Similar, but return the largest integer Y such that 2 ** Y is less
966 than or equal to EXPR. */
969 tree_floor_log2 (tree expr)
972 HOST_WIDE_INT high, low;
976 if (TREE_CODE (expr) == COMPLEX_CST)
977 return tree_log2 (TREE_REALPART (expr));
979 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
980 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
982 high = TREE_INT_CST_HIGH (expr);
983 low = TREE_INT_CST_LOW (expr);
985 /* First clear all bits that are beyond the type's precision in case
986 we've been sign extended. Ignore if type's precision hasn't been set
987 since what we are doing is setting it. */
989 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
991 else if (prec > HOST_BITS_PER_WIDE_INT)
992 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
996 if (prec < HOST_BITS_PER_WIDE_INT)
997 low &= ~((HOST_WIDE_INT) (-1) << prec);
1000 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
1001 : floor_log2 (low));
1004 /* Return 1 if EXPR is the real constant zero. */
1007 real_zerop (tree expr)
1011 return ((TREE_CODE (expr) == REAL_CST
1012 && ! TREE_CONSTANT_OVERFLOW (expr)
1013 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
1014 || (TREE_CODE (expr) == COMPLEX_CST
1015 && real_zerop (TREE_REALPART (expr))
1016 && real_zerop (TREE_IMAGPART (expr))));
1019 /* Return 1 if EXPR is the real constant one in real or complex form. */
1022 real_onep (tree expr)
1026 return ((TREE_CODE (expr) == REAL_CST
1027 && ! TREE_CONSTANT_OVERFLOW (expr)
1028 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
1029 || (TREE_CODE (expr) == COMPLEX_CST
1030 && real_onep (TREE_REALPART (expr))
1031 && real_zerop (TREE_IMAGPART (expr))));
1034 /* Return 1 if EXPR is the real constant two. */
1037 real_twop (tree expr)
1041 return ((TREE_CODE (expr) == REAL_CST
1042 && ! TREE_CONSTANT_OVERFLOW (expr)
1043 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
1044 || (TREE_CODE (expr) == COMPLEX_CST
1045 && real_twop (TREE_REALPART (expr))
1046 && real_zerop (TREE_IMAGPART (expr))));
1049 /* Return 1 if EXPR is the real constant minus one. */
1052 real_minus_onep (tree expr)
1056 return ((TREE_CODE (expr) == REAL_CST
1057 && ! TREE_CONSTANT_OVERFLOW (expr)
1058 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
1059 || (TREE_CODE (expr) == COMPLEX_CST
1060 && real_minus_onep (TREE_REALPART (expr))
1061 && real_zerop (TREE_IMAGPART (expr))));
1064 /* Nonzero if EXP is a constant or a cast of a constant. */
1067 really_constant_p (tree exp)
1069 /* This is not quite the same as STRIP_NOPS. It does more. */
1070 while (TREE_CODE (exp) == NOP_EXPR
1071 || TREE_CODE (exp) == CONVERT_EXPR
1072 || TREE_CODE (exp) == NON_LVALUE_EXPR)
1073 exp = TREE_OPERAND (exp, 0);
1074 return TREE_CONSTANT (exp);
1077 /* Return first list element whose TREE_VALUE is ELEM.
1078 Return 0 if ELEM is not in LIST. */
1081 value_member (tree elem, tree list)
1085 if (elem == TREE_VALUE (list))
1087 list = TREE_CHAIN (list);
1092 /* Return first list element whose TREE_PURPOSE is ELEM.
1093 Return 0 if ELEM is not in LIST. */
1096 purpose_member (tree elem, tree list)
1100 if (elem == TREE_PURPOSE (list))
1102 list = TREE_CHAIN (list);
1107 /* Return nonzero if ELEM is part of the chain CHAIN. */
1110 chain_member (tree elem, tree chain)
1116 chain = TREE_CHAIN (chain);
1122 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1123 We expect a null pointer to mark the end of the chain.
1124 This is the Lisp primitive `length'. */
1127 list_length (tree t)
1130 #ifdef ENABLE_TREE_CHECKING
1138 #ifdef ENABLE_TREE_CHECKING
1141 gcc_assert (p != q);
1149 /* Returns the number of FIELD_DECLs in TYPE. */
1152 fields_length (tree type)
1154 tree t = TYPE_FIELDS (type);
1157 for (; t; t = TREE_CHAIN (t))
1158 if (TREE_CODE (t) == FIELD_DECL)
1164 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1165 by modifying the last node in chain 1 to point to chain 2.
1166 This is the Lisp primitive `nconc'. */
1169 chainon (tree op1, tree op2)
1178 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1180 TREE_CHAIN (t1) = op2;
1182 #ifdef ENABLE_TREE_CHECKING
1185 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1186 gcc_assert (t2 != t1);
1193 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1196 tree_last (tree chain)
1200 while ((next = TREE_CHAIN (chain)))
1205 /* Reverse the order of elements in the chain T,
1206 and return the new head of the chain (old last element). */
1211 tree prev = 0, decl, next;
1212 for (decl = t; decl; decl = next)
1214 next = TREE_CHAIN (decl);
1215 TREE_CHAIN (decl) = prev;
1221 /* Return a newly created TREE_LIST node whose
1222 purpose and value fields are PARM and VALUE. */
1225 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1227 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1228 TREE_PURPOSE (t) = parm;
1229 TREE_VALUE (t) = value;
1233 /* Return a newly created TREE_LIST node whose
1234 purpose and value fields are PURPOSE and VALUE
1235 and whose TREE_CHAIN is CHAIN. */
1238 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1242 node = ggc_alloc_zone_stat (sizeof (struct tree_list),
1243 tree_zone PASS_MEM_STAT);
1245 memset (node, 0, sizeof (struct tree_common));
1247 #ifdef GATHER_STATISTICS
1248 tree_node_counts[(int) x_kind]++;
1249 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1252 TREE_SET_CODE (node, TREE_LIST);
1253 TREE_CHAIN (node) = chain;
1254 TREE_PURPOSE (node) = purpose;
1255 TREE_VALUE (node) = value;
1260 /* Return the size nominally occupied by an object of type TYPE
1261 when it resides in memory. The value is measured in units of bytes,
1262 and its data type is that normally used for type sizes
1263 (which is the first type created by make_signed_type or
1264 make_unsigned_type). */
1267 size_in_bytes (tree type)
1271 if (type == error_mark_node)
1272 return integer_zero_node;
1274 type = TYPE_MAIN_VARIANT (type);
1275 t = TYPE_SIZE_UNIT (type);
1279 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1280 return size_zero_node;
1283 if (TREE_CODE (t) == INTEGER_CST)
1284 t = force_fit_type (t, 0, false, false);
1289 /* Return the size of TYPE (in bytes) as a wide integer
1290 or return -1 if the size can vary or is larger than an integer. */
1293 int_size_in_bytes (tree type)
1297 if (type == error_mark_node)
1300 type = TYPE_MAIN_VARIANT (type);
1301 t = TYPE_SIZE_UNIT (type);
1303 || TREE_CODE (t) != INTEGER_CST
1304 || TREE_OVERFLOW (t)
1305 || TREE_INT_CST_HIGH (t) != 0
1306 /* If the result would appear negative, it's too big to represent. */
1307 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1310 return TREE_INT_CST_LOW (t);
1313 /* Return the bit position of FIELD, in bits from the start of the record.
1314 This is a tree of type bitsizetype. */
1317 bit_position (tree field)
1319 return bit_from_pos (DECL_FIELD_OFFSET (field),
1320 DECL_FIELD_BIT_OFFSET (field));
1323 /* Likewise, but return as an integer. Abort if it cannot be represented
1324 in that way (since it could be a signed value, we don't have the option
1325 of returning -1 like int_size_in_byte can. */
1328 int_bit_position (tree field)
1330 return tree_low_cst (bit_position (field), 0);
1333 /* Return the byte position of FIELD, in bytes from the start of the record.
1334 This is a tree of type sizetype. */
1337 byte_position (tree field)
1339 return byte_from_pos (DECL_FIELD_OFFSET (field),
1340 DECL_FIELD_BIT_OFFSET (field));
1343 /* Likewise, but return as an integer. Abort if it cannot be represented
1344 in that way (since it could be a signed value, we don't have the option
1345 of returning -1 like int_size_in_byte can. */
1348 int_byte_position (tree field)
1350 return tree_low_cst (byte_position (field), 0);
1353 /* Return the strictest alignment, in bits, that T is known to have. */
1358 unsigned int align0, align1;
1360 switch (TREE_CODE (t))
1362 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1363 /* If we have conversions, we know that the alignment of the
1364 object must meet each of the alignments of the types. */
1365 align0 = expr_align (TREE_OPERAND (t, 0));
1366 align1 = TYPE_ALIGN (TREE_TYPE (t));
1367 return MAX (align0, align1);
1369 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1370 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1371 case CLEANUP_POINT_EXPR:
1372 /* These don't change the alignment of an object. */
1373 return expr_align (TREE_OPERAND (t, 0));
1376 /* The best we can do is say that the alignment is the least aligned
1378 align0 = expr_align (TREE_OPERAND (t, 1));
1379 align1 = expr_align (TREE_OPERAND (t, 2));
1380 return MIN (align0, align1);
1382 case LABEL_DECL: case CONST_DECL:
1383 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1384 if (DECL_ALIGN (t) != 0)
1385 return DECL_ALIGN (t);
1389 return FUNCTION_BOUNDARY;
1395 /* Otherwise take the alignment from that of the type. */
1396 return TYPE_ALIGN (TREE_TYPE (t));
1399 /* Return, as a tree node, the number of elements for TYPE (which is an
1400 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1403 array_type_nelts (tree type)
1405 tree index_type, min, max;
1407 /* If they did it with unspecified bounds, then we should have already
1408 given an error about it before we got here. */
1409 if (! TYPE_DOMAIN (type))
1410 return error_mark_node;
1412 index_type = TYPE_DOMAIN (type);
1413 min = TYPE_MIN_VALUE (index_type);
1414 max = TYPE_MAX_VALUE (index_type);
1416 return (integer_zerop (min)
1418 : fold (build2 (MINUS_EXPR, TREE_TYPE (max), max, min)));
1421 /* If arg is static -- a reference to an object in static storage -- then
1422 return the object. This is not the same as the C meaning of `static'.
1423 If arg isn't static, return NULL. */
1428 switch (TREE_CODE (arg))
1431 /* Nested functions aren't static, since taking their address
1432 involves a trampoline. */
1433 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1434 && ! DECL_NON_ADDR_CONST_P (arg)
1438 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1439 && ! DECL_THREAD_LOCAL (arg)
1440 && ! DECL_NON_ADDR_CONST_P (arg)
1444 return TREE_STATIC (arg) ? arg : NULL;
1451 /* If the thing being referenced is not a field, then it is
1452 something language specific. */
1453 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1454 return (*lang_hooks.staticp) (arg);
1456 /* If we are referencing a bitfield, we can't evaluate an
1457 ADDR_EXPR at compile time and so it isn't a constant. */
1458 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1461 return staticp (TREE_OPERAND (arg, 0));
1467 return TREE_CONSTANT (TREE_OPERAND (arg, 0)) ? arg : NULL;
1470 case ARRAY_RANGE_REF:
1471 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1472 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1473 return staticp (TREE_OPERAND (arg, 0));
1478 if ((unsigned int) TREE_CODE (arg)
1479 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1480 return lang_hooks.staticp (arg);
1486 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1487 Do this to any expression which may be used in more than one place,
1488 but must be evaluated only once.
1490 Normally, expand_expr would reevaluate the expression each time.
1491 Calling save_expr produces something that is evaluated and recorded
1492 the first time expand_expr is called on it. Subsequent calls to
1493 expand_expr just reuse the recorded value.
1495 The call to expand_expr that generates code that actually computes
1496 the value is the first call *at compile time*. Subsequent calls
1497 *at compile time* generate code to use the saved value.
1498 This produces correct result provided that *at run time* control
1499 always flows through the insns made by the first expand_expr
1500 before reaching the other places where the save_expr was evaluated.
1501 You, the caller of save_expr, must make sure this is so.
1503 Constants, and certain read-only nodes, are returned with no
1504 SAVE_EXPR because that is safe. Expressions containing placeholders
1505 are not touched; see tree.def for an explanation of what these
1509 save_expr (tree expr)
1511 tree t = fold (expr);
1514 /* If the tree evaluates to a constant, then we don't want to hide that
1515 fact (i.e. this allows further folding, and direct checks for constants).
1516 However, a read-only object that has side effects cannot be bypassed.
1517 Since it is no problem to reevaluate literals, we just return the
1519 inner = skip_simple_arithmetic (t);
1521 if (TREE_INVARIANT (inner)
1522 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1523 || TREE_CODE (inner) == SAVE_EXPR
1524 || TREE_CODE (inner) == ERROR_MARK)
1527 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1528 it means that the size or offset of some field of an object depends on
1529 the value within another field.
1531 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1532 and some variable since it would then need to be both evaluated once and
1533 evaluated more than once. Front-ends must assure this case cannot
1534 happen by surrounding any such subexpressions in their own SAVE_EXPR
1535 and forcing evaluation at the proper time. */
1536 if (contains_placeholder_p (inner))
1539 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
1541 /* This expression might be placed ahead of a jump to ensure that the
1542 value was computed on both sides of the jump. So make sure it isn't
1543 eliminated as dead. */
1544 TREE_SIDE_EFFECTS (t) = 1;
1545 TREE_INVARIANT (t) = 1;
1549 /* Look inside EXPR and into any simple arithmetic operations. Return
1550 the innermost non-arithmetic node. */
1553 skip_simple_arithmetic (tree expr)
1557 /* We don't care about whether this can be used as an lvalue in this
1559 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1560 expr = TREE_OPERAND (expr, 0);
1562 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1563 a constant, it will be more efficient to not make another SAVE_EXPR since
1564 it will allow better simplification and GCSE will be able to merge the
1565 computations if they actually occur. */
1569 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1570 inner = TREE_OPERAND (inner, 0);
1571 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1573 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1574 inner = TREE_OPERAND (inner, 0);
1575 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1576 inner = TREE_OPERAND (inner, 1);
1587 /* Returns the index of the first non-tree operand for CODE, or the number
1588 of operands if all are trees. */
1591 first_rtl_op (enum tree_code code)
1596 return TREE_CODE_LENGTH (code);
1600 /* Return which tree structure is used by T. */
1602 enum tree_node_structure_enum
1603 tree_node_structure (tree t)
1605 enum tree_code code = TREE_CODE (t);
1607 switch (TREE_CODE_CLASS (code))
1609 case 'd': return TS_DECL;
1610 case 't': return TS_TYPE;
1611 case 'r': case '<': case '1': case '2': case 'e': case 's':
1613 default: /* 'c' and 'x' */
1619 case INTEGER_CST: return TS_INT_CST;
1620 case REAL_CST: return TS_REAL_CST;
1621 case COMPLEX_CST: return TS_COMPLEX;
1622 case VECTOR_CST: return TS_VECTOR;
1623 case STRING_CST: return TS_STRING;
1625 case ERROR_MARK: return TS_COMMON;
1626 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1627 case TREE_LIST: return TS_LIST;
1628 case TREE_VEC: return TS_VEC;
1629 case PHI_NODE: return TS_PHI_NODE;
1630 case SSA_NAME: return TS_SSA_NAME;
1631 case PLACEHOLDER_EXPR: return TS_COMMON;
1632 case STATEMENT_LIST: return TS_STATEMENT_LIST;
1633 case BLOCK: return TS_BLOCK;
1634 case TREE_BINFO: return TS_BINFO;
1635 case VALUE_HANDLE: return TS_VALUE_HANDLE;
1642 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1643 or offset that depends on a field within a record. */
1646 contains_placeholder_p (tree exp)
1648 enum tree_code code;
1653 code = TREE_CODE (exp);
1654 if (code == PLACEHOLDER_EXPR)
1657 switch (TREE_CODE_CLASS (code))
1660 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1661 position computations since they will be converted into a
1662 WITH_RECORD_EXPR involving the reference, which will assume
1663 here will be valid. */
1664 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1667 if (code == TREE_LIST)
1668 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1669 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1678 /* Ignoring the first operand isn't quite right, but works best. */
1679 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1682 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1683 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1684 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1690 switch (first_rtl_op (code))
1693 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1695 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1696 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1707 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1708 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1712 type_contains_placeholder_p (tree type)
1714 /* If the size contains a placeholder or the parent type (component type in
1715 the case of arrays) type involves a placeholder, this type does. */
1716 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1717 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1718 || (TREE_TYPE (type) != 0
1719 && type_contains_placeholder_p (TREE_TYPE (type))))
1722 /* Now do type-specific checks. Note that the last part of the check above
1723 greatly limits what we have to do below. */
1724 switch (TREE_CODE (type))
1733 case REFERENCE_TYPE:
1741 /* Here we just check the bounds. */
1742 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1743 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1748 /* We're already checked the component type (TREE_TYPE), so just check
1750 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1754 case QUAL_UNION_TYPE:
1756 static tree seen_types = 0;
1760 /* We have to be careful here that we don't end up in infinite
1761 recursions due to a field of a type being a pointer to that type
1762 or to a mutually-recursive type. So we store a list of record
1763 types that we've seen and see if this type is in them. To save
1764 memory, we don't use a list for just one type. Here we check
1765 whether we've seen this type before and store it if not. */
1766 if (seen_types == 0)
1768 else if (TREE_CODE (seen_types) != TREE_LIST)
1770 if (seen_types == type)
1773 seen_types = tree_cons (NULL_TREE, type,
1774 build_tree_list (NULL_TREE, seen_types));
1778 if (value_member (type, seen_types) != 0)
1781 seen_types = tree_cons (NULL_TREE, type, seen_types);
1784 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1785 if (TREE_CODE (field) == FIELD_DECL
1786 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1787 || (TREE_CODE (type) == QUAL_UNION_TYPE
1788 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1789 || type_contains_placeholder_p (TREE_TYPE (field))))
1795 /* Now remove us from seen_types and return the result. */
1796 if (seen_types == type)
1799 seen_types = TREE_CHAIN (seen_types);
1809 /* Return 1 if EXP contains any expressions that produce cleanups for an
1810 outer scope to deal with. Used by fold. */
1813 has_cleanups (tree exp)
1817 if (! TREE_SIDE_EFFECTS (exp))
1820 switch (TREE_CODE (exp))
1823 case WITH_CLEANUP_EXPR:
1826 case CLEANUP_POINT_EXPR:
1830 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1832 cmp = has_cleanups (TREE_VALUE (exp));
1839 return (DECL_INITIAL (DECL_EXPR_DECL (exp))
1840 && has_cleanups (DECL_INITIAL (DECL_EXPR_DECL (exp))));
1846 /* This general rule works for most tree codes. All exceptions should be
1847 handled above. If this is a language-specific tree code, we can't
1848 trust what might be in the operand, so say we don't know
1850 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1853 nops = first_rtl_op (TREE_CODE (exp));
1854 for (i = 0; i < nops; i++)
1855 if (TREE_OPERAND (exp, i) != 0)
1857 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1858 if (type == 'e' || type == '<' || type == '1' || type == '2'
1859 || type == 'r' || type == 's')
1861 cmp = has_cleanups (TREE_OPERAND (exp, i));
1870 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1871 return a tree with all occurrences of references to F in a
1872 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1873 contains only arithmetic expressions or a CALL_EXPR with a
1874 PLACEHOLDER_EXPR occurring only in its arglist. */
1877 substitute_in_expr (tree exp, tree f, tree r)
1879 enum tree_code code = TREE_CODE (exp);
1884 /* We handle TREE_LIST and COMPONENT_REF separately. */
1885 if (code == TREE_LIST)
1887 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1888 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1889 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1892 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1894 else if (code == COMPONENT_REF)
1896 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1897 and it is the right field, replace it with R. */
1898 for (inner = TREE_OPERAND (exp, 0);
1899 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1900 inner = TREE_OPERAND (inner, 0))
1902 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1903 && TREE_OPERAND (exp, 1) == f)
1906 /* If this expression hasn't been completed let, leave it alone. */
1907 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1910 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1911 if (op0 == TREE_OPERAND (exp, 0))
1914 new = fold (build3 (COMPONENT_REF, TREE_TYPE (exp),
1915 op0, TREE_OPERAND (exp, 1), NULL_TREE));
1918 switch (TREE_CODE_CLASS (code))
1930 switch (first_rtl_op (code))
1936 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1937 if (op0 == TREE_OPERAND (exp, 0))
1940 new = fold (build1 (code, TREE_TYPE (exp), op0));
1944 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1945 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1947 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1950 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
1954 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1955 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1956 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
1958 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1959 && op2 == TREE_OPERAND (exp, 2))
1962 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
1974 TREE_READONLY (new) = TREE_READONLY (exp);
1978 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1979 for it within OBJ, a tree that is an object or a chain of references. */
1982 substitute_placeholder_in_expr (tree exp, tree obj)
1984 enum tree_code code = TREE_CODE (exp);
1985 tree op0, op1, op2, op3;
1987 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
1988 in the chain of OBJ. */
1989 if (code == PLACEHOLDER_EXPR)
1991 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
1994 for (elt = obj; elt != 0;
1995 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
1996 || TREE_CODE (elt) == COND_EXPR)
1997 ? TREE_OPERAND (elt, 1)
1998 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
1999 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2000 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2001 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2002 ? TREE_OPERAND (elt, 0) : 0))
2003 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2006 for (elt = obj; elt != 0;
2007 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2008 || TREE_CODE (elt) == COND_EXPR)
2009 ? TREE_OPERAND (elt, 1)
2010 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2011 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2012 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2013 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2014 ? TREE_OPERAND (elt, 0) : 0))
2015 if (POINTER_TYPE_P (TREE_TYPE (elt))
2016 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2018 return fold (build1 (INDIRECT_REF, need_type, elt));
2020 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2021 survives until RTL generation, there will be an error. */
2025 /* TREE_LIST is special because we need to look at TREE_VALUE
2026 and TREE_CHAIN, not TREE_OPERANDS. */
2027 else if (code == TREE_LIST)
2029 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2030 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2031 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2034 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2037 switch (TREE_CODE_CLASS (code))
2050 switch (first_rtl_op (code))
2056 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2057 if (op0 == TREE_OPERAND (exp, 0))
2060 return fold (build1 (code, TREE_TYPE (exp), op0));
2063 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2064 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2066 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2069 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2072 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2073 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2074 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2076 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2077 && op2 == TREE_OPERAND (exp, 2))
2080 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2083 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2084 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2085 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2086 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2088 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2089 && op2 == TREE_OPERAND (exp, 2)
2090 && op3 == TREE_OPERAND (exp, 3))
2093 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2105 /* Stabilize a reference so that we can use it any number of times
2106 without causing its operands to be evaluated more than once.
2107 Returns the stabilized reference. This works by means of save_expr,
2108 so see the caveats in the comments about save_expr.
2110 Also allows conversion expressions whose operands are references.
2111 Any other kind of expression is returned unchanged. */
2114 stabilize_reference (tree ref)
2117 enum tree_code code = TREE_CODE (ref);
2124 /* No action is needed in this case. */
2130 case FIX_TRUNC_EXPR:
2131 case FIX_FLOOR_EXPR:
2132 case FIX_ROUND_EXPR:
2134 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2138 result = build_nt (INDIRECT_REF,
2139 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2143 result = build_nt (COMPONENT_REF,
2144 stabilize_reference (TREE_OPERAND (ref, 0)),
2145 TREE_OPERAND (ref, 1), NULL_TREE);
2149 result = build_nt (BIT_FIELD_REF,
2150 stabilize_reference (TREE_OPERAND (ref, 0)),
2151 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2152 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2156 result = build_nt (ARRAY_REF,
2157 stabilize_reference (TREE_OPERAND (ref, 0)),
2158 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2159 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2162 case ARRAY_RANGE_REF:
2163 result = build_nt (ARRAY_RANGE_REF,
2164 stabilize_reference (TREE_OPERAND (ref, 0)),
2165 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2166 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2170 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2171 it wouldn't be ignored. This matters when dealing with
2173 return stabilize_reference_1 (ref);
2175 /* If arg isn't a kind of lvalue we recognize, make no change.
2176 Caller should recognize the error for an invalid lvalue. */
2181 return error_mark_node;
2184 TREE_TYPE (result) = TREE_TYPE (ref);
2185 TREE_READONLY (result) = TREE_READONLY (ref);
2186 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2187 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2192 /* Subroutine of stabilize_reference; this is called for subtrees of
2193 references. Any expression with side-effects must be put in a SAVE_EXPR
2194 to ensure that it is only evaluated once.
2196 We don't put SAVE_EXPR nodes around everything, because assigning very
2197 simple expressions to temporaries causes us to miss good opportunities
2198 for optimizations. Among other things, the opportunity to fold in the
2199 addition of a constant into an addressing mode often gets lost, e.g.
2200 "y[i+1] += x;". In general, we take the approach that we should not make
2201 an assignment unless we are forced into it - i.e., that any non-side effect
2202 operator should be allowed, and that cse should take care of coalescing
2203 multiple utterances of the same expression should that prove fruitful. */
2206 stabilize_reference_1 (tree e)
2209 enum tree_code code = TREE_CODE (e);
2211 /* We cannot ignore const expressions because it might be a reference
2212 to a const array but whose index contains side-effects. But we can
2213 ignore things that are actual constant or that already have been
2214 handled by this function. */
2216 if (TREE_INVARIANT (e))
2219 switch (TREE_CODE_CLASS (code))
2228 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2229 so that it will only be evaluated once. */
2230 /* The reference (r) and comparison (<) classes could be handled as
2231 below, but it is generally faster to only evaluate them once. */
2232 if (TREE_SIDE_EFFECTS (e))
2233 return save_expr (e);
2237 /* Constants need no processing. In fact, we should never reach
2242 /* Division is slow and tends to be compiled with jumps,
2243 especially the division by powers of 2 that is often
2244 found inside of an array reference. So do it just once. */
2245 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2246 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2247 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2248 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2249 return save_expr (e);
2250 /* Recursively stabilize each operand. */
2251 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2252 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2256 /* Recursively stabilize each operand. */
2257 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2264 TREE_TYPE (result) = TREE_TYPE (e);
2265 TREE_READONLY (result) = TREE_READONLY (e);
2266 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2267 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2268 TREE_INVARIANT (result) = 1;
2273 /* Low-level constructors for expressions. */
2275 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2276 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2279 recompute_tree_invarant_for_addr_expr (tree t)
2282 bool tc = true, ti = true, se = false;
2284 /* We started out assuming this address is both invariant and constant, but
2285 does not have side effects. Now go down any handled components and see if
2286 any of them involve offsets that are either non-constant or non-invariant.
2287 Also check for side-effects.
2289 ??? Note that this code makes no attempt to deal with the case where
2290 taking the address of something causes a copy due to misalignment. */
2292 #define UPDATE_TITCSE(NODE) \
2293 do { tree _node = (NODE); \
2294 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2295 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2296 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2298 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2299 node = TREE_OPERAND (node, 0))
2301 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2302 array reference (probably made temporarily by the G++ front end),
2303 so ignore all the operands. */
2304 if ((TREE_CODE (node) == ARRAY_REF
2305 || TREE_CODE (node) == ARRAY_RANGE_REF)
2306 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2308 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2309 if (TREE_OPERAND (node, 2))
2310 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2311 if (TREE_OPERAND (node, 3))
2312 UPDATE_TITCSE (TREE_OPERAND (node, 3));
2314 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2315 FIELD_DECL, apparently. The G++ front end can put something else
2316 there, at least temporarily. */
2317 else if (TREE_CODE (node) == COMPONENT_REF
2318 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2320 if (TREE_OPERAND (node, 2))
2321 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2323 else if (TREE_CODE (node) == BIT_FIELD_REF)
2324 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2327 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2328 it. If it's a decl, it's invariant and constant if the decl is static.
2329 It's also invariant if it's a decl in the current function. (Taking the
2330 address of a volatile variable is not volatile.) If it's a constant,
2331 the address is both invariant and constant. Otherwise it's neither. */
2332 if (TREE_CODE (node) == INDIRECT_REF)
2334 /* If this is &((T*)0)->field, then this is a form of addition. */
2335 if (TREE_CODE (TREE_OPERAND (node, 0)) != INTEGER_CST)
2336 UPDATE_TITCSE (node);
2338 else if (DECL_P (node))
2342 else if (decl_function_context (node) == current_function_decl)
2347 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 'c')
2352 se |= TREE_SIDE_EFFECTS (node);
2355 TREE_CONSTANT (t) = tc;
2356 TREE_INVARIANT (t) = ti;
2357 TREE_SIDE_EFFECTS (t) = se;
2358 #undef UPDATE_TITCSE
2361 /* Build an expression of code CODE, data type TYPE, and operands as
2362 specified. Expressions and reference nodes can be created this way.
2363 Constants, decls, types and misc nodes cannot be.
2365 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2366 enough for all extant tree codes. These functions can be called
2367 directly (preferably!), but can also be obtained via GCC preprocessor
2368 magic within the build macro. */
2371 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2375 gcc_assert (TREE_CODE_LENGTH (code) == 0);
2377 t = make_node_stat (code PASS_MEM_STAT);
2384 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2386 int length = sizeof (struct tree_exp);
2387 #ifdef GATHER_STATISTICS
2388 tree_node_kind kind;
2392 #ifdef GATHER_STATISTICS
2393 switch (TREE_CODE_CLASS (code))
2395 case 's': /* an expression with side effects */
2398 case 'r': /* a reference */
2406 tree_node_counts[(int) kind]++;
2407 tree_node_sizes[(int) kind] += length;
2410 gcc_assert (TREE_CODE_LENGTH (code) == 1);
2412 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2414 memset (t, 0, sizeof (struct tree_common));
2416 TREE_SET_CODE (t, code);
2418 TREE_TYPE (t) = type;
2419 #ifdef USE_MAPPED_LOCATION
2420 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2422 SET_EXPR_LOCUS (t, NULL);
2424 TREE_COMPLEXITY (t) = 0;
2425 TREE_OPERAND (t, 0) = node;
2426 TREE_BLOCK (t) = NULL_TREE;
2427 if (node && !TYPE_P (node) && first_rtl_op (code) != 0)
2429 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2430 TREE_READONLY (t) = TREE_READONLY (node);
2433 if (TREE_CODE_CLASS (code) == 's')
2434 TREE_SIDE_EFFECTS (t) = 1;
2440 case PREDECREMENT_EXPR:
2441 case PREINCREMENT_EXPR:
2442 case POSTDECREMENT_EXPR:
2443 case POSTINCREMENT_EXPR:
2444 /* All of these have side-effects, no matter what their
2446 TREE_SIDE_EFFECTS (t) = 1;
2447 TREE_READONLY (t) = 0;
2451 /* Whether a dereference is readonly has nothing to do with whether
2452 its operand is readonly. */
2453 TREE_READONLY (t) = 0;
2458 recompute_tree_invarant_for_addr_expr (t);
2462 if (TREE_CODE_CLASS (code) == '1' && node && !TYPE_P (node)
2463 && TREE_CONSTANT (node))
2464 TREE_CONSTANT (t) = 1;
2465 if (TREE_CODE_CLASS (code) == '1' && node && TREE_INVARIANT (node))
2466 TREE_INVARIANT (t) = 1;
2467 if (TREE_CODE_CLASS (code) == 'r' && node && TREE_THIS_VOLATILE (node))
2468 TREE_THIS_VOLATILE (t) = 1;
2475 #define PROCESS_ARG(N) \
2477 TREE_OPERAND (t, N) = arg##N; \
2478 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2480 if (TREE_SIDE_EFFECTS (arg##N)) \
2482 if (!TREE_READONLY (arg##N)) \
2484 if (!TREE_CONSTANT (arg##N)) \
2486 if (!TREE_INVARIANT (arg##N)) \
2492 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2494 bool constant, read_only, side_effects, invariant;
2498 gcc_assert (TREE_CODE_LENGTH (code) == 2);
2500 t = make_node_stat (code PASS_MEM_STAT);
2503 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2504 result based on those same flags for the arguments. But if the
2505 arguments aren't really even `tree' expressions, we shouldn't be trying
2507 fro = first_rtl_op (code);
2509 /* Expressions without side effects may be constant if their
2510 arguments are as well. */
2511 constant = (TREE_CODE_CLASS (code) == '<'
2512 || TREE_CODE_CLASS (code) == '2');
2514 side_effects = TREE_SIDE_EFFECTS (t);
2515 invariant = constant;
2520 TREE_READONLY (t) = read_only;
2521 TREE_CONSTANT (t) = constant;
2522 TREE_INVARIANT (t) = invariant;
2523 TREE_SIDE_EFFECTS (t) = side_effects;
2524 TREE_THIS_VOLATILE (t)
2525 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2531 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2532 tree arg2 MEM_STAT_DECL)
2534 bool constant, read_only, side_effects, invariant;
2538 gcc_assert (TREE_CODE_LENGTH (code) == 3);
2540 t = make_node_stat (code PASS_MEM_STAT);
2543 fro = first_rtl_op (code);
2545 side_effects = TREE_SIDE_EFFECTS (t);
2551 if (code == CALL_EXPR && !side_effects)
2556 /* Calls have side-effects, except those to const or
2558 i = call_expr_flags (t);
2559 if (!(i & (ECF_CONST | ECF_PURE)))
2562 /* And even those have side-effects if their arguments do. */
2563 else for (node = arg1; node; node = TREE_CHAIN (node))
2564 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2571 TREE_SIDE_EFFECTS (t) = side_effects;
2572 TREE_THIS_VOLATILE (t)
2573 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2579 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2580 tree arg2, tree arg3 MEM_STAT_DECL)
2582 bool constant, read_only, side_effects, invariant;
2586 gcc_assert (TREE_CODE_LENGTH (code) == 4);
2588 t = make_node_stat (code PASS_MEM_STAT);
2591 fro = first_rtl_op (code);
2593 side_effects = TREE_SIDE_EFFECTS (t);
2600 TREE_SIDE_EFFECTS (t) = side_effects;
2601 TREE_THIS_VOLATILE (t)
2602 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2607 /* Backup definition for non-gcc build compilers. */
2610 (build) (enum tree_code code, tree tt, ...)
2612 tree t, arg0, arg1, arg2, arg3;
2613 int length = TREE_CODE_LENGTH (code);
2620 t = build0 (code, tt);
2623 arg0 = va_arg (p, tree);
2624 t = build1 (code, tt, arg0);
2627 arg0 = va_arg (p, tree);
2628 arg1 = va_arg (p, tree);
2629 t = build2 (code, tt, arg0, arg1);
2632 arg0 = va_arg (p, tree);
2633 arg1 = va_arg (p, tree);
2634 arg2 = va_arg (p, tree);
2635 t = build3 (code, tt, arg0, arg1, arg2);
2638 arg0 = va_arg (p, tree);
2639 arg1 = va_arg (p, tree);
2640 arg2 = va_arg (p, tree);
2641 arg3 = va_arg (p, tree);
2642 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2652 /* Similar except don't specify the TREE_TYPE
2653 and leave the TREE_SIDE_EFFECTS as 0.
2654 It is permissible for arguments to be null,
2655 or even garbage if their values do not matter. */
2658 build_nt (enum tree_code code, ...)
2667 t = make_node (code);
2668 length = TREE_CODE_LENGTH (code);
2670 for (i = 0; i < length; i++)
2671 TREE_OPERAND (t, i) = va_arg (p, tree);
2677 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2678 We do NOT enter this node in any sort of symbol table.
2680 layout_decl is used to set up the decl's storage layout.
2681 Other slots are initialized to 0 or null pointers. */
2684 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2688 t = make_node_stat (code PASS_MEM_STAT);
2690 /* if (type == error_mark_node)
2691 type = integer_type_node; */
2692 /* That is not done, deliberately, so that having error_mark_node
2693 as the type can suppress useless errors in the use of this variable. */
2695 DECL_NAME (t) = name;
2696 TREE_TYPE (t) = type;
2698 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2700 else if (code == FUNCTION_DECL)
2701 DECL_MODE (t) = FUNCTION_MODE;
2703 /* Set default visibility to whatever the user supplied with
2704 visibility_specified depending on #pragma GCC visibility. */
2705 DECL_VISIBILITY (t) = default_visibility;
2706 DECL_VISIBILITY_SPECIFIED (t) = visibility_options.inpragma;
2711 /* BLOCK nodes are used to represent the structure of binding contours
2712 and declarations, once those contours have been exited and their contents
2713 compiled. This information is used for outputting debugging info. */
2716 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2717 tree supercontext, tree chain)
2719 tree block = make_node (BLOCK);
2721 BLOCK_VARS (block) = vars;
2722 BLOCK_SUBBLOCKS (block) = subblocks;
2723 BLOCK_SUPERCONTEXT (block) = supercontext;
2724 BLOCK_CHAIN (block) = chain;
2728 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2729 /* ??? gengtype doesn't handle conditionals */
2730 static GTY(()) tree last_annotated_node;
2733 #ifdef USE_MAPPED_LOCATION
2736 expand_location (source_location loc)
2738 expanded_location xloc;
2739 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
2742 const struct line_map *map = linemap_lookup (&line_table, loc);
2743 xloc.file = map->to_file;
2744 xloc.line = SOURCE_LINE (map, loc);
2745 xloc.column = SOURCE_COLUMN (map, loc);
2752 /* Record the exact location where an expression or an identifier were
2756 annotate_with_file_line (tree node, const char *file, int line)
2758 /* Roughly one percent of the calls to this function are to annotate
2759 a node with the same information already attached to that node!
2760 Just return instead of wasting memory. */
2761 if (EXPR_LOCUS (node)
2762 && (EXPR_FILENAME (node) == file
2763 || ! strcmp (EXPR_FILENAME (node), file))
2764 && EXPR_LINENO (node) == line)
2766 last_annotated_node = node;
2770 /* In heavily macroized code (such as GCC itself) this single
2771 entry cache can reduce the number of allocations by more
2773 if (last_annotated_node
2774 && EXPR_LOCUS (last_annotated_node)
2775 && (EXPR_FILENAME (last_annotated_node) == file
2776 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
2777 && EXPR_LINENO (last_annotated_node) == line)
2779 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
2783 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
2784 EXPR_LINENO (node) = line;
2785 EXPR_FILENAME (node) = file;
2786 last_annotated_node = node;
2790 annotate_with_locus (tree node, location_t locus)
2792 annotate_with_file_line (node, locus.file, locus.line);
2796 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2800 build_decl_attribute_variant (tree ddecl, tree attribute)
2802 DECL_ATTRIBUTES (ddecl) = attribute;
2806 /* Borrowed from hashtab.c iterative_hash implementation. */
2807 #define mix(a,b,c) \
2809 a -= b; a -= c; a ^= (c>>13); \
2810 b -= c; b -= a; b ^= (a<< 8); \
2811 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2812 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2813 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2814 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2815 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2816 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2817 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2821 /* Produce good hash value combining VAL and VAL2. */
2822 static inline hashval_t
2823 iterative_hash_hashval_t (hashval_t val, hashval_t val2)
2825 /* the golden ratio; an arbitrary value. */
2826 hashval_t a = 0x9e3779b9;
2832 /* Produce good hash value combining PTR and VAL2. */
2833 static inline hashval_t
2834 iterative_hash_pointer (void *ptr, hashval_t val2)
2836 if (sizeof (ptr) == sizeof (hashval_t))
2837 return iterative_hash_hashval_t ((size_t) ptr, val2);
2840 hashval_t a = (hashval_t) (size_t) ptr;
2841 /* Avoid warnings about shifting of more than the width of the type on
2842 hosts that won't execute this path. */
2844 hashval_t b = (hashval_t) ((size_t) ptr >> (sizeof (hashval_t) * 8 + zero));
2850 /* Produce good hash value combining VAL and VAL2. */
2851 static inline hashval_t
2852 iterative_hash_host_wide_int (HOST_WIDE_INT val, hashval_t val2)
2854 if (sizeof (HOST_WIDE_INT) == sizeof (hashval_t))
2855 return iterative_hash_hashval_t (val, val2);
2858 hashval_t a = (hashval_t) val;
2859 /* Avoid warnings about shifting of more than the width of the type on
2860 hosts that won't execute this path. */
2862 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 8 + zero));
2864 if (sizeof (HOST_WIDE_INT) > 2 * sizeof (hashval_t))
2866 hashval_t a = (hashval_t) (val >> (sizeof (hashval_t) * 16 + zero));
2867 hashval_t b = (hashval_t) (val >> (sizeof (hashval_t) * 24 + zero));
2874 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2877 Record such modified types already made so we don't make duplicates. */
2880 build_type_attribute_variant (tree ttype, tree attribute)
2882 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2884 hashval_t hashcode = 0;
2886 enum tree_code code = TREE_CODE (ttype);
2888 ntype = copy_node (ttype);
2890 TYPE_POINTER_TO (ntype) = 0;
2891 TYPE_REFERENCE_TO (ntype) = 0;
2892 TYPE_ATTRIBUTES (ntype) = attribute;
2894 /* Create a new main variant of TYPE. */
2895 TYPE_MAIN_VARIANT (ntype) = ntype;
2896 TYPE_NEXT_VARIANT (ntype) = 0;
2897 set_type_quals (ntype, TYPE_UNQUALIFIED);
2899 hashcode = iterative_hash_object (code, hashcode);
2900 if (TREE_TYPE (ntype))
2901 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2903 hashcode = attribute_hash_list (attribute, hashcode);
2905 switch (TREE_CODE (ntype))
2908 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2911 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2915 hashcode = iterative_hash_object
2916 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2917 hashcode = iterative_hash_object
2918 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2922 unsigned int precision = TYPE_PRECISION (ntype);
2923 hashcode = iterative_hash_object (precision, hashcode);
2930 ntype = type_hash_canon (hashcode, ntype);
2931 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2937 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2940 We try both `text' and `__text__', ATTR may be either one. */
2941 /* ??? It might be a reasonable simplification to require ATTR to be only
2942 `text'. One might then also require attribute lists to be stored in
2943 their canonicalized form. */
2946 is_attribute_p (const char *attr, tree ident)
2948 int ident_len, attr_len;
2951 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2954 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2957 p = IDENTIFIER_POINTER (ident);
2958 ident_len = strlen (p);
2959 attr_len = strlen (attr);
2961 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2964 gcc_assert (attr[1] == '_');
2965 gcc_assert (attr[attr_len - 2] == '_');
2966 gcc_assert (attr[attr_len - 1] == '_');
2967 gcc_assert (attr[1] == '_');
2968 if (ident_len == attr_len - 4
2969 && strncmp (attr + 2, p, attr_len - 4) == 0)
2974 if (ident_len == attr_len + 4
2975 && p[0] == '_' && p[1] == '_'
2976 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2977 && strncmp (attr, p + 2, attr_len) == 0)
2984 /* Given an attribute name and a list of attributes, return a pointer to the
2985 attribute's list element if the attribute is part of the list, or NULL_TREE
2986 if not found. If the attribute appears more than once, this only
2987 returns the first occurrence; the TREE_CHAIN of the return value should
2988 be passed back in if further occurrences are wanted. */
2991 lookup_attribute (const char *attr_name, tree list)
2995 for (l = list; l; l = TREE_CHAIN (l))
2997 gcc_assert (TREE_CODE (TREE_PURPOSE (l)) == IDENTIFIER_NODE);
2998 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
3005 /* Return an attribute list that is the union of a1 and a2. */
3008 merge_attributes (tree a1, tree a2)
3012 /* Either one unset? Take the set one. */
3014 if ((attributes = a1) == 0)
3017 /* One that completely contains the other? Take it. */
3019 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
3021 if (attribute_list_contained (a2, a1))
3025 /* Pick the longest list, and hang on the other list. */
3027 if (list_length (a1) < list_length (a2))
3028 attributes = a2, a2 = a1;
3030 for (; a2 != 0; a2 = TREE_CHAIN (a2))
3033 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3036 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
3039 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
3044 a1 = copy_node (a2);
3045 TREE_CHAIN (a1) = attributes;
3054 /* Given types T1 and T2, merge their attributes and return
3058 merge_type_attributes (tree t1, tree t2)
3060 return merge_attributes (TYPE_ATTRIBUTES (t1),
3061 TYPE_ATTRIBUTES (t2));
3064 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3068 merge_decl_attributes (tree olddecl, tree newdecl)
3070 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3071 DECL_ATTRIBUTES (newdecl));
3074 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3076 /* Specialization of merge_decl_attributes for various Windows targets.
3078 This handles the following situation:
3080 __declspec (dllimport) int foo;
3083 The second instance of `foo' nullifies the dllimport. */
3086 merge_dllimport_decl_attributes (tree old, tree new)
3089 int delete_dllimport_p;
3091 old = DECL_ATTRIBUTES (old);
3092 new = DECL_ATTRIBUTES (new);
3094 /* What we need to do here is remove from `old' dllimport if it doesn't
3095 appear in `new'. dllimport behaves like extern: if a declaration is
3096 marked dllimport and a definition appears later, then the object
3097 is not dllimport'd. */
3098 if (lookup_attribute ("dllimport", old) != NULL_TREE
3099 && lookup_attribute ("dllimport", new) == NULL_TREE)
3100 delete_dllimport_p = 1;
3102 delete_dllimport_p = 0;
3104 a = merge_attributes (old, new);
3106 if (delete_dllimport_p)
3110 /* Scan the list for dllimport and delete it. */
3111 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3113 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3115 if (prev == NULL_TREE)
3118 TREE_CHAIN (prev) = TREE_CHAIN (t);
3127 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3128 struct attribute_spec.handler. */
3131 handle_dll_attribute (tree * pnode, tree name, tree args, int flags,
3136 /* These attributes may apply to structure and union types being created,
3137 but otherwise should pass to the declaration involved. */
3140 if (flags & ((int) ATTR_FLAG_DECL_NEXT | (int) ATTR_FLAG_FUNCTION_NEXT
3141 | (int) ATTR_FLAG_ARRAY_NEXT))
3143 *no_add_attrs = true;
3144 return tree_cons (name, args, NULL_TREE);
3146 if (TREE_CODE (node) != RECORD_TYPE && TREE_CODE (node) != UNION_TYPE)
3148 warning ("`%s' attribute ignored", IDENTIFIER_POINTER (name));
3149 *no_add_attrs = true;
3155 /* Report error on dllimport ambiguities seen now before they cause
3157 if (is_attribute_p ("dllimport", name))
3159 /* Like MS, treat definition of dllimported variables and
3160 non-inlined functions on declaration as syntax errors. We
3161 allow the attribute for function definitions if declared
3163 if (TREE_CODE (node) == FUNCTION_DECL && DECL_INITIAL (node)
3164 && !DECL_DECLARED_INLINE_P (node))
3166 error ("%Jfunction `%D' definition is marked dllimport.", node, node);
3167 *no_add_attrs = true;
3170 else if (TREE_CODE (node) == VAR_DECL)
3172 if (DECL_INITIAL (node))
3174 error ("%Jvariable `%D' definition is marked dllimport.",
3176 *no_add_attrs = true;
3179 /* `extern' needn't be specified with dllimport.
3180 Specify `extern' now and hope for the best. Sigh. */
3181 DECL_EXTERNAL (node) = 1;
3182 /* Also, implicitly give dllimport'd variables declared within
3183 a function global scope, unless declared static. */
3184 if (current_function_decl != NULL_TREE && !TREE_STATIC (node))
3185 TREE_PUBLIC (node) = 1;
3189 /* Report error if symbol is not accessible at global scope. */
3190 if (!TREE_PUBLIC (node)
3191 && (TREE_CODE (node) == VAR_DECL
3192 || TREE_CODE (node) == FUNCTION_DECL))
3194 error ("%Jexternal linkage required for symbol '%D' because of "
3195 "'%s' attribute.", node, node, IDENTIFIER_POINTER (name));
3196 *no_add_attrs = true;
3202 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3204 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3205 of the various TYPE_QUAL values. */
3208 set_type_quals (tree type, int type_quals)
3210 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3211 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3212 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3215 /* Returns true iff cand is equivalent to base with type_quals. */
3218 check_qualified_type (tree cand, tree base, int type_quals)
3220 return (TYPE_QUALS (cand) == type_quals
3221 && TYPE_NAME (cand) == TYPE_NAME (base)
3222 /* Apparently this is needed for Objective-C. */
3223 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3224 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3225 TYPE_ATTRIBUTES (base)));
3228 /* Return a version of the TYPE, qualified as indicated by the
3229 TYPE_QUALS, if one exists. If no qualified version exists yet,
3230 return NULL_TREE. */
3233 get_qualified_type (tree type, int type_quals)
3237 if (TYPE_QUALS (type) == type_quals)
3240 /* Search the chain of variants to see if there is already one there just
3241 like the one we need to have. If so, use that existing one. We must
3242 preserve the TYPE_NAME, since there is code that depends on this. */
3243 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3244 if (check_qualified_type (t, type, type_quals))
3250 /* Like get_qualified_type, but creates the type if it does not
3251 exist. This function never returns NULL_TREE. */
3254 build_qualified_type (tree type, int type_quals)
3258 /* See if we already have the appropriate qualified variant. */
3259 t = get_qualified_type (type, type_quals);
3261 /* If not, build it. */
3264 t = build_variant_type_copy (type);
3265 set_type_quals (t, type_quals);
3271 /* Create a new distinct copy of TYPE. The new type is made its own
3275 build_distinct_type_copy (tree type)
3277 tree t = copy_node (type);
3279 TYPE_POINTER_TO (t) = 0;
3280 TYPE_REFERENCE_TO (t) = 0;
3282 /* Make it its own variant. */
3283 TYPE_MAIN_VARIANT (t) = t;
3284 TYPE_NEXT_VARIANT (t) = 0;
3289 /* Create a new variant of TYPE, equivalent but distinct.
3290 This is so the caller can modify it. */
3293 build_variant_type_copy (tree type)
3295 tree t, m = TYPE_MAIN_VARIANT (type);
3297 t = build_distinct_type_copy (type);
3299 /* Add the new type to the chain of variants of TYPE. */
3300 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3301 TYPE_NEXT_VARIANT (m) = t;
3302 TYPE_MAIN_VARIANT (t) = m;
3307 /* Hashing of types so that we don't make duplicates.
3308 The entry point is `type_hash_canon'. */
3310 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3311 with types in the TREE_VALUE slots), by adding the hash codes
3312 of the individual types. */
3315 type_hash_list (tree list, hashval_t hashcode)
3319 for (tail = list; tail; tail = TREE_CHAIN (tail))
3320 if (TREE_VALUE (tail) != error_mark_node)
3321 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3327 /* These are the Hashtable callback functions. */
3329 /* Returns true iff the types are equivalent. */
3332 type_hash_eq (const void *va, const void *vb)
3334 const struct type_hash *a = va, *b = vb;
3336 /* First test the things that are the same for all types. */
3337 if (a->hash != b->hash
3338 || TREE_CODE (a->type) != TREE_CODE (b->type)
3339 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3340 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3341 TYPE_ATTRIBUTES (b->type))
3342 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3343 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3346 switch (TREE_CODE (a->type))
3352 case REFERENCE_TYPE:
3356 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3357 && !(TYPE_VALUES (a->type)
3358 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3359 && TYPE_VALUES (b->type)
3360 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3361 && type_list_equal (TYPE_VALUES (a->type),
3362 TYPE_VALUES (b->type))))
3365 /* ... fall through ... */
3371 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3372 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3373 TYPE_MAX_VALUE (b->type)))
3374 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3375 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3376 TYPE_MIN_VALUE (b->type))));
3379 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3382 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3383 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3384 || (TYPE_ARG_TYPES (a->type)
3385 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3386 && TYPE_ARG_TYPES (b->type)
3387 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3388 && type_list_equal (TYPE_ARG_TYPES (a->type),
3389 TYPE_ARG_TYPES (b->type)))));
3393 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3397 case QUAL_UNION_TYPE:
3398 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3399 || (TYPE_FIELDS (a->type)
3400 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3401 && TYPE_FIELDS (b->type)
3402 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3403 && type_list_equal (TYPE_FIELDS (a->type),
3404 TYPE_FIELDS (b->type))));
3407 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3408 || (TYPE_ARG_TYPES (a->type)
3409 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3410 && TYPE_ARG_TYPES (b->type)
3411 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3412 && type_list_equal (TYPE_ARG_TYPES (a->type),
3413 TYPE_ARG_TYPES (b->type))));
3420 /* Return the cached hash value. */
3423 type_hash_hash (const void *item)
3425 return ((const struct type_hash *) item)->hash;
3428 /* Look in the type hash table for a type isomorphic to TYPE.
3429 If one is found, return it. Otherwise return 0. */
3432 type_hash_lookup (hashval_t hashcode, tree type)
3434 struct type_hash *h, in;
3436 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3437 must call that routine before comparing TYPE_ALIGNs. */
3443 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3449 /* Add an entry to the type-hash-table
3450 for a type TYPE whose hash code is HASHCODE. */
3453 type_hash_add (hashval_t hashcode, tree type)
3455 struct type_hash *h;
3458 h = ggc_alloc (sizeof (struct type_hash));
3461 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3462 *(struct type_hash **) loc = h;
3465 /* Given TYPE, and HASHCODE its hash code, return the canonical
3466 object for an identical type if one already exists.
3467 Otherwise, return TYPE, and record it as the canonical object.
3469 To use this function, first create a type of the sort you want.
3470 Then compute its hash code from the fields of the type that
3471 make it different from other similar types.
3472 Then call this function and use the value. */
3475 type_hash_canon (unsigned int hashcode, tree type)
3479 /* The hash table only contains main variants, so ensure that's what we're
3481 gcc_assert (TYPE_MAIN_VARIANT (type) == type);
3483 if (!lang_hooks.types.hash_types)
3486 /* See if the type is in the hash table already. If so, return it.
3487 Otherwise, add the type. */
3488 t1 = type_hash_lookup (hashcode, type);
3491 #ifdef GATHER_STATISTICS
3492 tree_node_counts[(int) t_kind]--;
3493 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3499 type_hash_add (hashcode, type);
3504 /* See if the data pointed to by the type hash table is marked. We consider
3505 it marked if the type is marked or if a debug type number or symbol
3506 table entry has been made for the type. This reduces the amount of
3507 debugging output and eliminates that dependency of the debug output on
3508 the number of garbage collections. */
3511 type_hash_marked_p (const void *p)
3513 tree type = ((struct type_hash *) p)->type;
3515 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3519 print_type_hash_statistics (void)
3521 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3522 (long) htab_size (type_hash_table),
3523 (long) htab_elements (type_hash_table),
3524 htab_collisions (type_hash_table));
3527 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3528 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3529 by adding the hash codes of the individual attributes. */
3532 attribute_hash_list (tree list, hashval_t hashcode)
3536 for (tail = list; tail; tail = TREE_CHAIN (tail))
3537 /* ??? Do we want to add in TREE_VALUE too? */
3538 hashcode = iterative_hash_object
3539 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3543 /* Given two lists of attributes, return true if list l2 is
3544 equivalent to l1. */
3547 attribute_list_equal (tree l1, tree l2)
3549 return attribute_list_contained (l1, l2)
3550 && attribute_list_contained (l2, l1);
3553 /* Given two lists of attributes, return true if list L2 is
3554 completely contained within L1. */
3555 /* ??? This would be faster if attribute names were stored in a canonicalized
3556 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3557 must be used to show these elements are equivalent (which they are). */
3558 /* ??? It's not clear that attributes with arguments will always be handled
3562 attribute_list_contained (tree l1, tree l2)
3566 /* First check the obvious, maybe the lists are identical. */
3570 /* Maybe the lists are similar. */
3571 for (t1 = l1, t2 = l2;
3573 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3574 && TREE_VALUE (t1) == TREE_VALUE (t2);
3575 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3577 /* Maybe the lists are equal. */
3578 if (t1 == 0 && t2 == 0)
3581 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3584 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3586 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3589 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3596 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3603 /* Given two lists of types
3604 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3605 return 1 if the lists contain the same types in the same order.
3606 Also, the TREE_PURPOSEs must match. */
3609 type_list_equal (tree l1, tree l2)
3613 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3614 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3615 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3616 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3617 && (TREE_TYPE (TREE_PURPOSE (t1))
3618 == TREE_TYPE (TREE_PURPOSE (t2))))))
3624 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3625 given by TYPE. If the argument list accepts variable arguments,
3626 then this function counts only the ordinary arguments. */
3629 type_num_arguments (tree type)
3634 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3635 /* If the function does not take a variable number of arguments,
3636 the last element in the list will have type `void'. */
3637 if (VOID_TYPE_P (TREE_VALUE (t)))
3645 /* Nonzero if integer constants T1 and T2
3646 represent the same constant value. */
3649 tree_int_cst_equal (tree t1, tree t2)
3654 if (t1 == 0 || t2 == 0)
3657 if (TREE_CODE (t1) == INTEGER_CST
3658 && TREE_CODE (t2) == INTEGER_CST
3659 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3660 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3666 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3667 The precise way of comparison depends on their data type. */
3670 tree_int_cst_lt (tree t1, tree t2)
3675 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3677 int t1_sgn = tree_int_cst_sgn (t1);
3678 int t2_sgn = tree_int_cst_sgn (t2);
3680 if (t1_sgn < t2_sgn)
3682 else if (t1_sgn > t2_sgn)
3684 /* Otherwise, both are non-negative, so we compare them as
3685 unsigned just in case one of them would overflow a signed
3688 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3689 return INT_CST_LT (t1, t2);
3691 return INT_CST_LT_UNSIGNED (t1, t2);
3694 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3697 tree_int_cst_compare (tree t1, tree t2)
3699 if (tree_int_cst_lt (t1, t2))
3701 else if (tree_int_cst_lt (t2, t1))
3707 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3708 the host. If POS is zero, the value can be represented in a single
3709 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3710 be represented in a single unsigned HOST_WIDE_INT. */
3713 host_integerp (tree t, int pos)
3715 return (TREE_CODE (t) == INTEGER_CST
3716 && ! TREE_OVERFLOW (t)
3717 && ((TREE_INT_CST_HIGH (t) == 0
3718 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3719 || (! pos && TREE_INT_CST_HIGH (t) == -1
3720 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3721 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3722 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3725 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3726 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3727 be positive. Abort if we cannot satisfy the above conditions. */
3730 tree_low_cst (tree t, int pos)
3732 gcc_assert (host_integerp (t, pos));
3733 return TREE_INT_CST_LOW (t);
3736 /* Return the most significant bit of the integer constant T. */
3739 tree_int_cst_msb (tree t)
3743 unsigned HOST_WIDE_INT l;
3745 /* Note that using TYPE_PRECISION here is wrong. We care about the
3746 actual bits, not the (arbitrary) range of the type. */
3747 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3748 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3749 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3750 return (l & 1) == 1;
3753 /* Return an indication of the sign of the integer constant T.
3754 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3755 Note that -1 will never be returned it T's type is unsigned. */
3758 tree_int_cst_sgn (tree t)
3760 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3762 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3764 else if (TREE_INT_CST_HIGH (t) < 0)
3770 /* Compare two constructor-element-type constants. Return 1 if the lists
3771 are known to be equal; otherwise return 0. */
3774 simple_cst_list_equal (tree l1, tree l2)
3776 while (l1 != NULL_TREE && l2 != NULL_TREE)
3778 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3781 l1 = TREE_CHAIN (l1);
3782 l2 = TREE_CHAIN (l2);
3788 /* Return truthvalue of whether T1 is the same tree structure as T2.
3789 Return 1 if they are the same.
3790 Return 0 if they are understandably different.
3791 Return -1 if either contains tree structure not understood by
3795 simple_cst_equal (tree t1, tree t2)
3797 enum tree_code code1, code2;
3803 if (t1 == 0 || t2 == 0)
3806 code1 = TREE_CODE (t1);
3807 code2 = TREE_CODE (t2);
3809 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3811 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3812 || code2 == NON_LVALUE_EXPR)
3813 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3815 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3818 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3819 || code2 == NON_LVALUE_EXPR)
3820 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3828 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3829 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3832 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3835 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3836 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3837 TREE_STRING_LENGTH (t1)));
3840 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1),
3841 CONSTRUCTOR_ELTS (t2));
3844 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3847 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3851 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3854 /* Special case: if either target is an unallocated VAR_DECL,
3855 it means that it's going to be unified with whatever the
3856 TARGET_EXPR is really supposed to initialize, so treat it
3857 as being equivalent to anything. */
3858 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3859 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3860 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3861 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3862 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3863 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3866 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3871 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3873 case WITH_CLEANUP_EXPR:
3874 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3878 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3881 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3882 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3896 /* This general rule works for most tree codes. All exceptions should be
3897 handled above. If this is a language-specific tree code, we can't
3898 trust what might be in the operand, so say we don't know
3900 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3903 switch (TREE_CODE_CLASS (code1))
3912 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3914 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3926 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3927 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3928 than U, respectively. */
3931 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3933 if (tree_int_cst_sgn (t) < 0)
3935 else if (TREE_INT_CST_HIGH (t) != 0)
3937 else if (TREE_INT_CST_LOW (t) == u)
3939 else if (TREE_INT_CST_LOW (t) < u)
3945 /* Return true if CODE represents an associative tree code. Otherwise
3948 associative_tree_code (enum tree_code code)
3967 /* Return true if CODE represents an commutative tree code. Otherwise
3970 commutative_tree_code (enum tree_code code)
3983 case UNORDERED_EXPR:
3987 case TRUTH_AND_EXPR:
3988 case TRUTH_XOR_EXPR:
3998 /* Generate a hash value for an expression. This can be used iteratively
3999 by passing a previous result as the "val" argument.
4001 This function is intended to produce the same hash for expressions which
4002 would compare equal using operand_equal_p. */
4005 iterative_hash_expr (tree t, hashval_t val)
4008 enum tree_code code;
4012 return iterative_hash_pointer (t, val);
4014 code = TREE_CODE (t);
4018 /* Alas, constants aren't shared, so we can't rely on pointer
4021 val = iterative_hash_host_wide_int (TREE_INT_CST_LOW (t), val);
4022 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t), val);
4025 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
4027 return iterative_hash_hashval_t (val2, val);
4030 return iterative_hash (TREE_STRING_POINTER (t),
4031 TREE_STRING_LENGTH (t), val);
4033 val = iterative_hash_expr (TREE_REALPART (t), val);
4034 return iterative_hash_expr (TREE_IMAGPART (t), val);
4036 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
4040 /* we can just compare by pointer. */
4041 return iterative_hash_pointer (t, val);
4044 /* A list of expressions, for a CALL_EXPR or as the elements of a
4046 for (; t; t = TREE_CHAIN (t))
4047 val = iterative_hash_expr (TREE_VALUE (t), val);
4050 class = TREE_CODE_CLASS (code);
4054 /* Decls we can just compare by pointer. */
4055 val = iterative_hash_pointer (t, val);
4059 gcc_assert (IS_EXPR_CODE_CLASS (class));
4061 val = iterative_hash_object (code, val);
4063 /* Don't hash the type, that can lead to having nodes which
4064 compare equal according to operand_equal_p, but which
4065 have different hash codes. */
4066 if (code == NOP_EXPR
4067 || code == CONVERT_EXPR
4068 || code == NON_LVALUE_EXPR)
4070 /* Make sure to include signness in the hash computation. */
4071 val += TYPE_UNSIGNED (TREE_TYPE (t));
4072 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
4075 else if (commutative_tree_code (code))
4077 /* It's a commutative expression. We want to hash it the same
4078 however it appears. We do this by first hashing both operands
4079 and then rehashing based on the order of their independent
4081 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
4082 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
4086 t = one, one = two, two = t;
4088 val = iterative_hash_hashval_t (one, val);
4089 val = iterative_hash_hashval_t (two, val);
4092 for (i = first_rtl_op (code) - 1; i >= 0; --i)
4093 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
4100 /* Constructors for pointer, array and function types.
4101 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4102 constructed by language-dependent code, not here.) */
4104 /* Construct, lay out and return the type of pointers to TO_TYPE with
4105 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4106 reference all of memory. If such a type has already been
4107 constructed, reuse it. */
4110 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
4115 /* In some cases, languages will have things that aren't a POINTER_TYPE
4116 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4117 In that case, return that type without regard to the rest of our
4120 ??? This is a kludge, but consistent with the way this function has
4121 always operated and there doesn't seem to be a good way to avoid this
4123 if (TYPE_POINTER_TO (to_type) != 0
4124 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
4125 return TYPE_POINTER_TO (to_type);
4127 /* First, if we already have a type for pointers to TO_TYPE and it's
4128 the proper mode, use it. */
4129 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
4130 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4133 t = make_node (POINTER_TYPE);
4135 TREE_TYPE (t) = to_type;
4136 TYPE_MODE (t) = mode;
4137 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4138 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
4139 TYPE_POINTER_TO (to_type) = t;
4141 /* Lay out the type. This function has many callers that are concerned
4142 with expression-construction, and this simplifies them all. */
4148 /* By default build pointers in ptr_mode. */
4151 build_pointer_type (tree to_type)
4153 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4156 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4159 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4164 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4165 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4166 In that case, return that type without regard to the rest of our
4169 ??? This is a kludge, but consistent with the way this function has
4170 always operated and there doesn't seem to be a good way to avoid this
4172 if (TYPE_REFERENCE_TO (to_type) != 0
4173 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4174 return TYPE_REFERENCE_TO (to_type);
4176 /* First, if we already have a type for pointers to TO_TYPE and it's
4177 the proper mode, use it. */
4178 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4179 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4182 t = make_node (REFERENCE_TYPE);
4184 TREE_TYPE (t) = to_type;
4185 TYPE_MODE (t) = mode;
4186 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4187 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4188 TYPE_REFERENCE_TO (to_type) = t;
4196 /* Build the node for the type of references-to-TO_TYPE by default
4200 build_reference_type (tree to_type)
4202 return build_reference_type_for_mode (to_type, ptr_mode, false);
4205 /* Build a type that is compatible with t but has no cv quals anywhere
4208 const char *const *const * -> char ***. */
4211 build_type_no_quals (tree t)
4213 switch (TREE_CODE (t))
4216 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4218 TYPE_REF_CAN_ALIAS_ALL (t));
4219 case REFERENCE_TYPE:
4221 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4223 TYPE_REF_CAN_ALIAS_ALL (t));
4225 return TYPE_MAIN_VARIANT (t);
4229 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4230 MAXVAL should be the maximum value in the domain
4231 (one less than the length of the array).
4233 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4234 We don't enforce this limit, that is up to caller (e.g. language front end).
4235 The limit exists because the result is a signed type and we don't handle
4236 sizes that use more than one HOST_WIDE_INT. */
4239 build_index_type (tree maxval)
4241 tree itype = make_node (INTEGER_TYPE);
4243 TREE_TYPE (itype) = sizetype;
4244 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4245 TYPE_MIN_VALUE (itype) = size_zero_node;
4246 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4247 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4248 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4249 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4250 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4251 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4253 if (host_integerp (maxval, 1))
4254 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4259 /* Builds a signed or unsigned integer type of precision PRECISION.
4260 Used for C bitfields whose precision does not match that of
4261 built-in target types. */
4263 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
4266 tree itype = make_node (INTEGER_TYPE);
4268 TYPE_PRECISION (itype) = precision;
4271 fixup_unsigned_type (itype);
4273 fixup_signed_type (itype);
4275 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
4276 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
4281 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4282 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4283 low bound LOWVAL and high bound HIGHVAL.
4284 if TYPE==NULL_TREE, sizetype is used. */
4287 build_range_type (tree type, tree lowval, tree highval)
4289 tree itype = make_node (INTEGER_TYPE);
4291 TREE_TYPE (itype) = type;
4292 if (type == NULL_TREE)
4295 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4296 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4298 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4299 TYPE_MODE (itype) = TYPE_MODE (type);
4300 TYPE_SIZE (itype) = TYPE_SIZE (type);
4301 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4302 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4303 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4305 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4306 return type_hash_canon (tree_low_cst (highval, 0)
4307 - tree_low_cst (lowval, 0),
4313 /* Just like build_index_type, but takes lowval and highval instead
4314 of just highval (maxval). */
4317 build_index_2_type (tree lowval, tree highval)
4319 return build_range_type (sizetype, lowval, highval);
4322 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4323 and number of elements specified by the range of values of INDEX_TYPE.
4324 If such a type has already been constructed, reuse it. */
4327 build_array_type (tree elt_type, tree index_type)
4330 hashval_t hashcode = 0;
4332 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4334 error ("arrays of functions are not meaningful");
4335 elt_type = integer_type_node;
4338 t = make_node (ARRAY_TYPE);
4339 TREE_TYPE (t) = elt_type;
4340 TYPE_DOMAIN (t) = index_type;
4342 if (index_type == 0)
4345 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4346 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4347 t = type_hash_canon (hashcode, t);
4349 if (!COMPLETE_TYPE_P (t))
4354 /* Return the TYPE of the elements comprising
4355 the innermost dimension of ARRAY. */
4358 get_inner_array_type (tree array)
4360 tree type = TREE_TYPE (array);
4362 while (TREE_CODE (type) == ARRAY_TYPE)
4363 type = TREE_TYPE (type);
4368 /* Construct, lay out and return
4369 the type of functions returning type VALUE_TYPE
4370 given arguments of types ARG_TYPES.
4371 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4372 are data type nodes for the arguments of the function.
4373 If such a type has already been constructed, reuse it. */
4376 build_function_type (tree value_type, tree arg_types)
4379 hashval_t hashcode = 0;
4381 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4383 error ("function return type cannot be function");
4384 value_type = integer_type_node;
4387 /* Make a node of the sort we want. */
4388 t = make_node (FUNCTION_TYPE);
4389 TREE_TYPE (t) = value_type;
4390 TYPE_ARG_TYPES (t) = arg_types;
4392 /* If we already have such a type, use the old one. */
4393 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4394 hashcode = type_hash_list (arg_types, hashcode);
4395 t = type_hash_canon (hashcode, t);
4397 if (!COMPLETE_TYPE_P (t))
4402 /* Build a function type. The RETURN_TYPE is the type returned by the
4403 function. If additional arguments are provided, they are
4404 additional argument types. The list of argument types must always
4405 be terminated by NULL_TREE. */
4408 build_function_type_list (tree return_type, ...)
4413 va_start (p, return_type);
4415 t = va_arg (p, tree);
4416 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4417 args = tree_cons (NULL_TREE, t, args);
4420 args = nreverse (args);
4421 TREE_CHAIN (last) = void_list_node;
4422 args = build_function_type (return_type, args);
4428 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4429 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4430 for the method. An implicit additional parameter (of type
4431 pointer-to-BASETYPE) is added to the ARGTYPES. */
4434 build_method_type_directly (tree basetype,
4442 /* Make a node of the sort we want. */
4443 t = make_node (METHOD_TYPE);
4445 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4446 TREE_TYPE (t) = rettype;
4447 ptype = build_pointer_type (basetype);
4449 /* The actual arglist for this function includes a "hidden" argument
4450 which is "this". Put it into the list of argument types. */
4451 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4452 TYPE_ARG_TYPES (t) = argtypes;
4454 /* If we already have such a type, use the old one. */
4455 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4456 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4457 hashcode = type_hash_list (argtypes, hashcode);
4458 t = type_hash_canon (hashcode, t);
4460 if (!COMPLETE_TYPE_P (t))
4466 /* Construct, lay out and return the type of methods belonging to class
4467 BASETYPE and whose arguments and values are described by TYPE.
4468 If that type exists already, reuse it.
4469 TYPE must be a FUNCTION_TYPE node. */
4472 build_method_type (tree basetype, tree type)
4474 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
4476 return build_method_type_directly (basetype,
4478 TYPE_ARG_TYPES (type));
4481 /* Construct, lay out and return the type of offsets to a value
4482 of type TYPE, within an object of type BASETYPE.
4483 If a suitable offset type exists already, reuse it. */
4486 build_offset_type (tree basetype, tree type)
4489 hashval_t hashcode = 0;
4491 /* Make a node of the sort we want. */
4492 t = make_node (OFFSET_TYPE);
4494 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4495 TREE_TYPE (t) = type;
4497 /* If we already have such a type, use the old one. */
4498 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4499 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4500 t = type_hash_canon (hashcode, t);
4502 if (!COMPLETE_TYPE_P (t))
4508 /* Create a complex type whose components are COMPONENT_TYPE. */
4511 build_complex_type (tree component_type)
4516 /* Make a node of the sort we want. */
4517 t = make_node (COMPLEX_TYPE);
4519 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4521 /* If we already have such a type, use the old one. */
4522 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4523 t = type_hash_canon (hashcode, t);
4525 if (!COMPLETE_TYPE_P (t))
4528 /* If we are writing Dwarf2 output we need to create a name,
4529 since complex is a fundamental type. */
4530 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4534 if (component_type == char_type_node)
4535 name = "complex char";
4536 else if (component_type == signed_char_type_node)
4537 name = "complex signed char";
4538 else if (component_type == unsigned_char_type_node)
4539 name = "complex unsigned char";
4540 else if (component_type == short_integer_type_node)
4541 name = "complex short int";
4542 else if (component_type == short_unsigned_type_node)
4543 name = "complex short unsigned int";
4544 else if (component_type == integer_type_node)
4545 name = "complex int";
4546 else if (component_type == unsigned_type_node)
4547 name = "complex unsigned int";
4548 else if (component_type == long_integer_type_node)
4549 name = "complex long int";
4550 else if (component_type == long_unsigned_type_node)
4551 name = "complex long unsigned int";
4552 else if (component_type == long_long_integer_type_node)
4553 name = "complex long long int";
4554 else if (component_type == long_long_unsigned_type_node)
4555 name = "complex long long unsigned int";
4560 TYPE_NAME (t) = get_identifier (name);
4563 return build_qualified_type (t, TYPE_QUALS (component_type));
4566 /* Return OP, stripped of any conversions to wider types as much as is safe.
4567 Converting the value back to OP's type makes a value equivalent to OP.
4569 If FOR_TYPE is nonzero, we return a value which, if converted to
4570 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4572 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4573 narrowest type that can hold the value, even if they don't exactly fit.
4574 Otherwise, bit-field references are changed to a narrower type
4575 only if they can be fetched directly from memory in that type.
4577 OP must have integer, real or enumeral type. Pointers are not allowed!
4579 There are some cases where the obvious value we could return
4580 would regenerate to OP if converted to OP's type,
4581 but would not extend like OP to wider types.
4582 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4583 For example, if OP is (unsigned short)(signed char)-1,
4584 we avoid returning (signed char)-1 if FOR_TYPE is int,
4585 even though extending that to an unsigned short would regenerate OP,
4586 since the result of extending (signed char)-1 to (int)
4587 is different from (int) OP. */
4590 get_unwidened (tree op, tree for_type)
4592 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4593 tree type = TREE_TYPE (op);
4595 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4597 = (for_type != 0 && for_type != type
4598 && final_prec > TYPE_PRECISION (type)
4599 && TYPE_UNSIGNED (type));
4602 while (TREE_CODE (op) == NOP_EXPR)
4605 = TYPE_PRECISION (TREE_TYPE (op))
4606 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4608 /* Truncations are many-one so cannot be removed.
4609 Unless we are later going to truncate down even farther. */
4611 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4614 /* See what's inside this conversion. If we decide to strip it,
4616 op = TREE_OPERAND (op, 0);
4618 /* If we have not stripped any zero-extensions (uns is 0),
4619 we can strip any kind of extension.
4620 If we have previously stripped a zero-extension,
4621 only zero-extensions can safely be stripped.
4622 Any extension can be stripped if the bits it would produce
4623 are all going to be discarded later by truncating to FOR_TYPE. */
4627 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4629 /* TYPE_UNSIGNED says whether this is a zero-extension.
4630 Let's avoid computing it if it does not affect WIN
4631 and if UNS will not be needed again. */
4632 if ((uns || TREE_CODE (op) == NOP_EXPR)
4633 && TYPE_UNSIGNED (TREE_TYPE (op)))
4641 if (TREE_CODE (op) == COMPONENT_REF
4642 /* Since type_for_size always gives an integer type. */
4643 && TREE_CODE (type) != REAL_TYPE
4644 /* Don't crash if field not laid out yet. */
4645 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4646 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4648 unsigned int innerprec
4649 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4650 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4651 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4652 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4654 /* We can get this structure field in the narrowest type it fits in.
4655 If FOR_TYPE is 0, do this only for a field that matches the
4656 narrower type exactly and is aligned for it
4657 The resulting extension to its nominal type (a fullword type)
4658 must fit the same conditions as for other extensions. */
4661 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4662 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4663 && (! uns || final_prec <= innerprec || unsignedp))
4665 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4666 TREE_OPERAND (op, 1), NULL_TREE);
4667 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4668 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4675 /* Return OP or a simpler expression for a narrower value
4676 which can be sign-extended or zero-extended to give back OP.
4677 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4678 or 0 if the value should be sign-extended. */
4681 get_narrower (tree op, int *unsignedp_ptr)
4686 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
4688 while (TREE_CODE (op) == NOP_EXPR)
4691 = (TYPE_PRECISION (TREE_TYPE (op))
4692 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4694 /* Truncations are many-one so cannot be removed. */
4698 /* See what's inside this conversion. If we decide to strip it,
4703 op = TREE_OPERAND (op, 0);
4704 /* An extension: the outermost one can be stripped,
4705 but remember whether it is zero or sign extension. */
4707 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4708 /* Otherwise, if a sign extension has been stripped,
4709 only sign extensions can now be stripped;
4710 if a zero extension has been stripped, only zero-extensions. */
4711 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4715 else /* bitschange == 0 */
4717 /* A change in nominal type can always be stripped, but we must
4718 preserve the unsignedness. */
4720 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4722 op = TREE_OPERAND (op, 0);
4723 /* Keep trying to narrow, but don't assign op to win if it
4724 would turn an integral type into something else. */
4725 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
4732 if (TREE_CODE (op) == COMPONENT_REF
4733 /* Since type_for_size always gives an integer type. */
4734 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4735 /* Ensure field is laid out already. */
4736 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4737 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4739 unsigned HOST_WIDE_INT innerprec
4740 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4741 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4742 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4743 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4745 /* We can get this structure field in a narrower type that fits it,
4746 but the resulting extension to its nominal type (a fullword type)
4747 must satisfy the same conditions as for other extensions.
4749 Do this only for fields that are aligned (not bit-fields),
4750 because when bit-field insns will be used there is no
4751 advantage in doing this. */
4753 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4754 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4755 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
4759 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
4760 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4761 TREE_OPERAND (op, 1), NULL_TREE);
4762 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4763 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4766 *unsignedp_ptr = uns;
4770 /* Nonzero if integer constant C has a value that is permissible
4771 for type TYPE (an INTEGER_TYPE). */
4774 int_fits_type_p (tree c, tree type)
4776 tree type_low_bound = TYPE_MIN_VALUE (type);
4777 tree type_high_bound = TYPE_MAX_VALUE (type);
4778 int ok_for_low_bound, ok_for_high_bound;
4780 /* Perform some generic filtering first, which may allow making a decision
4781 even if the bounds are not constant. First, negative integers never fit
4782 in unsigned types, */
4783 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4784 /* Also, unsigned integers with top bit set never fit signed types. */
4785 || (! TYPE_UNSIGNED (type)
4786 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4789 /* If at least one bound of the type is a constant integer, we can check
4790 ourselves and maybe make a decision. If no such decision is possible, but
4791 this type is a subtype, try checking against that. Otherwise, use
4792 force_fit_type, which checks against the precision.
4794 Compute the status for each possibly constant bound, and return if we see
4795 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4796 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4797 for "constant known to fit". */
4799 ok_for_low_bound = -1;
4800 ok_for_high_bound = -1;
4802 /* Check if C >= type_low_bound. */
4803 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4805 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4806 if (! ok_for_low_bound)
4810 /* Check if c <= type_high_bound. */
4811 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4813 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4814 if (! ok_for_high_bound)
4818 /* If the constant fits both bounds, the result is known. */
4819 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4822 /* If we haven't been able to decide at this point, there nothing more we
4823 can check ourselves here. Look at the base type if we have one. */
4824 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4825 return int_fits_type_p (c, TREE_TYPE (type));
4827 /* Or to force_fit_type, if nothing else. */
4831 TREE_TYPE (c) = type;
4832 c = force_fit_type (c, -1, false, false);
4833 return !TREE_OVERFLOW (c);
4837 /* Subprogram of following function. Called by walk_tree.
4839 Return *TP if it is an automatic variable or parameter of the
4840 function passed in as DATA. */
4843 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
4845 tree fn = (tree) data;
4850 else if (DECL_P (*tp) && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
4856 /* Returns true if T is, contains, or refers to a type with variable
4857 size. If FN is nonzero, only return true if a modifier of the type
4858 or position of FN is a variable or parameter inside FN.
4860 This concept is more general than that of C99 'variably modified types':
4861 in C99, a struct type is never variably modified because a VLA may not
4862 appear as a structure member. However, in GNU C code like:
4864 struct S { int i[f()]; };
4866 is valid, and other languages may define similar constructs. */
4869 variably_modified_type_p (tree type, tree fn)
4873 /* Test if T is either variable (if FN is zero) or an expression containing
4874 a variable in FN. */
4875 #define RETURN_TRUE_IF_VAR(T) \
4876 do { tree _t = (T); \
4877 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4878 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4879 return true; } while (0)
4881 if (type == error_mark_node)
4884 /* If TYPE itself has variable size, it is variably modified.
4886 We do not yet have a representation of the C99 '[*]' syntax.
4887 When a representation is chosen, this function should be modified
4888 to test for that case as well. */
4889 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
4890 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type));
4892 switch (TREE_CODE (type))
4895 case REFERENCE_TYPE:
4899 if (variably_modified_type_p (TREE_TYPE (type), fn))
4905 /* If TYPE is a function type, it is variably modified if any of the
4906 parameters or the return type are variably modified. */
4907 if (variably_modified_type_p (TREE_TYPE (type), fn))
4910 for (t = TYPE_ARG_TYPES (type);
4911 t && t != void_list_node;
4913 if (variably_modified_type_p (TREE_VALUE (t), fn))
4922 /* Scalar types are variably modified if their end points
4924 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
4925 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
4930 case QUAL_UNION_TYPE:
4931 /* We can't see if any of the field are variably-modified by the
4932 definition we normally use, since that would produce infinite
4933 recursion via pointers. */
4934 /* This is variably modified if some field's type is. */
4935 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
4936 if (TREE_CODE (t) == FIELD_DECL)
4938 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
4939 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
4940 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
4942 if (TREE_CODE (type) == QUAL_UNION_TYPE)
4943 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
4951 /* The current language may have other cases to check, but in general,
4952 all other types are not variably modified. */
4953 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
4955 #undef RETURN_TRUE_IF_VAR
4958 /* Given a DECL or TYPE, return the scope in which it was declared, or
4959 NULL_TREE if there is no containing scope. */
4962 get_containing_scope (tree t)
4964 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4967 /* Return the innermost context enclosing DECL that is
4968 a FUNCTION_DECL, or zero if none. */
4971 decl_function_context (tree decl)
4975 if (TREE_CODE (decl) == ERROR_MARK)
4978 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4979 where we look up the function at runtime. Such functions always take
4980 a first argument of type 'pointer to real context'.
4982 C++ should really be fixed to use DECL_CONTEXT for the real context,
4983 and use something else for the "virtual context". */
4984 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4987 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4989 context = DECL_CONTEXT (decl);
4991 while (context && TREE_CODE (context) != FUNCTION_DECL)
4993 if (TREE_CODE (context) == BLOCK)
4994 context = BLOCK_SUPERCONTEXT (context);
4996 context = get_containing_scope (context);
5002 /* Return the innermost context enclosing DECL that is
5003 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5004 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5007 decl_type_context (tree decl)
5009 tree context = DECL_CONTEXT (decl);
5012 switch (TREE_CODE (context))
5014 case NAMESPACE_DECL:
5015 case TRANSLATION_UNIT_DECL:
5020 case QUAL_UNION_TYPE:
5025 context = DECL_CONTEXT (context);
5029 context = BLOCK_SUPERCONTEXT (context);
5039 /* CALL is a CALL_EXPR. Return the declaration for the function
5040 called, or NULL_TREE if the called function cannot be
5044 get_callee_fndecl (tree call)
5048 /* It's invalid to call this function with anything but a
5050 gcc_assert (TREE_CODE (call) == CALL_EXPR);
5052 /* The first operand to the CALL is the address of the function
5054 addr = TREE_OPERAND (call, 0);
5058 /* If this is a readonly function pointer, extract its initial value. */
5059 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
5060 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
5061 && DECL_INITIAL (addr))
5062 addr = DECL_INITIAL (addr);
5064 /* If the address is just `&f' for some function `f', then we know
5065 that `f' is being called. */
5066 if (TREE_CODE (addr) == ADDR_EXPR
5067 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
5068 return TREE_OPERAND (addr, 0);
5070 /* We couldn't figure out what was being called. Maybe the front
5071 end has some idea. */
5072 return lang_hooks.lang_get_callee_fndecl (call);
5075 /* Print debugging information about tree nodes generated during the compile,
5076 and any language-specific information. */
5079 dump_tree_statistics (void)
5081 #ifdef GATHER_STATISTICS
5083 int total_nodes, total_bytes;
5086 fprintf (stderr, "\n??? tree nodes created\n\n");
5087 #ifdef GATHER_STATISTICS
5088 fprintf (stderr, "Kind Nodes Bytes\n");
5089 fprintf (stderr, "---------------------------------------\n");
5090 total_nodes = total_bytes = 0;
5091 for (i = 0; i < (int) all_kinds; i++)
5093 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
5094 tree_node_counts[i], tree_node_sizes[i]);
5095 total_nodes += tree_node_counts[i];
5096 total_bytes += tree_node_sizes[i];
5098 fprintf (stderr, "---------------------------------------\n");
5099 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
5100 fprintf (stderr, "---------------------------------------\n");
5101 ssanames_print_statistics ();
5102 phinodes_print_statistics ();
5104 fprintf (stderr, "(No per-node statistics)\n");
5106 print_type_hash_statistics ();
5107 lang_hooks.print_statistics ();
5110 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5112 /* Generate a crc32 of a string. */
5115 crc32_string (unsigned chksum, const char *string)
5119 unsigned value = *string << 24;
5122 for (ix = 8; ix--; value <<= 1)
5126 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
5135 /* P is a string that will be used in a symbol. Mask out any characters
5136 that are not valid in that context. */
5139 clean_symbol_name (char *p)
5143 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5146 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5153 /* Generate a name for a function unique to this translation unit.
5154 TYPE is some string to identify the purpose of this function to the
5155 linker or collect2. */
5158 get_file_function_name_long (const char *type)
5164 if (first_global_object_name)
5165 p = first_global_object_name;
5168 /* We don't have anything that we know to be unique to this translation
5169 unit, so use what we do have and throw in some randomness. */
5171 const char *name = weak_global_object_name;
5172 const char *file = main_input_filename;
5177 file = input_filename;
5179 len = strlen (file);
5180 q = alloca (9 * 2 + len + 1);
5181 memcpy (q, file, len + 1);
5182 clean_symbol_name (q);
5184 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
5185 crc32_string (0, flag_random_seed));
5190 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
5192 /* Set up the name of the file-level functions we may need.
5193 Use a global object (which is already required to be unique over
5194 the program) rather than the file name (which imposes extra
5196 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5198 return get_identifier (buf);
5201 /* If KIND=='I', return a suitable global initializer (constructor) name.
5202 If KIND=='D', return a suitable global clean-up (destructor) name. */
5205 get_file_function_name (int kind)
5212 return get_file_function_name_long (p);
5215 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5216 The result is placed in BUFFER (which has length BIT_SIZE),
5217 with one bit in each char ('\000' or '\001').
5219 If the constructor is constant, NULL_TREE is returned.
5220 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5223 get_set_constructor_bits (tree init, char *buffer, int bit_size)
5227 HOST_WIDE_INT domain_min
5228 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
5229 tree non_const_bits = NULL_TREE;
5231 for (i = 0; i < bit_size; i++)
5234 for (vals = TREE_OPERAND (init, 1);
5235 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5237 if (!host_integerp (TREE_VALUE (vals), 0)
5238 || (TREE_PURPOSE (vals) != NULL_TREE
5239 && !host_integerp (TREE_PURPOSE (vals), 0)))
5241 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5242 else if (TREE_PURPOSE (vals) != NULL_TREE)
5244 /* Set a range of bits to ones. */
5245 HOST_WIDE_INT lo_index
5246 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
5247 HOST_WIDE_INT hi_index
5248 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5250 gcc_assert (lo_index >= 0);
5251 gcc_assert (lo_index < bit_size);
5252 gcc_assert (hi_index >= 0);
5253 gcc_assert (hi_index < bit_size);
5254 for (; lo_index <= hi_index; lo_index++)
5255 buffer[lo_index] = 1;
5259 /* Set a single bit to one. */
5261 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5262 if (index < 0 || index >= bit_size)
5264 error ("invalid initializer for bit string");
5270 return non_const_bits;
5273 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5274 The result is placed in BUFFER (which is an array of bytes).
5275 If the constructor is constant, NULL_TREE is returned.
5276 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5279 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
5282 int set_word_size = BITS_PER_UNIT;
5283 int bit_size = wd_size * set_word_size;
5285 unsigned char *bytep = buffer;
5286 char *bit_buffer = alloca (bit_size);
5287 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5289 for (i = 0; i < wd_size; i++)
5292 for (i = 0; i < bit_size; i++)
5296 if (BYTES_BIG_ENDIAN)
5297 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5299 *bytep |= 1 << bit_pos;
5302 if (bit_pos >= set_word_size)
5303 bit_pos = 0, bytep++;
5305 return non_const_bits;
5308 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5310 /* Complain that the tree code of NODE does not match the expected 0
5311 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5315 tree_check_failed (const tree node, const char *file,
5316 int line, const char *function, ...)
5320 unsigned length = 0;
5323 va_start (args, function);
5324 while ((code = va_arg (args, int)))
5325 length += 4 + strlen (tree_code_name[code]);
5327 va_start (args, function);
5328 buffer = alloca (length);
5330 while ((code = va_arg (args, int)))
5334 strcpy (buffer + length, " or ");
5337 strcpy (buffer + length, tree_code_name[code]);
5338 length += strlen (tree_code_name[code]);
5342 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5343 buffer, tree_code_name[TREE_CODE (node)],
5344 function, trim_filename (file), line);
5347 /* Complain that the tree code of NODE does match the expected 0
5348 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5352 tree_not_check_failed (const tree node, const char *file,
5353 int line, const char *function, ...)
5357 unsigned length = 0;
5360 va_start (args, function);
5361 while ((code = va_arg (args, int)))
5362 length += 4 + strlen (tree_code_name[code]);
5364 va_start (args, function);
5365 buffer = alloca (length);
5367 while ((code = va_arg (args, int)))
5371 strcpy (buffer + length, " or ");
5374 strcpy (buffer + length, tree_code_name[code]);
5375 length += strlen (tree_code_name[code]);
5379 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5380 buffer, tree_code_name[TREE_CODE (node)],
5381 function, trim_filename (file), line);
5384 /* Similar to tree_check_failed, except that we check for a class of tree
5385 code, given in CL. */
5388 tree_class_check_failed (const tree node, int cl, const char *file,
5389 int line, const char *function)
5392 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5393 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5394 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5397 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5398 (dynamically sized) vector. */
5401 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5402 const char *function)
5405 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5406 idx + 1, len, function, trim_filename (file), line);
5409 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5410 (dynamically sized) vector. */
5413 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5414 const char *function)
5417 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5418 idx + 1, len, function, trim_filename (file), line);
5421 /* Similar to above, except that the check is for the bounds of the operand
5422 vector of an expression node. */
5425 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5426 int line, const char *function)
5429 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5430 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5431 function, trim_filename (file), line);
5433 #endif /* ENABLE_TREE_CHECKING */
5435 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5436 and mapped to the machine mode MODE. Initialize its fields and build
5437 the information necessary for debugging output. */
5440 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
5442 tree t = make_node (VECTOR_TYPE);
5444 TREE_TYPE (t) = innertype;
5445 TYPE_VECTOR_SUBPARTS (t) = nunits;
5446 TYPE_MODE (t) = mode;
5450 tree index = build_int_cst (NULL_TREE, nunits - 1);
5451 tree array = build_array_type (innertype, build_index_type (index));
5452 tree rt = make_node (RECORD_TYPE);
5454 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5455 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5457 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5458 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5459 the representation type, and we want to find that die when looking up
5460 the vector type. This is most easily achieved by making the TYPE_UID
5462 TYPE_UID (rt) = TYPE_UID (t);
5469 make_or_reuse_type (unsigned size, int unsignedp)
5471 if (size == INT_TYPE_SIZE)
5472 return unsignedp ? unsigned_type_node : integer_type_node;
5473 if (size == CHAR_TYPE_SIZE)
5474 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5475 if (size == SHORT_TYPE_SIZE)
5476 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5477 if (size == LONG_TYPE_SIZE)
5478 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5479 if (size == LONG_LONG_TYPE_SIZE)
5480 return (unsignedp ? long_long_unsigned_type_node
5481 : long_long_integer_type_node);
5484 return make_unsigned_type (size);
5486 return make_signed_type (size);
5489 /* Create nodes for all integer types (and error_mark_node) using the sizes
5490 of C datatypes. The caller should call set_sizetype soon after calling
5491 this function to select one of the types as sizetype. */
5494 build_common_tree_nodes (bool signed_char, bool signed_sizetype)
5496 error_mark_node = make_node (ERROR_MARK);
5497 TREE_TYPE (error_mark_node) = error_mark_node;
5499 initialize_sizetypes (signed_sizetype);
5501 /* Define both `signed char' and `unsigned char'. */
5502 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5503 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5505 /* Define `char', which is like either `signed char' or `unsigned char'
5506 but not the same as either. */
5509 ? make_signed_type (CHAR_TYPE_SIZE)
5510 : make_unsigned_type (CHAR_TYPE_SIZE));
5512 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5513 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5514 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5515 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5516 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5517 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5518 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5519 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5521 /* Define a boolean type. This type only represents boolean values but
5522 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5523 Front ends which want to override this size (i.e. Java) can redefine
5524 boolean_type_node before calling build_common_tree_nodes_2. */
5525 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5526 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5527 TYPE_MAX_VALUE (boolean_type_node) = build_int_cst (boolean_type_node, 1);
5528 TYPE_PRECISION (boolean_type_node) = 1;
5530 /* Fill in the rest of the sized types. Reuse existing type nodes
5532 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
5533 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
5534 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
5535 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
5536 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
5538 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
5539 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
5540 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
5541 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
5542 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
5544 access_public_node = get_identifier ("public");
5545 access_protected_node = get_identifier ("protected");
5546 access_private_node = get_identifier ("private");
5549 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5550 It will create several other common tree nodes. */
5553 build_common_tree_nodes_2 (int short_double)
5555 /* Define these next since types below may used them. */
5556 integer_zero_node = build_int_cst (NULL_TREE, 0);
5557 integer_one_node = build_int_cst (NULL_TREE, 1);
5558 integer_minus_one_node = build_int_cst (NULL_TREE, -1);
5560 size_zero_node = size_int (0);
5561 size_one_node = size_int (1);
5562 bitsize_zero_node = bitsize_int (0);
5563 bitsize_one_node = bitsize_int (1);
5564 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5566 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5567 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5569 void_type_node = make_node (VOID_TYPE);
5570 layout_type (void_type_node);
5572 /* We are not going to have real types in C with less than byte alignment,
5573 so we might as well not have any types that claim to have it. */
5574 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5575 TYPE_USER_ALIGN (void_type_node) = 0;
5577 null_pointer_node = build_int_cst (build_pointer_type (void_type_node), 0);
5578 layout_type (TREE_TYPE (null_pointer_node));
5580 ptr_type_node = build_pointer_type (void_type_node);
5582 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5583 fileptr_type_node = ptr_type_node;
5585 float_type_node = make_node (REAL_TYPE);
5586 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5587 layout_type (float_type_node);
5589 double_type_node = make_node (REAL_TYPE);
5591 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5593 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5594 layout_type (double_type_node);
5596 long_double_type_node = make_node (REAL_TYPE);
5597 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5598 layout_type (long_double_type_node);
5600 float_ptr_type_node = build_pointer_type (float_type_node);
5601 double_ptr_type_node = build_pointer_type (double_type_node);
5602 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5603 integer_ptr_type_node = build_pointer_type (integer_type_node);
5605 complex_integer_type_node = make_node (COMPLEX_TYPE);
5606 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5607 layout_type (complex_integer_type_node);
5609 complex_float_type_node = make_node (COMPLEX_TYPE);
5610 TREE_TYPE (complex_float_type_node) = float_type_node;
5611 layout_type (complex_float_type_node);
5613 complex_double_type_node = make_node (COMPLEX_TYPE);
5614 TREE_TYPE (complex_double_type_node) = double_type_node;
5615 layout_type (complex_double_type_node);
5617 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5618 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5619 layout_type (complex_long_double_type_node);
5622 tree t = targetm.build_builtin_va_list ();
5624 /* Many back-ends define record types without setting TYPE_NAME.
5625 If we copied the record type here, we'd keep the original
5626 record type without a name. This breaks name mangling. So,
5627 don't copy record types and let c_common_nodes_and_builtins()
5628 declare the type to be __builtin_va_list. */
5629 if (TREE_CODE (t) != RECORD_TYPE)
5630 t = build_variant_type_copy (t);
5632 va_list_type_node = t;
5636 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5639 If we requested a pointer to a vector, build up the pointers that
5640 we stripped off while looking for the inner type. Similarly for
5641 return values from functions.
5643 The argument TYPE is the top of the chain, and BOTTOM is the
5644 new type which we will point to. */
5647 reconstruct_complex_type (tree type, tree bottom)
5651 if (POINTER_TYPE_P (type))
5653 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5654 outer = build_pointer_type (inner);
5656 else if (TREE_CODE (type) == ARRAY_TYPE)
5658 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5659 outer = build_array_type (inner, TYPE_DOMAIN (type));
5661 else if (TREE_CODE (type) == FUNCTION_TYPE)
5663 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5664 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5666 else if (TREE_CODE (type) == METHOD_TYPE)
5668 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5669 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5671 TYPE_ARG_TYPES (type));
5676 TYPE_READONLY (outer) = TYPE_READONLY (type);
5677 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
5682 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5685 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5689 switch (GET_MODE_CLASS (mode))
5691 case MODE_VECTOR_INT:
5692 case MODE_VECTOR_FLOAT:
5693 nunits = GET_MODE_NUNITS (mode);
5697 /* Check that there are no leftover bits. */
5698 gcc_assert (GET_MODE_BITSIZE (mode)
5699 % TREE_INT_CST_LOW (TYPE_SIZE (innertype)) == 0);
5701 nunits = GET_MODE_BITSIZE (mode)
5702 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
5709 return make_vector_type (innertype, nunits, mode);
5712 /* Similarly, but takes the inner type and number of units, which must be
5716 build_vector_type (tree innertype, int nunits)
5718 return make_vector_type (innertype, nunits, VOIDmode);
5721 /* Given an initializer INIT, return TRUE if INIT is zero or some
5722 aggregate of zeros. Otherwise return FALSE. */
5724 initializer_zerop (tree init)
5730 switch (TREE_CODE (init))
5733 return integer_zerop (init);
5736 /* ??? Note that this is not correct for C4X float formats. There,
5737 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5738 negative exponent. */
5739 return real_zerop (init)
5740 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5743 return integer_zerop (init)
5744 || (real_zerop (init)
5745 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5746 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5749 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
5750 if (!initializer_zerop (TREE_VALUE (elt)))
5755 elt = CONSTRUCTOR_ELTS (init);
5756 if (elt == NULL_TREE)
5759 /* A set is empty only if it has no elements. */
5760 if (TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5763 for (; elt ; elt = TREE_CHAIN (elt))
5764 if (! initializer_zerop (TREE_VALUE (elt)))
5774 add_var_to_bind_expr (tree bind_expr, tree var)
5776 BIND_EXPR_VARS (bind_expr)
5777 = chainon (BIND_EXPR_VARS (bind_expr), var);
5778 if (BIND_EXPR_BLOCK (bind_expr))
5779 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
5780 = BIND_EXPR_VARS (bind_expr);
5783 /* Build an empty statement. */
5786 build_empty_stmt (void)
5788 return build1 (NOP_EXPR, void_type_node, size_zero_node);
5792 /* Returns true if it is possible to prove that the index of
5793 an array access REF (an ARRAY_REF expression) falls into the
5797 in_array_bounds_p (tree ref)
5799 tree idx = TREE_OPERAND (ref, 1);
5802 if (TREE_CODE (idx) != INTEGER_CST)
5805 min = array_ref_low_bound (ref);
5806 max = array_ref_up_bound (ref);
5809 || TREE_CODE (min) != INTEGER_CST
5810 || TREE_CODE (max) != INTEGER_CST)
5813 if (tree_int_cst_lt (idx, min)
5814 || tree_int_cst_lt (max, idx))
5820 /* Return true if T (assumed to be a DECL) is a global variable. */
5823 is_global_var (tree t)
5825 return (TREE_STATIC (t) || DECL_EXTERNAL (t));
5828 /* Return true if T (assumed to be a DECL) must be assigned a memory
5832 needs_to_live_in_memory (tree t)
5834 return (TREE_ADDRESSABLE (t)
5835 || is_global_var (t)
5836 || (TREE_CODE (t) == RESULT_DECL
5837 && aggregate_value_p (t, current_function_decl)));
5840 /* There are situations in which a language considers record types
5841 compatible which have different field lists. Decide if two fields
5842 are compatible. It is assumed that the parent records are compatible. */
5845 fields_compatible_p (tree f1, tree f2)
5847 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
5848 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
5851 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
5852 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
5855 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
5861 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5864 find_compatible_field (tree record, tree orig_field)
5868 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
5869 if (TREE_CODE (f) == FIELD_DECL
5870 && fields_compatible_p (f, orig_field))
5873 /* ??? Why isn't this on the main fields list? */
5874 f = TYPE_VFIELD (record);
5875 if (f && TREE_CODE (f) == FIELD_DECL
5876 && fields_compatible_p (f, orig_field))
5879 /* ??? We should abort here, but Java appears to do Bad Things
5880 with inherited fields. */
5884 /* Return value of a constant X. */
5887 int_cst_value (tree x)
5889 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
5890 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
5891 bool negative = ((val >> (bits - 1)) & 1) != 0;
5893 gcc_assert (bits <= HOST_BITS_PER_WIDE_INT);
5896 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
5898 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
5903 /* Returns the greatest common divisor of A and B, which must be
5907 tree_fold_gcd (tree a, tree b)
5910 tree type = TREE_TYPE (a);
5912 gcc_assert (TREE_CODE (a) == INTEGER_CST);
5913 gcc_assert (TREE_CODE (b) == INTEGER_CST);
5915 if (integer_zerop (a))
5918 if (integer_zerop (b))
5921 if (tree_int_cst_sgn (a) == -1)
5922 a = fold (build2 (MULT_EXPR, type, a,
5923 convert (type, integer_minus_one_node)));
5925 if (tree_int_cst_sgn (b) == -1)
5926 b = fold (build2 (MULT_EXPR, type, b,
5927 convert (type, integer_minus_one_node)));
5931 a_mod_b = fold (build2 (CEIL_MOD_EXPR, type, a, b));
5933 if (!TREE_INT_CST_LOW (a_mod_b)
5934 && !TREE_INT_CST_HIGH (a_mod_b))
5942 #include "gt-tree.h"