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
2425 /* Addresses of thread-local variables are invariant. */
2426 || (TREE_CODE (node
) == VAR_DECL
&& DECL_THREAD_LOCAL (node
)))
2431 else if (CONSTANT_CLASS_P (node
))
2436 se
|= TREE_SIDE_EFFECTS (node
);
2439 TREE_CONSTANT (t
) = tc
;
2440 TREE_INVARIANT (t
) = ti
;
2441 TREE_SIDE_EFFECTS (t
) = se
;
2442 #undef UPDATE_TITCSE
2445 /* Build an expression of code CODE, data type TYPE, and operands as
2446 specified. Expressions and reference nodes can be created this way.
2447 Constants, decls, types and misc nodes cannot be.
2449 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2450 enough for all extant tree codes. These functions can be called
2451 directly (preferably!), but can also be obtained via GCC preprocessor
2452 magic within the build macro. */
2455 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2459 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2461 t
= make_node_stat (code PASS_MEM_STAT
);
2468 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2470 int length
= sizeof (struct tree_exp
);
2471 #ifdef GATHER_STATISTICS
2472 tree_node_kind kind
;
2476 #ifdef GATHER_STATISTICS
2477 switch (TREE_CODE_CLASS (code
))
2479 case tcc_statement
: /* an expression with side effects */
2482 case tcc_reference
: /* a reference */
2490 tree_node_counts
[(int) kind
]++;
2491 tree_node_sizes
[(int) kind
] += length
;
2494 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2496 t
= ggc_alloc_zone_stat (length
, tree_zone PASS_MEM_STAT
);
2498 memset (t
, 0, sizeof (struct tree_common
));
2500 TREE_SET_CODE (t
, code
);
2502 TREE_TYPE (t
) = type
;
2503 #ifdef USE_MAPPED_LOCATION
2504 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2506 SET_EXPR_LOCUS (t
, NULL
);
2508 TREE_COMPLEXITY (t
) = 0;
2509 TREE_OPERAND (t
, 0) = node
;
2510 TREE_BLOCK (t
) = NULL_TREE
;
2511 if (node
&& !TYPE_P (node
) && first_rtl_op (code
) != 0)
2513 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2514 TREE_READONLY (t
) = TREE_READONLY (node
);
2517 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2518 TREE_SIDE_EFFECTS (t
) = 1;
2524 case PREDECREMENT_EXPR
:
2525 case PREINCREMENT_EXPR
:
2526 case POSTDECREMENT_EXPR
:
2527 case POSTINCREMENT_EXPR
:
2528 /* All of these have side-effects, no matter what their
2530 TREE_SIDE_EFFECTS (t
) = 1;
2531 TREE_READONLY (t
) = 0;
2534 case MISALIGNED_INDIRECT_REF
:
2535 case ALIGN_INDIRECT_REF
:
2537 /* Whether a dereference is readonly has nothing to do with whether
2538 its operand is readonly. */
2539 TREE_READONLY (t
) = 0;
2544 recompute_tree_invarant_for_addr_expr (t
);
2548 if (TREE_CODE_CLASS (code
) == tcc_unary
2549 && node
&& !TYPE_P (node
)
2550 && TREE_CONSTANT (node
))
2551 TREE_CONSTANT (t
) = 1;
2552 if (TREE_CODE_CLASS (code
) == tcc_unary
2553 && node
&& TREE_INVARIANT (node
))
2554 TREE_INVARIANT (t
) = 1;
2555 if (TREE_CODE_CLASS (code
) == tcc_reference
2556 && node
&& TREE_THIS_VOLATILE (node
))
2557 TREE_THIS_VOLATILE (t
) = 1;
2564 #define PROCESS_ARG(N) \
2566 TREE_OPERAND (t, N) = arg##N; \
2567 if (arg##N &&!TYPE_P (arg##N) && fro > N) \
2569 if (TREE_SIDE_EFFECTS (arg##N)) \
2571 if (!TREE_READONLY (arg##N)) \
2573 if (!TREE_CONSTANT (arg##N)) \
2575 if (!TREE_INVARIANT (arg##N)) \
2581 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2583 bool constant
, read_only
, side_effects
, invariant
;
2587 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
2589 t
= make_node_stat (code PASS_MEM_STAT
);
2592 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2593 result based on those same flags for the arguments. But if the
2594 arguments aren't really even `tree' expressions, we shouldn't be trying
2596 fro
= first_rtl_op (code
);
2598 /* Expressions without side effects may be constant if their
2599 arguments are as well. */
2600 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
2601 || TREE_CODE_CLASS (code
) == tcc_binary
);
2603 side_effects
= TREE_SIDE_EFFECTS (t
);
2604 invariant
= constant
;
2609 TREE_READONLY (t
) = read_only
;
2610 TREE_CONSTANT (t
) = constant
;
2611 TREE_INVARIANT (t
) = invariant
;
2612 TREE_SIDE_EFFECTS (t
) = side_effects
;
2613 TREE_THIS_VOLATILE (t
)
2614 = (TREE_CODE_CLASS (code
) == tcc_reference
2615 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2621 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2622 tree arg2 MEM_STAT_DECL
)
2624 bool constant
, read_only
, side_effects
, invariant
;
2628 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
2630 t
= make_node_stat (code PASS_MEM_STAT
);
2633 fro
= first_rtl_op (code
);
2635 side_effects
= TREE_SIDE_EFFECTS (t
);
2641 if (code
== CALL_EXPR
&& !side_effects
)
2646 /* Calls have side-effects, except those to const or
2648 i
= call_expr_flags (t
);
2649 if (!(i
& (ECF_CONST
| ECF_PURE
)))
2652 /* And even those have side-effects if their arguments do. */
2653 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
2654 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
2661 TREE_SIDE_EFFECTS (t
) = side_effects
;
2662 TREE_THIS_VOLATILE (t
)
2663 = (TREE_CODE_CLASS (code
) == tcc_reference
2664 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2670 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2671 tree arg2
, tree arg3 MEM_STAT_DECL
)
2673 bool constant
, read_only
, side_effects
, invariant
;
2677 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
2679 t
= make_node_stat (code PASS_MEM_STAT
);
2682 fro
= first_rtl_op (code
);
2684 side_effects
= TREE_SIDE_EFFECTS (t
);
2691 TREE_SIDE_EFFECTS (t
) = side_effects
;
2692 TREE_THIS_VOLATILE (t
)
2693 = (TREE_CODE_CLASS (code
) == tcc_reference
2694 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2699 /* Backup definition for non-gcc build compilers. */
2702 (build
) (enum tree_code code
, tree tt
, ...)
2704 tree t
, arg0
, arg1
, arg2
, arg3
;
2705 int length
= TREE_CODE_LENGTH (code
);
2712 t
= build0 (code
, tt
);
2715 arg0
= va_arg (p
, tree
);
2716 t
= build1 (code
, tt
, arg0
);
2719 arg0
= va_arg (p
, tree
);
2720 arg1
= va_arg (p
, tree
);
2721 t
= build2 (code
, tt
, arg0
, arg1
);
2724 arg0
= va_arg (p
, tree
);
2725 arg1
= va_arg (p
, tree
);
2726 arg2
= va_arg (p
, tree
);
2727 t
= build3 (code
, tt
, arg0
, arg1
, arg2
);
2730 arg0
= va_arg (p
, tree
);
2731 arg1
= va_arg (p
, tree
);
2732 arg2
= va_arg (p
, tree
);
2733 arg3
= va_arg (p
, tree
);
2734 t
= build4 (code
, tt
, arg0
, arg1
, arg2
, arg3
);
2744 /* Similar except don't specify the TREE_TYPE
2745 and leave the TREE_SIDE_EFFECTS as 0.
2746 It is permissible for arguments to be null,
2747 or even garbage if their values do not matter. */
2750 build_nt (enum tree_code code
, ...)
2759 t
= make_node (code
);
2760 length
= TREE_CODE_LENGTH (code
);
2762 for (i
= 0; i
< length
; i
++)
2763 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2769 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2770 We do NOT enter this node in any sort of symbol table.
2772 layout_decl is used to set up the decl's storage layout.
2773 Other slots are initialized to 0 or null pointers. */
2776 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
2780 t
= make_node_stat (code PASS_MEM_STAT
);
2782 /* if (type == error_mark_node)
2783 type = integer_type_node; */
2784 /* That is not done, deliberately, so that having error_mark_node
2785 as the type can suppress useless errors in the use of this variable. */
2787 DECL_NAME (t
) = name
;
2788 TREE_TYPE (t
) = type
;
2790 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2792 else if (code
== FUNCTION_DECL
)
2793 DECL_MODE (t
) = FUNCTION_MODE
;
2795 /* Set default visibility to whatever the user supplied with
2796 visibility_specified depending on #pragma GCC visibility. */
2797 DECL_VISIBILITY (t
) = default_visibility
;
2798 DECL_VISIBILITY_SPECIFIED (t
) = visibility_options
.inpragma
;
2803 /* BLOCK nodes are used to represent the structure of binding contours
2804 and declarations, once those contours have been exited and their contents
2805 compiled. This information is used for outputting debugging info. */
2808 build_block (tree vars
, tree tags ATTRIBUTE_UNUSED
, tree subblocks
,
2809 tree supercontext
, tree chain
)
2811 tree block
= make_node (BLOCK
);
2813 BLOCK_VARS (block
) = vars
;
2814 BLOCK_SUBBLOCKS (block
) = subblocks
;
2815 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2816 BLOCK_CHAIN (block
) = chain
;
2820 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2821 /* ??? gengtype doesn't handle conditionals */
2822 static GTY(()) tree last_annotated_node
;
2825 #ifdef USE_MAPPED_LOCATION
2828 expand_location (source_location loc
)
2830 expanded_location xloc
;
2831 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
2834 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
2835 xloc
.file
= map
->to_file
;
2836 xloc
.line
= SOURCE_LINE (map
, loc
);
2837 xloc
.column
= SOURCE_COLUMN (map
, loc
);
2844 /* Record the exact location where an expression or an identifier were
2848 annotate_with_file_line (tree node
, const char *file
, int line
)
2850 /* Roughly one percent of the calls to this function are to annotate
2851 a node with the same information already attached to that node!
2852 Just return instead of wasting memory. */
2853 if (EXPR_LOCUS (node
)
2854 && (EXPR_FILENAME (node
) == file
2855 || ! strcmp (EXPR_FILENAME (node
), file
))
2856 && EXPR_LINENO (node
) == line
)
2858 last_annotated_node
= node
;
2862 /* In heavily macroized code (such as GCC itself) this single
2863 entry cache can reduce the number of allocations by more
2865 if (last_annotated_node
2866 && EXPR_LOCUS (last_annotated_node
)
2867 && (EXPR_FILENAME (last_annotated_node
) == file
2868 || ! strcmp (EXPR_FILENAME (last_annotated_node
), file
))
2869 && EXPR_LINENO (last_annotated_node
) == line
)
2871 SET_EXPR_LOCUS (node
, EXPR_LOCUS (last_annotated_node
));
2875 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
2876 EXPR_LINENO (node
) = line
;
2877 EXPR_FILENAME (node
) = file
;
2878 last_annotated_node
= node
;
2882 annotate_with_locus (tree node
, location_t locus
)
2884 annotate_with_file_line (node
, locus
.file
, locus
.line
);
2888 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2892 build_decl_attribute_variant (tree ddecl
, tree attribute
)
2894 DECL_ATTRIBUTES (ddecl
) = attribute
;
2898 /* Borrowed from hashtab.c iterative_hash implementation. */
2899 #define mix(a,b,c) \
2901 a -= b; a -= c; a ^= (c>>13); \
2902 b -= c; b -= a; b ^= (a<< 8); \
2903 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2904 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2905 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2906 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2907 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2908 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2909 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2913 /* Produce good hash value combining VAL and VAL2. */
2914 static inline hashval_t
2915 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
2917 /* the golden ratio; an arbitrary value. */
2918 hashval_t a
= 0x9e3779b9;
2924 /* Produce good hash value combining PTR and VAL2. */
2925 static inline hashval_t
2926 iterative_hash_pointer (void *ptr
, hashval_t val2
)
2928 if (sizeof (ptr
) == sizeof (hashval_t
))
2929 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
2932 hashval_t a
= (hashval_t
) (size_t) ptr
;
2933 /* Avoid warnings about shifting of more than the width of the type on
2934 hosts that won't execute this path. */
2936 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
2942 /* Produce good hash value combining VAL and VAL2. */
2943 static inline hashval_t
2944 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
2946 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
2947 return iterative_hash_hashval_t (val
, val2
);
2950 hashval_t a
= (hashval_t
) val
;
2951 /* Avoid warnings about shifting of more than the width of the type on
2952 hosts that won't execute this path. */
2954 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
2956 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
2958 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
2959 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
2966 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2969 Record such modified types already made so we don't make duplicates. */
2972 build_type_attribute_variant (tree ttype
, tree attribute
)
2974 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2976 hashval_t hashcode
= 0;
2978 enum tree_code code
= TREE_CODE (ttype
);
2980 ntype
= copy_node (ttype
);
2982 TYPE_POINTER_TO (ntype
) = 0;
2983 TYPE_REFERENCE_TO (ntype
) = 0;
2984 TYPE_ATTRIBUTES (ntype
) = attribute
;
2986 /* Create a new main variant of TYPE. */
2987 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2988 TYPE_NEXT_VARIANT (ntype
) = 0;
2989 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2991 hashcode
= iterative_hash_object (code
, hashcode
);
2992 if (TREE_TYPE (ntype
))
2993 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
2995 hashcode
= attribute_hash_list (attribute
, hashcode
);
2997 switch (TREE_CODE (ntype
))
3000 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3003 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3007 hashcode
= iterative_hash_object
3008 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3009 hashcode
= iterative_hash_object
3010 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3014 unsigned int precision
= TYPE_PRECISION (ntype
);
3015 hashcode
= iterative_hash_object (precision
, hashcode
);
3022 ntype
= type_hash_canon (hashcode
, ntype
);
3023 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3030 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3033 We try both `text' and `__text__', ATTR may be either one. */
3034 /* ??? It might be a reasonable simplification to require ATTR to be only
3035 `text'. One might then also require attribute lists to be stored in
3036 their canonicalized form. */
3039 is_attribute_with_length_p (const char *attr
, int attr_len
, tree ident
)
3044 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3047 p
= IDENTIFIER_POINTER (ident
);
3048 ident_len
= IDENTIFIER_LENGTH (ident
);
3050 if (ident_len
== attr_len
3051 && strcmp (attr
, p
) == 0)
3054 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3057 gcc_assert (attr
[1] == '_');
3058 gcc_assert (attr
[attr_len
- 2] == '_');
3059 gcc_assert (attr
[attr_len
- 1] == '_');
3060 gcc_assert (attr
[1] == '_');
3061 if (ident_len
== attr_len
- 4
3062 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3067 if (ident_len
== attr_len
+ 4
3068 && p
[0] == '_' && p
[1] == '_'
3069 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3070 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3077 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3080 We try both `text' and `__text__', ATTR may be either one. */
3083 is_attribute_p (const char *attr
, tree ident
)
3085 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3088 /* Given an attribute name and a list of attributes, return a pointer to the
3089 attribute's list element if the attribute is part of the list, or NULL_TREE
3090 if not found. If the attribute appears more than once, this only
3091 returns the first occurrence; the TREE_CHAIN of the return value should
3092 be passed back in if further occurrences are wanted. */
3095 lookup_attribute (const char *attr_name
, tree list
)
3098 size_t attr_len
= strlen (attr_name
);
3100 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3102 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3103 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3110 /* Return an attribute list that is the union of a1 and a2. */
3113 merge_attributes (tree a1
, tree a2
)
3117 /* Either one unset? Take the set one. */
3119 if ((attributes
= a1
) == 0)
3122 /* One that completely contains the other? Take it. */
3124 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3126 if (attribute_list_contained (a2
, a1
))
3130 /* Pick the longest list, and hang on the other list. */
3132 if (list_length (a1
) < list_length (a2
))
3133 attributes
= a2
, a2
= a1
;
3135 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3138 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3141 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3144 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
3149 a1
= copy_node (a2
);
3150 TREE_CHAIN (a1
) = attributes
;
3159 /* Given types T1 and T2, merge their attributes and return
3163 merge_type_attributes (tree t1
, tree t2
)
3165 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3166 TYPE_ATTRIBUTES (t2
));
3169 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3173 merge_decl_attributes (tree olddecl
, tree newdecl
)
3175 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3176 DECL_ATTRIBUTES (newdecl
));
3179 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3181 /* Specialization of merge_decl_attributes for various Windows targets.
3183 This handles the following situation:
3185 __declspec (dllimport) int foo;
3188 The second instance of `foo' nullifies the dllimport. */
3191 merge_dllimport_decl_attributes (tree old
, tree
new)
3194 int delete_dllimport_p
;
3196 old
= DECL_ATTRIBUTES (old
);
3197 new = DECL_ATTRIBUTES (new);
3199 /* What we need to do here is remove from `old' dllimport if it doesn't
3200 appear in `new'. dllimport behaves like extern: if a declaration is
3201 marked dllimport and a definition appears later, then the object
3202 is not dllimport'd. */
3203 if (lookup_attribute ("dllimport", old
) != NULL_TREE
3204 && lookup_attribute ("dllimport", new) == NULL_TREE
)
3205 delete_dllimport_p
= 1;
3207 delete_dllimport_p
= 0;
3209 a
= merge_attributes (old
, new);
3211 if (delete_dllimport_p
)
3215 /* Scan the list for dllimport and delete it. */
3216 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3218 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3220 if (prev
== NULL_TREE
)
3223 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3232 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3233 struct attribute_spec.handler. */
3236 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3241 /* These attributes may apply to structure and union types being created,
3242 but otherwise should pass to the declaration involved. */
3245 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3246 | (int) ATTR_FLAG_ARRAY_NEXT
))
3248 *no_add_attrs
= true;
3249 return tree_cons (name
, args
, NULL_TREE
);
3251 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3253 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name
));
3254 *no_add_attrs
= true;
3260 /* Report error on dllimport ambiguities seen now before they cause
3262 if (is_attribute_p ("dllimport", name
))
3264 /* Like MS, treat definition of dllimported variables and
3265 non-inlined functions on declaration as syntax errors. We
3266 allow the attribute for function definitions if declared
3268 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
)
3269 && !DECL_DECLARED_INLINE_P (node
))
3271 error ("%Jfunction %qD definition is marked dllimport.", node
, node
);
3272 *no_add_attrs
= true;
3275 else if (TREE_CODE (node
) == VAR_DECL
)
3277 if (DECL_INITIAL (node
))
3279 error ("%Jvariable %qD definition is marked dllimport.",
3281 *no_add_attrs
= true;
3284 /* `extern' needn't be specified with dllimport.
3285 Specify `extern' now and hope for the best. Sigh. */
3286 DECL_EXTERNAL (node
) = 1;
3287 /* Also, implicitly give dllimport'd variables declared within
3288 a function global scope, unless declared static. */
3289 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3290 TREE_PUBLIC (node
) = 1;
3294 /* Report error if symbol is not accessible at global scope. */
3295 if (!TREE_PUBLIC (node
)
3296 && (TREE_CODE (node
) == VAR_DECL
3297 || TREE_CODE (node
) == FUNCTION_DECL
))
3299 error ("%Jexternal linkage required for symbol %qD because of "
3300 "%qs attribute.", node
, node
, IDENTIFIER_POINTER (name
));
3301 *no_add_attrs
= true;
3307 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3309 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3310 of the various TYPE_QUAL values. */
3313 set_type_quals (tree type
, int type_quals
)
3315 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3316 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3317 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3320 /* Returns true iff cand is equivalent to base with type_quals. */
3323 check_qualified_type (tree cand
, tree base
, int type_quals
)
3325 return (TYPE_QUALS (cand
) == type_quals
3326 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3327 /* Apparently this is needed for Objective-C. */
3328 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3329 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3330 TYPE_ATTRIBUTES (base
)));
3333 /* Return a version of the TYPE, qualified as indicated by the
3334 TYPE_QUALS, if one exists. If no qualified version exists yet,
3335 return NULL_TREE. */
3338 get_qualified_type (tree type
, int type_quals
)
3342 if (TYPE_QUALS (type
) == type_quals
)
3345 /* Search the chain of variants to see if there is already one there just
3346 like the one we need to have. If so, use that existing one. We must
3347 preserve the TYPE_NAME, since there is code that depends on this. */
3348 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3349 if (check_qualified_type (t
, type
, type_quals
))
3355 /* Like get_qualified_type, but creates the type if it does not
3356 exist. This function never returns NULL_TREE. */
3359 build_qualified_type (tree type
, int type_quals
)
3363 /* See if we already have the appropriate qualified variant. */
3364 t
= get_qualified_type (type
, type_quals
);
3366 /* If not, build it. */
3369 t
= build_variant_type_copy (type
);
3370 set_type_quals (t
, type_quals
);
3376 /* Create a new distinct copy of TYPE. The new type is made its own
3380 build_distinct_type_copy (tree type
)
3382 tree t
= copy_node (type
);
3384 TYPE_POINTER_TO (t
) = 0;
3385 TYPE_REFERENCE_TO (t
) = 0;
3387 /* Make it its own variant. */
3388 TYPE_MAIN_VARIANT (t
) = t
;
3389 TYPE_NEXT_VARIANT (t
) = 0;
3394 /* Create a new variant of TYPE, equivalent but distinct.
3395 This is so the caller can modify it. */
3398 build_variant_type_copy (tree type
)
3400 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3402 t
= build_distinct_type_copy (type
);
3404 /* Add the new type to the chain of variants of TYPE. */
3405 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3406 TYPE_NEXT_VARIANT (m
) = t
;
3407 TYPE_MAIN_VARIANT (t
) = m
;
3412 /* Hashing of types so that we don't make duplicates.
3413 The entry point is `type_hash_canon'. */
3415 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3416 with types in the TREE_VALUE slots), by adding the hash codes
3417 of the individual types. */
3420 type_hash_list (tree list
, hashval_t hashcode
)
3424 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3425 if (TREE_VALUE (tail
) != error_mark_node
)
3426 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
3432 /* These are the Hashtable callback functions. */
3434 /* Returns true iff the types are equivalent. */
3437 type_hash_eq (const void *va
, const void *vb
)
3439 const struct type_hash
*a
= va
, *b
= vb
;
3441 /* First test the things that are the same for all types. */
3442 if (a
->hash
!= b
->hash
3443 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
3444 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
3445 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3446 TYPE_ATTRIBUTES (b
->type
))
3447 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
3448 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
3451 switch (TREE_CODE (a
->type
))
3456 case REFERENCE_TYPE
:
3460 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
3463 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
3464 && !(TYPE_VALUES (a
->type
)
3465 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
3466 && TYPE_VALUES (b
->type
)
3467 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
3468 && type_list_equal (TYPE_VALUES (a
->type
),
3469 TYPE_VALUES (b
->type
))))
3472 /* ... fall through ... */
3478 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3479 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3480 TYPE_MAX_VALUE (b
->type
)))
3481 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3482 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3483 TYPE_MIN_VALUE (b
->type
))));
3486 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
3489 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
3490 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3491 || (TYPE_ARG_TYPES (a
->type
)
3492 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3493 && TYPE_ARG_TYPES (b
->type
)
3494 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3495 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3496 TYPE_ARG_TYPES (b
->type
)))));
3500 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
3504 case QUAL_UNION_TYPE
:
3505 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
3506 || (TYPE_FIELDS (a
->type
)
3507 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
3508 && TYPE_FIELDS (b
->type
)
3509 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
3510 && type_list_equal (TYPE_FIELDS (a
->type
),
3511 TYPE_FIELDS (b
->type
))));
3514 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3515 || (TYPE_ARG_TYPES (a
->type
)
3516 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3517 && TYPE_ARG_TYPES (b
->type
)
3518 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3519 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3520 TYPE_ARG_TYPES (b
->type
))));
3527 /* Return the cached hash value. */
3530 type_hash_hash (const void *item
)
3532 return ((const struct type_hash
*) item
)->hash
;
3535 /* Look in the type hash table for a type isomorphic to TYPE.
3536 If one is found, return it. Otherwise return 0. */
3539 type_hash_lookup (hashval_t hashcode
, tree type
)
3541 struct type_hash
*h
, in
;
3543 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3544 must call that routine before comparing TYPE_ALIGNs. */
3550 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3556 /* Add an entry to the type-hash-table
3557 for a type TYPE whose hash code is HASHCODE. */
3560 type_hash_add (hashval_t hashcode
, tree type
)
3562 struct type_hash
*h
;
3565 h
= ggc_alloc (sizeof (struct type_hash
));
3568 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3569 *(struct type_hash
**) loc
= h
;
3572 /* Given TYPE, and HASHCODE its hash code, return the canonical
3573 object for an identical type if one already exists.
3574 Otherwise, return TYPE, and record it as the canonical object.
3576 To use this function, first create a type of the sort you want.
3577 Then compute its hash code from the fields of the type that
3578 make it different from other similar types.
3579 Then call this function and use the value. */
3582 type_hash_canon (unsigned int hashcode
, tree type
)
3586 /* The hash table only contains main variants, so ensure that's what we're
3588 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
3590 if (!lang_hooks
.types
.hash_types
)
3593 /* See if the type is in the hash table already. If so, return it.
3594 Otherwise, add the type. */
3595 t1
= type_hash_lookup (hashcode
, type
);
3598 #ifdef GATHER_STATISTICS
3599 tree_node_counts
[(int) t_kind
]--;
3600 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3606 type_hash_add (hashcode
, type
);
3611 /* See if the data pointed to by the type hash table is marked. We consider
3612 it marked if the type is marked or if a debug type number or symbol
3613 table entry has been made for the type. This reduces the amount of
3614 debugging output and eliminates that dependency of the debug output on
3615 the number of garbage collections. */
3618 type_hash_marked_p (const void *p
)
3620 tree type
= ((struct type_hash
*) p
)->type
;
3622 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3626 print_type_hash_statistics (void)
3628 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3629 (long) htab_size (type_hash_table
),
3630 (long) htab_elements (type_hash_table
),
3631 htab_collisions (type_hash_table
));
3634 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3635 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3636 by adding the hash codes of the individual attributes. */
3639 attribute_hash_list (tree list
, hashval_t hashcode
)
3643 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3644 /* ??? Do we want to add in TREE_VALUE too? */
3645 hashcode
= iterative_hash_object
3646 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
3650 /* Given two lists of attributes, return true if list l2 is
3651 equivalent to l1. */
3654 attribute_list_equal (tree l1
, tree l2
)
3656 return attribute_list_contained (l1
, l2
)
3657 && attribute_list_contained (l2
, l1
);
3660 /* Given two lists of attributes, return true if list L2 is
3661 completely contained within L1. */
3662 /* ??? This would be faster if attribute names were stored in a canonicalized
3663 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3664 must be used to show these elements are equivalent (which they are). */
3665 /* ??? It's not clear that attributes with arguments will always be handled
3669 attribute_list_contained (tree l1
, tree l2
)
3673 /* First check the obvious, maybe the lists are identical. */
3677 /* Maybe the lists are similar. */
3678 for (t1
= l1
, t2
= l2
;
3680 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3681 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3682 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3684 /* Maybe the lists are equal. */
3685 if (t1
== 0 && t2
== 0)
3688 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3691 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3693 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3696 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3703 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3710 /* Given two lists of types
3711 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3712 return 1 if the lists contain the same types in the same order.
3713 Also, the TREE_PURPOSEs must match. */
3716 type_list_equal (tree l1
, tree l2
)
3720 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3721 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3722 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3723 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3724 && (TREE_TYPE (TREE_PURPOSE (t1
))
3725 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3731 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3732 given by TYPE. If the argument list accepts variable arguments,
3733 then this function counts only the ordinary arguments. */
3736 type_num_arguments (tree type
)
3741 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3742 /* If the function does not take a variable number of arguments,
3743 the last element in the list will have type `void'. */
3744 if (VOID_TYPE_P (TREE_VALUE (t
)))
3752 /* Nonzero if integer constants T1 and T2
3753 represent the same constant value. */
3756 tree_int_cst_equal (tree t1
, tree t2
)
3761 if (t1
== 0 || t2
== 0)
3764 if (TREE_CODE (t1
) == INTEGER_CST
3765 && TREE_CODE (t2
) == INTEGER_CST
3766 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3767 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3773 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3774 The precise way of comparison depends on their data type. */
3777 tree_int_cst_lt (tree t1
, tree t2
)
3782 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
3784 int t1_sgn
= tree_int_cst_sgn (t1
);
3785 int t2_sgn
= tree_int_cst_sgn (t2
);
3787 if (t1_sgn
< t2_sgn
)
3789 else if (t1_sgn
> t2_sgn
)
3791 /* Otherwise, both are non-negative, so we compare them as
3792 unsigned just in case one of them would overflow a signed
3795 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
3796 return INT_CST_LT (t1
, t2
);
3798 return INT_CST_LT_UNSIGNED (t1
, t2
);
3801 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3804 tree_int_cst_compare (tree t1
, tree t2
)
3806 if (tree_int_cst_lt (t1
, t2
))
3808 else if (tree_int_cst_lt (t2
, t1
))
3814 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3815 the host. If POS is zero, the value can be represented in a single
3816 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3817 be represented in a single unsigned HOST_WIDE_INT. */
3820 host_integerp (tree t
, int pos
)
3822 return (TREE_CODE (t
) == INTEGER_CST
3823 && ! TREE_OVERFLOW (t
)
3824 && ((TREE_INT_CST_HIGH (t
) == 0
3825 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3826 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3827 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3828 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
3829 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3832 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3833 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3834 be positive. Abort if we cannot satisfy the above conditions. */
3837 tree_low_cst (tree t
, int pos
)
3839 gcc_assert (host_integerp (t
, pos
));
3840 return TREE_INT_CST_LOW (t
);
3843 /* Return the most significant bit of the integer constant T. */
3846 tree_int_cst_msb (tree t
)
3850 unsigned HOST_WIDE_INT l
;
3852 /* Note that using TYPE_PRECISION here is wrong. We care about the
3853 actual bits, not the (arbitrary) range of the type. */
3854 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3855 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3856 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3857 return (l
& 1) == 1;
3860 /* Return an indication of the sign of the integer constant T.
3861 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3862 Note that -1 will never be returned it T's type is unsigned. */
3865 tree_int_cst_sgn (tree t
)
3867 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3869 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
3871 else if (TREE_INT_CST_HIGH (t
) < 0)
3877 /* Compare two constructor-element-type constants. Return 1 if the lists
3878 are known to be equal; otherwise return 0. */
3881 simple_cst_list_equal (tree l1
, tree l2
)
3883 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3885 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3888 l1
= TREE_CHAIN (l1
);
3889 l2
= TREE_CHAIN (l2
);
3895 /* Return truthvalue of whether T1 is the same tree structure as T2.
3896 Return 1 if they are the same.
3897 Return 0 if they are understandably different.
3898 Return -1 if either contains tree structure not understood by
3902 simple_cst_equal (tree t1
, tree t2
)
3904 enum tree_code code1
, code2
;
3910 if (t1
== 0 || t2
== 0)
3913 code1
= TREE_CODE (t1
);
3914 code2
= TREE_CODE (t2
);
3916 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3918 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3919 || code2
== NON_LVALUE_EXPR
)
3920 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3922 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3925 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3926 || code2
== NON_LVALUE_EXPR
)
3927 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3935 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3936 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3939 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3942 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3943 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3944 TREE_STRING_LENGTH (t1
)));
3947 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1
),
3948 CONSTRUCTOR_ELTS (t2
));
3951 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3954 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3958 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3961 /* Special case: if either target is an unallocated VAR_DECL,
3962 it means that it's going to be unified with whatever the
3963 TARGET_EXPR is really supposed to initialize, so treat it
3964 as being equivalent to anything. */
3965 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3966 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3967 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3968 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3969 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3970 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3973 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3978 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3980 case WITH_CLEANUP_EXPR
:
3981 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3985 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3988 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3989 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4003 /* This general rule works for most tree codes. All exceptions should be
4004 handled above. If this is a language-specific tree code, we can't
4005 trust what might be in the operand, so say we don't know
4007 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4010 switch (TREE_CODE_CLASS (code1
))
4014 case tcc_comparison
:
4015 case tcc_expression
:
4019 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
4021 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4033 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4034 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4035 than U, respectively. */
4038 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
4040 if (tree_int_cst_sgn (t
) < 0)
4042 else if (TREE_INT_CST_HIGH (t
) != 0)
4044 else if (TREE_INT_CST_LOW (t
) == u
)
4046 else if (TREE_INT_CST_LOW (t
) < u
)
4052 /* Return true if CODE represents an associative tree code. Otherwise
4055 associative_tree_code (enum tree_code code
)
4074 /* Return true if CODE represents a commutative tree code. Otherwise
4077 commutative_tree_code (enum tree_code code
)
4090 case UNORDERED_EXPR
:
4094 case TRUTH_AND_EXPR
:
4095 case TRUTH_XOR_EXPR
:
4105 /* Generate a hash value for an expression. This can be used iteratively
4106 by passing a previous result as the "val" argument.
4108 This function is intended to produce the same hash for expressions which
4109 would compare equal using operand_equal_p. */
4112 iterative_hash_expr (tree t
, hashval_t val
)
4115 enum tree_code code
;
4119 return iterative_hash_pointer (t
, val
);
4121 code
= TREE_CODE (t
);
4125 /* Alas, constants aren't shared, so we can't rely on pointer
4128 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
4129 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4132 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4134 return iterative_hash_hashval_t (val2
, val
);
4137 return iterative_hash (TREE_STRING_POINTER (t
),
4138 TREE_STRING_LENGTH (t
), val
);
4140 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4141 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4143 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4147 /* we can just compare by pointer. */
4148 return iterative_hash_pointer (t
, val
);
4151 /* A list of expressions, for a CALL_EXPR or as the elements of a
4153 for (; t
; t
= TREE_CHAIN (t
))
4154 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4157 class = TREE_CODE_CLASS (code
);
4159 if (class == tcc_declaration
)
4161 /* Decls we can just compare by pointer. */
4162 val
= iterative_hash_pointer (t
, val
);
4166 gcc_assert (IS_EXPR_CODE_CLASS (class));
4168 val
= iterative_hash_object (code
, val
);
4170 /* Don't hash the type, that can lead to having nodes which
4171 compare equal according to operand_equal_p, but which
4172 have different hash codes. */
4173 if (code
== NOP_EXPR
4174 || code
== CONVERT_EXPR
4175 || code
== NON_LVALUE_EXPR
)
4177 /* Make sure to include signness in the hash computation. */
4178 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4179 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4182 else if (commutative_tree_code (code
))
4184 /* It's a commutative expression. We want to hash it the same
4185 however it appears. We do this by first hashing both operands
4186 and then rehashing based on the order of their independent
4188 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4189 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4193 t
= one
, one
= two
, two
= t
;
4195 val
= iterative_hash_hashval_t (one
, val
);
4196 val
= iterative_hash_hashval_t (two
, val
);
4199 for (i
= first_rtl_op (code
) - 1; i
>= 0; --i
)
4200 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4207 /* Constructors for pointer, array and function types.
4208 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4209 constructed by language-dependent code, not here.) */
4211 /* Construct, lay out and return the type of pointers to TO_TYPE with
4212 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4213 reference all of memory. If such a type has already been
4214 constructed, reuse it. */
4217 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4222 /* In some cases, languages will have things that aren't a POINTER_TYPE
4223 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4224 In that case, return that type without regard to the rest of our
4227 ??? This is a kludge, but consistent with the way this function has
4228 always operated and there doesn't seem to be a good way to avoid this
4230 if (TYPE_POINTER_TO (to_type
) != 0
4231 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4232 return TYPE_POINTER_TO (to_type
);
4234 /* First, if we already have a type for pointers to TO_TYPE and it's
4235 the proper mode, use it. */
4236 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4237 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4240 t
= make_node (POINTER_TYPE
);
4242 TREE_TYPE (t
) = to_type
;
4243 TYPE_MODE (t
) = mode
;
4244 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4245 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4246 TYPE_POINTER_TO (to_type
) = t
;
4248 /* Lay out the type. This function has many callers that are concerned
4249 with expression-construction, and this simplifies them all. */
4255 /* By default build pointers in ptr_mode. */
4258 build_pointer_type (tree to_type
)
4260 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4263 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4266 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4271 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4272 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4273 In that case, return that type without regard to the rest of our
4276 ??? This is a kludge, but consistent with the way this function has
4277 always operated and there doesn't seem to be a good way to avoid this
4279 if (TYPE_REFERENCE_TO (to_type
) != 0
4280 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4281 return TYPE_REFERENCE_TO (to_type
);
4283 /* First, if we already have a type for pointers to TO_TYPE and it's
4284 the proper mode, use it. */
4285 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4286 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4289 t
= make_node (REFERENCE_TYPE
);
4291 TREE_TYPE (t
) = to_type
;
4292 TYPE_MODE (t
) = mode
;
4293 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4294 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4295 TYPE_REFERENCE_TO (to_type
) = t
;
4303 /* Build the node for the type of references-to-TO_TYPE by default
4307 build_reference_type (tree to_type
)
4309 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4312 /* Build a type that is compatible with t but has no cv quals anywhere
4315 const char *const *const * -> char ***. */
4318 build_type_no_quals (tree t
)
4320 switch (TREE_CODE (t
))
4323 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4325 TYPE_REF_CAN_ALIAS_ALL (t
));
4326 case REFERENCE_TYPE
:
4328 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4330 TYPE_REF_CAN_ALIAS_ALL (t
));
4332 return TYPE_MAIN_VARIANT (t
);
4336 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4337 MAXVAL should be the maximum value in the domain
4338 (one less than the length of the array).
4340 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4341 We don't enforce this limit, that is up to caller (e.g. language front end).
4342 The limit exists because the result is a signed type and we don't handle
4343 sizes that use more than one HOST_WIDE_INT. */
4346 build_index_type (tree maxval
)
4348 tree itype
= make_node (INTEGER_TYPE
);
4350 TREE_TYPE (itype
) = sizetype
;
4351 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4352 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4353 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
4354 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4355 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4356 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4357 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4358 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
4360 if (host_integerp (maxval
, 1))
4361 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
4366 /* Builds a signed or unsigned integer type of precision PRECISION.
4367 Used for C bitfields whose precision does not match that of
4368 built-in target types. */
4370 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
4373 tree itype
= make_node (INTEGER_TYPE
);
4375 TYPE_PRECISION (itype
) = precision
;
4378 fixup_unsigned_type (itype
);
4380 fixup_signed_type (itype
);
4382 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
4383 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
4388 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4389 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4390 low bound LOWVAL and high bound HIGHVAL.
4391 if TYPE==NULL_TREE, sizetype is used. */
4394 build_range_type (tree type
, tree lowval
, tree highval
)
4396 tree itype
= make_node (INTEGER_TYPE
);
4398 TREE_TYPE (itype
) = type
;
4399 if (type
== NULL_TREE
)
4402 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4403 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4405 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4406 TYPE_MODE (itype
) = TYPE_MODE (type
);
4407 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4408 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4409 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4410 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
4412 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
4413 return type_hash_canon (tree_low_cst (highval
, 0)
4414 - tree_low_cst (lowval
, 0),
4420 /* Just like build_index_type, but takes lowval and highval instead
4421 of just highval (maxval). */
4424 build_index_2_type (tree lowval
, tree highval
)
4426 return build_range_type (sizetype
, lowval
, highval
);
4429 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4430 and number of elements specified by the range of values of INDEX_TYPE.
4431 If such a type has already been constructed, reuse it. */
4434 build_array_type (tree elt_type
, tree index_type
)
4437 hashval_t hashcode
= 0;
4439 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4441 error ("arrays of functions are not meaningful");
4442 elt_type
= integer_type_node
;
4445 t
= make_node (ARRAY_TYPE
);
4446 TREE_TYPE (t
) = elt_type
;
4447 TYPE_DOMAIN (t
) = index_type
;
4449 if (index_type
== 0)
4455 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
4456 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
4457 t
= type_hash_canon (hashcode
, t
);
4459 if (!COMPLETE_TYPE_P (t
))
4464 /* Return the TYPE of the elements comprising
4465 the innermost dimension of ARRAY. */
4468 get_inner_array_type (tree array
)
4470 tree type
= TREE_TYPE (array
);
4472 while (TREE_CODE (type
) == ARRAY_TYPE
)
4473 type
= TREE_TYPE (type
);
4478 /* Construct, lay out and return
4479 the type of functions returning type VALUE_TYPE
4480 given arguments of types ARG_TYPES.
4481 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4482 are data type nodes for the arguments of the function.
4483 If such a type has already been constructed, reuse it. */
4486 build_function_type (tree value_type
, tree arg_types
)
4489 hashval_t hashcode
= 0;
4491 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4493 error ("function return type cannot be function");
4494 value_type
= integer_type_node
;
4497 /* Make a node of the sort we want. */
4498 t
= make_node (FUNCTION_TYPE
);
4499 TREE_TYPE (t
) = value_type
;
4500 TYPE_ARG_TYPES (t
) = arg_types
;
4502 /* If we already have such a type, use the old one. */
4503 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
4504 hashcode
= type_hash_list (arg_types
, hashcode
);
4505 t
= type_hash_canon (hashcode
, t
);
4507 if (!COMPLETE_TYPE_P (t
))
4512 /* Build a function type. The RETURN_TYPE is the type returned by the
4513 function. If additional arguments are provided, they are
4514 additional argument types. The list of argument types must always
4515 be terminated by NULL_TREE. */
4518 build_function_type_list (tree return_type
, ...)
4523 va_start (p
, return_type
);
4525 t
= va_arg (p
, tree
);
4526 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
4527 args
= tree_cons (NULL_TREE
, t
, args
);
4530 args
= nreverse (args
);
4531 TREE_CHAIN (last
) = void_list_node
;
4532 args
= build_function_type (return_type
, args
);
4538 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4539 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4540 for the method. An implicit additional parameter (of type
4541 pointer-to-BASETYPE) is added to the ARGTYPES. */
4544 build_method_type_directly (tree basetype
,
4552 /* Make a node of the sort we want. */
4553 t
= make_node (METHOD_TYPE
);
4555 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4556 TREE_TYPE (t
) = rettype
;
4557 ptype
= build_pointer_type (basetype
);
4559 /* The actual arglist for this function includes a "hidden" argument
4560 which is "this". Put it into the list of argument types. */
4561 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
4562 TYPE_ARG_TYPES (t
) = argtypes
;
4564 /* If we already have such a type, use the old one. */
4565 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4566 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
4567 hashcode
= type_hash_list (argtypes
, hashcode
);
4568 t
= type_hash_canon (hashcode
, t
);
4570 if (!COMPLETE_TYPE_P (t
))
4576 /* Construct, lay out and return the type of methods belonging to class
4577 BASETYPE and whose arguments and values are described by TYPE.
4578 If that type exists already, reuse it.
4579 TYPE must be a FUNCTION_TYPE node. */
4582 build_method_type (tree basetype
, tree type
)
4584 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
4586 return build_method_type_directly (basetype
,
4588 TYPE_ARG_TYPES (type
));
4591 /* Construct, lay out and return the type of offsets to a value
4592 of type TYPE, within an object of type BASETYPE.
4593 If a suitable offset type exists already, reuse it. */
4596 build_offset_type (tree basetype
, tree type
)
4599 hashval_t hashcode
= 0;
4601 /* Make a node of the sort we want. */
4602 t
= make_node (OFFSET_TYPE
);
4604 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4605 TREE_TYPE (t
) = type
;
4607 /* If we already have such a type, use the old one. */
4608 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4609 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
4610 t
= type_hash_canon (hashcode
, t
);
4612 if (!COMPLETE_TYPE_P (t
))
4618 /* Create a complex type whose components are COMPONENT_TYPE. */
4621 build_complex_type (tree component_type
)
4626 /* Make a node of the sort we want. */
4627 t
= make_node (COMPLEX_TYPE
);
4629 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4631 /* If we already have such a type, use the old one. */
4632 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
4633 t
= type_hash_canon (hashcode
, t
);
4635 if (!COMPLETE_TYPE_P (t
))
4638 /* If we are writing Dwarf2 output we need to create a name,
4639 since complex is a fundamental type. */
4640 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4644 if (component_type
== char_type_node
)
4645 name
= "complex char";
4646 else if (component_type
== signed_char_type_node
)
4647 name
= "complex signed char";
4648 else if (component_type
== unsigned_char_type_node
)
4649 name
= "complex unsigned char";
4650 else if (component_type
== short_integer_type_node
)
4651 name
= "complex short int";
4652 else if (component_type
== short_unsigned_type_node
)
4653 name
= "complex short unsigned int";
4654 else if (component_type
== integer_type_node
)
4655 name
= "complex int";
4656 else if (component_type
== unsigned_type_node
)
4657 name
= "complex unsigned int";
4658 else if (component_type
== long_integer_type_node
)
4659 name
= "complex long int";
4660 else if (component_type
== long_unsigned_type_node
)
4661 name
= "complex long unsigned int";
4662 else if (component_type
== long_long_integer_type_node
)
4663 name
= "complex long long int";
4664 else if (component_type
== long_long_unsigned_type_node
)
4665 name
= "complex long long unsigned int";
4670 TYPE_NAME (t
) = get_identifier (name
);
4673 return build_qualified_type (t
, TYPE_QUALS (component_type
));
4676 /* Return OP, stripped of any conversions to wider types as much as is safe.
4677 Converting the value back to OP's type makes a value equivalent to OP.
4679 If FOR_TYPE is nonzero, we return a value which, if converted to
4680 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4682 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4683 narrowest type that can hold the value, even if they don't exactly fit.
4684 Otherwise, bit-field references are changed to a narrower type
4685 only if they can be fetched directly from memory in that type.
4687 OP must have integer, real or enumeral type. Pointers are not allowed!
4689 There are some cases where the obvious value we could return
4690 would regenerate to OP if converted to OP's type,
4691 but would not extend like OP to wider types.
4692 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4693 For example, if OP is (unsigned short)(signed char)-1,
4694 we avoid returning (signed char)-1 if FOR_TYPE is int,
4695 even though extending that to an unsigned short would regenerate OP,
4696 since the result of extending (signed char)-1 to (int)
4697 is different from (int) OP. */
4700 get_unwidened (tree op
, tree for_type
)
4702 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4703 tree type
= TREE_TYPE (op
);
4705 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4707 = (for_type
!= 0 && for_type
!= type
4708 && final_prec
> TYPE_PRECISION (type
)
4709 && TYPE_UNSIGNED (type
));
4712 while (TREE_CODE (op
) == NOP_EXPR
)
4715 = TYPE_PRECISION (TREE_TYPE (op
))
4716 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4718 /* Truncations are many-one so cannot be removed.
4719 Unless we are later going to truncate down even farther. */
4721 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4724 /* See what's inside this conversion. If we decide to strip it,
4726 op
= TREE_OPERAND (op
, 0);
4728 /* If we have not stripped any zero-extensions (uns is 0),
4729 we can strip any kind of extension.
4730 If we have previously stripped a zero-extension,
4731 only zero-extensions can safely be stripped.
4732 Any extension can be stripped if the bits it would produce
4733 are all going to be discarded later by truncating to FOR_TYPE. */
4737 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4739 /* TYPE_UNSIGNED says whether this is a zero-extension.
4740 Let's avoid computing it if it does not affect WIN
4741 and if UNS will not be needed again. */
4742 if ((uns
|| TREE_CODE (op
) == NOP_EXPR
)
4743 && TYPE_UNSIGNED (TREE_TYPE (op
)))
4751 if (TREE_CODE (op
) == COMPONENT_REF
4752 /* Since type_for_size always gives an integer type. */
4753 && TREE_CODE (type
) != REAL_TYPE
4754 /* Don't crash if field not laid out yet. */
4755 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4756 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4758 unsigned int innerprec
4759 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4760 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4761 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4762 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4764 /* We can get this structure field in the narrowest type it fits in.
4765 If FOR_TYPE is 0, do this only for a field that matches the
4766 narrower type exactly and is aligned for it
4767 The resulting extension to its nominal type (a fullword type)
4768 must fit the same conditions as for other extensions. */
4771 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
4772 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4773 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
4775 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4776 TREE_OPERAND (op
, 1), NULL_TREE
);
4777 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4778 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4785 /* Return OP or a simpler expression for a narrower value
4786 which can be sign-extended or zero-extended to give back OP.
4787 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4788 or 0 if the value should be sign-extended. */
4791 get_narrower (tree op
, int *unsignedp_ptr
)
4796 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
4798 while (TREE_CODE (op
) == NOP_EXPR
)
4801 = (TYPE_PRECISION (TREE_TYPE (op
))
4802 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4804 /* Truncations are many-one so cannot be removed. */
4808 /* See what's inside this conversion. If we decide to strip it,
4813 op
= TREE_OPERAND (op
, 0);
4814 /* An extension: the outermost one can be stripped,
4815 but remember whether it is zero or sign extension. */
4817 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4818 /* Otherwise, if a sign extension has been stripped,
4819 only sign extensions can now be stripped;
4820 if a zero extension has been stripped, only zero-extensions. */
4821 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
4825 else /* bitschange == 0 */
4827 /* A change in nominal type can always be stripped, but we must
4828 preserve the unsignedness. */
4830 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4832 op
= TREE_OPERAND (op
, 0);
4833 /* Keep trying to narrow, but don't assign op to win if it
4834 would turn an integral type into something else. */
4835 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
4842 if (TREE_CODE (op
) == COMPONENT_REF
4843 /* Since type_for_size always gives an integer type. */
4844 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4845 /* Ensure field is laid out already. */
4846 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4847 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4849 unsigned HOST_WIDE_INT innerprec
4850 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4851 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4852 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4853 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4855 /* We can get this structure field in a narrower type that fits it,
4856 but the resulting extension to its nominal type (a fullword type)
4857 must satisfy the same conditions as for other extensions.
4859 Do this only for fields that are aligned (not bit-fields),
4860 because when bit-field insns will be used there is no
4861 advantage in doing this. */
4863 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4864 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4865 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
4869 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
4870 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4871 TREE_OPERAND (op
, 1), NULL_TREE
);
4872 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4873 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4876 *unsignedp_ptr
= uns
;
4880 /* Nonzero if integer constant C has a value that is permissible
4881 for type TYPE (an INTEGER_TYPE). */
4884 int_fits_type_p (tree c
, tree type
)
4886 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4887 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4888 int ok_for_low_bound
, ok_for_high_bound
;
4890 /* Perform some generic filtering first, which may allow making a decision
4891 even if the bounds are not constant. First, negative integers never fit
4892 in unsigned types, */
4893 if ((TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4894 /* Also, unsigned integers with top bit set never fit signed types. */
4895 || (! TYPE_UNSIGNED (type
)
4896 && TYPE_UNSIGNED (TREE_TYPE (c
)) && tree_int_cst_msb (c
)))
4899 /* If at least one bound of the type is a constant integer, we can check
4900 ourselves and maybe make a decision. If no such decision is possible, but
4901 this type is a subtype, try checking against that. Otherwise, use
4902 force_fit_type, which checks against the precision.
4904 Compute the status for each possibly constant bound, and return if we see
4905 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4906 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4907 for "constant known to fit". */
4909 ok_for_low_bound
= -1;
4910 ok_for_high_bound
= -1;
4912 /* Check if C >= type_low_bound. */
4913 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4915 ok_for_low_bound
= ! tree_int_cst_lt (c
, type_low_bound
);
4916 if (! ok_for_low_bound
)
4920 /* Check if c <= type_high_bound. */
4921 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4923 ok_for_high_bound
= ! tree_int_cst_lt (type_high_bound
, c
);
4924 if (! ok_for_high_bound
)
4928 /* If the constant fits both bounds, the result is known. */
4929 if (ok_for_low_bound
== 1 && ok_for_high_bound
== 1)
4932 /* If we haven't been able to decide at this point, there nothing more we
4933 can check ourselves here. Look at the base type if we have one. */
4934 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4935 return int_fits_type_p (c
, TREE_TYPE (type
));
4937 /* Or to force_fit_type, if nothing else. */
4941 TREE_TYPE (c
) = type
;
4942 c
= force_fit_type (c
, -1, false, false);
4943 return !TREE_OVERFLOW (c
);
4947 /* Subprogram of following function. Called by walk_tree.
4949 Return *TP if it is an automatic variable or parameter of the
4950 function passed in as DATA. */
4953 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
4955 tree fn
= (tree
) data
;
4960 else if (DECL_P (*tp
)
4961 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
4967 /* Returns true if T is, contains, or refers to a type with variable
4968 size. If FN is nonzero, only return true if a modifier of the type
4969 or position of FN is a variable or parameter inside FN.
4971 This concept is more general than that of C99 'variably modified types':
4972 in C99, a struct type is never variably modified because a VLA may not
4973 appear as a structure member. However, in GNU C code like:
4975 struct S { int i[f()]; };
4977 is valid, and other languages may define similar constructs. */
4980 variably_modified_type_p (tree type
, tree fn
)
4984 /* Test if T is either variable (if FN is zero) or an expression containing
4985 a variable in FN. */
4986 #define RETURN_TRUE_IF_VAR(T) \
4987 do { tree _t = (T); \
4988 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
4989 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
4990 return true; } while (0)
4992 if (type
== error_mark_node
)
4995 /* If TYPE itself has variable size, it is variably modified.
4997 We do not yet have a representation of the C99 '[*]' syntax.
4998 When a representation is chosen, this function should be modified
4999 to test for that case as well. */
5000 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
5001 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type
));
5003 switch (TREE_CODE (type
))
5006 case REFERENCE_TYPE
:
5010 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5016 /* If TYPE is a function type, it is variably modified if any of the
5017 parameters or the return type are variably modified. */
5018 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5021 for (t
= TYPE_ARG_TYPES (type
);
5022 t
&& t
!= void_list_node
;
5024 if (variably_modified_type_p (TREE_VALUE (t
), fn
))
5033 /* Scalar types are variably modified if their end points
5035 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
5036 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
5041 case QUAL_UNION_TYPE
:
5042 /* We can't see if any of the field are variably-modified by the
5043 definition we normally use, since that would produce infinite
5044 recursion via pointers. */
5045 /* This is variably modified if some field's type is. */
5046 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5047 if (TREE_CODE (t
) == FIELD_DECL
)
5049 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
5050 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
5051 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
5053 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
5054 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
5062 /* The current language may have other cases to check, but in general,
5063 all other types are not variably modified. */
5064 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
5066 #undef RETURN_TRUE_IF_VAR
5069 /* Given a DECL or TYPE, return the scope in which it was declared, or
5070 NULL_TREE if there is no containing scope. */
5073 get_containing_scope (tree t
)
5075 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
5078 /* Return the innermost context enclosing DECL that is
5079 a FUNCTION_DECL, or zero if none. */
5082 decl_function_context (tree decl
)
5086 if (TREE_CODE (decl
) == ERROR_MARK
)
5089 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5090 where we look up the function at runtime. Such functions always take
5091 a first argument of type 'pointer to real context'.
5093 C++ should really be fixed to use DECL_CONTEXT for the real context,
5094 and use something else for the "virtual context". */
5095 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
5098 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
5100 context
= DECL_CONTEXT (decl
);
5102 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
5104 if (TREE_CODE (context
) == BLOCK
)
5105 context
= BLOCK_SUPERCONTEXT (context
);
5107 context
= get_containing_scope (context
);
5113 /* Return the innermost context enclosing DECL that is
5114 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5115 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5118 decl_type_context (tree decl
)
5120 tree context
= DECL_CONTEXT (decl
);
5123 switch (TREE_CODE (context
))
5125 case NAMESPACE_DECL
:
5126 case TRANSLATION_UNIT_DECL
:
5131 case QUAL_UNION_TYPE
:
5136 context
= DECL_CONTEXT (context
);
5140 context
= BLOCK_SUPERCONTEXT (context
);
5150 /* CALL is a CALL_EXPR. Return the declaration for the function
5151 called, or NULL_TREE if the called function cannot be
5155 get_callee_fndecl (tree call
)
5159 /* It's invalid to call this function with anything but a
5161 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5163 /* The first operand to the CALL is the address of the function
5165 addr
= TREE_OPERAND (call
, 0);
5169 /* If this is a readonly function pointer, extract its initial value. */
5170 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5171 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5172 && DECL_INITIAL (addr
))
5173 addr
= DECL_INITIAL (addr
);
5175 /* If the address is just `&f' for some function `f', then we know
5176 that `f' is being called. */
5177 if (TREE_CODE (addr
) == ADDR_EXPR
5178 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5179 return TREE_OPERAND (addr
, 0);
5181 /* We couldn't figure out what was being called. Maybe the front
5182 end has some idea. */
5183 return lang_hooks
.lang_get_callee_fndecl (call
);
5186 /* Print debugging information about tree nodes generated during the compile,
5187 and any language-specific information. */
5190 dump_tree_statistics (void)
5192 #ifdef GATHER_STATISTICS
5194 int total_nodes
, total_bytes
;
5197 fprintf (stderr
, "\n??? tree nodes created\n\n");
5198 #ifdef GATHER_STATISTICS
5199 fprintf (stderr
, "Kind Nodes Bytes\n");
5200 fprintf (stderr
, "---------------------------------------\n");
5201 total_nodes
= total_bytes
= 0;
5202 for (i
= 0; i
< (int) all_kinds
; i
++)
5204 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5205 tree_node_counts
[i
], tree_node_sizes
[i
]);
5206 total_nodes
+= tree_node_counts
[i
];
5207 total_bytes
+= tree_node_sizes
[i
];
5209 fprintf (stderr
, "---------------------------------------\n");
5210 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5211 fprintf (stderr
, "---------------------------------------\n");
5212 ssanames_print_statistics ();
5213 phinodes_print_statistics ();
5215 fprintf (stderr
, "(No per-node statistics)\n");
5217 print_type_hash_statistics ();
5218 lang_hooks
.print_statistics ();
5221 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5223 /* Generate a crc32 of a string. */
5226 crc32_string (unsigned chksum
, const char *string
)
5230 unsigned value
= *string
<< 24;
5233 for (ix
= 8; ix
--; value
<<= 1)
5237 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5246 /* P is a string that will be used in a symbol. Mask out any characters
5247 that are not valid in that context. */
5250 clean_symbol_name (char *p
)
5254 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5257 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5264 /* Generate a name for a function unique to this translation unit.
5265 TYPE is some string to identify the purpose of this function to the
5266 linker or collect2. */
5269 get_file_function_name_long (const char *type
)
5275 if (first_global_object_name
)
5276 p
= first_global_object_name
;
5279 /* We don't have anything that we know to be unique to this translation
5280 unit, so use what we do have and throw in some randomness. */
5282 const char *name
= weak_global_object_name
;
5283 const char *file
= main_input_filename
;
5288 file
= input_filename
;
5290 len
= strlen (file
);
5291 q
= alloca (9 * 2 + len
+ 1);
5292 memcpy (q
, file
, len
+ 1);
5293 clean_symbol_name (q
);
5295 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5296 crc32_string (0, flag_random_seed
));
5301 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5303 /* Set up the name of the file-level functions we may need.
5304 Use a global object (which is already required to be unique over
5305 the program) rather than the file name (which imposes extra
5307 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5309 return get_identifier (buf
);
5312 /* If KIND=='I', return a suitable global initializer (constructor) name.
5313 If KIND=='D', return a suitable global clean-up (destructor) name. */
5316 get_file_function_name (int kind
)
5323 return get_file_function_name_long (p
);
5326 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5327 The result is placed in BUFFER (which has length BIT_SIZE),
5328 with one bit in each char ('\000' or '\001').
5330 If the constructor is constant, NULL_TREE is returned.
5331 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5334 get_set_constructor_bits (tree init
, char *buffer
, int bit_size
)
5338 HOST_WIDE_INT domain_min
5339 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
5340 tree non_const_bits
= NULL_TREE
;
5342 for (i
= 0; i
< bit_size
; i
++)
5345 for (vals
= TREE_OPERAND (init
, 1);
5346 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
5348 if (!host_integerp (TREE_VALUE (vals
), 0)
5349 || (TREE_PURPOSE (vals
) != NULL_TREE
5350 && !host_integerp (TREE_PURPOSE (vals
), 0)))
5352 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
5353 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
5355 /* Set a range of bits to ones. */
5356 HOST_WIDE_INT lo_index
5357 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
5358 HOST_WIDE_INT hi_index
5359 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5361 gcc_assert (lo_index
>= 0);
5362 gcc_assert (lo_index
< bit_size
);
5363 gcc_assert (hi_index
>= 0);
5364 gcc_assert (hi_index
< bit_size
);
5365 for (; lo_index
<= hi_index
; lo_index
++)
5366 buffer
[lo_index
] = 1;
5370 /* Set a single bit to one. */
5372 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5373 if (index
< 0 || index
>= bit_size
)
5375 error ("invalid initializer for bit string");
5381 return non_const_bits
;
5384 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5385 The result is placed in BUFFER (which is an array of bytes).
5386 If the constructor is constant, NULL_TREE is returned.
5387 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5390 get_set_constructor_bytes (tree init
, unsigned char *buffer
, int wd_size
)
5393 int set_word_size
= BITS_PER_UNIT
;
5394 int bit_size
= wd_size
* set_word_size
;
5396 unsigned char *bytep
= buffer
;
5397 char *bit_buffer
= alloca (bit_size
);
5398 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5400 for (i
= 0; i
< wd_size
; i
++)
5403 for (i
= 0; i
< bit_size
; i
++)
5407 if (BYTES_BIG_ENDIAN
)
5408 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5410 *bytep
|= 1 << bit_pos
;
5413 if (bit_pos
>= set_word_size
)
5414 bit_pos
= 0, bytep
++;
5416 return non_const_bits
;
5419 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5421 /* Complain that the tree code of NODE does not match the expected 0
5422 terminated list of trailing codes. The trailing code list can be
5423 empty, for a more vague error message. FILE, LINE, and FUNCTION
5424 are of the caller. */
5427 tree_check_failed (const tree node
, const char *file
,
5428 int line
, const char *function
, ...)
5432 unsigned length
= 0;
5435 va_start (args
, function
);
5436 while ((code
= va_arg (args
, int)))
5437 length
+= 4 + strlen (tree_code_name
[code
]);
5441 va_start (args
, function
);
5442 length
+= strlen ("expected ");
5443 buffer
= alloca (length
);
5445 while ((code
= va_arg (args
, int)))
5447 const char *prefix
= length
? " or " : "expected ";
5449 strcpy (buffer
+ length
, prefix
);
5450 length
+= strlen (prefix
);
5451 strcpy (buffer
+ length
, tree_code_name
[code
]);
5452 length
+= strlen (tree_code_name
[code
]);
5457 buffer
= (char *)"unexpected node";
5459 internal_error ("tree check: %s, have %s in %s, at %s:%d",
5460 buffer
, tree_code_name
[TREE_CODE (node
)],
5461 function
, trim_filename (file
), line
);
5464 /* Complain that the tree code of NODE does match the expected 0
5465 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5469 tree_not_check_failed (const tree node
, const char *file
,
5470 int line
, const char *function
, ...)
5474 unsigned length
= 0;
5477 va_start (args
, function
);
5478 while ((code
= va_arg (args
, int)))
5479 length
+= 4 + strlen (tree_code_name
[code
]);
5481 va_start (args
, function
);
5482 buffer
= alloca (length
);
5484 while ((code
= va_arg (args
, int)))
5488 strcpy (buffer
+ length
, " or ");
5491 strcpy (buffer
+ length
, tree_code_name
[code
]);
5492 length
+= strlen (tree_code_name
[code
]);
5496 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5497 buffer
, tree_code_name
[TREE_CODE (node
)],
5498 function
, trim_filename (file
), line
);
5501 /* Similar to tree_check_failed, except that we check for a class of tree
5502 code, given in CL. */
5505 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
5506 const char *file
, int line
, const char *function
)
5509 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
5510 TREE_CODE_CLASS_STRING (cl
),
5511 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
5512 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
5515 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5516 (dynamically sized) vector. */
5519 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5520 const char *function
)
5523 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5524 idx
+ 1, len
, function
, trim_filename (file
), line
);
5527 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5528 (dynamically sized) vector. */
5531 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5532 const char *function
)
5535 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5536 idx
+ 1, len
, function
, trim_filename (file
), line
);
5539 /* Similar to above, except that the check is for the bounds of the operand
5540 vector of an expression node. */
5543 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
5544 int line
, const char *function
)
5547 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5548 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
5549 function
, trim_filename (file
), line
);
5551 #endif /* ENABLE_TREE_CHECKING */
5553 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5554 and mapped to the machine mode MODE. Initialize its fields and build
5555 the information necessary for debugging output. */
5558 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
5560 tree t
= make_node (VECTOR_TYPE
);
5562 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
5563 TYPE_VECTOR_SUBPARTS (t
) = nunits
;
5564 TYPE_MODE (t
) = mode
;
5565 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
5566 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
5571 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
5572 tree array
= build_array_type (innertype
, build_index_type (index
));
5573 tree rt
= make_node (RECORD_TYPE
);
5575 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5576 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5578 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
5579 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5580 the representation type, and we want to find that die when looking up
5581 the vector type. This is most easily achieved by making the TYPE_UID
5583 TYPE_UID (rt
) = TYPE_UID (t
);
5586 /* Build our main variant, based on the main variant of the inner type. */
5587 if (TYPE_MAIN_VARIANT (innertype
) != innertype
)
5589 tree innertype_main_variant
= TYPE_MAIN_VARIANT (innertype
);
5590 unsigned int hash
= TYPE_HASH (innertype_main_variant
);
5591 TYPE_MAIN_VARIANT (t
)
5592 = type_hash_canon (hash
, make_vector_type (innertype_main_variant
,
5600 make_or_reuse_type (unsigned size
, int unsignedp
)
5602 if (size
== INT_TYPE_SIZE
)
5603 return unsignedp
? unsigned_type_node
: integer_type_node
;
5604 if (size
== CHAR_TYPE_SIZE
)
5605 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5606 if (size
== SHORT_TYPE_SIZE
)
5607 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5608 if (size
== LONG_TYPE_SIZE
)
5609 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5610 if (size
== LONG_LONG_TYPE_SIZE
)
5611 return (unsignedp
? long_long_unsigned_type_node
5612 : long_long_integer_type_node
);
5615 return make_unsigned_type (size
);
5617 return make_signed_type (size
);
5620 /* Create nodes for all integer types (and error_mark_node) using the sizes
5621 of C datatypes. The caller should call set_sizetype soon after calling
5622 this function to select one of the types as sizetype. */
5625 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
5627 error_mark_node
= make_node (ERROR_MARK
);
5628 TREE_TYPE (error_mark_node
) = error_mark_node
;
5630 initialize_sizetypes (signed_sizetype
);
5632 /* Define both `signed char' and `unsigned char'. */
5633 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5634 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5636 /* Define `char', which is like either `signed char' or `unsigned char'
5637 but not the same as either. */
5640 ? make_signed_type (CHAR_TYPE_SIZE
)
5641 : make_unsigned_type (CHAR_TYPE_SIZE
));
5643 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5644 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5645 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5646 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5647 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5648 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5649 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5650 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5652 /* Define a boolean type. This type only represents boolean values but
5653 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5654 Front ends which want to override this size (i.e. Java) can redefine
5655 boolean_type_node before calling build_common_tree_nodes_2. */
5656 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5657 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5658 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5659 TYPE_PRECISION (boolean_type_node
) = 1;
5661 /* Fill in the rest of the sized types. Reuse existing type nodes
5663 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
5664 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
5665 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
5666 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
5667 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
5669 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
5670 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
5671 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
5672 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
5673 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
5675 access_public_node
= get_identifier ("public");
5676 access_protected_node
= get_identifier ("protected");
5677 access_private_node
= get_identifier ("private");
5680 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5681 It will create several other common tree nodes. */
5684 build_common_tree_nodes_2 (int short_double
)
5686 /* Define these next since types below may used them. */
5687 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
5688 integer_one_node
= build_int_cst (NULL_TREE
, 1);
5689 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
5691 size_zero_node
= size_int (0);
5692 size_one_node
= size_int (1);
5693 bitsize_zero_node
= bitsize_int (0);
5694 bitsize_one_node
= bitsize_int (1);
5695 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5697 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5698 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5700 void_type_node
= make_node (VOID_TYPE
);
5701 layout_type (void_type_node
);
5703 /* We are not going to have real types in C with less than byte alignment,
5704 so we might as well not have any types that claim to have it. */
5705 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5706 TYPE_USER_ALIGN (void_type_node
) = 0;
5708 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
5709 layout_type (TREE_TYPE (null_pointer_node
));
5711 ptr_type_node
= build_pointer_type (void_type_node
);
5713 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5714 fileptr_type_node
= ptr_type_node
;
5716 float_type_node
= make_node (REAL_TYPE
);
5717 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5718 layout_type (float_type_node
);
5720 double_type_node
= make_node (REAL_TYPE
);
5722 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5724 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5725 layout_type (double_type_node
);
5727 long_double_type_node
= make_node (REAL_TYPE
);
5728 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5729 layout_type (long_double_type_node
);
5731 float_ptr_type_node
= build_pointer_type (float_type_node
);
5732 double_ptr_type_node
= build_pointer_type (double_type_node
);
5733 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
5734 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
5736 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5737 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5738 layout_type (complex_integer_type_node
);
5740 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5741 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5742 layout_type (complex_float_type_node
);
5744 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5745 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5746 layout_type (complex_double_type_node
);
5748 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5749 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5750 layout_type (complex_long_double_type_node
);
5753 tree t
= targetm
.build_builtin_va_list ();
5755 /* Many back-ends define record types without setting TYPE_NAME.
5756 If we copied the record type here, we'd keep the original
5757 record type without a name. This breaks name mangling. So,
5758 don't copy record types and let c_common_nodes_and_builtins()
5759 declare the type to be __builtin_va_list. */
5760 if (TREE_CODE (t
) != RECORD_TYPE
)
5761 t
= build_variant_type_copy (t
);
5763 va_list_type_node
= t
;
5767 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5770 If we requested a pointer to a vector, build up the pointers that
5771 we stripped off while looking for the inner type. Similarly for
5772 return values from functions.
5774 The argument TYPE is the top of the chain, and BOTTOM is the
5775 new type which we will point to. */
5778 reconstruct_complex_type (tree type
, tree bottom
)
5782 if (POINTER_TYPE_P (type
))
5784 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5785 outer
= build_pointer_type (inner
);
5787 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5789 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5790 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
5792 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5794 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5795 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
5797 else if (TREE_CODE (type
) == METHOD_TYPE
)
5800 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5801 /* The build_method_type_directly() routine prepends 'this' to argument list,
5802 so we must compensate by getting rid of it. */
5803 argtypes
= TYPE_ARG_TYPES (type
);
5804 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
5806 TYPE_ARG_TYPES (type
));
5807 TYPE_ARG_TYPES (outer
) = argtypes
;
5812 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
5813 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
5818 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5821 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
5825 switch (GET_MODE_CLASS (mode
))
5827 case MODE_VECTOR_INT
:
5828 case MODE_VECTOR_FLOAT
:
5829 nunits
= GET_MODE_NUNITS (mode
);
5833 /* Check that there are no leftover bits. */
5834 gcc_assert (GET_MODE_BITSIZE (mode
)
5835 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
5837 nunits
= GET_MODE_BITSIZE (mode
)
5838 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
5845 return make_vector_type (innertype
, nunits
, mode
);
5848 /* Similarly, but takes the inner type and number of units, which must be
5852 build_vector_type (tree innertype
, int nunits
)
5854 return make_vector_type (innertype
, nunits
, VOIDmode
);
5857 /* Given an initializer INIT, return TRUE if INIT is zero or some
5858 aggregate of zeros. Otherwise return FALSE. */
5860 initializer_zerop (tree init
)
5866 switch (TREE_CODE (init
))
5869 return integer_zerop (init
);
5872 /* ??? Note that this is not correct for C4X float formats. There,
5873 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5874 negative exponent. */
5875 return real_zerop (init
)
5876 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
5879 return integer_zerop (init
)
5880 || (real_zerop (init
)
5881 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
5882 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
5885 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
5886 if (!initializer_zerop (TREE_VALUE (elt
)))
5891 elt
= CONSTRUCTOR_ELTS (init
);
5892 if (elt
== NULL_TREE
)
5895 /* A set is empty only if it has no elements. */
5896 if (TREE_CODE (TREE_TYPE (init
)) == SET_TYPE
)
5899 for (; elt
; elt
= TREE_CHAIN (elt
))
5900 if (! initializer_zerop (TREE_VALUE (elt
)))
5910 add_var_to_bind_expr (tree bind_expr
, tree var
)
5912 BIND_EXPR_VARS (bind_expr
)
5913 = chainon (BIND_EXPR_VARS (bind_expr
), var
);
5914 if (BIND_EXPR_BLOCK (bind_expr
))
5915 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr
))
5916 = BIND_EXPR_VARS (bind_expr
);
5919 /* Build an empty statement. */
5922 build_empty_stmt (void)
5924 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
5928 /* Returns true if it is possible to prove that the index of
5929 an array access REF (an ARRAY_REF expression) falls into the
5933 in_array_bounds_p (tree ref
)
5935 tree idx
= TREE_OPERAND (ref
, 1);
5938 if (TREE_CODE (idx
) != INTEGER_CST
)
5941 min
= array_ref_low_bound (ref
);
5942 max
= array_ref_up_bound (ref
);
5945 || TREE_CODE (min
) != INTEGER_CST
5946 || TREE_CODE (max
) != INTEGER_CST
)
5949 if (tree_int_cst_lt (idx
, min
)
5950 || tree_int_cst_lt (max
, idx
))
5956 /* Return true if T (assumed to be a DECL) is a global variable. */
5959 is_global_var (tree t
)
5961 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
5964 /* Return true if T (assumed to be a DECL) must be assigned a memory
5968 needs_to_live_in_memory (tree t
)
5970 return (TREE_ADDRESSABLE (t
)
5971 || is_global_var (t
)
5972 || (TREE_CODE (t
) == RESULT_DECL
5973 && aggregate_value_p (t
, current_function_decl
)));
5976 /* There are situations in which a language considers record types
5977 compatible which have different field lists. Decide if two fields
5978 are compatible. It is assumed that the parent records are compatible. */
5981 fields_compatible_p (tree f1
, tree f2
)
5983 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
5984 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
5987 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
5988 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
5991 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
5997 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
6000 find_compatible_field (tree record
, tree orig_field
)
6004 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
6005 if (TREE_CODE (f
) == FIELD_DECL
6006 && fields_compatible_p (f
, orig_field
))
6009 /* ??? Why isn't this on the main fields list? */
6010 f
= TYPE_VFIELD (record
);
6011 if (f
&& TREE_CODE (f
) == FIELD_DECL
6012 && fields_compatible_p (f
, orig_field
))
6015 /* ??? We should abort here, but Java appears to do Bad Things
6016 with inherited fields. */
6020 /* Return value of a constant X. */
6023 int_cst_value (tree x
)
6025 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
6026 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
6027 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
6029 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
6032 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
6034 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
6039 /* Returns the greatest common divisor of A and B, which must be
6043 tree_fold_gcd (tree a
, tree b
)
6046 tree type
= TREE_TYPE (a
);
6048 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
6049 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
6051 if (integer_zerop (a
))
6054 if (integer_zerop (b
))
6057 if (tree_int_cst_sgn (a
) == -1)
6058 a
= fold (build2 (MULT_EXPR
, type
, a
,
6059 convert (type
, integer_minus_one_node
)));
6061 if (tree_int_cst_sgn (b
) == -1)
6062 b
= fold (build2 (MULT_EXPR
, type
, b
,
6063 convert (type
, integer_minus_one_node
)));
6067 a_mod_b
= fold (build2 (FLOOR_MOD_EXPR
, type
, a
, b
));
6069 if (!TREE_INT_CST_LOW (a_mod_b
)
6070 && !TREE_INT_CST_HIGH (a_mod_b
))
6078 /* Returns unsigned variant of TYPE. */
6081 unsigned_type_for (tree type
)
6083 return lang_hooks
.types
.unsigned_type (type
);
6086 /* Returns signed variant of TYPE. */
6089 signed_type_for (tree type
)
6091 return lang_hooks
.types
.signed_type (type
);
6094 /* Returns the largest value obtainable by casting something in INNER type to
6098 upper_bound_in_type (tree outer
, tree inner
)
6100 unsigned HOST_WIDE_INT lo
, hi
;
6101 unsigned bits
= TYPE_PRECISION (inner
);
6103 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6105 /* Zero extending in these cases. */
6106 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6109 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6110 >> (HOST_BITS_PER_WIDE_INT
- bits
);
6114 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6115 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
);
6116 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6121 /* Sign extending in these cases. */
6122 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6125 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6126 >> (HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6130 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6131 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6132 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6136 return fold_convert (outer
,
6137 build_int_cst_wide (inner
, lo
, hi
));
6140 /* Returns the smallest value obtainable by casting something in INNER type to
6144 lower_bound_in_type (tree outer
, tree inner
)
6146 unsigned HOST_WIDE_INT lo
, hi
;
6147 unsigned bits
= TYPE_PRECISION (inner
);
6149 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6151 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
6153 hi
= ~(unsigned HOST_WIDE_INT
) 0;
6154 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1);
6158 hi
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- HOST_BITS_PER_WIDE_INT
- 1);
6162 return fold_convert (outer
,
6163 build_int_cst_wide (inner
, lo
, hi
));
6166 /* Return nonzero if two operands that are suitable for PHI nodes are
6167 necessarily equal. Specifically, both ARG0 and ARG1 must be either
6168 SSA_NAME or invariant. Note that this is strictly an optimization.
6169 That is, callers of this function can directly call operand_equal_p
6170 and get the same result, only slower. */
6173 operand_equal_for_phi_arg_p (tree arg0
, tree arg1
)
6177 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
6179 return operand_equal_p (arg0
, arg1
, 0);
6182 #include "gt-tree.h"