1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
53 /* Each tree code class has an associated string representation.
54 These must correspond to the tree_code_class entries. */
56 const char *const tree_code_class_strings
[] =
70 /* obstack.[ch] explicitly declined to prototype this. */
71 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
73 #ifdef GATHER_STATISTICS
74 /* Statistics-gathering stuff. */
76 int tree_node_counts
[(int) all_kinds
];
77 int tree_node_sizes
[(int) all_kinds
];
79 /* Keep in sync with tree.h:enum tree_node_kind. */
80 static const char * const tree_node_kind_names
[] = {
99 #endif /* GATHER_STATISTICS */
101 /* Unique id for next decl created. */
102 static GTY(()) int next_decl_uid
;
103 /* Unique id for next type created. */
104 static GTY(()) int next_type_uid
= 1;
106 /* Since we cannot rehash a type after it is in the table, we have to
107 keep the hash code. */
109 struct type_hash
GTY(())
115 /* Initial size of the hash table (rounded to next prime). */
116 #define TYPE_HASH_INITIAL_SIZE 1000
118 /* Now here is the hash table. When recording a type, it is added to
119 the slot whose index is the hash code. Note that the hash table is
120 used for several kinds of types (function types, array types and
121 array index range types, for now). While all these live in the
122 same table, they are completely independent, and the hash code is
123 computed differently for each of these. */
125 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
126 htab_t type_hash_table
;
128 /* Hash table and temporary node for larger integer const values. */
129 static GTY (()) tree int_cst_node
;
130 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
131 htab_t int_cst_hash_table
;
133 static void set_type_quals (tree
, int);
134 static int type_hash_eq (const void *, const void *);
135 static hashval_t
type_hash_hash (const void *);
136 static hashval_t
int_cst_hash_hash (const void *);
137 static int int_cst_hash_eq (const void *, const void *);
138 static void print_type_hash_statistics (void);
139 static tree
make_vector_type (tree
, int, enum machine_mode
);
140 static int type_hash_marked_p (const void *);
141 static unsigned int type_hash_list (tree
, hashval_t
);
142 static unsigned int attribute_hash_list (tree
, hashval_t
);
144 tree global_trees
[TI_MAX
];
145 tree integer_types
[itk_none
];
152 /* Initialize the hash table of types. */
153 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
155 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
156 int_cst_hash_eq
, NULL
);
157 int_cst_node
= make_node (INTEGER_CST
);
161 /* The name of the object as the assembler will see it (but before any
162 translations made by ASM_OUTPUT_LABELREF). Often this is the same
163 as DECL_NAME. It is an IDENTIFIER_NODE. */
165 decl_assembler_name (tree decl
)
167 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
168 lang_hooks
.set_decl_assembler_name (decl
);
169 return DECL_CHECK (decl
)->decl
.assembler_name
;
172 /* Compute the number of bytes occupied by a tree with code CODE.
173 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
174 codes, which are of variable length. */
176 tree_code_size (enum tree_code code
)
178 switch (TREE_CODE_CLASS (code
))
180 case tcc_declaration
: /* A decl node */
181 return sizeof (struct tree_decl
);
183 case tcc_type
: /* a type node */
184 return sizeof (struct tree_type
);
186 case tcc_reference
: /* a reference */
187 case tcc_expression
: /* an expression */
188 case tcc_statement
: /* an expression with side effects */
189 case tcc_comparison
: /* a comparison expression */
190 case tcc_unary
: /* a unary arithmetic expression */
191 case tcc_binary
: /* a binary arithmetic expression */
192 return (sizeof (struct tree_exp
)
193 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
195 case tcc_constant
: /* a constant */
198 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
199 case REAL_CST
: return sizeof (struct tree_real_cst
);
200 case COMPLEX_CST
: return sizeof (struct tree_complex
);
201 case VECTOR_CST
: return sizeof (struct tree_vector
);
202 case STRING_CST
: gcc_unreachable ();
204 return lang_hooks
.tree_size (code
);
207 case tcc_exceptional
: /* something random, like an identifier. */
210 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
211 case TREE_LIST
: return sizeof (struct tree_list
);
214 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
217 case PHI_NODE
: gcc_unreachable ();
219 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
221 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
222 case BLOCK
: return sizeof (struct tree_block
);
223 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
226 return lang_hooks
.tree_size (code
);
234 /* Compute the number of bytes occupied by NODE. This routine only
235 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
237 tree_size (tree node
)
239 enum tree_code code
= TREE_CODE (node
);
243 return (sizeof (struct tree_phi_node
)
244 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
247 return (sizeof (struct tree_vec
)
248 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
251 return sizeof (struct tree_string
) + TREE_STRING_LENGTH (node
) - 1;
254 return tree_code_size (code
);
258 /* Return a newly allocated node of code CODE. For decl and type
259 nodes, some other fields are initialized. The rest of the node is
260 initialized to zero. This function cannot be used for PHI_NODE or
261 TREE_VEC nodes, which is enforced by asserts in tree_code_size.
263 Achoo! I got a code in the node. */
266 make_node_stat (enum tree_code code MEM_STAT_DECL
)
269 enum tree_code_class type
= TREE_CODE_CLASS (code
);
270 size_t length
= tree_code_size (code
);
271 #ifdef GATHER_STATISTICS
276 case tcc_declaration
: /* A decl node */
280 case tcc_type
: /* a type node */
284 case tcc_statement
: /* an expression with side effects */
288 case tcc_reference
: /* a reference */
292 case tcc_expression
: /* an expression */
293 case tcc_comparison
: /* a comparison expression */
294 case tcc_unary
: /* a unary arithmetic expression */
295 case tcc_binary
: /* a binary arithmetic expression */
299 case tcc_constant
: /* a constant */
303 case tcc_exceptional
: /* something random, like an identifier. */
306 case IDENTIFIER_NODE
:
323 kind
= ssa_name_kind
;
340 tree_node_counts
[(int) kind
]++;
341 tree_node_sizes
[(int) kind
] += length
;
344 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
346 memset (t
, 0, length
);
348 TREE_SET_CODE (t
, code
);
353 TREE_SIDE_EFFECTS (t
) = 1;
356 case tcc_declaration
:
357 if (code
!= FUNCTION_DECL
)
359 DECL_USER_ALIGN (t
) = 0;
360 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
361 DECL_SOURCE_LOCATION (t
) = input_location
;
362 DECL_UID (t
) = next_decl_uid
++;
364 /* We have not yet computed the alias set for this declaration. */
365 DECL_POINTER_ALIAS_SET (t
) = -1;
369 TYPE_UID (t
) = next_type_uid
++;
370 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
371 TYPE_USER_ALIGN (t
) = 0;
372 TYPE_MAIN_VARIANT (t
) = t
;
374 /* Default to no attributes for type, but let target change that. */
375 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
376 targetm
.set_default_type_attributes (t
);
378 /* We have not yet computed the alias set for this type. */
379 TYPE_ALIAS_SET (t
) = -1;
383 TREE_CONSTANT (t
) = 1;
384 TREE_INVARIANT (t
) = 1;
393 case PREDECREMENT_EXPR
:
394 case PREINCREMENT_EXPR
:
395 case POSTDECREMENT_EXPR
:
396 case POSTINCREMENT_EXPR
:
397 /* All of these have side-effects, no matter what their
399 TREE_SIDE_EFFECTS (t
) = 1;
408 /* Other classes need no special treatment. */
415 /* Return a new node with the same contents as NODE except that its
416 TREE_CHAIN is zero and it has a fresh uid. */
419 copy_node_stat (tree node MEM_STAT_DECL
)
422 enum tree_code code
= TREE_CODE (node
);
425 gcc_assert (code
!= STATEMENT_LIST
);
427 length
= tree_size (node
);
428 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
429 memcpy (t
, node
, length
);
432 TREE_ASM_WRITTEN (t
) = 0;
433 TREE_VISITED (t
) = 0;
436 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
437 DECL_UID (t
) = next_decl_uid
++;
438 else if (TREE_CODE_CLASS (code
) == tcc_type
)
440 TYPE_UID (t
) = next_type_uid
++;
441 /* The following is so that the debug code for
442 the copy is different from the original type.
443 The two statements usually duplicate each other
444 (because they clear fields of the same union),
445 but the optimizer should catch that. */
446 TYPE_SYMTAB_POINTER (t
) = 0;
447 TYPE_SYMTAB_ADDRESS (t
) = 0;
449 /* Do not copy the values cache. */
450 if (TYPE_CACHED_VALUES_P(t
))
452 TYPE_CACHED_VALUES_P (t
) = 0;
453 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
460 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
461 For example, this can copy a list made of TREE_LIST nodes. */
464 copy_list (tree list
)
472 head
= prev
= copy_node (list
);
473 next
= TREE_CHAIN (list
);
476 TREE_CHAIN (prev
) = copy_node (next
);
477 prev
= TREE_CHAIN (prev
);
478 next
= TREE_CHAIN (next
);
484 /* Create an INT_CST node with a LOW value sign extended. */
487 build_int_cst (tree type
, HOST_WIDE_INT low
)
489 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
492 /* Create an INT_CST node with a LOW value zero extended. */
495 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
497 return build_int_cst_wide (type
, low
, 0);
500 /* Create an INT_CST node with a LOW value zero or sign extended depending
504 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
506 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
513 type
= integer_type_node
;
515 bits
= TYPE_PRECISION (type
);
516 signed_p
= !TYPE_UNSIGNED (type
);
517 negative
= ((val
>> (bits
- 1)) & 1) != 0;
519 if (signed_p
&& negative
)
521 if (bits
< HOST_BITS_PER_WIDE_INT
)
522 val
= val
| ((~(unsigned HOST_WIDE_INT
) 0) << bits
);
523 ret
= build_int_cst_wide (type
, val
, ~(unsigned HOST_WIDE_INT
) 0);
527 if (bits
< HOST_BITS_PER_WIDE_INT
)
528 val
= val
& ~((~(unsigned HOST_WIDE_INT
) 0) << bits
);
529 ret
= build_int_cst_wide (type
, val
, 0);
535 /* These are the hash table functions for the hash table of INTEGER_CST
536 nodes of a sizetype. */
538 /* Return the hash code code X, an INTEGER_CST. */
541 int_cst_hash_hash (const void *x
)
545 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
546 ^ htab_hash_pointer (TREE_TYPE (t
)));
549 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
550 is the same as that given by *Y, which is the same. */
553 int_cst_hash_eq (const void *x
, const void *y
)
558 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
559 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
560 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
563 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
564 integer_type_node is used. The returned node is always shared.
565 For small integers we use a per-type vector cache, for larger ones
566 we use a single hash table. */
569 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
576 type
= integer_type_node
;
578 switch (TREE_CODE (type
))
582 /* Cache NULL pointer. */
591 /* Cache false or true. */
600 if (TYPE_UNSIGNED (type
))
603 limit
= INTEGER_SHARE_LIMIT
;
604 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
610 limit
= INTEGER_SHARE_LIMIT
+ 1;
611 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
613 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
623 /* Look for it in the type's vector of small shared ints. */
624 if (!TYPE_CACHED_VALUES_P (type
))
626 TYPE_CACHED_VALUES_P (type
) = 1;
627 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
630 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
633 /* Make sure no one is clobbering the shared constant. */
634 gcc_assert (TREE_TYPE (t
) == type
);
635 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
636 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
640 /* Create a new shared int. */
641 t
= make_node (INTEGER_CST
);
643 TREE_INT_CST_LOW (t
) = low
;
644 TREE_INT_CST_HIGH (t
) = hi
;
645 TREE_TYPE (t
) = type
;
647 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
652 /* Use the cache of larger shared ints. */
655 TREE_INT_CST_LOW (int_cst_node
) = low
;
656 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
657 TREE_TYPE (int_cst_node
) = type
;
659 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
663 /* Insert this one into the hash table. */
666 /* Make a new node for next time round. */
667 int_cst_node
= make_node (INTEGER_CST
);
674 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
675 and the rest are zeros. */
678 build_low_bits_mask (tree type
, unsigned bits
)
680 unsigned HOST_WIDE_INT low
;
682 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
684 gcc_assert (bits
<= TYPE_PRECISION (type
));
686 if (bits
== TYPE_PRECISION (type
)
687 && !TYPE_UNSIGNED (type
))
689 /* Sign extended all-ones mask. */
693 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
695 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
700 bits
-= HOST_BITS_PER_WIDE_INT
;
702 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
705 return build_int_cst_wide (type
, low
, high
);
708 /* Checks that X is integer constant that can be expressed in (unsigned)
709 HOST_WIDE_INT without loss of precision. */
712 cst_and_fits_in_hwi (tree x
)
714 if (TREE_CODE (x
) != INTEGER_CST
)
717 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
720 return (TREE_INT_CST_HIGH (x
) == 0
721 || TREE_INT_CST_HIGH (x
) == -1);
724 /* Return a new VECTOR_CST node whose type is TYPE and whose values
725 are in a list pointed by VALS. */
728 build_vector (tree type
, tree vals
)
730 tree v
= make_node (VECTOR_CST
);
731 int over1
= 0, over2
= 0;
734 TREE_VECTOR_CST_ELTS (v
) = vals
;
735 TREE_TYPE (v
) = type
;
737 /* Iterate through elements and check for overflow. */
738 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
740 tree value
= TREE_VALUE (link
);
742 over1
|= TREE_OVERFLOW (value
);
743 over2
|= TREE_CONSTANT_OVERFLOW (value
);
746 TREE_OVERFLOW (v
) = over1
;
747 TREE_CONSTANT_OVERFLOW (v
) = over2
;
752 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
753 are in a list pointed to by VALS. */
755 build_constructor (tree type
, tree vals
)
757 tree c
= make_node (CONSTRUCTOR
);
758 TREE_TYPE (c
) = type
;
759 CONSTRUCTOR_ELTS (c
) = vals
;
761 /* ??? May not be necessary. Mirrors what build does. */
764 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
765 TREE_READONLY (c
) = TREE_READONLY (vals
);
766 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
767 TREE_INVARIANT (c
) = TREE_INVARIANT (vals
);
773 /* Return a new REAL_CST node whose type is TYPE and value is D. */
776 build_real (tree type
, REAL_VALUE_TYPE d
)
782 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
783 Consider doing it via real_convert now. */
785 v
= make_node (REAL_CST
);
786 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
787 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
789 TREE_TYPE (v
) = type
;
790 TREE_REAL_CST_PTR (v
) = dp
;
791 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
795 /* Return a new REAL_CST node whose type is TYPE
796 and whose value is the integer value of the INTEGER_CST node I. */
799 real_value_from_int_cst (tree type
, tree i
)
803 /* Clear all bits of the real value type so that we can later do
804 bitwise comparisons to see if two values are the same. */
805 memset (&d
, 0, sizeof d
);
807 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
808 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
809 TYPE_UNSIGNED (TREE_TYPE (i
)));
813 /* Given a tree representing an integer constant I, return a tree
814 representing the same value as a floating-point constant of type TYPE. */
817 build_real_from_int_cst (tree type
, tree i
)
820 int overflow
= TREE_OVERFLOW (i
);
822 v
= build_real (type
, real_value_from_int_cst (type
, i
));
824 TREE_OVERFLOW (v
) |= overflow
;
825 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
829 /* Return a newly constructed STRING_CST node whose value is
830 the LEN characters at STR.
831 The TREE_TYPE is not initialized. */
834 build_string (int len
, const char *str
)
839 length
= len
+ sizeof (struct tree_string
);
841 #ifdef GATHER_STATISTICS
842 tree_node_counts
[(int) c_kind
]++;
843 tree_node_sizes
[(int) c_kind
] += length
;
846 s
= ggc_alloc_tree (length
);
848 memset (s
, 0, sizeof (struct tree_common
));
849 TREE_SET_CODE (s
, STRING_CST
);
850 TREE_STRING_LENGTH (s
) = len
;
851 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
852 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
857 /* Return a newly constructed COMPLEX_CST node whose value is
858 specified by the real and imaginary parts REAL and IMAG.
859 Both REAL and IMAG should be constant nodes. TYPE, if specified,
860 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
863 build_complex (tree type
, tree real
, tree imag
)
865 tree t
= make_node (COMPLEX_CST
);
867 TREE_REALPART (t
) = real
;
868 TREE_IMAGPART (t
) = imag
;
869 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
870 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
871 TREE_CONSTANT_OVERFLOW (t
)
872 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
876 /* Build a BINFO with LEN language slots. */
879 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
882 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
883 + VEC_embedded_size (tree
, base_binfos
));
885 #ifdef GATHER_STATISTICS
886 tree_node_counts
[(int) binfo_kind
]++;
887 tree_node_sizes
[(int) binfo_kind
] += length
;
890 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
892 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
894 TREE_SET_CODE (t
, TREE_BINFO
);
896 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
902 /* Build a newly constructed TREE_VEC node of length LEN. */
905 make_tree_vec_stat (int len MEM_STAT_DECL
)
908 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
910 #ifdef GATHER_STATISTICS
911 tree_node_counts
[(int) vec_kind
]++;
912 tree_node_sizes
[(int) vec_kind
] += length
;
915 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
917 memset (t
, 0, length
);
919 TREE_SET_CODE (t
, TREE_VEC
);
920 TREE_VEC_LENGTH (t
) = len
;
925 /* Return 1 if EXPR is the integer constant zero or a complex constant
929 integer_zerop (tree expr
)
933 return ((TREE_CODE (expr
) == INTEGER_CST
934 && ! TREE_CONSTANT_OVERFLOW (expr
)
935 && TREE_INT_CST_LOW (expr
) == 0
936 && TREE_INT_CST_HIGH (expr
) == 0)
937 || (TREE_CODE (expr
) == COMPLEX_CST
938 && integer_zerop (TREE_REALPART (expr
))
939 && integer_zerop (TREE_IMAGPART (expr
))));
942 /* Return 1 if EXPR is the integer constant one or the corresponding
946 integer_onep (tree expr
)
950 return ((TREE_CODE (expr
) == INTEGER_CST
951 && ! TREE_CONSTANT_OVERFLOW (expr
)
952 && TREE_INT_CST_LOW (expr
) == 1
953 && TREE_INT_CST_HIGH (expr
) == 0)
954 || (TREE_CODE (expr
) == COMPLEX_CST
955 && integer_onep (TREE_REALPART (expr
))
956 && integer_zerop (TREE_IMAGPART (expr
))));
959 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
960 it contains. Likewise for the corresponding complex constant. */
963 integer_all_onesp (tree expr
)
970 if (TREE_CODE (expr
) == COMPLEX_CST
971 && integer_all_onesp (TREE_REALPART (expr
))
972 && integer_zerop (TREE_IMAGPART (expr
)))
975 else if (TREE_CODE (expr
) != INTEGER_CST
976 || TREE_CONSTANT_OVERFLOW (expr
))
979 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
981 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
982 && TREE_INT_CST_HIGH (expr
) == -1);
984 /* Note that using TYPE_PRECISION here is wrong. We care about the
985 actual bits, not the (arbitrary) range of the type. */
986 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
987 if (prec
>= HOST_BITS_PER_WIDE_INT
)
989 HOST_WIDE_INT high_value
;
992 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
994 /* Can not handle precisions greater than twice the host int size. */
995 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
996 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
997 /* Shifting by the host word size is undefined according to the ANSI
998 standard, so we must handle this as a special case. */
1001 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1003 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1004 && TREE_INT_CST_HIGH (expr
) == high_value
);
1007 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1010 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1014 integer_pow2p (tree expr
)
1017 HOST_WIDE_INT high
, low
;
1021 if (TREE_CODE (expr
) == COMPLEX_CST
1022 && integer_pow2p (TREE_REALPART (expr
))
1023 && integer_zerop (TREE_IMAGPART (expr
)))
1026 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1029 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1030 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1031 high
= TREE_INT_CST_HIGH (expr
);
1032 low
= TREE_INT_CST_LOW (expr
);
1034 /* First clear all bits that are beyond the type's precision in case
1035 we've been sign extended. */
1037 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1039 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1040 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1044 if (prec
< HOST_BITS_PER_WIDE_INT
)
1045 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1048 if (high
== 0 && low
== 0)
1051 return ((high
== 0 && (low
& (low
- 1)) == 0)
1052 || (low
== 0 && (high
& (high
- 1)) == 0));
1055 /* Return 1 if EXPR is an integer constant other than zero or a
1056 complex constant other than zero. */
1059 integer_nonzerop (tree expr
)
1063 return ((TREE_CODE (expr
) == INTEGER_CST
1064 && ! TREE_CONSTANT_OVERFLOW (expr
)
1065 && (TREE_INT_CST_LOW (expr
) != 0
1066 || TREE_INT_CST_HIGH (expr
) != 0))
1067 || (TREE_CODE (expr
) == COMPLEX_CST
1068 && (integer_nonzerop (TREE_REALPART (expr
))
1069 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1072 /* Return the power of two represented by a tree node known to be a
1076 tree_log2 (tree expr
)
1079 HOST_WIDE_INT high
, low
;
1083 if (TREE_CODE (expr
) == COMPLEX_CST
)
1084 return tree_log2 (TREE_REALPART (expr
));
1086 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1087 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1089 high
= TREE_INT_CST_HIGH (expr
);
1090 low
= TREE_INT_CST_LOW (expr
);
1092 /* First clear all bits that are beyond the type's precision in case
1093 we've been sign extended. */
1095 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1097 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1098 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1102 if (prec
< HOST_BITS_PER_WIDE_INT
)
1103 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1106 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1107 : exact_log2 (low
));
1110 /* Similar, but return the largest integer Y such that 2 ** Y is less
1111 than or equal to EXPR. */
1114 tree_floor_log2 (tree expr
)
1117 HOST_WIDE_INT high
, low
;
1121 if (TREE_CODE (expr
) == COMPLEX_CST
)
1122 return tree_log2 (TREE_REALPART (expr
));
1124 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1125 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1127 high
= TREE_INT_CST_HIGH (expr
);
1128 low
= TREE_INT_CST_LOW (expr
);
1130 /* First clear all bits that are beyond the type's precision in case
1131 we've been sign extended. Ignore if type's precision hasn't been set
1132 since what we are doing is setting it. */
1134 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1136 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1137 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1141 if (prec
< HOST_BITS_PER_WIDE_INT
)
1142 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1145 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1146 : floor_log2 (low
));
1149 /* Return 1 if EXPR is the real constant zero. */
1152 real_zerop (tree expr
)
1156 return ((TREE_CODE (expr
) == REAL_CST
1157 && ! TREE_CONSTANT_OVERFLOW (expr
)
1158 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1159 || (TREE_CODE (expr
) == COMPLEX_CST
1160 && real_zerop (TREE_REALPART (expr
))
1161 && real_zerop (TREE_IMAGPART (expr
))));
1164 /* Return 1 if EXPR is the real constant one in real or complex form. */
1167 real_onep (tree expr
)
1171 return ((TREE_CODE (expr
) == REAL_CST
1172 && ! TREE_CONSTANT_OVERFLOW (expr
)
1173 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1174 || (TREE_CODE (expr
) == COMPLEX_CST
1175 && real_onep (TREE_REALPART (expr
))
1176 && real_zerop (TREE_IMAGPART (expr
))));
1179 /* Return 1 if EXPR is the real constant two. */
1182 real_twop (tree expr
)
1186 return ((TREE_CODE (expr
) == REAL_CST
1187 && ! TREE_CONSTANT_OVERFLOW (expr
)
1188 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1189 || (TREE_CODE (expr
) == COMPLEX_CST
1190 && real_twop (TREE_REALPART (expr
))
1191 && real_zerop (TREE_IMAGPART (expr
))));
1194 /* Return 1 if EXPR is the real constant minus one. */
1197 real_minus_onep (tree expr
)
1201 return ((TREE_CODE (expr
) == REAL_CST
1202 && ! TREE_CONSTANT_OVERFLOW (expr
)
1203 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1204 || (TREE_CODE (expr
) == COMPLEX_CST
1205 && real_minus_onep (TREE_REALPART (expr
))
1206 && real_zerop (TREE_IMAGPART (expr
))));
1209 /* Nonzero if EXP is a constant or a cast of a constant. */
1212 really_constant_p (tree exp
)
1214 /* This is not quite the same as STRIP_NOPS. It does more. */
1215 while (TREE_CODE (exp
) == NOP_EXPR
1216 || TREE_CODE (exp
) == CONVERT_EXPR
1217 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1218 exp
= TREE_OPERAND (exp
, 0);
1219 return TREE_CONSTANT (exp
);
1222 /* Return first list element whose TREE_VALUE is ELEM.
1223 Return 0 if ELEM is not in LIST. */
1226 value_member (tree elem
, tree list
)
1230 if (elem
== TREE_VALUE (list
))
1232 list
= TREE_CHAIN (list
);
1237 /* Return first list element whose TREE_PURPOSE is ELEM.
1238 Return 0 if ELEM is not in LIST. */
1241 purpose_member (tree elem
, tree list
)
1245 if (elem
== TREE_PURPOSE (list
))
1247 list
= TREE_CHAIN (list
);
1252 /* Return nonzero if ELEM is part of the chain CHAIN. */
1255 chain_member (tree elem
, tree chain
)
1261 chain
= TREE_CHAIN (chain
);
1267 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1268 We expect a null pointer to mark the end of the chain.
1269 This is the Lisp primitive `length'. */
1272 list_length (tree t
)
1275 #ifdef ENABLE_TREE_CHECKING
1283 #ifdef ENABLE_TREE_CHECKING
1286 gcc_assert (p
!= q
);
1294 /* Returns the number of FIELD_DECLs in TYPE. */
1297 fields_length (tree type
)
1299 tree t
= TYPE_FIELDS (type
);
1302 for (; t
; t
= TREE_CHAIN (t
))
1303 if (TREE_CODE (t
) == FIELD_DECL
)
1309 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1310 by modifying the last node in chain 1 to point to chain 2.
1311 This is the Lisp primitive `nconc'. */
1314 chainon (tree op1
, tree op2
)
1323 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1325 TREE_CHAIN (t1
) = op2
;
1327 #ifdef ENABLE_TREE_CHECKING
1330 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1331 gcc_assert (t2
!= t1
);
1338 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1341 tree_last (tree chain
)
1345 while ((next
= TREE_CHAIN (chain
)))
1350 /* Reverse the order of elements in the chain T,
1351 and return the new head of the chain (old last element). */
1356 tree prev
= 0, decl
, next
;
1357 for (decl
= t
; decl
; decl
= next
)
1359 next
= TREE_CHAIN (decl
);
1360 TREE_CHAIN (decl
) = prev
;
1366 /* Return a newly created TREE_LIST node whose
1367 purpose and value fields are PARM and VALUE. */
1370 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1372 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1373 TREE_PURPOSE (t
) = parm
;
1374 TREE_VALUE (t
) = value
;
1378 /* Return a newly created TREE_LIST node whose
1379 purpose and value fields are PURPOSE and VALUE
1380 and whose TREE_CHAIN is CHAIN. */
1383 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1387 node
= ggc_alloc_zone_stat (sizeof (struct tree_list
),
1388 tree_zone PASS_MEM_STAT
);
1390 memset (node
, 0, sizeof (struct tree_common
));
1392 #ifdef GATHER_STATISTICS
1393 tree_node_counts
[(int) x_kind
]++;
1394 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1397 TREE_SET_CODE (node
, TREE_LIST
);
1398 TREE_CHAIN (node
) = chain
;
1399 TREE_PURPOSE (node
) = purpose
;
1400 TREE_VALUE (node
) = value
;
1405 /* Return the size nominally occupied by an object of type TYPE
1406 when it resides in memory. The value is measured in units of bytes,
1407 and its data type is that normally used for type sizes
1408 (which is the first type created by make_signed_type or
1409 make_unsigned_type). */
1412 size_in_bytes (tree type
)
1416 if (type
== error_mark_node
)
1417 return integer_zero_node
;
1419 type
= TYPE_MAIN_VARIANT (type
);
1420 t
= TYPE_SIZE_UNIT (type
);
1424 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1425 return size_zero_node
;
1428 if (TREE_CODE (t
) == INTEGER_CST
)
1429 t
= force_fit_type (t
, 0, false, false);
1434 /* Return the size of TYPE (in bytes) as a wide integer
1435 or return -1 if the size can vary or is larger than an integer. */
1438 int_size_in_bytes (tree type
)
1442 if (type
== error_mark_node
)
1445 type
= TYPE_MAIN_VARIANT (type
);
1446 t
= TYPE_SIZE_UNIT (type
);
1448 || TREE_CODE (t
) != INTEGER_CST
1449 || TREE_OVERFLOW (t
)
1450 || TREE_INT_CST_HIGH (t
) != 0
1451 /* If the result would appear negative, it's too big to represent. */
1452 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1455 return TREE_INT_CST_LOW (t
);
1458 /* Return the bit position of FIELD, in bits from the start of the record.
1459 This is a tree of type bitsizetype. */
1462 bit_position (tree field
)
1464 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1465 DECL_FIELD_BIT_OFFSET (field
));
1468 /* Likewise, but return as an integer. Abort if it cannot be represented
1469 in that way (since it could be a signed value, we don't have the option
1470 of returning -1 like int_size_in_byte can. */
1473 int_bit_position (tree field
)
1475 return tree_low_cst (bit_position (field
), 0);
1478 /* Return the byte position of FIELD, in bytes from the start of the record.
1479 This is a tree of type sizetype. */
1482 byte_position (tree field
)
1484 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1485 DECL_FIELD_BIT_OFFSET (field
));
1488 /* Likewise, but return as an integer. Abort if it cannot be represented
1489 in that way (since it could be a signed value, we don't have the option
1490 of returning -1 like int_size_in_byte can. */
1493 int_byte_position (tree field
)
1495 return tree_low_cst (byte_position (field
), 0);
1498 /* Return the strictest alignment, in bits, that T is known to have. */
1503 unsigned int align0
, align1
;
1505 switch (TREE_CODE (t
))
1507 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1508 /* If we have conversions, we know that the alignment of the
1509 object must meet each of the alignments of the types. */
1510 align0
= expr_align (TREE_OPERAND (t
, 0));
1511 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1512 return MAX (align0
, align1
);
1514 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1515 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1516 case CLEANUP_POINT_EXPR
:
1517 /* These don't change the alignment of an object. */
1518 return expr_align (TREE_OPERAND (t
, 0));
1521 /* The best we can do is say that the alignment is the least aligned
1523 align0
= expr_align (TREE_OPERAND (t
, 1));
1524 align1
= expr_align (TREE_OPERAND (t
, 2));
1525 return MIN (align0
, align1
);
1527 case LABEL_DECL
: case CONST_DECL
:
1528 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1529 if (DECL_ALIGN (t
) != 0)
1530 return DECL_ALIGN (t
);
1534 return FUNCTION_BOUNDARY
;
1540 /* Otherwise take the alignment from that of the type. */
1541 return TYPE_ALIGN (TREE_TYPE (t
));
1544 /* Return, as a tree node, the number of elements for TYPE (which is an
1545 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1548 array_type_nelts (tree type
)
1550 tree index_type
, min
, max
;
1552 /* If they did it with unspecified bounds, then we should have already
1553 given an error about it before we got here. */
1554 if (! TYPE_DOMAIN (type
))
1555 return error_mark_node
;
1557 index_type
= TYPE_DOMAIN (type
);
1558 min
= TYPE_MIN_VALUE (index_type
);
1559 max
= TYPE_MAX_VALUE (index_type
);
1561 return (integer_zerop (min
)
1563 : fold (build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1566 /* If arg is static -- a reference to an object in static storage -- then
1567 return the object. This is not the same as the C meaning of `static'.
1568 If arg isn't static, return NULL. */
1573 switch (TREE_CODE (arg
))
1576 /* Nested functions are static, even though taking their address will
1577 involve a trampoline as we unnest the nested function and create
1578 the trampoline on the tree level. */
1582 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1583 && ! DECL_THREAD_LOCAL (arg
)
1584 && ! DECL_NON_ADDR_CONST_P (arg
)
1588 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1592 return TREE_STATIC (arg
) ? arg
: NULL
;
1599 /* If the thing being referenced is not a field, then it is
1600 something language specific. */
1601 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1602 return (*lang_hooks
.staticp
) (arg
);
1604 /* If we are referencing a bitfield, we can't evaluate an
1605 ADDR_EXPR at compile time and so it isn't a constant. */
1606 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1609 return staticp (TREE_OPERAND (arg
, 0));
1614 case MISALIGNED_INDIRECT_REF
:
1615 case ALIGN_INDIRECT_REF
:
1617 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
1620 case ARRAY_RANGE_REF
:
1621 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1622 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1623 return staticp (TREE_OPERAND (arg
, 0));
1628 if ((unsigned int) TREE_CODE (arg
)
1629 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1630 return lang_hooks
.staticp (arg
);
1636 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1637 Do this to any expression which may be used in more than one place,
1638 but must be evaluated only once.
1640 Normally, expand_expr would reevaluate the expression each time.
1641 Calling save_expr produces something that is evaluated and recorded
1642 the first time expand_expr is called on it. Subsequent calls to
1643 expand_expr just reuse the recorded value.
1645 The call to expand_expr that generates code that actually computes
1646 the value is the first call *at compile time*. Subsequent calls
1647 *at compile time* generate code to use the saved value.
1648 This produces correct result provided that *at run time* control
1649 always flows through the insns made by the first expand_expr
1650 before reaching the other places where the save_expr was evaluated.
1651 You, the caller of save_expr, must make sure this is so.
1653 Constants, and certain read-only nodes, are returned with no
1654 SAVE_EXPR because that is safe. Expressions containing placeholders
1655 are not touched; see tree.def for an explanation of what these
1659 save_expr (tree expr
)
1661 tree t
= fold (expr
);
1664 /* If the tree evaluates to a constant, then we don't want to hide that
1665 fact (i.e. this allows further folding, and direct checks for constants).
1666 However, a read-only object that has side effects cannot be bypassed.
1667 Since it is no problem to reevaluate literals, we just return the
1669 inner
= skip_simple_arithmetic (t
);
1671 if (TREE_INVARIANT (inner
)
1672 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1673 || TREE_CODE (inner
) == SAVE_EXPR
1674 || TREE_CODE (inner
) == ERROR_MARK
)
1677 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1678 it means that the size or offset of some field of an object depends on
1679 the value within another field.
1681 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1682 and some variable since it would then need to be both evaluated once and
1683 evaluated more than once. Front-ends must assure this case cannot
1684 happen by surrounding any such subexpressions in their own SAVE_EXPR
1685 and forcing evaluation at the proper time. */
1686 if (contains_placeholder_p (inner
))
1689 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
1691 /* This expression might be placed ahead of a jump to ensure that the
1692 value was computed on both sides of the jump. So make sure it isn't
1693 eliminated as dead. */
1694 TREE_SIDE_EFFECTS (t
) = 1;
1695 TREE_INVARIANT (t
) = 1;
1699 /* Look inside EXPR and into any simple arithmetic operations. Return
1700 the innermost non-arithmetic node. */
1703 skip_simple_arithmetic (tree expr
)
1707 /* We don't care about whether this can be used as an lvalue in this
1709 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1710 expr
= TREE_OPERAND (expr
, 0);
1712 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1713 a constant, it will be more efficient to not make another SAVE_EXPR since
1714 it will allow better simplification and GCSE will be able to merge the
1715 computations if they actually occur. */
1719 if (UNARY_CLASS_P (inner
))
1720 inner
= TREE_OPERAND (inner
, 0);
1721 else if (BINARY_CLASS_P (inner
))
1723 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
1724 inner
= TREE_OPERAND (inner
, 0);
1725 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
1726 inner
= TREE_OPERAND (inner
, 1);
1737 /* Returns the index of the first non-tree operand for CODE, or the number
1738 of operands if all are trees. */
1741 first_rtl_op (enum tree_code code
)
1746 return TREE_CODE_LENGTH (code
);
1750 /* Return which tree structure is used by T. */
1752 enum tree_node_structure_enum
1753 tree_node_structure (tree t
)
1755 enum tree_code code
= TREE_CODE (t
);
1757 switch (TREE_CODE_CLASS (code
))
1759 case tcc_declaration
:
1764 case tcc_comparison
:
1767 case tcc_expression
:
1770 default: /* tcc_constant and tcc_exceptional */
1775 /* tcc_constant cases. */
1776 case INTEGER_CST
: return TS_INT_CST
;
1777 case REAL_CST
: return TS_REAL_CST
;
1778 case COMPLEX_CST
: return TS_COMPLEX
;
1779 case VECTOR_CST
: return TS_VECTOR
;
1780 case STRING_CST
: return TS_STRING
;
1781 /* tcc_exceptional cases. */
1782 case ERROR_MARK
: return TS_COMMON
;
1783 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1784 case TREE_LIST
: return TS_LIST
;
1785 case TREE_VEC
: return TS_VEC
;
1786 case PHI_NODE
: return TS_PHI_NODE
;
1787 case SSA_NAME
: return TS_SSA_NAME
;
1788 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1789 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
1790 case BLOCK
: return TS_BLOCK
;
1791 case TREE_BINFO
: return TS_BINFO
;
1792 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
1799 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1800 or offset that depends on a field within a record. */
1803 contains_placeholder_p (tree exp
)
1805 enum tree_code code
;
1810 code
= TREE_CODE (exp
);
1811 if (code
== PLACEHOLDER_EXPR
)
1814 switch (TREE_CODE_CLASS (code
))
1817 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1818 position computations since they will be converted into a
1819 WITH_RECORD_EXPR involving the reference, which will assume
1820 here will be valid. */
1821 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1823 case tcc_exceptional
:
1824 if (code
== TREE_LIST
)
1825 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
1826 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
1831 case tcc_comparison
:
1832 case tcc_expression
:
1836 /* Ignoring the first operand isn't quite right, but works best. */
1837 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1840 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1841 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
1842 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
1848 switch (first_rtl_op (code
))
1851 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1853 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1854 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
1865 /* Return true if any part of the computation of TYPE involves a
1866 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
1867 (for QUAL_UNION_TYPE) and field positions. */
1870 type_contains_placeholder_1 (tree type
)
1872 /* If the size contains a placeholder or the parent type (component type in
1873 the case of arrays) type involves a placeholder, this type does. */
1874 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1875 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
1876 || (TREE_TYPE (type
) != 0
1877 && type_contains_placeholder_p (TREE_TYPE (type
))))
1880 /* Now do type-specific checks. Note that the last part of the check above
1881 greatly limits what we have to do below. */
1882 switch (TREE_CODE (type
))
1891 case REFERENCE_TYPE
:
1899 /* Here we just check the bounds. */
1900 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
1901 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
1906 /* We're already checked the component type (TREE_TYPE), so just check
1908 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
1912 case QUAL_UNION_TYPE
:
1916 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1917 if (TREE_CODE (field
) == FIELD_DECL
1918 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
1919 || (TREE_CODE (type
) == QUAL_UNION_TYPE
1920 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
1921 || type_contains_placeholder_p (TREE_TYPE (field
))))
1933 type_contains_placeholder_p (tree type
)
1937 /* If the contains_placeholder_bits field has been initialized,
1938 then we know the answer. */
1939 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
1940 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
1942 /* Indicate that we've seen this type node, and the answer is false.
1943 This is what we want to return if we run into recursion via fields. */
1944 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
1946 /* Compute the real value. */
1947 result
= type_contains_placeholder_1 (type
);
1949 /* Store the real value. */
1950 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
1955 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1956 return a tree with all occurrences of references to F in a
1957 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1958 contains only arithmetic expressions or a CALL_EXPR with a
1959 PLACEHOLDER_EXPR occurring only in its arglist. */
1962 substitute_in_expr (tree exp
, tree f
, tree r
)
1964 enum tree_code code
= TREE_CODE (exp
);
1969 /* We handle TREE_LIST and COMPONENT_REF separately. */
1970 if (code
== TREE_LIST
)
1972 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
1973 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
1974 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1977 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1979 else if (code
== COMPONENT_REF
)
1981 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1982 and it is the right field, replace it with R. */
1983 for (inner
= TREE_OPERAND (exp
, 0);
1984 REFERENCE_CLASS_P (inner
);
1985 inner
= TREE_OPERAND (inner
, 0))
1987 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
1988 && TREE_OPERAND (exp
, 1) == f
)
1991 /* If this expression hasn't been completed let, leave it alone. */
1992 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
1995 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
1996 if (op0
== TREE_OPERAND (exp
, 0))
1999 new = fold (build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2000 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
));
2003 switch (TREE_CODE_CLASS (code
))
2006 case tcc_declaration
:
2009 case tcc_exceptional
:
2012 case tcc_comparison
:
2013 case tcc_expression
:
2015 switch (first_rtl_op (code
))
2021 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2022 if (op0
== TREE_OPERAND (exp
, 0))
2025 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2029 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2030 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2032 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2035 new = fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2039 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2040 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2041 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2043 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2044 && op2
== TREE_OPERAND (exp
, 2))
2047 new = fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2059 TREE_READONLY (new) = TREE_READONLY (exp
);
2063 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2064 for it within OBJ, a tree that is an object or a chain of references. */
2067 substitute_placeholder_in_expr (tree exp
, tree obj
)
2069 enum tree_code code
= TREE_CODE (exp
);
2070 tree op0
, op1
, op2
, op3
;
2072 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2073 in the chain of OBJ. */
2074 if (code
== PLACEHOLDER_EXPR
)
2076 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2079 for (elt
= obj
; elt
!= 0;
2080 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2081 || TREE_CODE (elt
) == COND_EXPR
)
2082 ? TREE_OPERAND (elt
, 1)
2083 : (REFERENCE_CLASS_P (elt
)
2084 || UNARY_CLASS_P (elt
)
2085 || BINARY_CLASS_P (elt
)
2086 || EXPRESSION_CLASS_P (elt
))
2087 ? TREE_OPERAND (elt
, 0) : 0))
2088 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2091 for (elt
= obj
; elt
!= 0;
2092 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2093 || TREE_CODE (elt
) == COND_EXPR
)
2094 ? TREE_OPERAND (elt
, 1)
2095 : (REFERENCE_CLASS_P (elt
)
2096 || UNARY_CLASS_P (elt
)
2097 || BINARY_CLASS_P (elt
)
2098 || EXPRESSION_CLASS_P (elt
))
2099 ? TREE_OPERAND (elt
, 0) : 0))
2100 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2101 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2103 return fold (build1 (INDIRECT_REF
, need_type
, elt
));
2105 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2106 survives until RTL generation, there will be an error. */
2110 /* TREE_LIST is special because we need to look at TREE_VALUE
2111 and TREE_CHAIN, not TREE_OPERANDS. */
2112 else if (code
== TREE_LIST
)
2114 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2115 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2116 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2119 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2122 switch (TREE_CODE_CLASS (code
))
2125 case tcc_declaration
:
2128 case tcc_exceptional
:
2131 case tcc_comparison
:
2132 case tcc_expression
:
2135 switch (first_rtl_op (code
))
2141 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2142 if (op0
== TREE_OPERAND (exp
, 0))
2145 return fold (build1 (code
, TREE_TYPE (exp
), op0
));
2148 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2149 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2151 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2154 return fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2157 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2158 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2159 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2161 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2162 && op2
== TREE_OPERAND (exp
, 2))
2165 return fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2168 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2169 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2170 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2171 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2173 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2174 && op2
== TREE_OPERAND (exp
, 2)
2175 && op3
== TREE_OPERAND (exp
, 3))
2178 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2190 /* Stabilize a reference so that we can use it any number of times
2191 without causing its operands to be evaluated more than once.
2192 Returns the stabilized reference. This works by means of save_expr,
2193 so see the caveats in the comments about save_expr.
2195 Also allows conversion expressions whose operands are references.
2196 Any other kind of expression is returned unchanged. */
2199 stabilize_reference (tree ref
)
2202 enum tree_code code
= TREE_CODE (ref
);
2209 /* No action is needed in this case. */
2215 case FIX_TRUNC_EXPR
:
2216 case FIX_FLOOR_EXPR
:
2217 case FIX_ROUND_EXPR
:
2219 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2223 result
= build_nt (INDIRECT_REF
,
2224 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2228 result
= build_nt (COMPONENT_REF
,
2229 stabilize_reference (TREE_OPERAND (ref
, 0)),
2230 TREE_OPERAND (ref
, 1), NULL_TREE
);
2234 result
= build_nt (BIT_FIELD_REF
,
2235 stabilize_reference (TREE_OPERAND (ref
, 0)),
2236 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2237 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2241 result
= build_nt (ARRAY_REF
,
2242 stabilize_reference (TREE_OPERAND (ref
, 0)),
2243 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2244 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2247 case ARRAY_RANGE_REF
:
2248 result
= build_nt (ARRAY_RANGE_REF
,
2249 stabilize_reference (TREE_OPERAND (ref
, 0)),
2250 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2251 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2255 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2256 it wouldn't be ignored. This matters when dealing with
2258 return stabilize_reference_1 (ref
);
2260 /* If arg isn't a kind of lvalue we recognize, make no change.
2261 Caller should recognize the error for an invalid lvalue. */
2266 return error_mark_node
;
2269 TREE_TYPE (result
) = TREE_TYPE (ref
);
2270 TREE_READONLY (result
) = TREE_READONLY (ref
);
2271 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2272 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2277 /* Subroutine of stabilize_reference; this is called for subtrees of
2278 references. Any expression with side-effects must be put in a SAVE_EXPR
2279 to ensure that it is only evaluated once.
2281 We don't put SAVE_EXPR nodes around everything, because assigning very
2282 simple expressions to temporaries causes us to miss good opportunities
2283 for optimizations. Among other things, the opportunity to fold in the
2284 addition of a constant into an addressing mode often gets lost, e.g.
2285 "y[i+1] += x;". In general, we take the approach that we should not make
2286 an assignment unless we are forced into it - i.e., that any non-side effect
2287 operator should be allowed, and that cse should take care of coalescing
2288 multiple utterances of the same expression should that prove fruitful. */
2291 stabilize_reference_1 (tree e
)
2294 enum tree_code code
= TREE_CODE (e
);
2296 /* We cannot ignore const expressions because it might be a reference
2297 to a const array but whose index contains side-effects. But we can
2298 ignore things that are actual constant or that already have been
2299 handled by this function. */
2301 if (TREE_INVARIANT (e
))
2304 switch (TREE_CODE_CLASS (code
))
2306 case tcc_exceptional
:
2308 case tcc_declaration
:
2309 case tcc_comparison
:
2311 case tcc_expression
:
2313 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2314 so that it will only be evaluated once. */
2315 /* The reference (r) and comparison (<) classes could be handled as
2316 below, but it is generally faster to only evaluate them once. */
2317 if (TREE_SIDE_EFFECTS (e
))
2318 return save_expr (e
);
2322 /* Constants need no processing. In fact, we should never reach
2327 /* Division is slow and tends to be compiled with jumps,
2328 especially the division by powers of 2 that is often
2329 found inside of an array reference. So do it just once. */
2330 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2331 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2332 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2333 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2334 return save_expr (e
);
2335 /* Recursively stabilize each operand. */
2336 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2337 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2341 /* Recursively stabilize each operand. */
2342 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2349 TREE_TYPE (result
) = TREE_TYPE (e
);
2350 TREE_READONLY (result
) = TREE_READONLY (e
);
2351 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2352 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2353 TREE_INVARIANT (result
) = 1;
2358 /* Low-level constructors for expressions. */
2360 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2361 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2364 recompute_tree_invarant_for_addr_expr (tree t
)
2367 bool tc
= true, ti
= true, se
= false;
2369 /* We started out assuming this address is both invariant and constant, but
2370 does not have side effects. Now go down any handled components and see if
2371 any of them involve offsets that are either non-constant or non-invariant.
2372 Also check for side-effects.
2374 ??? Note that this code makes no attempt to deal with the case where
2375 taking the address of something causes a copy due to misalignment. */
2377 #define UPDATE_TITCSE(NODE) \
2378 do { tree _node = (NODE); \
2379 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2380 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2381 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2383 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2384 node
= TREE_OPERAND (node
, 0))
2386 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2387 array reference (probably made temporarily by the G++ front end),
2388 so ignore all the operands. */
2389 if ((TREE_CODE (node
) == ARRAY_REF
2390 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2391 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2393 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2394 if (TREE_OPERAND (node
, 2))
2395 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2396 if (TREE_OPERAND (node
, 3))
2397 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2399 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2400 FIELD_DECL, apparently. The G++ front end can put something else
2401 there, at least temporarily. */
2402 else if (TREE_CODE (node
) == COMPONENT_REF
2403 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2405 if (TREE_OPERAND (node
, 2))
2406 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2408 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2409 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2412 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2413 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2414 invariant and constant if the decl is static. It's also invariant if it's
2415 a decl in the current function. Taking the address of a volatile variable
2416 is not volatile. If it's a constant, the address is both invariant and
2417 constant. Otherwise it's neither. */
2418 if (TREE_CODE (node
) == INDIRECT_REF
)
2419 UPDATE_TITCSE (TREE_OPERAND (node
, 0));
2420 else if (DECL_P (node
))
2424 else if (decl_function_context (node
) == current_function_decl
)
2429 else if (CONSTANT_CLASS_P (node
))
2434 se
|= TREE_SIDE_EFFECTS (node
);
2437 TREE_CONSTANT (t
) = tc
;
2438 TREE_INVARIANT (t
) = ti
;
2439 TREE_SIDE_EFFECTS (t
) = se
;
2440 #undef UPDATE_TITCSE
2443 /* Build an expression of code CODE, data type TYPE, and operands as
2444 specified. Expressions and reference nodes can be created this way.
2445 Constants, decls, types and misc nodes cannot be.
2447 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2448 enough for all extant tree codes. These functions can be called
2449 directly (preferably!), but can also be obtained via GCC preprocessor
2450 magic within the build macro. */
2453 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2457 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2459 t
= make_node_stat (code PASS_MEM_STAT
);
2466 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2468 int length
= sizeof (struct tree_exp
);
2469 #ifdef GATHER_STATISTICS
2470 tree_node_kind kind
;
2474 #ifdef GATHER_STATISTICS
2475 switch (TREE_CODE_CLASS (code
))
2477 case tcc_statement
: /* an expression with side effects */
2480 case tcc_reference
: /* a reference */
2488 tree_node_counts
[(int) kind
]++;
2489 tree_node_sizes
[(int) kind
] += length
;
2492 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2494 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
2496 memset (t
, 0, sizeof (struct tree_common
));
2498 TREE_SET_CODE (t
, code
);
2500 TREE_TYPE (t
) = type
;
2501 #ifdef USE_MAPPED_LOCATION
2502 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2504 SET_EXPR_LOCUS (t
, NULL
);
2506 TREE_COMPLEXITY (t
) = 0;
2507 TREE_OPERAND (t
, 0) = node
;
2508 TREE_BLOCK (t
) = NULL_TREE
;
2509 if (node
&& !TYPE_P (node
) && first_rtl_op (code
) != 0)
2511 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2512 TREE_READONLY (t
) = TREE_READONLY (node
);
2515 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2516 TREE_SIDE_EFFECTS (t
) = 1;
2522 case PREDECREMENT_EXPR
:
2523 case PREINCREMENT_EXPR
:
2524 case POSTDECREMENT_EXPR
:
2525 case POSTINCREMENT_EXPR
:
2526 /* All of these have side-effects, no matter what their
2528 TREE_SIDE_EFFECTS (t
) = 1;
2529 TREE_READONLY (t
) = 0;
2532 case MISALIGNED_INDIRECT_REF
:
2533 case ALIGN_INDIRECT_REF
:
2535 /* Whether a dereference is readonly has nothing to do with whether
2536 its operand is readonly. */
2537 TREE_READONLY (t
) = 0;
2542 recompute_tree_invarant_for_addr_expr (t
);
2546 if (TREE_CODE_CLASS (code
) == tcc_unary
2547 && node
&& !TYPE_P (node
)
2548 && TREE_CONSTANT (node
))
2549 TREE_CONSTANT (t
) = 1;
2550 if (TREE_CODE_CLASS (code
) == tcc_unary
2551 && node
&& TREE_INVARIANT (node
))
2552 TREE_INVARIANT (t
) = 1;
2553 if (TREE_CODE_CLASS (code
) == tcc_reference
2554 && node
&& TREE_THIS_VOLATILE (node
))
2555 TREE_THIS_VOLATILE (t
) = 1;
2562 #define PROCESS_ARG(N) \
2564 TREE_OPERAND (t, N) = arg##N; \
2565 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2567 if (TREE_SIDE_EFFECTS (arg##N)) \
2569 if (!TREE_READONLY (arg##N)) \
2571 if (!TREE_CONSTANT (arg##N)) \
2573 if (!TREE_INVARIANT (arg##N)) \
2579 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2581 bool constant
, read_only
, side_effects
, invariant
;
2585 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
2587 t
= make_node_stat (code PASS_MEM_STAT
);
2590 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2591 result based on those same flags for the arguments. But if the
2592 arguments aren't really even `tree' expressions, we shouldn't be trying
2594 fro
= first_rtl_op (code
);
2596 /* Expressions without side effects may be constant if their
2597 arguments are as well. */
2598 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
2599 || TREE_CODE_CLASS (code
) == tcc_binary
);
2601 side_effects
= TREE_SIDE_EFFECTS (t
);
2602 invariant
= constant
;
2607 TREE_READONLY (t
) = read_only
;
2608 TREE_CONSTANT (t
) = constant
;
2609 TREE_INVARIANT (t
) = invariant
;
2610 TREE_SIDE_EFFECTS (t
) = side_effects
;
2611 TREE_THIS_VOLATILE (t
)
2612 = (TREE_CODE_CLASS (code
) == tcc_reference
2613 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2619 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2620 tree arg2 MEM_STAT_DECL
)
2622 bool constant
, read_only
, side_effects
, invariant
;
2626 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
2628 t
= make_node_stat (code PASS_MEM_STAT
);
2631 fro
= first_rtl_op (code
);
2633 side_effects
= TREE_SIDE_EFFECTS (t
);
2639 if (code
== CALL_EXPR
&& !side_effects
)
2644 /* Calls have side-effects, except those to const or
2646 i
= call_expr_flags (t
);
2647 if (!(i
& (ECF_CONST
| ECF_PURE
)))
2650 /* And even those have side-effects if their arguments do. */
2651 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
2652 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
2659 TREE_SIDE_EFFECTS (t
) = side_effects
;
2660 TREE_THIS_VOLATILE (t
)
2661 = (TREE_CODE_CLASS (code
) == tcc_reference
2662 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2668 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2669 tree arg2
, tree arg3 MEM_STAT_DECL
)
2671 bool constant
, read_only
, side_effects
, invariant
;
2675 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
2677 t
= make_node_stat (code PASS_MEM_STAT
);
2680 fro
= first_rtl_op (code
);
2682 side_effects
= TREE_SIDE_EFFECTS (t
);
2689 TREE_SIDE_EFFECTS (t
) = side_effects
;
2690 TREE_THIS_VOLATILE (t
)
2691 = (TREE_CODE_CLASS (code
) == tcc_reference
2692 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2697 /* Backup definition for non-gcc build compilers. */
2700 (build
) (enum tree_code code
, tree tt
, ...)
2702 tree t
, arg0
, arg1
, arg2
, arg3
;
2703 int length
= TREE_CODE_LENGTH (code
);
2710 t
= build0 (code
, tt
);
2713 arg0
= va_arg (p
, tree
);
2714 t
= build1 (code
, tt
, arg0
);
2717 arg0
= va_arg (p
, tree
);
2718 arg1
= va_arg (p
, tree
);
2719 t
= build2 (code
, tt
, arg0
, arg1
);
2722 arg0
= va_arg (p
, tree
);
2723 arg1
= va_arg (p
, tree
);
2724 arg2
= va_arg (p
, tree
);
2725 t
= build3 (code
, tt
, arg0
, arg1
, arg2
);
2728 arg0
= va_arg (p
, tree
);
2729 arg1
= va_arg (p
, tree
);
2730 arg2
= va_arg (p
, tree
);
2731 arg3
= va_arg (p
, tree
);
2732 t
= build4 (code
, tt
, arg0
, arg1
, arg2
, arg3
);
2742 /* Similar except don't specify the TREE_TYPE
2743 and leave the TREE_SIDE_EFFECTS as 0.
2744 It is permissible for arguments to be null,
2745 or even garbage if their values do not matter. */
2748 build_nt (enum tree_code code
, ...)
2757 t
= make_node (code
);
2758 length
= TREE_CODE_LENGTH (code
);
2760 for (i
= 0; i
< length
; i
++)
2761 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2767 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2768 We do NOT enter this node in any sort of symbol table.
2770 layout_decl is used to set up the decl's storage layout.
2771 Other slots are initialized to 0 or null pointers. */
2774 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
2778 t
= make_node_stat (code PASS_MEM_STAT
);
2780 /* if (type == error_mark_node)
2781 type = integer_type_node; */
2782 /* That is not done, deliberately, so that having error_mark_node
2783 as the type can suppress useless errors in the use of this variable. */
2785 DECL_NAME (t
) = name
;
2786 TREE_TYPE (t
) = type
;
2788 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2790 else if (code
== FUNCTION_DECL
)
2791 DECL_MODE (t
) = FUNCTION_MODE
;
2793 /* Set default visibility to whatever the user supplied with
2794 visibility_specified depending on #pragma GCC visibility. */
2795 DECL_VISIBILITY (t
) = default_visibility
;
2796 DECL_VISIBILITY_SPECIFIED (t
) = visibility_options
.inpragma
;
2801 /* BLOCK nodes are used to represent the structure of binding contours
2802 and declarations, once those contours have been exited and their contents
2803 compiled. This information is used for outputting debugging info. */
2806 build_block (tree vars
, tree tags ATTRIBUTE_UNUSED
, tree subblocks
,
2807 tree supercontext
, tree chain
)
2809 tree block
= make_node (BLOCK
);
2811 BLOCK_VARS (block
) = vars
;
2812 BLOCK_SUBBLOCKS (block
) = subblocks
;
2813 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2814 BLOCK_CHAIN (block
) = chain
;
2818 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2819 /* ??? gengtype doesn't handle conditionals */
2820 static GTY(()) tree last_annotated_node
;
2823 #ifdef USE_MAPPED_LOCATION
2826 expand_location (source_location loc
)
2828 expanded_location xloc
;
2829 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
2832 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
2833 xloc
.file
= map
->to_file
;
2834 xloc
.line
= SOURCE_LINE (map
, loc
);
2835 xloc
.column
= SOURCE_COLUMN (map
, loc
);
2842 /* Record the exact location where an expression or an identifier were
2846 annotate_with_file_line (tree node
, const char *file
, int line
)
2848 /* Roughly one percent of the calls to this function are to annotate
2849 a node with the same information already attached to that node!
2850 Just return instead of wasting memory. */
2851 if (EXPR_LOCUS (node
)
2852 && (EXPR_FILENAME (node
) == file
2853 || ! strcmp (EXPR_FILENAME (node
), file
))
2854 && EXPR_LINENO (node
) == line
)
2856 last_annotated_node
= node
;
2860 /* In heavily macroized code (such as GCC itself) this single
2861 entry cache can reduce the number of allocations by more
2863 if (last_annotated_node
2864 && EXPR_LOCUS (last_annotated_node
)
2865 && (EXPR_FILENAME (last_annotated_node
) == file
2866 || ! strcmp (EXPR_FILENAME (last_annotated_node
), file
))
2867 && EXPR_LINENO (last_annotated_node
) == line
)
2869 SET_EXPR_LOCUS (node
, EXPR_LOCUS (last_annotated_node
));
2873 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
2874 EXPR_LINENO (node
) = line
;
2875 EXPR_FILENAME (node
) = file
;
2876 last_annotated_node
= node
;
2880 annotate_with_locus (tree node
, location_t locus
)
2882 annotate_with_file_line (node
, locus
.file
, locus
.line
);
2886 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2890 build_decl_attribute_variant (tree ddecl
, tree attribute
)
2892 DECL_ATTRIBUTES (ddecl
) = attribute
;
2896 /* Borrowed from hashtab.c iterative_hash implementation. */
2897 #define mix(a,b,c) \
2899 a -= b; a -= c; a ^= (c>>13); \
2900 b -= c; b -= a; b ^= (a<< 8); \
2901 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2902 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2903 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2904 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2905 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2906 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2907 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2911 /* Produce good hash value combining VAL and VAL2. */
2912 static inline hashval_t
2913 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
2915 /* the golden ratio; an arbitrary value. */
2916 hashval_t a
= 0x9e3779b9;
2922 /* Produce good hash value combining PTR and VAL2. */
2923 static inline hashval_t
2924 iterative_hash_pointer (void *ptr
, hashval_t val2
)
2926 if (sizeof (ptr
) == sizeof (hashval_t
))
2927 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
2930 hashval_t a
= (hashval_t
) (size_t) ptr
;
2931 /* Avoid warnings about shifting of more than the width of the type on
2932 hosts that won't execute this path. */
2934 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
2940 /* Produce good hash value combining VAL and VAL2. */
2941 static inline hashval_t
2942 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
2944 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
2945 return iterative_hash_hashval_t (val
, val2
);
2948 hashval_t a
= (hashval_t
) val
;
2949 /* Avoid warnings about shifting of more than the width of the type on
2950 hosts that won't execute this path. */
2952 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
2954 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
2956 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
2957 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
2964 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2967 Record such modified types already made so we don't make duplicates. */
2970 build_type_attribute_variant (tree ttype
, tree attribute
)
2972 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2974 hashval_t hashcode
= 0;
2976 enum tree_code code
= TREE_CODE (ttype
);
2978 ntype
= copy_node (ttype
);
2980 TYPE_POINTER_TO (ntype
) = 0;
2981 TYPE_REFERENCE_TO (ntype
) = 0;
2982 TYPE_ATTRIBUTES (ntype
) = attribute
;
2984 /* Create a new main variant of TYPE. */
2985 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2986 TYPE_NEXT_VARIANT (ntype
) = 0;
2987 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2989 hashcode
= iterative_hash_object (code
, hashcode
);
2990 if (TREE_TYPE (ntype
))
2991 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
2993 hashcode
= attribute_hash_list (attribute
, hashcode
);
2995 switch (TREE_CODE (ntype
))
2998 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3001 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3005 hashcode
= iterative_hash_object
3006 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3007 hashcode
= iterative_hash_object
3008 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3012 unsigned int precision
= TYPE_PRECISION (ntype
);
3013 hashcode
= iterative_hash_object (precision
, hashcode
);
3020 ntype
= type_hash_canon (hashcode
, ntype
);
3021 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3027 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3030 We try both `text' and `__text__', ATTR may be either one. */
3031 /* ??? It might be a reasonable simplification to require ATTR to be only
3032 `text'. One might then also require attribute lists to be stored in
3033 their canonicalized form. */
3036 is_attribute_p (const char *attr
, tree ident
)
3038 int ident_len
, attr_len
;
3041 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3044 if (strcmp (attr
, IDENTIFIER_POINTER (ident
)) == 0)
3047 p
= IDENTIFIER_POINTER (ident
);
3048 ident_len
= strlen (p
);
3049 attr_len
= strlen (attr
);
3051 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3054 gcc_assert (attr
[1] == '_');
3055 gcc_assert (attr
[attr_len
- 2] == '_');
3056 gcc_assert (attr
[attr_len
- 1] == '_');
3057 gcc_assert (attr
[1] == '_');
3058 if (ident_len
== attr_len
- 4
3059 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3064 if (ident_len
== attr_len
+ 4
3065 && p
[0] == '_' && p
[1] == '_'
3066 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3067 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3074 /* Given an attribute name and a list of attributes, return a pointer to the
3075 attribute's list element if the attribute is part of the list, or NULL_TREE
3076 if not found. If the attribute appears more than once, this only
3077 returns the first occurrence; the TREE_CHAIN of the return value should
3078 be passed back in if further occurrences are wanted. */
3081 lookup_attribute (const char *attr_name
, tree list
)
3085 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3087 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3088 if (is_attribute_p (attr_name
, TREE_PURPOSE (l
)))
3095 /* Return an attribute list that is the union of a1 and a2. */
3098 merge_attributes (tree a1
, tree a2
)
3102 /* Either one unset? Take the set one. */
3104 if ((attributes
= a1
) == 0)
3107 /* One that completely contains the other? Take it. */
3109 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3111 if (attribute_list_contained (a2
, a1
))
3115 /* Pick the longest list, and hang on the other list. */
3117 if (list_length (a1
) < list_length (a2
))
3118 attributes
= a2
, a2
= a1
;
3120 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3123 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3126 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3129 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
3134 a1
= copy_node (a2
);
3135 TREE_CHAIN (a1
) = attributes
;
3144 /* Given types T1 and T2, merge their attributes and return
3148 merge_type_attributes (tree t1
, tree t2
)
3150 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3151 TYPE_ATTRIBUTES (t2
));
3154 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3158 merge_decl_attributes (tree olddecl
, tree newdecl
)
3160 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3161 DECL_ATTRIBUTES (newdecl
));
3164 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3166 /* Specialization of merge_decl_attributes for various Windows targets.
3168 This handles the following situation:
3170 __declspec (dllimport) int foo;
3173 The second instance of `foo' nullifies the dllimport. */
3176 merge_dllimport_decl_attributes (tree old
, tree
new)
3179 int delete_dllimport_p
;
3181 old
= DECL_ATTRIBUTES (old
);
3182 new = DECL_ATTRIBUTES (new);
3184 /* What we need to do here is remove from `old' dllimport if it doesn't
3185 appear in `new'. dllimport behaves like extern: if a declaration is
3186 marked dllimport and a definition appears later, then the object
3187 is not dllimport'd. */
3188 if (lookup_attribute ("dllimport", old
) != NULL_TREE
3189 && lookup_attribute ("dllimport", new) == NULL_TREE
)
3190 delete_dllimport_p
= 1;
3192 delete_dllimport_p
= 0;
3194 a
= merge_attributes (old
, new);
3196 if (delete_dllimport_p
)
3200 /* Scan the list for dllimport and delete it. */
3201 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3203 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3205 if (prev
== NULL_TREE
)
3208 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3217 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3218 struct attribute_spec.handler. */
3221 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3226 /* These attributes may apply to structure and union types being created,
3227 but otherwise should pass to the declaration involved. */
3230 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3231 | (int) ATTR_FLAG_ARRAY_NEXT
))
3233 *no_add_attrs
= true;
3234 return tree_cons (name
, args
, NULL_TREE
);
3236 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3238 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name
));
3239 *no_add_attrs
= true;
3245 /* Report error on dllimport ambiguities seen now before they cause
3247 if (is_attribute_p ("dllimport", name
))
3249 /* Like MS, treat definition of dllimported variables and
3250 non-inlined functions on declaration as syntax errors. We
3251 allow the attribute for function definitions if declared
3253 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
)
3254 && !DECL_DECLARED_INLINE_P (node
))
3256 error ("%Jfunction %qD definition is marked dllimport.", node
, node
);
3257 *no_add_attrs
= true;
3260 else if (TREE_CODE (node
) == VAR_DECL
)
3262 if (DECL_INITIAL (node
))
3264 error ("%Jvariable %qD definition is marked dllimport.",
3266 *no_add_attrs
= true;
3269 /* `extern' needn't be specified with dllimport.
3270 Specify `extern' now and hope for the best. Sigh. */
3271 DECL_EXTERNAL (node
) = 1;
3272 /* Also, implicitly give dllimport'd variables declared within
3273 a function global scope, unless declared static. */
3274 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3275 TREE_PUBLIC (node
) = 1;
3279 /* Report error if symbol is not accessible at global scope. */
3280 if (!TREE_PUBLIC (node
)
3281 && (TREE_CODE (node
) == VAR_DECL
3282 || TREE_CODE (node
) == FUNCTION_DECL
))
3284 error ("%Jexternal linkage required for symbol %qD because of "
3285 "%qs attribute.", node
, node
, IDENTIFIER_POINTER (name
));
3286 *no_add_attrs
= true;
3292 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3294 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3295 of the various TYPE_QUAL values. */
3298 set_type_quals (tree type
, int type_quals
)
3300 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3301 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3302 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3305 /* Returns true iff cand is equivalent to base with type_quals. */
3308 check_qualified_type (tree cand
, tree base
, int type_quals
)
3310 return (TYPE_QUALS (cand
) == type_quals
3311 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3312 /* Apparently this is needed for Objective-C. */
3313 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3314 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3315 TYPE_ATTRIBUTES (base
)));
3318 /* Return a version of the TYPE, qualified as indicated by the
3319 TYPE_QUALS, if one exists. If no qualified version exists yet,
3320 return NULL_TREE. */
3323 get_qualified_type (tree type
, int type_quals
)
3327 if (TYPE_QUALS (type
) == type_quals
)
3330 /* Search the chain of variants to see if there is already one there just
3331 like the one we need to have. If so, use that existing one. We must
3332 preserve the TYPE_NAME, since there is code that depends on this. */
3333 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3334 if (check_qualified_type (t
, type
, type_quals
))
3340 /* Like get_qualified_type, but creates the type if it does not
3341 exist. This function never returns NULL_TREE. */
3344 build_qualified_type (tree type
, int type_quals
)
3348 /* See if we already have the appropriate qualified variant. */
3349 t
= get_qualified_type (type
, type_quals
);
3351 /* If not, build it. */
3354 t
= build_variant_type_copy (type
);
3355 set_type_quals (t
, type_quals
);
3361 /* Create a new distinct copy of TYPE. The new type is made its own
3365 build_distinct_type_copy (tree type
)
3367 tree t
= copy_node (type
);
3369 TYPE_POINTER_TO (t
) = 0;
3370 TYPE_REFERENCE_TO (t
) = 0;
3372 /* Make it its own variant. */
3373 TYPE_MAIN_VARIANT (t
) = t
;
3374 TYPE_NEXT_VARIANT (t
) = 0;
3379 /* Create a new variant of TYPE, equivalent but distinct.
3380 This is so the caller can modify it. */
3383 build_variant_type_copy (tree type
)
3385 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3387 t
= build_distinct_type_copy (type
);
3389 /* Add the new type to the chain of variants of TYPE. */
3390 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3391 TYPE_NEXT_VARIANT (m
) = t
;
3392 TYPE_MAIN_VARIANT (t
) = m
;
3397 /* Hashing of types so that we don't make duplicates.
3398 The entry point is `type_hash_canon'. */
3400 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3401 with types in the TREE_VALUE slots), by adding the hash codes
3402 of the individual types. */
3405 type_hash_list (tree list
, hashval_t hashcode
)
3409 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3410 if (TREE_VALUE (tail
) != error_mark_node
)
3411 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
3417 /* These are the Hashtable callback functions. */
3419 /* Returns true iff the types are equivalent. */
3422 type_hash_eq (const void *va
, const void *vb
)
3424 const struct type_hash
*a
= va
, *b
= vb
;
3426 /* First test the things that are the same for all types. */
3427 if (a
->hash
!= b
->hash
3428 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
3429 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
3430 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3431 TYPE_ATTRIBUTES (b
->type
))
3432 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
3433 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
3436 switch (TREE_CODE (a
->type
))
3441 case REFERENCE_TYPE
:
3445 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
3448 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
3449 && !(TYPE_VALUES (a
->type
)
3450 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
3451 && TYPE_VALUES (b
->type
)
3452 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
3453 && type_list_equal (TYPE_VALUES (a
->type
),
3454 TYPE_VALUES (b
->type
))))
3457 /* ... fall through ... */
3463 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3464 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3465 TYPE_MAX_VALUE (b
->type
)))
3466 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3467 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3468 TYPE_MIN_VALUE (b
->type
))));
3471 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
3474 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
3475 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3476 || (TYPE_ARG_TYPES (a
->type
)
3477 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3478 && TYPE_ARG_TYPES (b
->type
)
3479 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3480 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3481 TYPE_ARG_TYPES (b
->type
)))));
3485 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
3489 case QUAL_UNION_TYPE
:
3490 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
3491 || (TYPE_FIELDS (a
->type
)
3492 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
3493 && TYPE_FIELDS (b
->type
)
3494 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
3495 && type_list_equal (TYPE_FIELDS (a
->type
),
3496 TYPE_FIELDS (b
->type
))));
3499 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3500 || (TYPE_ARG_TYPES (a
->type
)
3501 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3502 && TYPE_ARG_TYPES (b
->type
)
3503 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3504 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3505 TYPE_ARG_TYPES (b
->type
))));
3512 /* Return the cached hash value. */
3515 type_hash_hash (const void *item
)
3517 return ((const struct type_hash
*) item
)->hash
;
3520 /* Look in the type hash table for a type isomorphic to TYPE.
3521 If one is found, return it. Otherwise return 0. */
3524 type_hash_lookup (hashval_t hashcode
, tree type
)
3526 struct type_hash
*h
, in
;
3528 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3529 must call that routine before comparing TYPE_ALIGNs. */
3535 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3541 /* Add an entry to the type-hash-table
3542 for a type TYPE whose hash code is HASHCODE. */
3545 type_hash_add (hashval_t hashcode
, tree type
)
3547 struct type_hash
*h
;
3550 h
= ggc_alloc (sizeof (struct type_hash
));
3553 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3554 *(struct type_hash
**) loc
= h
;
3557 /* Given TYPE, and HASHCODE its hash code, return the canonical
3558 object for an identical type if one already exists.
3559 Otherwise, return TYPE, and record it as the canonical object.
3561 To use this function, first create a type of the sort you want.
3562 Then compute its hash code from the fields of the type that
3563 make it different from other similar types.
3564 Then call this function and use the value. */
3567 type_hash_canon (unsigned int hashcode
, tree type
)
3571 /* The hash table only contains main variants, so ensure that's what we're
3573 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
3575 if (!lang_hooks
.types
.hash_types
)
3578 /* See if the type is in the hash table already. If so, return it.
3579 Otherwise, add the type. */
3580 t1
= type_hash_lookup (hashcode
, type
);
3583 #ifdef GATHER_STATISTICS
3584 tree_node_counts
[(int) t_kind
]--;
3585 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3591 type_hash_add (hashcode
, type
);
3596 /* See if the data pointed to by the type hash table is marked. We consider
3597 it marked if the type is marked or if a debug type number or symbol
3598 table entry has been made for the type. This reduces the amount of
3599 debugging output and eliminates that dependency of the debug output on
3600 the number of garbage collections. */
3603 type_hash_marked_p (const void *p
)
3605 tree type
= ((struct type_hash
*) p
)->type
;
3607 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3611 print_type_hash_statistics (void)
3613 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3614 (long) htab_size (type_hash_table
),
3615 (long) htab_elements (type_hash_table
),
3616 htab_collisions (type_hash_table
));
3619 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3620 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3621 by adding the hash codes of the individual attributes. */
3624 attribute_hash_list (tree list
, hashval_t hashcode
)
3628 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3629 /* ??? Do we want to add in TREE_VALUE too? */
3630 hashcode
= iterative_hash_object
3631 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
3635 /* Given two lists of attributes, return true if list l2 is
3636 equivalent to l1. */
3639 attribute_list_equal (tree l1
, tree l2
)
3641 return attribute_list_contained (l1
, l2
)
3642 && attribute_list_contained (l2
, l1
);
3645 /* Given two lists of attributes, return true if list L2 is
3646 completely contained within L1. */
3647 /* ??? This would be faster if attribute names were stored in a canonicalized
3648 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3649 must be used to show these elements are equivalent (which they are). */
3650 /* ??? It's not clear that attributes with arguments will always be handled
3654 attribute_list_contained (tree l1
, tree l2
)
3658 /* First check the obvious, maybe the lists are identical. */
3662 /* Maybe the lists are similar. */
3663 for (t1
= l1
, t2
= l2
;
3665 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3666 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3667 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3669 /* Maybe the lists are equal. */
3670 if (t1
== 0 && t2
== 0)
3673 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3676 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3678 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3681 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3688 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3695 /* Given two lists of types
3696 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3697 return 1 if the lists contain the same types in the same order.
3698 Also, the TREE_PURPOSEs must match. */
3701 type_list_equal (tree l1
, tree l2
)
3705 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3706 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3707 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3708 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3709 && (TREE_TYPE (TREE_PURPOSE (t1
))
3710 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3716 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3717 given by TYPE. If the argument list accepts variable arguments,
3718 then this function counts only the ordinary arguments. */
3721 type_num_arguments (tree type
)
3726 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3727 /* If the function does not take a variable number of arguments,
3728 the last element in the list will have type `void'. */
3729 if (VOID_TYPE_P (TREE_VALUE (t
)))
3737 /* Nonzero if integer constants T1 and T2
3738 represent the same constant value. */
3741 tree_int_cst_equal (tree t1
, tree t2
)
3746 if (t1
== 0 || t2
== 0)
3749 if (TREE_CODE (t1
) == INTEGER_CST
3750 && TREE_CODE (t2
) == INTEGER_CST
3751 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3752 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3758 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3759 The precise way of comparison depends on their data type. */
3762 tree_int_cst_lt (tree t1
, tree t2
)
3767 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
3769 int t1_sgn
= tree_int_cst_sgn (t1
);
3770 int t2_sgn
= tree_int_cst_sgn (t2
);
3772 if (t1_sgn
< t2_sgn
)
3774 else if (t1_sgn
> t2_sgn
)
3776 /* Otherwise, both are non-negative, so we compare them as
3777 unsigned just in case one of them would overflow a signed
3780 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
3781 return INT_CST_LT (t1
, t2
);
3783 return INT_CST_LT_UNSIGNED (t1
, t2
);
3786 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3789 tree_int_cst_compare (tree t1
, tree t2
)
3791 if (tree_int_cst_lt (t1
, t2
))
3793 else if (tree_int_cst_lt (t2
, t1
))
3799 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3800 the host. If POS is zero, the value can be represented in a single
3801 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3802 be represented in a single unsigned HOST_WIDE_INT. */
3805 host_integerp (tree t
, int pos
)
3807 return (TREE_CODE (t
) == INTEGER_CST
3808 && ! TREE_OVERFLOW (t
)
3809 && ((TREE_INT_CST_HIGH (t
) == 0
3810 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3811 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3812 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3813 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
3814 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3817 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3818 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3819 be positive. Abort if we cannot satisfy the above conditions. */
3822 tree_low_cst (tree t
, int pos
)
3824 gcc_assert (host_integerp (t
, pos
));
3825 return TREE_INT_CST_LOW (t
);
3828 /* Return the most significant bit of the integer constant T. */
3831 tree_int_cst_msb (tree t
)
3835 unsigned HOST_WIDE_INT l
;
3837 /* Note that using TYPE_PRECISION here is wrong. We care about the
3838 actual bits, not the (arbitrary) range of the type. */
3839 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3840 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3841 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3842 return (l
& 1) == 1;
3845 /* Return an indication of the sign of the integer constant T.
3846 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3847 Note that -1 will never be returned it T's type is unsigned. */
3850 tree_int_cst_sgn (tree t
)
3852 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3854 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
3856 else if (TREE_INT_CST_HIGH (t
) < 0)
3862 /* Compare two constructor-element-type constants. Return 1 if the lists
3863 are known to be equal; otherwise return 0. */
3866 simple_cst_list_equal (tree l1
, tree l2
)
3868 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3870 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3873 l1
= TREE_CHAIN (l1
);
3874 l2
= TREE_CHAIN (l2
);
3880 /* Return truthvalue of whether T1 is the same tree structure as T2.
3881 Return 1 if they are the same.
3882 Return 0 if they are understandably different.
3883 Return -1 if either contains tree structure not understood by
3887 simple_cst_equal (tree t1
, tree t2
)
3889 enum tree_code code1
, code2
;
3895 if (t1
== 0 || t2
== 0)
3898 code1
= TREE_CODE (t1
);
3899 code2
= TREE_CODE (t2
);
3901 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3903 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3904 || code2
== NON_LVALUE_EXPR
)
3905 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3907 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3910 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3911 || code2
== NON_LVALUE_EXPR
)
3912 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3920 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3921 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3924 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3927 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3928 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3929 TREE_STRING_LENGTH (t1
)));
3932 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1
),
3933 CONSTRUCTOR_ELTS (t2
));
3936 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3939 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3943 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3946 /* Special case: if either target is an unallocated VAR_DECL,
3947 it means that it's going to be unified with whatever the
3948 TARGET_EXPR is really supposed to initialize, so treat it
3949 as being equivalent to anything. */
3950 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3951 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3952 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3953 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3954 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3955 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3958 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3963 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3965 case WITH_CLEANUP_EXPR
:
3966 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3970 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3973 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3974 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3988 /* This general rule works for most tree codes. All exceptions should be
3989 handled above. If this is a language-specific tree code, we can't
3990 trust what might be in the operand, so say we don't know
3992 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
3995 switch (TREE_CODE_CLASS (code1
))
3999 case tcc_comparison
:
4000 case tcc_expression
:
4004 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
4006 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4018 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4019 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4020 than U, respectively. */
4023 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
4025 if (tree_int_cst_sgn (t
) < 0)
4027 else if (TREE_INT_CST_HIGH (t
) != 0)
4029 else if (TREE_INT_CST_LOW (t
) == u
)
4031 else if (TREE_INT_CST_LOW (t
) < u
)
4037 /* Return true if CODE represents an associative tree code. Otherwise
4040 associative_tree_code (enum tree_code code
)
4059 /* Return true if CODE represents a commutative tree code. Otherwise
4062 commutative_tree_code (enum tree_code code
)
4075 case UNORDERED_EXPR
:
4079 case TRUTH_AND_EXPR
:
4080 case TRUTH_XOR_EXPR
:
4090 /* Generate a hash value for an expression. This can be used iteratively
4091 by passing a previous result as the "val" argument.
4093 This function is intended to produce the same hash for expressions which
4094 would compare equal using operand_equal_p. */
4097 iterative_hash_expr (tree t
, hashval_t val
)
4100 enum tree_code code
;
4104 return iterative_hash_pointer (t
, val
);
4106 code
= TREE_CODE (t
);
4110 /* Alas, constants aren't shared, so we can't rely on pointer
4113 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
4114 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4117 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4119 return iterative_hash_hashval_t (val2
, val
);
4122 return iterative_hash (TREE_STRING_POINTER (t
),
4123 TREE_STRING_LENGTH (t
), val
);
4125 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4126 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4128 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4132 /* we can just compare by pointer. */
4133 return iterative_hash_pointer (t
, val
);
4136 /* A list of expressions, for a CALL_EXPR or as the elements of a
4138 for (; t
; t
= TREE_CHAIN (t
))
4139 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4142 class = TREE_CODE_CLASS (code
);
4144 if (class == tcc_declaration
)
4146 /* Decls we can just compare by pointer. */
4147 val
= iterative_hash_pointer (t
, val
);
4151 gcc_assert (IS_EXPR_CODE_CLASS (class));
4153 val
= iterative_hash_object (code
, val
);
4155 /* Don't hash the type, that can lead to having nodes which
4156 compare equal according to operand_equal_p, but which
4157 have different hash codes. */
4158 if (code
== NOP_EXPR
4159 || code
== CONVERT_EXPR
4160 || code
== NON_LVALUE_EXPR
)
4162 /* Make sure to include signness in the hash computation. */
4163 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4164 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4167 else if (commutative_tree_code (code
))
4169 /* It's a commutative expression. We want to hash it the same
4170 however it appears. We do this by first hashing both operands
4171 and then rehashing based on the order of their independent
4173 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4174 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4178 t
= one
, one
= two
, two
= t
;
4180 val
= iterative_hash_hashval_t (one
, val
);
4181 val
= iterative_hash_hashval_t (two
, val
);
4184 for (i
= first_rtl_op (code
) - 1; i
>= 0; --i
)
4185 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4192 /* Constructors for pointer, array and function types.
4193 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4194 constructed by language-dependent code, not here.) */
4196 /* Construct, lay out and return the type of pointers to TO_TYPE with
4197 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4198 reference all of memory. If such a type has already been
4199 constructed, reuse it. */
4202 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4207 /* In some cases, languages will have things that aren't a POINTER_TYPE
4208 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4209 In that case, return that type without regard to the rest of our
4212 ??? This is a kludge, but consistent with the way this function has
4213 always operated and there doesn't seem to be a good way to avoid this
4215 if (TYPE_POINTER_TO (to_type
) != 0
4216 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4217 return TYPE_POINTER_TO (to_type
);
4219 /* First, if we already have a type for pointers to TO_TYPE and it's
4220 the proper mode, use it. */
4221 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4222 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4225 t
= make_node (POINTER_TYPE
);
4227 TREE_TYPE (t
) = to_type
;
4228 TYPE_MODE (t
) = mode
;
4229 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4230 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4231 TYPE_POINTER_TO (to_type
) = t
;
4233 /* Lay out the type. This function has many callers that are concerned
4234 with expression-construction, and this simplifies them all. */
4240 /* By default build pointers in ptr_mode. */
4243 build_pointer_type (tree to_type
)
4245 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4248 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4251 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4256 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4257 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4258 In that case, return that type without regard to the rest of our
4261 ??? This is a kludge, but consistent with the way this function has
4262 always operated and there doesn't seem to be a good way to avoid this
4264 if (TYPE_REFERENCE_TO (to_type
) != 0
4265 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4266 return TYPE_REFERENCE_TO (to_type
);
4268 /* First, if we already have a type for pointers to TO_TYPE and it's
4269 the proper mode, use it. */
4270 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4271 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4274 t
= make_node (REFERENCE_TYPE
);
4276 TREE_TYPE (t
) = to_type
;
4277 TYPE_MODE (t
) = mode
;
4278 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4279 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4280 TYPE_REFERENCE_TO (to_type
) = t
;
4288 /* Build the node for the type of references-to-TO_TYPE by default
4292 build_reference_type (tree to_type
)
4294 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4297 /* Build a type that is compatible with t but has no cv quals anywhere
4300 const char *const *const * -> char ***. */
4303 build_type_no_quals (tree t
)
4305 switch (TREE_CODE (t
))
4308 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4310 TYPE_REF_CAN_ALIAS_ALL (t
));
4311 case REFERENCE_TYPE
:
4313 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4315 TYPE_REF_CAN_ALIAS_ALL (t
));
4317 return TYPE_MAIN_VARIANT (t
);
4321 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4322 MAXVAL should be the maximum value in the domain
4323 (one less than the length of the array).
4325 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4326 We don't enforce this limit, that is up to caller (e.g. language front end).
4327 The limit exists because the result is a signed type and we don't handle
4328 sizes that use more than one HOST_WIDE_INT. */
4331 build_index_type (tree maxval
)
4333 tree itype
= make_node (INTEGER_TYPE
);
4335 TREE_TYPE (itype
) = sizetype
;
4336 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4337 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4338 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
4339 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4340 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4341 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4342 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4343 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
4345 if (host_integerp (maxval
, 1))
4346 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
4351 /* Builds a signed or unsigned integer type of precision PRECISION.
4352 Used for C bitfields whose precision does not match that of
4353 built-in target types. */
4355 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
4358 tree itype
= make_node (INTEGER_TYPE
);
4360 TYPE_PRECISION (itype
) = precision
;
4363 fixup_unsigned_type (itype
);
4365 fixup_signed_type (itype
);
4367 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
4368 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
4373 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4374 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4375 low bound LOWVAL and high bound HIGHVAL.
4376 if TYPE==NULL_TREE, sizetype is used. */
4379 build_range_type (tree type
, tree lowval
, tree highval
)
4381 tree itype
= make_node (INTEGER_TYPE
);
4383 TREE_TYPE (itype
) = type
;
4384 if (type
== NULL_TREE
)
4387 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4388 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4390 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4391 TYPE_MODE (itype
) = TYPE_MODE (type
);
4392 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4393 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4394 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4395 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
4397 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
4398 return type_hash_canon (tree_low_cst (highval
, 0)
4399 - tree_low_cst (lowval
, 0),
4405 /* Just like build_index_type, but takes lowval and highval instead
4406 of just highval (maxval). */
4409 build_index_2_type (tree lowval
, tree highval
)
4411 return build_range_type (sizetype
, lowval
, highval
);
4414 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4415 and number of elements specified by the range of values of INDEX_TYPE.
4416 If such a type has already been constructed, reuse it. */
4419 build_array_type (tree elt_type
, tree index_type
)
4422 hashval_t hashcode
= 0;
4424 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4426 error ("arrays of functions are not meaningful");
4427 elt_type
= integer_type_node
;
4430 t
= make_node (ARRAY_TYPE
);
4431 TREE_TYPE (t
) = elt_type
;
4432 TYPE_DOMAIN (t
) = index_type
;
4434 if (index_type
== 0)
4440 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
4441 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
4442 t
= type_hash_canon (hashcode
, t
);
4444 if (!COMPLETE_TYPE_P (t
))
4449 /* Return the TYPE of the elements comprising
4450 the innermost dimension of ARRAY. */
4453 get_inner_array_type (tree array
)
4455 tree type
= TREE_TYPE (array
);
4457 while (TREE_CODE (type
) == ARRAY_TYPE
)
4458 type
= TREE_TYPE (type
);
4463 /* Construct, lay out and return
4464 the type of functions returning type VALUE_TYPE
4465 given arguments of types ARG_TYPES.
4466 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4467 are data type nodes for the arguments of the function.
4468 If such a type has already been constructed, reuse it. */
4471 build_function_type (tree value_type
, tree arg_types
)
4474 hashval_t hashcode
= 0;
4476 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4478 error ("function return type cannot be function");
4479 value_type
= integer_type_node
;
4482 /* Make a node of the sort we want. */
4483 t
= make_node (FUNCTION_TYPE
);
4484 TREE_TYPE (t
) = value_type
;
4485 TYPE_ARG_TYPES (t
) = arg_types
;
4487 /* If we already have such a type, use the old one. */
4488 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
4489 hashcode
= type_hash_list (arg_types
, hashcode
);
4490 t
= type_hash_canon (hashcode
, t
);
4492 if (!COMPLETE_TYPE_P (t
))
4497 /* Build a function type. The RETURN_TYPE is the type returned by the
4498 function. If additional arguments are provided, they are
4499 additional argument types. The list of argument types must always
4500 be terminated by NULL_TREE. */
4503 build_function_type_list (tree return_type
, ...)
4508 va_start (p
, return_type
);
4510 t
= va_arg (p
, tree
);
4511 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
4512 args
= tree_cons (NULL_TREE
, t
, args
);
4515 args
= nreverse (args
);
4516 TREE_CHAIN (last
) = void_list_node
;
4517 args
= build_function_type (return_type
, args
);
4523 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4524 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4525 for the method. An implicit additional parameter (of type
4526 pointer-to-BASETYPE) is added to the ARGTYPES. */
4529 build_method_type_directly (tree basetype
,
4537 /* Make a node of the sort we want. */
4538 t
= make_node (METHOD_TYPE
);
4540 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4541 TREE_TYPE (t
) = rettype
;
4542 ptype
= build_pointer_type (basetype
);
4544 /* The actual arglist for this function includes a "hidden" argument
4545 which is "this". Put it into the list of argument types. */
4546 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
4547 TYPE_ARG_TYPES (t
) = argtypes
;
4549 /* If we already have such a type, use the old one. */
4550 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4551 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
4552 hashcode
= type_hash_list (argtypes
, hashcode
);
4553 t
= type_hash_canon (hashcode
, t
);
4555 if (!COMPLETE_TYPE_P (t
))
4561 /* Construct, lay out and return the type of methods belonging to class
4562 BASETYPE and whose arguments and values are described by TYPE.
4563 If that type exists already, reuse it.
4564 TYPE must be a FUNCTION_TYPE node. */
4567 build_method_type (tree basetype
, tree type
)
4569 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
4571 return build_method_type_directly (basetype
,
4573 TYPE_ARG_TYPES (type
));
4576 /* Construct, lay out and return the type of offsets to a value
4577 of type TYPE, within an object of type BASETYPE.
4578 If a suitable offset type exists already, reuse it. */
4581 build_offset_type (tree basetype
, tree type
)
4584 hashval_t hashcode
= 0;
4586 /* Make a node of the sort we want. */
4587 t
= make_node (OFFSET_TYPE
);
4589 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4590 TREE_TYPE (t
) = type
;
4592 /* If we already have such a type, use the old one. */
4593 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4594 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
4595 t
= type_hash_canon (hashcode
, t
);
4597 if (!COMPLETE_TYPE_P (t
))
4603 /* Create a complex type whose components are COMPONENT_TYPE. */
4606 build_complex_type (tree component_type
)
4611 /* Make a node of the sort we want. */
4612 t
= make_node (COMPLEX_TYPE
);
4614 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4616 /* If we already have such a type, use the old one. */
4617 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
4618 t
= type_hash_canon (hashcode
, t
);
4620 if (!COMPLETE_TYPE_P (t
))
4623 /* If we are writing Dwarf2 output we need to create a name,
4624 since complex is a fundamental type. */
4625 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4629 if (component_type
== char_type_node
)
4630 name
= "complex char";
4631 else if (component_type
== signed_char_type_node
)
4632 name
= "complex signed char";
4633 else if (component_type
== unsigned_char_type_node
)
4634 name
= "complex unsigned char";
4635 else if (component_type
== short_integer_type_node
)
4636 name
= "complex short int";
4637 else if (component_type
== short_unsigned_type_node
)
4638 name
= "complex short unsigned int";
4639 else if (component_type
== integer_type_node
)
4640 name
= "complex int";
4641 else if (component_type
== unsigned_type_node
)
4642 name
= "complex unsigned int";
4643 else if (component_type
== long_integer_type_node
)
4644 name
= "complex long int";
4645 else if (component_type
== long_unsigned_type_node
)
4646 name
= "complex long unsigned int";
4647 else if (component_type
== long_long_integer_type_node
)
4648 name
= "complex long long int";
4649 else if (component_type
== long_long_unsigned_type_node
)
4650 name
= "complex long long unsigned int";
4655 TYPE_NAME (t
) = get_identifier (name
);
4658 return build_qualified_type (t
, TYPE_QUALS (component_type
));
4661 /* Return OP, stripped of any conversions to wider types as much as is safe.
4662 Converting the value back to OP's type makes a value equivalent to OP.
4664 If FOR_TYPE is nonzero, we return a value which, if converted to
4665 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4667 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4668 narrowest type that can hold the value, even if they don't exactly fit.
4669 Otherwise, bit-field references are changed to a narrower type
4670 only if they can be fetched directly from memory in that type.
4672 OP must have integer, real or enumeral type. Pointers are not allowed!
4674 There are some cases where the obvious value we could return
4675 would regenerate to OP if converted to OP's type,
4676 but would not extend like OP to wider types.
4677 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4678 For example, if OP is (unsigned short)(signed char)-1,
4679 we avoid returning (signed char)-1 if FOR_TYPE is int,
4680 even though extending that to an unsigned short would regenerate OP,
4681 since the result of extending (signed char)-1 to (int)
4682 is different from (int) OP. */
4685 get_unwidened (tree op
, tree for_type
)
4687 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4688 tree type
= TREE_TYPE (op
);
4690 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4692 = (for_type
!= 0 && for_type
!= type
4693 && final_prec
> TYPE_PRECISION (type
)
4694 && TYPE_UNSIGNED (type
));
4697 while (TREE_CODE (op
) == NOP_EXPR
)
4700 = TYPE_PRECISION (TREE_TYPE (op
))
4701 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4703 /* Truncations are many-one so cannot be removed.
4704 Unless we are later going to truncate down even farther. */
4706 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4709 /* See what's inside this conversion. If we decide to strip it,
4711 op
= TREE_OPERAND (op
, 0);
4713 /* If we have not stripped any zero-extensions (uns is 0),
4714 we can strip any kind of extension.
4715 If we have previously stripped a zero-extension,
4716 only zero-extensions can safely be stripped.
4717 Any extension can be stripped if the bits it would produce
4718 are all going to be discarded later by truncating to FOR_TYPE. */
4722 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4724 /* TYPE_UNSIGNED says whether this is a zero-extension.
4725 Let's avoid computing it if it does not affect WIN
4726 and if UNS will not be needed again. */
4727 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4728 && TYPE_UNSIGNED (TREE_TYPE (op
)))
4736 if (TREE_CODE (op
) == COMPONENT_REF
4737 /* Since type_for_size always gives an integer type. */
4738 && TREE_CODE (type
) != REAL_TYPE
4739 /* Don't crash if field not laid out yet. */
4740 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4741 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4743 unsigned int innerprec
4744 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4745 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4746 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4747 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4749 /* We can get this structure field in the narrowest type it fits in.
4750 If FOR_TYPE is 0, do this only for a field that matches the
4751 narrower type exactly and is aligned for it
4752 The resulting extension to its nominal type (a fullword type)
4753 must fit the same conditions as for other extensions. */
4756 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
4757 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4758 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
4760 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4761 TREE_OPERAND (op
, 1), NULL_TREE
);
4762 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4763 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4770 /* Return OP or a simpler expression for a narrower value
4771 which can be sign-extended or zero-extended to give back OP.
4772 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4773 or 0 if the value should be sign-extended. */
4776 get_narrower (tree op
, int *unsignedp_ptr
)
4781 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
4783 while (TREE_CODE (op
) == NOP_EXPR
)
4786 = (TYPE_PRECISION (TREE_TYPE (op
))
4787 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4789 /* Truncations are many-one so cannot be removed. */
4793 /* See what's inside this conversion. If we decide to strip it,
4798 op
= TREE_OPERAND (op
, 0);
4799 /* An extension: the outermost one can be stripped,
4800 but remember whether it is zero or sign extension. */
4802 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4803 /* Otherwise, if a sign extension has been stripped,
4804 only sign extensions can now be stripped;
4805 if a zero extension has been stripped, only zero-extensions. */
4806 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
4810 else /* bitschange == 0 */
4812 /* A change in nominal type can always be stripped, but we must
4813 preserve the unsignedness. */
4815 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4817 op
= TREE_OPERAND (op
, 0);
4818 /* Keep trying to narrow, but don't assign op to win if it
4819 would turn an integral type into something else. */
4820 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
4827 if (TREE_CODE (op
) == COMPONENT_REF
4828 /* Since type_for_size always gives an integer type. */
4829 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4830 /* Ensure field is laid out already. */
4831 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4832 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4834 unsigned HOST_WIDE_INT innerprec
4835 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4836 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4837 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4838 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4840 /* We can get this structure field in a narrower type that fits it,
4841 but the resulting extension to its nominal type (a fullword type)
4842 must satisfy the same conditions as for other extensions.
4844 Do this only for fields that are aligned (not bit-fields),
4845 because when bit-field insns will be used there is no
4846 advantage in doing this. */
4848 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4849 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4850 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
4854 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
4855 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4856 TREE_OPERAND (op
, 1), NULL_TREE
);
4857 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4858 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4861 *unsignedp_ptr
= uns
;
4865 /* Nonzero if integer constant C has a value that is permissible
4866 for type TYPE (an INTEGER_TYPE). */
4869 int_fits_type_p (tree c
, tree type
)
4871 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4872 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4873 int ok_for_low_bound
, ok_for_high_bound
;
4875 /* Perform some generic filtering first, which may allow making a decision
4876 even if the bounds are not constant. First, negative integers never fit
4877 in unsigned types, */
4878 if ((TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4879 /* Also, unsigned integers with top bit set never fit signed types. */
4880 || (! TYPE_UNSIGNED (type
)
4881 && TYPE_UNSIGNED (TREE_TYPE (c
)) && tree_int_cst_msb (c
)))
4884 /* If at least one bound of the type is a constant integer, we can check
4885 ourselves and maybe make a decision. If no such decision is possible, but
4886 this type is a subtype, try checking against that. Otherwise, use
4887 force_fit_type, which checks against the precision.
4889 Compute the status for each possibly constant bound, and return if we see
4890 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4891 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4892 for "constant known to fit". */
4894 ok_for_low_bound
= -1;
4895 ok_for_high_bound
= -1;
4897 /* Check if C >= type_low_bound. */
4898 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4900 ok_for_low_bound
= ! tree_int_cst_lt (c
, type_low_bound
);
4901 if (! ok_for_low_bound
)
4905 /* Check if c <= type_high_bound. */
4906 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4908 ok_for_high_bound
= ! tree_int_cst_lt (type_high_bound
, c
);
4909 if (! ok_for_high_bound
)
4913 /* If the constant fits both bounds, the result is known. */
4914 if (ok_for_low_bound
== 1 && ok_for_high_bound
== 1)
4917 /* If we haven't been able to decide at this point, there nothing more we
4918 can check ourselves here. Look at the base type if we have one. */
4919 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4920 return int_fits_type_p (c
, TREE_TYPE (type
));
4922 /* Or to force_fit_type, if nothing else. */
4926 TREE_TYPE (c
) = type
;
4927 c
= force_fit_type (c
, -1, false, false);
4928 return !TREE_OVERFLOW (c
);
4932 /* Subprogram of following function. Called by walk_tree.
4934 Return *TP if it is an automatic variable or parameter of the
4935 function passed in as DATA. */
4938 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
4940 tree fn
= (tree
) data
;
4945 else if (DECL_P (*tp
)
4946 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
4952 /* Returns true if T is, contains, or refers to a type with variable
4953 size. If FN is nonzero, only return true if a modifier of the type
4954 or position of FN is a variable or parameter inside FN.
4956 This concept is more general than that of C99 'variably modified types':
4957 in C99, a struct type is never variably modified because a VLA may not
4958 appear as a structure member. However, in GNU C code like:
4960 struct S { int i[f()]; };
4962 is valid, and other languages may define similar constructs. */
4965 variably_modified_type_p (tree type
, tree fn
)
4969 /* Test if T is either variable (if FN is zero) or an expression containing
4970 a variable in FN. */
4971 #define RETURN_TRUE_IF_VAR(T) \
4972 do { tree _t = (T); \
4973 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4974 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4975 return true; } while (0)
4977 if (type
== error_mark_node
)
4980 /* If TYPE itself has variable size, it is variably modified.
4982 We do not yet have a representation of the C99 '[*]' syntax.
4983 When a representation is chosen, this function should be modified
4984 to test for that case as well. */
4985 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
4986 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type
));
4988 switch (TREE_CODE (type
))
4991 case REFERENCE_TYPE
:
4995 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5001 /* If TYPE is a function type, it is variably modified if any of the
5002 parameters or the return type are variably modified. */
5003 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5006 for (t
= TYPE_ARG_TYPES (type
);
5007 t
&& t
!= void_list_node
;
5009 if (variably_modified_type_p (TREE_VALUE (t
), fn
))
5018 /* Scalar types are variably modified if their end points
5020 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
5021 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
5026 case QUAL_UNION_TYPE
:
5027 /* We can't see if any of the field are variably-modified by the
5028 definition we normally use, since that would produce infinite
5029 recursion via pointers. */
5030 /* This is variably modified if some field's type is. */
5031 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5032 if (TREE_CODE (t
) == FIELD_DECL
)
5034 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
5035 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
5036 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
5038 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
5039 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
5047 /* The current language may have other cases to check, but in general,
5048 all other types are not variably modified. */
5049 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
5051 #undef RETURN_TRUE_IF_VAR
5054 /* Given a DECL or TYPE, return the scope in which it was declared, or
5055 NULL_TREE if there is no containing scope. */
5058 get_containing_scope (tree t
)
5060 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
5063 /* Return the innermost context enclosing DECL that is
5064 a FUNCTION_DECL, or zero if none. */
5067 decl_function_context (tree decl
)
5071 if (TREE_CODE (decl
) == ERROR_MARK
)
5074 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5075 where we look up the function at runtime. Such functions always take
5076 a first argument of type 'pointer to real context'.
5078 C++ should really be fixed to use DECL_CONTEXT for the real context,
5079 and use something else for the "virtual context". */
5080 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
5083 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
5085 context
= DECL_CONTEXT (decl
);
5087 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
5089 if (TREE_CODE (context
) == BLOCK
)
5090 context
= BLOCK_SUPERCONTEXT (context
);
5092 context
= get_containing_scope (context
);
5098 /* Return the innermost context enclosing DECL that is
5099 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5100 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5103 decl_type_context (tree decl
)
5105 tree context
= DECL_CONTEXT (decl
);
5108 switch (TREE_CODE (context
))
5110 case NAMESPACE_DECL
:
5111 case TRANSLATION_UNIT_DECL
:
5116 case QUAL_UNION_TYPE
:
5121 context
= DECL_CONTEXT (context
);
5125 context
= BLOCK_SUPERCONTEXT (context
);
5135 /* CALL is a CALL_EXPR. Return the declaration for the function
5136 called, or NULL_TREE if the called function cannot be
5140 get_callee_fndecl (tree call
)
5144 /* It's invalid to call this function with anything but a
5146 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5148 /* The first operand to the CALL is the address of the function
5150 addr
= TREE_OPERAND (call
, 0);
5154 /* If this is a readonly function pointer, extract its initial value. */
5155 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5156 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5157 && DECL_INITIAL (addr
))
5158 addr
= DECL_INITIAL (addr
);
5160 /* If the address is just `&f' for some function `f', then we know
5161 that `f' is being called. */
5162 if (TREE_CODE (addr
) == ADDR_EXPR
5163 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5164 return TREE_OPERAND (addr
, 0);
5166 /* We couldn't figure out what was being called. Maybe the front
5167 end has some idea. */
5168 return lang_hooks
.lang_get_callee_fndecl (call
);
5171 /* Print debugging information about tree nodes generated during the compile,
5172 and any language-specific information. */
5175 dump_tree_statistics (void)
5177 #ifdef GATHER_STATISTICS
5179 int total_nodes
, total_bytes
;
5182 fprintf (stderr
, "\n??? tree nodes created\n\n");
5183 #ifdef GATHER_STATISTICS
5184 fprintf (stderr
, "Kind Nodes Bytes\n");
5185 fprintf (stderr
, "---------------------------------------\n");
5186 total_nodes
= total_bytes
= 0;
5187 for (i
= 0; i
< (int) all_kinds
; i
++)
5189 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5190 tree_node_counts
[i
], tree_node_sizes
[i
]);
5191 total_nodes
+= tree_node_counts
[i
];
5192 total_bytes
+= tree_node_sizes
[i
];
5194 fprintf (stderr
, "---------------------------------------\n");
5195 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5196 fprintf (stderr
, "---------------------------------------\n");
5197 ssanames_print_statistics ();
5198 phinodes_print_statistics ();
5200 fprintf (stderr
, "(No per-node statistics)\n");
5202 print_type_hash_statistics ();
5203 lang_hooks
.print_statistics ();
5206 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5208 /* Generate a crc32 of a string. */
5211 crc32_string (unsigned chksum
, const char *string
)
5215 unsigned value
= *string
<< 24;
5218 for (ix
= 8; ix
--; value
<<= 1)
5222 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5231 /* P is a string that will be used in a symbol. Mask out any characters
5232 that are not valid in that context. */
5235 clean_symbol_name (char *p
)
5239 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5242 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5249 /* Generate a name for a function unique to this translation unit.
5250 TYPE is some string to identify the purpose of this function to the
5251 linker or collect2. */
5254 get_file_function_name_long (const char *type
)
5260 if (first_global_object_name
)
5261 p
= first_global_object_name
;
5264 /* We don't have anything that we know to be unique to this translation
5265 unit, so use what we do have and throw in some randomness. */
5267 const char *name
= weak_global_object_name
;
5268 const char *file
= main_input_filename
;
5273 file
= input_filename
;
5275 len
= strlen (file
);
5276 q
= alloca (9 * 2 + len
+ 1);
5277 memcpy (q
, file
, len
+ 1);
5278 clean_symbol_name (q
);
5280 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5281 crc32_string (0, flag_random_seed
));
5286 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5288 /* Set up the name of the file-level functions we may need.
5289 Use a global object (which is already required to be unique over
5290 the program) rather than the file name (which imposes extra
5292 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5294 return get_identifier (buf
);
5297 /* If KIND=='I', return a suitable global initializer (constructor) name.
5298 If KIND=='D', return a suitable global clean-up (destructor) name. */
5301 get_file_function_name (int kind
)
5308 return get_file_function_name_long (p
);
5311 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5312 The result is placed in BUFFER (which has length BIT_SIZE),
5313 with one bit in each char ('\000' or '\001').
5315 If the constructor is constant, NULL_TREE is returned.
5316 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5319 get_set_constructor_bits (tree init
, char *buffer
, int bit_size
)
5323 HOST_WIDE_INT domain_min
5324 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
5325 tree non_const_bits
= NULL_TREE
;
5327 for (i
= 0; i
< bit_size
; i
++)
5330 for (vals
= TREE_OPERAND (init
, 1);
5331 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
5333 if (!host_integerp (TREE_VALUE (vals
), 0)
5334 || (TREE_PURPOSE (vals
) != NULL_TREE
5335 && !host_integerp (TREE_PURPOSE (vals
), 0)))
5337 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
5338 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
5340 /* Set a range of bits to ones. */
5341 HOST_WIDE_INT lo_index
5342 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
5343 HOST_WIDE_INT hi_index
5344 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5346 gcc_assert (lo_index
>= 0);
5347 gcc_assert (lo_index
< bit_size
);
5348 gcc_assert (hi_index
>= 0);
5349 gcc_assert (hi_index
< bit_size
);
5350 for (; lo_index
<= hi_index
; lo_index
++)
5351 buffer
[lo_index
] = 1;
5355 /* Set a single bit to one. */
5357 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5358 if (index
< 0 || index
>= bit_size
)
5360 error ("invalid initializer for bit string");
5366 return non_const_bits
;
5369 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5370 The result is placed in BUFFER (which is an array of bytes).
5371 If the constructor is constant, NULL_TREE is returned.
5372 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5375 get_set_constructor_bytes (tree init
, unsigned char *buffer
, int wd_size
)
5378 int set_word_size
= BITS_PER_UNIT
;
5379 int bit_size
= wd_size
* set_word_size
;
5381 unsigned char *bytep
= buffer
;
5382 char *bit_buffer
= alloca (bit_size
);
5383 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5385 for (i
= 0; i
< wd_size
; i
++)
5388 for (i
= 0; i
< bit_size
; i
++)
5392 if (BYTES_BIG_ENDIAN
)
5393 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5395 *bytep
|= 1 << bit_pos
;
5398 if (bit_pos
>= set_word_size
)
5399 bit_pos
= 0, bytep
++;
5401 return non_const_bits
;
5404 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5406 /* Complain that the tree code of NODE does not match the expected 0
5407 terminated list of trailing codes. The trailing code list can be
5408 empty, for a more vague error message. FILE, LINE, and FUNCTION
5409 are of the caller. */
5412 tree_check_failed (const tree node
, const char *file
,
5413 int line
, const char *function
, ...)
5417 unsigned length
= 0;
5420 va_start (args
, function
);
5421 while ((code
= va_arg (args
, int)))
5422 length
+= 4 + strlen (tree_code_name
[code
]);
5426 va_start (args
, function
);
5427 length
+= strlen ("expected ");
5428 buffer
= alloca (length
);
5430 while ((code
= va_arg (args
, int)))
5432 const char *prefix
= length
? " or " : "expected ";
5434 strcpy (buffer
+ length
, prefix
);
5435 length
+= strlen (prefix
);
5436 strcpy (buffer
+ length
, tree_code_name
[code
]);
5437 length
+= strlen (tree_code_name
[code
]);
5442 buffer
= (char *)"unexpected node";
5444 internal_error ("tree check: %s, have %s in %s, at %s:%d",
5445 buffer
, tree_code_name
[TREE_CODE (node
)],
5446 function
, trim_filename (file
), line
);
5449 /* Complain that the tree code of NODE does match the expected 0
5450 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5454 tree_not_check_failed (const tree node
, const char *file
,
5455 int line
, const char *function
, ...)
5459 unsigned length
= 0;
5462 va_start (args
, function
);
5463 while ((code
= va_arg (args
, int)))
5464 length
+= 4 + strlen (tree_code_name
[code
]);
5466 va_start (args
, function
);
5467 buffer
= alloca (length
);
5469 while ((code
= va_arg (args
, int)))
5473 strcpy (buffer
+ length
, " or ");
5476 strcpy (buffer
+ length
, tree_code_name
[code
]);
5477 length
+= strlen (tree_code_name
[code
]);
5481 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5482 buffer
, tree_code_name
[TREE_CODE (node
)],
5483 function
, trim_filename (file
), line
);
5486 /* Similar to tree_check_failed, except that we check for a class of tree
5487 code, given in CL. */
5490 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
5491 const char *file
, int line
, const char *function
)
5494 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
5495 TREE_CODE_CLASS_STRING (cl
),
5496 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
5497 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
5500 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5501 (dynamically sized) vector. */
5504 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5505 const char *function
)
5508 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5509 idx
+ 1, len
, function
, trim_filename (file
), line
);
5512 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5513 (dynamically sized) vector. */
5516 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5517 const char *function
)
5520 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5521 idx
+ 1, len
, function
, trim_filename (file
), line
);
5524 /* Similar to above, except that the check is for the bounds of the operand
5525 vector of an expression node. */
5528 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
5529 int line
, const char *function
)
5532 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5533 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
5534 function
, trim_filename (file
), line
);
5536 #endif /* ENABLE_TREE_CHECKING */
5538 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5539 and mapped to the machine mode MODE. Initialize its fields and build
5540 the information necessary for debugging output. */
5543 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
5545 tree t
= make_node (VECTOR_TYPE
);
5547 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
5548 TYPE_VECTOR_SUBPARTS (t
) = nunits
;
5549 TYPE_MODE (t
) = mode
;
5550 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
5551 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
5556 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
5557 tree array
= build_array_type (innertype
, build_index_type (index
));
5558 tree rt
= make_node (RECORD_TYPE
);
5560 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5561 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5563 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
5564 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5565 the representation type, and we want to find that die when looking up
5566 the vector type. This is most easily achieved by making the TYPE_UID
5568 TYPE_UID (rt
) = TYPE_UID (t
);
5571 /* Build our main variant, based on the main variant of the inner type. */
5572 if (TYPE_MAIN_VARIANT (innertype
) != innertype
)
5574 tree innertype_main_variant
= TYPE_MAIN_VARIANT (innertype
);
5575 unsigned int hash
= TYPE_HASH (innertype_main_variant
);
5576 TYPE_MAIN_VARIANT (t
)
5577 = type_hash_canon (hash
, make_vector_type (innertype_main_variant
,
5585 make_or_reuse_type (unsigned size
, int unsignedp
)
5587 if (size
== INT_TYPE_SIZE
)
5588 return unsignedp
? unsigned_type_node
: integer_type_node
;
5589 if (size
== CHAR_TYPE_SIZE
)
5590 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5591 if (size
== SHORT_TYPE_SIZE
)
5592 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5593 if (size
== LONG_TYPE_SIZE
)
5594 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5595 if (size
== LONG_LONG_TYPE_SIZE
)
5596 return (unsignedp
? long_long_unsigned_type_node
5597 : long_long_integer_type_node
);
5600 return make_unsigned_type (size
);
5602 return make_signed_type (size
);
5605 /* Create nodes for all integer types (and error_mark_node) using the sizes
5606 of C datatypes. The caller should call set_sizetype soon after calling
5607 this function to select one of the types as sizetype. */
5610 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
5612 error_mark_node
= make_node (ERROR_MARK
);
5613 TREE_TYPE (error_mark_node
) = error_mark_node
;
5615 initialize_sizetypes (signed_sizetype
);
5617 /* Define both `signed char' and `unsigned char'. */
5618 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5619 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5621 /* Define `char', which is like either `signed char' or `unsigned char'
5622 but not the same as either. */
5625 ? make_signed_type (CHAR_TYPE_SIZE
)
5626 : make_unsigned_type (CHAR_TYPE_SIZE
));
5628 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5629 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5630 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5631 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5632 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5633 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5634 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5635 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5637 /* Define a boolean type. This type only represents boolean values but
5638 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5639 Front ends which want to override this size (i.e. Java) can redefine
5640 boolean_type_node before calling build_common_tree_nodes_2. */
5641 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5642 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5643 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5644 TYPE_PRECISION (boolean_type_node
) = 1;
5646 /* Fill in the rest of the sized types. Reuse existing type nodes
5648 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
5649 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
5650 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
5651 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
5652 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
5654 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
5655 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
5656 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
5657 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
5658 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
5660 access_public_node
= get_identifier ("public");
5661 access_protected_node
= get_identifier ("protected");
5662 access_private_node
= get_identifier ("private");
5665 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5666 It will create several other common tree nodes. */
5669 build_common_tree_nodes_2 (int short_double
)
5671 /* Define these next since types below may used them. */
5672 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
5673 integer_one_node
= build_int_cst (NULL_TREE
, 1);
5674 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
5676 size_zero_node
= size_int (0);
5677 size_one_node
= size_int (1);
5678 bitsize_zero_node
= bitsize_int (0);
5679 bitsize_one_node
= bitsize_int (1);
5680 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5682 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5683 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5685 void_type_node
= make_node (VOID_TYPE
);
5686 layout_type (void_type_node
);
5688 /* We are not going to have real types in C with less than byte alignment,
5689 so we might as well not have any types that claim to have it. */
5690 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5691 TYPE_USER_ALIGN (void_type_node
) = 0;
5693 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
5694 layout_type (TREE_TYPE (null_pointer_node
));
5696 ptr_type_node
= build_pointer_type (void_type_node
);
5698 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5699 fileptr_type_node
= ptr_type_node
;
5701 float_type_node
= make_node (REAL_TYPE
);
5702 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5703 layout_type (float_type_node
);
5705 double_type_node
= make_node (REAL_TYPE
);
5707 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5709 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5710 layout_type (double_type_node
);
5712 long_double_type_node
= make_node (REAL_TYPE
);
5713 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5714 layout_type (long_double_type_node
);
5716 float_ptr_type_node
= build_pointer_type (float_type_node
);
5717 double_ptr_type_node
= build_pointer_type (double_type_node
);
5718 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
5719 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
5721 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5722 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5723 layout_type (complex_integer_type_node
);
5725 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5726 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5727 layout_type (complex_float_type_node
);
5729 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5730 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5731 layout_type (complex_double_type_node
);
5733 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5734 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5735 layout_type (complex_long_double_type_node
);
5738 tree t
= targetm
.build_builtin_va_list ();
5740 /* Many back-ends define record types without setting TYPE_NAME.
5741 If we copied the record type here, we'd keep the original
5742 record type without a name. This breaks name mangling. So,
5743 don't copy record types and let c_common_nodes_and_builtins()
5744 declare the type to be __builtin_va_list. */
5745 if (TREE_CODE (t
) != RECORD_TYPE
)
5746 t
= build_variant_type_copy (t
);
5748 va_list_type_node
= t
;
5752 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5755 If we requested a pointer to a vector, build up the pointers that
5756 we stripped off while looking for the inner type. Similarly for
5757 return values from functions.
5759 The argument TYPE is the top of the chain, and BOTTOM is the
5760 new type which we will point to. */
5763 reconstruct_complex_type (tree type
, tree bottom
)
5767 if (POINTER_TYPE_P (type
))
5769 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5770 outer
= build_pointer_type (inner
);
5772 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5774 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5775 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
5777 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5779 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5780 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
5782 else if (TREE_CODE (type
) == METHOD_TYPE
)
5785 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5786 /* The build_method_type_directly() routine prepends 'this' to argument list,
5787 so we must compensate by getting rid of it. */
5788 argtypes
= TYPE_ARG_TYPES (type
);
5789 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
5791 TYPE_ARG_TYPES (type
));
5792 TYPE_ARG_TYPES (outer
) = argtypes
;
5797 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
5798 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
5803 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5806 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
5810 switch (GET_MODE_CLASS (mode
))
5812 case MODE_VECTOR_INT
:
5813 case MODE_VECTOR_FLOAT
:
5814 nunits
= GET_MODE_NUNITS (mode
);
5818 /* Check that there are no leftover bits. */
5819 gcc_assert (GET_MODE_BITSIZE (mode
)
5820 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
5822 nunits
= GET_MODE_BITSIZE (mode
)
5823 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
5830 return make_vector_type (innertype
, nunits
, mode
);
5833 /* Similarly, but takes the inner type and number of units, which must be
5837 build_vector_type (tree innertype
, int nunits
)
5839 return make_vector_type (innertype
, nunits
, VOIDmode
);
5842 /* Given an initializer INIT, return TRUE if INIT is zero or some
5843 aggregate of zeros. Otherwise return FALSE. */
5845 initializer_zerop (tree init
)
5851 switch (TREE_CODE (init
))
5854 return integer_zerop (init
);
5857 /* ??? Note that this is not correct for C4X float formats. There,
5858 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5859 negative exponent. */
5860 return real_zerop (init
)
5861 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
5864 return integer_zerop (init
)
5865 || (real_zerop (init
)
5866 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
5867 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
5870 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
5871 if (!initializer_zerop (TREE_VALUE (elt
)))
5876 elt
= CONSTRUCTOR_ELTS (init
);
5877 if (elt
== NULL_TREE
)
5880 /* A set is empty only if it has no elements. */
5881 if (TREE_CODE (TREE_TYPE (init
)) == SET_TYPE
)
5884 for (; elt
; elt
= TREE_CHAIN (elt
))
5885 if (! initializer_zerop (TREE_VALUE (elt
)))
5895 add_var_to_bind_expr (tree bind_expr
, tree var
)
5897 BIND_EXPR_VARS (bind_expr
)
5898 = chainon (BIND_EXPR_VARS (bind_expr
), var
);
5899 if (BIND_EXPR_BLOCK (bind_expr
))
5900 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr
))
5901 = BIND_EXPR_VARS (bind_expr
);
5904 /* Build an empty statement. */
5907 build_empty_stmt (void)
5909 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
5913 /* Returns true if it is possible to prove that the index of
5914 an array access REF (an ARRAY_REF expression) falls into the
5918 in_array_bounds_p (tree ref
)
5920 tree idx
= TREE_OPERAND (ref
, 1);
5923 if (TREE_CODE (idx
) != INTEGER_CST
)
5926 min
= array_ref_low_bound (ref
);
5927 max
= array_ref_up_bound (ref
);
5930 || TREE_CODE (min
) != INTEGER_CST
5931 || TREE_CODE (max
) != INTEGER_CST
)
5934 if (tree_int_cst_lt (idx
, min
)
5935 || tree_int_cst_lt (max
, idx
))
5941 /* Return true if T (assumed to be a DECL) is a global variable. */
5944 is_global_var (tree t
)
5946 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5949 /* Return true if T (assumed to be a DECL) must be assigned a memory
5953 needs_to_live_in_memory (tree t
)
5955 return (TREE_ADDRESSABLE (t
)
5956 || is_global_var (t
)
5957 || (TREE_CODE (t
) == RESULT_DECL
5958 && aggregate_value_p (t
, current_function_decl
)));
5961 /* There are situations in which a language considers record types
5962 compatible which have different field lists. Decide if two fields
5963 are compatible. It is assumed that the parent records are compatible. */
5966 fields_compatible_p (tree f1
, tree f2
)
5968 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
5969 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
5972 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
5973 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
5976 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
5982 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
5985 find_compatible_field (tree record
, tree orig_field
)
5989 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
5990 if (TREE_CODE (f
) == FIELD_DECL
5991 && fields_compatible_p (f
, orig_field
))
5994 /* ??? Why isn't this on the main fields list? */
5995 f
= TYPE_VFIELD (record
);
5996 if (f
&& TREE_CODE (f
) == FIELD_DECL
5997 && fields_compatible_p (f
, orig_field
))
6000 /* ??? We should abort here, but Java appears to do Bad Things
6001 with inherited fields. */
6005 /* Return value of a constant X. */
6008 int_cst_value (tree x
)
6010 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
6011 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
6012 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
6014 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
6017 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
6019 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
6024 /* Returns the greatest common divisor of A and B, which must be
6028 tree_fold_gcd (tree a
, tree b
)
6031 tree type
= TREE_TYPE (a
);
6033 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
6034 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
6036 if (integer_zerop (a
))
6039 if (integer_zerop (b
))
6042 if (tree_int_cst_sgn (a
) == -1)
6043 a
= fold (build2 (MULT_EXPR
, type
, a
,
6044 convert (type
, integer_minus_one_node
)));
6046 if (tree_int_cst_sgn (b
) == -1)
6047 b
= fold (build2 (MULT_EXPR
, type
, b
,
6048 convert (type
, integer_minus_one_node
)));
6052 a_mod_b
= fold (build2 (FLOOR_MOD_EXPR
, type
, a
, b
));
6054 if (!TREE_INT_CST_LOW (a_mod_b
)
6055 && !TREE_INT_CST_HIGH (a_mod_b
))
6063 /* Returns unsigned variant of TYPE. */
6066 unsigned_type_for (tree type
)
6068 return lang_hooks
.types
.unsigned_type (type
);
6071 /* Returns signed variant of TYPE. */
6074 signed_type_for (tree type
)
6076 return lang_hooks
.types
.signed_type (type
);
6079 /* Returns the largest value obtainable by casting something in INNER type to
6083 upper_bound_in_type (tree outer
, tree inner
)
6085 unsigned HOST_WIDE_INT lo
, hi
;
6086 unsigned bits
= TYPE_PRECISION (inner
);
6088 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6090 /* Zero extending in these cases. */
6091 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6094 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6095 >> (HOST_BITS_PER_WIDE_INT
- bits
);
6099 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6100 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
);
6101 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6106 /* Sign extending in these cases. */
6107 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6110 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6111 >> (HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6115 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6116 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6117 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6121 return fold_convert (outer
,
6122 build_int_cst_wide (inner
, lo
, hi
));
6125 /* Returns the smallest value obtainable by casting something in INNER type to
6129 lower_bound_in_type (tree outer
, tree inner
)
6131 unsigned HOST_WIDE_INT lo
, hi
;
6132 unsigned bits
= TYPE_PRECISION (inner
);
6134 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6136 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
6138 hi
= ~(unsigned HOST_WIDE_INT
) 0;
6139 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1);
6143 hi
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- HOST_BITS_PER_WIDE_INT
- 1);
6147 return fold_convert (outer
,
6148 build_int_cst_wide (inner
, lo
, hi
));
6151 #include "gt-tree.h"