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"
53 /* Each tree code class has an associated string representation.
54 These must correspond to the tree_code_class entries. */
56 const char *const tree_code_class_strings
[] =
70 /* obstack.[ch] explicitly declined to prototype this. */
71 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
73 #ifdef GATHER_STATISTICS
74 /* Statistics-gathering stuff. */
76 int tree_node_counts
[(int) all_kinds
];
77 int tree_node_sizes
[(int) all_kinds
];
79 /* Keep in sync with tree.h:enum tree_node_kind. */
80 static const char * const tree_node_kind_names
[] = {
99 #endif /* GATHER_STATISTICS */
101 /* Unique id for next decl created. */
102 static GTY(()) int next_decl_uid
;
103 /* Unique id for next type created. */
104 static GTY(()) int next_type_uid
= 1;
106 /* Since we cannot rehash a type after it is in the table, we have to
107 keep the hash code. */
109 struct type_hash
GTY(())
115 /* Initial size of the hash table (rounded to next prime). */
116 #define TYPE_HASH_INITIAL_SIZE 1000
118 /* Now here is the hash table. When recording a type, it is added to
119 the slot whose index is the hash code. Note that the hash table is
120 used for several kinds of types (function types, array types and
121 array index range types, for now). While all these live in the
122 same table, they are completely independent, and the hash code is
123 computed differently for each of these. */
125 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
126 htab_t type_hash_table
;
128 /* Hash table and temporary node for larger integer const values. */
129 static GTY (()) tree int_cst_node
;
130 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
131 htab_t int_cst_hash_table
;
133 static void set_type_quals (tree
, int);
134 static int type_hash_eq (const void *, const void *);
135 static hashval_t
type_hash_hash (const void *);
136 static hashval_t
int_cst_hash_hash (const void *);
137 static int int_cst_hash_eq (const void *, const void *);
138 static void print_type_hash_statistics (void);
139 static tree
make_vector_type (tree
, int, enum machine_mode
);
140 static int type_hash_marked_p (const void *);
141 static unsigned int type_hash_list (tree
, hashval_t
);
142 static unsigned int attribute_hash_list (tree
, hashval_t
);
144 tree global_trees
[TI_MAX
];
145 tree integer_types
[itk_none
];
152 /* Initialize the hash table of types. */
153 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
155 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
156 int_cst_hash_eq
, NULL
);
157 int_cst_node
= make_node (INTEGER_CST
);
161 /* The name of the object as the assembler will see it (but before any
162 translations made by ASM_OUTPUT_LABELREF). Often this is the same
163 as DECL_NAME. It is an IDENTIFIER_NODE. */
165 decl_assembler_name (tree decl
)
167 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
168 lang_hooks
.set_decl_assembler_name (decl
);
169 return DECL_CHECK (decl
)->decl
.assembler_name
;
172 /* Compute the number of bytes occupied by a tree with code CODE.
173 This function cannot be used for TREE_VEC, PHI_NODE, or STRING_CST
174 codes, which are of variable length. */
176 tree_code_size (enum tree_code code
)
178 switch (TREE_CODE_CLASS (code
))
180 case tcc_declaration
: /* A decl node */
181 return sizeof (struct tree_decl
);
183 case tcc_type
: /* a type node */
184 return sizeof (struct tree_type
);
186 case tcc_reference
: /* a reference */
187 case tcc_expression
: /* an expression */
188 case tcc_statement
: /* an expression with side effects */
189 case tcc_comparison
: /* a comparison expression */
190 case tcc_unary
: /* a unary arithmetic expression */
191 case tcc_binary
: /* a binary arithmetic expression */
192 return (sizeof (struct tree_exp
)
193 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (char *));
195 case tcc_constant
: /* a constant */
198 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
199 case REAL_CST
: return sizeof (struct tree_real_cst
);
200 case COMPLEX_CST
: return sizeof (struct tree_complex
);
201 case VECTOR_CST
: return sizeof (struct tree_vector
);
202 case STRING_CST
: gcc_unreachable ();
204 return lang_hooks
.tree_size (code
);
207 case tcc_exceptional
: /* something random, like an identifier. */
210 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
211 case TREE_LIST
: return sizeof (struct tree_list
);
214 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
217 case PHI_NODE
: gcc_unreachable ();
219 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
221 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
222 case BLOCK
: return sizeof (struct tree_block
);
223 case VALUE_HANDLE
: return sizeof (struct tree_value_handle
);
226 return lang_hooks
.tree_size (code
);
234 /* Compute the number of bytes occupied by NODE. This routine only
235 looks at TREE_CODE, except for PHI_NODE and TREE_VEC nodes. */
237 tree_size (tree node
)
239 enum tree_code code
= TREE_CODE (node
);
243 return (sizeof (struct tree_phi_node
)
244 + (PHI_ARG_CAPACITY (node
) - 1) * sizeof (struct phi_arg_d
));
247 return (sizeof (struct tree_vec
)
248 + (TREE_VEC_LENGTH (node
) - 1) * sizeof(char *));
251 return sizeof (struct tree_string
) + TREE_STRING_LENGTH (node
) - 1;
254 return tree_code_size (code
);
258 /* Return a newly allocated node of code CODE. For decl and type
259 nodes, some other fields are initialized. The rest of the node is
260 initialized to zero. This function cannot be used for PHI_NODE or
261 TREE_VEC nodes, which is enforced by asserts in tree_code_size.
263 Achoo! I got a code in the node. */
266 make_node_stat (enum tree_code code MEM_STAT_DECL
)
269 enum tree_code_class type
= TREE_CODE_CLASS (code
);
270 size_t length
= tree_code_size (code
);
271 #ifdef GATHER_STATISTICS
276 case tcc_declaration
: /* A decl node */
280 case tcc_type
: /* a type node */
284 case tcc_statement
: /* an expression with side effects */
288 case tcc_reference
: /* a reference */
292 case tcc_expression
: /* an expression */
293 case tcc_comparison
: /* a comparison expression */
294 case tcc_unary
: /* a unary arithmetic expression */
295 case tcc_binary
: /* a binary arithmetic expression */
299 case tcc_constant
: /* a constant */
303 case tcc_exceptional
: /* something random, like an identifier. */
306 case IDENTIFIER_NODE
:
323 kind
= ssa_name_kind
;
340 tree_node_counts
[(int) kind
]++;
341 tree_node_sizes
[(int) kind
] += length
;
344 if (code
== IDENTIFIER_NODE
)
345 t
= ggc_alloc_zone_stat (length
, &tree_id_zone PASS_MEM_STAT
);
347 t
= ggc_alloc_zone_stat (length
, &tree_zone PASS_MEM_STAT
);
349 memset (t
, 0, length
);
351 TREE_SET_CODE (t
, code
);
356 TREE_SIDE_EFFECTS (t
) = 1;
359 case tcc_declaration
:
360 if (code
!= FUNCTION_DECL
)
362 DECL_USER_ALIGN (t
) = 0;
363 DECL_IN_SYSTEM_HEADER (t
) = in_system_header
;
364 DECL_SOURCE_LOCATION (t
) = input_location
;
365 DECL_UID (t
) = next_decl_uid
++;
367 /* We have not yet computed the alias set for this declaration. */
368 DECL_POINTER_ALIAS_SET (t
) = -1;
372 TYPE_UID (t
) = next_type_uid
++;
373 TYPE_ALIGN (t
) = char_type_node
? TYPE_ALIGN (char_type_node
) : 0;
374 TYPE_USER_ALIGN (t
) = 0;
375 TYPE_MAIN_VARIANT (t
) = t
;
377 /* Default to no attributes for type, but let target change that. */
378 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
379 targetm
.set_default_type_attributes (t
);
381 /* We have not yet computed the alias set for this type. */
382 TYPE_ALIAS_SET (t
) = -1;
386 TREE_CONSTANT (t
) = 1;
387 TREE_INVARIANT (t
) = 1;
396 case PREDECREMENT_EXPR
:
397 case PREINCREMENT_EXPR
:
398 case POSTDECREMENT_EXPR
:
399 case POSTINCREMENT_EXPR
:
400 /* All of these have side-effects, no matter what their
402 TREE_SIDE_EFFECTS (t
) = 1;
411 /* Other classes need no special treatment. */
418 /* Return a new node with the same contents as NODE except that its
419 TREE_CHAIN is zero and it has a fresh uid. */
422 copy_node_stat (tree node MEM_STAT_DECL
)
425 enum tree_code code
= TREE_CODE (node
);
428 gcc_assert (code
!= STATEMENT_LIST
);
430 length
= tree_size (node
);
431 t
= ggc_alloc_zone_stat (length
, &tree_zone PASS_MEM_STAT
);
432 memcpy (t
, node
, length
);
435 TREE_ASM_WRITTEN (t
) = 0;
436 TREE_VISITED (t
) = 0;
439 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
440 DECL_UID (t
) = next_decl_uid
++;
441 else if (TREE_CODE_CLASS (code
) == tcc_type
)
443 TYPE_UID (t
) = next_type_uid
++;
444 /* The following is so that the debug code for
445 the copy is different from the original type.
446 The two statements usually duplicate each other
447 (because they clear fields of the same union),
448 but the optimizer should catch that. */
449 TYPE_SYMTAB_POINTER (t
) = 0;
450 TYPE_SYMTAB_ADDRESS (t
) = 0;
452 /* Do not copy the values cache. */
453 if (TYPE_CACHED_VALUES_P(t
))
455 TYPE_CACHED_VALUES_P (t
) = 0;
456 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
463 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
464 For example, this can copy a list made of TREE_LIST nodes. */
467 copy_list (tree list
)
475 head
= prev
= copy_node (list
);
476 next
= TREE_CHAIN (list
);
479 TREE_CHAIN (prev
) = copy_node (next
);
480 prev
= TREE_CHAIN (prev
);
481 next
= TREE_CHAIN (next
);
487 /* Create an INT_CST node with a LOW value sign extended. */
490 build_int_cst (tree type
, HOST_WIDE_INT low
)
492 return build_int_cst_wide (type
, low
, low
< 0 ? -1 : 0);
495 /* Create an INT_CST node with a LOW value zero extended. */
498 build_int_cstu (tree type
, unsigned HOST_WIDE_INT low
)
500 return build_int_cst_wide (type
, low
, 0);
503 /* Create an INT_CST node with a LOW value in TYPE. The value is sign extended
504 if it is negative. This function is similar to build_int_cst, but
505 the extra bits outside of the type precision are cleared. Constants
506 with these extra bits may confuse the fold so that it detects overflows
507 even in cases when they do not occur, and in general should be avoided.
508 We cannot however make this a default behavior of build_int_cst without
509 more intrusive changes, since there are parts of gcc that rely on the extra
510 precision of the integer constants. */
513 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
515 unsigned HOST_WIDE_INT val
= (unsigned HOST_WIDE_INT
) low
;
516 unsigned HOST_WIDE_INT hi
;
522 type
= integer_type_node
;
524 bits
= TYPE_PRECISION (type
);
525 signed_p
= !TYPE_UNSIGNED (type
);
527 if (bits
>= HOST_BITS_PER_WIDE_INT
)
528 negative
= (low
< 0);
531 /* If the sign bit is inside precision of LOW, use it to determine
532 the sign of the constant. */
533 negative
= ((val
>> (bits
- 1)) & 1) != 0;
535 /* Mask out the bits outside of the precision of the constant. */
536 if (signed_p
&& negative
)
537 val
= val
| ((~(unsigned HOST_WIDE_INT
) 0) << bits
);
539 val
= val
& ~((~(unsigned HOST_WIDE_INT
) 0) << bits
);
542 /* Determine the high bits. */
543 hi
= (negative
? ~(unsigned HOST_WIDE_INT
) 0 : 0);
545 /* For unsigned type we need to mask out the bits outside of the type
549 if (bits
<= HOST_BITS_PER_WIDE_INT
)
553 bits
-= HOST_BITS_PER_WIDE_INT
;
554 hi
= hi
& ~((~(unsigned HOST_WIDE_INT
) 0) << bits
);
558 return build_int_cst_wide (type
, val
, hi
);
561 /* These are the hash table functions for the hash table of INTEGER_CST
562 nodes of a sizetype. */
564 /* Return the hash code code X, an INTEGER_CST. */
567 int_cst_hash_hash (const void *x
)
571 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
572 ^ htab_hash_pointer (TREE_TYPE (t
)));
575 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
576 is the same as that given by *Y, which is the same. */
579 int_cst_hash_eq (const void *x
, const void *y
)
584 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
585 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
586 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
589 /* Create an INT_CST node of TYPE and value HI:LOW. If TYPE is NULL,
590 integer_type_node is used. The returned node is always shared.
591 For small integers we use a per-type vector cache, for larger ones
592 we use a single hash table. */
595 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
602 type
= integer_type_node
;
604 switch (TREE_CODE (type
))
608 /* Cache NULL pointer. */
617 /* Cache false or true. */
626 if (TYPE_UNSIGNED (type
))
629 limit
= INTEGER_SHARE_LIMIT
;
630 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
636 limit
= INTEGER_SHARE_LIMIT
+ 1;
637 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
639 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
649 /* Look for it in the type's vector of small shared ints. */
650 if (!TYPE_CACHED_VALUES_P (type
))
652 TYPE_CACHED_VALUES_P (type
) = 1;
653 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
656 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
659 /* Make sure no one is clobbering the shared constant. */
660 gcc_assert (TREE_TYPE (t
) == type
);
661 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
662 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
666 /* Create a new shared int. */
667 t
= make_node (INTEGER_CST
);
669 TREE_INT_CST_LOW (t
) = low
;
670 TREE_INT_CST_HIGH (t
) = hi
;
671 TREE_TYPE (t
) = type
;
673 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
678 /* Use the cache of larger shared ints. */
681 TREE_INT_CST_LOW (int_cst_node
) = low
;
682 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
683 TREE_TYPE (int_cst_node
) = type
;
685 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
689 /* Insert this one into the hash table. */
692 /* Make a new node for next time round. */
693 int_cst_node
= make_node (INTEGER_CST
);
700 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
701 and the rest are zeros. */
704 build_low_bits_mask (tree type
, unsigned bits
)
706 unsigned HOST_WIDE_INT low
;
708 unsigned HOST_WIDE_INT all_ones
= ~(unsigned HOST_WIDE_INT
) 0;
710 gcc_assert (bits
<= TYPE_PRECISION (type
));
712 if (bits
== TYPE_PRECISION (type
)
713 && !TYPE_UNSIGNED (type
))
715 /* Sign extended all-ones mask. */
719 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
721 low
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
726 bits
-= HOST_BITS_PER_WIDE_INT
;
728 high
= all_ones
>> (HOST_BITS_PER_WIDE_INT
- bits
);
731 return build_int_cst_wide (type
, low
, high
);
734 /* Checks that X is integer constant that can be expressed in (unsigned)
735 HOST_WIDE_INT without loss of precision. */
738 cst_and_fits_in_hwi (tree x
)
740 if (TREE_CODE (x
) != INTEGER_CST
)
743 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
746 return (TREE_INT_CST_HIGH (x
) == 0
747 || TREE_INT_CST_HIGH (x
) == -1);
750 /* Return a new VECTOR_CST node whose type is TYPE and whose values
751 are in a list pointed by VALS. */
754 build_vector (tree type
, tree vals
)
756 tree v
= make_node (VECTOR_CST
);
757 int over1
= 0, over2
= 0;
760 TREE_VECTOR_CST_ELTS (v
) = vals
;
761 TREE_TYPE (v
) = type
;
763 /* Iterate through elements and check for overflow. */
764 for (link
= vals
; link
; link
= TREE_CHAIN (link
))
766 tree value
= TREE_VALUE (link
);
768 over1
|= TREE_OVERFLOW (value
);
769 over2
|= TREE_CONSTANT_OVERFLOW (value
);
772 TREE_OVERFLOW (v
) = over1
;
773 TREE_CONSTANT_OVERFLOW (v
) = over2
;
778 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
779 are in a list pointed to by VALS. */
781 build_constructor (tree type
, tree vals
)
783 tree c
= make_node (CONSTRUCTOR
);
784 TREE_TYPE (c
) = type
;
785 CONSTRUCTOR_ELTS (c
) = vals
;
787 /* ??? May not be necessary. Mirrors what build does. */
790 TREE_SIDE_EFFECTS (c
) = TREE_SIDE_EFFECTS (vals
);
791 TREE_READONLY (c
) = TREE_READONLY (vals
);
792 TREE_CONSTANT (c
) = TREE_CONSTANT (vals
);
793 TREE_INVARIANT (c
) = TREE_INVARIANT (vals
);
799 /* Return a new REAL_CST node whose type is TYPE and value is D. */
802 build_real (tree type
, REAL_VALUE_TYPE d
)
808 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
809 Consider doing it via real_convert now. */
811 v
= make_node (REAL_CST
);
812 dp
= ggc_alloc (sizeof (REAL_VALUE_TYPE
));
813 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
815 TREE_TYPE (v
) = type
;
816 TREE_REAL_CST_PTR (v
) = dp
;
817 TREE_OVERFLOW (v
) = TREE_CONSTANT_OVERFLOW (v
) = overflow
;
821 /* Return a new REAL_CST node whose type is TYPE
822 and whose value is the integer value of the INTEGER_CST node I. */
825 real_value_from_int_cst (tree type
, tree i
)
829 /* Clear all bits of the real value type so that we can later do
830 bitwise comparisons to see if two values are the same. */
831 memset (&d
, 0, sizeof d
);
833 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
834 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
835 TYPE_UNSIGNED (TREE_TYPE (i
)));
839 /* Given a tree representing an integer constant I, return a tree
840 representing the same value as a floating-point constant of type TYPE. */
843 build_real_from_int_cst (tree type
, tree i
)
846 int overflow
= TREE_OVERFLOW (i
);
848 v
= build_real (type
, real_value_from_int_cst (type
, i
));
850 TREE_OVERFLOW (v
) |= overflow
;
851 TREE_CONSTANT_OVERFLOW (v
) |= overflow
;
855 /* Return a newly constructed STRING_CST node whose value is
856 the LEN characters at STR.
857 The TREE_TYPE is not initialized. */
860 build_string (int len
, const char *str
)
865 length
= len
+ sizeof (struct tree_string
);
867 #ifdef GATHER_STATISTICS
868 tree_node_counts
[(int) c_kind
]++;
869 tree_node_sizes
[(int) c_kind
] += length
;
872 s
= ggc_alloc_tree (length
);
874 memset (s
, 0, sizeof (struct tree_common
));
875 TREE_SET_CODE (s
, STRING_CST
);
876 TREE_STRING_LENGTH (s
) = len
;
877 memcpy ((char *) TREE_STRING_POINTER (s
), str
, len
);
878 ((char *) TREE_STRING_POINTER (s
))[len
] = '\0';
883 /* Return a newly constructed COMPLEX_CST node whose value is
884 specified by the real and imaginary parts REAL and IMAG.
885 Both REAL and IMAG should be constant nodes. TYPE, if specified,
886 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
889 build_complex (tree type
, tree real
, tree imag
)
891 tree t
= make_node (COMPLEX_CST
);
893 TREE_REALPART (t
) = real
;
894 TREE_IMAGPART (t
) = imag
;
895 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
896 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
897 TREE_CONSTANT_OVERFLOW (t
)
898 = TREE_CONSTANT_OVERFLOW (real
) | TREE_CONSTANT_OVERFLOW (imag
);
902 /* Build a BINFO with LEN language slots. */
905 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
908 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
909 + VEC_embedded_size (tree
, base_binfos
));
911 #ifdef GATHER_STATISTICS
912 tree_node_counts
[(int) binfo_kind
]++;
913 tree_node_sizes
[(int) binfo_kind
] += length
;
916 t
= ggc_alloc_zone_stat (length
, &tree_zone PASS_MEM_STAT
);
918 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
920 TREE_SET_CODE (t
, TREE_BINFO
);
922 VEC_embedded_init (tree
, BINFO_BASE_BINFOS (t
), base_binfos
);
928 /* Build a newly constructed TREE_VEC node of length LEN. */
931 make_tree_vec_stat (int len MEM_STAT_DECL
)
934 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
936 #ifdef GATHER_STATISTICS
937 tree_node_counts
[(int) vec_kind
]++;
938 tree_node_sizes
[(int) vec_kind
] += length
;
941 t
= ggc_alloc_zone_stat (length
, &tree_zone PASS_MEM_STAT
);
943 memset (t
, 0, length
);
945 TREE_SET_CODE (t
, TREE_VEC
);
946 TREE_VEC_LENGTH (t
) = len
;
951 /* Return 1 if EXPR is the integer constant zero or a complex constant
955 integer_zerop (tree expr
)
959 return ((TREE_CODE (expr
) == INTEGER_CST
960 && ! TREE_CONSTANT_OVERFLOW (expr
)
961 && TREE_INT_CST_LOW (expr
) == 0
962 && TREE_INT_CST_HIGH (expr
) == 0)
963 || (TREE_CODE (expr
) == COMPLEX_CST
964 && integer_zerop (TREE_REALPART (expr
))
965 && integer_zerop (TREE_IMAGPART (expr
))));
968 /* Return 1 if EXPR is the integer constant one or the corresponding
972 integer_onep (tree expr
)
976 return ((TREE_CODE (expr
) == INTEGER_CST
977 && ! TREE_CONSTANT_OVERFLOW (expr
)
978 && TREE_INT_CST_LOW (expr
) == 1
979 && TREE_INT_CST_HIGH (expr
) == 0)
980 || (TREE_CODE (expr
) == COMPLEX_CST
981 && integer_onep (TREE_REALPART (expr
))
982 && integer_zerop (TREE_IMAGPART (expr
))));
985 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
986 it contains. Likewise for the corresponding complex constant. */
989 integer_all_onesp (tree expr
)
996 if (TREE_CODE (expr
) == COMPLEX_CST
997 && integer_all_onesp (TREE_REALPART (expr
))
998 && integer_zerop (TREE_IMAGPART (expr
)))
1001 else if (TREE_CODE (expr
) != INTEGER_CST
1002 || TREE_CONSTANT_OVERFLOW (expr
))
1005 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1007 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1008 && TREE_INT_CST_HIGH (expr
) == -1);
1010 /* Note that using TYPE_PRECISION here is wrong. We care about the
1011 actual bits, not the (arbitrary) range of the type. */
1012 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
)));
1013 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1015 HOST_WIDE_INT high_value
;
1018 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1020 /* Can not handle precisions greater than twice the host int size. */
1021 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1022 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1023 /* Shifting by the host word size is undefined according to the ANSI
1024 standard, so we must handle this as a special case. */
1027 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1029 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1030 && TREE_INT_CST_HIGH (expr
) == high_value
);
1033 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1036 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1040 integer_pow2p (tree expr
)
1043 HOST_WIDE_INT high
, low
;
1047 if (TREE_CODE (expr
) == COMPLEX_CST
1048 && integer_pow2p (TREE_REALPART (expr
))
1049 && integer_zerop (TREE_IMAGPART (expr
)))
1052 if (TREE_CODE (expr
) != INTEGER_CST
|| TREE_CONSTANT_OVERFLOW (expr
))
1055 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1056 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1057 high
= TREE_INT_CST_HIGH (expr
);
1058 low
= TREE_INT_CST_LOW (expr
);
1060 /* First clear all bits that are beyond the type's precision in case
1061 we've been sign extended. */
1063 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1065 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1066 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1070 if (prec
< HOST_BITS_PER_WIDE_INT
)
1071 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1074 if (high
== 0 && low
== 0)
1077 return ((high
== 0 && (low
& (low
- 1)) == 0)
1078 || (low
== 0 && (high
& (high
- 1)) == 0));
1081 /* Return 1 if EXPR is an integer constant other than zero or a
1082 complex constant other than zero. */
1085 integer_nonzerop (tree expr
)
1089 return ((TREE_CODE (expr
) == INTEGER_CST
1090 && ! TREE_CONSTANT_OVERFLOW (expr
)
1091 && (TREE_INT_CST_LOW (expr
) != 0
1092 || TREE_INT_CST_HIGH (expr
) != 0))
1093 || (TREE_CODE (expr
) == COMPLEX_CST
1094 && (integer_nonzerop (TREE_REALPART (expr
))
1095 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1098 /* Return the power of two represented by a tree node known to be a
1102 tree_log2 (tree expr
)
1105 HOST_WIDE_INT high
, low
;
1109 if (TREE_CODE (expr
) == COMPLEX_CST
)
1110 return tree_log2 (TREE_REALPART (expr
));
1112 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1113 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1115 high
= TREE_INT_CST_HIGH (expr
);
1116 low
= TREE_INT_CST_LOW (expr
);
1118 /* First clear all bits that are beyond the type's precision in case
1119 we've been sign extended. */
1121 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
)
1123 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1124 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1128 if (prec
< HOST_BITS_PER_WIDE_INT
)
1129 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1132 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1133 : exact_log2 (low
));
1136 /* Similar, but return the largest integer Y such that 2 ** Y is less
1137 than or equal to EXPR. */
1140 tree_floor_log2 (tree expr
)
1143 HOST_WIDE_INT high
, low
;
1147 if (TREE_CODE (expr
) == COMPLEX_CST
)
1148 return tree_log2 (TREE_REALPART (expr
));
1150 prec
= (POINTER_TYPE_P (TREE_TYPE (expr
))
1151 ? POINTER_SIZE
: TYPE_PRECISION (TREE_TYPE (expr
)));
1153 high
= TREE_INT_CST_HIGH (expr
);
1154 low
= TREE_INT_CST_LOW (expr
);
1156 /* First clear all bits that are beyond the type's precision in case
1157 we've been sign extended. Ignore if type's precision hasn't been set
1158 since what we are doing is setting it. */
1160 if (prec
== 2 * HOST_BITS_PER_WIDE_INT
|| prec
== 0)
1162 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1163 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1167 if (prec
< HOST_BITS_PER_WIDE_INT
)
1168 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1171 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1172 : floor_log2 (low
));
1175 /* Return 1 if EXPR is the real constant zero. */
1178 real_zerop (tree expr
)
1182 return ((TREE_CODE (expr
) == REAL_CST
1183 && ! TREE_CONSTANT_OVERFLOW (expr
)
1184 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
))
1185 || (TREE_CODE (expr
) == COMPLEX_CST
1186 && real_zerop (TREE_REALPART (expr
))
1187 && real_zerop (TREE_IMAGPART (expr
))));
1190 /* Return 1 if EXPR is the real constant one in real or complex form. */
1193 real_onep (tree expr
)
1197 return ((TREE_CODE (expr
) == REAL_CST
1198 && ! TREE_CONSTANT_OVERFLOW (expr
)
1199 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
))
1200 || (TREE_CODE (expr
) == COMPLEX_CST
1201 && real_onep (TREE_REALPART (expr
))
1202 && real_zerop (TREE_IMAGPART (expr
))));
1205 /* Return 1 if EXPR is the real constant two. */
1208 real_twop (tree expr
)
1212 return ((TREE_CODE (expr
) == REAL_CST
1213 && ! TREE_CONSTANT_OVERFLOW (expr
)
1214 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
))
1215 || (TREE_CODE (expr
) == COMPLEX_CST
1216 && real_twop (TREE_REALPART (expr
))
1217 && real_zerop (TREE_IMAGPART (expr
))));
1220 /* Return 1 if EXPR is the real constant minus one. */
1223 real_minus_onep (tree expr
)
1227 return ((TREE_CODE (expr
) == REAL_CST
1228 && ! TREE_CONSTANT_OVERFLOW (expr
)
1229 && REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
))
1230 || (TREE_CODE (expr
) == COMPLEX_CST
1231 && real_minus_onep (TREE_REALPART (expr
))
1232 && real_zerop (TREE_IMAGPART (expr
))));
1235 /* Nonzero if EXP is a constant or a cast of a constant. */
1238 really_constant_p (tree exp
)
1240 /* This is not quite the same as STRIP_NOPS. It does more. */
1241 while (TREE_CODE (exp
) == NOP_EXPR
1242 || TREE_CODE (exp
) == CONVERT_EXPR
1243 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1244 exp
= TREE_OPERAND (exp
, 0);
1245 return TREE_CONSTANT (exp
);
1248 /* Return first list element whose TREE_VALUE is ELEM.
1249 Return 0 if ELEM is not in LIST. */
1252 value_member (tree elem
, tree list
)
1256 if (elem
== TREE_VALUE (list
))
1258 list
= TREE_CHAIN (list
);
1263 /* Return first list element whose TREE_PURPOSE is ELEM.
1264 Return 0 if ELEM is not in LIST. */
1267 purpose_member (tree elem
, tree list
)
1271 if (elem
== TREE_PURPOSE (list
))
1273 list
= TREE_CHAIN (list
);
1278 /* Return nonzero if ELEM is part of the chain CHAIN. */
1281 chain_member (tree elem
, tree chain
)
1287 chain
= TREE_CHAIN (chain
);
1293 /* Return the length of a chain of nodes chained through TREE_CHAIN.
1294 We expect a null pointer to mark the end of the chain.
1295 This is the Lisp primitive `length'. */
1298 list_length (tree t
)
1301 #ifdef ENABLE_TREE_CHECKING
1309 #ifdef ENABLE_TREE_CHECKING
1312 gcc_assert (p
!= q
);
1320 /* Returns the number of FIELD_DECLs in TYPE. */
1323 fields_length (tree type
)
1325 tree t
= TYPE_FIELDS (type
);
1328 for (; t
; t
= TREE_CHAIN (t
))
1329 if (TREE_CODE (t
) == FIELD_DECL
)
1335 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
1336 by modifying the last node in chain 1 to point to chain 2.
1337 This is the Lisp primitive `nconc'. */
1340 chainon (tree op1
, tree op2
)
1349 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
1351 TREE_CHAIN (t1
) = op2
;
1353 #ifdef ENABLE_TREE_CHECKING
1356 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
1357 gcc_assert (t2
!= t1
);
1364 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
1367 tree_last (tree chain
)
1371 while ((next
= TREE_CHAIN (chain
)))
1376 /* Reverse the order of elements in the chain T,
1377 and return the new head of the chain (old last element). */
1382 tree prev
= 0, decl
, next
;
1383 for (decl
= t
; decl
; decl
= next
)
1385 next
= TREE_CHAIN (decl
);
1386 TREE_CHAIN (decl
) = prev
;
1392 /* Return a newly created TREE_LIST node whose
1393 purpose and value fields are PARM and VALUE. */
1396 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
1398 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
1399 TREE_PURPOSE (t
) = parm
;
1400 TREE_VALUE (t
) = value
;
1404 /* Return a newly created TREE_LIST node whose
1405 purpose and value fields are PURPOSE and VALUE
1406 and whose TREE_CHAIN is CHAIN. */
1409 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
1413 node
= ggc_alloc_zone_stat (sizeof (struct tree_list
),
1414 &tree_zone PASS_MEM_STAT
);
1416 memset (node
, 0, sizeof (struct tree_common
));
1418 #ifdef GATHER_STATISTICS
1419 tree_node_counts
[(int) x_kind
]++;
1420 tree_node_sizes
[(int) x_kind
] += sizeof (struct tree_list
);
1423 TREE_SET_CODE (node
, TREE_LIST
);
1424 TREE_CHAIN (node
) = chain
;
1425 TREE_PURPOSE (node
) = purpose
;
1426 TREE_VALUE (node
) = value
;
1431 /* Return the size nominally occupied by an object of type TYPE
1432 when it resides in memory. The value is measured in units of bytes,
1433 and its data type is that normally used for type sizes
1434 (which is the first type created by make_signed_type or
1435 make_unsigned_type). */
1438 size_in_bytes (tree type
)
1442 if (type
== error_mark_node
)
1443 return integer_zero_node
;
1445 type
= TYPE_MAIN_VARIANT (type
);
1446 t
= TYPE_SIZE_UNIT (type
);
1450 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
1451 return size_zero_node
;
1454 if (TREE_CODE (t
) == INTEGER_CST
)
1455 t
= force_fit_type (t
, 0, false, false);
1460 /* Return the size of TYPE (in bytes) as a wide integer
1461 or return -1 if the size can vary or is larger than an integer. */
1464 int_size_in_bytes (tree type
)
1468 if (type
== error_mark_node
)
1471 type
= TYPE_MAIN_VARIANT (type
);
1472 t
= TYPE_SIZE_UNIT (type
);
1474 || TREE_CODE (t
) != INTEGER_CST
1475 || TREE_OVERFLOW (t
)
1476 || TREE_INT_CST_HIGH (t
) != 0
1477 /* If the result would appear negative, it's too big to represent. */
1478 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
1481 return TREE_INT_CST_LOW (t
);
1484 /* Return the bit position of FIELD, in bits from the start of the record.
1485 This is a tree of type bitsizetype. */
1488 bit_position (tree field
)
1490 return bit_from_pos (DECL_FIELD_OFFSET (field
),
1491 DECL_FIELD_BIT_OFFSET (field
));
1494 /* Likewise, but return as an integer. Abort if it cannot be represented
1495 in that way (since it could be a signed value, we don't have the option
1496 of returning -1 like int_size_in_byte can. */
1499 int_bit_position (tree field
)
1501 return tree_low_cst (bit_position (field
), 0);
1504 /* Return the byte position of FIELD, in bytes from the start of the record.
1505 This is a tree of type sizetype. */
1508 byte_position (tree field
)
1510 return byte_from_pos (DECL_FIELD_OFFSET (field
),
1511 DECL_FIELD_BIT_OFFSET (field
));
1514 /* Likewise, but return as an integer. Abort if it cannot be represented
1515 in that way (since it could be a signed value, we don't have the option
1516 of returning -1 like int_size_in_byte can. */
1519 int_byte_position (tree field
)
1521 return tree_low_cst (byte_position (field
), 0);
1524 /* Return the strictest alignment, in bits, that T is known to have. */
1529 unsigned int align0
, align1
;
1531 switch (TREE_CODE (t
))
1533 case NOP_EXPR
: case CONVERT_EXPR
: case NON_LVALUE_EXPR
:
1534 /* If we have conversions, we know that the alignment of the
1535 object must meet each of the alignments of the types. */
1536 align0
= expr_align (TREE_OPERAND (t
, 0));
1537 align1
= TYPE_ALIGN (TREE_TYPE (t
));
1538 return MAX (align0
, align1
);
1540 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
1541 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
1542 case CLEANUP_POINT_EXPR
:
1543 /* These don't change the alignment of an object. */
1544 return expr_align (TREE_OPERAND (t
, 0));
1547 /* The best we can do is say that the alignment is the least aligned
1549 align0
= expr_align (TREE_OPERAND (t
, 1));
1550 align1
= expr_align (TREE_OPERAND (t
, 2));
1551 return MIN (align0
, align1
);
1553 case LABEL_DECL
: case CONST_DECL
:
1554 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
1555 if (DECL_ALIGN (t
) != 0)
1556 return DECL_ALIGN (t
);
1560 return FUNCTION_BOUNDARY
;
1566 /* Otherwise take the alignment from that of the type. */
1567 return TYPE_ALIGN (TREE_TYPE (t
));
1570 /* Return, as a tree node, the number of elements for TYPE (which is an
1571 ARRAY_TYPE) minus one. This counts only elements of the top array. */
1574 array_type_nelts (tree type
)
1576 tree index_type
, min
, max
;
1578 /* If they did it with unspecified bounds, then we should have already
1579 given an error about it before we got here. */
1580 if (! TYPE_DOMAIN (type
))
1581 return error_mark_node
;
1583 index_type
= TYPE_DOMAIN (type
);
1584 min
= TYPE_MIN_VALUE (index_type
);
1585 max
= TYPE_MAX_VALUE (index_type
);
1587 return (integer_zerop (min
)
1589 : fold (build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
)));
1592 /* If arg is static -- a reference to an object in static storage -- then
1593 return the object. This is not the same as the C meaning of `static'.
1594 If arg isn't static, return NULL. */
1599 switch (TREE_CODE (arg
))
1602 /* Nested functions are static, even though taking their address will
1603 involve a trampoline as we unnest the nested function and create
1604 the trampoline on the tree level. */
1608 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1609 && ! DECL_THREAD_LOCAL (arg
)
1610 && ! DECL_NON_ADDR_CONST_P (arg
)
1614 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
1618 return TREE_STATIC (arg
) ? arg
: NULL
;
1625 /* If the thing being referenced is not a field, then it is
1626 something language specific. */
1627 if (TREE_CODE (TREE_OPERAND (arg
, 1)) != FIELD_DECL
)
1628 return (*lang_hooks
.staticp
) (arg
);
1630 /* If we are referencing a bitfield, we can't evaluate an
1631 ADDR_EXPR at compile time and so it isn't a constant. */
1632 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
1635 return staticp (TREE_OPERAND (arg
, 0));
1640 case MISALIGNED_INDIRECT_REF
:
1641 case ALIGN_INDIRECT_REF
:
1643 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
1646 case ARRAY_RANGE_REF
:
1647 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
1648 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
1649 return staticp (TREE_OPERAND (arg
, 0));
1654 if ((unsigned int) TREE_CODE (arg
)
1655 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
1656 return lang_hooks
.staticp (arg
);
1662 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
1663 Do this to any expression which may be used in more than one place,
1664 but must be evaluated only once.
1666 Normally, expand_expr would reevaluate the expression each time.
1667 Calling save_expr produces something that is evaluated and recorded
1668 the first time expand_expr is called on it. Subsequent calls to
1669 expand_expr just reuse the recorded value.
1671 The call to expand_expr that generates code that actually computes
1672 the value is the first call *at compile time*. Subsequent calls
1673 *at compile time* generate code to use the saved value.
1674 This produces correct result provided that *at run time* control
1675 always flows through the insns made by the first expand_expr
1676 before reaching the other places where the save_expr was evaluated.
1677 You, the caller of save_expr, must make sure this is so.
1679 Constants, and certain read-only nodes, are returned with no
1680 SAVE_EXPR because that is safe. Expressions containing placeholders
1681 are not touched; see tree.def for an explanation of what these
1685 save_expr (tree expr
)
1687 tree t
= fold (expr
);
1690 /* If the tree evaluates to a constant, then we don't want to hide that
1691 fact (i.e. this allows further folding, and direct checks for constants).
1692 However, a read-only object that has side effects cannot be bypassed.
1693 Since it is no problem to reevaluate literals, we just return the
1695 inner
= skip_simple_arithmetic (t
);
1697 if (TREE_INVARIANT (inner
)
1698 || (TREE_READONLY (inner
) && ! TREE_SIDE_EFFECTS (inner
))
1699 || TREE_CODE (inner
) == SAVE_EXPR
1700 || TREE_CODE (inner
) == ERROR_MARK
)
1703 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
1704 it means that the size or offset of some field of an object depends on
1705 the value within another field.
1707 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
1708 and some variable since it would then need to be both evaluated once and
1709 evaluated more than once. Front-ends must assure this case cannot
1710 happen by surrounding any such subexpressions in their own SAVE_EXPR
1711 and forcing evaluation at the proper time. */
1712 if (contains_placeholder_p (inner
))
1715 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
1717 /* This expression might be placed ahead of a jump to ensure that the
1718 value was computed on both sides of the jump. So make sure it isn't
1719 eliminated as dead. */
1720 TREE_SIDE_EFFECTS (t
) = 1;
1721 TREE_INVARIANT (t
) = 1;
1725 /* Look inside EXPR and into any simple arithmetic operations. Return
1726 the innermost non-arithmetic node. */
1729 skip_simple_arithmetic (tree expr
)
1733 /* We don't care about whether this can be used as an lvalue in this
1735 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
1736 expr
= TREE_OPERAND (expr
, 0);
1738 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
1739 a constant, it will be more efficient to not make another SAVE_EXPR since
1740 it will allow better simplification and GCSE will be able to merge the
1741 computations if they actually occur. */
1745 if (UNARY_CLASS_P (inner
))
1746 inner
= TREE_OPERAND (inner
, 0);
1747 else if (BINARY_CLASS_P (inner
))
1749 if (TREE_INVARIANT (TREE_OPERAND (inner
, 1)))
1750 inner
= TREE_OPERAND (inner
, 0);
1751 else if (TREE_INVARIANT (TREE_OPERAND (inner
, 0)))
1752 inner
= TREE_OPERAND (inner
, 1);
1763 /* Return which tree structure is used by T. */
1765 enum tree_node_structure_enum
1766 tree_node_structure (tree t
)
1768 enum tree_code code
= TREE_CODE (t
);
1770 switch (TREE_CODE_CLASS (code
))
1772 case tcc_declaration
:
1777 case tcc_comparison
:
1780 case tcc_expression
:
1783 default: /* tcc_constant and tcc_exceptional */
1788 /* tcc_constant cases. */
1789 case INTEGER_CST
: return TS_INT_CST
;
1790 case REAL_CST
: return TS_REAL_CST
;
1791 case COMPLEX_CST
: return TS_COMPLEX
;
1792 case VECTOR_CST
: return TS_VECTOR
;
1793 case STRING_CST
: return TS_STRING
;
1794 /* tcc_exceptional cases. */
1795 case ERROR_MARK
: return TS_COMMON
;
1796 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
1797 case TREE_LIST
: return TS_LIST
;
1798 case TREE_VEC
: return TS_VEC
;
1799 case PHI_NODE
: return TS_PHI_NODE
;
1800 case SSA_NAME
: return TS_SSA_NAME
;
1801 case PLACEHOLDER_EXPR
: return TS_COMMON
;
1802 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
1803 case BLOCK
: return TS_BLOCK
;
1804 case TREE_BINFO
: return TS_BINFO
;
1805 case VALUE_HANDLE
: return TS_VALUE_HANDLE
;
1812 /* Return 1 if EXP contains a PLACEHOLDER_EXPR; i.e., if it represents a size
1813 or offset that depends on a field within a record. */
1816 contains_placeholder_p (tree exp
)
1818 enum tree_code code
;
1823 code
= TREE_CODE (exp
);
1824 if (code
== PLACEHOLDER_EXPR
)
1827 switch (TREE_CODE_CLASS (code
))
1830 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
1831 position computations since they will be converted into a
1832 WITH_RECORD_EXPR involving the reference, which will assume
1833 here will be valid. */
1834 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1836 case tcc_exceptional
:
1837 if (code
== TREE_LIST
)
1838 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
1839 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
1844 case tcc_comparison
:
1845 case tcc_expression
:
1849 /* Ignoring the first operand isn't quite right, but works best. */
1850 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
1853 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1854 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
1855 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
1861 switch (TREE_CODE_LENGTH (code
))
1864 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
1866 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
1867 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
1878 /* Return true if any part of the computation of TYPE involves a
1879 PLACEHOLDER_EXPR. This includes size, bounds, qualifiers
1880 (for QUAL_UNION_TYPE) and field positions. */
1883 type_contains_placeholder_1 (tree type
)
1885 /* If the size contains a placeholder or the parent type (component type in
1886 the case of arrays) type involves a placeholder, this type does. */
1887 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
1888 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
1889 || (TREE_TYPE (type
) != 0
1890 && type_contains_placeholder_p (TREE_TYPE (type
))))
1893 /* Now do type-specific checks. Note that the last part of the check above
1894 greatly limits what we have to do below. */
1895 switch (TREE_CODE (type
))
1904 case REFERENCE_TYPE
:
1913 /* Here we just check the bounds. */
1914 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
1915 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
1918 /* We're already checked the component type (TREE_TYPE), so just check
1920 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
1924 case QUAL_UNION_TYPE
:
1928 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1929 if (TREE_CODE (field
) == FIELD_DECL
1930 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
1931 || (TREE_CODE (type
) == QUAL_UNION_TYPE
1932 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
1933 || type_contains_placeholder_p (TREE_TYPE (field
))))
1945 type_contains_placeholder_p (tree type
)
1949 /* If the contains_placeholder_bits field has been initialized,
1950 then we know the answer. */
1951 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
1952 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
1954 /* Indicate that we've seen this type node, and the answer is false.
1955 This is what we want to return if we run into recursion via fields. */
1956 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
1958 /* Compute the real value. */
1959 result
= type_contains_placeholder_1 (type
);
1961 /* Store the real value. */
1962 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
1967 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
1968 return a tree with all occurrences of references to F in a
1969 PLACEHOLDER_EXPR replaced by R. Note that we assume here that EXP
1970 contains only arithmetic expressions or a CALL_EXPR with a
1971 PLACEHOLDER_EXPR occurring only in its arglist. */
1974 substitute_in_expr (tree exp
, tree f
, tree r
)
1976 enum tree_code code
= TREE_CODE (exp
);
1981 /* We handle TREE_LIST and COMPONENT_REF separately. */
1982 if (code
== TREE_LIST
)
1984 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
1985 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
1986 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
1989 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
1991 else if (code
== COMPONENT_REF
)
1993 /* If this expression is getting a value from a PLACEHOLDER_EXPR
1994 and it is the right field, replace it with R. */
1995 for (inner
= TREE_OPERAND (exp
, 0);
1996 REFERENCE_CLASS_P (inner
);
1997 inner
= TREE_OPERAND (inner
, 0))
1999 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
2000 && TREE_OPERAND (exp
, 1) == f
)
2003 /* If this expression hasn't been completed let, leave it alone. */
2004 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& TREE_TYPE (inner
) == 0)
2007 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2008 if (op0
== TREE_OPERAND (exp
, 0))
2011 new = fold (build3 (COMPONENT_REF
, TREE_TYPE (exp
),
2012 op0
, TREE_OPERAND (exp
, 1), NULL_TREE
));
2015 switch (TREE_CODE_CLASS (code
))
2018 case tcc_declaration
:
2021 case tcc_exceptional
:
2024 case tcc_comparison
:
2025 case tcc_expression
:
2027 switch (TREE_CODE_LENGTH (code
))
2033 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2034 if (op0
== TREE_OPERAND (exp
, 0))
2037 new = fold (build1 (code
, TREE_TYPE (exp
), op0
));
2041 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2042 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2044 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2047 new = fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2051 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
2052 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
2053 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
2055 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2056 && op2
== TREE_OPERAND (exp
, 2))
2059 new = fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2071 TREE_READONLY (new) = TREE_READONLY (exp
);
2075 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
2076 for it within OBJ, a tree that is an object or a chain of references. */
2079 substitute_placeholder_in_expr (tree exp
, tree obj
)
2081 enum tree_code code
= TREE_CODE (exp
);
2082 tree op0
, op1
, op2
, op3
;
2084 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
2085 in the chain of OBJ. */
2086 if (code
== PLACEHOLDER_EXPR
)
2088 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
2091 for (elt
= obj
; elt
!= 0;
2092 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2093 || TREE_CODE (elt
) == COND_EXPR
)
2094 ? TREE_OPERAND (elt
, 1)
2095 : (REFERENCE_CLASS_P (elt
)
2096 || UNARY_CLASS_P (elt
)
2097 || BINARY_CLASS_P (elt
)
2098 || EXPRESSION_CLASS_P (elt
))
2099 ? TREE_OPERAND (elt
, 0) : 0))
2100 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
2103 for (elt
= obj
; elt
!= 0;
2104 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
2105 || TREE_CODE (elt
) == COND_EXPR
)
2106 ? TREE_OPERAND (elt
, 1)
2107 : (REFERENCE_CLASS_P (elt
)
2108 || UNARY_CLASS_P (elt
)
2109 || BINARY_CLASS_P (elt
)
2110 || EXPRESSION_CLASS_P (elt
))
2111 ? TREE_OPERAND (elt
, 0) : 0))
2112 if (POINTER_TYPE_P (TREE_TYPE (elt
))
2113 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
2115 return fold (build1 (INDIRECT_REF
, need_type
, elt
));
2117 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
2118 survives until RTL generation, there will be an error. */
2122 /* TREE_LIST is special because we need to look at TREE_VALUE
2123 and TREE_CHAIN, not TREE_OPERANDS. */
2124 else if (code
== TREE_LIST
)
2126 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
2127 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
2128 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
2131 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
2134 switch (TREE_CODE_CLASS (code
))
2137 case tcc_declaration
:
2140 case tcc_exceptional
:
2143 case tcc_comparison
:
2144 case tcc_expression
:
2147 switch (TREE_CODE_LENGTH (code
))
2153 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2154 if (op0
== TREE_OPERAND (exp
, 0))
2157 return fold (build1 (code
, TREE_TYPE (exp
), op0
));
2160 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2161 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2163 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
2166 return fold (build2 (code
, TREE_TYPE (exp
), op0
, op1
));
2169 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2170 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2171 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2173 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2174 && op2
== TREE_OPERAND (exp
, 2))
2177 return fold (build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
));
2180 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
2181 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
2182 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
2183 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
2185 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
2186 && op2
== TREE_OPERAND (exp
, 2)
2187 && op3
== TREE_OPERAND (exp
, 3))
2190 return fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
2202 /* Stabilize a reference so that we can use it any number of times
2203 without causing its operands to be evaluated more than once.
2204 Returns the stabilized reference. This works by means of save_expr,
2205 so see the caveats in the comments about save_expr.
2207 Also allows conversion expressions whose operands are references.
2208 Any other kind of expression is returned unchanged. */
2211 stabilize_reference (tree ref
)
2214 enum tree_code code
= TREE_CODE (ref
);
2221 /* No action is needed in this case. */
2227 case FIX_TRUNC_EXPR
:
2228 case FIX_FLOOR_EXPR
:
2229 case FIX_ROUND_EXPR
:
2231 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
2235 result
= build_nt (INDIRECT_REF
,
2236 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
2240 result
= build_nt (COMPONENT_REF
,
2241 stabilize_reference (TREE_OPERAND (ref
, 0)),
2242 TREE_OPERAND (ref
, 1), NULL_TREE
);
2246 result
= build_nt (BIT_FIELD_REF
,
2247 stabilize_reference (TREE_OPERAND (ref
, 0)),
2248 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2249 stabilize_reference_1 (TREE_OPERAND (ref
, 2)));
2253 result
= build_nt (ARRAY_REF
,
2254 stabilize_reference (TREE_OPERAND (ref
, 0)),
2255 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2256 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2259 case ARRAY_RANGE_REF
:
2260 result
= build_nt (ARRAY_RANGE_REF
,
2261 stabilize_reference (TREE_OPERAND (ref
, 0)),
2262 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
2263 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
2267 /* We cannot wrap the first expression in a SAVE_EXPR, as then
2268 it wouldn't be ignored. This matters when dealing with
2270 return stabilize_reference_1 (ref
);
2272 /* If arg isn't a kind of lvalue we recognize, make no change.
2273 Caller should recognize the error for an invalid lvalue. */
2278 return error_mark_node
;
2281 TREE_TYPE (result
) = TREE_TYPE (ref
);
2282 TREE_READONLY (result
) = TREE_READONLY (ref
);
2283 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
2284 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
2289 /* Subroutine of stabilize_reference; this is called for subtrees of
2290 references. Any expression with side-effects must be put in a SAVE_EXPR
2291 to ensure that it is only evaluated once.
2293 We don't put SAVE_EXPR nodes around everything, because assigning very
2294 simple expressions to temporaries causes us to miss good opportunities
2295 for optimizations. Among other things, the opportunity to fold in the
2296 addition of a constant into an addressing mode often gets lost, e.g.
2297 "y[i+1] += x;". In general, we take the approach that we should not make
2298 an assignment unless we are forced into it - i.e., that any non-side effect
2299 operator should be allowed, and that cse should take care of coalescing
2300 multiple utterances of the same expression should that prove fruitful. */
2303 stabilize_reference_1 (tree e
)
2306 enum tree_code code
= TREE_CODE (e
);
2308 /* We cannot ignore const expressions because it might be a reference
2309 to a const array but whose index contains side-effects. But we can
2310 ignore things that are actual constant or that already have been
2311 handled by this function. */
2313 if (TREE_INVARIANT (e
))
2316 switch (TREE_CODE_CLASS (code
))
2318 case tcc_exceptional
:
2320 case tcc_declaration
:
2321 case tcc_comparison
:
2323 case tcc_expression
:
2325 /* If the expression has side-effects, then encase it in a SAVE_EXPR
2326 so that it will only be evaluated once. */
2327 /* The reference (r) and comparison (<) classes could be handled as
2328 below, but it is generally faster to only evaluate them once. */
2329 if (TREE_SIDE_EFFECTS (e
))
2330 return save_expr (e
);
2334 /* Constants need no processing. In fact, we should never reach
2339 /* Division is slow and tends to be compiled with jumps,
2340 especially the division by powers of 2 that is often
2341 found inside of an array reference. So do it just once. */
2342 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
2343 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
2344 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
2345 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
2346 return save_expr (e
);
2347 /* Recursively stabilize each operand. */
2348 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
2349 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
2353 /* Recursively stabilize each operand. */
2354 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
2361 TREE_TYPE (result
) = TREE_TYPE (e
);
2362 TREE_READONLY (result
) = TREE_READONLY (e
);
2363 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
2364 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
2365 TREE_INVARIANT (result
) = 1;
2370 /* Low-level constructors for expressions. */
2372 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
2373 TREE_INVARIANT, and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
2376 recompute_tree_invarant_for_addr_expr (tree t
)
2379 bool tc
= true, ti
= true, se
= false;
2381 /* We started out assuming this address is both invariant and constant, but
2382 does not have side effects. Now go down any handled components and see if
2383 any of them involve offsets that are either non-constant or non-invariant.
2384 Also check for side-effects.
2386 ??? Note that this code makes no attempt to deal with the case where
2387 taking the address of something causes a copy due to misalignment. */
2389 #define UPDATE_TITCSE(NODE) \
2390 do { tree _node = (NODE); \
2391 if (_node && !TREE_INVARIANT (_node)) ti = false; \
2392 if (_node && !TREE_CONSTANT (_node)) tc = false; \
2393 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
2395 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
2396 node
= TREE_OPERAND (node
, 0))
2398 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
2399 array reference (probably made temporarily by the G++ front end),
2400 so ignore all the operands. */
2401 if ((TREE_CODE (node
) == ARRAY_REF
2402 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
2403 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
2405 UPDATE_TITCSE (TREE_OPERAND (node
, 1));
2406 if (TREE_OPERAND (node
, 2))
2407 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2408 if (TREE_OPERAND (node
, 3))
2409 UPDATE_TITCSE (TREE_OPERAND (node
, 3));
2411 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
2412 FIELD_DECL, apparently. The G++ front end can put something else
2413 there, at least temporarily. */
2414 else if (TREE_CODE (node
) == COMPONENT_REF
2415 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
2417 if (TREE_OPERAND (node
, 2))
2418 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2420 else if (TREE_CODE (node
) == BIT_FIELD_REF
)
2421 UPDATE_TITCSE (TREE_OPERAND (node
, 2));
2424 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
2425 the address, since &(*a)->b is a form of addition. If it's a decl, it's
2426 invariant and constant if the decl is static. It's also invariant if it's
2427 a decl in the current function. Taking the address of a volatile variable
2428 is not volatile. If it's a constant, the address is both invariant and
2429 constant. Otherwise it's neither. */
2430 if (TREE_CODE (node
) == INDIRECT_REF
)
2431 UPDATE_TITCSE (TREE_OPERAND (node
, 0));
2432 else if (DECL_P (node
))
2436 else if (decl_function_context (node
) == current_function_decl
2437 /* Addresses of thread-local variables are invariant. */
2438 || (TREE_CODE (node
) == VAR_DECL
&& DECL_THREAD_LOCAL (node
)))
2443 else if (CONSTANT_CLASS_P (node
))
2448 se
|= TREE_SIDE_EFFECTS (node
);
2451 TREE_CONSTANT (t
) = tc
;
2452 TREE_INVARIANT (t
) = ti
;
2453 TREE_SIDE_EFFECTS (t
) = se
;
2454 #undef UPDATE_TITCSE
2457 /* Build an expression of code CODE, data type TYPE, and operands as
2458 specified. Expressions and reference nodes can be created this way.
2459 Constants, decls, types and misc nodes cannot be.
2461 We define 5 non-variadic functions, from 0 to 4 arguments. This is
2462 enough for all extant tree codes. These functions can be called
2463 directly (preferably!), but can also be obtained via GCC preprocessor
2464 magic within the build macro. */
2467 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
2471 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
2473 t
= make_node_stat (code PASS_MEM_STAT
);
2480 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
2482 int length
= sizeof (struct tree_exp
);
2483 #ifdef GATHER_STATISTICS
2484 tree_node_kind kind
;
2488 #ifdef GATHER_STATISTICS
2489 switch (TREE_CODE_CLASS (code
))
2491 case tcc_statement
: /* an expression with side effects */
2494 case tcc_reference
: /* a reference */
2502 tree_node_counts
[(int) kind
]++;
2503 tree_node_sizes
[(int) kind
] += length
;
2506 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
2508 t
= ggc_alloc_zone_stat (length
, &tree_zone PASS_MEM_STAT
);
2510 memset (t
, 0, sizeof (struct tree_common
));
2512 TREE_SET_CODE (t
, code
);
2514 TREE_TYPE (t
) = type
;
2515 #ifdef USE_MAPPED_LOCATION
2516 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
2518 SET_EXPR_LOCUS (t
, NULL
);
2520 TREE_COMPLEXITY (t
) = 0;
2521 TREE_OPERAND (t
, 0) = node
;
2522 TREE_BLOCK (t
) = NULL_TREE
;
2523 if (node
&& !TYPE_P (node
))
2525 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
2526 TREE_READONLY (t
) = TREE_READONLY (node
);
2529 if (TREE_CODE_CLASS (code
) == tcc_statement
)
2530 TREE_SIDE_EFFECTS (t
) = 1;
2536 case PREDECREMENT_EXPR
:
2537 case PREINCREMENT_EXPR
:
2538 case POSTDECREMENT_EXPR
:
2539 case POSTINCREMENT_EXPR
:
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 /* BLOCK nodes are used to represent the structure of binding contours
2808 and declarations, once those contours have been exited and their contents
2809 compiled. This information is used for outputting debugging info. */
2812 build_block (tree vars
, tree tags ATTRIBUTE_UNUSED
, tree subblocks
,
2813 tree supercontext
, tree chain
)
2815 tree block
= make_node (BLOCK
);
2817 BLOCK_VARS (block
) = vars
;
2818 BLOCK_SUBBLOCKS (block
) = subblocks
;
2819 BLOCK_SUPERCONTEXT (block
) = supercontext
;
2820 BLOCK_CHAIN (block
) = chain
;
2824 #if 1 /* ! defined(USE_MAPPED_LOCATION) */
2825 /* ??? gengtype doesn't handle conditionals */
2826 static GTY(()) tree last_annotated_node
;
2829 #ifdef USE_MAPPED_LOCATION
2832 expand_location (source_location loc
)
2834 expanded_location xloc
;
2835 if (loc
== 0) { xloc
.file
= NULL
; xloc
.line
= 0; xloc
.column
= 0; }
2838 const struct line_map
*map
= linemap_lookup (&line_table
, loc
);
2839 xloc
.file
= map
->to_file
;
2840 xloc
.line
= SOURCE_LINE (map
, loc
);
2841 xloc
.column
= SOURCE_COLUMN (map
, loc
);
2848 /* Record the exact location where an expression or an identifier were
2852 annotate_with_file_line (tree node
, const char *file
, int line
)
2854 /* Roughly one percent of the calls to this function are to annotate
2855 a node with the same information already attached to that node!
2856 Just return instead of wasting memory. */
2857 if (EXPR_LOCUS (node
)
2858 && (EXPR_FILENAME (node
) == file
2859 || ! strcmp (EXPR_FILENAME (node
), file
))
2860 && EXPR_LINENO (node
) == line
)
2862 last_annotated_node
= node
;
2866 /* In heavily macroized code (such as GCC itself) this single
2867 entry cache can reduce the number of allocations by more
2869 if (last_annotated_node
2870 && EXPR_LOCUS (last_annotated_node
)
2871 && (EXPR_FILENAME (last_annotated_node
) == file
2872 || ! strcmp (EXPR_FILENAME (last_annotated_node
), file
))
2873 && EXPR_LINENO (last_annotated_node
) == line
)
2875 SET_EXPR_LOCUS (node
, EXPR_LOCUS (last_annotated_node
));
2879 SET_EXPR_LOCUS (node
, ggc_alloc (sizeof (location_t
)));
2880 EXPR_LINENO (node
) = line
;
2881 EXPR_FILENAME (node
) = file
;
2882 last_annotated_node
= node
;
2886 annotate_with_locus (tree node
, location_t locus
)
2888 annotate_with_file_line (node
, locus
.file
, locus
.line
);
2892 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
2896 build_decl_attribute_variant (tree ddecl
, tree attribute
)
2898 DECL_ATTRIBUTES (ddecl
) = attribute
;
2902 /* Borrowed from hashtab.c iterative_hash implementation. */
2903 #define mix(a,b,c) \
2905 a -= b; a -= c; a ^= (c>>13); \
2906 b -= c; b -= a; b ^= (a<< 8); \
2907 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
2908 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
2909 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
2910 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
2911 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
2912 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
2913 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
2917 /* Produce good hash value combining VAL and VAL2. */
2918 static inline hashval_t
2919 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
2921 /* the golden ratio; an arbitrary value. */
2922 hashval_t a
= 0x9e3779b9;
2928 /* Produce good hash value combining PTR and VAL2. */
2929 static inline hashval_t
2930 iterative_hash_pointer (void *ptr
, hashval_t val2
)
2932 if (sizeof (ptr
) == sizeof (hashval_t
))
2933 return iterative_hash_hashval_t ((size_t) ptr
, val2
);
2936 hashval_t a
= (hashval_t
) (size_t) ptr
;
2937 /* Avoid warnings about shifting of more than the width of the type on
2938 hosts that won't execute this path. */
2940 hashval_t b
= (hashval_t
) ((size_t) ptr
>> (sizeof (hashval_t
) * 8 + zero
));
2946 /* Produce good hash value combining VAL and VAL2. */
2947 static inline hashval_t
2948 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
2950 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
2951 return iterative_hash_hashval_t (val
, val2
);
2954 hashval_t a
= (hashval_t
) val
;
2955 /* Avoid warnings about shifting of more than the width of the type on
2956 hosts that won't execute this path. */
2958 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
2960 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
2962 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
2963 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
2970 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
2973 Record such modified types already made so we don't make duplicates. */
2976 build_type_attribute_variant (tree ttype
, tree attribute
)
2978 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
2980 hashval_t hashcode
= 0;
2982 enum tree_code code
= TREE_CODE (ttype
);
2984 ntype
= copy_node (ttype
);
2986 TYPE_POINTER_TO (ntype
) = 0;
2987 TYPE_REFERENCE_TO (ntype
) = 0;
2988 TYPE_ATTRIBUTES (ntype
) = attribute
;
2990 /* Create a new main variant of TYPE. */
2991 TYPE_MAIN_VARIANT (ntype
) = ntype
;
2992 TYPE_NEXT_VARIANT (ntype
) = 0;
2993 set_type_quals (ntype
, TYPE_UNQUALIFIED
);
2995 hashcode
= iterative_hash_object (code
, hashcode
);
2996 if (TREE_TYPE (ntype
))
2997 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
2999 hashcode
= attribute_hash_list (attribute
, hashcode
);
3001 switch (TREE_CODE (ntype
))
3004 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
3007 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
3011 hashcode
= iterative_hash_object
3012 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
3013 hashcode
= iterative_hash_object
3014 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
3018 unsigned int precision
= TYPE_PRECISION (ntype
);
3019 hashcode
= iterative_hash_object (precision
, hashcode
);
3026 ntype
= type_hash_canon (hashcode
, ntype
);
3027 ttype
= build_qualified_type (ntype
, TYPE_QUALS (ttype
));
3034 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3037 We try both `text' and `__text__', ATTR may be either one. */
3038 /* ??? It might be a reasonable simplification to require ATTR to be only
3039 `text'. One might then also require attribute lists to be stored in
3040 their canonicalized form. */
3043 is_attribute_with_length_p (const char *attr
, int attr_len
, tree ident
)
3048 if (TREE_CODE (ident
) != IDENTIFIER_NODE
)
3051 p
= IDENTIFIER_POINTER (ident
);
3052 ident_len
= IDENTIFIER_LENGTH (ident
);
3054 if (ident_len
== attr_len
3055 && strcmp (attr
, p
) == 0)
3058 /* If ATTR is `__text__', IDENT must be `text'; and vice versa. */
3061 gcc_assert (attr
[1] == '_');
3062 gcc_assert (attr
[attr_len
- 2] == '_');
3063 gcc_assert (attr
[attr_len
- 1] == '_');
3064 gcc_assert (attr
[1] == '_');
3065 if (ident_len
== attr_len
- 4
3066 && strncmp (attr
+ 2, p
, attr_len
- 4) == 0)
3071 if (ident_len
== attr_len
+ 4
3072 && p
[0] == '_' && p
[1] == '_'
3073 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
3074 && strncmp (attr
, p
+ 2, attr_len
) == 0)
3081 /* Return nonzero if IDENT is a valid name for attribute ATTR,
3084 We try both `text' and `__text__', ATTR may be either one. */
3087 is_attribute_p (const char *attr
, tree ident
)
3089 return is_attribute_with_length_p (attr
, strlen (attr
), ident
);
3092 /* Given an attribute name and a list of attributes, return a pointer to the
3093 attribute's list element if the attribute is part of the list, or NULL_TREE
3094 if not found. If the attribute appears more than once, this only
3095 returns the first occurrence; the TREE_CHAIN of the return value should
3096 be passed back in if further occurrences are wanted. */
3099 lookup_attribute (const char *attr_name
, tree list
)
3102 size_t attr_len
= strlen (attr_name
);
3104 for (l
= list
; l
; l
= TREE_CHAIN (l
))
3106 gcc_assert (TREE_CODE (TREE_PURPOSE (l
)) == IDENTIFIER_NODE
);
3107 if (is_attribute_with_length_p (attr_name
, attr_len
, TREE_PURPOSE (l
)))
3114 /* Return an attribute list that is the union of a1 and a2. */
3117 merge_attributes (tree a1
, tree a2
)
3121 /* Either one unset? Take the set one. */
3123 if ((attributes
= a1
) == 0)
3126 /* One that completely contains the other? Take it. */
3128 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
3130 if (attribute_list_contained (a2
, a1
))
3134 /* Pick the longest list, and hang on the other list. */
3136 if (list_length (a1
) < list_length (a2
))
3137 attributes
= a2
, a2
= a1
;
3139 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
3142 for (a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3145 a
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
3148 if (simple_cst_equal (TREE_VALUE (a
), TREE_VALUE (a2
)) == 1)
3153 a1
= copy_node (a2
);
3154 TREE_CHAIN (a1
) = attributes
;
3163 /* Given types T1 and T2, merge their attributes and return
3167 merge_type_attributes (tree t1
, tree t2
)
3169 return merge_attributes (TYPE_ATTRIBUTES (t1
),
3170 TYPE_ATTRIBUTES (t2
));
3173 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
3177 merge_decl_attributes (tree olddecl
, tree newdecl
)
3179 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
3180 DECL_ATTRIBUTES (newdecl
));
3183 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
3185 /* Specialization of merge_decl_attributes for various Windows targets.
3187 This handles the following situation:
3189 __declspec (dllimport) int foo;
3192 The second instance of `foo' nullifies the dllimport. */
3195 merge_dllimport_decl_attributes (tree old
, tree
new)
3198 int delete_dllimport_p
;
3200 old
= DECL_ATTRIBUTES (old
);
3201 new = DECL_ATTRIBUTES (new);
3203 /* What we need to do here is remove from `old' dllimport if it doesn't
3204 appear in `new'. dllimport behaves like extern: if a declaration is
3205 marked dllimport and a definition appears later, then the object
3206 is not dllimport'd. */
3207 if (lookup_attribute ("dllimport", old
) != NULL_TREE
3208 && lookup_attribute ("dllimport", new) == NULL_TREE
)
3209 delete_dllimport_p
= 1;
3211 delete_dllimport_p
= 0;
3213 a
= merge_attributes (old
, new);
3215 if (delete_dllimport_p
)
3219 /* Scan the list for dllimport and delete it. */
3220 for (prev
= NULL_TREE
, t
= a
; t
; prev
= t
, t
= TREE_CHAIN (t
))
3222 if (is_attribute_p ("dllimport", TREE_PURPOSE (t
)))
3224 if (prev
== NULL_TREE
)
3227 TREE_CHAIN (prev
) = TREE_CHAIN (t
);
3236 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
3237 struct attribute_spec.handler. */
3240 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
3245 /* These attributes may apply to structure and union types being created,
3246 but otherwise should pass to the declaration involved. */
3249 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
3250 | (int) ATTR_FLAG_ARRAY_NEXT
))
3252 *no_add_attrs
= true;
3253 return tree_cons (name
, args
, NULL_TREE
);
3255 if (TREE_CODE (node
) != RECORD_TYPE
&& TREE_CODE (node
) != UNION_TYPE
)
3257 warning ("%qs attribute ignored", IDENTIFIER_POINTER (name
));
3258 *no_add_attrs
= true;
3264 /* Report error on dllimport ambiguities seen now before they cause
3266 if (is_attribute_p ("dllimport", name
))
3268 /* Like MS, treat definition of dllimported variables and
3269 non-inlined functions on declaration as syntax errors. We
3270 allow the attribute for function definitions if declared
3272 if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
)
3273 && !DECL_DECLARED_INLINE_P (node
))
3275 error ("%Jfunction %qD definition is marked dllimport.", node
, node
);
3276 *no_add_attrs
= true;
3279 else if (TREE_CODE (node
) == VAR_DECL
)
3281 if (DECL_INITIAL (node
))
3283 error ("%Jvariable %qD definition is marked dllimport.",
3285 *no_add_attrs
= true;
3288 /* `extern' needn't be specified with dllimport.
3289 Specify `extern' now and hope for the best. Sigh. */
3290 DECL_EXTERNAL (node
) = 1;
3291 /* Also, implicitly give dllimport'd variables declared within
3292 a function global scope, unless declared static. */
3293 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
3294 TREE_PUBLIC (node
) = 1;
3298 /* Report error if symbol is not accessible at global scope. */
3299 if (!TREE_PUBLIC (node
)
3300 && (TREE_CODE (node
) == VAR_DECL
3301 || TREE_CODE (node
) == FUNCTION_DECL
))
3303 error ("%Jexternal linkage required for symbol %qD because of "
3304 "%qs attribute.", node
, node
, IDENTIFIER_POINTER (name
));
3305 *no_add_attrs
= true;
3311 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
3313 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
3314 of the various TYPE_QUAL values. */
3317 set_type_quals (tree type
, int type_quals
)
3319 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
3320 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
3321 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
3324 /* Returns true iff cand is equivalent to base with type_quals. */
3327 check_qualified_type (tree cand
, tree base
, int type_quals
)
3329 return (TYPE_QUALS (cand
) == type_quals
3330 && TYPE_NAME (cand
) == TYPE_NAME (base
)
3331 /* Apparently this is needed for Objective-C. */
3332 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
3333 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
3334 TYPE_ATTRIBUTES (base
)));
3337 /* Return a version of the TYPE, qualified as indicated by the
3338 TYPE_QUALS, if one exists. If no qualified version exists yet,
3339 return NULL_TREE. */
3342 get_qualified_type (tree type
, int type_quals
)
3346 if (TYPE_QUALS (type
) == type_quals
)
3349 /* Search the chain of variants to see if there is already one there just
3350 like the one we need to have. If so, use that existing one. We must
3351 preserve the TYPE_NAME, since there is code that depends on this. */
3352 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
3353 if (check_qualified_type (t
, type
, type_quals
))
3359 /* Like get_qualified_type, but creates the type if it does not
3360 exist. This function never returns NULL_TREE. */
3363 build_qualified_type (tree type
, int type_quals
)
3367 /* See if we already have the appropriate qualified variant. */
3368 t
= get_qualified_type (type
, type_quals
);
3370 /* If not, build it. */
3373 t
= build_variant_type_copy (type
);
3374 set_type_quals (t
, type_quals
);
3380 /* Create a new distinct copy of TYPE. The new type is made its own
3384 build_distinct_type_copy (tree type
)
3386 tree t
= copy_node (type
);
3388 TYPE_POINTER_TO (t
) = 0;
3389 TYPE_REFERENCE_TO (t
) = 0;
3391 /* Make it its own variant. */
3392 TYPE_MAIN_VARIANT (t
) = t
;
3393 TYPE_NEXT_VARIANT (t
) = 0;
3398 /* Create a new variant of TYPE, equivalent but distinct.
3399 This is so the caller can modify it. */
3402 build_variant_type_copy (tree type
)
3404 tree t
, m
= TYPE_MAIN_VARIANT (type
);
3406 t
= build_distinct_type_copy (type
);
3408 /* Add the new type to the chain of variants of TYPE. */
3409 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
3410 TYPE_NEXT_VARIANT (m
) = t
;
3411 TYPE_MAIN_VARIANT (t
) = m
;
3416 /* Hashing of types so that we don't make duplicates.
3417 The entry point is `type_hash_canon'. */
3419 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
3420 with types in the TREE_VALUE slots), by adding the hash codes
3421 of the individual types. */
3424 type_hash_list (tree list
, hashval_t hashcode
)
3428 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3429 if (TREE_VALUE (tail
) != error_mark_node
)
3430 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
3436 /* These are the Hashtable callback functions. */
3438 /* Returns true iff the types are equivalent. */
3441 type_hash_eq (const void *va
, const void *vb
)
3443 const struct type_hash
*a
= va
, *b
= vb
;
3445 /* First test the things that are the same for all types. */
3446 if (a
->hash
!= b
->hash
3447 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
3448 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
3449 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
3450 TYPE_ATTRIBUTES (b
->type
))
3451 || TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
3452 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
))
3455 switch (TREE_CODE (a
->type
))
3460 case REFERENCE_TYPE
:
3464 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
3467 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
3468 && !(TYPE_VALUES (a
->type
)
3469 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
3470 && TYPE_VALUES (b
->type
)
3471 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
3472 && type_list_equal (TYPE_VALUES (a
->type
),
3473 TYPE_VALUES (b
->type
))))
3476 /* ... fall through ... */
3482 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
3483 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
3484 TYPE_MAX_VALUE (b
->type
)))
3485 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
3486 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
3487 TYPE_MIN_VALUE (b
->type
))));
3490 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
3493 return (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
3494 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3495 || (TYPE_ARG_TYPES (a
->type
)
3496 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3497 && TYPE_ARG_TYPES (b
->type
)
3498 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3499 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3500 TYPE_ARG_TYPES (b
->type
)))));
3503 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
3507 case QUAL_UNION_TYPE
:
3508 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
3509 || (TYPE_FIELDS (a
->type
)
3510 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
3511 && TYPE_FIELDS (b
->type
)
3512 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
3513 && type_list_equal (TYPE_FIELDS (a
->type
),
3514 TYPE_FIELDS (b
->type
))));
3517 return (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
3518 || (TYPE_ARG_TYPES (a
->type
)
3519 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
3520 && TYPE_ARG_TYPES (b
->type
)
3521 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
3522 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
3523 TYPE_ARG_TYPES (b
->type
))));
3530 /* Return the cached hash value. */
3533 type_hash_hash (const void *item
)
3535 return ((const struct type_hash
*) item
)->hash
;
3538 /* Look in the type hash table for a type isomorphic to TYPE.
3539 If one is found, return it. Otherwise return 0. */
3542 type_hash_lookup (hashval_t hashcode
, tree type
)
3544 struct type_hash
*h
, in
;
3546 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
3547 must call that routine before comparing TYPE_ALIGNs. */
3553 h
= htab_find_with_hash (type_hash_table
, &in
, hashcode
);
3559 /* Add an entry to the type-hash-table
3560 for a type TYPE whose hash code is HASHCODE. */
3563 type_hash_add (hashval_t hashcode
, tree type
)
3565 struct type_hash
*h
;
3568 h
= ggc_alloc (sizeof (struct type_hash
));
3571 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
3572 *(struct type_hash
**) loc
= h
;
3575 /* Given TYPE, and HASHCODE its hash code, return the canonical
3576 object for an identical type if one already exists.
3577 Otherwise, return TYPE, and record it as the canonical object.
3579 To use this function, first create a type of the sort you want.
3580 Then compute its hash code from the fields of the type that
3581 make it different from other similar types.
3582 Then call this function and use the value. */
3585 type_hash_canon (unsigned int hashcode
, tree type
)
3589 /* The hash table only contains main variants, so ensure that's what we're
3591 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
3593 if (!lang_hooks
.types
.hash_types
)
3596 /* See if the type is in the hash table already. If so, return it.
3597 Otherwise, add the type. */
3598 t1
= type_hash_lookup (hashcode
, type
);
3601 #ifdef GATHER_STATISTICS
3602 tree_node_counts
[(int) t_kind
]--;
3603 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type
);
3609 type_hash_add (hashcode
, type
);
3614 /* See if the data pointed to by the type hash table is marked. We consider
3615 it marked if the type is marked or if a debug type number or symbol
3616 table entry has been made for the type. This reduces the amount of
3617 debugging output and eliminates that dependency of the debug output on
3618 the number of garbage collections. */
3621 type_hash_marked_p (const void *p
)
3623 tree type
= ((struct type_hash
*) p
)->type
;
3625 return ggc_marked_p (type
) || TYPE_SYMTAB_POINTER (type
);
3629 print_type_hash_statistics (void)
3631 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
3632 (long) htab_size (type_hash_table
),
3633 (long) htab_elements (type_hash_table
),
3634 htab_collisions (type_hash_table
));
3637 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
3638 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
3639 by adding the hash codes of the individual attributes. */
3642 attribute_hash_list (tree list
, hashval_t hashcode
)
3646 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
3647 /* ??? Do we want to add in TREE_VALUE too? */
3648 hashcode
= iterative_hash_object
3649 (IDENTIFIER_HASH_VALUE (TREE_PURPOSE (tail
)), hashcode
);
3653 /* Given two lists of attributes, return true if list l2 is
3654 equivalent to l1. */
3657 attribute_list_equal (tree l1
, tree l2
)
3659 return attribute_list_contained (l1
, l2
)
3660 && attribute_list_contained (l2
, l1
);
3663 /* Given two lists of attributes, return true if list L2 is
3664 completely contained within L1. */
3665 /* ??? This would be faster if attribute names were stored in a canonicalized
3666 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
3667 must be used to show these elements are equivalent (which they are). */
3668 /* ??? It's not clear that attributes with arguments will always be handled
3672 attribute_list_contained (tree l1
, tree l2
)
3676 /* First check the obvious, maybe the lists are identical. */
3680 /* Maybe the lists are similar. */
3681 for (t1
= l1
, t2
= l2
;
3683 && TREE_PURPOSE (t1
) == TREE_PURPOSE (t2
)
3684 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
3685 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
));
3687 /* Maybe the lists are equal. */
3688 if (t1
== 0 && t2
== 0)
3691 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
3694 for (attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)), l1
);
3696 attr
= lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (t2
)),
3699 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) == 1)
3706 if (simple_cst_equal (TREE_VALUE (t2
), TREE_VALUE (attr
)) != 1)
3713 /* Given two lists of types
3714 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
3715 return 1 if the lists contain the same types in the same order.
3716 Also, the TREE_PURPOSEs must match. */
3719 type_list_equal (tree l1
, tree l2
)
3723 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
3724 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
3725 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
3726 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
3727 && (TREE_TYPE (TREE_PURPOSE (t1
))
3728 == TREE_TYPE (TREE_PURPOSE (t2
))))))
3734 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
3735 given by TYPE. If the argument list accepts variable arguments,
3736 then this function counts only the ordinary arguments. */
3739 type_num_arguments (tree type
)
3744 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
3745 /* If the function does not take a variable number of arguments,
3746 the last element in the list will have type `void'. */
3747 if (VOID_TYPE_P (TREE_VALUE (t
)))
3755 /* Nonzero if integer constants T1 and T2
3756 represent the same constant value. */
3759 tree_int_cst_equal (tree t1
, tree t2
)
3764 if (t1
== 0 || t2
== 0)
3767 if (TREE_CODE (t1
) == INTEGER_CST
3768 && TREE_CODE (t2
) == INTEGER_CST
3769 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3770 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
3776 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
3777 The precise way of comparison depends on their data type. */
3780 tree_int_cst_lt (tree t1
, tree t2
)
3785 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
3787 int t1_sgn
= tree_int_cst_sgn (t1
);
3788 int t2_sgn
= tree_int_cst_sgn (t2
);
3790 if (t1_sgn
< t2_sgn
)
3792 else if (t1_sgn
> t2_sgn
)
3794 /* Otherwise, both are non-negative, so we compare them as
3795 unsigned just in case one of them would overflow a signed
3798 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
3799 return INT_CST_LT (t1
, t2
);
3801 return INT_CST_LT_UNSIGNED (t1
, t2
);
3804 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
3807 tree_int_cst_compare (tree t1
, tree t2
)
3809 if (tree_int_cst_lt (t1
, t2
))
3811 else if (tree_int_cst_lt (t2
, t1
))
3817 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
3818 the host. If POS is zero, the value can be represented in a single
3819 HOST_WIDE_INT. If POS is nonzero, the value must be positive and can
3820 be represented in a single unsigned HOST_WIDE_INT. */
3823 host_integerp (tree t
, int pos
)
3825 return (TREE_CODE (t
) == INTEGER_CST
3826 && ! TREE_OVERFLOW (t
)
3827 && ((TREE_INT_CST_HIGH (t
) == 0
3828 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
3829 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
3830 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
3831 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
3832 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
3835 /* Return the HOST_WIDE_INT least significant bits of T if it is an
3836 INTEGER_CST and there is no overflow. POS is nonzero if the result must
3837 be positive. Abort if we cannot satisfy the above conditions. */
3840 tree_low_cst (tree t
, int pos
)
3842 gcc_assert (host_integerp (t
, pos
));
3843 return TREE_INT_CST_LOW (t
);
3846 /* Return the most significant bit of the integer constant T. */
3849 tree_int_cst_msb (tree t
)
3853 unsigned HOST_WIDE_INT l
;
3855 /* Note that using TYPE_PRECISION here is wrong. We care about the
3856 actual bits, not the (arbitrary) range of the type. */
3857 prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))) - 1;
3858 rshift_double (TREE_INT_CST_LOW (t
), TREE_INT_CST_HIGH (t
), prec
,
3859 2 * HOST_BITS_PER_WIDE_INT
, &l
, &h
, 0);
3860 return (l
& 1) == 1;
3863 /* Return an indication of the sign of the integer constant T.
3864 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
3865 Note that -1 will never be returned it T's type is unsigned. */
3868 tree_int_cst_sgn (tree t
)
3870 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
3872 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
3874 else if (TREE_INT_CST_HIGH (t
) < 0)
3880 /* Compare two constructor-element-type constants. Return 1 if the lists
3881 are known to be equal; otherwise return 0. */
3884 simple_cst_list_equal (tree l1
, tree l2
)
3886 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
3888 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
3891 l1
= TREE_CHAIN (l1
);
3892 l2
= TREE_CHAIN (l2
);
3898 /* Return truthvalue of whether T1 is the same tree structure as T2.
3899 Return 1 if they are the same.
3900 Return 0 if they are understandably different.
3901 Return -1 if either contains tree structure not understood by
3905 simple_cst_equal (tree t1
, tree t2
)
3907 enum tree_code code1
, code2
;
3913 if (t1
== 0 || t2
== 0)
3916 code1
= TREE_CODE (t1
);
3917 code2
= TREE_CODE (t2
);
3919 if (code1
== NOP_EXPR
|| code1
== CONVERT_EXPR
|| code1
== NON_LVALUE_EXPR
)
3921 if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3922 || code2
== NON_LVALUE_EXPR
)
3923 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3925 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
3928 else if (code2
== NOP_EXPR
|| code2
== CONVERT_EXPR
3929 || code2
== NON_LVALUE_EXPR
)
3930 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
3938 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
3939 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
3942 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
3945 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
3946 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
3947 TREE_STRING_LENGTH (t1
)));
3950 return simple_cst_list_equal (CONSTRUCTOR_ELTS (t1
),
3951 CONSTRUCTOR_ELTS (t2
));
3954 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3957 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3961 simple_cst_list_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3964 /* Special case: if either target is an unallocated VAR_DECL,
3965 it means that it's going to be unified with whatever the
3966 TARGET_EXPR is really supposed to initialize, so treat it
3967 as being equivalent to anything. */
3968 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
3969 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
3970 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
3971 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
3972 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
3973 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
3976 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3981 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
3983 case WITH_CLEANUP_EXPR
:
3984 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
3988 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
3991 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
3992 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
4006 /* This general rule works for most tree codes. All exceptions should be
4007 handled above. If this is a language-specific tree code, we can't
4008 trust what might be in the operand, so say we don't know
4010 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
4013 switch (TREE_CODE_CLASS (code1
))
4017 case tcc_comparison
:
4018 case tcc_expression
:
4022 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
4024 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
4036 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
4037 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
4038 than U, respectively. */
4041 compare_tree_int (tree t
, unsigned HOST_WIDE_INT u
)
4043 if (tree_int_cst_sgn (t
) < 0)
4045 else if (TREE_INT_CST_HIGH (t
) != 0)
4047 else if (TREE_INT_CST_LOW (t
) == u
)
4049 else if (TREE_INT_CST_LOW (t
) < u
)
4055 /* Return true if CODE represents an associative tree code. Otherwise
4058 associative_tree_code (enum tree_code code
)
4077 /* Return true if CODE represents a commutative tree code. Otherwise
4080 commutative_tree_code (enum tree_code code
)
4093 case UNORDERED_EXPR
:
4097 case TRUTH_AND_EXPR
:
4098 case TRUTH_XOR_EXPR
:
4108 /* Generate a hash value for an expression. This can be used iteratively
4109 by passing a previous result as the "val" argument.
4111 This function is intended to produce the same hash for expressions which
4112 would compare equal using operand_equal_p. */
4115 iterative_hash_expr (tree t
, hashval_t val
)
4118 enum tree_code code
;
4122 return iterative_hash_pointer (t
, val
);
4124 code
= TREE_CODE (t
);
4128 /* Alas, constants aren't shared, so we can't rely on pointer
4131 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
4132 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
4135 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
4137 return iterative_hash_hashval_t (val2
, val
);
4140 return iterative_hash (TREE_STRING_POINTER (t
),
4141 TREE_STRING_LENGTH (t
), val
);
4143 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
4144 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
4146 return iterative_hash_expr (TREE_VECTOR_CST_ELTS (t
), val
);
4150 /* we can just compare by pointer. */
4151 return iterative_hash_pointer (t
, val
);
4154 /* A list of expressions, for a CALL_EXPR or as the elements of a
4156 for (; t
; t
= TREE_CHAIN (t
))
4157 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
4160 /* When referring to a built-in FUNCTION_DECL, use the
4161 __builtin__ form. Otherwise nodes that compare equal
4162 according to operand_equal_p might get different
4164 if (DECL_BUILT_IN (t
))
4166 val
= iterative_hash_pointer (built_in_decls
[DECL_FUNCTION_CODE (t
)],
4170 /* else FALL THROUGH */
4172 class = TREE_CODE_CLASS (code
);
4174 if (class == tcc_declaration
)
4176 /* Otherwise, we can just compare decls by pointer. */
4177 val
= iterative_hash_pointer (t
, val
);
4181 gcc_assert (IS_EXPR_CODE_CLASS (class));
4183 val
= iterative_hash_object (code
, val
);
4185 /* Don't hash the type, that can lead to having nodes which
4186 compare equal according to operand_equal_p, but which
4187 have different hash codes. */
4188 if (code
== NOP_EXPR
4189 || code
== CONVERT_EXPR
4190 || code
== NON_LVALUE_EXPR
)
4192 /* Make sure to include signness in the hash computation. */
4193 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
4194 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
4197 else if (commutative_tree_code (code
))
4199 /* It's a commutative expression. We want to hash it the same
4200 however it appears. We do this by first hashing both operands
4201 and then rehashing based on the order of their independent
4203 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
4204 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
4208 t
= one
, one
= two
, two
= t
;
4210 val
= iterative_hash_hashval_t (one
, val
);
4211 val
= iterative_hash_hashval_t (two
, val
);
4214 for (i
= TREE_CODE_LENGTH (code
) - 1; i
>= 0; --i
)
4215 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
4222 /* Constructors for pointer, array and function types.
4223 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
4224 constructed by language-dependent code, not here.) */
4226 /* Construct, lay out and return the type of pointers to TO_TYPE with
4227 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
4228 reference all of memory. If such a type has already been
4229 constructed, reuse it. */
4232 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
4237 /* In some cases, languages will have things that aren't a POINTER_TYPE
4238 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
4239 In that case, return that type without regard to the rest of our
4242 ??? This is a kludge, but consistent with the way this function has
4243 always operated and there doesn't seem to be a good way to avoid this
4245 if (TYPE_POINTER_TO (to_type
) != 0
4246 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
4247 return TYPE_POINTER_TO (to_type
);
4249 /* First, if we already have a type for pointers to TO_TYPE and it's
4250 the proper mode, use it. */
4251 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
4252 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4255 t
= make_node (POINTER_TYPE
);
4257 TREE_TYPE (t
) = to_type
;
4258 TYPE_MODE (t
) = mode
;
4259 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4260 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
4261 TYPE_POINTER_TO (to_type
) = t
;
4263 /* Lay out the type. This function has many callers that are concerned
4264 with expression-construction, and this simplifies them all. */
4270 /* By default build pointers in ptr_mode. */
4273 build_pointer_type (tree to_type
)
4275 return build_pointer_type_for_mode (to_type
, ptr_mode
, false);
4278 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
4281 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
4286 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
4287 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
4288 In that case, return that type without regard to the rest of our
4291 ??? This is a kludge, but consistent with the way this function has
4292 always operated and there doesn't seem to be a good way to avoid this
4294 if (TYPE_REFERENCE_TO (to_type
) != 0
4295 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
4296 return TYPE_REFERENCE_TO (to_type
);
4298 /* First, if we already have a type for pointers to TO_TYPE and it's
4299 the proper mode, use it. */
4300 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
4301 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
4304 t
= make_node (REFERENCE_TYPE
);
4306 TREE_TYPE (t
) = to_type
;
4307 TYPE_MODE (t
) = mode
;
4308 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
4309 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
4310 TYPE_REFERENCE_TO (to_type
) = t
;
4318 /* Build the node for the type of references-to-TO_TYPE by default
4322 build_reference_type (tree to_type
)
4324 return build_reference_type_for_mode (to_type
, ptr_mode
, false);
4327 /* Build a type that is compatible with t but has no cv quals anywhere
4330 const char *const *const * -> char ***. */
4333 build_type_no_quals (tree t
)
4335 switch (TREE_CODE (t
))
4338 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4340 TYPE_REF_CAN_ALIAS_ALL (t
));
4341 case REFERENCE_TYPE
:
4343 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
4345 TYPE_REF_CAN_ALIAS_ALL (t
));
4347 return TYPE_MAIN_VARIANT (t
);
4351 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
4352 MAXVAL should be the maximum value in the domain
4353 (one less than the length of the array).
4355 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
4356 We don't enforce this limit, that is up to caller (e.g. language front end).
4357 The limit exists because the result is a signed type and we don't handle
4358 sizes that use more than one HOST_WIDE_INT. */
4361 build_index_type (tree maxval
)
4363 tree itype
= make_node (INTEGER_TYPE
);
4365 TREE_TYPE (itype
) = sizetype
;
4366 TYPE_PRECISION (itype
) = TYPE_PRECISION (sizetype
);
4367 TYPE_MIN_VALUE (itype
) = size_zero_node
;
4368 TYPE_MAX_VALUE (itype
) = fold_convert (sizetype
, maxval
);
4369 TYPE_MODE (itype
) = TYPE_MODE (sizetype
);
4370 TYPE_SIZE (itype
) = TYPE_SIZE (sizetype
);
4371 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (sizetype
);
4372 TYPE_ALIGN (itype
) = TYPE_ALIGN (sizetype
);
4373 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (sizetype
);
4375 if (host_integerp (maxval
, 1))
4376 return type_hash_canon (tree_low_cst (maxval
, 1), itype
);
4381 /* Builds a signed or unsigned integer type of precision PRECISION.
4382 Used for C bitfields whose precision does not match that of
4383 built-in target types. */
4385 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
4388 tree itype
= make_node (INTEGER_TYPE
);
4390 TYPE_PRECISION (itype
) = precision
;
4393 fixup_unsigned_type (itype
);
4395 fixup_signed_type (itype
);
4397 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
4398 return type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
4403 /* Create a range of some discrete type TYPE (an INTEGER_TYPE,
4404 ENUMERAL_TYPE, BOOLEAN_TYPE, or CHAR_TYPE), with
4405 low bound LOWVAL and high bound HIGHVAL.
4406 if TYPE==NULL_TREE, sizetype is used. */
4409 build_range_type (tree type
, tree lowval
, tree highval
)
4411 tree itype
= make_node (INTEGER_TYPE
);
4413 TREE_TYPE (itype
) = type
;
4414 if (type
== NULL_TREE
)
4417 TYPE_MIN_VALUE (itype
) = convert (type
, lowval
);
4418 TYPE_MAX_VALUE (itype
) = highval
? convert (type
, highval
) : NULL
;
4420 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
4421 TYPE_MODE (itype
) = TYPE_MODE (type
);
4422 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
4423 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
4424 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
4425 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
4427 if (host_integerp (lowval
, 0) && highval
!= 0 && host_integerp (highval
, 0))
4428 return type_hash_canon (tree_low_cst (highval
, 0)
4429 - tree_low_cst (lowval
, 0),
4435 /* Just like build_index_type, but takes lowval and highval instead
4436 of just highval (maxval). */
4439 build_index_2_type (tree lowval
, tree highval
)
4441 return build_range_type (sizetype
, lowval
, highval
);
4444 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
4445 and number of elements specified by the range of values of INDEX_TYPE.
4446 If such a type has already been constructed, reuse it. */
4449 build_array_type (tree elt_type
, tree index_type
)
4452 hashval_t hashcode
= 0;
4454 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
4456 error ("arrays of functions are not meaningful");
4457 elt_type
= integer_type_node
;
4460 t
= make_node (ARRAY_TYPE
);
4461 TREE_TYPE (t
) = elt_type
;
4462 TYPE_DOMAIN (t
) = index_type
;
4464 if (index_type
== 0)
4470 hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), hashcode
);
4471 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
4472 t
= type_hash_canon (hashcode
, t
);
4474 if (!COMPLETE_TYPE_P (t
))
4479 /* Return the TYPE of the elements comprising
4480 the innermost dimension of ARRAY. */
4483 get_inner_array_type (tree array
)
4485 tree type
= TREE_TYPE (array
);
4487 while (TREE_CODE (type
) == ARRAY_TYPE
)
4488 type
= TREE_TYPE (type
);
4493 /* Construct, lay out and return
4494 the type of functions returning type VALUE_TYPE
4495 given arguments of types ARG_TYPES.
4496 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
4497 are data type nodes for the arguments of the function.
4498 If such a type has already been constructed, reuse it. */
4501 build_function_type (tree value_type
, tree arg_types
)
4504 hashval_t hashcode
= 0;
4506 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
4508 error ("function return type cannot be function");
4509 value_type
= integer_type_node
;
4512 /* Make a node of the sort we want. */
4513 t
= make_node (FUNCTION_TYPE
);
4514 TREE_TYPE (t
) = value_type
;
4515 TYPE_ARG_TYPES (t
) = arg_types
;
4517 /* If we already have such a type, use the old one. */
4518 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
4519 hashcode
= type_hash_list (arg_types
, hashcode
);
4520 t
= type_hash_canon (hashcode
, t
);
4522 if (!COMPLETE_TYPE_P (t
))
4527 /* Build a function type. The RETURN_TYPE is the type returned by the
4528 function. If additional arguments are provided, they are
4529 additional argument types. The list of argument types must always
4530 be terminated by NULL_TREE. */
4533 build_function_type_list (tree return_type
, ...)
4538 va_start (p
, return_type
);
4540 t
= va_arg (p
, tree
);
4541 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (p
, tree
))
4542 args
= tree_cons (NULL_TREE
, t
, args
);
4544 if (args
== NULL_TREE
)
4545 args
= void_list_node
;
4549 args
= nreverse (args
);
4550 TREE_CHAIN (last
) = void_list_node
;
4552 args
= build_function_type (return_type
, args
);
4558 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
4559 and ARGTYPES (a TREE_LIST) are the return type and arguments types
4560 for the method. An implicit additional parameter (of type
4561 pointer-to-BASETYPE) is added to the ARGTYPES. */
4564 build_method_type_directly (tree basetype
,
4572 /* Make a node of the sort we want. */
4573 t
= make_node (METHOD_TYPE
);
4575 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4576 TREE_TYPE (t
) = rettype
;
4577 ptype
= build_pointer_type (basetype
);
4579 /* The actual arglist for this function includes a "hidden" argument
4580 which is "this". Put it into the list of argument types. */
4581 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
4582 TYPE_ARG_TYPES (t
) = argtypes
;
4584 /* If we already have such a type, use the old one. */
4585 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4586 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
4587 hashcode
= type_hash_list (argtypes
, hashcode
);
4588 t
= type_hash_canon (hashcode
, t
);
4590 if (!COMPLETE_TYPE_P (t
))
4596 /* Construct, lay out and return the type of methods belonging to class
4597 BASETYPE and whose arguments and values are described by TYPE.
4598 If that type exists already, reuse it.
4599 TYPE must be a FUNCTION_TYPE node. */
4602 build_method_type (tree basetype
, tree type
)
4604 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
4606 return build_method_type_directly (basetype
,
4608 TYPE_ARG_TYPES (type
));
4611 /* Construct, lay out and return the type of offsets to a value
4612 of type TYPE, within an object of type BASETYPE.
4613 If a suitable offset type exists already, reuse it. */
4616 build_offset_type (tree basetype
, tree type
)
4619 hashval_t hashcode
= 0;
4621 /* Make a node of the sort we want. */
4622 t
= make_node (OFFSET_TYPE
);
4624 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
4625 TREE_TYPE (t
) = type
;
4627 /* If we already have such a type, use the old one. */
4628 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
4629 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
4630 t
= type_hash_canon (hashcode
, t
);
4632 if (!COMPLETE_TYPE_P (t
))
4638 /* Create a complex type whose components are COMPONENT_TYPE. */
4641 build_complex_type (tree component_type
)
4646 /* Make a node of the sort we want. */
4647 t
= make_node (COMPLEX_TYPE
);
4649 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
4651 /* If we already have such a type, use the old one. */
4652 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
4653 t
= type_hash_canon (hashcode
, t
);
4655 if (!COMPLETE_TYPE_P (t
))
4658 /* If we are writing Dwarf2 output we need to create a name,
4659 since complex is a fundamental type. */
4660 if ((write_symbols
== DWARF2_DEBUG
|| write_symbols
== VMS_AND_DWARF2_DEBUG
)
4664 if (component_type
== char_type_node
)
4665 name
= "complex char";
4666 else if (component_type
== signed_char_type_node
)
4667 name
= "complex signed char";
4668 else if (component_type
== unsigned_char_type_node
)
4669 name
= "complex unsigned char";
4670 else if (component_type
== short_integer_type_node
)
4671 name
= "complex short int";
4672 else if (component_type
== short_unsigned_type_node
)
4673 name
= "complex short unsigned int";
4674 else if (component_type
== integer_type_node
)
4675 name
= "complex int";
4676 else if (component_type
== unsigned_type_node
)
4677 name
= "complex unsigned int";
4678 else if (component_type
== long_integer_type_node
)
4679 name
= "complex long int";
4680 else if (component_type
== long_unsigned_type_node
)
4681 name
= "complex long unsigned int";
4682 else if (component_type
== long_long_integer_type_node
)
4683 name
= "complex long long int";
4684 else if (component_type
== long_long_unsigned_type_node
)
4685 name
= "complex long long unsigned int";
4690 TYPE_NAME (t
) = get_identifier (name
);
4693 return build_qualified_type (t
, TYPE_QUALS (component_type
));
4696 /* Return OP, stripped of any conversions to wider types as much as is safe.
4697 Converting the value back to OP's type makes a value equivalent to OP.
4699 If FOR_TYPE is nonzero, we return a value which, if converted to
4700 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
4702 If FOR_TYPE is nonzero, unaligned bit-field references may be changed to the
4703 narrowest type that can hold the value, even if they don't exactly fit.
4704 Otherwise, bit-field references are changed to a narrower type
4705 only if they can be fetched directly from memory in that type.
4707 OP must have integer, real or enumeral type. Pointers are not allowed!
4709 There are some cases where the obvious value we could return
4710 would regenerate to OP if converted to OP's type,
4711 but would not extend like OP to wider types.
4712 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
4713 For example, if OP is (unsigned short)(signed char)-1,
4714 we avoid returning (signed char)-1 if FOR_TYPE is int,
4715 even though extending that to an unsigned short would regenerate OP,
4716 since the result of extending (signed char)-1 to (int)
4717 is different from (int) OP. */
4720 get_unwidened (tree op
, tree for_type
)
4722 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
4723 tree type
= TREE_TYPE (op
);
4725 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
4727 = (for_type
!= 0 && for_type
!= type
4728 && final_prec
> TYPE_PRECISION (type
)
4729 && TYPE_UNSIGNED (type
));
4732 while (TREE_CODE (op
) == NOP_EXPR
4733 || TREE_CODE (op
) == CONVERT_EXPR
)
4736 = TYPE_PRECISION (TREE_TYPE (op
))
4737 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
4739 /* Truncations are many-one so cannot be removed.
4740 Unless we are later going to truncate down even farther. */
4742 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
4745 /* See what's inside this conversion. If we decide to strip it,
4747 op
= TREE_OPERAND (op
, 0);
4749 /* If we have not stripped any zero-extensions (uns is 0),
4750 we can strip any kind of extension.
4751 If we have previously stripped a zero-extension,
4752 only zero-extensions can safely be stripped.
4753 Any extension can be stripped if the bits it would produce
4754 are all going to be discarded later by truncating to FOR_TYPE. */
4758 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
4760 /* TYPE_UNSIGNED says whether this is a zero-extension.
4761 Let's avoid computing it if it does not affect WIN
4762 and if UNS will not be needed again. */
4764 || TREE_CODE (op
) == NOP_EXPR
4765 || TREE_CODE (op
) == CONVERT_EXPR
)
4766 && TYPE_UNSIGNED (TREE_TYPE (op
)))
4774 if (TREE_CODE (op
) == COMPONENT_REF
4775 /* Since type_for_size always gives an integer type. */
4776 && TREE_CODE (type
) != REAL_TYPE
4777 /* Don't crash if field not laid out yet. */
4778 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4779 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4781 unsigned int innerprec
4782 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4783 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4784 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4785 type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4787 /* We can get this structure field in the narrowest type it fits in.
4788 If FOR_TYPE is 0, do this only for a field that matches the
4789 narrower type exactly and is aligned for it
4790 The resulting extension to its nominal type (a fullword type)
4791 must fit the same conditions as for other extensions. */
4794 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
), TYPE_SIZE (TREE_TYPE (op
)))
4795 && (for_type
|| ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1)))
4796 && (! uns
|| final_prec
<= innerprec
|| unsignedp
))
4798 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4799 TREE_OPERAND (op
, 1), NULL_TREE
);
4800 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4801 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4808 /* Return OP or a simpler expression for a narrower value
4809 which can be sign-extended or zero-extended to give back OP.
4810 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
4811 or 0 if the value should be sign-extended. */
4814 get_narrower (tree op
, int *unsignedp_ptr
)
4819 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
4821 while (TREE_CODE (op
) == NOP_EXPR
)
4824 = (TYPE_PRECISION (TREE_TYPE (op
))
4825 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
4827 /* Truncations are many-one so cannot be removed. */
4831 /* See what's inside this conversion. If we decide to strip it,
4836 op
= TREE_OPERAND (op
, 0);
4837 /* An extension: the outermost one can be stripped,
4838 but remember whether it is zero or sign extension. */
4840 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4841 /* Otherwise, if a sign extension has been stripped,
4842 only sign extensions can now be stripped;
4843 if a zero extension has been stripped, only zero-extensions. */
4844 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
4848 else /* bitschange == 0 */
4850 /* A change in nominal type can always be stripped, but we must
4851 preserve the unsignedness. */
4853 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
4855 op
= TREE_OPERAND (op
, 0);
4856 /* Keep trying to narrow, but don't assign op to win if it
4857 would turn an integral type into something else. */
4858 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
4865 if (TREE_CODE (op
) == COMPONENT_REF
4866 /* Since type_for_size always gives an integer type. */
4867 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
4868 /* Ensure field is laid out already. */
4869 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
4870 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
4872 unsigned HOST_WIDE_INT innerprec
4873 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
4874 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
4875 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
4876 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
4878 /* We can get this structure field in a narrower type that fits it,
4879 but the resulting extension to its nominal type (a fullword type)
4880 must satisfy the same conditions as for other extensions.
4882 Do this only for fields that are aligned (not bit-fields),
4883 because when bit-field insns will be used there is no
4884 advantage in doing this. */
4886 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
4887 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
4888 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
4892 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
4893 win
= build3 (COMPONENT_REF
, type
, TREE_OPERAND (op
, 0),
4894 TREE_OPERAND (op
, 1), NULL_TREE
);
4895 TREE_SIDE_EFFECTS (win
) = TREE_SIDE_EFFECTS (op
);
4896 TREE_THIS_VOLATILE (win
) = TREE_THIS_VOLATILE (op
);
4899 *unsignedp_ptr
= uns
;
4903 /* Nonzero if integer constant C has a value that is permissible
4904 for type TYPE (an INTEGER_TYPE). */
4907 int_fits_type_p (tree c
, tree type
)
4909 tree type_low_bound
= TYPE_MIN_VALUE (type
);
4910 tree type_high_bound
= TYPE_MAX_VALUE (type
);
4911 bool ok_for_low_bound
, ok_for_high_bound
;
4914 /* If at least one bound of the type is a constant integer, we can check
4915 ourselves and maybe make a decision. If no such decision is possible, but
4916 this type is a subtype, try checking against that. Otherwise, use
4917 force_fit_type, which checks against the precision.
4919 Compute the status for each possibly constant bound, and return if we see
4920 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
4921 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
4922 for "constant known to fit". */
4924 /* Check if C >= type_low_bound. */
4925 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
4927 if (tree_int_cst_lt (c
, type_low_bound
))
4929 ok_for_low_bound
= true;
4932 ok_for_low_bound
= false;
4934 /* Check if c <= type_high_bound. */
4935 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
4937 if (tree_int_cst_lt (type_high_bound
, c
))
4939 ok_for_high_bound
= true;
4942 ok_for_high_bound
= false;
4944 /* If the constant fits both bounds, the result is known. */
4945 if (ok_for_low_bound
&& ok_for_high_bound
)
4948 /* Perform some generic filtering which may allow making a decision
4949 even if the bounds are not constant. First, negative integers
4950 never fit in unsigned types, */
4951 if (TYPE_UNSIGNED (type
) && tree_int_cst_sgn (c
) < 0)
4954 /* Second, narrower types always fit in wider ones. */
4955 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
4958 /* Third, unsigned integers with top bit set never fit signed types. */
4959 if (! TYPE_UNSIGNED (type
)
4960 && TYPE_UNSIGNED (TREE_TYPE (c
))
4961 && tree_int_cst_msb (c
))
4964 /* If we haven't been able to decide at this point, there nothing more we
4965 can check ourselves here. Look at the base type if we have one. */
4966 if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != 0)
4967 return int_fits_type_p (c
, TREE_TYPE (type
));
4969 /* Or to force_fit_type, if nothing else. */
4970 tmp
= copy_node (c
);
4971 TREE_TYPE (tmp
) = type
;
4972 tmp
= force_fit_type (tmp
, -1, false, false);
4973 return TREE_INT_CST_HIGH (tmp
) == TREE_INT_CST_HIGH (c
)
4974 && TREE_INT_CST_LOW (tmp
) == TREE_INT_CST_LOW (c
);
4977 /* Subprogram of following function. Called by walk_tree.
4979 Return *TP if it is an automatic variable or parameter of the
4980 function passed in as DATA. */
4983 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
4985 tree fn
= (tree
) data
;
4990 else if (DECL_P (*tp
)
4991 && lang_hooks
.tree_inlining
.auto_var_in_fn_p (*tp
, fn
))
4997 /* Returns true if T is, contains, or refers to a type with variable
4998 size. If FN is nonzero, only return true if a modifier of the type
4999 or position of FN is a variable or parameter inside FN.
5001 This concept is more general than that of C99 'variably modified types':
5002 in C99, a struct type is never variably modified because a VLA may not
5003 appear as a structure member. However, in GNU C code like:
5005 struct S { int i[f()]; };
5007 is valid, and other languages may define similar constructs. */
5010 variably_modified_type_p (tree type
, tree fn
)
5014 /* Test if T is either variable (if FN is zero) or an expression containing
5015 a variable in FN. */
5016 #define RETURN_TRUE_IF_VAR(T) \
5017 do { tree _t = (T); \
5018 if (_t && _t != error_mark_node && TREE_CODE (_t) != INTEGER_CST \
5019 && (!fn || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
5020 return true; } while (0)
5022 if (type
== error_mark_node
)
5025 /* If TYPE itself has variable size, it is variably modified.
5027 We do not yet have a representation of the C99 '[*]' syntax.
5028 When a representation is chosen, this function should be modified
5029 to test for that case as well. */
5030 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
5031 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT(type
));
5033 switch (TREE_CODE (type
))
5036 case REFERENCE_TYPE
:
5039 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5045 /* If TYPE is a function type, it is variably modified if any of the
5046 parameters or the return type are variably modified. */
5047 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
5050 for (t
= TYPE_ARG_TYPES (type
);
5051 t
&& t
!= void_list_node
;
5053 if (variably_modified_type_p (TREE_VALUE (t
), fn
))
5062 /* Scalar types are variably modified if their end points
5064 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
5065 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
5070 case QUAL_UNION_TYPE
:
5071 /* We can't see if any of the field are variably-modified by the
5072 definition we normally use, since that would produce infinite
5073 recursion via pointers. */
5074 /* This is variably modified if some field's type is. */
5075 for (t
= TYPE_FIELDS (type
); t
; t
= TREE_CHAIN (t
))
5076 if (TREE_CODE (t
) == FIELD_DECL
)
5078 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
5079 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
5080 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
5082 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
5083 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
5091 /* The current language may have other cases to check, but in general,
5092 all other types are not variably modified. */
5093 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
5095 #undef RETURN_TRUE_IF_VAR
5098 /* Given a DECL or TYPE, return the scope in which it was declared, or
5099 NULL_TREE if there is no containing scope. */
5102 get_containing_scope (tree t
)
5104 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
5107 /* Return the innermost context enclosing DECL that is
5108 a FUNCTION_DECL, or zero if none. */
5111 decl_function_context (tree decl
)
5115 if (TREE_CODE (decl
) == ERROR_MARK
)
5118 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
5119 where we look up the function at runtime. Such functions always take
5120 a first argument of type 'pointer to real context'.
5122 C++ should really be fixed to use DECL_CONTEXT for the real context,
5123 and use something else for the "virtual context". */
5124 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
5127 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
5129 context
= DECL_CONTEXT (decl
);
5131 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
5133 if (TREE_CODE (context
) == BLOCK
)
5134 context
= BLOCK_SUPERCONTEXT (context
);
5136 context
= get_containing_scope (context
);
5142 /* Return the innermost context enclosing DECL that is
5143 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
5144 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
5147 decl_type_context (tree decl
)
5149 tree context
= DECL_CONTEXT (decl
);
5152 switch (TREE_CODE (context
))
5154 case NAMESPACE_DECL
:
5155 case TRANSLATION_UNIT_DECL
:
5160 case QUAL_UNION_TYPE
:
5165 context
= DECL_CONTEXT (context
);
5169 context
= BLOCK_SUPERCONTEXT (context
);
5179 /* CALL is a CALL_EXPR. Return the declaration for the function
5180 called, or NULL_TREE if the called function cannot be
5184 get_callee_fndecl (tree call
)
5188 /* It's invalid to call this function with anything but a
5190 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
5192 /* The first operand to the CALL is the address of the function
5194 addr
= TREE_OPERAND (call
, 0);
5198 /* If this is a readonly function pointer, extract its initial value. */
5199 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
5200 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
5201 && DECL_INITIAL (addr
))
5202 addr
= DECL_INITIAL (addr
);
5204 /* If the address is just `&f' for some function `f', then we know
5205 that `f' is being called. */
5206 if (TREE_CODE (addr
) == ADDR_EXPR
5207 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
5208 return TREE_OPERAND (addr
, 0);
5210 /* We couldn't figure out what was being called. Maybe the front
5211 end has some idea. */
5212 return lang_hooks
.lang_get_callee_fndecl (call
);
5215 /* Print debugging information about tree nodes generated during the compile,
5216 and any language-specific information. */
5219 dump_tree_statistics (void)
5221 #ifdef GATHER_STATISTICS
5223 int total_nodes
, total_bytes
;
5226 fprintf (stderr
, "\n??? tree nodes created\n\n");
5227 #ifdef GATHER_STATISTICS
5228 fprintf (stderr
, "Kind Nodes Bytes\n");
5229 fprintf (stderr
, "---------------------------------------\n");
5230 total_nodes
= total_bytes
= 0;
5231 for (i
= 0; i
< (int) all_kinds
; i
++)
5233 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
5234 tree_node_counts
[i
], tree_node_sizes
[i
]);
5235 total_nodes
+= tree_node_counts
[i
];
5236 total_bytes
+= tree_node_sizes
[i
];
5238 fprintf (stderr
, "---------------------------------------\n");
5239 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
5240 fprintf (stderr
, "---------------------------------------\n");
5241 ssanames_print_statistics ();
5242 phinodes_print_statistics ();
5244 fprintf (stderr
, "(No per-node statistics)\n");
5246 print_type_hash_statistics ();
5247 lang_hooks
.print_statistics ();
5250 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
5252 /* Generate a crc32 of a string. */
5255 crc32_string (unsigned chksum
, const char *string
)
5259 unsigned value
= *string
<< 24;
5262 for (ix
= 8; ix
--; value
<<= 1)
5266 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
5275 /* P is a string that will be used in a symbol. Mask out any characters
5276 that are not valid in that context. */
5279 clean_symbol_name (char *p
)
5283 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
5286 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
5293 /* Generate a name for a function unique to this translation unit.
5294 TYPE is some string to identify the purpose of this function to the
5295 linker or collect2. */
5298 get_file_function_name_long (const char *type
)
5304 if (first_global_object_name
)
5305 p
= first_global_object_name
;
5308 /* We don't have anything that we know to be unique to this translation
5309 unit, so use what we do have and throw in some randomness. */
5311 const char *name
= weak_global_object_name
;
5312 const char *file
= main_input_filename
;
5317 file
= input_filename
;
5319 len
= strlen (file
);
5320 q
= alloca (9 * 2 + len
+ 1);
5321 memcpy (q
, file
, len
+ 1);
5322 clean_symbol_name (q
);
5324 sprintf (q
+ len
, "_%08X_%08X", crc32_string (0, name
),
5325 crc32_string (0, flag_random_seed
));
5330 buf
= alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
) + strlen (type
));
5332 /* Set up the name of the file-level functions we may need.
5333 Use a global object (which is already required to be unique over
5334 the program) rather than the file name (which imposes extra
5336 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
5338 return get_identifier (buf
);
5341 /* If KIND=='I', return a suitable global initializer (constructor) name.
5342 If KIND=='D', return a suitable global clean-up (destructor) name. */
5345 get_file_function_name (int kind
)
5352 return get_file_function_name_long (p
);
5355 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5356 The result is placed in BUFFER (which has length BIT_SIZE),
5357 with one bit in each char ('\000' or '\001').
5359 If the constructor is constant, NULL_TREE is returned.
5360 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5363 get_set_constructor_bits (tree init
, char *buffer
, int bit_size
)
5367 HOST_WIDE_INT domain_min
5368 = tree_low_cst (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (init
))), 0);
5369 tree non_const_bits
= NULL_TREE
;
5371 for (i
= 0; i
< bit_size
; i
++)
5374 for (vals
= TREE_OPERAND (init
, 1);
5375 vals
!= NULL_TREE
; vals
= TREE_CHAIN (vals
))
5377 if (!host_integerp (TREE_VALUE (vals
), 0)
5378 || (TREE_PURPOSE (vals
) != NULL_TREE
5379 && !host_integerp (TREE_PURPOSE (vals
), 0)))
5381 = tree_cons (TREE_PURPOSE (vals
), TREE_VALUE (vals
), non_const_bits
);
5382 else if (TREE_PURPOSE (vals
) != NULL_TREE
)
5384 /* Set a range of bits to ones. */
5385 HOST_WIDE_INT lo_index
5386 = tree_low_cst (TREE_PURPOSE (vals
), 0) - domain_min
;
5387 HOST_WIDE_INT hi_index
5388 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5390 gcc_assert (lo_index
>= 0);
5391 gcc_assert (lo_index
< bit_size
);
5392 gcc_assert (hi_index
>= 0);
5393 gcc_assert (hi_index
< bit_size
);
5394 for (; lo_index
<= hi_index
; lo_index
++)
5395 buffer
[lo_index
] = 1;
5399 /* Set a single bit to one. */
5401 = tree_low_cst (TREE_VALUE (vals
), 0) - domain_min
;
5402 if (index
< 0 || index
>= bit_size
)
5404 error ("invalid initializer for bit string");
5410 return non_const_bits
;
5413 /* Expand (the constant part of) a SET_TYPE CONSTRUCTOR node.
5414 The result is placed in BUFFER (which is an array of bytes).
5415 If the constructor is constant, NULL_TREE is returned.
5416 Otherwise, a TREE_LIST of the non-constant elements is emitted. */
5419 get_set_constructor_bytes (tree init
, unsigned char *buffer
, int wd_size
)
5422 int set_word_size
= BITS_PER_UNIT
;
5423 int bit_size
= wd_size
* set_word_size
;
5425 unsigned char *bytep
= buffer
;
5426 char *bit_buffer
= alloca (bit_size
);
5427 tree non_const_bits
= get_set_constructor_bits (init
, bit_buffer
, bit_size
);
5429 for (i
= 0; i
< wd_size
; i
++)
5432 for (i
= 0; i
< bit_size
; i
++)
5436 if (BYTES_BIG_ENDIAN
)
5437 *bytep
|= (1 << (set_word_size
- 1 - bit_pos
));
5439 *bytep
|= 1 << bit_pos
;
5442 if (bit_pos
>= set_word_size
)
5443 bit_pos
= 0, bytep
++;
5445 return non_const_bits
;
5448 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
5450 /* Complain that the tree code of NODE does not match the expected 0
5451 terminated list of trailing codes. The trailing code list can be
5452 empty, for a more vague error message. FILE, LINE, and FUNCTION
5453 are of the caller. */
5456 tree_check_failed (const tree node
, const char *file
,
5457 int line
, const char *function
, ...)
5461 unsigned length
= 0;
5464 va_start (args
, function
);
5465 while ((code
= va_arg (args
, int)))
5466 length
+= 4 + strlen (tree_code_name
[code
]);
5470 va_start (args
, function
);
5471 length
+= strlen ("expected ");
5472 buffer
= alloca (length
);
5474 while ((code
= va_arg (args
, int)))
5476 const char *prefix
= length
? " or " : "expected ";
5478 strcpy (buffer
+ length
, prefix
);
5479 length
+= strlen (prefix
);
5480 strcpy (buffer
+ length
, tree_code_name
[code
]);
5481 length
+= strlen (tree_code_name
[code
]);
5486 buffer
= (char *)"unexpected node";
5488 internal_error ("tree check: %s, have %s in %s, at %s:%d",
5489 buffer
, tree_code_name
[TREE_CODE (node
)],
5490 function
, trim_filename (file
), line
);
5493 /* Complain that the tree code of NODE does match the expected 0
5494 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
5498 tree_not_check_failed (const tree node
, const char *file
,
5499 int line
, const char *function
, ...)
5503 unsigned length
= 0;
5506 va_start (args
, function
);
5507 while ((code
= va_arg (args
, int)))
5508 length
+= 4 + strlen (tree_code_name
[code
]);
5510 va_start (args
, function
);
5511 buffer
= alloca (length
);
5513 while ((code
= va_arg (args
, int)))
5517 strcpy (buffer
+ length
, " or ");
5520 strcpy (buffer
+ length
, tree_code_name
[code
]);
5521 length
+= strlen (tree_code_name
[code
]);
5525 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
5526 buffer
, tree_code_name
[TREE_CODE (node
)],
5527 function
, trim_filename (file
), line
);
5530 /* Similar to tree_check_failed, except that we check for a class of tree
5531 code, given in CL. */
5534 tree_class_check_failed (const tree node
, const enum tree_code_class cl
,
5535 const char *file
, int line
, const char *function
)
5538 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
5539 TREE_CODE_CLASS_STRING (cl
),
5540 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
5541 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
5544 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
5545 (dynamically sized) vector. */
5548 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5549 const char *function
)
5552 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
5553 idx
+ 1, len
, function
, trim_filename (file
), line
);
5556 /* Similar to above, except that the check is for the bounds of a PHI_NODE's
5557 (dynamically sized) vector. */
5560 phi_node_elt_check_failed (int idx
, int len
, const char *file
, int line
,
5561 const char *function
)
5564 ("tree check: accessed elt %d of phi_node with %d elts in %s, at %s:%d",
5565 idx
+ 1, len
, function
, trim_filename (file
), line
);
5568 /* Similar to above, except that the check is for the bounds of the operand
5569 vector of an expression node. */
5572 tree_operand_check_failed (int idx
, enum tree_code code
, const char *file
,
5573 int line
, const char *function
)
5576 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
5577 idx
+ 1, tree_code_name
[code
], TREE_CODE_LENGTH (code
),
5578 function
, trim_filename (file
), line
);
5580 #endif /* ENABLE_TREE_CHECKING */
5582 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
5583 and mapped to the machine mode MODE. Initialize its fields and build
5584 the information necessary for debugging output. */
5587 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
5589 tree t
= make_node (VECTOR_TYPE
);
5591 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
5592 TYPE_VECTOR_SUBPARTS (t
) = nunits
;
5593 TYPE_MODE (t
) = mode
;
5594 TYPE_READONLY (t
) = TYPE_READONLY (innertype
);
5595 TYPE_VOLATILE (t
) = TYPE_VOLATILE (innertype
);
5600 tree index
= build_int_cst (NULL_TREE
, nunits
- 1);
5601 tree array
= build_array_type (innertype
, build_index_type (index
));
5602 tree rt
= make_node (RECORD_TYPE
);
5604 TYPE_FIELDS (rt
) = build_decl (FIELD_DECL
, get_identifier ("f"), array
);
5605 DECL_CONTEXT (TYPE_FIELDS (rt
)) = rt
;
5607 TYPE_DEBUG_REPRESENTATION_TYPE (t
) = rt
;
5608 /* In dwarfout.c, type lookup uses TYPE_UID numbers. We want to output
5609 the representation type, and we want to find that die when looking up
5610 the vector type. This is most easily achieved by making the TYPE_UID
5612 TYPE_UID (rt
) = TYPE_UID (t
);
5615 /* Build our main variant, based on the main variant of the inner type. */
5616 if (TYPE_MAIN_VARIANT (innertype
) != innertype
)
5618 tree innertype_main_variant
= TYPE_MAIN_VARIANT (innertype
);
5619 unsigned int hash
= TYPE_HASH (innertype_main_variant
);
5620 TYPE_MAIN_VARIANT (t
)
5621 = type_hash_canon (hash
, make_vector_type (innertype_main_variant
,
5629 make_or_reuse_type (unsigned size
, int unsignedp
)
5631 if (size
== INT_TYPE_SIZE
)
5632 return unsignedp
? unsigned_type_node
: integer_type_node
;
5633 if (size
== CHAR_TYPE_SIZE
)
5634 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5635 if (size
== SHORT_TYPE_SIZE
)
5636 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5637 if (size
== LONG_TYPE_SIZE
)
5638 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5639 if (size
== LONG_LONG_TYPE_SIZE
)
5640 return (unsignedp
? long_long_unsigned_type_node
5641 : long_long_integer_type_node
);
5644 return make_unsigned_type (size
);
5646 return make_signed_type (size
);
5649 /* Create nodes for all integer types (and error_mark_node) using the sizes
5650 of C datatypes. The caller should call set_sizetype soon after calling
5651 this function to select one of the types as sizetype. */
5654 build_common_tree_nodes (bool signed_char
, bool signed_sizetype
)
5656 error_mark_node
= make_node (ERROR_MARK
);
5657 TREE_TYPE (error_mark_node
) = error_mark_node
;
5659 initialize_sizetypes (signed_sizetype
);
5661 /* Define both `signed char' and `unsigned char'. */
5662 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
5663 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
5665 /* Define `char', which is like either `signed char' or `unsigned char'
5666 but not the same as either. */
5669 ? make_signed_type (CHAR_TYPE_SIZE
)
5670 : make_unsigned_type (CHAR_TYPE_SIZE
));
5672 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
5673 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
5674 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
5675 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
5676 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
5677 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
5678 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
5679 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
5681 /* Define a boolean type. This type only represents boolean values but
5682 may be larger than char depending on the value of BOOL_TYPE_SIZE.
5683 Front ends which want to override this size (i.e. Java) can redefine
5684 boolean_type_node before calling build_common_tree_nodes_2. */
5685 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
5686 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
5687 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
5688 TYPE_PRECISION (boolean_type_node
) = 1;
5690 /* Fill in the rest of the sized types. Reuse existing type nodes
5692 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
5693 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
5694 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
5695 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
5696 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
5698 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
5699 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
5700 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
5701 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
5702 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
5704 access_public_node
= get_identifier ("public");
5705 access_protected_node
= get_identifier ("protected");
5706 access_private_node
= get_identifier ("private");
5709 /* Call this function after calling build_common_tree_nodes and set_sizetype.
5710 It will create several other common tree nodes. */
5713 build_common_tree_nodes_2 (int short_double
)
5715 /* Define these next since types below may used them. */
5716 integer_zero_node
= build_int_cst (NULL_TREE
, 0);
5717 integer_one_node
= build_int_cst (NULL_TREE
, 1);
5718 integer_minus_one_node
= build_int_cst (NULL_TREE
, -1);
5720 size_zero_node
= size_int (0);
5721 size_one_node
= size_int (1);
5722 bitsize_zero_node
= bitsize_int (0);
5723 bitsize_one_node
= bitsize_int (1);
5724 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
5726 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
5727 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
5729 void_type_node
= make_node (VOID_TYPE
);
5730 layout_type (void_type_node
);
5732 /* We are not going to have real types in C with less than byte alignment,
5733 so we might as well not have any types that claim to have it. */
5734 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
5735 TYPE_USER_ALIGN (void_type_node
) = 0;
5737 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
5738 layout_type (TREE_TYPE (null_pointer_node
));
5740 ptr_type_node
= build_pointer_type (void_type_node
);
5742 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
5743 fileptr_type_node
= ptr_type_node
;
5745 float_type_node
= make_node (REAL_TYPE
);
5746 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
5747 layout_type (float_type_node
);
5749 double_type_node
= make_node (REAL_TYPE
);
5751 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
5753 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
5754 layout_type (double_type_node
);
5756 long_double_type_node
= make_node (REAL_TYPE
);
5757 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
5758 layout_type (long_double_type_node
);
5760 float_ptr_type_node
= build_pointer_type (float_type_node
);
5761 double_ptr_type_node
= build_pointer_type (double_type_node
);
5762 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
5763 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
5765 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
5766 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
5767 layout_type (complex_integer_type_node
);
5769 complex_float_type_node
= make_node (COMPLEX_TYPE
);
5770 TREE_TYPE (complex_float_type_node
) = float_type_node
;
5771 layout_type (complex_float_type_node
);
5773 complex_double_type_node
= make_node (COMPLEX_TYPE
);
5774 TREE_TYPE (complex_double_type_node
) = double_type_node
;
5775 layout_type (complex_double_type_node
);
5777 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
5778 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
5779 layout_type (complex_long_double_type_node
);
5782 tree t
= targetm
.build_builtin_va_list ();
5784 /* Many back-ends define record types without setting TYPE_NAME.
5785 If we copied the record type here, we'd keep the original
5786 record type without a name. This breaks name mangling. So,
5787 don't copy record types and let c_common_nodes_and_builtins()
5788 declare the type to be __builtin_va_list. */
5789 if (TREE_CODE (t
) != RECORD_TYPE
)
5790 t
= build_variant_type_copy (t
);
5792 va_list_type_node
= t
;
5796 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
5799 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
5800 const char *library_name
, int ecf_flags
)
5804 decl
= lang_hooks
.builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
5805 library_name
, NULL_TREE
);
5806 if (ecf_flags
& ECF_CONST
)
5807 TREE_READONLY (decl
) = 1;
5808 if (ecf_flags
& ECF_PURE
)
5809 DECL_IS_PURE (decl
) = 1;
5810 if (ecf_flags
& ECF_NORETURN
)
5811 TREE_THIS_VOLATILE (decl
) = 1;
5812 if (ecf_flags
& ECF_NOTHROW
)
5813 TREE_NOTHROW (decl
) = 1;
5814 if (ecf_flags
& ECF_MALLOC
)
5815 DECL_IS_MALLOC (decl
) = 1;
5817 built_in_decls
[code
] = decl
;
5818 implicit_built_in_decls
[code
] = decl
;
5821 /* Call this function after instantiating all builtins that the language
5822 front end cares about. This will build the rest of the builtins that
5823 are relied upon by the tree optimizers and the middle-end. */
5826 build_common_builtin_nodes (void)
5830 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
5831 || built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
5833 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5834 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5835 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5836 ftype
= build_function_type (ptr_type_node
, tmp
);
5838 if (built_in_decls
[BUILT_IN_MEMCPY
] == NULL
)
5839 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
5840 "memcpy", ECF_NOTHROW
);
5841 if (built_in_decls
[BUILT_IN_MEMMOVE
] == NULL
)
5842 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
5843 "memmove", ECF_NOTHROW
);
5846 if (built_in_decls
[BUILT_IN_MEMCMP
] == NULL
)
5848 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5849 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5850 tmp
= tree_cons (NULL_TREE
, const_ptr_type_node
, tmp
);
5851 ftype
= build_function_type (ptr_type_node
, tmp
);
5852 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
5853 "memcmp", ECF_PURE
| ECF_NOTHROW
);
5856 if (built_in_decls
[BUILT_IN_MEMSET
] == NULL
)
5858 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5859 tmp
= tree_cons (NULL_TREE
, integer_type_node
, tmp
);
5860 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5861 ftype
= build_function_type (ptr_type_node
, tmp
);
5862 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
5863 "memset", ECF_NOTHROW
);
5866 if (built_in_decls
[BUILT_IN_ALLOCA
] == NULL
)
5868 tmp
= tree_cons (NULL_TREE
, size_type_node
, void_list_node
);
5869 ftype
= build_function_type (ptr_type_node
, tmp
);
5870 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
5871 "alloca", ECF_NOTHROW
| ECF_MALLOC
);
5874 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5875 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5876 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5877 ftype
= build_function_type (void_type_node
, tmp
);
5878 local_define_builtin ("__builtin_init_trampoline", ftype
,
5879 BUILT_IN_INIT_TRAMPOLINE
,
5880 "__builtin_init_trampoline", ECF_NOTHROW
);
5882 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5883 ftype
= build_function_type (ptr_type_node
, tmp
);
5884 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
5885 BUILT_IN_ADJUST_TRAMPOLINE
,
5886 "__builtin_adjust_trampoline",
5887 ECF_CONST
| ECF_NOTHROW
);
5889 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5890 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, tmp
);
5891 ftype
= build_function_type (void_type_node
, tmp
);
5892 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
5893 BUILT_IN_NONLOCAL_GOTO
,
5894 "__builtin_nonlocal_goto",
5895 ECF_NORETURN
| ECF_NOTHROW
);
5897 ftype
= build_function_type (ptr_type_node
, void_list_node
);
5898 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
5899 "__builtin_stack_save", ECF_NOTHROW
);
5901 tmp
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
5902 ftype
= build_function_type (void_type_node
, tmp
);
5903 local_define_builtin ("__builtin_stack_restore", ftype
,
5904 BUILT_IN_STACK_RESTORE
,
5905 "__builtin_stack_restore", ECF_NOTHROW
);
5907 ftype
= build_function_type (void_type_node
, void_list_node
);
5908 local_define_builtin ("__builtin_profile_func_enter", ftype
,
5909 BUILT_IN_PROFILE_FUNC_ENTER
, "profile_func_enter", 0);
5910 local_define_builtin ("__builtin_profile_func_exit", ftype
,
5911 BUILT_IN_PROFILE_FUNC_EXIT
, "profile_func_exit", 0);
5913 /* Complex multiplication and division. These are handled as builtins
5914 rather than optabs because emit_library_call_value doesn't support
5915 complex. Further, we can do slightly better with folding these
5916 beasties if the real and complex parts of the arguments are separate. */
5918 enum machine_mode mode
;
5920 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
5922 char mode_name_buf
[4], *q
;
5924 enum built_in_function mcode
, dcode
;
5925 tree type
, inner_type
;
5927 type
= lang_hooks
.types
.type_for_mode (mode
, 0);
5930 inner_type
= TREE_TYPE (type
);
5932 tmp
= tree_cons (NULL_TREE
, inner_type
, void_list_node
);
5933 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
5934 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
5935 tmp
= tree_cons (NULL_TREE
, inner_type
, tmp
);
5936 ftype
= build_function_type (type
, tmp
);
5938 mcode
= BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
5939 dcode
= BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
;
5941 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
5945 built_in_names
[mcode
] = concat ("__mul", mode_name_buf
, "3", NULL
);
5946 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
5947 built_in_names
[mcode
], ECF_CONST
| ECF_NOTHROW
);
5949 built_in_names
[dcode
] = concat ("__div", mode_name_buf
, "3", NULL
);
5950 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
5951 built_in_names
[dcode
], ECF_CONST
| ECF_NOTHROW
);
5956 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
5959 If we requested a pointer to a vector, build up the pointers that
5960 we stripped off while looking for the inner type. Similarly for
5961 return values from functions.
5963 The argument TYPE is the top of the chain, and BOTTOM is the
5964 new type which we will point to. */
5967 reconstruct_complex_type (tree type
, tree bottom
)
5971 if (POINTER_TYPE_P (type
))
5973 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5974 outer
= build_pointer_type (inner
);
5976 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5978 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5979 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
5981 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
5983 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5984 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
5986 else if (TREE_CODE (type
) == METHOD_TYPE
)
5989 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
5990 /* The build_method_type_directly() routine prepends 'this' to argument list,
5991 so we must compensate by getting rid of it. */
5992 argtypes
= TYPE_ARG_TYPES (type
);
5993 outer
= build_method_type_directly (TYPE_METHOD_BASETYPE (type
),
5995 TYPE_ARG_TYPES (type
));
5996 TYPE_ARG_TYPES (outer
) = argtypes
;
6001 TYPE_READONLY (outer
) = TYPE_READONLY (type
);
6002 TYPE_VOLATILE (outer
) = TYPE_VOLATILE (type
);
6007 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
6010 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
6014 switch (GET_MODE_CLASS (mode
))
6016 case MODE_VECTOR_INT
:
6017 case MODE_VECTOR_FLOAT
:
6018 nunits
= GET_MODE_NUNITS (mode
);
6022 /* Check that there are no leftover bits. */
6023 gcc_assert (GET_MODE_BITSIZE (mode
)
6024 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
6026 nunits
= GET_MODE_BITSIZE (mode
)
6027 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
6034 return make_vector_type (innertype
, nunits
, mode
);
6037 /* Similarly, but takes the inner type and number of units, which must be
6041 build_vector_type (tree innertype
, int nunits
)
6043 return make_vector_type (innertype
, nunits
, VOIDmode
);
6046 /* Given an initializer INIT, return TRUE if INIT is zero or some
6047 aggregate of zeros. Otherwise return FALSE. */
6049 initializer_zerop (tree init
)
6055 switch (TREE_CODE (init
))
6058 return integer_zerop (init
);
6061 /* ??? Note that this is not correct for C4X float formats. There,
6062 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
6063 negative exponent. */
6064 return real_zerop (init
)
6065 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
6068 return integer_zerop (init
)
6069 || (real_zerop (init
)
6070 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
6071 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
6074 for (elt
= TREE_VECTOR_CST_ELTS (init
); elt
; elt
= TREE_CHAIN (elt
))
6075 if (!initializer_zerop (TREE_VALUE (elt
)))
6080 elt
= CONSTRUCTOR_ELTS (init
);
6081 if (elt
== NULL_TREE
)
6084 for (; elt
; elt
= TREE_CHAIN (elt
))
6085 if (! initializer_zerop (TREE_VALUE (elt
)))
6095 add_var_to_bind_expr (tree bind_expr
, tree var
)
6097 BIND_EXPR_VARS (bind_expr
)
6098 = chainon (BIND_EXPR_VARS (bind_expr
), var
);
6099 if (BIND_EXPR_BLOCK (bind_expr
))
6100 BLOCK_VARS (BIND_EXPR_BLOCK (bind_expr
))
6101 = BIND_EXPR_VARS (bind_expr
);
6104 /* Build an empty statement. */
6107 build_empty_stmt (void)
6109 return build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
6113 /* Returns true if it is possible to prove that the index of
6114 an array access REF (an ARRAY_REF expression) falls into the
6118 in_array_bounds_p (tree ref
)
6120 tree idx
= TREE_OPERAND (ref
, 1);
6123 if (TREE_CODE (idx
) != INTEGER_CST
)
6126 min
= array_ref_low_bound (ref
);
6127 max
= array_ref_up_bound (ref
);
6130 || TREE_CODE (min
) != INTEGER_CST
6131 || TREE_CODE (max
) != INTEGER_CST
)
6134 if (tree_int_cst_lt (idx
, min
)
6135 || tree_int_cst_lt (max
, idx
))
6141 /* Return true if T (assumed to be a DECL) is a global variable. */
6144 is_global_var (tree t
)
6146 return (TREE_STATIC (t
) || DECL_EXTERNAL (t
));
6149 /* Return true if T (assumed to be a DECL) must be assigned a memory
6153 needs_to_live_in_memory (tree t
)
6155 return (TREE_ADDRESSABLE (t
)
6156 || is_global_var (t
)
6157 || (TREE_CODE (t
) == RESULT_DECL
6158 && aggregate_value_p (t
, current_function_decl
)));
6161 /* There are situations in which a language considers record types
6162 compatible which have different field lists. Decide if two fields
6163 are compatible. It is assumed that the parent records are compatible. */
6166 fields_compatible_p (tree f1
, tree f2
)
6168 if (!operand_equal_p (DECL_FIELD_BIT_OFFSET (f1
),
6169 DECL_FIELD_BIT_OFFSET (f2
), OEP_ONLY_CONST
))
6172 if (!operand_equal_p (DECL_FIELD_OFFSET (f1
),
6173 DECL_FIELD_OFFSET (f2
), OEP_ONLY_CONST
))
6176 if (!lang_hooks
.types_compatible_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
6182 /* Locate within RECORD a field that is compatible with ORIG_FIELD. */
6185 find_compatible_field (tree record
, tree orig_field
)
6189 for (f
= TYPE_FIELDS (record
); f
; f
= TREE_CHAIN (f
))
6190 if (TREE_CODE (f
) == FIELD_DECL
6191 && fields_compatible_p (f
, orig_field
))
6194 /* ??? Why isn't this on the main fields list? */
6195 f
= TYPE_VFIELD (record
);
6196 if (f
&& TREE_CODE (f
) == FIELD_DECL
6197 && fields_compatible_p (f
, orig_field
))
6200 /* ??? We should abort here, but Java appears to do Bad Things
6201 with inherited fields. */
6205 /* Return value of a constant X. */
6208 int_cst_value (tree x
)
6210 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
6211 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
6212 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
6214 gcc_assert (bits
<= HOST_BITS_PER_WIDE_INT
);
6217 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
6219 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
6224 /* Returns the greatest common divisor of A and B, which must be
6228 tree_fold_gcd (tree a
, tree b
)
6231 tree type
= TREE_TYPE (a
);
6233 gcc_assert (TREE_CODE (a
) == INTEGER_CST
);
6234 gcc_assert (TREE_CODE (b
) == INTEGER_CST
);
6236 if (integer_zerop (a
))
6239 if (integer_zerop (b
))
6242 if (tree_int_cst_sgn (a
) == -1)
6243 a
= fold (build2 (MULT_EXPR
, type
, a
,
6244 convert (type
, integer_minus_one_node
)));
6246 if (tree_int_cst_sgn (b
) == -1)
6247 b
= fold (build2 (MULT_EXPR
, type
, b
,
6248 convert (type
, integer_minus_one_node
)));
6252 a_mod_b
= fold (build2 (FLOOR_MOD_EXPR
, type
, a
, b
));
6254 if (!TREE_INT_CST_LOW (a_mod_b
)
6255 && !TREE_INT_CST_HIGH (a_mod_b
))
6263 /* Returns unsigned variant of TYPE. */
6266 unsigned_type_for (tree type
)
6268 return lang_hooks
.types
.unsigned_type (type
);
6271 /* Returns signed variant of TYPE. */
6274 signed_type_for (tree type
)
6276 return lang_hooks
.types
.signed_type (type
);
6279 /* Returns the largest value obtainable by casting something in INNER type to
6283 upper_bound_in_type (tree outer
, tree inner
)
6285 unsigned HOST_WIDE_INT lo
, hi
;
6286 unsigned bits
= TYPE_PRECISION (inner
);
6288 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6290 /* Zero extending in these cases. */
6291 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6294 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6295 >> (HOST_BITS_PER_WIDE_INT
- bits
);
6299 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6300 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
);
6301 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6306 /* Sign extending in these cases. */
6307 if (bits
<= HOST_BITS_PER_WIDE_INT
)
6310 lo
= (~(unsigned HOST_WIDE_INT
) 0)
6311 >> (HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6315 hi
= (~(unsigned HOST_WIDE_INT
) 0)
6316 >> (2 * HOST_BITS_PER_WIDE_INT
- bits
) >> 1;
6317 lo
= ~(unsigned HOST_WIDE_INT
) 0;
6321 return fold_convert (outer
,
6322 build_int_cst_wide (inner
, lo
, hi
));
6325 /* Returns the smallest value obtainable by casting something in INNER type to
6329 lower_bound_in_type (tree outer
, tree inner
)
6331 unsigned HOST_WIDE_INT lo
, hi
;
6332 unsigned bits
= TYPE_PRECISION (inner
);
6334 if (TYPE_UNSIGNED (outer
) || TYPE_UNSIGNED (inner
))
6336 else if (bits
<= HOST_BITS_PER_WIDE_INT
)
6338 hi
= ~(unsigned HOST_WIDE_INT
) 0;
6339 lo
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1);
6343 hi
= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- HOST_BITS_PER_WIDE_INT
- 1);
6347 return fold_convert (outer
,
6348 build_int_cst_wide (inner
, lo
, hi
));
6351 /* Return nonzero if two operands that are suitable for PHI nodes are
6352 necessarily equal. Specifically, both ARG0 and ARG1 must be either
6353 SSA_NAME or invariant. Note that this is strictly an optimization.
6354 That is, callers of this function can directly call operand_equal_p
6355 and get the same result, only slower. */
6358 operand_equal_for_phi_arg_p (tree arg0
, tree arg1
)
6362 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
6364 return operand_equal_p (arg0
, arg1
, 0);
6367 /* Returns number of zeros at the end of binary representation of X.
6369 ??? Use ffs if available? */
6372 num_ending_zeros (tree x
)
6374 unsigned HOST_WIDE_INT fr
, nfr
;
6375 unsigned num
, abits
;
6376 tree type
= TREE_TYPE (x
);
6378 if (TREE_INT_CST_LOW (x
) == 0)
6380 num
= HOST_BITS_PER_WIDE_INT
;
6381 fr
= TREE_INT_CST_HIGH (x
);
6386 fr
= TREE_INT_CST_LOW (x
);
6389 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
6392 if (nfr
<< abits
== fr
)
6399 if (num
> TYPE_PRECISION (type
))
6400 num
= TYPE_PRECISION (type
);
6402 return build_int_cst_type (type
, num
);
6405 #include "gt-tree.h"
projects / gcc.git / blob