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 tree make_vector_type (tree, int, enum machine_mode);
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'. */
428 build_int_2 (unsigned HOST_WIDE_INT low, HOST_WIDE_INT hi)
430 tree t = make_node (INTEGER_CST);
432 TREE_INT_CST_LOW (t) = low;
433 TREE_INT_CST_HIGH (t) = hi;
434 TREE_TYPE (t) = integer_type_node;
438 /* Return a new VECTOR_CST node whose type is TYPE and whose values
439 are in a list pointed by VALS. */
442 build_vector (tree type, tree vals)
444 tree v = make_node (VECTOR_CST);
445 int over1 = 0, over2 = 0;
448 TREE_VECTOR_CST_ELTS (v) = vals;
449 TREE_TYPE (v) = type;
451 /* Iterate through elements and check for overflow. */
452 for (link = vals; link; link = TREE_CHAIN (link))
454 tree value = TREE_VALUE (link);
456 over1 |= TREE_OVERFLOW (value);
457 over2 |= TREE_CONSTANT_OVERFLOW (value);
460 TREE_OVERFLOW (v) = over1;
461 TREE_CONSTANT_OVERFLOW (v) = over2;
466 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
467 are in a list pointed to by VALS. */
469 build_constructor (tree type, tree vals)
471 tree c = make_node (CONSTRUCTOR);
472 TREE_TYPE (c) = type;
473 CONSTRUCTOR_ELTS (c) = vals;
475 /* ??? May not be necessary. Mirrors what build does. */
478 TREE_SIDE_EFFECTS (c) = TREE_SIDE_EFFECTS (vals);
479 TREE_READONLY (c) = TREE_READONLY (vals);
480 TREE_CONSTANT (c) = TREE_CONSTANT (vals);
481 TREE_INVARIANT (c) = TREE_INVARIANT (vals);
487 /* Return a new REAL_CST node whose type is TYPE and value is D. */
490 build_real (tree type, REAL_VALUE_TYPE d)
496 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
497 Consider doing it via real_convert now. */
499 v = make_node (REAL_CST);
500 dp = ggc_alloc (sizeof (REAL_VALUE_TYPE));
501 memcpy (dp, &d, sizeof (REAL_VALUE_TYPE));
503 TREE_TYPE (v) = type;
504 TREE_REAL_CST_PTR (v) = dp;
505 TREE_OVERFLOW (v) = TREE_CONSTANT_OVERFLOW (v) = overflow;
509 /* Return a new REAL_CST node whose type is TYPE
510 and whose value is the integer value of the INTEGER_CST node I. */
513 real_value_from_int_cst (tree type, tree i)
517 /* Clear all bits of the real value type so that we can later do
518 bitwise comparisons to see if two values are the same. */
519 memset (&d, 0, sizeof d);
521 real_from_integer (&d, type ? TYPE_MODE (type) : VOIDmode,
522 TREE_INT_CST_LOW (i), TREE_INT_CST_HIGH (i),
523 TYPE_UNSIGNED (TREE_TYPE (i)));
527 /* Given a tree representing an integer constant I, return a tree
528 representing the same value as a floating-point constant of type TYPE. */
531 build_real_from_int_cst (tree type, tree i)
534 int overflow = TREE_OVERFLOW (i);
536 v = build_real (type, real_value_from_int_cst (type, i));
538 TREE_OVERFLOW (v) |= overflow;
539 TREE_CONSTANT_OVERFLOW (v) |= overflow;
543 /* Return a newly constructed STRING_CST node whose value is
544 the LEN characters at STR.
545 The TREE_TYPE is not initialized. */
548 build_string (int len, const char *str)
550 tree s = make_node (STRING_CST);
552 TREE_STRING_LENGTH (s) = len;
553 TREE_STRING_POINTER (s) = ggc_alloc_string (str, len);
558 /* Return a newly constructed COMPLEX_CST node whose value is
559 specified by the real and imaginary parts REAL and IMAG.
560 Both REAL and IMAG should be constant nodes. TYPE, if specified,
561 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
564 build_complex (tree type, tree real, tree imag)
566 tree t = make_node (COMPLEX_CST);
568 TREE_REALPART (t) = real;
569 TREE_IMAGPART (t) = imag;
570 TREE_TYPE (t) = type ? type : build_complex_type (TREE_TYPE (real));
571 TREE_OVERFLOW (t) = TREE_OVERFLOW (real) | TREE_OVERFLOW (imag);
572 TREE_CONSTANT_OVERFLOW (t)
573 = TREE_CONSTANT_OVERFLOW (real) | TREE_CONSTANT_OVERFLOW (imag);
577 /* Build a BINFO with LEN language slots. */
580 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL)
583 size_t length = (offsetof (struct tree_binfo, base_binfos)
584 + VEC_embedded_size (tree, base_binfos));
586 #ifdef GATHER_STATISTICS
587 tree_node_counts[(int) binfo_kind]++;
588 tree_node_sizes[(int) binfo_kind] += length;
591 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
593 memset (t, 0, offsetof (struct tree_binfo, base_binfos));
595 TREE_SET_CODE (t, TREE_BINFO);
597 VEC_embedded_init (tree, BINFO_BASE_BINFOS (t), base_binfos);
603 /* Build a newly constructed TREE_VEC node of length LEN. */
606 make_tree_vec_stat (int len MEM_STAT_DECL)
609 int length = (len - 1) * sizeof (tree) + sizeof (struct tree_vec);
611 #ifdef GATHER_STATISTICS
612 tree_node_counts[(int) vec_kind]++;
613 tree_node_sizes[(int) vec_kind] += length;
616 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
618 memset (t, 0, length);
620 TREE_SET_CODE (t, TREE_VEC);
621 TREE_VEC_LENGTH (t) = len;
626 /* Return 1 if EXPR is the integer constant zero or a complex constant
630 integer_zerop (tree expr)
634 return ((TREE_CODE (expr) == INTEGER_CST
635 && ! TREE_CONSTANT_OVERFLOW (expr)
636 && TREE_INT_CST_LOW (expr) == 0
637 && TREE_INT_CST_HIGH (expr) == 0)
638 || (TREE_CODE (expr) == COMPLEX_CST
639 && integer_zerop (TREE_REALPART (expr))
640 && integer_zerop (TREE_IMAGPART (expr))));
643 /* Return 1 if EXPR is the integer constant one or the corresponding
647 integer_onep (tree expr)
651 return ((TREE_CODE (expr) == INTEGER_CST
652 && ! TREE_CONSTANT_OVERFLOW (expr)
653 && TREE_INT_CST_LOW (expr) == 1
654 && TREE_INT_CST_HIGH (expr) == 0)
655 || (TREE_CODE (expr) == COMPLEX_CST
656 && integer_onep (TREE_REALPART (expr))
657 && integer_zerop (TREE_IMAGPART (expr))));
660 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
661 it contains. Likewise for the corresponding complex constant. */
664 integer_all_onesp (tree expr)
671 if (TREE_CODE (expr) == COMPLEX_CST
672 && integer_all_onesp (TREE_REALPART (expr))
673 && integer_zerop (TREE_IMAGPART (expr)))
676 else if (TREE_CODE (expr) != INTEGER_CST
677 || TREE_CONSTANT_OVERFLOW (expr))
680 uns = TYPE_UNSIGNED (TREE_TYPE (expr));
682 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
683 && TREE_INT_CST_HIGH (expr) == -1);
685 /* Note that using TYPE_PRECISION here is wrong. We care about the
686 actual bits, not the (arbitrary) range of the type. */
687 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr)));
688 if (prec >= HOST_BITS_PER_WIDE_INT)
690 HOST_WIDE_INT high_value;
693 shift_amount = prec - HOST_BITS_PER_WIDE_INT;
695 if (shift_amount > HOST_BITS_PER_WIDE_INT)
696 /* Can not handle precisions greater than twice the host int size. */
698 else if (shift_amount == HOST_BITS_PER_WIDE_INT)
699 /* Shifting by the host word size is undefined according to the ANSI
700 standard, so we must handle this as a special case. */
703 high_value = ((HOST_WIDE_INT) 1 << shift_amount) - 1;
705 return (TREE_INT_CST_LOW (expr) == ~(unsigned HOST_WIDE_INT) 0
706 && TREE_INT_CST_HIGH (expr) == high_value);
709 return TREE_INT_CST_LOW (expr) == ((unsigned HOST_WIDE_INT) 1 << prec) - 1;
712 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
716 integer_pow2p (tree expr)
719 HOST_WIDE_INT high, low;
723 if (TREE_CODE (expr) == COMPLEX_CST
724 && integer_pow2p (TREE_REALPART (expr))
725 && integer_zerop (TREE_IMAGPART (expr)))
728 if (TREE_CODE (expr) != INTEGER_CST || TREE_CONSTANT_OVERFLOW (expr))
731 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
732 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
733 high = TREE_INT_CST_HIGH (expr);
734 low = TREE_INT_CST_LOW (expr);
736 /* First clear all bits that are beyond the type's precision in case
737 we've been sign extended. */
739 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
741 else if (prec > HOST_BITS_PER_WIDE_INT)
742 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
746 if (prec < HOST_BITS_PER_WIDE_INT)
747 low &= ~((HOST_WIDE_INT) (-1) << prec);
750 if (high == 0 && low == 0)
753 return ((high == 0 && (low & (low - 1)) == 0)
754 || (low == 0 && (high & (high - 1)) == 0));
757 /* Return 1 if EXPR is an integer constant other than zero or a
758 complex constant other than zero. */
761 integer_nonzerop (tree expr)
765 return ((TREE_CODE (expr) == INTEGER_CST
766 && ! TREE_CONSTANT_OVERFLOW (expr)
767 && (TREE_INT_CST_LOW (expr) != 0
768 || TREE_INT_CST_HIGH (expr) != 0))
769 || (TREE_CODE (expr) == COMPLEX_CST
770 && (integer_nonzerop (TREE_REALPART (expr))
771 || integer_nonzerop (TREE_IMAGPART (expr)))));
774 /* Return the power of two represented by a tree node known to be a
778 tree_log2 (tree expr)
781 HOST_WIDE_INT high, low;
785 if (TREE_CODE (expr) == COMPLEX_CST)
786 return tree_log2 (TREE_REALPART (expr));
788 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
789 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
791 high = TREE_INT_CST_HIGH (expr);
792 low = TREE_INT_CST_LOW (expr);
794 /* First clear all bits that are beyond the type's precision in case
795 we've been sign extended. */
797 if (prec == 2 * HOST_BITS_PER_WIDE_INT)
799 else if (prec > HOST_BITS_PER_WIDE_INT)
800 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
804 if (prec < HOST_BITS_PER_WIDE_INT)
805 low &= ~((HOST_WIDE_INT) (-1) << prec);
808 return (high != 0 ? HOST_BITS_PER_WIDE_INT + exact_log2 (high)
812 /* Similar, but return the largest integer Y such that 2 ** Y is less
813 than or equal to EXPR. */
816 tree_floor_log2 (tree expr)
819 HOST_WIDE_INT high, low;
823 if (TREE_CODE (expr) == COMPLEX_CST)
824 return tree_log2 (TREE_REALPART (expr));
826 prec = (POINTER_TYPE_P (TREE_TYPE (expr))
827 ? POINTER_SIZE : TYPE_PRECISION (TREE_TYPE (expr)));
829 high = TREE_INT_CST_HIGH (expr);
830 low = TREE_INT_CST_LOW (expr);
832 /* First clear all bits that are beyond the type's precision in case
833 we've been sign extended. Ignore if type's precision hasn't been set
834 since what we are doing is setting it. */
836 if (prec == 2 * HOST_BITS_PER_WIDE_INT || prec == 0)
838 else if (prec > HOST_BITS_PER_WIDE_INT)
839 high &= ~((HOST_WIDE_INT) (-1) << (prec - HOST_BITS_PER_WIDE_INT));
843 if (prec < HOST_BITS_PER_WIDE_INT)
844 low &= ~((HOST_WIDE_INT) (-1) << prec);
847 return (high != 0 ? HOST_BITS_PER_WIDE_INT + floor_log2 (high)
851 /* Return 1 if EXPR is the real constant zero. */
854 real_zerop (tree expr)
858 return ((TREE_CODE (expr) == REAL_CST
859 && ! TREE_CONSTANT_OVERFLOW (expr)
860 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst0))
861 || (TREE_CODE (expr) == COMPLEX_CST
862 && real_zerop (TREE_REALPART (expr))
863 && real_zerop (TREE_IMAGPART (expr))));
866 /* Return 1 if EXPR is the real constant one in real or complex form. */
869 real_onep (tree expr)
873 return ((TREE_CODE (expr) == REAL_CST
874 && ! TREE_CONSTANT_OVERFLOW (expr)
875 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst1))
876 || (TREE_CODE (expr) == COMPLEX_CST
877 && real_onep (TREE_REALPART (expr))
878 && real_zerop (TREE_IMAGPART (expr))));
881 /* Return 1 if EXPR is the real constant two. */
884 real_twop (tree expr)
888 return ((TREE_CODE (expr) == REAL_CST
889 && ! TREE_CONSTANT_OVERFLOW (expr)
890 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconst2))
891 || (TREE_CODE (expr) == COMPLEX_CST
892 && real_twop (TREE_REALPART (expr))
893 && real_zerop (TREE_IMAGPART (expr))));
896 /* Return 1 if EXPR is the real constant minus one. */
899 real_minus_onep (tree expr)
903 return ((TREE_CODE (expr) == REAL_CST
904 && ! TREE_CONSTANT_OVERFLOW (expr)
905 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr), dconstm1))
906 || (TREE_CODE (expr) == COMPLEX_CST
907 && real_minus_onep (TREE_REALPART (expr))
908 && real_zerop (TREE_IMAGPART (expr))));
911 /* Nonzero if EXP is a constant or a cast of a constant. */
914 really_constant_p (tree exp)
916 /* This is not quite the same as STRIP_NOPS. It does more. */
917 while (TREE_CODE (exp) == NOP_EXPR
918 || TREE_CODE (exp) == CONVERT_EXPR
919 || TREE_CODE (exp) == NON_LVALUE_EXPR)
920 exp = TREE_OPERAND (exp, 0);
921 return TREE_CONSTANT (exp);
924 /* Return first list element whose TREE_VALUE is ELEM.
925 Return 0 if ELEM is not in LIST. */
928 value_member (tree elem, tree list)
932 if (elem == TREE_VALUE (list))
934 list = TREE_CHAIN (list);
939 /* Return first list element whose TREE_PURPOSE is ELEM.
940 Return 0 if ELEM is not in LIST. */
943 purpose_member (tree elem, tree list)
947 if (elem == TREE_PURPOSE (list))
949 list = TREE_CHAIN (list);
954 /* Return nonzero if ELEM is part of the chain CHAIN. */
957 chain_member (tree elem, tree chain)
963 chain = TREE_CHAIN (chain);
969 /* Return the length of a chain of nodes chained through TREE_CHAIN.
970 We expect a null pointer to mark the end of the chain.
971 This is the Lisp primitive `length'. */
977 #ifdef ENABLE_TREE_CHECKING
985 #ifdef ENABLE_TREE_CHECKING
997 /* Returns the number of FIELD_DECLs in TYPE. */
1000 fields_length (tree type)
1002 tree t = TYPE_FIELDS (type);
1005 for (; t; t = TREE_CHAIN (t))
1006 if (TREE_CODE (t) == FIELD_DECL)
1012 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1013 by modifying the last node in chain 1 to point to chain 2.
1014 This is the Lisp primitive `nconc'. */
1017 chainon (tree op1, tree op2)
1026 for (t1 = op1; TREE_CHAIN (t1); t1 = TREE_CHAIN (t1))
1028 TREE_CHAIN (t1) = op2;
1030 #ifdef ENABLE_TREE_CHECKING
1033 for (t2 = op2; t2; t2 = TREE_CHAIN (t2))
1035 abort (); /* Circularity created. */
1042 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1045 tree_last (tree chain)
1049 while ((next = TREE_CHAIN (chain)))
1054 /* Reverse the order of elements in the chain T,
1055 and return the new head of the chain (old last element). */
1060 tree prev = 0, decl, next;
1061 for (decl = t; decl; decl = next)
1063 next = TREE_CHAIN (decl);
1064 TREE_CHAIN (decl) = prev;
1070 /* Return a newly created TREE_LIST node whose
1071 purpose and value fields are PARM and VALUE. */
1074 build_tree_list_stat (tree parm, tree value MEM_STAT_DECL)
1076 tree t = make_node_stat (TREE_LIST PASS_MEM_STAT);
1077 TREE_PURPOSE (t) = parm;
1078 TREE_VALUE (t) = value;
1082 /* Return a newly created TREE_LIST node whose
1083 purpose and value fields are PURPOSE and VALUE
1084 and whose TREE_CHAIN is CHAIN. */
1087 tree_cons_stat (tree purpose, tree value, tree chain MEM_STAT_DECL)
1091 node = ggc_alloc_zone_stat (sizeof (struct tree_list),
1092 tree_zone PASS_MEM_STAT);
1094 memset (node, 0, sizeof (struct tree_common));
1096 #ifdef GATHER_STATISTICS
1097 tree_node_counts[(int) x_kind]++;
1098 tree_node_sizes[(int) x_kind] += sizeof (struct tree_list);
1101 TREE_SET_CODE (node, TREE_LIST);
1102 TREE_CHAIN (node) = chain;
1103 TREE_PURPOSE (node) = purpose;
1104 TREE_VALUE (node) = value;
1109 /* Return the size nominally occupied by an object of type TYPE
1110 when it resides in memory. The value is measured in units of bytes,
1111 and its data type is that normally used for type sizes
1112 (which is the first type created by make_signed_type or
1113 make_unsigned_type). */
1116 size_in_bytes (tree type)
1120 if (type == error_mark_node)
1121 return integer_zero_node;
1123 type = TYPE_MAIN_VARIANT (type);
1124 t = TYPE_SIZE_UNIT (type);
1128 lang_hooks.types.incomplete_type_error (NULL_TREE, type);
1129 return size_zero_node;
1132 if (TREE_CODE (t) == INTEGER_CST)
1133 force_fit_type (t, 0);
1138 /* Return the size of TYPE (in bytes) as a wide integer
1139 or return -1 if the size can vary or is larger than an integer. */
1142 int_size_in_bytes (tree type)
1146 if (type == error_mark_node)
1149 type = TYPE_MAIN_VARIANT (type);
1150 t = TYPE_SIZE_UNIT (type);
1152 || TREE_CODE (t) != INTEGER_CST
1153 || TREE_OVERFLOW (t)
1154 || TREE_INT_CST_HIGH (t) != 0
1155 /* If the result would appear negative, it's too big to represent. */
1156 || (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0)
1159 return TREE_INT_CST_LOW (t);
1162 /* Return the bit position of FIELD, in bits from the start of the record.
1163 This is a tree of type bitsizetype. */
1166 bit_position (tree field)
1168 return bit_from_pos (DECL_FIELD_OFFSET (field),
1169 DECL_FIELD_BIT_OFFSET (field));
1172 /* Likewise, but return as an integer. Abort if it cannot be represented
1173 in that way (since it could be a signed value, we don't have the option
1174 of returning -1 like int_size_in_byte can. */
1177 int_bit_position (tree field)
1179 return tree_low_cst (bit_position (field), 0);
1182 /* Return the byte position of FIELD, in bytes from the start of the record.
1183 This is a tree of type sizetype. */
1186 byte_position (tree field)
1188 return byte_from_pos (DECL_FIELD_OFFSET (field),
1189 DECL_FIELD_BIT_OFFSET (field));
1192 /* Likewise, but return as an integer. Abort if it cannot be represented
1193 in that way (since it could be a signed value, we don't have the option
1194 of returning -1 like int_size_in_byte can. */
1197 int_byte_position (tree field)
1199 return tree_low_cst (byte_position (field), 0);
1202 /* Return the strictest alignment, in bits, that T is known to have. */
1207 unsigned int align0, align1;
1209 switch (TREE_CODE (t))
1211 case NOP_EXPR: case CONVERT_EXPR: case NON_LVALUE_EXPR:
1212 /* If we have conversions, we know that the alignment of the
1213 object must meet each of the alignments of the types. */
1214 align0 = expr_align (TREE_OPERAND (t, 0));
1215 align1 = TYPE_ALIGN (TREE_TYPE (t));
1216 return MAX (align0, align1);
1218 case SAVE_EXPR: case COMPOUND_EXPR: case MODIFY_EXPR:
1219 case INIT_EXPR: case TARGET_EXPR: case WITH_CLEANUP_EXPR:
1220 case CLEANUP_POINT_EXPR: case UNSAVE_EXPR:
1221 /* These don't change the alignment of an object. */
1222 return expr_align (TREE_OPERAND (t, 0));
1225 /* The best we can do is say that the alignment is the least aligned
1227 align0 = expr_align (TREE_OPERAND (t, 1));
1228 align1 = expr_align (TREE_OPERAND (t, 2));
1229 return MIN (align0, align1);
1231 case LABEL_DECL: case CONST_DECL:
1232 case VAR_DECL: case PARM_DECL: case RESULT_DECL:
1233 if (DECL_ALIGN (t) != 0)
1234 return DECL_ALIGN (t);
1238 return FUNCTION_BOUNDARY;
1244 /* Otherwise take the alignment from that of the type. */
1245 return TYPE_ALIGN (TREE_TYPE (t));
1248 /* Return, as a tree node, the number of elements for TYPE (which is an
1249 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1252 array_type_nelts (tree type)
1254 tree index_type, min, max;
1256 /* If they did it with unspecified bounds, then we should have already
1257 given an error about it before we got here. */
1258 if (! TYPE_DOMAIN (type))
1259 return error_mark_node;
1261 index_type = TYPE_DOMAIN (type);
1262 min = TYPE_MIN_VALUE (index_type);
1263 max = TYPE_MAX_VALUE (index_type);
1265 return (integer_zerop (min)
1267 : fold (build2 (MINUS_EXPR, TREE_TYPE (max), max, min)));
1270 /* Return true if arg is static -- a reference to an object in
1271 static storage. This is not the same as the C meaning of `static'. */
1276 switch (TREE_CODE (arg))
1279 /* Nested functions aren't static, since taking their address
1280 involves a trampoline. */
1281 return ((decl_function_context (arg) == 0 || DECL_NO_STATIC_CHAIN (arg))
1282 && ! DECL_NON_ADDR_CONST_P (arg));
1285 return ((TREE_STATIC (arg) || DECL_EXTERNAL (arg))
1286 && ! DECL_THREAD_LOCAL (arg)
1287 && ! DECL_NON_ADDR_CONST_P (arg));
1290 return TREE_STATIC (arg);
1297 /* If the thing being referenced is not a field, then it is
1298 something language specific. */
1299 if (TREE_CODE (TREE_OPERAND (arg, 1)) != FIELD_DECL)
1300 return (*lang_hooks.staticp) (arg);
1302 /* If we are referencing a bitfield, we can't evaluate an
1303 ADDR_EXPR at compile time and so it isn't a constant. */
1304 if (DECL_BIT_FIELD (TREE_OPERAND (arg, 1)))
1307 return staticp (TREE_OPERAND (arg, 0));
1313 /* This case is technically correct, but results in setting
1314 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1317 return TREE_CONSTANT (TREE_OPERAND (arg, 0));
1321 case ARRAY_RANGE_REF:
1322 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg))) == INTEGER_CST
1323 && TREE_CODE (TREE_OPERAND (arg, 1)) == INTEGER_CST)
1324 return staticp (TREE_OPERAND (arg, 0));
1329 if ((unsigned int) TREE_CODE (arg)
1330 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE)
1331 return lang_hooks.staticp (arg);
1337 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1338 Do this to any expression which may be used in more than one place,
1339 but must be evaluated only once.
1341 Normally, expand_expr would reevaluate the expression each time.
1342 Calling save_expr produces something that is evaluated and recorded
1343 the first time expand_expr is called on it. Subsequent calls to
1344 expand_expr just reuse the recorded value.
1346 The call to expand_expr that generates code that actually computes
1347 the value is the first call *at compile time*. Subsequent calls
1348 *at compile time* generate code to use the saved value.
1349 This produces correct result provided that *at run time* control
1350 always flows through the insns made by the first expand_expr
1351 before reaching the other places where the save_expr was evaluated.
1352 You, the caller of save_expr, must make sure this is so.
1354 Constants, and certain read-only nodes, are returned with no
1355 SAVE_EXPR because that is safe. Expressions containing placeholders
1356 are not touched; see tree.def for an explanation of what these
1360 save_expr (tree expr)
1362 tree t = fold (expr);
1365 /* If the tree evaluates to a constant, then we don't want to hide that
1366 fact (i.e. this allows further folding, and direct checks for constants).
1367 However, a read-only object that has side effects cannot be bypassed.
1368 Since it is no problem to reevaluate literals, we just return the
1370 inner = skip_simple_arithmetic (t);
1372 if (TREE_INVARIANT (inner)
1373 || (TREE_READONLY (inner) && ! TREE_SIDE_EFFECTS (inner))
1374 || TREE_CODE (inner) == SAVE_EXPR
1375 || TREE_CODE (inner) == ERROR_MARK)
1378 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1379 it means that the size or offset of some field of an object depends on
1380 the value within another field.
1382 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1383 and some variable since it would then need to be both evaluated once and
1384 evaluated more than once. Front-ends must assure this case cannot
1385 happen by surrounding any such subexpressions in their own SAVE_EXPR
1386 and forcing evaluation at the proper time. */
1387 if (contains_placeholder_p (inner))
1390 t = build1 (SAVE_EXPR, TREE_TYPE (expr), t);
1392 /* This expression might be placed ahead of a jump to ensure that the
1393 value was computed on both sides of the jump. So make sure it isn't
1394 eliminated as dead. */
1395 TREE_SIDE_EFFECTS (t) = 1;
1396 TREE_READONLY (t) = 1;
1397 TREE_INVARIANT (t) = 1;
1401 /* Look inside EXPR and into any simple arithmetic operations. Return
1402 the innermost non-arithmetic node. */
1405 skip_simple_arithmetic (tree expr)
1409 /* We don't care about whether this can be used as an lvalue in this
1411 while (TREE_CODE (expr) == NON_LVALUE_EXPR)
1412 expr = TREE_OPERAND (expr, 0);
1414 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1415 a constant, it will be more efficient to not make another SAVE_EXPR since
1416 it will allow better simplification and GCSE will be able to merge the
1417 computations if they actually occur. */
1421 if (TREE_CODE_CLASS (TREE_CODE (inner)) == '1')
1422 inner = TREE_OPERAND (inner, 0);
1423 else if (TREE_CODE_CLASS (TREE_CODE (inner)) == '2')
1425 if (TREE_INVARIANT (TREE_OPERAND (inner, 1)))
1426 inner = TREE_OPERAND (inner, 0);
1427 else if (TREE_INVARIANT (TREE_OPERAND (inner, 0)))
1428 inner = TREE_OPERAND (inner, 1);
1439 /* Arrange for an expression to be expanded multiple independent
1440 times. This is useful for cleanup actions, as the backend can
1441 expand them multiple times in different places. */
1444 unsave_expr (tree expr)
1448 /* If this is already protected, no sense in protecting it again. */
1449 if (TREE_CODE (expr) == UNSAVE_EXPR)
1452 t = build1 (UNSAVE_EXPR, TREE_TYPE (expr), expr);
1453 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (expr);
1457 /* Returns the index of the first non-tree operand for CODE, or the number
1458 of operands if all are trees. */
1461 first_rtl_op (enum tree_code code)
1466 return TREE_CODE_LENGTH (code);
1470 /* Return which tree structure is used by T. */
1472 enum tree_node_structure_enum
1473 tree_node_structure (tree t)
1475 enum tree_code code = TREE_CODE (t);
1477 switch (TREE_CODE_CLASS (code))
1479 case 'd': return TS_DECL;
1480 case 't': return TS_TYPE;
1481 case 'r': case '<': case '1': case '2': case 'e': case 's':
1483 default: /* 'c' and 'x' */
1489 case INTEGER_CST: return TS_INT_CST;
1490 case REAL_CST: return TS_REAL_CST;
1491 case COMPLEX_CST: return TS_COMPLEX;
1492 case VECTOR_CST: return TS_VECTOR;
1493 case STRING_CST: return TS_STRING;
1495 case ERROR_MARK: return TS_COMMON;
1496 case IDENTIFIER_NODE: return TS_IDENTIFIER;
1497 case TREE_LIST: return TS_LIST;
1498 case TREE_VEC: return TS_VEC;
1499 case PHI_NODE: return TS_PHI_NODE;
1500 case SSA_NAME: return TS_SSA_NAME;
1501 case PLACEHOLDER_EXPR: return TS_COMMON;
1502 case STATEMENT_LIST: return TS_STATEMENT_LIST;
1503 case BLOCK: return TS_BLOCK;
1504 case TREE_BINFO: return TS_BINFO;
1505 case VALUE_HANDLE: return TS_VALUE_HANDLE;
1512 /* Perform any modifications to EXPR required when it is unsaved. Does
1513 not recurse into EXPR's subtrees. */
1516 unsave_expr_1 (tree expr)
1518 switch (TREE_CODE (expr))
1521 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1522 It's OK for this to happen if it was part of a subtree that
1523 isn't immediately expanded, such as operand 2 of another
1525 if (TREE_OPERAND (expr, 1))
1528 TREE_OPERAND (expr, 1) = TREE_OPERAND (expr, 3);
1529 TREE_OPERAND (expr, 3) = NULL_TREE;
1537 /* Return 0 if it is safe to evaluate EXPR multiple times,
1538 return 1 if it is safe if EXPR is unsaved afterward, or
1539 return 2 if it is completely unsafe.
1541 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1542 an expression tree, so that it safe to unsave them and the surrounding
1543 context will be correct.
1545 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1546 occasionally across the whole of a function. It is therefore only
1547 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1548 below the UNSAVE_EXPR. */
1551 unsafe_for_reeval (tree expr)
1554 enum tree_code code;
1559 if (expr == NULL_TREE)
1562 code = TREE_CODE (expr);
1563 first_rtl = first_rtl_op (code);
1570 /* A label can only be emitted once. */
1579 for (exp = expr; exp != 0; exp = TREE_CHAIN (exp))
1581 tmp = unsafe_for_reeval (TREE_VALUE (exp));
1582 unsafeness = MAX (tmp, unsafeness);
1588 tmp2 = unsafe_for_reeval (TREE_OPERAND (expr, 0));
1589 tmp = unsafe_for_reeval (TREE_OPERAND (expr, 1));
1590 return MAX (MAX (tmp, 1), tmp2);
1596 case EXIT_BLOCK_EXPR:
1597 /* EXIT_BLOCK_LABELED_BLOCK, a.k.a. TREE_OPERAND (expr, 0), holds
1598 a reference to an ancestor LABELED_BLOCK, so we need to avoid
1599 unbounded recursion in the 'e' traversal code below. */
1600 exp = EXIT_BLOCK_RETURN (expr);
1601 return exp ? unsafe_for_reeval (exp) : 0;
1604 tmp = lang_hooks.unsafe_for_reeval (expr);
1610 switch (TREE_CODE_CLASS (code))
1612 case 'c': /* a constant */
1613 case 't': /* a type node */
1614 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1615 case 'd': /* A decl node */
1618 case 'e': /* an expression */
1619 case 'r': /* a reference */
1620 case 's': /* an expression with side effects */
1621 case '<': /* a comparison expression */
1622 case '2': /* a binary arithmetic expression */
1623 case '1': /* a unary arithmetic expression */
1624 for (i = first_rtl - 1; i >= 0; i--)
1626 tmp = unsafe_for_reeval (TREE_OPERAND (expr, i));
1627 unsafeness = MAX (tmp, unsafeness);
1637 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1638 or offset that depends on a field within a record. */
1641 contains_placeholder_p (tree exp)
1643 enum tree_code code;
1648 code = TREE_CODE (exp);
1649 if (code == PLACEHOLDER_EXPR)
1652 switch (TREE_CODE_CLASS (code))
1655 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1656 position computations since they will be converted into a
1657 WITH_RECORD_EXPR involving the reference, which will assume
1658 here will be valid. */
1659 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1662 if (code == TREE_LIST)
1663 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp))
1664 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp)));
1673 /* Ignoring the first operand isn't quite right, but works best. */
1674 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1));
1677 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1678 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1))
1679 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 2)));
1685 switch (first_rtl_op (code))
1688 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0));
1690 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 0))
1691 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp, 1)));
1702 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1703 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1707 type_contains_placeholder_p (tree type)
1709 /* If the size contains a placeholder or the parent type (component type in
1710 the case of arrays) type involves a placeholder, this type does. */
1711 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type))
1712 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type))
1713 || (TREE_TYPE (type) != 0
1714 && type_contains_placeholder_p (TREE_TYPE (type))))
1717 /* Now do type-specific checks. Note that the last part of the check above
1718 greatly limits what we have to do below. */
1719 switch (TREE_CODE (type))
1728 case REFERENCE_TYPE:
1736 /* Here we just check the bounds. */
1737 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type))
1738 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type)));
1743 /* We're already checked the component type (TREE_TYPE), so just check
1745 return type_contains_placeholder_p (TYPE_DOMAIN (type));
1749 case QUAL_UNION_TYPE:
1751 static tree seen_types = 0;
1755 /* We have to be careful here that we don't end up in infinite
1756 recursions due to a field of a type being a pointer to that type
1757 or to a mutually-recursive type. So we store a list of record
1758 types that we've seen and see if this type is in them. To save
1759 memory, we don't use a list for just one type. Here we check
1760 whether we've seen this type before and store it if not. */
1761 if (seen_types == 0)
1763 else if (TREE_CODE (seen_types) != TREE_LIST)
1765 if (seen_types == type)
1768 seen_types = tree_cons (NULL_TREE, type,
1769 build_tree_list (NULL_TREE, seen_types));
1773 if (value_member (type, seen_types) != 0)
1776 seen_types = tree_cons (NULL_TREE, type, seen_types);
1779 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1780 if (TREE_CODE (field) == FIELD_DECL
1781 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field))
1782 || (TREE_CODE (type) == QUAL_UNION_TYPE
1783 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field)))
1784 || type_contains_placeholder_p (TREE_TYPE (field))))
1790 /* Now remove us from seen_types and return the result. */
1791 if (seen_types == type)
1794 seen_types = TREE_CHAIN (seen_types);
1804 /* Return 1 if EXP contains any expressions that produce cleanups for an
1805 outer scope to deal with. Used by fold. */
1808 has_cleanups (tree exp)
1812 if (! TREE_SIDE_EFFECTS (exp))
1815 switch (TREE_CODE (exp))
1818 case WITH_CLEANUP_EXPR:
1821 case CLEANUP_POINT_EXPR:
1825 for (exp = TREE_OPERAND (exp, 1); exp; exp = TREE_CHAIN (exp))
1827 cmp = has_cleanups (TREE_VALUE (exp));
1834 return (DECL_INITIAL (DECL_EXPR_DECL (exp))
1835 && has_cleanups (DECL_INITIAL (DECL_EXPR_DECL (exp))));
1841 /* This general rule works for most tree codes. All exceptions should be
1842 handled above. If this is a language-specific tree code, we can't
1843 trust what might be in the operand, so say we don't know
1845 if ((int) TREE_CODE (exp) >= (int) LAST_AND_UNUSED_TREE_CODE)
1848 nops = first_rtl_op (TREE_CODE (exp));
1849 for (i = 0; i < nops; i++)
1850 if (TREE_OPERAND (exp, i) != 0)
1852 int type = TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp, i)));
1853 if (type == 'e' || type == '<' || type == '1' || type == '2'
1854 || type == 'r' || type == 's')
1856 cmp = has_cleanups (TREE_OPERAND (exp, i));
1865 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1866 return a tree with all occurrences of references to F in a
1867 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1868 contains only arithmetic expressions or a CALL_EXPR with a
1869 PLACEHOLDER_EXPR occurring only in its arglist. */
1872 substitute_in_expr (tree exp, tree f, tree r)
1874 enum tree_code code = TREE_CODE (exp);
1879 /* We handle TREE_LIST and COMPONENT_REF separately. */
1880 if (code == TREE_LIST)
1882 op0 = SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp), f, r);
1883 op1 = SUBSTITUTE_IN_EXPR (TREE_VALUE (exp), f, r);
1884 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
1887 return tree_cons (TREE_PURPOSE (exp), op1, op0);
1889 else if (code == COMPONENT_REF)
1891 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1892 and it is the right field, replace it with R. */
1893 for (inner = TREE_OPERAND (exp, 0);
1894 TREE_CODE_CLASS (TREE_CODE (inner)) == 'r';
1895 inner = TREE_OPERAND (inner, 0))
1897 if (TREE_CODE (inner) == PLACEHOLDER_EXPR
1898 && TREE_OPERAND (exp, 1) == f)
1901 /* If this expression hasn't been completed let, leave it
1903 if (TREE_CODE (inner) == PLACEHOLDER_EXPR && TREE_TYPE (inner) == 0)
1906 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1907 if (op0 == TREE_OPERAND (exp, 0))
1910 new = fold (build (code, TREE_TYPE (exp), op0, TREE_OPERAND (exp, 1),
1914 switch (TREE_CODE_CLASS (code))
1926 switch (first_rtl_op (code))
1932 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1933 if (op0 == TREE_OPERAND (exp, 0))
1936 new = fold (build1 (code, TREE_TYPE (exp), op0));
1940 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1941 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1943 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
1946 new = fold (build2 (code, TREE_TYPE (exp), op0, op1));
1950 op0 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 0), f, r);
1951 op1 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 1), f, r);
1952 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r);
1954 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
1955 && op2 == TREE_OPERAND (exp, 2))
1958 new = fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
1970 TREE_READONLY (new) = TREE_READONLY (exp);
1974 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1975 for it within OBJ, a tree that is an object or a chain of references. */
1978 substitute_placeholder_in_expr (tree exp, tree obj)
1980 enum tree_code code = TREE_CODE (exp);
1981 tree op0, op1, op2, op3;
1983 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
1984 in the chain of OBJ. */
1985 if (code == PLACEHOLDER_EXPR)
1987 tree need_type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
1990 for (elt = obj; elt != 0;
1991 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
1992 || TREE_CODE (elt) == COND_EXPR)
1993 ? TREE_OPERAND (elt, 1)
1994 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
1995 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
1996 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
1997 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
1998 ? TREE_OPERAND (elt, 0) : 0))
1999 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt)) == need_type)
2002 for (elt = obj; elt != 0;
2003 elt = ((TREE_CODE (elt) == COMPOUND_EXPR
2004 || TREE_CODE (elt) == COND_EXPR)
2005 ? TREE_OPERAND (elt, 1)
2006 : (TREE_CODE_CLASS (TREE_CODE (elt)) == 'r'
2007 || TREE_CODE_CLASS (TREE_CODE (elt)) == '1'
2008 || TREE_CODE_CLASS (TREE_CODE (elt)) == '2'
2009 || TREE_CODE_CLASS (TREE_CODE (elt)) == 'e')
2010 ? TREE_OPERAND (elt, 0) : 0))
2011 if (POINTER_TYPE_P (TREE_TYPE (elt))
2012 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt)))
2014 return fold (build1 (INDIRECT_REF, need_type, elt));
2016 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2017 survives until RTL generation, there will be an error. */
2021 /* TREE_LIST is special because we need to look at TREE_VALUE
2022 and TREE_CHAIN, not TREE_OPERANDS. */
2023 else if (code == TREE_LIST)
2025 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp), obj);
2026 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp), obj);
2027 if (op0 == TREE_CHAIN (exp) && op1 == TREE_VALUE (exp))
2030 return tree_cons (TREE_PURPOSE (exp), op1, op0);
2033 switch (TREE_CODE_CLASS (code))
2046 switch (first_rtl_op (code))
2052 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2053 if (op0 == TREE_OPERAND (exp, 0))
2056 return fold (build1 (code, TREE_TYPE (exp), op0));
2059 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2060 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2062 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1))
2065 return fold (build2 (code, TREE_TYPE (exp), op0, op1));
2068 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2069 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2070 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2072 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2073 && op2 == TREE_OPERAND (exp, 2))
2076 return fold (build3 (code, TREE_TYPE (exp), op0, op1, op2));
2079 op0 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 0), obj);
2080 op1 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 1), obj);
2081 op2 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 2), obj);
2082 op3 = SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp, 3), obj);
2084 if (op0 == TREE_OPERAND (exp, 0) && op1 == TREE_OPERAND (exp, 1)
2085 && op2 == TREE_OPERAND (exp, 2)
2086 && op3 == TREE_OPERAND (exp, 3))
2089 return fold (build4 (code, TREE_TYPE (exp), op0, op1, op2, op3));
2101 /* Stabilize a reference so that we can use it any number of times
2102 without causing its operands to be evaluated more than once.
2103 Returns the stabilized reference. This works by means of save_expr,
2104 so see the caveats in the comments about save_expr.
2106 Also allows conversion expressions whose operands are references.
2107 Any other kind of expression is returned unchanged. */
2110 stabilize_reference (tree ref)
2113 enum tree_code code = TREE_CODE (ref);
2120 /* No action is needed in this case. */
2126 case FIX_TRUNC_EXPR:
2127 case FIX_FLOOR_EXPR:
2128 case FIX_ROUND_EXPR:
2130 result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
2134 result = build_nt (INDIRECT_REF,
2135 stabilize_reference_1 (TREE_OPERAND (ref, 0)));
2139 result = build_nt (COMPONENT_REF,
2140 stabilize_reference (TREE_OPERAND (ref, 0)),
2141 TREE_OPERAND (ref, 1), NULL_TREE);
2145 result = build_nt (BIT_FIELD_REF,
2146 stabilize_reference (TREE_OPERAND (ref, 0)),
2147 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2148 stabilize_reference_1 (TREE_OPERAND (ref, 2)));
2152 result = build_nt (ARRAY_REF,
2153 stabilize_reference (TREE_OPERAND (ref, 0)),
2154 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2155 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2158 case ARRAY_RANGE_REF:
2159 result = build_nt (ARRAY_RANGE_REF,
2160 stabilize_reference (TREE_OPERAND (ref, 0)),
2161 stabilize_reference_1 (TREE_OPERAND (ref, 1)),
2162 TREE_OPERAND (ref, 2), TREE_OPERAND (ref, 3));
2166 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2167 it wouldn't be ignored. This matters when dealing with
2169 return stabilize_reference_1 (ref);
2171 /* If arg isn't a kind of lvalue we recognize, make no change.
2172 Caller should recognize the error for an invalid lvalue. */
2177 return error_mark_node;
2180 TREE_TYPE (result) = TREE_TYPE (ref);
2181 TREE_READONLY (result) = TREE_READONLY (ref);
2182 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
2183 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
2188 /* Subroutine of stabilize_reference; this is called for subtrees of
2189 references. Any expression with side-effects must be put in a SAVE_EXPR
2190 to ensure that it is only evaluated once.
2192 We don't put SAVE_EXPR nodes around everything, because assigning very
2193 simple expressions to temporaries causes us to miss good opportunities
2194 for optimizations. Among other things, the opportunity to fold in the
2195 addition of a constant into an addressing mode often gets lost, e.g.
2196 "y[i+1] += x;". In general, we take the approach that we should not make
2197 an assignment unless we are forced into it - i.e., that any non-side effect
2198 operator should be allowed, and that cse should take care of coalescing
2199 multiple utterances of the same expression should that prove fruitful. */
2202 stabilize_reference_1 (tree e)
2205 enum tree_code code = TREE_CODE (e);
2207 /* We cannot ignore const expressions because it might be a reference
2208 to a const array but whose index contains side-effects. But we can
2209 ignore things that are actual constant or that already have been
2210 handled by this function. */
2212 if (TREE_INVARIANT (e))
2215 switch (TREE_CODE_CLASS (code))
2224 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2225 so that it will only be evaluated once. */
2226 /* The reference (r) and comparison (<) classes could be handled as
2227 below, but it is generally faster to only evaluate them once. */
2228 if (TREE_SIDE_EFFECTS (e))
2229 return save_expr (e);
2233 /* Constants need no processing. In fact, we should never reach
2238 /* Division is slow and tends to be compiled with jumps,
2239 especially the division by powers of 2 that is often
2240 found inside of an array reference. So do it just once. */
2241 if (code == TRUNC_DIV_EXPR || code == TRUNC_MOD_EXPR
2242 || code == FLOOR_DIV_EXPR || code == FLOOR_MOD_EXPR
2243 || code == CEIL_DIV_EXPR || code == CEIL_MOD_EXPR
2244 || code == ROUND_DIV_EXPR || code == ROUND_MOD_EXPR)
2245 return save_expr (e);
2246 /* Recursively stabilize each operand. */
2247 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)),
2248 stabilize_reference_1 (TREE_OPERAND (e, 1)));
2252 /* Recursively stabilize each operand. */
2253 result = build_nt (code, stabilize_reference_1 (TREE_OPERAND (e, 0)));
2260 TREE_TYPE (result) = TREE_TYPE (e);
2261 TREE_READONLY (result) = TREE_READONLY (e);
2262 TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e);
2263 TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e);
2264 TREE_INVARIANT (result) = 1;
2269 /* Low-level constructors for expressions. */
2271 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2272 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2275 recompute_tree_invarant_for_addr_expr (tree t)
2278 bool tc = true, ti = true, se = false;
2280 /* We started out assuming this address is both invariant and constant, but
2281 does not have side effects. Now go down any handled components and see if
2282 any of them involve offsets that are either non-constant or non-invariant.
2283 Also check for side-effects.
2285 ??? Note that this code makes no attempt to deal with the case where
2286 taking the address of something causes a copy due to misalignment. */
2288 #define UPDATE_TITCSE(NODE) \
2289 do { tree _node = (NODE); \
2290 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2291 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2292 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2294 for (node = TREE_OPERAND (t, 0); handled_component_p (node);
2295 node = TREE_OPERAND (node, 0))
2297 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2298 array reference (probably made temporarily by the G++ front end),
2299 so ignore all the operands. */
2300 if ((TREE_CODE (node) == ARRAY_REF
2301 || TREE_CODE (node) == ARRAY_RANGE_REF)
2302 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node, 0))) == ARRAY_TYPE)
2304 UPDATE_TITCSE (TREE_OPERAND (node, 1));
2305 UPDATE_TITCSE (array_ref_low_bound (node));
2306 UPDATE_TITCSE (array_ref_element_size (node));
2308 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2309 FIELD_DECL, apparently. The G++ front end can put something else
2310 there, at least temporarily. */
2311 else if (TREE_CODE (node) == COMPONENT_REF
2312 && TREE_CODE (TREE_OPERAND (node, 1)) == FIELD_DECL)
2313 UPDATE_TITCSE (component_ref_field_offset (node));
2314 else if (TREE_CODE (node) == BIT_FIELD_REF)
2315 UPDATE_TITCSE (TREE_OPERAND (node, 2));
2318 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2319 it. If it's a decl, it's invariant and constant if the decl is static.
2320 It's also invariant if it's a decl in the current function. (Taking the
2321 address of a volatile variable is not volatile.) If it's a constant,
2322 the address is both invariant and constant. Otherwise it's neither. */
2323 if (TREE_CODE (node) == INDIRECT_REF)
2324 UPDATE_TITCSE (node);
2325 else if (DECL_P (node))
2329 else if (decl_function_context (node) == current_function_decl)
2334 else if (TREE_CODE_CLASS (TREE_CODE (node)) == 'c')
2339 se |= TREE_SIDE_EFFECTS (node);
2342 TREE_CONSTANT (t) = tc;
2343 TREE_INVARIANT (t) = ti;
2344 TREE_SIDE_EFFECTS (t) = se;
2345 #undef UPDATE_TITCSE
2348 /* Build an expression of code CODE, data type TYPE, and operands as
2349 specified. Expressions and reference nodes can be created this way.
2350 Constants, decls, types and misc nodes cannot be.
2352 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2353 enough for all extant tree codes. These functions can be called
2354 directly (preferably!), but can also be obtained via GCC preprocessor
2355 magic within the build macro. */
2358 build0_stat (enum tree_code code, tree tt MEM_STAT_DECL)
2362 #ifdef ENABLE_CHECKING
2363 if (TREE_CODE_LENGTH (code) != 0)
2367 t = make_node_stat (code PASS_MEM_STAT);
2374 build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
2376 int length = sizeof (struct tree_exp);
2377 #ifdef GATHER_STATISTICS
2378 tree_node_kind kind;
2382 #ifdef GATHER_STATISTICS
2383 switch (TREE_CODE_CLASS (code))
2385 case 's': /* an expression with side effects */
2388 case 'r': /* a reference */
2396 tree_node_counts[(int) kind]++;
2397 tree_node_sizes[(int) kind] += length;
2400 #ifdef ENABLE_CHECKING
2401 if (TREE_CODE_LENGTH (code) != 1)
2403 #endif /* ENABLE_CHECKING */
2405 t = ggc_alloc_zone_stat (length, tree_zone PASS_MEM_STAT);
2407 memset (t, 0, sizeof (struct tree_common));
2409 TREE_SET_CODE (t, code);
2411 TREE_TYPE (t) = type;
2412 #ifdef USE_MAPPED_LOCATION
2413 SET_EXPR_LOCATION (t, UNKNOWN_LOCATION);
2415 SET_EXPR_LOCUS (t, NULL);
2417 TREE_COMPLEXITY (t) = 0;
2418 TREE_OPERAND (t, 0) = node;
2419 TREE_BLOCK (t) = NULL_TREE;
2420 if (node && !TYPE_P (node) && first_rtl_op (code) != 0)
2422 TREE_SIDE_EFFECTS (t) = TREE_SIDE_EFFECTS (node);
2423 TREE_READONLY (t) = TREE_READONLY (node);
2426 if (TREE_CODE_CLASS (code) == 's')
2427 TREE_SIDE_EFFECTS (t) = 1;
2433 case PREDECREMENT_EXPR:
2434 case PREINCREMENT_EXPR:
2435 case POSTDECREMENT_EXPR:
2436 case POSTINCREMENT_EXPR:
2437 /* All of these have side-effects, no matter what their
2439 TREE_SIDE_EFFECTS (t) = 1;
2440 TREE_READONLY (t) = 0;
2444 /* Whether a dereference is readonly has nothing to do with whether
2445 its operand is readonly. */
2446 TREE_READONLY (t) = 0;
2451 recompute_tree_invarant_for_addr_expr (t);
2455 if (TREE_CODE_CLASS (code) == '1' && node && !TYPE_P (node)
2456 && TREE_CONSTANT (node))
2457 TREE_CONSTANT (t) = 1;
2458 if (TREE_CODE_CLASS (code) == '1' && node && TREE_INVARIANT (node))
2459 TREE_INVARIANT (t) = 1;
2460 if (TREE_CODE_CLASS (code) == 'r' && node && TREE_THIS_VOLATILE (node))
2461 TREE_THIS_VOLATILE (t) = 1;
2468 #define PROCESS_ARG(N) \
2470 TREE_OPERAND (t, N) = arg##N; \
2471 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2473 if (TREE_SIDE_EFFECTS (arg##N)) \
2475 if (!TREE_READONLY (arg##N)) \
2477 if (!TREE_CONSTANT (arg##N)) \
2479 if (!TREE_INVARIANT (arg##N)) \
2485 build2_stat (enum tree_code code, tree tt, tree arg0, tree arg1 MEM_STAT_DECL)
2487 bool constant, read_only, side_effects, invariant;
2491 #ifdef ENABLE_CHECKING
2492 if (TREE_CODE_LENGTH (code) != 2)
2496 t = make_node_stat (code PASS_MEM_STAT);
2499 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2500 result based on those same flags for the arguments. But if the
2501 arguments aren't really even `tree' expressions, we shouldn't be trying
2503 fro = first_rtl_op (code);
2505 /* Expressions without side effects may be constant if their
2506 arguments are as well. */
2507 constant = (TREE_CODE_CLASS (code) == '<'
2508 || TREE_CODE_CLASS (code) == '2');
2510 side_effects = TREE_SIDE_EFFECTS (t);
2511 invariant = constant;
2516 TREE_READONLY (t) = read_only;
2517 TREE_CONSTANT (t) = constant;
2518 TREE_INVARIANT (t) = invariant;
2519 TREE_SIDE_EFFECTS (t) = side_effects;
2520 TREE_THIS_VOLATILE (t)
2521 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2527 build3_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2528 tree arg2 MEM_STAT_DECL)
2530 bool constant, read_only, side_effects, invariant;
2534 #ifdef ENABLE_CHECKING
2535 if (TREE_CODE_LENGTH (code) != 3)
2539 t = make_node_stat (code PASS_MEM_STAT);
2542 fro = first_rtl_op (code);
2544 side_effects = TREE_SIDE_EFFECTS (t);
2550 if (code == CALL_EXPR && !side_effects)
2555 /* Calls have side-effects, except those to const or
2557 i = call_expr_flags (t);
2558 if (!(i & (ECF_CONST | ECF_PURE)))
2561 /* And even those have side-effects if their arguments do. */
2562 else for (node = arg1; node; node = TREE_CHAIN (node))
2563 if (TREE_SIDE_EFFECTS (TREE_VALUE (node)))
2570 TREE_SIDE_EFFECTS (t) = side_effects;
2571 TREE_THIS_VOLATILE (t)
2572 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2578 build4_stat (enum tree_code code, tree tt, tree arg0, tree arg1,
2579 tree arg2, tree arg3 MEM_STAT_DECL)
2581 bool constant, read_only, side_effects, invariant;
2585 #ifdef ENABLE_CHECKING
2586 if (TREE_CODE_LENGTH (code) != 4)
2590 t = make_node_stat (code PASS_MEM_STAT);
2593 fro = first_rtl_op (code);
2595 side_effects = TREE_SIDE_EFFECTS (t);
2602 TREE_SIDE_EFFECTS (t) = side_effects;
2603 TREE_THIS_VOLATILE (t)
2604 = TREE_CODE_CLASS (code) == 'r' && arg0 && TREE_THIS_VOLATILE (arg0);
2609 /* Backup definition for non-gcc build compilers. */
2612 (build) (enum tree_code code, tree tt, ...)
2614 tree t, arg0, arg1, arg2, arg3;
2615 int length = TREE_CODE_LENGTH (code);
2622 t = build0 (code, tt);
2625 arg0 = va_arg (p, tree);
2626 t = build1 (code, tt, arg0);
2629 arg0 = va_arg (p, tree);
2630 arg1 = va_arg (p, tree);
2631 t = build2 (code, tt, arg0, arg1);
2634 arg0 = va_arg (p, tree);
2635 arg1 = va_arg (p, tree);
2636 arg2 = va_arg (p, tree);
2637 t = build3 (code, tt, arg0, arg1, arg2);
2640 arg0 = va_arg (p, tree);
2641 arg1 = va_arg (p, tree);
2642 arg2 = va_arg (p, tree);
2643 arg3 = va_arg (p, tree);
2644 t = build4 (code, tt, arg0, arg1, arg2, arg3);
2654 /* Similar except don't specify the TREE_TYPE
2655 and leave the TREE_SIDE_EFFECTS as 0.
2656 It is permissible for arguments to be null,
2657 or even garbage if their values do not matter. */
2660 build_nt (enum tree_code code, ...)
2669 t = make_node (code);
2670 length = TREE_CODE_LENGTH (code);
2672 for (i = 0; i < length; i++)
2673 TREE_OPERAND (t, i) = va_arg (p, tree);
2679 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2680 We do NOT enter this node in any sort of symbol table.
2682 layout_decl is used to set up the decl's storage layout.
2683 Other slots are initialized to 0 or null pointers. */
2686 build_decl_stat (enum tree_code code, tree name, tree type MEM_STAT_DECL)
2690 t = make_node_stat (code PASS_MEM_STAT);
2692 /* if (type == error_mark_node)
2693 type = integer_type_node; */
2694 /* That is not done, deliberately, so that having error_mark_node
2695 as the type can suppress useless errors in the use of this variable. */
2697 DECL_NAME (t) = name;
2698 TREE_TYPE (t) = type;
2700 if (code == VAR_DECL || code == PARM_DECL || code == RESULT_DECL)
2702 else if (code == FUNCTION_DECL)
2703 DECL_MODE (t) = FUNCTION_MODE;
2708 /* BLOCK nodes are used to represent the structure of binding contours
2709 and declarations, once those contours have been exited and their contents
2710 compiled. This information is used for outputting debugging info. */
2713 build_block (tree vars, tree tags ATTRIBUTE_UNUSED, tree subblocks,
2714 tree supercontext, tree chain)
2716 tree block = make_node (BLOCK);
2718 BLOCK_VARS (block) = vars;
2719 BLOCK_SUBBLOCKS (block) = subblocks;
2720 BLOCK_SUPERCONTEXT (block) = supercontext;
2721 BLOCK_CHAIN (block) = chain;
2725 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2726 /* ??? gengtype doesn't handle conditionals */
2727 static GTY(()) tree last_annotated_node;
2730 #ifdef USE_MAPPED_LOCATION
2733 expand_location (source_location loc)
2735 expanded_location xloc;
2736 if (loc == 0) { xloc.file = NULL; xloc.line = 0; xloc.column = 0; }
2739 const struct line_map *map = linemap_lookup (&line_table, loc);
2740 xloc.file = map->to_file;
2741 xloc.line = SOURCE_LINE (map, loc);
2742 xloc.column = SOURCE_COLUMN (map, loc);
2749 /* Record the exact location where an expression or an identifier were
2753 annotate_with_file_line (tree node, const char *file, int line)
2755 /* Roughly one percent of the calls to this function are to annotate
2756 a node with the same information already attached to that node!
2757 Just return instead of wasting memory. */
2758 if (EXPR_LOCUS (node)
2759 && (EXPR_FILENAME (node) == file
2760 || ! strcmp (EXPR_FILENAME (node), file))
2761 && EXPR_LINENO (node) == line)
2763 last_annotated_node = node;
2767 /* In heavily macroized code (such as GCC itself) this single
2768 entry cache can reduce the number of allocations by more
2770 if (last_annotated_node
2771 && EXPR_LOCUS (last_annotated_node)
2772 && (EXPR_FILENAME (last_annotated_node) == file
2773 || ! strcmp (EXPR_FILENAME (last_annotated_node), file))
2774 && EXPR_LINENO (last_annotated_node) == line)
2776 SET_EXPR_LOCUS (node, EXPR_LOCUS (last_annotated_node));
2780 SET_EXPR_LOCUS (node, ggc_alloc (sizeof (location_t)));
2781 EXPR_LINENO (node) = line;
2782 EXPR_FILENAME (node) = file;
2783 last_annotated_node = node;
2787 annotate_with_locus (tree node, location_t locus)
2789 annotate_with_file_line (node, locus.file, locus.line);
2793 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2797 build_decl_attribute_variant (tree ddecl, tree attribute)
2799 DECL_ATTRIBUTES (ddecl) = attribute;
2803 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2806 Record such modified types already made so we don't make duplicates. */
2809 build_type_attribute_variant (tree ttype, tree attribute)
2811 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype), attribute))
2813 hashval_t hashcode = 0;
2815 enum tree_code code = TREE_CODE (ttype);
2817 ntype = copy_node (ttype);
2819 TYPE_POINTER_TO (ntype) = 0;
2820 TYPE_REFERENCE_TO (ntype) = 0;
2821 TYPE_ATTRIBUTES (ntype) = attribute;
2823 /* Create a new main variant of TYPE. */
2824 TYPE_MAIN_VARIANT (ntype) = ntype;
2825 TYPE_NEXT_VARIANT (ntype) = 0;
2826 set_type_quals (ntype, TYPE_UNQUALIFIED);
2828 hashcode = iterative_hash_object (code, hashcode);
2829 if (TREE_TYPE (ntype))
2830 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
2832 hashcode = attribute_hash_list (attribute, hashcode);
2834 switch (TREE_CODE (ntype))
2837 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
2840 hashcode = iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype)),
2844 hashcode = iterative_hash_object
2845 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype)), hashcode);
2846 hashcode = iterative_hash_object
2847 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype)), hashcode);
2851 unsigned int precision = TYPE_PRECISION (ntype);
2852 hashcode = iterative_hash_object (precision, hashcode);
2859 ntype = type_hash_canon (hashcode, ntype);
2860 ttype = build_qualified_type (ntype, TYPE_QUALS (ttype));
2866 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2869 We try both `text' and `__text__', ATTR may be either one. */
2870 /* ??? It might be a reasonable simplification to require ATTR to be only
2871 `text'. One might then also require attribute lists to be stored in
2872 their canonicalized form. */
2875 is_attribute_p (const char *attr, tree ident)
2877 int ident_len, attr_len;
2880 if (TREE_CODE (ident) != IDENTIFIER_NODE)
2883 if (strcmp (attr, IDENTIFIER_POINTER (ident)) == 0)
2886 p = IDENTIFIER_POINTER (ident);
2887 ident_len = strlen (p);
2888 attr_len = strlen (attr);
2890 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2894 || attr[attr_len - 2] != '_'
2895 || attr[attr_len - 1] != '_')
2897 if (ident_len == attr_len - 4
2898 && strncmp (attr + 2, p, attr_len - 4) == 0)
2903 if (ident_len == attr_len + 4
2904 && p[0] == '_' && p[1] == '_'
2905 && p[ident_len - 2] == '_' && p[ident_len - 1] == '_'
2906 && strncmp (attr, p + 2, attr_len) == 0)
2913 /* Given an attribute name and a list of attributes, return a pointer to the
2914 attribute's list element if the attribute is part of the list, or NULL_TREE
2915 if not found. If the attribute appears more than once, this only
2916 returns the first occurrence; the TREE_CHAIN of the return value should
2917 be passed back in if further occurrences are wanted. */
2920 lookup_attribute (const char *attr_name, tree list)
2924 for (l = list; l; l = TREE_CHAIN (l))
2926 if (TREE_CODE (TREE_PURPOSE (l)) != IDENTIFIER_NODE)
2928 if (is_attribute_p (attr_name, TREE_PURPOSE (l)))
2935 /* Return an attribute list that is the union of a1 and a2. */
2938 merge_attributes (tree a1, tree a2)
2942 /* Either one unset? Take the set one. */
2944 if ((attributes = a1) == 0)
2947 /* One that completely contains the other? Take it. */
2949 else if (a2 != 0 && ! attribute_list_contained (a1, a2))
2951 if (attribute_list_contained (a2, a1))
2955 /* Pick the longest list, and hang on the other list. */
2957 if (list_length (a1) < list_length (a2))
2958 attributes = a2, a2 = a1;
2960 for (; a2 != 0; a2 = TREE_CHAIN (a2))
2963 for (a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2966 a = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2)),
2969 if (simple_cst_equal (TREE_VALUE (a), TREE_VALUE (a2)) == 1)
2974 a1 = copy_node (a2);
2975 TREE_CHAIN (a1) = attributes;
2984 /* Given types T1 and T2, merge their attributes and return
2988 merge_type_attributes (tree t1, tree t2)
2990 return merge_attributes (TYPE_ATTRIBUTES (t1),
2991 TYPE_ATTRIBUTES (t2));
2994 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
2998 merge_decl_attributes (tree olddecl, tree newdecl)
3000 return merge_attributes (DECL_ATTRIBUTES (olddecl),
3001 DECL_ATTRIBUTES (newdecl));
3004 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
3006 /* Specialization of merge_decl_attributes for various Windows targets.
3008 This handles the following situation:
3010 __declspec (dllimport) int foo;
3013 The second instance of `foo' nullifies the dllimport. */
3016 merge_dllimport_decl_attributes (tree old, tree new)
3019 int delete_dllimport_p;
3021 old = DECL_ATTRIBUTES (old);
3022 new = DECL_ATTRIBUTES (new);
3024 /* What we need to do here is remove from `old' dllimport if it doesn't
3025 appear in `new'. dllimport behaves like extern: if a declaration is
3026 marked dllimport and a definition appears later, then the object
3027 is not dllimport'd. */
3028 if (lookup_attribute ("dllimport", old) != NULL_TREE
3029 && lookup_attribute ("dllimport", new) == NULL_TREE)
3030 delete_dllimport_p = 1;
3032 delete_dllimport_p = 0;
3034 a = merge_attributes (old, new);
3036 if (delete_dllimport_p)
3040 /* Scan the list for dllimport and delete it. */
3041 for (prev = NULL_TREE, t = a; t; prev = t, t = TREE_CHAIN (t))
3043 if (is_attribute_p ("dllimport", TREE_PURPOSE (t)))
3045 if (prev == NULL_TREE)
3048 TREE_CHAIN (prev) = TREE_CHAIN (t);
3057 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3059 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3060 of the various TYPE_QUAL values. */
3063 set_type_quals (tree type, int type_quals)
3065 TYPE_READONLY (type) = (type_quals & TYPE_QUAL_CONST) != 0;
3066 TYPE_VOLATILE (type) = (type_quals & TYPE_QUAL_VOLATILE) != 0;
3067 TYPE_RESTRICT (type) = (type_quals & TYPE_QUAL_RESTRICT) != 0;
3070 /* Returns true iff cand is equivalent to base with type_quals. */
3073 check_qualified_type (tree cand, tree base, int type_quals)
3075 return (TYPE_QUALS (cand) == type_quals
3076 && TYPE_NAME (cand) == TYPE_NAME (base)
3077 /* Apparently this is needed for Objective-C. */
3078 && TYPE_CONTEXT (cand) == TYPE_CONTEXT (base)
3079 && attribute_list_equal (TYPE_ATTRIBUTES (cand),
3080 TYPE_ATTRIBUTES (base)));
3083 /* Return a version of the TYPE, qualified as indicated by the
3084 TYPE_QUALS, if one exists. If no qualified version exists yet,
3085 return NULL_TREE. */
3088 get_qualified_type (tree type, int type_quals)
3092 if (TYPE_QUALS (type) == type_quals)
3095 /* Search the chain of variants to see if there is already one there just
3096 like the one we need to have. If so, use that existing one. We must
3097 preserve the TYPE_NAME, since there is code that depends on this. */
3098 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
3099 if (check_qualified_type (t, type, type_quals))
3105 /* Like get_qualified_type, but creates the type if it does not
3106 exist. This function never returns NULL_TREE. */
3109 build_qualified_type (tree type, int type_quals)
3113 /* See if we already have the appropriate qualified variant. */
3114 t = get_qualified_type (type, type_quals);
3116 /* If not, build it. */
3119 t = build_type_copy (type);
3120 set_type_quals (t, type_quals);
3126 /* Create a new variant of TYPE, equivalent but distinct.
3127 This is so the caller can modify it. */
3130 build_type_copy (tree type)
3132 tree t, m = TYPE_MAIN_VARIANT (type);
3134 t = copy_node (type);
3136 TYPE_POINTER_TO (t) = 0;
3137 TYPE_REFERENCE_TO (t) = 0;
3139 /* Add this type to the chain of variants of TYPE. */
3140 TYPE_NEXT_VARIANT (t) = TYPE_NEXT_VARIANT (m);
3141 TYPE_NEXT_VARIANT (m) = t;
3146 /* Hashing of types so that we don't make duplicates.
3147 The entry point is `type_hash_canon'. */
3149 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3150 with types in the TREE_VALUE slots), by adding the hash codes
3151 of the individual types. */
3154 type_hash_list (tree list, hashval_t hashcode)
3158 for (tail = list; tail; tail = TREE_CHAIN (tail))
3159 if (TREE_VALUE (tail) != error_mark_node)
3160 hashcode = iterative_hash_object (TYPE_HASH (TREE_VALUE (tail)),
3166 /* These are the Hashtable callback functions. */
3168 /* Returns true iff the types are equivalent. */
3171 type_hash_eq (const void *va, const void *vb)
3173 const struct type_hash *a = va, *b = vb;
3175 /* First test the things that are the same for all types. */
3176 if (a->hash != b->hash
3177 || TREE_CODE (a->type) != TREE_CODE (b->type)
3178 || TREE_TYPE (a->type) != TREE_TYPE (b->type)
3179 || !attribute_list_equal (TYPE_ATTRIBUTES (a->type),
3180 TYPE_ATTRIBUTES (b->type))
3181 || TYPE_ALIGN (a->type) != TYPE_ALIGN (b->type)
3182 || TYPE_MODE (a->type) != TYPE_MODE (b->type))
3185 switch (TREE_CODE (a->type))
3191 case REFERENCE_TYPE:
3195 if (TYPE_VALUES (a->type) != TYPE_VALUES (b->type)
3196 && !(TYPE_VALUES (a->type)
3197 && TREE_CODE (TYPE_VALUES (a->type)) == TREE_LIST
3198 && TYPE_VALUES (b->type)
3199 && TREE_CODE (TYPE_VALUES (b->type)) == TREE_LIST
3200 && type_list_equal (TYPE_VALUES (a->type),
3201 TYPE_VALUES (b->type))))
3204 /* ... fall through ... */
3210 return ((TYPE_MAX_VALUE (a->type) == TYPE_MAX_VALUE (b->type)
3211 || tree_int_cst_equal (TYPE_MAX_VALUE (a->type),
3212 TYPE_MAX_VALUE (b->type)))
3213 && (TYPE_MIN_VALUE (a->type) == TYPE_MIN_VALUE (b->type)
3214 || tree_int_cst_equal (TYPE_MIN_VALUE (a->type),
3215 TYPE_MIN_VALUE (b->type))));
3218 return TYPE_OFFSET_BASETYPE (a->type) == TYPE_OFFSET_BASETYPE (b->type);
3221 return (TYPE_METHOD_BASETYPE (a->type) == TYPE_METHOD_BASETYPE (b->type)
3222 && (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3223 || (TYPE_ARG_TYPES (a->type)
3224 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3225 && TYPE_ARG_TYPES (b->type)
3226 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3227 && type_list_equal (TYPE_ARG_TYPES (a->type),
3228 TYPE_ARG_TYPES (b->type)))));
3232 return TYPE_DOMAIN (a->type) == TYPE_DOMAIN (b->type);
3236 case QUAL_UNION_TYPE:
3237 return (TYPE_FIELDS (a->type) == TYPE_FIELDS (b->type)
3238 || (TYPE_FIELDS (a->type)
3239 && TREE_CODE (TYPE_FIELDS (a->type)) == TREE_LIST
3240 && TYPE_FIELDS (b->type)
3241 && TREE_CODE (TYPE_FIELDS (b->type)) == TREE_LIST
3242 && type_list_equal (TYPE_FIELDS (a->type),
3243 TYPE_FIELDS (b->type))));
3246 return (TYPE_ARG_TYPES (a->type) == TYPE_ARG_TYPES (b->type)
3247 || (TYPE_ARG_TYPES (a->type)
3248 && TREE_CODE (TYPE_ARG_TYPES (a->type)) == TREE_LIST
3249 && TYPE_ARG_TYPES (b->type)
3250 && TREE_CODE (TYPE_ARG_TYPES (b->type)) == TREE_LIST
3251 && type_list_equal (TYPE_ARG_TYPES (a->type),
3252 TYPE_ARG_TYPES (b->type))));
3259 /* Return the cached hash value. */
3262 type_hash_hash (const void *item)
3264 return ((const struct type_hash *) item)->hash;
3267 /* Look in the type hash table for a type isomorphic to TYPE.
3268 If one is found, return it. Otherwise return 0. */
3271 type_hash_lookup (hashval_t hashcode, tree type)
3273 struct type_hash *h, in;
3275 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3276 must call that routine before comparing TYPE_ALIGNs. */
3282 h = htab_find_with_hash (type_hash_table, &in, hashcode);
3288 /* Add an entry to the type-hash-table
3289 for a type TYPE whose hash code is HASHCODE. */
3292 type_hash_add (hashval_t hashcode, tree type)
3294 struct type_hash *h;
3297 h = ggc_alloc (sizeof (struct type_hash));
3300 loc = htab_find_slot_with_hash (type_hash_table, h, hashcode, INSERT);
3301 *(struct type_hash **) loc = h;
3304 /* Given TYPE, and HASHCODE its hash code, return the canonical
3305 object for an identical type if one already exists.
3306 Otherwise, return TYPE, and record it as the canonical object.
3308 To use this function, first create a type of the sort you want.
3309 Then compute its hash code from the fields of the type that
3310 make it different from other similar types.
3311 Then call this function and use the value. */
3314 type_hash_canon (unsigned int hashcode, tree type)
3318 /* The hash table only contains main variants, so ensure that's what we're
3320 if (TYPE_MAIN_VARIANT (type) != type)
3323 if (!lang_hooks.types.hash_types)
3326 /* See if the type is in the hash table already. If so, return it.
3327 Otherwise, add the type. */
3328 t1 = type_hash_lookup (hashcode, type);
3331 #ifdef GATHER_STATISTICS
3332 tree_node_counts[(int) t_kind]--;
3333 tree_node_sizes[(int) t_kind] -= sizeof (struct tree_type);
3339 type_hash_add (hashcode, type);
3344 /* See if the data pointed to by the type hash table is marked. We consider
3345 it marked if the type is marked or if a debug type number or symbol
3346 table entry has been made for the type. This reduces the amount of
3347 debugging output and eliminates that dependency of the debug output on
3348 the number of garbage collections. */
3351 type_hash_marked_p (const void *p)
3353 tree type = ((struct type_hash *) p)->type;
3355 return ggc_marked_p (type) || TYPE_SYMTAB_POINTER (type);
3359 print_type_hash_statistics (void)
3361 fprintf (stderr, "Type hash: size %ld, %ld elements, %f collisions\n",
3362 (long) htab_size (type_hash_table),
3363 (long) htab_elements (type_hash_table),
3364 htab_collisions (type_hash_table));
3367 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3368 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3369 by adding the hash codes of the individual attributes. */
3372 attribute_hash_list (tree list, hashval_t hashcode)
3376 for (tail = list; tail; tail = TREE_CHAIN (tail))
3377 /* ??? Do we want to add in TREE_VALUE too? */
3378 hashcode = iterative_hash_object
3379 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail)), hashcode);
3383 /* Given two lists of attributes, return true if list l2 is
3384 equivalent to l1. */
3387 attribute_list_equal (tree l1, tree l2)
3389 return attribute_list_contained (l1, l2)
3390 && attribute_list_contained (l2, l1);
3393 /* Given two lists of attributes, return true if list L2 is
3394 completely contained within L1. */
3395 /* ??? This would be faster if attribute names were stored in a canonicalized
3396 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3397 must be used to show these elements are equivalent (which they are). */
3398 /* ??? It's not clear that attributes with arguments will always be handled
3402 attribute_list_contained (tree l1, tree l2)
3406 /* First check the obvious, maybe the lists are identical. */
3410 /* Maybe the lists are similar. */
3411 for (t1 = l1, t2 = l2;
3413 && TREE_PURPOSE (t1) == TREE_PURPOSE (t2)
3414 && TREE_VALUE (t1) == TREE_VALUE (t2);
3415 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2));
3417 /* Maybe the lists are equal. */
3418 if (t1 == 0 && t2 == 0)
3421 for (; t2 != 0; t2 = TREE_CHAIN (t2))
3424 for (attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)), l1);
3426 attr = lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2)),
3429 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) == 1)
3436 if (simple_cst_equal (TREE_VALUE (t2), TREE_VALUE (attr)) != 1)
3443 /* Given two lists of types
3444 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3445 return 1 if the lists contain the same types in the same order.
3446 Also, the TREE_PURPOSEs must match. */
3449 type_list_equal (tree l1, tree l2)
3453 for (t1 = l1, t2 = l2; t1 && t2; t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
3454 if (TREE_VALUE (t1) != TREE_VALUE (t2)
3455 || (TREE_PURPOSE (t1) != TREE_PURPOSE (t2)
3456 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2))
3457 && (TREE_TYPE (TREE_PURPOSE (t1))
3458 == TREE_TYPE (TREE_PURPOSE (t2))))))
3464 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3465 given by TYPE. If the argument list accepts variable arguments,
3466 then this function counts only the ordinary arguments. */
3469 type_num_arguments (tree type)
3474 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
3475 /* If the function does not take a variable number of arguments,
3476 the last element in the list will have type `void'. */
3477 if (VOID_TYPE_P (TREE_VALUE (t)))
3485 /* Nonzero if integer constants T1 and T2
3486 represent the same constant value. */
3489 tree_int_cst_equal (tree t1, tree t2)
3494 if (t1 == 0 || t2 == 0)
3497 if (TREE_CODE (t1) == INTEGER_CST
3498 && TREE_CODE (t2) == INTEGER_CST
3499 && TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3500 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2))
3506 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3507 The precise way of comparison depends on their data type. */
3510 tree_int_cst_lt (tree t1, tree t2)
3515 if (TYPE_UNSIGNED (TREE_TYPE (t1)) != TYPE_UNSIGNED (TREE_TYPE (t2)))
3517 int t1_sgn = tree_int_cst_sgn (t1);
3518 int t2_sgn = tree_int_cst_sgn (t2);
3520 if (t1_sgn < t2_sgn)
3522 else if (t1_sgn > t2_sgn)
3524 /* Otherwise, both are non-negative, so we compare them as
3525 unsigned just in case one of them would overflow a signed
3528 else if (!TYPE_UNSIGNED (TREE_TYPE (t1)))
3529 return INT_CST_LT (t1, t2);
3531 return INT_CST_LT_UNSIGNED (t1, t2);
3534 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3537 tree_int_cst_compare (tree t1, tree t2)
3539 if (tree_int_cst_lt (t1, t2))
3541 else if (tree_int_cst_lt (t2, t1))
3547 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3548 the host. If POS is zero, the value can be represented in a single
3549 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3550 be represented in a single unsigned HOST_WIDE_INT. */
3553 host_integerp (tree t, int pos)
3555 return (TREE_CODE (t) == INTEGER_CST
3556 && ! TREE_OVERFLOW (t)
3557 && ((TREE_INT_CST_HIGH (t) == 0
3558 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) >= 0)
3559 || (! pos && TREE_INT_CST_HIGH (t) == -1
3560 && (HOST_WIDE_INT) TREE_INT_CST_LOW (t) < 0
3561 && !TYPE_UNSIGNED (TREE_TYPE (t)))
3562 || (pos && TREE_INT_CST_HIGH (t) == 0)));
3565 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3566 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3567 be positive. Abort if we cannot satisfy the above conditions. */
3570 tree_low_cst (tree t, int pos)
3572 if (host_integerp (t, pos))
3573 return TREE_INT_CST_LOW (t);
3578 /* Return the most significant bit of the integer constant T. */
3581 tree_int_cst_msb (tree t)
3585 unsigned HOST_WIDE_INT l;
3587 /* Note that using TYPE_PRECISION here is wrong. We care about the
3588 actual bits, not the (arbitrary) range of the type. */
3589 prec = GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) - 1;
3590 rshift_double (TREE_INT_CST_LOW (t), TREE_INT_CST_HIGH (t), prec,
3591 2 * HOST_BITS_PER_WIDE_INT, &l, &h, 0);
3592 return (l & 1) == 1;
3595 /* Return an indication of the sign of the integer constant T.
3596 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3597 Note that -1 will never be returned it T's type is unsigned. */
3600 tree_int_cst_sgn (tree t)
3602 if (TREE_INT_CST_LOW (t) == 0 && TREE_INT_CST_HIGH (t) == 0)
3604 else if (TYPE_UNSIGNED (TREE_TYPE (t)))
3606 else if (TREE_INT_CST_HIGH (t) < 0)
3612 /* Compare two constructor-element-type constants. Return 1 if the lists
3613 are known to be equal; otherwise return 0. */
3616 simple_cst_list_equal (tree l1, tree l2)
3618 while (l1 != NULL_TREE && l2 != NULL_TREE)
3620 if (simple_cst_equal (TREE_VALUE (l1), TREE_VALUE (l2)) != 1)
3623 l1 = TREE_CHAIN (l1);
3624 l2 = TREE_CHAIN (l2);
3630 /* Return truthvalue of whether T1 is the same tree structure as T2.
3631 Return 1 if they are the same.
3632 Return 0 if they are understandably different.
3633 Return -1 if either contains tree structure not understood by
3637 simple_cst_equal (tree t1, tree t2)
3639 enum tree_code code1, code2;
3645 if (t1 == 0 || t2 == 0)
3648 code1 = TREE_CODE (t1);
3649 code2 = TREE_CODE (t2);
3651 if (code1 == NOP_EXPR || code1 == CONVERT_EXPR || code1 == NON_LVALUE_EXPR)
3653 if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3654 || code2 == NON_LVALUE_EXPR)
3655 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3657 return simple_cst_equal (TREE_OPERAND (t1, 0), t2);
3660 else if (code2 == NOP_EXPR || code2 == CONVERT_EXPR
3661 || code2 == NON_LVALUE_EXPR)
3662 return simple_cst_equal (t1, TREE_OPERAND (t2, 0));
3670 return (TREE_INT_CST_LOW (t1) == TREE_INT_CST_LOW (t2)
3671 && TREE_INT_CST_HIGH (t1) == TREE_INT_CST_HIGH (t2));
3674 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2));
3677 return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2)
3678 && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2),
3679 TREE_STRING_LENGTH (t1)));
3682 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1),
3683 CONSTRUCTOR_ELTS (t2));
3686 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3689 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3693 simple_cst_list_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3696 /* Special case: if either target is an unallocated VAR_DECL,
3697 it means that it's going to be unified with whatever the
3698 TARGET_EXPR is really supposed to initialize, so treat it
3699 as being equivalent to anything. */
3700 if ((TREE_CODE (TREE_OPERAND (t1, 0)) == VAR_DECL
3701 && DECL_NAME (TREE_OPERAND (t1, 0)) == NULL_TREE
3702 && !DECL_RTL_SET_P (TREE_OPERAND (t1, 0)))
3703 || (TREE_CODE (TREE_OPERAND (t2, 0)) == VAR_DECL
3704 && DECL_NAME (TREE_OPERAND (t2, 0)) == NULL_TREE
3705 && !DECL_RTL_SET_P (TREE_OPERAND (t2, 0))))
3708 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3713 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1));
3715 case WITH_CLEANUP_EXPR:
3716 cmp = simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3720 return simple_cst_equal (TREE_OPERAND (t1, 1), TREE_OPERAND (t1, 1));
3723 if (TREE_OPERAND (t1, 1) == TREE_OPERAND (t2, 1))
3724 return simple_cst_equal (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0));
3738 /* This general rule works for most tree codes. All exceptions should be
3739 handled above. If this is a language-specific tree code, we can't
3740 trust what might be in the operand, so say we don't know
3742 if ((int) code1 >= (int) LAST_AND_UNUSED_TREE_CODE)
3745 switch (TREE_CODE_CLASS (code1))
3754 for (i = 0; i < TREE_CODE_LENGTH (code1); i++)
3756 cmp = simple_cst_equal (TREE_OPERAND (t1, i), TREE_OPERAND (t2, i));
3768 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3769 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3770 than U, respectively. */
3773 compare_tree_int (tree t, unsigned HOST_WIDE_INT u)
3775 if (tree_int_cst_sgn (t) < 0)
3777 else if (TREE_INT_CST_HIGH (t) != 0)
3779 else if (TREE_INT_CST_LOW (t) == u)
3781 else if (TREE_INT_CST_LOW (t) < u)
3787 /* Return true if CODE represents an associative tree code. Otherwise
3790 associative_tree_code (enum tree_code code)
3809 /* Return true if CODE represents an commutative tree code. Otherwise
3812 commutative_tree_code (enum tree_code code)
3825 case UNORDERED_EXPR:
3829 case TRUTH_AND_EXPR:
3830 case TRUTH_XOR_EXPR:
3840 /* Generate a hash value for an expression. This can be used iteratively
3841 by passing a previous result as the "val" argument.
3843 This function is intended to produce the same hash for expressions which
3844 would compare equal using operand_equal_p. */
3847 iterative_hash_expr (tree t, hashval_t val)
3850 enum tree_code code;
3854 return iterative_hash_object (t, val);
3856 code = TREE_CODE (t);
3857 class = TREE_CODE_CLASS (code);
3860 || TREE_CODE (t) == VALUE_HANDLE)
3862 /* Decls we can just compare by pointer. */
3863 val = iterative_hash_object (t, val);
3865 else if (class == 'c')
3867 /* Alas, constants aren't shared, so we can't rely on pointer
3869 if (code == INTEGER_CST)
3871 val = iterative_hash_object (TREE_INT_CST_LOW (t), val);
3872 val = iterative_hash_object (TREE_INT_CST_HIGH (t), val);
3874 else if (code == REAL_CST)
3876 unsigned int val2 = real_hash (TREE_REAL_CST_PTR (t));
3878 val = iterative_hash (&val2, sizeof (unsigned int), val);
3880 else if (code == STRING_CST)
3881 val = iterative_hash (TREE_STRING_POINTER (t),
3882 TREE_STRING_LENGTH (t), val);
3883 else if (code == COMPLEX_CST)
3885 val = iterative_hash_expr (TREE_REALPART (t), val);
3886 val = iterative_hash_expr (TREE_IMAGPART (t), val);
3888 else if (code == VECTOR_CST)
3889 val = iterative_hash_expr (TREE_VECTOR_CST_ELTS (t), val);
3893 else if (IS_EXPR_CODE_CLASS (class))
3895 val = iterative_hash_object (code, val);
3897 /* Don't hash the type, that can lead to having nodes which
3898 compare equal according to operand_equal_p, but which
3899 have different hash codes. */
3900 if (code == NOP_EXPR
3901 || code == CONVERT_EXPR
3902 || code == NON_LVALUE_EXPR)
3904 /* Make sure to include signness in the hash computation. */
3905 val += TYPE_UNSIGNED (TREE_TYPE (t));
3906 val = iterative_hash_expr (TREE_OPERAND (t, 0), val);
3909 if (commutative_tree_code (code))
3911 /* It's a commutative expression. We want to hash it the same
3912 however it appears. We do this by first hashing both operands
3913 and then rehashing based on the order of their independent
3915 hashval_t one = iterative_hash_expr (TREE_OPERAND (t, 0), 0);
3916 hashval_t two = iterative_hash_expr (TREE_OPERAND (t, 1), 0);
3920 t = one, one = two, two = t;
3922 val = iterative_hash_object (one, val);
3923 val = iterative_hash_object (two, val);
3926 for (i = first_rtl_op (code) - 1; i >= 0; --i)
3927 val = iterative_hash_expr (TREE_OPERAND (t, i), val);
3929 else if (code == TREE_LIST)
3931 /* A list of expressions, for a CALL_EXPR or as the elements of a
3933 for (; t; t = TREE_CHAIN (t))
3934 val = iterative_hash_expr (TREE_VALUE (t), val);
3936 else if (code == SSA_NAME)
3938 val = iterative_hash_object (SSA_NAME_VERSION (t), val);
3939 val = iterative_hash_expr (SSA_NAME_VAR (t), val);
3947 /* Constructors for pointer, array and function types.
3948 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3949 constructed by language-dependent code, not here.) */
3951 /* Construct, lay out and return the type of pointers to TO_TYPE with
3952 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
3953 reference all of memory. If such a type has already been
3954 constructed, reuse it. */
3957 build_pointer_type_for_mode (tree to_type, enum machine_mode mode,
3962 /* In some cases, languages will have things that aren't a POINTER_TYPE
3963 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
3964 In that case, return that type without regard to the rest of our
3967 ??? This is a kludge, but consistent with the way this function has
3968 always operated and there doesn't seem to be a good way to avoid this
3970 if (TYPE_POINTER_TO (to_type) != 0
3971 && TREE_CODE (TYPE_POINTER_TO (to_type)) != POINTER_TYPE)
3972 return TYPE_POINTER_TO (to_type);
3974 /* First, if we already have a type for pointers to TO_TYPE and it's
3975 the proper mode, use it. */
3976 for (t = TYPE_POINTER_TO (to_type); t; t = TYPE_NEXT_PTR_TO (t))
3977 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
3980 t = make_node (POINTER_TYPE);
3982 TREE_TYPE (t) = to_type;
3983 TYPE_MODE (t) = mode;
3984 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
3985 TYPE_NEXT_PTR_TO (t) = TYPE_POINTER_TO (to_type);
3986 TYPE_POINTER_TO (to_type) = t;
3988 /* Lay out the type. This function has many callers that are concerned
3989 with expression-construction, and this simplifies them all. */
3995 /* By default build pointers in ptr_mode. */
3998 build_pointer_type (tree to_type)
4000 return build_pointer_type_for_mode (to_type, ptr_mode, false);
4003 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4006 build_reference_type_for_mode (tree to_type, enum machine_mode mode,
4011 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4012 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4013 In that case, return that type without regard to the rest of our
4016 ??? This is a kludge, but consistent with the way this function has
4017 always operated and there doesn't seem to be a good way to avoid this
4019 if (TYPE_REFERENCE_TO (to_type) != 0
4020 && TREE_CODE (TYPE_REFERENCE_TO (to_type)) != REFERENCE_TYPE)
4021 return TYPE_REFERENCE_TO (to_type);
4023 /* First, if we already have a type for pointers to TO_TYPE and it's
4024 the proper mode, use it. */
4025 for (t = TYPE_REFERENCE_TO (to_type); t; t = TYPE_NEXT_REF_TO (t))
4026 if (TYPE_MODE (t) == mode && TYPE_REF_CAN_ALIAS_ALL (t) == can_alias_all)
4029 t = make_node (REFERENCE_TYPE);
4031 TREE_TYPE (t) = to_type;
4032 TYPE_MODE (t) = mode;
4033 TYPE_REF_CAN_ALIAS_ALL (t) = can_alias_all;
4034 TYPE_NEXT_REF_TO (t) = TYPE_REFERENCE_TO (to_type);
4035 TYPE_REFERENCE_TO (to_type) = t;
4043 /* Build the node for the type of references-to-TO_TYPE by default
4047 build_reference_type (tree to_type)
4049 return build_reference_type_for_mode (to_type, ptr_mode, false);
4052 /* Build a type that is compatible with t but has no cv quals anywhere
4055 const char *const *const * -> char ***. */
4058 build_type_no_quals (tree t)
4060 switch (TREE_CODE (t))
4063 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4065 TYPE_REF_CAN_ALIAS_ALL (t));
4066 case REFERENCE_TYPE:
4068 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t)),
4070 TYPE_REF_CAN_ALIAS_ALL (t));
4072 return TYPE_MAIN_VARIANT (t);
4076 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4077 MAXVAL should be the maximum value in the domain
4078 (one less than the length of the array).
4080 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4081 We don't enforce this limit, that is up to caller (e.g. language front end).
4082 The limit exists because the result is a signed type and we don't handle
4083 sizes that use more than one HOST_WIDE_INT. */
4086 build_index_type (tree maxval)
4088 tree itype = make_node (INTEGER_TYPE);
4090 TREE_TYPE (itype) = sizetype;
4091 TYPE_PRECISION (itype) = TYPE_PRECISION (sizetype);
4092 TYPE_MIN_VALUE (itype) = size_zero_node;
4093 TYPE_MAX_VALUE (itype) = convert (sizetype, maxval);
4094 TYPE_MODE (itype) = TYPE_MODE (sizetype);
4095 TYPE_SIZE (itype) = TYPE_SIZE (sizetype);
4096 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (sizetype);
4097 TYPE_ALIGN (itype) = TYPE_ALIGN (sizetype);
4098 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (sizetype);
4100 if (host_integerp (maxval, 1))
4101 return type_hash_canon (tree_low_cst (maxval, 1), itype);
4106 /* Builds a signed or unsigned integer type of precision PRECISION.
4107 Used for C bitfields whose precision does not match that of
4108 built-in target types. */
4110 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision,
4113 tree itype = make_node (INTEGER_TYPE);
4115 TYPE_PRECISION (itype) = precision;
4118 fixup_unsigned_type (itype);
4120 fixup_signed_type (itype);
4122 if (host_integerp (TYPE_MAX_VALUE (itype), 1))
4123 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype), 1), itype);
4128 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4129 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4130 low bound LOWVAL and high bound HIGHVAL.
4131 if TYPE==NULL_TREE, sizetype is used. */
4134 build_range_type (tree type, tree lowval, tree highval)
4136 tree itype = make_node (INTEGER_TYPE);
4138 TREE_TYPE (itype) = type;
4139 if (type == NULL_TREE)
4142 TYPE_MIN_VALUE (itype) = convert (type, lowval);
4143 TYPE_MAX_VALUE (itype) = highval ? convert (type, highval) : NULL;
4145 TYPE_PRECISION (itype) = TYPE_PRECISION (type);
4146 TYPE_MODE (itype) = TYPE_MODE (type);
4147 TYPE_SIZE (itype) = TYPE_SIZE (type);
4148 TYPE_SIZE_UNIT (itype) = TYPE_SIZE_UNIT (type);
4149 TYPE_ALIGN (itype) = TYPE_ALIGN (type);
4150 TYPE_USER_ALIGN (itype) = TYPE_USER_ALIGN (type);
4152 if (host_integerp (lowval, 0) && highval != 0 && host_integerp (highval, 0))
4153 return type_hash_canon (tree_low_cst (highval, 0)
4154 - tree_low_cst (lowval, 0),
4160 /* Just like build_index_type, but takes lowval and highval instead
4161 of just highval (maxval). */
4164 build_index_2_type (tree lowval, tree highval)
4166 return build_range_type (sizetype, lowval, highval);
4169 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4170 and number of elements specified by the range of values of INDEX_TYPE.
4171 If such a type has already been constructed, reuse it. */
4174 build_array_type (tree elt_type, tree index_type)
4177 hashval_t hashcode = 0;
4179 if (TREE_CODE (elt_type) == FUNCTION_TYPE)
4181 error ("arrays of functions are not meaningful");
4182 elt_type = integer_type_node;
4185 t = make_node (ARRAY_TYPE);
4186 TREE_TYPE (t) = elt_type;
4187 TYPE_DOMAIN (t) = index_type;
4189 if (index_type == 0)
4192 hashcode = iterative_hash_object (TYPE_HASH (elt_type), hashcode);
4193 hashcode = iterative_hash_object (TYPE_HASH (index_type), hashcode);
4194 t = type_hash_canon (hashcode, t);
4196 if (!COMPLETE_TYPE_P (t))
4201 /* Return the TYPE of the elements comprising
4202 the innermost dimension of ARRAY. */
4205 get_inner_array_type (tree array)
4207 tree type = TREE_TYPE (array);
4209 while (TREE_CODE (type) == ARRAY_TYPE)
4210 type = TREE_TYPE (type);
4215 /* Construct, lay out and return
4216 the type of functions returning type VALUE_TYPE
4217 given arguments of types ARG_TYPES.
4218 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4219 are data type nodes for the arguments of the function.
4220 If such a type has already been constructed, reuse it. */
4223 build_function_type (tree value_type, tree arg_types)
4226 hashval_t hashcode = 0;
4228 if (TREE_CODE (value_type) == FUNCTION_TYPE)
4230 error ("function return type cannot be function");
4231 value_type = integer_type_node;
4234 /* Make a node of the sort we want. */
4235 t = make_node (FUNCTION_TYPE);
4236 TREE_TYPE (t) = value_type;
4237 TYPE_ARG_TYPES (t) = arg_types;
4239 /* If we already have such a type, use the old one. */
4240 hashcode = iterative_hash_object (TYPE_HASH (value_type), hashcode);
4241 hashcode = type_hash_list (arg_types, hashcode);
4242 t = type_hash_canon (hashcode, t);
4244 if (!COMPLETE_TYPE_P (t))
4249 /* Build a function type. The RETURN_TYPE is the type returned by the
4250 function. If additional arguments are provided, they are
4251 additional argument types. The list of argument types must always
4252 be terminated by NULL_TREE. */
4255 build_function_type_list (tree return_type, ...)
4260 va_start (p, return_type);
4262 t = va_arg (p, tree);
4263 for (args = NULL_TREE; t != NULL_TREE; t = va_arg (p, tree))
4264 args = tree_cons (NULL_TREE, t, args);
4267 args = nreverse (args);
4268 TREE_CHAIN (last) = void_list_node;
4269 args = build_function_type (return_type, args);
4275 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4276 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4277 for the method. An implicit additional parameter (of type
4278 pointer-to-BASETYPE) is added to the ARGTYPES. */
4281 build_method_type_directly (tree basetype,
4289 /* Make a node of the sort we want. */
4290 t = make_node (METHOD_TYPE);
4292 TYPE_METHOD_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4293 TREE_TYPE (t) = rettype;
4294 ptype = build_pointer_type (basetype);
4296 /* The actual arglist for this function includes a "hidden" argument
4297 which is "this". Put it into the list of argument types. */
4298 argtypes = tree_cons (NULL_TREE, ptype, argtypes);
4299 TYPE_ARG_TYPES (t) = argtypes;
4301 /* If we already have such a type, use the old one. */
4302 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4303 hashcode = iterative_hash_object (TYPE_HASH (rettype), hashcode);
4304 hashcode = type_hash_list (argtypes, hashcode);
4305 t = type_hash_canon (hashcode, t);
4307 if (!COMPLETE_TYPE_P (t))
4313 /* Construct, lay out and return the type of methods belonging to class
4314 BASETYPE and whose arguments and values are described by TYPE.
4315 If that type exists already, reuse it.
4316 TYPE must be a FUNCTION_TYPE node. */
4319 build_method_type (tree basetype, tree type)
4321 if (TREE_CODE (type) != FUNCTION_TYPE)
4324 return build_method_type_directly (basetype,
4326 TYPE_ARG_TYPES (type));
4329 /* Construct, lay out and return the type of offsets to a value
4330 of type TYPE, within an object of type BASETYPE.
4331 If a suitable offset type exists already, reuse it. */
4334 build_offset_type (tree basetype, tree type)
4337 hashval_t hashcode = 0;
4339 /* Make a node of the sort we want. */
4340 t = make_node (OFFSET_TYPE);
4342 TYPE_OFFSET_BASETYPE (t) = TYPE_MAIN_VARIANT (basetype);
4343 TREE_TYPE (t) = type;
4345 /* If we already have such a type, use the old one. */
4346 hashcode = iterative_hash_object (TYPE_HASH (basetype), hashcode);
4347 hashcode = iterative_hash_object (TYPE_HASH (type), hashcode);
4348 t = type_hash_canon (hashcode, t);
4350 if (!COMPLETE_TYPE_P (t))
4356 /* Create a complex type whose components are COMPONENT_TYPE. */
4359 build_complex_type (tree component_type)
4364 /* Make a node of the sort we want. */
4365 t = make_node (COMPLEX_TYPE);
4367 TREE_TYPE (t) = TYPE_MAIN_VARIANT (component_type);
4369 /* If we already have such a type, use the old one. */
4370 hashcode = iterative_hash_object (TYPE_HASH (component_type), 0);
4371 t = type_hash_canon (hashcode, t);
4373 if (!COMPLETE_TYPE_P (t))
4376 /* If we are writing Dwarf2 output we need to create a name,
4377 since complex is a fundamental type. */
4378 if ((write_symbols == DWARF2_DEBUG || write_symbols == VMS_AND_DWARF2_DEBUG)
4382 if (component_type == char_type_node)
4383 name = "complex char";
4384 else if (component_type == signed_char_type_node)
4385 name = "complex signed char";
4386 else if (component_type == unsigned_char_type_node)
4387 name = "complex unsigned char";
4388 else if (component_type == short_integer_type_node)
4389 name = "complex short int";
4390 else if (component_type == short_unsigned_type_node)
4391 name = "complex short unsigned int";
4392 else if (component_type == integer_type_node)
4393 name = "complex int";
4394 else if (component_type == unsigned_type_node)
4395 name = "complex unsigned int";
4396 else if (component_type == long_integer_type_node)
4397 name = "complex long int";
4398 else if (component_type == long_unsigned_type_node)
4399 name = "complex long unsigned int";
4400 else if (component_type == long_long_integer_type_node)
4401 name = "complex long long int";
4402 else if (component_type == long_long_unsigned_type_node)
4403 name = "complex long long unsigned int";
4408 TYPE_NAME (t) = get_identifier (name);
4411 return build_qualified_type (t, TYPE_QUALS (component_type));
4414 /* Return OP, stripped of any conversions to wider types as much as is safe.
4415 Converting the value back to OP's type makes a value equivalent to OP.
4417 If FOR_TYPE is nonzero, we return a value which, if converted to
4418 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4420 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4421 narrowest type that can hold the value, even if they don't exactly fit.
4422 Otherwise, bit-field references are changed to a narrower type
4423 only if they can be fetched directly from memory in that type.
4425 OP must have integer, real or enumeral type. Pointers are not allowed!
4427 There are some cases where the obvious value we could return
4428 would regenerate to OP if converted to OP's type,
4429 but would not extend like OP to wider types.
4430 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4431 For example, if OP is (unsigned short)(signed char)-1,
4432 we avoid returning (signed char)-1 if FOR_TYPE is int,
4433 even though extending that to an unsigned short would regenerate OP,
4434 since the result of extending (signed char)-1 to (int)
4435 is different from (int) OP. */
4438 get_unwidened (tree op, tree for_type)
4440 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4441 tree type = TREE_TYPE (op);
4443 = TYPE_PRECISION (for_type != 0 ? for_type : type);
4445 = (for_type != 0 && for_type != type
4446 && final_prec > TYPE_PRECISION (type)
4447 && TYPE_UNSIGNED (type));
4450 while (TREE_CODE (op) == NOP_EXPR)
4453 = TYPE_PRECISION (TREE_TYPE (op))
4454 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0)));
4456 /* Truncations are many-one so cannot be removed.
4457 Unless we are later going to truncate down even farther. */
4459 && final_prec > TYPE_PRECISION (TREE_TYPE (op)))
4462 /* See what's inside this conversion. If we decide to strip it,
4464 op = TREE_OPERAND (op, 0);
4466 /* If we have not stripped any zero-extensions (uns is 0),
4467 we can strip any kind of extension.
4468 If we have previously stripped a zero-extension,
4469 only zero-extensions can safely be stripped.
4470 Any extension can be stripped if the bits it would produce
4471 are all going to be discarded later by truncating to FOR_TYPE. */
4475 if (! uns || final_prec <= TYPE_PRECISION (TREE_TYPE (op)))
4477 /* TYPE_UNSIGNED says whether this is a zero-extension.
4478 Let's avoid computing it if it does not affect WIN
4479 and if UNS will not be needed again. */
4480 if ((uns || TREE_CODE (op) == NOP_EXPR)
4481 && TYPE_UNSIGNED (TREE_TYPE (op)))
4489 if (TREE_CODE (op) == COMPONENT_REF
4490 /* Since type_for_size always gives an integer type. */
4491 && TREE_CODE (type) != REAL_TYPE
4492 /* Don't crash if field not laid out yet. */
4493 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4494 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4496 unsigned int innerprec
4497 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4498 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4499 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4500 type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4502 /* We can get this structure field in the narrowest type it fits in.
4503 If FOR_TYPE is 0, do this only for a field that matches the
4504 narrower type exactly and is aligned for it
4505 The resulting extension to its nominal type (a fullword type)
4506 must fit the same conditions as for other extensions. */
4509 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type), TYPE_SIZE (TREE_TYPE (op)))
4510 && (for_type || ! DECL_BIT_FIELD (TREE_OPERAND (op, 1)))
4511 && (! uns || final_prec <= innerprec || unsignedp))
4513 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4514 TREE_OPERAND (op, 1), NULL_TREE);
4515 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4516 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4523 /* Return OP or a simpler expression for a narrower value
4524 which can be sign-extended or zero-extended to give back OP.
4525 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4526 or 0 if the value should be sign-extended. */
4529 get_narrower (tree op, int *unsignedp_ptr)
4534 bool integral_p = INTEGRAL_TYPE_P (TREE_TYPE (op));
4536 while (TREE_CODE (op) == NOP_EXPR)
4539 = (TYPE_PRECISION (TREE_TYPE (op))
4540 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op, 0))));
4542 /* Truncations are many-one so cannot be removed. */
4546 /* See what's inside this conversion. If we decide to strip it,
4551 op = TREE_OPERAND (op, 0);
4552 /* An extension: the outermost one can be stripped,
4553 but remember whether it is zero or sign extension. */
4555 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4556 /* Otherwise, if a sign extension has been stripped,
4557 only sign extensions can now be stripped;
4558 if a zero extension has been stripped, only zero-extensions. */
4559 else if (uns != TYPE_UNSIGNED (TREE_TYPE (op)))
4563 else /* bitschange == 0 */
4565 /* A change in nominal type can always be stripped, but we must
4566 preserve the unsignedness. */
4568 uns = TYPE_UNSIGNED (TREE_TYPE (op));
4570 op = TREE_OPERAND (op, 0);
4571 /* Keep trying to narrow, but don't assign op to win if it
4572 would turn an integral type into something else. */
4573 if (INTEGRAL_TYPE_P (TREE_TYPE (op)) != integral_p)
4580 if (TREE_CODE (op) == COMPONENT_REF
4581 /* Since type_for_size always gives an integer type. */
4582 && TREE_CODE (TREE_TYPE (op)) != REAL_TYPE
4583 /* Ensure field is laid out already. */
4584 && DECL_SIZE (TREE_OPERAND (op, 1)) != 0
4585 && host_integerp (DECL_SIZE (TREE_OPERAND (op, 1)), 1))
4587 unsigned HOST_WIDE_INT innerprec
4588 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op, 1)), 1);
4589 int unsignedp = (DECL_UNSIGNED (TREE_OPERAND (op, 1))
4590 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 1))));
4591 tree type = lang_hooks.types.type_for_size (innerprec, unsignedp);
4593 /* We can get this structure field in a narrower type that fits it,
4594 but the resulting extension to its nominal type (a fullword type)
4595 must satisfy the same conditions as for other extensions.
4597 Do this only for fields that are aligned (not bit-fields),
4598 because when bit-field insns will be used there is no
4599 advantage in doing this. */
4601 if (innerprec < TYPE_PRECISION (TREE_TYPE (op))
4602 && ! DECL_BIT_FIELD (TREE_OPERAND (op, 1))
4603 && (first || uns == DECL_UNSIGNED (TREE_OPERAND (op, 1)))
4607 uns = DECL_UNSIGNED (TREE_OPERAND (op, 1));
4608 win = build3 (COMPONENT_REF, type, TREE_OPERAND (op, 0),
4609 TREE_OPERAND (op, 1), NULL_TREE);
4610 TREE_SIDE_EFFECTS (win) = TREE_SIDE_EFFECTS (op);
4611 TREE_THIS_VOLATILE (win) = TREE_THIS_VOLATILE (op);
4614 *unsignedp_ptr = uns;
4618 /* Nonzero if integer constant C has a value that is permissible
4619 for type TYPE (an INTEGER_TYPE). */
4622 int_fits_type_p (tree c, tree type)
4624 tree type_low_bound = TYPE_MIN_VALUE (type);
4625 tree type_high_bound = TYPE_MAX_VALUE (type);
4626 int ok_for_low_bound, ok_for_high_bound;
4628 /* Perform some generic filtering first, which may allow making a decision
4629 even if the bounds are not constant. First, negative integers never fit
4630 in unsigned types, */
4631 if ((TYPE_UNSIGNED (type) && tree_int_cst_sgn (c) < 0)
4632 /* Also, unsigned integers with top bit set never fit signed types. */
4633 || (! TYPE_UNSIGNED (type)
4634 && TYPE_UNSIGNED (TREE_TYPE (c)) && tree_int_cst_msb (c)))
4637 /* If at least one bound of the type is a constant integer, we can check
4638 ourselves and maybe make a decision. If no such decision is possible, but
4639 this type is a subtype, try checking against that. Otherwise, use
4640 force_fit_type, which checks against the precision.
4642 Compute the status for each possibly constant bound, and return if we see
4643 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4644 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4645 for "constant known to fit". */
4647 ok_for_low_bound = -1;
4648 ok_for_high_bound = -1;
4650 /* Check if C >= type_low_bound. */
4651 if (type_low_bound && TREE_CODE (type_low_bound) == INTEGER_CST)
4653 ok_for_low_bound = ! tree_int_cst_lt (c, type_low_bound);
4654 if (! ok_for_low_bound)
4658 /* Check if c <= type_high_bound. */
4659 if (type_high_bound && TREE_CODE (type_high_bound) == INTEGER_CST)
4661 ok_for_high_bound = ! tree_int_cst_lt (type_high_bound, c);
4662 if (! ok_for_high_bound)
4666 /* If the constant fits both bounds, the result is known. */
4667 if (ok_for_low_bound == 1 && ok_for_high_bound == 1)
4670 /* If we haven't been able to decide at this point, there nothing more we
4671 can check ourselves here. Look at the base type if we have one. */
4672 else if (TREE_CODE (type) == INTEGER_TYPE && TREE_TYPE (type) != 0)
4673 return int_fits_type_p (c, TREE_TYPE (type));
4675 /* Or to force_fit_type, if nothing else. */
4679 TREE_TYPE (c) = type;
4680 return !force_fit_type (c, 0);
4684 /* Subprogram of following function. Called by walk_tree.
4686 Return *TP if it is an automatic variable or parameter of the
4687 function passed in as DATA. */
4690 find_var_from_fn (tree *tp, int *walk_subtrees, void *data)
4692 tree fn = (tree) data;
4697 else if (DECL_P (*tp) && lang_hooks.tree_inlining.auto_var_in_fn_p (*tp, fn))
4703 /* Returns true if T is, contains, or refers to a type with variable
4704 size. If FN is nonzero, only return true if a modifier of the type
4705 or position of FN is a variable or parameter inside FN.
4707 This concept is more general than that of C99 'variably modified types':
4708 in C99, a struct type is never variably modified because a VLA may not
4709 appear as a structure member. However, in GNU C code like:
4711 struct S { int i[f()]; };
4713 is valid, and other languages may define similar constructs. */
4716 variably_modified_type_p (tree type, tree fn)
4720 /* Test if T is either variable (if FN is zero) or an expression containing
4721 a variable in FN. */
4722 #define RETURN_TRUE_IF_VAR(T) \
4723 do { tree _t = (T); \
4724 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4725 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4726 return true; } while (0)
4728 if (type == error_mark_node)
4731 /* If TYPE itself has variable size, it is variably modified.
4733 We do not yet have a representation of the C99 '[*]' syntax.
4734 When a representation is chosen, this function should be modified
4735 to test for that case as well. */
4736 RETURN_TRUE_IF_VAR (TYPE_SIZE (type));
4737 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type));
4739 switch (TREE_CODE (type))
4742 case REFERENCE_TYPE:
4746 if (variably_modified_type_p (TREE_TYPE (type), fn))
4752 /* If TYPE is a function type, it is variably modified if any of the
4753 parameters or the return type are variably modified. */
4754 if (variably_modified_type_p (TREE_TYPE (type), fn))
4757 for (t = TYPE_ARG_TYPES (type);
4758 t && t != void_list_node;
4760 if (variably_modified_type_p (TREE_VALUE (t), fn))
4769 /* Scalar types are variably modified if their end points
4771 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type));
4772 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type));
4777 case QUAL_UNION_TYPE:
4778 /* We can't see if any of the field are variably-modified by the
4779 definition we normally use, since that would produce infinite
4780 recursion via pointers. */
4781 /* This is variably modified if some field's type is. */
4782 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
4783 if (TREE_CODE (t) == FIELD_DECL)
4785 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t));
4786 RETURN_TRUE_IF_VAR (DECL_SIZE (t));
4787 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t));
4789 if (TREE_CODE (type) == QUAL_UNION_TYPE)
4790 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t));
4798 /* The current language may have other cases to check, but in general,
4799 all other types are not variably modified. */
4800 return lang_hooks.tree_inlining.var_mod_type_p (type, fn);
4802 #undef RETURN_TRUE_IF_VAR
4805 /* Given a DECL or TYPE, return the scope in which it was declared, or
4806 NULL_TREE if there is no containing scope. */
4809 get_containing_scope (tree t)
4811 return (TYPE_P (t) ? TYPE_CONTEXT (t) : DECL_CONTEXT (t));
4814 /* Return the innermost context enclosing DECL that is
4815 a FUNCTION_DECL, or zero if none. */
4818 decl_function_context (tree decl)
4822 if (TREE_CODE (decl) == ERROR_MARK)
4825 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4826 where we look up the function at runtime. Such functions always take
4827 a first argument of type 'pointer to real context'.
4829 C++ should really be fixed to use DECL_CONTEXT for the real context,
4830 and use something else for the "virtual context". */
4831 else if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VINDEX (decl))
4834 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
4836 context = DECL_CONTEXT (decl);
4838 while (context && TREE_CODE (context) != FUNCTION_DECL)
4840 if (TREE_CODE (context) == BLOCK)
4841 context = BLOCK_SUPERCONTEXT (context);
4843 context = get_containing_scope (context);
4849 /* Return the innermost context enclosing DECL that is
4850 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4851 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4854 decl_type_context (tree decl)
4856 tree context = DECL_CONTEXT (decl);
4859 switch (TREE_CODE (context))
4861 case NAMESPACE_DECL:
4862 case TRANSLATION_UNIT_DECL:
4867 case QUAL_UNION_TYPE:
4872 context = DECL_CONTEXT (context);
4876 context = BLOCK_SUPERCONTEXT (context);
4886 /* CALL is a CALL_EXPR. Return the declaration for the function
4887 called, or NULL_TREE if the called function cannot be
4891 get_callee_fndecl (tree call)
4895 /* It's invalid to call this function with anything but a
4897 if (TREE_CODE (call) != CALL_EXPR)
4900 /* The first operand to the CALL is the address of the function
4902 addr = TREE_OPERAND (call, 0);
4906 /* If this is a readonly function pointer, extract its initial value. */
4907 if (DECL_P (addr) && TREE_CODE (addr) != FUNCTION_DECL
4908 && TREE_READONLY (addr) && ! TREE_THIS_VOLATILE (addr)
4909 && DECL_INITIAL (addr))
4910 addr = DECL_INITIAL (addr);
4912 /* If the address is just `&f' for some function `f', then we know
4913 that `f' is being called. */
4914 if (TREE_CODE (addr) == ADDR_EXPR
4915 && TREE_CODE (TREE_OPERAND (addr, 0)) == FUNCTION_DECL)
4916 return TREE_OPERAND (addr, 0);
4918 /* We couldn't figure out what was being called. Maybe the front
4919 end has some idea. */
4920 return lang_hooks.lang_get_callee_fndecl (call);
4923 /* Print debugging information about tree nodes generated during the compile,
4924 and any language-specific information. */
4927 dump_tree_statistics (void)
4929 #ifdef GATHER_STATISTICS
4931 int total_nodes, total_bytes;
4934 fprintf (stderr, "\n??? tree nodes created\n\n");
4935 #ifdef GATHER_STATISTICS
4936 fprintf (stderr, "Kind Nodes Bytes\n");
4937 fprintf (stderr, "---------------------------------------\n");
4938 total_nodes = total_bytes = 0;
4939 for (i = 0; i < (int) all_kinds; i++)
4941 fprintf (stderr, "%-20s %7d %10d\n", tree_node_kind_names[i],
4942 tree_node_counts[i], tree_node_sizes[i]);
4943 total_nodes += tree_node_counts[i];
4944 total_bytes += tree_node_sizes[i];
4946 fprintf (stderr, "---------------------------------------\n");
4947 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_nodes, total_bytes);
4948 fprintf (stderr, "---------------------------------------\n");
4949 ssanames_print_statistics ();
4950 phinodes_print_statistics ();
4952 fprintf (stderr, "(No per-node statistics)\n");
4954 print_type_hash_statistics ();
4955 lang_hooks.print_statistics ();
4958 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4960 /* Generate a crc32 of a string. */
4963 crc32_string (unsigned chksum, const char *string)
4967 unsigned value = *string << 24;
4970 for (ix = 8; ix--; value <<= 1)
4974 feedback = (value ^ chksum) & 0x80000000 ? 0x04c11db7 : 0;
4983 /* P is a string that will be used in a symbol. Mask out any characters
4984 that are not valid in that context. */
4987 clean_symbol_name (char *p)
4991 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
4994 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5001 /* Generate a name for a function unique to this translation unit.
5002 TYPE is some string to identify the purpose of this function to the
5003 linker or collect2. */
5006 get_file_function_name_long (const char *type)
5012 if (first_global_object_name)
5013 p = first_global_object_name;
5016 /* We don't have anything that we know to be unique to this translation
5017 unit, so use what we do have and throw in some randomness. */
5019 const char *name = weak_global_object_name;
5020 const char *file = main_input_filename;
5025 file = input_filename;
5027 len = strlen (file);
5028 q = alloca (9 * 2 + len + 1);
5029 memcpy (q, file, len + 1);
5030 clean_symbol_name (q);
5032 sprintf (q + len, "_%08X_%08X", crc32_string (0, name),
5033 crc32_string (0, flag_random_seed));
5038 buf = alloca (sizeof (FILE_FUNCTION_FORMAT) + strlen (p) + strlen (type));
5040 /* Set up the name of the file-level functions we may need.
5041 Use a global object (which is already required to be unique over
5042 the program) rather than the file name (which imposes extra
5044 sprintf (buf, FILE_FUNCTION_FORMAT, type, p);
5046 return get_identifier (buf);
5049 /* If KIND=='I', return a suitable global initializer (constructor) name.
5050 If KIND=='D', return a suitable global clean-up (destructor) name. */
5053 get_file_function_name (int kind)
5060 return get_file_function_name_long (p);
5063 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5064 The result is placed in BUFFER (which has length BIT_SIZE),
5065 with one bit in each char ('\000' or '\001').
5067 If the constructor is constant, NULL_TREE is returned.
5068 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5071 get_set_constructor_bits (tree init, char *buffer, int bit_size)
5075 HOST_WIDE_INT domain_min
5076 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init))), 0);
5077 tree non_const_bits = NULL_TREE;
5079 for (i = 0; i < bit_size; i++)
5082 for (vals = TREE_OPERAND (init, 1);
5083 vals != NULL_TREE; vals = TREE_CHAIN (vals))
5085 if (!host_integerp (TREE_VALUE (vals), 0)
5086 || (TREE_PURPOSE (vals) != NULL_TREE
5087 && !host_integerp (TREE_PURPOSE (vals), 0)))
5089 = tree_cons (TREE_PURPOSE (vals), TREE_VALUE (vals), non_const_bits);
5090 else if (TREE_PURPOSE (vals) != NULL_TREE)
5092 /* Set a range of bits to ones. */
5093 HOST_WIDE_INT lo_index
5094 = tree_low_cst (TREE_PURPOSE (vals), 0) - domain_min;
5095 HOST_WIDE_INT hi_index
5096 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5098 if (lo_index < 0 || lo_index >= bit_size
5099 || hi_index < 0 || hi_index >= bit_size)
5101 for (; lo_index <= hi_index; lo_index++)
5102 buffer[lo_index] = 1;
5106 /* Set a single bit to one. */
5108 = tree_low_cst (TREE_VALUE (vals), 0) - domain_min;
5109 if (index < 0 || index >= bit_size)
5111 error ("invalid initializer for bit string");
5117 return non_const_bits;
5120 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5121 The result is placed in BUFFER (which is an array of bytes).
5122 If the constructor is constant, NULL_TREE is returned.
5123 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5126 get_set_constructor_bytes (tree init, unsigned char *buffer, int wd_size)
5129 int set_word_size = BITS_PER_UNIT;
5130 int bit_size = wd_size * set_word_size;
5132 unsigned char *bytep = buffer;
5133 char *bit_buffer = alloca (bit_size);
5134 tree non_const_bits = get_set_constructor_bits (init, bit_buffer, bit_size);
5136 for (i = 0; i < wd_size; i++)
5139 for (i = 0; i < bit_size; i++)
5143 if (BYTES_BIG_ENDIAN)
5144 *bytep |= (1 << (set_word_size - 1 - bit_pos));
5146 *bytep |= 1 << bit_pos;
5149 if (bit_pos >= set_word_size)
5150 bit_pos = 0, bytep++;
5152 return non_const_bits;
5155 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5157 /* Complain that the tree code of NODE does not match the expected 0
5158 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5162 tree_check_failed (const tree node, const char *file,
5163 int line, const char *function, ...)
5167 unsigned length = 0;
5170 va_start (args, function);
5171 while ((code = va_arg (args, int)))
5172 length += 4 + strlen (tree_code_name[code]);
5174 va_start (args, function);
5175 buffer = alloca (length);
5177 while ((code = va_arg (args, int)))
5181 strcpy (buffer + length, " or ");
5184 strcpy (buffer + length, tree_code_name[code]);
5185 length += strlen (tree_code_name[code]);
5189 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5190 buffer, tree_code_name[TREE_CODE (node)],
5191 function, trim_filename (file), line);
5194 /* Complain that the tree code of NODE does match the expected 0
5195 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5199 tree_not_check_failed (const tree node, const char *file,
5200 int line, const char *function, ...)
5204 unsigned length = 0;
5207 va_start (args, function);
5208 while ((code = va_arg (args, int)))
5209 length += 4 + strlen (tree_code_name[code]);
5211 va_start (args, function);
5212 buffer = alloca (length);
5214 while ((code = va_arg (args, int)))
5218 strcpy (buffer + length, " or ");
5221 strcpy (buffer + length, tree_code_name[code]);
5222 length += strlen (tree_code_name[code]);
5226 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5227 buffer, tree_code_name[TREE_CODE (node)],
5228 function, trim_filename (file), line);
5231 /* Similar to tree_check_failed, except that we check for a class of tree
5232 code, given in CL. */
5235 tree_class_check_failed (const tree node, int cl, const char *file,
5236 int line, const char *function)
5239 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5240 cl, TREE_CODE_CLASS (TREE_CODE (node)),
5241 tree_code_name[TREE_CODE (node)], function, trim_filename (file), line);
5244 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5245 (dynamically sized) vector. */
5248 tree_vec_elt_check_failed (int idx, int len, const char *file, int line,
5249 const char *function)
5252 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5253 idx + 1, len, function, trim_filename (file), line);
5256 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5257 (dynamically sized) vector. */
5260 phi_node_elt_check_failed (int idx, int len, const char *file, int line,
5261 const char *function)
5264 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5265 idx + 1, len, function, trim_filename (file), line);
5268 /* Similar to above, except that the check is for the bounds of the operand
5269 vector of an expression node. */
5272 tree_operand_check_failed (int idx, enum tree_code code, const char *file,
5273 int line, const char *function)
5276 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5277 idx + 1, tree_code_name[code], TREE_CODE_LENGTH (code),
5278 function, trim_filename (file), line);
5280 #endif /* ENABLE_TREE_CHECKING */
5282 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5283 and mapped to the machine mode MODE. Initialize its fields and build
5284 the information necessary for debugging output. */
5287 make_vector_type (tree innertype, int nunits, enum machine_mode mode)
5289 tree t = make_node (VECTOR_TYPE);
5291 TREE_TYPE (t) = innertype;
5292 TYPE_VECTOR_SUBPARTS (t) = nunits;
5293 TYPE_MODE (t) = mode;
5297 tree index = build_int_2 (nunits - 1, 0);
5298 tree array = build_array_type (innertype, build_index_type (index));
5299 tree rt = make_node (RECORD_TYPE);
5301 TYPE_FIELDS (rt) = build_decl (FIELD_DECL, get_identifier ("f"), array);
5302 DECL_CONTEXT (TYPE_FIELDS (rt)) = rt;
5304 TYPE_DEBUG_REPRESENTATION_TYPE (t) = rt;
5305 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5306 the representation type, and we want to find that die when looking up
5307 the vector type. This is most easily achieved by making the TYPE_UID
5309 TYPE_UID (rt) = TYPE_UID (t);
5316 make_or_reuse_type (unsigned size, int unsignedp)
5318 if (size == INT_TYPE_SIZE)
5319 return unsignedp ? unsigned_type_node : integer_type_node;
5320 if (size == CHAR_TYPE_SIZE)
5321 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5322 if (size == SHORT_TYPE_SIZE)
5323 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5324 if (size == LONG_TYPE_SIZE)
5325 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5326 if (size == LONG_LONG_TYPE_SIZE)
5327 return (unsignedp ? long_long_unsigned_type_node
5328 : long_long_integer_type_node);
5331 return make_unsigned_type (size);
5333 return make_signed_type (size);
5336 /* Create nodes for all integer types (and error_mark_node) using the sizes
5337 of C datatypes. The caller should call set_sizetype soon after calling
5338 this function to select one of the types as sizetype. */
5341 build_common_tree_nodes (int signed_char)
5343 error_mark_node = make_node (ERROR_MARK);
5344 TREE_TYPE (error_mark_node) = error_mark_node;
5346 initialize_sizetypes ();
5348 /* Define both `signed char' and `unsigned char'. */
5349 signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
5350 unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
5352 /* Define `char', which is like either `signed char' or `unsigned char'
5353 but not the same as either. */
5356 ? make_signed_type (CHAR_TYPE_SIZE)
5357 : make_unsigned_type (CHAR_TYPE_SIZE));
5359 short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
5360 short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
5361 integer_type_node = make_signed_type (INT_TYPE_SIZE);
5362 unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
5363 long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
5364 long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
5365 long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
5366 long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
5368 /* Define a boolean type. This type only represents boolean values but
5369 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5370 Front ends which want to override this size (i.e. Java) can redefine
5371 boolean_type_node before calling build_common_tree_nodes_2. */
5372 boolean_type_node = make_unsigned_type (BOOL_TYPE_SIZE);
5373 TREE_SET_CODE (boolean_type_node, BOOLEAN_TYPE);
5374 TYPE_MAX_VALUE (boolean_type_node) = build_int_2 (1, 0);
5375 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node)) = boolean_type_node;
5376 TYPE_PRECISION (boolean_type_node) = 1;
5378 /* Fill in the rest of the sized types. Reuse existing type nodes
5380 intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 0);
5381 intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 0);
5382 intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 0);
5383 intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 0);
5384 intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 0);
5386 unsigned_intQI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (QImode), 1);
5387 unsigned_intHI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (HImode), 1);
5388 unsigned_intSI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (SImode), 1);
5389 unsigned_intDI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (DImode), 1);
5390 unsigned_intTI_type_node = make_or_reuse_type (GET_MODE_BITSIZE (TImode), 1);
5392 access_public_node = get_identifier ("public");
5393 access_protected_node = get_identifier ("protected");
5394 access_private_node = get_identifier ("private");
5397 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5398 It will create several other common tree nodes. */
5401 build_common_tree_nodes_2 (int short_double)
5403 /* Define these next since types below may used them. */
5404 integer_zero_node = build_int_2 (0, 0);
5405 integer_one_node = build_int_2 (1, 0);
5406 integer_minus_one_node = build_int_2 (-1, -1);
5408 size_zero_node = size_int (0);
5409 size_one_node = size_int (1);
5410 bitsize_zero_node = bitsize_int (0);
5411 bitsize_one_node = bitsize_int (1);
5412 bitsize_unit_node = bitsize_int (BITS_PER_UNIT);
5414 boolean_false_node = TYPE_MIN_VALUE (boolean_type_node);
5415 boolean_true_node = TYPE_MAX_VALUE (boolean_type_node);
5417 void_type_node = make_node (VOID_TYPE);
5418 layout_type (void_type_node);
5420 /* We are not going to have real types in C with less than byte alignment,
5421 so we might as well not have any types that claim to have it. */
5422 TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
5423 TYPE_USER_ALIGN (void_type_node) = 0;
5425 null_pointer_node = build_int_2 (0, 0);
5426 TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
5427 layout_type (TREE_TYPE (null_pointer_node));
5429 ptr_type_node = build_pointer_type (void_type_node);
5431 = build_pointer_type (build_type_variant (void_type_node, 1, 0));
5432 fileptr_type_node = ptr_type_node;
5434 float_type_node = make_node (REAL_TYPE);
5435 TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
5436 layout_type (float_type_node);
5438 double_type_node = make_node (REAL_TYPE);
5440 TYPE_PRECISION (double_type_node) = FLOAT_TYPE_SIZE;
5442 TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
5443 layout_type (double_type_node);
5445 long_double_type_node = make_node (REAL_TYPE);
5446 TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
5447 layout_type (long_double_type_node);
5449 float_ptr_type_node = build_pointer_type (float_type_node);
5450 double_ptr_type_node = build_pointer_type (double_type_node);
5451 long_double_ptr_type_node = build_pointer_type (long_double_type_node);
5452 integer_ptr_type_node = build_pointer_type (integer_type_node);
5454 complex_integer_type_node = make_node (COMPLEX_TYPE);
5455 TREE_TYPE (complex_integer_type_node) = integer_type_node;
5456 layout_type (complex_integer_type_node);
5458 complex_float_type_node = make_node (COMPLEX_TYPE);
5459 TREE_TYPE (complex_float_type_node) = float_type_node;
5460 layout_type (complex_float_type_node);
5462 complex_double_type_node = make_node (COMPLEX_TYPE);
5463 TREE_TYPE (complex_double_type_node) = double_type_node;
5464 layout_type (complex_double_type_node);
5466 complex_long_double_type_node = make_node (COMPLEX_TYPE);
5467 TREE_TYPE (complex_long_double_type_node) = long_double_type_node;
5468 layout_type (complex_long_double_type_node);
5471 tree t = targetm.build_builtin_va_list ();
5473 /* Many back-ends define record types without setting TYPE_NAME.
5474 If we copied the record type here, we'd keep the original
5475 record type without a name. This breaks name mangling. So,
5476 don't copy record types and let c_common_nodes_and_builtins()
5477 declare the type to be __builtin_va_list. */
5478 if (TREE_CODE (t) != RECORD_TYPE)
5479 t = build_type_copy (t);
5481 va_list_type_node = t;
5485 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5488 If we requested a pointer to a vector, build up the pointers that
5489 we stripped off while looking for the inner type. Similarly for
5490 return values from functions.
5492 The argument TYPE is the top of the chain, and BOTTOM is the
5493 new type which we will point to. */
5496 reconstruct_complex_type (tree type, tree bottom)
5500 if (POINTER_TYPE_P (type))
5502 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5503 outer = build_pointer_type (inner);
5505 else if (TREE_CODE (type) == ARRAY_TYPE)
5507 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5508 outer = build_array_type (inner, TYPE_DOMAIN (type));
5510 else if (TREE_CODE (type) == FUNCTION_TYPE)
5512 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5513 outer = build_function_type (inner, TYPE_ARG_TYPES (type));
5515 else if (TREE_CODE (type) == METHOD_TYPE)
5517 inner = reconstruct_complex_type (TREE_TYPE (type), bottom);
5518 outer = build_method_type_directly (TYPE_METHOD_BASETYPE (type),
5520 TYPE_ARG_TYPES (type));
5525 TYPE_READONLY (outer) = TYPE_READONLY (type);
5526 TYPE_VOLATILE (outer) = TYPE_VOLATILE (type);
5531 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5534 build_vector_type_for_mode (tree innertype, enum machine_mode mode)
5538 if (GET_MODE_CLASS (mode) == MODE_VECTOR_INT
5539 || GET_MODE_CLASS (mode) == MODE_VECTOR_FLOAT)
5540 nunits = GET_MODE_NUNITS (mode);
5542 else if (GET_MODE_CLASS (mode) == MODE_INT)
5544 /* Check that there are no leftover bits. */
5545 if (GET_MODE_BITSIZE (mode) % TREE_INT_CST_LOW (TYPE_SIZE (innertype)))
5548 nunits = GET_MODE_BITSIZE (mode)
5549 / TREE_INT_CST_LOW (TYPE_SIZE (innertype));
5554 return make_vector_type (innertype, nunits, mode);
5557 /* Similarly, but takes the inner type and number of units, which must be
5561 build_vector_type (tree innertype, int nunits)
5563 return make_vector_type (innertype, nunits, VOIDmode);
5566 /* Given an initializer INIT, return TRUE if INIT is zero or some
5567 aggregate of zeros. Otherwise return FALSE. */
5569 initializer_zerop (tree init)
5575 switch (TREE_CODE (init))
5578 return integer_zerop (init);
5581 /* ??? Note that this is not correct for C4X float formats. There,
5582 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5583 negative exponent. */
5584 return real_zerop (init)
5585 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init));
5588 return integer_zerop (init)
5589 || (real_zerop (init)
5590 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init)))
5591 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init))));
5594 for (elt = TREE_VECTOR_CST_ELTS (init); elt; elt = TREE_CHAIN (elt))
5595 if (!initializer_zerop (TREE_VALUE (elt)))
5600 elt = CONSTRUCTOR_ELTS (init);
5601 if (elt == NULL_TREE)
5604 /* A set is empty only if it has no elements. */
5605 if (TREE_CODE (TREE_TYPE (init)) == SET_TYPE)
5608 for (; elt ; elt = TREE_CHAIN (elt))
5609 if (! initializer_zerop (TREE_VALUE (elt)))
5619 add_var_to_bind_expr (tree bind_expr, tree var)
5621 BIND_EXPR_VARS (bind_expr)
5622 = chainon (BIND_EXPR_VARS (bind_expr), var);
5623 if (BIND_EXPR_BLOCK (bind_expr))
5624 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr))
5625 = BIND_EXPR_VARS (bind_expr);
5628 /* Build an empty statement. */
5631 build_empty_stmt (void)
5633 return build1 (NOP_EXPR, void_type_node, size_zero_node);
5637 /* Returns true if it is possible to prove that the index of
5638 an array access REF (an ARRAY_REF expression) falls into the
5642 in_array_bounds_p (tree ref)
5644 tree idx = TREE_OPERAND (ref, 1);
5647 if (TREE_CODE (idx) != INTEGER_CST)
5650 min = array_ref_low_bound (ref);
5651 max = array_ref_up_bound (ref);
5654 || TREE_CODE (min) != INTEGER_CST
5655 || TREE_CODE (max) != INTEGER_CST)
5658 if (tree_int_cst_lt (idx, min)
5659 || tree_int_cst_lt (max, idx))
5665 /* Return true if T (assumed to be a DECL) must be assigned a memory
5669 needs_to_live_in_memory (tree t)
5671 return (DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL (t)
5673 || DECL_EXTERNAL (t)
5674 || (TREE_CODE (t) == RESULT_DECL
5675 && aggregate_value_p (t, current_function_decl)));
5678 /* There are situations in which a language considers record types
5679 compatible which have different field lists. Decide if two fields
5680 are compatible. It is assumed that the parent records are compatible. */
5683 fields_compatible_p (tree f1, tree f2)
5685 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1),
5686 DECL_FIELD_BIT_OFFSET (f2), OEP_ONLY_CONST))
5689 if (!operand_equal_p (DECL_FIELD_OFFSET (f1),
5690 DECL_FIELD_OFFSET (f2), OEP_ONLY_CONST))
5693 if (!lang_hooks.types_compatible_p (TREE_TYPE (f1), TREE_TYPE (f2)))
5699 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5702 find_compatible_field (tree record, tree orig_field)
5706 for (f = TYPE_FIELDS (record); f ; f = TREE_CHAIN (f))
5707 if (TREE_CODE (f) == FIELD_DECL
5708 && fields_compatible_p (f, orig_field))
5711 /* ??? Why isn't this on the main fields list? */
5712 f = TYPE_VFIELD (record);
5713 if (f && TREE_CODE (f) == FIELD_DECL
5714 && fields_compatible_p (f, orig_field))
5717 /* ??? We should abort here, but Java appears to do Bad Things
5718 with inherited fields. */
5722 /* Return value of a constant X. */
5725 int_cst_value (tree x)
5727 unsigned bits = TYPE_PRECISION (TREE_TYPE (x));
5728 unsigned HOST_WIDE_INT val = TREE_INT_CST_LOW (x);
5729 bool negative = ((val >> (bits - 1)) & 1) != 0;
5731 if (bits > HOST_BITS_PER_WIDE_INT)
5735 val |= (~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1;
5737 val &= ~((~(unsigned HOST_WIDE_INT) 0) << (bits - 1) << 1);
5742 /* Returns the greatest common divisor of A and B, which must be
5746 tree_fold_gcd (tree a, tree b)
5749 tree type = TREE_TYPE (a);
5751 #if defined ENABLE_CHECKING
5752 if (TREE_CODE (a) != INTEGER_CST
5753 || TREE_CODE (b) != INTEGER_CST)
5757 if (integer_zerop (a))
5760 if (integer_zerop (b))
5763 if (tree_int_cst_sgn (a) == -1)
5764 a = fold (build (MULT_EXPR, type, a,
5765 convert (type, integer_minus_one_node)));
5767 if (tree_int_cst_sgn (b) == -1)
5768 b = fold (build (MULT_EXPR, type, b,
5769 convert (type, integer_minus_one_node)));
5773 a_mod_b = fold (build (CEIL_MOD_EXPR, type, a, b));
5775 if (!TREE_INT_CST_LOW (a_mod_b)
5776 && !TREE_INT_CST_HIGH (a_mod_b))
5784 #include "gt-tree.h"