1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 /* obstack.[ch] explicitly declined to prototype this. */
53 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
55 #ifdef GATHER_STATISTICS
56 /* Statistics-gathering stuff. */
58 int tree_node_counts
[(int) all_kinds
];
59 int tree_node_sizes
[(int) all_kinds
];
61 /* Keep in sync with tree.h:enum tree_node_kind. */
62 static const char * const tree_node_kind_names
[] = {
81 #endif /* GATHER_STATISTICS */
83 /* Unique id for next decl created. */
84 static GTY(()) int next_decl_uid
;
85 /* Unique id for next type created. */
86 static GTY(()) int next_type_uid
= 1;
88 /* Since we cannot rehash a type after it is in the table, we have to
89 keep the hash code. */
91 struct type_hash
GTY(())
97 /* Initial size of the hash table (rounded to next prime). */
98 #define TYPE_HASH_INITIAL_SIZE 1000
100 /* Now here is the hash table. When recording a type, it is added to
101 the slot whose index is the hash code. Note that the hash table is
102 used for several kinds of types (function types, array types and
103 array index range types, for now). While all these live in the
104 same table, they are completely independent, and the hash code is
105 computed differently for each of these. */
107 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
108 htab_t type_hash_table
;
110 static void set_type_quals (tree
, int);
111 static int type_hash_eq (const void *, const void *);
112 static hashval_t
type_hash_hash (const void *);
113 static void print_type_hash_statistics (void);
114 static void finish_vector_type (tree
);
115 static int type_hash_marked_p (const void *);
116 static unsigned int type_hash_list (tree
, hashval_t
);
117 static unsigned int attribute_hash_list (tree
, hashval_t
);
119 tree global_trees
[TI_MAX
];
120 tree integer_types
[itk_none
];
127 /* Initialize the hash table of types. */
128 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
133 /* The name of the object as the assembler will see it (but before any
134 translations made by ASM_OUTPUT_LABELREF). Often this is the same
135 as DECL_NAME. It is an IDENTIFIER_NODE. */
137 decl_assembler_name (tree decl
)
139 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
140 lang_hooks
.set_decl_assembler_name (decl
);
141 return DECL_CHECK (decl
)->decl
.assembler_name
;
144 /* Compute the number of bytes occupied by 'node'. This routine only
145 looks at TREE_CODE and, if the code is TREE_VEC, TREE_VEC_LENGTH. */
147 tree_size (tree node
)
149 enum tree_code code
= TREE_CODE (node
);
151 switch (TREE_CODE_CLASS (code
))
153 case 'd': /* A decl node */
154 return sizeof (struct tree_decl
);
156 case 't': /* a type node */
157 return sizeof (struct tree_type
);
159 case 'r': /* a reference */
160 case 'e': /* an expression */
161 case 's': /* an expression with side effects */
162 case '<': /* a comparison expression */
163 case '1': /* a unary arithmetic expression */
164 case '2': /* a binary arithmetic expression */
165 return (sizeof (struct tree_exp
)
166 + TREE_CODE_LENGTH (code
) * sizeof (char *) - sizeof (char *));
168 case 'c': /* a constant */
171 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
172 case REAL_CST
: return sizeof (struct tree_real_cst
);
173 case COMPLEX_CST
: return sizeof (struct tree_complex
);
174 case VECTOR_CST
: return sizeof (struct tree_vector
);
175 case STRING_CST
: return sizeof (struct tree_string
);
177 return lang_hooks
.tree_size (code
);
180 case 'x': /* something random, like an identifier. */
183 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
184 case TREE_LIST
: return sizeof (struct tree_list
);
185 case TREE_VEC
: return (sizeof (struct tree_vec
)
186 + TREE_VEC_LENGTH(node
) * sizeof(char *)
190 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
192 case PHI_NODE
: return (sizeof (struct tree_phi_node
)
193 + (PHI_ARG_CAPACITY (node
) - 1) *
194 sizeof (struct phi_arg_d
));
196 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
198 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
199 case BLOCK
: return sizeof (struct tree_block
);
200 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
203 return lang_hooks
.tree_size (code
);
211 /* Return a newly allocated node of code CODE.
212 For decl and type nodes, some other fields are initialized.
213 The rest of the node is initialized to zero.
215 Achoo! I got a code in the node. */
218 make_node_stat (enum tree_code code MEM_STAT_DECL
)
221 int type
= TREE_CODE_CLASS (code
);
223 #ifdef GATHER_STATISTICS
226 struct tree_common ttmp
;
228 /* We can't allocate a TREE_VEC, PHI_NODE, or STRING_CST
229 without knowing how many elements it will have. */
230 if (code
== TREE_VEC
|| code
== PHI_NODE
)
233 TREE_SET_CODE ((tree
)&ttmp
, code
);
234 length
= tree_size ((tree
)&ttmp
);
236 #ifdef GATHER_STATISTICS
239 case 'd': /* A decl node */
243 case 't': /* a type node */
247 case 's': /* an expression with side effects */
251 case 'r': /* a reference */
255 case 'e': /* an expression */
256 case '<': /* a comparison expression */
257 case '1': /* a unary arithmetic expression */
258 case '2': /* a binary arithmetic expression */
262 case 'c': /* a constant */
266 case 'x': /* something random, like an identifier. */
267 if (code
== IDENTIFIER_NODE
)
269 else if (code
== TREE_VEC
)
271 else if (code
== TREE_BINFO
)
273 else if (code
== PHI_NODE
)
275 else if (code
== SSA_NAME
)
276 kind
= ssa_name_kind
;
277 else if (code
== BLOCK
)
287 tree_node_counts
[(int) kind
]++;
288 tree_node_sizes
[(int) kind
] += length
;
291 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
293 memset (t
, 0, length
);
295 TREE_SET_CODE (t
, code
);
300 TREE_SIDE_EFFECTS (t
) = 1;
304 if (code
!= FUNCTION_DECL
)
306 DECL_USER_ALIGN (t
) = 0;
307 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
308 DECL_SOURCE_LOCATION (t
) = input_location
;
309 DECL_UID (t
) = next_decl_uid
++;
311 /* We have not yet computed the alias set for this declaration. */
312 DECL_POINTER_ALIAS_SET (t
) = -1;
316 TYPE_UID (t
) = next_type_uid
++;
317 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
318 TYPE_USER_ALIGN (t
) = 0;
319 TYPE_MAIN_VARIANT (t
) = t
;
321 /* Default to no attributes for type, but let target change that. */
322 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
323 targetm
.set_default_type_attributes (t
);
325 /* We have not yet computed the alias set for this type. */
326 TYPE_ALIAS_SET (t
) = -1;
330 TREE_CONSTANT (t
) = 1;
331 TREE_INVARIANT (t
) = 1;
340 case PREDECREMENT_EXPR
:
341 case PREINCREMENT_EXPR
:
342 case POSTDECREMENT_EXPR
:
343 case POSTINCREMENT_EXPR
:
344 /* All of these have side-effects, no matter what their
346 TREE_SIDE_EFFECTS (t
) = 1;
358 /* Return a new node with the same contents as NODE except that its
359 TREE_CHAIN is zero and it has a fresh uid. */
362 copy_node_stat (tree node MEM_STAT_DECL
)
365 enum tree_code code
= TREE_CODE (node
);
368 #ifdef ENABLE_CHECKING
369 if (code
== STATEMENT_LIST
)
373 length
= tree_size (node
);
374 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
375 memcpy (t
, node
, length
);
378 TREE_ASM_WRITTEN (t
) = 0;
379 TREE_VISITED (t
) = 0;
382 if (TREE_CODE_CLASS (code
) == 'd')
383 DECL_UID (t
) = next_decl_uid
++;
384 else if (TREE_CODE_CLASS (code
) == 't')
386 TYPE_UID (t
) = next_type_uid
++;
387 /* The following is so that the debug code for
388 the copy is different from the original type.
389 The two statements usually duplicate each other
390 (because they clear fields of the same union),
391 but the optimizer should catch that. */
392 TYPE_SYMTAB_POINTER (t
) = 0;
393 TYPE_SYMTAB_ADDRESS (t
) = 0;
399 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
400 For example, this can copy a list made of TREE_LIST nodes. */
403 copy_list (tree list
)
411 head
= prev
= copy_node (list
);
412 next
= TREE_CHAIN (list
);
415 TREE_CHAIN (prev
) = copy_node (next
);
416 prev
= TREE_CHAIN (prev
);
417 next
= TREE_CHAIN (next
);
423 /* Return a newly constructed INTEGER_CST node whose constant value
424 is specified by the two ints LOW and HI.
425 The TREE_TYPE is set to `int'.
427 This function should be used via the `build_int_2' macro. */
430 build_int_2_wide (unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
432 tree t
= make_node (INTEGER_CST
);
434 TREE_INT_CST_LOW (t
) = low
;
435 TREE_INT_CST_HIGH (t
) = hi
;
436 TREE_TYPE (t
) = integer_type_node
;
440 /* Return a new VECTOR_CST node whose type is TYPE and whose values
441 are in a list pointed by VALS. */
444 build_vector (tree type
, tree vals
)
446 tree v
= make_node (VECTOR_CST
);
447 int over1
= 0, over2
= 0;
450 TREE_VECTOR_CST_ELTS (v
) = vals
;
451 TREE_TYPE (v
) = type
;
453 /* Iterate through elements and check for overflow. */
454 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
456 tree value
= TREE_VALUE (link
);
458 over1
|= TREE_OVERFLOW (value
);
459 over2
|= TREE_CONSTANT_OVERFLOW (value
);
462 TREE_OVERFLOW (v
) = over1
;
463 TREE_CONSTANT_OVERFLOW (v
) = over2
;
468 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
469 are in a list pointed to by VALS. */
471 build_constructor (tree type
, tree vals
)
473 tree c
= make_node (CONSTRUCTOR
);
474 TREE_TYPE (c
) = type
;
475 CONSTRUCTOR_ELTS (c
) = vals
;
477 /* ??? May not be necessary. Mirrors what build does. */
480 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
481 TREE_READONLY (c
) = TREE_READONLY (vals
);
482 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
483 TREE_INVARIANT (c
) = TREE_INVARIANT (vals
);
489 /* Return a new REAL_CST node whose type is TYPE and value is D. */
492 build_real (tree type
, REAL_VALUE_TYPE d
)
498 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
499 Consider doing it via real_convert now. */
501 v
= make_node (REAL_CST
);
502 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
503 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
505 TREE_TYPE (v
) = type
;
506 TREE_REAL_CST_PTR (v
) = dp
;
507 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
511 /* Return a new REAL_CST node whose type is TYPE
512 and whose value is the integer value of the INTEGER_CST node I. */
515 real_value_from_int_cst (tree type
, tree i
)
519 /* Clear all bits of the real value type so that we can later do
520 bitwise comparisons to see if two values are the same. */
521 memset (&d
, 0, sizeof d
);
523 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
524 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
525 TYPE_UNSIGNED (TREE_TYPE (i
)));
529 /* Given a tree representing an integer constant I, return a tree
530 representing the same value as a floating-point constant of type TYPE. */
533 build_real_from_int_cst (tree type
, tree i
)
536 int overflow
= TREE_OVERFLOW (i
);
538 v
= build_real (type
, real_value_from_int_cst (type
, i
));
540 TREE_OVERFLOW (v
) |= overflow
;
541 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
545 /* Return a newly constructed STRING_CST node whose value is
546 the LEN characters at STR.
547 The TREE_TYPE is not initialized. */
550 build_string (int len
, const char *str
)
552 tree s
= make_node (STRING_CST
);
554 TREE_STRING_LENGTH (s
) = len
;
555 TREE_STRING_POINTER (s
) = ggc_alloc_string (str
, len
);
560 /* Return a newly constructed COMPLEX_CST node whose value is
561 specified by the real and imaginary parts REAL and IMAG.
562 Both REAL and IMAG should be constant nodes. TYPE, if specified,
563 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
566 build_complex (tree type
, tree real
, tree imag
)
568 tree t
= make_node (COMPLEX_CST
);
570 TREE_REALPART (t
) = real
;
571 TREE_IMAGPART (t
) = imag
;
572 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
573 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
574 TREE_CONSTANT_OVERFLOW (t
)
575 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
579 /* Build a BINFO with LEN language slots. */
582 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
585 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
586 + VEC_embedded_size (tree
, base_binfos
));
588 #ifdef GATHER_STATISTICS
589 tree_node_counts
[(int) binfo_kind
]++;
590 tree_node_sizes
[(int) binfo_kind
] += length
;
593 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
595 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
597 TREE_SET_CODE (t
, TREE_BINFO
);
599 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
605 /* Build a newly constructed TREE_VEC node of length LEN. */
608 make_tree_vec_stat (int len MEM_STAT_DECL
)
611 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
613 #ifdef GATHER_STATISTICS
614 tree_node_counts
[(int) vec_kind
]++;
615 tree_node_sizes
[(int) vec_kind
] += length
;
618 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
620 memset (t
, 0, length
);
622 TREE_SET_CODE (t
, TREE_VEC
);
623 TREE_VEC_LENGTH (t
) = len
;
628 /* Return 1 if EXPR is the integer constant zero or a complex constant
632 integer_zerop (tree expr
)
636 return ((TREE_CODE (expr
) == INTEGER_CST
637 && ! TREE_CONSTANT_OVERFLOW (expr
)
638 && TREE_INT_CST_LOW (expr
) == 0
639 && TREE_INT_CST_HIGH (expr
) == 0)
640 || (TREE_CODE (expr
) == COMPLEX_CST
641 && integer_zerop (TREE_REALPART (expr
))
642 && integer_zerop (TREE_IMAGPART (expr
))));
645 /* Return 1 if EXPR is the integer constant one or the corresponding
649 integer_onep (tree expr
)
653 return ((TREE_CODE (expr
) == INTEGER_CST
654 && ! TREE_CONSTANT_OVERFLOW (expr
)
655 && TREE_INT_CST_LOW (expr
) == 1
656 && TREE_INT_CST_HIGH (expr
) == 0)
657 || (TREE_CODE (expr
) == COMPLEX_CST
658 && integer_onep (TREE_REALPART (expr
))
659 && integer_zerop (TREE_IMAGPART (expr
))));
662 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
663 it contains. Likewise for the corresponding complex constant. */
666 integer_all_onesp (tree expr
)
673 if (TREE_CODE (expr
) == COMPLEX_CST
674 && integer_all_onesp (TREE_REALPART (expr
))
675 && integer_zerop (TREE_IMAGPART (expr
)))
678 else if (TREE_CODE (expr
) != INTEGER_CST
679 || TREE_CONSTANT_OVERFLOW (expr
))
682 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
684 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
685 && TREE_INT_CST_HIGH (expr
) == -1);
687 /* Note that using TYPE_PRECISION here is wrong. We care about the
688 actual bits, not the (arbitrary) range of the type. */
689 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
690 if (prec
>= HOST_BITS_PER_WIDE_INT
)
692 HOST_WIDE_INT high_value
;
695 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
697 if (shift_amount
> HOST_BITS_PER_WIDE_INT
)
698 /* Can not handle precisions greater than twice the host int size. */
700 else if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
701 /* Shifting by the host word size is undefined according to the ANSI
702 standard, so we must handle this as a special case. */
705 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
707 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
708 && TREE_INT_CST_HIGH (expr
) == high_value
);
711 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
714 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
718 integer_pow2p (tree expr
)
721 HOST_WIDE_INT high
, low
;
725 if (TREE_CODE (expr
) == COMPLEX_CST
726 && integer_pow2p (TREE_REALPART (expr
))
727 && integer_zerop (TREE_IMAGPART (expr
)))
730 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
733 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
734 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
735 high
= TREE_INT_CST_HIGH (expr
);
736 low
= TREE_INT_CST_LOW (expr
);
738 /* First clear all bits that are beyond the type's precision in case
739 we've been sign extended. */
741 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
743 else if (prec
> HOST_BITS_PER_WIDE_INT
)
744 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
748 if (prec
< HOST_BITS_PER_WIDE_INT
)
749 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
752 if (high
== 0 && low
== 0)
755 return ((high
== 0 && (low
& (low
- 1)) == 0)
756 || (low
== 0 && (high
& (high
- 1)) == 0));
759 /* Return 1 if EXPR is an integer constant other than zero or a
760 complex constant other than zero. */
763 integer_nonzerop (tree expr
)
767 return ((TREE_CODE (expr
) == INTEGER_CST
768 && ! TREE_CONSTANT_OVERFLOW (expr
)
769 && (TREE_INT_CST_LOW (expr
) != 0
770 || TREE_INT_CST_HIGH (expr
) != 0))
771 || (TREE_CODE (expr
) == COMPLEX_CST
772 && (integer_nonzerop (TREE_REALPART (expr
))
773 || integer_nonzerop (TREE_IMAGPART (expr
)))));
776 /* Return the power of two represented by a tree node known to be a
780 tree_log2 (tree expr
)
783 HOST_WIDE_INT high
, low
;
787 if (TREE_CODE (expr
) == COMPLEX_CST
)
788 return tree_log2 (TREE_REALPART (expr
));
790 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
791 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
793 high
= TREE_INT_CST_HIGH (expr
);
794 low
= TREE_INT_CST_LOW (expr
);
796 /* First clear all bits that are beyond the type's precision in case
797 we've been sign extended. */
799 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
801 else if (prec
> HOST_BITS_PER_WIDE_INT
)
802 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
806 if (prec
< HOST_BITS_PER_WIDE_INT
)
807 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
810 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
814 /* Similar, but return the largest integer Y such that 2 ** Y is less
815 than or equal to EXPR. */
818 tree_floor_log2 (tree expr
)
821 HOST_WIDE_INT high
, low
;
825 if (TREE_CODE (expr
) == COMPLEX_CST
)
826 return tree_log2 (TREE_REALPART (expr
));
828 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
829 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
831 high
= TREE_INT_CST_HIGH (expr
);
832 low
= TREE_INT_CST_LOW (expr
);
834 /* First clear all bits that are beyond the type's precision in case
835 we've been sign extended. Ignore if type's precision hasn't been set
836 since what we are doing is setting it. */
838 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
840 else if (prec
> HOST_BITS_PER_WIDE_INT
)
841 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
845 if (prec
< HOST_BITS_PER_WIDE_INT
)
846 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
849 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
853 /* Return 1 if EXPR is the real constant zero. */
856 real_zerop (tree expr
)
860 return ((TREE_CODE (expr
) == REAL_CST
861 && ! TREE_CONSTANT_OVERFLOW (expr
)
862 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
863 || (TREE_CODE (expr
) == COMPLEX_CST
864 && real_zerop (TREE_REALPART (expr
))
865 && real_zerop (TREE_IMAGPART (expr
))));
868 /* Return 1 if EXPR is the real constant one in real or complex form. */
871 real_onep (tree expr
)
875 return ((TREE_CODE (expr
) == REAL_CST
876 && ! TREE_CONSTANT_OVERFLOW (expr
)
877 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
878 || (TREE_CODE (expr
) == COMPLEX_CST
879 && real_onep (TREE_REALPART (expr
))
880 && real_zerop (TREE_IMAGPART (expr
))));
883 /* Return 1 if EXPR is the real constant two. */
886 real_twop (tree expr
)
890 return ((TREE_CODE (expr
) == REAL_CST
891 && ! TREE_CONSTANT_OVERFLOW (expr
)
892 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
893 || (TREE_CODE (expr
) == COMPLEX_CST
894 && real_twop (TREE_REALPART (expr
))
895 && real_zerop (TREE_IMAGPART (expr
))));
898 /* Return 1 if EXPR is the real constant minus one. */
901 real_minus_onep (tree expr
)
905 return ((TREE_CODE (expr
) == REAL_CST
906 && ! TREE_CONSTANT_OVERFLOW (expr
)
907 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
908 || (TREE_CODE (expr
) == COMPLEX_CST
909 && real_minus_onep (TREE_REALPART (expr
))
910 && real_zerop (TREE_IMAGPART (expr
))));
913 /* Nonzero if EXP is a constant or a cast of a constant. */
916 really_constant_p (tree exp
)
918 /* This is not quite the same as STRIP_NOPS. It does more. */
919 while (TREE_CODE (exp
) == NOP_EXPR
920 || TREE_CODE (exp
) == CONVERT_EXPR
921 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
922 exp
= TREE_OPERAND (exp
, 0);
923 return TREE_CONSTANT (exp
);
926 /* Return first list element whose TREE_VALUE is ELEM.
927 Return 0 if ELEM is not in LIST. */
930 value_member (tree elem
, tree list
)
934 if (elem
== TREE_VALUE (list
))
936 list
= TREE_CHAIN (list
);
941 /* Return first list element whose TREE_PURPOSE is ELEM.
942 Return 0 if ELEM is not in LIST. */
945 purpose_member (tree elem
, tree list
)
949 if (elem
== TREE_PURPOSE (list
))
951 list
= TREE_CHAIN (list
);
956 /* Return first list element whose BINFO_TYPE is ELEM.
957 Return 0 if ELEM is not in LIST. */
960 binfo_member (tree elem
, tree list
)
964 if (elem
== BINFO_TYPE (list
))
966 list
= TREE_CHAIN (list
);
971 /* Return nonzero if ELEM is part of the chain CHAIN. */
974 chain_member (tree elem
, tree chain
)
980 chain
= TREE_CHAIN (chain
);
986 /* Return the length of a chain of nodes chained through TREE_CHAIN.
987 We expect a null pointer to mark the end of the chain.
988 This is the Lisp primitive `length'. */
994 #ifdef ENABLE_TREE_CHECKING
1002 #ifdef ENABLE_TREE_CHECKING
1014 /* Returns the number of FIELD_DECLs in TYPE. */
1017 fields_length (tree type
)
1019 tree t
= TYPE_FIELDS (type
);
1022 for (; t
; t
= TREE_CHAIN (t
))
1023 if (TREE_CODE (t
) == FIELD_DECL
)
1029 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1030 by modifying the last node in chain 1 to point to chain 2.
1031 This is the Lisp primitive `nconc'. */
1034 chainon (tree op1
, tree op2
)
1043 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1045 TREE_CHAIN (t1
) = op2
;
1047 #ifdef ENABLE_TREE_CHECKING
1050 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1052 abort (); /* Circularity created. */
1059 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1062 tree_last (tree chain
)
1066 while ((next
= TREE_CHAIN (chain
)))
1071 /* Reverse the order of elements in the chain T,
1072 and return the new head of the chain (old last element). */
1077 tree prev
= 0, decl
, next
;
1078 for (decl
= t
; decl
; decl
= next
)
1080 next
= TREE_CHAIN (decl
);
1081 TREE_CHAIN (decl
) = prev
;
1087 /* Return a newly created TREE_LIST node whose
1088 purpose and value fields are PARM and VALUE. */
1091 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1093 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1094 TREE_PURPOSE (t
) = parm
;
1095 TREE_VALUE (t
) = value
;
1099 /* Return a newly created TREE_LIST node whose
1100 purpose and value fields are PURPOSE and VALUE
1101 and whose TREE_CHAIN is CHAIN. */
1104 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1108 node
= ggc_alloc_zone_stat (sizeof (struct tree_list
),
1109 tree_zone PASS_MEM_STAT
);
1111 memset (node
, 0, sizeof (struct tree_common
));
1113 #ifdef GATHER_STATISTICS
1114 tree_node_counts
[(int) x_kind
]++;
1115 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1118 TREE_SET_CODE (node
, TREE_LIST
);
1119 TREE_CHAIN (node
) = chain
;
1120 TREE_PURPOSE (node
) = purpose
;
1121 TREE_VALUE (node
) = value
;
1126 /* Return the size nominally occupied by an object of type TYPE
1127 when it resides in memory. The value is measured in units of bytes,
1128 and its data type is that normally used for type sizes
1129 (which is the first type created by make_signed_type or
1130 make_unsigned_type). */
1133 size_in_bytes (tree type
)
1137 if (type
== error_mark_node
)
1138 return integer_zero_node
;
1140 type
= TYPE_MAIN_VARIANT (type
);
1141 t
= TYPE_SIZE_UNIT (type
);
1145 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1146 return size_zero_node
;
1149 if (TREE_CODE (t
) == INTEGER_CST
)
1150 force_fit_type (t
, 0);
1155 /* Return the size of TYPE (in bytes) as a wide integer
1156 or return -1 if the size can vary or is larger than an integer. */
1159 int_size_in_bytes (tree type
)
1163 if (type
== error_mark_node
)
1166 type
= TYPE_MAIN_VARIANT (type
);
1167 t
= TYPE_SIZE_UNIT (type
);
1169 || TREE_CODE (t
) != INTEGER_CST
1170 || TREE_OVERFLOW (t
)
1171 || TREE_INT_CST_HIGH (t
) != 0
1172 /* If the result would appear negative, it's too big to represent. */
1173 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1176 return TREE_INT_CST_LOW (t
);
1179 /* Return the bit position of FIELD, in bits from the start of the record.
1180 This is a tree of type bitsizetype. */
1183 bit_position (tree field
)
1185 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1186 DECL_FIELD_BIT_OFFSET (field
));
1189 /* Likewise, but return as an integer. Abort if it cannot be represented
1190 in that way (since it could be a signed value, we don't have the option
1191 of returning -1 like int_size_in_byte can. */
1194 int_bit_position (tree field
)
1196 return tree_low_cst (bit_position (field
), 0);
1199 /* Return the byte position of FIELD, in bytes from the start of the record.
1200 This is a tree of type sizetype. */
1203 byte_position (tree field
)
1205 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1206 DECL_FIELD_BIT_OFFSET (field
));
1209 /* Likewise, but return as an integer. Abort if it cannot be represented
1210 in that way (since it could be a signed value, we don't have the option
1211 of returning -1 like int_size_in_byte can. */
1214 int_byte_position (tree field
)
1216 return tree_low_cst (byte_position (field
), 0);
1219 /* Return the strictest alignment, in bits, that T is known to have. */
1224 unsigned int align0
, align1
;
1226 switch (TREE_CODE (t
))
1228 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1229 /* If we have conversions, we know that the alignment of the
1230 object must meet each of the alignments of the types. */
1231 align0
= expr_align (TREE_OPERAND (t
, 0));
1232 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1233 return MAX (align0
, align1
);
1235 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1236 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1237 case CLEANUP_POINT_EXPR
: case UNSAVE_EXPR
:
1238 /* These don't change the alignment of an object. */
1239 return expr_align (TREE_OPERAND (t
, 0));
1242 /* The best we can do is say that the alignment is the least aligned
1244 align0
= expr_align (TREE_OPERAND (t
, 1));
1245 align1
= expr_align (TREE_OPERAND (t
, 2));
1246 return MIN (align0
, align1
);
1248 case LABEL_DECL
: case CONST_DECL
:
1249 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1250 if (DECL_ALIGN (t
) != 0)
1251 return DECL_ALIGN (t
);
1255 return FUNCTION_BOUNDARY
;
1261 /* Otherwise take the alignment from that of the type. */
1262 return TYPE_ALIGN (TREE_TYPE (t
));
1265 /* Return, as a tree node, the number of elements for TYPE (which is an
1266 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1269 array_type_nelts (tree type
)
1271 tree index_type
, min
, max
;
1273 /* If they did it with unspecified bounds, then we should have already
1274 given an error about it before we got here. */
1275 if (! TYPE_DOMAIN (type
))
1276 return error_mark_node
;
1278 index_type
= TYPE_DOMAIN (type
);
1279 min
= TYPE_MIN_VALUE (index_type
);
1280 max
= TYPE_MAX_VALUE (index_type
);
1282 return (integer_zerop (min
)
1284 : fold (build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1287 /* Return nonzero if arg is static -- a reference to an object in
1288 static storage. This is not the same as the C meaning of `static'. */
1293 switch (TREE_CODE (arg
))
1296 /* Nested functions aren't static, since taking their address
1297 involves a trampoline. */
1298 return ((decl_function_context (arg
) == 0 || DECL_NO_STATIC_CHAIN (arg
))
1299 && ! DECL_NON_ADDR_CONST_P (arg
));
1302 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1303 && ! DECL_THREAD_LOCAL (arg
)
1304 && ! DECL_NON_ADDR_CONST_P (arg
));
1307 return TREE_STATIC (arg
);
1314 /* If the thing being referenced is not a field, then it is
1315 something language specific. */
1316 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1317 return (*lang_hooks
.staticp
) (arg
);
1319 /* If we are referencing a bitfield, we can't evaluate an
1320 ADDR_EXPR at compile time and so it isn't a constant. */
1321 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1324 return staticp (TREE_OPERAND (arg
, 0));
1330 /* This case is technically correct, but results in setting
1331 TREE_CONSTANT on ADDR_EXPRs that cannot be evaluated at
1334 return TREE_CONSTANT (TREE_OPERAND (arg
, 0));
1338 case ARRAY_RANGE_REF
:
1339 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1340 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1341 return staticp (TREE_OPERAND (arg
, 0));
1346 if ((unsigned int) TREE_CODE (arg
)
1347 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1348 return lang_hooks
.staticp (arg
);
1354 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1355 Do this to any expression which may be used in more than one place,
1356 but must be evaluated only once.
1358 Normally, expand_expr would reevaluate the expression each time.
1359 Calling save_expr produces something that is evaluated and recorded
1360 the first time expand_expr is called on it. Subsequent calls to
1361 expand_expr just reuse the recorded value.
1363 The call to expand_expr that generates code that actually computes
1364 the value is the first call *at compile time*. Subsequent calls
1365 *at compile time* generate code to use the saved value.
1366 This produces correct result provided that *at run time* control
1367 always flows through the insns made by the first expand_expr
1368 before reaching the other places where the save_expr was evaluated.
1369 You, the caller of save_expr, must make sure this is so.
1371 Constants, and certain read-only nodes, are returned with no
1372 SAVE_EXPR because that is safe. Expressions containing placeholders
1373 are not touched; see tree.def for an explanation of what these
1377 save_expr (tree expr
)
1379 tree t
= fold (expr
);
1382 /* If the tree evaluates to a constant, then we don't want to hide that
1383 fact (i.e. this allows further folding, and direct checks for constants).
1384 However, a read-only object that has side effects cannot be bypassed.
1385 Since it is no problem to reevaluate literals, we just return the
1387 inner
= skip_simple_arithmetic (t
);
1389 if (TREE_INVARIANT (inner
)
1390 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1391 || TREE_CODE (inner
) == SAVE_EXPR
1392 || TREE_CODE (inner
) == ERROR_MARK
)
1395 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1396 it means that the size or offset of some field of an object depends on
1397 the value within another field.
1399 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1400 and some variable since it would then need to be both evaluated once and
1401 evaluated more than once. Front-ends must assure this case cannot
1402 happen by surrounding any such subexpressions in their own SAVE_EXPR
1403 and forcing evaluation at the proper time. */
1404 if (contains_placeholder_p (inner
))
1407 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
1409 /* This expression might be placed ahead of a jump to ensure that the
1410 value was computed on both sides of the jump. So make sure it isn't
1411 eliminated as dead. */
1412 TREE_SIDE_EFFECTS (t
) = 1;
1413 TREE_READONLY (t
) = 1;
1414 TREE_INVARIANT (t
) = 1;
1418 /* Look inside EXPR and into any simple arithmetic operations. Return
1419 the innermost non-arithmetic node. */
1422 skip_simple_arithmetic (tree expr
)
1426 /* We don't care about whether this can be used as an lvalue in this
1428 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1429 expr
= TREE_OPERAND (expr
, 0);
1431 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1432 a constant, it will be more efficient to not make another SAVE_EXPR since
1433 it will allow better simplification and GCSE will be able to merge the
1434 computations if they actually occur. */
1438 if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '1')
1439 inner
= TREE_OPERAND (inner
, 0);
1440 else if (TREE_CODE_CLASS (TREE_CODE (inner
)) == '2')
1442 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
1443 inner
= TREE_OPERAND (inner
, 0);
1444 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
1445 inner
= TREE_OPERAND (inner
, 1);
1456 /* Arrange for an expression to be expanded multiple independent
1457 times. This is useful for cleanup actions, as the backend can
1458 expand them multiple times in different places. */
1461 unsave_expr (tree expr
)
1465 /* If this is already protected, no sense in protecting it again. */
1466 if (TREE_CODE (expr
) == UNSAVE_EXPR
)
1469 t
= build1 (UNSAVE_EXPR
, TREE_TYPE (expr
), expr
);
1470 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (expr
);
1474 /* Returns the index of the first non-tree operand for CODE, or the number
1475 of operands if all are trees. */
1478 first_rtl_op (enum tree_code code
)
1483 return TREE_CODE_LENGTH (code
);
1487 /* Return which tree structure is used by T. */
1489 enum tree_node_structure_enum
1490 tree_node_structure (tree t
)
1492 enum tree_code code
= TREE_CODE (t
);
1494 switch (TREE_CODE_CLASS (code
))
1496 case 'd': return TS_DECL
;
1497 case 't': return TS_TYPE
;
1498 case 'r': case '<': case '1': case '2': case 'e': case 's':
1500 default: /* 'c' and 'x' */
1506 case INTEGER_CST
: return TS_INT_CST
;
1507 case REAL_CST
: return TS_REAL_CST
;
1508 case COMPLEX_CST
: return TS_COMPLEX
;
1509 case VECTOR_CST
: return TS_VECTOR
;
1510 case STRING_CST
: return TS_STRING
;
1512 case ERROR_MARK
: return TS_COMMON
;
1513 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1514 case TREE_LIST
: return TS_LIST
;
1515 case TREE_VEC
: return TS_VEC
;
1516 case PHI_NODE
: return TS_PHI_NODE
;
1517 case SSA_NAME
: return TS_SSA_NAME
;
1518 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1519 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
1520 case BLOCK
: return TS_BLOCK
;
1521 case TREE_BINFO
: return TS_BINFO
;
1522 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
1529 /* Perform any modifications to EXPR required when it is unsaved. Does
1530 not recurse into EXPR's subtrees. */
1533 unsave_expr_1 (tree expr
)
1535 switch (TREE_CODE (expr
))
1538 /* Don't mess with a TARGET_EXPR that hasn't been expanded.
1539 It's OK for this to happen if it was part of a subtree that
1540 isn't immediately expanded, such as operand 2 of another
1542 if (TREE_OPERAND (expr
, 1))
1545 TREE_OPERAND (expr
, 1) = TREE_OPERAND (expr
, 3);
1546 TREE_OPERAND (expr
, 3) = NULL_TREE
;
1554 /* Return 0 if it is safe to evaluate EXPR multiple times,
1555 return 1 if it is safe if EXPR is unsaved afterward, or
1556 return 2 if it is completely unsafe.
1558 This assumes that CALL_EXPRs and TARGET_EXPRs are never replicated in
1559 an expression tree, so that it safe to unsave them and the surrounding
1560 context will be correct.
1562 SAVE_EXPRs basically *only* appear replicated in an expression tree,
1563 occasionally across the whole of a function. It is therefore only
1564 safe to unsave a SAVE_EXPR if you know that all occurrences appear
1565 below the UNSAVE_EXPR. */
1568 unsafe_for_reeval (tree expr
)
1571 enum tree_code code
;
1576 if (expr
== NULL_TREE
)
1579 code
= TREE_CODE (expr
);
1580 first_rtl
= first_rtl_op (code
);
1587 /* A label can only be emitted once. */
1596 for (exp
= expr
; exp
!= 0; exp
= TREE_CHAIN (exp
))
1598 tmp
= unsafe_for_reeval (TREE_VALUE (exp
));
1599 unsafeness
= MAX (tmp
, unsafeness
);
1605 tmp2
= unsafe_for_reeval (TREE_OPERAND (expr
, 0));
1606 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, 1));
1607 return MAX (MAX (tmp
, 1), tmp2
);
1613 case EXIT_BLOCK_EXPR
:
1614 /* EXIT_BLOCK_LABELED_BLOCK, a.k.a. TREE_OPERAND (expr, 0), holds
1615 a reference to an ancestor LABELED_BLOCK, so we need to avoid
1616 unbounded recursion in the 'e' traversal code below. */
1617 exp
= EXIT_BLOCK_RETURN (expr
);
1618 return exp
? unsafe_for_reeval (exp
) : 0;
1621 tmp
= lang_hooks
.unsafe_for_reeval (expr
);
1627 switch (TREE_CODE_CLASS (code
))
1629 case 'c': /* a constant */
1630 case 't': /* a type node */
1631 case 'x': /* something random, like an identifier or an ERROR_MARK. */
1632 case 'd': /* A decl node */
1635 case 'e': /* an expression */
1636 case 'r': /* a reference */
1637 case 's': /* an expression with side effects */
1638 case '<': /* a comparison expression */
1639 case '2': /* a binary arithmetic expression */
1640 case '1': /* a unary arithmetic expression */
1641 for (i
= first_rtl
- 1; i
>= 0; i
--)
1643 tmp
= unsafe_for_reeval (TREE_OPERAND (expr
, i
));
1644 unsafeness
= MAX (tmp
, unsafeness
);
1654 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1655 or offset that depends on a field within a record. */
1658 contains_placeholder_p (tree exp
)
1660 enum tree_code code
;
1665 code
= TREE_CODE (exp
);
1666 if (code
== PLACEHOLDER_EXPR
)
1669 switch (TREE_CODE_CLASS (code
))
1672 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1673 position computations since they will be converted into a
1674 WITH_RECORD_EXPR involving the reference, which will assume
1675 here will be valid. */
1676 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1679 if (code
== TREE_LIST
)
1680 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
1681 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
1690 /* Ignoring the first operand isn't quite right, but works best. */
1691 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1694 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1695 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
1696 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
1702 switch (first_rtl_op (code
))
1705 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1707 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1708 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
1719 /* Return 1 if any part of the computation of TYPE involves a PLACEHOLDER_EXPR.
1720 This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and field
1724 type_contains_placeholder_p (tree type
)
1726 /* If the size contains a placeholder or the parent type (component type in
1727 the case of arrays) type involves a placeholder, this type does. */
1728 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1729 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
1730 || (TREE_TYPE (type
) != 0
1731 && type_contains_placeholder_p (TREE_TYPE (type
))))
1734 /* Now do type-specific checks. Note that the last part of the check above
1735 greatly limits what we have to do below. */
1736 switch (TREE_CODE (type
))
1745 case REFERENCE_TYPE
:
1753 /* Here we just check the bounds. */
1754 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
1755 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
1760 /* We're already checked the component type (TREE_TYPE), so just check
1762 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
1766 case QUAL_UNION_TYPE
:
1768 static tree seen_types
= 0;
1772 /* We have to be careful here that we don't end up in infinite
1773 recursions due to a field of a type being a pointer to that type
1774 or to a mutually-recursive type. So we store a list of record
1775 types that we've seen and see if this type is in them. To save
1776 memory, we don't use a list for just one type. Here we check
1777 whether we've seen this type before and store it if not. */
1778 if (seen_types
== 0)
1780 else if (TREE_CODE (seen_types
) != TREE_LIST
)
1782 if (seen_types
== type
)
1785 seen_types
= tree_cons (NULL_TREE
, type
,
1786 build_tree_list (NULL_TREE
, seen_types
));
1790 if (value_member (type
, seen_types
) != 0)
1793 seen_types
= tree_cons (NULL_TREE
, type
, seen_types
);
1796 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1797 if (TREE_CODE (field
) == FIELD_DECL
1798 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
1799 || (TREE_CODE (type
) == QUAL_UNION_TYPE
1800 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
1801 || type_contains_placeholder_p (TREE_TYPE (field
))))
1807 /* Now remove us from seen_types and return the result. */
1808 if (seen_types
== type
)
1811 seen_types
= TREE_CHAIN (seen_types
);
1821 /* Return 1 if EXP contains any expressions that produce cleanups for an
1822 outer scope to deal with. Used by fold. */
1825 has_cleanups (tree exp
)
1829 if (! TREE_SIDE_EFFECTS (exp
))
1832 switch (TREE_CODE (exp
))
1835 case WITH_CLEANUP_EXPR
:
1838 case CLEANUP_POINT_EXPR
:
1842 for (exp
= TREE_OPERAND (exp
, 1); exp
; exp
= TREE_CHAIN (exp
))
1844 cmp
= has_cleanups (TREE_VALUE (exp
));
1851 return (DECL_INITIAL (DECL_EXPR_DECL (exp
))
1852 && has_cleanups (DECL_INITIAL (DECL_EXPR_DECL (exp
))));
1858 /* This general rule works for most tree codes. All exceptions should be
1859 handled above. If this is a language-specific tree code, we can't
1860 trust what might be in the operand, so say we don't know
1862 if ((int) TREE_CODE (exp
) >= (int) LAST_AND_UNUSED_TREE_CODE
)
1865 nops
= first_rtl_op (TREE_CODE (exp
));
1866 for (i
= 0; i
< nops
; i
++)
1867 if (TREE_OPERAND (exp
, i
) != 0)
1869 int type
= TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, i
)));
1870 if (type
== 'e' || type
== '<' || type
== '1' || type
== '2'
1871 || type
== 'r' || type
== 's')
1873 cmp
= has_cleanups (TREE_OPERAND (exp
, i
));
1882 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1883 return a tree with all occurrences of references to F in a
1884 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1885 contains only arithmetic expressions or a CALL_EXPR with a
1886 PLACEHOLDER_EXPR occurring only in its arglist. */
1889 substitute_in_expr (tree exp
, tree f
, tree r
)
1891 enum tree_code code
= TREE_CODE (exp
);
1896 /* We handle TREE_LIST and COMPONENT_REF separately. */
1897 if (code
== TREE_LIST
)
1899 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
1900 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
1901 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1904 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1906 else if (code
== COMPONENT_REF
)
1908 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1909 and it is the right field, replace it with R. */
1910 for (inner
= TREE_OPERAND (exp
, 0);
1911 TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r';
1912 inner
= TREE_OPERAND (inner
, 0))
1914 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
1915 && TREE_OPERAND (exp
, 1) == f
)
1918 /* If this expression hasn't been completed let, leave it
1920 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
1923 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1924 if (op0
== TREE_OPERAND (exp
, 0))
1927 new = fold (build (code
, TREE_TYPE (exp
), op0
, TREE_OPERAND (exp
, 1),
1931 switch (TREE_CODE_CLASS (code
))
1943 switch (first_rtl_op (code
))
1949 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1950 if (op0
== TREE_OPERAND (exp
, 0))
1953 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
1957 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1958 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
1960 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
1963 new = fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
1967 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1968 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
1969 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
1971 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
1972 && op2
== TREE_OPERAND (exp
, 2))
1975 new = fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
1987 TREE_READONLY (new) = TREE_READONLY (exp
);
1991 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
1992 for it within OBJ, a tree that is an object or a chain of references. */
1995 substitute_placeholder_in_expr (tree exp
, tree obj
)
1997 enum tree_code code
= TREE_CODE (exp
);
1998 tree op0
, op1
, op2
, op3
;
2000 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2001 in the chain of OBJ. */
2002 if (code
== PLACEHOLDER_EXPR
)
2004 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2007 for (elt
= obj
; elt
!= 0;
2008 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2009 || TREE_CODE (elt
) == COND_EXPR
)
2010 ? TREE_OPERAND (elt
, 1)
2011 : (TREE_CODE_CLASS (TREE_CODE (elt
)) == 'r'
2012 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '1'
2013 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '2'
2014 || TREE_CODE_CLASS (TREE_CODE (elt
)) == 'e')
2015 ? TREE_OPERAND (elt
, 0) : 0))
2016 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2019 for (elt
= obj
; elt
!= 0;
2020 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2021 || TREE_CODE (elt
) == COND_EXPR
)
2022 ? TREE_OPERAND (elt
, 1)
2023 : (TREE_CODE_CLASS (TREE_CODE (elt
)) == 'r'
2024 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '1'
2025 || TREE_CODE_CLASS (TREE_CODE (elt
)) == '2'
2026 || TREE_CODE_CLASS (TREE_CODE (elt
)) == 'e')
2027 ? TREE_OPERAND (elt
, 0) : 0))
2028 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2029 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2031 return fold (build1 (INDIRECT_REF
, need_type
, elt
));
2033 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2034 survives until RTL generation, there will be an error. */
2038 /* TREE_LIST is special because we need to look at TREE_VALUE
2039 and TREE_CHAIN, not TREE_OPERANDS. */
2040 else if (code
== TREE_LIST
)
2042 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2043 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2044 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2047 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2050 switch (TREE_CODE_CLASS (code
))
2063 switch (first_rtl_op (code
))
2069 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2070 if (op0
== TREE_OPERAND (exp
, 0))
2073 return fold (build1 (code
, TREE_TYPE (exp
), op0
));
2076 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2077 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2079 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2082 return fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2085 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2086 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2087 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2089 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2090 && op2
== TREE_OPERAND (exp
, 2))
2093 return fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2096 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2097 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2098 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2099 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2101 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2102 && op2
== TREE_OPERAND (exp
, 2)
2103 && op3
== TREE_OPERAND (exp
, 3))
2106 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2118 /* Stabilize a reference so that we can use it any number of times
2119 without causing its operands to be evaluated more than once.
2120 Returns the stabilized reference. This works by means of save_expr,
2121 so see the caveats in the comments about save_expr.
2123 Also allows conversion expressions whose operands are references.
2124 Any other kind of expression is returned unchanged. */
2127 stabilize_reference (tree ref
)
2130 enum tree_code code
= TREE_CODE (ref
);
2137 /* No action is needed in this case. */
2143 case FIX_TRUNC_EXPR
:
2144 case FIX_FLOOR_EXPR
:
2145 case FIX_ROUND_EXPR
:
2147 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2151 result
= build_nt (INDIRECT_REF
,
2152 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2156 result
= build_nt (COMPONENT_REF
,
2157 stabilize_reference (TREE_OPERAND (ref
, 0)),
2158 TREE_OPERAND (ref
, 1), NULL_TREE
);
2162 result
= build_nt (BIT_FIELD_REF
,
2163 stabilize_reference (TREE_OPERAND (ref
, 0)),
2164 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2165 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2169 result
= build_nt (ARRAY_REF
,
2170 stabilize_reference (TREE_OPERAND (ref
, 0)),
2171 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2172 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2175 case ARRAY_RANGE_REF
:
2176 result
= build_nt (ARRAY_RANGE_REF
,
2177 stabilize_reference (TREE_OPERAND (ref
, 0)),
2178 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2179 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2183 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2184 it wouldn't be ignored. This matters when dealing with
2186 return stabilize_reference_1 (ref
);
2188 /* If arg isn't a kind of lvalue we recognize, make no change.
2189 Caller should recognize the error for an invalid lvalue. */
2194 return error_mark_node
;
2197 TREE_TYPE (result
) = TREE_TYPE (ref
);
2198 TREE_READONLY (result
) = TREE_READONLY (ref
);
2199 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2200 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2205 /* Subroutine of stabilize_reference; this is called for subtrees of
2206 references. Any expression with side-effects must be put in a SAVE_EXPR
2207 to ensure that it is only evaluated once.
2209 We don't put SAVE_EXPR nodes around everything, because assigning very
2210 simple expressions to temporaries causes us to miss good opportunities
2211 for optimizations. Among other things, the opportunity to fold in the
2212 addition of a constant into an addressing mode often gets lost, e.g.
2213 "y[i+1] += x;". In general, we take the approach that we should not make
2214 an assignment unless we are forced into it - i.e., that any non-side effect
2215 operator should be allowed, and that cse should take care of coalescing
2216 multiple utterances of the same expression should that prove fruitful. */
2219 stabilize_reference_1 (tree e
)
2222 enum tree_code code
= TREE_CODE (e
);
2224 /* We cannot ignore const expressions because it might be a reference
2225 to a const array but whose index contains side-effects. But we can
2226 ignore things that are actual constant or that already have been
2227 handled by this function. */
2229 if (TREE_INVARIANT (e
))
2232 switch (TREE_CODE_CLASS (code
))
2241 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2242 so that it will only be evaluated once. */
2243 /* The reference (r) and comparison (<) classes could be handled as
2244 below, but it is generally faster to only evaluate them once. */
2245 if (TREE_SIDE_EFFECTS (e
))
2246 return save_expr (e
);
2250 /* Constants need no processing. In fact, we should never reach
2255 /* Division is slow and tends to be compiled with jumps,
2256 especially the division by powers of 2 that is often
2257 found inside of an array reference. So do it just once. */
2258 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2259 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2260 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2261 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2262 return save_expr (e
);
2263 /* Recursively stabilize each operand. */
2264 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2265 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2269 /* Recursively stabilize each operand. */
2270 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2277 TREE_TYPE (result
) = TREE_TYPE (e
);
2278 TREE_READONLY (result
) = TREE_READONLY (e
);
2279 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2280 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2281 TREE_INVARIANT (result
) = 1;
2286 /* Low-level constructors for expressions. */
2288 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2289 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2292 recompute_tree_invarant_for_addr_expr (tree t
)
2295 bool tc
= true, ti
= true, se
= false;
2297 /* We started out assuming this address is both invariant and constant, but
2298 does not have side effects. Now go down any handled components and see if
2299 any of them involve offsets that are either non-constant or non-invariant.
2300 Also check for side-effects.
2302 ??? Note that this code makes no attempt to deal with the case where
2303 taking the address of something causes a copy due to misalignment. */
2305 #define UPDATE_TITCSE(NODE) \
2306 do { tree _node = (NODE); \
2307 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2308 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2309 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2311 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2312 node
= TREE_OPERAND (node
, 0))
2314 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2315 array reference (probably made temporarily by the G++ front end),
2316 so ignore all the operands. */
2317 if ((TREE_CODE (node
) == ARRAY_REF
2318 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2319 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2321 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2322 UPDATE_TITCSE (array_ref_low_bound (node
));
2323 UPDATE_TITCSE (array_ref_element_size (node
));
2325 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2326 FIELD_DECL, apparently. The G++ front end can put something else
2327 there, at least temporarily. */
2328 else if (TREE_CODE (node
) == COMPONENT_REF
2329 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2330 UPDATE_TITCSE (component_ref_field_offset (node
));
2331 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2332 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2335 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2336 it. If it's a decl, it's invariant and constant if the decl is static.
2337 It's also invariant if it's a decl in the current function. (Taking the
2338 address of a volatile variable is not volatile.) If it's a constant,
2339 the address is both invariant and constant. Otherwise it's neither. */
2340 if (TREE_CODE (node
) == INDIRECT_REF
)
2341 UPDATE_TITCSE (node
);
2342 else if (DECL_P (node
))
2346 else if (decl_function_context (node
) == current_function_decl
)
2351 else if (TREE_CODE_CLASS (TREE_CODE (node
)) == 'c')
2356 se
|= TREE_SIDE_EFFECTS (node
);
2359 TREE_CONSTANT (t
) = tc
;
2360 TREE_INVARIANT (t
) = ti
;
2361 TREE_SIDE_EFFECTS (t
) = se
;
2362 #undef UPDATE_TITCSE
2365 /* Build an expression of code CODE, data type TYPE, and operands as
2366 specified. Expressions and reference nodes can be created this way.
2367 Constants, decls, types and misc nodes cannot be.
2369 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2370 enough for all extant tree codes. These functions can be called
2371 directly (preferably!), but can also be obtained via GCC preprocessor
2372 magic within the build macro. */
2375 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2379 #ifdef ENABLE_CHECKING
2380 if (TREE_CODE_LENGTH (code
) != 0)
2384 t
= make_node_stat (code PASS_MEM_STAT
);
2391 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2393 int length
= sizeof (struct tree_exp
);
2394 #ifdef GATHER_STATISTICS
2395 tree_node_kind kind
;
2399 #ifdef GATHER_STATISTICS
2400 switch (TREE_CODE_CLASS (code
))
2402 case 's': /* an expression with side effects */
2405 case 'r': /* a reference */
2413 tree_node_counts
[(int) kind
]++;
2414 tree_node_sizes
[(int) kind
] += length
;
2417 #ifdef ENABLE_CHECKING
2418 if (TREE_CODE_LENGTH (code
) != 1)
2420 #endif /* ENABLE_CHECKING */
2422 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
2424 memset (t
, 0, sizeof (struct tree_common
));
2426 TREE_SET_CODE (t
, code
);
2428 TREE_TYPE (t
) = type
;
2429 #ifdef USE_MAPPED_LOCATION
2430 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2432 SET_EXPR_LOCUS (t
, NULL
);
2434 TREE_COMPLEXITY (t
) = 0;
2435 TREE_OPERAND (t
, 0) = node
;
2436 TREE_BLOCK (t
) = NULL_TREE
;
2437 if (node
&& !TYPE_P (node
) && first_rtl_op (code
) != 0)
2439 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2440 TREE_READONLY (t
) = TREE_READONLY (node
);
2443 if (TREE_CODE_CLASS (code
) == 's')
2444 TREE_SIDE_EFFECTS (t
) = 1;
2450 case PREDECREMENT_EXPR
:
2451 case PREINCREMENT_EXPR
:
2452 case POSTDECREMENT_EXPR
:
2453 case POSTINCREMENT_EXPR
:
2454 /* All of these have side-effects, no matter what their
2456 TREE_SIDE_EFFECTS (t
) = 1;
2457 TREE_READONLY (t
) = 0;
2461 /* Whether a dereference is readonly has nothing to do with whether
2462 its operand is readonly. */
2463 TREE_READONLY (t
) = 0;
2468 recompute_tree_invarant_for_addr_expr (t
);
2472 if (TREE_CODE_CLASS (code
) == '1' && node
&& !TYPE_P (node
)
2473 && TREE_CONSTANT (node
))
2474 TREE_CONSTANT (t
) = 1;
2475 if (TREE_CODE_CLASS (code
) == '1' && node
&& TREE_INVARIANT (node
))
2476 TREE_INVARIANT (t
) = 1;
2477 if (TREE_CODE_CLASS (code
) == 'r' && node
&& TREE_THIS_VOLATILE (node
))
2478 TREE_THIS_VOLATILE (t
) = 1;
2485 #define PROCESS_ARG(N) \
2487 TREE_OPERAND (t, N) = arg##N; \
2488 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2490 if (TREE_SIDE_EFFECTS (arg##N)) \
2492 if (!TREE_READONLY (arg##N)) \
2494 if (!TREE_CONSTANT (arg##N)) \
2496 if (!TREE_INVARIANT (arg##N)) \
2502 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2504 bool constant
, read_only
, side_effects
, invariant
;
2508 #ifdef ENABLE_CHECKING
2509 if (TREE_CODE_LENGTH (code
) != 2)
2513 t
= make_node_stat (code PASS_MEM_STAT
);
2516 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2517 result based on those same flags for the arguments. But if the
2518 arguments aren't really even `tree' expressions, we shouldn't be trying
2520 fro
= first_rtl_op (code
);
2522 /* Expressions without side effects may be constant if their
2523 arguments are as well. */
2524 constant
= (TREE_CODE_CLASS (code
) == '<'
2525 || TREE_CODE_CLASS (code
) == '2');
2527 side_effects
= TREE_SIDE_EFFECTS (t
);
2528 invariant
= constant
;
2533 TREE_READONLY (t
) = read_only
;
2534 TREE_CONSTANT (t
) = constant
;
2535 TREE_INVARIANT (t
) = invariant
;
2536 TREE_SIDE_EFFECTS (t
) = side_effects
;
2537 TREE_THIS_VOLATILE (t
)
2538 = TREE_CODE_CLASS (code
) == 'r' && arg0
&& TREE_THIS_VOLATILE (arg0
);
2544 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2545 tree arg2 MEM_STAT_DECL
)
2547 bool constant
, read_only
, side_effects
, invariant
;
2551 #ifdef ENABLE_CHECKING
2552 if (TREE_CODE_LENGTH (code
) != 3)
2556 t
= make_node_stat (code PASS_MEM_STAT
);
2559 fro
= first_rtl_op (code
);
2561 side_effects
= TREE_SIDE_EFFECTS (t
);
2567 if (code
== CALL_EXPR
&& !side_effects
)
2572 /* Calls have side-effects, except those to const or
2574 i
= call_expr_flags (t
);
2575 if (!(i
& (ECF_CONST
| ECF_PURE
)))
2578 /* And even those have side-effects if their arguments do. */
2579 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
2580 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
2587 TREE_SIDE_EFFECTS (t
) = side_effects
;
2588 TREE_THIS_VOLATILE (t
)
2589 = TREE_CODE_CLASS (code
) == 'r' && arg0
&& TREE_THIS_VOLATILE (arg0
);
2595 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2596 tree arg2
, tree arg3 MEM_STAT_DECL
)
2598 bool constant
, read_only
, side_effects
, invariant
;
2602 #ifdef ENABLE_CHECKING
2603 if (TREE_CODE_LENGTH (code
) != 4)
2607 t
= make_node_stat (code PASS_MEM_STAT
);
2610 fro
= first_rtl_op (code
);
2612 side_effects
= TREE_SIDE_EFFECTS (t
);
2619 TREE_SIDE_EFFECTS (t
) = side_effects
;
2620 TREE_THIS_VOLATILE (t
)
2621 = TREE_CODE_CLASS (code
) == 'r' && arg0
&& TREE_THIS_VOLATILE (arg0
);
2626 /* Backup definition for non-gcc build compilers. */
2629 (build
) (enum tree_code code
, tree tt
, ...)
2631 tree t
, arg0
, arg1
, arg2
, arg3
;
2632 int length
= TREE_CODE_LENGTH (code
);
2639 t
= build0 (code
, tt
);
2642 arg0
= va_arg (p
, tree
);
2643 t
= build1 (code
, tt
, arg0
);
2646 arg0
= va_arg (p
, tree
);
2647 arg1
= va_arg (p
, tree
);
2648 t
= build2 (code
, tt
, arg0
, arg1
);
2651 arg0
= va_arg (p
, tree
);
2652 arg1
= va_arg (p
, tree
);
2653 arg2
= va_arg (p
, tree
);
2654 t
= build3 (code
, tt
, arg0
, arg1
, arg2
);
2657 arg0
= va_arg (p
, tree
);
2658 arg1
= va_arg (p
, tree
);
2659 arg2
= va_arg (p
, tree
);
2660 arg3
= va_arg (p
, tree
);
2661 t
= build4 (code
, tt
, arg0
, arg1
, arg2
, arg3
);
2671 /* Similar except don't specify the TREE_TYPE
2672 and leave the TREE_SIDE_EFFECTS as 0.
2673 It is permissible for arguments to be null,
2674 or even garbage if their values do not matter. */
2677 build_nt (enum tree_code code
, ...)
2686 t
= make_node (code
);
2687 length
= TREE_CODE_LENGTH (code
);
2689 for (i
= 0; i
< length
; i
++)
2690 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2696 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2697 We do NOT enter this node in any sort of symbol table.
2699 layout_decl is used to set up the decl's storage layout.
2700 Other slots are initialized to 0 or null pointers. */
2703 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
2707 t
= make_node_stat (code PASS_MEM_STAT
);
2709 /* if (type == error_mark_node)
2710 type = integer_type_node; */
2711 /* That is not done, deliberately, so that having error_mark_node
2712 as the type can suppress useless errors in the use of this variable. */
2714 DECL_NAME (t
) = name
;
2715 TREE_TYPE (t
) = type
;
2717 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2719 else if (code
== FUNCTION_DECL
)
2720 DECL_MODE (t
) = FUNCTION_MODE
;
2725 /* BLOCK nodes are used to represent the structure of binding contours
2726 and declarations, once those contours have been exited and their contents
2727 compiled. This information is used for outputting debugging info. */
2730 build_block (tree vars
, tree tags ATTRIBUTE_UNUSED
, tree subblocks
,
2731 tree supercontext
, tree chain
)
2733 tree block
= make_node (BLOCK
);
2735 BLOCK_VARS (block
) = vars
;
2736 BLOCK_SUBBLOCKS (block
) = subblocks
;
2737 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2738 BLOCK_CHAIN (block
) = chain
;
2742 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2743 /* ??? gengtype doesn't handle conditionals */
2744 static GTY(()) tree last_annotated_node
;
2747 #ifdef USE_MAPPED_LOCATION
2750 expand_location (source_location loc
)
2752 expanded_location xloc
;
2753 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
2756 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
2757 xloc
.file
= map
->to_file
;
2758 xloc
.line
= SOURCE_LINE (map
, loc
);
2759 xloc
.column
= SOURCE_COLUMN (map
, loc
);
2766 /* Record the exact location where an expression or an identifier were
2770 annotate_with_file_line (tree node
, const char *file
, int line
)
2772 /* Roughly one percent of the calls to this function are to annotate
2773 a node with the same information already attached to that node!
2774 Just return instead of wasting memory. */
2775 if (EXPR_LOCUS (node
)
2776 && (EXPR_FILENAME (node
) == file
2777 || ! strcmp (EXPR_FILENAME (node
), file
))
2778 && EXPR_LINENO (node
) == line
)
2780 last_annotated_node
= node
;
2784 /* In heavily macroized code (such as GCC itself) this single
2785 entry cache can reduce the number of allocations by more
2787 if (last_annotated_node
2788 && EXPR_LOCUS (last_annotated_node
)
2789 && (EXPR_FILENAME (last_annotated_node
) == file
2790 || ! strcmp (EXPR_FILENAME (last_annotated_node
), file
))
2791 && EXPR_LINENO (last_annotated_node
) == line
)
2793 SET_EXPR_LOCUS (node
, EXPR_LOCUS (last_annotated_node
));
2797 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
2798 EXPR_LINENO (node
) = line
;
2799 EXPR_FILENAME (node
) = file
;
2800 last_annotated_node
= node
;
2804 annotate_with_locus (tree node
, location_t locus
)
2806 annotate_with_file_line (node
, locus
.file
, locus
.line
);
2810 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2814 build_decl_attribute_variant (tree ddecl
, tree attribute
)
2816 DECL_ATTRIBUTES (ddecl
) = attribute
;
2820 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2823 Record such modified types already made so we don't make duplicates. */
2826 build_type_attribute_variant (tree ttype
, tree attribute
)
2828 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2830 hashval_t hashcode
= 0;
2832 enum tree_code code
= TREE_CODE (ttype
);
2834 ntype
= copy_node (ttype
);
2836 TYPE_POINTER_TO (ntype
) = 0;
2837 TYPE_REFERENCE_TO (ntype
) = 0;
2838 TYPE_ATTRIBUTES (ntype
) = attribute
;
2840 /* Create a new main variant of TYPE. */
2841 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2842 TYPE_NEXT_VARIANT (ntype
) = 0;
2843 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2845 hashcode
= iterative_hash_object (code
, hashcode
);
2846 if (TREE_TYPE (ntype
))
2847 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
2849 hashcode
= attribute_hash_list (attribute
, hashcode
);
2851 switch (TREE_CODE (ntype
))
2854 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
2857 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
2861 hashcode
= iterative_hash_object
2862 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
2863 hashcode
= iterative_hash_object
2864 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
2868 unsigned int precision
= TYPE_PRECISION (ntype
);
2869 hashcode
= iterative_hash_object (precision
, hashcode
);
2876 ntype
= type_hash_canon (hashcode
, ntype
);
2877 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
2883 /* Return nonzero if IDENT is a valid name for attribute ATTR,
2886 We try both `text' and `__text__', ATTR may be either one. */
2887 /* ??? It might be a reasonable simplification to require ATTR to be only
2888 `text'. One might then also require attribute lists to be stored in
2889 their canonicalized form. */
2892 is_attribute_p (const char *attr
, tree ident
)
2894 int ident_len
, attr_len
;
2897 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
2900 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
2903 p
= IDENTIFIER_POINTER (ident
);
2904 ident_len
= strlen (p
);
2905 attr_len
= strlen (attr
);
2907 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
2911 || attr
[attr_len
- 2] != '_'
2912 || attr
[attr_len
- 1] != '_')
2914 if (ident_len
== attr_len
- 4
2915 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
2920 if (ident_len
== attr_len
+ 4
2921 && p
[0] == '_' && p
[1] == '_'
2922 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
2923 && strncmp (attr
, p
+ 2, attr_len
) == 0)
2930 /* Given an attribute name and a list of attributes, return a pointer to the
2931 attribute's list element if the attribute is part of the list, or NULL_TREE
2932 if not found. If the attribute appears more than once, this only
2933 returns the first occurrence; the TREE_CHAIN of the return value should
2934 be passed back in if further occurrences are wanted. */
2937 lookup_attribute (const char *attr_name
, tree list
)
2941 for (l
= list
; l
; l
= TREE_CHAIN (l
))
2943 if (TREE_CODE (TREE_PURPOSE (l
)) != IDENTIFIER_NODE
)
2945 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
2952 /* Return an attribute list that is the union of a1 and a2. */
2955 merge_attributes (tree a1
, tree a2
)
2959 /* Either one unset? Take the set one. */
2961 if ((attributes
= a1
) == 0)
2964 /* One that completely contains the other? Take it. */
2966 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
2968 if (attribute_list_contained (a2
, a1
))
2972 /* Pick the longest list, and hang on the other list. */
2974 if (list_length (a1
) < list_length (a2
))
2975 attributes
= a2
, a2
= a1
;
2977 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
2980 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2983 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
2986 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
2991 a1
= copy_node (a2
);
2992 TREE_CHAIN (a1
) = attributes
;
3001 /* Given types T1 and T2, merge their attributes and return
3005 merge_type_attributes (tree t1
, tree t2
)
3007 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3008 TYPE_ATTRIBUTES (t2
));
3011 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3015 merge_decl_attributes (tree olddecl
, tree newdecl
)
3017 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3018 DECL_ATTRIBUTES (newdecl
));
3021 #ifdef TARGET_DLLIMPORT_DECL_ATTRIBUTES
3023 /* Specialization of merge_decl_attributes for various Windows targets.
3025 This handles the following situation:
3027 __declspec (dllimport) int foo;
3030 The second instance of `foo' nullifies the dllimport. */
3033 merge_dllimport_decl_attributes (tree old
, tree
new)
3036 int delete_dllimport_p
;
3038 old
= DECL_ATTRIBUTES (old
);
3039 new = DECL_ATTRIBUTES (new);
3041 /* What we need to do here is remove from `old' dllimport if it doesn't
3042 appear in `new'. dllimport behaves like extern: if a declaration is
3043 marked dllimport and a definition appears later, then the object
3044 is not dllimport'd. */
3045 if (lookup_attribute ("dllimport", old
) != NULL_TREE
3046 && lookup_attribute ("dllimport", new) == NULL_TREE
)
3047 delete_dllimport_p
= 1;
3049 delete_dllimport_p
= 0;
3051 a
= merge_attributes (old
, new);
3053 if (delete_dllimport_p
)
3057 /* Scan the list for dllimport and delete it. */
3058 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3060 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3062 if (prev
== NULL_TREE
)
3065 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3074 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3076 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3077 of the various TYPE_QUAL values. */
3080 set_type_quals (tree type
, int type_quals
)
3082 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3083 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3084 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3087 /* Returns true iff cand is equivalent to base with type_quals. */
3090 check_qualified_type (tree cand
, tree base
, int type_quals
)
3092 return (TYPE_QUALS (cand
) == type_quals
3093 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3094 /* Apparently this is needed for Objective-C. */
3095 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3096 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3097 TYPE_ATTRIBUTES (base
)));
3100 /* Return a version of the TYPE, qualified as indicated by the
3101 TYPE_QUALS, if one exists. If no qualified version exists yet,
3102 return NULL_TREE. */
3105 get_qualified_type (tree type
, int type_quals
)
3109 if (TYPE_QUALS (type
) == type_quals
)
3112 /* Search the chain of variants to see if there is already one there just
3113 like the one we need to have. If so, use that existing one. We must
3114 preserve the TYPE_NAME, since there is code that depends on this. */
3115 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3116 if (check_qualified_type (t
, type
, type_quals
))
3122 /* Like get_qualified_type, but creates the type if it does not
3123 exist. This function never returns NULL_TREE. */
3126 build_qualified_type (tree type
, int type_quals
)
3130 /* See if we already have the appropriate qualified variant. */
3131 t
= get_qualified_type (type
, type_quals
);
3133 /* If not, build it. */
3136 t
= build_type_copy (type
);
3137 set_type_quals (t
, type_quals
);
3143 /* Create a new variant of TYPE, equivalent but distinct.
3144 This is so the caller can modify it. */
3147 build_type_copy (tree type
)
3149 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3151 t
= copy_node (type
);
3153 TYPE_POINTER_TO (t
) = 0;
3154 TYPE_REFERENCE_TO (t
) = 0;
3156 /* Add this type to the chain of variants of TYPE. */
3157 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3158 TYPE_NEXT_VARIANT (m
) = t
;
3163 /* Hashing of types so that we don't make duplicates.
3164 The entry point is `type_hash_canon'. */
3166 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3167 with types in the TREE_VALUE slots), by adding the hash codes
3168 of the individual types. */
3171 type_hash_list (tree list
, hashval_t hashcode
)
3175 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3176 if (TREE_VALUE (tail
) != error_mark_node
)
3177 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
3183 /* These are the Hashtable callback functions. */
3185 /* Returns true iff the types are equivalent. */
3188 type_hash_eq (const void *va
, const void *vb
)
3190 const struct type_hash
*a
= va
, *b
= vb
;
3192 /* First test the things that are the same for all types. */
3193 if (a
->hash
!= b
->hash
3194 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
3195 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
3196 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3197 TYPE_ATTRIBUTES (b
->type
))
3198 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
3199 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
3202 switch (TREE_CODE (a
->type
))
3208 case REFERENCE_TYPE
:
3212 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
3213 && !(TYPE_VALUES (a
->type
)
3214 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
3215 && TYPE_VALUES (b
->type
)
3216 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
3217 && type_list_equal (TYPE_VALUES (a
->type
),
3218 TYPE_VALUES (b
->type
))))
3221 /* ... fall through ... */
3227 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3228 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3229 TYPE_MAX_VALUE (b
->type
)))
3230 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3231 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3232 TYPE_MIN_VALUE (b
->type
))));
3235 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
3238 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
3239 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3240 || (TYPE_ARG_TYPES (a
->type
)
3241 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3242 && TYPE_ARG_TYPES (b
->type
)
3243 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3244 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3245 TYPE_ARG_TYPES (b
->type
)))));
3249 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
3253 case QUAL_UNION_TYPE
:
3254 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
3255 || (TYPE_FIELDS (a
->type
)
3256 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
3257 && TYPE_FIELDS (b
->type
)
3258 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
3259 && type_list_equal (TYPE_FIELDS (a
->type
),
3260 TYPE_FIELDS (b
->type
))));
3263 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3264 || (TYPE_ARG_TYPES (a
->type
)
3265 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3266 && TYPE_ARG_TYPES (b
->type
)
3267 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3268 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3269 TYPE_ARG_TYPES (b
->type
))));
3276 /* Return the cached hash value. */
3279 type_hash_hash (const void *item
)
3281 return ((const struct type_hash
*) item
)->hash
;
3284 /* Look in the type hash table for a type isomorphic to TYPE.
3285 If one is found, return it. Otherwise return 0. */
3288 type_hash_lookup (hashval_t hashcode
, tree type
)
3290 struct type_hash
*h
, in
;
3292 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3293 must call that routine before comparing TYPE_ALIGNs. */
3299 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3305 /* Add an entry to the type-hash-table
3306 for a type TYPE whose hash code is HASHCODE. */
3309 type_hash_add (hashval_t hashcode
, tree type
)
3311 struct type_hash
*h
;
3314 h
= ggc_alloc (sizeof (struct type_hash
));
3317 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3318 *(struct type_hash
**) loc
= h
;
3321 /* Given TYPE, and HASHCODE its hash code, return the canonical
3322 object for an identical type if one already exists.
3323 Otherwise, return TYPE, and record it as the canonical object.
3325 To use this function, first create a type of the sort you want.
3326 Then compute its hash code from the fields of the type that
3327 make it different from other similar types.
3328 Then call this function and use the value. */
3331 type_hash_canon (unsigned int hashcode
, tree type
)
3335 /* The hash table only contains main variants, so ensure that's what we're
3337 if (TYPE_MAIN_VARIANT (type
) != type
)
3340 if (!lang_hooks
.types
.hash_types
)
3343 /* See if the type is in the hash table already. If so, return it.
3344 Otherwise, add the type. */
3345 t1
= type_hash_lookup (hashcode
, type
);
3348 #ifdef GATHER_STATISTICS
3349 tree_node_counts
[(int) t_kind
]--;
3350 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3356 type_hash_add (hashcode
, type
);
3361 /* See if the data pointed to by the type hash table is marked. We consider
3362 it marked if the type is marked or if a debug type number or symbol
3363 table entry has been made for the type. This reduces the amount of
3364 debugging output and eliminates that dependency of the debug output on
3365 the number of garbage collections. */
3368 type_hash_marked_p (const void *p
)
3370 tree type
= ((struct type_hash
*) p
)->type
;
3372 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3376 print_type_hash_statistics (void)
3378 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3379 (long) htab_size (type_hash_table
),
3380 (long) htab_elements (type_hash_table
),
3381 htab_collisions (type_hash_table
));
3384 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3385 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3386 by adding the hash codes of the individual attributes. */
3389 attribute_hash_list (tree list
, hashval_t hashcode
)
3393 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3394 /* ??? Do we want to add in TREE_VALUE too? */
3395 hashcode
= iterative_hash_object
3396 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
3400 /* Given two lists of attributes, return true if list l2 is
3401 equivalent to l1. */
3404 attribute_list_equal (tree l1
, tree l2
)
3406 return attribute_list_contained (l1
, l2
)
3407 && attribute_list_contained (l2
, l1
);
3410 /* Given two lists of attributes, return true if list L2 is
3411 completely contained within L1. */
3412 /* ??? This would be faster if attribute names were stored in a canonicalized
3413 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3414 must be used to show these elements are equivalent (which they are). */
3415 /* ??? It's not clear that attributes with arguments will always be handled
3419 attribute_list_contained (tree l1
, tree l2
)
3423 /* First check the obvious, maybe the lists are identical. */
3427 /* Maybe the lists are similar. */
3428 for (t1
= l1
, t2
= l2
;
3430 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3431 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3432 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3434 /* Maybe the lists are equal. */
3435 if (t1
== 0 && t2
== 0)
3438 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3441 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3443 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3446 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3453 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3460 /* Given two lists of types
3461 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3462 return 1 if the lists contain the same types in the same order.
3463 Also, the TREE_PURPOSEs must match. */
3466 type_list_equal (tree l1
, tree l2
)
3470 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3471 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3472 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3473 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3474 && (TREE_TYPE (TREE_PURPOSE (t1
))
3475 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3481 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3482 given by TYPE. If the argument list accepts variable arguments,
3483 then this function counts only the ordinary arguments. */
3486 type_num_arguments (tree type
)
3491 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3492 /* If the function does not take a variable number of arguments,
3493 the last element in the list will have type `void'. */
3494 if (VOID_TYPE_P (TREE_VALUE (t
)))
3502 /* Nonzero if integer constants T1 and T2
3503 represent the same constant value. */
3506 tree_int_cst_equal (tree t1
, tree t2
)
3511 if (t1
== 0 || t2
== 0)
3514 if (TREE_CODE (t1
) == INTEGER_CST
3515 && TREE_CODE (t2
) == INTEGER_CST
3516 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3517 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3523 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3524 The precise way of comparison depends on their data type. */
3527 tree_int_cst_lt (tree t1
, tree t2
)
3532 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
3534 int t1_sgn
= tree_int_cst_sgn (t1
);
3535 int t2_sgn
= tree_int_cst_sgn (t2
);
3537 if (t1_sgn
< t2_sgn
)
3539 else if (t1_sgn
> t2_sgn
)
3541 /* Otherwise, both are non-negative, so we compare them as
3542 unsigned just in case one of them would overflow a signed
3545 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
3546 return INT_CST_LT (t1
, t2
);
3548 return INT_CST_LT_UNSIGNED (t1
, t2
);
3551 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3554 tree_int_cst_compare (tree t1
, tree t2
)
3556 if (tree_int_cst_lt (t1
, t2
))
3558 else if (tree_int_cst_lt (t2
, t1
))
3564 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3565 the host. If POS is zero, the value can be represented in a single
3566 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3567 be represented in a single unsigned HOST_WIDE_INT. */
3570 host_integerp (tree t
, int pos
)
3572 return (TREE_CODE (t
) == INTEGER_CST
3573 && ! TREE_OVERFLOW (t
)
3574 && ((TREE_INT_CST_HIGH (t
) == 0
3575 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3576 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3577 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3578 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
3579 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3582 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3583 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3584 be positive. Abort if we cannot satisfy the above conditions. */
3587 tree_low_cst (tree t
, int pos
)
3589 if (host_integerp (t
, pos
))
3590 return TREE_INT_CST_LOW (t
);
3595 /* Return the most significant bit of the integer constant T. */
3598 tree_int_cst_msb (tree t
)
3602 unsigned HOST_WIDE_INT l
;
3604 /* Note that using TYPE_PRECISION here is wrong. We care about the
3605 actual bits, not the (arbitrary) range of the type. */
3606 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3607 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3608 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3609 return (l
& 1) == 1;
3612 /* Return an indication of the sign of the integer constant T.
3613 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3614 Note that -1 will never be returned it T's type is unsigned. */
3617 tree_int_cst_sgn (tree t
)
3619 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3621 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
3623 else if (TREE_INT_CST_HIGH (t
) < 0)
3629 /* Compare two constructor-element-type constants. Return 1 if the lists
3630 are known to be equal; otherwise return 0. */
3633 simple_cst_list_equal (tree l1
, tree l2
)
3635 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3637 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3640 l1
= TREE_CHAIN (l1
);
3641 l2
= TREE_CHAIN (l2
);
3647 /* Return truthvalue of whether T1 is the same tree structure as T2.
3648 Return 1 if they are the same.
3649 Return 0 if they are understandably different.
3650 Return -1 if either contains tree structure not understood by
3654 simple_cst_equal (tree t1
, tree t2
)
3656 enum tree_code code1
, code2
;
3662 if (t1
== 0 || t2
== 0)
3665 code1
= TREE_CODE (t1
);
3666 code2
= TREE_CODE (t2
);
3668 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3670 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3671 || code2
== NON_LVALUE_EXPR
)
3672 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3674 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3677 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3678 || code2
== NON_LVALUE_EXPR
)
3679 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3687 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3688 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3691 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3694 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3695 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3696 TREE_STRING_LENGTH (t1
)));
3699 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1
),
3700 CONSTRUCTOR_ELTS (t2
));
3703 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3706 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3710 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3713 /* Special case: if either target is an unallocated VAR_DECL,
3714 it means that it's going to be unified with whatever the
3715 TARGET_EXPR is really supposed to initialize, so treat it
3716 as being equivalent to anything. */
3717 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3718 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3719 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3720 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3721 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3722 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3725 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3730 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3732 case WITH_CLEANUP_EXPR
:
3733 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3737 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3740 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3741 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3755 /* This general rule works for most tree codes. All exceptions should be
3756 handled above. If this is a language-specific tree code, we can't
3757 trust what might be in the operand, so say we don't know
3759 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3762 switch (TREE_CODE_CLASS (code1
))
3771 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
3773 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
3785 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
3786 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
3787 than U, respectively. */
3790 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
3792 if (tree_int_cst_sgn (t
) < 0)
3794 else if (TREE_INT_CST_HIGH (t
) != 0)
3796 else if (TREE_INT_CST_LOW (t
) == u
)
3798 else if (TREE_INT_CST_LOW (t
) < u
)
3804 /* Return true if CODE represents an associative tree code. Otherwise
3807 associative_tree_code (enum tree_code code
)
3826 /* Return true if CODE represents an commutative tree code. Otherwise
3829 commutative_tree_code (enum tree_code code
)
3842 case UNORDERED_EXPR
:
3846 case TRUTH_AND_EXPR
:
3847 case TRUTH_XOR_EXPR
:
3857 /* Generate a hash value for an expression. This can be used iteratively
3858 by passing a previous result as the "val" argument.
3860 This function is intended to produce the same hash for expressions which
3861 would compare equal using operand_equal_p. */
3864 iterative_hash_expr (tree t
, hashval_t val
)
3867 enum tree_code code
;
3871 return iterative_hash_object (t
, val
);
3873 code
= TREE_CODE (t
);
3874 class = TREE_CODE_CLASS (code
);
3877 || TREE_CODE (t
) == VALUE_HANDLE
)
3879 /* Decls we can just compare by pointer. */
3880 val
= iterative_hash_object (t
, val
);
3882 else if (class == 'c')
3884 /* Alas, constants aren't shared, so we can't rely on pointer
3886 if (code
== INTEGER_CST
)
3888 val
= iterative_hash_object (TREE_INT_CST_LOW (t
), val
);
3889 val
= iterative_hash_object (TREE_INT_CST_HIGH (t
), val
);
3891 else if (code
== REAL_CST
)
3893 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
3895 val
= iterative_hash (&val2
, sizeof (unsigned int), val
);
3897 else if (code
== STRING_CST
)
3898 val
= iterative_hash (TREE_STRING_POINTER (t
),
3899 TREE_STRING_LENGTH (t
), val
);
3900 else if (code
== COMPLEX_CST
)
3902 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
3903 val
= iterative_hash_expr (TREE_IMAGPART (t
), val
);
3905 else if (code
== VECTOR_CST
)
3906 val
= iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
3910 else if (IS_EXPR_CODE_CLASS (class))
3912 val
= iterative_hash_object (code
, val
);
3914 /* Don't hash the type, that can lead to having nodes which
3915 compare equal according to operand_equal_p, but which
3916 have different hash codes. */
3917 if (code
== NOP_EXPR
3918 || code
== CONVERT_EXPR
3919 || code
== NON_LVALUE_EXPR
)
3921 /* Make sure to include signness in the hash computation. */
3922 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
3923 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
3926 if (commutative_tree_code (code
))
3928 /* It's a commutative expression. We want to hash it the same
3929 however it appears. We do this by first hashing both operands
3930 and then rehashing based on the order of their independent
3932 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
3933 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
3937 t
= one
, one
= two
, two
= t
;
3939 val
= iterative_hash_object (one
, val
);
3940 val
= iterative_hash_object (two
, val
);
3943 for (i
= first_rtl_op (code
) - 1; i
>= 0; --i
)
3944 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
3946 else if (code
== TREE_LIST
)
3948 /* A list of expressions, for a CALL_EXPR or as the elements of a
3950 for (; t
; t
= TREE_CHAIN (t
))
3951 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
3953 else if (code
== SSA_NAME
)
3955 val
= iterative_hash_object (SSA_NAME_VERSION (t
), val
);
3956 val
= iterative_hash_expr (SSA_NAME_VAR (t
), val
);
3964 /* Constructors for pointer, array and function types.
3965 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
3966 constructed by language-dependent code, not here.) */
3968 /* Construct, lay out and return the type of pointers to TO_TYPE with
3969 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
3970 reference all of memory. If such a type has already been
3971 constructed, reuse it. */
3974 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
3979 /* In some cases, languages will have things that aren't a POINTER_TYPE
3980 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
3981 In that case, return that type without regard to the rest of our
3984 ??? This is a kludge, but consistent with the way this function has
3985 always operated and there doesn't seem to be a good way to avoid this
3987 if (TYPE_POINTER_TO (to_type
) != 0
3988 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
3989 return TYPE_POINTER_TO (to_type
);
3991 /* First, if we already have a type for pointers to TO_TYPE and it's
3992 the proper mode, use it. */
3993 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
3994 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
3997 t
= make_node (POINTER_TYPE
);
3999 TREE_TYPE (t
) = to_type
;
4000 TYPE_MODE (t
) = mode
;
4001 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4002 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4003 TYPE_POINTER_TO (to_type
) = t
;
4005 /* Lay out the type. This function has many callers that are concerned
4006 with expression-construction, and this simplifies them all. */
4012 /* By default build pointers in ptr_mode. */
4015 build_pointer_type (tree to_type
)
4017 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4020 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4023 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4028 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4029 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4030 In that case, return that type without regard to the rest of our
4033 ??? This is a kludge, but consistent with the way this function has
4034 always operated and there doesn't seem to be a good way to avoid this
4036 if (TYPE_REFERENCE_TO (to_type
) != 0
4037 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4038 return TYPE_REFERENCE_TO (to_type
);
4040 /* First, if we already have a type for pointers to TO_TYPE and it's
4041 the proper mode, use it. */
4042 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4043 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4046 t
= make_node (REFERENCE_TYPE
);
4048 TREE_TYPE (t
) = to_type
;
4049 TYPE_MODE (t
) = mode
;
4050 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4051 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4052 TYPE_REFERENCE_TO (to_type
) = t
;
4060 /* Build the node for the type of references-to-TO_TYPE by default
4064 build_reference_type (tree to_type
)
4066 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4069 /* Build a type that is compatible with t but has no cv quals anywhere
4072 const char *const *const * -> char ***. */
4075 build_type_no_quals (tree t
)
4077 switch (TREE_CODE (t
))
4080 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4082 TYPE_REF_CAN_ALIAS_ALL (t
));
4083 case REFERENCE_TYPE
:
4085 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4087 TYPE_REF_CAN_ALIAS_ALL (t
));
4089 return TYPE_MAIN_VARIANT (t
);
4093 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4094 MAXVAL should be the maximum value in the domain
4095 (one less than the length of the array).
4097 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4098 We don't enforce this limit, that is up to caller (e.g. language front end).
4099 The limit exists because the result is a signed type and we don't handle
4100 sizes that use more than one HOST_WIDE_INT. */
4103 build_index_type (tree maxval
)
4105 tree itype
= make_node (INTEGER_TYPE
);
4107 TREE_TYPE (itype
) = sizetype
;
4108 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4109 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4110 TYPE_MAX_VALUE (itype
) = convert (sizetype
, maxval
);
4111 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4112 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4113 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4114 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4115 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
4117 if (host_integerp (maxval
, 1))
4118 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
4123 /* Builds a signed or unsigned integer type of precision PRECISION.
4124 Used for C bitfields whose precision does not match that of
4125 built-in target types. */
4127 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
4130 tree itype
= make_node (INTEGER_TYPE
);
4132 TYPE_PRECISION (itype
) = precision
;
4135 fixup_unsigned_type (itype
);
4137 fixup_signed_type (itype
);
4139 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
4140 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
4145 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4146 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4147 low bound LOWVAL and high bound HIGHVAL.
4148 if TYPE==NULL_TREE, sizetype is used. */
4151 build_range_type (tree type
, tree lowval
, tree highval
)
4153 tree itype
= make_node (INTEGER_TYPE
);
4155 TREE_TYPE (itype
) = type
;
4156 if (type
== NULL_TREE
)
4159 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4160 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4162 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4163 TYPE_MODE (itype
) = TYPE_MODE (type
);
4164 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4165 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4166 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4167 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
4169 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
4170 return type_hash_canon (tree_low_cst (highval
, 0)
4171 - tree_low_cst (lowval
, 0),
4177 /* Just like build_index_type, but takes lowval and highval instead
4178 of just highval (maxval). */
4181 build_index_2_type (tree lowval
, tree highval
)
4183 return build_range_type (sizetype
, lowval
, highval
);
4186 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4187 and number of elements specified by the range of values of INDEX_TYPE.
4188 If such a type has already been constructed, reuse it. */
4191 build_array_type (tree elt_type
, tree index_type
)
4194 hashval_t hashcode
= 0;
4196 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4198 error ("arrays of functions are not meaningful");
4199 elt_type
= integer_type_node
;
4202 t
= make_node (ARRAY_TYPE
);
4203 TREE_TYPE (t
) = elt_type
;
4204 TYPE_DOMAIN (t
) = index_type
;
4206 if (index_type
== 0)
4209 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
4210 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
4211 t
= type_hash_canon (hashcode
, t
);
4213 if (!COMPLETE_TYPE_P (t
))
4218 /* Return the TYPE of the elements comprising
4219 the innermost dimension of ARRAY. */
4222 get_inner_array_type (tree array
)
4224 tree type
= TREE_TYPE (array
);
4226 while (TREE_CODE (type
) == ARRAY_TYPE
)
4227 type
= TREE_TYPE (type
);
4232 /* Construct, lay out and return
4233 the type of functions returning type VALUE_TYPE
4234 given arguments of types ARG_TYPES.
4235 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4236 are data type nodes for the arguments of the function.
4237 If such a type has already been constructed, reuse it. */
4240 build_function_type (tree value_type
, tree arg_types
)
4243 hashval_t hashcode
= 0;
4245 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4247 error ("function return type cannot be function");
4248 value_type
= integer_type_node
;
4251 /* Make a node of the sort we want. */
4252 t
= make_node (FUNCTION_TYPE
);
4253 TREE_TYPE (t
) = value_type
;
4254 TYPE_ARG_TYPES (t
) = arg_types
;
4256 /* If we already have such a type, use the old one. */
4257 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
4258 hashcode
= type_hash_list (arg_types
, hashcode
);
4259 t
= type_hash_canon (hashcode
, t
);
4261 if (!COMPLETE_TYPE_P (t
))
4266 /* Build a function type. The RETURN_TYPE is the type returned by the
4267 function. If additional arguments are provided, they are
4268 additional argument types. The list of argument types must always
4269 be terminated by NULL_TREE. */
4272 build_function_type_list (tree return_type
, ...)
4277 va_start (p
, return_type
);
4279 t
= va_arg (p
, tree
);
4280 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
4281 args
= tree_cons (NULL_TREE
, t
, args
);
4284 args
= nreverse (args
);
4285 TREE_CHAIN (last
) = void_list_node
;
4286 args
= build_function_type (return_type
, args
);
4292 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4293 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4294 for the method. An implicit additional parameter (of type
4295 pointer-to-BASETYPE) is added to the ARGTYPES. */
4298 build_method_type_directly (tree basetype
,
4306 /* Make a node of the sort we want. */
4307 t
= make_node (METHOD_TYPE
);
4309 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4310 TREE_TYPE (t
) = rettype
;
4311 ptype
= build_pointer_type (basetype
);
4313 /* The actual arglist for this function includes a "hidden" argument
4314 which is "this". Put it into the list of argument types. */
4315 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
4316 TYPE_ARG_TYPES (t
) = argtypes
;
4318 /* If we already have such a type, use the old one. */
4319 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4320 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
4321 hashcode
= type_hash_list (argtypes
, hashcode
);
4322 t
= type_hash_canon (hashcode
, t
);
4324 if (!COMPLETE_TYPE_P (t
))
4330 /* Construct, lay out and return the type of methods belonging to class
4331 BASETYPE and whose arguments and values are described by TYPE.
4332 If that type exists already, reuse it.
4333 TYPE must be a FUNCTION_TYPE node. */
4336 build_method_type (tree basetype
, tree type
)
4338 if (TREE_CODE (type
) != FUNCTION_TYPE
)
4341 return build_method_type_directly (basetype
,
4343 TYPE_ARG_TYPES (type
));
4346 /* Construct, lay out and return the type of offsets to a value
4347 of type TYPE, within an object of type BASETYPE.
4348 If a suitable offset type exists already, reuse it. */
4351 build_offset_type (tree basetype
, tree type
)
4354 hashval_t hashcode
= 0;
4356 /* Make a node of the sort we want. */
4357 t
= make_node (OFFSET_TYPE
);
4359 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4360 TREE_TYPE (t
) = type
;
4362 /* If we already have such a type, use the old one. */
4363 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4364 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
4365 t
= type_hash_canon (hashcode
, t
);
4367 if (!COMPLETE_TYPE_P (t
))
4373 /* Create a complex type whose components are COMPONENT_TYPE. */
4376 build_complex_type (tree component_type
)
4381 /* Make a node of the sort we want. */
4382 t
= make_node (COMPLEX_TYPE
);
4384 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4386 /* If we already have such a type, use the old one. */
4387 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
4388 t
= type_hash_canon (hashcode
, t
);
4390 if (!COMPLETE_TYPE_P (t
))
4393 /* If we are writing Dwarf2 output we need to create a name,
4394 since complex is a fundamental type. */
4395 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4399 if (component_type
== char_type_node
)
4400 name
= "complex char";
4401 else if (component_type
== signed_char_type_node
)
4402 name
= "complex signed char";
4403 else if (component_type
== unsigned_char_type_node
)
4404 name
= "complex unsigned char";
4405 else if (component_type
== short_integer_type_node
)
4406 name
= "complex short int";
4407 else if (component_type
== short_unsigned_type_node
)
4408 name
= "complex short unsigned int";
4409 else if (component_type
== integer_type_node
)
4410 name
= "complex int";
4411 else if (component_type
== unsigned_type_node
)
4412 name
= "complex unsigned int";
4413 else if (component_type
== long_integer_type_node
)
4414 name
= "complex long int";
4415 else if (component_type
== long_unsigned_type_node
)
4416 name
= "complex long unsigned int";
4417 else if (component_type
== long_long_integer_type_node
)
4418 name
= "complex long long int";
4419 else if (component_type
== long_long_unsigned_type_node
)
4420 name
= "complex long long unsigned int";
4425 TYPE_NAME (t
) = get_identifier (name
);
4428 return build_qualified_type (t
, TYPE_QUALS (component_type
));
4431 /* Return OP, stripped of any conversions to wider types as much as is safe.
4432 Converting the value back to OP's type makes a value equivalent to OP.
4434 If FOR_TYPE is nonzero, we return a value which, if converted to
4435 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4437 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4438 narrowest type that can hold the value, even if they don't exactly fit.
4439 Otherwise, bit-field references are changed to a narrower type
4440 only if they can be fetched directly from memory in that type.
4442 OP must have integer, real or enumeral type. Pointers are not allowed!
4444 There are some cases where the obvious value we could return
4445 would regenerate to OP if converted to OP's type,
4446 but would not extend like OP to wider types.
4447 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4448 For example, if OP is (unsigned short)(signed char)-1,
4449 we avoid returning (signed char)-1 if FOR_TYPE is int,
4450 even though extending that to an unsigned short would regenerate OP,
4451 since the result of extending (signed char)-1 to (int)
4452 is different from (int) OP. */
4455 get_unwidened (tree op
, tree for_type
)
4457 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4458 tree type
= TREE_TYPE (op
);
4460 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4462 = (for_type
!= 0 && for_type
!= type
4463 && final_prec
> TYPE_PRECISION (type
)
4464 && TYPE_UNSIGNED (type
));
4467 while (TREE_CODE (op
) == NOP_EXPR
)
4470 = TYPE_PRECISION (TREE_TYPE (op
))
4471 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4473 /* Truncations are many-one so cannot be removed.
4474 Unless we are later going to truncate down even farther. */
4476 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4479 /* See what's inside this conversion. If we decide to strip it,
4481 op
= TREE_OPERAND (op
, 0);
4483 /* If we have not stripped any zero-extensions (uns is 0),
4484 we can strip any kind of extension.
4485 If we have previously stripped a zero-extension,
4486 only zero-extensions can safely be stripped.
4487 Any extension can be stripped if the bits it would produce
4488 are all going to be discarded later by truncating to FOR_TYPE. */
4492 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4494 /* TYPE_UNSIGNED says whether this is a zero-extension.
4495 Let's avoid computing it if it does not affect WIN
4496 and if UNS will not be needed again. */
4497 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4498 && TYPE_UNSIGNED (TREE_TYPE (op
)))
4506 if (TREE_CODE (op
) == COMPONENT_REF
4507 /* Since type_for_size always gives an integer type. */
4508 && TREE_CODE (type
) != REAL_TYPE
4509 /* Don't crash if field not laid out yet. */
4510 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4511 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4513 unsigned int innerprec
4514 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4515 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4516 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4517 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4519 /* We can get this structure field in the narrowest type it fits in.
4520 If FOR_TYPE is 0, do this only for a field that matches the
4521 narrower type exactly and is aligned for it
4522 The resulting extension to its nominal type (a fullword type)
4523 must fit the same conditions as for other extensions. */
4526 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
4527 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4528 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
4530 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4531 TREE_OPERAND (op
, 1), NULL_TREE
);
4532 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4533 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4540 /* Return OP or a simpler expression for a narrower value
4541 which can be sign-extended or zero-extended to give back OP.
4542 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4543 or 0 if the value should be sign-extended. */
4546 get_narrower (tree op
, int *unsignedp_ptr
)
4551 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
4553 while (TREE_CODE (op
) == NOP_EXPR
)
4556 = (TYPE_PRECISION (TREE_TYPE (op
))
4557 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4559 /* Truncations are many-one so cannot be removed. */
4563 /* See what's inside this conversion. If we decide to strip it,
4568 op
= TREE_OPERAND (op
, 0);
4569 /* An extension: the outermost one can be stripped,
4570 but remember whether it is zero or sign extension. */
4572 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4573 /* Otherwise, if a sign extension has been stripped,
4574 only sign extensions can now be stripped;
4575 if a zero extension has been stripped, only zero-extensions. */
4576 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
4580 else /* bitschange == 0 */
4582 /* A change in nominal type can always be stripped, but we must
4583 preserve the unsignedness. */
4585 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4587 op
= TREE_OPERAND (op
, 0);
4588 /* Keep trying to narrow, but don't assign op to win if it
4589 would turn an integral type into something else. */
4590 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
4597 if (TREE_CODE (op
) == COMPONENT_REF
4598 /* Since type_for_size always gives an integer type. */
4599 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4600 /* Ensure field is laid out already. */
4601 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4602 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4604 unsigned HOST_WIDE_INT innerprec
4605 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4606 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4607 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4608 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4610 /* We can get this structure field in a narrower type that fits it,
4611 but the resulting extension to its nominal type (a fullword type)
4612 must satisfy the same conditions as for other extensions.
4614 Do this only for fields that are aligned (not bit-fields),
4615 because when bit-field insns will be used there is no
4616 advantage in doing this. */
4618 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4619 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4620 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
4624 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
4625 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4626 TREE_OPERAND (op
, 1), NULL_TREE
);
4627 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4628 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4631 *unsignedp_ptr
= uns
;
4635 /* Nonzero if integer constant C has a value that is permissible
4636 for type TYPE (an INTEGER_TYPE). */
4639 int_fits_type_p (tree c
, tree type
)
4641 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4642 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4643 int ok_for_low_bound
, ok_for_high_bound
;
4645 /* Perform some generic filtering first, which may allow making a decision
4646 even if the bounds are not constant. First, negative integers never fit
4647 in unsigned types, */
4648 if ((TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4649 /* Also, unsigned integers with top bit set never fit signed types. */
4650 || (! TYPE_UNSIGNED (type
)
4651 && TYPE_UNSIGNED (TREE_TYPE (c
)) && tree_int_cst_msb (c
)))
4654 /* If at least one bound of the type is a constant integer, we can check
4655 ourselves and maybe make a decision. If no such decision is possible, but
4656 this type is a subtype, try checking against that. Otherwise, use
4657 force_fit_type, which checks against the precision.
4659 Compute the status for each possibly constant bound, and return if we see
4660 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4661 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4662 for "constant known to fit". */
4664 ok_for_low_bound
= -1;
4665 ok_for_high_bound
= -1;
4667 /* Check if C >= type_low_bound. */
4668 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4670 ok_for_low_bound
= ! tree_int_cst_lt (c
, type_low_bound
);
4671 if (! ok_for_low_bound
)
4675 /* Check if c <= type_high_bound. */
4676 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4678 ok_for_high_bound
= ! tree_int_cst_lt (type_high_bound
, c
);
4679 if (! ok_for_high_bound
)
4683 /* If the constant fits both bounds, the result is known. */
4684 if (ok_for_low_bound
== 1 && ok_for_high_bound
== 1)
4687 /* If we haven't been able to decide at this point, there nothing more we
4688 can check ourselves here. Look at the base type if we have one. */
4689 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4690 return int_fits_type_p (c
, TREE_TYPE (type
));
4692 /* Or to force_fit_type, if nothing else. */
4696 TREE_TYPE (c
) = type
;
4697 return !force_fit_type (c
, 0);
4701 /* Subprogram of following function. Called by walk_tree.
4703 Return *TP if it is an automatic variable or parameter of the
4704 function passed in as DATA. */
4707 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
4709 tree fn
= (tree
) data
;
4714 else if (DECL_P (*tp
) && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
4720 /* Returns true if T is, contains, or refers to a type with variable
4721 size. If FN is nonzero, only return true if a modifier of the type
4722 or position of FN is a variable or parameter inside FN.
4724 This concept is more general than that of C99 'variably modified types':
4725 in C99, a struct type is never variably modified because a VLA may not
4726 appear as a structure member. However, in GNU C code like:
4728 struct S { int i[f()]; };
4730 is valid, and other languages may define similar constructs. */
4733 variably_modified_type_p (tree type
, tree fn
)
4737 /* Test if T is either variable (if FN is zero) or an expression containing
4738 a variable in FN. */
4739 #define RETURN_TRUE_IF_VAR(T) \
4740 do { tree _t = (T); \
4741 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4742 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4743 return true; } while (0)
4745 if (type
== error_mark_node
)
4748 /* If TYPE itself has variable size, it is variably modified.
4750 We do not yet have a representation of the C99 '[*]' syntax.
4751 When a representation is chosen, this function should be modified
4752 to test for that case as well. */
4753 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
4754 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type
));
4756 switch (TREE_CODE (type
))
4759 case REFERENCE_TYPE
:
4763 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
4769 /* If TYPE is a function type, it is variably modified if any of the
4770 parameters or the return type are variably modified. */
4771 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
4774 for (t
= TYPE_ARG_TYPES (type
);
4775 t
&& t
!= void_list_node
;
4777 if (variably_modified_type_p (TREE_VALUE (t
), fn
))
4786 /* Scalar types are variably modified if their end points
4788 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
4789 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
4794 case QUAL_UNION_TYPE
:
4795 /* We can't see if any of the field are variably-modified by the
4796 definition we normally use, since that would produce infinite
4797 recursion via pointers. */
4798 /* This is variably modified if some field's type is. */
4799 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
4800 if (TREE_CODE (t
) == FIELD_DECL
)
4802 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
4803 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
4804 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
4806 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
4807 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
4815 /* The current language may have other cases to check, but in general,
4816 all other types are not variably modified. */
4817 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
4819 #undef RETURN_TRUE_IF_VAR
4822 /* Given a DECL or TYPE, return the scope in which it was declared, or
4823 NULL_TREE if there is no containing scope. */
4826 get_containing_scope (tree t
)
4828 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
4831 /* Return the innermost context enclosing DECL that is
4832 a FUNCTION_DECL, or zero if none. */
4835 decl_function_context (tree decl
)
4839 if (TREE_CODE (decl
) == ERROR_MARK
)
4842 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
4843 where we look up the function at runtime. Such functions always take
4844 a first argument of type 'pointer to real context'.
4846 C++ should really be fixed to use DECL_CONTEXT for the real context,
4847 and use something else for the "virtual context". */
4848 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
4851 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4853 context
= DECL_CONTEXT (decl
);
4855 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
4857 if (TREE_CODE (context
) == BLOCK
)
4858 context
= BLOCK_SUPERCONTEXT (context
);
4860 context
= get_containing_scope (context
);
4866 /* Return the innermost context enclosing DECL that is
4867 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
4868 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
4871 decl_type_context (tree decl
)
4873 tree context
= DECL_CONTEXT (decl
);
4876 switch (TREE_CODE (context
))
4878 case NAMESPACE_DECL
:
4879 case TRANSLATION_UNIT_DECL
:
4884 case QUAL_UNION_TYPE
:
4889 context
= DECL_CONTEXT (context
);
4893 context
= BLOCK_SUPERCONTEXT (context
);
4903 /* CALL is a CALL_EXPR. Return the declaration for the function
4904 called, or NULL_TREE if the called function cannot be
4908 get_callee_fndecl (tree call
)
4912 /* It's invalid to call this function with anything but a
4914 if (TREE_CODE (call
) != CALL_EXPR
)
4917 /* The first operand to the CALL is the address of the function
4919 addr
= TREE_OPERAND (call
, 0);
4923 /* If this is a readonly function pointer, extract its initial value. */
4924 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
4925 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
4926 && DECL_INITIAL (addr
))
4927 addr
= DECL_INITIAL (addr
);
4929 /* If the address is just `&f' for some function `f', then we know
4930 that `f' is being called. */
4931 if (TREE_CODE (addr
) == ADDR_EXPR
4932 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
4933 return TREE_OPERAND (addr
, 0);
4935 /* We couldn't figure out what was being called. Maybe the front
4936 end has some idea. */
4937 return lang_hooks
.lang_get_callee_fndecl (call
);
4940 /* Print debugging information about tree nodes generated during the compile,
4941 and any language-specific information. */
4944 dump_tree_statistics (void)
4946 #ifdef GATHER_STATISTICS
4948 int total_nodes
, total_bytes
;
4951 fprintf (stderr
, "\n??? tree nodes created\n\n");
4952 #ifdef GATHER_STATISTICS
4953 fprintf (stderr
, "Kind Nodes Bytes\n");
4954 fprintf (stderr
, "---------------------------------------\n");
4955 total_nodes
= total_bytes
= 0;
4956 for (i
= 0; i
< (int) all_kinds
; i
++)
4958 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
4959 tree_node_counts
[i
], tree_node_sizes
[i
]);
4960 total_nodes
+= tree_node_counts
[i
];
4961 total_bytes
+= tree_node_sizes
[i
];
4963 fprintf (stderr
, "---------------------------------------\n");
4964 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
4965 fprintf (stderr
, "---------------------------------------\n");
4966 ssanames_print_statistics ();
4967 phinodes_print_statistics ();
4969 fprintf (stderr
, "(No per-node statistics)\n");
4971 print_type_hash_statistics ();
4972 lang_hooks
.print_statistics ();
4975 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
4977 /* Generate a crc32 of a string. */
4980 crc32_string (unsigned chksum
, const char *string
)
4984 unsigned value
= *string
<< 24;
4987 for (ix
= 8; ix
--; value
<<= 1)
4991 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5000 /* P is a string that will be used in a symbol. Mask out any characters
5001 that are not valid in that context. */
5004 clean_symbol_name (char *p
)
5008 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5011 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5018 /* Generate a name for a function unique to this translation unit.
5019 TYPE is some string to identify the purpose of this function to the
5020 linker or collect2. */
5023 get_file_function_name_long (const char *type
)
5029 if (first_global_object_name
)
5030 p
= first_global_object_name
;
5033 /* We don't have anything that we know to be unique to this translation
5034 unit, so use what we do have and throw in some randomness. */
5036 const char *name
= weak_global_object_name
;
5037 const char *file
= main_input_filename
;
5042 file
= input_filename
;
5044 len
= strlen (file
);
5045 q
= alloca (9 * 2 + len
+ 1);
5046 memcpy (q
, file
, len
+ 1);
5047 clean_symbol_name (q
);
5049 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5050 crc32_string (0, flag_random_seed
));
5055 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5057 /* Set up the name of the file-level functions we may need.
5058 Use a global object (which is already required to be unique over
5059 the program) rather than the file name (which imposes extra
5061 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5063 return get_identifier (buf
);
5066 /* If KIND=='I', return a suitable global initializer (constructor) name.
5067 If KIND=='D', return a suitable global clean-up (destructor) name. */
5070 get_file_function_name (int kind
)
5077 return get_file_function_name_long (p
);
5080 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5081 The result is placed in BUFFER (which has length BIT_SIZE),
5082 with one bit in each char ('\000' or '\001').
5084 If the constructor is constant, NULL_TREE is returned.
5085 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5088 get_set_constructor_bits (tree init
, char *buffer
, int bit_size
)
5092 HOST_WIDE_INT domain_min
5093 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
5094 tree non_const_bits
= NULL_TREE
;
5096 for (i
= 0; i
< bit_size
; i
++)
5099 for (vals
= TREE_OPERAND (init
, 1);
5100 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
5102 if (!host_integerp (TREE_VALUE (vals
), 0)
5103 || (TREE_PURPOSE (vals
) != NULL_TREE
5104 && !host_integerp (TREE_PURPOSE (vals
), 0)))
5106 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
5107 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
5109 /* Set a range of bits to ones. */
5110 HOST_WIDE_INT lo_index
5111 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
5112 HOST_WIDE_INT hi_index
5113 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5115 if (lo_index
< 0 || lo_index
>= bit_size
5116 || hi_index
< 0 || hi_index
>= bit_size
)
5118 for (; lo_index
<= hi_index
; lo_index
++)
5119 buffer
[lo_index
] = 1;
5123 /* Set a single bit to one. */
5125 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5126 if (index
< 0 || index
>= bit_size
)
5128 error ("invalid initializer for bit string");
5134 return non_const_bits
;
5137 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5138 The result is placed in BUFFER (which is an array of bytes).
5139 If the constructor is constant, NULL_TREE is returned.
5140 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5143 get_set_constructor_bytes (tree init
, unsigned char *buffer
, int wd_size
)
5146 int set_word_size
= BITS_PER_UNIT
;
5147 int bit_size
= wd_size
* set_word_size
;
5149 unsigned char *bytep
= buffer
;
5150 char *bit_buffer
= alloca (bit_size
);
5151 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5153 for (i
= 0; i
< wd_size
; i
++)
5156 for (i
= 0; i
< bit_size
; i
++)
5160 if (BYTES_BIG_ENDIAN
)
5161 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5163 *bytep
|= 1 << bit_pos
;
5166 if (bit_pos
>= set_word_size
)
5167 bit_pos
= 0, bytep
++;
5169 return non_const_bits
;
5172 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5174 /* Complain that the tree code of NODE does not match the expected 0
5175 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5179 tree_check_failed (const tree node
, const char *file
,
5180 int line
, const char *function
, ...)
5184 unsigned length
= 0;
5187 va_start (args
, function
);
5188 while ((code
= va_arg (args
, int)))
5189 length
+= 4 + strlen (tree_code_name
[code
]);
5191 va_start (args
, function
);
5192 buffer
= alloca (length
);
5194 while ((code
= va_arg (args
, int)))
5198 strcpy (buffer
+ length
, " or ");
5201 strcpy (buffer
+ length
, tree_code_name
[code
]);
5202 length
+= strlen (tree_code_name
[code
]);
5206 internal_error ("tree check: expected %s, have %s in %s, at %s:%d",
5207 buffer
, tree_code_name
[TREE_CODE (node
)],
5208 function
, trim_filename (file
), line
);
5211 /* Complain that the tree code of NODE does match the expected 0
5212 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5216 tree_not_check_failed (const tree node
, const char *file
,
5217 int line
, const char *function
, ...)
5221 unsigned length
= 0;
5224 va_start (args
, function
);
5225 while ((code
= va_arg (args
, int)))
5226 length
+= 4 + strlen (tree_code_name
[code
]);
5228 va_start (args
, function
);
5229 buffer
= alloca (length
);
5231 while ((code
= va_arg (args
, int)))
5235 strcpy (buffer
+ length
, " or ");
5238 strcpy (buffer
+ length
, tree_code_name
[code
]);
5239 length
+= strlen (tree_code_name
[code
]);
5243 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5244 buffer
, tree_code_name
[TREE_CODE (node
)],
5245 function
, trim_filename (file
), line
);
5248 /* Similar to tree_check_failed, except that we check for a class of tree
5249 code, given in CL. */
5252 tree_class_check_failed (const tree node
, int cl
, const char *file
,
5253 int line
, const char *function
)
5256 ("tree check: expected class '%c', have '%c' (%s) in %s, at %s:%d",
5257 cl
, TREE_CODE_CLASS (TREE_CODE (node
)),
5258 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
5261 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5262 (dynamically sized) vector. */
5265 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5266 const char *function
)
5269 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5270 idx
+ 1, len
, function
, trim_filename (file
), line
);
5273 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5274 (dynamically sized) vector. */
5277 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5278 const char *function
)
5281 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5282 idx
+ 1, len
, function
, trim_filename (file
), line
);
5285 /* Similar to above, except that the check is for the bounds of the operand
5286 vector of an expression node. */
5289 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
5290 int line
, const char *function
)
5293 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5294 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
5295 function
, trim_filename (file
), line
);
5297 #endif /* ENABLE_TREE_CHECKING */
5299 /* For a new vector type node T, build the information necessary for
5300 debugging output. */
5303 finish_vector_type (tree t
)
5308 tree index
= build_int_2 (TYPE_VECTOR_SUBPARTS (t
) - 1, 0);
5309 tree array
= build_array_type (TREE_TYPE (t
),
5310 build_index_type (index
));
5311 tree rt
= make_node (RECORD_TYPE
);
5313 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5314 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5316 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
5317 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5318 the representation type, and we want to find that die when looking up
5319 the vector type. This is most easily achieved by making the TYPE_UID
5321 TYPE_UID (rt
) = TYPE_UID (t
);
5326 make_or_reuse_type (unsigned size
, int unsignedp
)
5328 if (size
== INT_TYPE_SIZE
)
5329 return unsignedp
? unsigned_type_node
: integer_type_node
;
5330 if (size
== CHAR_TYPE_SIZE
)
5331 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5332 if (size
== SHORT_TYPE_SIZE
)
5333 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5334 if (size
== LONG_TYPE_SIZE
)
5335 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5336 if (size
== LONG_LONG_TYPE_SIZE
)
5337 return (unsignedp
? long_long_unsigned_type_node
5338 : long_long_integer_type_node
);
5341 return make_unsigned_type (size
);
5343 return make_signed_type (size
);
5346 /* Create nodes for all integer types (and error_mark_node) using the sizes
5347 of C datatypes. The caller should call set_sizetype soon after calling
5348 this function to select one of the types as sizetype. */
5351 build_common_tree_nodes (int signed_char
)
5353 error_mark_node
= make_node (ERROR_MARK
);
5354 TREE_TYPE (error_mark_node
) = error_mark_node
;
5356 initialize_sizetypes ();
5358 /* Define both `signed char' and `unsigned char'. */
5359 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5360 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5362 /* Define `char', which is like either `signed char' or `unsigned char'
5363 but not the same as either. */
5366 ? make_signed_type (CHAR_TYPE_SIZE
)
5367 : make_unsigned_type (CHAR_TYPE_SIZE
));
5369 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5370 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5371 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5372 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5373 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5374 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5375 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5376 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5378 /* Define a boolean type. This type only represents boolean values but
5379 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5380 Front ends which want to override this size (i.e. Java) can redefine
5381 boolean_type_node before calling build_common_tree_nodes_2. */
5382 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5383 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5384 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
5385 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
5386 TYPE_PRECISION (boolean_type_node
) = 1;
5388 /* Fill in the rest of the sized types. Reuse existing type nodes
5390 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
5391 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
5392 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
5393 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
5394 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
5396 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
5397 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
5398 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
5399 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
5400 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
5402 access_public_node
= get_identifier ("public");
5403 access_protected_node
= get_identifier ("protected");
5404 access_private_node
= get_identifier ("private");
5407 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5408 It will create several other common tree nodes. */
5411 build_common_tree_nodes_2 (int short_double
)
5413 /* Define these next since types below may used them. */
5414 integer_zero_node
= build_int_2 (0, 0);
5415 integer_one_node
= build_int_2 (1, 0);
5416 integer_minus_one_node
= build_int_2 (-1, -1);
5418 size_zero_node
= size_int (0);
5419 size_one_node
= size_int (1);
5420 bitsize_zero_node
= bitsize_int (0);
5421 bitsize_one_node
= bitsize_int (1);
5422 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5424 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5425 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5427 void_type_node
= make_node (VOID_TYPE
);
5428 layout_type (void_type_node
);
5430 /* We are not going to have real types in C with less than byte alignment,
5431 so we might as well not have any types that claim to have it. */
5432 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5433 TYPE_USER_ALIGN (void_type_node
) = 0;
5435 null_pointer_node
= build_int_2 (0, 0);
5436 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
5437 layout_type (TREE_TYPE (null_pointer_node
));
5439 ptr_type_node
= build_pointer_type (void_type_node
);
5441 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5442 fileptr_type_node
= ptr_type_node
;
5444 float_type_node
= make_node (REAL_TYPE
);
5445 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5446 layout_type (float_type_node
);
5448 double_type_node
= make_node (REAL_TYPE
);
5450 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5452 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5453 layout_type (double_type_node
);
5455 long_double_type_node
= make_node (REAL_TYPE
);
5456 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5457 layout_type (long_double_type_node
);
5459 float_ptr_type_node
= build_pointer_type (float_type_node
);
5460 double_ptr_type_node
= build_pointer_type (double_type_node
);
5461 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
5462 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
5464 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5465 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5466 layout_type (complex_integer_type_node
);
5468 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5469 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5470 layout_type (complex_float_type_node
);
5472 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5473 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5474 layout_type (complex_double_type_node
);
5476 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5477 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5478 layout_type (complex_long_double_type_node
);
5481 tree t
= targetm
.build_builtin_va_list ();
5483 /* Many back-ends define record types without setting TYPE_NAME.
5484 If we copied the record type here, we'd keep the original
5485 record type without a name. This breaks name mangling. So,
5486 don't copy record types and let c_common_nodes_and_builtins()
5487 declare the type to be __builtin_va_list. */
5488 if (TREE_CODE (t
) != RECORD_TYPE
)
5489 t
= build_type_copy (t
);
5491 va_list_type_node
= t
;
5495 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5498 If we requested a pointer to a vector, build up the pointers that
5499 we stripped off while looking for the inner type. Similarly for
5500 return values from functions.
5502 The argument TYPE is the top of the chain, and BOTTOM is the
5503 new type which we will point to. */
5506 reconstruct_complex_type (tree type
, tree bottom
)
5510 if (POINTER_TYPE_P (type
))
5512 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5513 outer
= build_pointer_type (inner
);
5515 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5517 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5518 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
5520 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5522 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5523 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
5525 else if (TREE_CODE (type
) == METHOD_TYPE
)
5527 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5528 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
5530 TYPE_ARG_TYPES (type
));
5535 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
5536 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
5541 /* Returns a vector tree node given a vector mode and inner type. */
5543 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
5546 t
= make_node (VECTOR_TYPE
);
5547 TREE_TYPE (t
) = innertype
;
5548 TYPE_MODE (t
) = mode
;
5549 finish_vector_type (t
);
5553 /* Similarly, but takes inner type and units. */
5556 build_vector_type (tree innertype
, int nunits
)
5558 enum machine_mode innermode
= TYPE_MODE (innertype
);
5559 enum machine_mode mode
;
5561 if (GET_MODE_CLASS (innermode
) == MODE_FLOAT
)
5562 mode
= MIN_MODE_VECTOR_FLOAT
;
5564 mode
= MIN_MODE_VECTOR_INT
;
5566 for (; mode
!= VOIDmode
; mode
= GET_MODE_WIDER_MODE (mode
))
5567 if (GET_MODE_NUNITS (mode
) == nunits
&& GET_MODE_INNER (mode
) == innermode
)
5568 return build_vector_type_for_mode (innertype
, mode
);
5573 /* Given an initializer INIT, return TRUE if INIT is zero or some
5574 aggregate of zeros. Otherwise return FALSE. */
5576 initializer_zerop (tree init
)
5582 switch (TREE_CODE (init
))
5585 return integer_zerop (init
);
5588 /* ??? Note that this is not correct for C4X float formats. There,
5589 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5590 negative exponent. */
5591 return real_zerop (init
)
5592 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
5595 return integer_zerop (init
)
5596 || (real_zerop (init
)
5597 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
5598 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
5601 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
5602 if (!initializer_zerop (TREE_VALUE (elt
)))
5607 elt
= CONSTRUCTOR_ELTS (init
);
5608 if (elt
== NULL_TREE
)
5611 /* A set is empty only if it has no elements. */
5612 if (TREE_CODE (TREE_TYPE (init
)) == SET_TYPE
)
5615 for (; elt
; elt
= TREE_CHAIN (elt
))
5616 if (! initializer_zerop (TREE_VALUE (elt
)))
5626 add_var_to_bind_expr (tree bind_expr
, tree var
)
5628 BIND_EXPR_VARS (bind_expr
)
5629 = chainon (BIND_EXPR_VARS (bind_expr
), var
);
5630 if (BIND_EXPR_BLOCK (bind_expr
))
5631 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr
))
5632 = BIND_EXPR_VARS (bind_expr
);
5635 /* Build an empty statement. */
5638 build_empty_stmt (void)
5640 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
5644 /* Returns true if it is possible to prove that the index of
5645 an array access REF (an ARRAY_REF expression) falls into the
5649 in_array_bounds_p (tree ref
)
5651 tree idx
= TREE_OPERAND (ref
, 1);
5654 if (TREE_CODE (idx
) != INTEGER_CST
)
5657 min
= array_ref_low_bound (ref
);
5658 max
= array_ref_up_bound (ref
);
5661 || TREE_CODE (min
) != INTEGER_CST
5662 || TREE_CODE (max
) != INTEGER_CST
)
5665 if (tree_int_cst_lt (idx
, min
)
5666 || tree_int_cst_lt (max
, idx
))
5672 /* Return true if T (assumed to be a DECL) must be assigned a memory
5676 needs_to_live_in_memory (tree t
)
5678 return (DECL_NEEDS_TO_LIVE_IN_MEMORY_INTERNAL (t
)
5680 || DECL_EXTERNAL (t
)
5681 || DECL_NONLOCAL (t
)
5682 || (TREE_CODE (t
) == RESULT_DECL
5683 && aggregate_value_p (t
, current_function_decl
))
5684 || decl_function_context (t
) != current_function_decl
);
5687 /* There are situations in which a language considers record types
5688 compatible which have different field lists. Decide if two fields
5689 are compatible. It is assumed that the parent records are compatible. */
5692 fields_compatible_p (tree f1
, tree f2
)
5694 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
5695 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
5698 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
5699 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
5702 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
5708 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5711 find_compatible_field (tree record
, tree orig_field
)
5715 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
5716 if (TREE_CODE (f
) == FIELD_DECL
5717 && fields_compatible_p (f
, orig_field
))
5720 /* ??? Why isn't this on the main fields list? */
5721 f
= TYPE_VFIELD (record
);
5722 if (f
&& TREE_CODE (f
) == FIELD_DECL
5723 && fields_compatible_p (f
, orig_field
))
5726 /* ??? We should abort here, but Java appears to do Bad Things
5727 with inherited fields. */
5731 /* Return value of a constant X. */
5734 int_cst_value (tree x
)
5736 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
5737 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
5738 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
5740 if (bits
> HOST_BITS_PER_WIDE_INT
)
5744 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
5746 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
5751 /* Returns the greatest common divisor of A and B, which must be
5755 tree_fold_gcd (tree a
, tree b
)
5758 tree type
= TREE_TYPE (a
);
5760 #if defined ENABLE_CHECKING
5761 if (TREE_CODE (a
) != INTEGER_CST
5762 || TREE_CODE (b
) != INTEGER_CST
)
5766 if (integer_zerop (a
))
5769 if (integer_zerop (b
))
5772 if (tree_int_cst_sgn (a
) == -1)
5773 a
= fold (build (MULT_EXPR
, type
, a
,
5774 convert (type
, integer_minus_one_node
)));
5776 if (tree_int_cst_sgn (b
) == -1)
5777 b
= fold (build (MULT_EXPR
, type
, b
,
5778 convert (type
, integer_minus_one_node
)));
5782 a_mod_b
= fold (build (CEIL_MOD_EXPR
, type
, a
, b
));
5784 if (!TREE_INT_CST_LOW (a_mod_b
)
5785 && !TREE_INT_CST_HIGH (a_mod_b
))
5793 #include "gt-tree.h"