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 int convert_arguments (tree
, VEC(tree
,gc
) **, tree
, int,
67 /* Do `exp = require_complete_type (exp);' to make sure exp
68 does not have an incomplete type. (That includes void types.)
69 Returns the error_mark_node if the VALUE does not have
70 complete type when this function returns. */
73 require_complete_type (tree value
)
77 if (processing_template_decl
|| value
== error_mark_node
)
80 if (TREE_CODE (value
) == OVERLOAD
)
81 type
= unknown_type_node
;
83 type
= TREE_TYPE (value
);
85 if (type
== error_mark_node
)
86 return error_mark_node
;
88 /* First, detect a valid value with a complete type. */
89 if (COMPLETE_TYPE_P (type
))
92 if (complete_type_or_else (type
, value
))
95 return error_mark_node
;
98 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
99 a template instantiation, do the instantiation. Returns TYPE,
100 whether or not it could be completed, unless something goes
101 horribly wrong, in which case the error_mark_node is returned. */
104 complete_type (tree type
)
106 if (type
== NULL_TREE
)
107 /* Rather than crash, we return something sure to cause an error
109 return error_mark_node
;
111 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
113 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
115 tree t
= complete_type (TREE_TYPE (type
));
116 unsigned int needs_constructing
, has_nontrivial_dtor
;
117 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
120 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
122 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
123 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
125 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
126 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
129 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
130 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
135 /* Like complete_type, but issue an error if the TYPE cannot be completed.
136 VALUE is used for informative diagnostics.
137 Returns NULL_TREE if the type cannot be made complete. */
140 complete_type_or_else (tree type
, tree value
)
142 type
= complete_type (type
);
143 if (type
== error_mark_node
)
144 /* We already issued an error. */
146 else if (!COMPLETE_TYPE_P (type
))
148 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
155 /* Return truthvalue of whether type of EXP is instantiated. */
158 type_unknown_p (const_tree exp
)
160 return (TREE_CODE (exp
) == TREE_LIST
161 || TREE_TYPE (exp
) == unknown_type_node
);
165 /* Return the common type of two parameter lists.
166 We assume that comptypes has already been done and returned 1;
167 if that isn't so, this may crash.
169 As an optimization, free the space we allocate if the parameter
170 lists are already common. */
173 commonparms (tree p1
, tree p2
)
175 tree oldargs
= p1
, newargs
, n
;
179 len
= list_length (p1
);
180 newargs
= tree_last (p1
);
182 if (newargs
== void_list_node
)
191 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
196 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
198 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
200 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
203 else if (! TREE_PURPOSE (p1
))
205 if (TREE_PURPOSE (p2
))
207 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
213 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
215 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
217 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
220 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
223 TREE_VALUE (n
) = TREE_VALUE (p1
);
231 /* Given a type, perhaps copied for a typedef,
232 find the "original" version of it. */
234 original_type (tree t
)
236 int quals
= cp_type_quals (t
);
237 while (t
!= error_mark_node
238 && TYPE_NAME (t
) != NULL_TREE
)
240 tree x
= TYPE_NAME (t
);
241 if (TREE_CODE (x
) != TYPE_DECL
)
243 x
= DECL_ORIGINAL_TYPE (x
);
248 return cp_build_qualified_type (t
, quals
);
251 /* Return the common type for two arithmetic types T1 and T2 under the
252 usual arithmetic conversions. The default conversions have already
253 been applied, and enumerated types converted to their compatible
257 cp_common_type (tree t1
, tree t2
)
259 enum tree_code code1
= TREE_CODE (t1
);
260 enum tree_code code2
= TREE_CODE (t2
);
263 /* In what follows, we slightly generalize the rules given in [expr] so
264 as to deal with `long long' and `complex'. First, merge the
266 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
268 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
270 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
271 return build_type_attribute_variant (t1
, attributes
);
276 /* FIXME: Attributes. */
277 gcc_assert (ARITHMETIC_TYPE_P (t1
)
278 || TREE_CODE (t1
) == VECTOR_TYPE
279 || UNSCOPED_ENUM_P (t1
));
280 gcc_assert (ARITHMETIC_TYPE_P (t2
)
281 || TREE_CODE (t2
) == VECTOR_TYPE
282 || UNSCOPED_ENUM_P (t2
));
284 /* If one type is complex, form the common type of the non-complex
285 components, then make that complex. Use T1 or T2 if it is the
287 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
289 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
290 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
292 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
294 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
295 return build_type_attribute_variant (t1
, attributes
);
296 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
297 return build_type_attribute_variant (t2
, attributes
);
299 return build_type_attribute_variant (build_complex_type (subtype
),
303 if (code1
== VECTOR_TYPE
)
305 /* When we get here we should have two vectors of the same size.
306 Just prefer the unsigned one if present. */
307 if (TYPE_UNSIGNED (t1
))
308 return build_type_attribute_variant (t1
, attributes
);
310 return build_type_attribute_variant (t2
, attributes
);
313 /* If only one is real, use it as the result. */
314 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
315 return build_type_attribute_variant (t1
, attributes
);
316 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
317 return build_type_attribute_variant (t2
, attributes
);
319 /* Both real or both integers; use the one with greater precision. */
320 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
321 return build_type_attribute_variant (t1
, attributes
);
322 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
323 return build_type_attribute_variant (t2
, attributes
);
325 /* The types are the same; no need to do anything fancy. */
326 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
327 return build_type_attribute_variant (t1
, attributes
);
329 if (code1
!= REAL_TYPE
)
331 /* If one is unsigned long long, then convert the other to unsigned
333 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
334 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
335 return build_type_attribute_variant (long_long_unsigned_type_node
,
337 /* If one is a long long, and the other is an unsigned long, and
338 long long can represent all the values of an unsigned long, then
339 convert to a long long. Otherwise, convert to an unsigned long
340 long. Otherwise, if either operand is long long, convert the
343 Since we're here, we know the TYPE_PRECISION is the same;
344 therefore converting to long long cannot represent all the values
345 of an unsigned long, so we choose unsigned long long in that
347 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
348 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
350 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
351 ? long_long_unsigned_type_node
352 : long_long_integer_type_node
);
353 return build_type_attribute_variant (t
, attributes
);
356 /* Go through the same procedure, but for longs. */
357 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
358 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
359 return build_type_attribute_variant (long_unsigned_type_node
,
361 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
362 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
364 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
365 ? long_unsigned_type_node
: long_integer_type_node
);
366 return build_type_attribute_variant (t
, attributes
);
368 /* Otherwise prefer the unsigned one. */
369 if (TYPE_UNSIGNED (t1
))
370 return build_type_attribute_variant (t1
, attributes
);
372 return build_type_attribute_variant (t2
, attributes
);
376 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
377 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
378 return build_type_attribute_variant (long_double_type_node
,
380 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
382 return build_type_attribute_variant (double_type_node
,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
385 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
386 return build_type_attribute_variant (float_type_node
,
389 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
390 the standard C++ floating-point types. Logic earlier in this
391 function has already eliminated the possibility that
392 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
393 compelling reason to choose one or the other. */
394 return build_type_attribute_variant (t1
, attributes
);
398 /* T1 and T2 are arithmetic or enumeration types. Return the type
399 that will result from the "usual arithmetic conversions" on T1 and
400 T2 as described in [expr]. */
403 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
405 gcc_assert (ARITHMETIC_TYPE_P (t1
)
406 || TREE_CODE (t1
) == VECTOR_TYPE
407 || UNSCOPED_ENUM_P (t1
));
408 gcc_assert (ARITHMETIC_TYPE_P (t2
)
409 || TREE_CODE (t2
) == VECTOR_TYPE
410 || UNSCOPED_ENUM_P (t2
));
412 /* Perform the integral promotions. We do not promote real types here. */
413 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
414 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
416 t1
= type_promotes_to (t1
);
417 t2
= type_promotes_to (t2
);
420 return cp_common_type (t1
, t2
);
423 /* Subroutine of composite_pointer_type to implement the recursive
424 case. See that function for documentation of the parameters. */
427 composite_pointer_type_r (tree t1
, tree t2
,
428 composite_pointer_operation operation
,
429 tsubst_flags_t complain
)
436 /* Determine the types pointed to by T1 and T2. */
437 if (TREE_CODE (t1
) == POINTER_TYPE
)
439 pointee1
= TREE_TYPE (t1
);
440 pointee2
= TREE_TYPE (t2
);
444 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
445 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
450 Otherwise, the composite pointer type is a pointer type
451 similar (_conv.qual_) to the type of one of the operands,
452 with a cv-qualification signature (_conv.qual_) that is the
453 union of the cv-qualification signatures of the operand
455 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
456 result_type
= pointee1
;
457 else if ((TREE_CODE (pointee1
) == POINTER_TYPE
458 && TREE_CODE (pointee2
) == POINTER_TYPE
)
459 || (TYPE_PTR_TO_MEMBER_P (pointee1
)
460 && TYPE_PTR_TO_MEMBER_P (pointee2
)))
461 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
465 if (complain
& tf_error
)
470 permerror (input_location
, "comparison between "
471 "distinct pointer types %qT and %qT lacks a cast",
475 permerror (input_location
, "conversion between "
476 "distinct pointer types %qT and %qT lacks a cast",
479 case CPO_CONDITIONAL_EXPR
:
480 permerror (input_location
, "conditional expression between "
481 "distinct pointer types %qT and %qT lacks a cast",
488 result_type
= void_type_node
;
490 result_type
= cp_build_qualified_type (result_type
,
491 (cp_type_quals (pointee1
)
492 | cp_type_quals (pointee2
)));
493 /* If the original types were pointers to members, so is the
495 if (TYPE_PTR_TO_MEMBER_P (t1
))
497 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
498 TYPE_PTRMEM_CLASS_TYPE (t2
))
499 && (complain
& tf_error
))
504 permerror (input_location
, "comparison between "
505 "distinct pointer types %qT and %qT lacks a cast",
509 permerror (input_location
, "conversion between "
510 "distinct pointer types %qT and %qT lacks a cast",
513 case CPO_CONDITIONAL_EXPR
:
514 permerror (input_location
, "conditional expression between "
515 "distinct pointer types %qT and %qT lacks a cast",
522 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
526 result_type
= build_pointer_type (result_type
);
528 /* Merge the attributes. */
529 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
530 return build_type_attribute_variant (result_type
, attributes
);
533 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
534 ARG1 and ARG2 are the values with those types. The OPERATION is to
535 describe the operation between the pointer types,
536 in case an error occurs.
538 This routine also implements the computation of a common type for
539 pointers-to-members as per [expr.eq]. */
542 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
543 composite_pointer_operation operation
,
544 tsubst_flags_t complain
)
551 If one operand is a null pointer constant, the composite pointer
552 type is the type of the other operand. */
553 if (null_ptr_cst_p (arg1
))
555 if (null_ptr_cst_p (arg2
))
562 If one of the operands has type "pointer to cv1 void*", then
563 the other has type "pointer to cv2T", and the composite pointer
564 type is "pointer to cv12 void", where cv12 is the union of cv1
567 If either type is a pointer to void, make sure it is T1. */
568 if (TREE_CODE (t2
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t2
)))
576 /* Now, if T1 is a pointer to void, merge the qualifiers. */
577 if (TREE_CODE (t1
) == POINTER_TYPE
&& VOID_TYPE_P (TREE_TYPE (t1
)))
582 if (TYPE_PTRFN_P (t2
) && (complain
& tf_error
))
587 pedwarn (input_location
, OPT_pedantic
,
588 "ISO C++ forbids comparison between "
589 "pointer of type %<void *%> and pointer-to-function");
592 pedwarn (input_location
, OPT_pedantic
,
593 "ISO C++ forbids conversion between "
594 "pointer of type %<void *%> and pointer-to-function");
596 case CPO_CONDITIONAL_EXPR
:
597 pedwarn (input_location
, OPT_pedantic
,
598 "ISO C++ forbids conditional expression between "
599 "pointer of type %<void *%> and pointer-to-function");
606 = cp_build_qualified_type (void_type_node
,
607 (cp_type_quals (TREE_TYPE (t1
))
608 | cp_type_quals (TREE_TYPE (t2
))));
609 result_type
= build_pointer_type (result_type
);
610 /* Merge the attributes. */
611 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
612 return build_type_attribute_variant (result_type
, attributes
);
615 if (c_dialect_objc () && TREE_CODE (t1
) == POINTER_TYPE
616 && TREE_CODE (t2
) == POINTER_TYPE
)
618 if (objc_compare_types (t1
, t2
, -3, NULL_TREE
))
622 /* [expr.eq] permits the application of a pointer conversion to
623 bring the pointers to a common type. */
624 if (TREE_CODE (t1
) == POINTER_TYPE
&& TREE_CODE (t2
) == POINTER_TYPE
625 && CLASS_TYPE_P (TREE_TYPE (t1
))
626 && CLASS_TYPE_P (TREE_TYPE (t2
))
627 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
630 class1
= TREE_TYPE (t1
);
631 class2
= TREE_TYPE (t2
);
633 if (DERIVED_FROM_P (class1
, class2
))
634 t2
= (build_pointer_type
635 (cp_build_qualified_type (class1
, TYPE_QUALS (class2
))));
636 else if (DERIVED_FROM_P (class2
, class1
))
637 t1
= (build_pointer_type
638 (cp_build_qualified_type (class2
, TYPE_QUALS (class1
))));
641 if (complain
& tf_error
)
645 error ("comparison between distinct "
646 "pointer types %qT and %qT lacks a cast", t1
, t2
);
649 error ("conversion between distinct "
650 "pointer types %qT and %qT lacks a cast", t1
, t2
);
652 case CPO_CONDITIONAL_EXPR
:
653 error ("conditional expression between distinct "
654 "pointer types %qT and %qT lacks a cast", t1
, t2
);
659 return error_mark_node
;
662 /* [expr.eq] permits the application of a pointer-to-member
663 conversion to change the class type of one of the types. */
664 else if (TYPE_PTR_TO_MEMBER_P (t1
)
665 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
666 TYPE_PTRMEM_CLASS_TYPE (t2
)))
668 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
669 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
671 if (DERIVED_FROM_P (class1
, class2
))
672 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
673 else if (DERIVED_FROM_P (class2
, class1
))
674 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
677 if (complain
& tf_error
)
681 error ("comparison between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
686 error ("conversion between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
690 case CPO_CONDITIONAL_EXPR
:
691 error ("conditional expression between distinct "
692 "pointer-to-member types %qT and %qT lacks a cast",
698 return error_mark_node
;
702 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
705 /* Return the merged type of two types.
706 We assume that comptypes has already been done and returned 1;
707 if that isn't so, this may crash.
709 This just combines attributes and default arguments; any other
710 differences would cause the two types to compare unalike. */
713 merge_types (tree t1
, tree t2
)
715 enum tree_code code1
;
716 enum tree_code code2
;
719 /* Save time if the two types are the same. */
722 if (original_type (t1
) == original_type (t2
))
725 /* If one type is nonsense, use the other. */
726 if (t1
== error_mark_node
)
728 if (t2
== error_mark_node
)
731 /* Merge the attributes. */
732 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
734 if (TYPE_PTRMEMFUNC_P (t1
))
735 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
736 if (TYPE_PTRMEMFUNC_P (t2
))
737 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
739 code1
= TREE_CODE (t1
);
740 code2
= TREE_CODE (t2
);
743 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
744 if (code1
== TYPENAME_TYPE
)
746 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
747 code1
= TREE_CODE (t1
);
751 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
752 code2
= TREE_CODE (t2
);
760 /* For two pointers, do this recursively on the target type. */
762 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
763 int quals
= cp_type_quals (t1
);
765 if (code1
== POINTER_TYPE
)
766 t1
= build_pointer_type (target
);
768 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
769 t1
= build_type_attribute_variant (t1
, attributes
);
770 t1
= cp_build_qualified_type (t1
, quals
);
772 if (TREE_CODE (target
) == METHOD_TYPE
)
773 t1
= build_ptrmemfunc_type (t1
);
782 quals
= cp_type_quals (t1
);
783 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
784 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
785 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
787 t1
= cp_build_qualified_type (t1
, quals
);
793 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
794 /* Save space: see if the result is identical to one of the args. */
795 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
796 return build_type_attribute_variant (t1
, attributes
);
797 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
798 return build_type_attribute_variant (t2
, attributes
);
799 /* Merge the element types, and have a size if either arg has one. */
800 t1
= build_cplus_array_type
801 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
806 /* Function types: prefer the one that specified arg types.
807 If both do, merge the arg types. Also merge the return types. */
809 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
810 tree p1
= TYPE_ARG_TYPES (t1
);
811 tree p2
= TYPE_ARG_TYPES (t2
);
814 /* Save space: see if the result is identical to one of the args. */
815 if (valtype
== TREE_TYPE (t1
) && ! p2
)
816 return cp_build_type_attribute_variant (t1
, attributes
);
817 if (valtype
== TREE_TYPE (t2
) && ! p1
)
818 return cp_build_type_attribute_variant (t2
, attributes
);
820 /* Simple way if one arg fails to specify argument types. */
821 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
823 rval
= build_function_type (valtype
, p2
);
824 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
825 rval
= build_exception_variant (rval
, raises
);
826 return cp_build_type_attribute_variant (rval
, attributes
);
828 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
829 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
831 rval
= build_function_type (valtype
, p1
);
833 rval
= build_exception_variant (rval
, raises
);
834 return cp_build_type_attribute_variant (rval
, attributes
);
837 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
838 t1
= build_exception_variant (rval
, raises
);
844 /* Get this value the long way, since TYPE_METHOD_BASETYPE
845 is just the main variant of this. */
846 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
847 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
850 /* If this was a member function type, get back to the
851 original type of type member function (i.e., without
852 the class instance variable up front. */
853 t1
= build_function_type (TREE_TYPE (t1
),
854 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
855 t2
= build_function_type (TREE_TYPE (t2
),
856 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
857 t3
= merge_types (t1
, t2
);
858 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
859 TYPE_ARG_TYPES (t3
));
860 t1
= build_exception_variant (t3
, raises
);
865 /* There is no need to merge attributes into a TYPENAME_TYPE.
866 When the type is instantiated it will have whatever
867 attributes result from the instantiation. */
873 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
875 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
878 return cp_build_type_attribute_variant (t1
, attributes
);
881 /* Return the ARRAY_TYPE type without its domain. */
884 strip_array_domain (tree type
)
887 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
888 if (TYPE_DOMAIN (type
) == NULL_TREE
)
890 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
891 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
894 /* Wrapper around cp_common_type that is used by c-common.c and other
895 front end optimizations that remove promotions.
897 Return the common type for two arithmetic types T1 and T2 under the
898 usual arithmetic conversions. The default conversions have already
899 been applied, and enumerated types converted to their compatible
903 common_type (tree t1
, tree t2
)
905 /* If one type is nonsense, use the other */
906 if (t1
== error_mark_node
)
908 if (t2
== error_mark_node
)
911 return cp_common_type (t1
, t2
);
914 /* Return the common type of two pointer types T1 and T2. This is the
915 type for the result of most arithmetic operations if the operands
916 have the given two types.
918 We assume that comp_target_types has already been done and returned
919 nonzero; if that isn't so, this may crash. */
922 common_pointer_type (tree t1
, tree t2
)
924 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
925 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
926 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
928 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
929 CPO_CONVERSION
, tf_warning_or_error
);
932 /* Compare two exception specifier types for exactness or subsetness, if
933 allowed. Returns false for mismatch, true for match (same, or
936 [except.spec] "If a class X ... objects of class X or any class publicly
937 and unambiguously derived from X. Similarly, if a pointer type Y * ...
938 exceptions of type Y * or that are pointers to any type publicly and
939 unambiguously derived from Y. Otherwise a function only allows exceptions
940 that have the same type ..."
941 This does not mention cv qualifiers and is different to what throw
942 [except.throw] and catch [except.catch] will do. They will ignore the
943 top level cv qualifiers, and allow qualifiers in the pointer to class
946 We implement the letter of the standard. */
949 comp_except_types (tree a
, tree b
, bool exact
)
951 if (same_type_p (a
, b
))
955 if (cp_type_quals (a
) || cp_type_quals (b
))
958 if (TREE_CODE (a
) == POINTER_TYPE
959 && TREE_CODE (b
) == POINTER_TYPE
)
963 if (cp_type_quals (a
) || cp_type_quals (b
))
967 if (TREE_CODE (a
) != RECORD_TYPE
968 || TREE_CODE (b
) != RECORD_TYPE
)
971 if (PUBLICLY_UNIQUELY_DERIVED_P (a
, b
))
977 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
978 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
979 otherwise it must be exact. Exception lists are unordered, but
980 we've already filtered out duplicates. Most lists will be in order,
981 we should try to make use of that. */
984 comp_except_specs (const_tree t1
, const_tree t2
, bool exact
)
993 if (t1
== NULL_TREE
) /* T1 is ... */
994 return t2
== NULL_TREE
|| !exact
;
995 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
996 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
997 if (t2
== NULL_TREE
) /* T2 is ... */
999 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1002 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1003 Count how many we find, to determine exactness. For exact matching and
1004 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1006 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1008 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1010 tree a
= TREE_VALUE (probe
);
1011 tree b
= TREE_VALUE (t2
);
1013 if (comp_except_types (a
, b
, exact
))
1015 if (probe
== base
&& exact
)
1016 base
= TREE_CHAIN (probe
);
1021 if (probe
== NULL_TREE
)
1024 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
1027 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1028 [] can match [size]. */
1031 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1040 /* The type of the array elements must be the same. */
1041 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1044 d1
= TYPE_DOMAIN (t1
);
1045 d2
= TYPE_DOMAIN (t2
);
1050 /* If one of the arrays is dimensionless, and the other has a
1051 dimension, they are of different types. However, it is valid to
1059 declarations for an array object can specify
1060 array types that differ by the presence or absence of a major
1061 array bound (_dcl.array_). */
1063 return allow_redeclaration
;
1065 /* Check that the dimensions are the same. */
1067 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1069 max1
= TYPE_MAX_VALUE (d1
);
1070 max2
= TYPE_MAX_VALUE (d2
);
1071 if (processing_template_decl
&& !abi_version_at_least (2)
1072 && !value_dependent_expression_p (max1
)
1073 && !value_dependent_expression_p (max2
))
1075 /* With abi-1 we do not fold non-dependent array bounds, (and
1076 consequently mangle them incorrectly). We must therefore
1077 fold them here, to verify the domains have the same
1083 if (!cp_tree_equal (max1
, max2
))
1089 /* Compare the relative position of T1 and T2 into their respective
1090 template parameter list.
1091 T1 and T2 must be template parameter types.
1092 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1095 comp_template_parms_position (tree t1
, tree t2
)
1097 gcc_assert (t1
&& t2
1098 && TREE_CODE (t1
) == TREE_CODE (t2
)
1099 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1100 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1101 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1103 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
1104 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
)
1105 || (TEMPLATE_TYPE_PARAMETER_PACK (t1
)
1106 != TEMPLATE_TYPE_PARAMETER_PACK (t2
)))
1112 /* Subroutine of incompatible_dependent_types_p.
1113 Return the template parameter of the dependent type T.
1114 If T is a typedef, return the template parameters of
1115 the _decl_ of the typedef. T must be a dependent type. */
1118 get_template_parms_of_dependent_type (tree t
)
1120 tree tinfo
= NULL_TREE
, tparms
= NULL_TREE
;
1122 /* First, try the obvious case of getting the
1123 template info from T itself. */
1124 if ((tinfo
= get_template_info (t
)))
1126 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
1127 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t
);
1128 else if (typedef_variant_p (t
)
1129 && !NAMESPACE_SCOPE_P (TYPE_NAME (t
)))
1130 tinfo
= get_template_info (DECL_CONTEXT (TYPE_NAME (t
)));
1131 /* If T is a TYPENAME_TYPE which context is a template type
1132 parameter, get the template parameters from that context. */
1133 else if (TYPE_CONTEXT (t
)
1134 && TREE_CODE (TYPE_CONTEXT (t
)) == TEMPLATE_TYPE_PARM
)
1135 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t
));
1136 else if (TYPE_CONTEXT (t
)
1137 && !NAMESPACE_SCOPE_P (t
))
1138 tinfo
= get_template_info (TYPE_CONTEXT (t
));
1141 tparms
= DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo
));
1146 /* Subroutine of structural_comptypes.
1147 Compare the dependent types T1 and T2.
1148 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1149 The whole point of this function is to support cases where either T1 or
1150 T2 is a typedef. In those cases, we need to compare the template parameters
1151 of the _decl_ of the typedef. If those don't match then we know T1
1152 and T2 cannot be equal. */
1155 incompatible_dependent_types_p (tree t1
, tree t2
)
1157 tree tparms1
= NULL_TREE
, tparms2
= NULL_TREE
;
1159 if (!uses_template_parms (t1
) || !uses_template_parms (t2
))
1162 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
)
1164 /* If T1 and T2 don't have the same relative position in their
1165 template parameters set, they can't be equal. */
1166 if (!comp_template_parms_position (t1
, t2
))
1170 /* Either T1 or T2 must be a typedef. */
1171 if (!typedef_variant_p (t1
) && !typedef_variant_p (t2
))
1174 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1175 Let's compare their template parameters. */
1177 tparms1
= get_template_parms_of_dependent_type (t1
);
1178 tparms2
= get_template_parms_of_dependent_type (t2
);
1180 /* If T2 is a template type parm and if we could not get the template
1181 parms it belongs to, that means we have not finished parsing the
1182 full set of template parameters of the template declaration it
1183 belongs to yet. If we could get the template parms T1 belongs to,
1184 that mostly means T1 and T2 belongs to templates that are
1185 different and incompatible. */
1186 if (TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
1187 && (tparms1
== NULL_TREE
|| tparms2
== NULL_TREE
)
1188 && tparms1
!= tparms2
)
1191 if (tparms1
== NULL_TREE
1192 || tparms2
== NULL_TREE
1193 || tparms1
== tparms2
)
1196 /* And now compare the mighty template parms! */
1197 return !comp_template_parms (tparms1
, tparms2
);
1200 /* Subroutine in comptypes. */
1203 structural_comptypes (tree t1
, tree t2
, int strict
)
1208 /* Suppress errors caused by previously reported errors. */
1209 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1212 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1214 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1215 current instantiation. */
1216 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1217 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1219 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1220 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1222 if (TYPE_PTRMEMFUNC_P (t1
))
1223 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1224 if (TYPE_PTRMEMFUNC_P (t2
))
1225 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1227 /* Different classes of types can't be compatible. */
1228 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1231 /* Qualifiers must match. For array types, we will check when we
1232 recur on the array element types. */
1233 if (TREE_CODE (t1
) != ARRAY_TYPE
1234 && TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
1236 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1239 /* If T1 and T2 are dependent typedefs then check upfront that
1240 the template parameters of their typedef DECLs match before
1241 going down checking their subtypes. */
1242 if (incompatible_dependent_types_p (t1
, t2
))
1245 /* Allow for two different type nodes which have essentially the same
1246 definition. Note that we already checked for equality of the type
1247 qualifiers (just above). */
1249 if (TREE_CODE (t1
) != ARRAY_TYPE
1250 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1254 /* Compare the types. Break out if they could be the same. */
1255 switch (TREE_CODE (t1
))
1259 /* All void and bool types are the same. */
1263 case FIXED_POINT_TYPE
:
1265 /* With these nodes, we can't determine type equivalence by
1266 looking at what is stored in the nodes themselves, because
1267 two nodes might have different TYPE_MAIN_VARIANTs but still
1268 represent the same type. For example, wchar_t and int could
1269 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1270 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1271 and are distinct types. On the other hand, int and the
1274 typedef int INT __attribute((may_alias));
1276 have identical properties, different TYPE_MAIN_VARIANTs, but
1277 represent the same type. The canonical type system keeps
1278 track of equivalence in this case, so we fall back on it. */
1279 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1281 case TEMPLATE_TEMPLATE_PARM
:
1282 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1283 if (!comp_template_parms_position (t1
, t2
))
1285 if (!comp_template_parms
1286 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1287 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1289 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1291 /* Don't check inheritance. */
1292 strict
= COMPARE_STRICT
;
1297 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1298 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1299 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1300 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1303 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1305 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1311 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1312 strict
& ~COMPARE_REDECLARATION
))
1314 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1318 case REFERENCE_TYPE
:
1319 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1321 /* fall through to checks for pointer types */
1324 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1325 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
)
1326 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1332 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1334 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1339 /* Target types must match incl. qualifiers. */
1340 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1344 case TEMPLATE_TYPE_PARM
:
1345 /* If incompatible_dependent_types_p called earlier didn't decide
1346 T1 and T2 were different, they might be equal. */
1350 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1351 TYPENAME_TYPE_FULLNAME (t2
)))
1353 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1357 case UNBOUND_CLASS_TEMPLATE
:
1358 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1360 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1365 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1370 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1371 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1375 case TYPE_PACK_EXPANSION
:
1376 return same_type_p (PACK_EXPANSION_PATTERN (t1
),
1377 PACK_EXPANSION_PATTERN (t2
));
1380 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1381 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1382 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1383 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1384 || (DECLTYPE_FOR_LAMBDA_RETURN (t1
)
1385 != DECLTYPE_FOR_LAMBDA_RETURN (t2
))
1386 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1387 DECLTYPE_TYPE_EXPR (t2
)))
1395 /* If we get here, we know that from a target independent POV the
1396 types are the same. Make sure the target attributes are also
1398 return targetm
.comp_type_attributes (t1
, t2
);
1401 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1402 is a bitwise-or of the COMPARE_* flags. */
1405 comptypes (tree t1
, tree t2
, int strict
)
1407 if (strict
== COMPARE_STRICT
)
1412 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1415 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1416 /* At least one of the types requires structural equality, so
1417 perform a deep check. */
1418 return structural_comptypes (t1
, t2
, strict
);
1420 #ifdef ENABLE_CHECKING
1421 if (USE_CANONICAL_TYPES
)
1423 bool result
= structural_comptypes (t1
, t2
, strict
);
1425 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1426 /* The two types are structurally equivalent, but their
1427 canonical types were different. This is a failure of the
1428 canonical type propagation code.*/
1430 ("canonical types differ for identical types %T and %T",
1432 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1433 /* Two types are structurally different, but the canonical
1434 types are the same. This means we were over-eager in
1435 assigning canonical types. */
1437 ("same canonical type node for different types %T and %T",
1443 if (USE_CANONICAL_TYPES
)
1444 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1447 return structural_comptypes (t1
, t2
, strict
);
1449 else if (strict
== COMPARE_STRUCTURAL
)
1450 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1452 return structural_comptypes (t1
, t2
, strict
);
1455 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1458 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1460 int q1
= cp_type_quals (type1
);
1461 int q2
= cp_type_quals (type2
);
1463 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1464 return (q1
& q2
) == q2
;
1467 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1468 more cv-qualified that TYPE1, and 0 otherwise. */
1471 comp_cv_qualification (const_tree type1
, const_tree type2
)
1473 int q1
= cp_type_quals (type1
);
1474 int q2
= cp_type_quals (type2
);
1479 if ((q1
& q2
) == q2
)
1481 else if ((q1
& q2
) == q1
)
1487 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1488 subset of the cv-qualification signature of TYPE2, and the types
1489 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1492 comp_cv_qual_signature (tree type1
, tree type2
)
1494 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1496 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1502 /* Subroutines of `comptypes'. */
1504 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1505 equivalent in the sense that functions with those parameter types
1506 can have equivalent types. The two lists must be equivalent,
1507 element by element. */
1510 compparms (const_tree parms1
, const_tree parms2
)
1514 /* An unspecified parmlist matches any specified parmlist
1515 whose argument types don't need default promotions. */
1517 for (t1
= parms1
, t2
= parms2
;
1519 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1521 /* If one parmlist is shorter than the other,
1522 they fail to match. */
1525 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1532 /* Process a sizeof or alignof expression where the operand is a
1536 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1541 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1542 if (type
== error_mark_node
)
1543 return error_mark_node
;
1545 type
= non_reference (type
);
1546 if (TREE_CODE (type
) == METHOD_TYPE
)
1549 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
1550 "invalid application of %qs to a member function",
1551 operator_name_info
[(int) op
].name
);
1552 value
= size_one_node
;
1555 dependent_p
= dependent_type_p (type
);
1557 complete_type (type
);
1559 /* VLA types will have a non-constant size. In the body of an
1560 uninstantiated template, we don't need to try to compute the
1561 value, because the sizeof expression is not an integral
1562 constant expression in that case. And, if we do try to
1563 compute the value, we'll likely end up with SAVE_EXPRs, which
1564 the template substitution machinery does not expect to see. */
1565 || (processing_template_decl
1566 && COMPLETE_TYPE_P (type
)
1567 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1569 value
= build_min (op
, size_type_node
, type
);
1570 TREE_READONLY (value
) = 1;
1574 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1579 /* Return the size of the type, without producing any warnings for
1580 types whose size cannot be taken. This routine should be used only
1581 in some other routine that has already produced a diagnostic about
1582 using the size of such a type. */
1584 cxx_sizeof_nowarn (tree type
)
1586 if (TREE_CODE (type
) == FUNCTION_TYPE
1587 || TREE_CODE (type
) == VOID_TYPE
1588 || TREE_CODE (type
) == ERROR_MARK
)
1589 return size_one_node
;
1590 else if (!COMPLETE_TYPE_P (type
))
1591 return size_zero_node
;
1593 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1596 /* Process a sizeof expression where the operand is an expression. */
1599 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1601 if (e
== error_mark_node
)
1602 return error_mark_node
;
1604 if (processing_template_decl
)
1606 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1607 TREE_SIDE_EFFECTS (e
) = 0;
1608 TREE_READONLY (e
) = 1;
1613 /* To get the size of a static data member declared as an array of
1614 unknown bound, we need to instantiate it. */
1615 if (TREE_CODE (e
) == VAR_DECL
1616 && VAR_HAD_UNKNOWN_BOUND (e
)
1617 && DECL_TEMPLATE_INSTANTIATION (e
))
1618 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1620 if (TREE_CODE (e
) == COMPONENT_REF
1621 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1622 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1624 if (complain
& tf_error
)
1625 error ("invalid application of %<sizeof%> to a bit-field");
1627 return error_mark_node
;
1630 else if (is_overloaded_fn (e
))
1632 if (complain
& tf_error
)
1633 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1636 return error_mark_node
;
1639 else if (type_unknown_p (e
))
1641 if (complain
& tf_error
)
1642 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1644 return error_mark_node
;
1650 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1653 /* Implement the __alignof keyword: Return the minimum required
1654 alignment of E, measured in bytes. For VAR_DECL's and
1655 FIELD_DECL's return DECL_ALIGN (which can be set from an
1656 "aligned" __attribute__ specification). */
1659 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1663 if (e
== error_mark_node
)
1664 return error_mark_node
;
1666 if (processing_template_decl
)
1668 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1669 TREE_SIDE_EFFECTS (e
) = 0;
1670 TREE_READONLY (e
) = 1;
1675 if (TREE_CODE (e
) == VAR_DECL
)
1676 t
= size_int (DECL_ALIGN_UNIT (e
));
1677 else if (TREE_CODE (e
) == COMPONENT_REF
1678 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1679 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1681 if (complain
& tf_error
)
1682 error ("invalid application of %<__alignof%> to a bit-field");
1684 return error_mark_node
;
1687 else if (TREE_CODE (e
) == COMPONENT_REF
1688 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1689 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1690 else if (is_overloaded_fn (e
))
1692 if (complain
& tf_error
)
1693 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1696 return error_mark_node
;
1697 if (TREE_CODE (e
) == FUNCTION_DECL
)
1698 t
= size_int (DECL_ALIGN_UNIT (e
));
1702 else if (type_unknown_p (e
))
1704 if (complain
& tf_error
)
1705 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1707 return error_mark_node
;
1711 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1712 complain
& tf_error
);
1714 return fold_convert (size_type_node
, t
);
1717 /* Process a sizeof or alignof expression E with code OP where the operand
1718 is an expression. */
1721 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1723 if (op
== SIZEOF_EXPR
)
1724 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1726 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1729 /* EXPR is being used in a context that is not a function call.
1734 The expression can be used only as the left-hand operand of a
1735 member function call.
1737 [expr.mptr.operator]
1739 If the result of .* or ->* is a function, then that result can be
1740 used only as the operand for the function call operator ().
1742 by issuing an error message if appropriate. Returns true iff EXPR
1743 violates these rules. */
1746 invalid_nonstatic_memfn_p (const_tree expr
, tsubst_flags_t complain
)
1748 if (expr
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1750 if (complain
& tf_error
)
1751 error ("invalid use of non-static member function");
1757 /* If EXP is a reference to a bitfield, and the type of EXP does not
1758 match the declared type of the bitfield, return the declared type
1759 of the bitfield. Otherwise, return NULL_TREE. */
1762 is_bitfield_expr_with_lowered_type (const_tree exp
)
1764 switch (TREE_CODE (exp
))
1767 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1768 ? TREE_OPERAND (exp
, 1)
1769 : TREE_OPERAND (exp
, 0)))
1771 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1774 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1778 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1784 field
= TREE_OPERAND (exp
, 1);
1785 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1787 if (same_type_ignoring_top_level_qualifiers_p
1788 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1790 return DECL_BIT_FIELD_TYPE (field
);
1794 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1795 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1796 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1804 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1805 bitfield with a lowered type, the type of EXP is returned, rather
1809 unlowered_expr_type (const_tree exp
)
1813 type
= is_bitfield_expr_with_lowered_type (exp
);
1815 type
= TREE_TYPE (exp
);
1820 /* Perform the conversions in [expr] that apply when an lvalue appears
1821 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1822 function-to-pointer conversions. In addition, manifest constants
1823 are replaced by their values, and bitfield references are converted
1824 to their declared types.
1826 Although the returned value is being used as an rvalue, this
1827 function does not wrap the returned expression in a
1828 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1829 that the return value is no longer an lvalue. */
1832 decay_conversion (tree exp
)
1835 enum tree_code code
;
1837 type
= TREE_TYPE (exp
);
1838 if (type
== error_mark_node
)
1839 return error_mark_node
;
1841 exp
= resolve_nondeduced_context (exp
);
1842 if (type_unknown_p (exp
))
1844 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1845 return error_mark_node
;
1848 exp
= decl_constant_value (exp
);
1849 if (error_operand_p (exp
))
1850 return error_mark_node
;
1852 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1853 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1854 code
= TREE_CODE (type
);
1855 if (code
== VOID_TYPE
)
1857 error ("void value not ignored as it ought to be");
1858 return error_mark_node
;
1860 if (invalid_nonstatic_memfn_p (exp
, tf_warning_or_error
))
1861 return error_mark_node
;
1862 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1863 return cp_build_unary_op (ADDR_EXPR
, exp
, 0, tf_warning_or_error
);
1864 if (code
== ARRAY_TYPE
)
1869 if (TREE_CODE (exp
) == INDIRECT_REF
)
1870 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1871 TREE_OPERAND (exp
, 0));
1873 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1875 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1876 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1877 TREE_OPERAND (exp
, 0), op1
);
1881 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1883 error ("invalid use of non-lvalue array");
1884 return error_mark_node
;
1887 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1889 if (TREE_CODE (exp
) == VAR_DECL
)
1891 if (!cxx_mark_addressable (exp
))
1892 return error_mark_node
;
1893 adr
= build_nop (ptrtype
, build_address (exp
));
1896 /* This way is better for a COMPONENT_REF since it can
1897 simplify the offset for a component. */
1898 adr
= cp_build_unary_op (ADDR_EXPR
, exp
, 1, tf_warning_or_error
);
1899 return cp_convert (ptrtype
, adr
);
1902 /* If a bitfield is used in a context where integral promotion
1903 applies, then the caller is expected to have used
1904 default_conversion. That function promotes bitfields correctly
1905 before calling this function. At this point, if we have a
1906 bitfield referenced, we may assume that is not subject to
1907 promotion, and that, therefore, the type of the resulting rvalue
1908 is the declared type of the bitfield. */
1909 exp
= convert_bitfield_to_declared_type (exp
);
1911 /* We do not call rvalue() here because we do not want to wrap EXP
1912 in a NON_LVALUE_EXPR. */
1916 Non-class rvalues always have cv-unqualified types. */
1917 type
= TREE_TYPE (exp
);
1918 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
1919 exp
= build_nop (cv_unqualified (type
), exp
);
1924 /* Perform preparatory conversions, as part of the "usual arithmetic
1925 conversions". In particular, as per [expr]:
1927 Whenever an lvalue expression appears as an operand of an
1928 operator that expects the rvalue for that operand, the
1929 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1930 standard conversions are applied to convert the expression to an
1933 In addition, we perform integral promotions here, as those are
1934 applied to both operands to a binary operator before determining
1935 what additional conversions should apply. */
1938 default_conversion (tree exp
)
1940 /* Check for target-specific promotions. */
1941 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
1943 exp
= cp_convert (promoted_type
, exp
);
1944 /* Perform the integral promotions first so that bitfield
1945 expressions (which may promote to "int", even if the bitfield is
1946 declared "unsigned") are promoted correctly. */
1947 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
1948 exp
= perform_integral_promotions (exp
);
1949 /* Perform the other conversions. */
1950 exp
= decay_conversion (exp
);
1955 /* EXPR is an expression with an integral or enumeration type.
1956 Perform the integral promotions in [conv.prom], and return the
1960 perform_integral_promotions (tree expr
)
1967 If the bitfield has an enumerated type, it is treated as any
1968 other value of that type for promotion purposes. */
1969 type
= is_bitfield_expr_with_lowered_type (expr
);
1970 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
1971 type
= TREE_TYPE (expr
);
1972 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
1973 promoted_type
= type_promotes_to (type
);
1974 if (type
!= promoted_type
)
1975 expr
= cp_convert (promoted_type
, expr
);
1979 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1980 decay_conversion to one. */
1983 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
1987 if (TREE_CODE (totype
) != POINTER_TYPE
)
1990 t
= TREE_TYPE (totype
);
1991 if (!same_type_p (t
, char_type_node
)
1992 && !same_type_p (t
, char16_type_node
)
1993 && !same_type_p (t
, char32_type_node
)
1994 && !same_type_p (t
, wchar_type_node
))
1997 if (TREE_CODE (exp
) == STRING_CST
)
1999 /* Make sure that we don't try to convert between char and wide chars. */
2000 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2005 /* Is this a string constant which has decayed to 'const char *'? */
2006 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
2007 if (!same_type_p (TREE_TYPE (exp
), t
))
2010 if (TREE_CODE (exp
) != ADDR_EXPR
2011 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2015 /* This warning is not very useful, as it complains about printf. */
2017 warning (OPT_Wwrite_strings
,
2018 "deprecated conversion from string constant to %qT",
2024 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2025 can, for example, use as an lvalue. This code used to be in
2026 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2027 expressions, where we're dealing with aggregates. But now it's again only
2028 called from unary_complex_lvalue. The case (in particular) that led to
2029 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2033 rationalize_conditional_expr (enum tree_code code
, tree t
,
2034 tsubst_flags_t complain
)
2036 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2037 the first operand is always the one to be used if both operands
2038 are equal, so we know what conditional expression this used to be. */
2039 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2041 tree op0
= TREE_OPERAND (t
, 0);
2042 tree op1
= TREE_OPERAND (t
, 1);
2044 /* The following code is incorrect if either operand side-effects. */
2045 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2046 && !TREE_SIDE_EFFECTS (op1
));
2048 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
2049 ? LE_EXPR
: GE_EXPR
),
2050 op0
, TREE_CODE (op0
),
2051 op1
, TREE_CODE (op1
),
2052 /*overloaded_p=*/NULL
,
2054 cp_build_unary_op (code
, op0
, 0, complain
),
2055 cp_build_unary_op (code
, op1
, 0, complain
),
2060 build_conditional_expr (TREE_OPERAND (t
, 0),
2061 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2063 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2068 /* Given the TYPE of an anonymous union field inside T, return the
2069 FIELD_DECL for the field. If not found return NULL_TREE. Because
2070 anonymous unions can nest, we must also search all anonymous unions
2071 that are directly reachable. */
2074 lookup_anon_field (tree t
, tree type
)
2078 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
2080 if (TREE_STATIC (field
))
2082 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2085 /* If we find it directly, return the field. */
2086 if (DECL_NAME (field
) == NULL_TREE
2087 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2092 /* Otherwise, it could be nested, search harder. */
2093 if (DECL_NAME (field
) == NULL_TREE
2094 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2096 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2104 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2105 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2106 non-NULL, it indicates the path to the base used to name MEMBER.
2107 If PRESERVE_REFERENCE is true, the expression returned will have
2108 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2109 returned will have the type referred to by the reference.
2111 This function does not perform access control; that is either done
2112 earlier by the parser when the name of MEMBER is resolved to MEMBER
2113 itself, or later when overload resolution selects one of the
2114 functions indicated by MEMBER. */
2117 build_class_member_access_expr (tree object
, tree member
,
2118 tree access_path
, bool preserve_reference
,
2119 tsubst_flags_t complain
)
2123 tree result
= NULL_TREE
;
2125 if (error_operand_p (object
) || error_operand_p (member
))
2126 return error_mark_node
;
2128 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2132 The type of the first expression shall be "class object" (of a
2134 object_type
= TREE_TYPE (object
);
2135 if (!currently_open_class (object_type
)
2136 && !complete_type_or_else (object_type
, object
))
2137 return error_mark_node
;
2138 if (!CLASS_TYPE_P (object_type
))
2140 if (complain
& tf_error
)
2141 error ("request for member %qD in %qE, which is of non-class type %qT",
2142 member
, object
, object_type
);
2143 return error_mark_node
;
2146 /* The standard does not seem to actually say that MEMBER must be a
2147 member of OBJECT_TYPE. However, that is clearly what is
2149 if (DECL_P (member
))
2151 member_scope
= DECL_CLASS_CONTEXT (member
);
2153 if (TREE_DEPRECATED (member
))
2154 warn_deprecated_use (member
, NULL_TREE
);
2157 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2158 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2159 presently be the anonymous union. Go outwards until we find a
2160 type related to OBJECT_TYPE. */
2161 while (ANON_AGGR_TYPE_P (member_scope
)
2162 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2164 member_scope
= TYPE_CONTEXT (member_scope
);
2165 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2167 if (complain
& tf_error
)
2169 if (TREE_CODE (member
) == FIELD_DECL
)
2170 error ("invalid use of nonstatic data member %qE", member
);
2172 error ("%qD is not a member of %qT", member
, object_type
);
2174 return error_mark_node
;
2177 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2178 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2179 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2181 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2183 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2186 /* In [expr.ref], there is an explicit list of the valid choices for
2187 MEMBER. We check for each of those cases here. */
2188 if (TREE_CODE (member
) == VAR_DECL
)
2190 /* A static data member. */
2192 /* If OBJECT has side-effects, they are supposed to occur. */
2193 if (TREE_SIDE_EFFECTS (object
))
2194 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2196 else if (TREE_CODE (member
) == FIELD_DECL
)
2198 /* A non-static data member. */
2203 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
2204 && integer_zerop (TREE_OPERAND (object
, 0)));
2206 /* Convert OBJECT to the type of MEMBER. */
2207 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2208 TYPE_MAIN_VARIANT (member_scope
)))
2213 binfo
= lookup_base (access_path
? access_path
: object_type
,
2214 member_scope
, ba_unique
, &kind
);
2215 if (binfo
== error_mark_node
)
2216 return error_mark_node
;
2218 /* It is invalid to try to get to a virtual base of a
2219 NULL object. The most common cause is invalid use of
2221 if (null_object_p
&& kind
== bk_via_virtual
)
2223 if (complain
& tf_error
)
2225 error ("invalid access to non-static data member %qD of "
2228 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2230 return error_mark_node
;
2233 /* Convert to the base. */
2234 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2236 /* If we found the base successfully then we should be able
2237 to convert to it successfully. */
2238 gcc_assert (object
!= error_mark_node
);
2241 /* Complain about other invalid uses of offsetof, even though they will
2242 give the right answer. Note that we complain whether or not they
2243 actually used the offsetof macro, since there's no way to know at this
2244 point. So we just give a warning, instead of a pedwarn. */
2245 /* Do not produce this warning for base class field references, because
2246 we know for a fact that didn't come from offsetof. This does occur
2247 in various testsuite cases where a null object is passed where a
2248 vtable access is required. */
2249 if (null_object_p
&& warn_invalid_offsetof
2250 && CLASSTYPE_NON_STD_LAYOUT (object_type
)
2251 && !DECL_FIELD_IS_BASE (member
)
2252 && cp_unevaluated_operand
== 0
2253 && (complain
& tf_warning
))
2255 warning (OPT_Winvalid_offsetof
,
2256 "invalid access to non-static data member %qD "
2257 " of NULL object", member
);
2258 warning (OPT_Winvalid_offsetof
,
2259 "(perhaps the %<offsetof%> macro was used incorrectly)");
2262 /* If MEMBER is from an anonymous aggregate, we have converted
2263 OBJECT so that it refers to the class containing the
2264 anonymous union. Generate a reference to the anonymous union
2265 itself, and recur to find MEMBER. */
2266 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2267 /* When this code is called from build_field_call, the
2268 object already has the type of the anonymous union.
2269 That is because the COMPONENT_REF was already
2270 constructed, and was then disassembled before calling
2271 build_field_call. After the function-call code is
2272 cleaned up, this waste can be eliminated. */
2273 && (!same_type_ignoring_top_level_qualifiers_p
2274 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2276 tree anonymous_union
;
2278 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2279 DECL_CONTEXT (member
));
2280 object
= build_class_member_access_expr (object
,
2282 /*access_path=*/NULL_TREE
,
2287 /* Compute the type of the field, as described in [expr.ref]. */
2288 type_quals
= TYPE_UNQUALIFIED
;
2289 member_type
= TREE_TYPE (member
);
2290 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2292 type_quals
= (cp_type_quals (member_type
)
2293 | cp_type_quals (object_type
));
2295 /* A field is const (volatile) if the enclosing object, or the
2296 field itself, is const (volatile). But, a mutable field is
2297 not const, even within a const object. */
2298 if (DECL_MUTABLE_P (member
))
2299 type_quals
&= ~TYPE_QUAL_CONST
;
2300 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2303 result
= build3 (COMPONENT_REF
, member_type
, object
, member
,
2305 result
= fold_if_not_in_template (result
);
2307 /* Mark the expression const or volatile, as appropriate. Even
2308 though we've dealt with the type above, we still have to mark the
2309 expression itself. */
2310 if (type_quals
& TYPE_QUAL_CONST
)
2311 TREE_READONLY (result
) = 1;
2312 if (type_quals
& TYPE_QUAL_VOLATILE
)
2313 TREE_THIS_VOLATILE (result
) = 1;
2315 else if (BASELINK_P (member
))
2317 /* The member is a (possibly overloaded) member function. */
2321 /* If the MEMBER is exactly one static member function, then we
2322 know the type of the expression. Otherwise, we must wait
2323 until overload resolution has been performed. */
2324 functions
= BASELINK_FUNCTIONS (member
);
2325 if (TREE_CODE (functions
) == FUNCTION_DECL
2326 && DECL_STATIC_FUNCTION_P (functions
))
2327 type
= TREE_TYPE (functions
);
2329 type
= unknown_type_node
;
2330 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2331 base. That will happen when the function is called. */
2332 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2334 else if (TREE_CODE (member
) == CONST_DECL
)
2336 /* The member is an enumerator. */
2338 /* If OBJECT has side-effects, they are supposed to occur. */
2339 if (TREE_SIDE_EFFECTS (object
))
2340 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2345 if (complain
& tf_error
)
2346 error ("invalid use of %qD", member
);
2347 return error_mark_node
;
2350 if (!preserve_reference
)
2353 If E2 is declared to have type "reference to T", then ... the
2354 type of E1.E2 is T. */
2355 result
= convert_from_reference (result
);
2360 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2361 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2364 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2366 tree object_type
= TREE_TYPE (object
);
2367 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2370 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2372 error ("qualified type %qT does not match destructor name ~%qT",
2374 return error_mark_node
;
2376 if (TREE_CODE (dtor_type
) == IDENTIFIER_NODE
)
2378 /* In a template, names we can't find a match for are still accepted
2379 destructor names, and we check them here. */
2380 if (check_dtor_name (object_type
, dtor_type
))
2381 dtor_type
= object_type
;
2384 error ("object type %qT does not match destructor name ~%qT",
2385 object_type
, dtor_type
);
2386 return error_mark_node
;
2390 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2392 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2393 TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2394 return error_mark_node
;
2396 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2397 /*protect=*/1, /*want_type=*/false);
2398 expr
= (adjust_result_of_qualified_name_lookup
2399 (expr
, dtor_type
, object_type
));
2403 /* An expression of the form "A::template B" has been resolved to
2404 DECL. Issue a diagnostic if B is not a template or template
2408 check_template_keyword (tree decl
)
2410 /* The standard says:
2414 If a name prefixed by the keyword template is not a member
2415 template, the program is ill-formed.
2417 DR 228 removed the restriction that the template be a member
2420 DR 96, if accepted would add the further restriction that explicit
2421 template arguments must be provided if the template keyword is
2422 used, but, as of 2005-10-16, that DR is still in "drafting". If
2423 this DR is accepted, then the semantic checks here can be
2424 simplified, as the entity named must in fact be a template
2425 specialization, rather than, as at present, a set of overloaded
2426 functions containing at least one template function. */
2427 if (TREE_CODE (decl
) != TEMPLATE_DECL
2428 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2430 if (!is_overloaded_fn (decl
))
2431 permerror (input_location
, "%qD is not a template", decl
);
2436 if (BASELINK_P (fns
))
2437 fns
= BASELINK_FUNCTIONS (fns
);
2440 tree fn
= OVL_CURRENT (fns
);
2441 if (TREE_CODE (fn
) == TEMPLATE_DECL
2442 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2444 if (TREE_CODE (fn
) == FUNCTION_DECL
2445 && DECL_USE_TEMPLATE (fn
)
2446 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2448 fns
= OVL_NEXT (fns
);
2451 permerror (input_location
, "%qD is not a template", decl
);
2456 /* This function is called by the parser to process a class member
2457 access expression of the form OBJECT.NAME. NAME is a node used by
2458 the parser to represent a name; it is not yet a DECL. It may,
2459 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2460 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2461 there is no reason to do the lookup twice, so the parser keeps the
2462 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2463 be a template via the use of the "A::template B" syntax. */
2466 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2467 tsubst_flags_t complain
)
2472 tree access_path
= NULL_TREE
;
2473 tree orig_object
= object
;
2474 tree orig_name
= name
;
2476 if (object
== error_mark_node
|| name
== error_mark_node
)
2477 return error_mark_node
;
2479 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2480 if (!objc_is_public (object
, name
))
2481 return error_mark_node
;
2483 object_type
= TREE_TYPE (object
);
2485 if (processing_template_decl
)
2487 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2488 dependent_type_p (object_type
)
2489 /* If NAME is just an IDENTIFIER_NODE, then the expression
2491 || TREE_CODE (object
) == IDENTIFIER_NODE
2492 /* If NAME is "f<args>", where either 'f' or 'args' is
2493 dependent, then the expression is dependent. */
2494 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2495 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2496 TREE_OPERAND (name
, 1)))
2497 /* If NAME is "T::X" where "T" is dependent, then the
2498 expression is dependent. */
2499 || (TREE_CODE (name
) == SCOPE_REF
2500 && TYPE_P (TREE_OPERAND (name
, 0))
2501 && dependent_type_p (TREE_OPERAND (name
, 0))))
2502 return build_min_nt (COMPONENT_REF
, object
, name
, NULL_TREE
);
2503 object
= build_non_dependent_expr (object
);
2508 The type of the first expression shall be "class object" (of a
2510 if (!currently_open_class (object_type
)
2511 && !complete_type_or_else (object_type
, object
))
2512 return error_mark_node
;
2513 if (!CLASS_TYPE_P (object_type
))
2515 if (complain
& tf_error
)
2516 error ("request for member %qD in %qE, which is of non-class type %qT",
2517 name
, object
, object_type
);
2518 return error_mark_node
;
2521 if (BASELINK_P (name
))
2522 /* A member function that has already been looked up. */
2526 bool is_template_id
= false;
2527 tree template_args
= NULL_TREE
;
2530 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2532 is_template_id
= true;
2533 template_args
= TREE_OPERAND (name
, 1);
2534 name
= TREE_OPERAND (name
, 0);
2536 if (TREE_CODE (name
) == OVERLOAD
)
2537 name
= DECL_NAME (get_first_fn (name
));
2538 else if (DECL_P (name
))
2539 name
= DECL_NAME (name
);
2542 if (TREE_CODE (name
) == SCOPE_REF
)
2544 /* A qualified name. The qualifying class or namespace `S'
2545 has already been looked up; it is either a TYPE or a
2547 scope
= TREE_OPERAND (name
, 0);
2548 name
= TREE_OPERAND (name
, 1);
2550 /* If SCOPE is a namespace, then the qualified name does not
2551 name a member of OBJECT_TYPE. */
2552 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2554 if (complain
& tf_error
)
2555 error ("%<%D::%D%> is not a member of %qT",
2556 scope
, name
, object_type
);
2557 return error_mark_node
;
2560 gcc_assert (CLASS_TYPE_P (scope
));
2561 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
2562 || TREE_CODE (name
) == BIT_NOT_EXPR
);
2564 if (constructor_name_p (name
, scope
))
2566 if (complain
& tf_error
)
2567 error ("cannot call constructor %<%T::%D%> directly",
2569 return error_mark_node
;
2572 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2573 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2574 if (access_path
== error_mark_node
)
2575 return error_mark_node
;
2578 if (complain
& tf_error
)
2579 error ("%qT is not a base of %qT", scope
, object_type
);
2580 return error_mark_node
;
2586 access_path
= object_type
;
2589 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2590 member
= lookup_destructor (object
, scope
, name
);
2593 /* Look up the member. */
2594 member
= lookup_member (access_path
, name
, /*protect=*/1,
2595 /*want_type=*/false);
2596 if (member
== NULL_TREE
)
2598 if (complain
& tf_error
)
2599 error ("%qD has no member named %qE", object_type
, name
);
2600 return error_mark_node
;
2602 if (member
== error_mark_node
)
2603 return error_mark_node
;
2608 tree templ
= member
;
2610 if (BASELINK_P (templ
))
2611 templ
= lookup_template_function (templ
, template_args
);
2614 if (complain
& tf_error
)
2615 error ("%qD is not a member template function", name
);
2616 return error_mark_node
;
2621 if (TREE_DEPRECATED (member
))
2622 warn_deprecated_use (member
, NULL_TREE
);
2625 check_template_keyword (member
);
2627 expr
= build_class_member_access_expr (object
, member
, access_path
,
2628 /*preserve_reference=*/false,
2630 if (processing_template_decl
&& expr
!= error_mark_node
)
2632 if (BASELINK_P (member
))
2634 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2635 BASELINK_QUALIFIED_P (member
) = 1;
2638 return build_min_non_dep (COMPONENT_REF
, expr
,
2639 orig_object
, orig_name
,
2646 /* Return an expression for the MEMBER_NAME field in the internal
2647 representation of PTRMEM, a pointer-to-member function. (Each
2648 pointer-to-member function type gets its own RECORD_TYPE so it is
2649 more convenient to access the fields by name than by FIELD_DECL.)
2650 This routine converts the NAME to a FIELD_DECL and then creates the
2651 node for the complete expression. */
2654 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2660 /* This code is a stripped down version of
2661 build_class_member_access_expr. It does not work to use that
2662 routine directly because it expects the object to be of class
2664 ptrmem_type
= TREE_TYPE (ptrmem
);
2665 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2666 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2667 /*want_type=*/false);
2668 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2669 cp_type_quals (ptrmem_type
));
2670 return fold_build3_loc (input_location
,
2671 COMPONENT_REF
, member_type
,
2672 ptrmem
, member
, NULL_TREE
);
2675 /* Given an expression PTR for a pointer, return an expression
2676 for the value pointed to.
2677 ERRORSTRING is the name of the operator to appear in error messages.
2679 This function may need to overload OPERATOR_FNNAME.
2680 Must also handle REFERENCE_TYPEs for C++. */
2683 build_x_indirect_ref (tree expr
, ref_operator errorstring
,
2684 tsubst_flags_t complain
)
2686 tree orig_expr
= expr
;
2689 if (processing_template_decl
)
2691 /* Retain the type if we know the operand is a pointer so that
2692 describable_type doesn't make auto deduction break. */
2693 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2694 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2695 if (type_dependent_expression_p (expr
))
2696 return build_min_nt (INDIRECT_REF
, expr
);
2697 expr
= build_non_dependent_expr (expr
);
2700 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, expr
, NULL_TREE
,
2701 NULL_TREE
, /*overloaded_p=*/NULL
, complain
);
2703 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2705 if (processing_template_decl
&& rval
!= error_mark_node
)
2706 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2711 /* Helper function called from c-common. */
2713 build_indirect_ref (location_t loc
__attribute__ ((__unused__
)),
2714 tree ptr
, ref_operator errorstring
)
2716 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2720 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2721 tsubst_flags_t complain
)
2725 if (ptr
== error_mark_node
)
2726 return error_mark_node
;
2728 if (ptr
== current_class_ptr
)
2729 return current_class_ref
;
2731 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2732 ? ptr
: decay_conversion (ptr
));
2733 type
= TREE_TYPE (pointer
);
2735 if (POINTER_TYPE_P (type
))
2739 If the type of the expression is "pointer to T," the type
2740 of the result is "T." */
2741 tree t
= TREE_TYPE (type
);
2743 if (CONVERT_EXPR_P (ptr
)
2744 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2746 /* If a warning is issued, mark it to avoid duplicates from
2747 the backend. This only needs to be done at
2748 warn_strict_aliasing > 2. */
2749 if (warn_strict_aliasing
> 2)
2750 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2751 type
, TREE_OPERAND (ptr
, 0)))
2752 TREE_NO_WARNING (ptr
) = 1;
2755 if (VOID_TYPE_P (t
))
2757 /* A pointer to incomplete type (other than cv void) can be
2758 dereferenced [expr.unary.op]/1 */
2759 if (complain
& tf_error
)
2760 error ("%qT is not a pointer-to-object type", type
);
2761 return error_mark_node
;
2763 else if (TREE_CODE (pointer
) == ADDR_EXPR
2764 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2765 /* The POINTER was something like `&x'. We simplify `*&x' to
2767 return TREE_OPERAND (pointer
, 0);
2770 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2772 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2773 so that we get the proper error message if the result is used
2774 to assign to. Also, &* is supposed to be a no-op. */
2775 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2776 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2777 TREE_SIDE_EFFECTS (ref
)
2778 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2782 else if (!(complain
& tf_error
))
2783 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2785 /* `pointer' won't be an error_mark_node if we were given a
2786 pointer to member, so it's cool to check for this here. */
2787 else if (TYPE_PTR_TO_MEMBER_P (type
))
2788 switch (errorstring
)
2790 case RO_ARRAY_INDEXING
:
2791 error ("invalid use of array indexing on pointer to member");
2794 error ("invalid use of unary %<*%> on pointer to member");
2796 case RO_IMPLICIT_CONVERSION
:
2797 error ("invalid use of implicit conversion on pointer to member");
2802 else if (pointer
!= error_mark_node
)
2803 switch (errorstring
)
2806 error ("invalid type argument");
2808 case RO_ARRAY_INDEXING
:
2809 error ("invalid type argument of array indexing");
2812 error ("invalid type argument of unary %<*%>");
2814 case RO_IMPLICIT_CONVERSION
:
2815 error ("invalid type argument of implicit conversion");
2820 return error_mark_node
;
2823 /* This handles expressions of the form "a[i]", which denotes
2826 This is logically equivalent in C to *(a+i), but we may do it differently.
2827 If A is a variable or a member, we generate a primitive ARRAY_REF.
2828 This avoids forcing the array out of registers, and can work on
2829 arrays that are not lvalues (for example, members of structures returned
2832 If INDEX is of some user-defined type, it must be converted to
2833 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2834 will inherit the type of the array, which will be some pointer type.
2836 LOC is the location to use in building the array reference. */
2839 build_array_ref (location_t loc
, tree array
, tree idx
)
2845 error_at (loc
, "subscript missing in array reference");
2846 return error_mark_node
;
2849 if (TREE_TYPE (array
) == error_mark_node
2850 || TREE_TYPE (idx
) == error_mark_node
)
2851 return error_mark_node
;
2853 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2855 switch (TREE_CODE (array
))
2859 tree value
= build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
);
2860 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
2861 TREE_OPERAND (array
, 0), value
);
2862 SET_EXPR_LOCATION (ret
, loc
);
2867 ret
= build_conditional_expr
2868 (TREE_OPERAND (array
, 0),
2869 build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
),
2870 build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
),
2871 tf_warning_or_error
);
2872 protected_set_expr_location (ret
, loc
);
2879 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2883 warn_array_subscript_with_type_char (idx
);
2885 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
2887 error_at (loc
, "array subscript is not an integer");
2888 return error_mark_node
;
2891 /* Apply integral promotions *after* noticing character types.
2892 (It is unclear why we do these promotions -- the standard
2893 does not say that we should. In fact, the natural thing would
2894 seem to be to convert IDX to ptrdiff_t; we're performing
2895 pointer arithmetic.) */
2896 idx
= perform_integral_promotions (idx
);
2898 /* An array that is indexed by a non-constant
2899 cannot be stored in a register; we must be able to do
2900 address arithmetic on its address.
2901 Likewise an array of elements of variable size. */
2902 if (TREE_CODE (idx
) != INTEGER_CST
2903 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2904 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2907 if (!cxx_mark_addressable (array
))
2908 return error_mark_node
;
2911 /* An array that is indexed by a constant value which is not within
2912 the array bounds cannot be stored in a register either; because we
2913 would get a crash in store_bit_field/extract_bit_field when trying
2914 to access a non-existent part of the register. */
2915 if (TREE_CODE (idx
) == INTEGER_CST
2916 && TYPE_DOMAIN (TREE_TYPE (array
))
2917 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
2919 if (!cxx_mark_addressable (array
))
2920 return error_mark_node
;
2923 if (!lvalue_p (array
))
2924 pedwarn (loc
, OPT_pedantic
,
2925 "ISO C++ forbids subscripting non-lvalue array");
2927 /* Note in C++ it is valid to subscript a `register' array, since
2928 it is valid to take the address of something with that
2929 storage specification. */
2933 while (TREE_CODE (foo
) == COMPONENT_REF
)
2934 foo
= TREE_OPERAND (foo
, 0);
2935 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2936 warning_at (loc
, OPT_Wextra
,
2937 "subscripting array declared %<register%>");
2940 type
= TREE_TYPE (TREE_TYPE (array
));
2941 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
2942 /* Array ref is const/volatile if the array elements are
2943 or if the array is.. */
2944 TREE_READONLY (rval
)
2945 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2946 TREE_SIDE_EFFECTS (rval
)
2947 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2948 TREE_THIS_VOLATILE (rval
)
2949 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2950 ret
= require_complete_type (fold_if_not_in_template (rval
));
2951 protected_set_expr_location (ret
, loc
);
2956 tree ar
= default_conversion (array
);
2957 tree ind
= default_conversion (idx
);
2959 /* Put the integer in IND to simplify error checking. */
2960 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2967 if (ar
== error_mark_node
)
2970 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2972 error_at (loc
, "subscripted value is neither array nor pointer");
2973 return error_mark_node
;
2975 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2977 error_at (loc
, "array subscript is not an integer");
2978 return error_mark_node
;
2981 warn_array_subscript_with_type_char (idx
);
2983 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
2985 tf_warning_or_error
),
2987 tf_warning_or_error
);
2988 protected_set_expr_location (ret
, loc
);
2993 /* Resolve a pointer to member function. INSTANCE is the object
2994 instance to use, if the member points to a virtual member.
2996 This used to avoid checking for virtual functions if basetype
2997 has no virtual functions, according to an earlier ANSI draft.
2998 With the final ISO C++ rules, such an optimization is
2999 incorrect: A pointer to a derived member can be static_cast
3000 to pointer-to-base-member, as long as the dynamic object
3001 later has the right member. */
3004 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
)
3006 if (TREE_CODE (function
) == OFFSET_REF
)
3007 function
= TREE_OPERAND (function
, 1);
3009 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3011 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
3012 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3014 tree instance_ptr
= *instance_ptrptr
;
3015 tree instance_save_expr
= 0;
3016 if (instance_ptr
== error_mark_node
)
3018 if (TREE_CODE (function
) == PTRMEM_CST
)
3020 /* Extracting the function address from a pmf is only
3021 allowed with -Wno-pmf-conversions. It only works for
3023 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
3024 e1
= convert (fntype
, e1
);
3029 error ("object missing in use of %qE", function
);
3030 return error_mark_node
;
3034 if (TREE_SIDE_EFFECTS (instance_ptr
))
3035 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3037 if (TREE_SIDE_EFFECTS (function
))
3038 function
= save_expr (function
);
3040 /* Start by extracting all the information from the PMF itself. */
3041 e3
= pfn_from_ptrmemfunc (function
);
3042 delta
= delta_from_ptrmemfunc (function
);
3043 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3044 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3046 case ptrmemfunc_vbit_in_pfn
:
3047 e1
= cp_build_binary_op (input_location
,
3048 BIT_AND_EXPR
, idx
, integer_one_node
,
3049 tf_warning_or_error
);
3050 idx
= cp_build_binary_op (input_location
,
3051 MINUS_EXPR
, idx
, integer_one_node
,
3052 tf_warning_or_error
);
3055 case ptrmemfunc_vbit_in_delta
:
3056 e1
= cp_build_binary_op (input_location
,
3057 BIT_AND_EXPR
, delta
, integer_one_node
,
3058 tf_warning_or_error
);
3059 delta
= cp_build_binary_op (input_location
,
3060 RSHIFT_EXPR
, delta
, integer_one_node
,
3061 tf_warning_or_error
);
3068 /* Convert down to the right base before using the instance. A
3069 special case is that in a pointer to member of class C, C may
3070 be incomplete. In that case, the function will of course be
3071 a member of C, and no conversion is required. In fact,
3072 lookup_base will fail in that case, because incomplete
3073 classes do not have BINFOs. */
3074 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3075 if (!same_type_ignoring_top_level_qualifiers_p
3076 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3078 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3079 basetype
, ba_check
, NULL
);
3080 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3082 if (instance_ptr
== error_mark_node
)
3083 return error_mark_node
;
3085 /* ...and then the delta in the PMF. */
3086 instance_ptr
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (instance_ptr
),
3087 instance_ptr
, fold_convert (sizetype
, delta
));
3089 /* Hand back the adjusted 'this' argument to our caller. */
3090 *instance_ptrptr
= instance_ptr
;
3092 /* Next extract the vtable pointer from the object. */
3093 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3095 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, tf_warning_or_error
);
3096 /* If the object is not dynamic the access invokes undefined
3097 behavior. As it is not executed in this case silence the
3098 spurious warnings it may provoke. */
3099 TREE_NO_WARNING (vtbl
) = 1;
3101 /* Finally, extract the function pointer from the vtable. */
3102 e2
= fold_build2_loc (input_location
,
3103 POINTER_PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
,
3104 fold_convert (sizetype
, idx
));
3105 e2
= cp_build_indirect_ref (e2
, RO_NULL
, tf_warning_or_error
);
3106 TREE_CONSTANT (e2
) = 1;
3108 /* When using function descriptors, the address of the
3109 vtable entry is treated as a function pointer. */
3110 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3111 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3112 cp_build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1,
3113 tf_warning_or_error
));
3115 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3116 e1
= build_conditional_expr (e1
, e2
, e3
, tf_warning_or_error
);
3118 /* Make sure this doesn't get evaluated first inside one of the
3119 branches of the COND_EXPR. */
3120 if (instance_save_expr
)
3121 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3122 instance_save_expr
, e1
);
3129 /* Used by the C-common bits. */
3131 build_function_call (location_t loc ATTRIBUTE_UNUSED
,
3132 tree function
, tree params
)
3134 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3137 /* Used by the C-common bits. */
3139 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED
,
3140 tree function
, VEC(tree
,gc
) *params
,
3141 VEC(tree
,gc
) *origtypes ATTRIBUTE_UNUSED
)
3143 VEC(tree
,gc
) *orig_params
= params
;
3144 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3145 tf_warning_or_error
);
3147 /* cp_build_function_call_vec can reallocate PARAMS by adding
3148 default arguments. That should never happen here. Verify
3150 gcc_assert (params
== orig_params
);
3155 /* Build a function call using a tree list of arguments. */
3158 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3163 vec
= make_tree_vector ();
3164 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3165 VEC_safe_push (tree
, gc
, vec
, TREE_VALUE (params
));
3166 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3167 release_tree_vector (vec
);
3171 /* Build a function call using a vector of arguments. PARAMS may be
3172 NULL if there are no parameters. This changes the contents of
3176 cp_build_function_call_vec (tree function
, VEC(tree
,gc
) **params
,
3177 tsubst_flags_t complain
)
3179 tree fntype
, fndecl
;
3181 tree original
= function
;
3185 VEC(tree
,gc
) *allocated
= NULL
;
3188 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3189 expressions, like those used for ObjC messenger dispatches. */
3190 if (params
!= NULL
&& !VEC_empty (tree
, *params
))
3191 function
= objc_rewrite_function_call (function
,
3192 VEC_index (tree
, *params
, 0));
3194 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3195 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3196 if (TREE_CODE (function
) == NOP_EXPR
3197 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3198 function
= TREE_OPERAND (function
, 0);
3200 if (TREE_CODE (function
) == FUNCTION_DECL
)
3202 mark_used (function
);
3205 /* Convert anything with function type to a pointer-to-function. */
3206 if (DECL_MAIN_P (function
) && (complain
& tf_error
))
3207 pedwarn (input_location
, OPT_pedantic
,
3208 "ISO C++ forbids calling %<::main%> from within program");
3210 function
= build_addr_func (function
);
3216 function
= build_addr_func (function
);
3219 if (function
== error_mark_node
)
3220 return error_mark_node
;
3222 fntype
= TREE_TYPE (function
);
3224 if (TYPE_PTRMEMFUNC_P (fntype
))
3226 if (complain
& tf_error
)
3227 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3228 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3229 original
, original
);
3230 return error_mark_node
;
3233 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
3234 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3236 if (!((TREE_CODE (fntype
) == POINTER_TYPE
3237 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
3239 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3241 if (complain
& tf_error
)
3242 error ("%qE cannot be used as a function", original
);
3243 return error_mark_node
;
3246 /* fntype now gets the type of function pointed to. */
3247 fntype
= TREE_TYPE (fntype
);
3248 parm_types
= TYPE_ARG_TYPES (fntype
);
3252 allocated
= make_tree_vector ();
3253 params
= &allocated
;
3256 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3259 return error_mark_node
;
3261 argarray
= VEC_address (tree
, *params
);
3263 /* Check for errors in format strings and inappropriately
3265 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
3268 ret
= build_cxx_call (function
, nargs
, argarray
);
3270 if (allocated
!= NULL
)
3271 release_tree_vector (allocated
);
3276 /* Convert the actual parameter expressions in the list VALUES to the
3277 types in the list TYPELIST. The converted expressions are stored
3278 back in the VALUES vector.
3279 If parmdecls is exhausted, or when an element has NULL as its type,
3280 perform the default conversions.
3282 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3284 This is also where warnings about wrong number of args are generated.
3286 Returns the actual number of arguments processed (which might be less
3287 than the length of the vector), or -1 on error.
3289 In C++, unspecified trailing parameters can be filled in with their
3290 default arguments, if such were specified. Do so here. */
3293 convert_arguments (tree typelist
, VEC(tree
,gc
) **values
, tree fndecl
,
3294 int flags
, tsubst_flags_t complain
)
3297 const char *called_thing
= 0;
3300 /* Argument passing is always copy-initialization. */
3301 flags
|= LOOKUP_ONLYCONVERTING
;
3305 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3307 if (DECL_NAME (fndecl
) == NULL_TREE
3308 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3309 called_thing
= "constructor";
3311 called_thing
= "member function";
3314 called_thing
= "function";
3317 for (i
= 0, typetail
= typelist
;
3318 i
< VEC_length (tree
, *values
);
3321 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3322 tree val
= VEC_index (tree
, *values
, i
);
3324 if (val
== error_mark_node
|| type
== error_mark_node
)
3327 if (type
== void_type_node
)
3329 if (complain
& tf_error
)
3333 error_at (input_location
, "too many arguments to %s %q#D",
3334 called_thing
, fndecl
);
3335 inform (DECL_SOURCE_LOCATION (fndecl
),
3339 error ("too many arguments to function");
3346 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3347 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3348 if (TREE_CODE (val
) == NOP_EXPR
3349 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3350 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3351 val
= TREE_OPERAND (val
, 0);
3353 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3355 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3356 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3357 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3358 val
= decay_conversion (val
);
3361 if (val
== error_mark_node
)
3366 /* Formal parm type is specified by a function prototype. */
3369 if (!COMPLETE_TYPE_P (complete_type (type
)))
3371 if (complain
& tf_error
)
3374 error ("parameter %P of %qD has incomplete type %qT",
3377 error ("parameter %P has incomplete type %qT", i
, type
);
3379 parmval
= error_mark_node
;
3383 parmval
= convert_for_initialization
3384 (NULL_TREE
, type
, val
, flags
,
3385 "argument passing", fndecl
, i
, complain
);
3386 parmval
= convert_for_arg_passing (type
, parmval
);
3389 if (parmval
== error_mark_node
)
3392 VEC_replace (tree
, *values
, i
, parmval
);
3396 if (fndecl
&& DECL_BUILT_IN (fndecl
)
3397 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
3398 /* Don't do ellipsis conversion for __built_in_constant_p
3399 as this will result in spurious errors for non-trivial
3401 val
= require_complete_type (val
);
3403 val
= convert_arg_to_ellipsis (val
);
3405 VEC_replace (tree
, *values
, i
, val
);
3409 typetail
= TREE_CHAIN (typetail
);
3412 if (typetail
!= 0 && typetail
!= void_list_node
)
3414 /* See if there are default arguments that can be used. Because
3415 we hold default arguments in the FUNCTION_TYPE (which is so
3416 wrong), we can see default parameters here from deduced
3417 contexts (and via typeof) for indirect function calls.
3418 Fortunately we know whether we have a function decl to
3419 provide default arguments in a language conformant
3421 if (fndecl
&& TREE_PURPOSE (typetail
)
3422 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3424 for (; typetail
!= void_list_node
; ++i
)
3427 = convert_default_arg (TREE_VALUE (typetail
),
3428 TREE_PURPOSE (typetail
),
3431 if (parmval
== error_mark_node
)
3434 VEC_safe_push (tree
, gc
, *values
, parmval
);
3435 typetail
= TREE_CHAIN (typetail
);
3436 /* ends with `...'. */
3437 if (typetail
== NULL_TREE
)
3443 if (complain
& tf_error
)
3447 error_at (input_location
, "too few arguments to %s %q#D",
3448 called_thing
, fndecl
);
3449 inform (DECL_SOURCE_LOCATION (fndecl
),
3453 error ("too few arguments to function");
3462 /* Build a binary-operation expression, after performing default
3463 conversions on the operands. CODE is the kind of expression to
3464 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3465 are the tree codes which correspond to ARG1 and ARG2 when issuing
3466 warnings about possibly misplaced parentheses. They may differ
3467 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3468 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3469 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3470 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3471 ARG2_CODE as ERROR_MARK. */
3474 build_x_binary_op (enum tree_code code
, tree arg1
, enum tree_code arg1_code
,
3475 tree arg2
, enum tree_code arg2_code
, bool *overloaded_p
,
3476 tsubst_flags_t complain
)
3485 if (processing_template_decl
)
3487 if (type_dependent_expression_p (arg1
)
3488 || type_dependent_expression_p (arg2
))
3489 return build_min_nt (code
, arg1
, arg2
);
3490 arg1
= build_non_dependent_expr (arg1
);
3491 arg2
= build_non_dependent_expr (arg2
);
3494 if (code
== DOTSTAR_EXPR
)
3495 expr
= build_m_component_ref (arg1
, arg2
);
3497 expr
= build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3498 overloaded_p
, complain
);
3500 /* Check for cases such as x+y<<z which users are likely to
3501 misinterpret. But don't warn about obj << x + y, since that is a
3502 common idiom for I/O. */
3503 if (warn_parentheses
3504 && (complain
& tf_warning
)
3505 && !processing_template_decl
3506 && !error_operand_p (arg1
)
3507 && !error_operand_p (arg2
)
3508 && (code
!= LSHIFT_EXPR
3509 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3510 warn_about_parentheses (code
, arg1_code
, orig_arg1
, arg2_code
, orig_arg2
);
3512 if (processing_template_decl
&& expr
!= error_mark_node
)
3513 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3518 /* Build and return an ARRAY_REF expression. */
3521 build_x_array_ref (tree arg1
, tree arg2
, tsubst_flags_t complain
)
3523 tree orig_arg1
= arg1
;
3524 tree orig_arg2
= arg2
;
3527 if (processing_template_decl
)
3529 if (type_dependent_expression_p (arg1
)
3530 || type_dependent_expression_p (arg2
))
3531 return build_min_nt (ARRAY_REF
, arg1
, arg2
,
3532 NULL_TREE
, NULL_TREE
);
3533 arg1
= build_non_dependent_expr (arg1
);
3534 arg2
= build_non_dependent_expr (arg2
);
3537 expr
= build_new_op (ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3538 /*overloaded_p=*/NULL
, complain
);
3540 if (processing_template_decl
&& expr
!= error_mark_node
)
3541 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3542 NULL_TREE
, NULL_TREE
);
3546 /* For the c-common bits. */
3548 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3549 int convert_p ATTRIBUTE_UNUSED
)
3551 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3555 /* Build a binary-operation expression without default conversions.
3556 CODE is the kind of expression to build.
3557 LOCATION is the location_t of the operator in the source code.
3558 This function differs from `build' in several ways:
3559 the data type of the result is computed and recorded in it,
3560 warnings are generated if arg data types are invalid,
3561 special handling for addition and subtraction of pointers is known,
3562 and some optimization is done (operations on narrow ints
3563 are done in the narrower type when that gives the same result).
3564 Constant folding is also done before the result is returned.
3566 Note that the operands will never have enumeral types
3567 because either they have just had the default conversions performed
3568 or they have both just been converted to some other type in which
3569 the arithmetic is to be done.
3571 C++: must do special pointer arithmetic when implementing
3572 multiple inheritance, and deal with pointer to member functions. */
3575 cp_build_binary_op (location_t location
,
3576 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3577 tsubst_flags_t complain
)
3580 enum tree_code code0
, code1
;
3582 const char *invalid_op_diag
;
3584 /* Expression code to give to the expression when it is built.
3585 Normally this is CODE, which is what the caller asked for,
3586 but in some special cases we change it. */
3587 enum tree_code resultcode
= code
;
3589 /* Data type in which the computation is to be performed.
3590 In the simplest cases this is the common type of the arguments. */
3591 tree result_type
= NULL
;
3593 /* Nonzero means operands have already been type-converted
3594 in whatever way is necessary.
3595 Zero means they need to be converted to RESULT_TYPE. */
3598 /* Nonzero means create the expression with this type, rather than
3600 tree build_type
= 0;
3602 /* Nonzero means after finally constructing the expression
3603 convert it to this type. */
3604 tree final_type
= 0;
3608 /* Nonzero if this is an operation like MIN or MAX which can
3609 safely be computed in short if both args are promoted shorts.
3610 Also implies COMMON.
3611 -1 indicates a bitwise operation; this makes a difference
3612 in the exact conditions for when it is safe to do the operation
3613 in a narrower mode. */
3616 /* Nonzero if this is a comparison operation;
3617 if both args are promoted shorts, compare the original shorts.
3618 Also implies COMMON. */
3619 int short_compare
= 0;
3621 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3624 /* True if both operands have arithmetic type. */
3625 bool arithmetic_types_p
;
3627 /* Apply default conversions. */
3631 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3632 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3633 || code
== TRUTH_XOR_EXPR
)
3635 if (!really_overloaded_fn (op0
))
3636 op0
= decay_conversion (op0
);
3637 if (!really_overloaded_fn (op1
))
3638 op1
= decay_conversion (op1
);
3642 if (!really_overloaded_fn (op0
))
3643 op0
= default_conversion (op0
);
3644 if (!really_overloaded_fn (op1
))
3645 op1
= default_conversion (op1
);
3648 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3649 STRIP_TYPE_NOPS (op0
);
3650 STRIP_TYPE_NOPS (op1
);
3652 /* DTRT if one side is an overloaded function, but complain about it. */
3653 if (type_unknown_p (op0
))
3655 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3656 if (t
!= error_mark_node
)
3658 if (complain
& tf_error
)
3659 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3664 if (type_unknown_p (op1
))
3666 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3667 if (t
!= error_mark_node
)
3669 if (complain
& tf_error
)
3670 permerror (input_location
, "assuming cast to type %qT from overloaded function",
3676 type0
= TREE_TYPE (op0
);
3677 type1
= TREE_TYPE (op1
);
3679 /* The expression codes of the data types of the arguments tell us
3680 whether the arguments are integers, floating, pointers, etc. */
3681 code0
= TREE_CODE (type0
);
3682 code1
= TREE_CODE (type1
);
3684 /* If an error was already reported for one of the arguments,
3685 avoid reporting another error. */
3686 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3687 return error_mark_node
;
3689 if ((invalid_op_diag
3690 = targetm
.invalid_binary_op (code
, type0
, type1
)))
3692 error (invalid_op_diag
);
3693 return error_mark_node
;
3696 /* Issue warnings about peculiar, but valid, uses of NULL. */
3697 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
3698 /* It's reasonable to use pointer values as operands of &&
3699 and ||, so NULL is no exception. */
3700 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
3701 && ( /* Both are NULL (or 0) and the operation was not a
3702 comparison or a pointer subtraction. */
3703 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
3704 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
3705 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3706 || (!null_ptr_cst_p (orig_op0
)
3707 && !TYPE_PTR_P (type0
) && !TYPE_PTR_TO_MEMBER_P (type0
))
3708 || (!null_ptr_cst_p (orig_op1
)
3709 && !TYPE_PTR_P (type1
) && !TYPE_PTR_TO_MEMBER_P (type1
)))
3710 && (complain
& tf_warning
))
3711 /* Some sort of arithmetic operation involving NULL was
3713 warning (OPT_Wpointer_arith
, "NULL used in arithmetic");
3718 /* Subtraction of two similar pointers.
3719 We must subtract them as integers, then divide by object size. */
3720 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3721 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
3723 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
));
3724 /* In all other cases except pointer - int, the usual arithmetic
3726 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
3731 /* The pointer - int case is just like pointer + int; fall
3734 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
3735 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
3739 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
3740 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
3741 if (processing_template_decl
)
3743 result_type
= TREE_TYPE (ptr_operand
);
3746 return cp_pointer_int_sum (code
,
3757 case TRUNC_DIV_EXPR
:
3759 case FLOOR_DIV_EXPR
:
3760 case ROUND_DIV_EXPR
:
3761 case EXACT_DIV_EXPR
:
3762 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3763 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
3764 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3765 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
3767 enum tree_code tcode0
= code0
, tcode1
= code1
;
3769 warn_for_div_by_zero (location
, op1
);
3771 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
3772 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
3773 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
3774 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
3776 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
3777 resultcode
= RDIV_EXPR
;
3779 /* When dividing two signed integers, we have to promote to int.
3780 unless we divide by a constant != -1. Note that default
3781 conversion will have been performed on the operands at this
3782 point, so we have to dig out the original type to find out if
3784 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3785 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3786 || (TREE_CODE (op1
) == INTEGER_CST
3787 && ! integer_all_onesp (op1
)));
3796 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3797 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3798 && !VECTOR_FLOAT_TYPE_P (type0
)
3799 && !VECTOR_FLOAT_TYPE_P (type1
)))
3803 case TRUNC_MOD_EXPR
:
3804 case FLOOR_MOD_EXPR
:
3805 warn_for_div_by_zero (location
, op1
);
3807 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
3808 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
3809 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
3811 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3813 /* Although it would be tempting to shorten always here, that loses
3814 on some targets, since the modulo instruction is undefined if the
3815 quotient can't be represented in the computation mode. We shorten
3816 only if unsigned or if dividing by something we know != -1. */
3817 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3818 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3819 || (TREE_CODE (op1
) == INTEGER_CST
3820 && ! integer_all_onesp (op1
)));
3825 case TRUTH_ANDIF_EXPR
:
3826 case TRUTH_ORIF_EXPR
:
3827 case TRUTH_AND_EXPR
:
3829 result_type
= boolean_type_node
;
3832 /* Shift operations: result has same type as first operand;
3833 always convert second operand to int.
3834 Also set SHORT_SHIFT if shifting rightward. */
3837 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3839 result_type
= type0
;
3840 if (TREE_CODE (op1
) == INTEGER_CST
)
3842 if (tree_int_cst_lt (op1
, integer_zero_node
))
3844 if ((complain
& tf_warning
)
3845 && c_inhibit_evaluation_warnings
== 0)
3846 warning (0, "right shift count is negative");
3850 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0
3851 && (complain
& tf_warning
)
3852 && c_inhibit_evaluation_warnings
== 0)
3853 warning (0, "right shift count >= width of type");
3856 /* Convert the shift-count to an integer, regardless of
3857 size of value being shifted. */
3858 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3859 op1
= cp_convert (integer_type_node
, op1
);
3860 /* Avoid converting op1 to result_type later. */
3866 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3868 result_type
= type0
;
3869 if (TREE_CODE (op1
) == INTEGER_CST
)
3871 if (tree_int_cst_lt (op1
, integer_zero_node
))
3873 if ((complain
& tf_warning
)
3874 && c_inhibit_evaluation_warnings
== 0)
3875 warning (0, "left shift count is negative");
3877 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3879 if ((complain
& tf_warning
)
3880 && c_inhibit_evaluation_warnings
== 0)
3881 warning (0, "left shift count >= width of type");
3884 /* Convert the shift-count to an integer, regardless of
3885 size of value being shifted. */
3886 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3887 op1
= cp_convert (integer_type_node
, op1
);
3888 /* Avoid converting op1 to result_type later. */
3895 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3897 result_type
= type0
;
3898 if (TREE_CODE (op1
) == INTEGER_CST
)
3900 if (tree_int_cst_lt (op1
, integer_zero_node
))
3902 if (complain
& tf_warning
)
3903 warning (0, (code
== LROTATE_EXPR
)
3904 ? G_("left rotate count is negative")
3905 : G_("right rotate count is negative"));
3907 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3909 if (complain
& tf_warning
)
3910 warning (0, (code
== LROTATE_EXPR
)
3911 ? G_("left rotate count >= width of type")
3912 : G_("right rotate count >= width of type"));
3915 /* Convert the shift-count to an integer, regardless of
3916 size of value being shifted. */
3917 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3918 op1
= cp_convert (integer_type_node
, op1
);
3924 if ((complain
& tf_warning
)
3925 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
3926 warning (OPT_Wfloat_equal
,
3927 "comparing floating point with == or != is unsafe");
3928 if ((complain
& tf_warning
)
3929 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
3930 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
3931 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
3933 build_type
= boolean_type_node
;
3934 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3935 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
3936 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3937 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
3939 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3940 || (TYPE_PTRMEM_P (type0
) && TYPE_PTRMEM_P (type1
)))
3941 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3942 CPO_COMPARISON
, complain
);
3943 else if ((code0
== POINTER_TYPE
|| TYPE_PTRMEM_P (type0
))
3944 && null_ptr_cst_p (op1
))
3946 if (TREE_CODE (op0
) == ADDR_EXPR
3947 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
3949 if (complain
& tf_warning
)
3950 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3951 TREE_OPERAND (op0
, 0));
3953 result_type
= type0
;
3955 else if ((code1
== POINTER_TYPE
|| TYPE_PTRMEM_P (type1
))
3956 && null_ptr_cst_p (op0
))
3958 if (TREE_CODE (op1
) == ADDR_EXPR
3959 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
3961 if (complain
& tf_warning
)
3962 warning (OPT_Waddress
, "the address of %qD will never be NULL",
3963 TREE_OPERAND (op1
, 0));
3965 result_type
= type1
;
3967 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3969 result_type
= type0
;
3970 if (complain
& tf_error
)
3971 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3973 return error_mark_node
;
3975 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3977 result_type
= type1
;
3978 if (complain
& tf_error
)
3979 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
3981 return error_mark_node
;
3983 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3985 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3986 == ptrmemfunc_vbit_in_delta
)
3988 tree pfn0
= pfn_from_ptrmemfunc (op0
);
3989 tree delta0
= delta_from_ptrmemfunc (op0
);
3990 tree e1
= cp_build_binary_op (location
,
3993 fold_convert (TREE_TYPE (pfn0
),
3996 tree e2
= cp_build_binary_op (location
,
4001 e2
= cp_build_binary_op (location
,
4002 EQ_EXPR
, e2
, integer_zero_node
,
4004 op0
= cp_build_binary_op (location
,
4005 TRUTH_ANDIF_EXPR
, e1
, e2
,
4007 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
);
4011 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4012 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
4014 result_type
= TREE_TYPE (op0
);
4016 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4017 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4018 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4021 /* E will be the final comparison. */
4023 /* E1 and E2 are for scratch. */
4031 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4032 CPO_COMPARISON
, complain
);
4034 if (!same_type_p (TREE_TYPE (op0
), type
))
4035 op0
= cp_convert_and_check (type
, op0
);
4036 if (!same_type_p (TREE_TYPE (op1
), type
))
4037 op1
= cp_convert_and_check (type
, op1
);
4039 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4040 return error_mark_node
;
4042 if (TREE_SIDE_EFFECTS (op0
))
4043 op0
= save_expr (op0
);
4044 if (TREE_SIDE_EFFECTS (op1
))
4045 op1
= save_expr (op1
);
4047 pfn0
= pfn_from_ptrmemfunc (op0
);
4048 pfn1
= pfn_from_ptrmemfunc (op1
);
4049 delta0
= delta_from_ptrmemfunc (op0
);
4050 delta1
= delta_from_ptrmemfunc (op1
);
4051 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4052 == ptrmemfunc_vbit_in_delta
)
4057 && ((op0.delta == op1.delta)
4058 || (!op0.pfn && op0.delta & 1 == 0
4059 && op1.delta & 1 == 0))
4061 The reason for the `!op0.pfn' bit is that a NULL
4062 pointer-to-member is any member with a zero PFN and
4063 LSB of the DELTA field is 0. */
4065 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4069 e1
= cp_build_binary_op (location
,
4070 EQ_EXPR
, e1
, integer_zero_node
,
4072 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4076 e2
= cp_build_binary_op (location
,
4077 EQ_EXPR
, e2
, integer_zero_node
,
4079 e1
= cp_build_binary_op (location
,
4080 TRUTH_ANDIF_EXPR
, e2
, e1
,
4082 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4084 fold_convert (TREE_TYPE (pfn0
),
4087 e2
= cp_build_binary_op (location
,
4088 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4089 e1
= cp_build_binary_op (location
,
4090 EQ_EXPR
, delta0
, delta1
, complain
);
4091 e1
= cp_build_binary_op (location
,
4092 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4099 && (!op0.pfn || op0.delta == op1.delta))
4101 The reason for the `!op0.pfn' bit is that a NULL
4102 pointer-to-member is any member with a zero PFN; the
4103 DELTA field is unspecified. */
4105 e1
= cp_build_binary_op (location
,
4106 EQ_EXPR
, delta0
, delta1
, complain
);
4107 e2
= cp_build_binary_op (location
,
4110 fold_convert (TREE_TYPE (pfn0
),
4113 e1
= cp_build_binary_op (location
,
4114 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4116 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4117 e
= cp_build_binary_op (location
,
4118 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4119 if (code
== EQ_EXPR
)
4121 return cp_build_binary_op (location
,
4122 EQ_EXPR
, e
, integer_zero_node
, complain
);
4126 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4127 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4129 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4130 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4138 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4139 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4141 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4142 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4143 CPO_COMPARISON
, complain
);
4150 if (TREE_CODE (orig_op0
) == STRING_CST
4151 || TREE_CODE (orig_op1
) == STRING_CST
)
4153 if (complain
& tf_warning
)
4154 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4157 build_type
= boolean_type_node
;
4158 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4159 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4161 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4162 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4163 CPO_COMPARISON
, complain
);
4164 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
4165 && integer_zerop (op1
))
4166 result_type
= type0
;
4167 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
4168 && integer_zerop (op0
))
4169 result_type
= type1
;
4170 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4172 result_type
= type0
;
4173 if (complain
& tf_error
)
4174 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4176 return error_mark_node
;
4178 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4180 result_type
= type1
;
4181 if (complain
& tf_error
)
4182 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4184 return error_mark_node
;
4188 case UNORDERED_EXPR
:
4195 build_type
= integer_type_node
;
4196 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4198 if (complain
& tf_error
)
4199 error ("unordered comparison on non-floating point argument");
4200 return error_mark_node
;
4209 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4210 || code0
== ENUMERAL_TYPE
)
4211 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4212 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4213 arithmetic_types_p
= 1;
4216 arithmetic_types_p
= 0;
4217 /* Vector arithmetic is only allowed when both sides are vectors. */
4218 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4220 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4221 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
4224 binary_op_error (location
, code
, type0
, type1
);
4225 return error_mark_node
;
4227 arithmetic_types_p
= 1;
4230 /* Determine the RESULT_TYPE, if it is not already known. */
4232 && arithmetic_types_p
4233 && (shorten
|| common
|| short_compare
))
4234 result_type
= cp_common_type (type0
, type1
);
4238 if (complain
& tf_error
)
4239 error ("invalid operands of types %qT and %qT to binary %qO",
4240 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4241 return error_mark_node
;
4244 /* If we're in a template, the only thing we need to know is the
4246 if (processing_template_decl
)
4248 /* Since the middle-end checks the type when doing a build2, we
4249 need to build the tree in pieces. This built tree will never
4250 get out of the front-end as we replace it when instantiating
4252 tree tmp
= build2 (resultcode
,
4253 build_type
? build_type
: result_type
,
4255 TREE_OPERAND (tmp
, 0) = op0
;
4259 if (arithmetic_types_p
)
4261 bool first_complex
= (code0
== COMPLEX_TYPE
);
4262 bool second_complex
= (code1
== COMPLEX_TYPE
);
4263 int none_complex
= (!first_complex
&& !second_complex
);
4265 /* Adapted from patch for c/24581. */
4266 if (first_complex
!= second_complex
4267 && (code
== PLUS_EXPR
4268 || code
== MINUS_EXPR
4269 || code
== MULT_EXPR
4270 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4271 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4272 && flag_signed_zeros
)
4274 /* An operation on mixed real/complex operands must be
4275 handled specially, but the language-independent code can
4276 more easily optimize the plain complex arithmetic if
4277 -fno-signed-zeros. */
4278 tree real_type
= TREE_TYPE (result_type
);
4282 if (TREE_TYPE (op0
) != result_type
)
4283 op0
= cp_convert_and_check (result_type
, op0
);
4284 if (TREE_TYPE (op1
) != real_type
)
4285 op1
= cp_convert_and_check (real_type
, op1
);
4289 if (TREE_TYPE (op0
) != real_type
)
4290 op0
= cp_convert_and_check (real_type
, op0
);
4291 if (TREE_TYPE (op1
) != result_type
)
4292 op1
= cp_convert_and_check (result_type
, op1
);
4294 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4295 return error_mark_node
;
4298 op0
= save_expr (op0
);
4299 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4300 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4304 case TRUNC_DIV_EXPR
:
4305 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4309 real
= build2 (resultcode
, real_type
, real
, op1
);
4317 op1
= save_expr (op1
);
4318 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4319 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4323 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4326 real
= build2 (resultcode
, real_type
, op0
, real
);
4329 real
= build2 (resultcode
, real_type
, op0
, real
);
4330 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4336 return build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4339 /* For certain operations (which identify themselves by shorten != 0)
4340 if both args were extended from the same smaller type,
4341 do the arithmetic in that type and then extend.
4343 shorten !=0 and !=1 indicates a bitwise operation.
4344 For them, this optimization is safe only if
4345 both args are zero-extended or both are sign-extended.
4346 Otherwise, we might change the result.
4347 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4348 but calculated in (unsigned short) it would be (unsigned short)-1. */
4350 if (shorten
&& none_complex
)
4352 final_type
= result_type
;
4353 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4357 /* Comparison operations are shortened too but differently.
4358 They identify themselves by setting short_compare = 1. */
4362 /* Don't write &op0, etc., because that would prevent op0
4363 from being kept in a register.
4364 Instead, make copies of the our local variables and
4365 pass the copies by reference, then copy them back afterward. */
4366 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
4367 enum tree_code xresultcode
= resultcode
;
4369 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
4371 return cp_convert (boolean_type_node
, val
);
4372 op0
= xop0
, op1
= xop1
;
4374 resultcode
= xresultcode
;
4377 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
4378 && warn_sign_compare
4379 && !TREE_NO_WARNING (orig_op0
)
4380 && !TREE_NO_WARNING (orig_op1
)
4381 /* Do not warn until the template is instantiated; we cannot
4382 bound the ranges of the arguments until that point. */
4383 && !processing_template_decl
4384 && (complain
& tf_warning
)
4385 && c_inhibit_evaluation_warnings
== 0)
4387 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
4388 result_type
, resultcode
);
4392 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4393 Then the expression will be built.
4394 It will be given type FINAL_TYPE if that is nonzero;
4395 otherwise, it will be given type RESULT_TYPE. */
4398 if (TREE_TYPE (op0
) != result_type
)
4399 op0
= cp_convert_and_check (result_type
, op0
);
4400 if (TREE_TYPE (op1
) != result_type
)
4401 op1
= cp_convert_and_check (result_type
, op1
);
4403 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4404 return error_mark_node
;
4407 if (build_type
== NULL_TREE
)
4408 build_type
= result_type
;
4410 result
= build2 (resultcode
, build_type
, op0
, op1
);
4411 result
= fold_if_not_in_template (result
);
4412 if (final_type
!= 0)
4413 result
= cp_convert (final_type
, result
);
4415 if (TREE_OVERFLOW_P (result
)
4416 && !TREE_OVERFLOW_P (op0
)
4417 && !TREE_OVERFLOW_P (op1
))
4418 overflow_warning (location
, result
);
4423 /* Return a tree for the sum or difference (RESULTCODE says which)
4424 of pointer PTROP and integer INTOP. */
4427 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
)
4429 tree res_type
= TREE_TYPE (ptrop
);
4431 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4432 in certain circumstance (when it's valid to do so). So we need
4433 to make sure it's complete. We don't need to check here, if we
4434 can actually complete it at all, as those checks will be done in
4435 pointer_int_sum() anyway. */
4436 complete_type (TREE_TYPE (res_type
));
4438 return pointer_int_sum (input_location
, resultcode
, ptrop
,
4439 fold_if_not_in_template (intop
));
4442 /* Return a tree for the difference of pointers OP0 and OP1.
4443 The resulting tree has type int. */
4446 pointer_diff (tree op0
, tree op1
, tree ptrtype
)
4449 tree restype
= ptrdiff_type_node
;
4450 tree target_type
= TREE_TYPE (ptrtype
);
4452 if (!complete_type_or_else (target_type
, NULL_TREE
))
4453 return error_mark_node
;
4455 if (TREE_CODE (target_type
) == VOID_TYPE
)
4456 permerror (input_location
, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4457 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4458 permerror (input_location
, "ISO C++ forbids using pointer to a function in subtraction");
4459 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4460 permerror (input_location
, "ISO C++ forbids using pointer to a method in subtraction");
4462 /* First do the subtraction as integers;
4463 then drop through to build the divide operator. */
4465 op0
= cp_build_binary_op (input_location
,
4467 cp_convert (restype
, op0
),
4468 cp_convert (restype
, op1
),
4469 tf_warning_or_error
);
4471 /* This generates an error if op1 is a pointer to an incomplete type. */
4472 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
4473 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4475 op1
= (TYPE_PTROB_P (ptrtype
)
4476 ? size_in_bytes (target_type
)
4477 : integer_one_node
);
4479 /* Do the division. */
4481 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4482 return fold_if_not_in_template (result
);
4485 /* Construct and perhaps optimize a tree representation
4486 for a unary operation. CODE, a tree_code, specifies the operation
4487 and XARG is the operand. */
4490 build_x_unary_op (enum tree_code code
, tree xarg
, tsubst_flags_t complain
)
4492 tree orig_expr
= xarg
;
4496 if (processing_template_decl
)
4498 if (type_dependent_expression_p (xarg
))
4499 return build_min_nt (code
, xarg
, NULL_TREE
);
4501 xarg
= build_non_dependent_expr (xarg
);
4506 /* [expr.unary.op] says:
4508 The address of an object of incomplete type can be taken.
4510 (And is just the ordinary address operator, not an overloaded
4511 "operator &".) However, if the type is a template
4512 specialization, we must complete the type at this point so that
4513 an overloaded "operator &" will be available if required. */
4514 if (code
== ADDR_EXPR
4515 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4516 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
4517 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
4518 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4519 /* Don't look for a function. */;
4521 exp
= build_new_op (code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
, NULL_TREE
,
4522 /*overloaded_p=*/NULL
, complain
);
4523 if (!exp
&& code
== ADDR_EXPR
)
4525 if (is_overloaded_fn (xarg
))
4527 tree fn
= get_first_fn (xarg
);
4528 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
4530 error (DECL_CONSTRUCTOR_P (fn
)
4531 ? G_("taking address of constructor %qE")
4532 : G_("taking address of destructor %qE"),
4534 return error_mark_node
;
4538 /* A pointer to member-function can be formed only by saying
4540 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
4541 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
4543 if (TREE_CODE (xarg
) != OFFSET_REF
4544 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
4546 error ("invalid use of %qE to form a pointer-to-member-function",
4548 if (TREE_CODE (xarg
) != OFFSET_REF
)
4549 inform (input_location
, " a qualified-id is required");
4550 return error_mark_node
;
4554 error ("parentheses around %qE cannot be used to form a"
4555 " pointer-to-member-function",
4557 PTRMEM_OK_P (xarg
) = 1;
4561 if (TREE_CODE (xarg
) == OFFSET_REF
)
4563 ptrmem
= PTRMEM_OK_P (xarg
);
4565 if (!ptrmem
&& !flag_ms_extensions
4566 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4568 /* A single non-static member, make sure we don't allow a
4569 pointer-to-member. */
4570 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
4571 TREE_OPERAND (xarg
, 0),
4572 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4573 PTRMEM_OK_P (xarg
) = ptrmem
;
4576 else if (TREE_CODE (xarg
) == TARGET_EXPR
&& (complain
& tf_warning
))
4577 warning (0, "taking address of temporary");
4578 exp
= cp_build_unary_op (ADDR_EXPR
, xarg
, 0, complain
);
4581 if (processing_template_decl
&& exp
!= error_mark_node
)
4582 exp
= build_min_non_dep (code
, exp
, orig_expr
,
4583 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
4584 if (TREE_CODE (exp
) == ADDR_EXPR
)
4585 PTRMEM_OK_P (exp
) = ptrmem
;
4589 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4590 constants, where a null value is represented by an INTEGER_CST of
4594 cp_truthvalue_conversion (tree expr
)
4596 tree type
= TREE_TYPE (expr
);
4597 if (TYPE_PTRMEM_P (type
))
4598 return build_binary_op (EXPR_LOCATION (expr
),
4599 NE_EXPR
, expr
, integer_zero_node
, 1);
4601 return c_common_truthvalue_conversion (input_location
, expr
);
4604 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4607 condition_conversion (tree expr
)
4610 if (processing_template_decl
)
4612 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
4613 tf_warning_or_error
, LOOKUP_NORMAL
);
4614 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
4618 /* Returns the address of T. This function will fold away
4619 ADDR_EXPR of INDIRECT_REF. */
4622 build_address (tree t
)
4624 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4625 return error_mark_node
;
4626 t
= build_fold_addr_expr (t
);
4627 if (TREE_CODE (t
) != ADDR_EXPR
)
4632 /* Returns the address of T with type TYPE. */
4635 build_typed_address (tree t
, tree type
)
4637 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4638 return error_mark_node
;
4639 t
= build_fold_addr_expr_with_type (t
, type
);
4640 if (TREE_CODE (t
) != ADDR_EXPR
)
4645 /* Return a NOP_EXPR converting EXPR to TYPE. */
4648 build_nop (tree type
, tree expr
)
4650 if (type
== error_mark_node
|| error_operand_p (expr
))
4652 return build1 (NOP_EXPR
, type
, expr
);
4655 /* C++: Must handle pointers to members.
4657 Perhaps type instantiation should be extended to handle conversion
4658 from aggregates to types we don't yet know we want? (Or are those
4659 cases typically errors which should be reported?)
4661 NOCONVERT nonzero suppresses the default promotions
4662 (such as from short to int). */
4665 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
4666 tsubst_flags_t complain
)
4668 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4671 const char *errstring
= NULL
;
4673 const char *invalid_op_diag
;
4675 if (error_operand_p (arg
))
4676 return error_mark_node
;
4678 if ((invalid_op_diag
4679 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
4684 error (invalid_op_diag
);
4685 return error_mark_node
;
4690 case UNARY_PLUS_EXPR
:
4693 int flags
= WANT_ARITH
| WANT_ENUM
;
4694 /* Unary plus (but not unary minus) is allowed on pointers. */
4695 if (code
== UNARY_PLUS_EXPR
)
4696 flags
|= WANT_POINTER
;
4697 arg
= build_expr_type_conversion (flags
, arg
, true);
4699 errstring
= (code
== NEGATE_EXPR
4700 ? _("wrong type argument to unary minus")
4701 : _("wrong type argument to unary plus"));
4704 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4705 arg
= perform_integral_promotions (arg
);
4707 /* Make sure the result is not an lvalue: a unary plus or minus
4708 expression is always a rvalue. */
4715 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4719 arg
= default_conversion (arg
);
4721 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
4722 | WANT_VECTOR_OR_COMPLEX
,
4724 errstring
= _("wrong type argument to bit-complement");
4725 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
4726 arg
= perform_integral_promotions (arg
);
4730 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4731 errstring
= _("wrong type argument to abs");
4732 else if (!noconvert
)
4733 arg
= default_conversion (arg
);
4737 /* Conjugating a real value is a no-op, but allow it anyway. */
4738 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4739 errstring
= _("wrong type argument to conjugation");
4740 else if (!noconvert
)
4741 arg
= default_conversion (arg
);
4744 case TRUTH_NOT_EXPR
:
4745 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
4747 val
= invert_truthvalue_loc (input_location
, arg
);
4748 if (arg
!= error_mark_node
)
4750 errstring
= _("in argument to unary !");
4757 if (TREE_CODE (arg
) == COMPLEX_CST
)
4758 return TREE_REALPART (arg
);
4759 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4761 arg
= build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4762 return fold_if_not_in_template (arg
);
4768 if (TREE_CODE (arg
) == COMPLEX_CST
)
4769 return TREE_IMAGPART (arg
);
4770 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4772 arg
= build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
4773 return fold_if_not_in_template (arg
);
4776 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4778 case PREINCREMENT_EXPR
:
4779 case POSTINCREMENT_EXPR
:
4780 case PREDECREMENT_EXPR
:
4781 case POSTDECREMENT_EXPR
:
4782 /* Handle complex lvalues (when permitted)
4783 by reduction to simpler cases. */
4785 val
= unary_complex_lvalue (code
, arg
);
4789 /* Increment or decrement the real part of the value,
4790 and don't change the imaginary part. */
4791 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4795 arg
= stabilize_reference (arg
);
4796 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
4797 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
4798 real
= cp_build_unary_op (code
, real
, 1, complain
);
4799 if (real
== error_mark_node
|| imag
== error_mark_node
)
4800 return error_mark_node
;
4801 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
4805 /* Report invalid types. */
4807 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4810 if (code
== PREINCREMENT_EXPR
)
4811 errstring
= _("no pre-increment operator for type");
4812 else if (code
== POSTINCREMENT_EXPR
)
4813 errstring
= _("no post-increment operator for type");
4814 else if (code
== PREDECREMENT_EXPR
)
4815 errstring
= _("no pre-decrement operator for type");
4817 errstring
= _("no post-decrement operator for type");
4820 else if (arg
== error_mark_node
)
4821 return error_mark_node
;
4823 /* Report something read-only. */
4825 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4826 || TREE_READONLY (arg
))
4828 if (complain
& tf_error
)
4829 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4830 || code
== POSTINCREMENT_EXPR
)
4831 ? REK_INCREMENT
: REK_DECREMENT
));
4833 return error_mark_node
;
4838 tree declared_type
= unlowered_expr_type (arg
);
4840 argtype
= TREE_TYPE (arg
);
4842 /* ARM $5.2.5 last annotation says this should be forbidden. */
4843 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4845 if (complain
& tf_error
)
4846 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4847 ? G_("ISO C++ forbids incrementing an enum")
4848 : G_("ISO C++ forbids decrementing an enum"));
4850 return error_mark_node
;
4853 /* Compute the increment. */
4855 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4857 tree type
= complete_type (TREE_TYPE (argtype
));
4859 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4861 if (complain
& tf_error
)
4862 error (((code
== PREINCREMENT_EXPR
4863 || code
== POSTINCREMENT_EXPR
))
4864 ? G_("cannot increment a pointer to incomplete type %qT")
4865 : G_("cannot decrement a pointer to incomplete type %qT"),
4866 TREE_TYPE (argtype
));
4868 return error_mark_node
;
4870 else if ((pedantic
|| warn_pointer_arith
)
4871 && !TYPE_PTROB_P (argtype
))
4873 if (complain
& tf_error
)
4874 permerror (input_location
, (code
== PREINCREMENT_EXPR
4875 || code
== POSTINCREMENT_EXPR
)
4876 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4877 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4880 return error_mark_node
;
4883 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4886 inc
= integer_one_node
;
4888 inc
= cp_convert (argtype
, inc
);
4890 /* Complain about anything else that is not a true lvalue. */
4891 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4892 || code
== POSTINCREMENT_EXPR
)
4893 ? lv_increment
: lv_decrement
),
4895 return error_mark_node
;
4897 /* Forbid using -- on `bool'. */
4898 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
4900 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4902 if (complain
& tf_error
)
4903 error ("invalid use of Boolean expression as operand "
4904 "to %<operator--%>");
4905 return error_mark_node
;
4907 val
= boolean_increment (code
, arg
);
4910 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
4912 TREE_SIDE_EFFECTS (val
) = 1;
4917 /* Note that this operation never does default_conversion
4918 regardless of NOCONVERT. */
4920 argtype
= lvalue_type (arg
);
4922 if (TREE_CODE (arg
) == OFFSET_REF
)
4925 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4927 tree type
= build_pointer_type (TREE_TYPE (argtype
));
4928 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4931 else if (pedantic
&& DECL_MAIN_P (arg
))
4934 /* Apparently a lot of autoconf scripts for C++ packages do this,
4935 so only complain if -pedantic. */
4936 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
4937 pedwarn (input_location
, OPT_pedantic
,
4938 "ISO C++ forbids taking address of function %<::main%>");
4939 else if (flag_pedantic_errors
)
4940 return error_mark_node
;
4943 /* Let &* cancel out to simplify resulting code. */
4944 if (TREE_CODE (arg
) == INDIRECT_REF
)
4946 /* We don't need to have `current_class_ptr' wrapped in a
4947 NON_LVALUE_EXPR node. */
4948 if (arg
== current_class_ref
)
4949 return current_class_ptr
;
4951 arg
= TREE_OPERAND (arg
, 0);
4952 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4954 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
4955 arg
= build1 (CONVERT_EXPR
, type
, arg
);
4958 /* Don't let this be an lvalue. */
4963 /* Uninstantiated types are all functions. Taking the
4964 address of a function is a no-op, so just return the
4967 gcc_assert (TREE_CODE (arg
) != IDENTIFIER_NODE
4968 || !IDENTIFIER_OPNAME_P (arg
));
4970 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4971 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4973 /* They're trying to take the address of a unique non-static
4974 member function. This is ill-formed (except in MS-land),
4975 but let's try to DTRT.
4976 Note: We only handle unique functions here because we don't
4977 want to complain if there's a static overload; non-unique
4978 cases will be handled by instantiate_type. But we need to
4979 handle this case here to allow casts on the resulting PMF.
4980 We could defer this in non-MS mode, but it's easier to give
4981 a useful error here. */
4983 /* Inside constant member functions, the `this' pointer
4984 contains an extra const qualifier. TYPE_MAIN_VARIANT
4985 is used here to remove this const from the diagnostics
4986 and the created OFFSET_REF. */
4987 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4988 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
4991 if (! flag_ms_extensions
)
4993 tree name
= DECL_NAME (fn
);
4994 if (!(complain
& tf_error
))
4995 return error_mark_node
;
4996 else if (current_class_type
4997 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4998 /* An expression like &memfn. */
4999 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5000 " or parenthesized non-static member function to form"
5001 " a pointer to member function. Say %<&%T::%D%>",
5004 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5005 " function to form a pointer to member function."
5009 arg
= build_offset_ref (base
, fn
, /*address_p=*/true);
5013 if (type_unknown_p (arg
))
5014 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5016 /* Handle complex lvalues (when permitted)
5017 by reduction to simpler cases. */
5018 val
= unary_complex_lvalue (code
, arg
);
5022 switch (TREE_CODE (arg
))
5026 case FIX_TRUNC_EXPR
:
5027 /* Even if we're not being pedantic, we cannot allow this
5028 extension when we're instantiating in a SFINAE
5030 if (! lvalue_p (arg
) && complain
== tf_none
)
5032 if (complain
& tf_error
)
5033 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5035 return error_mark_node
;
5040 arg
= BASELINK_FUNCTIONS (arg
);
5044 arg
= OVL_CURRENT (arg
);
5048 /* Turn a reference to a non-static data member into a
5049 pointer-to-member. */
5054 if (!PTRMEM_OK_P (arg
))
5055 return cp_build_unary_op (code
, arg
, 0, complain
);
5057 t
= TREE_OPERAND (arg
, 1);
5058 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5060 if (complain
& tf_error
)
5061 error ("cannot create pointer to reference member %qD", t
);
5062 return error_mark_node
;
5065 type
= build_ptrmem_type (context_for_name_lookup (t
),
5067 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5075 /* Anything not already handled and not a true memory reference
5077 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5078 && TREE_CODE (argtype
) != METHOD_TYPE
5079 && TREE_CODE (arg
) != OFFSET_REF
5080 && !lvalue_or_else (arg
, lv_addressof
, complain
))
5081 return error_mark_node
;
5083 if (argtype
!= error_mark_node
)
5084 argtype
= build_pointer_type (argtype
);
5086 /* In a template, we are processing a non-dependent expression
5087 so we can just form an ADDR_EXPR with the correct type. */
5088 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5090 val
= build_address (arg
);
5091 if (TREE_CODE (arg
) == OFFSET_REF
)
5092 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5094 else if (TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
5096 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5098 /* We can only get here with a single static member
5100 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5101 && DECL_STATIC_FUNCTION_P (fn
));
5103 val
= build_address (fn
);
5104 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5105 /* Do not lose object's side effects. */
5106 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5107 TREE_OPERAND (arg
, 0), val
);
5109 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5111 if (complain
& tf_error
)
5112 error ("attempt to take address of bit-field structure member %qD",
5113 TREE_OPERAND (arg
, 1));
5114 return error_mark_node
;
5118 tree object
= TREE_OPERAND (arg
, 0);
5119 tree field
= TREE_OPERAND (arg
, 1);
5120 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5121 (TREE_TYPE (object
), decl_type_context (field
)));
5122 val
= build_address (arg
);
5125 if (TREE_CODE (argtype
) == POINTER_TYPE
5126 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5128 build_ptrmemfunc_type (argtype
);
5129 val
= build_ptrmemfunc (argtype
, val
, 0,
5130 /*c_cast_p=*/false);
5142 argtype
= TREE_TYPE (arg
);
5143 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5146 if (complain
& tf_error
)
5147 error ("%s", errstring
);
5148 return error_mark_node
;
5151 /* Hook for the c-common bits that build a unary op. */
5153 build_unary_op (location_t location ATTRIBUTE_UNUSED
,
5154 enum tree_code code
, tree xarg
, int noconvert
)
5156 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5159 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5160 for certain kinds of expressions which are not really lvalues
5161 but which we can accept as lvalues.
5163 If ARG is not a kind of expression we can handle, return
5167 unary_complex_lvalue (enum tree_code code
, tree arg
)
5169 /* Inside a template, making these kinds of adjustments is
5170 pointless; we are only concerned with the type of the
5172 if (processing_template_decl
)
5175 /* Handle (a, b) used as an "lvalue". */
5176 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
5178 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
5179 tf_warning_or_error
);
5180 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5181 TREE_OPERAND (arg
, 0), real_result
);
5184 /* Handle (a ? b : c) used as an "lvalue". */
5185 if (TREE_CODE (arg
) == COND_EXPR
5186 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
5187 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
5189 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5190 if (TREE_CODE (arg
) == MODIFY_EXPR
5191 || TREE_CODE (arg
) == PREINCREMENT_EXPR
5192 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
5194 tree lvalue
= TREE_OPERAND (arg
, 0);
5195 if (TREE_SIDE_EFFECTS (lvalue
))
5197 lvalue
= stabilize_reference (lvalue
);
5198 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
5199 lvalue
, TREE_OPERAND (arg
, 1));
5201 return unary_complex_lvalue
5202 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
5205 if (code
!= ADDR_EXPR
)
5208 /* Handle (a = b) used as an "lvalue" for `&'. */
5209 if (TREE_CODE (arg
) == MODIFY_EXPR
5210 || TREE_CODE (arg
) == INIT_EXPR
)
5212 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
5213 tf_warning_or_error
);
5214 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
5216 TREE_NO_WARNING (arg
) = 1;
5220 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
5221 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
5222 || TREE_CODE (arg
) == OFFSET_REF
)
5225 /* We permit compiler to make function calls returning
5226 objects of aggregate type look like lvalues. */
5230 if (TREE_CODE (targ
) == SAVE_EXPR
)
5231 targ
= TREE_OPERAND (targ
, 0);
5233 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
5235 if (TREE_CODE (arg
) == SAVE_EXPR
)
5238 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
5239 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
5242 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
5243 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
5244 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
5247 /* Don't let anything else be handled specially. */
5251 /* Mark EXP saying that we need to be able to take the
5252 address of it; it should not be allocated in a register.
5253 Value is true if successful.
5255 C++: we do not allow `current_class_ptr' to be addressable. */
5258 cxx_mark_addressable (tree exp
)
5263 switch (TREE_CODE (x
))
5270 x
= TREE_OPERAND (x
, 0);
5274 if (x
== current_class_ptr
)
5276 error ("cannot take the address of %<this%>, which is an rvalue expression");
5277 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
5283 /* Caller should not be trying to mark initialized
5284 constant fields addressable. */
5285 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
5286 || DECL_IN_AGGR_P (x
) == 0
5288 || DECL_EXTERNAL (x
));
5293 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
5294 && !DECL_ARTIFICIAL (x
))
5296 if (TREE_CODE (x
) == VAR_DECL
&& DECL_HARD_REGISTER (x
))
5299 ("address of explicit register variable %qD requested", x
);
5302 else if (extra_warnings
)
5304 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
5306 TREE_ADDRESSABLE (x
) = 1;
5310 TREE_ADDRESSABLE (x
) = 1;
5314 TREE_ADDRESSABLE (x
) = 1;
5318 TREE_ADDRESSABLE (x
) = 1;
5319 cxx_mark_addressable (TREE_OPERAND (x
, 0));
5327 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5330 build_x_conditional_expr (tree ifexp
, tree op1
, tree op2
,
5331 tsubst_flags_t complain
)
5333 tree orig_ifexp
= ifexp
;
5334 tree orig_op1
= op1
;
5335 tree orig_op2
= op2
;
5338 if (processing_template_decl
)
5340 /* The standard says that the expression is type-dependent if
5341 IFEXP is type-dependent, even though the eventual type of the
5342 expression doesn't dependent on IFEXP. */
5343 if (type_dependent_expression_p (ifexp
)
5344 /* As a GNU extension, the middle operand may be omitted. */
5345 || (op1
&& type_dependent_expression_p (op1
))
5346 || type_dependent_expression_p (op2
))
5347 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
5348 ifexp
= build_non_dependent_expr (ifexp
);
5350 op1
= build_non_dependent_expr (op1
);
5351 op2
= build_non_dependent_expr (op2
);
5354 expr
= build_conditional_expr (ifexp
, op1
, op2
, complain
);
5355 if (processing_template_decl
&& expr
!= error_mark_node
)
5356 return build_min_non_dep (COND_EXPR
, expr
,
5357 orig_ifexp
, orig_op1
, orig_op2
);
5361 /* Given a list of expressions, return a compound expression
5362 that performs them all and returns the value of the last of them. */
5364 tree
build_x_compound_expr_from_list (tree list
, const char *msg
)
5366 tree expr
= TREE_VALUE (list
);
5368 if (TREE_CHAIN (list
))
5371 permerror (input_location
, "%s expression list treated as compound expression", msg
);
5373 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
5374 expr
= build_x_compound_expr (expr
, TREE_VALUE (list
),
5375 tf_warning_or_error
);
5381 /* Like build_x_compound_expr_from_list, but using a VEC. */
5384 build_x_compound_expr_from_vec (VEC(tree
,gc
) *vec
, const char *msg
)
5386 if (VEC_empty (tree
, vec
))
5388 else if (VEC_length (tree
, vec
) == 1)
5389 return VEC_index (tree
, vec
, 0);
5397 permerror (input_location
,
5398 "%s expression list treated as compound expression",
5401 expr
= VEC_index (tree
, vec
, 0);
5402 for (ix
= 1; VEC_iterate (tree
, vec
, ix
, t
); ++ix
)
5403 expr
= build_x_compound_expr (expr
, t
, tf_warning_or_error
);
5409 /* Handle overloading of the ',' operator when needed. */
5412 build_x_compound_expr (tree op1
, tree op2
, tsubst_flags_t complain
)
5415 tree orig_op1
= op1
;
5416 tree orig_op2
= op2
;
5418 if (processing_template_decl
)
5420 if (type_dependent_expression_p (op1
)
5421 || type_dependent_expression_p (op2
))
5422 return build_min_nt (COMPOUND_EXPR
, op1
, op2
);
5423 op1
= build_non_dependent_expr (op1
);
5424 op2
= build_non_dependent_expr (op2
);
5427 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
, NULL_TREE
,
5428 /*overloaded_p=*/NULL
, complain
);
5430 result
= cp_build_compound_expr (op1
, op2
, complain
);
5432 if (processing_template_decl
&& result
!= error_mark_node
)
5433 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
5438 /* Like cp_build_compound_expr, but for the c-common bits. */
5441 build_compound_expr (location_t loc ATTRIBUTE_UNUSED
, tree lhs
, tree rhs
)
5443 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
5446 /* Build a compound expression. */
5449 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
5451 lhs
= convert_to_void (lhs
, "left-hand operand of comma", complain
);
5453 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5454 return error_mark_node
;
5456 if (TREE_CODE (rhs
) == TARGET_EXPR
)
5458 /* If the rhs is a TARGET_EXPR, then build the compound
5459 expression inside the target_expr's initializer. This
5460 helps the compiler to eliminate unnecessary temporaries. */
5461 tree init
= TREE_OPERAND (rhs
, 1);
5463 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
5464 TREE_OPERAND (rhs
, 1) = init
;
5469 if (type_unknown_p (rhs
))
5471 error ("no context to resolve type of %qE", rhs
);
5472 return error_mark_node
;
5475 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
5478 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5479 casts away constness. CAST gives the type of cast.
5481 ??? This function warns for casting away any qualifier not just
5482 const. We would like to specify exactly what qualifiers are casted
5487 check_for_casting_away_constness (tree src_type
, tree dest_type
,
5488 enum tree_code cast
)
5490 /* C-style casts are allowed to cast away constness. With
5491 WARN_CAST_QUAL, we still want to issue a warning. */
5492 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
5495 if (!casts_away_constness (src_type
, dest_type
))
5501 warning (OPT_Wcast_qual
,
5502 "cast from type %qT to type %qT casts away qualifiers",
5503 src_type
, dest_type
);
5506 case STATIC_CAST_EXPR
:
5507 error ("static_cast from type %qT to type %qT casts away qualifiers",
5508 src_type
, dest_type
);
5511 case REINTERPRET_CAST_EXPR
:
5512 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5513 src_type
, dest_type
);
5520 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5521 (another pointer-to-member type in the same hierarchy) and return
5522 the converted expression. If ALLOW_INVERSE_P is permitted, a
5523 pointer-to-derived may be converted to pointer-to-base; otherwise,
5524 only the other direction is permitted. If C_CAST_P is true, this
5525 conversion is taking place as part of a C-style cast. */
5528 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
5531 if (TYPE_PTRMEM_P (type
))
5535 if (TREE_CODE (expr
) == PTRMEM_CST
)
5536 expr
= cplus_expand_constant (expr
);
5537 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
5538 TYPE_PTRMEM_CLASS_TYPE (type
),
5541 if (!integer_zerop (delta
))
5543 tree cond
, op1
, op2
;
5545 cond
= cp_build_binary_op (input_location
,
5548 build_int_cst (TREE_TYPE (expr
), -1),
5549 tf_warning_or_error
);
5550 op1
= build_nop (ptrdiff_type_node
, expr
);
5551 op2
= cp_build_binary_op (input_location
,
5552 PLUS_EXPR
, op1
, delta
,
5553 tf_warning_or_error
);
5555 expr
= fold_build3_loc (input_location
,
5556 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
5560 return build_nop (type
, expr
);
5563 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
5564 allow_inverse_p
, c_cast_p
);
5567 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5568 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5569 Otherwise, return EXPR unchanged. */
5572 ignore_overflows (tree expr
, tree orig
)
5574 if (TREE_CODE (expr
) == INTEGER_CST
5575 && CONSTANT_CLASS_P (orig
)
5576 && TREE_CODE (orig
) != STRING_CST
5577 && TREE_OVERFLOW (expr
) != TREE_OVERFLOW (orig
))
5579 if (!TREE_OVERFLOW (orig
))
5580 /* Ensure constant sharing. */
5581 expr
= build_int_cst_wide (TREE_TYPE (expr
),
5582 TREE_INT_CST_LOW (expr
),
5583 TREE_INT_CST_HIGH (expr
));
5586 /* Avoid clobbering a shared constant. */
5587 expr
= copy_node (expr
);
5588 TREE_OVERFLOW (expr
) = TREE_OVERFLOW (orig
);
5594 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5595 this static_cast is being attempted as one of the possible casts
5596 allowed by a C-style cast. (In that case, accessibility of base
5597 classes is not considered, and it is OK to cast away
5598 constness.) Return the result of the cast. *VALID_P is set to
5599 indicate whether or not the cast was valid. */
5602 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5603 bool *valid_p
, tsubst_flags_t complain
)
5609 /* Assume the cast is valid. */
5612 intype
= TREE_TYPE (expr
);
5614 /* Save casted types in the function's used types hash table. */
5615 used_types_insert (type
);
5617 /* [expr.static.cast]
5619 An lvalue of type "cv1 B", where B is a class type, can be cast
5620 to type "reference to cv2 D", where D is a class derived (clause
5621 _class.derived_) from B, if a valid standard conversion from
5622 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5623 same cv-qualification as, or greater cv-qualification than, cv1,
5624 and B is not a virtual base class of D. */
5625 /* We check this case before checking the validity of "TYPE t =
5626 EXPR;" below because for this case:
5629 struct D : public B { D(const B&); };
5631 void f() { static_cast<const D&>(b); }
5633 we want to avoid constructing a new D. The standard is not
5634 completely clear about this issue, but our interpretation is
5635 consistent with other compilers. */
5636 if (TREE_CODE (type
) == REFERENCE_TYPE
5637 && CLASS_TYPE_P (TREE_TYPE (type
))
5638 && CLASS_TYPE_P (intype
)
5639 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
5640 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
5641 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
5642 build_pointer_type (TYPE_MAIN_VARIANT
5643 (TREE_TYPE (type
))))
5645 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5649 /* There is a standard conversion from "D*" to "B*" even if "B"
5650 is ambiguous or inaccessible. If this is really a
5651 static_cast, then we check both for inaccessibility and
5652 ambiguity. However, if this is a static_cast being performed
5653 because the user wrote a C-style cast, then accessibility is
5655 base
= lookup_base (TREE_TYPE (type
), intype
,
5656 c_cast_p
? ba_unique
: ba_check
,
5659 /* Convert from "B*" to "D*". This function will check that "B"
5660 is not a virtual base of "D". */
5661 expr
= build_base_path (MINUS_EXPR
, build_address (expr
),
5662 base
, /*nonnull=*/false);
5663 /* Convert the pointer to a reference -- but then remember that
5664 there are no expressions with reference type in C++. */
5665 return convert_from_reference (cp_fold_convert (type
, expr
));
5668 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5669 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5670 if (TREE_CODE (type
) == REFERENCE_TYPE
5671 && TYPE_REF_IS_RVALUE (type
)
5672 && real_lvalue_p (expr
)
5673 && reference_related_p (TREE_TYPE (type
), intype
)
5674 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
5676 expr
= build_typed_address (expr
, type
);
5677 return convert_from_reference (expr
);
5682 /* Resolve overloaded address here rather than once in
5683 implicit_conversion and again in the inverse code below. */
5684 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
5686 expr
= instantiate_type (type
, expr
, complain
);
5687 intype
= TREE_TYPE (expr
);
5690 /* [expr.static.cast]
5692 An expression e can be explicitly converted to a type T using a
5693 static_cast of the form static_cast<T>(e) if the declaration T
5694 t(e);" is well-formed, for some invented temporary variable
5696 result
= perform_direct_initialization_if_possible (type
, expr
,
5697 c_cast_p
, complain
);
5700 result
= convert_from_reference (result
);
5702 /* Ignore any integer overflow caused by the cast. */
5703 result
= ignore_overflows (result
, orig
);
5705 /* [expr.static.cast]
5707 If T is a reference type, the result is an lvalue; otherwise,
5708 the result is an rvalue. */
5709 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5710 result
= rvalue (result
);
5714 /* [expr.static.cast]
5716 Any expression can be explicitly converted to type cv void. */
5717 if (TREE_CODE (type
) == VOID_TYPE
)
5718 return convert_to_void (expr
, /*implicit=*/NULL
, complain
);
5720 /* [expr.static.cast]
5722 The inverse of any standard conversion sequence (clause _conv_),
5723 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5724 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5725 (_conv.bool_) conversions, can be performed explicitly using
5726 static_cast subject to the restriction that the explicit
5727 conversion does not cast away constness (_expr.const.cast_), and
5728 the following additional rules for specific cases: */
5729 /* For reference, the conversions not excluded are: integral
5730 promotions, floating point promotion, integral conversions,
5731 floating point conversions, floating-integral conversions,
5732 pointer conversions, and pointer to member conversions. */
5735 A value of integral _or enumeration_ type can be explicitly
5736 converted to an enumeration type. */
5737 /* The effect of all that is that any conversion between any two
5738 types which are integral, floating, or enumeration types can be
5740 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
5741 || SCALAR_FLOAT_TYPE_P (type
))
5742 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
5743 || SCALAR_FLOAT_TYPE_P (intype
)))
5745 expr
= ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
);
5747 /* Ignore any integer overflow caused by the cast. */
5748 expr
= ignore_overflows (expr
, orig
);
5752 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
5753 && CLASS_TYPE_P (TREE_TYPE (type
))
5754 && CLASS_TYPE_P (TREE_TYPE (intype
))
5755 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5756 (TREE_TYPE (intype
))),
5757 build_pointer_type (TYPE_MAIN_VARIANT
5758 (TREE_TYPE (type
)))))
5763 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5764 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
5765 c_cast_p
? ba_unique
: ba_check
,
5767 return build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false);
5770 if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5771 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5778 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
5779 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
5781 if (TYPE_PTRMEM_P (type
))
5783 t1
= (build_ptrmem_type
5785 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
5786 t2
= (build_ptrmem_type
5788 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
5795 if (can_convert (t1
, t2
) || can_convert (t2
, t1
))
5798 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5799 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
5804 /* [expr.static.cast]
5806 An rvalue of type "pointer to cv void" can be explicitly
5807 converted to a pointer to object type. A value of type pointer
5808 to object converted to "pointer to cv void" and back to the
5809 original pointer type will have its original value. */
5810 if (TREE_CODE (intype
) == POINTER_TYPE
5811 && VOID_TYPE_P (TREE_TYPE (intype
))
5812 && TYPE_PTROB_P (type
))
5815 check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
);
5816 return build_nop (type
, expr
);
5820 return error_mark_node
;
5823 /* Return an expression representing static_cast<TYPE>(EXPR). */
5826 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
5831 if (type
== error_mark_node
|| expr
== error_mark_node
)
5832 return error_mark_node
;
5834 if (processing_template_decl
)
5836 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
5837 /* We don't know if it will or will not have side effects. */
5838 TREE_SIDE_EFFECTS (expr
) = 1;
5839 return convert_from_reference (expr
);
5842 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5843 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5844 if (TREE_CODE (type
) != REFERENCE_TYPE
5845 && TREE_CODE (expr
) == NOP_EXPR
5846 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5847 expr
= TREE_OPERAND (expr
, 0);
5849 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
5854 if (complain
& tf_error
)
5855 error ("invalid static_cast from type %qT to type %qT",
5856 TREE_TYPE (expr
), type
);
5857 return error_mark_node
;
5860 /* EXPR is an expression with member function or pointer-to-member
5861 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5862 not permitted by ISO C++, but we accept it in some modes. If we
5863 are not in one of those modes, issue a diagnostic. Return the
5864 converted expression. */
5867 convert_member_func_to_ptr (tree type
, tree expr
)
5872 intype
= TREE_TYPE (expr
);
5873 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
5874 || TREE_CODE (intype
) == METHOD_TYPE
);
5876 if (pedantic
|| warn_pmf2ptr
)
5877 pedwarn (input_location
, pedantic
? OPT_pedantic
: OPT_Wpmf_conversions
,
5878 "converting from %qT to %qT", intype
, type
);
5880 if (TREE_CODE (intype
) == METHOD_TYPE
)
5881 expr
= build_addr_func (expr
);
5882 else if (TREE_CODE (expr
) == PTRMEM_CST
)
5883 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
5886 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
5887 decl
= build_address (decl
);
5888 expr
= get_member_function_from_ptrfunc (&decl
, expr
);
5891 return build_nop (type
, expr
);
5894 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5895 If C_CAST_P is true, this reinterpret cast is being done as part of
5896 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5897 indicate whether or not reinterpret_cast was valid. */
5900 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
5901 bool *valid_p
, tsubst_flags_t complain
)
5905 /* Assume the cast is invalid. */
5909 if (type
== error_mark_node
|| error_operand_p (expr
))
5910 return error_mark_node
;
5912 intype
= TREE_TYPE (expr
);
5914 /* Save casted types in the function's used types hash table. */
5915 used_types_insert (type
);
5917 /* [expr.reinterpret.cast]
5918 An lvalue expression of type T1 can be cast to the type
5919 "reference to T2" if an expression of type "pointer to T1" can be
5920 explicitly converted to the type "pointer to T2" using a
5921 reinterpret_cast. */
5922 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5924 if (! real_lvalue_p (expr
))
5926 if (complain
& tf_error
)
5927 error ("invalid cast of an rvalue expression of type "
5930 return error_mark_node
;
5933 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5934 "B" are related class types; the reinterpret_cast does not
5935 adjust the pointer. */
5936 if (TYPE_PTR_P (intype
)
5937 && (complain
& tf_warning
)
5938 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
5939 COMPARE_BASE
| COMPARE_DERIVED
)))
5940 warning (0, "casting %qT to %qT does not dereference pointer",
5943 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
5945 if (warn_strict_aliasing
> 2)
5946 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
5948 if (expr
!= error_mark_node
)
5949 expr
= build_reinterpret_cast_1
5950 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
5952 if (expr
!= error_mark_node
)
5953 /* cp_build_indirect_ref isn't right for rvalue refs. */
5954 expr
= convert_from_reference (fold_convert (type
, expr
));
5958 /* As a G++ extension, we consider conversions from member
5959 functions, and pointers to member functions to
5960 pointer-to-function and pointer-to-void types. If
5961 -Wno-pmf-conversions has not been specified,
5962 convert_member_func_to_ptr will issue an error message. */
5963 if ((TYPE_PTRMEMFUNC_P (intype
)
5964 || TREE_CODE (intype
) == METHOD_TYPE
)
5965 && TYPE_PTR_P (type
)
5966 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
5967 || VOID_TYPE_P (TREE_TYPE (type
))))
5968 return convert_member_func_to_ptr (type
, expr
);
5970 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5971 array-to-pointer, and function-to-pointer conversions are
5973 expr
= decay_conversion (expr
);
5975 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5976 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5977 if (TREE_CODE (expr
) == NOP_EXPR
5978 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5979 expr
= TREE_OPERAND (expr
, 0);
5981 if (error_operand_p (expr
))
5982 return error_mark_node
;
5984 intype
= TREE_TYPE (expr
);
5986 /* [expr.reinterpret.cast]
5987 A pointer can be converted to any integral type large enough to
5989 if (CP_INTEGRAL_TYPE_P (type
) && TYPE_PTR_P (intype
))
5991 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
5993 if (complain
& tf_error
)
5994 permerror (input_location
, "cast from %qT to %qT loses precision",
5997 return error_mark_node
;
6000 /* [expr.reinterpret.cast]
6001 A value of integral or enumeration type can be explicitly
6002 converted to a pointer. */
6003 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6006 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6007 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6008 return fold_if_not_in_template (build_nop (type
, expr
));
6009 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
6010 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6015 check_for_casting_away_constness (intype
, type
, REINTERPRET_CAST_EXPR
);
6016 /* Warn about possible alignment problems. */
6017 if (STRICT_ALIGNMENT
&& warn_cast_align
6018 && (complain
& tf_warning
)
6019 && !VOID_TYPE_P (type
)
6020 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6021 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6022 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6023 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6024 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6025 "increases required alignment of target type", intype
, type
);
6027 /* We need to strip nops here, because the front end likes to
6028 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6030 if (warn_strict_aliasing
<= 2)
6031 strict_aliasing_warning (intype
, type
, sexpr
);
6033 return fold_if_not_in_template (build_nop (type
, expr
));
6035 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6036 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6038 if (pedantic
&& (complain
& tf_warning
))
6039 /* Only issue a warning, as we have always supported this
6040 where possible, and it is necessary in some cases. DR 195
6041 addresses this issue, but as of 2004/10/26 is still in
6043 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6044 return fold_if_not_in_template (build_nop (type
, expr
));
6046 else if (TREE_CODE (type
) == VECTOR_TYPE
)
6047 return fold_if_not_in_template (convert_to_vector (type
, expr
));
6048 else if (TREE_CODE (intype
) == VECTOR_TYPE
6049 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
6050 return fold_if_not_in_template (convert_to_integer (type
, expr
));
6055 if (complain
& tf_error
)
6056 error ("invalid cast from type %qT to type %qT", intype
, type
);
6057 return error_mark_node
;
6060 return cp_convert (type
, expr
);
6064 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6066 if (type
== error_mark_node
|| expr
== error_mark_node
)
6067 return error_mark_node
;
6069 if (processing_template_decl
)
6071 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
6073 if (!TREE_SIDE_EFFECTS (t
)
6074 && type_dependent_expression_p (expr
))
6075 /* There might turn out to be side effects inside expr. */
6076 TREE_SIDE_EFFECTS (t
) = 1;
6077 return convert_from_reference (t
);
6080 return build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
6081 /*valid_p=*/NULL
, complain
);
6084 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6085 return an appropriate expression. Otherwise, return
6086 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6087 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6088 performing a C-style cast, its value upon return will indicate
6089 whether or not the conversion succeeded. */
6092 build_const_cast_1 (tree dst_type
, tree expr
, bool complain
,
6096 tree reference_type
;
6098 /* Callers are responsible for handling error_mark_node as a
6099 destination type. */
6100 gcc_assert (dst_type
!= error_mark_node
);
6101 /* In a template, callers should be building syntactic
6102 representations of casts, not using this machinery. */
6103 gcc_assert (!processing_template_decl
);
6105 /* Assume the conversion is invalid. */
6109 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRMEM_P (dst_type
))
6112 error ("invalid use of const_cast with type %qT, "
6113 "which is not a pointer, "
6114 "reference, nor a pointer-to-data-member type", dst_type
);
6115 return error_mark_node
;
6118 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
6121 error ("invalid use of const_cast with type %qT, which is a pointer "
6122 "or reference to a function type", dst_type
);
6123 return error_mark_node
;
6126 /* Save casted types in the function's used types hash table. */
6127 used_types_insert (dst_type
);
6129 src_type
= TREE_TYPE (expr
);
6130 /* Expressions do not really have reference types. */
6131 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
6132 src_type
= TREE_TYPE (src_type
);
6134 /* [expr.const.cast]
6136 An lvalue of type T1 can be explicitly converted to an lvalue of
6137 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6138 types) if a pointer to T1 can be explicitly converted to the type
6139 pointer to T2 using a const_cast. */
6140 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
6142 reference_type
= dst_type
;
6143 if (! real_lvalue_p (expr
))
6146 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6147 src_type
, dst_type
);
6148 return error_mark_node
;
6150 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
6151 src_type
= build_pointer_type (src_type
);
6155 reference_type
= NULL_TREE
;
6156 /* If the destination type is not a reference type, the
6157 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6158 conversions are performed. */
6159 src_type
= type_decays_to (src_type
);
6160 if (src_type
== error_mark_node
)
6161 return error_mark_node
;
6164 if ((TYPE_PTR_P (src_type
) || TYPE_PTRMEM_P (src_type
))
6165 && comp_ptr_ttypes_const (dst_type
, src_type
))
6170 /* This cast is actually a C-style cast. Issue a warning if
6171 the user is making a potentially unsafe cast. */
6172 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
);
6176 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0,
6177 complain
? tf_warning_or_error
: tf_none
);
6178 expr
= build_nop (reference_type
, expr
);
6179 return convert_from_reference (expr
);
6183 expr
= decay_conversion (expr
);
6184 /* build_c_cast puts on a NOP_EXPR to make the result not an
6185 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6186 non-lvalue context. */
6187 if (TREE_CODE (expr
) == NOP_EXPR
6188 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6189 expr
= TREE_OPERAND (expr
, 0);
6190 return build_nop (dst_type
, expr
);
6195 error ("invalid const_cast from type %qT to type %qT",
6196 src_type
, dst_type
);
6197 return error_mark_node
;
6201 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6203 if (type
== error_mark_node
|| error_operand_p (expr
))
6204 return error_mark_node
;
6206 if (processing_template_decl
)
6208 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
6210 if (!TREE_SIDE_EFFECTS (t
)
6211 && type_dependent_expression_p (expr
))
6212 /* There might turn out to be side effects inside expr. */
6213 TREE_SIDE_EFFECTS (t
) = 1;
6214 return convert_from_reference (t
);
6217 return build_const_cast_1 (type
, expr
, complain
& tf_error
,
6221 /* Like cp_build_c_cast, but for the c-common bits. */
6224 build_c_cast (location_t loc ATTRIBUTE_UNUSED
, tree type
, tree expr
)
6226 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
6229 /* Build an expression representing an explicit C-style cast to type
6230 TYPE of expression EXPR. */
6233 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6239 if (type
== error_mark_node
|| error_operand_p (expr
))
6240 return error_mark_node
;
6242 if (processing_template_decl
)
6244 tree t
= build_min (CAST_EXPR
, type
,
6245 tree_cons (NULL_TREE
, value
, NULL_TREE
));
6246 /* We don't know if it will or will not have side effects. */
6247 TREE_SIDE_EFFECTS (t
) = 1;
6248 return convert_from_reference (t
);
6251 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6252 'Class') should always be retained, because this information aids
6253 in method lookup. */
6254 if (objc_is_object_ptr (type
)
6255 && objc_is_object_ptr (TREE_TYPE (expr
)))
6256 return build_nop (type
, expr
);
6258 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6259 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6260 if (TREE_CODE (type
) != REFERENCE_TYPE
6261 && TREE_CODE (value
) == NOP_EXPR
6262 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
6263 value
= TREE_OPERAND (value
, 0);
6265 if (TREE_CODE (type
) == ARRAY_TYPE
)
6267 /* Allow casting from T1* to T2[] because Cfront allows it.
6268 NIHCL uses it. It is not valid ISO C++ however. */
6269 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
6271 if (complain
& tf_error
)
6272 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
6274 return error_mark_node
;
6275 type
= build_pointer_type (TREE_TYPE (type
));
6279 if (complain
& tf_error
)
6280 error ("ISO C++ forbids casting to an array type %qT", type
);
6281 return error_mark_node
;
6285 if (TREE_CODE (type
) == FUNCTION_TYPE
6286 || TREE_CODE (type
) == METHOD_TYPE
)
6288 if (complain
& tf_error
)
6289 error ("invalid cast to function type %qT", type
);
6290 return error_mark_node
;
6293 if (TREE_CODE (type
) == POINTER_TYPE
6294 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
6295 /* Casting to an integer of smaller size is an error detected elsewhere. */
6296 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
6297 /* Don't warn about converting any constant. */
6298 && !TREE_CONSTANT (value
))
6299 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
6300 "cast to pointer from integer of different size");
6302 /* A C-style cast can be a const_cast. */
6303 result
= build_const_cast_1 (type
, value
, /*complain=*/false,
6308 /* Or a static cast. */
6309 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
6310 &valid_p
, complain
);
6311 /* Or a reinterpret_cast. */
6313 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
6314 &valid_p
, complain
);
6315 /* The static_cast or reinterpret_cast may be followed by a
6318 /* A valid cast may result in errors if, for example, a
6319 conversion to am ambiguous base class is required. */
6320 && !error_operand_p (result
))
6324 /* Non-class rvalues always have cv-unqualified type. */
6325 if (!CLASS_TYPE_P (type
))
6326 type
= TYPE_MAIN_VARIANT (type
);
6327 result_type
= TREE_TYPE (result
);
6328 if (!CLASS_TYPE_P (result_type
))
6329 result_type
= TYPE_MAIN_VARIANT (result_type
);
6330 /* If the type of RESULT does not match TYPE, perform a
6331 const_cast to make it match. If the static_cast or
6332 reinterpret_cast succeeded, we will differ by at most
6333 cv-qualification, so the follow-on const_cast is guaranteed
6335 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
6337 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
6338 gcc_assert (valid_p
);
6343 return error_mark_node
;
6346 /* For use from the C common bits. */
6348 build_modify_expr (location_t location ATTRIBUTE_UNUSED
,
6349 tree lhs
, tree lhs_origtype ATTRIBUTE_UNUSED
,
6350 enum tree_code modifycode
,
6351 location_t rhs_location ATTRIBUTE_UNUSED
, tree rhs
,
6352 tree rhs_origtype ATTRIBUTE_UNUSED
)
6354 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
6357 /* Build an assignment expression of lvalue LHS from value RHS.
6358 MODIFYCODE is the code for a binary operator that we use
6359 to combine the old value of LHS with RHS to get the new value.
6360 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6362 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6365 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6366 tsubst_flags_t complain
)
6370 tree lhstype
= TREE_TYPE (lhs
);
6371 tree olhstype
= lhstype
;
6372 bool plain_assign
= (modifycode
== NOP_EXPR
);
6374 /* Avoid duplicate error messages from operands that had errors. */
6375 if (error_operand_p (lhs
) || error_operand_p (rhs
))
6376 return error_mark_node
;
6378 /* Handle control structure constructs used as "lvalues". */
6379 switch (TREE_CODE (lhs
))
6381 /* Handle --foo = 5; as these are valid constructs in C++. */
6382 case PREDECREMENT_EXPR
:
6383 case PREINCREMENT_EXPR
:
6384 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6385 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6386 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6387 TREE_OPERAND (lhs
, 1));
6388 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
6389 modifycode
, rhs
, complain
);
6390 if (newrhs
== error_mark_node
)
6391 return error_mark_node
;
6392 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6394 /* Handle (a, b) used as an "lvalue". */
6396 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6397 modifycode
, rhs
, complain
);
6398 if (newrhs
== error_mark_node
)
6399 return error_mark_node
;
6400 return build2 (COMPOUND_EXPR
, lhstype
,
6401 TREE_OPERAND (lhs
, 0), newrhs
);
6404 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
6405 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
6406 stabilize_reference (TREE_OPERAND (lhs
, 0)),
6407 TREE_OPERAND (lhs
, 1));
6408 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
6410 if (newrhs
== error_mark_node
)
6411 return error_mark_node
;
6412 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
6416 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6417 when neither operand has side-effects. */
6418 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6419 return error_mark_node
;
6421 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
6422 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
6424 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
6425 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
6427 TREE_OPERAND (lhs
, 0),
6428 TREE_OPERAND (lhs
, 1)),
6429 TREE_OPERAND (lhs
, 0),
6430 TREE_OPERAND (lhs
, 1));
6433 /* Handle (a ? b : c) used as an "lvalue". */
6436 /* Produce (a ? (b = rhs) : (c = rhs))
6437 except that the RHS goes through a save-expr
6438 so the code to compute it is only emitted once. */
6440 tree preeval
= NULL_TREE
;
6442 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
6444 if (complain
& tf_error
)
6445 error ("void value not ignored as it ought to be");
6446 return error_mark_node
;
6449 rhs
= stabilize_expr (rhs
, &preeval
);
6451 /* Check this here to avoid odd errors when trying to convert
6452 a throw to the type of the COND_EXPR. */
6453 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6454 return error_mark_node
;
6456 cond
= build_conditional_expr
6457 (TREE_OPERAND (lhs
, 0),
6458 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
6459 modifycode
, rhs
, complain
),
6460 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
6461 modifycode
, rhs
, complain
),
6464 if (cond
== error_mark_node
)
6466 /* Make sure the code to compute the rhs comes out
6467 before the split. */
6469 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
6477 if (modifycode
== INIT_EXPR
)
6479 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6480 /* Do the default thing. */;
6481 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
6483 /* Compound literal. */
6484 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
6485 /* Call convert to generate an error; see PR 11063. */
6486 rhs
= convert (lhstype
, rhs
);
6487 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
6488 TREE_SIDE_EFFECTS (result
) = 1;
6491 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
6492 /* Do the default thing. */;
6495 VEC(tree
,gc
) *rhs_vec
= make_tree_vector_single (rhs
);
6496 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
6497 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
6499 release_tree_vector (rhs_vec
);
6500 if (result
== NULL_TREE
)
6501 return error_mark_node
;
6507 lhs
= require_complete_type (lhs
);
6508 if (lhs
== error_mark_node
)
6509 return error_mark_node
;
6511 if (modifycode
== NOP_EXPR
)
6513 /* `operator=' is not an inheritable operator. */
6514 if (! MAYBE_CLASS_TYPE_P (lhstype
))
6515 /* Do the default thing. */;
6518 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
6519 lhs
, rhs
, make_node (NOP_EXPR
),
6520 /*overloaded_p=*/NULL
,
6522 if (result
== NULL_TREE
)
6523 return error_mark_node
;
6530 /* A binary op has been requested. Combine the old LHS
6531 value with the RHS producing the value we should actually
6532 store into the LHS. */
6533 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
6534 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
6535 || MAYBE_CLASS_TYPE_P (lhstype
)));
6537 lhs
= stabilize_reference (lhs
);
6538 newrhs
= cp_build_binary_op (input_location
,
6539 modifycode
, lhs
, rhs
,
6541 if (newrhs
== error_mark_node
)
6543 if (complain
& tf_error
)
6544 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
6545 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
6546 return error_mark_node
;
6549 /* Now it looks like a plain assignment. */
6550 modifycode
= NOP_EXPR
;
6552 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
6553 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
6556 /* The left-hand side must be an lvalue. */
6557 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
6558 return error_mark_node
;
6560 /* Warn about modifying something that is `const'. Don't warn if
6561 this is initialization. */
6562 if (modifycode
!= INIT_EXPR
6563 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
6564 /* Functions are not modifiable, even though they are
6566 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
6567 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
6568 /* If it's an aggregate and any field is const, then it is
6569 effectively const. */
6570 || (CLASS_TYPE_P (lhstype
)
6571 && C_TYPE_FIELDS_READONLY (lhstype
))))
6573 if (complain
& tf_error
)
6574 readonly_error (lhs
, REK_ASSIGNMENT
);
6576 return error_mark_node
;
6579 /* If storing into a structure or union member, it may have been given a
6580 lowered bitfield type. We need to convert to the declared type first,
6581 so retrieve it now. */
6583 olhstype
= unlowered_expr_type (lhs
);
6585 /* Convert new value to destination type. */
6587 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6591 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
6593 if (check_array_initializer (lhs
, lhstype
, newrhs
))
6594 return error_mark_node
;
6595 newrhs
= digest_init (lhstype
, newrhs
);
6598 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
6599 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
6601 if (complain
& tf_error
)
6602 error ("incompatible types in assignment of %qT to %qT",
6603 TREE_TYPE (rhs
), lhstype
);
6604 return error_mark_node
;
6607 /* Allow array assignment in compiler-generated code. */
6608 else if (!current_function_decl
6609 || !DECL_ARTIFICIAL (current_function_decl
))
6611 /* This routine is used for both initialization and assignment.
6612 Make sure the diagnostic message differentiates the context. */
6613 if (complain
& tf_error
)
6615 if (modifycode
== INIT_EXPR
)
6616 error ("array used as initializer");
6618 error ("invalid array assignment");
6620 return error_mark_node
;
6623 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6624 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6625 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
6626 /*explicit_value_init_p=*/false,
6627 from_array
, complain
);
6630 if (modifycode
== INIT_EXPR
)
6631 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6632 LOOKUP_ONLYCONVERTING. */
6633 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
6634 "initialization", NULL_TREE
, 0,
6637 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6638 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
6640 if (!same_type_p (lhstype
, olhstype
))
6641 newrhs
= cp_convert_and_check (lhstype
, newrhs
);
6643 if (modifycode
!= INIT_EXPR
)
6645 if (TREE_CODE (newrhs
) == CALL_EXPR
6646 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6647 newrhs
= build_cplus_new (lhstype
, newrhs
);
6649 /* Can't initialize directly from a TARGET_EXPR, since that would
6650 cause the lhs to be constructed twice, and possibly result in
6651 accidental self-initialization. So we force the TARGET_EXPR to be
6652 expanded without a target. */
6653 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6654 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6655 TREE_OPERAND (newrhs
, 0));
6658 if (newrhs
== error_mark_node
)
6659 return error_mark_node
;
6661 if (c_dialect_objc () && flag_objc_gc
)
6663 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
6669 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6670 lhstype
, lhs
, newrhs
);
6672 TREE_SIDE_EFFECTS (result
) = 1;
6674 TREE_NO_WARNING (result
) = 1;
6680 build_x_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
6681 tsubst_flags_t complain
)
6683 if (processing_template_decl
)
6684 return build_min_nt (MODOP_EXPR
, lhs
,
6685 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6687 if (modifycode
!= NOP_EXPR
)
6689 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6690 make_node (modifycode
),
6691 /*overloaded_p=*/NULL
,
6695 TREE_NO_WARNING (rval
) = 1;
6699 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
6702 /* Helper function for get_delta_difference which assumes FROM is a base
6703 class of TO. Returns a delta for the conversion of pointer-to-member
6704 of FROM to pointer-to-member of TO. If the conversion is invalid,
6705 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6706 If C_CAST_P is true, this conversion is taking place as part of a C-style
6710 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
)
6715 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
, &kind
);
6716 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
6718 error (" in pointer to member function conversion");
6719 return size_zero_node
;
6723 if (kind
!= bk_via_virtual
)
6724 return BINFO_OFFSET (binfo
);
6726 /* FROM is a virtual base class of TO. Issue an error or warning
6727 depending on whether or not this is a reinterpret cast. */
6729 error ("pointer to member conversion via virtual base %qT",
6730 BINFO_TYPE (binfo_from_vbase (binfo
)));
6732 return size_zero_node
;
6739 /* Get difference in deltas for different pointer to member function
6740 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6741 the conversion is invalid, the constant is zero. If
6742 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6743 If C_CAST_P is true this conversion is taking place as part of a
6746 Note that the naming of FROM and TO is kind of backwards; the return
6747 value is what we add to a TO in order to get a FROM. They are named
6748 this way because we call this function to find out how to convert from
6749 a pointer to member of FROM to a pointer to member of TO. */
6752 get_delta_difference (tree from
, tree to
,
6753 bool allow_inverse_p
,
6758 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
6759 /* Pointer to member of incomplete class is permitted*/
6760 result
= size_zero_node
;
6762 result
= get_delta_difference_1 (from
, to
, c_cast_p
);
6766 if (!allow_inverse_p
)
6768 error_not_base_type (from
, to
);
6769 error (" in pointer to member conversion");
6770 result
= size_zero_node
;
6774 result
= get_delta_difference_1 (to
, from
, c_cast_p
);
6777 result
= size_diffop_loc (input_location
,
6778 size_zero_node
, result
);
6781 error_not_base_type (from
, to
);
6782 error (" in pointer to member conversion");
6783 result
= size_zero_node
;
6788 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
6792 /* Return a constructor for the pointer-to-member-function TYPE using
6793 the other components as specified. */
6796 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
6801 VEC(constructor_elt
, gc
) *v
;
6803 /* Pull the FIELD_DECLs out of the type. */
6804 pfn_field
= TYPE_FIELDS (type
);
6805 delta_field
= TREE_CHAIN (pfn_field
);
6807 /* Make sure DELTA has the type we want. */
6808 delta
= convert_and_check (delta_type_node
, delta
);
6810 /* Convert to the correct target type if necessary. */
6811 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
6813 /* Finish creating the initializer. */
6814 v
= VEC_alloc(constructor_elt
, gc
, 2);
6815 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
6816 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
6817 u
= build_constructor (type
, v
);
6818 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
6819 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
6820 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
6822 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6827 /* Build a constructor for a pointer to member function. It can be
6828 used to initialize global variables, local variable, or used
6829 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6832 If FORCE is nonzero, then force this conversion, even if
6833 we would rather not do it. Usually set when using an explicit
6834 cast. A C-style cast is being processed iff C_CAST_P is true.
6836 Return error_mark_node, if something goes wrong. */
6839 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
)
6845 if (error_operand_p (pfn
))
6846 return error_mark_node
;
6848 pfn_type
= TREE_TYPE (pfn
);
6849 to_type
= build_ptrmemfunc_type (type
);
6851 /* Handle multiple conversions of pointer to member functions. */
6852 if (TYPE_PTRMEMFUNC_P (pfn_type
))
6854 tree delta
= NULL_TREE
;
6855 tree npfn
= NULL_TREE
;
6859 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
, LOOKUP_NORMAL
))
6860 error ("invalid conversion to type %qT from type %qT",
6863 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
6864 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
6868 /* We don't have to do any conversion to convert a
6869 pointer-to-member to its own type. But, we don't want to
6870 just return a PTRMEM_CST if there's an explicit cast; that
6871 cast should make the expression an invalid template argument. */
6872 if (TREE_CODE (pfn
) != PTRMEM_CST
)
6874 if (same_type_p (to_type
, pfn_type
))
6876 else if (integer_zerop (n
))
6877 return build_reinterpret_cast (to_type
, pfn
,
6878 tf_warning_or_error
);
6881 if (TREE_SIDE_EFFECTS (pfn
))
6882 pfn
= save_expr (pfn
);
6884 /* Obtain the function pointer and the current DELTA. */
6885 if (TREE_CODE (pfn
) == PTRMEM_CST
)
6886 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
6889 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
6890 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
6893 /* Just adjust the DELTA field. */
6894 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6895 (TREE_TYPE (delta
), ptrdiff_type_node
));
6896 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
6897 n
= cp_build_binary_op (input_location
,
6898 LSHIFT_EXPR
, n
, integer_one_node
,
6899 tf_warning_or_error
);
6900 delta
= cp_build_binary_op (input_location
,
6901 PLUS_EXPR
, delta
, n
, tf_warning_or_error
);
6902 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
6905 /* Handle null pointer to member function conversions. */
6906 if (integer_zerop (pfn
))
6908 pfn
= build_c_cast (input_location
, type
, integer_zero_node
);
6909 return build_ptrmemfunc1 (to_type
,
6914 if (type_unknown_p (pfn
))
6915 return instantiate_type (type
, pfn
, tf_warning_or_error
);
6917 fn
= TREE_OPERAND (pfn
, 0);
6918 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
6919 /* In a template, we will have preserved the
6921 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
6922 return make_ptrmem_cst (to_type
, fn
);
6925 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6928 ??? There is no consistency as to the types returned for the above
6929 values. Some code acts as if it were a sizetype and some as if it were
6930 integer_type_node. */
6933 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
6935 tree type
= TREE_TYPE (cst
);
6936 tree fn
= PTRMEM_CST_MEMBER (cst
);
6937 tree ptr_class
, fn_class
;
6939 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6941 /* The class that the function belongs to. */
6942 fn_class
= DECL_CONTEXT (fn
);
6944 /* The class that we're creating a pointer to member of. */
6945 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
6947 /* First, calculate the adjustment to the function's class. */
6948 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
6951 if (!DECL_VIRTUAL_P (fn
))
6952 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
6955 /* If we're dealing with a virtual function, we have to adjust 'this'
6956 again, to point to the base which provides the vtable entry for
6957 fn; the call will do the opposite adjustment. */
6958 tree orig_class
= DECL_CONTEXT (fn
);
6959 tree binfo
= binfo_or_else (orig_class
, fn_class
);
6960 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6961 *delta
, BINFO_OFFSET (binfo
));
6962 *delta
= fold_if_not_in_template (*delta
);
6964 /* We set PFN to the vtable offset at which the function can be
6965 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6966 case delta is shifted left, and then incremented). */
6967 *pfn
= DECL_VINDEX (fn
);
6968 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
6969 TYPE_SIZE_UNIT (vtable_entry_type
));
6970 *pfn
= fold_if_not_in_template (*pfn
);
6972 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
6974 case ptrmemfunc_vbit_in_pfn
:
6975 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
6977 *pfn
= fold_if_not_in_template (*pfn
);
6980 case ptrmemfunc_vbit_in_delta
:
6981 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
6982 *delta
, integer_one_node
);
6983 *delta
= fold_if_not_in_template (*delta
);
6984 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
6985 *delta
, integer_one_node
);
6986 *delta
= fold_if_not_in_template (*delta
);
6993 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
6994 *pfn
= fold_if_not_in_template (*pfn
);
6998 /* Return an expression for PFN from the pointer-to-member function
7002 pfn_from_ptrmemfunc (tree t
)
7004 if (TREE_CODE (t
) == PTRMEM_CST
)
7009 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7014 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
7017 /* Return an expression for DELTA from the pointer-to-member function
7021 delta_from_ptrmemfunc (tree t
)
7023 if (TREE_CODE (t
) == PTRMEM_CST
)
7028 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
7033 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
7036 /* Convert value RHS to type TYPE as preparation for an assignment to
7037 an lvalue of type TYPE. ERRTYPE is a string to use in error
7038 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
7039 are doing the conversion in order to pass the PARMNUMth argument of
7043 convert_for_assignment (tree type
, tree rhs
,
7044 const char *errtype
, tree fndecl
, int parmnum
,
7045 tsubst_flags_t complain
, int flags
)
7048 enum tree_code coder
;
7050 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7051 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
7052 rhs
= TREE_OPERAND (rhs
, 0);
7054 rhstype
= TREE_TYPE (rhs
);
7055 coder
= TREE_CODE (rhstype
);
7057 if (TREE_CODE (type
) == VECTOR_TYPE
&& coder
== VECTOR_TYPE
7058 && vector_types_convertible_p (type
, rhstype
, true))
7059 return convert (type
, rhs
);
7061 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
7062 return error_mark_node
;
7063 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
7064 return error_mark_node
;
7066 /* The RHS of an assignment cannot have void type. */
7067 if (coder
== VOID_TYPE
)
7069 if (complain
& tf_error
)
7070 error ("void value not ignored as it ought to be");
7071 return error_mark_node
;
7074 /* Simplify the RHS if possible. */
7075 if (TREE_CODE (rhs
) == CONST_DECL
)
7076 rhs
= DECL_INITIAL (rhs
);
7078 if (c_dialect_objc ())
7081 tree rname
= fndecl
;
7083 if (!strcmp (errtype
, "assignment"))
7085 else if (!strcmp (errtype
, "initialization"))
7089 tree selector
= objc_message_selector ();
7093 if (selector
&& parmno
> 1)
7100 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
7101 return convert (type
, rhs
);
7106 The expression is implicitly converted (clause _conv_) to the
7107 cv-unqualified type of the left operand.
7109 We allow bad conversions here because by the time we get to this point
7110 we are committed to doing the conversion. If we end up doing a bad
7111 conversion, convert_like will complain. */
7112 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
))
7114 /* When -Wno-pmf-conversions is use, we just silently allow
7115 conversions from pointers-to-members to plain pointers. If
7116 the conversion doesn't work, cp_convert will complain. */
7118 && TYPE_PTR_P (type
)
7119 && TYPE_PTRMEMFUNC_P (rhstype
))
7120 rhs
= cp_convert (strip_top_quals (type
), rhs
);
7123 if (complain
& tf_error
)
7125 /* If the right-hand side has unknown type, then it is an
7126 overloaded function. Call instantiate_type to get error
7128 if (rhstype
== unknown_type_node
)
7129 instantiate_type (type
, rhs
, tf_warning_or_error
);
7131 error ("cannot convert %qT to %qT for argument %qP to %qD",
7132 rhstype
, type
, parmnum
, fndecl
);
7134 error ("cannot convert %qT to %qT in %s", rhstype
, type
,
7137 return error_mark_node
;
7140 if (warn_missing_format_attribute
)
7142 const enum tree_code codel
= TREE_CODE (type
);
7143 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7145 && check_missing_format_attribute (type
, rhstype
)
7146 && (complain
& tf_warning
))
7147 warning (OPT_Wmissing_format_attribute
,
7148 "%s might be a candidate for a format attribute",
7152 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7154 if (warn_parentheses
7155 && TREE_CODE (type
) == BOOLEAN_TYPE
7156 && TREE_CODE (rhs
) == MODIFY_EXPR
7157 && !TREE_NO_WARNING (rhs
)
7158 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
7159 && (complain
& tf_warning
))
7161 location_t loc
= EXPR_HAS_LOCATION (rhs
)
7162 ? EXPR_LOCATION (rhs
) : input_location
;
7164 warning_at (loc
, OPT_Wparentheses
,
7165 "suggest parentheses around assignment used as truth value");
7166 TREE_NO_WARNING (rhs
) = 1;
7169 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
7173 /* Convert RHS to be of type TYPE.
7174 If EXP is nonzero, it is the target of the initialization.
7175 ERRTYPE is a string to use in error messages.
7177 Two major differences between the behavior of
7178 `convert_for_assignment' and `convert_for_initialization'
7179 are that references are bashed in the former, while
7180 copied in the latter, and aggregates are assigned in
7181 the former (operator=) while initialized in the
7184 If using constructor make sure no conversion operator exists, if one does
7185 exist, an ambiguity exists.
7187 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7190 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
7191 const char *errtype
, tree fndecl
, int parmnum
,
7192 tsubst_flags_t complain
)
7194 enum tree_code codel
= TREE_CODE (type
);
7196 enum tree_code coder
;
7198 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7199 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7200 if (TREE_CODE (rhs
) == NOP_EXPR
7201 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7202 && codel
!= REFERENCE_TYPE
)
7203 rhs
= TREE_OPERAND (rhs
, 0);
7205 if (type
== error_mark_node
7206 || rhs
== error_mark_node
7207 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7208 return error_mark_node
;
7210 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7211 && TREE_CODE (type
) != ARRAY_TYPE
7212 && (TREE_CODE (type
) != REFERENCE_TYPE
7213 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7214 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7215 && (TREE_CODE (type
) != REFERENCE_TYPE
7216 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
7217 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7218 rhs
= decay_conversion (rhs
);
7220 rhstype
= TREE_TYPE (rhs
);
7221 coder
= TREE_CODE (rhstype
);
7223 if (coder
== ERROR_MARK
)
7224 return error_mark_node
;
7226 /* We accept references to incomplete types, so we can
7227 return here before checking if RHS is of complete type. */
7229 if (codel
== REFERENCE_TYPE
)
7231 /* This should eventually happen in convert_arguments. */
7232 int savew
= 0, savee
= 0;
7235 savew
= warningcount
, savee
= errorcount
;
7236 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
,
7237 /*cleanup=*/NULL
, complain
);
7240 if (warningcount
> savew
)
7241 warning (0, "in passing argument %P of %q+D", parmnum
, fndecl
);
7242 else if (errorcount
> savee
)
7243 error ("in passing argument %P of %q+D", parmnum
, fndecl
);
7249 exp
= require_complete_type (exp
);
7250 if (exp
== error_mark_node
)
7251 return error_mark_node
;
7253 rhstype
= non_reference (rhstype
);
7255 type
= complete_type (type
);
7257 if (DIRECT_INIT_EXPR_P (type
, rhs
))
7258 /* Don't try to do copy-initialization if we already have
7259 direct-initialization. */
7262 if (MAYBE_CLASS_TYPE_P (type
))
7263 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7265 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
7269 /* If RETVAL is the address of, or a reference to, a local variable or
7270 temporary give an appropriate warning. */
7273 maybe_warn_about_returning_address_of_local (tree retval
)
7275 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
7276 tree whats_returned
= retval
;
7280 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7281 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7282 else if (CONVERT_EXPR_P (whats_returned
)
7283 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
7284 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7289 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
7291 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7293 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7295 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7296 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7298 warning (0, "returning reference to temporary");
7301 if (TREE_CODE (whats_returned
) == VAR_DECL
7302 && DECL_NAME (whats_returned
)
7303 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
7305 warning (0, "reference to non-lvalue returned");
7310 while (TREE_CODE (whats_returned
) == COMPONENT_REF
7311 || TREE_CODE (whats_returned
) == ARRAY_REF
)
7312 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7314 if (DECL_P (whats_returned
)
7315 && DECL_NAME (whats_returned
)
7316 && DECL_FUNCTION_SCOPE_P (whats_returned
)
7317 && !(TREE_STATIC (whats_returned
)
7318 || TREE_PUBLIC (whats_returned
)))
7320 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7321 warning (0, "reference to local variable %q+D returned",
7324 warning (0, "address of local variable %q+D returned",
7330 /* Check that returning RETVAL from the current function is valid.
7331 Return an expression explicitly showing all conversions required to
7332 change RETVAL into the function return type, and to assign it to
7333 the DECL_RESULT for the function. Set *NO_WARNING to true if
7334 code reaches end of non-void function warning shouldn't be issued
7335 on this RETURN_EXPR. */
7338 check_return_expr (tree retval
, bool *no_warning
)
7341 /* The type actually returned by the function, after any
7344 int fn_returns_value_p
;
7345 bool named_return_value_okay_p
;
7347 *no_warning
= false;
7349 /* A `volatile' function is one that isn't supposed to return, ever.
7350 (This is a G++ extension, used to get better code for functions
7351 that call the `volatile' function.) */
7352 if (TREE_THIS_VOLATILE (current_function_decl
))
7353 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7355 /* Check for various simple errors. */
7356 if (DECL_DESTRUCTOR_P (current_function_decl
))
7359 error ("returning a value from a destructor");
7362 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7364 if (in_function_try_handler
)
7365 /* If a return statement appears in a handler of the
7366 function-try-block of a constructor, the program is ill-formed. */
7367 error ("cannot return from a handler of a function-try-block of a constructor");
7369 /* You can't return a value from a constructor. */
7370 error ("returning a value from a constructor");
7374 /* As an extension, deduce lambda return type from a return statement
7375 anywhere in the body. */
7376 if (retval
&& LAMBDA_FUNCTION_P (current_function_decl
))
7378 tree lambda
= CLASSTYPE_LAMBDA_EXPR (current_class_type
);
7379 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda
))
7381 tree type
= lambda_return_type (retval
);
7382 tree oldtype
= LAMBDA_EXPR_RETURN_TYPE (lambda
);
7384 if (VOID_TYPE_P (type
))
7386 else if (oldtype
== NULL_TREE
)
7388 pedwarn (input_location
, OPT_pedantic
, "lambda return type "
7389 "can only be deduced when the return statement is "
7390 "the only statement in the function body");
7391 apply_lambda_return_type (lambda
, type
);
7393 else if (!same_type_p (type
, oldtype
))
7394 error ("inconsistent types %qT and %qT deduced for "
7395 "lambda return type", type
, oldtype
);
7399 if (processing_template_decl
)
7401 current_function_returns_value
= 1;
7402 if (check_for_bare_parameter_packs (retval
))
7403 retval
= error_mark_node
;
7407 /* When no explicit return-value is given in a function with a named
7408 return value, the named return value is used. */
7409 result
= DECL_RESULT (current_function_decl
);
7410 valtype
= TREE_TYPE (result
);
7411 gcc_assert (valtype
!= NULL_TREE
);
7412 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
7413 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
7416 /* Check for a return statement with no return value in a function
7417 that's supposed to return a value. */
7418 if (!retval
&& fn_returns_value_p
)
7420 permerror (input_location
, "return-statement with no value, in function returning %qT",
7422 /* Clear this, so finish_function won't say that we reach the
7423 end of a non-void function (which we don't, we gave a
7425 current_function_returns_null
= 0;
7426 /* And signal caller that TREE_NO_WARNING should be set on the
7427 RETURN_EXPR to avoid control reaches end of non-void function
7428 warnings in tree-cfg.c. */
7431 /* Check for a return statement with a value in a function that
7432 isn't supposed to return a value. */
7433 else if (retval
&& !fn_returns_value_p
)
7435 if (VOID_TYPE_P (TREE_TYPE (retval
)))
7436 /* You can return a `void' value from a function of `void'
7437 type. In that case, we have to evaluate the expression for
7438 its side-effects. */
7439 finish_expr_stmt (retval
);
7441 permerror (input_location
, "return-statement with a value, in function "
7442 "returning 'void'");
7443 current_function_returns_null
= 1;
7445 /* There's really no value to return, after all. */
7449 /* Remember that this function can sometimes return without a
7451 current_function_returns_null
= 1;
7453 /* Remember that this function did return a value. */
7454 current_function_returns_value
= 1;
7456 /* Check for erroneous operands -- but after giving ourselves a
7457 chance to provide an error about returning a value from a void
7459 if (error_operand_p (retval
))
7461 current_function_return_value
= error_mark_node
;
7462 return error_mark_node
;
7465 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7466 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
7467 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
7468 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
7470 && retval
&& null_ptr_cst_p (retval
))
7471 warning (0, "%<operator new%> must not return NULL unless it is "
7472 "declared %<throw()%> (or -fcheck-new is in effect)");
7474 /* Effective C++ rule 15. See also start_function. */
7476 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
7480 /* The function return type must be a reference to the current
7482 if (TREE_CODE (valtype
) == REFERENCE_TYPE
7483 && same_type_ignoring_top_level_qualifiers_p
7484 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
7486 /* Returning '*this' is obviously OK. */
7487 if (retval
== current_class_ref
)
7489 /* If we are calling a function whose return type is the same of
7490 the current class reference, it is ok. */
7491 else if (TREE_CODE (retval
) == INDIRECT_REF
7492 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
7497 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
7500 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7502 [...] For a function with a class return type, if the expression
7503 in the return statement is the name of a local object, and the cv-
7504 unqualified type of the local object is the same as the function
7505 return type, an implementation is permitted to omit creating the tem-
7506 porary object to hold the function return value [...]
7508 So, if this is a value-returning function that always returns the same
7509 local variable, remember it.
7511 It might be nice to be more flexible, and choose the first suitable
7512 variable even if the function sometimes returns something else, but
7513 then we run the risk of clobbering the variable we chose if the other
7514 returned expression uses the chosen variable somehow. And people expect
7515 this restriction, anyway. (jason 2000-11-19)
7517 See finish_function and finalize_nrv for the rest of this optimization. */
7519 named_return_value_okay_p
=
7520 (retval
!= NULL_TREE
7521 /* Must be a local, automatic variable. */
7522 && TREE_CODE (retval
) == VAR_DECL
7523 && DECL_CONTEXT (retval
) == current_function_decl
7524 && ! TREE_STATIC (retval
)
7525 && ! DECL_ANON_UNION_VAR_P (retval
)
7526 && (DECL_ALIGN (retval
)
7527 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
7528 /* The cv-unqualified type of the returned value must be the
7529 same as the cv-unqualified return type of the
7531 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
7533 (TREE_TYPE (TREE_TYPE (current_function_decl
)))))
7534 /* And the returned value must be non-volatile. */
7535 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
7537 if (fn_returns_value_p
&& flag_elide_constructors
)
7539 if (named_return_value_okay_p
7540 && (current_function_return_value
== NULL_TREE
7541 || current_function_return_value
== retval
))
7542 current_function_return_value
= retval
;
7544 current_function_return_value
= error_mark_node
;
7547 /* We don't need to do any conversions when there's nothing being
7552 /* Do any required conversions. */
7553 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
7554 /* No conversions are required. */
7558 /* The type the function is declared to return. */
7559 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
7560 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
7562 /* The functype's return type will have been set to void, if it
7563 was an incomplete type. Just treat this as 'return;' */
7564 if (VOID_TYPE_P (functype
))
7565 return error_mark_node
;
7567 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7568 treated as an rvalue for the purposes of overload resolution to
7569 favor move constructors over copy constructors. */
7570 if ((cxx_dialect
!= cxx98
)
7571 && named_return_value_okay_p
7572 /* The variable must not have the `volatile' qualifier. */
7573 && !(cp_type_quals (TREE_TYPE (retval
)) & TYPE_QUAL_VOLATILE
)
7574 /* The return type must be a class type. */
7575 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl
))))
7576 flags
= flags
| LOOKUP_PREFER_RVALUE
;
7578 /* First convert the value to the function's return type, then
7579 to the type of return value's location to handle the
7580 case that functype is smaller than the valtype. */
7581 retval
= convert_for_initialization
7582 (NULL_TREE
, functype
, retval
, flags
, "return", NULL_TREE
, 0,
7583 tf_warning_or_error
);
7584 retval
= convert (valtype
, retval
);
7586 /* If the conversion failed, treat this just like `return;'. */
7587 if (retval
== error_mark_node
)
7589 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7590 else if (! cfun
->returns_struct
7591 && TREE_CODE (retval
) == TARGET_EXPR
7592 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7593 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7594 TREE_OPERAND (retval
, 0));
7596 maybe_warn_about_returning_address_of_local (retval
);
7599 /* Actually copy the value returned into the appropriate location. */
7600 if (retval
&& retval
!= result
)
7601 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7607 /* Returns nonzero if the pointer-type FROM can be converted to the
7608 pointer-type TO via a qualification conversion. If CONSTP is -1,
7609 then we return nonzero if the pointers are similar, and the
7610 cv-qualification signature of FROM is a proper subset of that of TO.
7612 If CONSTP is positive, then all outer pointers have been
7616 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
7618 bool to_more_cv_qualified
= false;
7619 bool is_opaque_pointer
= false;
7621 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7623 if (TREE_CODE (to
) != TREE_CODE (from
))
7626 if (TREE_CODE (from
) == OFFSET_TYPE
7627 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
7628 TYPE_OFFSET_BASETYPE (to
)))
7631 /* Const and volatile mean something different for function types,
7632 so the usual checks are not appropriate. */
7633 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7635 /* In Objective-C++, some types may have been 'volatilized' by
7636 the compiler for EH; when comparing them here, the volatile
7637 qualification must be ignored. */
7638 bool objc_quals_match
= objc_type_quals_match (to
, from
);
7640 if (!at_least_as_qualified_p (to
, from
) && !objc_quals_match
)
7643 if (!at_least_as_qualified_p (from
, to
) && !objc_quals_match
)
7647 to_more_cv_qualified
= true;
7651 constp
&= TYPE_READONLY (to
);
7654 if (TREE_CODE (to
) == VECTOR_TYPE
)
7655 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7657 if (TREE_CODE (to
) != POINTER_TYPE
&& !TYPE_PTRMEM_P (to
))
7658 return ((constp
>= 0 || to_more_cv_qualified
)
7659 && (is_opaque_pointer
7660 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
7664 /* When comparing, say, char ** to char const **, this function takes
7665 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7666 types to this function. */
7669 comp_ptr_ttypes (tree to
, tree from
)
7671 return comp_ptr_ttypes_real (to
, from
, 1);
7674 /* Returns true iff FNTYPE is a non-class type that involves
7675 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7676 if a parameter type is ill-formed. */
7679 error_type_p (const_tree type
)
7683 switch (TREE_CODE (type
))
7689 case REFERENCE_TYPE
:
7691 return error_type_p (TREE_TYPE (type
));
7695 if (error_type_p (TREE_TYPE (type
)))
7697 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7698 if (error_type_p (TREE_VALUE (t
)))
7703 if (TYPE_PTRMEMFUNC_P (type
))
7704 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
7712 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7713 type or inheritance-related types, regardless of cv-quals. */
7716 ptr_reasonably_similar (const_tree to
, const_tree from
)
7718 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7720 /* Any target type is similar enough to void. */
7721 if (TREE_CODE (to
) == VOID_TYPE
)
7722 return !error_type_p (from
);
7723 if (TREE_CODE (from
) == VOID_TYPE
)
7724 return !error_type_p (to
);
7726 if (TREE_CODE (to
) != TREE_CODE (from
))
7729 if (TREE_CODE (from
) == OFFSET_TYPE
7730 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7731 TYPE_OFFSET_BASETYPE (from
),
7732 COMPARE_BASE
| COMPARE_DERIVED
))
7735 if (TREE_CODE (to
) == VECTOR_TYPE
7736 && vector_types_convertible_p (to
, from
, false))
7739 if (TREE_CODE (to
) == INTEGER_TYPE
7740 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
7743 if (TREE_CODE (to
) == FUNCTION_TYPE
)
7744 return !error_type_p (to
) && !error_type_p (from
);
7746 if (TREE_CODE (to
) != POINTER_TYPE
)
7748 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
7749 COMPARE_BASE
| COMPARE_DERIVED
);
7753 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7754 pointer-to-member types) are the same, ignoring cv-qualification at
7758 comp_ptr_ttypes_const (tree to
, tree from
)
7760 bool is_opaque_pointer
= false;
7762 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7764 if (TREE_CODE (to
) != TREE_CODE (from
))
7767 if (TREE_CODE (from
) == OFFSET_TYPE
7768 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
7769 TYPE_OFFSET_BASETYPE (to
)))
7772 if (TREE_CODE (to
) == VECTOR_TYPE
)
7773 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
7775 if (TREE_CODE (to
) != POINTER_TYPE
)
7776 return (is_opaque_pointer
7777 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
7781 /* Returns the type qualifiers for this type, including the qualifiers on the
7782 elements for an array type. */
7785 cp_type_quals (const_tree type
)
7787 /* This CONST_CAST is okay because strip_array_types returns its
7788 argument unmodified and we assign it to a const_tree. */
7789 type
= strip_array_types (CONST_CAST_TREE(type
));
7790 if (type
== error_mark_node
)
7791 return TYPE_UNQUALIFIED
;
7792 return TYPE_QUALS (type
);
7795 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7799 cp_type_readonly (const_tree type
)
7801 /* This CONST_CAST is okay because strip_array_types returns its
7802 argument unmodified and we assign it to a const_tree. */
7803 type
= strip_array_types (CONST_CAST_TREE(type
));
7804 return TYPE_READONLY (type
);
7807 /* Returns nonzero if TYPE is const or volatile. */
7810 cv_qualified_p (const_tree type
)
7812 int quals
= cp_type_quals (type
);
7813 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
7816 /* Returns nonzero if the TYPE contains a mutable member. */
7819 cp_has_mutable_p (const_tree type
)
7821 /* This CONST_CAST is okay because strip_array_types returns its
7822 argument unmodified and we assign it to a const_tree. */
7823 type
= strip_array_types (CONST_CAST_TREE(type
));
7825 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
7828 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7829 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7830 approximation. In particular, consider:
7833 struct S { int i; };
7834 const S s = { f(); }
7836 Here, we will make "s" as TREE_READONLY (because it is declared
7837 "const") -- only to reverse ourselves upon seeing that the
7838 initializer is non-constant. */
7841 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
7843 tree type
= TREE_TYPE (decl
);
7845 if (type
== error_mark_node
)
7848 if (TREE_CODE (decl
) == TYPE_DECL
)
7851 if (TREE_CODE (type
) == FUNCTION_TYPE
7852 && type_quals
!= TYPE_UNQUALIFIED
)
7854 /* This was an error in C++98 (cv-qualifiers cannot be added to
7855 a function type), but DR 295 makes the code well-formed by
7856 dropping the extra qualifiers. */
7859 tree bad_type
= build_qualified_type (type
, type_quals
);
7860 pedwarn (input_location
, OPT_pedantic
,
7861 "ignoring %qV qualifiers added to function type %qT",
7865 TREE_TYPE (decl
) = TYPE_MAIN_VARIANT (type
);
7869 /* Avoid setting TREE_READONLY incorrectly. */
7870 if (/* If the object has a constructor, the constructor may modify
7872 TYPE_NEEDS_CONSTRUCTING (type
)
7873 /* If the type isn't complete, we don't know yet if it will need
7875 || !COMPLETE_TYPE_P (type
)
7876 /* If the type has a mutable component, that component might be
7878 || TYPE_HAS_MUTABLE_P (type
))
7879 type_quals
&= ~TYPE_QUAL_CONST
;
7881 c_apply_type_quals_to_decl (type_quals
, decl
);
7884 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7885 exemplar types such that casting T1 to T2 is casting away constness
7886 if and only if there is no implicit conversion from T1 to T2. */
7889 casts_away_constness_r (tree
*t1
, tree
*t2
)
7894 /* [expr.const.cast]
7896 For multi-level pointer to members and multi-level mixed pointers
7897 and pointers to members (conv.qual), the "member" aspect of a
7898 pointer to member level is ignored when determining if a const
7899 cv-qualifier has been cast away. */
7900 /* [expr.const.cast]
7902 For two pointer types:
7904 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7905 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7908 casting from X1 to X2 casts away constness if, for a non-pointer
7909 type T there does not exist an implicit conversion (clause
7912 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7916 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7917 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRMEM_P (*t1
))
7918 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRMEM_P (*t2
)))
7920 *t1
= cp_build_qualified_type (void_type_node
,
7921 cp_type_quals (*t1
));
7922 *t2
= cp_build_qualified_type (void_type_node
,
7923 cp_type_quals (*t2
));
7927 quals1
= cp_type_quals (*t1
);
7928 quals2
= cp_type_quals (*t2
);
7930 if (TYPE_PTRMEM_P (*t1
))
7931 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
7933 *t1
= TREE_TYPE (*t1
);
7934 if (TYPE_PTRMEM_P (*t2
))
7935 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
7937 *t2
= TREE_TYPE (*t2
);
7939 casts_away_constness_r (t1
, t2
);
7940 *t1
= build_pointer_type (*t1
);
7941 *t2
= build_pointer_type (*t2
);
7942 *t1
= cp_build_qualified_type (*t1
, quals1
);
7943 *t2
= cp_build_qualified_type (*t2
, quals2
);
7946 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7949 ??? This function returns non-zero if casting away qualifiers not
7950 just const. We would like to return to the caller exactly which
7951 qualifiers are casted away to give more accurate diagnostics.
7955 casts_away_constness (tree t1
, tree t2
)
7957 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
7959 /* [expr.const.cast]
7961 Casting from an lvalue of type T1 to an lvalue of type T2
7962 using a reference cast casts away constness if a cast from an
7963 rvalue of type "pointer to T1" to the type "pointer to T2"
7964 casts away constness. */
7965 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
7966 return casts_away_constness (build_pointer_type (t1
),
7967 build_pointer_type (TREE_TYPE (t2
)));
7970 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
7971 /* [expr.const.cast]
7973 Casting from an rvalue of type "pointer to data member of X
7974 of type T1" to the type "pointer to data member of Y of type
7975 T2" casts away constness if a cast from an rvalue of type
7976 "pointer to T1" to the type "pointer to T2" casts away
7978 return casts_away_constness
7979 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
7980 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)));
7982 /* Casting away constness is only something that makes sense for
7983 pointer or reference types. */
7984 if (TREE_CODE (t1
) != POINTER_TYPE
7985 || TREE_CODE (t2
) != POINTER_TYPE
)
7988 /* Top-level qualifiers don't matter. */
7989 t1
= TYPE_MAIN_VARIANT (t1
);
7990 t2
= TYPE_MAIN_VARIANT (t2
);
7991 casts_away_constness_r (&t1
, &t2
);
7992 if (!can_convert (t2
, t1
))
7998 /* If T is a REFERENCE_TYPE return the type to which T refers.
7999 Otherwise, return T itself. */
8002 non_reference (tree t
)
8004 if (TREE_CODE (t
) == REFERENCE_TYPE
)
8010 /* Return nonzero if REF is an lvalue valid for this language;
8011 otherwise, print an error message and return zero. USE says
8012 how the lvalue is being used and so selects the error message. */
8015 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
8017 int win
= lvalue_p (ref
);
8019 if (!win
&& (complain
& tf_error
))