1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 /* obstack.[ch] explicitly declined to prototype this. */
53 extern int _obstack_allocated_p (struct obstack *h, void *obj);
55 #ifdef GATHER_STATISTICS
56 /* Statistics-gathering stuff. */
58 int tree_node_counts[(int) all_kinds];
59 int tree_node_sizes[(int) all_kinds];
61 /* Keep in sync with tree.h:enum tree_node_kind. */
62 static const char * const tree_node_kind_names[] = {
81 #endif /* GATHER_STATISTICS */
83 /* Unique id for next decl created. */
84 static GTY(()) int next_decl_uid;
85 /* Unique id for next type created. */
86 static GTY(()) int next_type_uid = 1;
88 /* Since we cannot rehash a type after it is in the table, we have to
89 keep the hash code. */
91 struct type_hash GTY(())
97 /* Initial size of the hash table (rounded to next prime). */
98 #define TYPE_HASH_INITIAL_SIZE 1000
100 /* Now here is the hash table. When recording a type, it is added to
101 the slot whose index is the hash code. Note that the hash table is
102 used for several kinds of types (function types, array types and
103 array index range types, for now). While all these live in the
104 same table, they are completely independent, and the hash code is
105 computed differently for each of these. */
107 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash)))
108 htab_t type_hash_table;
110 static void set_type_quals (tree, int);
111 static int type_hash_eq (const void *, const void *);
112 static hashval_t type_hash_hash (const void *);
113 static void print_type_hash_statistics (void);
114 static void finish_vector_type (tree);
115 static int type_hash_marked_p (const void *);
116 static unsigned int type_hash_list (tree, hashval_t);
117 static unsigned int attribute_hash_list (tree, hashval_t);
119 tree global_trees[TI_MAX];
120 tree integer_types[itk_none];
127 /* Initialize the hash table of types. */
128 type_hash_table = htab_create_ggc (TYPE_HASH_INITIAL_SIZE, type_hash_hash,
133 /* The name of the object as the assembler will see it (but before any
134 translations made by ASM_OUTPUT_LABELREF). Often this is the same
135 as DECL_NAME. It is an IDENTIFIER_NODE. */
137 decl_assembler_name (tree decl)
139 if (!DECL_ASSEMBLER_NAME_SET_P (decl))
140 lang_hooks.set_decl_assembler_name (decl);
141 return DECL_CHECK (decl)->decl.assembler_name;
144 /* Compute the number of bytes occupied by 'node'. This routine only
145 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
147 tree_size (tree node)
149 enum tree_code code = TREE_CODE (node);
151 switch (TREE_CODE_CLASS (code))
153 case 'd': /* A decl node */
154 return sizeof (struct tree_decl);
156 case 't': /* a type node */
157 return sizeof (struct tree_type);
159 case 'r': /* a reference */
160 case 'e': /* an expression */
161 case 's': /* an expression with side effects */
162 case '<': /* a comparison expression */
163 case '1': /* a unary arithmetic expression */
164 case '2': /* a binary arithmetic expression */
165 return (sizeof (struct tree_exp)
166 + TREE_CODE_LENGTH (code) * sizeof (char *) - sizeof (char *));
168 case 'c': /* a constant */
171 case INTEGER_CST: return sizeof (struct tree_int_cst);
172 case REAL_CST: return sizeof (struct tree_real_cst);
173 case COMPLEX_CST: return sizeof (struct tree_complex);
174 case VECTOR_CST: return sizeof (struct tree_vector);
175 case STRING_CST: return sizeof (struct tree_string);
177 return lang_hooks.tree_size (code);
180 case 'x': /* something random, like an identifier. */
183 case IDENTIFIER_NODE: return lang_hooks.identifier_size;
184 case TREE_LIST: return sizeof (struct tree_list);
185 case TREE_VEC: return (sizeof (struct tree_vec)
186 + TREE_VEC_LENGTH(node) * sizeof(char *)
190 case PLACEHOLDER_EXPR: return sizeof (struct tree_common);
192 case PHI_NODE: return (sizeof (struct tree_phi_node)
193 + (PHI_ARG_CAPACITY (node) - 1) *
194 sizeof (struct phi_arg_d));
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 /* Return a newly allocated node of code CODE.
212 For decl and type nodes, some other fields are initialized.
213 The rest of the node is initialized to zero.
215 Achoo! I got a code in the node. */
218 make_node_stat (enum tree_code code MEM_STAT_DECL)
221 int type = TREE_CODE_CLASS (code);
223 #ifdef GATHER_STATISTICS
226 struct tree_common ttmp;
228 /* We can't allocate a TREE_VEC, PHI_NODE, or STRING_CST
229 without knowing how many elements it will have. */
230 if (code == TREE_VEC || code == PHI_NODE)
233 TREE_SET_CODE ((tree)&ttmp, code);
234 length = tree_size ((tree)&ttmp);
236 #ifdef GATHER_STATISTICS
239 case 'd': /* A decl node */
243 case 't': /* a type node */
247 case 's': /* an expression with side effects */
251 case 'r': /* a reference */
255 case 'e': /* an expression */
256 case '<': /* a comparison expression */
257 case '1': /* a unary arithmetic expression */
258 case '2': /* a binary arithmetic expression */
262 case 'c': /* a constant */
266 case 'x': /* something random, like an identifier. */
267 if (code == IDENTIFIER_NODE)
269 else if (code == TREE_VEC)
271 else if (code == TREE_BINFO)
273 else if (code == PHI_NODE)
275 else if (code == SSA_NAME)
276 kind = ssa_name_kind;
277 else if (code == BLOCK)
287 tree_node_counts[(int) kind]++;
288 tree_node_sizes[(int) kind] += length;
291 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
293 memset (t, 0, length);
295 TREE_SET_CODE (t, code);
300 TREE_SIDE_EFFECTS (t) = 1;
304 if (code != FUNCTION_DECL)
306 DECL_USER_ALIGN (t) = 0;
307 DECL_IN_SYSTEM_HEADER (t) = in_system_header;
308 DECL_SOURCE_LOCATION (t) = input_location;
309 DECL_UID (t) = next_decl_uid++;
311 /* We have not yet computed the alias set for this declaration. */
312 DECL_POINTER_ALIAS_SET (t) = -1;
316 TYPE_UID (t) = next_type_uid++;
317 TYPE_ALIGN (t) = char_type_node ? TYPE_ALIGN (char_type_node) : 0;
318 TYPE_USER_ALIGN (t) = 0;
319 TYPE_MAIN_VARIANT (t) = t;
321 /* Default to no attributes for type, but let target change that. */
322 TYPE_ATTRIBUTES (t) = NULL_TREE;
323 targetm.set_default_type_attributes (t);
325 /* We have not yet computed the alias set for this type. */
326 TYPE_ALIAS_SET (t) = -1;
330 TREE_CONSTANT (t) = 1;
331 TREE_INVARIANT (t) = 1;
340 case PREDECREMENT_EXPR:
341 case PREINCREMENT_EXPR:
342 case POSTDECREMENT_EXPR:
343 case POSTINCREMENT_EXPR:
344 /* All of these have side-effects, no matter what their
346 TREE_SIDE_EFFECTS (t) = 1;
358 /* Return a new node with the same contents as NODE except that its
359 TREE_CHAIN is zero and it has a fresh uid. */
362 copy_node_stat (tree node MEM_STAT_DECL)
365 enum tree_code code = TREE_CODE (node);
368 #ifdef ENABLE_CHECKING
369 if (code == STATEMENT_LIST)
373 length = tree_size (node);
374 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
375 memcpy (t, node, length);
378 TREE_ASM_WRITTEN (t) = 0;
379 TREE_VISITED (t) = 0;
382 if (TREE_CODE_CLASS (code) == 'd')
383 DECL_UID (t) = next_decl_uid++;
384 else if (TREE_CODE_CLASS (code) == 't')
386 TYPE_UID (t) = next_type_uid++;
387 /* The following is so that the debug code for
388 the copy is different from the original type.
389 The two statements usually duplicate each other
390 (because they clear fields of the same union),
391 but the optimizer should catch that. */
392 TYPE_SYMTAB_POINTER (t) = 0;
393 TYPE_SYMTAB_ADDRESS (t) = 0;
399 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
400 For example, this can copy a list made of TREE_LIST nodes. */
403 copy_list (tree list)
411 head = prev = copy_node (list);
412 next = TREE_CHAIN (list);
415 TREE_CHAIN (prev) = copy_node (next);
416 prev = TREE_CHAIN (prev);
417 next = TREE_CHAIN (next);
423 /* Return a newly constructed INTEGER_CST node whose constant value
424 is specified by the two ints LOW and HI.
425 The TREE_TYPE is set to `int'.
427 This function should be used via the `build_int_2' macro. */
430 build_int_2_wide (unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
432 tree t = make_node (INTEGER_CST);
434 TREE_INT_CST_LOW (t) = low;
435 TREE_INT_CST_HIGH (t) = hi;
436 TREE_TYPE (t) = integer_type_node;
440 /* Return a new VECTOR_CST node whose type is TYPE and whose values
441 are in a list pointed by VALS. */
444 build_vector (tree type, tree vals)
446 tree v = make_node (VECTOR_CST);
447 int over1 = 0, over2 = 0;
450 TREE_VECTOR_CST_ELTS (v) = vals;
451 TREE_TYPE (v) = type;
453 /* Iterate through elements and check for overflow. */
454 for (link = vals; link; link = TREE_CHAIN (link))
456 tree value = TREE_VALUE (link);
458 over1 |= TREE_OVERFLOW (value);
459 over2 |= TREE_CONSTANT_OVERFLOW (value);
462 TREE_OVERFLOW (v) = over1;
463 TREE_CONSTANT_OVERFLOW (v) = over2;
468 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
469 are in a list pointed to by VALS. */
471 build_constructor (tree type, tree vals)
473 tree c = make_node (CONSTRUCTOR);
474 TREE_TYPE (c) = type;
475 CONSTRUCTOR_ELTS (c) = vals;
477 /* ??? May not be necessary. Mirrors what build does. */
480 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
481 TREE_READONLY (c) = TREE_READONLY (vals);
482 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
483 TREE_INVARIANT (c) = TREE_INVARIANT (vals);
489 /* Return a new REAL_CST node whose type is TYPE and value is D. */
492 build_real (tree type, REAL_VALUE_TYPE d)
498 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
499 Consider doing it via real_convert now. */
501 v = make_node (REAL_CST);
502 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
503 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
505 TREE_TYPE (v) = type;
506 TREE_REAL_CST_PTR (v) = dp;
507 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
511 /* Return a new REAL_CST node whose type is TYPE
512 and whose value is the integer value of the INTEGER_CST node I. */
515 real_value_from_int_cst (tree type, tree i)
519 /* Clear all bits of the real value type so that we can later do
520 bitwise comparisons to see if two values are the same. */
521 memset (&d, 0, sizeof d);
523 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
524 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
525 TYPE_UNSIGNED (TREE_TYPE (i)));
529 /* Given a tree representing an integer constant I, return a tree
530 representing the same value as a floating-point constant of type TYPE. */
533 build_real_from_int_cst (tree type, tree i)
536 int overflow = TREE_OVERFLOW (i);
538 v = build_real (type, real_value_from_int_cst (type, i));
540 TREE_OVERFLOW (v) |= overflow;
541 TREE_CONSTANT_OVERFLOW (v) |= overflow;
545 /* Return a newly constructed STRING_CST node whose value is
546 the LEN characters at STR.
547 The TREE_TYPE is not initialized. */
550 build_string (int len, const char *str)
552 tree s = make_node (STRING_CST);
554 TREE_STRING_LENGTH (s) = len;
555 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
560 /* Return a newly constructed COMPLEX_CST node whose value is
561 specified by the real and imaginary parts REAL and IMAG.
562 Both REAL and IMAG should be constant nodes. TYPE, if specified,
563 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
566 build_complex (tree type, tree real, tree imag)
568 tree t = make_node (COMPLEX_CST);
570 TREE_REALPART (t) = real;
571 TREE_IMAGPART (t) = imag;
572 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
573 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
574 TREE_CONSTANT_OVERFLOW (t)
575 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
579 /* Build a BINFO with LEN language slots. */
582 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
585 size_t length = (offsetof (struct tree_binfo, base_binfos)
586 + VEC_embedded_size (tree, base_binfos));
588 #ifdef GATHER_STATISTICS
589 tree_node_counts[(int) binfo_kind]++;
590 tree_node_sizes[(int) binfo_kind] += length;
593 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
595 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
597 TREE_SET_CODE (t, TREE_BINFO);
599 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
605 /* Build a newly constructed TREE_VEC node of length LEN. */
608 make_tree_vec_stat (int len MEM_STAT_DECL)
611 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
613 #ifdef GATHER_STATISTICS
614 tree_node_counts[(int) vec_kind]++;
615 tree_node_sizes[(int) vec_kind] += length;
618 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
620 memset (t, 0, length);
622 TREE_SET_CODE (t, TREE_VEC);
623 TREE_VEC_LENGTH (t) = len;
628 /* Return 1 if EXPR is the integer constant zero or a complex constant
632 integer_zerop (tree expr)
636 return ((TREE_CODE (expr) == INTEGER_CST
637 && ! TREE_CONSTANT_OVERFLOW (expr)
638 && TREE_INT_CST_LOW (expr) == 0
639 && TREE_INT_CST_HIGH (expr) == 0)
640 || (TREE_CODE (expr) == COMPLEX_CST
641 && integer_zerop (TREE_REALPART (expr))
642 && integer_zerop (TREE_IMAGPART (expr))));
645 /* Return 1 if EXPR is the integer constant one or the corresponding
649 integer_onep (tree expr)
653 return ((TREE_CODE (expr) == INTEGER_CST
654 && ! TREE_CONSTANT_OVERFLOW (expr)
655 && TREE_INT_CST_LOW (expr) == 1
656 && TREE_INT_CST_HIGH (expr) == 0)
657 || (TREE_CODE (expr) == COMPLEX_CST
658 && integer_onep (TREE_REALPART (expr))
659 && integer_zerop (TREE_IMAGPART (expr))));
662 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
663 it contains. Likewise for the corresponding complex constant. */
666 integer_all_onesp (tree expr)
673 if (TREE_CODE (expr) == COMPLEX_CST
674 && integer_all_onesp (TREE_REALPART (expr))
675 && integer_zerop (TREE_IMAGPART (expr)))
678 else if (TREE_CODE (expr) != INTEGER_CST
679 || TREE_CONSTANT_OVERFLOW (expr))
682 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
684 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
685 && TREE_INT_CST_HIGH (expr) == -1);
687 /* Note that using TYPE_PRECISION here is wrong. We care about the
688 actual bits, not the (arbitrary) range of the type. */
689 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
690 if (prec >= HOST_BITS_PER_WIDE_INT)
692 HOST_WIDE_INT high_value;
695 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
697 if (shift_amount > HOST_BITS_PER_WIDE_INT)
698 /* Can not handle precisions greater than twice the host int size. */
700 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
701 /* Shifting by the host word size is undefined according to the ANSI
702 standard, so we must handle this as a special case. */
705 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
707 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
708 && TREE_INT_CST_HIGH (expr) == high_value);
711 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
714 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
718 integer_pow2p (tree expr)
721 HOST_WIDE_INT high, low;
725 if (TREE_CODE (expr) == COMPLEX_CST
726 && integer_pow2p (TREE_REALPART (expr))
727 && integer_zerop (TREE_IMAGPART (expr)))
730 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
733 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
734 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
735 high = TREE_INT_CST_HIGH (expr);
736 low = TREE_INT_CST_LOW (expr);
738 /* First clear all bits that are beyond the type's precision in case
739 we've been sign extended. */
741 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
743 else if (prec > HOST_BITS_PER_WIDE_INT)
744 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
748 if (prec < HOST_BITS_PER_WIDE_INT)
749 low &= ~((HOST_WIDE_INT) (-1) << prec);
752 if (high == 0 && low == 0)
755 return ((high == 0 && (low & (low - 1)) == 0)
756 || (low == 0 && (high & (high - 1)) == 0));
759 /* Return 1 if EXPR is an integer constant other than zero or a
760 complex constant other than zero. */
763 integer_nonzerop (tree expr)
767 return ((TREE_CODE (expr) == INTEGER_CST
768 && ! TREE_CONSTANT_OVERFLOW (expr)
769 && (TREE_INT_CST_LOW (expr) != 0
770 || TREE_INT_CST_HIGH (expr) != 0))
771 || (TREE_CODE (expr) == COMPLEX_CST
772 && (integer_nonzerop (TREE_REALPART (expr))
773 || integer_nonzerop (TREE_IMAGPART (expr)))));
776 /* Return the power of two represented by a tree node known to be a
780 tree_log2 (tree expr)
783 HOST_WIDE_INT high, low;
787 if (TREE_CODE (expr) == COMPLEX_CST)
788 return tree_log2 (TREE_REALPART (expr));
790 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
791 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
793 high = TREE_INT_CST_HIGH (expr);
794 low = TREE_INT_CST_LOW (expr);
796 /* First clear all bits that are beyond the type's precision in case
797 we've been sign extended. */
799 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
801 else if (prec > HOST_BITS_PER_WIDE_INT)
802 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
806 if (prec < HOST_BITS_PER_WIDE_INT)
807 low &= ~((HOST_WIDE_INT) (-1) << prec);
810 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
814 /* Similar, but return the largest integer Y such that 2 ** Y is less
815 than or equal to EXPR. */
818 tree_floor_log2 (tree expr)
821 HOST_WIDE_INT high, low;
825 if (TREE_CODE (expr) == COMPLEX_CST)
826 return tree_log2 (TREE_REALPART (expr));
828 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
829 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
831 high = TREE_INT_CST_HIGH (expr);
832 low = TREE_INT_CST_LOW (expr);
834 /* First clear all bits that are beyond the type's precision in case
835 we've been sign extended. Ignore if type's precision hasn't been set
836 since what we are doing is setting it. */
838 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
840 else if (prec > HOST_BITS_PER_WIDE_INT)
841 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
845 if (prec < HOST_BITS_PER_WIDE_INT)
846 low &= ~((HOST_WIDE_INT) (-1) << prec);
849 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
853 /* Return 1 if EXPR is the real constant zero. */
856 real_zerop (tree expr)
860 return ((TREE_CODE (expr) == REAL_CST
861 && ! TREE_CONSTANT_OVERFLOW (expr)
862 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
863 || (TREE_CODE (expr) == COMPLEX_CST
864 && real_zerop (TREE_REALPART (expr))
865 && real_zerop (TREE_IMAGPART (expr))));
868 /* Return 1 if EXPR is the real constant one in real or complex form. */
871 real_onep (tree expr)
875 return ((TREE_CODE (expr) == REAL_CST
876 && ! TREE_CONSTANT_OVERFLOW (expr)
877 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
878 || (TREE_CODE (expr) == COMPLEX_CST
879 && real_onep (TREE_REALPART (expr))
880 && real_zerop (TREE_IMAGPART (expr))));
883 /* Return 1 if EXPR is the real constant two. */
886 real_twop (tree expr)
890 return ((TREE_CODE (expr) == REAL_CST
891 && ! TREE_CONSTANT_OVERFLOW (expr)
892 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
893 || (TREE_CODE (expr) == COMPLEX_CST
894 && real_twop (TREE_REALPART (expr))
895 && real_zerop (TREE_IMAGPART (expr))));
898 /* Return 1 if EXPR is the real constant minus one. */
901 real_minus_onep (tree expr)
905 return ((TREE_CODE (expr) == REAL_CST
906 && ! TREE_CONSTANT_OVERFLOW (expr)
907 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
908 || (TREE_CODE (expr) == COMPLEX_CST
909 && real_minus_onep (TREE_REALPART (expr))
910 && real_zerop (TREE_IMAGPART (expr))));
913 /* Nonzero if EXP is a constant or a cast of a constant. */
916 really_constant_p (tree exp)
918 /* This is not quite the same as STRIP_NOPS. It does more. */
919 while (TREE_CODE (exp) == NOP_EXPR
920 || TREE_CODE (exp) == CONVERT_EXPR
921 || TREE_CODE (exp) == NON_LVALUE_EXPR)
922 exp = TREE_OPERAND (exp, 0);
923 return TREE_CONSTANT (exp);
926 /* Return first list element whose TREE_VALUE is ELEM.
927 Return 0 if ELEM is not in LIST. */
930 value_member (tree elem, tree list)
934 if (elem == TREE_VALUE (list))
936 list = TREE_CHAIN (list);
941 /* Return first list element whose TREE_PURPOSE is ELEM.
942 Return 0 if ELEM is not in LIST. */
945 purpose_member (tree elem, tree list)
949 if (elem == TREE_PURPOSE (list))
951 list = TREE_CHAIN (list);
956 /* Return nonzero if ELEM is part of the chain CHAIN. */
959 chain_member (tree elem, tree chain)
965 chain = TREE_CHAIN (chain);
971 /* Return the length of a chain of nodes chained through TREE_CHAIN.
972 We expect a null pointer to mark the end of the chain.
973 This is the Lisp primitive `length'. */
979 #ifdef ENABLE_TREE_CHECKING
987 #ifdef ENABLE_TREE_CHECKING
999 /* Returns the number of FIELD_DECLs in TYPE. */
1002 fields_length (tree type)
1004 tree t = TYPE_FIELDS (type);
1007 for (; t; t = TREE_CHAIN (t))
1008 if (TREE_CODE (t) == FIELD_DECL)
1014 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1015 by modifying the last node in chain 1 to point to chain 2.
1016 This is the Lisp primitive `nconc'. */
1019 chainon (tree op1, tree op2)
1028 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1030 TREE_CHAIN (t1) = op2;
1032 #ifdef ENABLE_TREE_CHECKING
1035 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1037 abort (); /* Circularity created. */
1044 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1047 tree_last (tree chain)
1051 while ((next = TREE_CHAIN (chain)))
1056 /* Reverse the order of elements in the chain T,
1057 and return the new head of the chain (old last element). */
1062 tree prev = 0, decl, next;
1063 for (decl = t; decl; decl = next)
1065 next = TREE_CHAIN (decl);
1066 TREE_CHAIN (decl) = prev;
1072 /* Return a newly created TREE_LIST node whose
1073 purpose and value fields are PARM and VALUE. */
1076 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1078 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1079 TREE_PURPOSE (t) = parm;
1080 TREE_VALUE (t) = value;
1084 /* Return a newly created TREE_LIST node whose
1085 purpose and value fields are PURPOSE and VALUE
1086 and whose TREE_CHAIN is CHAIN. */
1089 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1093 node = ggc_alloc_zone_stat (sizeof (struct tree_list),
1094 tree_zone PASS_MEM_STAT);
1096 memset (node, 0, sizeof (struct tree_common));
1098 #ifdef GATHER_STATISTICS
1099 tree_node_counts[(int) x_kind]++;
1100 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1103 TREE_SET_CODE (node, TREE_LIST);
1104 TREE_CHAIN (node) = chain;
1105 TREE_PURPOSE (node) = purpose;
1106 TREE_VALUE (node) = value;
1111 /* Return the size nominally occupied by an object of type TYPE
1112 when it resides in memory. The value is measured in units of bytes,
1113 and its data type is that normally used for type sizes
1114 (which is the first type created by make_signed_type or
1115 make_unsigned_type). */
1118 size_in_bytes (tree type)
1122 if (type == error_mark_node)
1123 return integer_zero_node;
1125 type = TYPE_MAIN_VARIANT (type);
1126 t = TYPE_SIZE_UNIT (type);
1130 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1131 return size_zero_node;
1134 if (TREE_CODE (t) == INTEGER_CST)
1135 force_fit_type (t, 0);
1140 /* Return the size of TYPE (in bytes) as a wide integer
1141 or return -1 if the size can vary or is larger than an integer. */
1144 int_size_in_bytes (tree type)
1148 if (type == error_mark_node)
1151 type = TYPE_MAIN_VARIANT (type);
1152 t = TYPE_SIZE_UNIT (type);
1154 || TREE_CODE (t) != INTEGER_CST
1155 || TREE_OVERFLOW (t)
1156 || TREE_INT_CST_HIGH (t) != 0
1157 /* If the result would appear negative, it's too big to represent. */
1158 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1161 return TREE_INT_CST_LOW (t);
1164 /* Return the bit position of FIELD, in bits from the start of the record.
1165 This is a tree of type bitsizetype. */
1168 bit_position (tree field)
1170 return bit_from_pos (DECL_FIELD_OFFSET (field),
1171 DECL_FIELD_BIT_OFFSET (field));
1174 /* Likewise, but return as an integer. Abort if it cannot be represented
1175 in that way (since it could be a signed value, we don't have the option
1176 of returning -1 like int_size_in_byte can. */
1179 int_bit_position (tree field)
1181 return tree_low_cst (bit_position (field), 0);
1184 /* Return the byte position of FIELD, in bytes from the start of the record.
1185 This is a tree of type sizetype. */
1188 byte_position (tree field)
1190 return byte_from_pos (DECL_FIELD_OFFSET (field),
1191 DECL_FIELD_BIT_OFFSET (field));
1194 /* Likewise, but return as an integer. Abort if it cannot be represented
1195 in that way (since it could be a signed value, we don't have the option
1196 of returning -1 like int_size_in_byte can. */
1199 int_byte_position (tree field)
1201 return tree_low_cst (byte_position (field), 0);
1204 /* Return the strictest alignment, in bits, that T is known to have. */
1209 unsigned int align0, align1;
1211 switch (TREE_CODE (t))
1213 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1214 /* If we have conversions, we know that the alignment of the
1215 object must meet each of the alignments of the types. */
1216 align0 = expr_align (TREE_OPERAND (t, 0));
1217 align1 = TYPE_ALIGN (TREE_TYPE (t));
1218 return MAX (align0, align1);
1220 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1221 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1222 case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1223 /* These don't change the alignment of an object. */
1224 return expr_align (TREE_OPERAND (t, 0));
1227 /* The best we can do is say that the alignment is the least aligned
1229 align0 = expr_align (TREE_OPERAND (t, 1));
1230 align1 = expr_align (TREE_OPERAND (t, 2));
1231 return MIN (align0, align1);
1233 case LABEL_DECL: case CONST_DECL:
1234 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1235 if (DECL_ALIGN (t) != 0)
1236 return DECL_ALIGN (t);
1240 return FUNCTION_BOUNDARY;
1246 /* Otherwise take the alignment from that of the type. */
1247 return TYPE_ALIGN (TREE_TYPE (t));
1250 /* Return, as a tree node, the number of elements for TYPE (which is an
1251 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1254 array_type_nelts (tree type)
1256 tree index_type, min, max;
1258 /* If they did it with unspecified bounds, then we should have already
1259 given an error about it before we got here. */
1260 if (! TYPE_DOMAIN (type))
1261 return error_mark_node;
1263 index_type = TYPE_DOMAIN (type);
1264 min = TYPE_MIN_VALUE (index_type);
1265 max = TYPE_MAX_VALUE (index_type);
1267 return (integer_zerop (min)
1269 : fold (build2 (MINUS_EXPR, TREE_TYPE (max), max, min)));
1272 /* Return nonzero if arg is static -- a reference to an object in
1273 static storage. This is not the same as the C meaning of `static'. */
1278 switch (TREE_CODE (arg))
1281 /* Nested functions aren't static, since taking their address
1282 involves a trampoline. */
1283 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1284 && ! DECL_NON_ADDR_CONST_P (arg));
1287 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1288 && ! DECL_THREAD_LOCAL (arg)
1289 && ! DECL_NON_ADDR_CONST_P (arg));
1292 return TREE_STATIC (arg);
1299 /* If the thing being referenced is not a field, then it is
1300 something language specific. */
1301 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1302 return (*lang_hooks.staticp) (arg);
1304 /* If we are referencing a bitfield, we can't evaluate an
1305 ADDR_EXPR at compile time and so it isn't a constant. */
1306 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1309 return staticp (TREE_OPERAND (arg, 0));
1315 /* This case is technically correct, but results in setting
1316 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1319 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1323 case ARRAY_RANGE_REF:
1324 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1325 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1326 return staticp (TREE_OPERAND (arg, 0));
1331 if ((unsigned int) TREE_CODE (arg)
1332 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1333 return lang_hooks.staticp (arg);
1339 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1340 Do this to any expression which may be used in more than one place,
1341 but must be evaluated only once.
1343 Normally, expand_expr would reevaluate the expression each time.
1344 Calling save_expr produces something that is evaluated and recorded
1345 the first time expand_expr is called on it. Subsequent calls to
1346 expand_expr just reuse the recorded value.
1348 The call to expand_expr that generates code that actually computes
1349 the value is the first call *at compile time*. Subsequent calls
1350 *at compile time* generate code to use the saved value.
1351 This produces correct result provided that *at run time* control
1352 always flows through the insns made by the first expand_expr
1353 before reaching the other places where the save_expr was evaluated.
1354 You, the caller of save_expr, must make sure this is so.
1356 Constants, and certain read-only nodes, are returned with no
1357 SAVE_EXPR because that is safe. Expressions containing placeholders
1358 are not touched; see tree.def for an explanation of what these
1362 save_expr (tree expr)
1364 tree t = fold (expr);
1367 /* If the tree evaluates to a constant, then we don't want to hide that
1368 fact (i.e. this allows further folding, and direct checks for constants).
1369 However, a read-only object that has side effects cannot be bypassed.
1370 Since it is no problem to reevaluate literals, we just return the
1372 inner = skip_simple_arithmetic (t);
1374 if (TREE_INVARIANT (inner)
1375 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1376 || TREE_CODE (inner) == SAVE_EXPR
1377 || TREE_CODE (inner) == ERROR_MARK)
1380 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1381 it means that the size or offset of some field of an object depends on
1382 the value within another field.
1384 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1385 and some variable since it would then need to be both evaluated once and
1386 evaluated more than once. Front-ends must assure this case cannot
1387 happen by surrounding any such subexpressions in their own SAVE_EXPR
1388 and forcing evaluation at the proper time. */
1389 if (contains_placeholder_p (inner))
1392 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
1394 /* This expression might be placed ahead of a jump to ensure that the
1395 value was computed on both sides of the jump. So make sure it isn't
1396 eliminated as dead. */
1397 TREE_SIDE_EFFECTS (t) = 1;
1398 TREE_READONLY (t) = 1;
1399 TREE_INVARIANT (t) = 1;
1403 /* Look inside EXPR and into any simple arithmetic operations. Return
1404 the innermost non-arithmetic node. */
1407 skip_simple_arithmetic (tree expr)
1411 /* We don't care about whether this can be used as an lvalue in this
1413 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1414 expr = TREE_OPERAND (expr, 0);
1416 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1417 a constant, it will be more efficient to not make another SAVE_EXPR since
1418 it will allow better simplification and GCSE will be able to merge the
1419 computations if they actually occur. */
1423 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1424 inner = TREE_OPERAND (inner, 0);
1425 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1427 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1428 inner = TREE_OPERAND (inner, 0);
1429 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1430 inner = TREE_OPERAND (inner, 1);
1441 /* Arrange for an expression to be expanded multiple independent
1442 times. This is useful for cleanup actions, as the backend can
1443 expand them multiple times in different places. */
1446 unsave_expr (tree expr)
1450 /* If this is already protected, no sense in protecting it again. */
1451 if (TREE_CODE (expr) == UNSAVE_EXPR)
1454 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1455 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1459 /* Returns the index of the first non-tree operand for CODE, or the number
1460 of operands if all are trees. */
1463 first_rtl_op (enum tree_code code)
1468 return TREE_CODE_LENGTH (code);
1472 /* Return which tree structure is used by T. */
1474 enum tree_node_structure_enum
1475 tree_node_structure (tree t)
1477 enum tree_code code = TREE_CODE (t);
1479 switch (TREE_CODE_CLASS (code))
1481 case 'd': return TS_DECL;
1482 case 't': return TS_TYPE;
1483 case 'r': case '<': case '1': case '2': case 'e': case 's':
1485 default: /* 'c' and 'x' */
1491 case INTEGER_CST: return TS_INT_CST;
1492 case REAL_CST: return TS_REAL_CST;
1493 case COMPLEX_CST: return TS_COMPLEX;
1494 case VECTOR_CST: return TS_VECTOR;
1495 case STRING_CST: return TS_STRING;
1497 case ERROR_MARK: return TS_COMMON;
1498 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1499 case TREE_LIST: return TS_LIST;
1500 case TREE_VEC: return TS_VEC;
1501 case PHI_NODE: return TS_PHI_NODE;
1502 case SSA_NAME: return TS_SSA_NAME;
1503 case PLACEHOLDER_EXPR: return TS_COMMON;
1504 case STATEMENT_LIST: return TS_STATEMENT_LIST;
1505 case BLOCK: return TS_BLOCK;
1506 case TREE_BINFO: return TS_BINFO;
1507 case VALUE_HANDLE: return TS_VALUE_HANDLE;
1514 /* Perform any modifications to EXPR required when it is unsaved. Does
1515 not recurse into EXPR's subtrees. */
1518 unsave_expr_1 (tree expr)
1520 switch (TREE_CODE (expr))
1523 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1524 It's OK for this to happen if it was part of a subtree that
1525 isn't immediately expanded, such as operand 2 of another
1527 if (TREE_OPERAND (expr, 1))
1530 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1531 TREE_OPERAND (expr, 3) = NULL_TREE;
1539 /* Return 0 if it is safe to evaluate EXPR multiple times,
1540 return 1 if it is safe if EXPR is unsaved afterward, or
1541 return 2 if it is completely unsafe.
1543 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1544 an expression tree, so that it safe to unsave them and the surrounding
1545 context will be correct.
1547 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1548 occasionally across the whole of a function. It is therefore only
1549 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1550 below the UNSAVE_EXPR. */
1553 unsafe_for_reeval (tree expr)
1556 enum tree_code code;
1561 if (expr == NULL_TREE)
1564 code = TREE_CODE (expr);
1565 first_rtl = first_rtl_op (code);
1572 /* A label can only be emitted once. */
1581 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1583 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1584 unsafeness = MAX (tmp, unsafeness);
1590 tmp2 = unsafe_for_reeval (TREE_OPERAND (expr, 0));
1591 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1592 return MAX (MAX (tmp, 1), tmp2);
1598 case EXIT_BLOCK_EXPR:
1599 /* EXIT_BLOCK_LABELED_BLOCK, a.k.a. TREE_OPERAND (expr, 0), holds
1600 a reference to an ancestor LABELED_BLOCK, so we need to avoid
1601 unbounded recursion in the 'e' traversal code below. */
1602 exp = EXIT_BLOCK_RETURN (expr);
1603 return exp ? unsafe_for_reeval (exp) : 0;
1606 tmp = lang_hooks.unsafe_for_reeval (expr);
1612 switch (TREE_CODE_CLASS (code))
1614 case 'c': /* a constant */
1615 case 't': /* a type node */
1616 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1617 case 'd': /* A decl node */
1620 case 'e': /* an expression */
1621 case 'r': /* a reference */
1622 case 's': /* an expression with side effects */
1623 case '<': /* a comparison expression */
1624 case '2': /* a binary arithmetic expression */
1625 case '1': /* a unary arithmetic expression */
1626 for (i = first_rtl - 1; i >= 0; i--)
1628 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1629 unsafeness = MAX (tmp, unsafeness);
1639 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1640 or offset that depends on a field within a record. */
1643 contains_placeholder_p (tree exp)
1645 enum tree_code code;
1650 code = TREE_CODE (exp);
1651 if (code == PLACEHOLDER_EXPR)
1654 switch (TREE_CODE_CLASS (code))
1657 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1658 position computations since they will be converted into a
1659 WITH_RECORD_EXPR involving the reference, which will assume
1660 here will be valid. */
1661 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1664 if (code == TREE_LIST)
1665 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1666 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1675 /* Ignoring the first operand isn't quite right, but works best. */
1676 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1679 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1680 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1681 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1687 switch (first_rtl_op (code))
1690 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1692 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1693 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1704 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1705 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1709 type_contains_placeholder_p (tree type)
1711 /* If the size contains a placeholder or the parent type (component type in
1712 the case of arrays) type involves a placeholder, this type does. */
1713 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1714 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1715 || (TREE_TYPE (type) != 0
1716 && type_contains_placeholder_p (TREE_TYPE (type))))
1719 /* Now do type-specific checks. Note that the last part of the check above
1720 greatly limits what we have to do below. */
1721 switch (TREE_CODE (type))
1730 case REFERENCE_TYPE:
1738 /* Here we just check the bounds. */
1739 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1740 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1745 /* We're already checked the component type (TREE_TYPE), so just check
1747 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1751 case QUAL_UNION_TYPE:
1753 static tree seen_types = 0;
1757 /* We have to be careful here that we don't end up in infinite
1758 recursions due to a field of a type being a pointer to that type
1759 or to a mutually-recursive type. So we store a list of record
1760 types that we've seen and see if this type is in them. To save
1761 memory, we don't use a list for just one type. Here we check
1762 whether we've seen this type before and store it if not. */
1763 if (seen_types == 0)
1765 else if (TREE_CODE (seen_types) != TREE_LIST)
1767 if (seen_types == type)
1770 seen_types = tree_cons (NULL_TREE, type,
1771 build_tree_list (NULL_TREE, seen_types));
1775 if (value_member (type, seen_types) != 0)
1778 seen_types = tree_cons (NULL_TREE, type, seen_types);
1781 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1782 if (TREE_CODE (field) == FIELD_DECL
1783 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1784 || (TREE_CODE (type) == QUAL_UNION_TYPE
1785 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1786 || type_contains_placeholder_p (TREE_TYPE (field))))
1792 /* Now remove us from seen_types and return the result. */
1793 if (seen_types == type)
1796 seen_types = TREE_CHAIN (seen_types);
1806 /* Return 1 if EXP contains any expressions that produce cleanups for an
1807 outer scope to deal with. Used by fold. */
1810 has_cleanups (tree exp)
1814 if (! TREE_SIDE_EFFECTS (exp))
1817 switch (TREE_CODE (exp))
1820 case WITH_CLEANUP_EXPR:
1823 case CLEANUP_POINT_EXPR:
1827 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1829 cmp = has_cleanups (TREE_VALUE (exp));
1836 return (DECL_INITIAL (DECL_EXPR_DECL (exp))
1837 && has_cleanups (DECL_INITIAL (DECL_EXPR_DECL (exp))));
1843 /* This general rule works for most tree codes. All exceptions should be
1844 handled above. If this is a language-specific tree code, we can't
1845 trust what might be in the operand, so say we don't know
1847 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1850 nops = first_rtl_op (TREE_CODE (exp));
1851 for (i = 0; i < nops; i++)
1852 if (TREE_OPERAND (exp, i) != 0)
1854 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1855 if (type == 'e' || type == '<' || type == '1' || type == '2'
1856 || type == 'r' || type == 's')
1858 cmp = has_cleanups (TREE_OPERAND (exp, i));
1867 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1868 return a tree with all occurrences of references to F in a
1869 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1870 contains only arithmetic expressions or a CALL_EXPR with a
1871 PLACEHOLDER_EXPR occurring only in its arglist. */
1874 substitute_in_expr (tree exp, tree f, tree r)
1876 enum tree_code code = TREE_CODE (exp);
1881 /* We handle TREE_LIST and COMPONENT_REF separately. */
1882 if (code == TREE_LIST)
1884 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1885 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1886 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1889 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1891 else if (code == COMPONENT_REF)
1893 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1894 and it is the right field, replace it with R. */
1895 for (inner = TREE_OPERAND (exp, 0);
1896 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1897 inner = TREE_OPERAND (inner, 0))
1899 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1900 && TREE_OPERAND (exp, 1) == f)
1903 /* If this expression hasn't been completed let, leave it
1905 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1908 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1909 if (op0 == TREE_OPERAND (exp, 0))
1912 new = fold (build (code, TREE_TYPE (exp), op0, TREE_OPERAND (exp, 1),
1916 switch (TREE_CODE_CLASS (code))
1928 switch (first_rtl_op (code))
1934 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1935 if (op0 == TREE_OPERAND (exp, 0))
1938 new = fold (build1 (code, TREE_TYPE (exp), op0));
1942 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1943 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1945 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1948 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
1952 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1953 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1954 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
1956 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1957 && op2 == TREE_OPERAND (exp, 2))
1960 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
1972 TREE_READONLY (new) = TREE_READONLY (exp);
1976 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1977 for it within OBJ, a tree that is an object or a chain of references. */
1980 substitute_placeholder_in_expr (tree exp, tree obj)
1982 enum tree_code code = TREE_CODE (exp);
1983 tree op0, op1, op2, op3;
1985 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
1986 in the chain of OBJ. */
1987 if (code == PLACEHOLDER_EXPR)
1989 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
1992 for (elt = obj; elt != 0;
1993 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
1994 || TREE_CODE (elt) == COND_EXPR)
1995 ? TREE_OPERAND (elt, 1)
1996 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
1997 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
1998 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
1999 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2000 ? TREE_OPERAND (elt, 0) : 0))
2001 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2004 for (elt = obj; elt != 0;
2005 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2006 || TREE_CODE (elt) == COND_EXPR)
2007 ? TREE_OPERAND (elt, 1)
2008 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2009 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2010 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2011 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2012 ? TREE_OPERAND (elt, 0) : 0))
2013 if (POINTER_TYPE_P (TREE_TYPE (elt))
2014 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2016 return fold (build1 (INDIRECT_REF, need_type, elt));
2018 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2019 survives until RTL generation, there will be an error. */
2023 /* TREE_LIST is special because we need to look at TREE_VALUE
2024 and TREE_CHAIN, not TREE_OPERANDS. */
2025 else if (code == TREE_LIST)
2027 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2028 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2029 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2032 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2035 switch (TREE_CODE_CLASS (code))
2048 switch (first_rtl_op (code))
2054 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2055 if (op0 == TREE_OPERAND (exp, 0))
2058 return fold (build1 (code, TREE_TYPE (exp), op0));
2061 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2062 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2064 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2067 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2070 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2071 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2072 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2074 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2075 && op2 == TREE_OPERAND (exp, 2))
2078 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2081 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2082 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2083 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2084 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2086 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2087 && op2 == TREE_OPERAND (exp, 2)
2088 && op3 == TREE_OPERAND (exp, 3))
2091 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2103 /* Stabilize a reference so that we can use it any number of times
2104 without causing its operands to be evaluated more than once.
2105 Returns the stabilized reference. This works by means of save_expr,
2106 so see the caveats in the comments about save_expr.
2108 Also allows conversion expressions whose operands are references.
2109 Any other kind of expression is returned unchanged. */
2112 stabilize_reference (tree ref)
2115 enum tree_code code = TREE_CODE (ref);
2122 /* No action is needed in this case. */
2128 case FIX_TRUNC_EXPR:
2129 case FIX_FLOOR_EXPR:
2130 case FIX_ROUND_EXPR:
2132 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2136 result = build_nt (INDIRECT_REF,
2137 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2141 result = build_nt (COMPONENT_REF,
2142 stabilize_reference (TREE_OPERAND (ref, 0)),
2143 TREE_OPERAND (ref, 1), NULL_TREE);
2147 result = build_nt (BIT_FIELD_REF,
2148 stabilize_reference (TREE_OPERAND (ref, 0)),
2149 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2150 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2154 result = build_nt (ARRAY_REF,
2155 stabilize_reference (TREE_OPERAND (ref, 0)),
2156 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2157 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2160 case ARRAY_RANGE_REF:
2161 result = build_nt (ARRAY_RANGE_REF,
2162 stabilize_reference (TREE_OPERAND (ref, 0)),
2163 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2164 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2168 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2169 it wouldn't be ignored. This matters when dealing with
2171 return stabilize_reference_1 (ref);
2173 /* If arg isn't a kind of lvalue we recognize, make no change.
2174 Caller should recognize the error for an invalid lvalue. */
2179 return error_mark_node;
2182 TREE_TYPE (result) = TREE_TYPE (ref);
2183 TREE_READONLY (result) = TREE_READONLY (ref);
2184 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2185 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2190 /* Subroutine of stabilize_reference; this is called for subtrees of
2191 references. Any expression with side-effects must be put in a SAVE_EXPR
2192 to ensure that it is only evaluated once.
2194 We don't put SAVE_EXPR nodes around everything, because assigning very
2195 simple expressions to temporaries causes us to miss good opportunities
2196 for optimizations. Among other things, the opportunity to fold in the
2197 addition of a constant into an addressing mode often gets lost, e.g.
2198 "y[i+1] += x;". In general, we take the approach that we should not make
2199 an assignment unless we are forced into it - i.e., that any non-side effect
2200 operator should be allowed, and that cse should take care of coalescing
2201 multiple utterances of the same expression should that prove fruitful. */
2204 stabilize_reference_1 (tree e)
2207 enum tree_code code = TREE_CODE (e);
2209 /* We cannot ignore const expressions because it might be a reference
2210 to a const array but whose index contains side-effects. But we can
2211 ignore things that are actual constant or that already have been
2212 handled by this function. */
2214 if (TREE_INVARIANT (e))
2217 switch (TREE_CODE_CLASS (code))
2226 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2227 so that it will only be evaluated once. */
2228 /* The reference (r) and comparison (<) classes could be handled as
2229 below, but it is generally faster to only evaluate them once. */
2230 if (TREE_SIDE_EFFECTS (e))
2231 return save_expr (e);
2235 /* Constants need no processing. In fact, we should never reach
2240 /* Division is slow and tends to be compiled with jumps,
2241 especially the division by powers of 2 that is often
2242 found inside of an array reference. So do it just once. */
2243 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2244 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2245 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2246 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2247 return save_expr (e);
2248 /* Recursively stabilize each operand. */
2249 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2250 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2254 /* Recursively stabilize each operand. */
2255 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2262 TREE_TYPE (result) = TREE_TYPE (e);
2263 TREE_READONLY (result) = TREE_READONLY (e);
2264 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2265 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2266 TREE_INVARIANT (result) = 1;
2271 /* Low-level constructors for expressions. */
2273 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2274 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2277 recompute_tree_invarant_for_addr_expr (tree t)
2280 bool tc = true, ti = true, se = false;
2282 /* We started out assuming this address is both invariant and constant, but
2283 does not have side effects. Now go down any handled components and see if
2284 any of them involve offsets that are either non-constant or non-invariant.
2285 Also check for side-effects.
2287 ??? Note that this code makes no attempt to deal with the case where
2288 taking the address of something causes a copy due to misalignment. */
2290 #define UPDATE_TITCSE(NODE) \
2291 do { tree _node = (NODE); \
2292 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2293 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2294 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2296 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2297 node = TREE_OPERAND (node, 0))
2299 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2300 array reference (probably made temporarily by the G++ front end),
2301 so ignore all the operands. */
2302 if ((TREE_CODE (node) == ARRAY_REF
2303 || TREE_CODE (node) == ARRAY_RANGE_REF)
2304 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2306 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2307 UPDATE_TITCSE (array_ref_low_bound (node));
2308 UPDATE_TITCSE (array_ref_element_size (node));
2310 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2311 FIELD_DECL, apparently. The G++ front end can put something else
2312 there, at least temporarily. */
2313 else if (TREE_CODE (node) == COMPONENT_REF
2314 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2315 UPDATE_TITCSE (component_ref_field_offset (node));
2316 else if (TREE_CODE (node) == BIT_FIELD_REF)
2317 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2320 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2321 it. If it's a decl, it's invariant and constant if the decl is static.
2322 It's also invariant if it's a decl in the current function. (Taking the
2323 address of a volatile variable is not volatile.) If it's a constant,
2324 the address is both invariant and constant. Otherwise it's neither. */
2325 if (TREE_CODE (node) == INDIRECT_REF)
2326 UPDATE_TITCSE (node);
2327 else if (DECL_P (node))
2331 else if (decl_function_context (node) == current_function_decl)
2336 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 'c')
2341 se |= TREE_SIDE_EFFECTS (node);
2344 TREE_CONSTANT (t) = tc;
2345 TREE_INVARIANT (t) = ti;
2346 TREE_SIDE_EFFECTS (t) = se;
2347 #undef UPDATE_TITCSE
2350 /* Build an expression of code CODE, data type TYPE, and operands as
2351 specified. Expressions and reference nodes can be created this way.
2352 Constants, decls, types and misc nodes cannot be.
2354 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2355 enough for all extant tree codes. These functions can be called
2356 directly (preferably!), but can also be obtained via GCC preprocessor
2357 magic within the build macro. */
2360 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2364 #ifdef ENABLE_CHECKING
2365 if (TREE_CODE_LENGTH (code) != 0)
2369 t = make_node_stat (code PASS_MEM_STAT);
2376 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2378 int length = sizeof (struct tree_exp);
2379 #ifdef GATHER_STATISTICS
2380 tree_node_kind kind;
2384 #ifdef GATHER_STATISTICS
2385 switch (TREE_CODE_CLASS (code))
2387 case 's': /* an expression with side effects */
2390 case 'r': /* a reference */
2398 tree_node_counts[(int) kind]++;
2399 tree_node_sizes[(int) kind] += length;
2402 #ifdef ENABLE_CHECKING
2403 if (TREE_CODE_LENGTH (code) != 1)
2405 #endif /* ENABLE_CHECKING */
2407 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2409 memset (t, 0, sizeof (struct tree_common));
2411 TREE_SET_CODE (t, code);
2413 TREE_TYPE (t) = type;
2414 #ifdef USE_MAPPED_LOCATION
2415 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2417 SET_EXPR_LOCUS (t, NULL);
2419 TREE_COMPLEXITY (t) = 0;
2420 TREE_OPERAND (t, 0) = node;
2421 TREE_BLOCK (t) = NULL_TREE;
2422 if (node && !TYPE_P (node) && first_rtl_op (code) != 0)
2424 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2425 TREE_READONLY (t) = TREE_READONLY (node);
2428 if (TREE_CODE_CLASS (code) == 's')
2429 TREE_SIDE_EFFECTS (t) = 1;
2435 case PREDECREMENT_EXPR:
2436 case PREINCREMENT_EXPR:
2437 case POSTDECREMENT_EXPR:
2438 case POSTINCREMENT_EXPR:
2439 /* All of these have side-effects, no matter what their
2441 TREE_SIDE_EFFECTS (t) = 1;
2442 TREE_READONLY (t) = 0;
2446 /* Whether a dereference is readonly has nothing to do with whether
2447 its operand is readonly. */
2448 TREE_READONLY (t) = 0;
2453 recompute_tree_invarant_for_addr_expr (t);
2457 if (TREE_CODE_CLASS (code) == '1' && node && !TYPE_P (node)
2458 && TREE_CONSTANT (node))
2459 TREE_CONSTANT (t) = 1;
2460 if (TREE_CODE_CLASS (code) == '1' && node && TREE_INVARIANT (node))
2461 TREE_INVARIANT (t) = 1;
2462 if (TREE_CODE_CLASS (code) == 'r' && node && TREE_THIS_VOLATILE (node))
2463 TREE_THIS_VOLATILE (t) = 1;
2470 #define PROCESS_ARG(N) \
2472 TREE_OPERAND (t, N) = arg##N; \
2473 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2475 if (TREE_SIDE_EFFECTS (arg##N)) \
2477 if (!TREE_READONLY (arg##N)) \
2479 if (!TREE_CONSTANT (arg##N)) \
2481 if (!TREE_INVARIANT (arg##N)) \
2487 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2489 bool constant, read_only, side_effects, invariant;
2493 #ifdef ENABLE_CHECKING
2494 if (TREE_CODE_LENGTH (code) != 2)
2498 t = make_node_stat (code PASS_MEM_STAT);
2501 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2502 result based on those same flags for the arguments. But if the
2503 arguments aren't really even `tree' expressions, we shouldn't be trying
2505 fro = first_rtl_op (code);
2507 /* Expressions without side effects may be constant if their
2508 arguments are as well. */
2509 constant = (TREE_CODE_CLASS (code) == '<'
2510 || TREE_CODE_CLASS (code) == '2');
2512 side_effects = TREE_SIDE_EFFECTS (t);
2513 invariant = constant;
2518 TREE_READONLY (t) = read_only;
2519 TREE_CONSTANT (t) = constant;
2520 TREE_INVARIANT (t) = invariant;
2521 TREE_SIDE_EFFECTS (t) = side_effects;
2522 TREE_THIS_VOLATILE (t)
2523 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2529 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2530 tree arg2 MEM_STAT_DECL)
2532 bool constant, read_only, side_effects, invariant;
2536 #ifdef ENABLE_CHECKING
2537 if (TREE_CODE_LENGTH (code) != 3)
2541 t = make_node_stat (code PASS_MEM_STAT);
2544 fro = first_rtl_op (code);
2546 side_effects = TREE_SIDE_EFFECTS (t);
2552 if (code == CALL_EXPR && !side_effects)
2557 /* Calls have side-effects, except those to const or
2559 i = call_expr_flags (t);
2560 if (!(i & (ECF_CONST | ECF_PURE)))
2563 /* And even those have side-effects if their arguments do. */
2564 else for (node = arg1; node; node = TREE_CHAIN (node))
2565 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2572 TREE_SIDE_EFFECTS (t) = side_effects;
2573 TREE_THIS_VOLATILE (t)
2574 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2580 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2581 tree arg2, tree arg3 MEM_STAT_DECL)
2583 bool constant, read_only, side_effects, invariant;
2587 #ifdef ENABLE_CHECKING
2588 if (TREE_CODE_LENGTH (code) != 4)
2592 t = make_node_stat (code PASS_MEM_STAT);
2595 fro = first_rtl_op (code);
2597 side_effects = TREE_SIDE_EFFECTS (t);
2604 TREE_SIDE_EFFECTS (t) = side_effects;
2605 TREE_THIS_VOLATILE (t)
2606 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2611 /* Backup definition for non-gcc build compilers. */
2614 (build) (enum tree_code code, tree tt, ...)
2616 tree t, arg0, arg1, arg2, arg3;
2617 int length = TREE_CODE_LENGTH (code);
2624 t = build0 (code, tt);
2627 arg0 = va_arg (p, tree);
2628 t = build1 (code, tt, arg0);
2631 arg0 = va_arg (p, tree);
2632 arg1 = va_arg (p, tree);
2633 t = build2 (code, tt, arg0, arg1);
2636 arg0 = va_arg (p, tree);
2637 arg1 = va_arg (p, tree);
2638 arg2 = va_arg (p, tree);
2639 t = build3 (code, tt, arg0, arg1, arg2);
2642 arg0 = va_arg (p, tree);
2643 arg1 = va_arg (p, tree);
2644 arg2 = va_arg (p, tree);
2645 arg3 = va_arg (p, tree);
2646 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2656 /* Similar except don't specify the TREE_TYPE
2657 and leave the TREE_SIDE_EFFECTS as 0.
2658 It is permissible for arguments to be null,
2659 or even garbage if their values do not matter. */
2662 build_nt (enum tree_code code, ...)
2671 t = make_node (code);
2672 length = TREE_CODE_LENGTH (code);
2674 for (i = 0; i < length; i++)
2675 TREE_OPERAND (t, i) = va_arg (p, tree);
2681 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2682 We do NOT enter this node in any sort of symbol table.
2684 layout_decl is used to set up the decl's storage layout.
2685 Other slots are initialized to 0 or null pointers. */
2688 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2692 t = make_node_stat (code PASS_MEM_STAT);
2694 /* if (type == error_mark_node)
2695 type = integer_type_node; */
2696 /* That is not done, deliberately, so that having error_mark_node
2697 as the type can suppress useless errors in the use of this variable. */
2699 DECL_NAME (t) = name;
2700 TREE_TYPE (t) = type;
2702 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2704 else if (code == FUNCTION_DECL)
2705 DECL_MODE (t) = FUNCTION_MODE;
2710 /* BLOCK nodes are used to represent the structure of binding contours
2711 and declarations, once those contours have been exited and their contents
2712 compiled. This information is used for outputting debugging info. */
2715 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2716 tree supercontext, tree chain)
2718 tree block = make_node (BLOCK);
2720 BLOCK_VARS (block) = vars;
2721 BLOCK_SUBBLOCKS (block) = subblocks;
2722 BLOCK_SUPERCONTEXT (block) = supercontext;
2723 BLOCK_CHAIN (block) = chain;
2727 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2728 /* ??? gengtype doesn't handle conditionals */
2729 static GTY(()) tree last_annotated_node;
2732 #ifdef USE_MAPPED_LOCATION
2735 expand_location (source_location loc)
2737 expanded_location xloc;
2738 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
2741 const struct line_map *map = linemap_lookup (&line_table, loc);
2742 xloc.file = map->to_file;
2743 xloc.line = SOURCE_LINE (map, loc);
2744 xloc.column = SOURCE_COLUMN (map, loc);
2751 /* Record the exact location where an expression or an identifier were
2755 annotate_with_file_line (tree node, const char *file, int line)
2757 /* Roughly one percent of the calls to this function are to annotate
2758 a node with the same information already attached to that node!
2759 Just return instead of wasting memory. */
2760 if (EXPR_LOCUS (node)
2761 && (EXPR_FILENAME (node) == file
2762 || ! strcmp (EXPR_FILENAME (node), file))
2763 && EXPR_LINENO (node) == line)
2765 last_annotated_node = node;
2769 /* In heavily macroized code (such as GCC itself) this single
2770 entry cache can reduce the number of allocations by more
2772 if (last_annotated_node
2773 && EXPR_LOCUS (last_annotated_node)
2774 && (EXPR_FILENAME (last_annotated_node) == file
2775 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
2776 && EXPR_LINENO (last_annotated_node) == line)
2778 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
2782 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
2783 EXPR_LINENO (node) = line;
2784 EXPR_FILENAME (node) = file;
2785 last_annotated_node = node;
2789 annotate_with_locus (tree node, location_t locus)
2791 annotate_with_file_line (node, locus.file, locus.line);
2795 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2799 build_decl_attribute_variant (tree ddecl, tree attribute)
2801 DECL_ATTRIBUTES (ddecl) = attribute;
2805 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2808 Record such modified types already made so we don't make duplicates. */
2811 build_type_attribute_variant (tree ttype, tree attribute)
2813 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2815 hashval_t hashcode = 0;
2817 enum tree_code code = TREE_CODE (ttype);
2819 ntype = copy_node (ttype);
2821 TYPE_POINTER_TO (ntype) = 0;
2822 TYPE_REFERENCE_TO (ntype) = 0;
2823 TYPE_ATTRIBUTES (ntype) = attribute;
2825 /* Create a new main variant of TYPE. */
2826 TYPE_MAIN_VARIANT (ntype) = ntype;
2827 TYPE_NEXT_VARIANT (ntype) = 0;
2828 set_type_quals (ntype, TYPE_UNQUALIFIED);
2830 hashcode = iterative_hash_object (code, hashcode);
2831 if (TREE_TYPE (ntype))
2832 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2834 hashcode = attribute_hash_list (attribute, hashcode);
2836 switch (TREE_CODE (ntype))
2839 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2842 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2846 hashcode = iterative_hash_object
2847 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2848 hashcode = iterative_hash_object
2849 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2853 unsigned int precision = TYPE_PRECISION (ntype);
2854 hashcode = iterative_hash_object (precision, hashcode);
2861 ntype = type_hash_canon (hashcode, ntype);
2862 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2868 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2871 We try both `text' and `__text__', ATTR may be either one. */
2872 /* ??? It might be a reasonable simplification to require ATTR to be only
2873 `text'. One might then also require attribute lists to be stored in
2874 their canonicalized form. */
2877 is_attribute_p (const char *attr, tree ident)
2879 int ident_len, attr_len;
2882 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2885 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2888 p = IDENTIFIER_POINTER (ident);
2889 ident_len = strlen (p);
2890 attr_len = strlen (attr);
2892 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2896 || attr[attr_len - 2] != '_'
2897 || attr[attr_len - 1] != '_')
2899 if (ident_len == attr_len - 4
2900 && strncmp (attr + 2, p, attr_len - 4) == 0)
2905 if (ident_len == attr_len + 4
2906 && p[0] == '_' && p[1] == '_'
2907 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2908 && strncmp (attr, p + 2, attr_len) == 0)
2915 /* Given an attribute name and a list of attributes, return a pointer to the
2916 attribute's list element if the attribute is part of the list, or NULL_TREE
2917 if not found. If the attribute appears more than once, this only
2918 returns the first occurrence; the TREE_CHAIN of the return value should
2919 be passed back in if further occurrences are wanted. */
2922 lookup_attribute (const char *attr_name, tree list)
2926 for (l = list; l; l = TREE_CHAIN (l))
2928 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2930 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2937 /* Return an attribute list that is the union of a1 and a2. */
2940 merge_attributes (tree a1, tree a2)
2944 /* Either one unset? Take the set one. */
2946 if ((attributes = a1) == 0)
2949 /* One that completely contains the other? Take it. */
2951 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2953 if (attribute_list_contained (a2, a1))
2957 /* Pick the longest list, and hang on the other list. */
2959 if (list_length (a1) < list_length (a2))
2960 attributes = a2, a2 = a1;
2962 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2965 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2968 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2971 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2976 a1 = copy_node (a2);
2977 TREE_CHAIN (a1) = attributes;
2986 /* Given types T1 and T2, merge their attributes and return
2990 merge_type_attributes (tree t1, tree t2)
2992 return merge_attributes (TYPE_ATTRIBUTES (t1),
2993 TYPE_ATTRIBUTES (t2));
2996 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3000 merge_decl_attributes (tree olddecl, tree newdecl)
3002 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3003 DECL_ATTRIBUTES (newdecl));
3006 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
3008 /* Specialization of merge_decl_attributes for various Windows targets.
3010 This handles the following situation:
3012 __declspec (dllimport) int foo;
3015 The second instance of `foo' nullifies the dllimport. */
3018 merge_dllimport_decl_attributes (tree old, tree new)
3021 int delete_dllimport_p;
3023 old = DECL_ATTRIBUTES (old);
3024 new = DECL_ATTRIBUTES (new);
3026 /* What we need to do here is remove from `old' dllimport if it doesn't
3027 appear in `new'. dllimport behaves like extern: if a declaration is
3028 marked dllimport and a definition appears later, then the object
3029 is not dllimport'd. */
3030 if (lookup_attribute ("dllimport", old) != NULL_TREE
3031 && lookup_attribute ("dllimport", new) == NULL_TREE)
3032 delete_dllimport_p = 1;
3034 delete_dllimport_p = 0;
3036 a = merge_attributes (old, new);
3038 if (delete_dllimport_p)
3042 /* Scan the list for dllimport and delete it. */
3043 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3045 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3047 if (prev == NULL_TREE)
3050 TREE_CHAIN (prev) = TREE_CHAIN (t);
3059 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3061 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3062 of the various TYPE_QUAL values. */
3065 set_type_quals (tree type, int type_quals)
3067 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3068 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3069 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3072 /* Returns true iff cand is equivalent to base with type_quals. */
3075 check_qualified_type (tree cand, tree base, int type_quals)
3077 return (TYPE_QUALS (cand) == type_quals
3078 && TYPE_NAME (cand) == TYPE_NAME (base)
3079 /* Apparently this is needed for Objective-C. */
3080 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3081 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3082 TYPE_ATTRIBUTES (base)));
3085 /* Return a version of the TYPE, qualified as indicated by the
3086 TYPE_QUALS, if one exists. If no qualified version exists yet,
3087 return NULL_TREE. */
3090 get_qualified_type (tree type, int type_quals)
3094 if (TYPE_QUALS (type) == type_quals)
3097 /* Search the chain of variants to see if there is already one there just
3098 like the one we need to have. If so, use that existing one. We must
3099 preserve the TYPE_NAME, since there is code that depends on this. */
3100 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3101 if (check_qualified_type (t, type, type_quals))
3107 /* Like get_qualified_type, but creates the type if it does not
3108 exist. This function never returns NULL_TREE. */
3111 build_qualified_type (tree type, int type_quals)
3115 /* See if we already have the appropriate qualified variant. */
3116 t = get_qualified_type (type, type_quals);
3118 /* If not, build it. */
3121 t = build_type_copy (type);
3122 set_type_quals (t, type_quals);
3128 /* Create a new variant of TYPE, equivalent but distinct.
3129 This is so the caller can modify it. */
3132 build_type_copy (tree type)
3134 tree t, m = TYPE_MAIN_VARIANT (type);
3136 t = copy_node (type);
3138 TYPE_POINTER_TO (t) = 0;
3139 TYPE_REFERENCE_TO (t) = 0;
3141 /* Add this type to the chain of variants of TYPE. */
3142 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3143 TYPE_NEXT_VARIANT (m) = t;
3148 /* Hashing of types so that we don't make duplicates.
3149 The entry point is `type_hash_canon'. */
3151 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3152 with types in the TREE_VALUE slots), by adding the hash codes
3153 of the individual types. */
3156 type_hash_list (tree list, hashval_t hashcode)
3160 for (tail = list; tail; tail = TREE_CHAIN (tail))
3161 if (TREE_VALUE (tail) != error_mark_node)
3162 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3168 /* These are the Hashtable callback functions. */
3170 /* Returns true iff the types are equivalent. */
3173 type_hash_eq (const void *va, const void *vb)
3175 const struct type_hash *a = va, *b = vb;
3177 /* First test the things that are the same for all types. */
3178 if (a->hash != b->hash
3179 || TREE_CODE (a->type) != TREE_CODE (b->type)
3180 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3181 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3182 TYPE_ATTRIBUTES (b->type))
3183 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3184 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3187 switch (TREE_CODE (a->type))
3193 case REFERENCE_TYPE:
3197 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3198 && !(TYPE_VALUES (a->type)
3199 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3200 && TYPE_VALUES (b->type)
3201 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3202 && type_list_equal (TYPE_VALUES (a->type),
3203 TYPE_VALUES (b->type))))
3206 /* ... fall through ... */
3212 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3213 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3214 TYPE_MAX_VALUE (b->type)))
3215 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3216 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3217 TYPE_MIN_VALUE (b->type))));
3220 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3223 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3224 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3225 || (TYPE_ARG_TYPES (a->type)
3226 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3227 && TYPE_ARG_TYPES (b->type)
3228 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3229 && type_list_equal (TYPE_ARG_TYPES (a->type),
3230 TYPE_ARG_TYPES (b->type)))));
3234 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3238 case QUAL_UNION_TYPE:
3239 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3240 || (TYPE_FIELDS (a->type)
3241 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3242 && TYPE_FIELDS (b->type)
3243 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3244 && type_list_equal (TYPE_FIELDS (a->type),
3245 TYPE_FIELDS (b->type))));
3248 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3249 || (TYPE_ARG_TYPES (a->type)
3250 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3251 && TYPE_ARG_TYPES (b->type)
3252 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3253 && type_list_equal (TYPE_ARG_TYPES (a->type),
3254 TYPE_ARG_TYPES (b->type))));
3261 /* Return the cached hash value. */
3264 type_hash_hash (const void *item)
3266 return ((const struct type_hash *) item)->hash;
3269 /* Look in the type hash table for a type isomorphic to TYPE.
3270 If one is found, return it. Otherwise return 0. */
3273 type_hash_lookup (hashval_t hashcode, tree type)
3275 struct type_hash *h, in;
3277 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3278 must call that routine before comparing TYPE_ALIGNs. */
3284 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3290 /* Add an entry to the type-hash-table
3291 for a type TYPE whose hash code is HASHCODE. */
3294 type_hash_add (hashval_t hashcode, tree type)
3296 struct type_hash *h;
3299 h = ggc_alloc (sizeof (struct type_hash));
3302 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3303 *(struct type_hash **) loc = h;
3306 /* Given TYPE, and HASHCODE its hash code, return the canonical
3307 object for an identical type if one already exists.
3308 Otherwise, return TYPE, and record it as the canonical object.
3310 To use this function, first create a type of the sort you want.
3311 Then compute its hash code from the fields of the type that
3312 make it different from other similar types.
3313 Then call this function and use the value. */
3316 type_hash_canon (unsigned int hashcode, tree type)
3320 /* The hash table only contains main variants, so ensure that's what we're
3322 if (TYPE_MAIN_VARIANT (type) != type)
3325 if (!lang_hooks.types.hash_types)
3328 /* See if the type is in the hash table already. If so, return it.
3329 Otherwise, add the type. */
3330 t1 = type_hash_lookup (hashcode, type);
3333 #ifdef GATHER_STATISTICS
3334 tree_node_counts[(int) t_kind]--;
3335 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3341 type_hash_add (hashcode, type);
3346 /* See if the data pointed to by the type hash table is marked. We consider
3347 it marked if the type is marked or if a debug type number or symbol
3348 table entry has been made for the type. This reduces the amount of
3349 debugging output and eliminates that dependency of the debug output on
3350 the number of garbage collections. */
3353 type_hash_marked_p (const void *p)
3355 tree type = ((struct type_hash *) p)->type;
3357 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3361 print_type_hash_statistics (void)
3363 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3364 (long) htab_size (type_hash_table),
3365 (long) htab_elements (type_hash_table),
3366 htab_collisions (type_hash_table));
3369 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3370 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3371 by adding the hash codes of the individual attributes. */
3374 attribute_hash_list (tree list, hashval_t hashcode)
3378 for (tail = list; tail; tail = TREE_CHAIN (tail))
3379 /* ??? Do we want to add in TREE_VALUE too? */
3380 hashcode = iterative_hash_object
3381 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3385 /* Given two lists of attributes, return true if list l2 is
3386 equivalent to l1. */
3389 attribute_list_equal (tree l1, tree l2)
3391 return attribute_list_contained (l1, l2)
3392 && attribute_list_contained (l2, l1);
3395 /* Given two lists of attributes, return true if list L2 is
3396 completely contained within L1. */
3397 /* ??? This would be faster if attribute names were stored in a canonicalized
3398 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3399 must be used to show these elements are equivalent (which they are). */
3400 /* ??? It's not clear that attributes with arguments will always be handled
3404 attribute_list_contained (tree l1, tree l2)
3408 /* First check the obvious, maybe the lists are identical. */
3412 /* Maybe the lists are similar. */
3413 for (t1 = l1, t2 = l2;
3415 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3416 && TREE_VALUE (t1) == TREE_VALUE (t2);
3417 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3419 /* Maybe the lists are equal. */
3420 if (t1 == 0 && t2 == 0)
3423 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3426 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3428 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3431 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3438 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3445 /* Given two lists of types
3446 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3447 return 1 if the lists contain the same types in the same order.
3448 Also, the TREE_PURPOSEs must match. */
3451 type_list_equal (tree l1, tree l2)
3455 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3456 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3457 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3458 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3459 && (TREE_TYPE (TREE_PURPOSE (t1))
3460 == TREE_TYPE (TREE_PURPOSE (t2))))))
3466 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3467 given by TYPE. If the argument list accepts variable arguments,
3468 then this function counts only the ordinary arguments. */
3471 type_num_arguments (tree type)
3476 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3477 /* If the function does not take a variable number of arguments,
3478 the last element in the list will have type `void'. */
3479 if (VOID_TYPE_P (TREE_VALUE (t)))
3487 /* Nonzero if integer constants T1 and T2
3488 represent the same constant value. */
3491 tree_int_cst_equal (tree t1, tree t2)
3496 if (t1 == 0 || t2 == 0)
3499 if (TREE_CODE (t1) == INTEGER_CST
3500 && TREE_CODE (t2) == INTEGER_CST
3501 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3502 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3508 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3509 The precise way of comparison depends on their data type. */
3512 tree_int_cst_lt (tree t1, tree t2)
3517 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3519 int t1_sgn = tree_int_cst_sgn (t1);
3520 int t2_sgn = tree_int_cst_sgn (t2);
3522 if (t1_sgn < t2_sgn)
3524 else if (t1_sgn > t2_sgn)
3526 /* Otherwise, both are non-negative, so we compare them as
3527 unsigned just in case one of them would overflow a signed
3530 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3531 return INT_CST_LT (t1, t2);
3533 return INT_CST_LT_UNSIGNED (t1, t2);
3536 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3539 tree_int_cst_compare (tree t1, tree t2)
3541 if (tree_int_cst_lt (t1, t2))
3543 else if (tree_int_cst_lt (t2, t1))
3549 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3550 the host. If POS is zero, the value can be represented in a single
3551 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3552 be represented in a single unsigned HOST_WIDE_INT. */
3555 host_integerp (tree t, int pos)
3557 return (TREE_CODE (t) == INTEGER_CST
3558 && ! TREE_OVERFLOW (t)
3559 && ((TREE_INT_CST_HIGH (t) == 0
3560 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3561 || (! pos && TREE_INT_CST_HIGH (t) == -1
3562 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3563 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3564 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3567 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3568 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3569 be positive. Abort if we cannot satisfy the above conditions. */
3572 tree_low_cst (tree t, int pos)
3574 if (host_integerp (t, pos))
3575 return TREE_INT_CST_LOW (t);
3580 /* Return the most significant bit of the integer constant T. */
3583 tree_int_cst_msb (tree t)
3587 unsigned HOST_WIDE_INT l;
3589 /* Note that using TYPE_PRECISION here is wrong. We care about the
3590 actual bits, not the (arbitrary) range of the type. */
3591 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3592 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3593 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3594 return (l & 1) == 1;
3597 /* Return an indication of the sign of the integer constant T.
3598 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3599 Note that -1 will never be returned it T's type is unsigned. */
3602 tree_int_cst_sgn (tree t)
3604 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3606 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3608 else if (TREE_INT_CST_HIGH (t) < 0)
3614 /* Compare two constructor-element-type constants. Return 1 if the lists
3615 are known to be equal; otherwise return 0. */
3618 simple_cst_list_equal (tree l1, tree l2)
3620 while (l1 != NULL_TREE && l2 != NULL_TREE)
3622 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3625 l1 = TREE_CHAIN (l1);
3626 l2 = TREE_CHAIN (l2);
3632 /* Return truthvalue of whether T1 is the same tree structure as T2.
3633 Return 1 if they are the same.
3634 Return 0 if they are understandably different.
3635 Return -1 if either contains tree structure not understood by
3639 simple_cst_equal (tree t1, tree t2)
3641 enum tree_code code1, code2;
3647 if (t1 == 0 || t2 == 0)
3650 code1 = TREE_CODE (t1);
3651 code2 = TREE_CODE (t2);
3653 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3655 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3656 || code2 == NON_LVALUE_EXPR)
3657 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3659 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3662 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3663 || code2 == NON_LVALUE_EXPR)
3664 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3672 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3673 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3676 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3679 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3680 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3681 TREE_STRING_LENGTH (t1)));
3684 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1),
3685 CONSTRUCTOR_ELTS (t2));
3688 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3691 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3695 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3698 /* Special case: if either target is an unallocated VAR_DECL,
3699 it means that it's going to be unified with whatever the
3700 TARGET_EXPR is really supposed to initialize, so treat it
3701 as being equivalent to anything. */
3702 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3703 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3704 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3705 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3706 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3707 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3710 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3715 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3717 case WITH_CLEANUP_EXPR:
3718 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3722 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3725 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3726 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3740 /* This general rule works for most tree codes. All exceptions should be
3741 handled above. If this is a language-specific tree code, we can't
3742 trust what might be in the operand, so say we don't know
3744 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3747 switch (TREE_CODE_CLASS (code1))
3756 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3758 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3770 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3771 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3772 than U, respectively. */
3775 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3777 if (tree_int_cst_sgn (t) < 0)
3779 else if (TREE_INT_CST_HIGH (t) != 0)
3781 else if (TREE_INT_CST_LOW (t) == u)
3783 else if (TREE_INT_CST_LOW (t) < u)
3789 /* Return true if CODE represents an associative tree code. Otherwise
3792 associative_tree_code (enum tree_code code)
3811 /* Return true if CODE represents an commutative tree code. Otherwise
3814 commutative_tree_code (enum tree_code code)
3827 case UNORDERED_EXPR:
3831 case TRUTH_AND_EXPR:
3832 case TRUTH_XOR_EXPR:
3842 /* Generate a hash value for an expression. This can be used iteratively
3843 by passing a previous result as the "val" argument.
3845 This function is intended to produce the same hash for expressions which
3846 would compare equal using operand_equal_p. */
3849 iterative_hash_expr (tree t, hashval_t val)
3852 enum tree_code code;
3856 return iterative_hash_object (t, val);
3858 code = TREE_CODE (t);
3859 class = TREE_CODE_CLASS (code);
3862 || TREE_CODE (t) == VALUE_HANDLE)
3864 /* Decls we can just compare by pointer. */
3865 val = iterative_hash_object (t, val);
3867 else if (class == 'c')
3869 /* Alas, constants aren't shared, so we can't rely on pointer
3871 if (code == INTEGER_CST)
3873 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3874 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3876 else if (code == REAL_CST)
3878 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
3880 val = iterative_hash (&val2, sizeof (unsigned int), val);
3882 else if (code == STRING_CST)
3883 val = iterative_hash (TREE_STRING_POINTER (t),
3884 TREE_STRING_LENGTH (t), val);
3885 else if (code == COMPLEX_CST)
3887 val = iterative_hash_expr (TREE_REALPART (t), val);
3888 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3890 else if (code == VECTOR_CST)
3891 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3895 else if (IS_EXPR_CODE_CLASS (class))
3897 val = iterative_hash_object (code, val);
3899 /* Don't hash the type, that can lead to having nodes which
3900 compare equal according to operand_equal_p, but which
3901 have different hash codes. */
3902 if (code == NOP_EXPR
3903 || code == CONVERT_EXPR
3904 || code == NON_LVALUE_EXPR)
3906 /* Make sure to include signness in the hash computation. */
3907 val += TYPE_UNSIGNED (TREE_TYPE (t));
3908 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
3911 if (commutative_tree_code (code))
3913 /* It's a commutative expression. We want to hash it the same
3914 however it appears. We do this by first hashing both operands
3915 and then rehashing based on the order of their independent
3917 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
3918 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
3922 t = one, one = two, two = t;
3924 val = iterative_hash_object (one, val);
3925 val = iterative_hash_object (two, val);
3928 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3929 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3931 else if (code == TREE_LIST)
3933 /* A list of expressions, for a CALL_EXPR or as the elements of a
3935 for (; t; t = TREE_CHAIN (t))
3936 val = iterative_hash_expr (TREE_VALUE (t), val);
3938 else if (code == SSA_NAME)
3940 val = iterative_hash_object (SSA_NAME_VERSION (t), val);
3941 val = iterative_hash_expr (SSA_NAME_VAR (t), val);
3949 /* Constructors for pointer, array and function types.
3950 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3951 constructed by language-dependent code, not here.) */
3953 /* Construct, lay out and return the type of pointers to TO_TYPE with
3954 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
3955 reference all of memory. If such a type has already been
3956 constructed, reuse it. */
3959 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
3964 /* In some cases, languages will have things that aren't a POINTER_TYPE
3965 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
3966 In that case, return that type without regard to the rest of our
3969 ??? This is a kludge, but consistent with the way this function has
3970 always operated and there doesn't seem to be a good way to avoid this
3972 if (TYPE_POINTER_TO (to_type) != 0
3973 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
3974 return TYPE_POINTER_TO (to_type);
3976 /* First, if we already have a type for pointers to TO_TYPE and it's
3977 the proper mode, use it. */
3978 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
3979 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
3982 t = make_node (POINTER_TYPE);
3984 TREE_TYPE (t) = to_type;
3985 TYPE_MODE (t) = mode;
3986 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
3987 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
3988 TYPE_POINTER_TO (to_type) = t;
3990 /* Lay out the type. This function has many callers that are concerned
3991 with expression-construction, and this simplifies them all. */
3997 /* By default build pointers in ptr_mode. */
4000 build_pointer_type (tree to_type)
4002 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4005 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4008 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4013 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4014 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4015 In that case, return that type without regard to the rest of our
4018 ??? This is a kludge, but consistent with the way this function has
4019 always operated and there doesn't seem to be a good way to avoid this
4021 if (TYPE_REFERENCE_TO (to_type) != 0
4022 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4023 return TYPE_REFERENCE_TO (to_type);
4025 /* First, if we already have a type for pointers to TO_TYPE and it's
4026 the proper mode, use it. */
4027 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4028 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4031 t = make_node (REFERENCE_TYPE);
4033 TREE_TYPE (t) = to_type;
4034 TYPE_MODE (t) = mode;
4035 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4036 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4037 TYPE_REFERENCE_TO (to_type) = t;
4045 /* Build the node for the type of references-to-TO_TYPE by default
4049 build_reference_type (tree to_type)
4051 return build_reference_type_for_mode (to_type, ptr_mode, false);
4054 /* Build a type that is compatible with t but has no cv quals anywhere
4057 const char *const *const * -> char ***. */
4060 build_type_no_quals (tree t)
4062 switch (TREE_CODE (t))
4065 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4067 TYPE_REF_CAN_ALIAS_ALL (t));
4068 case REFERENCE_TYPE:
4070 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4072 TYPE_REF_CAN_ALIAS_ALL (t));
4074 return TYPE_MAIN_VARIANT (t);
4078 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4079 MAXVAL should be the maximum value in the domain
4080 (one less than the length of the array).
4082 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4083 We don't enforce this limit, that is up to caller (e.g. language front end).
4084 The limit exists because the result is a signed type and we don't handle
4085 sizes that use more than one HOST_WIDE_INT. */
4088 build_index_type (tree maxval)
4090 tree itype = make_node (INTEGER_TYPE);
4092 TREE_TYPE (itype) = sizetype;
4093 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4094 TYPE_MIN_VALUE (itype) = size_zero_node;
4095 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4096 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4097 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4098 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4099 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4100 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4102 if (host_integerp (maxval, 1))
4103 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4108 /* Builds a signed or unsigned integer type of precision PRECISION.
4109 Used for C bitfields whose precision does not match that of
4110 built-in target types. */
4112 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
4115 tree itype = make_node (INTEGER_TYPE);
4117 TYPE_PRECISION (itype) = precision;
4120 fixup_unsigned_type (itype);
4122 fixup_signed_type (itype);
4124 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
4125 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
4130 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4131 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4132 low bound LOWVAL and high bound HIGHVAL.
4133 if TYPE==NULL_TREE, sizetype is used. */
4136 build_range_type (tree type, tree lowval, tree highval)
4138 tree itype = make_node (INTEGER_TYPE);
4140 TREE_TYPE (itype) = type;
4141 if (type == NULL_TREE)
4144 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4145 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4147 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4148 TYPE_MODE (itype) = TYPE_MODE (type);
4149 TYPE_SIZE (itype) = TYPE_SIZE (type);
4150 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4151 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4152 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4154 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4155 return type_hash_canon (tree_low_cst (highval, 0)
4156 - tree_low_cst (lowval, 0),
4162 /* Just like build_index_type, but takes lowval and highval instead
4163 of just highval (maxval). */
4166 build_index_2_type (tree lowval, tree highval)
4168 return build_range_type (sizetype, lowval, highval);
4171 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4172 and number of elements specified by the range of values of INDEX_TYPE.
4173 If such a type has already been constructed, reuse it. */
4176 build_array_type (tree elt_type, tree index_type)
4179 hashval_t hashcode = 0;
4181 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4183 error ("arrays of functions are not meaningful");
4184 elt_type = integer_type_node;
4187 t = make_node (ARRAY_TYPE);
4188 TREE_TYPE (t) = elt_type;
4189 TYPE_DOMAIN (t) = index_type;
4191 if (index_type == 0)
4194 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4195 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4196 t = type_hash_canon (hashcode, t);
4198 if (!COMPLETE_TYPE_P (t))
4203 /* Return the TYPE of the elements comprising
4204 the innermost dimension of ARRAY. */
4207 get_inner_array_type (tree array)
4209 tree type = TREE_TYPE (array);
4211 while (TREE_CODE (type) == ARRAY_TYPE)
4212 type = TREE_TYPE (type);
4217 /* Construct, lay out and return
4218 the type of functions returning type VALUE_TYPE
4219 given arguments of types ARG_TYPES.
4220 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4221 are data type nodes for the arguments of the function.
4222 If such a type has already been constructed, reuse it. */
4225 build_function_type (tree value_type, tree arg_types)
4228 hashval_t hashcode = 0;
4230 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4232 error ("function return type cannot be function");
4233 value_type = integer_type_node;
4236 /* Make a node of the sort we want. */
4237 t = make_node (FUNCTION_TYPE);
4238 TREE_TYPE (t) = value_type;
4239 TYPE_ARG_TYPES (t) = arg_types;
4241 /* If we already have such a type, use the old one. */
4242 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4243 hashcode = type_hash_list (arg_types, hashcode);
4244 t = type_hash_canon (hashcode, t);
4246 if (!COMPLETE_TYPE_P (t))
4251 /* Build a function type. The RETURN_TYPE is the type returned by the
4252 function. If additional arguments are provided, they are
4253 additional argument types. The list of argument types must always
4254 be terminated by NULL_TREE. */
4257 build_function_type_list (tree return_type, ...)
4262 va_start (p, return_type);
4264 t = va_arg (p, tree);
4265 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4266 args = tree_cons (NULL_TREE, t, args);
4269 args = nreverse (args);
4270 TREE_CHAIN (last) = void_list_node;
4271 args = build_function_type (return_type, args);
4277 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4278 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4279 for the method. An implicit additional parameter (of type
4280 pointer-to-BASETYPE) is added to the ARGTYPES. */
4283 build_method_type_directly (tree basetype,
4291 /* Make a node of the sort we want. */
4292 t = make_node (METHOD_TYPE);
4294 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4295 TREE_TYPE (t) = rettype;
4296 ptype = build_pointer_type (basetype);
4298 /* The actual arglist for this function includes a "hidden" argument
4299 which is "this". Put it into the list of argument types. */
4300 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4301 TYPE_ARG_TYPES (t) = argtypes;
4303 /* If we already have such a type, use the old one. */
4304 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4305 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4306 hashcode = type_hash_list (argtypes, hashcode);
4307 t = type_hash_canon (hashcode, t);
4309 if (!COMPLETE_TYPE_P (t))
4315 /* Construct, lay out and return the type of methods belonging to class
4316 BASETYPE and whose arguments and values are described by TYPE.
4317 If that type exists already, reuse it.
4318 TYPE must be a FUNCTION_TYPE node. */
4321 build_method_type (tree basetype, tree type)
4323 if (TREE_CODE (type) != FUNCTION_TYPE)
4326 return build_method_type_directly (basetype,
4328 TYPE_ARG_TYPES (type));
4331 /* Construct, lay out and return the type of offsets to a value
4332 of type TYPE, within an object of type BASETYPE.
4333 If a suitable offset type exists already, reuse it. */
4336 build_offset_type (tree basetype, tree type)
4339 hashval_t hashcode = 0;
4341 /* Make a node of the sort we want. */
4342 t = make_node (OFFSET_TYPE);
4344 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4345 TREE_TYPE (t) = type;
4347 /* If we already have such a type, use the old one. */
4348 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4349 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4350 t = type_hash_canon (hashcode, t);
4352 if (!COMPLETE_TYPE_P (t))
4358 /* Create a complex type whose components are COMPONENT_TYPE. */
4361 build_complex_type (tree component_type)
4366 /* Make a node of the sort we want. */
4367 t = make_node (COMPLEX_TYPE);
4369 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4371 /* If we already have such a type, use the old one. */
4372 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4373 t = type_hash_canon (hashcode, t);
4375 if (!COMPLETE_TYPE_P (t))
4378 /* If we are writing Dwarf2 output we need to create a name,
4379 since complex is a fundamental type. */
4380 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4384 if (component_type == char_type_node)
4385 name = "complex char";
4386 else if (component_type == signed_char_type_node)
4387 name = "complex signed char";
4388 else if (component_type == unsigned_char_type_node)
4389 name = "complex unsigned char";
4390 else if (component_type == short_integer_type_node)
4391 name = "complex short int";
4392 else if (component_type == short_unsigned_type_node)
4393 name = "complex short unsigned int";
4394 else if (component_type == integer_type_node)
4395 name = "complex int";
4396 else if (component_type == unsigned_type_node)
4397 name = "complex unsigned int";
4398 else if (component_type == long_integer_type_node)
4399 name = "complex long int";
4400 else if (component_type == long_unsigned_type_node)
4401 name = "complex long unsigned int";
4402 else if (component_type == long_long_integer_type_node)
4403 name = "complex long long int";
4404 else if (component_type == long_long_unsigned_type_node)
4405 name = "complex long long unsigned int";
4410 TYPE_NAME (t) = get_identifier (name);
4413 return build_qualified_type (t, TYPE_QUALS (component_type));
4416 /* Return OP, stripped of any conversions to wider types as much as is safe.
4417 Converting the value back to OP's type makes a value equivalent to OP.
4419 If FOR_TYPE is nonzero, we return a value which, if converted to
4420 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4422 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4423 narrowest type that can hold the value, even if they don't exactly fit.
4424 Otherwise, bit-field references are changed to a narrower type
4425 only if they can be fetched directly from memory in that type.
4427 OP must have integer, real or enumeral type. Pointers are not allowed!
4429 There are some cases where the obvious value we could return
4430 would regenerate to OP if converted to OP's type,
4431 but would not extend like OP to wider types.
4432 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4433 For example, if OP is (unsigned short)(signed char)-1,
4434 we avoid returning (signed char)-1 if FOR_TYPE is int,
4435 even though extending that to an unsigned short would regenerate OP,
4436 since the result of extending (signed char)-1 to (int)
4437 is different from (int) OP. */
4440 get_unwidened (tree op, tree for_type)
4442 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4443 tree type = TREE_TYPE (op);
4445 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4447 = (for_type != 0 && for_type != type
4448 && final_prec > TYPE_PRECISION (type)
4449 && TYPE_UNSIGNED (type));
4452 while (TREE_CODE (op) == NOP_EXPR)
4455 = TYPE_PRECISION (TREE_TYPE (op))
4456 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4458 /* Truncations are many-one so cannot be removed.
4459 Unless we are later going to truncate down even farther. */
4461 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4464 /* See what's inside this conversion. If we decide to strip it,
4466 op = TREE_OPERAND (op, 0);
4468 /* If we have not stripped any zero-extensions (uns is 0),
4469 we can strip any kind of extension.
4470 If we have previously stripped a zero-extension,
4471 only zero-extensions can safely be stripped.
4472 Any extension can be stripped if the bits it would produce
4473 are all going to be discarded later by truncating to FOR_TYPE. */
4477 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4479 /* TYPE_UNSIGNED says whether this is a zero-extension.
4480 Let's avoid computing it if it does not affect WIN
4481 and if UNS will not be needed again. */
4482 if ((uns || TREE_CODE (op) == NOP_EXPR)
4483 && TYPE_UNSIGNED (TREE_TYPE (op)))
4491 if (TREE_CODE (op) == COMPONENT_REF
4492 /* Since type_for_size always gives an integer type. */
4493 && TREE_CODE (type) != REAL_TYPE
4494 /* Don't crash if field not laid out yet. */
4495 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4496 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4498 unsigned int innerprec
4499 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4500 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4501 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4502 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4504 /* We can get this structure field in the narrowest type it fits in.
4505 If FOR_TYPE is 0, do this only for a field that matches the
4506 narrower type exactly and is aligned for it
4507 The resulting extension to its nominal type (a fullword type)
4508 must fit the same conditions as for other extensions. */
4511 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4512 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4513 && (! uns || final_prec <= innerprec || unsignedp))
4515 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4516 TREE_OPERAND (op, 1), NULL_TREE);
4517 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4518 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4525 /* Return OP or a simpler expression for a narrower value
4526 which can be sign-extended or zero-extended to give back OP.
4527 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4528 or 0 if the value should be sign-extended. */
4531 get_narrower (tree op, int *unsignedp_ptr)
4536 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
4538 while (TREE_CODE (op) == NOP_EXPR)
4541 = (TYPE_PRECISION (TREE_TYPE (op))
4542 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4544 /* Truncations are many-one so cannot be removed. */
4548 /* See what's inside this conversion. If we decide to strip it,
4553 op = TREE_OPERAND (op, 0);
4554 /* An extension: the outermost one can be stripped,
4555 but remember whether it is zero or sign extension. */
4557 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4558 /* Otherwise, if a sign extension has been stripped,
4559 only sign extensions can now be stripped;
4560 if a zero extension has been stripped, only zero-extensions. */
4561 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4565 else /* bitschange == 0 */
4567 /* A change in nominal type can always be stripped, but we must
4568 preserve the unsignedness. */
4570 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4572 op = TREE_OPERAND (op, 0);
4573 /* Keep trying to narrow, but don't assign op to win if it
4574 would turn an integral type into something else. */
4575 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
4582 if (TREE_CODE (op) == COMPONENT_REF
4583 /* Since type_for_size always gives an integer type. */
4584 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4585 /* Ensure field is laid out already. */
4586 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4587 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4589 unsigned HOST_WIDE_INT innerprec
4590 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4591 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4592 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4593 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4595 /* We can get this structure field in a narrower type that fits it,
4596 but the resulting extension to its nominal type (a fullword type)
4597 must satisfy the same conditions as for other extensions.
4599 Do this only for fields that are aligned (not bit-fields),
4600 because when bit-field insns will be used there is no
4601 advantage in doing this. */
4603 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4604 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4605 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
4609 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
4610 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4611 TREE_OPERAND (op, 1), NULL_TREE);
4612 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4613 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4616 *unsignedp_ptr = uns;
4620 /* Nonzero if integer constant C has a value that is permissible
4621 for type TYPE (an INTEGER_TYPE). */
4624 int_fits_type_p (tree c, tree type)
4626 tree type_low_bound = TYPE_MIN_VALUE (type);
4627 tree type_high_bound = TYPE_MAX_VALUE (type);
4628 int ok_for_low_bound, ok_for_high_bound;
4630 /* Perform some generic filtering first, which may allow making a decision
4631 even if the bounds are not constant. First, negative integers never fit
4632 in unsigned types, */
4633 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4634 /* Also, unsigned integers with top bit set never fit signed types. */
4635 || (! TYPE_UNSIGNED (type)
4636 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4639 /* If at least one bound of the type is a constant integer, we can check
4640 ourselves and maybe make a decision. If no such decision is possible, but
4641 this type is a subtype, try checking against that. Otherwise, use
4642 force_fit_type, which checks against the precision.
4644 Compute the status for each possibly constant bound, and return if we see
4645 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4646 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4647 for "constant known to fit". */
4649 ok_for_low_bound = -1;
4650 ok_for_high_bound = -1;
4652 /* Check if C >= type_low_bound. */
4653 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4655 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4656 if (! ok_for_low_bound)
4660 /* Check if c <= type_high_bound. */
4661 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4663 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4664 if (! ok_for_high_bound)
4668 /* If the constant fits both bounds, the result is known. */
4669 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4672 /* If we haven't been able to decide at this point, there nothing more we
4673 can check ourselves here. Look at the base type if we have one. */
4674 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4675 return int_fits_type_p (c, TREE_TYPE (type));
4677 /* Or to force_fit_type, if nothing else. */
4681 TREE_TYPE (c) = type;
4682 return !force_fit_type (c, 0);
4686 /* Subprogram of following function. Called by walk_tree.
4688 Return *TP if it is an automatic variable or parameter of the
4689 function passed in as DATA. */
4692 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
4694 tree fn = (tree) data;
4699 else if (DECL_P (*tp) && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
4705 /* Returns true if T is, contains, or refers to a type with variable
4706 size. If FN is nonzero, only return true if a modifier of the type
4707 or position of FN is a variable or parameter inside FN.
4709 This concept is more general than that of C99 'variably modified types':
4710 in C99, a struct type is never variably modified because a VLA may not
4711 appear as a structure member. However, in GNU C code like:
4713 struct S { int i[f()]; };
4715 is valid, and other languages may define similar constructs. */
4718 variably_modified_type_p (tree type, tree fn)
4722 /* Test if T is either variable (if FN is zero) or an expression containing
4723 a variable in FN. */
4724 #define RETURN_TRUE_IF_VAR(T) \
4725 do { tree _t = (T); \
4726 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4727 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4728 return true; } while (0)
4730 if (type == error_mark_node)
4733 /* If TYPE itself has variable size, it is variably modified.
4735 We do not yet have a representation of the C99 '[*]' syntax.
4736 When a representation is chosen, this function should be modified
4737 to test for that case as well. */
4738 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
4739 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type));
4741 switch (TREE_CODE (type))
4744 case REFERENCE_TYPE:
4748 if (variably_modified_type_p (TREE_TYPE (type), fn))
4754 /* If TYPE is a function type, it is variably modified if any of the
4755 parameters or the return type are variably modified. */
4756 if (variably_modified_type_p (TREE_TYPE (type), fn))
4759 for (t = TYPE_ARG_TYPES (type);
4760 t && t != void_list_node;
4762 if (variably_modified_type_p (TREE_VALUE (t), fn))
4771 /* Scalar types are variably modified if their end points
4773 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
4774 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
4779 case QUAL_UNION_TYPE:
4780 /* We can't see if any of the field are variably-modified by the
4781 definition we normally use, since that would produce infinite
4782 recursion via pointers. */
4783 /* This is variably modified if some field's type is. */
4784 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
4785 if (TREE_CODE (t) == FIELD_DECL)
4787 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
4788 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
4789 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
4791 if (TREE_CODE (type) == QUAL_UNION_TYPE)
4792 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
4800 /* The current language may have other cases to check, but in general,
4801 all other types are not variably modified. */
4802 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
4804 #undef RETURN_TRUE_IF_VAR
4807 /* Given a DECL or TYPE, return the scope in which it was declared, or
4808 NULL_TREE if there is no containing scope. */
4811 get_containing_scope (tree t)
4813 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4816 /* Return the innermost context enclosing DECL that is
4817 a FUNCTION_DECL, or zero if none. */
4820 decl_function_context (tree decl)
4824 if (TREE_CODE (decl) == ERROR_MARK)
4827 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4828 where we look up the function at runtime. Such functions always take
4829 a first argument of type 'pointer to real context'.
4831 C++ should really be fixed to use DECL_CONTEXT for the real context,
4832 and use something else for the "virtual context". */
4833 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4836 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4838 context = DECL_CONTEXT (decl);
4840 while (context && TREE_CODE (context) != FUNCTION_DECL)
4842 if (TREE_CODE (context) == BLOCK)
4843 context = BLOCK_SUPERCONTEXT (context);
4845 context = get_containing_scope (context);
4851 /* Return the innermost context enclosing DECL that is
4852 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4853 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4856 decl_type_context (tree decl)
4858 tree context = DECL_CONTEXT (decl);
4861 switch (TREE_CODE (context))
4863 case NAMESPACE_DECL:
4864 case TRANSLATION_UNIT_DECL:
4869 case QUAL_UNION_TYPE:
4874 context = DECL_CONTEXT (context);
4878 context = BLOCK_SUPERCONTEXT (context);
4888 /* CALL is a CALL_EXPR. Return the declaration for the function
4889 called, or NULL_TREE if the called function cannot be
4893 get_callee_fndecl (tree call)
4897 /* It's invalid to call this function with anything but a
4899 if (TREE_CODE (call) != CALL_EXPR)
4902 /* The first operand to the CALL is the address of the function
4904 addr = TREE_OPERAND (call, 0);
4908 /* If this is a readonly function pointer, extract its initial value. */
4909 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4910 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4911 && DECL_INITIAL (addr))
4912 addr = DECL_INITIAL (addr);
4914 /* If the address is just `&f' for some function `f', then we know
4915 that `f' is being called. */
4916 if (TREE_CODE (addr) == ADDR_EXPR
4917 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4918 return TREE_OPERAND (addr, 0);
4920 /* We couldn't figure out what was being called. Maybe the front
4921 end has some idea. */
4922 return lang_hooks.lang_get_callee_fndecl (call);
4925 /* Print debugging information about tree nodes generated during the compile,
4926 and any language-specific information. */
4929 dump_tree_statistics (void)
4931 #ifdef GATHER_STATISTICS
4933 int total_nodes, total_bytes;
4936 fprintf (stderr, "\n??? tree nodes created\n\n");
4937 #ifdef GATHER_STATISTICS
4938 fprintf (stderr, "Kind Nodes Bytes\n");
4939 fprintf (stderr, "---------------------------------------\n");
4940 total_nodes = total_bytes = 0;
4941 for (i = 0; i < (int) all_kinds; i++)
4943 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
4944 tree_node_counts[i], tree_node_sizes[i]);
4945 total_nodes += tree_node_counts[i];
4946 total_bytes += tree_node_sizes[i];
4948 fprintf (stderr, "---------------------------------------\n");
4949 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
4950 fprintf (stderr, "---------------------------------------\n");
4951 ssanames_print_statistics ();
4952 phinodes_print_statistics ();
4954 fprintf (stderr, "(No per-node statistics)\n");
4956 print_type_hash_statistics ();
4957 lang_hooks.print_statistics ();
4960 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4962 /* Generate a crc32 of a string. */
4965 crc32_string (unsigned chksum, const char *string)
4969 unsigned value = *string << 24;
4972 for (ix = 8; ix--; value <<= 1)
4976 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
4985 /* P is a string that will be used in a symbol. Mask out any characters
4986 that are not valid in that context. */
4989 clean_symbol_name (char *p)
4993 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4996 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5003 /* Generate a name for a function unique to this translation unit.
5004 TYPE is some string to identify the purpose of this function to the
5005 linker or collect2. */
5008 get_file_function_name_long (const char *type)
5014 if (first_global_object_name)
5015 p = first_global_object_name;
5018 /* We don't have anything that we know to be unique to this translation
5019 unit, so use what we do have and throw in some randomness. */
5021 const char *name = weak_global_object_name;
5022 const char *file = main_input_filename;
5027 file = input_filename;
5029 len = strlen (file);
5030 q = alloca (9 * 2 + len + 1);
5031 memcpy (q, file, len + 1);
5032 clean_symbol_name (q);
5034 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
5035 crc32_string (0, flag_random_seed));
5040 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
5042 /* Set up the name of the file-level functions we may need.
5043 Use a global object (which is already required to be unique over
5044 the program) rather than the file name (which imposes extra
5046 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5048 return get_identifier (buf);
5051 /* If KIND=='I', return a suitable global initializer (constructor) name.
5052 If KIND=='D', return a suitable global clean-up (destructor) name. */
5055 get_file_function_name (int kind)
5062 return get_file_function_name_long (p);
5065 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5066 The result is placed in BUFFER (which has length BIT_SIZE),
5067 with one bit in each char ('\000' or '\001').
5069 If the constructor is constant, NULL_TREE is returned.
5070 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5073 get_set_constructor_bits (tree init, char *buffer, int bit_size)
5077 HOST_WIDE_INT domain_min
5078 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
5079 tree non_const_bits = NULL_TREE;
5081 for (i = 0; i < bit_size; i++)
5084 for (vals = TREE_OPERAND (init, 1);
5085 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5087 if (!host_integerp (TREE_VALUE (vals), 0)
5088 || (TREE_PURPOSE (vals) != NULL_TREE
5089 && !host_integerp (TREE_PURPOSE (vals), 0)))
5091 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5092 else if (TREE_PURPOSE (vals) != NULL_TREE)
5094 /* Set a range of bits to ones. */
5095 HOST_WIDE_INT lo_index
5096 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
5097 HOST_WIDE_INT hi_index
5098 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5100 if (lo_index < 0 || lo_index >= bit_size
5101 || hi_index < 0 || hi_index >= bit_size)
5103 for (; lo_index <= hi_index; lo_index++)
5104 buffer[lo_index] = 1;
5108 /* Set a single bit to one. */
5110 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5111 if (index < 0 || index >= bit_size)
5113 error ("invalid initializer for bit string");
5119 return non_const_bits;
5122 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5123 The result is placed in BUFFER (which is an array of bytes).
5124 If the constructor is constant, NULL_TREE is returned.
5125 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5128 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
5131 int set_word_size = BITS_PER_UNIT;
5132 int bit_size = wd_size * set_word_size;
5134 unsigned char *bytep = buffer;
5135 char *bit_buffer = alloca (bit_size);
5136 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5138 for (i = 0; i < wd_size; i++)
5141 for (i = 0; i < bit_size; i++)
5145 if (BYTES_BIG_ENDIAN)
5146 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5148 *bytep |= 1 << bit_pos;
5151 if (bit_pos >= set_word_size)
5152 bit_pos = 0, bytep++;
5154 return non_const_bits;
5157 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5159 /* Complain that the tree code of NODE does not match the expected 0
5160 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5164 tree_check_failed (const tree node, const char *file,
5165 int line, const char *function, ...)
5169 unsigned length = 0;
5172 va_start (args, function);
5173 while ((code = va_arg (args, int)))
5174 length += 4 + strlen (tree_code_name[code]);
5176 va_start (args, function);
5177 buffer = alloca (length);
5179 while ((code = va_arg (args, int)))
5183 strcpy (buffer + length, " or ");
5186 strcpy (buffer + length, tree_code_name[code]);
5187 length += strlen (tree_code_name[code]);
5191 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5192 buffer, tree_code_name[TREE_CODE (node)],
5193 function, trim_filename (file), line);
5196 /* Complain that the tree code of NODE does match the expected 0
5197 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5201 tree_not_check_failed (const tree node, const char *file,
5202 int line, const char *function, ...)
5206 unsigned length = 0;
5209 va_start (args, function);
5210 while ((code = va_arg (args, int)))
5211 length += 4 + strlen (tree_code_name[code]);
5213 va_start (args, function);
5214 buffer = alloca (length);
5216 while ((code = va_arg (args, int)))
5220 strcpy (buffer + length, " or ");
5223 strcpy (buffer + length, tree_code_name[code]);
5224 length += strlen (tree_code_name[code]);
5228 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5229 buffer, tree_code_name[TREE_CODE (node)],
5230 function, trim_filename (file), line);
5233 /* Similar to tree_check_failed, except that we check for a class of tree
5234 code, given in CL. */
5237 tree_class_check_failed (const tree node, int cl, const char *file,
5238 int line, const char *function)
5241 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5242 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5243 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5246 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5247 (dynamically sized) vector. */
5250 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5251 const char *function)
5254 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5255 idx + 1, len, function, trim_filename (file), line);
5258 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5259 (dynamically sized) vector. */
5262 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5263 const char *function)
5266 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5267 idx + 1, len, function, trim_filename (file), line);
5270 /* Similar to above, except that the check is for the bounds of the operand
5271 vector of an expression node. */
5274 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5275 int line, const char *function)
5278 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5279 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5280 function, trim_filename (file), line);
5282 #endif /* ENABLE_TREE_CHECKING */
5284 /* For a new vector type node T, build the information necessary for
5285 debugging output. */
5288 finish_vector_type (tree t)
5293 tree index = build_int_2 (TYPE_VECTOR_SUBPARTS (t) - 1, 0);
5294 tree array = build_array_type (TREE_TYPE (t),
5295 build_index_type (index));
5296 tree rt = make_node (RECORD_TYPE);
5298 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5299 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5301 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5302 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5303 the representation type, and we want to find that die when looking up
5304 the vector type. This is most easily achieved by making the TYPE_UID
5306 TYPE_UID (rt) = TYPE_UID (t);
5311 make_or_reuse_type (unsigned size, int unsignedp)
5313 if (size == INT_TYPE_SIZE)
5314 return unsignedp ? unsigned_type_node : integer_type_node;
5315 if (size == CHAR_TYPE_SIZE)
5316 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5317 if (size == SHORT_TYPE_SIZE)
5318 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5319 if (size == LONG_TYPE_SIZE)
5320 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5321 if (size == LONG_LONG_TYPE_SIZE)
5322 return (unsignedp ? long_long_unsigned_type_node
5323 : long_long_integer_type_node);
5326 return make_unsigned_type (size);
5328 return make_signed_type (size);
5331 /* Create nodes for all integer types (and error_mark_node) using the sizes
5332 of C datatypes. The caller should call set_sizetype soon after calling
5333 this function to select one of the types as sizetype. */
5336 build_common_tree_nodes (int signed_char)
5338 error_mark_node = make_node (ERROR_MARK);
5339 TREE_TYPE (error_mark_node) = error_mark_node;
5341 initialize_sizetypes ();
5343 /* Define both `signed char' and `unsigned char'. */
5344 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5345 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5347 /* Define `char', which is like either `signed char' or `unsigned char'
5348 but not the same as either. */
5351 ? make_signed_type (CHAR_TYPE_SIZE)
5352 : make_unsigned_type (CHAR_TYPE_SIZE));
5354 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5355 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5356 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5357 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5358 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5359 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5360 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5361 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5363 /* Define a boolean type. This type only represents boolean values but
5364 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5365 Front ends which want to override this size (i.e. Java) can redefine
5366 boolean_type_node before calling build_common_tree_nodes_2. */
5367 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5368 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5369 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
5370 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
5371 TYPE_PRECISION (boolean_type_node) = 1;
5373 /* Fill in the rest of the sized types. Reuse existing type nodes
5375 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
5376 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
5377 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
5378 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
5379 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
5381 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
5382 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
5383 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
5384 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
5385 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
5387 access_public_node = get_identifier ("public");
5388 access_protected_node = get_identifier ("protected");
5389 access_private_node = get_identifier ("private");
5392 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5393 It will create several other common tree nodes. */
5396 build_common_tree_nodes_2 (int short_double)
5398 /* Define these next since types below may used them. */
5399 integer_zero_node = build_int_2 (0, 0);
5400 integer_one_node = build_int_2 (1, 0);
5401 integer_minus_one_node = build_int_2 (-1, -1);
5403 size_zero_node = size_int (0);
5404 size_one_node = size_int (1);
5405 bitsize_zero_node = bitsize_int (0);
5406 bitsize_one_node = bitsize_int (1);
5407 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5409 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5410 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5412 void_type_node = make_node (VOID_TYPE);
5413 layout_type (void_type_node);
5415 /* We are not going to have real types in C with less than byte alignment,
5416 so we might as well not have any types that claim to have it. */
5417 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5418 TYPE_USER_ALIGN (void_type_node) = 0;
5420 null_pointer_node = build_int_2 (0, 0);
5421 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5422 layout_type (TREE_TYPE (null_pointer_node));
5424 ptr_type_node = build_pointer_type (void_type_node);
5426 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5427 fileptr_type_node = ptr_type_node;
5429 float_type_node = make_node (REAL_TYPE);
5430 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5431 layout_type (float_type_node);
5433 double_type_node = make_node (REAL_TYPE);
5435 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5437 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5438 layout_type (double_type_node);
5440 long_double_type_node = make_node (REAL_TYPE);
5441 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5442 layout_type (long_double_type_node);
5444 float_ptr_type_node = build_pointer_type (float_type_node);
5445 double_ptr_type_node = build_pointer_type (double_type_node);
5446 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5447 integer_ptr_type_node = build_pointer_type (integer_type_node);
5449 complex_integer_type_node = make_node (COMPLEX_TYPE);
5450 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5451 layout_type (complex_integer_type_node);
5453 complex_float_type_node = make_node (COMPLEX_TYPE);
5454 TREE_TYPE (complex_float_type_node) = float_type_node;
5455 layout_type (complex_float_type_node);
5457 complex_double_type_node = make_node (COMPLEX_TYPE);
5458 TREE_TYPE (complex_double_type_node) = double_type_node;
5459 layout_type (complex_double_type_node);
5461 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5462 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5463 layout_type (complex_long_double_type_node);
5466 tree t = targetm.build_builtin_va_list ();
5468 /* Many back-ends define record types without setting TYPE_NAME.
5469 If we copied the record type here, we'd keep the original
5470 record type without a name. This breaks name mangling. So,
5471 don't copy record types and let c_common_nodes_and_builtins()
5472 declare the type to be __builtin_va_list. */
5473 if (TREE_CODE (t) != RECORD_TYPE)
5474 t = build_type_copy (t);
5476 va_list_type_node = t;
5480 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5483 If we requested a pointer to a vector, build up the pointers that
5484 we stripped off while looking for the inner type. Similarly for
5485 return values from functions.
5487 The argument TYPE is the top of the chain, and BOTTOM is the
5488 new type which we will point to. */
5491 reconstruct_complex_type (tree type, tree bottom)
5495 if (POINTER_TYPE_P (type))
5497 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5498 outer = build_pointer_type (inner);
5500 else if (TREE_CODE (type) == ARRAY_TYPE)
5502 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5503 outer = build_array_type (inner, TYPE_DOMAIN (type));
5505 else if (TREE_CODE (type) == FUNCTION_TYPE)
5507 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5508 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5510 else if (TREE_CODE (type) == METHOD_TYPE)
5512 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5513 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5515 TYPE_ARG_TYPES (type));
5520 TYPE_READONLY (outer) = TYPE_READONLY (type);
5521 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
5526 /* Returns a vector tree node given a vector mode and inner type. */
5528 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5531 t = make_node (VECTOR_TYPE);
5532 TREE_TYPE (t) = innertype;
5533 TYPE_MODE (t) = mode;
5534 finish_vector_type (t);
5538 /* Similarly, but takes inner type and units. */
5541 build_vector_type (tree innertype, int nunits)
5543 enum machine_mode innermode = TYPE_MODE (innertype);
5544 enum machine_mode mode;
5546 if (GET_MODE_CLASS (innermode) == MODE_FLOAT)
5547 mode = MIN_MODE_VECTOR_FLOAT;
5549 mode = MIN_MODE_VECTOR_INT;
5551 for (; mode != VOIDmode ; mode = GET_MODE_WIDER_MODE (mode))
5552 if (GET_MODE_NUNITS (mode) == nunits && GET_MODE_INNER (mode) == innermode)
5553 return build_vector_type_for_mode (innertype, mode);
5558 /* Given an initializer INIT, return TRUE if INIT is zero or some
5559 aggregate of zeros. Otherwise return FALSE. */
5561 initializer_zerop (tree init)
5567 switch (TREE_CODE (init))
5570 return integer_zerop (init);
5573 /* ??? Note that this is not correct for C4X float formats. There,
5574 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5575 negative exponent. */
5576 return real_zerop (init)
5577 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5580 return integer_zerop (init)
5581 || (real_zerop (init)
5582 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5583 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5586 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
5587 if (!initializer_zerop (TREE_VALUE (elt)))
5592 elt = CONSTRUCTOR_ELTS (init);
5593 if (elt == NULL_TREE)
5596 /* A set is empty only if it has no elements. */
5597 if (TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5600 for (; elt ; elt = TREE_CHAIN (elt))
5601 if (! initializer_zerop (TREE_VALUE (elt)))
5611 add_var_to_bind_expr (tree bind_expr, tree var)
5613 BIND_EXPR_VARS (bind_expr)
5614 = chainon (BIND_EXPR_VARS (bind_expr), var);
5615 if (BIND_EXPR_BLOCK (bind_expr))
5616 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
5617 = BIND_EXPR_VARS (bind_expr);
5620 /* Build an empty statement. */
5623 build_empty_stmt (void)
5625 return build1 (NOP_EXPR, void_type_node, size_zero_node);
5629 /* Returns true if it is possible to prove that the index of
5630 an array access REF (an ARRAY_REF expression) falls into the
5634 in_array_bounds_p (tree ref)
5636 tree idx = TREE_OPERAND (ref, 1);
5639 if (TREE_CODE (idx) != INTEGER_CST)
5642 min = array_ref_low_bound (ref);
5643 max = array_ref_up_bound (ref);
5646 || TREE_CODE (min) != INTEGER_CST
5647 || TREE_CODE (max) != INTEGER_CST)
5650 if (tree_int_cst_lt (idx, min)
5651 || tree_int_cst_lt (max, idx))
5657 /* Return true if T (assumed to be a DECL) must be assigned a memory
5661 needs_to_live_in_memory (tree t)
5663 return (DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL (t)
5665 || DECL_EXTERNAL (t)
5666 || DECL_NONLOCAL (t)
5667 || (TREE_CODE (t) == RESULT_DECL
5668 && aggregate_value_p (t, current_function_decl))
5669 || decl_function_context (t) != current_function_decl);
5672 /* There are situations in which a language considers record types
5673 compatible which have different field lists. Decide if two fields
5674 are compatible. It is assumed that the parent records are compatible. */
5677 fields_compatible_p (tree f1, tree f2)
5679 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
5680 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
5683 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
5684 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
5687 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
5693 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5696 find_compatible_field (tree record, tree orig_field)
5700 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
5701 if (TREE_CODE (f) == FIELD_DECL
5702 && fields_compatible_p (f, orig_field))
5705 /* ??? Why isn't this on the main fields list? */
5706 f = TYPE_VFIELD (record);
5707 if (f && TREE_CODE (f) == FIELD_DECL
5708 && fields_compatible_p (f, orig_field))
5711 /* ??? We should abort here, but Java appears to do Bad Things
5712 with inherited fields. */
5716 /* Return value of a constant X. */
5719 int_cst_value (tree x)
5721 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
5722 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
5723 bool negative = ((val >> (bits - 1)) & 1) != 0;
5725 if (bits > HOST_BITS_PER_WIDE_INT)
5729 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
5731 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
5736 /* Returns the greatest common divisor of A and B, which must be
5740 tree_fold_gcd (tree a, tree b)
5743 tree type = TREE_TYPE (a);
5745 #if defined ENABLE_CHECKING
5746 if (TREE_CODE (a) != INTEGER_CST
5747 || TREE_CODE (b) != INTEGER_CST)
5751 if (integer_zerop (a))
5754 if (integer_zerop (b))
5757 if (tree_int_cst_sgn (a) == -1)
5758 a = fold (build (MULT_EXPR, type, a,
5759 convert (type, integer_minus_one_node)));
5761 if (tree_int_cst_sgn (b) == -1)
5762 b = fold (build (MULT_EXPR, type, b,
5763 convert (type, integer_minus_one_node)));
5767 a_mod_b = fold (build (CEIL_MOD_EXPR, type, a, b));
5769 if (!TREE_INT_CST_LOW (a_mod_b)
5770 && !TREE_INT_CST_HIGH (a_mod_b))
5778 #include "gt-tree.h"