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, 2005 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
22 /* This file contains the low level primitives for operating on tree nodes,
23 including allocation, list operations, interning of identifiers,
24 construction of data type nodes and statement nodes,
25 and construction of type conversion nodes. It also contains
26 tables index by tree code that describe how to take apart
29 It is intended to be language-independent, but occasionally
30 calls language-dependent routines defined (for C) in typecheck.c. */
34 #include "coretypes.h"
47 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
54 /* Each tree code class has an associated string representation.
55 These must correspond to the tree_code_class entries. */
57 const char *const tree_code_class_strings
[] =
71 /* obstack.[ch] explicitly declined to prototype this. */
72 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
74 #ifdef GATHER_STATISTICS
75 /* Statistics-gathering stuff. */
77 int tree_node_counts
[(int) all_kinds
];
78 int tree_node_sizes
[(int) all_kinds
];
80 /* Keep in sync with tree.h:enum tree_node_kind. */
81 static const char * const tree_node_kind_names
[] = {
100 #endif /* GATHER_STATISTICS */
102 /* Unique id for next decl created. */
103 static GTY(()) int next_decl_uid
;
104 /* Unique id for next type created. */
105 static GTY(()) int next_type_uid
= 1;
107 /* Since we cannot rehash a type after it is in the table, we have to
108 keep the hash code. */
110 struct type_hash
GTY(())
116 /* Initial size of the hash table (rounded to next prime). */
117 #define TYPE_HASH_INITIAL_SIZE 1000
119 /* Now here is the hash table. When recording a type, it is added to
120 the slot whose index is the hash code. Note that the hash table is
121 used for several kinds of types (function types, array types and
122 array index range types, for now). While all these live in the
123 same table, they are completely independent, and the hash code is
124 computed differently for each of these. */
126 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
127 htab_t type_hash_table
;
129 /* Hash table and temporary node for larger integer const values. */
130 static GTY (()) tree int_cst_node
;
131 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
132 htab_t int_cst_hash_table
;
134 static void set_type_quals (tree
, int);
135 static int type_hash_eq (const void *, const void *);
136 static hashval_t
type_hash_hash (const void *);
137 static hashval_t
int_cst_hash_hash (const void *);
138 static int int_cst_hash_eq (const void *, const void *);
139 static void print_type_hash_statistics (void);
140 static tree
make_vector_type (tree
, int, enum machine_mode
);
141 static int type_hash_marked_p (const void *);
142 static unsigned int type_hash_list (tree
, hashval_t
);
143 static unsigned int attribute_hash_list (tree
, hashval_t
);
145 tree global_trees
[TI_MAX
];
146 tree integer_types
[itk_none
];
153 /* Initialize the hash table of types. */
154 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
156 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
157 int_cst_hash_eq
, NULL
);
158 int_cst_node
= make_node (INTEGER_CST
);
162 /* The name of the object as the assembler will see it (but before any
163 translations made by ASM_OUTPUT_LABELREF). Often this is the same
164 as DECL_NAME. It is an IDENTIFIER_NODE. */
166 decl_assembler_name (tree decl
)
168 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
169 lang_hooks
.set_decl_assembler_name (decl
);
170 return DECL_CHECK (decl
)->decl
.assembler_name
;
173 /* Compute the number of bytes occupied by a tree with code CODE.
174 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
175 codes, which are of variable length. */
177 tree_code_size (enum tree_code code
)
179 switch (TREE_CODE_CLASS (code
))
181 case tcc_declaration
: /* A decl node */
182 return sizeof (struct tree_decl
);
184 case tcc_type
: /* a type node */
185 return sizeof (struct tree_type
);
187 case tcc_reference
: /* a reference */
188 case tcc_expression
: /* an expression */
189 case tcc_statement
: /* an expression with side effects */
190 case tcc_comparison
: /* a comparison expression */
191 case tcc_unary
: /* a unary arithmetic expression */
192 case tcc_binary
: /* a binary arithmetic expression */
193 return (sizeof (struct tree_exp
)
194 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
196 case tcc_constant
: /* a constant */
199 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
200 case REAL_CST
: return sizeof (struct tree_real_cst
);
201 case COMPLEX_CST
: return sizeof (struct tree_complex
);
202 case VECTOR_CST
: return sizeof (struct tree_vector
);
203 case STRING_CST
: gcc_unreachable ();
205 return lang_hooks
.tree_size (code
);
208 case tcc_exceptional
: /* something random, like an identifier. */
211 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
212 case TREE_LIST
: return sizeof (struct tree_list
);
215 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
218 case PHI_NODE
: gcc_unreachable ();
220 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
222 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
223 case BLOCK
: return sizeof (struct tree_block
);
224 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
227 return lang_hooks
.tree_size (code
);
235 /* Compute the number of bytes occupied by NODE. This routine only
236 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
238 tree_size (tree node
)
240 enum tree_code code
= TREE_CODE (node
);
244 return (sizeof (struct tree_phi_node
)
245 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
248 return (offsetof (struct tree_binfo
, base_binfos
)
249 + VEC_embedded_size (tree
, BINFO_N_BASE_BINFOS (node
)));
252 return (sizeof (struct tree_vec
)
253 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
256 return sizeof (struct tree_string
) + TREE_STRING_LENGTH (node
) - 1;
259 return tree_code_size (code
);
263 /* Return a newly allocated node of code CODE. For decl and type
264 nodes, some other fields are initialized. The rest of the node is
265 initialized to zero. This function cannot be used for PHI_NODE or
266 TREE_VEC nodes, which is enforced by asserts in tree_code_size.
268 Achoo! I got a code in the node. */
271 make_node_stat (enum tree_code code MEM_STAT_DECL
)
274 enum tree_code_class type
= TREE_CODE_CLASS (code
);
275 size_t length
= tree_code_size (code
);
276 #ifdef GATHER_STATISTICS
281 case tcc_declaration
: /* A decl node */
285 case tcc_type
: /* a type node */
289 case tcc_statement
: /* an expression with side effects */
293 case tcc_reference
: /* a reference */
297 case tcc_expression
: /* an expression */
298 case tcc_comparison
: /* a comparison expression */
299 case tcc_unary
: /* a unary arithmetic expression */
300 case tcc_binary
: /* a binary arithmetic expression */
304 case tcc_constant
: /* a constant */
308 case tcc_exceptional
: /* something random, like an identifier. */
311 case IDENTIFIER_NODE
:
328 kind
= ssa_name_kind
;
345 tree_node_counts
[(int) kind
]++;
346 tree_node_sizes
[(int) kind
] += length
;
349 if (code
== IDENTIFIER_NODE
)
350 t
= ggc_alloc_zone_pass_stat (length
, &tree_id_zone
);
352 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
354 memset (t
, 0, length
);
356 TREE_SET_CODE (t
, code
);
361 TREE_SIDE_EFFECTS (t
) = 1;
364 case tcc_declaration
:
365 if (code
!= FUNCTION_DECL
)
367 DECL_USER_ALIGN (t
) = 0;
368 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
369 DECL_SOURCE_LOCATION (t
) = input_location
;
370 DECL_UID (t
) = next_decl_uid
++;
372 /* We have not yet computed the alias set for this declaration. */
373 DECL_POINTER_ALIAS_SET (t
) = -1;
377 TYPE_UID (t
) = next_type_uid
++;
378 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
379 TYPE_USER_ALIGN (t
) = 0;
380 TYPE_MAIN_VARIANT (t
) = t
;
382 /* Default to no attributes for type, but let target change that. */
383 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
384 targetm
.set_default_type_attributes (t
);
386 /* We have not yet computed the alias set for this type. */
387 TYPE_ALIAS_SET (t
) = -1;
391 TREE_CONSTANT (t
) = 1;
392 TREE_INVARIANT (t
) = 1;
401 case PREDECREMENT_EXPR
:
402 case PREINCREMENT_EXPR
:
403 case POSTDECREMENT_EXPR
:
404 case POSTINCREMENT_EXPR
:
405 /* All of these have side-effects, no matter what their
407 TREE_SIDE_EFFECTS (t
) = 1;
416 /* Other classes need no special treatment. */
423 /* Return a new node with the same contents as NODE except that its
424 TREE_CHAIN is zero and it has a fresh uid. */
427 copy_node_stat (tree node MEM_STAT_DECL
)
430 enum tree_code code
= TREE_CODE (node
);
433 gcc_assert (code
!= STATEMENT_LIST
);
435 length
= tree_size (node
);
436 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
437 memcpy (t
, node
, length
);
440 TREE_ASM_WRITTEN (t
) = 0;
441 TREE_VISITED (t
) = 0;
444 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
445 DECL_UID (t
) = next_decl_uid
++;
446 else if (TREE_CODE_CLASS (code
) == tcc_type
)
448 TYPE_UID (t
) = next_type_uid
++;
449 /* The following is so that the debug code for
450 the copy is different from the original type.
451 The two statements usually duplicate each other
452 (because they clear fields of the same union),
453 but the optimizer should catch that. */
454 TYPE_SYMTAB_POINTER (t
) = 0;
455 TYPE_SYMTAB_ADDRESS (t
) = 0;
457 /* Do not copy the values cache. */
458 if (TYPE_CACHED_VALUES_P(t
))
460 TYPE_CACHED_VALUES_P (t
) = 0;
461 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
468 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
469 For example, this can copy a list made of TREE_LIST nodes. */
472 copy_list (tree list
)
480 head
= prev
= copy_node (list
);
481 next
= TREE_CHAIN (list
);
484 TREE_CHAIN (prev
) = copy_node (next
);
485 prev
= TREE_CHAIN (prev
);
486 next
= TREE_CHAIN (next
);
492 /* Create an INT_CST node with a LOW value sign extended. */
495 build_int_cst (tree type
, HOST_WIDE_INT low
)
497 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
500 /* Create an INT_CST node with a LOW value zero extended. */
503 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
505 return build_int_cst_wide (type
, low
, 0);
508 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
509 if it is negative. This function is similar to build_int_cst, but
510 the extra bits outside of the type precision are cleared. Constants
511 with these extra bits may confuse the fold so that it detects overflows
512 even in cases when they do not occur, and in general should be avoided.
513 We cannot however make this a default behavior of build_int_cst without
514 more intrusive changes, since there are parts of gcc that rely on the extra
515 precision of the integer constants. */
518 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
520 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
521 unsigned HOST_WIDE_INT hi
, mask
;
527 type
= integer_type_node
;
529 bits
= TYPE_PRECISION (type
);
530 signed_p
= !TYPE_UNSIGNED (type
);
532 if (bits
>= HOST_BITS_PER_WIDE_INT
)
533 negative
= (low
< 0);
536 /* If the sign bit is inside precision of LOW, use it to determine
537 the sign of the constant. */
538 negative
= ((val
>> (bits
- 1)) & 1) != 0;
540 /* Mask out the bits outside of the precision of the constant. */
541 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
543 if (signed_p
&& negative
)
549 /* Determine the high bits. */
550 hi
= (negative
? ~(unsigned HOST_WIDE_INT
) 0 : 0);
552 /* For unsigned type we need to mask out the bits outside of the type
556 if (bits
<= HOST_BITS_PER_WIDE_INT
)
560 bits
-= HOST_BITS_PER_WIDE_INT
;
561 mask
= (((unsigned HOST_WIDE_INT
) 2) << (bits
- 1)) - 1;
566 return build_int_cst_wide (type
, val
, hi
);
569 /* These are the hash table functions for the hash table of INTEGER_CST
570 nodes of a sizetype. */
572 /* Return the hash code code X, an INTEGER_CST. */
575 int_cst_hash_hash (const void *x
)
579 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
580 ^ htab_hash_pointer (TREE_TYPE (t
)));
583 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
584 is the same as that given by *Y, which is the same. */
587 int_cst_hash_eq (const void *x
, const void *y
)
592 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
593 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
594 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
597 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
598 integer_type_node is used. The returned node is always shared.
599 For small integers we use a per-type vector cache, for larger ones
600 we use a single hash table. */
603 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
610 type
= integer_type_node
;
612 switch (TREE_CODE (type
))
616 /* Cache NULL pointer. */
625 /* Cache false or true. */
634 if (TYPE_UNSIGNED (type
))
637 limit
= INTEGER_SHARE_LIMIT
;
638 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
644 limit
= INTEGER_SHARE_LIMIT
+ 1;
645 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
647 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
657 /* Look for it in the type's vector of small shared ints. */
658 if (!TYPE_CACHED_VALUES_P (type
))
660 TYPE_CACHED_VALUES_P (type
) = 1;
661 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
664 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
667 /* Make sure no one is clobbering the shared constant. */
668 gcc_assert (TREE_TYPE (t
) == type
);
669 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
670 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
674 /* Create a new shared int. */
675 t
= make_node (INTEGER_CST
);
677 TREE_INT_CST_LOW (t
) = low
;
678 TREE_INT_CST_HIGH (t
) = hi
;
679 TREE_TYPE (t
) = type
;
681 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
686 /* Use the cache of larger shared ints. */
689 TREE_INT_CST_LOW (int_cst_node
) = low
;
690 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
691 TREE_TYPE (int_cst_node
) = type
;
693 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
697 /* Insert this one into the hash table. */
700 /* Make a new node for next time round. */
701 int_cst_node
= make_node (INTEGER_CST
);
708 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
709 and the rest are zeros. */
712 build_low_bits_mask (tree type
, unsigned bits
)
714 unsigned HOST_WIDE_INT low
;
716 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
718 gcc_assert (bits
<= TYPE_PRECISION (type
));
720 if (bits
== TYPE_PRECISION (type
)
721 && !TYPE_UNSIGNED (type
))
723 /* Sign extended all-ones mask. */
727 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
729 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
734 bits
-= HOST_BITS_PER_WIDE_INT
;
736 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
739 return build_int_cst_wide (type
, low
, high
);
742 /* Checks that X is integer constant that can be expressed in (unsigned)
743 HOST_WIDE_INT without loss of precision. */
746 cst_and_fits_in_hwi (tree x
)
748 if (TREE_CODE (x
) != INTEGER_CST
)
751 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
754 return (TREE_INT_CST_HIGH (x
) == 0
755 || TREE_INT_CST_HIGH (x
) == -1);
758 /* Return a new VECTOR_CST node whose type is TYPE and whose values
759 are in a list pointed by VALS. */
762 build_vector (tree type
, tree vals
)
764 tree v
= make_node (VECTOR_CST
);
765 int over1
= 0, over2
= 0;
768 TREE_VECTOR_CST_ELTS (v
) = vals
;
769 TREE_TYPE (v
) = type
;
771 /* Iterate through elements and check for overflow. */
772 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
774 tree value
= TREE_VALUE (link
);
776 over1
|= TREE_OVERFLOW (value
);
777 over2
|= TREE_CONSTANT_OVERFLOW (value
);
780 TREE_OVERFLOW (v
) = over1
;
781 TREE_CONSTANT_OVERFLOW (v
) = over2
;
786 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
787 are in a list pointed to by VALS. */
789 build_constructor (tree type
, tree vals
)
791 tree c
= make_node (CONSTRUCTOR
);
792 TREE_TYPE (c
) = type
;
793 CONSTRUCTOR_ELTS (c
) = vals
;
795 /* ??? May not be necessary. Mirrors what build does. */
798 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
799 TREE_READONLY (c
) = TREE_READONLY (vals
);
800 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
801 TREE_INVARIANT (c
) = TREE_INVARIANT (vals
);
807 /* Return a new REAL_CST node whose type is TYPE and value is D. */
810 build_real (tree type
, REAL_VALUE_TYPE d
)
816 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
817 Consider doing it via real_convert now. */
819 v
= make_node (REAL_CST
);
820 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
821 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
823 TREE_TYPE (v
) = type
;
824 TREE_REAL_CST_PTR (v
) = dp
;
825 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
829 /* Return a new REAL_CST node whose type is TYPE
830 and whose value is the integer value of the INTEGER_CST node I. */
833 real_value_from_int_cst (tree type
, tree i
)
837 /* Clear all bits of the real value type so that we can later do
838 bitwise comparisons to see if two values are the same. */
839 memset (&d
, 0, sizeof d
);
841 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
842 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
843 TYPE_UNSIGNED (TREE_TYPE (i
)));
847 /* Given a tree representing an integer constant I, return a tree
848 representing the same value as a floating-point constant of type TYPE. */
851 build_real_from_int_cst (tree type
, tree i
)
854 int overflow
= TREE_OVERFLOW (i
);
856 v
= build_real (type
, real_value_from_int_cst (type
, i
));
858 TREE_OVERFLOW (v
) |= overflow
;
859 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
863 /* Return a newly constructed STRING_CST node whose value is
864 the LEN characters at STR.
865 The TREE_TYPE is not initialized. */
868 build_string (int len
, const char *str
)
873 length
= len
+ sizeof (struct tree_string
);
875 #ifdef GATHER_STATISTICS
876 tree_node_counts
[(int) c_kind
]++;
877 tree_node_sizes
[(int) c_kind
] += length
;
880 s
= ggc_alloc_tree (length
);
882 memset (s
, 0, sizeof (struct tree_common
));
883 TREE_SET_CODE (s
, STRING_CST
);
884 TREE_STRING_LENGTH (s
) = len
;
885 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
886 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
891 /* Return a newly constructed COMPLEX_CST node whose value is
892 specified by the real and imaginary parts REAL and IMAG.
893 Both REAL and IMAG should be constant nodes. TYPE, if specified,
894 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
897 build_complex (tree type
, tree real
, tree imag
)
899 tree t
= make_node (COMPLEX_CST
);
901 TREE_REALPART (t
) = real
;
902 TREE_IMAGPART (t
) = imag
;
903 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
904 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
905 TREE_CONSTANT_OVERFLOW (t
)
906 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
910 /* Build a BINFO with LEN language slots. */
913 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
916 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
917 + VEC_embedded_size (tree
, base_binfos
));
919 #ifdef GATHER_STATISTICS
920 tree_node_counts
[(int) binfo_kind
]++;
921 tree_node_sizes
[(int) binfo_kind
] += length
;
924 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
926 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
928 TREE_SET_CODE (t
, TREE_BINFO
);
930 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
936 /* Build a newly constructed TREE_VEC node of length LEN. */
939 make_tree_vec_stat (int len MEM_STAT_DECL
)
942 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
944 #ifdef GATHER_STATISTICS
945 tree_node_counts
[(int) vec_kind
]++;
946 tree_node_sizes
[(int) vec_kind
] += length
;
949 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
951 memset (t
, 0, length
);
953 TREE_SET_CODE (t
, TREE_VEC
);
954 TREE_VEC_LENGTH (t
) = len
;
959 /* Return 1 if EXPR is the integer constant zero or a complex constant
963 integer_zerop (tree expr
)
967 return ((TREE_CODE (expr
) == INTEGER_CST
968 && ! TREE_CONSTANT_OVERFLOW (expr
)
969 && TREE_INT_CST_LOW (expr
) == 0
970 && TREE_INT_CST_HIGH (expr
) == 0)
971 || (TREE_CODE (expr
) == COMPLEX_CST
972 && integer_zerop (TREE_REALPART (expr
))
973 && integer_zerop (TREE_IMAGPART (expr
))));
976 /* Return 1 if EXPR is the integer constant one or the corresponding
980 integer_onep (tree expr
)
984 return ((TREE_CODE (expr
) == INTEGER_CST
985 && ! TREE_CONSTANT_OVERFLOW (expr
)
986 && TREE_INT_CST_LOW (expr
) == 1
987 && TREE_INT_CST_HIGH (expr
) == 0)
988 || (TREE_CODE (expr
) == COMPLEX_CST
989 && integer_onep (TREE_REALPART (expr
))
990 && integer_zerop (TREE_IMAGPART (expr
))));
993 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
994 it contains. Likewise for the corresponding complex constant. */
997 integer_all_onesp (tree expr
)
1004 if (TREE_CODE (expr
) == COMPLEX_CST
1005 && integer_all_onesp (TREE_REALPART (expr
))
1006 && integer_zerop (TREE_IMAGPART (expr
)))
1009 else if (TREE_CODE (expr
) != INTEGER_CST
1010 || TREE_CONSTANT_OVERFLOW (expr
))
1013 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1015 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1016 && TREE_INT_CST_HIGH (expr
) == -1);
1018 /* Note that using TYPE_PRECISION here is wrong. We care about the
1019 actual bits, not the (arbitrary) range of the type. */
1020 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1021 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1023 HOST_WIDE_INT high_value
;
1026 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1028 /* Can not handle precisions greater than twice the host int size. */
1029 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1030 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1031 /* Shifting by the host word size is undefined according to the ANSI
1032 standard, so we must handle this as a special case. */
1035 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1037 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1038 && TREE_INT_CST_HIGH (expr
) == high_value
);
1041 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1044 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1048 integer_pow2p (tree expr
)
1051 HOST_WIDE_INT high
, low
;
1055 if (TREE_CODE (expr
) == COMPLEX_CST
1056 && integer_pow2p (TREE_REALPART (expr
))
1057 && integer_zerop (TREE_IMAGPART (expr
)))
1060 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1063 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1064 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1065 high
= TREE_INT_CST_HIGH (expr
);
1066 low
= TREE_INT_CST_LOW (expr
);
1068 /* First clear all bits that are beyond the type's precision in case
1069 we've been sign extended. */
1071 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1073 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1074 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1078 if (prec
< HOST_BITS_PER_WIDE_INT
)
1079 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1082 if (high
== 0 && low
== 0)
1085 return ((high
== 0 && (low
& (low
- 1)) == 0)
1086 || (low
== 0 && (high
& (high
- 1)) == 0));
1089 /* Return 1 if EXPR is an integer constant other than zero or a
1090 complex constant other than zero. */
1093 integer_nonzerop (tree expr
)
1097 return ((TREE_CODE (expr
) == INTEGER_CST
1098 && ! TREE_CONSTANT_OVERFLOW (expr
)
1099 && (TREE_INT_CST_LOW (expr
) != 0
1100 || TREE_INT_CST_HIGH (expr
) != 0))
1101 || (TREE_CODE (expr
) == COMPLEX_CST
1102 && (integer_nonzerop (TREE_REALPART (expr
))
1103 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1106 /* Return the power of two represented by a tree node known to be a
1110 tree_log2 (tree expr
)
1113 HOST_WIDE_INT high
, low
;
1117 if (TREE_CODE (expr
) == COMPLEX_CST
)
1118 return tree_log2 (TREE_REALPART (expr
));
1120 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1121 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1123 high
= TREE_INT_CST_HIGH (expr
);
1124 low
= TREE_INT_CST_LOW (expr
);
1126 /* First clear all bits that are beyond the type's precision in case
1127 we've been sign extended. */
1129 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1131 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1132 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1136 if (prec
< HOST_BITS_PER_WIDE_INT
)
1137 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1140 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1141 : exact_log2 (low
));
1144 /* Similar, but return the largest integer Y such that 2 ** Y is less
1145 than or equal to EXPR. */
1148 tree_floor_log2 (tree expr
)
1151 HOST_WIDE_INT high
, low
;
1155 if (TREE_CODE (expr
) == COMPLEX_CST
)
1156 return tree_log2 (TREE_REALPART (expr
));
1158 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1159 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1161 high
= TREE_INT_CST_HIGH (expr
);
1162 low
= TREE_INT_CST_LOW (expr
);
1164 /* First clear all bits that are beyond the type's precision in case
1165 we've been sign extended. Ignore if type's precision hasn't been set
1166 since what we are doing is setting it. */
1168 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1170 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1171 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1175 if (prec
< HOST_BITS_PER_WIDE_INT
)
1176 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1179 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1180 : floor_log2 (low
));
1183 /* Return 1 if EXPR is the real constant zero. */
1186 real_zerop (tree expr
)
1190 return ((TREE_CODE (expr
) == REAL_CST
1191 && ! TREE_CONSTANT_OVERFLOW (expr
)
1192 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1193 || (TREE_CODE (expr
) == COMPLEX_CST
1194 && real_zerop (TREE_REALPART (expr
))
1195 && real_zerop (TREE_IMAGPART (expr
))));
1198 /* Return 1 if EXPR is the real constant one in real or complex form. */
1201 real_onep (tree expr
)
1205 return ((TREE_CODE (expr
) == REAL_CST
1206 && ! TREE_CONSTANT_OVERFLOW (expr
)
1207 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1208 || (TREE_CODE (expr
) == COMPLEX_CST
1209 && real_onep (TREE_REALPART (expr
))
1210 && real_zerop (TREE_IMAGPART (expr
))));
1213 /* Return 1 if EXPR is the real constant two. */
1216 real_twop (tree expr
)
1220 return ((TREE_CODE (expr
) == REAL_CST
1221 && ! TREE_CONSTANT_OVERFLOW (expr
)
1222 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1223 || (TREE_CODE (expr
) == COMPLEX_CST
1224 && real_twop (TREE_REALPART (expr
))
1225 && real_zerop (TREE_IMAGPART (expr
))));
1228 /* Return 1 if EXPR is the real constant minus one. */
1231 real_minus_onep (tree expr
)
1235 return ((TREE_CODE (expr
) == REAL_CST
1236 && ! TREE_CONSTANT_OVERFLOW (expr
)
1237 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1238 || (TREE_CODE (expr
) == COMPLEX_CST
1239 && real_minus_onep (TREE_REALPART (expr
))
1240 && real_zerop (TREE_IMAGPART (expr
))));
1243 /* Nonzero if EXP is a constant or a cast of a constant. */
1246 really_constant_p (tree exp
)
1248 /* This is not quite the same as STRIP_NOPS. It does more. */
1249 while (TREE_CODE (exp
) == NOP_EXPR
1250 || TREE_CODE (exp
) == CONVERT_EXPR
1251 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1252 exp
= TREE_OPERAND (exp
, 0);
1253 return TREE_CONSTANT (exp
);
1256 /* Return first list element whose TREE_VALUE is ELEM.
1257 Return 0 if ELEM is not in LIST. */
1260 value_member (tree elem
, tree list
)
1264 if (elem
== TREE_VALUE (list
))
1266 list
= TREE_CHAIN (list
);
1271 /* Return first list element whose TREE_PURPOSE is ELEM.
1272 Return 0 if ELEM is not in LIST. */
1275 purpose_member (tree elem
, tree list
)
1279 if (elem
== TREE_PURPOSE (list
))
1281 list
= TREE_CHAIN (list
);
1286 /* Return nonzero if ELEM is part of the chain CHAIN. */
1289 chain_member (tree elem
, tree chain
)
1295 chain
= TREE_CHAIN (chain
);
1301 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1302 We expect a null pointer to mark the end of the chain.
1303 This is the Lisp primitive `length'. */
1306 list_length (tree t
)
1309 #ifdef ENABLE_TREE_CHECKING
1317 #ifdef ENABLE_TREE_CHECKING
1320 gcc_assert (p
!= q
);
1328 /* Returns the number of FIELD_DECLs in TYPE. */
1331 fields_length (tree type
)
1333 tree t
= TYPE_FIELDS (type
);
1336 for (; t
; t
= TREE_CHAIN (t
))
1337 if (TREE_CODE (t
) == FIELD_DECL
)
1343 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1344 by modifying the last node in chain 1 to point to chain 2.
1345 This is the Lisp primitive `nconc'. */
1348 chainon (tree op1
, tree op2
)
1357 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1359 TREE_CHAIN (t1
) = op2
;
1361 #ifdef ENABLE_TREE_CHECKING
1364 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1365 gcc_assert (t2
!= t1
);
1372 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1375 tree_last (tree chain
)
1379 while ((next
= TREE_CHAIN (chain
)))
1384 /* Reverse the order of elements in the chain T,
1385 and return the new head of the chain (old last element). */
1390 tree prev
= 0, decl
, next
;
1391 for (decl
= t
; decl
; decl
= next
)
1393 next
= TREE_CHAIN (decl
);
1394 TREE_CHAIN (decl
) = prev
;
1400 /* Return a newly created TREE_LIST node whose
1401 purpose and value fields are PARM and VALUE. */
1404 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1406 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1407 TREE_PURPOSE (t
) = parm
;
1408 TREE_VALUE (t
) = value
;
1412 /* Return a newly created TREE_LIST node whose
1413 purpose and value fields are PURPOSE and VALUE
1414 and whose TREE_CHAIN is CHAIN. */
1417 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1421 node
= ggc_alloc_zone_pass_stat (sizeof (struct tree_list
), &tree_zone
);
1423 memset (node
, 0, sizeof (struct tree_common
));
1425 #ifdef GATHER_STATISTICS
1426 tree_node_counts
[(int) x_kind
]++;
1427 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1430 TREE_SET_CODE (node
, TREE_LIST
);
1431 TREE_CHAIN (node
) = chain
;
1432 TREE_PURPOSE (node
) = purpose
;
1433 TREE_VALUE (node
) = value
;
1438 /* Return the size nominally occupied by an object of type TYPE
1439 when it resides in memory. The value is measured in units of bytes,
1440 and its data type is that normally used for type sizes
1441 (which is the first type created by make_signed_type or
1442 make_unsigned_type). */
1445 size_in_bytes (tree type
)
1449 if (type
== error_mark_node
)
1450 return integer_zero_node
;
1452 type
= TYPE_MAIN_VARIANT (type
);
1453 t
= TYPE_SIZE_UNIT (type
);
1457 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1458 return size_zero_node
;
1461 if (TREE_CODE (t
) == INTEGER_CST
)
1462 t
= force_fit_type (t
, 0, false, false);
1467 /* Return the size of TYPE (in bytes) as a wide integer
1468 or return -1 if the size can vary or is larger than an integer. */
1471 int_size_in_bytes (tree type
)
1475 if (type
== error_mark_node
)
1478 type
= TYPE_MAIN_VARIANT (type
);
1479 t
= TYPE_SIZE_UNIT (type
);
1481 || TREE_CODE (t
) != INTEGER_CST
1482 || TREE_OVERFLOW (t
)
1483 || TREE_INT_CST_HIGH (t
) != 0
1484 /* If the result would appear negative, it's too big to represent. */
1485 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1488 return TREE_INT_CST_LOW (t
);
1491 /* Return the bit position of FIELD, in bits from the start of the record.
1492 This is a tree of type bitsizetype. */
1495 bit_position (tree field
)
1497 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1498 DECL_FIELD_BIT_OFFSET (field
));
1501 /* Likewise, but return as an integer. It must be representable in
1502 that way (since it could be a signed value, we don't have the
1503 option of returning -1 like int_size_in_byte can. */
1506 int_bit_position (tree field
)
1508 return tree_low_cst (bit_position (field
), 0);
1511 /* Return the byte position of FIELD, in bytes from the start of the record.
1512 This is a tree of type sizetype. */
1515 byte_position (tree field
)
1517 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1518 DECL_FIELD_BIT_OFFSET (field
));
1521 /* Likewise, but return as an integer. It must be representable in
1522 that way (since it could be a signed value, we don't have the
1523 option of returning -1 like int_size_in_byte can. */
1526 int_byte_position (tree field
)
1528 return tree_low_cst (byte_position (field
), 0);
1531 /* Return the strictest alignment, in bits, that T is known to have. */
1536 unsigned int align0
, align1
;
1538 switch (TREE_CODE (t
))
1540 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1541 /* If we have conversions, we know that the alignment of the
1542 object must meet each of the alignments of the types. */
1543 align0
= expr_align (TREE_OPERAND (t
, 0));
1544 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1545 return MAX (align0
, align1
);
1547 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1548 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1549 case CLEANUP_POINT_EXPR
:
1550 /* These don't change the alignment of an object. */
1551 return expr_align (TREE_OPERAND (t
, 0));
1554 /* The best we can do is say that the alignment is the least aligned
1556 align0
= expr_align (TREE_OPERAND (t
, 1));
1557 align1
= expr_align (TREE_OPERAND (t
, 2));
1558 return MIN (align0
, align1
);
1560 case LABEL_DECL
: case CONST_DECL
:
1561 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1562 if (DECL_ALIGN (t
) != 0)
1563 return DECL_ALIGN (t
);
1567 return FUNCTION_BOUNDARY
;
1573 /* Otherwise take the alignment from that of the type. */
1574 return TYPE_ALIGN (TREE_TYPE (t
));
1577 /* Return, as a tree node, the number of elements for TYPE (which is an
1578 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1581 array_type_nelts (tree type
)
1583 tree index_type
, min
, max
;
1585 /* If they did it with unspecified bounds, then we should have already
1586 given an error about it before we got here. */
1587 if (! TYPE_DOMAIN (type
))
1588 return error_mark_node
;
1590 index_type
= TYPE_DOMAIN (type
);
1591 min
= TYPE_MIN_VALUE (index_type
);
1592 max
= TYPE_MAX_VALUE (index_type
);
1594 return (integer_zerop (min
)
1596 : fold (build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1599 /* If arg is static -- a reference to an object in static storage -- then
1600 return the object. This is not the same as the C meaning of `static'.
1601 If arg isn't static, return NULL. */
1606 switch (TREE_CODE (arg
))
1609 /* Nested functions are static, even though taking their address will
1610 involve a trampoline as we unnest the nested function and create
1611 the trampoline on the tree level. */
1615 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1616 && ! DECL_THREAD_LOCAL (arg
)
1617 && ! DECL_NON_ADDR_CONST_P (arg
)
1621 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1625 return TREE_STATIC (arg
) ? arg
: NULL
;
1632 /* If the thing being referenced is not a field, then it is
1633 something language specific. */
1634 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1635 return (*lang_hooks
.staticp
) (arg
);
1637 /* If we are referencing a bitfield, we can't evaluate an
1638 ADDR_EXPR at compile time and so it isn't a constant. */
1639 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1642 return staticp (TREE_OPERAND (arg
, 0));
1647 case MISALIGNED_INDIRECT_REF
:
1648 case ALIGN_INDIRECT_REF
:
1650 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
1653 case ARRAY_RANGE_REF
:
1654 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1655 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1656 return staticp (TREE_OPERAND (arg
, 0));
1661 if ((unsigned int) TREE_CODE (arg
)
1662 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1663 return lang_hooks
.staticp (arg
);
1669 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1670 Do this to any expression which may be used in more than one place,
1671 but must be evaluated only once.
1673 Normally, expand_expr would reevaluate the expression each time.
1674 Calling save_expr produces something that is evaluated and recorded
1675 the first time expand_expr is called on it. Subsequent calls to
1676 expand_expr just reuse the recorded value.
1678 The call to expand_expr that generates code that actually computes
1679 the value is the first call *at compile time*. Subsequent calls
1680 *at compile time* generate code to use the saved value.
1681 This produces correct result provided that *at run time* control
1682 always flows through the insns made by the first expand_expr
1683 before reaching the other places where the save_expr was evaluated.
1684 You, the caller of save_expr, must make sure this is so.
1686 Constants, and certain read-only nodes, are returned with no
1687 SAVE_EXPR because that is safe. Expressions containing placeholders
1688 are not touched; see tree.def for an explanation of what these
1692 save_expr (tree expr
)
1694 tree t
= fold (expr
);
1697 /* If the tree evaluates to a constant, then we don't want to hide that
1698 fact (i.e. this allows further folding, and direct checks for constants).
1699 However, a read-only object that has side effects cannot be bypassed.
1700 Since it is no problem to reevaluate literals, we just return the
1702 inner
= skip_simple_arithmetic (t
);
1704 if (TREE_INVARIANT (inner
)
1705 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1706 || TREE_CODE (inner
) == SAVE_EXPR
1707 || TREE_CODE (inner
) == ERROR_MARK
)
1710 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1711 it means that the size or offset of some field of an object depends on
1712 the value within another field.
1714 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1715 and some variable since it would then need to be both evaluated once and
1716 evaluated more than once. Front-ends must assure this case cannot
1717 happen by surrounding any such subexpressions in their own SAVE_EXPR
1718 and forcing evaluation at the proper time. */
1719 if (contains_placeholder_p (inner
))
1722 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
1724 /* This expression might be placed ahead of a jump to ensure that the
1725 value was computed on both sides of the jump. So make sure it isn't
1726 eliminated as dead. */
1727 TREE_SIDE_EFFECTS (t
) = 1;
1728 TREE_INVARIANT (t
) = 1;
1732 /* Look inside EXPR and into any simple arithmetic operations. Return
1733 the innermost non-arithmetic node. */
1736 skip_simple_arithmetic (tree expr
)
1740 /* We don't care about whether this can be used as an lvalue in this
1742 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1743 expr
= TREE_OPERAND (expr
, 0);
1745 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1746 a constant, it will be more efficient to not make another SAVE_EXPR since
1747 it will allow better simplification and GCSE will be able to merge the
1748 computations if they actually occur. */
1752 if (UNARY_CLASS_P (inner
))
1753 inner
= TREE_OPERAND (inner
, 0);
1754 else if (BINARY_CLASS_P (inner
))
1756 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
1757 inner
= TREE_OPERAND (inner
, 0);
1758 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
1759 inner
= TREE_OPERAND (inner
, 1);
1770 /* Return which tree structure is used by T. */
1772 enum tree_node_structure_enum
1773 tree_node_structure (tree t
)
1775 enum tree_code code
= TREE_CODE (t
);
1777 switch (TREE_CODE_CLASS (code
))
1779 case tcc_declaration
:
1784 case tcc_comparison
:
1787 case tcc_expression
:
1790 default: /* tcc_constant and tcc_exceptional */
1795 /* tcc_constant cases. */
1796 case INTEGER_CST
: return TS_INT_CST
;
1797 case REAL_CST
: return TS_REAL_CST
;
1798 case COMPLEX_CST
: return TS_COMPLEX
;
1799 case VECTOR_CST
: return TS_VECTOR
;
1800 case STRING_CST
: return TS_STRING
;
1801 /* tcc_exceptional cases. */
1802 case ERROR_MARK
: return TS_COMMON
;
1803 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1804 case TREE_LIST
: return TS_LIST
;
1805 case TREE_VEC
: return TS_VEC
;
1806 case PHI_NODE
: return TS_PHI_NODE
;
1807 case SSA_NAME
: return TS_SSA_NAME
;
1808 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1809 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
1810 case BLOCK
: return TS_BLOCK
;
1811 case TREE_BINFO
: return TS_BINFO
;
1812 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
1819 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1820 or offset that depends on a field within a record. */
1823 contains_placeholder_p (tree exp
)
1825 enum tree_code code
;
1830 code
= TREE_CODE (exp
);
1831 if (code
== PLACEHOLDER_EXPR
)
1834 switch (TREE_CODE_CLASS (code
))
1837 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1838 position computations since they will be converted into a
1839 WITH_RECORD_EXPR involving the reference, which will assume
1840 here will be valid. */
1841 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1843 case tcc_exceptional
:
1844 if (code
== TREE_LIST
)
1845 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
1846 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
1851 case tcc_comparison
:
1852 case tcc_expression
:
1856 /* Ignoring the first operand isn't quite right, but works best. */
1857 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1860 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1861 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
1862 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
1868 switch (TREE_CODE_LENGTH (code
))
1871 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1873 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1874 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
1885 /* Return true if any part of the computation of TYPE involves a
1886 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
1887 (for QUAL_UNION_TYPE) and field positions. */
1890 type_contains_placeholder_1 (tree type
)
1892 /* If the size contains a placeholder or the parent type (component type in
1893 the case of arrays) type involves a placeholder, this type does. */
1894 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1895 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
1896 || (TREE_TYPE (type
) != 0
1897 && type_contains_placeholder_p (TREE_TYPE (type
))))
1900 /* Now do type-specific checks. Note that the last part of the check above
1901 greatly limits what we have to do below. */
1902 switch (TREE_CODE (type
))
1911 case REFERENCE_TYPE
:
1919 /* Here we just check the bounds. */
1920 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
1921 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
1924 /* We're already checked the component type (TREE_TYPE), so just check
1926 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
1930 case QUAL_UNION_TYPE
:
1934 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1935 if (TREE_CODE (field
) == FIELD_DECL
1936 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
1937 || (TREE_CODE (type
) == QUAL_UNION_TYPE
1938 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
1939 || type_contains_placeholder_p (TREE_TYPE (field
))))
1951 type_contains_placeholder_p (tree type
)
1955 /* If the contains_placeholder_bits field has been initialized,
1956 then we know the answer. */
1957 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
1958 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
1960 /* Indicate that we've seen this type node, and the answer is false.
1961 This is what we want to return if we run into recursion via fields. */
1962 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
1964 /* Compute the real value. */
1965 result
= type_contains_placeholder_1 (type
);
1967 /* Store the real value. */
1968 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
1973 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1974 return a tree with all occurrences of references to F in a
1975 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1976 contains only arithmetic expressions or a CALL_EXPR with a
1977 PLACEHOLDER_EXPR occurring only in its arglist. */
1980 substitute_in_expr (tree exp
, tree f
, tree r
)
1982 enum tree_code code
= TREE_CODE (exp
);
1987 /* We handle TREE_LIST and COMPONENT_REF separately. */
1988 if (code
== TREE_LIST
)
1990 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
1991 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
1992 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1995 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1997 else if (code
== COMPONENT_REF
)
1999 /* If this expression is getting a value from a PLACEHOLDER_EXPR
2000 and it is the right field, replace it with R. */
2001 for (inner
= TREE_OPERAND (exp
, 0);
2002 REFERENCE_CLASS_P (inner
);
2003 inner
= TREE_OPERAND (inner
, 0))
2005 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2006 && TREE_OPERAND (exp
, 1) == f
)
2009 /* If this expression hasn't been completed let, leave it alone. */
2010 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2013 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2014 if (op0
== TREE_OPERAND (exp
, 0))
2017 new = fold (build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2018 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
));
2021 switch (TREE_CODE_CLASS (code
))
2024 case tcc_declaration
:
2027 case tcc_exceptional
:
2030 case tcc_comparison
:
2031 case tcc_expression
:
2033 switch (TREE_CODE_LENGTH (code
))
2039 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2040 if (op0
== TREE_OPERAND (exp
, 0))
2043 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2047 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2048 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2050 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2053 new = fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2057 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2058 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2059 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2061 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2062 && op2
== TREE_OPERAND (exp
, 2))
2065 new = fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2077 TREE_READONLY (new) = TREE_READONLY (exp
);
2081 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2082 for it within OBJ, a tree that is an object or a chain of references. */
2085 substitute_placeholder_in_expr (tree exp
, tree obj
)
2087 enum tree_code code
= TREE_CODE (exp
);
2088 tree op0
, op1
, op2
, op3
;
2090 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2091 in the chain of OBJ. */
2092 if (code
== PLACEHOLDER_EXPR
)
2094 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2097 for (elt
= obj
; elt
!= 0;
2098 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2099 || TREE_CODE (elt
) == COND_EXPR
)
2100 ? TREE_OPERAND (elt
, 1)
2101 : (REFERENCE_CLASS_P (elt
)
2102 || UNARY_CLASS_P (elt
)
2103 || BINARY_CLASS_P (elt
)
2104 || EXPRESSION_CLASS_P (elt
))
2105 ? TREE_OPERAND (elt
, 0) : 0))
2106 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2109 for (elt
= obj
; elt
!= 0;
2110 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2111 || TREE_CODE (elt
) == COND_EXPR
)
2112 ? TREE_OPERAND (elt
, 1)
2113 : (REFERENCE_CLASS_P (elt
)
2114 || UNARY_CLASS_P (elt
)
2115 || BINARY_CLASS_P (elt
)
2116 || EXPRESSION_CLASS_P (elt
))
2117 ? TREE_OPERAND (elt
, 0) : 0))
2118 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2119 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2121 return fold (build1 (INDIRECT_REF
, need_type
, elt
));
2123 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2124 survives until RTL generation, there will be an error. */
2128 /* TREE_LIST is special because we need to look at TREE_VALUE
2129 and TREE_CHAIN, not TREE_OPERANDS. */
2130 else if (code
== TREE_LIST
)
2132 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2133 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2134 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2137 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2140 switch (TREE_CODE_CLASS (code
))
2143 case tcc_declaration
:
2146 case tcc_exceptional
:
2149 case tcc_comparison
:
2150 case tcc_expression
:
2153 switch (TREE_CODE_LENGTH (code
))
2159 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2160 if (op0
== TREE_OPERAND (exp
, 0))
2163 return fold (build1 (code
, TREE_TYPE (exp
), op0
));
2166 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2167 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2169 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2172 return fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2175 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2176 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2177 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2179 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2180 && op2
== TREE_OPERAND (exp
, 2))
2183 return fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2186 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2187 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2188 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2189 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2191 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2192 && op2
== TREE_OPERAND (exp
, 2)
2193 && op3
== TREE_OPERAND (exp
, 3))
2196 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2208 /* Stabilize a reference so that we can use it any number of times
2209 without causing its operands to be evaluated more than once.
2210 Returns the stabilized reference. This works by means of save_expr,
2211 so see the caveats in the comments about save_expr.
2213 Also allows conversion expressions whose operands are references.
2214 Any other kind of expression is returned unchanged. */
2217 stabilize_reference (tree ref
)
2220 enum tree_code code
= TREE_CODE (ref
);
2227 /* No action is needed in this case. */
2233 case FIX_TRUNC_EXPR
:
2234 case FIX_FLOOR_EXPR
:
2235 case FIX_ROUND_EXPR
:
2237 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2241 result
= build_nt (INDIRECT_REF
,
2242 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2246 result
= build_nt (COMPONENT_REF
,
2247 stabilize_reference (TREE_OPERAND (ref
, 0)),
2248 TREE_OPERAND (ref
, 1), NULL_TREE
);
2252 result
= build_nt (BIT_FIELD_REF
,
2253 stabilize_reference (TREE_OPERAND (ref
, 0)),
2254 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2255 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2259 result
= build_nt (ARRAY_REF
,
2260 stabilize_reference (TREE_OPERAND (ref
, 0)),
2261 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2262 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2265 case ARRAY_RANGE_REF
:
2266 result
= build_nt (ARRAY_RANGE_REF
,
2267 stabilize_reference (TREE_OPERAND (ref
, 0)),
2268 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2269 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2273 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2274 it wouldn't be ignored. This matters when dealing with
2276 return stabilize_reference_1 (ref
);
2278 /* If arg isn't a kind of lvalue we recognize, make no change.
2279 Caller should recognize the error for an invalid lvalue. */
2284 return error_mark_node
;
2287 TREE_TYPE (result
) = TREE_TYPE (ref
);
2288 TREE_READONLY (result
) = TREE_READONLY (ref
);
2289 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2290 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2295 /* Subroutine of stabilize_reference; this is called for subtrees of
2296 references. Any expression with side-effects must be put in a SAVE_EXPR
2297 to ensure that it is only evaluated once.
2299 We don't put SAVE_EXPR nodes around everything, because assigning very
2300 simple expressions to temporaries causes us to miss good opportunities
2301 for optimizations. Among other things, the opportunity to fold in the
2302 addition of a constant into an addressing mode often gets lost, e.g.
2303 "y[i+1] += x;". In general, we take the approach that we should not make
2304 an assignment unless we are forced into it - i.e., that any non-side effect
2305 operator should be allowed, and that cse should take care of coalescing
2306 multiple utterances of the same expression should that prove fruitful. */
2309 stabilize_reference_1 (tree e
)
2312 enum tree_code code
= TREE_CODE (e
);
2314 /* We cannot ignore const expressions because it might be a reference
2315 to a const array but whose index contains side-effects. But we can
2316 ignore things that are actual constant or that already have been
2317 handled by this function. */
2319 if (TREE_INVARIANT (e
))
2322 switch (TREE_CODE_CLASS (code
))
2324 case tcc_exceptional
:
2326 case tcc_declaration
:
2327 case tcc_comparison
:
2329 case tcc_expression
:
2331 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2332 so that it will only be evaluated once. */
2333 /* The reference (r) and comparison (<) classes could be handled as
2334 below, but it is generally faster to only evaluate them once. */
2335 if (TREE_SIDE_EFFECTS (e
))
2336 return save_expr (e
);
2340 /* Constants need no processing. In fact, we should never reach
2345 /* Division is slow and tends to be compiled with jumps,
2346 especially the division by powers of 2 that is often
2347 found inside of an array reference. So do it just once. */
2348 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2349 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2350 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2351 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2352 return save_expr (e
);
2353 /* Recursively stabilize each operand. */
2354 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2355 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2359 /* Recursively stabilize each operand. */
2360 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2367 TREE_TYPE (result
) = TREE_TYPE (e
);
2368 TREE_READONLY (result
) = TREE_READONLY (e
);
2369 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2370 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2371 TREE_INVARIANT (result
) = 1;
2376 /* Low-level constructors for expressions. */
2378 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2379 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2382 recompute_tree_invarant_for_addr_expr (tree t
)
2385 bool tc
= true, ti
= true, se
= false;
2387 /* We started out assuming this address is both invariant and constant, but
2388 does not have side effects. Now go down any handled components and see if
2389 any of them involve offsets that are either non-constant or non-invariant.
2390 Also check for side-effects.
2392 ??? Note that this code makes no attempt to deal with the case where
2393 taking the address of something causes a copy due to misalignment. */
2395 #define UPDATE_TITCSE(NODE) \
2396 do { tree _node = (NODE); \
2397 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2398 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2399 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2401 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2402 node
= TREE_OPERAND (node
, 0))
2404 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2405 array reference (probably made temporarily by the G++ front end),
2406 so ignore all the operands. */
2407 if ((TREE_CODE (node
) == ARRAY_REF
2408 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2409 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2411 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2412 if (TREE_OPERAND (node
, 2))
2413 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2414 if (TREE_OPERAND (node
, 3))
2415 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2417 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2418 FIELD_DECL, apparently. The G++ front end can put something else
2419 there, at least temporarily. */
2420 else if (TREE_CODE (node
) == COMPONENT_REF
2421 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2423 if (TREE_OPERAND (node
, 2))
2424 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2426 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2427 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2430 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2431 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2432 invariant and constant if the decl is static. It's also invariant if it's
2433 a decl in the current function. Taking the address of a volatile variable
2434 is not volatile. If it's a constant, the address is both invariant and
2435 constant. Otherwise it's neither. */
2436 if (TREE_CODE (node
) == INDIRECT_REF
)
2437 UPDATE_TITCSE (TREE_OPERAND (node
, 0));
2438 else if (DECL_P (node
))
2442 else if (decl_function_context (node
) == current_function_decl
2443 /* Addresses of thread-local variables are invariant. */
2444 || (TREE_CODE (node
) == VAR_DECL
&& DECL_THREAD_LOCAL (node
)))
2449 else if (CONSTANT_CLASS_P (node
))
2454 se
|= TREE_SIDE_EFFECTS (node
);
2457 TREE_CONSTANT (t
) = tc
;
2458 TREE_INVARIANT (t
) = ti
;
2459 TREE_SIDE_EFFECTS (t
) = se
;
2460 #undef UPDATE_TITCSE
2463 /* Build an expression of code CODE, data type TYPE, and operands as
2464 specified. Expressions and reference nodes can be created this way.
2465 Constants, decls, types and misc nodes cannot be.
2467 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2468 enough for all extant tree codes. These functions can be called
2469 directly (preferably!), but can also be obtained via GCC preprocessor
2470 magic within the build macro. */
2473 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2477 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2479 t
= make_node_stat (code PASS_MEM_STAT
);
2486 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2488 int length
= sizeof (struct tree_exp
);
2489 #ifdef GATHER_STATISTICS
2490 tree_node_kind kind
;
2494 #ifdef GATHER_STATISTICS
2495 switch (TREE_CODE_CLASS (code
))
2497 case tcc_statement
: /* an expression with side effects */
2500 case tcc_reference
: /* a reference */
2508 tree_node_counts
[(int) kind
]++;
2509 tree_node_sizes
[(int) kind
] += length
;
2512 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2514 t
= ggc_alloc_zone_pass_stat (length
, &tree_zone
);
2516 memset (t
, 0, sizeof (struct tree_common
));
2518 TREE_SET_CODE (t
, code
);
2520 TREE_TYPE (t
) = type
;
2521 #ifdef USE_MAPPED_LOCATION
2522 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2524 SET_EXPR_LOCUS (t
, NULL
);
2526 TREE_COMPLEXITY (t
) = 0;
2527 TREE_OPERAND (t
, 0) = node
;
2528 TREE_BLOCK (t
) = NULL_TREE
;
2529 if (node
&& !TYPE_P (node
))
2531 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2532 TREE_READONLY (t
) = TREE_READONLY (node
);
2535 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2536 TREE_SIDE_EFFECTS (t
) = 1;
2540 /* All of these have side-effects, no matter what their
2542 TREE_SIDE_EFFECTS (t
) = 1;
2543 TREE_READONLY (t
) = 0;
2546 case MISALIGNED_INDIRECT_REF
:
2547 case ALIGN_INDIRECT_REF
:
2549 /* Whether a dereference is readonly has nothing to do with whether
2550 its operand is readonly. */
2551 TREE_READONLY (t
) = 0;
2556 recompute_tree_invarant_for_addr_expr (t
);
2560 if (TREE_CODE_CLASS (code
) == tcc_unary
2561 && node
&& !TYPE_P (node
)
2562 && TREE_CONSTANT (node
))
2563 TREE_CONSTANT (t
) = 1;
2564 if (TREE_CODE_CLASS (code
) == tcc_unary
2565 && node
&& TREE_INVARIANT (node
))
2566 TREE_INVARIANT (t
) = 1;
2567 if (TREE_CODE_CLASS (code
) == tcc_reference
2568 && node
&& TREE_THIS_VOLATILE (node
))
2569 TREE_THIS_VOLATILE (t
) = 1;
2576 #define PROCESS_ARG(N) \
2578 TREE_OPERAND (t, N) = arg##N; \
2579 if (arg##N &&!TYPE_P (arg##N)) \
2581 if (TREE_SIDE_EFFECTS (arg##N)) \
2583 if (!TREE_READONLY (arg##N)) \
2585 if (!TREE_CONSTANT (arg##N)) \
2587 if (!TREE_INVARIANT (arg##N)) \
2593 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
2595 bool constant
, read_only
, side_effects
, invariant
;
2598 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
2600 t
= make_node_stat (code PASS_MEM_STAT
);
2603 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
2604 result based on those same flags for the arguments. But if the
2605 arguments aren't really even `tree' expressions, we shouldn't be trying
2608 /* Expressions without side effects may be constant if their
2609 arguments are as well. */
2610 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
2611 || TREE_CODE_CLASS (code
) == tcc_binary
);
2613 side_effects
= TREE_SIDE_EFFECTS (t
);
2614 invariant
= constant
;
2619 TREE_READONLY (t
) = read_only
;
2620 TREE_CONSTANT (t
) = constant
;
2621 TREE_INVARIANT (t
) = invariant
;
2622 TREE_SIDE_EFFECTS (t
) = side_effects
;
2623 TREE_THIS_VOLATILE (t
)
2624 = (TREE_CODE_CLASS (code
) == tcc_reference
2625 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2631 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2632 tree arg2 MEM_STAT_DECL
)
2634 bool constant
, read_only
, side_effects
, invariant
;
2637 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
2639 t
= make_node_stat (code PASS_MEM_STAT
);
2642 side_effects
= TREE_SIDE_EFFECTS (t
);
2648 if (code
== CALL_EXPR
&& !side_effects
)
2653 /* Calls have side-effects, except those to const or
2655 i
= call_expr_flags (t
);
2656 if (!(i
& (ECF_CONST
| ECF_PURE
)))
2659 /* And even those have side-effects if their arguments do. */
2660 else for (node
= arg1
; node
; node
= TREE_CHAIN (node
))
2661 if (TREE_SIDE_EFFECTS (TREE_VALUE (node
)))
2668 TREE_SIDE_EFFECTS (t
) = side_effects
;
2669 TREE_THIS_VOLATILE (t
)
2670 = (TREE_CODE_CLASS (code
) == tcc_reference
2671 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2677 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
2678 tree arg2
, tree arg3 MEM_STAT_DECL
)
2680 bool constant
, read_only
, side_effects
, invariant
;
2683 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
2685 t
= make_node_stat (code PASS_MEM_STAT
);
2688 side_effects
= TREE_SIDE_EFFECTS (t
);
2695 TREE_SIDE_EFFECTS (t
) = side_effects
;
2696 TREE_THIS_VOLATILE (t
)
2697 = (TREE_CODE_CLASS (code
) == tcc_reference
2698 && arg0
&& TREE_THIS_VOLATILE (arg0
));
2703 /* Backup definition for non-gcc build compilers. */
2706 (build
) (enum tree_code code
, tree tt
, ...)
2708 tree t
, arg0
, arg1
, arg2
, arg3
;
2709 int length
= TREE_CODE_LENGTH (code
);
2716 t
= build0 (code
, tt
);
2719 arg0
= va_arg (p
, tree
);
2720 t
= build1 (code
, tt
, arg0
);
2723 arg0
= va_arg (p
, tree
);
2724 arg1
= va_arg (p
, tree
);
2725 t
= build2 (code
, tt
, arg0
, arg1
);
2728 arg0
= va_arg (p
, tree
);
2729 arg1
= va_arg (p
, tree
);
2730 arg2
= va_arg (p
, tree
);
2731 t
= build3 (code
, tt
, arg0
, arg1
, arg2
);
2734 arg0
= va_arg (p
, tree
);
2735 arg1
= va_arg (p
, tree
);
2736 arg2
= va_arg (p
, tree
);
2737 arg3
= va_arg (p
, tree
);
2738 t
= build4 (code
, tt
, arg0
, arg1
, arg2
, arg3
);
2748 /* Similar except don't specify the TREE_TYPE
2749 and leave the TREE_SIDE_EFFECTS as 0.
2750 It is permissible for arguments to be null,
2751 or even garbage if their values do not matter. */
2754 build_nt (enum tree_code code
, ...)
2763 t
= make_node (code
);
2764 length
= TREE_CODE_LENGTH (code
);
2766 for (i
= 0; i
< length
; i
++)
2767 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
2773 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
2774 We do NOT enter this node in any sort of symbol table.
2776 layout_decl is used to set up the decl's storage layout.
2777 Other slots are initialized to 0 or null pointers. */
2780 build_decl_stat (enum tree_code code
, tree name
, tree type MEM_STAT_DECL
)
2784 t
= make_node_stat (code PASS_MEM_STAT
);
2786 /* if (type == error_mark_node)
2787 type = integer_type_node; */
2788 /* That is not done, deliberately, so that having error_mark_node
2789 as the type can suppress useless errors in the use of this variable. */
2791 DECL_NAME (t
) = name
;
2792 TREE_TYPE (t
) = type
;
2794 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
2796 else if (code
== FUNCTION_DECL
)
2797 DECL_MODE (t
) = FUNCTION_MODE
;
2799 /* Set default visibility to whatever the user supplied with
2800 visibility_specified depending on #pragma GCC visibility. */
2801 DECL_VISIBILITY (t
) = default_visibility
;
2802 DECL_VISIBILITY_SPECIFIED (t
) = visibility_options
.inpragma
;
2807 /* Builds and returns function declaration with NAME and TYPE. */
2810 build_fn_decl (const char *name
, tree type
)
2812 tree id
= get_identifier (name
);
2813 tree decl
= build_decl (FUNCTION_DECL
, id
, type
);
2815 DECL_EXTERNAL (decl
) = 1;
2816 TREE_PUBLIC (decl
) = 1;
2817 DECL_ARTIFICIAL (decl
) = 1;
2818 TREE_NOTHROW (decl
) = 1;
2824 /* BLOCK nodes are used to represent the structure of binding contours
2825 and declarations, once those contours have been exited and their contents
2826 compiled. This information is used for outputting debugging info. */
2829 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
2831 tree block
= make_node (BLOCK
);
2833 BLOCK_VARS (block
) = vars
;
2834 BLOCK_SUBBLOCKS (block
) = subblocks
;
2835 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2836 BLOCK_CHAIN (block
) = chain
;
2840 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2841 /* ??? gengtype doesn't handle conditionals */
2842 static GTY(()) tree last_annotated_node
;
2845 #ifdef USE_MAPPED_LOCATION
2848 expand_location (source_location loc
)
2850 expanded_location xloc
;
2851 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
2854 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
2855 xloc
.file
= map
->to_file
;
2856 xloc
.line
= SOURCE_LINE (map
, loc
);
2857 xloc
.column
= SOURCE_COLUMN (map
, loc
);
2864 /* Record the exact location where an expression or an identifier were
2868 annotate_with_file_line (tree node
, const char *file
, int line
)
2870 /* Roughly one percent of the calls to this function are to annotate
2871 a node with the same information already attached to that node!
2872 Just return instead of wasting memory. */
2873 if (EXPR_LOCUS (node
)
2874 && (EXPR_FILENAME (node
) == file
2875 || ! strcmp (EXPR_FILENAME (node
), file
))
2876 && EXPR_LINENO (node
) == line
)
2878 last_annotated_node
= node
;
2882 /* In heavily macroized code (such as GCC itself) this single
2883 entry cache can reduce the number of allocations by more
2885 if (last_annotated_node
2886 && EXPR_LOCUS (last_annotated_node
)
2887 && (EXPR_FILENAME (last_annotated_node
) == file
2888 || ! strcmp (EXPR_FILENAME (last_annotated_node
), file
))
2889 && EXPR_LINENO (last_annotated_node
) == line
)
2891 SET_EXPR_LOCUS (node
, EXPR_LOCUS (last_annotated_node
));
2895 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
2896 EXPR_LINENO (node
) = line
;
2897 EXPR_FILENAME (node
) = file
;
2898 last_annotated_node
= node
;
2902 annotate_with_locus (tree node
, location_t locus
)
2904 annotate_with_file_line (node
, locus
.file
, locus
.line
);
2908 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2912 build_decl_attribute_variant (tree ddecl
, tree attribute
)
2914 DECL_ATTRIBUTES (ddecl
) = attribute
;
2918 /* Borrowed from hashtab.c iterative_hash implementation. */
2919 #define mix(a,b,c) \
2921 a -= b; a -= c; a ^= (c>>13); \
2922 b -= c; b -= a; b ^= (a<< 8); \
2923 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2924 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2925 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2926 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2927 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2928 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2929 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2933 /* Produce good hash value combining VAL and VAL2. */
2934 static inline hashval_t
2935 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
2937 /* the golden ratio; an arbitrary value. */
2938 hashval_t a
= 0x9e3779b9;
2944 /* Produce good hash value combining PTR and VAL2. */
2945 static inline hashval_t
2946 iterative_hash_pointer (void *ptr
, hashval_t val2
)
2948 if (sizeof (ptr
) == sizeof (hashval_t
))
2949 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
2952 hashval_t a
= (hashval_t
) (size_t) ptr
;
2953 /* Avoid warnings about shifting of more than the width of the type on
2954 hosts that won't execute this path. */
2956 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
2962 /* Produce good hash value combining VAL and VAL2. */
2963 static inline hashval_t
2964 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
2966 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
2967 return iterative_hash_hashval_t (val
, val2
);
2970 hashval_t a
= (hashval_t
) val
;
2971 /* Avoid warnings about shifting of more than the width of the type on
2972 hosts that won't execute this path. */
2974 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
2976 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
2978 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
2979 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
2986 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2989 Record such modified types already made so we don't make duplicates. */
2992 build_type_attribute_variant (tree ttype
, tree attribute
)
2994 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2996 hashval_t hashcode
= 0;
2998 enum tree_code code
= TREE_CODE (ttype
);
3000 ntype
= copy_node (ttype
);
3002 TYPE_POINTER_TO (ntype
) = 0;
3003 TYPE_REFERENCE_TO (ntype
) = 0;
3004 TYPE_ATTRIBUTES (ntype
) = attribute
;
3006 /* Create a new main variant of TYPE. */
3007 TYPE_MAIN_VARIANT (ntype
) = ntype
;
3008 TYPE_NEXT_VARIANT (ntype
) = 0;
3009 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
3011 hashcode
= iterative_hash_object (code
, hashcode
);
3012 if (TREE_TYPE (ntype
))
3013 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
3015 hashcode
= attribute_hash_list (attribute
, hashcode
);
3017 switch (TREE_CODE (ntype
))
3020 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3023 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3027 hashcode
= iterative_hash_object
3028 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3029 hashcode
= iterative_hash_object
3030 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3034 unsigned int precision
= TYPE_PRECISION (ntype
);
3035 hashcode
= iterative_hash_object (precision
, hashcode
);
3042 ntype
= type_hash_canon (hashcode
, ntype
);
3043 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3050 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3053 We try both `text' and `__text__', ATTR may be either one. */
3054 /* ??? It might be a reasonable simplification to require ATTR to be only
3055 `text'. One might then also require attribute lists to be stored in
3056 their canonicalized form. */
3059 is_attribute_with_length_p (const char *attr
, int attr_len
, tree ident
)
3064 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3067 p
= IDENTIFIER_POINTER (ident
);
3068 ident_len
= IDENTIFIER_LENGTH (ident
);
3070 if (ident_len
== attr_len
3071 && strcmp (attr
, p
) == 0)
3074 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3077 gcc_assert (attr
[1] == '_');
3078 gcc_assert (attr
[attr_len
- 2] == '_');
3079 gcc_assert (attr
[attr_len
- 1] == '_');
3080 gcc_assert (attr
[1] == '_');
3081 if (ident_len
== attr_len
- 4
3082 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3087 if (ident_len
== attr_len
+ 4
3088 && p
[0] == '_' && p
[1] == '_'
3089 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3090 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3097 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3100 We try both `text' and `__text__', ATTR may be either one. */
3103 is_attribute_p (const char *attr
, tree ident
)
3105 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3108 /* Given an attribute name and a list of attributes, return a pointer to the
3109 attribute's list element if the attribute is part of the list, or NULL_TREE
3110 if not found. If the attribute appears more than once, this only
3111 returns the first occurrence; the TREE_CHAIN of the return value should
3112 be passed back in if further occurrences are wanted. */
3115 lookup_attribute (const char *attr_name
, tree list
)
3118 size_t attr_len
= strlen (attr_name
);
3120 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3122 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3123 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3130 /* Return an attribute list that is the union of a1 and a2. */
3133 merge_attributes (tree a1
, tree a2
)
3137 /* Either one unset? Take the set one. */
3139 if ((attributes
= a1
) == 0)
3142 /* One that completely contains the other? Take it. */
3144 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3146 if (attribute_list_contained (a2
, a1
))
3150 /* Pick the longest list, and hang on the other list. */
3152 if (list_length (a1
) < list_length (a2
))
3153 attributes
= a2
, a2
= a1
;
3155 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3158 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3161 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3164 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
3169 a1
= copy_node (a2
);
3170 TREE_CHAIN (a1
) = attributes
;
3179 /* Given types T1 and T2, merge their attributes and return
3183 merge_type_attributes (tree t1
, tree t2
)
3185 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3186 TYPE_ATTRIBUTES (t2
));
3189 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3193 merge_decl_attributes (tree olddecl
, tree newdecl
)
3195 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3196 DECL_ATTRIBUTES (newdecl
));
3199 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3201 /* Specialization of merge_decl_attributes for various Windows targets.
3203 This handles the following situation:
3205 __declspec (dllimport) int foo;
3208 The second instance of `foo' nullifies the dllimport. */
3211 merge_dllimport_decl_attributes (tree old
, tree
new)
3214 int delete_dllimport_p
;
3216 old
= DECL_ATTRIBUTES (old
);
3217 new = DECL_ATTRIBUTES (new);
3219 /* What we need to do here is remove from `old' dllimport if it doesn't
3220 appear in `new'. dllimport behaves like extern: if a declaration is
3221 marked dllimport and a definition appears later, then the object
3222 is not dllimport'd. */
3223 if (lookup_attribute ("dllimport", old
) != NULL_TREE
3224 && lookup_attribute ("dllimport", new) == NULL_TREE
)
3225 delete_dllimport_p
= 1;
3227 delete_dllimport_p
= 0;
3229 a
= merge_attributes (old
, new);
3231 if (delete_dllimport_p
)
3235 /* Scan the list for dllimport and delete it. */
3236 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3238 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3240 if (prev
== NULL_TREE
)
3243 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3252 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3253 struct attribute_spec.handler. */
3256 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3261 /* These attributes may apply to structure and union types being created,
3262 but otherwise should pass to the declaration involved. */
3265 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3266 | (int) ATTR_FLAG_ARRAY_NEXT
))
3268 *no_add_attrs
= true;
3269 return tree_cons (name
, args
, NULL_TREE
);
3271 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3273 warning (0, "%qs attribute ignored", IDENTIFIER_POINTER (name
));
3274 *no_add_attrs
= true;
3280 /* Report error on dllimport ambiguities seen now before they cause
3282 if (is_attribute_p ("dllimport", name
))
3284 /* Like MS, treat definition of dllimported variables and
3285 non-inlined functions on declaration as syntax errors. We
3286 allow the attribute for function definitions if declared
3288 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
)
3289 && !DECL_DECLARED_INLINE_P (node
))
3291 error ("%Jfunction %qD definition is marked dllimport.", node
, node
);
3292 *no_add_attrs
= true;
3295 else if (TREE_CODE (node
) == VAR_DECL
)
3297 if (DECL_INITIAL (node
))
3299 error ("%Jvariable %qD definition is marked dllimport.",
3301 *no_add_attrs
= true;
3304 /* `extern' needn't be specified with dllimport.
3305 Specify `extern' now and hope for the best. Sigh. */
3306 DECL_EXTERNAL (node
) = 1;
3307 /* Also, implicitly give dllimport'd variables declared within
3308 a function global scope, unless declared static. */
3309 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3310 TREE_PUBLIC (node
) = 1;
3314 /* Report error if symbol is not accessible at global scope. */
3315 if (!TREE_PUBLIC (node
)
3316 && (TREE_CODE (node
) == VAR_DECL
3317 || TREE_CODE (node
) == FUNCTION_DECL
))
3319 error ("%Jexternal linkage required for symbol %qD because of "
3320 "%qs attribute.", node
, node
, IDENTIFIER_POINTER (name
));
3321 *no_add_attrs
= true;
3327 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3329 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3330 of the various TYPE_QUAL values. */
3333 set_type_quals (tree type
, int type_quals
)
3335 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3336 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3337 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3340 /* Returns true iff cand is equivalent to base with type_quals. */
3343 check_qualified_type (tree cand
, tree base
, int type_quals
)
3345 return (TYPE_QUALS (cand
) == type_quals
3346 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3347 /* Apparently this is needed for Objective-C. */
3348 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3349 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3350 TYPE_ATTRIBUTES (base
)));
3353 /* Return a version of the TYPE, qualified as indicated by the
3354 TYPE_QUALS, if one exists. If no qualified version exists yet,
3355 return NULL_TREE. */
3358 get_qualified_type (tree type
, int type_quals
)
3362 if (TYPE_QUALS (type
) == type_quals
)
3365 /* Search the chain of variants to see if there is already one there just
3366 like the one we need to have. If so, use that existing one. We must
3367 preserve the TYPE_NAME, since there is code that depends on this. */
3368 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3369 if (check_qualified_type (t
, type
, type_quals
))
3375 /* Like get_qualified_type, but creates the type if it does not
3376 exist. This function never returns NULL_TREE. */
3379 build_qualified_type (tree type
, int type_quals
)
3383 /* See if we already have the appropriate qualified variant. */
3384 t
= get_qualified_type (type
, type_quals
);
3386 /* If not, build it. */
3389 t
= build_variant_type_copy (type
);
3390 set_type_quals (t
, type_quals
);
3396 /* Create a new distinct copy of TYPE. The new type is made its own
3400 build_distinct_type_copy (tree type
)
3402 tree t
= copy_node (type
);
3404 TYPE_POINTER_TO (t
) = 0;
3405 TYPE_REFERENCE_TO (t
) = 0;
3407 /* Make it its own variant. */
3408 TYPE_MAIN_VARIANT (t
) = t
;
3409 TYPE_NEXT_VARIANT (t
) = 0;
3414 /* Create a new variant of TYPE, equivalent but distinct.
3415 This is so the caller can modify it. */
3418 build_variant_type_copy (tree type
)
3420 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3422 t
= build_distinct_type_copy (type
);
3424 /* Add the new type to the chain of variants of TYPE. */
3425 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3426 TYPE_NEXT_VARIANT (m
) = t
;
3427 TYPE_MAIN_VARIANT (t
) = m
;
3432 /* Hashing of types so that we don't make duplicates.
3433 The entry point is `type_hash_canon'. */
3435 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3436 with types in the TREE_VALUE slots), by adding the hash codes
3437 of the individual types. */
3440 type_hash_list (tree list
, hashval_t hashcode
)
3444 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3445 if (TREE_VALUE (tail
) != error_mark_node
)
3446 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
3452 /* These are the Hashtable callback functions. */
3454 /* Returns true iff the types are equivalent. */
3457 type_hash_eq (const void *va
, const void *vb
)
3459 const struct type_hash
*a
= va
, *b
= vb
;
3461 /* First test the things that are the same for all types. */
3462 if (a
->hash
!= b
->hash
3463 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
3464 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
3465 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3466 TYPE_ATTRIBUTES (b
->type
))
3467 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
3468 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
3471 switch (TREE_CODE (a
->type
))
3476 case REFERENCE_TYPE
:
3480 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
3483 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
3484 && !(TYPE_VALUES (a
->type
)
3485 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
3486 && TYPE_VALUES (b
->type
)
3487 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
3488 && type_list_equal (TYPE_VALUES (a
->type
),
3489 TYPE_VALUES (b
->type
))))
3492 /* ... fall through ... */
3498 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3499 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3500 TYPE_MAX_VALUE (b
->type
)))
3501 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3502 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3503 TYPE_MIN_VALUE (b
->type
))));
3506 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
3509 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
3510 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3511 || (TYPE_ARG_TYPES (a
->type
)
3512 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3513 && TYPE_ARG_TYPES (b
->type
)
3514 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3515 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3516 TYPE_ARG_TYPES (b
->type
)))));
3519 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
3523 case QUAL_UNION_TYPE
:
3524 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
3525 || (TYPE_FIELDS (a
->type
)
3526 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
3527 && TYPE_FIELDS (b
->type
)
3528 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
3529 && type_list_equal (TYPE_FIELDS (a
->type
),
3530 TYPE_FIELDS (b
->type
))));
3533 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3534 || (TYPE_ARG_TYPES (a
->type
)
3535 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3536 && TYPE_ARG_TYPES (b
->type
)
3537 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3538 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3539 TYPE_ARG_TYPES (b
->type
))));
3546 /* Return the cached hash value. */
3549 type_hash_hash (const void *item
)
3551 return ((const struct type_hash
*) item
)->hash
;
3554 /* Look in the type hash table for a type isomorphic to TYPE.
3555 If one is found, return it. Otherwise return 0. */
3558 type_hash_lookup (hashval_t hashcode
, tree type
)
3560 struct type_hash
*h
, in
;
3562 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3563 must call that routine before comparing TYPE_ALIGNs. */
3569 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3575 /* Add an entry to the type-hash-table
3576 for a type TYPE whose hash code is HASHCODE. */
3579 type_hash_add (hashval_t hashcode
, tree type
)
3581 struct type_hash
*h
;
3584 h
= ggc_alloc (sizeof (struct type_hash
));
3587 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3588 *(struct type_hash
**) loc
= h
;
3591 /* Given TYPE, and HASHCODE its hash code, return the canonical
3592 object for an identical type if one already exists.
3593 Otherwise, return TYPE, and record it as the canonical object.
3595 To use this function, first create a type of the sort you want.
3596 Then compute its hash code from the fields of the type that
3597 make it different from other similar types.
3598 Then call this function and use the value. */
3601 type_hash_canon (unsigned int hashcode
, tree type
)
3605 /* The hash table only contains main variants, so ensure that's what we're
3607 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
3609 if (!lang_hooks
.types
.hash_types
)
3612 /* See if the type is in the hash table already. If so, return it.
3613 Otherwise, add the type. */
3614 t1
= type_hash_lookup (hashcode
, type
);
3617 #ifdef GATHER_STATISTICS
3618 tree_node_counts
[(int) t_kind
]--;
3619 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3625 type_hash_add (hashcode
, type
);
3630 /* See if the data pointed to by the type hash table is marked. We consider
3631 it marked if the type is marked or if a debug type number or symbol
3632 table entry has been made for the type. This reduces the amount of
3633 debugging output and eliminates that dependency of the debug output on
3634 the number of garbage collections. */
3637 type_hash_marked_p (const void *p
)
3639 tree type
= ((struct type_hash
*) p
)->type
;
3641 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3645 print_type_hash_statistics (void)
3647 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3648 (long) htab_size (type_hash_table
),
3649 (long) htab_elements (type_hash_table
),
3650 htab_collisions (type_hash_table
));
3653 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3654 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3655 by adding the hash codes of the individual attributes. */
3658 attribute_hash_list (tree list
, hashval_t hashcode
)
3662 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3663 /* ??? Do we want to add in TREE_VALUE too? */
3664 hashcode
= iterative_hash_object
3665 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
3669 /* Given two lists of attributes, return true if list l2 is
3670 equivalent to l1. */
3673 attribute_list_equal (tree l1
, tree l2
)
3675 return attribute_list_contained (l1
, l2
)
3676 && attribute_list_contained (l2
, l1
);
3679 /* Given two lists of attributes, return true if list L2 is
3680 completely contained within L1. */
3681 /* ??? This would be faster if attribute names were stored in a canonicalized
3682 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3683 must be used to show these elements are equivalent (which they are). */
3684 /* ??? It's not clear that attributes with arguments will always be handled
3688 attribute_list_contained (tree l1
, tree l2
)
3692 /* First check the obvious, maybe the lists are identical. */
3696 /* Maybe the lists are similar. */
3697 for (t1
= l1
, t2
= l2
;
3699 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3700 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3701 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3703 /* Maybe the lists are equal. */
3704 if (t1
== 0 && t2
== 0)
3707 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3710 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3712 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3715 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3722 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3729 /* Given two lists of types
3730 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3731 return 1 if the lists contain the same types in the same order.
3732 Also, the TREE_PURPOSEs must match. */
3735 type_list_equal (tree l1
, tree l2
)
3739 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3740 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3741 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3742 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3743 && (TREE_TYPE (TREE_PURPOSE (t1
))
3744 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3750 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3751 given by TYPE. If the argument list accepts variable arguments,
3752 then this function counts only the ordinary arguments. */
3755 type_num_arguments (tree type
)
3760 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3761 /* If the function does not take a variable number of arguments,
3762 the last element in the list will have type `void'. */
3763 if (VOID_TYPE_P (TREE_VALUE (t
)))
3771 /* Nonzero if integer constants T1 and T2
3772 represent the same constant value. */
3775 tree_int_cst_equal (tree t1
, tree t2
)
3780 if (t1
== 0 || t2
== 0)
3783 if (TREE_CODE (t1
) == INTEGER_CST
3784 && TREE_CODE (t2
) == INTEGER_CST
3785 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3786 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3792 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3793 The precise way of comparison depends on their data type. */
3796 tree_int_cst_lt (tree t1
, tree t2
)
3801 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
3803 int t1_sgn
= tree_int_cst_sgn (t1
);
3804 int t2_sgn
= tree_int_cst_sgn (t2
);
3806 if (t1_sgn
< t2_sgn
)
3808 else if (t1_sgn
> t2_sgn
)
3810 /* Otherwise, both are non-negative, so we compare them as
3811 unsigned just in case one of them would overflow a signed
3814 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
3815 return INT_CST_LT (t1
, t2
);
3817 return INT_CST_LT_UNSIGNED (t1
, t2
);
3820 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3823 tree_int_cst_compare (tree t1
, tree t2
)
3825 if (tree_int_cst_lt (t1
, t2
))
3827 else if (tree_int_cst_lt (t2
, t1
))
3833 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3834 the host. If POS is zero, the value can be represented in a single
3835 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3836 be represented in a single unsigned HOST_WIDE_INT. */
3839 host_integerp (tree t
, int pos
)
3841 return (TREE_CODE (t
) == INTEGER_CST
3842 && ! TREE_OVERFLOW (t
)
3843 && ((TREE_INT_CST_HIGH (t
) == 0
3844 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3845 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3846 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3847 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
3848 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3851 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3852 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3853 be positive. We must be able to satisfy the above conditions. */
3856 tree_low_cst (tree t
, int pos
)
3858 gcc_assert (host_integerp (t
, pos
));
3859 return TREE_INT_CST_LOW (t
);
3862 /* Return the most significant bit of the integer constant T. */
3865 tree_int_cst_msb (tree t
)
3869 unsigned HOST_WIDE_INT l
;
3871 /* Note that using TYPE_PRECISION here is wrong. We care about the
3872 actual bits, not the (arbitrary) range of the type. */
3873 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3874 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3875 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3876 return (l
& 1) == 1;
3879 /* Return an indication of the sign of the integer constant T.
3880 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3881 Note that -1 will never be returned it T's type is unsigned. */
3884 tree_int_cst_sgn (tree t
)
3886 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3888 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
3890 else if (TREE_INT_CST_HIGH (t
) < 0)
3896 /* Compare two constructor-element-type constants. Return 1 if the lists
3897 are known to be equal; otherwise return 0. */
3900 simple_cst_list_equal (tree l1
, tree l2
)
3902 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3904 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3907 l1
= TREE_CHAIN (l1
);
3908 l2
= TREE_CHAIN (l2
);
3914 /* Return truthvalue of whether T1 is the same tree structure as T2.
3915 Return 1 if they are the same.
3916 Return 0 if they are understandably different.
3917 Return -1 if either contains tree structure not understood by
3921 simple_cst_equal (tree t1
, tree t2
)
3923 enum tree_code code1
, code2
;
3929 if (t1
== 0 || t2
== 0)
3932 code1
= TREE_CODE (t1
);
3933 code2
= TREE_CODE (t2
);
3935 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3937 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3938 || code2
== NON_LVALUE_EXPR
)
3939 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3941 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3944 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3945 || code2
== NON_LVALUE_EXPR
)
3946 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3954 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3955 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3958 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3961 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3962 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3963 TREE_STRING_LENGTH (t1
)));
3966 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1
),
3967 CONSTRUCTOR_ELTS (t2
));
3970 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3973 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3977 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3980 /* Special case: if either target is an unallocated VAR_DECL,
3981 it means that it's going to be unified with whatever the
3982 TARGET_EXPR is really supposed to initialize, so treat it
3983 as being equivalent to anything. */
3984 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3985 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3986 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3987 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3988 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3989 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3992 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3997 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3999 case WITH_CLEANUP_EXPR
:
4000 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4004 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
4007 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
4008 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4022 /* This general rule works for most tree codes. All exceptions should be
4023 handled above. If this is a language-specific tree code, we can't
4024 trust what might be in the operand, so say we don't know
4026 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4029 switch (TREE_CODE_CLASS (code1
))
4033 case tcc_comparison
:
4034 case tcc_expression
:
4038 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
4040 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4052 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4053 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4054 than U, respectively. */
4057 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
4059 if (tree_int_cst_sgn (t
) < 0)
4061 else if (TREE_INT_CST_HIGH (t
) != 0)
4063 else if (TREE_INT_CST_LOW (t
) == u
)
4065 else if (TREE_INT_CST_LOW (t
) < u
)
4071 /* Return true if CODE represents an associative tree code. Otherwise
4074 associative_tree_code (enum tree_code code
)
4093 /* Return true if CODE represents a commutative tree code. Otherwise
4096 commutative_tree_code (enum tree_code code
)
4109 case UNORDERED_EXPR
:
4113 case TRUTH_AND_EXPR
:
4114 case TRUTH_XOR_EXPR
:
4124 /* Generate a hash value for an expression. This can be used iteratively
4125 by passing a previous result as the "val" argument.
4127 This function is intended to produce the same hash for expressions which
4128 would compare equal using operand_equal_p. */
4131 iterative_hash_expr (tree t
, hashval_t val
)
4134 enum tree_code code
;
4138 return iterative_hash_pointer (t
, val
);
4140 code
= TREE_CODE (t
);
4144 /* Alas, constants aren't shared, so we can't rely on pointer
4147 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
4148 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4151 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4153 return iterative_hash_hashval_t (val2
, val
);
4156 return iterative_hash (TREE_STRING_POINTER (t
),
4157 TREE_STRING_LENGTH (t
), val
);
4159 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4160 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4162 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4166 /* we can just compare by pointer. */
4167 return iterative_hash_pointer (t
, val
);
4170 /* A list of expressions, for a CALL_EXPR or as the elements of a
4172 for (; t
; t
= TREE_CHAIN (t
))
4173 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4176 /* When referring to a built-in FUNCTION_DECL, use the
4177 __builtin__ form. Otherwise nodes that compare equal
4178 according to operand_equal_p might get different
4180 if (DECL_BUILT_IN (t
))
4182 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
4186 /* else FALL THROUGH */
4188 class = TREE_CODE_CLASS (code
);
4190 if (class == tcc_declaration
)
4192 /* Otherwise, we can just compare decls by pointer. */
4193 val
= iterative_hash_pointer (t
, val
);
4197 gcc_assert (IS_EXPR_CODE_CLASS (class));
4199 val
= iterative_hash_object (code
, val
);
4201 /* Don't hash the type, that can lead to having nodes which
4202 compare equal according to operand_equal_p, but which
4203 have different hash codes. */
4204 if (code
== NOP_EXPR
4205 || code
== CONVERT_EXPR
4206 || code
== NON_LVALUE_EXPR
)
4208 /* Make sure to include signness in the hash computation. */
4209 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4210 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4213 else if (commutative_tree_code (code
))
4215 /* It's a commutative expression. We want to hash it the same
4216 however it appears. We do this by first hashing both operands
4217 and then rehashing based on the order of their independent
4219 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4220 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4224 t
= one
, one
= two
, two
= t
;
4226 val
= iterative_hash_hashval_t (one
, val
);
4227 val
= iterative_hash_hashval_t (two
, val
);
4230 for (i
= TREE_CODE_LENGTH (code
) - 1; i
>= 0; --i
)
4231 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4238 /* Constructors for pointer, array and function types.
4239 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4240 constructed by language-dependent code, not here.) */
4242 /* Construct, lay out and return the type of pointers to TO_TYPE with
4243 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4244 reference all of memory. If such a type has already been
4245 constructed, reuse it. */
4248 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4253 /* In some cases, languages will have things that aren't a POINTER_TYPE
4254 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4255 In that case, return that type without regard to the rest of our
4258 ??? This is a kludge, but consistent with the way this function has
4259 always operated and there doesn't seem to be a good way to avoid this
4261 if (TYPE_POINTER_TO (to_type
) != 0
4262 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4263 return TYPE_POINTER_TO (to_type
);
4265 /* First, if we already have a type for pointers to TO_TYPE and it's
4266 the proper mode, use it. */
4267 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4268 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4271 t
= make_node (POINTER_TYPE
);
4273 TREE_TYPE (t
) = to_type
;
4274 TYPE_MODE (t
) = mode
;
4275 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4276 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4277 TYPE_POINTER_TO (to_type
) = t
;
4279 /* Lay out the type. This function has many callers that are concerned
4280 with expression-construction, and this simplifies them all. */
4286 /* By default build pointers in ptr_mode. */
4289 build_pointer_type (tree to_type
)
4291 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4294 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4297 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4302 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4303 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4304 In that case, return that type without regard to the rest of our
4307 ??? This is a kludge, but consistent with the way this function has
4308 always operated and there doesn't seem to be a good way to avoid this
4310 if (TYPE_REFERENCE_TO (to_type
) != 0
4311 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4312 return TYPE_REFERENCE_TO (to_type
);
4314 /* First, if we already have a type for pointers to TO_TYPE and it's
4315 the proper mode, use it. */
4316 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4317 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4320 t
= make_node (REFERENCE_TYPE
);
4322 TREE_TYPE (t
) = to_type
;
4323 TYPE_MODE (t
) = mode
;
4324 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4325 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4326 TYPE_REFERENCE_TO (to_type
) = t
;
4334 /* Build the node for the type of references-to-TO_TYPE by default
4338 build_reference_type (tree to_type
)
4340 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4343 /* Build a type that is compatible with t but has no cv quals anywhere
4346 const char *const *const * -> char ***. */
4349 build_type_no_quals (tree t
)
4351 switch (TREE_CODE (t
))
4354 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4356 TYPE_REF_CAN_ALIAS_ALL (t
));
4357 case REFERENCE_TYPE
:
4359 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4361 TYPE_REF_CAN_ALIAS_ALL (t
));
4363 return TYPE_MAIN_VARIANT (t
);
4367 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4368 MAXVAL should be the maximum value in the domain
4369 (one less than the length of the array).
4371 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4372 We don't enforce this limit, that is up to caller (e.g. language front end).
4373 The limit exists because the result is a signed type and we don't handle
4374 sizes that use more than one HOST_WIDE_INT. */
4377 build_index_type (tree maxval
)
4379 tree itype
= make_node (INTEGER_TYPE
);
4381 TREE_TYPE (itype
) = sizetype
;
4382 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4383 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4384 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
4385 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4386 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4387 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4388 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4389 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
4391 if (host_integerp (maxval
, 1))
4392 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
4397 /* Builds a signed or unsigned integer type of precision PRECISION.
4398 Used for C bitfields whose precision does not match that of
4399 built-in target types. */
4401 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
4404 tree itype
= make_node (INTEGER_TYPE
);
4406 TYPE_PRECISION (itype
) = precision
;
4409 fixup_unsigned_type (itype
);
4411 fixup_signed_type (itype
);
4413 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
4414 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
4419 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4420 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4421 low bound LOWVAL and high bound HIGHVAL.
4422 if TYPE==NULL_TREE, sizetype is used. */
4425 build_range_type (tree type
, tree lowval
, tree highval
)
4427 tree itype
= make_node (INTEGER_TYPE
);
4429 TREE_TYPE (itype
) = type
;
4430 if (type
== NULL_TREE
)
4433 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4434 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4436 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4437 TYPE_MODE (itype
) = TYPE_MODE (type
);
4438 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4439 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4440 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4441 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
4443 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
4444 return type_hash_canon (tree_low_cst (highval
, 0)
4445 - tree_low_cst (lowval
, 0),
4451 /* Just like build_index_type, but takes lowval and highval instead
4452 of just highval (maxval). */
4455 build_index_2_type (tree lowval
, tree highval
)
4457 return build_range_type (sizetype
, lowval
, highval
);
4460 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4461 and number of elements specified by the range of values of INDEX_TYPE.
4462 If such a type has already been constructed, reuse it. */
4465 build_array_type (tree elt_type
, tree index_type
)
4468 hashval_t hashcode
= 0;
4470 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4472 error ("arrays of functions are not meaningful");
4473 elt_type
= integer_type_node
;
4476 t
= make_node (ARRAY_TYPE
);
4477 TREE_TYPE (t
) = elt_type
;
4478 TYPE_DOMAIN (t
) = index_type
;
4480 if (index_type
== 0)
4486 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
4487 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
4488 t
= type_hash_canon (hashcode
, t
);
4490 if (!COMPLETE_TYPE_P (t
))
4495 /* Return the TYPE of the elements comprising
4496 the innermost dimension of ARRAY. */
4499 get_inner_array_type (tree array
)
4501 tree type
= TREE_TYPE (array
);
4503 while (TREE_CODE (type
) == ARRAY_TYPE
)
4504 type
= TREE_TYPE (type
);
4509 /* Construct, lay out and return
4510 the type of functions returning type VALUE_TYPE
4511 given arguments of types ARG_TYPES.
4512 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4513 are data type nodes for the arguments of the function.
4514 If such a type has already been constructed, reuse it. */
4517 build_function_type (tree value_type
, tree arg_types
)
4520 hashval_t hashcode
= 0;
4522 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4524 error ("function return type cannot be function");
4525 value_type
= integer_type_node
;
4528 /* Make a node of the sort we want. */
4529 t
= make_node (FUNCTION_TYPE
);
4530 TREE_TYPE (t
) = value_type
;
4531 TYPE_ARG_TYPES (t
) = arg_types
;
4533 /* If we already have such a type, use the old one. */
4534 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
4535 hashcode
= type_hash_list (arg_types
, hashcode
);
4536 t
= type_hash_canon (hashcode
, t
);
4538 if (!COMPLETE_TYPE_P (t
))
4543 /* Build a function type. The RETURN_TYPE is the type returned by the
4544 function. If additional arguments are provided, they are
4545 additional argument types. The list of argument types must always
4546 be terminated by NULL_TREE. */
4549 build_function_type_list (tree return_type
, ...)
4554 va_start (p
, return_type
);
4556 t
= va_arg (p
, tree
);
4557 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
4558 args
= tree_cons (NULL_TREE
, t
, args
);
4560 if (args
== NULL_TREE
)
4561 args
= void_list_node
;
4565 args
= nreverse (args
);
4566 TREE_CHAIN (last
) = void_list_node
;
4568 args
= build_function_type (return_type
, args
);
4574 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4575 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4576 for the method. An implicit additional parameter (of type
4577 pointer-to-BASETYPE) is added to the ARGTYPES. */
4580 build_method_type_directly (tree basetype
,
4588 /* Make a node of the sort we want. */
4589 t
= make_node (METHOD_TYPE
);
4591 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4592 TREE_TYPE (t
) = rettype
;
4593 ptype
= build_pointer_type (basetype
);
4595 /* The actual arglist for this function includes a "hidden" argument
4596 which is "this". Put it into the list of argument types. */
4597 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
4598 TYPE_ARG_TYPES (t
) = argtypes
;
4600 /* If we already have such a type, use the old one. */
4601 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4602 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
4603 hashcode
= type_hash_list (argtypes
, hashcode
);
4604 t
= type_hash_canon (hashcode
, t
);
4606 if (!COMPLETE_TYPE_P (t
))
4612 /* Construct, lay out and return the type of methods belonging to class
4613 BASETYPE and whose arguments and values are described by TYPE.
4614 If that type exists already, reuse it.
4615 TYPE must be a FUNCTION_TYPE node. */
4618 build_method_type (tree basetype
, tree type
)
4620 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
4622 return build_method_type_directly (basetype
,
4624 TYPE_ARG_TYPES (type
));
4627 /* Construct, lay out and return the type of offsets to a value
4628 of type TYPE, within an object of type BASETYPE.
4629 If a suitable offset type exists already, reuse it. */
4632 build_offset_type (tree basetype
, tree type
)
4635 hashval_t hashcode
= 0;
4637 /* Make a node of the sort we want. */
4638 t
= make_node (OFFSET_TYPE
);
4640 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4641 TREE_TYPE (t
) = type
;
4643 /* If we already have such a type, use the old one. */
4644 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4645 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
4646 t
= type_hash_canon (hashcode
, t
);
4648 if (!COMPLETE_TYPE_P (t
))
4654 /* Create a complex type whose components are COMPONENT_TYPE. */
4657 build_complex_type (tree component_type
)
4662 /* Make a node of the sort we want. */
4663 t
= make_node (COMPLEX_TYPE
);
4665 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4667 /* If we already have such a type, use the old one. */
4668 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
4669 t
= type_hash_canon (hashcode
, t
);
4671 if (!COMPLETE_TYPE_P (t
))
4674 /* If we are writing Dwarf2 output we need to create a name,
4675 since complex is a fundamental type. */
4676 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4680 if (component_type
== char_type_node
)
4681 name
= "complex char";
4682 else if (component_type
== signed_char_type_node
)
4683 name
= "complex signed char";
4684 else if (component_type
== unsigned_char_type_node
)
4685 name
= "complex unsigned char";
4686 else if (component_type
== short_integer_type_node
)
4687 name
= "complex short int";
4688 else if (component_type
== short_unsigned_type_node
)
4689 name
= "complex short unsigned int";
4690 else if (component_type
== integer_type_node
)
4691 name
= "complex int";
4692 else if (component_type
== unsigned_type_node
)
4693 name
= "complex unsigned int";
4694 else if (component_type
== long_integer_type_node
)
4695 name
= "complex long int";
4696 else if (component_type
== long_unsigned_type_node
)
4697 name
= "complex long unsigned int";
4698 else if (component_type
== long_long_integer_type_node
)
4699 name
= "complex long long int";
4700 else if (component_type
== long_long_unsigned_type_node
)
4701 name
= "complex long long unsigned int";
4706 TYPE_NAME (t
) = get_identifier (name
);
4709 return build_qualified_type (t
, TYPE_QUALS (component_type
));
4712 /* Return OP, stripped of any conversions to wider types as much as is safe.
4713 Converting the value back to OP's type makes a value equivalent to OP.
4715 If FOR_TYPE is nonzero, we return a value which, if converted to
4716 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4718 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4719 narrowest type that can hold the value, even if they don't exactly fit.
4720 Otherwise, bit-field references are changed to a narrower type
4721 only if they can be fetched directly from memory in that type.
4723 OP must have integer, real or enumeral type. Pointers are not allowed!
4725 There are some cases where the obvious value we could return
4726 would regenerate to OP if converted to OP's type,
4727 but would not extend like OP to wider types.
4728 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4729 For example, if OP is (unsigned short)(signed char)-1,
4730 we avoid returning (signed char)-1 if FOR_TYPE is int,
4731 even though extending that to an unsigned short would regenerate OP,
4732 since the result of extending (signed char)-1 to (int)
4733 is different from (int) OP. */
4736 get_unwidened (tree op
, tree for_type
)
4738 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4739 tree type
= TREE_TYPE (op
);
4741 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4743 = (for_type
!= 0 && for_type
!= type
4744 && final_prec
> TYPE_PRECISION (type
)
4745 && TYPE_UNSIGNED (type
));
4748 while (TREE_CODE (op
) == NOP_EXPR
4749 || TREE_CODE (op
) == CONVERT_EXPR
)
4752 = TYPE_PRECISION (TREE_TYPE (op
))
4753 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4755 /* Truncations are many-one so cannot be removed.
4756 Unless we are later going to truncate down even farther. */
4758 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4761 /* See what's inside this conversion. If we decide to strip it,
4763 op
= TREE_OPERAND (op
, 0);
4765 /* If we have not stripped any zero-extensions (uns is 0),
4766 we can strip any kind of extension.
4767 If we have previously stripped a zero-extension,
4768 only zero-extensions can safely be stripped.
4769 Any extension can be stripped if the bits it would produce
4770 are all going to be discarded later by truncating to FOR_TYPE. */
4774 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4776 /* TYPE_UNSIGNED says whether this is a zero-extension.
4777 Let's avoid computing it if it does not affect WIN
4778 and if UNS will not be needed again. */
4780 || TREE_CODE (op
) == NOP_EXPR
4781 || TREE_CODE (op
) == CONVERT_EXPR
)
4782 && TYPE_UNSIGNED (TREE_TYPE (op
)))
4790 if (TREE_CODE (op
) == COMPONENT_REF
4791 /* Since type_for_size always gives an integer type. */
4792 && TREE_CODE (type
) != REAL_TYPE
4793 /* Don't crash if field not laid out yet. */
4794 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4795 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4797 unsigned int innerprec
4798 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4799 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4800 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4801 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4803 /* We can get this structure field in the narrowest type it fits in.
4804 If FOR_TYPE is 0, do this only for a field that matches the
4805 narrower type exactly and is aligned for it
4806 The resulting extension to its nominal type (a fullword type)
4807 must fit the same conditions as for other extensions. */
4810 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
4811 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4812 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
4814 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4815 TREE_OPERAND (op
, 1), NULL_TREE
);
4816 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4817 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4824 /* Return OP or a simpler expression for a narrower value
4825 which can be sign-extended or zero-extended to give back OP.
4826 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4827 or 0 if the value should be sign-extended. */
4830 get_narrower (tree op
, int *unsignedp_ptr
)
4835 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
4837 while (TREE_CODE (op
) == NOP_EXPR
)
4840 = (TYPE_PRECISION (TREE_TYPE (op
))
4841 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4843 /* Truncations are many-one so cannot be removed. */
4847 /* See what's inside this conversion. If we decide to strip it,
4852 op
= TREE_OPERAND (op
, 0);
4853 /* An extension: the outermost one can be stripped,
4854 but remember whether it is zero or sign extension. */
4856 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4857 /* Otherwise, if a sign extension has been stripped,
4858 only sign extensions can now be stripped;
4859 if a zero extension has been stripped, only zero-extensions. */
4860 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
4864 else /* bitschange == 0 */
4866 /* A change in nominal type can always be stripped, but we must
4867 preserve the unsignedness. */
4869 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4871 op
= TREE_OPERAND (op
, 0);
4872 /* Keep trying to narrow, but don't assign op to win if it
4873 would turn an integral type into something else. */
4874 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
4881 if (TREE_CODE (op
) == COMPONENT_REF
4882 /* Since type_for_size always gives an integer type. */
4883 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4884 /* Ensure field is laid out already. */
4885 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4886 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4888 unsigned HOST_WIDE_INT innerprec
4889 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4890 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4891 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4892 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4894 /* We can get this structure field in a narrower type that fits it,
4895 but the resulting extension to its nominal type (a fullword type)
4896 must satisfy the same conditions as for other extensions.
4898 Do this only for fields that are aligned (not bit-fields),
4899 because when bit-field insns will be used there is no
4900 advantage in doing this. */
4902 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4903 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4904 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
4908 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
4909 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4910 TREE_OPERAND (op
, 1), NULL_TREE
);
4911 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4912 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4915 *unsignedp_ptr
= uns
;
4919 /* Nonzero if integer constant C has a value that is permissible
4920 for type TYPE (an INTEGER_TYPE). */
4923 int_fits_type_p (tree c
, tree type
)
4925 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4926 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4927 bool ok_for_low_bound
, ok_for_high_bound
;
4930 /* If at least one bound of the type is a constant integer, we can check
4931 ourselves and maybe make a decision. If no such decision is possible, but
4932 this type is a subtype, try checking against that. Otherwise, use
4933 force_fit_type, which checks against the precision.
4935 Compute the status for each possibly constant bound, and return if we see
4936 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4937 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4938 for "constant known to fit". */
4940 /* Check if C >= type_low_bound. */
4941 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4943 if (tree_int_cst_lt (c
, type_low_bound
))
4945 ok_for_low_bound
= true;
4948 ok_for_low_bound
= false;
4950 /* Check if c <= type_high_bound. */
4951 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4953 if (tree_int_cst_lt (type_high_bound
, c
))
4955 ok_for_high_bound
= true;
4958 ok_for_high_bound
= false;
4960 /* If the constant fits both bounds, the result is known. */
4961 if (ok_for_low_bound
&& ok_for_high_bound
)
4964 /* Perform some generic filtering which may allow making a decision
4965 even if the bounds are not constant. First, negative integers
4966 never fit in unsigned types, */
4967 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4970 /* Second, narrower types always fit in wider ones. */
4971 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
4974 /* Third, unsigned integers with top bit set never fit signed types. */
4975 if (! TYPE_UNSIGNED (type
)
4976 && TYPE_UNSIGNED (TREE_TYPE (c
))
4977 && tree_int_cst_msb (c
))
4980 /* If we haven't been able to decide at this point, there nothing more we
4981 can check ourselves here. Look at the base type if we have one. */
4982 if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4983 return int_fits_type_p (c
, TREE_TYPE (type
));
4985 /* Or to force_fit_type, if nothing else. */
4986 tmp
= copy_node (c
);
4987 TREE_TYPE (tmp
) = type
;
4988 tmp
= force_fit_type (tmp
, -1, false, false);
4989 return TREE_INT_CST_HIGH (tmp
) == TREE_INT_CST_HIGH (c
)
4990 && TREE_INT_CST_LOW (tmp
) == TREE_INT_CST_LOW (c
);
4993 /* Subprogram of following function. Called by walk_tree.
4995 Return *TP if it is an automatic variable or parameter of the
4996 function passed in as DATA. */
4999 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
5001 tree fn
= (tree
) data
;
5006 else if (DECL_P (*tp
)
5007 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
5013 /* Returns true if T is, contains, or refers to a type with variable
5014 size. If FN is nonzero, only return true if a modifier of the type
5015 or position of FN is a variable or parameter inside FN.
5017 This concept is more general than that of C99 'variably modified types':
5018 in C99, a struct type is never variably modified because a VLA may not
5019 appear as a structure member. However, in GNU C code like:
5021 struct S { int i[f()]; };
5023 is valid, and other languages may define similar constructs. */
5026 variably_modified_type_p (tree type
, tree fn
)
5030 /* Test if T is either variable (if FN is zero) or an expression containing
5031 a variable in FN. */
5032 #define RETURN_TRUE_IF_VAR(T) \
5033 do { tree _t = (T); \
5034 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5035 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5036 return true; } while (0)
5038 if (type
== error_mark_node
)
5041 /* If TYPE itself has variable size, it is variably modified.
5043 We do not yet have a representation of the C99 '[*]' syntax.
5044 When a representation is chosen, this function should be modified
5045 to test for that case as well. */
5046 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
5047 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type
));
5049 switch (TREE_CODE (type
))
5052 case REFERENCE_TYPE
:
5055 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5061 /* If TYPE is a function type, it is variably modified if any of the
5062 parameters or the return type are variably modified. */
5063 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5066 for (t
= TYPE_ARG_TYPES (type
);
5067 t
&& t
!= void_list_node
;
5069 if (variably_modified_type_p (TREE_VALUE (t
), fn
))
5078 /* Scalar types are variably modified if their end points
5080 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
5081 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
5086 case QUAL_UNION_TYPE
:
5087 /* We can't see if any of the field are variably-modified by the
5088 definition we normally use, since that would produce infinite
5089 recursion via pointers. */
5090 /* This is variably modified if some field's type is. */
5091 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5092 if (TREE_CODE (t
) == FIELD_DECL
)
5094 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
5095 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
5096 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
5098 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
5099 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
5107 /* The current language may have other cases to check, but in general,
5108 all other types are not variably modified. */
5109 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
5111 #undef RETURN_TRUE_IF_VAR
5114 /* Given a DECL or TYPE, return the scope in which it was declared, or
5115 NULL_TREE if there is no containing scope. */
5118 get_containing_scope (tree t
)
5120 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
5123 /* Return the innermost context enclosing DECL that is
5124 a FUNCTION_DECL, or zero if none. */
5127 decl_function_context (tree decl
)
5131 if (TREE_CODE (decl
) == ERROR_MARK
)
5134 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5135 where we look up the function at runtime. Such functions always take
5136 a first argument of type 'pointer to real context'.
5138 C++ should really be fixed to use DECL_CONTEXT for the real context,
5139 and use something else for the "virtual context". */
5140 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
5143 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
5145 context
= DECL_CONTEXT (decl
);
5147 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
5149 if (TREE_CODE (context
) == BLOCK
)
5150 context
= BLOCK_SUPERCONTEXT (context
);
5152 context
= get_containing_scope (context
);
5158 /* Return the innermost context enclosing DECL that is
5159 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5160 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5163 decl_type_context (tree decl
)
5165 tree context
= DECL_CONTEXT (decl
);
5168 switch (TREE_CODE (context
))
5170 case NAMESPACE_DECL
:
5171 case TRANSLATION_UNIT_DECL
:
5176 case QUAL_UNION_TYPE
:
5181 context
= DECL_CONTEXT (context
);
5185 context
= BLOCK_SUPERCONTEXT (context
);
5195 /* CALL is a CALL_EXPR. Return the declaration for the function
5196 called, or NULL_TREE if the called function cannot be
5200 get_callee_fndecl (tree call
)
5204 /* It's invalid to call this function with anything but a
5206 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5208 /* The first operand to the CALL is the address of the function
5210 addr
= TREE_OPERAND (call
, 0);
5214 /* If this is a readonly function pointer, extract its initial value. */
5215 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5216 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5217 && DECL_INITIAL (addr
))
5218 addr
= DECL_INITIAL (addr
);
5220 /* If the address is just `&f' for some function `f', then we know
5221 that `f' is being called. */
5222 if (TREE_CODE (addr
) == ADDR_EXPR
5223 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5224 return TREE_OPERAND (addr
, 0);
5226 /* We couldn't figure out what was being called. Maybe the front
5227 end has some idea. */
5228 return lang_hooks
.lang_get_callee_fndecl (call
);
5231 /* Print debugging information about tree nodes generated during the compile,
5232 and any language-specific information. */
5235 dump_tree_statistics (void)
5237 #ifdef GATHER_STATISTICS
5239 int total_nodes
, total_bytes
;
5242 fprintf (stderr
, "\n??? tree nodes created\n\n");
5243 #ifdef GATHER_STATISTICS
5244 fprintf (stderr
, "Kind Nodes Bytes\n");
5245 fprintf (stderr
, "---------------------------------------\n");
5246 total_nodes
= total_bytes
= 0;
5247 for (i
= 0; i
< (int) all_kinds
; i
++)
5249 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5250 tree_node_counts
[i
], tree_node_sizes
[i
]);
5251 total_nodes
+= tree_node_counts
[i
];
5252 total_bytes
+= tree_node_sizes
[i
];
5254 fprintf (stderr
, "---------------------------------------\n");
5255 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5256 fprintf (stderr
, "---------------------------------------\n");
5257 ssanames_print_statistics ();
5258 phinodes_print_statistics ();
5260 fprintf (stderr
, "(No per-node statistics)\n");
5262 print_type_hash_statistics ();
5263 lang_hooks
.print_statistics ();
5266 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5268 /* Generate a crc32 of a string. */
5271 crc32_string (unsigned chksum
, const char *string
)
5275 unsigned value
= *string
<< 24;
5278 for (ix
= 8; ix
--; value
<<= 1)
5282 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5291 /* P is a string that will be used in a symbol. Mask out any characters
5292 that are not valid in that context. */
5295 clean_symbol_name (char *p
)
5299 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5302 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5309 /* Generate a name for a function unique to this translation unit.
5310 TYPE is some string to identify the purpose of this function to the
5311 linker or collect2. */
5314 get_file_function_name_long (const char *type
)
5320 if (first_global_object_name
)
5321 p
= first_global_object_name
;
5324 /* We don't have anything that we know to be unique to this translation
5325 unit, so use what we do have and throw in some randomness. */
5327 const char *name
= weak_global_object_name
;
5328 const char *file
= main_input_filename
;
5333 file
= input_filename
;
5335 len
= strlen (file
);
5336 q
= alloca (9 * 2 + len
+ 1);
5337 memcpy (q
, file
, len
+ 1);
5338 clean_symbol_name (q
);
5340 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5341 crc32_string (0, flag_random_seed
));
5346 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5348 /* Set up the name of the file-level functions we may need.
5349 Use a global object (which is already required to be unique over
5350 the program) rather than the file name (which imposes extra
5352 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5354 return get_identifier (buf
);
5357 /* If KIND=='I', return a suitable global initializer (constructor) name.
5358 If KIND=='D', return a suitable global clean-up (destructor) name. */
5361 get_file_function_name (int kind
)
5368 return get_file_function_name_long (p
);
5371 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5373 /* Complain that the tree code of NODE does not match the expected 0
5374 terminated list of trailing codes. The trailing code list can be
5375 empty, for a more vague error message. FILE, LINE, and FUNCTION
5376 are of the caller. */
5379 tree_check_failed (const tree node
, const char *file
,
5380 int line
, const char *function
, ...)
5384 unsigned length
= 0;
5387 va_start (args
, function
);
5388 while ((code
= va_arg (args
, int)))
5389 length
+= 4 + strlen (tree_code_name
[code
]);
5393 va_start (args
, function
);
5394 length
+= strlen ("expected ");
5395 buffer
= alloca (length
);
5397 while ((code
= va_arg (args
, int)))
5399 const char *prefix
= length
? " or " : "expected ";
5401 strcpy (buffer
+ length
, prefix
);
5402 length
+= strlen (prefix
);
5403 strcpy (buffer
+ length
, tree_code_name
[code
]);
5404 length
+= strlen (tree_code_name
[code
]);
5409 buffer
= (char *)"unexpected node";
5411 internal_error ("tree check: %s, have %s in %s, at %s:%d",
5412 buffer
, tree_code_name
[TREE_CODE (node
)],
5413 function
, trim_filename (file
), line
);
5416 /* Complain that the tree code of NODE does match the expected 0
5417 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5421 tree_not_check_failed (const tree node
, const char *file
,
5422 int line
, const char *function
, ...)
5426 unsigned length
= 0;
5429 va_start (args
, function
);
5430 while ((code
= va_arg (args
, int)))
5431 length
+= 4 + strlen (tree_code_name
[code
]);
5433 va_start (args
, function
);
5434 buffer
= alloca (length
);
5436 while ((code
= va_arg (args
, int)))
5440 strcpy (buffer
+ length
, " or ");
5443 strcpy (buffer
+ length
, tree_code_name
[code
]);
5444 length
+= strlen (tree_code_name
[code
]);
5448 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5449 buffer
, tree_code_name
[TREE_CODE (node
)],
5450 function
, trim_filename (file
), line
);
5453 /* Similar to tree_check_failed, except that we check for a class of tree
5454 code, given in CL. */
5457 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
5458 const char *file
, int line
, const char *function
)
5461 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
5462 TREE_CODE_CLASS_STRING (cl
),
5463 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
5464 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
5467 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5468 (dynamically sized) vector. */
5471 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5472 const char *function
)
5475 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5476 idx
+ 1, len
, function
, trim_filename (file
), line
);
5479 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5480 (dynamically sized) vector. */
5483 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5484 const char *function
)
5487 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5488 idx
+ 1, len
, function
, trim_filename (file
), line
);
5491 /* Similar to above, except that the check is for the bounds of the operand
5492 vector of an expression node. */
5495 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
5496 int line
, const char *function
)
5499 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5500 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
5501 function
, trim_filename (file
), line
);
5503 #endif /* ENABLE_TREE_CHECKING */
5505 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5506 and mapped to the machine mode MODE. Initialize its fields and build
5507 the information necessary for debugging output. */
5510 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
5512 tree t
= make_node (VECTOR_TYPE
);
5514 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
5515 TYPE_VECTOR_SUBPARTS (t
) = nunits
;
5516 TYPE_MODE (t
) = mode
;
5517 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
5518 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
5523 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
5524 tree array
= build_array_type (innertype
, build_index_type (index
));
5525 tree rt
= make_node (RECORD_TYPE
);
5527 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5528 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5530 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
5531 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5532 the representation type, and we want to find that die when looking up
5533 the vector type. This is most easily achieved by making the TYPE_UID
5535 TYPE_UID (rt
) = TYPE_UID (t
);
5538 /* Build our main variant, based on the main variant of the inner type. */
5539 if (TYPE_MAIN_VARIANT (innertype
) != innertype
)
5541 tree innertype_main_variant
= TYPE_MAIN_VARIANT (innertype
);
5542 unsigned int hash
= TYPE_HASH (innertype_main_variant
);
5543 TYPE_MAIN_VARIANT (t
)
5544 = type_hash_canon (hash
, make_vector_type (innertype_main_variant
,
5552 make_or_reuse_type (unsigned size
, int unsignedp
)
5554 if (size
== INT_TYPE_SIZE
)
5555 return unsignedp
? unsigned_type_node
: integer_type_node
;
5556 if (size
== CHAR_TYPE_SIZE
)
5557 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5558 if (size
== SHORT_TYPE_SIZE
)
5559 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5560 if (size
== LONG_TYPE_SIZE
)
5561 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5562 if (size
== LONG_LONG_TYPE_SIZE
)
5563 return (unsignedp
? long_long_unsigned_type_node
5564 : long_long_integer_type_node
);
5567 return make_unsigned_type (size
);
5569 return make_signed_type (size
);
5572 /* Create nodes for all integer types (and error_mark_node) using the sizes
5573 of C datatypes. The caller should call set_sizetype soon after calling
5574 this function to select one of the types as sizetype. */
5577 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
5579 error_mark_node
= make_node (ERROR_MARK
);
5580 TREE_TYPE (error_mark_node
) = error_mark_node
;
5582 initialize_sizetypes (signed_sizetype
);
5584 /* Define both `signed char' and `unsigned char'. */
5585 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5586 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5588 /* Define `char', which is like either `signed char' or `unsigned char'
5589 but not the same as either. */
5592 ? make_signed_type (CHAR_TYPE_SIZE
)
5593 : make_unsigned_type (CHAR_TYPE_SIZE
));
5595 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5596 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5597 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5598 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5599 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5600 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5601 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5602 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5604 /* Define a boolean type. This type only represents boolean values but
5605 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5606 Front ends which want to override this size (i.e. Java) can redefine
5607 boolean_type_node before calling build_common_tree_nodes_2. */
5608 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5609 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5610 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5611 TYPE_PRECISION (boolean_type_node
) = 1;
5613 /* Fill in the rest of the sized types. Reuse existing type nodes
5615 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
5616 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
5617 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
5618 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
5619 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
5621 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
5622 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
5623 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
5624 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
5625 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
5627 access_public_node
= get_identifier ("public");
5628 access_protected_node
= get_identifier ("protected");
5629 access_private_node
= get_identifier ("private");
5632 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5633 It will create several other common tree nodes. */
5636 build_common_tree_nodes_2 (int short_double
)
5638 /* Define these next since types below may used them. */
5639 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
5640 integer_one_node
= build_int_cst (NULL_TREE
, 1);
5641 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
5643 size_zero_node
= size_int (0);
5644 size_one_node
= size_int (1);
5645 bitsize_zero_node
= bitsize_int (0);
5646 bitsize_one_node
= bitsize_int (1);
5647 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5649 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5650 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5652 void_type_node
= make_node (VOID_TYPE
);
5653 layout_type (void_type_node
);
5655 /* We are not going to have real types in C with less than byte alignment,
5656 so we might as well not have any types that claim to have it. */
5657 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5658 TYPE_USER_ALIGN (void_type_node
) = 0;
5660 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
5661 layout_type (TREE_TYPE (null_pointer_node
));
5663 ptr_type_node
= build_pointer_type (void_type_node
);
5665 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5666 fileptr_type_node
= ptr_type_node
;
5668 float_type_node
= make_node (REAL_TYPE
);
5669 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5670 layout_type (float_type_node
);
5672 double_type_node
= make_node (REAL_TYPE
);
5674 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5676 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5677 layout_type (double_type_node
);
5679 long_double_type_node
= make_node (REAL_TYPE
);
5680 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5681 layout_type (long_double_type_node
);
5683 float_ptr_type_node
= build_pointer_type (float_type_node
);
5684 double_ptr_type_node
= build_pointer_type (double_type_node
);
5685 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
5686 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
5688 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5689 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5690 layout_type (complex_integer_type_node
);
5692 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5693 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5694 layout_type (complex_float_type_node
);
5696 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5697 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5698 layout_type (complex_double_type_node
);
5700 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5701 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5702 layout_type (complex_long_double_type_node
);
5705 tree t
= targetm
.build_builtin_va_list ();
5707 /* Many back-ends define record types without setting TYPE_NAME.
5708 If we copied the record type here, we'd keep the original
5709 record type without a name. This breaks name mangling. So,
5710 don't copy record types and let c_common_nodes_and_builtins()
5711 declare the type to be __builtin_va_list. */
5712 if (TREE_CODE (t
) != RECORD_TYPE
)
5713 t
= build_variant_type_copy (t
);
5715 va_list_type_node
= t
;
5719 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
5722 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
5723 const char *library_name
, int ecf_flags
)
5727 decl
= lang_hooks
.builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
5728 library_name
, NULL_TREE
);
5729 if (ecf_flags
& ECF_CONST
)
5730 TREE_READONLY (decl
) = 1;
5731 if (ecf_flags
& ECF_PURE
)
5732 DECL_IS_PURE (decl
) = 1;
5733 if (ecf_flags
& ECF_NORETURN
)
5734 TREE_THIS_VOLATILE (decl
) = 1;
5735 if (ecf_flags
& ECF_NOTHROW
)
5736 TREE_NOTHROW (decl
) = 1;
5737 if (ecf_flags
& ECF_MALLOC
)
5738 DECL_IS_MALLOC (decl
) = 1;
5740 built_in_decls
[code
] = decl
;
5741 implicit_built_in_decls
[code
] = decl
;
5744 /* Call this function after instantiating all builtins that the language
5745 front end cares about. This will build the rest of the builtins that
5746 are relied upon by the tree optimizers and the middle-end. */
5749 build_common_builtin_nodes (void)
5753 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
5754 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
5756 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5757 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5758 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5759 ftype
= build_function_type (ptr_type_node
, tmp
);
5761 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
5762 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
5763 "memcpy", ECF_NOTHROW
);
5764 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
5765 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
5766 "memmove", ECF_NOTHROW
);
5769 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
5771 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5772 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5773 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5774 ftype
= build_function_type (ptr_type_node
, tmp
);
5775 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
5776 "memcmp", ECF_PURE
| ECF_NOTHROW
);
5779 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
5781 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5782 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
5783 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5784 ftype
= build_function_type (ptr_type_node
, tmp
);
5785 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
5786 "memset", ECF_NOTHROW
);
5789 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
5791 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5792 ftype
= build_function_type (ptr_type_node
, tmp
);
5793 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
5794 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
5797 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5798 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5799 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5800 ftype
= build_function_type (void_type_node
, tmp
);
5801 local_define_builtin ("__builtin_init_trampoline", ftype
,
5802 BUILT_IN_INIT_TRAMPOLINE
,
5803 "__builtin_init_trampoline", ECF_NOTHROW
);
5805 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5806 ftype
= build_function_type (ptr_type_node
, tmp
);
5807 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
5808 BUILT_IN_ADJUST_TRAMPOLINE
,
5809 "__builtin_adjust_trampoline",
5810 ECF_CONST
| ECF_NOTHROW
);
5812 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5813 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5814 ftype
= build_function_type (void_type_node
, tmp
);
5815 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
5816 BUILT_IN_NONLOCAL_GOTO
,
5817 "__builtin_nonlocal_goto",
5818 ECF_NORETURN
| ECF_NOTHROW
);
5820 ftype
= build_function_type (ptr_type_node
, void_list_node
);
5821 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
5822 "__builtin_stack_save", ECF_NOTHROW
);
5824 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5825 ftype
= build_function_type (void_type_node
, tmp
);
5826 local_define_builtin ("__builtin_stack_restore", ftype
,
5827 BUILT_IN_STACK_RESTORE
,
5828 "__builtin_stack_restore", ECF_NOTHROW
);
5830 ftype
= build_function_type (void_type_node
, void_list_node
);
5831 local_define_builtin ("__builtin_profile_func_enter", ftype
,
5832 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
5833 local_define_builtin ("__builtin_profile_func_exit", ftype
,
5834 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
5836 /* Complex multiplication and division. These are handled as builtins
5837 rather than optabs because emit_library_call_value doesn't support
5838 complex. Further, we can do slightly better with folding these
5839 beasties if the real and complex parts of the arguments are separate. */
5841 enum machine_mode mode
;
5843 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
5845 char mode_name_buf
[4], *q
;
5847 enum built_in_function mcode
, dcode
;
5848 tree type
, inner_type
;
5850 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
5853 inner_type
= TREE_TYPE (type
);
5855 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
5856 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
5857 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
5858 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
5859 ftype
= build_function_type (type
, tmp
);
5861 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
5862 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
5864 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
5868 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
5869 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
5870 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
5872 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
5873 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
5874 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
5879 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5882 If we requested a pointer to a vector, build up the pointers that
5883 we stripped off while looking for the inner type. Similarly for
5884 return values from functions.
5886 The argument TYPE is the top of the chain, and BOTTOM is the
5887 new type which we will point to. */
5890 reconstruct_complex_type (tree type
, tree bottom
)
5894 if (POINTER_TYPE_P (type
))
5896 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5897 outer
= build_pointer_type (inner
);
5899 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5901 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5902 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
5904 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5906 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5907 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
5909 else if (TREE_CODE (type
) == METHOD_TYPE
)
5912 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5913 /* The build_method_type_directly() routine prepends 'this' to argument list,
5914 so we must compensate by getting rid of it. */
5915 argtypes
= TYPE_ARG_TYPES (type
);
5916 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
5918 TYPE_ARG_TYPES (type
));
5919 TYPE_ARG_TYPES (outer
) = argtypes
;
5924 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
5925 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
5930 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
5933 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
5937 switch (GET_MODE_CLASS (mode
))
5939 case MODE_VECTOR_INT
:
5940 case MODE_VECTOR_FLOAT
:
5941 nunits
= GET_MODE_NUNITS (mode
);
5945 /* Check that there are no leftover bits. */
5946 gcc_assert (GET_MODE_BITSIZE (mode
)
5947 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
5949 nunits
= GET_MODE_BITSIZE (mode
)
5950 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
5957 return make_vector_type (innertype
, nunits
, mode
);
5960 /* Similarly, but takes the inner type and number of units, which must be
5964 build_vector_type (tree innertype
, int nunits
)
5966 return make_vector_type (innertype
, nunits
, VOIDmode
);
5969 /* Build RESX_EXPR with given REGION_NUMBER. */
5971 build_resx (int region_number
)
5974 t
= build1 (RESX_EXPR
, void_type_node
,
5975 build_int_cst (NULL_TREE
, region_number
));
5979 /* Given an initializer INIT, return TRUE if INIT is zero or some
5980 aggregate of zeros. Otherwise return FALSE. */
5982 initializer_zerop (tree init
)
5988 switch (TREE_CODE (init
))
5991 return integer_zerop (init
);
5994 /* ??? Note that this is not correct for C4X float formats. There,
5995 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
5996 negative exponent. */
5997 return real_zerop (init
)
5998 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
6001 return integer_zerop (init
)
6002 || (real_zerop (init
)
6003 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
6004 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
6007 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
6008 if (!initializer_zerop (TREE_VALUE (elt
)))
6013 elt
= CONSTRUCTOR_ELTS (init
);
6014 if (elt
== NULL_TREE
)
6017 for (; elt
; elt
= TREE_CHAIN (elt
))
6018 if (! initializer_zerop (TREE_VALUE (elt
)))
6028 add_var_to_bind_expr (tree bind_expr
, tree var
)
6030 BIND_EXPR_VARS (bind_expr
)
6031 = chainon (BIND_EXPR_VARS (bind_expr
), var
);
6032 if (BIND_EXPR_BLOCK (bind_expr
))
6033 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr
))
6034 = BIND_EXPR_VARS (bind_expr
);
6037 /* Build an empty statement. */
6040 build_empty_stmt (void)
6042 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
6046 /* Returns true if it is possible to prove that the index of
6047 an array access REF (an ARRAY_REF expression) falls into the
6051 in_array_bounds_p (tree ref
)
6053 tree idx
= TREE_OPERAND (ref
, 1);
6056 if (TREE_CODE (idx
) != INTEGER_CST
)
6059 min
= array_ref_low_bound (ref
);
6060 max
= array_ref_up_bound (ref
);
6063 || TREE_CODE (min
) != INTEGER_CST
6064 || TREE_CODE (max
) != INTEGER_CST
)
6067 if (tree_int_cst_lt (idx
, min
)
6068 || tree_int_cst_lt (max
, idx
))
6074 /* Return true if T (assumed to be a DECL) is a global variable. */
6077 is_global_var (tree t
)
6079 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
6082 /* Return true if T (assumed to be a DECL) must be assigned a memory
6086 needs_to_live_in_memory (tree t
)
6088 return (TREE_ADDRESSABLE (t
)
6089 || is_global_var (t
)
6090 || (TREE_CODE (t
) == RESULT_DECL
6091 && aggregate_value_p (t
, current_function_decl
)));
6094 /* There are situations in which a language considers record types
6095 compatible which have different field lists. Decide if two fields
6096 are compatible. It is assumed that the parent records are compatible. */
6099 fields_compatible_p (tree f1
, tree f2
)
6101 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
6102 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
6105 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
6106 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
6109 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
6115 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
6118 find_compatible_field (tree record
, tree orig_field
)
6122 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
6123 if (TREE_CODE (f
) == FIELD_DECL
6124 && fields_compatible_p (f
, orig_field
))
6127 /* ??? Why isn't this on the main fields list? */
6128 f
= TYPE_VFIELD (record
);
6129 if (f
&& TREE_CODE (f
) == FIELD_DECL
6130 && fields_compatible_p (f
, orig_field
))
6133 /* ??? We should abort here, but Java appears to do Bad Things
6134 with inherited fields. */
6138 /* Return value of a constant X. */
6141 int_cst_value (tree x
)
6143 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
6144 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
6145 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
6147 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
6150 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
6152 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
6157 /* Returns the greatest common divisor of A and B, which must be
6161 tree_fold_gcd (tree a
, tree b
)
6164 tree type
= TREE_TYPE (a
);
6166 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
6167 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
6169 if (integer_zerop (a
))
6172 if (integer_zerop (b
))
6175 if (tree_int_cst_sgn (a
) == -1)
6176 a
= fold (build2 (MULT_EXPR
, type
, a
,
6177 convert (type
, integer_minus_one_node
)));
6179 if (tree_int_cst_sgn (b
) == -1)
6180 b
= fold (build2 (MULT_EXPR
, type
, b
,
6181 convert (type
, integer_minus_one_node
)));
6185 a_mod_b
= fold (build2 (FLOOR_MOD_EXPR
, type
, a
, b
));
6187 if (!TREE_INT_CST_LOW (a_mod_b
)
6188 && !TREE_INT_CST_HIGH (a_mod_b
))
6196 /* Returns unsigned variant of TYPE. */
6199 unsigned_type_for (tree type
)
6201 return lang_hooks
.types
.unsigned_type (type
);
6204 /* Returns signed variant of TYPE. */
6207 signed_type_for (tree type
)
6209 return lang_hooks
.types
.signed_type (type
);
6212 /* Returns the largest value obtainable by casting something in INNER type to
6216 upper_bound_in_type (tree outer
, tree inner
)
6218 unsigned HOST_WIDE_INT lo
, hi
;
6219 unsigned bits
= TYPE_PRECISION (inner
);
6221 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6223 /* Zero extending in these cases. */
6224 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6227 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6228 >> (HOST_BITS_PER_WIDE_INT
- bits
);
6232 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6233 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
);
6234 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6239 /* Sign extending in these cases. */
6240 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6243 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6244 >> (HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6248 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6249 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6250 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6254 return fold_convert (outer
,
6255 build_int_cst_wide (inner
, lo
, hi
));
6258 /* Returns the smallest value obtainable by casting something in INNER type to
6262 lower_bound_in_type (tree outer
, tree inner
)
6264 unsigned HOST_WIDE_INT lo
, hi
;
6265 unsigned bits
= TYPE_PRECISION (inner
);
6267 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6269 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
6271 hi
= ~(unsigned HOST_WIDE_INT
) 0;
6272 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1);
6276 hi
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- HOST_BITS_PER_WIDE_INT
- 1);
6280 return fold_convert (outer
,
6281 build_int_cst_wide (inner
, lo
, hi
));
6284 /* Return nonzero if two operands that are suitable for PHI nodes are
6285 necessarily equal. Specifically, both ARG0 and ARG1 must be either
6286 SSA_NAME or invariant. Note that this is strictly an optimization.
6287 That is, callers of this function can directly call operand_equal_p
6288 and get the same result, only slower. */
6291 operand_equal_for_phi_arg_p (tree arg0
, tree arg1
)
6295 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
6297 return operand_equal_p (arg0
, arg1
, 0);
6300 /* Returns number of zeros at the end of binary representation of X.
6302 ??? Use ffs if available? */
6305 num_ending_zeros (tree x
)
6307 unsigned HOST_WIDE_INT fr
, nfr
;
6308 unsigned num
, abits
;
6309 tree type
= TREE_TYPE (x
);
6311 if (TREE_INT_CST_LOW (x
) == 0)
6313 num
= HOST_BITS_PER_WIDE_INT
;
6314 fr
= TREE_INT_CST_HIGH (x
);
6319 fr
= TREE_INT_CST_LOW (x
);
6322 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
6325 if (nfr
<< abits
== fr
)
6332 if (num
> TYPE_PRECISION (type
))
6333 num
= TYPE_PRECISION (type
);
6335 return build_int_cst_type (type
, num
);
6339 #define WALK_SUBTREE(NODE) \
6342 result = walk_tree (&(NODE), func, data, pset); \
6348 /* This is a subroutine of walk_tree that walks field of TYPE that are to
6349 be walked whenever a type is seen in the tree. Rest of operands and return
6350 value are as for walk_tree. */
6353 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
6354 struct pointer_set_t
*pset
)
6356 tree result
= NULL_TREE
;
6358 switch (TREE_CODE (type
))
6361 case REFERENCE_TYPE
:
6362 /* We have to worry about mutually recursive pointers. These can't
6363 be written in C. They can in Ada. It's pathological, but
6364 there's an ACATS test (c38102a) that checks it. Deal with this
6365 by checking if we're pointing to another pointer, that one
6366 points to another pointer, that one does too, and we have no htab.
6367 If so, get a hash table. We check three levels deep to avoid
6368 the cost of the hash table if we don't need one. */
6369 if (POINTER_TYPE_P (TREE_TYPE (type
))
6370 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
6371 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
6374 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
6382 /* ... fall through ... */
6385 WALK_SUBTREE (TREE_TYPE (type
));
6389 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
6394 WALK_SUBTREE (TREE_TYPE (type
));
6398 /* We never want to walk into default arguments. */
6399 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
6400 WALK_SUBTREE (TREE_VALUE (arg
));
6405 /* Don't follow this nodes's type if a pointer for fear that we'll
6406 have infinite recursion. Those types are uninteresting anyway. */
6407 if (!POINTER_TYPE_P (TREE_TYPE (type
))
6408 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
)
6409 WALK_SUBTREE (TREE_TYPE (type
));
6410 WALK_SUBTREE (TYPE_DOMAIN (type
));
6418 WALK_SUBTREE (TYPE_MIN_VALUE (type
));
6419 WALK_SUBTREE (TYPE_MAX_VALUE (type
));
6423 WALK_SUBTREE (TREE_TYPE (type
));
6424 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
6434 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
6435 called with the DATA and the address of each sub-tree. If FUNC returns a
6436 non-NULL value, the traversal is stopped, and the value returned by FUNC
6437 is returned. If PSET is non-NULL it is used to record the nodes visited,
6438 and to avoid visiting a node more than once. */
6441 walk_tree (tree
*tp
, walk_tree_fn func
, void *data
, struct pointer_set_t
*pset
)
6443 enum tree_code code
;
6447 #define WALK_SUBTREE_TAIL(NODE) \
6451 goto tail_recurse; \
6456 /* Skip empty subtrees. */
6460 /* Don't walk the same tree twice, if the user has requested
6461 that we avoid doing so. */
6462 if (pset
&& pointer_set_insert (pset
, *tp
))
6465 /* Call the function. */
6467 result
= (*func
) (tp
, &walk_subtrees
, data
);
6469 /* If we found something, return it. */
6473 code
= TREE_CODE (*tp
);
6475 /* Even if we didn't, FUNC may have decided that there was nothing
6476 interesting below this point in the tree. */
6479 if (code
== TREE_LIST
)
6480 /* But we still need to check our siblings. */
6481 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
6486 result
= lang_hooks
.tree_inlining
.walk_subtrees (tp
, &walk_subtrees
, func
,
6488 if (result
|| ! walk_subtrees
)
6491 /* If this is a DECL_EXPR, walk into various fields of the type that it's
6492 defining. We only want to walk into these fields of a type in this
6493 case. Note that decls get walked as part of the processing of a
6496 ??? Precisely which fields of types that we are supposed to walk in
6497 this case vs. the normal case aren't well defined. */
6498 if (code
== DECL_EXPR
6499 && TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
6500 && TREE_CODE (TREE_TYPE (DECL_EXPR_DECL (*tp
))) != ERROR_MARK
)
6502 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
6504 /* Call the function for the type. See if it returns anything or
6505 doesn't want us to continue. If we are to continue, walk both
6506 the normal fields and those for the declaration case. */
6507 result
= (*func
) (type_p
, &walk_subtrees
, data
);
6508 if (result
|| !walk_subtrees
)
6511 result
= walk_type_fields (*type_p
, func
, data
, pset
);
6515 WALK_SUBTREE (TYPE_SIZE (*type_p
));
6516 WALK_SUBTREE (TYPE_SIZE_UNIT (*type_p
));
6518 /* If this is a record type, also walk the fields. */
6519 if (TREE_CODE (*type_p
) == RECORD_TYPE
6520 || TREE_CODE (*type_p
) == UNION_TYPE
6521 || TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
6525 for (field
= TYPE_FIELDS (*type_p
); field
;
6526 field
= TREE_CHAIN (field
))
6528 /* We'd like to look at the type of the field, but we can easily
6529 get infinite recursion. So assume it's pointed to elsewhere
6530 in the tree. Also, ignore things that aren't fields. */
6531 if (TREE_CODE (field
) != FIELD_DECL
)
6534 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
6535 WALK_SUBTREE (DECL_SIZE (field
));
6536 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
6537 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
6538 WALK_SUBTREE (DECL_QUALIFIER (field
));
6543 else if (code
!= SAVE_EXPR
6544 && code
!= BIND_EXPR
6545 && IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
6549 /* Walk over all the sub-trees of this operand. */
6550 len
= TREE_CODE_LENGTH (code
);
6551 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
6552 But, we only want to walk once. */
6553 if (code
== TARGET_EXPR
6554 && TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1))
6557 /* Go through the subtrees. We need to do this in forward order so
6558 that the scope of a FOR_EXPR is handled properly. */
6559 #ifdef DEBUG_WALK_TREE
6560 for (i
= 0; i
< len
; ++i
)
6561 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
6563 for (i
= 0; i
< len
- 1; ++i
)
6564 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
6568 /* The common case is that we may tail recurse here. */
6569 if (code
!= BIND_EXPR
6570 && !TREE_CHAIN (*tp
))
6571 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
6573 WALK_SUBTREE (TREE_OPERAND (*tp
, len
- 1));
6578 /* If this is a type, walk the needed fields in the type. */
6579 else if (TYPE_P (*tp
))
6581 result
= walk_type_fields (*tp
, func
, data
, pset
);
6587 /* Not one of the easy cases. We must explicitly go through the
6592 case IDENTIFIER_NODE
:
6598 case PLACEHOLDER_EXPR
:
6602 /* None of thse have subtrees other than those already walked
6607 WALK_SUBTREE (TREE_VALUE (*tp
));
6608 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
6613 int len
= TREE_VEC_LENGTH (*tp
);
6618 /* Walk all elements but the first. */
6620 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
6622 /* Now walk the first one as a tail call. */
6623 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
6627 WALK_SUBTREE (TREE_REALPART (*tp
));
6628 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
6631 WALK_SUBTREE_TAIL (CONSTRUCTOR_ELTS (*tp
));
6634 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
6639 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= TREE_CHAIN (decl
))
6641 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
6642 into declarations that are just mentioned, rather than
6643 declared; they don't really belong to this part of the tree.
6644 And, we can see cycles: the initializer for a declaration
6645 can refer to the declaration itself. */
6646 WALK_SUBTREE (DECL_INITIAL (decl
));
6647 WALK_SUBTREE (DECL_SIZE (decl
));
6648 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
6650 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
6653 case STATEMENT_LIST
:
6655 tree_stmt_iterator i
;
6656 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
6657 WALK_SUBTREE (*tsi_stmt_ptr (i
));
6662 /* ??? This could be a language-defined node. We really should make
6663 a hook for it, but right now just ignore it. */
6668 /* We didn't find what we were looking for. */
6671 #undef WALK_SUBTREE_TAIL
6675 /* Like walk_tree, but does not walk duplicate nodes more than once. */
6678 walk_tree_without_duplicates (tree
*tp
, walk_tree_fn func
, void *data
)
6681 struct pointer_set_t
*pset
;
6683 pset
= pointer_set_create ();
6684 result
= walk_tree (tp
, func
, data
, pset
);
6685 pointer_set_destroy (pset
);
6689 #include "gt-tree.h"