1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
41 #include "diagnostic.h"
48 static tree
pfn_from_ptrmemfunc (tree
);
49 static tree
delta_from_ptrmemfunc (tree
);
50 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, int,
52 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
);
53 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
55 static int comp_ptr_ttypes_real (tree
, tree
, int);
56 static bool comp_except_types (tree
, tree
, bool);
57 static bool comp_array_types (const_tree
, const_tree
, bool);
58 static tree
pointer_diff (tree
, tree
, tree
);
59 static tree
get_delta_difference (tree
, tree
, bool, bool);
60 static void casts_away_constness_r (tree
*, tree
*);
61 static bool casts_away_constness (tree
, tree
);
62 static void maybe_warn_about_returning_address_of_local (tree
);
63 static tree
lookup_destructor (tree
, tree
, tree
);
64 static void warn_args_num (location_t
, tree
, bool);
65 static int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
68 /* Do `exp = require_complete_type (exp);' to make sure exp
69 does not have an incomplete type. (That includes void types.)
70 Returns the error_mark_node if the VALUE does not have
71 complete type when this function returns. */
74 require_complete_type (tree value
)
78 if (processing_template_decl
|| value
== error_mark_node
)
81 if (TREE_CODE (value
) == OVERLOAD
)
82 type
= unknown_type_node
;
84 type
= TREE_TYPE (value
);
86 if (type
== error_mark_node
)
87 return error_mark_node
;
89 /* First, detect a valid value with a complete type. */
90 if (COMPLETE_TYPE_P (type
))
93 if (complete_type_or_else (type
, value
))
96 return error_mark_node
;
99 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
100 a template instantiation, do the instantiation. Returns TYPE,
101 whether or not it could be completed, unless something goes
102 horribly wrong, in which case the error_mark_node is returned. */
105 complete_type (tree type
)
107 if (type
== NULL_TREE
)
108 /* Rather than crash, we return something sure to cause an error
110 return error_mark_node
;
112 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
114 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
116 tree t
= complete_type (TREE_TYPE (type
));
117 unsigned int needs_constructing
, has_nontrivial_dtor
;
118 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
121 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
123 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
124 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
126 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
127 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
130 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
131 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
136 /* Like complete_type, but issue an error if the TYPE cannot be completed.
137 VALUE is used for informative diagnostics.
138 Returns NULL_TREE if the type cannot be made complete. */
141 complete_type_or_else (tree type
, tree value
)
143 type
= complete_type (type
);
144 if (type
== error_mark_node
)
145 /* We already issued an error. */
147 else if (!COMPLETE_TYPE_P (type
))
149 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
156 /* Return truthvalue of whether type of EXP is instantiated. */
159 type_unknown_p (const_tree exp
)
161 return (TREE_CODE (exp
) == TREE_LIST
162 || TREE_TYPE (exp
) == unknown_type_node
);
166 /* Return the common type of two parameter lists.
167 We assume that comptypes has already been done and returned 1;
168 if that isn't so, this may crash.
170 As an optimization, free the space we allocate if the parameter
171 lists are already common. */
174 commonparms (tree p1
, tree p2
)
176 tree oldargs
= p1
, newargs
, n
;
180 len
= list_length (p1
);
181 newargs
= tree_last (p1
);
183 if (newargs
== void_list_node
)
192 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
197 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
199 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
201 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
204 else if (! TREE_PURPOSE (p1
))
206 if (TREE_PURPOSE (p2
))
208 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
214 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
216 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
218 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
221 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
224 TREE_VALUE (n
) = TREE_VALUE (p1
);
232 /* Given a type, perhaps copied for a typedef,
233 find the "original" version of it. */
235 original_type (tree t
)
237 int quals
= cp_type_quals (t
);
238 while (t
!= error_mark_node
239 && TYPE_NAME (t
) != NULL_TREE
)
241 tree x
= TYPE_NAME (t
);
242 if (TREE_CODE (x
) != TYPE_DECL
)
244 x
= DECL_ORIGINAL_TYPE (x
);
249 return cp_build_qualified_type (t
, quals
);
252 /* Return the common type for two arithmetic types T1 and T2 under the
253 usual arithmetic conversions. The default conversions have already
254 been applied, and enumerated types converted to their compatible
258 cp_common_type (tree t1
, tree t2
)
260 enum tree_code code1
= TREE_CODE (t1
);
261 enum tree_code code2
= TREE_CODE (t2
);
264 /* In what follows, we slightly generalize the rules given in [expr] so
265 as to deal with `long long' and `complex'. First, merge the
267 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
269 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
271 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
272 return build_type_attribute_variant (t1
, attributes
);
277 /* FIXME: Attributes. */
278 gcc_assert (ARITHMETIC_TYPE_P (t1
)
279 || TREE_CODE (t1
) == VECTOR_TYPE
280 || UNSCOPED_ENUM_P (t1
));
281 gcc_assert (ARITHMETIC_TYPE_P (t2
)
282 || TREE_CODE (t2
) == VECTOR_TYPE
283 || UNSCOPED_ENUM_P (t2
));
285 /* If one type is complex, form the common type of the non-complex
286 components, then make that complex. Use T1 or T2 if it is the
288 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
290 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
291 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
293 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
295 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
296 return build_type_attribute_variant (t1
, attributes
);
297 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
298 return build_type_attribute_variant (t2
, attributes
);
300 return build_type_attribute_variant (build_complex_type (subtype
),
304 if (code1
== VECTOR_TYPE
)
306 /* When we get here we should have two vectors of the same size.
307 Just prefer the unsigned one if present. */
308 if (TYPE_UNSIGNED (t1
))
309 return build_type_attribute_variant (t1
, attributes
);
311 return build_type_attribute_variant (t2
, attributes
);
314 /* If only one is real, use it as the result. */
315 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
316 return build_type_attribute_variant (t1
, attributes
);
317 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
318 return build_type_attribute_variant (t2
, attributes
);
320 /* Both real or both integers; use the one with greater precision. */
321 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
322 return build_type_attribute_variant (t1
, attributes
);
323 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
324 return build_type_attribute_variant (t2
, attributes
);
326 /* The types are the same; no need to do anything fancy. */
327 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
328 return build_type_attribute_variant (t1
, attributes
);
330 if (code1
!= REAL_TYPE
)
332 /* If one is unsigned long long, then convert the other to unsigned
334 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
335 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
336 return build_type_attribute_variant (long_long_unsigned_type_node
,
338 /* If one is a long long, and the other is an unsigned long, and
339 long long can represent all the values of an unsigned long, then
340 convert to a long long. Otherwise, convert to an unsigned long
341 long. Otherwise, if either operand is long long, convert the
344 Since we're here, we know the TYPE_PRECISION is the same;
345 therefore converting to long long cannot represent all the values
346 of an unsigned long, so we choose unsigned long long in that
348 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
349 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
351 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
352 ? long_long_unsigned_type_node
353 : long_long_integer_type_node
);
354 return build_type_attribute_variant (t
, attributes
);
357 /* Go through the same procedure, but for longs. */
358 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
359 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
360 return build_type_attribute_variant (long_unsigned_type_node
,
362 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
363 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
365 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
366 ? long_unsigned_type_node
: long_integer_type_node
);
367 return build_type_attribute_variant (t
, attributes
);
369 /* Otherwise prefer the unsigned one. */
370 if (TYPE_UNSIGNED (t1
))
371 return build_type_attribute_variant (t1
, attributes
);
373 return build_type_attribute_variant (t2
, attributes
);
377 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
378 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
379 return build_type_attribute_variant (long_double_type_node
,
381 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
382 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
383 return build_type_attribute_variant (double_type_node
,
385 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
386 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
387 return build_type_attribute_variant (float_type_node
,
390 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
391 the standard C++ floating-point types. Logic earlier in this
392 function has already eliminated the possibility that
393 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
394 compelling reason to choose one or the other. */
395 return build_type_attribute_variant (t1
, attributes
);
399 /* T1 and T2 are arithmetic or enumeration types. Return the type
400 that will result from the "usual arithmetic conversions" on T1 and
401 T2 as described in [expr]. */
404 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
406 gcc_assert (ARITHMETIC_TYPE_P (t1
)
407 || TREE_CODE (t1
) == VECTOR_TYPE
408 || UNSCOPED_ENUM_P (t1
));
409 gcc_assert (ARITHMETIC_TYPE_P (t2
)
410 || TREE_CODE (t2
) == VECTOR_TYPE
411 || UNSCOPED_ENUM_P (t2
));
413 /* Perform the integral promotions. We do not promote real types here. */
414 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
415 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
417 t1
= type_promotes_to (t1
);
418 t2
= type_promotes_to (t2
);
421 return cp_common_type (t1
, t2
);
424 /* Subroutine of composite_pointer_type to implement the recursive
425 case. See that function for documentation of the parameters. */
428 composite_pointer_type_r (tree t1
, tree t2
,
429 composite_pointer_operation operation
,
430 tsubst_flags_t complain
)
437 /* Determine the types pointed to by T1 and T2. */
438 if (TREE_CODE (t1
) == POINTER_TYPE
)
440 pointee1
= TREE_TYPE (t1
);
441 pointee2
= TREE_TYPE (t2
);
445 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
446 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
451 Otherwise, the composite pointer type is a pointer type
452 similar (_conv.qual_) to the type of one of the operands,
453 with a cv-qualification signature (_conv.qual_) that is the
454 union of the cv-qualification signatures of the operand
456 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
457 result_type
= pointee1
;
458 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
459 && TREE_CODE (pointee2
) == POINTER_TYPE
)
460 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
461 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
462 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
466 if (complain
& tf_error
)
471 permerror (input_location
, "comparison between "
472 "distinct pointer types %qT and %qT lacks a cast",
476 permerror (input_location
, "conversion between "
477 "distinct pointer types %qT and %qT lacks a cast",
480 case CPO_CONDITIONAL_EXPR
:
481 permerror (input_location
, "conditional expression between "
482 "distinct pointer types %qT and %qT lacks a cast",
489 result_type
= void_type_node
;
491 result_type
= cp_build_qualified_type (result_type
,
492 (cp_type_quals (pointee1
)
493 | cp_type_quals (pointee2
)));
494 /* If the original types were pointers to members, so is the
496 if (TYPE_PTR_TO_MEMBER_P (t1
))
498 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
499 TYPE_PTRMEM_CLASS_TYPE (t2
))
500 && (complain
& tf_error
))
505 permerror (input_location
, "comparison between "
506 "distinct pointer types %qT and %qT lacks a cast",
510 permerror (input_location
, "conversion between "
511 "distinct pointer types %qT and %qT lacks a cast",
514 case CPO_CONDITIONAL_EXPR
:
515 permerror (input_location
, "conditional expression between "
516 "distinct pointer types %qT and %qT lacks a cast",
523 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
527 result_type
= build_pointer_type (result_type
);
529 /* Merge the attributes. */
530 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
531 return build_type_attribute_variant (result_type
, attributes
);
534 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
535 ARG1 and ARG2 are the values with those types. The OPERATION is to
536 describe the operation between the pointer types,
537 in case an error occurs.
539 This routine also implements the computation of a common type for
540 pointers-to-members as per [expr.eq]. */
543 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
544 composite_pointer_operation operation
,
545 tsubst_flags_t complain
)
552 If one operand is a null pointer constant, the composite pointer
553 type is the type of the other operand. */
554 if (null_ptr_cst_p (arg1
))
556 if (null_ptr_cst_p (arg2
))
563 If one of the operands has type "pointer to cv1 void*", then
564 the other has type "pointer to cv2T", and the composite pointer
565 type is "pointer to cv12 void", where cv12 is the union of cv1
568 If either type is a pointer to void, make sure it is T1. */
569 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
577 /* Now, if T1 is a pointer to void, merge the qualifiers. */
578 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
583 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
588 pedwarn (input_location
, OPT_pedantic
,
589 "ISO C++ forbids comparison between "
590 "pointer of type %<void *%> and pointer-to-function");
593 pedwarn (input_location
, OPT_pedantic
,
594 "ISO C++ forbids conversion between "
595 "pointer of type %<void *%> and pointer-to-function");
597 case CPO_CONDITIONAL_EXPR
:
598 pedwarn (input_location
, OPT_pedantic
,
599 "ISO C++ forbids conditional expression between "
600 "pointer of type %<void *%> and pointer-to-function");
607 = cp_build_qualified_type (void_type_node
,
608 (cp_type_quals (TREE_TYPE (t1
))
609 | cp_type_quals (TREE_TYPE (t2
))));
610 result_type
= build_pointer_type (result_type
);
611 /* Merge the attributes. */
612 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
613 return build_type_attribute_variant (result_type
, attributes
);
616 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
617 && TREE_CODE (t2
) == POINTER_TYPE
)
619 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
623 /* [expr.eq] permits the application of a pointer conversion to
624 bring the pointers to a common type. */
625 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
626 && CLASS_TYPE_P (TREE_TYPE (t1
))
627 && CLASS_TYPE_P (TREE_TYPE (t2
))
628 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
631 class1
= TREE_TYPE (t1
);
632 class2
= TREE_TYPE (t2
);
634 if (DERIVED_FROM_P (class1
, class2
))
635 t2
= (build_pointer_type
636 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
637 else if (DERIVED_FROM_P (class2
, class1
))
638 t1
= (build_pointer_type
639 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
642 if (complain
& tf_error
)
646 error ("comparison between distinct "
647 "pointer types %qT and %qT lacks a cast", t1
, t2
);
650 error ("conversion between distinct "
651 "pointer types %qT and %qT lacks a cast", t1
, t2
);
653 case CPO_CONDITIONAL_EXPR
:
654 error ("conditional expression between distinct "
655 "pointer types %qT and %qT lacks a cast", t1
, t2
);
660 return error_mark_node
;
663 /* [expr.eq] permits the application of a pointer-to-member
664 conversion to change the class type of one of the types. */
665 else if (TYPE_PTR_TO_MEMBER_P (t1
)
666 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
667 TYPE_PTRMEM_CLASS_TYPE (t2
)))
669 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
670 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
672 if (DERIVED_FROM_P (class1
, class2
))
673 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
674 else if (DERIVED_FROM_P (class2
, class1
))
675 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
678 if (complain
& tf_error
)
682 error ("comparison between distinct "
683 "pointer-to-member types %qT and %qT lacks a cast",
687 error ("conversion between distinct "
688 "pointer-to-member types %qT and %qT lacks a cast",
691 case CPO_CONDITIONAL_EXPR
:
692 error ("conditional expression between distinct "
693 "pointer-to-member types %qT and %qT lacks a cast",
699 return error_mark_node
;
703 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
706 /* Return the merged type of two types.
707 We assume that comptypes has already been done and returned 1;
708 if that isn't so, this may crash.
710 This just combines attributes and default arguments; any other
711 differences would cause the two types to compare unalike. */
714 merge_types (tree t1
, tree t2
)
716 enum tree_code code1
;
717 enum tree_code code2
;
720 /* Save time if the two types are the same. */
723 if (original_type (t1
) == original_type (t2
))
726 /* If one type is nonsense, use the other. */
727 if (t1
== error_mark_node
)
729 if (t2
== error_mark_node
)
732 /* Merge the attributes. */
733 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
735 if (TYPE_PTRMEMFUNC_P (t1
))
736 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
737 if (TYPE_PTRMEMFUNC_P (t2
))
738 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
740 code1
= TREE_CODE (t1
);
741 code2
= TREE_CODE (t2
);
744 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
745 if (code1
== TYPENAME_TYPE
)
747 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
748 code1
= TREE_CODE (t1
);
752 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
753 code2
= TREE_CODE (t2
);
761 /* For two pointers, do this recursively on the target type. */
763 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
764 int quals
= cp_type_quals (t1
);
766 if (code1
== POINTER_TYPE
)
767 t1
= build_pointer_type (target
);
769 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
770 t1
= build_type_attribute_variant (t1
, attributes
);
771 t1
= cp_build_qualified_type (t1
, quals
);
773 if (TREE_CODE (target
) == METHOD_TYPE
)
774 t1
= build_ptrmemfunc_type (t1
);
783 quals
= cp_type_quals (t1
);
784 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
785 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
786 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
788 t1
= cp_build_qualified_type (t1
, quals
);
794 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
795 /* Save space: see if the result is identical to one of the args. */
796 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
797 return build_type_attribute_variant (t1
, attributes
);
798 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
799 return build_type_attribute_variant (t2
, attributes
);
800 /* Merge the element types, and have a size if either arg has one. */
801 t1
= build_cplus_array_type
802 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
807 /* Function types: prefer the one that specified arg types.
808 If both do, merge the arg types. Also merge the return types. */
810 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
811 tree p1
= TYPE_ARG_TYPES (t1
);
812 tree p2
= TYPE_ARG_TYPES (t2
);
816 /* Save space: see if the result is identical to one of the args. */
817 if (valtype
== TREE_TYPE (t1
) && ! p2
)
818 return cp_build_type_attribute_variant (t1
, attributes
);
819 if (valtype
== TREE_TYPE (t2
) && ! p1
)
820 return cp_build_type_attribute_variant (t2
, attributes
);
822 /* Simple way if one arg fails to specify argument types. */
823 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
826 raises
= TYPE_RAISES_EXCEPTIONS (t2
);
828 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
831 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
835 parms
= commonparms (p1
, p2
);
836 /* In cases where we're merging a real declaration with a
837 built-in declaration, t1 is the real one. */
838 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
841 rval
= build_function_type (valtype
, parms
);
842 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
843 rval
= apply_memfn_quals (rval
, type_memfn_quals (t1
));
844 t1
= build_exception_variant (rval
, raises
);
850 /* Get this value the long way, since TYPE_METHOD_BASETYPE
851 is just the main variant of this. */
852 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
853 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
856 /* If this was a member function type, get back to the
857 original type of type member function (i.e., without
858 the class instance variable up front. */
859 t1
= build_function_type (TREE_TYPE (t1
),
860 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
861 t2
= build_function_type (TREE_TYPE (t2
),
862 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
863 t3
= merge_types (t1
, t2
);
864 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
865 TYPE_ARG_TYPES (t3
));
866 t1
= build_exception_variant (t3
, raises
);
871 /* There is no need to merge attributes into a TYPENAME_TYPE.
872 When the type is instantiated it will have whatever
873 attributes result from the instantiation. */
879 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
881 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
884 return cp_build_type_attribute_variant (t1
, attributes
);
887 /* Return the ARRAY_TYPE type without its domain. */
890 strip_array_domain (tree type
)
893 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
894 if (TYPE_DOMAIN (type
) == NULL_TREE
)
896 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
897 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
900 /* Wrapper around cp_common_type that is used by c-common.c and other
901 front end optimizations that remove promotions.
903 Return the common type for two arithmetic types T1 and T2 under the
904 usual arithmetic conversions. The default conversions have already
905 been applied, and enumerated types converted to their compatible
909 common_type (tree t1
, tree t2
)
911 /* If one type is nonsense, use the other */
912 if (t1
== error_mark_node
)
914 if (t2
== error_mark_node
)
917 return cp_common_type (t1
, t2
);
920 /* Return the common type of two pointer types T1 and T2. This is the
921 type for the result of most arithmetic operations if the operands
922 have the given two types.
924 We assume that comp_target_types has already been done and returned
925 nonzero; if that isn't so, this may crash. */
928 common_pointer_type (tree t1
, tree t2
)
930 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
931 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
932 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
934 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
935 CPO_CONVERSION
, tf_warning_or_error
);
938 /* Compare two exception specifier types for exactness or subsetness, if
939 allowed. Returns false for mismatch, true for match (same, or
942 [except.spec] "If a class X ... objects of class X or any class publicly
943 and unambiguously derived from X. Similarly, if a pointer type Y * ...
944 exceptions of type Y * or that are pointers to any type publicly and
945 unambiguously derived from Y. Otherwise a function only allows exceptions
946 that have the same type ..."
947 This does not mention cv qualifiers and is different to what throw
948 [except.throw] and catch [except.catch] will do. They will ignore the
949 top level cv qualifiers, and allow qualifiers in the pointer to class
952 We implement the letter of the standard. */
955 comp_except_types (tree a
, tree b
, bool exact
)
957 if (same_type_p (a
, b
))
961 if (cp_type_quals (a
) || cp_type_quals (b
))
964 if (TREE_CODE (a
) == POINTER_TYPE
965 && TREE_CODE (b
) == POINTER_TYPE
)
969 if (cp_type_quals (a
) || cp_type_quals (b
))
973 if (TREE_CODE (a
) != RECORD_TYPE
974 || TREE_CODE (b
) != RECORD_TYPE
)
977 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
983 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
984 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
985 otherwise it must be exact. Exception lists are unordered, but
986 we've already filtered out duplicates. Most lists will be in order,
987 we should try to make use of that. */
990 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
999 if (t1
== NULL_TREE
) /* T1 is ... */
1000 return t2
== NULL_TREE
|| !exact
;
1001 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1002 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1003 if (t2
== NULL_TREE
) /* T2 is ... */
1005 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1008 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1009 Count how many we find, to determine exactness. For exact matching and
1010 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1012 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1014 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1016 tree a
= TREE_VALUE (probe
);
1017 tree b
= TREE_VALUE (t2
);
1019 if (comp_except_types (a
, b
, exact
))
1021 if (probe
== base
&& exact
)
1022 base
= TREE_CHAIN (probe
);
1027 if (probe
== NULL_TREE
)
1030 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1033 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1034 [] can match [size]. */
1037 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1046 /* The type of the array elements must be the same. */
1047 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1050 d1
= TYPE_DOMAIN (t1
);
1051 d2
= TYPE_DOMAIN (t2
);
1056 /* If one of the arrays is dimensionless, and the other has a
1057 dimension, they are of different types. However, it is valid to
1065 declarations for an array object can specify
1066 array types that differ by the presence or absence of a major
1067 array bound (_dcl.array_). */
1069 return allow_redeclaration
;
1071 /* Check that the dimensions are the same. */
1073 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1075 max1
= TYPE_MAX_VALUE (d1
);
1076 max2
= TYPE_MAX_VALUE (d2
);
1077 if (processing_template_decl
&& !abi_version_at_least (2)
1078 && !value_dependent_expression_p (max1
)
1079 && !value_dependent_expression_p (max2
))
1081 /* With abi-1 we do not fold non-dependent array bounds, (and
1082 consequently mangle them incorrectly). We must therefore
1083 fold them here, to verify the domains have the same
1089 if (!cp_tree_equal (max1
, max2
))
1095 /* Compare the relative position of T1 and T2 into their respective
1096 template parameter list.
1097 T1 and T2 must be template parameter types.
1098 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1101 comp_template_parms_position (tree t1
, tree t2
)
1103 gcc_assert (t1
&& t2
1104 && TREE_CODE (t1
) == TREE_CODE (t2
)
1105 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1106 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1107 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1109 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1110 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1111 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1112 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1118 /* Subroutine of incompatible_dependent_types_p.
1119 Return the template parameter of the dependent type T.
1120 If T is a typedef, return the template parameters of
1121 the _decl_ of the typedef. T must be a dependent type. */
1124 get_template_parms_of_dependent_type (tree t
)
1126 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1128 /* First, try the obvious case of getting the
1129 template info from T itself. */
1130 if ((tinfo
= get_template_info (t
)))
1132 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1133 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1134 else if (typedef_variant_p (t
)
1135 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1136 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1137 /* If T is a TYPENAME_TYPE which context is a template type
1138 parameter, get the template parameters from that context. */
1139 else if (TYPE_CONTEXT (t
)
1140 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1141 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1142 else if (TYPE_CONTEXT (t
)
1143 && !NAMESPACE_SCOPE_P (t
))
1144 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1147 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1152 /* Subroutine of structural_comptypes.
1153 Compare the dependent types T1 and T2.
1154 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1155 The whole point of this function is to support cases where either T1 or
1156 T2 is a typedef. In those cases, we need to compare the template parameters
1157 of the _decl_ of the typedef. If those don't match then we know T1
1158 and T2 cannot be equal. */
1161 incompatible_dependent_types_p (tree t1
, tree t2
)
1163 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1164 bool t1_typedef_variant_p
, t2_typedef_variant_p
;
1166 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1169 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1171 /* If T1 and T2 don't have the same relative position in their
1172 template parameters set, they can't be equal. */
1173 if (!comp_template_parms_position (t1
, t2
))
1177 t1_typedef_variant_p
= typedef_variant_p (t1
);
1178 t2_typedef_variant_p
= typedef_variant_p (t2
);
1180 /* Either T1 or T2 must be a typedef. */
1181 if (!t1_typedef_variant_p
&& !t2_typedef_variant_p
)
1184 if (!t1_typedef_variant_p
|| !t2_typedef_variant_p
)
1185 /* Either T1 or T2 is not a typedef so we cannot compare the
1186 the template parms of the typedefs of T1 and T2.
1187 At this point, if the main variant type of T1 and T2 are equal
1188 it means the two types can't be incompatible, from the perspective
1189 of this function. */
1190 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1193 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1194 Let's compare their template parameters. */
1196 tparms1
= get_template_parms_of_dependent_type (t1
);
1197 tparms2
= get_template_parms_of_dependent_type (t2
);
1199 /* If T2 is a template type parm and if we could not get the template
1200 parms it belongs to, that means we have not finished parsing the
1201 full set of template parameters of the template declaration it
1202 belongs to yet. If we could get the template parms T1 belongs to,
1203 that mostly means T1 and T2 belongs to templates that are
1204 different and incompatible. */
1205 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1206 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1207 && tparms1
!= tparms2
)
1210 if (tparms1
== NULL_TREE
1211 || tparms2
== NULL_TREE
1212 || tparms1
== tparms2
)
1215 /* And now compare the mighty template parms! */
1216 return !comp_template_parms (tparms1
, tparms2
);
1219 /* Subroutine in comptypes. */
1222 structural_comptypes (tree t1
, tree t2
, int strict
)
1227 /* Suppress errors caused by previously reported errors. */
1228 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1231 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1233 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1234 current instantiation. */
1235 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1236 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1238 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1239 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1241 if (TYPE_PTRMEMFUNC_P (t1
))
1242 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1243 if (TYPE_PTRMEMFUNC_P (t2
))
1244 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1246 /* Different classes of types can't be compatible. */
1247 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1250 /* Qualifiers must match. For array types, we will check when we
1251 recur on the array element types. */
1252 if (TREE_CODE (t1
) != ARRAY_TYPE
1253 && cp_type_quals (t1
) != cp_type_quals (t2
))
1255 if (TREE_CODE (t1
) == FUNCTION_TYPE
1256 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1258 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1261 /* If T1 and T2 are dependent typedefs then check upfront that
1262 the template parameters of their typedef DECLs match before
1263 going down checking their subtypes. */
1264 if (incompatible_dependent_types_p (t1
, t2
))
1267 /* Allow for two different type nodes which have essentially the same
1268 definition. Note that we already checked for equality of the type
1269 qualifiers (just above). */
1271 if (TREE_CODE (t1
) != ARRAY_TYPE
1272 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1276 /* Compare the types. Break out if they could be the same. */
1277 switch (TREE_CODE (t1
))
1281 /* All void and bool types are the same. */
1285 case FIXED_POINT_TYPE
:
1287 /* With these nodes, we can't determine type equivalence by
1288 looking at what is stored in the nodes themselves, because
1289 two nodes might have different TYPE_MAIN_VARIANTs but still
1290 represent the same type. For example, wchar_t and int could
1291 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1292 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1293 and are distinct types. On the other hand, int and the
1296 typedef int INT __attribute((may_alias));
1298 have identical properties, different TYPE_MAIN_VARIANTs, but
1299 represent the same type. The canonical type system keeps
1300 track of equivalence in this case, so we fall back on it. */
1301 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1303 case TEMPLATE_TEMPLATE_PARM
:
1304 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1305 if (!comp_template_parms_position (t1
, t2
))
1307 if (!comp_template_parms
1308 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1309 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1311 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1313 /* Don't check inheritance. */
1314 strict
= COMPARE_STRICT
;
1319 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1320 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1321 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1322 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1325 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1327 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1333 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1334 strict
& ~COMPARE_REDECLARATION
))
1336 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1340 case REFERENCE_TYPE
:
1341 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1343 /* fall through to checks for pointer types */
1346 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1347 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1348 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1354 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1356 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1361 /* Target types must match incl. qualifiers. */
1362 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1366 case TEMPLATE_TYPE_PARM
:
1367 /* If incompatible_dependent_types_p called earlier didn't decide
1368 T1 and T2 were different, they might be equal. */
1372 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1373 TYPENAME_TYPE_FULLNAME (t2
)))
1375 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1379 case UNBOUND_CLASS_TEMPLATE
:
1380 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1382 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1387 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1392 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1393 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1397 case TYPE_PACK_EXPANSION
:
1398 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1399 PACK_EXPANSION_PATTERN (t2
));
1402 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1403 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1404 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1405 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1406 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1407 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1408 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1409 DECLTYPE_TYPE_EXPR (t2
)))
1417 /* If we get here, we know that from a target independent POV the
1418 types are the same. Make sure the target attributes are also
1420 return targetm
.comp_type_attributes (t1
, t2
);
1423 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1424 is a bitwise-or of the COMPARE_* flags. */
1427 comptypes (tree t1
, tree t2
, int strict
)
1429 if (strict
== COMPARE_STRICT
)
1434 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1437 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1438 /* At least one of the types requires structural equality, so
1439 perform a deep check. */
1440 return structural_comptypes (t1
, t2
, strict
);
1442 #ifdef ENABLE_CHECKING
1443 if (USE_CANONICAL_TYPES
)
1445 bool result
= structural_comptypes (t1
, t2
, strict
);
1447 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1448 /* The two types are structurally equivalent, but their
1449 canonical types were different. This is a failure of the
1450 canonical type propagation code.*/
1452 ("canonical types differ for identical types %T and %T",
1454 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1455 /* Two types are structurally different, but the canonical
1456 types are the same. This means we were over-eager in
1457 assigning canonical types. */
1459 ("same canonical type node for different types %T and %T",
1465 if (USE_CANONICAL_TYPES
)
1466 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1469 return structural_comptypes (t1
, t2
, strict
);
1471 else if (strict
== COMPARE_STRUCTURAL
)
1472 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1474 return structural_comptypes (t1
, t2
, strict
);
1477 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1480 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1482 int q1
= cp_type_quals (type1
);
1483 int q2
= cp_type_quals (type2
);
1485 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1486 return (q1
& q2
) == q2
;
1489 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1490 more cv-qualified that TYPE1, and 0 otherwise. */
1493 comp_cv_qualification (const_tree type1
, const_tree type2
)
1495 int q1
= cp_type_quals (type1
);
1496 int q2
= cp_type_quals (type2
);
1501 if ((q1
& q2
) == q2
)
1503 else if ((q1
& q2
) == q1
)
1509 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1510 subset of the cv-qualification signature of TYPE2, and the types
1511 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1514 comp_cv_qual_signature (tree type1
, tree type2
)
1516 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1518 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1524 /* Subroutines of `comptypes'. */
1526 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1527 equivalent in the sense that functions with those parameter types
1528 can have equivalent types. The two lists must be equivalent,
1529 element by element. */
1532 compparms (const_tree parms1
, const_tree parms2
)
1536 /* An unspecified parmlist matches any specified parmlist
1537 whose argument types don't need default promotions. */
1539 for (t1
= parms1
, t2
= parms2
;
1541 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1543 /* If one parmlist is shorter than the other,
1544 they fail to match. */
1547 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1554 /* Process a sizeof or alignof expression where the operand is a
1558 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1563 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1564 if (type
== error_mark_node
)
1565 return error_mark_node
;
1567 type
= non_reference (type
);
1568 if (TREE_CODE (type
) == METHOD_TYPE
)
1571 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1572 "invalid application of %qs to a member function",
1573 operator_name_info
[(int) op
].name
);
1574 value
= size_one_node
;
1577 dependent_p
= dependent_type_p (type
);
1579 complete_type (type
);
1581 /* VLA types will have a non-constant size. In the body of an
1582 uninstantiated template, we don't need to try to compute the
1583 value, because the sizeof expression is not an integral
1584 constant expression in that case. And, if we do try to
1585 compute the value, we'll likely end up with SAVE_EXPRs, which
1586 the template substitution machinery does not expect to see. */
1587 || (processing_template_decl
1588 && COMPLETE_TYPE_P (type
)
1589 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1591 value
= build_min (op
, size_type_node
, type
);
1592 TREE_READONLY (value
) = 1;
1596 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1601 /* Return the size of the type, without producing any warnings for
1602 types whose size cannot be taken. This routine should be used only
1603 in some other routine that has already produced a diagnostic about
1604 using the size of such a type. */
1606 cxx_sizeof_nowarn (tree type
)
1608 if (TREE_CODE (type
) == FUNCTION_TYPE
1609 || TREE_CODE (type
) == VOID_TYPE
1610 || TREE_CODE (type
) == ERROR_MARK
)
1611 return size_one_node
;
1612 else if (!COMPLETE_TYPE_P (type
))
1613 return size_zero_node
;
1615 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1618 /* Process a sizeof expression where the operand is an expression. */
1621 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1623 if (e
== error_mark_node
)
1624 return error_mark_node
;
1626 if (processing_template_decl
)
1628 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1629 TREE_SIDE_EFFECTS (e
) = 0;
1630 TREE_READONLY (e
) = 1;
1635 /* To get the size of a static data member declared as an array of
1636 unknown bound, we need to instantiate it. */
1637 if (TREE_CODE (e
) == VAR_DECL
1638 && VAR_HAD_UNKNOWN_BOUND (e
)
1639 && DECL_TEMPLATE_INSTANTIATION (e
))
1640 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1642 e
= mark_type_use (e
);
1644 if (TREE_CODE (e
) == COMPONENT_REF
1645 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1646 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1648 if (complain
& tf_error
)
1649 error ("invalid application of %<sizeof%> to a bit-field");
1651 return error_mark_node
;
1654 else if (is_overloaded_fn (e
))
1656 if (complain
& tf_error
)
1657 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1660 return error_mark_node
;
1663 else if (type_unknown_p (e
))
1665 if (complain
& tf_error
)
1666 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1668 return error_mark_node
;
1674 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1677 /* Implement the __alignof keyword: Return the minimum required
1678 alignment of E, measured in bytes. For VAR_DECL's and
1679 FIELD_DECL's return DECL_ALIGN (which can be set from an
1680 "aligned" __attribute__ specification). */
1683 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1687 if (e
== error_mark_node
)
1688 return error_mark_node
;
1690 if (processing_template_decl
)
1692 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1693 TREE_SIDE_EFFECTS (e
) = 0;
1694 TREE_READONLY (e
) = 1;
1699 e
= mark_type_use (e
);
1701 if (TREE_CODE (e
) == VAR_DECL
)
1702 t
= size_int (DECL_ALIGN_UNIT (e
));
1703 else if (TREE_CODE (e
) == COMPONENT_REF
1704 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1705 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1707 if (complain
& tf_error
)
1708 error ("invalid application of %<__alignof%> to a bit-field");
1710 return error_mark_node
;
1713 else if (TREE_CODE (e
) == COMPONENT_REF
1714 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1715 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1716 else if (is_overloaded_fn (e
))
1718 if (complain
& tf_error
)
1719 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1722 return error_mark_node
;
1723 if (TREE_CODE (e
) == FUNCTION_DECL
)
1724 t
= size_int (DECL_ALIGN_UNIT (e
));
1728 else if (type_unknown_p (e
))
1730 if (complain
& tf_error
)
1731 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1733 return error_mark_node
;
1737 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1738 complain
& tf_error
);
1740 return fold_convert (size_type_node
, t
);
1743 /* Process a sizeof or alignof expression E with code OP where the operand
1744 is an expression. */
1747 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1749 if (op
== SIZEOF_EXPR
)
1750 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1752 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1755 /* EXPR is being used in a context that is not a function call.
1760 The expression can be used only as the left-hand operand of a
1761 member function call.
1763 [expr.mptr.operator]
1765 If the result of .* or ->* is a function, then that result can be
1766 used only as the operand for the function call operator ().
1768 by issuing an error message if appropriate. Returns true iff EXPR
1769 violates these rules. */
1772 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1774 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1776 if (complain
& tf_error
)
1777 error ("invalid use of non-static member function");
1783 /* If EXP is a reference to a bitfield, and the type of EXP does not
1784 match the declared type of the bitfield, return the declared type
1785 of the bitfield. Otherwise, return NULL_TREE. */
1788 is_bitfield_expr_with_lowered_type (const_tree exp
)
1790 switch (TREE_CODE (exp
))
1793 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1794 ? TREE_OPERAND (exp
, 1)
1795 : TREE_OPERAND (exp
, 0)))
1797 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1800 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1804 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1810 field
= TREE_OPERAND (exp
, 1);
1811 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1813 if (same_type_ignoring_top_level_qualifiers_p
1814 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1816 return DECL_BIT_FIELD_TYPE (field
);
1820 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1821 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1822 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1830 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1831 bitfield with a lowered type, the type of EXP is returned, rather
1835 unlowered_expr_type (const_tree exp
)
1839 type
= is_bitfield_expr_with_lowered_type (exp
);
1841 type
= TREE_TYPE (exp
);
1846 /* Perform the conversions in [expr] that apply when an lvalue appears
1847 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1848 function-to-pointer conversions. In addition, manifest constants
1849 are replaced by their values, and bitfield references are converted
1850 to their declared types. Note that this function does not perform the
1851 lvalue-to-rvalue conversion for class types. If you need that conversion
1852 to for class types, then you probably need to use force_rvalue.
1854 Although the returned value is being used as an rvalue, this
1855 function does not wrap the returned expression in a
1856 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1857 that the return value is no longer an lvalue. */
1860 decay_conversion (tree exp
)
1863 enum tree_code code
;
1865 type
= TREE_TYPE (exp
);
1866 if (type
== error_mark_node
)
1867 return error_mark_node
;
1869 exp
= mark_rvalue_use (exp
);
1871 exp
= resolve_nondeduced_context (exp
);
1872 if (type_unknown_p (exp
))
1874 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1875 return error_mark_node
;
1878 exp
= decl_constant_value (exp
);
1879 if (error_operand_p (exp
))
1880 return error_mark_node
;
1882 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1883 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1884 code
= TREE_CODE (type
);
1885 if (code
== VOID_TYPE
)
1887 error ("void value not ignored as it ought to be");
1888 return error_mark_node
;
1890 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1891 return error_mark_node
;
1892 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1893 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1894 if (code
== ARRAY_TYPE
)
1899 if (TREE_CODE (exp
) == INDIRECT_REF
)
1900 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1901 TREE_OPERAND (exp
, 0));
1903 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1905 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1906 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1907 TREE_OPERAND (exp
, 0), op1
);
1911 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1913 error ("invalid use of non-lvalue array");
1914 return error_mark_node
;
1917 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1919 if (TREE_CODE (exp
) == VAR_DECL
)
1921 if (!cxx_mark_addressable (exp
))
1922 return error_mark_node
;
1923 adr
= build_nop (ptrtype
, build_address (exp
));
1926 /* This way is better for a COMPONENT_REF since it can
1927 simplify the offset for a component. */
1928 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1929 return cp_convert (ptrtype
, adr
);
1932 /* If a bitfield is used in a context where integral promotion
1933 applies, then the caller is expected to have used
1934 default_conversion. That function promotes bitfields correctly
1935 before calling this function. At this point, if we have a
1936 bitfield referenced, we may assume that is not subject to
1937 promotion, and that, therefore, the type of the resulting rvalue
1938 is the declared type of the bitfield. */
1939 exp
= convert_bitfield_to_declared_type (exp
);
1941 /* We do not call rvalue() here because we do not want to wrap EXP
1942 in a NON_LVALUE_EXPR. */
1946 Non-class rvalues always have cv-unqualified types. */
1947 type
= TREE_TYPE (exp
);
1948 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1949 exp
= build_nop (cv_unqualified (type
), exp
);
1954 /* Perform preparatory conversions, as part of the "usual arithmetic
1955 conversions". In particular, as per [expr]:
1957 Whenever an lvalue expression appears as an operand of an
1958 operator that expects the rvalue for that operand, the
1959 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1960 standard conversions are applied to convert the expression to an
1963 In addition, we perform integral promotions here, as those are
1964 applied to both operands to a binary operator before determining
1965 what additional conversions should apply. */
1968 default_conversion (tree exp
)
1970 /* Check for target-specific promotions. */
1971 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1973 exp
= cp_convert (promoted_type
, exp
);
1974 /* Perform the integral promotions first so that bitfield
1975 expressions (which may promote to "int", even if the bitfield is
1976 declared "unsigned") are promoted correctly. */
1977 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1978 exp
= perform_integral_promotions (exp
);
1979 /* Perform the other conversions. */
1980 exp
= decay_conversion (exp
);
1985 /* EXPR is an expression with an integral or enumeration type.
1986 Perform the integral promotions in [conv.prom], and return the
1990 perform_integral_promotions (tree expr
)
1995 expr
= mark_rvalue_use (expr
);
1999 If the bitfield has an enumerated type, it is treated as any
2000 other value of that type for promotion purposes. */
2001 type
= is_bitfield_expr_with_lowered_type (expr
);
2002 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2003 type
= TREE_TYPE (expr
);
2004 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2005 promoted_type
= type_promotes_to (type
);
2006 if (type
!= promoted_type
)
2007 expr
= cp_convert (promoted_type
, expr
);
2011 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2012 decay_conversion to one. */
2015 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2019 if (TREE_CODE (totype
) != POINTER_TYPE
)
2022 t
= TREE_TYPE (totype
);
2023 if (!same_type_p (t
, char_type_node
)
2024 && !same_type_p (t
, char16_type_node
)
2025 && !same_type_p (t
, char32_type_node
)
2026 && !same_type_p (t
, wchar_type_node
))
2029 if (TREE_CODE (exp
) == STRING_CST
)
2031 /* Make sure that we don't try to convert between char and wide chars. */
2032 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2037 /* Is this a string constant which has decayed to 'const char *'? */
2038 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2039 if (!same_type_p (TREE_TYPE (exp
), t
))
2042 if (TREE_CODE (exp
) != ADDR_EXPR
2043 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2047 /* This warning is not very useful, as it complains about printf. */
2049 warning (OPT_Wwrite_strings
,
2050 "deprecated conversion from string constant to %qT",
2056 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2057 can, for example, use as an lvalue. This code used to be in
2058 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2059 expressions, where we're dealing with aggregates. But now it's again only
2060 called from unary_complex_lvalue. The case (in particular) that led to
2061 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2065 rationalize_conditional_expr (enum tree_code code
, tree t
,
2066 tsubst_flags_t complain
)
2068 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2069 the first operand is always the one to be used if both operands
2070 are equal, so we know what conditional expression this used to be. */
2071 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2073 tree op0
= TREE_OPERAND (t
, 0);
2074 tree op1
= TREE_OPERAND (t
, 1);
2076 /* The following code is incorrect if either operand side-effects. */
2077 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2078 && !TREE_SIDE_EFFECTS (op1
));
2080 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2081 ? LE_EXPR
: GE_EXPR
),
2082 op0
, TREE_CODE (op0
),
2083 op1
, TREE_CODE (op1
),
2084 /*overloaded_p=*/NULL
,
2086 cp_build_unary_op (code
, op0
, 0, complain
),
2087 cp_build_unary_op (code
, op1
, 0, complain
),
2092 build_conditional_expr (TREE_OPERAND (t
, 0),
2093 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2095 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2100 /* Given the TYPE of an anonymous union field inside T, return the
2101 FIELD_DECL for the field. If not found return NULL_TREE. Because
2102 anonymous unions can nest, we must also search all anonymous unions
2103 that are directly reachable. */
2106 lookup_anon_field (tree t
, tree type
)
2110 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2112 if (TREE_STATIC (field
))
2114 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2117 /* If we find it directly, return the field. */
2118 if (DECL_NAME (field
) == NULL_TREE
2119 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2124 /* Otherwise, it could be nested, search harder. */
2125 if (DECL_NAME (field
) == NULL_TREE
2126 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2128 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2136 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2137 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2138 non-NULL, it indicates the path to the base used to name MEMBER.
2139 If PRESERVE_REFERENCE is true, the expression returned will have
2140 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2141 returned will have the type referred to by the reference.
2143 This function does not perform access control; that is either done
2144 earlier by the parser when the name of MEMBER is resolved to MEMBER
2145 itself, or later when overload resolution selects one of the
2146 functions indicated by MEMBER. */
2149 build_class_member_access_expr (tree object
, tree member
,
2150 tree access_path
, bool preserve_reference
,
2151 tsubst_flags_t complain
)
2155 tree result
= NULL_TREE
;
2157 if (error_operand_p (object
) || error_operand_p (member
))
2158 return error_mark_node
;
2160 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2164 The type of the first expression shall be "class object" (of a
2166 object_type
= TREE_TYPE (object
);
2167 if (!currently_open_class (object_type
)
2168 && !complete_type_or_else (object_type
, object
))
2169 return error_mark_node
;
2170 if (!CLASS_TYPE_P (object_type
))
2172 if (complain
& tf_error
)
2173 error ("request for member %qD in %qE, which is of non-class type %qT",
2174 member
, object
, object_type
);
2175 return error_mark_node
;
2178 /* The standard does not seem to actually say that MEMBER must be a
2179 member of OBJECT_TYPE. However, that is clearly what is
2181 if (DECL_P (member
))
2183 member_scope
= DECL_CLASS_CONTEXT (member
);
2185 if (TREE_DEPRECATED (member
))
2186 warn_deprecated_use (member
, NULL_TREE
);
2189 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2190 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2191 presently be the anonymous union. Go outwards until we find a
2192 type related to OBJECT_TYPE. */
2193 while (ANON_AGGR_TYPE_P (member_scope
)
2194 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2196 member_scope
= TYPE_CONTEXT (member_scope
);
2197 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2199 if (complain
& tf_error
)
2201 if (TREE_CODE (member
) == FIELD_DECL
)
2202 error ("invalid use of nonstatic data member %qE", member
);
2204 error ("%qD is not a member of %qT", member
, object_type
);
2206 return error_mark_node
;
2209 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2210 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2211 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2213 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2215 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2218 /* In [expr.ref], there is an explicit list of the valid choices for
2219 MEMBER. We check for each of those cases here. */
2220 if (TREE_CODE (member
) == VAR_DECL
)
2222 /* A static data member. */
2224 /* If OBJECT has side-effects, they are supposed to occur. */
2225 if (TREE_SIDE_EFFECTS (object
))
2226 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2228 else if (TREE_CODE (member
) == FIELD_DECL
)
2230 /* A non-static data member. */
2235 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2236 && integer_zerop (TREE_OPERAND (object
, 0)));
2238 /* Convert OBJECT to the type of MEMBER. */
2239 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2240 TYPE_MAIN_VARIANT (member_scope
)))
2245 binfo
= lookup_base (access_path
? access_path
: object_type
,
2246 member_scope
, ba_unique
, &kind
);
2247 if (binfo
== error_mark_node
)
2248 return error_mark_node
;
2250 /* It is invalid to try to get to a virtual base of a
2251 NULL object. The most common cause is invalid use of
2253 if (null_object_p
&& kind
== bk_via_virtual
)
2255 if (complain
& tf_error
)
2257 error ("invalid access to non-static data member %qD of "
2260 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2262 return error_mark_node
;
2265 /* Convert to the base. */
2266 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2268 /* If we found the base successfully then we should be able
2269 to convert to it successfully. */
2270 gcc_assert (object
!= error_mark_node
);
2273 /* Complain about other invalid uses of offsetof, even though they will
2274 give the right answer. Note that we complain whether or not they
2275 actually used the offsetof macro, since there's no way to know at this
2276 point. So we just give a warning, instead of a pedwarn. */
2277 /* Do not produce this warning for base class field references, because
2278 we know for a fact that didn't come from offsetof. This does occur
2279 in various testsuite cases where a null object is passed where a
2280 vtable access is required. */
2281 if (null_object_p
&& warn_invalid_offsetof
2282 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2283 && !DECL_FIELD_IS_BASE (member
)
2284 && cp_unevaluated_operand
== 0
2285 && (complain
& tf_warning
))
2287 warning (OPT_Winvalid_offsetof
,
2288 "invalid access to non-static data member %qD "
2289 " of NULL object", member
);
2290 warning (OPT_Winvalid_offsetof
,
2291 "(perhaps the %<offsetof%> macro was used incorrectly)");
2294 /* If MEMBER is from an anonymous aggregate, we have converted
2295 OBJECT so that it refers to the class containing the
2296 anonymous union. Generate a reference to the anonymous union
2297 itself, and recur to find MEMBER. */
2298 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2299 /* When this code is called from build_field_call, the
2300 object already has the type of the anonymous union.
2301 That is because the COMPONENT_REF was already
2302 constructed, and was then disassembled before calling
2303 build_field_call. After the function-call code is
2304 cleaned up, this waste can be eliminated. */
2305 && (!same_type_ignoring_top_level_qualifiers_p
2306 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2308 tree anonymous_union
;
2310 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2311 DECL_CONTEXT (member
));
2312 object
= build_class_member_access_expr (object
,
2314 /*access_path=*/NULL_TREE
,
2319 /* Compute the type of the field, as described in [expr.ref]. */
2320 type_quals
= TYPE_UNQUALIFIED
;
2321 member_type
= TREE_TYPE (member
);
2322 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2324 type_quals
= (cp_type_quals (member_type
)
2325 | cp_type_quals (object_type
));
2327 /* A field is const (volatile) if the enclosing object, or the
2328 field itself, is const (volatile). But, a mutable field is
2329 not const, even within a const object. */
2330 if (DECL_MUTABLE_P (member
))
2331 type_quals
&= ~TYPE_QUAL_CONST
;
2332 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2335 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2337 result
= fold_if_not_in_template (result
);
2339 /* Mark the expression const or volatile, as appropriate. Even
2340 though we've dealt with the type above, we still have to mark the
2341 expression itself. */
2342 if (type_quals
& TYPE_QUAL_CONST
)
2343 TREE_READONLY (result
) = 1;
2344 if (type_quals
& TYPE_QUAL_VOLATILE
)
2345 TREE_THIS_VOLATILE (result
) = 1;
2347 else if (BASELINK_P (member
))
2349 /* The member is a (possibly overloaded) member function. */
2353 /* If the MEMBER is exactly one static member function, then we
2354 know the type of the expression. Otherwise, we must wait
2355 until overload resolution has been performed. */
2356 functions
= BASELINK_FUNCTIONS (member
);
2357 if (TREE_CODE (functions
) == FUNCTION_DECL
2358 && DECL_STATIC_FUNCTION_P (functions
))
2359 type
= TREE_TYPE (functions
);
2361 type
= unknown_type_node
;
2362 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2363 base. That will happen when the function is called. */
2364 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2366 else if (TREE_CODE (member
) == CONST_DECL
)
2368 /* The member is an enumerator. */
2370 /* If OBJECT has side-effects, they are supposed to occur. */
2371 if (TREE_SIDE_EFFECTS (object
))
2372 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2377 if (complain
& tf_error
)
2378 error ("invalid use of %qD", member
);
2379 return error_mark_node
;
2382 if (!preserve_reference
)
2385 If E2 is declared to have type "reference to T", then ... the
2386 type of E1.E2 is T. */
2387 result
= convert_from_reference (result
);
2392 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2393 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2396 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2398 tree object_type
= TREE_TYPE (object
);
2399 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2402 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2404 error ("qualified type %qT does not match destructor name ~%qT",
2406 return error_mark_node
;
2408 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2410 /* In a template, names we can't find a match for are still accepted
2411 destructor names, and we check them here. */
2412 if (check_dtor_name (object_type
, dtor_type
))
2413 dtor_type
= object_type
;
2416 error ("object type %qT does not match destructor name ~%qT",
2417 object_type
, dtor_type
);
2418 return error_mark_node
;
2422 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2424 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2425 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2426 return error_mark_node
;
2428 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2429 /*protect=*/1, /*want_type=*/false);
2430 expr
= (adjust_result_of_qualified_name_lookup
2431 (expr
, dtor_type
, object_type
));
2435 /* An expression of the form "A::template B" has been resolved to
2436 DECL. Issue a diagnostic if B is not a template or template
2440 check_template_keyword (tree decl
)
2442 /* The standard says:
2446 If a name prefixed by the keyword template is not a member
2447 template, the program is ill-formed.
2449 DR 228 removed the restriction that the template be a member
2452 DR 96, if accepted would add the further restriction that explicit
2453 template arguments must be provided if the template keyword is
2454 used, but, as of 2005-10-16, that DR is still in "drafting". If
2455 this DR is accepted, then the semantic checks here can be
2456 simplified, as the entity named must in fact be a template
2457 specialization, rather than, as at present, a set of overloaded
2458 functions containing at least one template function. */
2459 if (TREE_CODE (decl
) != TEMPLATE_DECL
2460 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2462 if (!is_overloaded_fn (decl
))
2463 permerror (input_location
, "%qD is not a template", decl
);
2468 if (BASELINK_P (fns
))
2469 fns
= BASELINK_FUNCTIONS (fns
);
2472 tree fn
= OVL_CURRENT (fns
);
2473 if (TREE_CODE (fn
) == TEMPLATE_DECL
2474 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2476 if (TREE_CODE (fn
) == FUNCTION_DECL
2477 && DECL_USE_TEMPLATE (fn
)
2478 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2480 fns
= OVL_NEXT (fns
);
2483 permerror (input_location
, "%qD is not a template", decl
);
2488 /* This function is called by the parser to process a class member
2489 access expression of the form OBJECT.NAME. NAME is a node used by
2490 the parser to represent a name; it is not yet a DECL. It may,
2491 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2492 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2493 there is no reason to do the lookup twice, so the parser keeps the
2494 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2495 be a template via the use of the "A::template B" syntax. */
2498 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2499 tsubst_flags_t complain
)
2504 tree access_path
= NULL_TREE
;
2505 tree orig_object
= object
;
2506 tree orig_name
= name
;
2508 if (object
== error_mark_node
|| name
== error_mark_node
)
2509 return error_mark_node
;
2511 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2512 if (!objc_is_public (object
, name
))
2513 return error_mark_node
;
2515 object_type
= TREE_TYPE (object
);
2517 if (processing_template_decl
)
2519 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2520 dependent_type_p (object_type
)
2521 /* If NAME is just an IDENTIFIER_NODE, then the expression
2523 || TREE_CODE (object
) == IDENTIFIER_NODE
2524 /* If NAME is "f<args>", where either 'f' or 'args' is
2525 dependent, then the expression is dependent. */
2526 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2527 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2528 TREE_OPERAND (name
, 1)))
2529 /* If NAME is "T::X" where "T" is dependent, then the
2530 expression is dependent. */
2531 || (TREE_CODE (name
) == SCOPE_REF
2532 && TYPE_P (TREE_OPERAND (name
, 0))
2533 && dependent_type_p (TREE_OPERAND (name
, 0))))
2534 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2535 object
= build_non_dependent_expr (object
);
2540 The type of the first expression shall be "class object" (of a
2542 if (!currently_open_class (object_type
)
2543 && !complete_type_or_else (object_type
, object
))
2544 return error_mark_node
;
2545 if (!CLASS_TYPE_P (object_type
))
2547 if (complain
& tf_error
)
2548 error ("request for member %qD in %qE, which is of non-class type %qT",
2549 name
, object
, object_type
);
2550 return error_mark_node
;
2553 if (BASELINK_P (name
))
2554 /* A member function that has already been looked up. */
2558 bool is_template_id
= false;
2559 tree template_args
= NULL_TREE
;
2562 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2564 is_template_id
= true;
2565 template_args
= TREE_OPERAND (name
, 1);
2566 name
= TREE_OPERAND (name
, 0);
2568 if (TREE_CODE (name
) == OVERLOAD
)
2569 name
= DECL_NAME (get_first_fn (name
));
2570 else if (DECL_P (name
))
2571 name
= DECL_NAME (name
);
2574 if (TREE_CODE (name
) == SCOPE_REF
)
2576 /* A qualified name. The qualifying class or namespace `S'
2577 has already been looked up; it is either a TYPE or a
2579 scope
= TREE_OPERAND (name
, 0);
2580 name
= TREE_OPERAND (name
, 1);
2582 /* If SCOPE is a namespace, then the qualified name does not
2583 name a member of OBJECT_TYPE. */
2584 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2586 if (complain
& tf_error
)
2587 error ("%<%D::%D%> is not a member of %qT",
2588 scope
, name
, object_type
);
2589 return error_mark_node
;
2592 gcc_assert (CLASS_TYPE_P (scope
));
2593 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2594 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2596 if (constructor_name_p (name
, scope
))
2598 if (complain
& tf_error
)
2599 error ("cannot call constructor %<%T::%D%> directly",
2601 return error_mark_node
;
2604 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2605 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2606 if (access_path
== error_mark_node
)
2607 return error_mark_node
;
2610 if (complain
& tf_error
)
2611 error ("%qT is not a base of %qT", scope
, object_type
);
2612 return error_mark_node
;
2618 access_path
= object_type
;
2621 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2622 member
= lookup_destructor (object
, scope
, name
);
2625 /* Look up the member. */
2626 member
= lookup_member (access_path
, name
, /*protect=*/1,
2627 /*want_type=*/false);
2628 if (member
== NULL_TREE
)
2630 if (complain
& tf_error
)
2631 error ("%qD has no member named %qE", object_type
, name
);
2632 return error_mark_node
;
2634 if (member
== error_mark_node
)
2635 return error_mark_node
;
2640 tree templ
= member
;
2642 if (BASELINK_P (templ
))
2643 templ
= lookup_template_function (templ
, template_args
);
2646 if (complain
& tf_error
)
2647 error ("%qD is not a member template function", name
);
2648 return error_mark_node
;
2653 if (TREE_DEPRECATED (member
))
2654 warn_deprecated_use (member
, NULL_TREE
);
2657 check_template_keyword (member
);
2659 expr
= build_class_member_access_expr (object
, member
, access_path
,
2660 /*preserve_reference=*/false,
2662 if (processing_template_decl
&& expr
!= error_mark_node
)
2664 if (BASELINK_P (member
))
2666 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2667 BASELINK_QUALIFIED_P (member
) = 1;
2670 return build_min_non_dep (COMPONENT_REF
, expr
,
2671 orig_object
, orig_name
,
2678 /* Return an expression for the MEMBER_NAME field in the internal
2679 representation of PTRMEM, a pointer-to-member function. (Each
2680 pointer-to-member function type gets its own RECORD_TYPE so it is
2681 more convenient to access the fields by name than by FIELD_DECL.)
2682 This routine converts the NAME to a FIELD_DECL and then creates the
2683 node for the complete expression. */
2686 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2692 /* This code is a stripped down version of
2693 build_class_member_access_expr. It does not work to use that
2694 routine directly because it expects the object to be of class
2696 ptrmem_type
= TREE_TYPE (ptrmem
);
2697 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2698 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2699 /*want_type=*/false);
2700 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2701 cp_type_quals (ptrmem_type
));
2702 return fold_build3_loc (input_location
,
2703 COMPONENT_REF
, member_type
,
2704 ptrmem
, member
, NULL_TREE
);
2707 /* Given an expression PTR for a pointer, return an expression
2708 for the value pointed to.
2709 ERRORSTRING is the name of the operator to appear in error messages.
2711 This function may need to overload OPERATOR_FNNAME.
2712 Must also handle REFERENCE_TYPEs for C++. */
2715 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2716 tsubst_flags_t complain
)
2718 tree orig_expr
= expr
;
2721 if (processing_template_decl
)
2723 /* Retain the type if we know the operand is a pointer so that
2724 describable_type doesn't make auto deduction break. */
2725 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2726 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2727 if (type_dependent_expression_p (expr
))
2728 return build_min_nt (INDIRECT_REF
, expr
);
2729 expr
= build_non_dependent_expr (expr
);
2732 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2733 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2735 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2737 if (processing_template_decl
&& rval
!= error_mark_node
)
2738 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2743 /* Helper function called from c-common. */
2745 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2746 tree ptr
, ref_operator errorstring
)
2748 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2752 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2753 tsubst_flags_t complain
)
2757 if (ptr
== error_mark_node
)
2758 return error_mark_node
;
2760 if (ptr
== current_class_ptr
)
2761 return current_class_ref
;
2763 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2764 ? ptr
: decay_conversion (ptr
));
2765 type
= TREE_TYPE (pointer
);
2767 if (POINTER_TYPE_P (type
))
2771 If the type of the expression is "pointer to T," the type
2772 of the result is "T." */
2773 tree t
= TREE_TYPE (type
);
2775 if (CONVERT_EXPR_P (ptr
)
2776 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2778 /* If a warning is issued, mark it to avoid duplicates from
2779 the backend. This only needs to be done at
2780 warn_strict_aliasing > 2. */
2781 if (warn_strict_aliasing
> 2)
2782 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2783 type
, TREE_OPERAND (ptr
, 0)))
2784 TREE_NO_WARNING (ptr
) = 1;
2787 if (VOID_TYPE_P (t
))
2789 /* A pointer to incomplete type (other than cv void) can be
2790 dereferenced [expr.unary.op]/1 */
2791 if (complain
& tf_error
)
2792 error ("%qT is not a pointer-to-object type", type
);
2793 return error_mark_node
;
2795 else if (TREE_CODE (pointer
) == ADDR_EXPR
2796 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2797 /* The POINTER was something like `&x'. We simplify `*&x' to
2799 return TREE_OPERAND (pointer
, 0);
2802 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2804 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2805 so that we get the proper error message if the result is used
2806 to assign to. Also, &* is supposed to be a no-op. */
2807 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2808 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2809 TREE_SIDE_EFFECTS (ref
)
2810 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2814 else if (!(complain
& tf_error
))
2815 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2817 /* `pointer' won't be an error_mark_node if we were given a
2818 pointer to member, so it's cool to check for this here. */
2819 else if (TYPE_PTR_TO_MEMBER_P (type
))
2820 switch (errorstring
)
2822 case RO_ARRAY_INDEXING
:
2823 error ("invalid use of array indexing on pointer to member");
2826 error ("invalid use of unary %<*%> on pointer to member");
2828 case RO_IMPLICIT_CONVERSION
:
2829 error ("invalid use of implicit conversion on pointer to member");
2834 else if (pointer
!= error_mark_node
)
2835 switch (errorstring
)
2838 error ("invalid type argument");
2840 case RO_ARRAY_INDEXING
:
2841 error ("invalid type argument of array indexing");
2844 error ("invalid type argument of unary %<*%>");
2846 case RO_IMPLICIT_CONVERSION
:
2847 error ("invalid type argument of implicit conversion");
2852 return error_mark_node
;
2855 /* This handles expressions of the form "a[i]", which denotes
2858 This is logically equivalent in C to *(a+i), but we may do it differently.
2859 If A is a variable or a member, we generate a primitive ARRAY_REF.
2860 This avoids forcing the array out of registers, and can work on
2861 arrays that are not lvalues (for example, members of structures returned
2864 If INDEX is of some user-defined type, it must be converted to
2865 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2866 will inherit the type of the array, which will be some pointer type.
2868 LOC is the location to use in building the array reference. */
2871 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
2872 tsubst_flags_t complain
)
2878 if (complain
& tf_error
)
2879 error_at (loc
, "subscript missing in array reference");
2880 return error_mark_node
;
2883 if (TREE_TYPE (array
) == error_mark_node
2884 || TREE_TYPE (idx
) == error_mark_node
)
2885 return error_mark_node
;
2887 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2889 switch (TREE_CODE (array
))
2893 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2895 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2896 TREE_OPERAND (array
, 0), value
);
2897 SET_EXPR_LOCATION (ret
, loc
);
2902 ret
= build_conditional_expr
2903 (TREE_OPERAND (array
, 0),
2904 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
2906 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
2908 tf_warning_or_error
);
2909 protected_set_expr_location (ret
, loc
);
2916 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2920 warn_array_subscript_with_type_char (idx
);
2922 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2924 if (complain
& tf_error
)
2925 error_at (loc
, "array subscript is not an integer");
2926 return error_mark_node
;
2929 /* Apply integral promotions *after* noticing character types.
2930 (It is unclear why we do these promotions -- the standard
2931 does not say that we should. In fact, the natural thing would
2932 seem to be to convert IDX to ptrdiff_t; we're performing
2933 pointer arithmetic.) */
2934 idx
= perform_integral_promotions (idx
);
2936 /* An array that is indexed by a non-constant
2937 cannot be stored in a register; we must be able to do
2938 address arithmetic on its address.
2939 Likewise an array of elements of variable size. */
2940 if (TREE_CODE (idx
) != INTEGER_CST
2941 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2942 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2945 if (!cxx_mark_addressable (array
))
2946 return error_mark_node
;
2949 /* An array that is indexed by a constant value which is not within
2950 the array bounds cannot be stored in a register either; because we
2951 would get a crash in store_bit_field/extract_bit_field when trying
2952 to access a non-existent part of the register. */
2953 if (TREE_CODE (idx
) == INTEGER_CST
2954 && TYPE_DOMAIN (TREE_TYPE (array
))
2955 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2957 if (!cxx_mark_addressable (array
))
2958 return error_mark_node
;
2961 if (!lvalue_p (array
) && (complain
& tf_error
))
2962 pedwarn (loc
, OPT_pedantic
,
2963 "ISO C++ forbids subscripting non-lvalue array");
2965 /* Note in C++ it is valid to subscript a `register' array, since
2966 it is valid to take the address of something with that
2967 storage specification. */
2971 while (TREE_CODE (foo
) == COMPONENT_REF
)
2972 foo
= TREE_OPERAND (foo
, 0);
2973 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
)
2974 && (complain
& tf_warning
))
2975 warning_at (loc
, OPT_Wextra
,
2976 "subscripting array declared %<register%>");
2979 type
= TREE_TYPE (TREE_TYPE (array
));
2980 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2981 /* Array ref is const/volatile if the array elements are
2982 or if the array is.. */
2983 TREE_READONLY (rval
)
2984 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2985 TREE_SIDE_EFFECTS (rval
)
2986 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2987 TREE_THIS_VOLATILE (rval
)
2988 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2989 ret
= require_complete_type (fold_if_not_in_template (rval
));
2990 protected_set_expr_location (ret
, loc
);
2995 tree ar
= default_conversion (array
);
2996 tree ind
= default_conversion (idx
);
2998 /* Put the integer in IND to simplify error checking. */
2999 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3006 if (ar
== error_mark_node
)
3009 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
3011 if (complain
& tf_error
)
3012 error_at (loc
, "subscripted value is neither array nor pointer");
3013 return error_mark_node
;
3015 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3017 if (complain
& tf_error
)
3018 error_at (loc
, "array subscript is not an integer");
3019 return error_mark_node
;
3022 warn_array_subscript_with_type_char (idx
);
3024 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3029 protected_set_expr_location (ret
, loc
);
3034 /* Entry point for Obj-C++. */
3037 build_array_ref (location_t loc
, tree array
, tree idx
)
3039 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3042 /* Resolve a pointer to member function. INSTANCE is the object
3043 instance to use, if the member points to a virtual member.
3045 This used to avoid checking for virtual functions if basetype
3046 has no virtual functions, according to an earlier ANSI draft.
3047 With the final ISO C++ rules, such an optimization is
3048 incorrect: A pointer to a derived member can be static_cast
3049 to pointer-to-base-member, as long as the dynamic object
3050 later has the right member. */
3053 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3055 if (TREE_CODE (function
) == OFFSET_REF
)
3056 function
= TREE_OPERAND (function
, 1);
3058 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3060 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3061 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3063 tree instance_ptr
= *instance_ptrptr
;
3064 tree instance_save_expr
= 0;
3065 if (instance_ptr
== error_mark_node
)
3067 if (TREE_CODE (function
) == PTRMEM_CST
)
3069 /* Extracting the function address from a pmf is only
3070 allowed with -Wno-pmf-conversions. It only works for
3072 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3073 e1
= convert (fntype
, e1
);
3078 error ("object missing in use of %qE", function
);
3079 return error_mark_node
;
3083 if (TREE_SIDE_EFFECTS (instance_ptr
))
3084 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3086 if (TREE_SIDE_EFFECTS (function
))
3087 function
= save_expr (function
);
3089 /* Start by extracting all the information from the PMF itself. */
3090 e3
= pfn_from_ptrmemfunc (function
);
3091 delta
= delta_from_ptrmemfunc (function
);
3092 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3093 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3095 case ptrmemfunc_vbit_in_pfn
:
3096 e1
= cp_build_binary_op (input_location
,
3097 BIT_AND_EXPR
, idx
, integer_one_node
,
3098 tf_warning_or_error
);
3099 idx
= cp_build_binary_op (input_location
,
3100 MINUS_EXPR
, idx
, integer_one_node
,
3101 tf_warning_or_error
);
3104 case ptrmemfunc_vbit_in_delta
:
3105 e1
= cp_build_binary_op (input_location
,
3106 BIT_AND_EXPR
, delta
, integer_one_node
,
3107 tf_warning_or_error
);
3108 delta
= cp_build_binary_op (input_location
,
3109 RSHIFT_EXPR
, delta
, integer_one_node
,
3110 tf_warning_or_error
);
3117 /* Convert down to the right base before using the instance. A
3118 special case is that in a pointer to member of class C, C may
3119 be incomplete. In that case, the function will of course be
3120 a member of C, and no conversion is required. In fact,
3121 lookup_base will fail in that case, because incomplete
3122 classes do not have BINFOs. */
3123 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3124 if (!same_type_ignoring_top_level_qualifiers_p
3125 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3127 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3128 basetype
, ba_check
, NULL
);
3129 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3131 if (instance_ptr
== error_mark_node
)
3132 return error_mark_node
;
3134 /* ...and then the delta in the PMF. */
3135 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3136 instance_ptr
, fold_convert (sizetype
, delta
));
3138 /* Hand back the adjusted 'this' argument to our caller. */
3139 *instance_ptrptr
= instance_ptr
;
3141 /* Next extract the vtable pointer from the object. */
3142 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3144 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3145 /* If the object is not dynamic the access invokes undefined
3146 behavior. As it is not executed in this case silence the
3147 spurious warnings it may provoke. */
3148 TREE_NO_WARNING (vtbl
) = 1;
3150 /* Finally, extract the function pointer from the vtable. */
3151 e2
= fold_build2_loc (input_location
,
3152 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3153 fold_convert (sizetype
, idx
));
3154 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3155 TREE_CONSTANT (e2
) = 1;
3157 /* When using function descriptors, the address of the
3158 vtable entry is treated as a function pointer. */
3159 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3160 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3161 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3162 tf_warning_or_error
));
3164 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3165 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3167 /* Make sure this doesn't get evaluated first inside one of the
3168 branches of the COND_EXPR. */
3169 if (instance_save_expr
)
3170 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3171 instance_save_expr
, e1
);
3178 /* Used by the C-common bits. */
3180 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3181 tree function
, tree params
)
3183 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3186 /* Used by the C-common bits. */
3188 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3189 tree function
, VEC(tree
,gc
) *params
,
3190 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3192 VEC(tree
,gc
) *orig_params
= params
;
3193 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3194 tf_warning_or_error
);
3196 /* cp_build_function_call_vec can reallocate PARAMS by adding
3197 default arguments. That should never happen here. Verify
3199 gcc_assert (params
== orig_params
);
3204 /* Build a function call using a tree list of arguments. */
3207 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3212 vec
= make_tree_vector ();
3213 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3214 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3215 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3216 release_tree_vector (vec
);
3220 /* Build a function call using a vector of arguments. PARAMS may be
3221 NULL if there are no parameters. This changes the contents of
3225 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3226 tsubst_flags_t complain
)
3228 tree fntype
, fndecl
;
3230 tree original
= function
;
3234 VEC(tree
,gc
) *allocated
= NULL
;
3237 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3238 expressions, like those used for ObjC messenger dispatches. */
3239 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3240 function
= objc_rewrite_function_call (function
,
3241 VEC_index (tree
, *params
, 0));
3243 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3244 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3245 if (TREE_CODE (function
) == NOP_EXPR
3246 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3247 function
= TREE_OPERAND (function
, 0);
3249 if (TREE_CODE (function
) == FUNCTION_DECL
)
3251 mark_used (function
);
3254 /* Convert anything with function type to a pointer-to-function. */
3255 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3256 pedwarn (input_location
, OPT_pedantic
,
3257 "ISO C++ forbids calling %<::main%> from within program");
3259 function
= build_addr_func (function
);
3265 function
= build_addr_func (function
);
3268 if (function
== error_mark_node
)
3269 return error_mark_node
;
3271 fntype
= TREE_TYPE (function
);
3273 if (TYPE_PTRMEMFUNC_P (fntype
))
3275 if (complain
& tf_error
)
3276 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3277 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3278 original
, original
);
3279 return error_mark_node
;
3282 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3283 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3285 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3286 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3288 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3290 if (complain
& tf_error
)
3291 error ("%qE cannot be used as a function", original
);
3292 return error_mark_node
;
3295 /* fntype now gets the type of function pointed to. */
3296 fntype
= TREE_TYPE (fntype
);
3297 parm_types
= TYPE_ARG_TYPES (fntype
);
3301 allocated
= make_tree_vector ();
3302 params
= &allocated
;
3305 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3308 return error_mark_node
;
3310 argarray
= VEC_address (tree
, *params
);
3312 /* Check for errors in format strings and inappropriately
3314 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3317 ret
= build_cxx_call (function
, nargs
, argarray
);
3319 if (allocated
!= NULL
)
3320 release_tree_vector (allocated
);
3325 /* Subroutine of convert_arguments.
3326 Warn about wrong number of args are genereted. */
3329 warn_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3333 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3335 if (DECL_NAME (fndecl
) == NULL_TREE
3336 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3339 ? G_("too many arguments to constructor %q#D")
3340 : G_("too few arguments to constructor %q#D"),
3345 ? G_("too many arguments to member function %q#D")
3346 : G_("too few arguments to member function %q#D"),
3352 ? G_("too many arguments to function %q#D")
3353 : G_("too few arguments to function %q#D"),
3355 inform (DECL_SOURCE_LOCATION (fndecl
),
3359 error_at (loc
, too_many_p
? G_("too many arguments to function")
3360 : G_("too few arguments to function"));
3363 /* Convert the actual parameter expressions in the list VALUES to the
3364 types in the list TYPELIST. The converted expressions are stored
3365 back in the VALUES vector.
3366 If parmdecls is exhausted, or when an element has NULL as its type,
3367 perform the default conversions.
3369 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3371 This is also where warnings about wrong number of args are generated.
3373 Returns the actual number of arguments processed (which might be less
3374 than the length of the vector), or -1 on error.
3376 In C++, unspecified trailing parameters can be filled in with their
3377 default arguments, if such were specified. Do so here. */
3380 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3381 int flags
, tsubst_flags_t complain
)
3386 /* Argument passing is always copy-initialization. */
3387 flags
|= LOOKUP_ONLYCONVERTING
;
3389 for (i
= 0, typetail
= typelist
;
3390 i
< VEC_length (tree
, *values
);
3393 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3394 tree val
= VEC_index (tree
, *values
, i
);
3396 if (val
== error_mark_node
|| type
== error_mark_node
)
3399 if (type
== void_type_node
)
3401 if (complain
& tf_error
)
3403 warn_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3410 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3411 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3412 if (TREE_CODE (val
) == NOP_EXPR
3413 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3414 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3415 val
= TREE_OPERAND (val
, 0);
3417 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3419 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3420 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3421 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3422 val
= decay_conversion (val
);
3425 if (val
== error_mark_node
)
3430 /* Formal parm type is specified by a function prototype. */
3433 if (!COMPLETE_TYPE_P (complete_type (type
)))
3435 if (complain
& tf_error
)
3438 error ("parameter %P of %qD has incomplete type %qT",
3441 error ("parameter %P has incomplete type %qT", i
, type
);
3443 parmval
= error_mark_node
;
3447 parmval
= convert_for_initialization
3448 (NULL_TREE
, type
, val
, flags
,
3449 "argument passing", fndecl
, i
, complain
);
3450 parmval
= convert_for_arg_passing (type
, parmval
);
3453 if (parmval
== error_mark_node
)
3456 VEC_replace (tree
, *values
, i
, parmval
);
3460 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3461 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3462 /* Don't do ellipsis conversion for __built_in_constant_p
3463 as this will result in spurious errors for non-trivial
3465 val
= require_complete_type (val
);
3467 val
= convert_arg_to_ellipsis (val
);
3469 VEC_replace (tree
, *values
, i
, val
);
3473 typetail
= TREE_CHAIN (typetail
);
3476 if (typetail
!= 0 && typetail
!= void_list_node
)
3478 /* See if there are default arguments that can be used. Because
3479 we hold default arguments in the FUNCTION_TYPE (which is so
3480 wrong), we can see default parameters here from deduced
3481 contexts (and via typeof) for indirect function calls.
3482 Fortunately we know whether we have a function decl to
3483 provide default arguments in a language conformant
3485 if (fndecl
&& TREE_PURPOSE (typetail
)
3486 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3488 for (; typetail
!= void_list_node
; ++i
)
3491 = convert_default_arg (TREE_VALUE (typetail
),
3492 TREE_PURPOSE (typetail
),
3495 if (parmval
== error_mark_node
)
3498 VEC_safe_push (tree
, gc
, *values
, parmval
);
3499 typetail
= TREE_CHAIN (typetail
);
3500 /* ends with `...'. */
3501 if (typetail
== NULL_TREE
)
3507 if (complain
& tf_error
)
3508 warn_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3516 /* Build a binary-operation expression, after performing default
3517 conversions on the operands. CODE is the kind of expression to
3518 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3519 are the tree codes which correspond to ARG1 and ARG2 when issuing
3520 warnings about possibly misplaced parentheses. They may differ
3521 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3522 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3523 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3524 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3525 ARG2_CODE as ERROR_MARK. */
3528 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3529 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3530 tsubst_flags_t complain
)
3539 if (processing_template_decl
)
3541 if (type_dependent_expression_p (arg1
)
3542 || type_dependent_expression_p (arg2
))
3543 return build_min_nt (code
, arg1
, arg2
);
3544 arg1
= build_non_dependent_expr (arg1
);
3545 arg2
= build_non_dependent_expr (arg2
);
3548 if (code
== DOTSTAR_EXPR
)
3549 expr
= build_m_component_ref (arg1
, arg2
);
3551 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3552 overloaded_p
, complain
);
3554 /* Check for cases such as x+y<<z which users are likely to
3555 misinterpret. But don't warn about obj << x + y, since that is a
3556 common idiom for I/O. */
3557 if (warn_parentheses
3558 && (complain
& tf_warning
)
3559 && !processing_template_decl
3560 && !error_operand_p (arg1
)
3561 && !error_operand_p (arg2
)
3562 && (code
!= LSHIFT_EXPR
3563 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3564 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3566 if (processing_template_decl
&& expr
!= error_mark_node
)
3567 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3572 /* Build and return an ARRAY_REF expression. */
3575 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3577 tree orig_arg1
= arg1
;
3578 tree orig_arg2
= arg2
;
3581 if (processing_template_decl
)
3583 if (type_dependent_expression_p (arg1
)
3584 || type_dependent_expression_p (arg2
))
3585 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3586 NULL_TREE
, NULL_TREE
);
3587 arg1
= build_non_dependent_expr (arg1
);
3588 arg2
= build_non_dependent_expr (arg2
);
3591 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3592 /*overloaded_p=*/NULL
, complain
);
3594 if (processing_template_decl
&& expr
!= error_mark_node
)
3595 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3596 NULL_TREE
, NULL_TREE
);
3600 /* For the c-common bits. */
3602 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3603 int convert_p ATTRIBUTE_UNUSED
)
3605 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3609 /* Build a binary-operation expression without default conversions.
3610 CODE is the kind of expression to build.
3611 LOCATION is the location_t of the operator in the source code.
3612 This function differs from `build' in several ways:
3613 the data type of the result is computed and recorded in it,
3614 warnings are generated if arg data types are invalid,
3615 special handling for addition and subtraction of pointers is known,
3616 and some optimization is done (operations on narrow ints
3617 are done in the narrower type when that gives the same result).
3618 Constant folding is also done before the result is returned.
3620 Note that the operands will never have enumeral types
3621 because either they have just had the default conversions performed
3622 or they have both just been converted to some other type in which
3623 the arithmetic is to be done.
3625 C++: must do special pointer arithmetic when implementing
3626 multiple inheritance, and deal with pointer to member functions. */
3629 cp_build_binary_op (location_t location
,
3630 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3631 tsubst_flags_t complain
)
3634 enum tree_code code0
, code1
;
3636 const char *invalid_op_diag
;
3638 /* Expression code to give to the expression when it is built.
3639 Normally this is CODE, which is what the caller asked for,
3640 but in some special cases we change it. */
3641 enum tree_code resultcode
= code
;
3643 /* Data type in which the computation is to be performed.
3644 In the simplest cases this is the common type of the arguments. */
3645 tree result_type
= NULL
;
3647 /* Nonzero means operands have already been type-converted
3648 in whatever way is necessary.
3649 Zero means they need to be converted to RESULT_TYPE. */
3652 /* Nonzero means create the expression with this type, rather than
3654 tree build_type
= 0;
3656 /* Nonzero means after finally constructing the expression
3657 convert it to this type. */
3658 tree final_type
= 0;
3662 /* Nonzero if this is an operation like MIN or MAX which can
3663 safely be computed in short if both args are promoted shorts.
3664 Also implies COMMON.
3665 -1 indicates a bitwise operation; this makes a difference
3666 in the exact conditions for when it is safe to do the operation
3667 in a narrower mode. */
3670 /* Nonzero if this is a comparison operation;
3671 if both args are promoted shorts, compare the original shorts.
3672 Also implies COMMON. */
3673 int short_compare
= 0;
3675 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3678 /* True if both operands have arithmetic type. */
3679 bool arithmetic_types_p
;
3681 /* Apply default conversions. */
3685 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3686 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3687 || code
== TRUTH_XOR_EXPR
)
3689 if (!really_overloaded_fn (op0
))
3690 op0
= decay_conversion (op0
);
3691 if (!really_overloaded_fn (op1
))
3692 op1
= decay_conversion (op1
);
3696 if (!really_overloaded_fn (op0
))
3697 op0
= default_conversion (op0
);
3698 if (!really_overloaded_fn (op1
))
3699 op1
= default_conversion (op1
);
3702 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3703 STRIP_TYPE_NOPS (op0
);
3704 STRIP_TYPE_NOPS (op1
);
3706 /* DTRT if one side is an overloaded function, but complain about it. */
3707 if (type_unknown_p (op0
))
3709 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3710 if (t
!= error_mark_node
)
3712 if (complain
& tf_error
)
3713 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3718 if (type_unknown_p (op1
))
3720 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3721 if (t
!= error_mark_node
)
3723 if (complain
& tf_error
)
3724 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3730 type0
= TREE_TYPE (op0
);
3731 type1
= TREE_TYPE (op1
);
3733 /* The expression codes of the data types of the arguments tell us
3734 whether the arguments are integers, floating, pointers, etc. */
3735 code0
= TREE_CODE (type0
);
3736 code1
= TREE_CODE (type1
);
3738 /* If an error was already reported for one of the arguments,
3739 avoid reporting another error. */
3740 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3741 return error_mark_node
;
3743 if ((invalid_op_diag
3744 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3746 error (invalid_op_diag
);
3747 return error_mark_node
;
3750 /* Issue warnings about peculiar, but valid, uses of NULL. */
3751 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3752 /* It's reasonable to use pointer values as operands of &&
3753 and ||, so NULL is no exception. */
3754 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3755 && ( /* Both are NULL (or 0) and the operation was not a
3756 comparison or a pointer subtraction. */
3757 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3758 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3759 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3760 || (!null_ptr_cst_p (orig_op0
)
3761 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3762 || (!null_ptr_cst_p (orig_op1
)
3763 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3764 && (complain
& tf_warning
))
3765 /* Some sort of arithmetic operation involving NULL was
3767 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3772 /* Subtraction of two similar pointers.
3773 We must subtract them as integers, then divide by object size. */
3774 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3775 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3777 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3778 /* In all other cases except pointer - int, the usual arithmetic
3780 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3785 /* The pointer - int case is just like pointer + int; fall
3788 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3789 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3793 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3794 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3795 if (processing_template_decl
)
3797 result_type
= TREE_TYPE (ptr_operand
);
3800 return cp_pointer_int_sum (code
,
3811 case TRUNC_DIV_EXPR
:
3813 case FLOOR_DIV_EXPR
:
3814 case ROUND_DIV_EXPR
:
3815 case EXACT_DIV_EXPR
:
3816 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3817 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3818 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3819 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3821 enum tree_code tcode0
= code0
, tcode1
= code1
;
3823 warn_for_div_by_zero (location
, op1
);
3825 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3826 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3827 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3828 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3830 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3831 resultcode
= RDIV_EXPR
;
3833 /* When dividing two signed integers, we have to promote to int.
3834 unless we divide by a constant != -1. Note that default
3835 conversion will have been performed on the operands at this
3836 point, so we have to dig out the original type to find out if
3838 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3839 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3840 || (TREE_CODE (op1
) == INTEGER_CST
3841 && ! integer_all_onesp (op1
)));
3850 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3851 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3852 && !VECTOR_FLOAT_TYPE_P (type0
)
3853 && !VECTOR_FLOAT_TYPE_P (type1
)))
3857 case TRUNC_MOD_EXPR
:
3858 case FLOOR_MOD_EXPR
:
3859 warn_for_div_by_zero (location
, op1
);
3861 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3862 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3863 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3865 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3867 /* Although it would be tempting to shorten always here, that loses
3868 on some targets, since the modulo instruction is undefined if the
3869 quotient can't be represented in the computation mode. We shorten
3870 only if unsigned or if dividing by something we know != -1. */
3871 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3872 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3873 || (TREE_CODE (op1
) == INTEGER_CST
3874 && ! integer_all_onesp (op1
)));
3879 case TRUTH_ANDIF_EXPR
:
3880 case TRUTH_ORIF_EXPR
:
3881 case TRUTH_AND_EXPR
:
3883 result_type
= boolean_type_node
;
3886 /* Shift operations: result has same type as first operand;
3887 always convert second operand to int.
3888 Also set SHORT_SHIFT if shifting rightward. */
3891 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3893 result_type
= type0
;
3894 if (TREE_CODE (op1
) == INTEGER_CST
)
3896 if (tree_int_cst_lt (op1
, integer_zero_node
))
3898 if ((complain
& tf_warning
)
3899 && c_inhibit_evaluation_warnings
== 0)
3900 warning (0, "right shift count is negative");
3904 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3905 && (complain
& tf_warning
)
3906 && c_inhibit_evaluation_warnings
== 0)
3907 warning (0, "right shift count >= width of type");
3910 /* Convert the shift-count to an integer, regardless of
3911 size of value being shifted. */
3912 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3913 op1
= cp_convert (integer_type_node
, op1
);
3914 /* Avoid converting op1 to result_type later. */
3920 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3922 result_type
= type0
;
3923 if (TREE_CODE (op1
) == INTEGER_CST
)
3925 if (tree_int_cst_lt (op1
, integer_zero_node
))
3927 if ((complain
& tf_warning
)
3928 && c_inhibit_evaluation_warnings
== 0)
3929 warning (0, "left shift count is negative");
3931 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3933 if ((complain
& tf_warning
)
3934 && c_inhibit_evaluation_warnings
== 0)
3935 warning (0, "left shift count >= width of type");
3938 /* Convert the shift-count to an integer, regardless of
3939 size of value being shifted. */
3940 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3941 op1
= cp_convert (integer_type_node
, op1
);
3942 /* Avoid converting op1 to result_type later. */
3949 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3951 result_type
= type0
;
3952 if (TREE_CODE (op1
) == INTEGER_CST
)
3954 if (tree_int_cst_lt (op1
, integer_zero_node
))
3956 if (complain
& tf_warning
)
3957 warning (0, (code
== LROTATE_EXPR
)
3958 ? G_("left rotate count is negative")
3959 : G_("right rotate count is negative"));
3961 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3963 if (complain
& tf_warning
)
3964 warning (0, (code
== LROTATE_EXPR
)
3965 ? G_("left rotate count >= width of type")
3966 : G_("right rotate count >= width of type"));
3969 /* Convert the shift-count to an integer, regardless of
3970 size of value being shifted. */
3971 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3972 op1
= cp_convert (integer_type_node
, op1
);
3978 if ((complain
& tf_warning
)
3979 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3980 warning (OPT_Wfloat_equal
,
3981 "comparing floating point with == or != is unsafe");
3982 if ((complain
& tf_warning
)
3983 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3984 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3985 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3987 build_type
= boolean_type_node
;
3988 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3989 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3990 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3991 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3993 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3994 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3995 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3996 CPO_COMPARISON
, complain
);
3997 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3998 && null_ptr_cst_p (op1
))
4000 if (TREE_CODE (op0
) == ADDR_EXPR
4001 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4003 if (complain
& tf_warning
)
4004 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4005 TREE_OPERAND (op0
, 0));
4007 result_type
= type0
;
4009 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
4010 && null_ptr_cst_p (op0
))
4012 if (TREE_CODE (op1
) == ADDR_EXPR
4013 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4015 if (complain
& tf_warning
)
4016 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4017 TREE_OPERAND (op1
, 0));
4019 result_type
= type1
;
4021 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4022 /* One of the operands must be of nullptr_t type. */
4023 result_type
= TREE_TYPE (nullptr_node
);
4024 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4026 result_type
= type0
;
4027 if (complain
& tf_error
)
4028 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4030 return error_mark_node
;
4032 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4034 result_type
= type1
;
4035 if (complain
& tf_error
)
4036 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4038 return error_mark_node
;
4040 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4042 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4043 == ptrmemfunc_vbit_in_delta
)
4045 tree pfn0
= pfn_from_ptrmemfunc (op0
);
4046 tree delta0
= delta_from_ptrmemfunc (op0
);
4047 tree e1
= cp_build_binary_op (location
,
4050 fold_convert (TREE_TYPE (pfn0
),
4053 tree e2
= cp_build_binary_op (location
,
4058 e2
= cp_build_binary_op (location
,
4059 EQ_EXPR
, e2
, integer_zero_node
,
4061 op0
= cp_build_binary_op (location
,
4062 TRUTH_ANDIF_EXPR
, e1
, e2
,
4064 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4068 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4069 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4071 result_type
= TREE_TYPE (op0
);
4073 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4074 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4075 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4078 /* E will be the final comparison. */
4080 /* E1 and E2 are for scratch. */
4088 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4089 CPO_COMPARISON
, complain
);
4091 if (!same_type_p (TREE_TYPE (op0
), type
))
4092 op0
= cp_convert_and_check (type
, op0
);
4093 if (!same_type_p (TREE_TYPE (op1
), type
))
4094 op1
= cp_convert_and_check (type
, op1
);
4096 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4097 return error_mark_node
;
4099 if (TREE_SIDE_EFFECTS (op0
))
4100 op0
= save_expr (op0
);
4101 if (TREE_SIDE_EFFECTS (op1
))
4102 op1
= save_expr (op1
);
4104 pfn0
= pfn_from_ptrmemfunc (op0
);
4105 pfn1
= pfn_from_ptrmemfunc (op1
);
4106 delta0
= delta_from_ptrmemfunc (op0
);
4107 delta1
= delta_from_ptrmemfunc (op1
);
4108 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4109 == ptrmemfunc_vbit_in_delta
)
4114 && ((op0.delta == op1.delta)
4115 || (!op0.pfn && op0.delta & 1 == 0
4116 && op1.delta & 1 == 0))
4118 The reason for the `!op0.pfn' bit is that a NULL
4119 pointer-to-member is any member with a zero PFN and
4120 LSB of the DELTA field is 0. */
4122 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4126 e1
= cp_build_binary_op (location
,
4127 EQ_EXPR
, e1
, integer_zero_node
,
4129 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4133 e2
= cp_build_binary_op (location
,
4134 EQ_EXPR
, e2
, integer_zero_node
,
4136 e1
= cp_build_binary_op (location
,
4137 TRUTH_ANDIF_EXPR
, e2
, e1
,
4139 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4141 fold_convert (TREE_TYPE (pfn0
),
4144 e2
= cp_build_binary_op (location
,
4145 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4146 e1
= cp_build_binary_op (location
,
4147 EQ_EXPR
, delta0
, delta1
, complain
);
4148 e1
= cp_build_binary_op (location
,
4149 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4156 && (!op0.pfn || op0.delta == op1.delta))
4158 The reason for the `!op0.pfn' bit is that a NULL
4159 pointer-to-member is any member with a zero PFN; the
4160 DELTA field is unspecified. */
4162 e1
= cp_build_binary_op (location
,
4163 EQ_EXPR
, delta0
, delta1
, complain
);
4164 e2
= cp_build_binary_op (location
,
4167 fold_convert (TREE_TYPE (pfn0
),
4170 e1
= cp_build_binary_op (location
,
4171 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4173 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4174 e
= cp_build_binary_op (location
,
4175 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4176 if (code
== EQ_EXPR
)
4178 return cp_build_binary_op (location
,
4179 EQ_EXPR
, e
, integer_zero_node
, complain
);
4183 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4184 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4186 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4187 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4195 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4196 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4198 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4199 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4200 CPO_COMPARISON
, complain
);
4207 if (TREE_CODE (orig_op0
) == STRING_CST
4208 || TREE_CODE (orig_op1
) == STRING_CST
)
4210 if (complain
& tf_warning
)
4211 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4214 build_type
= boolean_type_node
;
4215 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4216 || code0
== ENUMERAL_TYPE
)
4217 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4218 || code1
== ENUMERAL_TYPE
))
4220 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4221 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4222 CPO_COMPARISON
, complain
);
4223 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4224 result_type
= type0
;
4225 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4226 result_type
= type1
;
4227 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4228 /* One of the operands must be of nullptr_t type. */
4229 result_type
= TREE_TYPE (nullptr_node
);
4230 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4232 result_type
= type0
;
4233 if (complain
& tf_error
)
4234 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4236 return error_mark_node
;
4238 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4240 result_type
= type1
;
4241 if (complain
& tf_error
)
4242 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4244 return error_mark_node
;
4248 case UNORDERED_EXPR
:
4255 build_type
= integer_type_node
;
4256 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4258 if (complain
& tf_error
)
4259 error ("unordered comparison on non-floating point argument");
4260 return error_mark_node
;
4269 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4270 || code0
== ENUMERAL_TYPE
)
4271 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4272 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4273 arithmetic_types_p
= 1;
4276 arithmetic_types_p
= 0;
4277 /* Vector arithmetic is only allowed when both sides are vectors. */
4278 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4280 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4281 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4284 binary_op_error (location
, code
, type0
, type1
);
4285 return error_mark_node
;
4287 arithmetic_types_p
= 1;
4290 /* Determine the RESULT_TYPE, if it is not already known. */
4292 && arithmetic_types_p
4293 && (shorten
|| common
|| short_compare
))
4294 result_type
= cp_common_type (type0
, type1
);
4298 if (complain
& tf_error
)
4299 error ("invalid operands of types %qT and %qT to binary %qO",
4300 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4301 return error_mark_node
;
4304 /* If we're in a template, the only thing we need to know is the
4306 if (processing_template_decl
)
4308 /* Since the middle-end checks the type when doing a build2, we
4309 need to build the tree in pieces. This built tree will never
4310 get out of the front-end as we replace it when instantiating
4312 tree tmp
= build2 (resultcode
,
4313 build_type
? build_type
: result_type
,
4315 TREE_OPERAND (tmp
, 0) = op0
;
4319 if (arithmetic_types_p
)
4321 bool first_complex
= (code0
== COMPLEX_TYPE
);
4322 bool second_complex
= (code1
== COMPLEX_TYPE
);
4323 int none_complex
= (!first_complex
&& !second_complex
);
4325 /* Adapted from patch for c/24581. */
4326 if (first_complex
!= second_complex
4327 && (code
== PLUS_EXPR
4328 || code
== MINUS_EXPR
4329 || code
== MULT_EXPR
4330 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4331 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4332 && flag_signed_zeros
)
4334 /* An operation on mixed real/complex operands must be
4335 handled specially, but the language-independent code can
4336 more easily optimize the plain complex arithmetic if
4337 -fno-signed-zeros. */
4338 tree real_type
= TREE_TYPE (result_type
);
4342 if (TREE_TYPE (op0
) != result_type
)
4343 op0
= cp_convert_and_check (result_type
, op0
);
4344 if (TREE_TYPE (op1
) != real_type
)
4345 op1
= cp_convert_and_check (real_type
, op1
);
4349 if (TREE_TYPE (op0
) != real_type
)
4350 op0
= cp_convert_and_check (real_type
, op0
);
4351 if (TREE_TYPE (op1
) != result_type
)
4352 op1
= cp_convert_and_check (result_type
, op1
);
4354 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4355 return error_mark_node
;
4358 op0
= save_expr (op0
);
4359 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4360 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4364 case TRUNC_DIV_EXPR
:
4365 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4369 real
= build2 (resultcode
, real_type
, real
, op1
);
4377 op1
= save_expr (op1
);
4378 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4379 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4383 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4386 real
= build2 (resultcode
, real_type
, op0
, real
);
4389 real
= build2 (resultcode
, real_type
, op0
, real
);
4390 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4396 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4399 /* For certain operations (which identify themselves by shorten != 0)
4400 if both args were extended from the same smaller type,
4401 do the arithmetic in that type and then extend.
4403 shorten !=0 and !=1 indicates a bitwise operation.
4404 For them, this optimization is safe only if
4405 both args are zero-extended or both are sign-extended.
4406 Otherwise, we might change the result.
4407 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4408 but calculated in (unsigned short) it would be (unsigned short)-1. */
4410 if (shorten
&& none_complex
)
4412 final_type
= result_type
;
4413 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4417 /* Comparison operations are shortened too but differently.
4418 They identify themselves by setting short_compare = 1. */
4422 /* Don't write &op0, etc., because that would prevent op0
4423 from being kept in a register.
4424 Instead, make copies of the our local variables and
4425 pass the copies by reference, then copy them back afterward. */
4426 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4427 enum tree_code xresultcode
= resultcode
;
4429 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4431 return cp_convert (boolean_type_node
, val
);
4432 op0
= xop0
, op1
= xop1
;
4434 resultcode
= xresultcode
;
4437 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4438 && warn_sign_compare
4439 && !TREE_NO_WARNING (orig_op0
)
4440 && !TREE_NO_WARNING (orig_op1
)
4441 /* Do not warn until the template is instantiated; we cannot
4442 bound the ranges of the arguments until that point. */
4443 && !processing_template_decl
4444 && (complain
& tf_warning
)
4445 && c_inhibit_evaluation_warnings
== 0)
4447 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4448 result_type
, resultcode
);
4452 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4453 Then the expression will be built.
4454 It will be given type FINAL_TYPE if that is nonzero;
4455 otherwise, it will be given type RESULT_TYPE. */
4458 if (TREE_TYPE (op0
) != result_type
)
4459 op0
= cp_convert_and_check (result_type
, op0
);
4460 if (TREE_TYPE (op1
) != result_type
)
4461 op1
= cp_convert_and_check (result_type
, op1
);
4463 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4464 return error_mark_node
;
4467 if (build_type
== NULL_TREE
)
4468 build_type
= result_type
;
4470 result
= build2 (resultcode
, build_type
, op0
, op1
);
4471 result
= fold_if_not_in_template (result
);
4472 if (final_type
!= 0)
4473 result
= cp_convert (final_type
, result
);
4475 if (TREE_OVERFLOW_P (result
)
4476 && !TREE_OVERFLOW_P (op0
)
4477 && !TREE_OVERFLOW_P (op1
))
4478 overflow_warning (location
, result
);
4483 /* Return a tree for the sum or difference (RESULTCODE says which)
4484 of pointer PTROP and integer INTOP. */
4487 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4489 tree res_type
= TREE_TYPE (ptrop
);
4491 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4492 in certain circumstance (when it's valid to do so). So we need
4493 to make sure it's complete. We don't need to check here, if we
4494 can actually complete it at all, as those checks will be done in
4495 pointer_int_sum() anyway. */
4496 complete_type (TREE_TYPE (res_type
));
4498 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4499 fold_if_not_in_template (intop
));
4502 /* Return a tree for the difference of pointers OP0 and OP1.
4503 The resulting tree has type int. */
4506 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4509 tree restype
= ptrdiff_type_node
;
4510 tree target_type
= TREE_TYPE (ptrtype
);
4512 if (!complete_type_or_else (target_type
, NULL_TREE
))
4513 return error_mark_node
;
4515 if (TREE_CODE (target_type
) == VOID_TYPE
)
4516 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4517 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4518 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4519 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4520 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4522 /* First do the subtraction as integers;
4523 then drop through to build the divide operator. */
4525 op0
= cp_build_binary_op (input_location
,
4527 cp_convert (restype
, op0
),
4528 cp_convert (restype
, op1
),
4529 tf_warning_or_error
);
4531 /* This generates an error if op1 is a pointer to an incomplete type. */
4532 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4533 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4535 op1
= (TYPE_PTROB_P (ptrtype
)
4536 ? size_in_bytes (target_type
)
4537 : integer_one_node
);
4539 /* Do the division. */
4541 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4542 return fold_if_not_in_template (result
);
4545 /* Construct and perhaps optimize a tree representation
4546 for a unary operation. CODE, a tree_code, specifies the operation
4547 and XARG is the operand. */
4550 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4552 tree orig_expr
= xarg
;
4556 if (processing_template_decl
)
4558 if (type_dependent_expression_p (xarg
))
4559 return build_min_nt (code
, xarg
, NULL_TREE
);
4561 xarg
= build_non_dependent_expr (xarg
);
4566 /* [expr.unary.op] says:
4568 The address of an object of incomplete type can be taken.
4570 (And is just the ordinary address operator, not an overloaded
4571 "operator &".) However, if the type is a template
4572 specialization, we must complete the type at this point so that
4573 an overloaded "operator &" will be available if required. */
4574 if (code
== ADDR_EXPR
4575 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4576 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4577 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4578 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4579 /* Don't look for a function. */;
4581 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4582 /*overloaded_p=*/NULL
, complain
);
4583 if (!exp
&& code
== ADDR_EXPR
)
4585 if (is_overloaded_fn (xarg
))
4587 tree fn
= get_first_fn (xarg
);
4588 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4590 error (DECL_CONSTRUCTOR_P (fn
)
4591 ? G_("taking address of constructor %qE")
4592 : G_("taking address of destructor %qE"),
4594 return error_mark_node
;
4598 /* A pointer to member-function can be formed only by saying
4600 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4601 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4603 if (TREE_CODE (xarg
) != OFFSET_REF
4604 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4606 error ("invalid use of %qE to form a pointer-to-member-function",
4608 if (TREE_CODE (xarg
) != OFFSET_REF
)
4609 inform (input_location
, " a qualified-id is required");
4610 return error_mark_node
;
4614 error ("parentheses around %qE cannot be used to form a"
4615 " pointer-to-member-function",
4617 PTRMEM_OK_P (xarg
) = 1;
4621 if (TREE_CODE (xarg
) == OFFSET_REF
)
4623 ptrmem
= PTRMEM_OK_P (xarg
);
4625 if (!ptrmem
&& !flag_ms_extensions
4626 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4628 /* A single non-static member, make sure we don't allow a
4629 pointer-to-member. */
4630 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4631 TREE_OPERAND (xarg
, 0),
4632 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4633 PTRMEM_OK_P (xarg
) = ptrmem
;
4636 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4637 warning (0, "taking address of temporary");
4638 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4641 if (processing_template_decl
&& exp
!= error_mark_node
)
4642 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4643 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4644 if (TREE_CODE (exp
) == ADDR_EXPR
)
4645 PTRMEM_OK_P (exp
) = ptrmem
;
4649 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4650 constants, where a null value is represented by an INTEGER_CST of
4654 cp_truthvalue_conversion (tree expr
)
4656 tree type
= TREE_TYPE (expr
);
4657 if (TYPE_PTRMEM_P (type
))
4658 return build_binary_op (EXPR_LOCATION (expr
),
4659 NE_EXPR
, expr
, integer_zero_node
, 1);
4661 return c_common_truthvalue_conversion (input_location
, expr
);
4664 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4667 condition_conversion (tree expr
)
4670 if (processing_template_decl
)
4672 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4673 tf_warning_or_error
, LOOKUP_NORMAL
);
4674 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4678 /* Returns the address of T. This function will fold away
4679 ADDR_EXPR of INDIRECT_REF. */
4682 build_address (tree t
)
4684 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4685 return error_mark_node
;
4686 t
= build_fold_addr_expr (t
);
4687 if (TREE_CODE (t
) != ADDR_EXPR
)
4692 /* Returns the address of T with type TYPE. */
4695 build_typed_address (tree t
, tree type
)
4697 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4698 return error_mark_node
;
4699 t
= build_fold_addr_expr_with_type (t
, type
);
4700 if (TREE_CODE (t
) != ADDR_EXPR
)
4705 /* Return a NOP_EXPR converting EXPR to TYPE. */
4708 build_nop (tree type
, tree expr
)
4710 if (type
== error_mark_node
|| error_operand_p (expr
))
4712 return build1 (NOP_EXPR
, type
, expr
);
4715 /* C++: Must handle pointers to members.
4717 Perhaps type instantiation should be extended to handle conversion
4718 from aggregates to types we don't yet know we want? (Or are those
4719 cases typically errors which should be reported?)
4721 NOCONVERT nonzero suppresses the default promotions
4722 (such as from short to int). */
4725 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4726 tsubst_flags_t complain
)
4728 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4731 const char *errstring
= NULL
;
4733 const char *invalid_op_diag
;
4735 if (error_operand_p (arg
))
4736 return error_mark_node
;
4738 if ((invalid_op_diag
4739 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4744 error (invalid_op_diag
);
4745 return error_mark_node
;
4750 case UNARY_PLUS_EXPR
:
4753 int flags
= WANT_ARITH
| WANT_ENUM
;
4754 /* Unary plus (but not unary minus) is allowed on pointers. */
4755 if (code
== UNARY_PLUS_EXPR
)
4756 flags
|= WANT_POINTER
;
4757 arg
= build_expr_type_conversion (flags
, arg
, true);
4759 errstring
= (code
== NEGATE_EXPR
4760 ? _("wrong type argument to unary minus")
4761 : _("wrong type argument to unary plus"));
4764 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4765 arg
= perform_integral_promotions (arg
);
4767 /* Make sure the result is not an lvalue: a unary plus or minus
4768 expression is always a rvalue. */
4775 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4779 arg
= default_conversion (arg
);
4781 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4782 | WANT_VECTOR_OR_COMPLEX
,
4784 errstring
= _("wrong type argument to bit-complement");
4785 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4786 arg
= perform_integral_promotions (arg
);
4790 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4791 errstring
= _("wrong type argument to abs");
4792 else if (!noconvert
)
4793 arg
= default_conversion (arg
);
4797 /* Conjugating a real value is a no-op, but allow it anyway. */
4798 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4799 errstring
= _("wrong type argument to conjugation");
4800 else if (!noconvert
)
4801 arg
= default_conversion (arg
);
4804 case TRUTH_NOT_EXPR
:
4805 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4807 val
= invert_truthvalue_loc (input_location
, arg
);
4808 if (arg
!= error_mark_node
)
4810 errstring
= _("in argument to unary !");
4817 if (TREE_CODE (arg
) == COMPLEX_CST
)
4818 return TREE_REALPART (arg
);
4819 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4821 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4822 return fold_if_not_in_template (arg
);
4828 if (TREE_CODE (arg
) == COMPLEX_CST
)
4829 return TREE_IMAGPART (arg
);
4830 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4832 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4833 return fold_if_not_in_template (arg
);
4836 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4838 case PREINCREMENT_EXPR
:
4839 case POSTINCREMENT_EXPR
:
4840 case PREDECREMENT_EXPR
:
4841 case POSTDECREMENT_EXPR
:
4842 /* Handle complex lvalues (when permitted)
4843 by reduction to simpler cases. */
4845 val
= unary_complex_lvalue (code
, arg
);
4849 arg
= mark_lvalue_use (arg
);
4851 /* Increment or decrement the real part of the value,
4852 and don't change the imaginary part. */
4853 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4857 arg
= stabilize_reference (arg
);
4858 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4859 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4860 real
= cp_build_unary_op (code
, real
, 1, complain
);
4861 if (real
== error_mark_node
|| imag
== error_mark_node
)
4862 return error_mark_node
;
4863 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4867 /* Report invalid types. */
4869 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4872 if (code
== PREINCREMENT_EXPR
)
4873 errstring
= _("no pre-increment operator for type");
4874 else if (code
== POSTINCREMENT_EXPR
)
4875 errstring
= _("no post-increment operator for type");
4876 else if (code
== PREDECREMENT_EXPR
)
4877 errstring
= _("no pre-decrement operator for type");
4879 errstring
= _("no post-decrement operator for type");
4882 else if (arg
== error_mark_node
)
4883 return error_mark_node
;
4885 /* Report something read-only. */
4887 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4888 || TREE_READONLY (arg
))
4890 if (complain
& tf_error
)
4891 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4892 || code
== POSTINCREMENT_EXPR
)
4893 ? REK_INCREMENT
: REK_DECREMENT
));
4895 return error_mark_node
;
4900 tree declared_type
= unlowered_expr_type (arg
);
4902 argtype
= TREE_TYPE (arg
);
4904 /* ARM $5.2.5 last annotation says this should be forbidden. */
4905 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4907 if (complain
& tf_error
)
4908 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4909 ? G_("ISO C++ forbids incrementing an enum")
4910 : G_("ISO C++ forbids decrementing an enum"));
4912 return error_mark_node
;
4915 /* Compute the increment. */
4917 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4919 tree type
= complete_type (TREE_TYPE (argtype
));
4921 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4923 if (complain
& tf_error
)
4924 error (((code
== PREINCREMENT_EXPR
4925 || code
== POSTINCREMENT_EXPR
))
4926 ? G_("cannot increment a pointer to incomplete type %qT")
4927 : G_("cannot decrement a pointer to incomplete type %qT"),
4928 TREE_TYPE (argtype
));
4930 return error_mark_node
;
4932 else if ((pedantic
|| warn_pointer_arith
)
4933 && !TYPE_PTROB_P (argtype
))
4935 if (complain
& tf_error
)
4936 permerror (input_location
, (code
== PREINCREMENT_EXPR
4937 || code
== POSTINCREMENT_EXPR
)
4938 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4939 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4942 return error_mark_node
;
4945 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4948 inc
= integer_one_node
;
4950 inc
= cp_convert (argtype
, inc
);
4952 /* Complain about anything else that is not a true lvalue. */
4953 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4954 || code
== POSTINCREMENT_EXPR
)
4955 ? lv_increment
: lv_decrement
),
4957 return error_mark_node
;
4959 /* Forbid using -- on `bool'. */
4960 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4962 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4964 if (complain
& tf_error
)
4965 error ("invalid use of Boolean expression as operand "
4966 "to %<operator--%>");
4967 return error_mark_node
;
4969 val
= boolean_increment (code
, arg
);
4972 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4974 TREE_SIDE_EFFECTS (val
) = 1;
4979 /* Note that this operation never does default_conversion
4980 regardless of NOCONVERT. */
4982 argtype
= lvalue_type (arg
);
4984 arg
= mark_lvalue_use (arg
);
4986 if (TREE_CODE (arg
) == OFFSET_REF
)
4989 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4991 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4992 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4995 else if (pedantic
&& DECL_MAIN_P (arg
))
4998 /* Apparently a lot of autoconf scripts for C++ packages do this,
4999 so only complain if -pedantic. */
5000 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5001 pedwarn (input_location
, OPT_pedantic
,
5002 "ISO C++ forbids taking address of function %<::main%>");
5003 else if (flag_pedantic_errors
)
5004 return error_mark_node
;
5007 /* Let &* cancel out to simplify resulting code. */
5008 if (TREE_CODE (arg
) == INDIRECT_REF
)
5010 /* We don't need to have `current_class_ptr' wrapped in a
5011 NON_LVALUE_EXPR node. */
5012 if (arg
== current_class_ref
)
5013 return current_class_ptr
;
5015 arg
= TREE_OPERAND (arg
, 0);
5016 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5018 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5019 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5022 /* Don't let this be an lvalue. */
5027 /* Uninstantiated types are all functions. Taking the
5028 address of a function is a no-op, so just return the
5031 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
5032 || !IDENTIFIER_OPNAME_P (arg
));
5034 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5035 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5037 /* They're trying to take the address of a unique non-static
5038 member function. This is ill-formed (except in MS-land),
5039 but let's try to DTRT.
5040 Note: We only handle unique functions here because we don't
5041 want to complain if there's a static overload; non-unique
5042 cases will be handled by instantiate_type. But we need to
5043 handle this case here to allow casts on the resulting PMF.
5044 We could defer this in non-MS mode, but it's easier to give
5045 a useful error here. */
5047 /* Inside constant member functions, the `this' pointer
5048 contains an extra const qualifier. TYPE_MAIN_VARIANT
5049 is used here to remove this const from the diagnostics
5050 and the created OFFSET_REF. */
5051 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5052 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5055 if (! flag_ms_extensions
)
5057 tree name
= DECL_NAME (fn
);
5058 if (!(complain
& tf_error
))
5059 return error_mark_node
;
5060 else if (current_class_type
5061 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5062 /* An expression like &memfn. */
5063 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5064 " or parenthesized non-static member function to form"
5065 " a pointer to member function. Say %<&%T::%D%>",
5068 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5069 " function to form a pointer to member function."
5073 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5077 if (type_unknown_p (arg
))
5078 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5080 /* Handle complex lvalues (when permitted)
5081 by reduction to simpler cases. */
5082 val
= unary_complex_lvalue (code
, arg
);
5086 switch (TREE_CODE (arg
))
5090 case FIX_TRUNC_EXPR
:
5091 /* Even if we're not being pedantic, we cannot allow this
5092 extension when we're instantiating in a SFINAE
5094 if (! lvalue_p (arg
) && complain
== tf_none
)
5096 if (complain
& tf_error
)
5097 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5099 return error_mark_node
;
5104 arg
= BASELINK_FUNCTIONS (arg
);
5108 arg
= OVL_CURRENT (arg
);
5112 /* Turn a reference to a non-static data member into a
5113 pointer-to-member. */
5118 if (!PTRMEM_OK_P (arg
))
5119 return cp_build_unary_op (code
, arg
, 0, complain
);
5121 t
= TREE_OPERAND (arg
, 1);
5122 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5124 if (complain
& tf_error
)
5125 error ("cannot create pointer to reference member %qD", t
);
5126 return error_mark_node
;
5129 type
= build_ptrmem_type (context_for_name_lookup (t
),
5131 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5139 /* Anything not already handled and not a true memory reference
5141 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5142 && TREE_CODE (argtype
) != METHOD_TYPE
5143 && TREE_CODE (arg
) != OFFSET_REF
5144 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5145 return error_mark_node
;
5147 if (argtype
!= error_mark_node
)
5148 argtype
= build_pointer_type (argtype
);
5150 /* In a template, we are processing a non-dependent expression
5151 so we can just form an ADDR_EXPR with the correct type. */
5152 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5154 val
= build_address (arg
);
5155 if (TREE_CODE (arg
) == OFFSET_REF
)
5156 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5158 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5160 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5162 /* We can only get here with a single static member
5164 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5165 && DECL_STATIC_FUNCTION_P (fn
));
5167 val
= build_address (fn
);
5168 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5169 /* Do not lose object's side effects. */
5170 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5171 TREE_OPERAND (arg
, 0), val
);
5173 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5175 if (complain
& tf_error
)
5176 error ("attempt to take address of bit-field structure member %qD",
5177 TREE_OPERAND (arg
, 1));
5178 return error_mark_node
;
5182 tree object
= TREE_OPERAND (arg
, 0);
5183 tree field
= TREE_OPERAND (arg
, 1);
5184 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5185 (TREE_TYPE (object
), decl_type_context (field
)));
5186 val
= build_address (arg
);
5189 if (TREE_CODE (argtype
) == POINTER_TYPE
5190 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5192 build_ptrmemfunc_type (argtype
);
5193 val
= build_ptrmemfunc (argtype
, val
, 0,
5194 /*c_cast_p=*/false);
5206 argtype
= TREE_TYPE (arg
);
5207 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5210 if (complain
& tf_error
)
5211 error ("%s", errstring
);
5212 return error_mark_node
;
5215 /* Hook for the c-common bits that build a unary op. */
5217 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5218 enum tree_code code
, tree xarg
, int noconvert
)
5220 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5223 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5224 for certain kinds of expressions which are not really lvalues
5225 but which we can accept as lvalues.
5227 If ARG is not a kind of expression we can handle, return
5231 unary_complex_lvalue (enum tree_code code
, tree arg
)
5233 /* Inside a template, making these kinds of adjustments is
5234 pointless; we are only concerned with the type of the
5236 if (processing_template_decl
)
5239 /* Handle (a, b) used as an "lvalue". */
5240 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5242 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5243 tf_warning_or_error
);
5244 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5245 TREE_OPERAND (arg
, 0), real_result
);
5248 /* Handle (a ? b : c) used as an "lvalue". */
5249 if (TREE_CODE (arg
) == COND_EXPR
5250 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5251 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5253 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5254 if (TREE_CODE (arg
) == MODIFY_EXPR
5255 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5256 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5258 tree lvalue
= TREE_OPERAND (arg
, 0);
5259 if (TREE_SIDE_EFFECTS (lvalue
))
5261 lvalue
= stabilize_reference (lvalue
);
5262 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5263 lvalue
, TREE_OPERAND (arg
, 1));
5265 return unary_complex_lvalue
5266 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5269 if (code
!= ADDR_EXPR
)
5272 /* Handle (a = b) used as an "lvalue" for `&'. */
5273 if (TREE_CODE (arg
) == MODIFY_EXPR
5274 || TREE_CODE (arg
) == INIT_EXPR
)
5276 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5277 tf_warning_or_error
);
5278 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5280 TREE_NO_WARNING (arg
) = 1;
5284 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5285 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5286 || TREE_CODE (arg
) == OFFSET_REF
)
5289 /* We permit compiler to make function calls returning
5290 objects of aggregate type look like lvalues. */
5294 if (TREE_CODE (targ
) == SAVE_EXPR
)
5295 targ
= TREE_OPERAND (targ
, 0);
5297 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5299 if (TREE_CODE (arg
) == SAVE_EXPR
)
5302 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5303 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5306 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5307 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5308 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5311 /* Don't let anything else be handled specially. */
5315 /* Mark EXP saying that we need to be able to take the
5316 address of it; it should not be allocated in a register.
5317 Value is true if successful.
5319 C++: we do not allow `current_class_ptr' to be addressable. */
5322 cxx_mark_addressable (tree exp
)
5327 switch (TREE_CODE (x
))
5334 x
= TREE_OPERAND (x
, 0);
5338 if (x
== current_class_ptr
)
5340 error ("cannot take the address of %<this%>, which is an rvalue expression");
5341 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5347 /* Caller should not be trying to mark initialized
5348 constant fields addressable. */
5349 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5350 || DECL_IN_AGGR_P (x
) == 0
5352 || DECL_EXTERNAL (x
));
5357 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5358 && !DECL_ARTIFICIAL (x
))
5360 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5363 ("address of explicit register variable %qD requested", x
);
5366 else if (extra_warnings
)
5368 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5370 TREE_ADDRESSABLE (x
) = 1;
5374 TREE_ADDRESSABLE (x
) = 1;
5378 TREE_ADDRESSABLE (x
) = 1;
5382 TREE_ADDRESSABLE (x
) = 1;
5383 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5391 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5394 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5395 tsubst_flags_t complain
)
5397 tree orig_ifexp
= ifexp
;
5398 tree orig_op1
= op1
;
5399 tree orig_op2
= op2
;
5402 if (processing_template_decl
)
5404 /* The standard says that the expression is type-dependent if
5405 IFEXP is type-dependent, even though the eventual type of the
5406 expression doesn't dependent on IFEXP. */
5407 if (type_dependent_expression_p (ifexp
)
5408 /* As a GNU extension, the middle operand may be omitted. */
5409 || (op1
&& type_dependent_expression_p (op1
))
5410 || type_dependent_expression_p (op2
))
5411 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5412 ifexp
= build_non_dependent_expr (ifexp
);
5414 op1
= build_non_dependent_expr (op1
);
5415 op2
= build_non_dependent_expr (op2
);
5418 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5419 if (processing_template_decl
&& expr
!= error_mark_node
)
5420 return build_min_non_dep (COND_EXPR
, expr
,
5421 orig_ifexp
, orig_op1
, orig_op2
);
5425 /* Given a list of expressions, return a compound expression
5426 that performs them all and returns the value of the last of them. */
5428 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5430 tree expr
= TREE_VALUE (list
);
5432 if (TREE_CHAIN (list
))
5435 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5437 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5438 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5439 tf_warning_or_error
);
5445 /* Like build_x_compound_expr_from_list, but using a VEC. */
5448 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5450 if (VEC_empty (tree
, vec
))
5452 else if (VEC_length (tree
, vec
) == 1)
5453 return VEC_index (tree
, vec
, 0);
5461 permerror (input_location
,
5462 "%s expression list treated as compound expression",
5465 expr
= VEC_index (tree
, vec
, 0);
5466 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5467 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5473 /* Handle overloading of the ',' operator when needed. */
5476 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5479 tree orig_op1
= op1
;
5480 tree orig_op2
= op2
;
5482 if (processing_template_decl
)
5484 if (type_dependent_expression_p (op1
)
5485 || type_dependent_expression_p (op2
))
5486 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5487 op1
= build_non_dependent_expr (op1
);
5488 op2
= build_non_dependent_expr (op2
);
5491 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5492 /*overloaded_p=*/NULL
, complain
);
5494 result
= cp_build_compound_expr (op1
, op2
, complain
);
5496 if (processing_template_decl
&& result
!= error_mark_node
)
5497 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5502 /* Like cp_build_compound_expr, but for the c-common bits. */
5505 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5507 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5510 /* Build a compound expression. */
5513 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5515 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5517 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5518 return error_mark_node
;
5520 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5522 /* If the rhs is a TARGET_EXPR, then build the compound
5523 expression inside the target_expr's initializer. This
5524 helps the compiler to eliminate unnecessary temporaries. */
5525 tree init
= TREE_OPERAND (rhs
, 1);
5527 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5528 TREE_OPERAND (rhs
, 1) = init
;
5533 if (type_unknown_p (rhs
))
5535 error ("no context to resolve type of %qE", rhs
);
5536 return error_mark_node
;
5539 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5542 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5543 casts away constness. CAST gives the type of cast.
5545 ??? This function warns for casting away any qualifier not just
5546 const. We would like to specify exactly what qualifiers are casted
5551 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5552 enum tree_code cast
)
5554 /* C-style casts are allowed to cast away constness. With
5555 WARN_CAST_QUAL, we still want to issue a warning. */
5556 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5559 if (!casts_away_constness (src_type
, dest_type
))
5565 warning (OPT_Wcast_qual
,
5566 "cast from type %qT to type %qT casts away qualifiers",
5567 src_type
, dest_type
);
5570 case STATIC_CAST_EXPR
:
5571 error ("static_cast from type %qT to type %qT casts away qualifiers",
5572 src_type
, dest_type
);
5575 case REINTERPRET_CAST_EXPR
:
5576 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5577 src_type
, dest_type
);
5584 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5585 (another pointer-to-member type in the same hierarchy) and return
5586 the converted expression. If ALLOW_INVERSE_P is permitted, a
5587 pointer-to-derived may be converted to pointer-to-base; otherwise,
5588 only the other direction is permitted. If C_CAST_P is true, this
5589 conversion is taking place as part of a C-style cast. */
5592 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5595 if (TYPE_PTRMEM_P (type
))
5599 if (TREE_CODE (expr
) == PTRMEM_CST
)
5600 expr
= cplus_expand_constant (expr
);
5601 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5602 TYPE_PTRMEM_CLASS_TYPE (type
),
5605 if (!integer_zerop (delta
))
5607 tree cond
, op1
, op2
;
5609 cond
= cp_build_binary_op (input_location
,
5612 build_int_cst (TREE_TYPE (expr
), -1),
5613 tf_warning_or_error
);
5614 op1
= build_nop (ptrdiff_type_node
, expr
);
5615 op2
= cp_build_binary_op (input_location
,
5616 PLUS_EXPR
, op1
, delta
,
5617 tf_warning_or_error
);
5619 expr
= fold_build3_loc (input_location
,
5620 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5624 return build_nop (type
, expr
);
5627 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5628 allow_inverse_p
, c_cast_p
);
5631 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5632 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5633 Otherwise, return EXPR unchanged. */
5636 ignore_overflows (tree expr
, tree orig
)
5638 if (TREE_CODE (expr
) == INTEGER_CST
5639 && CONSTANT_CLASS_P (orig
)
5640 && TREE_CODE (orig
) != STRING_CST
5641 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5643 if (!TREE_OVERFLOW (orig
))
5644 /* Ensure constant sharing. */
5645 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5646 TREE_INT_CST_LOW (expr
),
5647 TREE_INT_CST_HIGH (expr
));
5650 /* Avoid clobbering a shared constant. */
5651 expr
= copy_node (expr
);
5652 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5658 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5659 this static_cast is being attempted as one of the possible casts
5660 allowed by a C-style cast. (In that case, accessibility of base
5661 classes is not considered, and it is OK to cast away
5662 constness.) Return the result of the cast. *VALID_P is set to
5663 indicate whether or not the cast was valid. */
5666 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5667 bool *valid_p
, tsubst_flags_t complain
)
5673 /* Assume the cast is valid. */
5676 intype
= TREE_TYPE (expr
);
5678 /* Save casted types in the function's used types hash table. */
5679 used_types_insert (type
);
5681 /* [expr.static.cast]
5683 An lvalue of type "cv1 B", where B is a class type, can be cast
5684 to type "reference to cv2 D", where D is a class derived (clause
5685 _class.derived_) from B, if a valid standard conversion from
5686 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5687 same cv-qualification as, or greater cv-qualification than, cv1,
5688 and B is not a virtual base class of D. */
5689 /* We check this case before checking the validity of "TYPE t =
5690 EXPR;" below because for this case:
5693 struct D : public B { D(const B&); };
5695 void f() { static_cast<const D&>(b); }
5697 we want to avoid constructing a new D. The standard is not
5698 completely clear about this issue, but our interpretation is
5699 consistent with other compilers. */
5700 if (TREE_CODE (type
) == REFERENCE_TYPE
5701 && CLASS_TYPE_P (TREE_TYPE (type
))
5702 && CLASS_TYPE_P (intype
)
5703 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5704 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5705 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5706 build_pointer_type (TYPE_MAIN_VARIANT
5707 (TREE_TYPE (type
))))
5709 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5713 /* There is a standard conversion from "D*" to "B*" even if "B"
5714 is ambiguous or inaccessible. If this is really a
5715 static_cast, then we check both for inaccessibility and
5716 ambiguity. However, if this is a static_cast being performed
5717 because the user wrote a C-style cast, then accessibility is
5719 base
= lookup_base (TREE_TYPE (type
), intype
,
5720 c_cast_p
? ba_unique
: ba_check
,
5723 /* Convert from "B*" to "D*". This function will check that "B"
5724 is not a virtual base of "D". */
5725 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5726 base
, /*nonnull=*/false);
5727 /* Convert the pointer to a reference -- but then remember that
5728 there are no expressions with reference type in C++. */
5729 return convert_from_reference (cp_fold_convert (type
, expr
));
5732 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5733 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5734 if (TREE_CODE (type
) == REFERENCE_TYPE
5735 && TYPE_REF_IS_RVALUE (type
)
5736 && real_lvalue_p (expr
)
5737 && reference_related_p (TREE_TYPE (type
), intype
)
5738 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5740 expr
= build_typed_address (expr
, type
);
5741 return convert_from_reference (expr
);
5746 /* Resolve overloaded address here rather than once in
5747 implicit_conversion and again in the inverse code below. */
5748 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5750 expr
= instantiate_type (type
, expr
, complain
);
5751 intype
= TREE_TYPE (expr
);
5754 /* [expr.static.cast]
5756 An expression e can be explicitly converted to a type T using a
5757 static_cast of the form static_cast<T>(e) if the declaration T
5758 t(e);" is well-formed, for some invented temporary variable
5760 result
= perform_direct_initialization_if_possible (type
, expr
,
5761 c_cast_p
, complain
);
5764 result
= convert_from_reference (result
);
5766 /* Ignore any integer overflow caused by the cast. */
5767 result
= ignore_overflows (result
, orig
);
5769 /* [expr.static.cast]
5771 If T is a reference type, the result is an lvalue; otherwise,
5772 the result is an rvalue. */
5773 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5774 result
= rvalue (result
);
5778 /* [expr.static.cast]
5780 Any expression can be explicitly converted to type cv void. */
5781 if (TREE_CODE (type
) == VOID_TYPE
)
5782 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5784 /* [expr.static.cast]
5786 The inverse of any standard conversion sequence (clause _conv_),
5787 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5788 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5789 (_conv.bool_) conversions, can be performed explicitly using
5790 static_cast subject to the restriction that the explicit
5791 conversion does not cast away constness (_expr.const.cast_), and
5792 the following additional rules for specific cases: */
5793 /* For reference, the conversions not excluded are: integral
5794 promotions, floating point promotion, integral conversions,
5795 floating point conversions, floating-integral conversions,
5796 pointer conversions, and pointer to member conversions. */
5799 A value of integral _or enumeration_ type can be explicitly
5800 converted to an enumeration type. */
5801 /* The effect of all that is that any conversion between any two
5802 types which are integral, floating, or enumeration types can be
5804 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5805 || SCALAR_FLOAT_TYPE_P (type
))
5806 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5807 || SCALAR_FLOAT_TYPE_P (intype
)))
5809 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5811 /* Ignore any integer overflow caused by the cast. */
5812 expr
= ignore_overflows (expr
, orig
);
5816 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5817 && CLASS_TYPE_P (TREE_TYPE (type
))
5818 && CLASS_TYPE_P (TREE_TYPE (intype
))
5819 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5820 (TREE_TYPE (intype
))),
5821 build_pointer_type (TYPE_MAIN_VARIANT
5822 (TREE_TYPE (type
)))))
5827 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5828 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5829 c_cast_p
? ba_unique
: ba_check
,
5831 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5834 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5835 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5842 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5843 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5845 if (TYPE_PTRMEM_P (type
))
5847 t1
= (build_ptrmem_type
5849 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5850 t2
= (build_ptrmem_type
5852 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5859 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5862 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5863 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5868 /* [expr.static.cast]
5870 An rvalue of type "pointer to cv void" can be explicitly
5871 converted to a pointer to object type. A value of type pointer
5872 to object converted to "pointer to cv void" and back to the
5873 original pointer type will have its original value. */
5874 if (TREE_CODE (intype
) == POINTER_TYPE
5875 && VOID_TYPE_P (TREE_TYPE (intype
))
5876 && TYPE_PTROB_P (type
))
5879 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5880 return build_nop (type
, expr
);
5884 return error_mark_node
;
5887 /* Return an expression representing static_cast<TYPE>(EXPR). */
5890 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5895 if (type
== error_mark_node
|| expr
== error_mark_node
)
5896 return error_mark_node
;
5898 if (processing_template_decl
)
5900 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5901 /* We don't know if it will or will not have side effects. */
5902 TREE_SIDE_EFFECTS (expr
) = 1;
5903 return convert_from_reference (expr
);
5906 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5907 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5908 if (TREE_CODE (type
) != REFERENCE_TYPE
5909 && TREE_CODE (expr
) == NOP_EXPR
5910 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5911 expr
= TREE_OPERAND (expr
, 0);
5913 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5918 if (complain
& tf_error
)
5919 error ("invalid static_cast from type %qT to type %qT",
5920 TREE_TYPE (expr
), type
);
5921 return error_mark_node
;
5924 /* EXPR is an expression with member function or pointer-to-member
5925 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5926 not permitted by ISO C++, but we accept it in some modes. If we
5927 are not in one of those modes, issue a diagnostic. Return the
5928 converted expression. */
5931 convert_member_func_to_ptr (tree type
, tree expr
)
5936 intype
= TREE_TYPE (expr
);
5937 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5938 || TREE_CODE (intype
) == METHOD_TYPE
);
5940 if (pedantic
|| warn_pmf2ptr
)
5941 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5942 "converting from %qT to %qT", intype
, type
);
5944 if (TREE_CODE (intype
) == METHOD_TYPE
)
5945 expr
= build_addr_func (expr
);
5946 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5947 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5950 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5951 decl
= build_address (decl
);
5952 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5955 return build_nop (type
, expr
);
5958 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5959 If C_CAST_P is true, this reinterpret cast is being done as part of
5960 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5961 indicate whether or not reinterpret_cast was valid. */
5964 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5965 bool *valid_p
, tsubst_flags_t complain
)
5969 /* Assume the cast is invalid. */
5973 if (type
== error_mark_node
|| error_operand_p (expr
))
5974 return error_mark_node
;
5976 intype
= TREE_TYPE (expr
);
5978 /* Save casted types in the function's used types hash table. */
5979 used_types_insert (type
);
5981 /* [expr.reinterpret.cast]
5982 An lvalue expression of type T1 can be cast to the type
5983 "reference to T2" if an expression of type "pointer to T1" can be
5984 explicitly converted to the type "pointer to T2" using a
5985 reinterpret_cast. */
5986 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5988 if (! real_lvalue_p (expr
))
5990 if (complain
& tf_error
)
5991 error ("invalid cast of an rvalue expression of type "
5994 return error_mark_node
;
5997 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5998 "B" are related class types; the reinterpret_cast does not
5999 adjust the pointer. */
6000 if (TYPE_PTR_P (intype
)
6001 && (complain
& tf_warning
)
6002 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6003 COMPARE_BASE
| COMPARE_DERIVED
)))
6004 warning (0, "casting %qT to %qT does not dereference pointer",
6007 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
6009 if (warn_strict_aliasing
> 2)
6010 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6012 if (expr
!= error_mark_node
)
6013 expr
= build_reinterpret_cast_1
6014 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6016 if (expr
!= error_mark_node
)
6017 /* cp_build_indirect_ref isn't right for rvalue refs. */
6018 expr
= convert_from_reference (fold_convert (type
, expr
));
6022 /* As a G++ extension, we consider conversions from member
6023 functions, and pointers to member functions to
6024 pointer-to-function and pointer-to-void types. If
6025 -Wno-pmf-conversions has not been specified,
6026 convert_member_func_to_ptr will issue an error message. */
6027 if ((TYPE_PTRMEMFUNC_P (intype
)
6028 || TREE_CODE (intype
) == METHOD_TYPE
)
6029 && TYPE_PTR_P (type
)
6030 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6031 || VOID_TYPE_P (TREE_TYPE (type
))))
6032 return convert_member_func_to_ptr (type
, expr
);
6034 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6035 array-to-pointer, and function-to-pointer conversions are
6037 expr
= decay_conversion (expr
);
6039 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6040 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6041 if (TREE_CODE (expr
) == NOP_EXPR
6042 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6043 expr
= TREE_OPERAND (expr
, 0);
6045 if (error_operand_p (expr
))
6046 return error_mark_node
;
6048 intype
= TREE_TYPE (expr
);
6050 /* [expr.reinterpret.cast]
6051 A pointer can be converted to any integral type large enough to
6052 hold it. ... A value of type std::nullptr_t can be converted to
6053 an integral type; the conversion has the same meaning and
6054 validity as a conversion of (void*)0 to the integral type. */
6055 if (CP_INTEGRAL_TYPE_P (type
)
6056 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6058 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6060 if (complain
& tf_error
)
6061 permerror (input_location
, "cast from %qT to %qT loses precision",
6064 return error_mark_node
;
6066 if (NULLPTR_TYPE_P (intype
))
6067 return build_int_cst (type
, 0);
6069 /* [expr.reinterpret.cast]
6070 A value of integral or enumeration type can be explicitly
6071 converted to a pointer. */
6072 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6075 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6076 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6077 return fold_if_not_in_template (build_nop (type
, expr
));
6078 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6079 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6084 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6085 /* Warn about possible alignment problems. */
6086 if (STRICT_ALIGNMENT
&& warn_cast_align
6087 && (complain
& tf_warning
)
6088 && !VOID_TYPE_P (type
)
6089 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6090 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6091 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6092 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6093 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6094 "increases required alignment of target type", intype
, type
);
6096 /* We need to strip nops here, because the front end likes to
6097 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6099 if (warn_strict_aliasing
<= 2)
6100 strict_aliasing_warning (intype
, type
, sexpr
);
6102 return fold_if_not_in_template (build_nop (type
, expr
));
6104 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6105 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6107 if (pedantic
&& (complain
& tf_warning
))
6108 /* Only issue a warning, as we have always supported this
6109 where possible, and it is necessary in some cases. DR 195
6110 addresses this issue, but as of 2004/10/26 is still in
6112 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6113 return fold_if_not_in_template (build_nop (type
, expr
));
6115 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6116 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6117 else if (TREE_CODE (intype
) == VECTOR_TYPE
6118 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6119 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6124 if (complain
& tf_error
)
6125 error ("invalid cast from type %qT to type %qT", intype
, type
);
6126 return error_mark_node
;
6129 return cp_convert (type
, expr
);
6133 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6135 if (type
== error_mark_node
|| expr
== error_mark_node
)
6136 return error_mark_node
;
6138 if (processing_template_decl
)
6140 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6142 if (!TREE_SIDE_EFFECTS (t
)
6143 && type_dependent_expression_p (expr
))
6144 /* There might turn out to be side effects inside expr. */
6145 TREE_SIDE_EFFECTS (t
) = 1;
6146 return convert_from_reference (t
);
6149 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6150 /*valid_p=*/NULL
, complain
);
6153 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6154 return an appropriate expression. Otherwise, return
6155 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6156 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6157 performing a C-style cast, its value upon return will indicate
6158 whether or not the conversion succeeded. */
6161 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6165 tree reference_type
;
6167 /* Callers are responsible for handling error_mark_node as a
6168 destination type. */
6169 gcc_assert (dst_type
!= error_mark_node
);
6170 /* In a template, callers should be building syntactic
6171 representations of casts, not using this machinery. */
6172 gcc_assert (!processing_template_decl
);
6174 /* Assume the conversion is invalid. */
6178 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6181 error ("invalid use of const_cast with type %qT, "
6182 "which is not a pointer, "
6183 "reference, nor a pointer-to-data-member type", dst_type
);
6184 return error_mark_node
;
6187 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6190 error ("invalid use of const_cast with type %qT, which is a pointer "
6191 "or reference to a function type", dst_type
);
6192 return error_mark_node
;
6195 /* Save casted types in the function's used types hash table. */
6196 used_types_insert (dst_type
);
6198 src_type
= TREE_TYPE (expr
);
6199 /* Expressions do not really have reference types. */
6200 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6201 src_type
= TREE_TYPE (src_type
);
6203 /* [expr.const.cast]
6205 An lvalue of type T1 can be explicitly converted to an lvalue of
6206 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6207 types) if a pointer to T1 can be explicitly converted to the type
6208 pointer to T2 using a const_cast. */
6209 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6211 reference_type
= dst_type
;
6212 if (! real_lvalue_p (expr
))
6215 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6216 src_type
, dst_type
);
6217 return error_mark_node
;
6219 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6220 src_type
= build_pointer_type (src_type
);
6224 reference_type
= NULL_TREE
;
6225 /* If the destination type is not a reference type, the
6226 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6227 conversions are performed. */
6228 src_type
= type_decays_to (src_type
);
6229 if (src_type
== error_mark_node
)
6230 return error_mark_node
;
6233 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6234 && comp_ptr_ttypes_const (dst_type
, src_type
))
6239 /* This cast is actually a C-style cast. Issue a warning if
6240 the user is making a potentially unsafe cast. */
6241 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6245 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6246 complain
? tf_warning_or_error
: tf_none
);
6247 expr
= build_nop (reference_type
, expr
);
6248 return convert_from_reference (expr
);
6252 expr
= decay_conversion (expr
);
6253 /* build_c_cast puts on a NOP_EXPR to make the result not an
6254 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6255 non-lvalue context. */
6256 if (TREE_CODE (expr
) == NOP_EXPR
6257 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6258 expr
= TREE_OPERAND (expr
, 0);
6259 return build_nop (dst_type
, expr
);
6264 error ("invalid const_cast from type %qT to type %qT",
6265 src_type
, dst_type
);
6266 return error_mark_node
;
6270 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6272 if (type
== error_mark_node
|| error_operand_p (expr
))
6273 return error_mark_node
;
6275 if (processing_template_decl
)
6277 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6279 if (!TREE_SIDE_EFFECTS (t
)
6280 && type_dependent_expression_p (expr
))
6281 /* There might turn out to be side effects inside expr. */
6282 TREE_SIDE_EFFECTS (t
) = 1;
6283 return convert_from_reference (t
);
6286 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6290 /* Like cp_build_c_cast, but for the c-common bits. */
6293 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6295 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6298 /* Build an expression representing an explicit C-style cast to type
6299 TYPE of expression EXPR. */
6302 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6308 if (type
== error_mark_node
|| error_operand_p (expr
))
6309 return error_mark_node
;
6311 if (processing_template_decl
)
6313 tree t
= build_min (CAST_EXPR
, type
,
6314 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6315 /* We don't know if it will or will not have side effects. */
6316 TREE_SIDE_EFFECTS (t
) = 1;
6317 return convert_from_reference (t
);
6320 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6321 'Class') should always be retained, because this information aids
6322 in method lookup. */
6323 if (objc_is_object_ptr (type
)
6324 && objc_is_object_ptr (TREE_TYPE (expr
)))
6325 return build_nop (type
, expr
);
6327 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6328 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6329 if (TREE_CODE (type
) != REFERENCE_TYPE
6330 && TREE_CODE (value
) == NOP_EXPR
6331 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6332 value
= TREE_OPERAND (value
, 0);
6334 if (TREE_CODE (type
) == ARRAY_TYPE
)
6336 /* Allow casting from T1* to T2[] because Cfront allows it.
6337 NIHCL uses it. It is not valid ISO C++ however. */
6338 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6340 if (complain
& tf_error
)
6341 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6343 return error_mark_node
;
6344 type
= build_pointer_type (TREE_TYPE (type
));
6348 if (complain
& tf_error
)
6349 error ("ISO C++ forbids casting to an array type %qT", type
);
6350 return error_mark_node
;
6354 if (TREE_CODE (type
) == FUNCTION_TYPE
6355 || TREE_CODE (type
) == METHOD_TYPE
)
6357 if (complain
& tf_error
)
6358 error ("invalid cast to function type %qT", type
);
6359 return error_mark_node
;
6362 if (TREE_CODE (type
) == POINTER_TYPE
6363 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6364 /* Casting to an integer of smaller size is an error detected elsewhere. */
6365 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6366 /* Don't warn about converting any constant. */
6367 && !TREE_CONSTANT (value
))
6368 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6369 "cast to pointer from integer of different size");
6371 /* A C-style cast can be a const_cast. */
6372 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6377 /* Or a static cast. */
6378 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6379 &valid_p
, complain
);
6380 /* Or a reinterpret_cast. */
6382 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6383 &valid_p
, complain
);
6384 /* The static_cast or reinterpret_cast may be followed by a
6387 /* A valid cast may result in errors if, for example, a
6388 conversion to am ambiguous base class is required. */
6389 && !error_operand_p (result
))
6393 /* Non-class rvalues always have cv-unqualified type. */
6394 if (!CLASS_TYPE_P (type
))
6395 type
= TYPE_MAIN_VARIANT (type
);
6396 result_type
= TREE_TYPE (result
);
6397 if (!CLASS_TYPE_P (result_type
))
6398 result_type
= TYPE_MAIN_VARIANT (result_type
);
6399 /* If the type of RESULT does not match TYPE, perform a
6400 const_cast to make it match. If the static_cast or
6401 reinterpret_cast succeeded, we will differ by at most
6402 cv-qualification, so the follow-on const_cast is guaranteed
6404 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6406 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6407 gcc_assert (valid_p
);
6412 return error_mark_node
;
6415 /* For use from the C common bits. */
6417 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6418 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6419 enum tree_code modifycode
,
6420 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6421 tree rhs_origtype ATTRIBUTE_UNUSED
)
6423 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6426 /* Build an assignment expression of lvalue LHS from value RHS.
6427 MODIFYCODE is the code for a binary operator that we use
6428 to combine the old value of LHS with RHS to get the new value.
6429 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6431 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6434 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6435 tsubst_flags_t complain
)
6439 tree lhstype
= TREE_TYPE (lhs
);
6440 tree olhstype
= lhstype
;
6441 bool plain_assign
= (modifycode
== NOP_EXPR
);
6443 /* Avoid duplicate error messages from operands that had errors. */
6444 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6445 return error_mark_node
;
6447 /* Handle control structure constructs used as "lvalues". */
6448 switch (TREE_CODE (lhs
))
6450 /* Handle --foo = 5; as these are valid constructs in C++. */
6451 case PREDECREMENT_EXPR
:
6452 case PREINCREMENT_EXPR
:
6453 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6454 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6455 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6456 TREE_OPERAND (lhs
, 1));
6457 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6458 modifycode
, rhs
, complain
);
6459 if (newrhs
== error_mark_node
)
6460 return error_mark_node
;
6461 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6463 /* Handle (a, b) used as an "lvalue". */
6465 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6466 modifycode
, rhs
, complain
);
6467 if (newrhs
== error_mark_node
)
6468 return error_mark_node
;
6469 return build2 (COMPOUND_EXPR
, lhstype
,
6470 TREE_OPERAND (lhs
, 0), newrhs
);
6473 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6474 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6475 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6476 TREE_OPERAND (lhs
, 1));
6477 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6479 if (newrhs
== error_mark_node
)
6480 return error_mark_node
;
6481 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6485 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6486 when neither operand has side-effects. */
6487 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6488 return error_mark_node
;
6490 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6491 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6493 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6494 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6496 TREE_OPERAND (lhs
, 0),
6497 TREE_OPERAND (lhs
, 1)),
6498 TREE_OPERAND (lhs
, 0),
6499 TREE_OPERAND (lhs
, 1));
6502 /* Handle (a ? b : c) used as an "lvalue". */
6505 /* Produce (a ? (b = rhs) : (c = rhs))
6506 except that the RHS goes through a save-expr
6507 so the code to compute it is only emitted once. */
6509 tree preeval
= NULL_TREE
;
6511 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6513 if (complain
& tf_error
)
6514 error ("void value not ignored as it ought to be");
6515 return error_mark_node
;
6518 rhs
= stabilize_expr (rhs
, &preeval
);
6520 /* Check this here to avoid odd errors when trying to convert
6521 a throw to the type of the COND_EXPR. */
6522 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6523 return error_mark_node
;
6525 cond
= build_conditional_expr
6526 (TREE_OPERAND (lhs
, 0),
6527 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6528 modifycode
, rhs
, complain
),
6529 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6530 modifycode
, rhs
, complain
),
6533 if (cond
== error_mark_node
)
6535 /* Make sure the code to compute the rhs comes out
6536 before the split. */
6538 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6546 if (modifycode
== INIT_EXPR
)
6548 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6549 /* Do the default thing. */;
6550 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6552 /* Compound literal. */
6553 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6554 /* Call convert to generate an error; see PR 11063. */
6555 rhs
= convert (lhstype
, rhs
);
6556 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6557 TREE_SIDE_EFFECTS (result
) = 1;
6560 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6561 /* Do the default thing. */;
6564 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6565 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6566 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6568 release_tree_vector (rhs_vec
);
6569 if (result
== NULL_TREE
)
6570 return error_mark_node
;
6576 lhs
= require_complete_type (lhs
);
6577 if (lhs
== error_mark_node
)
6578 return error_mark_node
;
6580 if (modifycode
== NOP_EXPR
)
6582 /* `operator=' is not an inheritable operator. */
6583 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6584 /* Do the default thing. */;
6587 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6588 lhs
, rhs
, make_node (NOP_EXPR
),
6589 /*overloaded_p=*/NULL
,
6591 if (result
== NULL_TREE
)
6592 return error_mark_node
;
6599 /* A binary op has been requested. Combine the old LHS
6600 value with the RHS producing the value we should actually
6601 store into the LHS. */
6602 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6603 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6604 || MAYBE_CLASS_TYPE_P (lhstype
)));
6606 lhs
= stabilize_reference (lhs
);
6607 newrhs
= cp_build_binary_op (input_location
,
6608 modifycode
, lhs
, rhs
,
6610 if (newrhs
== error_mark_node
)
6612 if (complain
& tf_error
)
6613 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6614 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6615 return error_mark_node
;
6618 /* Now it looks like a plain assignment. */
6619 modifycode
= NOP_EXPR
;
6621 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6622 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6625 /* The left-hand side must be an lvalue. */
6626 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6627 return error_mark_node
;
6629 /* Warn about modifying something that is `const'. Don't warn if
6630 this is initialization. */
6631 if (modifycode
!= INIT_EXPR
6632 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6633 /* Functions are not modifiable, even though they are
6635 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6636 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6637 /* If it's an aggregate and any field is const, then it is
6638 effectively const. */
6639 || (CLASS_TYPE_P (lhstype
)
6640 && C_TYPE_FIELDS_READONLY (lhstype
))))
6642 if (complain
& tf_error
)
6643 readonly_error (lhs
, REK_ASSIGNMENT
);
6645 return error_mark_node
;
6648 /* If storing into a structure or union member, it may have been given a
6649 lowered bitfield type. We need to convert to the declared type first,
6650 so retrieve it now. */
6652 olhstype
= unlowered_expr_type (lhs
);
6654 /* Convert new value to destination type. */
6656 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6660 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6662 if (modifycode
!= INIT_EXPR
)
6664 if (complain
& tf_error
)
6665 error ("assigning to an array from an initializer list");
6666 return error_mark_node
;
6668 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6669 return error_mark_node
;
6670 newrhs
= digest_init (lhstype
, newrhs
);
6673 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6674 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6676 if (complain
& tf_error
)
6677 error ("incompatible types in assignment of %qT to %qT",
6678 TREE_TYPE (rhs
), lhstype
);
6679 return error_mark_node
;
6682 /* Allow array assignment in compiler-generated code. */
6683 else if (!current_function_decl
6684 || !DECL_ARTIFICIAL (current_function_decl
))
6686 /* This routine is used for both initialization and assignment.
6687 Make sure the diagnostic message differentiates the context. */
6688 if (complain
& tf_error
)
6690 if (modifycode
== INIT_EXPR
)
6691 error ("array used as initializer");
6693 error ("invalid array assignment");
6695 return error_mark_node
;
6698 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6699 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6700 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6701 /*explicit_value_init_p=*/false,
6702 from_array
, complain
);
6705 if (modifycode
== INIT_EXPR
)
6706 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6707 LOOKUP_ONLYCONVERTING. */
6708 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6709 "initialization", NULL_TREE
, 0,
6712 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6713 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6715 if (!same_type_p (lhstype
, olhstype
))
6716 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6718 if (modifycode
!= INIT_EXPR
)
6720 if (TREE_CODE (newrhs
) == CALL_EXPR
6721 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6722 newrhs
= build_cplus_new (lhstype
, newrhs
);
6724 /* Can't initialize directly from a TARGET_EXPR, since that would
6725 cause the lhs to be constructed twice, and possibly result in
6726 accidental self-initialization. So we force the TARGET_EXPR to be
6727 expanded without a target. */
6728 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6729 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6730 TREE_OPERAND (newrhs
, 0));
6733 if (newrhs
== error_mark_node
)
6734 return error_mark_node
;
6736 if (c_dialect_objc () && flag_objc_gc
)
6738 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6744 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6745 lhstype
, lhs
, newrhs
);
6747 TREE_SIDE_EFFECTS (result
) = 1;
6749 TREE_NO_WARNING (result
) = 1;
6755 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6756 tsubst_flags_t complain
)
6758 if (processing_template_decl
)
6759 return build_min_nt (MODOP_EXPR
, lhs
,
6760 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6762 if (modifycode
!= NOP_EXPR
)
6764 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6765 make_node (modifycode
),
6766 /*overloaded_p=*/NULL
,
6770 TREE_NO_WARNING (rval
) = 1;
6774 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6777 /* Helper function for get_delta_difference which assumes FROM is a base
6778 class of TO. Returns a delta for the conversion of pointer-to-member
6779 of FROM to pointer-to-member of TO. If the conversion is invalid,
6780 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6781 If C_CAST_P is true, this conversion is taking place as part of a C-style
6785 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6790 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6791 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6793 error (" in pointer to member function conversion");
6794 return size_zero_node
;
6798 if (kind
!= bk_via_virtual
)
6799 return BINFO_OFFSET (binfo
);
6801 /* FROM is a virtual base class of TO. Issue an error or warning
6802 depending on whether or not this is a reinterpret cast. */
6804 error ("pointer to member conversion via virtual base %qT",
6805 BINFO_TYPE (binfo_from_vbase (binfo
)));
6807 return size_zero_node
;
6814 /* Get difference in deltas for different pointer to member function
6815 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6816 the conversion is invalid, the constant is zero. If
6817 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6818 If C_CAST_P is true this conversion is taking place as part of a
6821 Note that the naming of FROM and TO is kind of backwards; the return
6822 value is what we add to a TO in order to get a FROM. They are named
6823 this way because we call this function to find out how to convert from
6824 a pointer to member of FROM to a pointer to member of TO. */
6827 get_delta_difference (tree from
, tree to
,
6828 bool allow_inverse_p
,
6833 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6834 /* Pointer to member of incomplete class is permitted*/
6835 result
= size_zero_node
;
6837 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6841 if (!allow_inverse_p
)
6843 error_not_base_type (from
, to
);
6844 error (" in pointer to member conversion");
6845 result
= size_zero_node
;
6849 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6852 result
= size_diffop_loc (input_location
,
6853 size_zero_node
, result
);
6856 error_not_base_type (from
, to
);
6857 error (" in pointer to member conversion");
6858 result
= size_zero_node
;
6863 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6867 /* Return a constructor for the pointer-to-member-function TYPE using
6868 the other components as specified. */
6871 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6876 VEC(constructor_elt
, gc
) *v
;
6878 /* Pull the FIELD_DECLs out of the type. */
6879 pfn_field
= TYPE_FIELDS (type
);
6880 delta_field
= TREE_CHAIN (pfn_field
);
6882 /* Make sure DELTA has the type we want. */
6883 delta
= convert_and_check (delta_type_node
, delta
);
6885 /* Convert to the correct target type if necessary. */
6886 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6888 /* Finish creating the initializer. */
6889 v
= VEC_alloc(constructor_elt
, gc
, 2);
6890 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6891 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6892 u
= build_constructor (type
, v
);
6893 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6894 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6895 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6897 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6902 /* Build a constructor for a pointer to member function. It can be
6903 used to initialize global variables, local variable, or used
6904 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6907 If FORCE is nonzero, then force this conversion, even if
6908 we would rather not do it. Usually set when using an explicit
6909 cast. A C-style cast is being processed iff C_CAST_P is true.
6911 Return error_mark_node, if something goes wrong. */
6914 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6920 if (error_operand_p (pfn
))
6921 return error_mark_node
;
6923 pfn_type
= TREE_TYPE (pfn
);
6924 to_type
= build_ptrmemfunc_type (type
);
6926 /* Handle multiple conversions of pointer to member functions. */
6927 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6929 tree delta
= NULL_TREE
;
6930 tree npfn
= NULL_TREE
;
6934 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6935 error ("invalid conversion to type %qT from type %qT",
6938 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6939 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6943 /* We don't have to do any conversion to convert a
6944 pointer-to-member to its own type. But, we don't want to
6945 just return a PTRMEM_CST if there's an explicit cast; that
6946 cast should make the expression an invalid template argument. */
6947 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6949 if (same_type_p (to_type
, pfn_type
))
6951 else if (integer_zerop (n
))
6952 return build_reinterpret_cast (to_type
, pfn
,
6953 tf_warning_or_error
);
6956 if (TREE_SIDE_EFFECTS (pfn
))
6957 pfn
= save_expr (pfn
);
6959 /* Obtain the function pointer and the current DELTA. */
6960 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6961 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6964 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6965 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
6968 /* Just adjust the DELTA field. */
6969 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6970 (TREE_TYPE (delta
), ptrdiff_type_node
));
6971 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
6972 n
= cp_build_binary_op (input_location
,
6973 LSHIFT_EXPR
, n
, integer_one_node
,
6974 tf_warning_or_error
);
6975 delta
= cp_build_binary_op (input_location
,
6976 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
6977 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
6980 /* Handle null pointer to member function conversions. */
6981 if (integer_zerop (pfn
))
6983 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
6984 return build_ptrmemfunc1 (to_type
,
6989 if (type_unknown_p (pfn
))
6990 return instantiate_type (type
, pfn
, tf_warning_or_error
);
6992 fn
= TREE_OPERAND (pfn
, 0);
6993 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6994 /* In a template, we will have preserved the
6996 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
6997 return make_ptrmem_cst (to_type
, fn
);
7000 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7003 ??? There is no consistency as to the types returned for the above
7004 values. Some code acts as if it were a sizetype and some as if it were
7005 integer_type_node. */
7008 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
7010 tree type
= TREE_TYPE (cst
);
7011 tree fn
= PTRMEM_CST_MEMBER (cst
);
7012 tree ptr_class
, fn_class
;
7014 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7016 /* The class that the function belongs to. */
7017 fn_class
= DECL_CONTEXT (fn
);
7019 /* The class that we're creating a pointer to member of. */
7020 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
7022 /* First, calculate the adjustment to the function's class. */
7023 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
7026 if (!DECL_VIRTUAL_P (fn
))
7027 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
7030 /* If we're dealing with a virtual function, we have to adjust 'this'
7031 again, to point to the base which provides the vtable entry for
7032 fn; the call will do the opposite adjustment. */
7033 tree orig_class
= DECL_CONTEXT (fn
);
7034 tree binfo
= binfo_or_else (orig_class
, fn_class
);
7035 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7036 *delta
, BINFO_OFFSET (binfo
));
7037 *delta
= fold_if_not_in_template (*delta
);
7039 /* We set PFN to the vtable offset at which the function can be
7040 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7041 case delta is shifted left, and then incremented). */
7042 *pfn
= DECL_VINDEX (fn
);
7043 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
7044 TYPE_SIZE_UNIT (vtable_entry_type
));
7045 *pfn
= fold_if_not_in_template (*pfn
);
7047 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
7049 case ptrmemfunc_vbit_in_pfn
:
7050 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
7052 *pfn
= fold_if_not_in_template (*pfn
);
7055 case ptrmemfunc_vbit_in_delta
:
7056 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
7057 *delta
, integer_one_node
);
7058 *delta
= fold_if_not_in_template (*delta
);
7059 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
7060 *delta
, integer_one_node
);
7061 *delta
= fold_if_not_in_template (*delta
);
7068 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
7069 *pfn
= fold_if_not_in_template (*pfn
);
7073 /* Return an expression for PFN from the pointer-to-member function
7077 pfn_from_ptrmemfunc (tree t
)
7079 if (TREE_CODE (t
) == PTRMEM_CST
)
7084 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7089 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7092 /* Return an expression for DELTA from the pointer-to-member function
7096 delta_from_ptrmemfunc (tree t
)
7098 if (TREE_CODE (t
) == PTRMEM_CST
)
7103 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7108 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7111 /* Convert value RHS to type TYPE as preparation for an assignment to
7112 an lvalue of type TYPE. ERRTYPE is a string to use in error
7113 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7114 are doing the conversion in order to pass the PARMNUMth argument of
7118 convert_for_assignment (tree type
, tree rhs
,
7119 const char *errtype
, tree fndecl
, int parmnum
,
7120 tsubst_flags_t complain
, int flags
)
7123 enum tree_code coder
;
7125 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7126 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7127 rhs
= TREE_OPERAND (rhs
, 0);
7129 rhstype
= TREE_TYPE (rhs
);
7130 coder
= TREE_CODE (rhstype
);
7132 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7133 && vector_types_convertible_p (type
, rhstype
, true))
7134 return convert (type
, rhs
);
7136 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7137 return error_mark_node
;
7138 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7139 return error_mark_node
;
7141 /* The RHS of an assignment cannot have void type. */
7142 if (coder
== VOID_TYPE
)
7144 if (complain
& tf_error
)
7145 error ("void value not ignored as it ought to be");
7146 return error_mark_node
;
7149 /* Simplify the RHS if possible. */
7150 if (TREE_CODE (rhs
) == CONST_DECL
)
7151 rhs
= DECL_INITIAL (rhs
);
7153 if (c_dialect_objc ())
7156 tree rname
= fndecl
;
7158 if (!strcmp (errtype
, "assignment"))
7160 else if (!strcmp (errtype
, "initialization"))
7164 tree selector
= objc_message_selector ();
7168 if (selector
&& parmno
> 1)
7175 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7176 return convert (type
, rhs
);
7181 The expression is implicitly converted (clause _conv_) to the
7182 cv-unqualified type of the left operand.
7184 We allow bad conversions here because by the time we get to this point
7185 we are committed to doing the conversion. If we end up doing a bad
7186 conversion, convert_like will complain. */
7187 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7189 /* When -Wno-pmf-conversions is use, we just silently allow
7190 conversions from pointers-to-members to plain pointers. If
7191 the conversion doesn't work, cp_convert will complain. */
7193 && TYPE_PTR_P (type
)
7194 && TYPE_PTRMEMFUNC_P (rhstype
))
7195 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7198 if (complain
& tf_error
)
7200 /* If the right-hand side has unknown type, then it is an
7201 overloaded function. Call instantiate_type to get error
7203 if (rhstype
== unknown_type_node
)
7204 instantiate_type (type
, rhs
, tf_warning_or_error
);
7206 error ("cannot convert %qT to %qT for argument %qP to %qD",
7207 rhstype
, type
, parmnum
, fndecl
);
7209 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7212 return error_mark_node
;
7215 if (warn_missing_format_attribute
)
7217 const enum tree_code codel
= TREE_CODE (type
);
7218 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7220 && check_missing_format_attribute (type
, rhstype
)
7221 && (complain
& tf_warning
))
7222 warning (OPT_Wmissing_format_attribute
,
7223 "%s might be a candidate for a format attribute",
7227 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7229 if (warn_parentheses
7230 && TREE_CODE (type
) == BOOLEAN_TYPE
7231 && TREE_CODE (rhs
) == MODIFY_EXPR
7232 && !TREE_NO_WARNING (rhs
)
7233 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7234 && (complain
& tf_warning
))
7236 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7237 ? EXPR_LOCATION (rhs
) : input_location
;
7239 warning_at (loc
, OPT_Wparentheses
,
7240 "suggest parentheses around assignment used as truth value");
7241 TREE_NO_WARNING (rhs
) = 1;
7244 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7248 /* Convert RHS to be of type TYPE.
7249 If EXP is nonzero, it is the target of the initialization.
7250 ERRTYPE is a string to use in error messages.
7252 Two major differences between the behavior of
7253 `convert_for_assignment' and `convert_for_initialization'
7254 are that references are bashed in the former, while
7255 copied in the latter, and aggregates are assigned in
7256 the former (operator=) while initialized in the
7259 If using constructor make sure no conversion operator exists, if one does
7260 exist, an ambiguity exists.
7262 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7265 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7266 const char *errtype
, tree fndecl
, int parmnum
,
7267 tsubst_flags_t complain
)
7269 enum tree_code codel
= TREE_CODE (type
);
7271 enum tree_code coder
;
7273 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7274 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7275 if (TREE_CODE (rhs
) == NOP_EXPR
7276 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7277 && codel
!= REFERENCE_TYPE
)
7278 rhs
= TREE_OPERAND (rhs
, 0);
7280 if (type
== error_mark_node
7281 || rhs
== error_mark_node
7282 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7283 return error_mark_node
;
7285 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7286 && TREE_CODE (type
) != ARRAY_TYPE
7287 && (TREE_CODE (type
) != REFERENCE_TYPE
7288 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7289 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7290 && (TREE_CODE (type
) != REFERENCE_TYPE
7291 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7292 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7293 rhs
= decay_conversion (rhs
);
7295 rhstype
= TREE_TYPE (rhs
);
7296 coder
= TREE_CODE (rhstype
);
7298 if (coder
== ERROR_MARK
)
7299 return error_mark_node
;
7301 /* We accept references to incomplete types, so we can
7302 return here before checking if RHS is of complete type. */
7304 if (codel
== REFERENCE_TYPE
)
7306 /* This should eventually happen in convert_arguments. */
7307 int savew
= 0, savee
= 0;
7310 savew
= warningcount
, savee
= errorcount
;
7311 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7312 /*cleanup=*/NULL
, complain
);
7315 if (warningcount
> savew
)
7316 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7317 else if (errorcount
> savee
)
7318 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7324 exp
= require_complete_type (exp
);
7325 if (exp
== error_mark_node
)
7326 return error_mark_node
;
7328 rhstype
= non_reference (rhstype
);
7330 type
= complete_type (type
);
7332 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7333 /* Don't try to do copy-initialization if we already have
7334 direct-initialization. */
7337 if (MAYBE_CLASS_TYPE_P (type
))
7338 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7340 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7344 /* If RETVAL is the address of, or a reference to, a local variable or
7345 temporary give an appropriate warning. */
7348 maybe_warn_about_returning_address_of_local (tree retval
)
7350 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7351 tree whats_returned
= retval
;
7355 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7356 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7357 else if (CONVERT_EXPR_P (whats_returned
)
7358 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7359 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7364 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7366 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7368 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7370 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7371 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7373 warning (0, "returning reference to temporary");
7376 if (TREE_CODE (whats_returned
) == VAR_DECL
7377 && DECL_NAME (whats_returned
)
7378 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7380 warning (0, "reference to non-lvalue returned");
7385 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7386 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7387 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7389 if (DECL_P (whats_returned
)
7390 && DECL_NAME (whats_returned
)
7391 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7392 && !(TREE_STATIC (whats_returned
)
7393 || TREE_PUBLIC (whats_returned
)))
7395 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7396 warning (0, "reference to local variable %q+D returned",
7399 warning (0, "address of local variable %q+D returned",
7405 /* Check that returning RETVAL from the current function is valid.
7406 Return an expression explicitly showing all conversions required to
7407 change RETVAL into the function return type, and to assign it to
7408 the DECL_RESULT for the function. Set *NO_WARNING to true if
7409 code reaches end of non-void function warning shouldn't be issued
7410 on this RETURN_EXPR. */
7413 check_return_expr (tree retval
, bool *no_warning
)
7416 /* The type actually returned by the function, after any
7419 int fn_returns_value_p
;
7420 bool named_return_value_okay_p
;
7422 *no_warning
= false;
7424 /* A `volatile' function is one that isn't supposed to return, ever.
7425 (This is a G++ extension, used to get better code for functions
7426 that call the `volatile' function.) */
7427 if (TREE_THIS_VOLATILE (current_function_decl
))
7428 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7430 /* Check for various simple errors. */
7431 if (DECL_DESTRUCTOR_P (current_function_decl
))
7434 error ("returning a value from a destructor");
7437 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7439 if (in_function_try_handler
)
7440 /* If a return statement appears in a handler of the
7441 function-try-block of a constructor, the program is ill-formed. */
7442 error ("cannot return from a handler of a function-try-block of a constructor");
7444 /* You can't return a value from a constructor. */
7445 error ("returning a value from a constructor");
7449 /* As an extension, deduce lambda return type from a return statement
7450 anywhere in the body. */
7451 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7453 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7454 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7456 tree type
= lambda_return_type (retval
);
7457 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7459 if (VOID_TYPE_P (type
))
7461 else if (oldtype
== NULL_TREE
)
7463 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7464 "can only be deduced when the return statement is "
7465 "the only statement in the function body");
7466 apply_lambda_return_type (lambda
, type
);
7468 else if (!same_type_p (type
, oldtype
))
7469 error ("inconsistent types %qT and %qT deduced for "
7470 "lambda return type", type
, oldtype
);
7474 if (processing_template_decl
)
7476 current_function_returns_value
= 1;
7477 if (check_for_bare_parameter_packs (retval
))
7478 retval
= error_mark_node
;
7482 /* When no explicit return-value is given in a function with a named
7483 return value, the named return value is used. */
7484 result
= DECL_RESULT (current_function_decl
);
7485 valtype
= TREE_TYPE (result
);
7486 gcc_assert (valtype
!= NULL_TREE
);
7487 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7488 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7491 /* Check for a return statement with no return value in a function
7492 that's supposed to return a value. */
7493 if (!retval
&& fn_returns_value_p
)
7495 permerror (input_location
, "return-statement with no value, in function returning %qT",
7497 /* Clear this, so finish_function won't say that we reach the
7498 end of a non-void function (which we don't, we gave a
7500 current_function_returns_null
= 0;
7501 /* And signal caller that TREE_NO_WARNING should be set on the
7502 RETURN_EXPR to avoid control reaches end of non-void function
7503 warnings in tree-cfg.c. */
7506 /* Check for a return statement with a value in a function that
7507 isn't supposed to return a value. */
7508 else if (retval
&& !fn_returns_value_p
)
7510 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7511 /* You can return a `void' value from a function of `void'
7512 type. In that case, we have to evaluate the expression for
7513 its side-effects. */
7514 finish_expr_stmt (retval
);
7516 permerror (input_location
, "return-statement with a value, in function "
7517 "returning 'void'");
7518 current_function_returns_null
= 1;
7520 /* There's really no value to return, after all. */
7524 /* Remember that this function can sometimes return without a
7526 current_function_returns_null
= 1;
7528 /* Remember that this function did return a value. */
7529 current_function_returns_value
= 1;
7531 /* Check for erroneous operands -- but after giving ourselves a
7532 chance to provide an error about returning a value from a void
7534 if (error_operand_p (retval
))
7536 current_function_return_value
= error_mark_node
;
7537 return error_mark_node
;
7540 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7541 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7542 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7543 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7545 && retval
&& null_ptr_cst_p (retval
))
7546 warning (0, "%<operator new%> must not return NULL unless it is "
7547 "declared %<throw()%> (or -fcheck-new is in effect)");
7549 /* Effective C++ rule 15. See also start_function. */
7551 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7555 /* The function return type must be a reference to the current
7557 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7558 && same_type_ignoring_top_level_qualifiers_p
7559 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7561 /* Returning '*this' is obviously OK. */
7562 if (retval
== current_class_ref
)
7564 /* If we are calling a function whose return type is the same of
7565 the current class reference, it is ok. */
7566 else if (TREE_CODE (retval
) == INDIRECT_REF
7567 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7572 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7575 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7577 [...] For a function with a class return type, if the expression
7578 in the return statement is the name of a local object, and the cv-
7579 unqualified type of the local object is the same as the function
7580 return type, an implementation is permitted to omit creating the tem-
7581 porary object to hold the function return value [...]
7583 So, if this is a value-returning function that always returns the same
7584 local variable, remember it.
7586 It might be nice to be more flexible, and choose the first suitable
7587 variable even if the function sometimes returns something else, but
7588 then we run the risk of clobbering the variable we chose if the other
7589 returned expression uses the chosen variable somehow. And people expect
7590 this restriction, anyway. (jason 2000-11-19)
7592 See finish_function and finalize_nrv for the rest of this optimization. */
7594 named_return_value_okay_p
=
7595 (retval
!= NULL_TREE
7596 /* Must be a local, automatic variable. */
7597 && TREE_CODE (retval
) == VAR_DECL
7598 && DECL_CONTEXT (retval
) == current_function_decl
7599 && ! TREE_STATIC (retval
)
7600 && ! DECL_ANON_UNION_VAR_P (retval
)
7601 && (DECL_ALIGN (retval
)
7602 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7603 /* The cv-unqualified type of the returned value must be the
7604 same as the cv-unqualified return type of the
7606 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7608 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7609 /* And the returned value must be non-volatile. */
7610 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7612 if (fn_returns_value_p
&& flag_elide_constructors
)
7614 if (named_return_value_okay_p
7615 && (current_function_return_value
== NULL_TREE
7616 || current_function_return_value
== retval
))
7617 current_function_return_value
= retval
;
7619 current_function_return_value
= error_mark_node
;
7622 /* We don't need to do any conversions when there's nothing being
7627 /* Do any required conversions. */
7628 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7629 /* No conversions are required. */
7633 /* The type the function is declared to return. */
7634 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7635 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7637 /* The functype's return type will have been set to void, if it
7638 was an incomplete type. Just treat this as 'return;' */
7639 if (VOID_TYPE_P (functype
))
7640 return error_mark_node
;
7642 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7643 treated as an rvalue for the purposes of overload resolution to
7644 favor move constructors over copy constructors. */
7645 if ((cxx_dialect
!= cxx98
)
7646 && named_return_value_okay_p
7647 /* The variable must not have the `volatile' qualifier. */
7648 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval
))
7649 /* The return type must be a class type. */
7650 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7651 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7653 /* First convert the value to the function's return type, then
7654 to the type of return value's location to handle the
7655 case that functype is smaller than the valtype. */
7656 retval
= convert_for_initialization
7657 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7658 tf_warning_or_error
);
7659 retval
= convert (valtype
, retval
);
7661 /* If the conversion failed, treat this just like `return;'. */
7662 if (retval
== error_mark_node
)
7664 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7665 else if (! cfun
->returns_struct
7666 && TREE_CODE (retval
) == TARGET_EXPR
7667 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7668 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7669 TREE_OPERAND (retval
, 0));
7671 maybe_warn_about_returning_address_of_local (retval
);
7674 /* Actually copy the value returned into the appropriate location. */
7675 if (retval
&& retval
!= result
)
7676 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7682 /* Returns nonzero if the pointer-type FROM can be converted to the
7683 pointer-type TO via a qualification conversion. If CONSTP is -1,
7684 then we return nonzero if the pointers are similar, and the
7685 cv-qualification signature of FROM is a proper subset of that of TO.
7687 If CONSTP is positive, then all outer pointers have been
7691 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7693 bool to_more_cv_qualified
= false;
7694 bool is_opaque_pointer
= false;
7696 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7698 if (TREE_CODE (to
) != TREE_CODE (from
))
7701 if (TREE_CODE (from
) == OFFSET_TYPE
7702 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7703 TYPE_OFFSET_BASETYPE (to
)))
7706 /* Const and volatile mean something different for function types,
7707 so the usual checks are not appropriate. */
7708 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7710 /* In Objective-C++, some types may have been 'volatilized' by
7711 the compiler for EH; when comparing them here, the volatile
7712 qualification must be ignored. */
7713 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7715 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7718 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7722 to_more_cv_qualified
= true;
7726 constp
&= TYPE_READONLY (to
);
7729 if (TREE_CODE (to
) == VECTOR_TYPE
)
7730 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7732 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7733 return ((constp
>= 0 || to_more_cv_qualified
)
7734 && (is_opaque_pointer
7735 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7739 /* When comparing, say, char ** to char const **, this function takes
7740 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7741 types to this function. */
7744 comp_ptr_ttypes (tree to
, tree from
)
7746 return comp_ptr_ttypes_real (to
, from
, 1);
7749 /* Returns true iff FNTYPE is a non-class type that involves
7750 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7751 if a parameter type is ill-formed. */
7754 error_type_p (const_tree type
)
7758 switch (TREE_CODE (type
))
7764 case REFERENCE_TYPE
:
7766 return error_type_p (TREE_TYPE (type
));
7770 if (error_type_p (TREE_TYPE (type
)))
7772 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7773 if (error_type_p (TREE_VALUE (t
)))
7778 if (TYPE_PTRMEMFUNC_P (type
))
7779 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7787 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7788 type or inheritance-related types, regardless of cv-quals. */
7791 ptr_reasonably_similar (const_tree to
, const_tree from
)
7793 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7795 /* Any target type is similar enough to void. */
7796 if (TREE_CODE (to
) == VOID_TYPE
)
7797 return !error_type_p (from
);
7798 if (TREE_CODE (from
) == VOID_TYPE
)
7799 return !error_type_p (to
);
7801 if (TREE_CODE (to
) != TREE_CODE (from
))
7804 if (TREE_CODE (from
) == OFFSET_TYPE
7805 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7806 TYPE_OFFSET_BASETYPE (from
),
7807 COMPARE_BASE
| COMPARE_DERIVED
))
7810 if (TREE_CODE (to
) == VECTOR_TYPE
7811 && vector_types_convertible_p (to
, from
, false))
7814 if (TREE_CODE (to
) == INTEGER_TYPE
7815 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7818 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7819 return !error_type_p (to
) && !error_type_p (from
);
7821 if (TREE_CODE (to
) != POINTER_TYPE
)
7823 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7824 COMPARE_BASE
| COMPARE_DERIVED
);
7828 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7829 pointer-to-member types) are the same, ignoring cv-qualification at
7833 comp_ptr_ttypes_const (tree to
, tree from
)
7835 bool is_opaque_pointer
= false;
7837 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7839 if (TREE_CODE (to
) != TREE_CODE (from
))
7842 if (TREE_CODE (from
) == OFFSET_TYPE
7843 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7844 TYPE_OFFSET_BASETYPE (to
)))
7847 if (TREE_CODE (to
) == VECTOR_TYPE
)
7848 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7850 if (TREE_CODE (to
) != POINTER_TYPE
)
7851 return (is_opaque_pointer
7852 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7856 /* Returns the type qualifiers for this type, including the qualifiers on the
7857 elements for an array type. */
7860 cp_type_quals (const_tree type
)
7863 /* This CONST_CAST is okay because strip_array_types returns its
7864 argument unmodified and we assign it to a const_tree. */
7865 type
= strip_array_types (CONST_CAST_TREE (type
));
7866 if (type
== error_mark_node
7867 /* Quals on a FUNCTION_TYPE are memfn quals. */
7868 || TREE_CODE (type
) == FUNCTION_TYPE
)
7869 return TYPE_UNQUALIFIED
;
7870 quals
= TYPE_QUALS (type
);
7871 /* METHOD and REFERENCE_TYPEs should never have quals. */
7872 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
7873 && TREE_CODE (type
) != REFERENCE_TYPE
)
7874 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
7875 == TYPE_UNQUALIFIED
));
7879 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
7883 type_memfn_quals (const_tree type
)
7885 if (TREE_CODE (type
) == FUNCTION_TYPE
)
7886 return TYPE_QUALS (type
);
7887 else if (TREE_CODE (type
) == METHOD_TYPE
)
7888 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))));
7893 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
7897 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
)
7899 /* Could handle METHOD_TYPE here if necessary. */
7900 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7901 if (TYPE_QUALS (type
) == memfn_quals
)
7903 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
7905 return build_qualified_type (type
, memfn_quals
);
7908 /* Returns nonzero if TYPE is const or volatile. */
7911 cv_qualified_p (const_tree type
)
7913 int quals
= cp_type_quals (type
);
7914 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7917 /* Returns nonzero if the TYPE contains a mutable member. */
7920 cp_has_mutable_p (const_tree type
)
7922 /* This CONST_CAST is okay because strip_array_types returns its
7923 argument unmodified and we assign it to a const_tree. */
7924 type
= strip_array_types (CONST_CAST_TREE(type
));
7926 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7929 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7930 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7931 approximation. In particular, consider:
7934 struct S { int i; };
7935 const S s = { f(); }
7937 Here, we will make "s" as TREE_READONLY (because it is declared
7938 "const") -- only to reverse ourselves upon seeing that the
7939 initializer is non-constant. */
7942 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7944 tree type
= TREE_TYPE (decl
);
7946 if (type
== error_mark_node
)
7949 if (TREE_CODE (decl
) == TYPE_DECL
)
7952 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
7953 && type_quals
!= TYPE_UNQUALIFIED
));
7955 /* Avoid setting TREE_READONLY incorrectly. */
7956 if (/* If the object has a constructor, the constructor may modify
7958 TYPE_NEEDS_CONSTRUCTING (type
)
7959 /* If the type isn't complete, we don't know yet if it will need
7961 || !COMPLETE_TYPE_P (type
)
7962 /* If the type has a mutable component, that component might be
7964 || TYPE_HAS_MUTABLE_P (type
))
7965 type_quals
&= ~TYPE_QUAL_CONST
;
7967 c_apply_type_quals_to_decl (type_quals
, decl
);
7970 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7971 exemplar types such that casting T1 to T2 is casting away constness
7972 if and only if there is no implicit conversion from T1 to T2. */
7975 casts_away_constness_r (tree
*t1
, tree
*t2
)
7980 /* [expr.const.cast]
7982 For multi-level pointer to members and multi-level mixed pointers
7983 and pointers to members (conv.qual), the "member" aspect of a
7984 pointer to member level is ignored when determining if a const
7985 cv-qualifier has been cast away. */
7986 /* [expr.const.cast]
7988 For two pointer types:
7990 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7991 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7994 casting from X1 to X2 casts away constness if, for a non-pointer
7995 type T there does not exist an implicit conversion (clause
7998 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8002 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8003 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
8004 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
8006 *t1
= cp_build_qualified_type (void_type_node
,
8007 cp_type_quals (*t1
));
8008 *t2
= cp_build_qualified_type (void_type_node
,
8009 cp_type_quals (*t2
));
8013 quals1
= cp_type_quals (*t1
);
8014 quals2
= cp_type_quals (*t2
);
8016 if (TYPE_PTRMEM_P (*t1
))
8017 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
8019 *t1
= TREE_TYPE (*t1
);
8020 if (TYPE_PTRMEM_P (*t2
))
8021 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
8023 *t2
= TREE_TYPE (*t2
);
8025 casts_away_constness_r (t1
, t2
);
8026 *t1
= build_pointer_type (*t1
);
8027 *t2
= build_pointer_type (*t2
);
8028 *t1
= cp_build_qualified_type (*t1
, quals1
);
8029 *t2
= cp_build_qualified_type (*t2
, quals2
);
8032 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8035 ??? This function returns non-zero if casting away qualifiers not
8036 just const. We would like to return to the caller exactly which
8037 qualifiers are casted away to give more accurate diagnostics.
8041 casts_away_constness (tree t1
, tree t2
)
8043 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
8045 /* [expr.const.cast]
8047 Casting from an lvalue of type T1 to an lvalue of type T2
8048 using a reference cast casts away constness if a cast from an
8049 rvalue of type "pointer to T1" to the type "pointer to T2"
8050 casts away constness. */
8051 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
8052 return casts_away_constness (build_pointer_type (t1
),
8053 build_pointer_type (TREE_TYPE (t2
)));
8056 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
8057 /* [expr.const.cast]
8059 Casting from an rvalue of type "pointer to data member of X
8060 of type T1" to the type "pointer to data member of Y of type
8061 T2" casts away constness if a cast from an rvalue of type
8062 "pointer to T1" to the type "pointer to T2" casts away
8064 return casts_away_constness
8065 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
8066 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
8068 /* Casting away constness is only something that makes sense for
8069 pointer or reference types. */
8070 if (TREE_CODE (t1
) != POINTER_TYPE
8071 || TREE_CODE (t2
) != POINTER_TYPE
)
8074 /* Top-level qualifiers don't matter. */
8075 t1
= TYPE_MAIN_VARIANT (t1
);
8076 t2
= TYPE_MAIN_VARIANT (t2
);
8077 casts_away_constness_r (&t1
, &t2
);
8078 if (!can_convert (t2
, t1
))
8084 /* If T is a REFERENCE_TYPE return the type to which T refers.
8085 Otherwise, return T itself. */
8088 non_reference (tree t
)
8090 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8096 /* Return nonzero if REF is an lvalue valid for this language;
8097 otherwise, print an error message and return zero. USE says
8098 how the lvalue is being used and so selects the error message. */
8101 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8103 int win
= lvalue_p (ref
);
8105 if (!win
&& (complain
& tf_error
))