1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987-2023 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* This file is part of the C++ front end.
23 It contains routines to build C++ expressions given their operands,
24 including computing the types of the result, C and C++ specific error
25 checks, and some optimization. */
29 #include "coretypes.h"
32 #include "stor-layout.h"
36 #include "c-family/c-objc.h"
37 #include "c-family/c-ubsan.h"
38 #include "gcc-rich-location.h"
39 #include "stringpool.h"
44 static tree
cp_build_addr_expr_strict (tree
, tsubst_flags_t
);
45 static tree
cp_build_function_call (tree
, tree
, tsubst_flags_t
);
46 static tree
pfn_from_ptrmemfunc (tree
);
47 static tree
delta_from_ptrmemfunc (tree
);
48 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
50 static tree
cp_pointer_int_sum (location_t
, enum tree_code
, tree
, tree
,
52 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
54 static bool comp_ptr_ttypes_real (tree
, tree
, int);
55 static bool comp_except_types (tree
, tree
, bool);
56 static bool comp_array_types (const_tree
, const_tree
, compare_bounds_t
, bool);
57 static tree
pointer_diff (location_t
, tree
, tree
, tree
, tsubst_flags_t
, tree
*);
58 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
59 static void casts_away_constness_r (tree
*, tree
*, tsubst_flags_t
);
60 static bool casts_away_constness (tree
, tree
, tsubst_flags_t
);
61 static bool maybe_warn_about_returning_address_of_local (tree
, location_t
= UNKNOWN_LOCATION
);
62 static void error_args_num (location_t
, tree
, bool);
63 static int convert_arguments (tree
, vec
<tree
, va_gc
> **, tree
, int,
65 static bool is_std_move_p (tree
);
66 static bool is_std_forward_p (tree
);
68 /* Do `exp = require_complete_type (exp);' to make sure exp
69 does not have an incomplete type. (That includes void types.)
70 Returns error_mark_node if the VALUE does not have
71 complete type when this function returns. */
74 require_complete_type (tree value
,
75 tsubst_flags_t complain
/* = tf_warning_or_error */)
79 if (processing_template_decl
|| value
== error_mark_node
)
82 if (TREE_CODE (value
) == OVERLOAD
)
83 type
= unknown_type_node
;
85 type
= TREE_TYPE (value
);
87 if (type
== error_mark_node
)
88 return error_mark_node
;
90 /* First, detect a valid value with a complete type. */
91 if (COMPLETE_TYPE_P (type
))
94 if (complete_type_or_maybe_complain (type
, value
, complain
))
97 return error_mark_node
;
100 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
101 a template instantiation, do the instantiation. Returns TYPE,
102 whether or not it could be completed, unless something goes
103 horribly wrong, in which case the error_mark_node is returned. */
106 complete_type (tree type
)
108 if (type
== NULL_TREE
)
109 /* Rather than crash, we return something sure to cause an error
111 return error_mark_node
;
113 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
115 else if (TREE_CODE (type
) == ARRAY_TYPE
)
117 tree t
= complete_type (TREE_TYPE (type
));
118 unsigned int needs_constructing
, has_nontrivial_dtor
;
119 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
122 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
124 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
125 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
127 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
128 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
131 else if (CLASS_TYPE_P (type
))
134 /* TYPE could be a class member we've not loaded the definition of. */
135 lazy_load_pendings (TYPE_NAME (TYPE_MAIN_VARIANT (type
)));
137 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
138 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
144 /* Like complete_type, but issue an error if the TYPE cannot be completed.
145 VALUE is used for informative diagnostics.
146 Returns NULL_TREE if the type cannot be made complete. */
149 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
151 type
= complete_type (type
);
152 if (type
== error_mark_node
)
153 /* We already issued an error. */
155 else if (!COMPLETE_TYPE_P (type
))
157 if (complain
& tf_error
)
158 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
159 note_failed_type_completion_for_satisfaction (type
);
167 complete_type_or_else (tree type
, tree value
)
169 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
173 /* Return the common type of two parameter lists.
174 We assume that comptypes has already been done and returned 1;
175 if that isn't so, this may crash.
177 As an optimization, free the space we allocate if the parameter
178 lists are already common. */
181 commonparms (tree p1
, tree p2
)
183 tree oldargs
= p1
, newargs
, n
;
187 len
= list_length (p1
);
188 newargs
= tree_last (p1
);
190 if (newargs
== void_list_node
)
199 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
204 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
206 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
208 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
211 else if (! TREE_PURPOSE (p1
))
213 if (TREE_PURPOSE (p2
))
215 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
221 if (simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)) != 1)
223 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
225 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
228 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
231 TREE_VALUE (n
) = TREE_VALUE (p1
);
239 /* Given a type, perhaps copied for a typedef,
240 find the "original" version of it. */
242 original_type (tree t
)
244 int quals
= cp_type_quals (t
);
245 while (t
!= error_mark_node
246 && TYPE_NAME (t
) != NULL_TREE
)
248 tree x
= TYPE_NAME (t
);
249 if (TREE_CODE (x
) != TYPE_DECL
)
251 x
= DECL_ORIGINAL_TYPE (x
);
256 return cp_build_qualified_type (t
, quals
);
259 /* Merge the attributes of type OTHER_TYPE into the attributes of type TYPE
260 and return a variant of TYPE with the merged attributes. */
263 merge_type_attributes_from (tree type
, tree other_type
)
265 tree attrs
= targetm
.merge_type_attributes (type
, other_type
);
266 attrs
= restrict_type_identity_attributes_to (attrs
, TYPE_ATTRIBUTES (type
));
267 return cp_build_type_attribute_variant (type
, attrs
);
270 /* Compare floating point conversion ranks and subranks of T1 and T2
271 types. If T1 and T2 have unordered conversion ranks, return 3.
272 If T1 has greater conversion rank than T2, return 2.
273 If T2 has greater conversion rank than T1, return -2.
274 If T1 has equal conversion rank as T2, return -1, 0 or 1 depending
275 on if T1 has smaller, equal or greater conversion subrank than
279 cp_compare_floating_point_conversion_ranks (tree t1
, tree t2
)
281 tree mv1
= TYPE_MAIN_VARIANT (t1
);
282 tree mv2
= TYPE_MAIN_VARIANT (t2
);
289 for (int i
= 0; i
< NUM_FLOATN_NX_TYPES
; ++i
)
291 if (mv1
== FLOATN_NX_TYPE_NODE (i
))
293 if (mv2
== FLOATN_NX_TYPE_NODE (i
))
296 if (mv1
== bfloat16_type_node
)
298 if (mv2
== bfloat16_type_node
)
300 if (extended2
&& !extended1
)
302 int ret
= cp_compare_floating_point_conversion_ranks (t2
, t1
);
303 return ret
== 3 ? 3 : -ret
;
306 const struct real_format
*fmt1
= REAL_MODE_FORMAT (TYPE_MODE (t1
));
307 const struct real_format
*fmt2
= REAL_MODE_FORMAT (TYPE_MODE (t2
));
308 gcc_assert (fmt1
->b
== 2 && fmt2
->b
== 2);
309 /* For {ibm,mips}_extended_format formats, the type has variable
310 precision up to ~2150 bits when the first double is around maximum
311 representable double and second double is subnormal minimum.
312 So, e.g. for __ibm128 vs. std::float128_t, they have unordered
314 int p1
= (MODE_COMPOSITE_P (TYPE_MODE (t1
))
315 ? fmt1
->emax
- fmt1
->emin
+ fmt1
->p
- 1 : fmt1
->p
);
316 int p2
= (MODE_COMPOSITE_P (TYPE_MODE (t2
))
317 ? fmt2
->emax
- fmt2
->emin
+ fmt2
->p
- 1 : fmt2
->p
);
318 /* The rank of a floating point type T is greater than the rank of
319 any floating-point type whose set of values is a proper subset
320 of the set of values of T. */
321 if ((p1
> p2
&& fmt1
->emax
>= fmt2
->emax
)
322 || (p1
== p2
&& fmt1
->emax
> fmt2
->emax
))
324 if ((p1
< p2
&& fmt1
->emax
<= fmt2
->emax
)
325 || (p1
== p2
&& fmt1
->emax
< fmt2
->emax
))
327 if ((p1
> p2
&& fmt1
->emax
< fmt2
->emax
)
328 || (p1
< p2
&& fmt1
->emax
> fmt2
->emax
))
330 if (!extended1
&& !extended2
)
332 /* The rank of long double is greater than the rank of double, which
333 is greater than the rank of float. */
334 if (t1
== long_double_type_node
)
336 else if (t2
== long_double_type_node
)
338 if (t1
== double_type_node
)
340 else if (t2
== double_type_node
)
342 if (t1
== float_type_node
)
344 else if (t2
== float_type_node
)
348 /* Two extended floating-point types with the same set of values have equal
350 if (extended1
&& extended2
)
352 if ((extended1
<= NUM_FLOATN_TYPES
) == (extended2
<= NUM_FLOATN_TYPES
))
354 /* Prefer higher extendedN value. */
355 if (extended1
> extended2
)
357 else if (extended1
< extended2
)
362 else if (extended1
<= NUM_FLOATN_TYPES
)
363 /* Prefer _FloatN type over _FloatMx type. */
365 else if (extended2
<= NUM_FLOATN_TYPES
)
371 /* gcc_assert (extended1 && !extended2); */
374 for (p
= &float_type_node
; p
<= &long_double_type_node
; ++p
)
376 const struct real_format
*fmt3
= REAL_MODE_FORMAT (TYPE_MODE (*p
));
377 gcc_assert (fmt3
->b
== 2);
378 int p3
= (MODE_COMPOSITE_P (TYPE_MODE (*p
))
379 ? fmt3
->emax
- fmt3
->emin
+ fmt3
->p
- 1 : fmt3
->p
);
380 if (p1
== p3
&& fmt1
->emax
== fmt3
->emax
)
383 /* An extended floating-point type with the same set of values
384 as exactly one cv-unqualified standard floating-point type
385 has a rank equal to the rank of that standard floating-point
388 An extended floating-point type with the same set of values
389 as more than one cv-unqualified standard floating-point type
390 has a rank equal to the rank of double.
392 Thus, if the latter is true and t2 is long double, t2
394 if (cnt
> 1 && mv2
== long_double_type_node
)
396 /* Otherwise, they have equal rank, but extended types
397 (other than std::bfloat16_t) have higher subrank.
398 std::bfloat16_t shouldn't have equal rank to any standard
399 floating point type. */
403 /* Return the common type for two arithmetic types T1 and T2 under the
404 usual arithmetic conversions. The default conversions have already
405 been applied, and enumerated types converted to their compatible
409 cp_common_type (tree t1
, tree t2
)
411 enum tree_code code1
= TREE_CODE (t1
);
412 enum tree_code code2
= TREE_CODE (t2
);
417 /* In what follows, we slightly generalize the rules given in [expr] so
418 as to deal with `long long' and `complex'. First, merge the
420 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
422 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
424 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
425 return build_type_attribute_variant (t1
, attributes
);
430 /* FIXME: Attributes. */
431 gcc_assert (ARITHMETIC_TYPE_P (t1
)
432 || VECTOR_TYPE_P (t1
)
433 || UNSCOPED_ENUM_P (t1
));
434 gcc_assert (ARITHMETIC_TYPE_P (t2
)
435 || VECTOR_TYPE_P (t2
)
436 || UNSCOPED_ENUM_P (t2
));
438 /* If one type is complex, form the common type of the non-complex
439 components, then make that complex. Use T1 or T2 if it is the
441 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
443 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
444 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
446 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
448 if (subtype
== error_mark_node
)
450 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
451 return build_type_attribute_variant (t1
, attributes
);
452 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
453 return build_type_attribute_variant (t2
, attributes
);
455 return build_type_attribute_variant (build_complex_type (subtype
),
459 if (code1
== VECTOR_TYPE
)
461 /* When we get here we should have two vectors of the same size.
462 Just prefer the unsigned one if present. */
463 if (TYPE_UNSIGNED (t1
))
464 return merge_type_attributes_from (t1
, t2
);
466 return merge_type_attributes_from (t2
, t1
);
469 /* If only one is real, use it as the result. */
470 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
471 return build_type_attribute_variant (t1
, attributes
);
472 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
473 return build_type_attribute_variant (t2
, attributes
);
475 if (code1
== REAL_TYPE
476 && (extended_float_type_p (t1
) || extended_float_type_p (t2
)))
478 tree mv1
= TYPE_MAIN_VARIANT (t1
);
479 tree mv2
= TYPE_MAIN_VARIANT (t2
);
481 return build_type_attribute_variant (t1
, attributes
);
483 int cmpret
= cp_compare_floating_point_conversion_ranks (mv1
, mv2
);
485 return error_mark_node
;
486 else if (cmpret
>= 0)
487 return build_type_attribute_variant (t1
, attributes
);
489 return build_type_attribute_variant (t2
, attributes
);
492 /* Both real or both integers; use the one with greater precision. */
493 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
494 return build_type_attribute_variant (t1
, attributes
);
495 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
496 return build_type_attribute_variant (t2
, attributes
);
498 /* The types are the same; no need to do anything fancy. */
499 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
500 return build_type_attribute_variant (t1
, attributes
);
502 if (code1
!= REAL_TYPE
)
504 /* If one is unsigned long long, then convert the other to unsigned
506 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
507 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
508 return build_type_attribute_variant (long_long_unsigned_type_node
,
510 /* If one is a long long, and the other is an unsigned long, and
511 long long can represent all the values of an unsigned long, then
512 convert to a long long. Otherwise, convert to an unsigned long
513 long. Otherwise, if either operand is long long, convert the
516 Since we're here, we know the TYPE_PRECISION is the same;
517 therefore converting to long long cannot represent all the values
518 of an unsigned long, so we choose unsigned long long in that
520 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
521 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
523 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
524 ? long_long_unsigned_type_node
525 : long_long_integer_type_node
);
526 return build_type_attribute_variant (t
, attributes
);
529 /* Go through the same procedure, but for longs. */
530 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
531 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
532 return build_type_attribute_variant (long_unsigned_type_node
,
534 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
535 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
537 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
538 ? long_unsigned_type_node
: long_integer_type_node
);
539 return build_type_attribute_variant (t
, attributes
);
542 /* For __intN types, either the type is __int128 (and is lower
543 priority than the types checked above, but higher than other
544 128-bit types) or it's known to not be the same size as other
545 types (enforced in toplev.cc). Prefer the unsigned type. */
546 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
548 if (int_n_enabled_p
[i
]
549 && (same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].signed_type
)
550 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].signed_type
)
551 || same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].unsigned_type
)
552 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].unsigned_type
)))
554 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
555 ? int_n_trees
[i
].unsigned_type
556 : int_n_trees
[i
].signed_type
);
557 return build_type_attribute_variant (t
, attributes
);
561 /* Otherwise prefer the unsigned one. */
562 if (TYPE_UNSIGNED (t1
))
563 return build_type_attribute_variant (t1
, attributes
);
565 return build_type_attribute_variant (t2
, attributes
);
569 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
570 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
571 return build_type_attribute_variant (long_double_type_node
,
573 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
574 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
575 return build_type_attribute_variant (double_type_node
,
577 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
578 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
579 return build_type_attribute_variant (float_type_node
,
582 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
583 the standard C++ floating-point types. Logic earlier in this
584 function has already eliminated the possibility that
585 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
586 compelling reason to choose one or the other. */
587 return build_type_attribute_variant (t1
, attributes
);
591 /* T1 and T2 are arithmetic or enumeration types. Return the type
592 that will result from the "usual arithmetic conversions" on T1 and
593 T2 as described in [expr]. */
596 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
598 gcc_assert (ARITHMETIC_TYPE_P (t1
)
599 || VECTOR_TYPE_P (t1
)
600 || UNSCOPED_ENUM_P (t1
));
601 gcc_assert (ARITHMETIC_TYPE_P (t2
)
602 || VECTOR_TYPE_P (t2
)
603 || UNSCOPED_ENUM_P (t2
));
605 /* Perform the integral promotions. We do not promote real types here. */
606 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
607 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
609 t1
= type_promotes_to (t1
);
610 t2
= type_promotes_to (t2
);
613 return cp_common_type (t1
, t2
);
617 composite_pointer_error (const op_location_t
&location
,
618 diagnostic_t kind
, tree t1
, tree t2
,
619 composite_pointer_operation operation
)
624 emit_diagnostic (kind
, location
, 0,
625 "comparison between "
626 "distinct pointer types %qT and %qT lacks a cast",
630 emit_diagnostic (kind
, location
, 0,
631 "conversion between "
632 "distinct pointer types %qT and %qT lacks a cast",
635 case CPO_CONDITIONAL_EXPR
:
636 emit_diagnostic (kind
, location
, 0,
637 "conditional expression between "
638 "distinct pointer types %qT and %qT lacks a cast",
646 /* Subroutine of composite_pointer_type to implement the recursive
647 case. See that function for documentation of the parameters. And ADD_CONST
648 is used to track adding "const" where needed. */
651 composite_pointer_type_r (const op_location_t
&location
,
652 tree t1
, tree t2
, bool *add_const
,
653 composite_pointer_operation operation
,
654 tsubst_flags_t complain
)
661 /* Determine the types pointed to by T1 and T2. */
664 pointee1
= TREE_TYPE (t1
);
665 pointee2
= TREE_TYPE (t2
);
669 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
670 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
675 If T1 and T2 are similar types, the result is the cv-combined type of
677 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
678 result_type
= pointee1
;
679 else if ((TYPE_PTR_P (pointee1
) && TYPE_PTR_P (pointee2
))
680 || (TYPE_PTRMEM_P (pointee1
) && TYPE_PTRMEM_P (pointee2
)))
682 result_type
= composite_pointer_type_r (location
, pointee1
, pointee2
,
683 add_const
, operation
, complain
);
684 if (result_type
== error_mark_node
)
685 return error_mark_node
;
689 if (complain
& tf_error
)
690 composite_pointer_error (location
, DK_PERMERROR
,
693 return error_mark_node
;
694 result_type
= void_type_node
;
696 const int q1
= cp_type_quals (pointee1
);
697 const int q2
= cp_type_quals (pointee2
);
698 const int quals
= q1
| q2
;
699 result_type
= cp_build_qualified_type (result_type
,
702 : TYPE_UNQUALIFIED
)));
703 /* The cv-combined type can add "const" as per [conv.qual]/3.3 (except for
704 the TLQ). The reason is that both T1 and T2 can then be converted to the
705 cv-combined type of T1 and T2. */
706 if (quals
!= q1
|| quals
!= q2
)
708 /* If the original types were pointers to members, so is the
710 if (TYPE_PTRMEM_P (t1
))
712 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
713 TYPE_PTRMEM_CLASS_TYPE (t2
)))
715 if (complain
& tf_error
)
716 composite_pointer_error (location
, DK_PERMERROR
,
719 return error_mark_node
;
721 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
725 result_type
= build_pointer_type (result_type
);
727 /* Merge the attributes. */
728 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
729 return build_type_attribute_variant (result_type
, attributes
);
732 /* Return the composite pointer type (see [expr.type]) for T1 and T2.
733 ARG1 and ARG2 are the values with those types. The OPERATION is to
734 describe the operation between the pointer types,
735 in case an error occurs.
737 This routine also implements the computation of a common type for
738 pointers-to-members as per [expr.eq]. */
741 composite_pointer_type (const op_location_t
&location
,
742 tree t1
, tree t2
, tree arg1
, tree arg2
,
743 composite_pointer_operation operation
,
744 tsubst_flags_t complain
)
751 If one operand is a null pointer constant, the composite pointer
752 type is the type of the other operand. */
753 if (null_ptr_cst_p (arg1
))
755 if (null_ptr_cst_p (arg2
))
762 If one of the operands has type "pointer to cv1 void", then
763 the other has type "pointer to cv2 T", and the composite pointer
764 type is "pointer to cv12 void", where cv12 is the union of cv1
767 If either type is a pointer to void, make sure it is T1. */
768 if (TYPE_PTR_P (t2
) && VOID_TYPE_P (TREE_TYPE (t2
)))
771 /* Now, if T1 is a pointer to void, merge the qualifiers. */
772 if (TYPE_PTR_P (t1
) && VOID_TYPE_P (TREE_TYPE (t1
)))
777 if (TYPE_PTRFN_P (t2
))
779 if (complain
& tf_error
)
784 pedwarn (location
, OPT_Wpedantic
,
785 "ISO C++ forbids comparison between pointer "
786 "of type %<void *%> and pointer-to-function");
789 pedwarn (location
, OPT_Wpedantic
,
790 "ISO C++ forbids conversion between pointer "
791 "of type %<void *%> and pointer-to-function");
793 case CPO_CONDITIONAL_EXPR
:
794 pedwarn (location
, OPT_Wpedantic
,
795 "ISO C++ forbids conditional expression between "
796 "pointer of type %<void *%> and "
797 "pointer-to-function");
804 return error_mark_node
;
807 = cp_build_qualified_type (void_type_node
,
808 (cp_type_quals (TREE_TYPE (t1
))
809 | cp_type_quals (TREE_TYPE (t2
))));
810 result_type
= build_pointer_type (result_type
);
811 /* Merge the attributes. */
812 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
813 return build_type_attribute_variant (result_type
, attributes
);
816 if (c_dialect_objc () && TYPE_PTR_P (t1
)
819 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
820 return objc_common_type (t1
, t2
);
823 /* if T1 or T2 is "pointer to noexcept function" and the other type is
824 "pointer to function", where the function types are otherwise the same,
825 "pointer to function" */
826 if (fnptr_conv_p (t1
, t2
))
828 if (fnptr_conv_p (t2
, t1
))
831 /* [expr.eq] permits the application of a pointer conversion to
832 bring the pointers to a common type. */
833 if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
834 && CLASS_TYPE_P (TREE_TYPE (t1
))
835 && CLASS_TYPE_P (TREE_TYPE (t2
))
836 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
839 class1
= TREE_TYPE (t1
);
840 class2
= TREE_TYPE (t2
);
842 if (DERIVED_FROM_P (class1
, class2
))
843 t2
= (build_pointer_type
844 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
845 else if (DERIVED_FROM_P (class2
, class1
))
846 t1
= (build_pointer_type
847 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
850 if (complain
& tf_error
)
851 composite_pointer_error (location
, DK_ERROR
, t1
, t2
, operation
);
852 return error_mark_node
;
855 /* [expr.eq] permits the application of a pointer-to-member
856 conversion to change the class type of one of the types. */
857 else if (TYPE_PTRMEM_P (t1
)
858 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
859 TYPE_PTRMEM_CLASS_TYPE (t2
)))
861 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
862 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
864 if (DERIVED_FROM_P (class1
, class2
))
865 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
866 else if (DERIVED_FROM_P (class2
, class1
))
867 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
870 if (complain
& tf_error
)
874 error_at (location
, "comparison between distinct "
875 "pointer-to-member types %qT and %qT lacks a cast",
879 error_at (location
, "conversion between distinct "
880 "pointer-to-member types %qT and %qT lacks a cast",
883 case CPO_CONDITIONAL_EXPR
:
884 error_at (location
, "conditional expression between distinct "
885 "pointer-to-member types %qT and %qT lacks a cast",
891 return error_mark_node
;
895 bool add_const
= false;
896 return composite_pointer_type_r (location
, t1
, t2
, &add_const
, operation
,
900 /* Return the merged type of two types.
901 We assume that comptypes has already been done and returned 1;
902 if that isn't so, this may crash.
904 This just combines attributes and default arguments; any other
905 differences would cause the two types to compare unalike. */
908 merge_types (tree t1
, tree t2
)
910 enum tree_code code1
;
911 enum tree_code code2
;
914 /* Save time if the two types are the same. */
917 if (original_type (t1
) == original_type (t2
))
920 /* If one type is nonsense, use the other. */
921 if (t1
== error_mark_node
)
923 if (t2
== error_mark_node
)
926 /* Handle merging an auto redeclaration with a previous deduced
931 /* Merge the attributes. */
932 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
934 if (TYPE_PTRMEMFUNC_P (t1
))
935 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
936 if (TYPE_PTRMEMFUNC_P (t2
))
937 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
939 code1
= TREE_CODE (t1
);
940 code2
= TREE_CODE (t2
);
943 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
944 if (code1
== TYPENAME_TYPE
)
946 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
947 code1
= TREE_CODE (t1
);
951 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
952 code2
= TREE_CODE (t2
);
960 /* For two pointers, do this recursively on the target type. */
962 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
963 int quals
= cp_type_quals (t1
);
965 if (code1
== POINTER_TYPE
)
967 t1
= build_pointer_type (target
);
968 if (TREE_CODE (target
) == METHOD_TYPE
)
969 t1
= build_ptrmemfunc_type (t1
);
972 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
973 t1
= build_type_attribute_variant (t1
, attributes
);
974 t1
= cp_build_qualified_type (t1
, quals
);
983 quals
= cp_type_quals (t1
);
984 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
985 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
986 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
988 t1
= cp_build_qualified_type (t1
, quals
);
994 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
995 /* Save space: see if the result is identical to one of the args. */
996 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
997 return build_type_attribute_variant (t1
, attributes
);
998 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
999 return build_type_attribute_variant (t2
, attributes
);
1000 /* Merge the element types, and have a size if either arg has one. */
1001 t1
= build_cplus_array_type
1002 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
1007 /* Function types: prefer the one that specified arg types.
1008 If both do, merge the arg types. Also merge the return types. */
1010 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
1011 tree p1
= TYPE_ARG_TYPES (t1
);
1012 tree p2
= TYPE_ARG_TYPES (t2
);
1015 /* Save space: see if the result is identical to one of the args. */
1016 if (valtype
== TREE_TYPE (t1
) && ! p2
)
1017 return cp_build_type_attribute_variant (t1
, attributes
);
1018 if (valtype
== TREE_TYPE (t2
) && ! p1
)
1019 return cp_build_type_attribute_variant (t2
, attributes
);
1021 /* Simple way if one arg fails to specify argument types. */
1022 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
1024 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
1027 parms
= commonparms (p1
, p2
);
1029 cp_cv_quals quals
= type_memfn_quals (t1
);
1030 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
1031 gcc_assert (quals
== type_memfn_quals (t2
));
1032 gcc_assert (rqual
== type_memfn_rqual (t2
));
1034 tree rval
= build_function_type (valtype
, parms
);
1035 rval
= apply_memfn_quals (rval
, quals
);
1036 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
1037 TYPE_RAISES_EXCEPTIONS (t2
));
1038 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
1039 t1
= build_cp_fntype_variant (rval
, rqual
, raises
, late_return_type_p
);
1045 /* Get this value the long way, since TYPE_METHOD_BASETYPE
1046 is just the main variant of this. */
1047 tree basetype
= class_of_this_parm (t2
);
1048 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
1049 TYPE_RAISES_EXCEPTIONS (t2
));
1050 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
1052 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
1054 /* If this was a member function type, get back to the
1055 original type of type member function (i.e., without
1056 the class instance variable up front. */
1057 t1
= build_function_type (TREE_TYPE (t1
),
1058 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
1059 t2
= build_function_type (TREE_TYPE (t2
),
1060 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
1061 t3
= merge_types (t1
, t2
);
1062 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
1063 TYPE_ARG_TYPES (t3
));
1064 t1
= build_cp_fntype_variant (t3
, rqual
, raises
, late_return_type_1_p
);
1069 /* There is no need to merge attributes into a TYPENAME_TYPE.
1070 When the type is instantiated it will have whatever
1071 attributes result from the instantiation. */
1075 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
1077 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
1082 return cp_build_type_attribute_variant (t1
, attributes
);
1085 /* Return the ARRAY_TYPE type without its domain. */
1088 strip_array_domain (tree type
)
1091 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1092 if (TYPE_DOMAIN (type
) == NULL_TREE
)
1094 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
1095 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
1098 /* Wrapper around cp_common_type that is used by c-common.cc and other
1099 front end optimizations that remove promotions.
1101 Return the common type for two arithmetic types T1 and T2 under the
1102 usual arithmetic conversions. The default conversions have already
1103 been applied, and enumerated types converted to their compatible
1107 common_type (tree t1
, tree t2
)
1109 /* If one type is nonsense, use the other */
1110 if (t1
== error_mark_node
)
1112 if (t2
== error_mark_node
)
1115 return cp_common_type (t1
, t2
);
1118 /* Return the common type of two pointer types T1 and T2. This is the
1119 type for the result of most arithmetic operations if the operands
1120 have the given two types.
1122 We assume that comp_target_types has already been done and returned
1123 nonzero; if that isn't so, this may crash. */
1126 common_pointer_type (tree t1
, tree t2
)
1128 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
1129 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
1130 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
1132 return composite_pointer_type (input_location
, t1
, t2
,
1133 error_mark_node
, error_mark_node
,
1134 CPO_CONVERSION
, tf_warning_or_error
);
1137 /* Compare two exception specifier types for exactness or subsetness, if
1138 allowed. Returns false for mismatch, true for match (same, or
1139 derived and !exact).
1141 [except.spec] "If a class X ... objects of class X or any class publicly
1142 and unambiguously derived from X. Similarly, if a pointer type Y * ...
1143 exceptions of type Y * or that are pointers to any type publicly and
1144 unambiguously derived from Y. Otherwise a function only allows exceptions
1145 that have the same type ..."
1146 This does not mention cv qualifiers and is different to what throw
1147 [except.throw] and catch [except.catch] will do. They will ignore the
1148 top level cv qualifiers, and allow qualifiers in the pointer to class
1151 We implement the letter of the standard. */
1154 comp_except_types (tree a
, tree b
, bool exact
)
1156 if (same_type_p (a
, b
))
1160 if (cp_type_quals (a
) || cp_type_quals (b
))
1163 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
1167 if (cp_type_quals (a
) || cp_type_quals (b
))
1171 if (TREE_CODE (a
) != RECORD_TYPE
1172 || TREE_CODE (b
) != RECORD_TYPE
)
1175 if (publicly_uniquely_derived_p (a
, b
))
1181 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1182 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1183 If EXACT is ce_type, the C++17 type compatibility rules apply.
1184 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1185 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1186 are unordered, but we've already filtered out duplicates. Most lists will
1187 be in order, we should try to make use of that. */
1190 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1199 /* First handle noexcept. */
1200 if (exact
< ce_exact
)
1202 if (exact
== ce_type
1203 && (canonical_eh_spec (CONST_CAST_TREE (t1
))
1204 == canonical_eh_spec (CONST_CAST_TREE (t2
))))
1207 /* noexcept(false) is compatible with no exception-specification,
1208 and less strict than any spec. */
1209 if (t1
== noexcept_false_spec
)
1210 return t2
== NULL_TREE
|| exact
== ce_derived
;
1211 /* Even a derived noexcept(false) is compatible with no
1212 exception-specification. */
1213 if (t2
== noexcept_false_spec
)
1214 return t1
== NULL_TREE
;
1216 /* Otherwise, if we aren't looking for an exact match, noexcept is
1217 equivalent to throw(). */
1218 if (t1
== noexcept_true_spec
)
1219 t1
= empty_except_spec
;
1220 if (t2
== noexcept_true_spec
)
1221 t2
= empty_except_spec
;
1224 /* If any noexcept is left, it is only comparable to itself;
1225 either we're looking for an exact match or we're redeclaring a
1226 template with dependent noexcept. */
1227 if ((t1
&& TREE_PURPOSE (t1
))
1228 || (t2
&& TREE_PURPOSE (t2
)))
1230 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1232 if (t1
== NULL_TREE
) /* T1 is ... */
1233 return t2
== NULL_TREE
|| exact
== ce_derived
;
1234 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1235 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1236 if (t2
== NULL_TREE
) /* T2 is ... */
1238 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1239 return exact
== ce_derived
;
1241 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1242 Count how many we find, to determine exactness. For exact matching and
1243 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1245 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1247 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1249 tree a
= TREE_VALUE (probe
);
1250 tree b
= TREE_VALUE (t2
);
1252 if (comp_except_types (a
, b
, exact
))
1254 if (probe
== base
&& exact
> ce_derived
)
1255 base
= TREE_CHAIN (probe
);
1260 if (probe
== NULL_TREE
)
1263 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1266 /* Compare the array types T1 and T2. CB says how we should behave when
1267 comparing array bounds: bounds_none doesn't allow dimensionless arrays,
1268 bounds_either says than any array can be [], bounds_first means that
1269 onlt T1 can be an array with unknown bounds. STRICT is true if
1270 qualifiers must match when comparing the types of the array elements. */
1273 comp_array_types (const_tree t1
, const_tree t2
, compare_bounds_t cb
,
1283 /* The type of the array elements must be the same. */
1285 ? !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
1286 : !similar_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1289 d1
= TYPE_DOMAIN (t1
);
1290 d2
= TYPE_DOMAIN (t2
);
1295 /* If one of the arrays is dimensionless, and the other has a
1296 dimension, they are of different types. However, it is valid to
1304 declarations for an array object can specify
1305 array types that differ by the presence or absence of a major
1306 array bound (_dcl.array_). */
1308 return cb
>= bounds_either
;
1310 return cb
== bounds_either
;
1312 /* Check that the dimensions are the same. */
1314 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1316 max1
= TYPE_MAX_VALUE (d1
);
1317 max2
= TYPE_MAX_VALUE (d2
);
1319 if (!cp_tree_equal (max1
, max2
))
1325 /* Compare the relative position of T1 and T2 into their respective
1326 template parameter list.
1327 T1 and T2 must be template parameter types.
1328 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1331 comp_template_parms_position (tree t1
, tree t2
)
1333 tree index1
, index2
;
1334 gcc_assert (t1
&& t2
1335 && TREE_CODE (t1
) == TREE_CODE (t2
)
1336 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1337 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1338 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1340 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1341 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1343 /* Then compare their relative position. */
1344 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1345 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1346 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1347 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1350 /* In C++14 we can end up comparing 'auto' to a normal template
1351 parameter. Don't confuse them. */
1352 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1353 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1358 /* Heuristic check if two parameter types can be considered ABI-equivalent. */
1361 cxx_safe_arg_type_equiv_p (tree t1
, tree t2
)
1363 t1
= TYPE_MAIN_VARIANT (t1
);
1364 t2
= TYPE_MAIN_VARIANT (t2
);
1370 /* The signedness of the parameter matters only when an integral
1371 type smaller than int is promoted to int, otherwise only the
1372 precision of the parameter matters.
1373 This check should make sure that the callee does not see
1374 undefined values in argument registers. */
1375 if (INTEGRAL_TYPE_P (t1
)
1376 && INTEGRAL_TYPE_P (t2
)
1377 && TYPE_PRECISION (t1
) == TYPE_PRECISION (t2
)
1378 && (TYPE_UNSIGNED (t1
) == TYPE_UNSIGNED (t2
)
1379 || !targetm
.calls
.promote_prototypes (NULL_TREE
)
1380 || TYPE_PRECISION (t1
) >= TYPE_PRECISION (integer_type_node
)))
1383 return same_type_p (t1
, t2
);
1386 /* Check if a type cast between two function types can be considered safe. */
1389 cxx_safe_function_type_cast_p (tree t1
, tree t2
)
1391 if (TREE_TYPE (t1
) == void_type_node
&&
1392 TYPE_ARG_TYPES (t1
) == void_list_node
)
1395 if (TREE_TYPE (t2
) == void_type_node
&&
1396 TYPE_ARG_TYPES (t2
) == void_list_node
)
1399 if (!cxx_safe_arg_type_equiv_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1402 for (t1
= TYPE_ARG_TYPES (t1
), t2
= TYPE_ARG_TYPES (t2
);
1404 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1405 if (!cxx_safe_arg_type_equiv_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1411 /* Subroutine in comptypes. */
1414 structural_comptypes (tree t1
, tree t2
, int strict
)
1416 /* Both should be types that are not obviously the same. */
1417 gcc_checking_assert (t1
!= t2
&& TYPE_P (t1
) && TYPE_P (t2
));
1419 /* Suppress typename resolution under spec_hasher::equal in place of calling
1420 push_to_top_level there. */
1421 if (!comparing_specializations
)
1423 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1424 current instantiation. */
1425 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1426 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1428 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1429 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1432 if (TYPE_PTRMEMFUNC_P (t1
))
1433 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1434 if (TYPE_PTRMEMFUNC_P (t2
))
1435 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1437 /* Different classes of types can't be compatible. */
1438 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1441 /* Qualifiers must match. For array types, we will check when we
1442 recur on the array element types. */
1443 if (TREE_CODE (t1
) != ARRAY_TYPE
1444 && cp_type_quals (t1
) != cp_type_quals (t2
))
1446 if (TREE_CODE (t1
) == FUNCTION_TYPE
1447 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1449 /* Need to check this before TYPE_MAIN_VARIANT.
1450 FIXME function qualifiers should really change the main variant. */
1451 if (FUNC_OR_METHOD_TYPE_P (t1
))
1453 if (type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1455 if (flag_noexcept_type
1456 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1
),
1457 TYPE_RAISES_EXCEPTIONS (t2
),
1462 /* Allow for two different type nodes which have essentially the same
1463 definition. Note that we already checked for equality of the type
1464 qualifiers (just above). */
1465 if (TREE_CODE (t1
) != ARRAY_TYPE
1466 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1469 /* Compare the types. Return false on known not-same. Break on not
1470 known. Never return true from this switch -- you'll break
1471 specialization comparison. */
1472 switch (TREE_CODE (t1
))
1476 /* All void and bool types are the same. */
1481 case FIXED_POINT_TYPE
:
1483 /* With these nodes, we can't determine type equivalence by
1484 looking at what is stored in the nodes themselves, because
1485 two nodes might have different TYPE_MAIN_VARIANTs but still
1486 represent the same type. For example, wchar_t and int could
1487 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1488 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1489 and are distinct types. On the other hand, int and the
1492 typedef int INT __attribute((may_alias));
1494 have identical properties, different TYPE_MAIN_VARIANTs, but
1495 represent the same type. The canonical type system keeps
1496 track of equivalence in this case, so we fall back on it. */
1497 if (TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1500 /* We don't need or want the attribute comparison. */
1503 case TEMPLATE_TEMPLATE_PARM
:
1504 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1505 if (!comp_template_parms_position (t1
, t2
))
1507 if (!comp_template_parms
1508 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1509 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1511 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1513 /* Don't check inheritance. */
1514 strict
= COMPARE_STRICT
;
1519 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1520 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1521 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1522 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1525 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1527 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1533 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1534 strict
& ~COMPARE_REDECLARATION
))
1536 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1540 case REFERENCE_TYPE
:
1541 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1543 /* fall through to checks for pointer types */
1547 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1548 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1554 /* Exception specs and memfn_rquals were checked above. */
1555 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1557 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1562 /* Target types must match incl. qualifiers. */
1563 if (!comp_array_types (t1
, t2
, ((strict
& COMPARE_REDECLARATION
)
1564 ? bounds_either
: bounds_none
),
1569 case TEMPLATE_TYPE_PARM
:
1570 /* If T1 and T2 don't have the same relative position in their
1571 template parameters set, they can't be equal. */
1572 if (!comp_template_parms_position (t1
, t2
))
1574 /* If T1 and T2 don't represent the same class template deduction,
1575 they aren't equal. */
1576 if (CLASS_PLACEHOLDER_TEMPLATE (t1
)
1577 != CLASS_PLACEHOLDER_TEMPLATE (t2
))
1579 /* Constrained 'auto's are distinct from parms that don't have the same
1581 if (!equivalent_placeholder_constraints (t1
, t2
))
1586 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1587 TYPENAME_TYPE_FULLNAME (t2
)))
1589 /* Qualifiers don't matter on scopes. */
1590 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1595 case UNBOUND_CLASS_TEMPLATE
:
1596 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1598 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1603 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1608 if (gnu_vector_type_p (t1
) != gnu_vector_type_p (t2
)
1609 || maybe_ne (TYPE_VECTOR_SUBPARTS (t1
), TYPE_VECTOR_SUBPARTS (t2
))
1610 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1614 case TYPE_PACK_EXPANSION
:
1615 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1616 PACK_EXPANSION_PATTERN (t2
))
1617 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1618 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1621 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1622 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
))
1624 if (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
) != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1626 if (DECLTYPE_FOR_LAMBDA_PROXY (t1
) != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1628 if (!cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
), DECLTYPE_TYPE_EXPR (t2
)))
1633 if (TRAIT_TYPE_KIND (t1
) != TRAIT_TYPE_KIND (t2
))
1635 if (!cp_tree_equal (TRAIT_TYPE_TYPE1 (t1
), TRAIT_TYPE_TYPE1 (t2
))
1636 || !cp_tree_equal (TRAIT_TYPE_TYPE2 (t1
), TRAIT_TYPE_TYPE2 (t2
)))
1641 if (!cp_tree_equal (TYPEOF_TYPE_EXPR (t1
), TYPEOF_TYPE_EXPR (t2
)))
1649 /* If we get here, we know that from a target independent POV the
1650 types are the same. Make sure the target attributes are also
1652 if (!comp_type_attributes (t1
, t2
))
1656 if (comparing_dependent_aliases
)
1658 /* Don't treat an alias template specialization with dependent
1659 arguments as equivalent to its underlying type when used as a
1660 template argument; we need them to be distinct so that we
1661 substitute into the specialization arguments at instantiation
1662 time. And aliases can't be equivalent without being ==, so
1663 we don't need to look any deeper. */
1664 ++processing_template_decl
;
1665 tree dep1
= dependent_alias_template_spec_p (t1
, nt_transparent
);
1666 tree dep2
= dependent_alias_template_spec_p (t2
, nt_transparent
);
1667 --processing_template_decl
;
1668 if ((dep1
|| dep2
) && dep1
!= dep2
)
1675 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1676 is a bitwise-or of the COMPARE_* flags. */
1679 comptypes (tree t1
, tree t2
, int strict
)
1681 gcc_checking_assert (t1
&& t2
);
1683 /* TYPE_ARGUMENT_PACKS are not really types. */
1684 gcc_checking_assert (TREE_CODE (t1
) != TYPE_ARGUMENT_PACK
1685 && TREE_CODE (t2
) != TYPE_ARGUMENT_PACK
);
1690 /* Suppress errors caused by previously reported errors. */
1691 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1694 if (strict
== COMPARE_STRICT
)
1696 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1697 /* At least one of the types requires structural equality, so
1698 perform a deep check. */
1699 return structural_comptypes (t1
, t2
, strict
);
1701 if (flag_checking
&& param_use_canonical_types
)
1703 bool result
= structural_comptypes (t1
, t2
, strict
);
1705 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1706 /* The two types are structurally equivalent, but their
1707 canonical types were different. This is a failure of the
1708 canonical type propagation code.*/
1710 ("canonical types differ for identical types %qT and %qT",
1712 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1713 /* Two types are structurally different, but the canonical
1714 types are the same. This means we were over-eager in
1715 assigning canonical types. */
1717 ("same canonical type node for different types %qT and %qT",
1722 if (!flag_checking
&& param_use_canonical_types
)
1723 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1725 return structural_comptypes (t1
, t2
, strict
);
1727 else if (strict
== COMPARE_STRUCTURAL
)
1728 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1730 return structural_comptypes (t1
, t2
, strict
);
1733 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1734 top-level qualifiers. */
1737 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1739 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1744 type1
= cp_build_qualified_type (type1
, TYPE_UNQUALIFIED
);
1745 type2
= cp_build_qualified_type (type2
, TYPE_UNQUALIFIED
);
1746 return same_type_p (type1
, type2
);
1749 /* Returns nonzero iff TYPE1 and TYPE2 are similar, as per [conv.qual]. */
1752 similar_type_p (tree type1
, tree type2
)
1754 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1757 /* Informally, two types are similar if, ignoring top-level cv-qualification:
1758 * they are the same type; or
1759 * they are both pointers, and the pointed-to types are similar; or
1760 * they are both pointers to member of the same class, and the types of
1761 the pointed-to members are similar; or
1762 * they are both arrays of the same size or both arrays of unknown bound,
1763 and the array element types are similar. */
1765 if (same_type_ignoring_top_level_qualifiers_p (type1
, type2
))
1768 if ((TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
1769 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
1770 || (TREE_CODE (type1
) == ARRAY_TYPE
&& TREE_CODE (type2
) == ARRAY_TYPE
))
1771 return comp_ptr_ttypes_const (type1
, type2
, bounds_either
);
1776 /* Helper function for layout_compatible_type_p and
1777 is_corresponding_member_aggr. Advance to next members (NULL if
1778 no further ones) and return true if those members are still part of
1779 the common initial sequence. */
1782 next_common_initial_sequence (tree
&memb1
, tree
&memb2
)
1786 if (TREE_CODE (memb1
) != FIELD_DECL
1787 || (DECL_FIELD_IS_BASE (memb1
) && is_empty_field (memb1
)))
1789 memb1
= DECL_CHAIN (memb1
);
1792 if (DECL_FIELD_IS_BASE (memb1
))
1794 memb1
= TYPE_FIELDS (TREE_TYPE (memb1
));
1801 if (TREE_CODE (memb2
) != FIELD_DECL
1802 || (DECL_FIELD_IS_BASE (memb2
) && is_empty_field (memb2
)))
1804 memb2
= DECL_CHAIN (memb2
);
1807 if (DECL_FIELD_IS_BASE (memb2
))
1809 memb2
= TYPE_FIELDS (TREE_TYPE (memb2
));
1814 if (memb1
== NULL_TREE
&& memb2
== NULL_TREE
)
1816 if (memb1
== NULL_TREE
|| memb2
== NULL_TREE
)
1818 if (DECL_BIT_FIELD_TYPE (memb1
))
1820 if (!DECL_BIT_FIELD_TYPE (memb2
))
1822 if (!layout_compatible_type_p (DECL_BIT_FIELD_TYPE (memb1
),
1823 DECL_BIT_FIELD_TYPE (memb2
)))
1825 if (TYPE_PRECISION (TREE_TYPE (memb1
))
1826 != TYPE_PRECISION (TREE_TYPE (memb2
)))
1829 else if (DECL_BIT_FIELD_TYPE (memb2
))
1831 else if (!layout_compatible_type_p (TREE_TYPE (memb1
), TREE_TYPE (memb2
)))
1833 if ((!lookup_attribute ("no_unique_address", DECL_ATTRIBUTES (memb1
)))
1834 != !lookup_attribute ("no_unique_address", DECL_ATTRIBUTES (memb2
)))
1836 if (DECL_ALIGN (memb1
) != DECL_ALIGN (memb2
))
1838 if (!tree_int_cst_equal (bit_position (memb1
), bit_position (memb2
)))
1843 /* Return true if TYPE1 and TYPE2 are layout-compatible types. */
1846 layout_compatible_type_p (tree type1
, tree type2
)
1848 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1852 if (TREE_CODE (type1
) != TREE_CODE (type2
))
1855 type1
= cp_build_qualified_type (type1
, TYPE_UNQUALIFIED
);
1856 type2
= cp_build_qualified_type (type2
, TYPE_UNQUALIFIED
);
1858 if (TREE_CODE (type1
) == ENUMERAL_TYPE
)
1859 return (tree_int_cst_equal (TYPE_SIZE (type1
), TYPE_SIZE (type2
))
1860 && same_type_p (finish_underlying_type (type1
),
1861 finish_underlying_type (type2
)));
1863 if (CLASS_TYPE_P (type1
)
1864 && std_layout_type_p (type1
)
1865 && std_layout_type_p (type2
)
1866 && tree_int_cst_equal (TYPE_SIZE (type1
), TYPE_SIZE (type2
)))
1868 tree field1
= TYPE_FIELDS (type1
);
1869 tree field2
= TYPE_FIELDS (type2
);
1870 if (TREE_CODE (type1
) == RECORD_TYPE
)
1874 if (!next_common_initial_sequence (field1
, field2
))
1876 if (field1
== NULL_TREE
)
1878 field1
= DECL_CHAIN (field1
);
1879 field2
= DECL_CHAIN (field2
);
1882 /* Otherwise both types must be union types.
1884 "Two standard-layout unions are layout-compatible if they have
1885 the same number of non-static data members and corresponding
1886 non-static data members (in any order) have layout-compatible
1888 but the code anticipates that bitfield vs. non-bitfield,
1889 different bitfield widths or presence/absence of
1890 [[no_unique_address]] should be checked as well. */
1891 auto_vec
<tree
, 16> vec
;
1892 unsigned int count
= 0;
1893 for (; field1
; field1
= DECL_CHAIN (field1
))
1894 if (TREE_CODE (field1
) == FIELD_DECL
)
1896 for (; field2
; field2
= DECL_CHAIN (field2
))
1897 if (TREE_CODE (field2
) == FIELD_DECL
)
1898 vec
.safe_push (field2
);
1899 /* Discussions on core lean towards treating multiple union fields
1900 of the same type as the same field, so this might need changing
1902 if (count
!= vec
.length ())
1904 for (field1
= TYPE_FIELDS (type1
); field1
; field1
= DECL_CHAIN (field1
))
1906 if (TREE_CODE (field1
) != FIELD_DECL
)
1909 tree t1
= DECL_BIT_FIELD_TYPE (field1
);
1910 if (t1
== NULL_TREE
)
1911 t1
= TREE_TYPE (field1
);
1912 FOR_EACH_VEC_ELT (vec
, j
, field2
)
1914 tree t2
= DECL_BIT_FIELD_TYPE (field2
);
1915 if (t2
== NULL_TREE
)
1916 t2
= TREE_TYPE (field2
);
1917 if (DECL_BIT_FIELD_TYPE (field1
))
1919 if (!DECL_BIT_FIELD_TYPE (field2
))
1921 if (TYPE_PRECISION (TREE_TYPE (field1
))
1922 != TYPE_PRECISION (TREE_TYPE (field2
)))
1925 else if (DECL_BIT_FIELD_TYPE (field2
))
1927 if (!layout_compatible_type_p (t1
, t2
))
1929 if ((!lookup_attribute ("no_unique_address",
1930 DECL_ATTRIBUTES (field1
)))
1931 != !lookup_attribute ("no_unique_address",
1932 DECL_ATTRIBUTES (field2
)))
1936 if (j
== vec
.length ())
1938 vec
.unordered_remove (j
);
1943 return same_type_p (type1
, type2
);
1946 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1949 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1951 int q1
= cp_type_quals (type1
);
1952 int q2
= cp_type_quals (type2
);
1954 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1955 return (q1
& q2
) == q2
;
1958 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1959 more cv-qualified that TYPE1, and 0 otherwise. */
1962 comp_cv_qualification (int q1
, int q2
)
1967 if ((q1
& q2
) == q2
)
1969 else if ((q1
& q2
) == q1
)
1976 comp_cv_qualification (const_tree type1
, const_tree type2
)
1978 int q1
= cp_type_quals (type1
);
1979 int q2
= cp_type_quals (type2
);
1980 return comp_cv_qualification (q1
, q2
);
1983 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1984 subset of the cv-qualification signature of TYPE2, and the types
1985 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1988 comp_cv_qual_signature (tree type1
, tree type2
)
1990 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1992 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1998 /* Subroutines of `comptypes'. */
2000 /* Return true if two parameter type lists PARMS1 and PARMS2 are
2001 equivalent in the sense that functions with those parameter types
2002 can have equivalent types. The two lists must be equivalent,
2003 element by element. */
2006 compparms (const_tree parms1
, const_tree parms2
)
2010 /* An unspecified parmlist matches any specified parmlist
2011 whose argument types don't need default promotions. */
2013 for (t1
= parms1
, t2
= parms2
;
2015 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
2017 /* If one parmlist is shorter than the other,
2018 they fail to match. */
2021 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
2028 /* Process a sizeof or alignof expression where the operand is a type.
2029 STD_ALIGNOF indicates whether an alignof has C++11 (minimum alignment)
2030 or GNU (preferred alignment) semantics; it is ignored if OP is
2034 cxx_sizeof_or_alignof_type (location_t loc
, tree type
, enum tree_code op
,
2035 bool std_alignof
, bool complain
)
2037 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
2038 if (type
== error_mark_node
)
2039 return error_mark_node
;
2041 type
= non_reference (type
);
2042 if (TREE_CODE (type
) == METHOD_TYPE
)
2046 pedwarn (loc
, OPT_Wpointer_arith
,
2047 "invalid application of %qs to a member function",
2048 OVL_OP_INFO (false, op
)->name
);
2049 return size_one_node
;
2052 return error_mark_node
;
2054 else if (VOID_TYPE_P (type
) && std_alignof
)
2057 error_at (loc
, "invalid application of %qs to a void type",
2058 OVL_OP_INFO (false, op
)->name
);
2059 return error_mark_node
;
2062 bool dependent_p
= dependent_type_p (type
);
2064 complete_type (type
);
2066 /* VLA types will have a non-constant size. In the body of an
2067 uninstantiated template, we don't need to try to compute the
2068 value, because the sizeof expression is not an integral
2069 constant expression in that case. And, if we do try to
2070 compute the value, we'll likely end up with SAVE_EXPRs, which
2071 the template substitution machinery does not expect to see. */
2072 || (processing_template_decl
2073 && COMPLETE_TYPE_P (type
)
2074 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
2076 tree value
= build_min (op
, size_type_node
, type
);
2077 TREE_READONLY (value
) = 1;
2078 if (op
== ALIGNOF_EXPR
&& std_alignof
)
2079 ALIGNOF_EXPR_STD_P (value
) = true;
2080 SET_EXPR_LOCATION (value
, loc
);
2084 return c_sizeof_or_alignof_type (loc
, complete_type (type
),
2085 op
== SIZEOF_EXPR
, std_alignof
,
2089 /* Return the size of the type, without producing any warnings for
2090 types whose size cannot be taken. This routine should be used only
2091 in some other routine that has already produced a diagnostic about
2092 using the size of such a type. */
2094 cxx_sizeof_nowarn (tree type
)
2096 if (TREE_CODE (type
) == FUNCTION_TYPE
2097 || VOID_TYPE_P (type
)
2098 || TREE_CODE (type
) == ERROR_MARK
)
2099 return size_one_node
;
2100 else if (!COMPLETE_TYPE_P (type
))
2101 return size_zero_node
;
2103 return cxx_sizeof_or_alignof_type (input_location
, type
,
2104 SIZEOF_EXPR
, false, false);
2107 /* Process a sizeof expression where the operand is an expression. */
2110 cxx_sizeof_expr (location_t loc
, tree e
, tsubst_flags_t complain
)
2112 if (e
== error_mark_node
)
2113 return error_mark_node
;
2115 if (instantiation_dependent_uneval_expression_p (e
))
2117 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
2118 TREE_SIDE_EFFECTS (e
) = 0;
2119 TREE_READONLY (e
) = 1;
2120 SET_EXPR_LOCATION (e
, loc
);
2125 location_t e_loc
= cp_expr_loc_or_loc (e
, loc
);
2126 STRIP_ANY_LOCATION_WRAPPER (e
);
2128 /* To get the size of a static data member declared as an array of
2129 unknown bound, we need to instantiate it. */
2131 && VAR_HAD_UNKNOWN_BOUND (e
)
2132 && DECL_TEMPLATE_INSTANTIATION (e
))
2133 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
2135 if (TREE_CODE (e
) == PARM_DECL
2136 && DECL_ARRAY_PARAMETER_P (e
)
2137 && (complain
& tf_warning
))
2139 auto_diagnostic_group d
;
2140 if (warning_at (e_loc
, OPT_Wsizeof_array_argument
,
2141 "%<sizeof%> on array function parameter %qE "
2142 "will return size of %qT", e
, TREE_TYPE (e
)))
2143 inform (DECL_SOURCE_LOCATION (e
), "declared here");
2146 e
= mark_type_use (e
);
2150 if (complain
& tf_error
)
2152 "invalid application of %<sizeof%> to a bit-field");
2154 return error_mark_node
;
2157 else if (is_overloaded_fn (e
))
2159 if (complain
& tf_error
)
2160 permerror (e_loc
, "ISO C++ forbids applying %<sizeof%> to "
2161 "an expression of function type");
2163 return error_mark_node
;
2166 else if (type_unknown_p (e
))
2168 if (complain
& tf_error
)
2169 cxx_incomplete_type_error (e_loc
, e
, TREE_TYPE (e
));
2171 return error_mark_node
;
2177 return cxx_sizeof_or_alignof_type (loc
, e
, SIZEOF_EXPR
, false,
2178 complain
& tf_error
);
2181 /* Implement the __alignof keyword: Return the minimum required
2182 alignment of E, measured in bytes. For VAR_DECL's and
2183 FIELD_DECL's return DECL_ALIGN (which can be set from an
2184 "aligned" __attribute__ specification). STD_ALIGNOF acts
2185 like in cxx_sizeof_or_alignof_type. */
2188 cxx_alignof_expr (location_t loc
, tree e
, bool std_alignof
,
2189 tsubst_flags_t complain
)
2193 if (e
== error_mark_node
)
2194 return error_mark_node
;
2196 if (processing_template_decl
)
2198 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
2199 TREE_SIDE_EFFECTS (e
) = 0;
2200 TREE_READONLY (e
) = 1;
2201 SET_EXPR_LOCATION (e
, loc
);
2202 ALIGNOF_EXPR_STD_P (e
) = std_alignof
;
2207 location_t e_loc
= cp_expr_loc_or_loc (e
, loc
);
2208 STRIP_ANY_LOCATION_WRAPPER (e
);
2210 e
= mark_type_use (e
);
2212 if (!verify_type_context (loc
, TCTX_ALIGNOF
, TREE_TYPE (e
),
2213 !(complain
& tf_error
)))
2215 if (!(complain
& tf_error
))
2216 return error_mark_node
;
2220 t
= size_int (DECL_ALIGN_UNIT (e
));
2221 else if (bitfield_p (e
))
2223 if (complain
& tf_error
)
2225 "invalid application of %<__alignof%> to a bit-field");
2227 return error_mark_node
;
2230 else if (TREE_CODE (e
) == COMPONENT_REF
2231 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
2232 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
2233 else if (is_overloaded_fn (e
))
2235 if (complain
& tf_error
)
2236 permerror (e_loc
, "ISO C++ forbids applying %<__alignof%> to "
2237 "an expression of function type");
2239 return error_mark_node
;
2240 if (TREE_CODE (e
) == FUNCTION_DECL
)
2241 t
= size_int (DECL_ALIGN_UNIT (e
));
2245 else if (type_unknown_p (e
))
2247 if (complain
& tf_error
)
2248 cxx_incomplete_type_error (e_loc
, e
, TREE_TYPE (e
));
2250 return error_mark_node
;
2254 return cxx_sizeof_or_alignof_type (loc
, TREE_TYPE (e
),
2255 ALIGNOF_EXPR
, std_alignof
,
2256 complain
& tf_error
);
2258 return fold_convert_loc (loc
, size_type_node
, t
);
2261 /* Process a sizeof or alignof expression E with code OP where the operand
2262 is an expression. STD_ALIGNOF acts like in cxx_sizeof_or_alignof_type. */
2265 cxx_sizeof_or_alignof_expr (location_t loc
, tree e
, enum tree_code op
,
2266 bool std_alignof
, bool complain
)
2268 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
2269 if (op
== SIZEOF_EXPR
)
2270 return cxx_sizeof_expr (loc
, e
, complain
? tf_warning_or_error
: tf_none
);
2272 return cxx_alignof_expr (loc
, e
, std_alignof
,
2273 complain
? tf_warning_or_error
: tf_none
);
2276 /* Build a representation of an expression 'alignas(E).' Return the
2277 folded integer value of E if it is an integral constant expression
2278 that resolves to a valid alignment. If E depends on a template
2279 parameter, return a syntactic representation tree of kind
2280 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
2281 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
2284 cxx_alignas_expr (tree e
)
2286 if (e
== NULL_TREE
|| e
== error_mark_node
2287 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
2293 When the alignment-specifier is of the form
2294 alignas(type-id), it shall have the same effect as
2295 alignas(alignof(type-id)). */
2297 return cxx_sizeof_or_alignof_type (input_location
,
2299 /*std_alignof=*/true,
2302 /* If we reach this point, it means the alignas expression if of
2303 the form "alignas(assignment-expression)", so we should follow
2304 what is stated by [dcl.align]/2. */
2306 if (value_dependent_expression_p (e
))
2307 /* Leave value-dependent expression alone for now. */
2310 e
= instantiate_non_dependent_expr (e
);
2311 e
= mark_rvalue_use (e
);
2313 /* [dcl.align]/2 says:
2315 the assignment-expression shall be an integral constant
2318 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (e
)))
2320 error ("%<alignas%> argument has non-integral type %qT", TREE_TYPE (e
));
2321 return error_mark_node
;
2324 return cxx_constant_value (e
);
2328 /* EXPR is being used in a context that is not a function call.
2333 The expression can be used only as the left-hand operand of a
2334 member function call.
2336 [expr.mptr.operator]
2338 If the result of .* or ->* is a function, then that result can be
2339 used only as the operand for the function call operator ().
2341 by issuing an error message if appropriate. Returns true iff EXPR
2342 violates these rules. */
2345 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
2347 if (expr
== NULL_TREE
)
2349 /* Don't enforce this in MS mode. */
2350 if (flag_ms_extensions
)
2352 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
2353 expr
= get_first_fn (expr
);
2354 if (TREE_TYPE (expr
)
2355 && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
2357 if (complain
& tf_error
)
2361 error_at (loc
, "invalid use of non-static member function %qD",
2363 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
2366 error_at (loc
, "invalid use of non-static member function of "
2367 "type %qT", TREE_TYPE (expr
));
2374 /* If EXP is a reference to a bit-field, and the type of EXP does not
2375 match the declared type of the bit-field, return the declared type
2376 of the bit-field. Otherwise, return NULL_TREE. */
2379 is_bitfield_expr_with_lowered_type (const_tree exp
)
2381 switch (TREE_CODE (exp
))
2384 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
2385 ? TREE_OPERAND (exp
, 1)
2386 : TREE_OPERAND (exp
, 0)))
2388 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
2391 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
2395 case UNARY_PLUS_EXPR
:
2396 case PREDECREMENT_EXPR
:
2397 case PREINCREMENT_EXPR
:
2398 case POSTDECREMENT_EXPR
:
2399 case POSTINCREMENT_EXPR
:
2401 case NON_LVALUE_EXPR
:
2403 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
2409 field
= TREE_OPERAND (exp
, 1);
2410 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
2412 if (same_type_ignoring_top_level_qualifiers_p
2413 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
2415 return DECL_BIT_FIELD_TYPE (field
);
2419 if (DECL_HAS_VALUE_EXPR_P (exp
))
2420 return is_bitfield_expr_with_lowered_type (DECL_VALUE_EXPR
2421 (CONST_CAST_TREE (exp
)));
2424 case VIEW_CONVERT_EXPR
:
2425 if (location_wrapper_p (exp
))
2426 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
2435 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
2436 bitfield with a lowered type, the type of EXP is returned, rather
2440 unlowered_expr_type (const_tree exp
)
2443 tree etype
= TREE_TYPE (exp
);
2445 type
= is_bitfield_expr_with_lowered_type (exp
);
2447 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
2454 /* Perform the conversions in [expr] that apply when an lvalue appears
2455 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
2456 function-to-pointer conversions. In addition, bitfield references are
2457 converted to their declared types. Note that this function does not perform
2458 the lvalue-to-rvalue conversion for class types. If you need that conversion
2459 for class types, then you probably need to use force_rvalue.
2461 Although the returned value is being used as an rvalue, this
2462 function does not wrap the returned expression in a
2463 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
2464 that the return value is no longer an lvalue. */
2467 decay_conversion (tree exp
,
2468 tsubst_flags_t complain
,
2469 bool reject_builtin
/* = true */)
2472 enum tree_code code
;
2473 location_t loc
= cp_expr_loc_or_input_loc (exp
);
2475 type
= TREE_TYPE (exp
);
2476 if (type
== error_mark_node
)
2477 return error_mark_node
;
2479 exp
= resolve_nondeduced_context_or_error (exp
, complain
);
2481 code
= TREE_CODE (type
);
2483 if (error_operand_p (exp
))
2484 return error_mark_node
;
2486 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
2488 mark_rvalue_use (exp
, loc
, reject_builtin
);
2489 return nullptr_node
;
2492 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2493 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
2494 if (code
== VOID_TYPE
)
2496 if (complain
& tf_error
)
2497 error_at (loc
, "void value not ignored as it ought to be");
2498 return error_mark_node
;
2500 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
2501 return error_mark_node
;
2502 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
2504 exp
= mark_lvalue_use (exp
);
2505 if (reject_builtin
&& reject_gcc_builtin (exp
, loc
))
2506 return error_mark_node
;
2507 return cp_build_addr_expr (exp
, complain
);
2509 if (code
== ARRAY_TYPE
)
2514 exp
= mark_lvalue_use (exp
);
2516 if (INDIRECT_REF_P (exp
))
2517 return build_nop (build_pointer_type (TREE_TYPE (type
)),
2518 TREE_OPERAND (exp
, 0));
2520 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
2522 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
2523 if (op1
== error_mark_node
)
2524 return error_mark_node
;
2525 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
2526 TREE_OPERAND (exp
, 0), op1
);
2529 if (!obvalue_p (exp
)
2530 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
2532 if (complain
& tf_error
)
2533 error_at (loc
, "invalid use of non-lvalue array");
2534 return error_mark_node
;
2537 ptrtype
= build_pointer_type (TREE_TYPE (type
));
2541 if (!cxx_mark_addressable (exp
))
2542 return error_mark_node
;
2543 adr
= build_nop (ptrtype
, build_address (exp
));
2546 /* This way is better for a COMPONENT_REF since it can
2547 simplify the offset for a component. */
2548 adr
= cp_build_addr_expr (exp
, complain
);
2549 return cp_convert (ptrtype
, adr
, complain
);
2552 /* Otherwise, it's the lvalue-to-rvalue conversion. */
2553 exp
= mark_rvalue_use (exp
, loc
, reject_builtin
);
2555 /* If a bitfield is used in a context where integral promotion
2556 applies, then the caller is expected to have used
2557 default_conversion. That function promotes bitfields correctly
2558 before calling this function. At this point, if we have a
2559 bitfield referenced, we may assume that is not subject to
2560 promotion, and that, therefore, the type of the resulting rvalue
2561 is the declared type of the bitfield. */
2562 exp
= convert_bitfield_to_declared_type (exp
);
2564 /* We do not call rvalue() here because we do not want to wrap EXP
2565 in a NON_LVALUE_EXPR. */
2569 Non-class rvalues always have cv-unqualified types. */
2570 type
= TREE_TYPE (exp
);
2571 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2572 exp
= build_nop (cv_unqualified (type
), exp
);
2574 if (!complete_type_or_maybe_complain (type
, exp
, complain
))
2575 return error_mark_node
;
2580 /* Perform preparatory conversions, as part of the "usual arithmetic
2581 conversions". In particular, as per [expr]:
2583 Whenever an lvalue expression appears as an operand of an
2584 operator that expects the rvalue for that operand, the
2585 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2586 standard conversions are applied to convert the expression to an
2589 In addition, we perform integral promotions here, as those are
2590 applied to both operands to a binary operator before determining
2591 what additional conversions should apply. */
2594 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2596 /* Check for target-specific promotions. */
2597 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2599 exp
= cp_convert (promoted_type
, exp
, complain
);
2600 /* Perform the integral promotions first so that bitfield
2601 expressions (which may promote to "int", even if the bitfield is
2602 declared "unsigned") are promoted correctly. */
2603 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2604 exp
= cp_perform_integral_promotions (exp
, complain
);
2605 /* Perform the other conversions. */
2606 exp
= decay_conversion (exp
, complain
);
2614 default_conversion (tree exp
)
2616 return cp_default_conversion (exp
, tf_warning_or_error
);
2619 /* EXPR is an expression with an integral or enumeration type.
2620 Perform the integral promotions in [conv.prom], and return the
2624 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2629 expr
= mark_rvalue_use (expr
);
2630 if (error_operand_p (expr
))
2631 return error_mark_node
;
2633 type
= TREE_TYPE (expr
);
2637 A prvalue for an integral bit-field (11.3.9) can be converted to a prvalue
2638 of type int if int can represent all the values of the bit-field;
2639 otherwise, it can be converted to unsigned int if unsigned int can
2640 represent all the values of the bit-field. If the bit-field is larger yet,
2641 no integral promotion applies to it. If the bit-field has an enumerated
2642 type, it is treated as any other value of that type for promotion
2644 tree bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
2646 && (TREE_CODE (bitfield_type
) == ENUMERAL_TYPE
2647 || TYPE_PRECISION (type
) > TYPE_PRECISION (integer_type_node
)))
2648 type
= bitfield_type
;
2650 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2651 /* Scoped enums don't promote. */
2652 if (SCOPED_ENUM_P (type
))
2654 promoted_type
= type_promotes_to (type
);
2655 if (type
!= promoted_type
)
2656 expr
= cp_convert (promoted_type
, expr
, complain
);
2657 else if (bitfield_type
&& bitfield_type
!= type
)
2658 /* Prevent decay_conversion from converting to bitfield_type. */
2659 expr
= build_nop (type
, expr
);
2666 perform_integral_promotions (tree expr
)
2668 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2671 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2672 decay_conversion to one. */
2675 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2679 if (!TYPE_PTR_P (totype
))
2682 t
= TREE_TYPE (totype
);
2683 if (!same_type_p (t
, char_type_node
)
2684 && !same_type_p (t
, char8_type_node
)
2685 && !same_type_p (t
, char16_type_node
)
2686 && !same_type_p (t
, char32_type_node
)
2687 && !same_type_p (t
, wchar_type_node
))
2690 location_t loc
= EXPR_LOC_OR_LOC (exp
, input_location
);
2692 STRIP_ANY_LOCATION_WRAPPER (exp
);
2694 if (TREE_CODE (exp
) == STRING_CST
)
2696 /* Make sure that we don't try to convert between char and wide chars. */
2697 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2702 /* Is this a string constant which has decayed to 'const char *'? */
2703 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2704 if (!same_type_p (TREE_TYPE (exp
), t
))
2707 if (TREE_CODE (exp
) != ADDR_EXPR
2708 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2713 if (cxx_dialect
>= cxx11
)
2714 pedwarn (loc
, OPT_Wwrite_strings
,
2715 "ISO C++ forbids converting a string constant to %qT",
2718 warning_at (loc
, OPT_Wwrite_strings
,
2719 "deprecated conversion from string constant to %qT",
2726 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2727 can, for example, use as an lvalue. This code used to be in
2728 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2729 expressions, where we're dealing with aggregates. But now it's again only
2730 called from unary_complex_lvalue. The case (in particular) that led to
2731 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2735 rationalize_conditional_expr (enum tree_code code
, tree t
,
2736 tsubst_flags_t complain
)
2738 location_t loc
= cp_expr_loc_or_input_loc (t
);
2740 /* For MIN_EXPR or MAX_EXPR, fold-const.cc has arranged things so that
2741 the first operand is always the one to be used if both operands
2742 are equal, so we know what conditional expression this used to be. */
2743 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2745 tree op0
= TREE_OPERAND (t
, 0);
2746 tree op1
= TREE_OPERAND (t
, 1);
2748 /* The following code is incorrect if either operand side-effects. */
2749 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2750 && !TREE_SIDE_EFFECTS (op1
));
2752 build_conditional_expr (loc
,
2753 build_x_binary_op (loc
,
2754 (TREE_CODE (t
) == MIN_EXPR
2755 ? LE_EXPR
: GE_EXPR
),
2756 op0
, TREE_CODE (op0
),
2757 op1
, TREE_CODE (op1
),
2761 cp_build_unary_op (code
, op0
, false, complain
),
2762 cp_build_unary_op (code
, op1
, false, complain
),
2766 tree op1
= TREE_OPERAND (t
, 1);
2767 if (TREE_CODE (op1
) != THROW_EXPR
)
2768 op1
= cp_build_unary_op (code
, op1
, false, complain
);
2769 tree op2
= TREE_OPERAND (t
, 2);
2770 if (TREE_CODE (op2
) != THROW_EXPR
)
2771 op2
= cp_build_unary_op (code
, op2
, false, complain
);
2774 build_conditional_expr (loc
, TREE_OPERAND (t
, 0), op1
, op2
, complain
);
2777 /* Given the TYPE of an anonymous union field inside T, return the
2778 FIELD_DECL for the field. If not found return NULL_TREE. Because
2779 anonymous unions can nest, we must also search all anonymous unions
2780 that are directly reachable. */
2783 lookup_anon_field (tree
, tree type
)
2787 type
= TYPE_MAIN_VARIANT (type
);
2788 field
= ANON_AGGR_TYPE_FIELD (type
);
2793 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2794 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2795 non-NULL, it indicates the path to the base used to name MEMBER.
2796 If PRESERVE_REFERENCE is true, the expression returned will have
2797 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2798 returned will have the type referred to by the reference.
2800 This function does not perform access control; that is either done
2801 earlier by the parser when the name of MEMBER is resolved to MEMBER
2802 itself, or later when overload resolution selects one of the
2803 functions indicated by MEMBER. */
2806 build_class_member_access_expr (cp_expr object
, tree member
,
2807 tree access_path
, bool preserve_reference
,
2808 tsubst_flags_t complain
)
2812 tree result
= NULL_TREE
;
2813 tree using_decl
= NULL_TREE
;
2815 if (error_operand_p (object
) || error_operand_p (member
))
2816 return error_mark_node
;
2818 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2822 The type of the first expression shall be "class object" (of a
2824 object_type
= TREE_TYPE (object
);
2825 if (!currently_open_class (object_type
)
2826 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2827 return error_mark_node
;
2828 if (!CLASS_TYPE_P (object_type
))
2830 if (complain
& tf_error
)
2832 if (INDIRECT_TYPE_P (object_type
)
2833 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2834 error ("request for member %qD in %qE, which is of pointer "
2835 "type %qT (maybe you meant to use %<->%> ?)",
2836 member
, object
.get_value (), object_type
);
2838 error ("request for member %qD in %qE, which is of non-class "
2839 "type %qT", member
, object
.get_value (), object_type
);
2841 return error_mark_node
;
2844 /* The standard does not seem to actually say that MEMBER must be a
2845 member of OBJECT_TYPE. However, that is clearly what is
2847 if (DECL_P (member
))
2849 member_scope
= DECL_CLASS_CONTEXT (member
);
2850 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2851 return error_mark_node
;
2853 if (TREE_UNAVAILABLE (member
))
2854 error_unavailable_use (member
, NULL_TREE
);
2855 else if (TREE_DEPRECATED (member
))
2856 warn_deprecated_use (member
, NULL_TREE
);
2859 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2860 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2861 presently be the anonymous union. Go outwards until we find a
2862 type related to OBJECT_TYPE. */
2863 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2864 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2866 member_scope
= TYPE_CONTEXT (member_scope
);
2867 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2869 if (complain
& tf_error
)
2871 if (TREE_CODE (member
) == FIELD_DECL
)
2872 error ("invalid use of non-static data member %qE", member
);
2874 error ("%qD is not a member of %qT", member
, object_type
);
2876 return error_mark_node
;
2879 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2880 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2881 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2882 if (tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
))
2884 temp
= cp_build_fold_indirect_ref (temp
);
2885 if (!lvalue_p (object
) && lvalue_p (temp
))
2886 /* Preserve rvalueness. */
2891 /* In [expr.ref], there is an explicit list of the valid choices for
2892 MEMBER. We check for each of those cases here. */
2895 /* A static data member. */
2897 mark_exp_read (object
);
2899 if (tree wrap
= maybe_get_tls_wrapper_call (result
))
2900 /* Replace an evaluated use of the thread_local variable with
2901 a call to its wrapper. */
2904 /* If OBJECT has side-effects, they are supposed to occur. */
2905 if (TREE_SIDE_EFFECTS (object
))
2906 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2908 else if (TREE_CODE (member
) == FIELD_DECL
)
2910 /* A non-static data member. */
2915 if (INDIRECT_REF_P (object
))
2917 integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object
, 0)));
2919 null_object_p
= false;
2921 /* Convert OBJECT to the type of MEMBER. */
2922 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2923 TYPE_MAIN_VARIANT (member_scope
)))
2928 /* We didn't complain above about a currently open class, but now we
2929 must: we don't know how to refer to a base member before layout is
2930 complete. But still don't complain in a template. */
2931 if (!cp_unevaluated_operand
2932 && !dependent_type_p (object_type
)
2933 && !complete_type_or_maybe_complain (object_type
, object
,
2935 return error_mark_node
;
2937 binfo
= lookup_base (access_path
? access_path
: object_type
,
2938 member_scope
, ba_unique
, &kind
, complain
);
2939 if (binfo
== error_mark_node
)
2940 return error_mark_node
;
2942 /* It is invalid to try to get to a virtual base of a
2943 NULL object. The most common cause is invalid use of
2945 if (null_object_p
&& kind
== bk_via_virtual
)
2947 if (complain
& tf_error
)
2949 error ("invalid access to non-static data member %qD in "
2950 "virtual base of NULL object", member
);
2952 return error_mark_node
;
2955 /* Convert to the base. */
2956 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2957 /*nonnull=*/1, complain
);
2958 /* If we found the base successfully then we should be able
2959 to convert to it successfully. */
2960 gcc_assert (object
!= error_mark_node
);
2963 /* If MEMBER is from an anonymous aggregate, we have converted
2964 OBJECT so that it refers to the class containing the
2965 anonymous union. Generate a reference to the anonymous union
2966 itself, and recur to find MEMBER. */
2967 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2968 /* When this code is called from build_field_call, the
2969 object already has the type of the anonymous union.
2970 That is because the COMPONENT_REF was already
2971 constructed, and was then disassembled before calling
2972 build_field_call. After the function-call code is
2973 cleaned up, this waste can be eliminated. */
2974 && (!same_type_ignoring_top_level_qualifiers_p
2975 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2977 tree anonymous_union
;
2979 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2980 DECL_CONTEXT (member
));
2981 object
= build_class_member_access_expr (object
,
2983 /*access_path=*/NULL_TREE
,
2988 /* Compute the type of the field, as described in [expr.ref]. */
2989 type_quals
= TYPE_UNQUALIFIED
;
2990 member_type
= TREE_TYPE (member
);
2991 if (!TYPE_REF_P (member_type
))
2993 type_quals
= (cp_type_quals (member_type
)
2994 | cp_type_quals (object_type
));
2996 /* A field is const (volatile) if the enclosing object, or the
2997 field itself, is const (volatile). But, a mutable field is
2998 not const, even within a const object. */
2999 if (DECL_MUTABLE_P (member
))
3000 type_quals
&= ~TYPE_QUAL_CONST
;
3001 member_type
= cp_build_qualified_type (member_type
, type_quals
);
3004 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
3005 object
, member
, NULL_TREE
);
3007 /* Mark the expression const or volatile, as appropriate. Even
3008 though we've dealt with the type above, we still have to mark the
3009 expression itself. */
3010 if (type_quals
& TYPE_QUAL_CONST
)
3011 TREE_READONLY (result
) = 1;
3012 if (type_quals
& TYPE_QUAL_VOLATILE
)
3013 TREE_THIS_VOLATILE (result
) = 1;
3015 else if (BASELINK_P (member
))
3017 /* The member is a (possibly overloaded) member function. */
3021 /* If the MEMBER is exactly one static member function, then we
3022 know the type of the expression. Otherwise, we must wait
3023 until overload resolution has been performed. */
3024 functions
= BASELINK_FUNCTIONS (member
);
3025 if (TREE_CODE (functions
) == FUNCTION_DECL
3026 && DECL_STATIC_FUNCTION_P (functions
))
3027 type
= TREE_TYPE (functions
);
3029 type
= unknown_type_node
;
3030 /* Note that we do not convert OBJECT to the BASELINK_BINFO
3031 base. That will happen when the function is called. */
3032 result
= build3_loc (input_location
, COMPONENT_REF
, type
, object
, member
,
3035 else if (TREE_CODE (member
) == CONST_DECL
)
3037 /* The member is an enumerator. */
3039 /* If OBJECT has side-effects, they are supposed to occur. */
3040 if (TREE_SIDE_EFFECTS (object
))
3041 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
3044 else if ((using_decl
= strip_using_decl (member
)) != member
)
3045 result
= build_class_member_access_expr (object
,
3047 access_path
, preserve_reference
,
3051 if (complain
& tf_error
)
3052 error ("invalid use of %qD", member
);
3053 return error_mark_node
;
3056 if (!preserve_reference
)
3059 If E2 is declared to have type "reference to T", then ... the
3060 type of E1.E2 is T. */
3061 result
= convert_from_reference (result
);
3066 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
3067 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
3070 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
3071 tsubst_flags_t complain
)
3073 tree object_type
= TREE_TYPE (object
);
3074 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
3077 /* We've already complained about this destructor. */
3078 if (dtor_type
== error_mark_node
)
3079 return error_mark_node
;
3081 if (scope
&& !check_dtor_name (scope
, dtor_type
))
3083 if (complain
& tf_error
)
3084 error ("qualified type %qT does not match destructor name ~%qT",
3086 return error_mark_node
;
3088 if (is_auto (dtor_type
))
3089 dtor_type
= object_type
;
3090 else if (identifier_p (dtor_type
))
3092 /* In a template, names we can't find a match for are still accepted
3093 destructor names, and we check them here. */
3094 if (check_dtor_name (object_type
, dtor_type
))
3095 dtor_type
= object_type
;
3098 if (complain
& tf_error
)
3099 error ("object type %qT does not match destructor name ~%qT",
3100 object_type
, dtor_type
);
3101 return error_mark_node
;
3105 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
3107 if (complain
& tf_error
)
3108 error ("the type being destroyed is %qT, but the destructor "
3109 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
3110 return error_mark_node
;
3112 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
3113 /*protect=*/1, /*want_type=*/false,
3114 tf_warning_or_error
);
3117 if (complain
& tf_error
)
3118 cxx_incomplete_type_error (dtor_name
, dtor_type
);
3119 return error_mark_node
;
3121 expr
= (adjust_result_of_qualified_name_lookup
3122 (expr
, dtor_type
, object_type
));
3123 if (scope
== NULL_TREE
)
3124 /* We need to call adjust_result_of_qualified_name_lookup in case the
3125 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
3126 that we still get virtual function binding. */
3127 BASELINK_QUALIFIED_P (expr
) = false;
3131 /* An expression of the form "A::template B" has been resolved to
3132 DECL. Issue a diagnostic if B is not a template or template
3136 check_template_keyword (tree decl
)
3138 /* The standard says:
3142 If a name prefixed by the keyword template is not a member
3143 template, the program is ill-formed.
3145 DR 228 removed the restriction that the template be a member
3148 DR 96, if accepted would add the further restriction that explicit
3149 template arguments must be provided if the template keyword is
3150 used, but, as of 2005-10-16, that DR is still in "drafting". If
3151 this DR is accepted, then the semantic checks here can be
3152 simplified, as the entity named must in fact be a template
3153 specialization, rather than, as at present, a set of overloaded
3154 functions containing at least one template function. */
3155 if (TREE_CODE (decl
) != TEMPLATE_DECL
3156 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
3160 if (DECL_USE_TEMPLATE (decl
)
3161 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
3164 permerror (input_location
, "%qD is not a template", decl
);
3166 else if (!is_overloaded_fn (decl
))
3167 permerror (input_location
, "%qD is not a template", decl
);
3172 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (decl
));
3173 !found
&& iter
; ++iter
)
3176 if (TREE_CODE (fn
) == TEMPLATE_DECL
3177 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
3178 || (TREE_CODE (fn
) == FUNCTION_DECL
3179 && DECL_USE_TEMPLATE (fn
)
3180 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
))))
3184 permerror (input_location
, "%qD is not a template", decl
);
3189 /* Record that an access failure occurred on BASETYPE_PATH attempting
3190 to access DECL, where DIAG_DECL should be used for diagnostics. */
3193 access_failure_info::record_access_failure (tree basetype_path
,
3194 tree decl
, tree diag_decl
)
3196 m_was_inaccessible
= true;
3197 m_basetype_path
= basetype_path
;
3199 m_diag_decl
= diag_decl
;
3202 /* If an access failure was recorded, then attempt to locate an
3203 accessor function for the pertinent field.
3204 Otherwise, return NULL_TREE. */
3207 access_failure_info::get_any_accessor (bool const_p
) const
3209 if (!was_inaccessible_p ())
3213 = locate_field_accessor (m_basetype_path
, m_diag_decl
, const_p
);
3217 /* The accessor must itself be accessible for it to be a reasonable
3219 if (!accessible_p (m_basetype_path
, accessor
, true))
3225 /* Add a fix-it hint to RICHLOC suggesting the use of ACCESSOR_DECL, by
3226 replacing the primary location in RICHLOC with "accessor()". */
3229 access_failure_info::add_fixit_hint (rich_location
*richloc
,
3233 pp_string (&pp
, IDENTIFIER_POINTER (DECL_NAME (accessor_decl
)));
3234 pp_string (&pp
, "()");
3235 richloc
->add_fixit_replace (pp_formatted_text (&pp
));
3238 /* If an access failure was recorded, then attempt to locate an
3239 accessor function for the pertinent field, and if one is
3240 available, add a note and fix-it hint suggesting using it. */
3243 access_failure_info::maybe_suggest_accessor (bool const_p
) const
3245 tree accessor
= get_any_accessor (const_p
);
3246 if (accessor
== NULL_TREE
)
3248 rich_location
richloc (line_table
, input_location
);
3249 add_fixit_hint (&richloc
, accessor
);
3250 inform (&richloc
, "field %q#D can be accessed via %q#D",
3251 m_diag_decl
, accessor
);
3254 /* Subroutine of finish_class_member_access_expr.
3255 Issue an error about NAME not being a member of ACCESS_PATH (or
3256 OBJECT_TYPE), potentially providing a fix-it hint for misspelled
3260 complain_about_unrecognized_member (tree access_path
, tree name
,
3263 /* Attempt to provide a hint about misspelled names. */
3264 tree guessed_id
= lookup_member_fuzzy (access_path
, name
,
3265 /*want_type=*/false);
3266 if (guessed_id
== NULL_TREE
)
3269 error ("%q#T has no member named %qE",
3270 TREE_CODE (access_path
) == TREE_BINFO
3271 ? TREE_TYPE (access_path
) : object_type
, name
);
3275 location_t bogus_component_loc
= input_location
;
3276 gcc_rich_location
rich_loc (bogus_component_loc
);
3278 /* Check that the guessed name is accessible along access_path. */
3279 access_failure_info afi
;
3280 lookup_member (access_path
, guessed_id
, /*protect=*/1,
3281 /*want_type=*/false, /*complain=*/false,
3283 if (afi
.was_inaccessible_p ())
3285 tree accessor
= afi
.get_any_accessor (TYPE_READONLY (object_type
));
3288 /* The guessed name isn't directly accessible, but can be accessed
3289 via an accessor member function. */
3290 afi
.add_fixit_hint (&rich_loc
, accessor
);
3291 error_at (&rich_loc
,
3292 "%q#T has no member named %qE;"
3293 " did you mean %q#D? (accessible via %q#D)",
3294 TREE_CODE (access_path
) == TREE_BINFO
3295 ? TREE_TYPE (access_path
) : object_type
,
3296 name
, afi
.get_diag_decl (), accessor
);
3300 /* The guessed name isn't directly accessible, and no accessor
3301 member function could be found. */
3302 error_at (&rich_loc
,
3303 "%q#T has no member named %qE;"
3304 " did you mean %q#D? (not accessible from this context)",
3305 TREE_CODE (access_path
) == TREE_BINFO
3306 ? TREE_TYPE (access_path
) : object_type
,
3307 name
, afi
.get_diag_decl ());
3308 complain_about_access (afi
.get_decl (), afi
.get_diag_decl (),
3309 afi
.get_diag_decl (), false, ak_none
);
3314 /* The guessed name is directly accessible; suggest it. */
3315 rich_loc
.add_fixit_misspelled_id (bogus_component_loc
,
3317 error_at (&rich_loc
,
3318 "%q#T has no member named %qE;"
3319 " did you mean %qE?",
3320 TREE_CODE (access_path
) == TREE_BINFO
3321 ? TREE_TYPE (access_path
) : object_type
,
3326 /* This function is called by the parser to process a class member
3327 access expression of the form OBJECT.NAME. NAME is a node used by
3328 the parser to represent a name; it is not yet a DECL. It may,
3329 however, be a BASELINK where the BASELINK_FUNCTIONS is a
3330 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
3331 there is no reason to do the lookup twice, so the parser keeps the
3332 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
3333 be a template via the use of the "A::template B" syntax. */
3336 finish_class_member_access_expr (cp_expr object
, tree name
, bool template_p
,
3337 tsubst_flags_t complain
)
3342 tree access_path
= NULL_TREE
;
3343 tree orig_object
= object
;
3344 tree orig_name
= name
;
3346 if (object
== error_mark_node
|| name
== error_mark_node
)
3347 return error_mark_node
;
3349 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
3350 if (!objc_is_public (object
, name
))
3351 return error_mark_node
;
3353 object_type
= TREE_TYPE (object
);
3355 if (processing_template_decl
)
3357 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
3358 type_dependent_object_expression_p (object
)
3359 /* If NAME is "f<args>", where either 'f' or 'args' is
3360 dependent, then the expression is dependent. */
3361 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
3362 && dependent_template_id_p (TREE_OPERAND (name
, 0),
3363 TREE_OPERAND (name
, 1)))
3364 /* If NAME is "T::X" where "T" is dependent, then the
3365 expression is dependent. */
3366 || (TREE_CODE (name
) == SCOPE_REF
3367 && TYPE_P (TREE_OPERAND (name
, 0))
3368 && dependent_scope_p (TREE_OPERAND (name
, 0)))
3369 /* If NAME is operator T where "T" is dependent, we can't
3370 lookup until we instantiate the T. */
3371 || (TREE_CODE (name
) == IDENTIFIER_NODE
3372 && IDENTIFIER_CONV_OP_P (name
)
3373 && dependent_type_p (TREE_TYPE (name
))))
3376 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
3377 orig_object
, orig_name
, NULL_TREE
);
3380 else if (c_dialect_objc ()
3381 && identifier_p (name
)
3382 && (expr
= objc_maybe_build_component_ref (object
, name
)))
3387 The type of the first expression shall be "class object" (of a
3389 if (!currently_open_class (object_type
)
3390 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
3391 return error_mark_node
;
3392 if (!CLASS_TYPE_P (object_type
))
3394 if (complain
& tf_error
)
3396 if (INDIRECT_TYPE_P (object_type
)
3397 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
3398 error ("request for member %qD in %qE, which is of pointer "
3399 "type %qT (maybe you meant to use %<->%> ?)",
3400 name
, object
.get_value (), object_type
);
3402 error ("request for member %qD in %qE, which is of non-class "
3403 "type %qT", name
, object
.get_value (), object_type
);
3405 return error_mark_node
;
3408 if (BASELINK_P (name
))
3409 /* A member function that has already been looked up. */
3413 bool is_template_id
= false;
3414 tree template_args
= NULL_TREE
;
3415 tree scope
= NULL_TREE
;
3417 access_path
= object_type
;
3419 if (TREE_CODE (name
) == SCOPE_REF
)
3421 /* A qualified name. The qualifying class or namespace `S'
3422 has already been looked up; it is either a TYPE or a
3424 scope
= TREE_OPERAND (name
, 0);
3425 name
= TREE_OPERAND (name
, 1);
3427 /* If SCOPE is a namespace, then the qualified name does not
3428 name a member of OBJECT_TYPE. */
3429 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
3431 if (complain
& tf_error
)
3432 error ("%<%D::%D%> is not a member of %qT",
3433 scope
, name
, object_type
);
3434 return error_mark_node
;
3438 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3440 is_template_id
= true;
3441 template_args
= TREE_OPERAND (name
, 1);
3442 name
= TREE_OPERAND (name
, 0);
3444 if (!identifier_p (name
))
3445 name
= OVL_NAME (name
);
3450 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
3452 gcc_assert (!is_template_id
);
3453 /* Looking up a member enumerator (c++/56793). */
3454 if (!TYPE_CLASS_SCOPE_P (scope
)
3455 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
3457 if (complain
& tf_error
)
3458 error ("%<%D::%D%> is not a member of %qT",
3459 scope
, name
, object_type
);
3460 return error_mark_node
;
3462 tree val
= lookup_enumerator (scope
, name
);
3465 if (complain
& tf_error
)
3466 error ("%qD is not a member of %qD",
3468 return error_mark_node
;
3471 if (TREE_SIDE_EFFECTS (object
))
3472 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
3476 gcc_assert (CLASS_TYPE_P (scope
));
3477 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
3479 if (constructor_name_p (name
, scope
))
3481 if (complain
& tf_error
)
3482 error ("cannot call constructor %<%T::%D%> directly",
3484 return error_mark_node
;
3487 /* NAME may refer to a static data member, in which case there is
3488 one copy of the data member that is shared by all the objects of
3489 the class. So NAME can be unambiguously referred to even if
3490 there are multiple indirect base classes containing NAME. */
3491 const base_access ba
= [scope
, name
] ()
3493 if (identifier_p (name
))
3495 tree m
= lookup_member (scope
, name
, /*protect=*/0,
3496 /*want_type=*/false, tf_none
);
3497 if (!m
|| shared_member_p (m
))
3503 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
3504 access_path
= lookup_base (object_type
, scope
, ba
, NULL
, complain
);
3505 if (access_path
== error_mark_node
)
3506 return error_mark_node
;
3509 if (any_dependent_bases_p (object_type
))
3511 if (complain
& tf_error
)
3512 error ("%qT is not a base of %qT", scope
, object_type
);
3513 return error_mark_node
;
3517 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
3519 if (dependent_type_p (object_type
))
3520 /* The destructor isn't declared yet. */
3522 member
= lookup_destructor (object
, scope
, name
, complain
);
3526 /* Look up the member. */
3527 access_failure_info afi
;
3528 if (processing_template_decl
)
3529 /* Even though this class member access expression is at this
3530 point not dependent, the member itself may be dependent, and
3531 we must not potentially push a access check for a dependent
3532 member onto TI_DEFERRED_ACCESS_CHECKS. So don't check access
3533 ahead of time here; we're going to redo this member lookup at
3534 instantiation time anyway. */
3535 push_deferring_access_checks (dk_no_check
);
3536 member
= lookup_member (access_path
, name
, /*protect=*/1,
3537 /*want_type=*/false, complain
,
3539 if (processing_template_decl
)
3540 pop_deferring_access_checks ();
3541 afi
.maybe_suggest_accessor (TYPE_READONLY (object_type
));
3542 if (member
== NULL_TREE
)
3544 if (dependent_type_p (object_type
))
3545 /* Try again at instantiation time. */
3547 if (complain
& tf_error
)
3548 complain_about_unrecognized_member (access_path
, name
,
3550 return error_mark_node
;
3552 if (member
== error_mark_node
)
3553 return error_mark_node
;
3555 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (member
)))
3556 /* Dependent type attributes on the decl mean that the TREE_TYPE is
3557 wrong, so don't use it. */
3559 if (TREE_CODE (member
) == USING_DECL
&& DECL_DEPENDENT_P (member
))
3565 tree templ
= member
;
3567 if (BASELINK_P (templ
))
3568 member
= lookup_template_function (templ
, template_args
);
3569 else if (variable_template_p (templ
))
3570 member
= (lookup_and_finish_template_variable
3571 (templ
, template_args
, complain
));
3574 if (complain
& tf_error
)
3575 error ("%qD is not a member template function", name
);
3576 return error_mark_node
;
3581 if (TREE_UNAVAILABLE (member
))
3582 error_unavailable_use (member
, NULL_TREE
);
3583 else if (TREE_DEPRECATED (member
))
3584 warn_deprecated_use (member
, NULL_TREE
);
3587 check_template_keyword (member
);
3589 expr
= build_class_member_access_expr (object
, member
, access_path
,
3590 /*preserve_reference=*/false,
3592 if (processing_template_decl
&& expr
!= error_mark_node
)
3594 if (BASELINK_P (member
))
3596 if (TREE_CODE (orig_name
) == SCOPE_REF
)
3597 BASELINK_QUALIFIED_P (member
) = 1;
3600 return build_min_non_dep (COMPONENT_REF
, expr
,
3601 orig_object
, orig_name
,
3608 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
3612 build_simple_component_ref (tree object
, tree member
)
3614 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
3615 cp_type_quals (TREE_TYPE (object
)));
3616 return build3_loc (input_location
,
3617 COMPONENT_REF
, type
,
3618 object
, member
, NULL_TREE
);
3621 /* Return an expression for the MEMBER_NAME field in the internal
3622 representation of PTRMEM, a pointer-to-member function. (Each
3623 pointer-to-member function type gets its own RECORD_TYPE so it is
3624 more convenient to access the fields by name than by FIELD_DECL.)
3625 This routine converts the NAME to a FIELD_DECL and then creates the
3626 node for the complete expression. */
3629 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
3634 if (TREE_CODE (ptrmem
) == CONSTRUCTOR
)
3636 for (auto &e
: CONSTRUCTOR_ELTS (ptrmem
))
3637 if (e
.index
&& DECL_P (e
.index
) && DECL_NAME (e
.index
) == member_name
)
3642 /* This code is a stripped down version of
3643 build_class_member_access_expr. It does not work to use that
3644 routine directly because it expects the object to be of class
3646 ptrmem_type
= TREE_TYPE (ptrmem
);
3647 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
3648 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
3649 member
= DECL_CHAIN (member
))
3650 if (DECL_NAME (member
) == member_name
)
3652 return build_simple_component_ref (ptrmem
, member
);
3655 /* Return a TREE_LIST of namespace-scope overloads for the given operator,
3656 and for any other relevant operator. */
3659 op_unqualified_lookup (tree_code code
, bool is_assign
)
3661 tree lookups
= NULL_TREE
;
3663 if (cxx_dialect
>= cxx20
&& !is_assign
)
3665 if (code
== NE_EXPR
)
3667 /* != can get rewritten in terms of ==. */
3668 tree fnname
= ovl_op_identifier (false, EQ_EXPR
);
3669 if (tree fns
= lookup_name (fnname
, LOOK_where::BLOCK_NAMESPACE
))
3670 lookups
= tree_cons (fnname
, fns
, lookups
);
3672 else if (code
== GT_EXPR
|| code
== LE_EXPR
3673 || code
== LT_EXPR
|| code
== GE_EXPR
)
3675 /* These can get rewritten in terms of <=>. */
3676 tree fnname
= ovl_op_identifier (false, SPACESHIP_EXPR
);
3677 if (tree fns
= lookup_name (fnname
, LOOK_where::BLOCK_NAMESPACE
))
3678 lookups
= tree_cons (fnname
, fns
, lookups
);
3682 tree fnname
= ovl_op_identifier (is_assign
, code
);
3683 if (tree fns
= lookup_name (fnname
, LOOK_where::BLOCK_NAMESPACE
))
3684 lookups
= tree_cons (fnname
, fns
, lookups
);
3689 return build_tree_list (NULL_TREE
, NULL_TREE
);
3692 /* Create a DEPENDENT_OPERATOR_TYPE for a dependent operator expression of
3693 the given operator. LOOKUPS, if non-NULL, is the result of phase 1
3694 name lookup for the given operator. */
3697 build_dependent_operator_type (tree lookups
, tree_code code
, bool is_assign
)
3700 /* We're partially instantiating a dependent operator expression, and
3701 LOOKUPS is the result of phase 1 name lookup that we performed
3702 earlier at template definition time, so just reuse the corresponding
3703 DEPENDENT_OPERATOR_TYPE. */
3704 return TREE_TYPE (lookups
);
3706 /* Otherwise we're processing a dependent operator expression at template
3707 definition time, so perform phase 1 name lookup now. */
3708 lookups
= op_unqualified_lookup (code
, is_assign
);
3710 tree type
= cxx_make_type (DEPENDENT_OPERATOR_TYPE
);
3711 DEPENDENT_OPERATOR_TYPE_SAVED_LOOKUPS (type
) = lookups
;
3712 TREE_TYPE (lookups
) = type
;
3716 /* Given an expression PTR for a pointer, return an expression
3717 for the value pointed to.
3718 ERRORSTRING is the name of the operator to appear in error messages.
3720 This function may need to overload OPERATOR_FNNAME.
3721 Must also handle REFERENCE_TYPEs for C++. */
3724 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
3725 tree lookups
, tsubst_flags_t complain
)
3727 tree orig_expr
= expr
;
3729 tree overload
= NULL_TREE
;
3731 if (processing_template_decl
)
3733 /* Retain the type if we know the operand is a pointer. */
3734 if (TREE_TYPE (expr
) && INDIRECT_TYPE_P (TREE_TYPE (expr
)))
3736 if (expr
== current_class_ptr
3737 || (TREE_CODE (expr
) == NOP_EXPR
3738 && TREE_OPERAND (expr
, 0) == current_class_ptr
3739 && (same_type_ignoring_top_level_qualifiers_p
3740 (TREE_TYPE (expr
), TREE_TYPE (current_class_ptr
)))))
3741 return current_class_ref
;
3742 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
3744 if (type_dependent_expression_p (expr
))
3746 expr
= build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
3748 = build_dependent_operator_type (lookups
, INDIRECT_REF
, false);
3753 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
3754 NULL_TREE
, NULL_TREE
, lookups
,
3755 &overload
, complain
);
3757 rval
= cp_build_indirect_ref (loc
, expr
, errorstring
, complain
);
3759 if (processing_template_decl
&& rval
!= error_mark_node
)
3761 if (overload
!= NULL_TREE
)
3762 return (build_min_non_dep_op_overload
3763 (INDIRECT_REF
, rval
, overload
, orig_expr
));
3765 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
3771 /* Like c-family strict_aliasing_warning, but don't warn for dependent
3772 types or expressions. */
3775 cp_strict_aliasing_warning (location_t loc
, tree type
, tree expr
)
3777 if (processing_template_decl
)
3781 if (dependent_type_p (type
) || type_dependent_expression_p (e
))
3784 return strict_aliasing_warning (loc
, type
, expr
);
3787 /* The implementation of the above, and of indirection implied by other
3788 constructs. If DO_FOLD is true, fold away INDIRECT_REF of ADDR_EXPR. */
3791 cp_build_indirect_ref_1 (location_t loc
, tree ptr
, ref_operator errorstring
,
3792 tsubst_flags_t complain
, bool do_fold
)
3796 /* RO_NULL should only be used with the folding entry points below, not
3797 cp_build_indirect_ref. */
3798 gcc_checking_assert (errorstring
!= RO_NULL
|| do_fold
);
3800 if (ptr
== current_class_ptr
3801 || (TREE_CODE (ptr
) == NOP_EXPR
3802 && TREE_OPERAND (ptr
, 0) == current_class_ptr
3803 && (same_type_ignoring_top_level_qualifiers_p
3804 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
3805 return current_class_ref
;
3807 pointer
= (TYPE_REF_P (TREE_TYPE (ptr
))
3808 ? ptr
: decay_conversion (ptr
, complain
));
3809 if (pointer
== error_mark_node
)
3810 return error_mark_node
;
3812 type
= TREE_TYPE (pointer
);
3814 if (INDIRECT_TYPE_P (type
))
3818 If the type of the expression is "pointer to T," the type
3819 of the result is "T." */
3820 tree t
= TREE_TYPE (type
);
3822 if ((CONVERT_EXPR_P (ptr
)
3823 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
3824 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
3826 /* If a warning is issued, mark it to avoid duplicates from
3827 the backend. This only needs to be done at
3828 warn_strict_aliasing > 2. */
3829 if (warn_strict_aliasing
> 2
3830 && cp_strict_aliasing_warning (EXPR_LOCATION (ptr
),
3831 type
, TREE_OPERAND (ptr
, 0)))
3832 suppress_warning (ptr
, OPT_Wstrict_aliasing
);
3835 if (VOID_TYPE_P (t
))
3837 /* A pointer to incomplete type (other than cv void) can be
3838 dereferenced [expr.unary.op]/1 */
3839 if (complain
& tf_error
)
3840 error_at (loc
, "%qT is not a pointer-to-object type", type
);
3841 return error_mark_node
;
3843 else if (do_fold
&& TREE_CODE (pointer
) == ADDR_EXPR
3844 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
3845 /* The POINTER was something like `&x'. We simplify `*&x' to
3847 return TREE_OPERAND (pointer
, 0);
3850 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
3852 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3853 so that we get the proper error message if the result is used
3854 to assign to. Also, &* is supposed to be a no-op. */
3855 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
3856 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
3857 TREE_SIDE_EFFECTS (ref
)
3858 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
3862 else if (!(complain
& tf_error
))
3863 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3865 /* `pointer' won't be an error_mark_node if we were given a
3866 pointer to member, so it's cool to check for this here. */
3867 else if (TYPE_PTRMEM_P (type
))
3868 switch (errorstring
)
3870 case RO_ARRAY_INDEXING
:
3872 "invalid use of array indexing on pointer to member");
3875 error_at (loc
, "invalid use of unary %<*%> on pointer to member");
3877 case RO_IMPLICIT_CONVERSION
:
3878 error_at (loc
, "invalid use of implicit conversion on pointer "
3882 error_at (loc
, "left hand operand of %<->*%> must be a pointer to "
3883 "class, but is a pointer to member of type %qT", type
);
3888 else if (pointer
!= error_mark_node
)
3889 invalid_indirection_error (loc
, type
, errorstring
);
3891 return error_mark_node
;
3894 /* Entry point used by c-common, which expects folding. */
3897 build_indirect_ref (location_t loc
, tree ptr
, ref_operator errorstring
)
3899 return cp_build_indirect_ref_1 (loc
, ptr
, errorstring
,
3900 tf_warning_or_error
, true);
3903 /* Entry point used by internal indirection needs that don't correspond to any
3904 syntactic construct. */
3907 cp_build_fold_indirect_ref (tree pointer
)
3909 return cp_build_indirect_ref_1 (input_location
, pointer
, RO_NULL
,
3910 tf_warning_or_error
, true);
3913 /* Entry point used by indirection needs that correspond to some syntactic
3917 cp_build_indirect_ref (location_t loc
, tree ptr
, ref_operator errorstring
,
3918 tsubst_flags_t complain
)
3920 return cp_build_indirect_ref_1 (loc
, ptr
, errorstring
, complain
, false);
3923 /* This handles expressions of the form "a[i]", which denotes
3926 This is logically equivalent in C to *(a+i), but we may do it differently.
3927 If A is a variable or a member, we generate a primitive ARRAY_REF.
3928 This avoids forcing the array out of registers, and can work on
3929 arrays that are not lvalues (for example, members of structures returned
3932 If INDEX is of some user-defined type, it must be converted to
3933 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3934 will inherit the type of the array, which will be some pointer type.
3936 LOC is the location to use in building the array reference. */
3939 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3940 tsubst_flags_t complain
)
3942 tree first
= NULL_TREE
;
3947 if (complain
& tf_error
)
3948 error_at (loc
, "subscript missing in array reference");
3949 return error_mark_node
;
3952 if (TREE_TYPE (array
) == error_mark_node
3953 || TREE_TYPE (idx
) == error_mark_node
)
3954 return error_mark_node
;
3956 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3958 switch (TREE_CODE (array
))
3962 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3964 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3965 TREE_OPERAND (array
, 0), value
);
3966 SET_EXPR_LOCATION (ret
, loc
);
3971 ret
= build_conditional_expr
3972 (loc
, TREE_OPERAND (array
, 0),
3973 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3975 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3978 protected_set_expr_location (ret
, loc
);
3985 bool non_lvalue
= convert_vector_to_array_for_subscript (loc
, &array
, idx
);
3988 if (TREE_CODE (TREE_TYPE (idx
)) == ARRAY_TYPE
)
3990 std::swap (array
, idx
);
3991 if (flag_strong_eval_order
== 2 && TREE_SIDE_EFFECTS (array
))
3992 idx
= first
= save_expr (idx
);
3995 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3999 warn_array_subscript_with_type_char (loc
, idx
);
4001 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
4003 if (complain
& tf_error
)
4004 error_at (loc
, "array subscript is not an integer");
4005 return error_mark_node
;
4008 /* Apply integral promotions *after* noticing character types.
4009 (It is unclear why we do these promotions -- the standard
4010 does not say that we should. In fact, the natural thing would
4011 seem to be to convert IDX to ptrdiff_t; we're performing
4012 pointer arithmetic.) */
4013 idx
= cp_perform_integral_promotions (idx
, complain
);
4015 idx
= maybe_fold_non_dependent_expr (idx
, complain
);
4017 /* An array that is indexed by a non-constant
4018 cannot be stored in a register; we must be able to do
4019 address arithmetic on its address.
4020 Likewise an array of elements of variable size. */
4021 if (TREE_CODE (idx
) != INTEGER_CST
4022 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
4023 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
4026 if (!cxx_mark_addressable (array
, true))
4027 return error_mark_node
;
4030 /* An array that is indexed by a constant value which is not within
4031 the array bounds cannot be stored in a register either; because we
4032 would get a crash in store_bit_field/extract_bit_field when trying
4033 to access a non-existent part of the register. */
4034 if (TREE_CODE (idx
) == INTEGER_CST
4035 && TYPE_DOMAIN (TREE_TYPE (array
))
4036 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
4038 if (!cxx_mark_addressable (array
))
4039 return error_mark_node
;
4042 /* Note in C++ it is valid to subscript a `register' array, since
4043 it is valid to take the address of something with that
4044 storage specification. */
4048 while (TREE_CODE (foo
) == COMPONENT_REF
)
4049 foo
= TREE_OPERAND (foo
, 0);
4050 if (VAR_P (foo
) && DECL_REGISTER (foo
)
4051 && (complain
& tf_warning
))
4052 warning_at (loc
, OPT_Wextra
,
4053 "subscripting array declared %<register%>");
4056 type
= TREE_TYPE (TREE_TYPE (array
));
4057 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
4058 /* Array ref is const/volatile if the array elements are
4059 or if the array is.. */
4060 TREE_READONLY (rval
)
4061 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
4062 TREE_SIDE_EFFECTS (rval
)
4063 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
4064 TREE_THIS_VOLATILE (rval
)
4065 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
4066 ret
= require_complete_type (rval
, complain
);
4067 protected_set_expr_location (ret
, loc
);
4069 ret
= non_lvalue_loc (loc
, ret
);
4071 ret
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (ret
), first
, ret
);
4076 tree ar
= cp_default_conversion (array
, complain
);
4077 tree ind
= cp_default_conversion (idx
, complain
);
4079 if (!first
&& flag_strong_eval_order
== 2 && TREE_SIDE_EFFECTS (ind
))
4080 ar
= first
= save_expr (ar
);
4082 /* Put the integer in IND to simplify error checking. */
4083 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
4084 std::swap (ar
, ind
);
4086 if (ar
== error_mark_node
|| ind
== error_mark_node
)
4087 return error_mark_node
;
4089 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
4091 if (complain
& tf_error
)
4092 error_at (loc
, "subscripted value is neither array nor pointer");
4093 return error_mark_node
;
4095 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
4097 if (complain
& tf_error
)
4098 error_at (loc
, "array subscript is not an integer");
4099 return error_mark_node
;
4102 warn_array_subscript_with_type_char (loc
, idx
);
4104 ret
= cp_build_binary_op (input_location
, PLUS_EXPR
, ar
, ind
, complain
);
4106 ret
= build2_loc (loc
, COMPOUND_EXPR
, TREE_TYPE (ret
), first
, ret
);
4107 ret
= cp_build_indirect_ref (loc
, ret
, RO_ARRAY_INDEXING
, complain
);
4108 protected_set_expr_location (ret
, loc
);
4110 ret
= non_lvalue_loc (loc
, ret
);
4115 /* Entry point for Obj-C++. */
4118 build_array_ref (location_t loc
, tree array
, tree idx
)
4120 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
4123 /* Resolve a pointer to member function. INSTANCE is the object
4124 instance to use, if the member points to a virtual member.
4126 This used to avoid checking for virtual functions if basetype
4127 has no virtual functions, according to an earlier ANSI draft.
4128 With the final ISO C++ rules, such an optimization is
4129 incorrect: A pointer to a derived member can be static_cast
4130 to pointer-to-base-member, as long as the dynamic object
4131 later has the right member. So now we only do this optimization
4132 when we know the dynamic type of the object. */
4135 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
4136 tsubst_flags_t complain
)
4138 if (TREE_CODE (function
) == OFFSET_REF
)
4139 function
= TREE_OPERAND (function
, 1);
4141 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
4143 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
4145 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
4146 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
4148 tree instance_ptr
= *instance_ptrptr
;
4149 tree instance_save_expr
= 0;
4150 if (instance_ptr
== error_mark_node
)
4152 if (TREE_CODE (function
) == PTRMEM_CST
)
4154 /* Extracting the function address from a pmf is only
4155 allowed with -Wno-pmf-conversions. It only works for
4157 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
4158 e1
= convert (fntype
, e1
);
4163 if (complain
& tf_error
)
4164 error ("object missing in use of %qE", function
);
4165 return error_mark_node
;
4169 /* True if we know that the dynamic type of the object doesn't have
4170 virtual functions, so we can assume the PFN field is a pointer. */
4171 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
4172 && !TYPE_POLYMORPHIC_P (basetype
)
4173 && resolves_to_fixed_type_p (instance_ptr
, 0));
4175 /* If we don't really have an object (i.e. in an ill-formed
4176 conversion from PMF to pointer), we can't resolve virtual
4177 functions anyway. */
4178 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
4181 if (TREE_SIDE_EFFECTS (instance_ptr
))
4182 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
4184 if (TREE_SIDE_EFFECTS (function
))
4185 function
= save_expr (function
);
4187 /* Start by extracting all the information from the PMF itself. */
4188 e3
= pfn_from_ptrmemfunc (function
);
4189 delta
= delta_from_ptrmemfunc (function
);
4190 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
4191 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
4193 int flag_sanitize_save
;
4194 case ptrmemfunc_vbit_in_pfn
:
4195 e1
= cp_build_binary_op (input_location
,
4196 BIT_AND_EXPR
, idx
, integer_one_node
,
4198 idx
= cp_build_binary_op (input_location
,
4199 MINUS_EXPR
, idx
, integer_one_node
,
4201 if (idx
== error_mark_node
)
4202 return error_mark_node
;
4205 case ptrmemfunc_vbit_in_delta
:
4206 e1
= cp_build_binary_op (input_location
,
4207 BIT_AND_EXPR
, delta
, integer_one_node
,
4209 /* Don't instrument the RSHIFT_EXPR we're about to create because
4210 we're going to use DELTA number of times, and that wouldn't play
4211 well with SAVE_EXPRs therein. */
4212 flag_sanitize_save
= flag_sanitize
;
4214 delta
= cp_build_binary_op (input_location
,
4215 RSHIFT_EXPR
, delta
, integer_one_node
,
4217 flag_sanitize
= flag_sanitize_save
;
4218 if (delta
== error_mark_node
)
4219 return error_mark_node
;
4226 if (e1
== error_mark_node
)
4227 return error_mark_node
;
4229 /* Convert down to the right base before using the instance. A
4230 special case is that in a pointer to member of class C, C may
4231 be incomplete. In that case, the function will of course be
4232 a member of C, and no conversion is required. In fact,
4233 lookup_base will fail in that case, because incomplete
4234 classes do not have BINFOs. */
4235 if (!same_type_ignoring_top_level_qualifiers_p
4236 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
4238 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
4239 basetype
, ba_check
, NULL
, complain
);
4240 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
4242 if (instance_ptr
== error_mark_node
)
4243 return error_mark_node
;
4245 /* ...and then the delta in the PMF. */
4246 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
4248 /* Hand back the adjusted 'this' argument to our caller. */
4249 *instance_ptrptr
= instance_ptr
;
4252 /* Now just return the pointer. */
4255 /* Next extract the vtable pointer from the object. */
4256 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
4258 vtbl
= cp_build_fold_indirect_ref (vtbl
);
4259 if (vtbl
== error_mark_node
)
4260 return error_mark_node
;
4262 /* Finally, extract the function pointer from the vtable. */
4263 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
4264 e2
= cp_build_fold_indirect_ref (e2
);
4265 if (e2
== error_mark_node
)
4266 return error_mark_node
;
4267 TREE_CONSTANT (e2
) = 1;
4269 /* When using function descriptors, the address of the
4270 vtable entry is treated as a function pointer. */
4271 if (TARGET_VTABLE_USES_DESCRIPTORS
)
4272 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
4273 cp_build_addr_expr (e2
, complain
));
4275 e2
= fold_convert (TREE_TYPE (e3
), e2
);
4276 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
4277 if (e1
== error_mark_node
)
4278 return error_mark_node
;
4280 /* Make sure this doesn't get evaluated first inside one of the
4281 branches of the COND_EXPR. */
4282 if (instance_save_expr
)
4283 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
4284 instance_save_expr
, e1
);
4291 /* Used by the C-common bits. */
4293 build_function_call (location_t
/*loc*/,
4294 tree function
, tree params
)
4296 return cp_build_function_call (function
, params
, tf_warning_or_error
);
4299 /* Used by the C-common bits. */
4301 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
4302 tree function
, vec
<tree
, va_gc
> *params
,
4303 vec
<tree
, va_gc
> * /*origtypes*/, tree orig_function
)
4305 vec
<tree
, va_gc
> *orig_params
= params
;
4306 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
4307 tf_warning_or_error
, orig_function
);
4309 /* cp_build_function_call_vec can reallocate PARAMS by adding
4310 default arguments. That should never happen here. Verify
4312 gcc_assert (params
== orig_params
);
4317 /* Build a function call using a tree list of arguments. */
4320 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
4325 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
4326 vec_safe_push (vec
, TREE_VALUE (params
));
4327 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
4331 /* Build a function call using varargs. */
4334 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
4340 va_start (args
, complain
);
4341 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
4342 vec_safe_push (vec
, t
);
4344 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
4348 /* Build a function call using a vector of arguments.
4349 If FUNCTION is the result of resolving an overloaded target built-in,
4350 ORIG_FNDECL is the original function decl, otherwise it is null.
4351 PARAMS may be NULL if there are no parameters. This changes the
4352 contents of PARAMS. */
4355 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
4356 tsubst_flags_t complain
, tree orig_fndecl
)
4358 tree fntype
, fndecl
;
4360 tree original
= function
;
4364 vec
<tree
, va_gc
> *allocated
= NULL
;
4367 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
4368 expressions, like those used for ObjC messenger dispatches. */
4369 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
4370 function
= objc_rewrite_function_call (function
, (**params
)[0]);
4372 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4373 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
4374 if (TREE_CODE (function
) == NOP_EXPR
4375 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
4376 function
= TREE_OPERAND (function
, 0);
4378 if (TREE_CODE (function
) == FUNCTION_DECL
)
4380 if (!mark_used (function
, complain
))
4381 return error_mark_node
;
4384 /* Convert anything with function type to a pointer-to-function. */
4385 if (DECL_MAIN_P (function
))
4387 if (complain
& tf_error
)
4388 pedwarn (input_location
, OPT_Wpedantic
,
4389 "ISO C++ forbids calling %<::main%> from within program");
4391 return error_mark_node
;
4393 function
= build_addr_func (function
, complain
);
4399 function
= build_addr_func (function
, complain
);
4402 if (function
== error_mark_node
)
4403 return error_mark_node
;
4405 fntype
= TREE_TYPE (function
);
4407 if (TYPE_PTRMEMFUNC_P (fntype
))
4409 if (complain
& tf_error
)
4410 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
4411 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
4412 original
, original
);
4413 return error_mark_node
;
4416 is_method
= (TYPE_PTR_P (fntype
)
4417 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
4419 if (!(TYPE_PTRFN_P (fntype
)
4421 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
4423 if (complain
& tf_error
)
4425 if (!flag_diagnostics_show_caret
)
4426 error_at (input_location
,
4427 "%qE cannot be used as a function", original
);
4428 else if (DECL_P (original
))
4429 error_at (input_location
,
4430 "%qD cannot be used as a function", original
);
4432 error_at (input_location
,
4433 "expression cannot be used as a function");
4436 return error_mark_node
;
4439 /* fntype now gets the type of function pointed to. */
4440 fntype
= TREE_TYPE (fntype
);
4441 parm_types
= TYPE_ARG_TYPES (fntype
);
4445 allocated
= make_tree_vector ();
4446 params
= &allocated
;
4449 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
4452 return error_mark_node
;
4454 argarray
= (*params
)->address ();
4456 /* Check for errors in format strings and inappropriately
4458 bool warned_p
= check_function_arguments (input_location
, fndecl
, fntype
,
4459 nargs
, argarray
, NULL
);
4461 ret
= build_cxx_call (function
, nargs
, argarray
, complain
, orig_fndecl
);
4465 tree c
= extract_call_expr (ret
);
4466 if (TREE_CODE (c
) == CALL_EXPR
)
4467 suppress_warning (c
, OPT_Wnonnull
);
4470 if (allocated
!= NULL
)
4471 release_tree_vector (allocated
);
4476 /* Subroutine of convert_arguments.
4477 Print an error message about a wrong number of arguments. */
4480 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
4484 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
4486 if (DECL_NAME (fndecl
) == NULL_TREE
4487 || (DECL_NAME (fndecl
)
4488 == DECL_NAME (TYPE_NAME (DECL_CONTEXT (fndecl
)))))
4491 ? G_("too many arguments to constructor %q#D")
4492 : G_("too few arguments to constructor %q#D"),
4497 ? G_("too many arguments to member function %q#D")
4498 : G_("too few arguments to member function %q#D"),
4504 ? G_("too many arguments to function %q#D")
4505 : G_("too few arguments to function %q#D"),
4507 if (!DECL_IS_UNDECLARED_BUILTIN (fndecl
))
4508 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
4512 if (c_dialect_objc () && objc_message_selector ())
4515 ? G_("too many arguments to method %q#D")
4516 : G_("too few arguments to method %q#D"),
4517 objc_message_selector ());
4519 error_at (loc
, too_many_p
? G_("too many arguments to function")
4520 : G_("too few arguments to function"));
4524 /* Convert the actual parameter expressions in the list VALUES to the
4525 types in the list TYPELIST. The converted expressions are stored
4526 back in the VALUES vector.
4527 If parmdecls is exhausted, or when an element has NULL as its type,
4528 perform the default conversions.
4530 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
4532 This is also where warnings about wrong number of args are generated.
4534 Returns the actual number of arguments processed (which might be less
4535 than the length of the vector), or -1 on error.
4537 In C++, unspecified trailing parameters can be filled in with their
4538 default arguments, if such were specified. Do so here. */
4541 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
4542 int flags
, tsubst_flags_t complain
)
4547 /* Argument passing is always copy-initialization. */
4548 flags
|= LOOKUP_ONLYCONVERTING
;
4550 for (i
= 0, typetail
= typelist
;
4551 i
< vec_safe_length (*values
);
4554 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
4555 tree val
= (**values
)[i
];
4557 if (val
== error_mark_node
|| type
== error_mark_node
)
4560 if (type
== void_type_node
)
4562 if (complain
& tf_error
)
4564 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
4571 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4572 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
4573 if (TREE_CODE (val
) == NOP_EXPR
4574 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
4575 && (type
== 0 || !TYPE_REF_P (type
)))
4576 val
= TREE_OPERAND (val
, 0);
4578 if (type
== 0 || !TYPE_REF_P (type
))
4580 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
4581 || FUNC_OR_METHOD_TYPE_P (TREE_TYPE (val
)))
4582 val
= decay_conversion (val
, complain
);
4585 if (val
== error_mark_node
)
4590 /* Formal parm type is specified by a function prototype. */
4593 if (!COMPLETE_TYPE_P (complete_type (type
)))
4595 if (complain
& tf_error
)
4597 location_t loc
= EXPR_LOC_OR_LOC (val
, input_location
);
4600 auto_diagnostic_group d
;
4602 "parameter %P of %qD has incomplete type %qT",
4604 inform (get_fndecl_argument_location (fndecl
, i
),
4608 error_at (loc
, "parameter %P has incomplete type %qT", i
,
4611 parmval
= error_mark_node
;
4615 parmval
= convert_for_initialization
4616 (NULL_TREE
, type
, val
, flags
,
4617 ICR_ARGPASS
, fndecl
, i
, complain
);
4618 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
4621 if (parmval
== error_mark_node
)
4624 (**values
)[i
] = parmval
;
4628 int magic
= fndecl
? magic_varargs_p (fndecl
) : 0;
4631 /* Don't truncate excess precision to the semantic type. */
4632 if (magic
== 1 && TREE_CODE (val
) == EXCESS_PRECISION_EXPR
)
4633 val
= TREE_OPERAND (val
, 0);
4634 /* Don't do ellipsis conversion for __built_in_constant_p
4635 as this will result in spurious errors for non-trivial
4637 val
= require_complete_type (val
, complain
);
4640 val
= convert_arg_to_ellipsis (val
, complain
);
4642 (**values
)[i
] = val
;
4646 typetail
= TREE_CHAIN (typetail
);
4649 if (typetail
!= 0 && typetail
!= void_list_node
)
4651 /* See if there are default arguments that can be used. Because
4652 we hold default arguments in the FUNCTION_TYPE (which is so
4653 wrong), we can see default parameters here from deduced
4654 contexts (and via typeof) for indirect function calls.
4655 Fortunately we know whether we have a function decl to
4656 provide default arguments in a language conformant
4658 if (fndecl
&& TREE_PURPOSE (typetail
)
4659 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFERRED_PARSE
)
4661 for (; typetail
!= void_list_node
; ++i
)
4663 /* After DR777, with explicit template args we can end up with a
4664 default argument followed by no default argument. */
4665 if (!TREE_PURPOSE (typetail
))
4668 = convert_default_arg (TREE_VALUE (typetail
),
4669 TREE_PURPOSE (typetail
),
4670 fndecl
, i
, complain
);
4672 if (parmval
== error_mark_node
)
4675 vec_safe_push (*values
, parmval
);
4676 typetail
= TREE_CHAIN (typetail
);
4677 /* ends with `...'. */
4678 if (typetail
== NULL_TREE
)
4683 if (typetail
&& typetail
!= void_list_node
)
4685 if (complain
& tf_error
)
4686 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
4694 /* Build a binary-operation expression, after performing default
4695 conversions on the operands. CODE is the kind of expression to
4696 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
4697 are the tree codes which correspond to ARG1 and ARG2 when issuing
4698 warnings about possibly misplaced parentheses. They may differ
4699 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
4700 folding (e.g., if the parser sees "a | 1 + 1", it may call this
4701 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
4702 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
4703 ARG2_CODE as ERROR_MARK. */
4706 build_x_binary_op (const op_location_t
&loc
, enum tree_code code
, tree arg1
,
4707 enum tree_code arg1_code
, tree arg2
,
4708 enum tree_code arg2_code
, tree lookups
,
4709 tree
*overload_p
, tsubst_flags_t complain
)
4714 tree overload
= NULL_TREE
;
4719 if (processing_template_decl
)
4721 if (type_dependent_expression_p (arg1
)
4722 || type_dependent_expression_p (arg2
))
4724 expr
= build_min_nt_loc (loc
, code
, arg1
, arg2
);
4726 = build_dependent_operator_type (lookups
, code
, false);
4731 if (code
== DOTSTAR_EXPR
)
4732 expr
= build_m_component_ref (arg1
, arg2
, complain
);
4734 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
4735 lookups
, &overload
, complain
);
4737 if (overload_p
!= NULL
)
4738 *overload_p
= overload
;
4740 /* Check for cases such as x+y<<z which users are likely to
4741 misinterpret. But don't warn about obj << x + y, since that is a
4742 common idiom for I/O. */
4743 if (warn_parentheses
4744 && (complain
& tf_warning
)
4745 && !processing_template_decl
4746 && !error_operand_p (arg1
)
4747 && !error_operand_p (arg2
)
4748 && (code
!= LSHIFT_EXPR
4749 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
4750 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
4751 arg2_code
, orig_arg2
);
4753 if (processing_template_decl
&& expr
!= error_mark_node
)
4755 if (overload
!= NULL_TREE
)
4756 return (build_min_non_dep_op_overload
4757 (code
, expr
, overload
, orig_arg1
, orig_arg2
));
4759 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
4765 /* Build and return an ARRAY_REF expression. */
4768 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
4769 tsubst_flags_t complain
)
4771 tree orig_arg1
= arg1
;
4772 tree orig_arg2
= arg2
;
4774 tree overload
= NULL_TREE
;
4776 if (processing_template_decl
)
4778 if (type_dependent_expression_p (arg1
)
4779 || type_dependent_expression_p (arg2
))
4780 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
4781 NULL_TREE
, NULL_TREE
);
4784 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
4785 NULL_TREE
, NULL_TREE
, &overload
, complain
);
4787 if (processing_template_decl
&& expr
!= error_mark_node
)
4789 if (overload
!= NULL_TREE
)
4790 return (build_min_non_dep_op_overload
4791 (ARRAY_REF
, expr
, overload
, orig_arg1
, orig_arg2
));
4793 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
4794 NULL_TREE
, NULL_TREE
);
4799 /* Return whether OP is an expression of enum type cast to integer
4800 type. In C++ even unsigned enum types are cast to signed integer
4801 types. We do not want to issue warnings about comparisons between
4802 signed and unsigned types when one of the types is an enum type.
4803 Those warnings are always false positives in practice. */
4806 enum_cast_to_int (tree op
)
4808 if (CONVERT_EXPR_P (op
)
4809 && TREE_TYPE (op
) == integer_type_node
4810 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
4811 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
4814 /* The cast may have been pushed into a COND_EXPR. */
4815 if (TREE_CODE (op
) == COND_EXPR
)
4816 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
4817 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
4822 /* For the c-common bits. */
4824 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
4827 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
4830 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
4831 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
4834 build_vec_cmp (tree_code code
, tree type
,
4835 tree arg0
, tree arg1
)
4837 tree zero_vec
= build_zero_cst (type
);
4838 tree minus_one_vec
= build_minus_one_cst (type
);
4839 tree cmp_type
= truth_type_for (TREE_TYPE (arg0
));
4840 tree cmp
= build2 (code
, cmp_type
, arg0
, arg1
);
4841 return build3 (VEC_COND_EXPR
, type
, cmp
, minus_one_vec
, zero_vec
);
4844 /* Possibly warn about an address never being NULL. */
4847 warn_for_null_address (location_t location
, tree op
, tsubst_flags_t complain
)
4849 /* Prevent warnings issued for macro expansion. */
4851 || (complain
& tf_warning
) == 0
4852 || c_inhibit_evaluation_warnings
!= 0
4853 || from_macro_expansion_at (location
)
4854 || warning_suppressed_p (op
, OPT_Waddress
))
4857 tree cop
= fold_for_warn (op
);
4859 if (TREE_CODE (cop
) == NON_LVALUE_EXPR
)
4860 /* Unwrap the expression for C++ 98. */
4861 cop
= TREE_OPERAND (cop
, 0);
4863 if (TREE_CODE (cop
) == PTRMEM_CST
)
4865 /* The address of a nonstatic data member is never null. */
4866 warning_at (location
, OPT_Waddress
,
4867 "the address %qE will never be NULL",
4872 if (TREE_CODE (cop
) == NOP_EXPR
)
4874 /* Allow casts to intptr_t to suppress the warning. */
4875 tree type
= TREE_TYPE (cop
);
4876 if (TREE_CODE (type
) == INTEGER_TYPE
)
4882 bool warned
= false;
4883 if (TREE_CODE (cop
) == ADDR_EXPR
)
4885 cop
= TREE_OPERAND (cop
, 0);
4887 /* Set to true in the loop below if OP dereferences its operand.
4888 In such a case the ultimate target need not be a decl for
4889 the null [in]equality test to be necessarily constant. */
4892 /* Get the outermost array or object, or member. */
4893 while (handled_component_p (cop
))
4895 if (TREE_CODE (cop
) == COMPONENT_REF
)
4897 /* Get the member (its address is never null). */
4898 cop
= TREE_OPERAND (cop
, 1);
4902 /* Get the outer array/object to refer to in the warning. */
4903 cop
= TREE_OPERAND (cop
, 0);
4907 if ((!deref
&& !decl_with_nonnull_addr_p (cop
))
4908 || from_macro_expansion_at (location
)
4909 || warning_suppressed_p (cop
, OPT_Waddress
))
4912 warned
= warning_at (location
, OPT_Waddress
,
4913 "the address of %qD will never be NULL", cop
);
4916 else if (TREE_CODE (cop
) == POINTER_PLUS_EXPR
)
4918 /* Adding zero to the null pointer is well-defined in C++. When
4919 the offset is unknown (i.e., not a constant) warn anyway since
4920 it's less likely that the pointer operand is null than not. */
4921 tree off
= TREE_OPERAND (cop
, 1);
4922 if (!integer_zerop (off
)
4923 && !warning_suppressed_p (cop
, OPT_Waddress
))
4925 tree base
= TREE_OPERAND (cop
, 0);
4927 if (TYPE_REF_P (TREE_TYPE (base
)))
4928 warning_at (location
, OPT_Waddress
, "the compiler can assume that "
4929 "the address of %qE will never be NULL", base
);
4931 warning_at (location
, OPT_Waddress
, "comparing the result of "
4932 "pointer addition %qE and NULL", cop
);
4936 else if (CONVERT_EXPR_P (op
)
4937 && TYPE_REF_P (TREE_TYPE (TREE_OPERAND (op
, 0))))
4941 if (TREE_CODE (op
) == COMPONENT_REF
)
4942 op
= TREE_OPERAND (op
, 1);
4945 warned
= warning_at (location
, OPT_Waddress
,
4946 "the compiler can assume that the address of "
4947 "%qD will never be NULL", op
);
4950 if (warned
&& DECL_P (op
))
4951 inform (DECL_SOURCE_LOCATION (op
), "%qD declared here", op
);
4954 /* Warn about [expr.arith.conv]/2: If one operand is of enumeration type and
4955 the other operand is of a different enumeration type or a floating-point
4956 type, this behavior is deprecated ([depr.arith.conv.enum]). CODE is the
4957 code of the binary operation, TYPE0 and TYPE1 are the types of the operands,
4958 and LOC is the location for the whole binary expression.
4959 For C++26 this is ill-formed rather than deprecated.
4960 Return true for SFINAE errors.
4961 TODO: Consider combining this with -Wenum-compare in build_new_op_1. */
4964 do_warn_enum_conversions (location_t loc
, enum tree_code code
, tree type0
,
4965 tree type1
, tsubst_flags_t complain
)
4967 if (TREE_CODE (type0
) == ENUMERAL_TYPE
4968 && TREE_CODE (type1
) == ENUMERAL_TYPE
4969 && TYPE_MAIN_VARIANT (type0
) != TYPE_MAIN_VARIANT (type1
))
4971 if (cxx_dialect
>= cxx26
)
4973 if ((complain
& tf_warning_or_error
) == 0)
4976 else if ((complain
& tf_warning
) == 0)
4978 /* In C++20, -Wdeprecated-enum-enum-conversion is on by default.
4979 Otherwise, warn if -Wenum-conversion is on. */
4981 if (warn_deprecated_enum_enum_conv
)
4982 opt
= OPT_Wdeprecated_enum_enum_conversion
;
4983 else if (warn_enum_conversion
)
4984 opt
= OPT_Wenum_conversion
;
4996 /* Comparisons are handled by -Wenum-compare. */
4998 case SPACESHIP_EXPR
:
4999 /* This is invalid, don't warn. */
5004 if (cxx_dialect
>= cxx26
)
5005 pedwarn (loc
, opt
, "bitwise operation between different "
5006 "enumeration types %qT and %qT", type0
, type1
);
5008 warning_at (loc
, opt
, "bitwise operation between different "
5009 "enumeration types %qT and %qT is deprecated",
5013 if (cxx_dialect
>= cxx26
)
5014 pedwarn (loc
, opt
, "arithmetic between different enumeration "
5015 "types %qT and %qT", type0
, type1
);
5017 warning_at (loc
, opt
, "arithmetic between different enumeration "
5018 "types %qT and %qT is deprecated", type0
, type1
);
5022 else if ((TREE_CODE (type0
) == ENUMERAL_TYPE
5023 && SCALAR_FLOAT_TYPE_P (type1
))
5024 || (SCALAR_FLOAT_TYPE_P (type0
)
5025 && TREE_CODE (type1
) == ENUMERAL_TYPE
))
5027 if (cxx_dialect
>= cxx26
)
5029 if ((complain
& tf_warning_or_error
) == 0)
5032 else if ((complain
& tf_warning
) == 0)
5034 const bool enum_first_p
= TREE_CODE (type0
) == ENUMERAL_TYPE
;
5035 /* In C++20, -Wdeprecated-enum-float-conversion is on by default.
5036 Otherwise, warn if -Wenum-conversion is on. */
5038 if (warn_deprecated_enum_float_conv
)
5039 opt
= OPT_Wdeprecated_enum_float_conversion
;
5040 else if (warn_enum_conversion
)
5041 opt
= OPT_Wenum_conversion
;
5053 if (enum_first_p
&& cxx_dialect
>= cxx26
)
5054 pedwarn (loc
, opt
, "comparison of enumeration type %qT with "
5055 "floating-point type %qT", type0
, type1
);
5056 else if (cxx_dialect
>= cxx26
)
5057 pedwarn (loc
, opt
, "comparison of floating-point type %qT "
5058 "with enumeration type %qT", type0
, type1
);
5059 else if (enum_first_p
)
5060 warning_at (loc
, opt
, "comparison of enumeration type %qT with "
5061 "floating-point type %qT is deprecated",
5064 warning_at (loc
, opt
, "comparison of floating-point type %qT "
5065 "with enumeration type %qT is deprecated",
5068 case SPACESHIP_EXPR
:
5069 /* This is invalid, don't warn. */
5072 if (enum_first_p
&& cxx_dialect
>= cxx26
)
5073 pedwarn (loc
, opt
, "arithmetic between enumeration type %qT "
5074 "and floating-point type %qT", type0
, type1
);
5075 else if (cxx_dialect
>= cxx26
)
5076 pedwarn (loc
, opt
, "arithmetic between floating-point type %qT "
5077 "and enumeration type %qT", type0
, type1
);
5078 else if (enum_first_p
)
5079 warning_at (loc
, opt
, "arithmetic between enumeration type %qT "
5080 "and floating-point type %qT is deprecated",
5083 warning_at (loc
, opt
, "arithmetic between floating-point type %qT "
5084 "and enumeration type %qT is deprecated",
5092 /* Build a binary-operation expression without default conversions.
5093 CODE is the kind of expression to build.
5094 LOCATION is the location_t of the operator in the source code.
5095 This function differs from `build' in several ways:
5096 the data type of the result is computed and recorded in it,
5097 warnings are generated if arg data types are invalid,
5098 special handling for addition and subtraction of pointers is known,
5099 and some optimization is done (operations on narrow ints
5100 are done in the narrower type when that gives the same result).
5101 Constant folding is also done before the result is returned.
5103 Note that the operands will never have enumeral types
5104 because either they have just had the default conversions performed
5105 or they have both just been converted to some other type in which
5106 the arithmetic is to be done.
5108 C++: must do special pointer arithmetic when implementing
5109 multiple inheritance, and deal with pointer to member functions. */
5112 cp_build_binary_op (const op_location_t
&location
,
5113 enum tree_code code
, tree orig_op0
, tree orig_op1
,
5114 tsubst_flags_t complain
)
5117 enum tree_code code0
, code1
;
5118 tree type0
, type1
, orig_type0
, orig_type1
;
5119 const char *invalid_op_diag
;
5121 /* Expression code to give to the expression when it is built.
5122 Normally this is CODE, which is what the caller asked for,
5123 but in some special cases we change it. */
5124 enum tree_code resultcode
= code
;
5126 /* Data type in which the computation is to be performed.
5127 In the simplest cases this is the common type of the arguments. */
5128 tree result_type
= NULL_TREE
;
5130 /* When the computation is in excess precision, the type of the
5131 final EXCESS_PRECISION_EXPR. */
5132 tree semantic_result_type
= NULL
;
5134 /* Nonzero means operands have already been type-converted
5135 in whatever way is necessary.
5136 Zero means they need to be converted to RESULT_TYPE. */
5139 /* Nonzero means create the expression with this type, rather than
5141 tree build_type
= 0;
5143 /* Nonzero means after finally constructing the expression
5144 convert it to this type. */
5145 tree final_type
= 0;
5149 /* Nonzero if this is an operation like MIN or MAX which can
5150 safely be computed in short if both args are promoted shorts.
5151 Also implies COMMON.
5152 -1 indicates a bitwise operation; this makes a difference
5153 in the exact conditions for when it is safe to do the operation
5154 in a narrower mode. */
5157 /* Nonzero if this is a comparison operation;
5158 if both args are promoted shorts, compare the original shorts.
5159 Also implies COMMON. */
5160 int short_compare
= 0;
5162 /* Nonzero if this is a right-shift operation, which can be computed on the
5163 original short and then promoted if the operand is a promoted short. */
5164 int short_shift
= 0;
5166 /* Nonzero means set RESULT_TYPE to the common type of the args. */
5169 /* True if both operands have arithmetic type. */
5170 bool arithmetic_types_p
;
5172 /* Remember whether we're doing / or %. */
5173 bool doing_div_or_mod
= false;
5175 /* Remember whether we're doing << or >>. */
5176 bool doing_shift
= false;
5178 /* Tree holding instrumentation expression. */
5179 tree instrument_expr
= NULL_TREE
;
5181 /* True means this is an arithmetic operation that may need excess
5183 bool may_need_excess_precision
;
5185 /* Apply default conversions. */
5186 op0
= resolve_nondeduced_context (orig_op0
, complain
);
5187 op1
= resolve_nondeduced_context (orig_op1
, complain
);
5189 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
5190 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
5191 || code
== TRUTH_XOR_EXPR
)
5193 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
5194 op0
= decay_conversion (op0
, complain
);
5195 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
5196 op1
= decay_conversion (op1
, complain
);
5200 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
5201 op0
= cp_default_conversion (op0
, complain
);
5202 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
5203 op1
= cp_default_conversion (op1
, complain
);
5206 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
5207 STRIP_TYPE_NOPS (op0
);
5208 STRIP_TYPE_NOPS (op1
);
5210 /* DTRT if one side is an overloaded function, but complain about it. */
5211 if (type_unknown_p (op0
))
5213 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
5214 if (t
!= error_mark_node
)
5216 if (complain
& tf_error
)
5217 permerror (location
,
5218 "assuming cast to type %qT from overloaded function",
5223 if (type_unknown_p (op1
))
5225 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
5226 if (t
!= error_mark_node
)
5228 if (complain
& tf_error
)
5229 permerror (location
,
5230 "assuming cast to type %qT from overloaded function",
5236 orig_type0
= type0
= TREE_TYPE (op0
);
5237 orig_type1
= type1
= TREE_TYPE (op1
);
5238 tree non_ep_op0
= op0
;
5239 tree non_ep_op1
= op1
;
5241 /* The expression codes of the data types of the arguments tell us
5242 whether the arguments are integers, floating, pointers, etc. */
5243 code0
= TREE_CODE (type0
);
5244 code1
= TREE_CODE (type1
);
5246 /* If an error was already reported for one of the arguments,
5247 avoid reporting another error. */
5248 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
5249 return error_mark_node
;
5251 if ((invalid_op_diag
5252 = targetm
.invalid_binary_op (code
, type0
, type1
)))
5254 if (complain
& tf_error
)
5256 if (code0
== REAL_TYPE
5257 && code1
== REAL_TYPE
5258 && (extended_float_type_p (type0
)
5259 || extended_float_type_p (type1
))
5260 && cp_compare_floating_point_conversion_ranks (type0
,
5263 rich_location
richloc (line_table
, location
);
5264 binary_op_error (&richloc
, code
, type0
, type1
);
5267 error (invalid_op_diag
);
5269 return error_mark_node
;
5277 case TRUNC_DIV_EXPR
:
5279 case FLOOR_DIV_EXPR
:
5280 case ROUND_DIV_EXPR
:
5281 case EXACT_DIV_EXPR
:
5282 may_need_excess_precision
= true;
5290 case SPACESHIP_EXPR
:
5291 /* Excess precision for implicit conversions of integers to
5293 may_need_excess_precision
= (ANY_INTEGRAL_TYPE_P (type0
)
5294 || ANY_INTEGRAL_TYPE_P (type1
));
5297 may_need_excess_precision
= false;
5300 if (TREE_CODE (op0
) == EXCESS_PRECISION_EXPR
)
5302 op0
= TREE_OPERAND (op0
, 0);
5303 type0
= TREE_TYPE (op0
);
5305 else if (may_need_excess_precision
5306 && (code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
))
5307 if (tree eptype
= excess_precision_type (type0
))
5310 op0
= convert (eptype
, op0
);
5312 if (TREE_CODE (op1
) == EXCESS_PRECISION_EXPR
)
5314 op1
= TREE_OPERAND (op1
, 0);
5315 type1
= TREE_TYPE (op1
);
5317 else if (may_need_excess_precision
5318 && (code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
5319 if (tree eptype
= excess_precision_type (type1
))
5322 op1
= convert (eptype
, op1
);
5325 /* Issue warnings about peculiar, but valid, uses of NULL. */
5326 if ((null_node_p (orig_op0
) || null_node_p (orig_op1
))
5327 /* It's reasonable to use pointer values as operands of &&
5328 and ||, so NULL is no exception. */
5329 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
5330 && ( /* Both are NULL (or 0) and the operation was not a
5331 comparison or a pointer subtraction. */
5332 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
5333 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
5334 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
5335 || (!null_ptr_cst_p (orig_op0
)
5336 && !TYPE_PTR_OR_PTRMEM_P (type0
))
5337 || (!null_ptr_cst_p (orig_op1
)
5338 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
5339 && (complain
& tf_warning
))
5342 expansion_point_location_if_in_system_header (input_location
);
5344 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
5347 /* In case when one of the operands of the binary operation is
5348 a vector and another is a scalar -- convert scalar to vector. */
5349 if ((gnu_vector_type_p (type0
) && code1
!= VECTOR_TYPE
)
5350 || (gnu_vector_type_p (type1
) && code0
!= VECTOR_TYPE
))
5352 enum stv_conv convert_flag
5353 = scalar_to_vector (location
, code
, non_ep_op0
, non_ep_op1
,
5354 complain
& tf_error
);
5356 switch (convert_flag
)
5359 return error_mark_node
;
5362 op0
= convert (TREE_TYPE (type1
), op0
);
5363 op0
= save_expr (op0
);
5364 op0
= build_vector_from_val (type1
, op0
);
5365 orig_type0
= type0
= TREE_TYPE (op0
);
5366 code0
= TREE_CODE (type0
);
5372 op1
= convert (TREE_TYPE (type0
), op1
);
5373 op1
= save_expr (op1
);
5374 op1
= build_vector_from_val (type0
, op1
);
5375 orig_type1
= type1
= TREE_TYPE (op1
);
5376 code1
= TREE_CODE (type1
);
5388 /* Subtraction of two similar pointers.
5389 We must subtract them as integers, then divide by object size. */
5390 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
5391 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
5394 result
= pointer_diff (location
, op0
, op1
,
5395 common_pointer_type (type0
, type1
), complain
,
5397 if (instrument_expr
!= NULL
)
5398 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5399 instrument_expr
, result
);
5403 /* In all other cases except pointer - int, the usual arithmetic
5405 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
5410 /* The pointer - int case is just like pointer + int; fall
5414 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
5415 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
5419 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
5420 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
5421 if (processing_template_decl
)
5423 result_type
= TREE_TYPE (ptr_operand
);
5426 return cp_pointer_int_sum (location
, code
,
5438 case TRUNC_DIV_EXPR
:
5440 case FLOOR_DIV_EXPR
:
5441 case ROUND_DIV_EXPR
:
5442 case EXACT_DIV_EXPR
:
5443 if (TREE_CODE (op0
) == SIZEOF_EXPR
&& TREE_CODE (op1
) == SIZEOF_EXPR
)
5445 tree type0
= TREE_OPERAND (op0
, 0);
5446 tree type1
= TREE_OPERAND (op1
, 0);
5447 tree first_arg
= tree_strip_any_location_wrapper (type0
);
5448 if (!TYPE_P (type0
))
5449 type0
= TREE_TYPE (type0
);
5450 if (!TYPE_P (type1
))
5451 type1
= TREE_TYPE (type1
);
5453 && INDIRECT_TYPE_P (type0
)
5454 && same_type_p (TREE_TYPE (type0
), type1
))
5456 if (!(TREE_CODE (first_arg
) == PARM_DECL
5457 && DECL_ARRAY_PARAMETER_P (first_arg
)
5458 && warn_sizeof_array_argument
)
5459 && (complain
& tf_warning
))
5461 auto_diagnostic_group d
;
5462 if (warning_at (location
, OPT_Wsizeof_pointer_div
,
5463 "division %<sizeof (%T) / sizeof (%T)%> does "
5464 "not compute the number of array elements",
5466 if (DECL_P (first_arg
))
5467 inform (DECL_SOURCE_LOCATION (first_arg
),
5468 "first %<sizeof%> operand was declared here");
5471 else if (!dependent_type_p (type0
)
5472 && !dependent_type_p (type1
)
5473 && TREE_CODE (type0
) == ARRAY_TYPE
5474 && !char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type0
)))
5475 /* Set by finish_parenthesized_expr. */
5476 && !warning_suppressed_p (op1
, OPT_Wsizeof_array_div
)
5477 && (complain
& tf_warning
))
5478 maybe_warn_sizeof_array_div (location
, first_arg
, type0
,
5479 op1
, non_reference (type1
));
5482 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
5483 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
5484 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5485 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
5487 enum tree_code tcode0
= code0
, tcode1
= code1
;
5488 doing_div_or_mod
= true;
5489 warn_for_div_by_zero (location
, fold_for_warn (op1
));
5491 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
5492 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
5493 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
5494 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
5496 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
5497 resultcode
= RDIV_EXPR
;
5500 /* When dividing two signed integers, we have to promote to int.
5501 unless we divide by a constant != -1. Note that default
5502 conversion will have been performed on the operands at this
5503 point, so we have to dig out the original type to find out if
5505 tree stripped_op1
= tree_strip_any_location_wrapper (op1
);
5506 shorten
= may_shorten_divmod (op0
, stripped_op1
);
5516 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
5517 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
5518 && !VECTOR_FLOAT_TYPE_P (type0
)
5519 && !VECTOR_FLOAT_TYPE_P (type1
)))
5523 case TRUNC_MOD_EXPR
:
5524 case FLOOR_MOD_EXPR
:
5525 doing_div_or_mod
= true;
5526 warn_for_div_by_zero (location
, fold_for_warn (op1
));
5528 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
5529 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
5530 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
5532 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
5534 /* Although it would be tempting to shorten always here, that loses
5535 on some targets, since the modulo instruction is undefined if the
5536 quotient can't be represented in the computation mode. We shorten
5537 only if unsigned or if dividing by something we know != -1. */
5538 tree stripped_op1
= tree_strip_any_location_wrapper (op1
);
5539 shorten
= may_shorten_divmod (op0
, stripped_op1
);
5544 case TRUTH_ANDIF_EXPR
:
5545 case TRUTH_ORIF_EXPR
:
5546 case TRUTH_AND_EXPR
:
5548 if (!VECTOR_TYPE_P (type0
) && gnu_vector_type_p (type1
))
5550 if (!COMPARISON_CLASS_P (op1
))
5551 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
5552 build_zero_cst (type1
), complain
);
5553 if (code
== TRUTH_ANDIF_EXPR
)
5555 tree z
= build_zero_cst (TREE_TYPE (op1
));
5556 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
5558 else if (code
== TRUTH_ORIF_EXPR
)
5560 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
5561 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
5566 if (gnu_vector_type_p (type0
)
5567 && (!VECTOR_TYPE_P (type1
) || gnu_vector_type_p (type1
)))
5569 if (!COMPARISON_CLASS_P (op0
))
5570 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
5571 build_zero_cst (type0
), complain
);
5572 if (!VECTOR_TYPE_P (type1
))
5574 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
5575 tree z
= build_zero_cst (TREE_TYPE (op0
));
5576 op1
= build_conditional_expr (location
, op1
, m1
, z
, complain
);
5578 else if (!COMPARISON_CLASS_P (op1
))
5579 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
5580 build_zero_cst (type1
), complain
);
5582 if (code
== TRUTH_ANDIF_EXPR
)
5583 code
= BIT_AND_EXPR
;
5584 else if (code
== TRUTH_ORIF_EXPR
)
5585 code
= BIT_IOR_EXPR
;
5589 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
5592 result_type
= boolean_type_node
;
5595 /* Shift operations: result has same type as first operand;
5596 always convert second operand to int.
5597 Also set SHORT_SHIFT if shifting rightward. */
5600 if (gnu_vector_type_p (type0
)
5601 && code1
== INTEGER_TYPE
5602 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
5604 result_type
= type0
;
5607 else if (gnu_vector_type_p (type0
)
5608 && gnu_vector_type_p (type1
)
5609 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
5610 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
5611 && known_eq (TYPE_VECTOR_SUBPARTS (type0
),
5612 TYPE_VECTOR_SUBPARTS (type1
)))
5614 result_type
= type0
;
5617 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
5619 tree const_op1
= fold_for_warn (op1
);
5620 if (TREE_CODE (const_op1
) != INTEGER_CST
)
5622 result_type
= type0
;
5624 if (TREE_CODE (const_op1
) == INTEGER_CST
)
5626 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
5628 if ((complain
& tf_warning
)
5629 && c_inhibit_evaluation_warnings
== 0)
5630 warning_at (location
, OPT_Wshift_count_negative
,
5631 "right shift count is negative");
5635 if (!integer_zerop (const_op1
))
5638 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
5639 && (complain
& tf_warning
)
5640 && c_inhibit_evaluation_warnings
== 0)
5641 warning_at (location
, OPT_Wshift_count_overflow
,
5642 "right shift count >= width of type");
5645 /* Avoid converting op1 to result_type later. */
5651 if (gnu_vector_type_p (type0
)
5652 && code1
== INTEGER_TYPE
5653 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
5655 result_type
= type0
;
5658 else if (gnu_vector_type_p (type0
)
5659 && gnu_vector_type_p (type1
)
5660 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
5661 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
5662 && known_eq (TYPE_VECTOR_SUBPARTS (type0
),
5663 TYPE_VECTOR_SUBPARTS (type1
)))
5665 result_type
= type0
;
5668 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
5670 tree const_op0
= fold_for_warn (op0
);
5671 if (TREE_CODE (const_op0
) != INTEGER_CST
)
5673 tree const_op1
= fold_for_warn (op1
);
5674 if (TREE_CODE (const_op1
) != INTEGER_CST
)
5676 result_type
= type0
;
5678 if (TREE_CODE (const_op0
) == INTEGER_CST
5679 && tree_int_cst_sgn (const_op0
) < 0
5680 && !TYPE_OVERFLOW_WRAPS (type0
)
5681 && (complain
& tf_warning
)
5682 && c_inhibit_evaluation_warnings
== 0)
5683 warning_at (location
, OPT_Wshift_negative_value
,
5684 "left shift of negative value");
5685 if (TREE_CODE (const_op1
) == INTEGER_CST
)
5687 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
5689 if ((complain
& tf_warning
)
5690 && c_inhibit_evaluation_warnings
== 0)
5691 warning_at (location
, OPT_Wshift_count_negative
,
5692 "left shift count is negative");
5694 else if (compare_tree_int (const_op1
,
5695 TYPE_PRECISION (type0
)) >= 0)
5697 if ((complain
& tf_warning
)
5698 && c_inhibit_evaluation_warnings
== 0)
5699 warning_at (location
, OPT_Wshift_count_overflow
,
5700 "left shift count >= width of type");
5702 else if (TREE_CODE (const_op0
) == INTEGER_CST
5703 && (complain
& tf_warning
))
5704 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
5706 /* Avoid converting op1 to result_type later. */
5713 if (gnu_vector_type_p (type0
) && gnu_vector_type_p (type1
))
5714 goto vector_compare
;
5715 if ((complain
& tf_warning
)
5716 && c_inhibit_evaluation_warnings
== 0
5717 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
5718 warning_at (location
, OPT_Wfloat_equal
,
5719 "comparing floating-point with %<==%> "
5720 "or %<!=%> is unsafe");
5721 if (complain
& tf_warning
)
5723 tree stripped_orig_op0
= tree_strip_any_location_wrapper (orig_op0
);
5724 tree stripped_orig_op1
= tree_strip_any_location_wrapper (orig_op1
);
5725 if ((TREE_CODE (stripped_orig_op0
) == STRING_CST
5726 && !integer_zerop (cp_fully_fold (op1
)))
5727 || (TREE_CODE (stripped_orig_op1
) == STRING_CST
5728 && !integer_zerop (cp_fully_fold (op0
))))
5729 warning_at (location
, OPT_Waddress
,
5730 "comparison with string literal results in "
5731 "unspecified behavior");
5732 else if (warn_array_compare
5733 && TREE_CODE (TREE_TYPE (orig_op0
)) == ARRAY_TYPE
5734 && TREE_CODE (TREE_TYPE (orig_op1
)) == ARRAY_TYPE
)
5735 do_warn_array_compare (location
, code
, stripped_orig_op0
,
5739 build_type
= boolean_type_node
;
5740 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
5741 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
5742 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5743 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
5745 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
5746 && null_ptr_cst_p (orig_op1
))
5747 /* Handle, eg, (void*)0 (c++/43906), and more. */
5748 || (code0
== POINTER_TYPE
5749 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
5751 if (TYPE_PTR_P (type1
))
5752 result_type
= composite_pointer_type (location
,
5753 type0
, type1
, op0
, op1
,
5754 CPO_COMPARISON
, complain
);
5756 result_type
= type0
;
5758 if (char_type_p (TREE_TYPE (orig_op1
)))
5760 auto_diagnostic_group d
;
5761 if (warning_at (location
, OPT_Wpointer_compare
,
5762 "comparison between pointer and zero character "
5765 "did you mean to dereference the pointer?");
5767 warn_for_null_address (location
, op0
, complain
);
5769 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
5770 && null_ptr_cst_p (orig_op0
))
5771 /* Handle, eg, (void*)0 (c++/43906), and more. */
5772 || (code1
== POINTER_TYPE
5773 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
5775 if (TYPE_PTR_P (type0
))
5776 result_type
= composite_pointer_type (location
,
5777 type0
, type1
, op0
, op1
,
5778 CPO_COMPARISON
, complain
);
5780 result_type
= type1
;
5782 if (char_type_p (TREE_TYPE (orig_op0
)))
5784 auto_diagnostic_group d
;
5785 if (warning_at (location
, OPT_Wpointer_compare
,
5786 "comparison between pointer and zero character "
5789 "did you mean to dereference the pointer?");
5791 warn_for_null_address (location
, op1
, complain
);
5793 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
5794 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
5795 result_type
= composite_pointer_type (location
,
5796 type0
, type1
, op0
, op1
,
5797 CPO_COMPARISON
, complain
);
5798 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
5799 /* One of the operands must be of nullptr_t type. */
5800 result_type
= TREE_TYPE (nullptr_node
);
5801 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
5803 result_type
= type0
;
5804 if (complain
& tf_error
)
5805 permerror (location
, "ISO C++ forbids comparison between "
5806 "pointer and integer");
5808 return error_mark_node
;
5810 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
5812 result_type
= type1
;
5813 if (complain
& tf_error
)
5814 permerror (location
, "ISO C++ forbids comparison between "
5815 "pointer and integer");
5817 return error_mark_node
;
5819 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (orig_op1
))
5821 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
5822 == ptrmemfunc_vbit_in_delta
)
5824 tree pfn0
, delta0
, e1
, e2
;
5826 if (TREE_SIDE_EFFECTS (op0
))
5827 op0
= cp_save_expr (op0
);
5829 pfn0
= pfn_from_ptrmemfunc (op0
);
5830 delta0
= delta_from_ptrmemfunc (op0
);
5832 /* If we will warn below about a null-address compare
5833 involving the orig_op0 ptrmemfunc, we'd likely also
5834 warn about the pfn0's null-address compare, and
5835 that would be redundant, so suppress it. */
5836 warning_sentinel
ws (warn_address
);
5837 e1
= cp_build_binary_op (location
,
5840 build_zero_cst (TREE_TYPE (pfn0
)),
5843 e2
= cp_build_binary_op (location
,
5849 if (complain
& tf_warning
)
5850 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
5852 e2
= cp_build_binary_op (location
,
5853 EQ_EXPR
, e2
, integer_zero_node
,
5855 op0
= cp_build_binary_op (location
,
5856 TRUTH_ANDIF_EXPR
, e1
, e2
,
5858 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
5862 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
5863 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
5865 result_type
= TREE_TYPE (op0
);
5867 warn_for_null_address (location
, orig_op0
, complain
);
5869 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (orig_op0
))
5870 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
5871 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
5874 /* E will be the final comparison. */
5876 /* E1 and E2 are for scratch. */
5884 type
= composite_pointer_type (location
, type0
, type1
, op0
, op1
,
5885 CPO_COMPARISON
, complain
);
5887 if (!same_type_p (TREE_TYPE (op0
), type
))
5888 op0
= cp_convert_and_check (type
, op0
, complain
);
5889 if (!same_type_p (TREE_TYPE (op1
), type
))
5890 op1
= cp_convert_and_check (type
, op1
, complain
);
5892 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5893 return error_mark_node
;
5895 if (TREE_SIDE_EFFECTS (op0
))
5896 op0
= save_expr (op0
);
5897 if (TREE_SIDE_EFFECTS (op1
))
5898 op1
= save_expr (op1
);
5900 pfn0
= pfn_from_ptrmemfunc (op0
);
5901 pfn0
= cp_fully_fold (pfn0
);
5902 /* Avoid -Waddress warnings (c++/64877). */
5903 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
5904 suppress_warning (pfn0
, OPT_Waddress
);
5905 pfn1
= pfn_from_ptrmemfunc (op1
);
5906 pfn1
= cp_fully_fold (pfn1
);
5907 delta0
= delta_from_ptrmemfunc (op0
);
5908 delta1
= delta_from_ptrmemfunc (op1
);
5909 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
5910 == ptrmemfunc_vbit_in_delta
)
5915 && ((op0.delta == op1.delta)
5916 || (!op0.pfn && op0.delta & 1 == 0
5917 && op1.delta & 1 == 0))
5919 The reason for the `!op0.pfn' bit is that a NULL
5920 pointer-to-member is any member with a zero PFN and
5921 LSB of the DELTA field is 0. */
5923 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
5927 e1
= cp_build_binary_op (location
,
5928 EQ_EXPR
, e1
, integer_zero_node
,
5930 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
5934 e2
= cp_build_binary_op (location
,
5935 EQ_EXPR
, e2
, integer_zero_node
,
5937 e1
= cp_build_binary_op (location
,
5938 TRUTH_ANDIF_EXPR
, e2
, e1
,
5940 e2
= cp_build_binary_op (location
, EQ_EXPR
,
5942 build_zero_cst (TREE_TYPE (pfn0
)),
5944 e2
= cp_build_binary_op (location
,
5945 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
5946 e1
= cp_build_binary_op (location
,
5947 EQ_EXPR
, delta0
, delta1
, complain
);
5948 e1
= cp_build_binary_op (location
,
5949 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
5956 && (!op0.pfn || op0.delta == op1.delta))
5958 The reason for the `!op0.pfn' bit is that a NULL
5959 pointer-to-member is any member with a zero PFN; the
5960 DELTA field is unspecified. */
5962 e1
= cp_build_binary_op (location
,
5963 EQ_EXPR
, delta0
, delta1
, complain
);
5964 e2
= cp_build_binary_op (location
,
5967 build_zero_cst (TREE_TYPE (pfn0
)),
5969 e1
= cp_build_binary_op (location
,
5970 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
5972 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
5973 e
= cp_build_binary_op (location
,
5974 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
5975 if (code
== EQ_EXPR
)
5977 return cp_build_binary_op (location
,
5978 EQ_EXPR
, e
, integer_zero_node
, complain
);
5982 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
5983 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
5985 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
5986 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
5994 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
5995 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
5997 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
5998 result_type
= composite_pointer_type (location
,
5999 type0
, type1
, op0
, op1
,
6000 CPO_COMPARISON
, complain
);
6007 case SPACESHIP_EXPR
:
6008 if (TREE_CODE (orig_op0
) == STRING_CST
6009 || TREE_CODE (orig_op1
) == STRING_CST
)
6011 if (complain
& tf_warning
)
6012 warning_at (location
, OPT_Waddress
,
6013 "comparison with string literal results "
6014 "in unspecified behavior");
6016 else if (warn_array_compare
6017 && TREE_CODE (TREE_TYPE (orig_op0
)) == ARRAY_TYPE
6018 && TREE_CODE (TREE_TYPE (orig_op1
)) == ARRAY_TYPE
6019 && code
!= SPACESHIP_EXPR
6020 && (complain
& tf_warning
))
6021 do_warn_array_compare (location
, code
,
6022 tree_strip_any_location_wrapper (orig_op0
),
6023 tree_strip_any_location_wrapper (orig_op1
));
6025 if (gnu_vector_type_p (type0
) && gnu_vector_type_p (type1
))
6029 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
6031 && !vector_types_compatible_elements_p (type0
, type1
))
6033 if (complain
& tf_error
)
6035 error_at (location
, "comparing vectors with different "
6037 inform (location
, "operand types are %qT and %qT",
6040 return error_mark_node
;
6043 if (maybe_ne (TYPE_VECTOR_SUBPARTS (type0
),
6044 TYPE_VECTOR_SUBPARTS (type1
)))
6046 if (complain
& tf_error
)
6048 error_at (location
, "comparing vectors with different "
6049 "number of elements");
6050 inform (location
, "operand types are %qT and %qT",
6053 return error_mark_node
;
6056 /* It's not precisely specified how the usual arithmetic
6057 conversions apply to the vector types. Here, we use
6058 the unsigned type if one of the operands is signed and
6059 the other one is unsigned. */
6060 if (TYPE_UNSIGNED (type0
) != TYPE_UNSIGNED (type1
))
6062 if (!TYPE_UNSIGNED (type0
))
6063 op0
= build1 (VIEW_CONVERT_EXPR
, type1
, op0
);
6065 op1
= build1 (VIEW_CONVERT_EXPR
, type0
, op1
);
6066 warning_at (location
, OPT_Wsign_compare
, "comparison between "
6067 "types %qT and %qT", type0
, type1
);
6070 if (resultcode
== SPACESHIP_EXPR
)
6072 if (complain
& tf_error
)
6073 sorry_at (location
, "three-way comparison of vectors");
6074 return error_mark_node
;
6077 /* Always construct signed integer vector type. */
6078 intt
= c_common_type_for_size
6079 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (type0
))), 0);
6082 if (complain
& tf_error
)
6083 error_at (location
, "could not find an integer type "
6084 "of the same size as %qT", TREE_TYPE (type0
));
6085 return error_mark_node
;
6087 result_type
= build_opaque_vector_type (intt
,
6088 TYPE_VECTOR_SUBPARTS (type0
));
6089 return build_vec_cmp (resultcode
, result_type
, op0
, op1
);
6091 build_type
= boolean_type_node
;
6092 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
6093 || code0
== ENUMERAL_TYPE
)
6094 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
6095 || code1
== ENUMERAL_TYPE
))
6097 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
6098 result_type
= composite_pointer_type (location
,
6099 type0
, type1
, op0
, op1
,
6100 CPO_COMPARISON
, complain
);
6101 else if ((code0
== POINTER_TYPE
&& null_ptr_cst_p (orig_op1
))
6102 || (code1
== POINTER_TYPE
&& null_ptr_cst_p (orig_op0
))
6103 || (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)))
6105 /* Core Issue 1512 made this ill-formed. */
6106 if (complain
& tf_error
)
6107 error_at (location
, "ordered comparison of pointer with "
6108 "integer zero (%qT and %qT)", type0
, type1
);
6109 return error_mark_node
;
6111 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
6113 result_type
= type0
;
6114 if (complain
& tf_error
)
6115 permerror (location
, "ISO C++ forbids comparison between "
6116 "pointer and integer");
6118 return error_mark_node
;
6120 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
6122 result_type
= type1
;
6123 if (complain
& tf_error
)
6124 permerror (location
, "ISO C++ forbids comparison between "
6125 "pointer and integer");
6127 return error_mark_node
;
6130 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
6131 && !processing_template_decl
6132 && sanitize_flags_p (SANITIZE_POINTER_COMPARE
))
6134 op0
= save_expr (op0
);
6135 op1
= save_expr (op1
);
6137 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_COMPARE
);
6138 instrument_expr
= build_call_expr_loc (location
, tt
, 2, op0
, op1
);
6143 case UNORDERED_EXPR
:
6150 build_type
= integer_type_node
;
6151 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
6153 if (complain
& tf_error
)
6154 error ("unordered comparison on non-floating-point argument");
6155 return error_mark_node
;
6164 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
6165 || code0
== ENUMERAL_TYPE
)
6166 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
6167 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
6168 arithmetic_types_p
= 1;
6171 arithmetic_types_p
= 0;
6172 /* Vector arithmetic is only allowed when both sides are vectors. */
6173 if (gnu_vector_type_p (type0
) && gnu_vector_type_p (type1
))
6175 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
6176 || !vector_types_compatible_elements_p (type0
, type1
))
6178 if (complain
& tf_error
)
6180 /* "location" already embeds the locations of the
6181 operands, so we don't need to add them separately
6183 rich_location
richloc (line_table
, location
);
6184 binary_op_error (&richloc
, code
, type0
, type1
);
6186 return error_mark_node
;
6188 arithmetic_types_p
= 1;
6191 /* Determine the RESULT_TYPE, if it is not already known. */
6193 && arithmetic_types_p
6194 && (shorten
|| common
|| short_compare
))
6196 result_type
= cp_common_type (type0
, type1
);
6197 if (result_type
== error_mark_node
)
6201 if (TREE_CODE (t1
) == COMPLEX_TYPE
)
6202 t1
= TREE_TYPE (t1
);
6203 if (TREE_CODE (t2
) == COMPLEX_TYPE
)
6204 t2
= TREE_TYPE (t2
);
6205 gcc_checking_assert (TREE_CODE (t1
) == REAL_TYPE
6206 && TREE_CODE (t2
) == REAL_TYPE
6207 && (extended_float_type_p (t1
)
6208 || extended_float_type_p (t2
))
6209 && cp_compare_floating_point_conversion_ranks
6211 if (complain
& tf_error
)
6213 rich_location
richloc (line_table
, location
);
6214 binary_op_error (&richloc
, code
, type0
, type1
);
6216 return error_mark_node
;
6218 if (complain
& tf_warning
)
6219 do_warn_double_promotion (result_type
, type0
, type1
,
6220 "implicit conversion from %qH to %qI "
6221 "to match other operand of binary "
6222 "expression", location
);
6223 if (do_warn_enum_conversions (location
, code
, TREE_TYPE (orig_op0
),
6224 TREE_TYPE (orig_op1
), complain
))
6225 return error_mark_node
;
6227 if (may_need_excess_precision
6228 && (orig_type0
!= type0
|| orig_type1
!= type1
)
6229 && build_type
== NULL_TREE
6232 gcc_assert (common
);
6233 semantic_result_type
= cp_common_type (orig_type0
, orig_type1
);
6234 if (semantic_result_type
== error_mark_node
)
6236 tree t1
= orig_type0
;
6237 tree t2
= orig_type1
;
6238 if (TREE_CODE (t1
) == COMPLEX_TYPE
)
6239 t1
= TREE_TYPE (t1
);
6240 if (TREE_CODE (t2
) == COMPLEX_TYPE
)
6241 t2
= TREE_TYPE (t2
);
6242 gcc_checking_assert (TREE_CODE (t1
) == REAL_TYPE
6243 && TREE_CODE (t2
) == REAL_TYPE
6244 && (extended_float_type_p (t1
)
6245 || extended_float_type_p (t2
))
6246 && cp_compare_floating_point_conversion_ranks
6248 if (complain
& tf_error
)
6250 rich_location
richloc (line_table
, location
);
6251 binary_op_error (&richloc
, code
, type0
, type1
);
6253 return error_mark_node
;
6257 if (code
== SPACESHIP_EXPR
)
6259 iloc_sentinel
s (location
);
6261 tree orig_type0
= TREE_TYPE (orig_op0
);
6262 tree_code orig_code0
= TREE_CODE (orig_type0
);
6263 tree orig_type1
= TREE_TYPE (orig_op1
);
6264 tree_code orig_code1
= TREE_CODE (orig_type1
);
6265 if (!result_type
|| result_type
== error_mark_node
)
6267 result_type
= NULL_TREE
;
6268 else if ((orig_code0
== BOOLEAN_TYPE
) != (orig_code1
== BOOLEAN_TYPE
))
6269 /* "If one of the operands is of type bool and the other is not, the
6270 program is ill-formed." */
6271 result_type
= NULL_TREE
;
6272 else if (code0
== POINTER_TYPE
&& orig_code0
!= POINTER_TYPE
6273 && code1
== POINTER_TYPE
&& orig_code1
!= POINTER_TYPE
)
6274 /* We only do array/function-to-pointer conversion if "at least one of
6275 the operands is of pointer type". */
6276 result_type
= NULL_TREE
;
6277 else if (TYPE_PTRFN_P (result_type
) || NULLPTR_TYPE_P (result_type
))
6278 /* <=> no longer supports equality relations. */
6279 result_type
= NULL_TREE
;
6280 else if (orig_code0
== ENUMERAL_TYPE
&& orig_code1
== ENUMERAL_TYPE
6281 && !(same_type_ignoring_top_level_qualifiers_p
6282 (orig_type0
, orig_type1
)))
6283 /* "If both operands have arithmetic types, or one operand has integral
6284 type and the other operand has unscoped enumeration type, the usual
6285 arithmetic conversions are applied to the operands." So we don't do
6286 arithmetic conversions if the operands both have enumeral type. */
6287 result_type
= NULL_TREE
;
6288 else if ((orig_code0
== ENUMERAL_TYPE
&& orig_code1
== REAL_TYPE
)
6289 || (orig_code0
== REAL_TYPE
&& orig_code1
== ENUMERAL_TYPE
))
6290 /* [depr.arith.conv.enum]: Three-way comparisons between such operands
6291 [where one is of enumeration type and the other is of a different
6292 enumeration type or a floating-point type] are ill-formed. */
6293 result_type
= NULL_TREE
;
6297 build_type
= spaceship_type (result_type
, complain
);
6298 if (build_type
== error_mark_node
)
6299 return error_mark_node
;
6302 if (result_type
&& arithmetic_types_p
)
6304 /* If a narrowing conversion is required, other than from an integral
6305 type to a floating point type, the program is ill-formed. */
6307 if (TREE_CODE (result_type
) == REAL_TYPE
6308 && CP_INTEGRAL_TYPE_P (orig_type0
))
6310 else if (!check_narrowing (result_type
, orig_op0
, complain
))
6312 if (TREE_CODE (result_type
) == REAL_TYPE
6313 && CP_INTEGRAL_TYPE_P (orig_type1
))
6315 else if (!check_narrowing (result_type
, orig_op1
, complain
))
6317 if (!ok
&& !(complain
& tf_error
))
6318 return error_mark_node
;
6324 if (complain
& tf_error
)
6326 binary_op_rich_location
richloc (location
,
6327 orig_op0
, orig_op1
, true);
6329 "invalid operands of types %qT and %qT to binary %qO",
6330 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
6332 return error_mark_node
;
6335 /* If we're in a template, the only thing we need to know is the
6337 if (processing_template_decl
)
6339 /* Since the middle-end checks the type when doing a build2, we
6340 need to build the tree in pieces. This built tree will never
6341 get out of the front-end as we replace it when instantiating
6343 tree tmp
= build2 (resultcode
,
6344 build_type
? build_type
: result_type
,
6346 TREE_OPERAND (tmp
, 0) = op0
;
6347 if (semantic_result_type
)
6348 tmp
= build1 (EXCESS_PRECISION_EXPR
, semantic_result_type
, tmp
);
6352 /* Remember the original type; RESULT_TYPE might be changed later on
6353 by shorten_binary_op. */
6354 tree orig_type
= result_type
;
6356 if (arithmetic_types_p
)
6358 bool first_complex
= (code0
== COMPLEX_TYPE
);
6359 bool second_complex
= (code1
== COMPLEX_TYPE
);
6360 int none_complex
= (!first_complex
&& !second_complex
);
6362 /* Adapted from patch for c/24581. */
6363 if (first_complex
!= second_complex
6364 && (code
== PLUS_EXPR
6365 || code
== MINUS_EXPR
6366 || code
== MULT_EXPR
6367 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
6368 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
6369 && flag_signed_zeros
)
6371 /* An operation on mixed real/complex operands must be
6372 handled specially, but the language-independent code can
6373 more easily optimize the plain complex arithmetic if
6374 -fno-signed-zeros. */
6375 tree real_type
= TREE_TYPE (result_type
);
6379 if (TREE_TYPE (op0
) != result_type
)
6380 op0
= cp_convert_and_check (result_type
, op0
, complain
);
6381 if (TREE_TYPE (op1
) != real_type
)
6382 op1
= cp_convert_and_check (real_type
, op1
, complain
);
6386 if (TREE_TYPE (op0
) != real_type
)
6387 op0
= cp_convert_and_check (real_type
, op0
, complain
);
6388 if (TREE_TYPE (op1
) != result_type
)
6389 op1
= cp_convert_and_check (result_type
, op1
, complain
);
6391 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
6392 return error_mark_node
;
6395 op0
= save_expr (op0
);
6396 real
= cp_build_unary_op (REALPART_EXPR
, op0
, true, complain
);
6397 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, true, complain
);
6401 case TRUNC_DIV_EXPR
:
6402 op1
= save_expr (op1
);
6403 imag
= build2 (resultcode
, real_type
, imag
, op1
);
6407 real
= build2 (resultcode
, real_type
, real
, op1
);
6415 op1
= save_expr (op1
);
6416 real
= cp_build_unary_op (REALPART_EXPR
, op1
, true, complain
);
6417 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, true, complain
);
6421 op0
= save_expr (op0
);
6422 imag
= build2 (resultcode
, real_type
, op0
, imag
);
6425 real
= build2 (resultcode
, real_type
, op0
, real
);
6428 real
= build2 (resultcode
, real_type
, op0
, real
);
6429 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
6435 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
6436 if (semantic_result_type
)
6437 result
= build1 (EXCESS_PRECISION_EXPR
, semantic_result_type
,
6442 /* For certain operations (which identify themselves by shorten != 0)
6443 if both args were extended from the same smaller type,
6444 do the arithmetic in that type and then extend.
6446 shorten !=0 and !=1 indicates a bitwise operation.
6447 For them, this optimization is safe only if
6448 both args are zero-extended or both are sign-extended.
6449 Otherwise, we might change the result.
6450 E.g., (short)-1 | (unsigned short)-1 is (int)-1
6451 but calculated in (unsigned short) it would be (unsigned short)-1. */
6453 if (shorten
&& none_complex
)
6455 final_type
= result_type
;
6456 result_type
= shorten_binary_op (result_type
, op0
, op1
,
6460 /* Shifts can be shortened if shifting right. */
6465 tree arg0
= get_narrower (op0
, &unsigned_arg
);
6466 /* We're not really warning here but when we set short_shift we
6467 used fold_for_warn to fold the operand. */
6468 tree const_op1
= fold_for_warn (op1
);
6470 final_type
= result_type
;
6472 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
6473 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
6475 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
6476 && tree_int_cst_sgn (const_op1
) > 0
6477 /* We can shorten only if the shift count is less than the
6478 number of bits in the smaller type size. */
6479 && compare_tree_int (const_op1
,
6480 TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
6481 /* We cannot drop an unsigned shift after sign-extension. */
6482 && (!TYPE_UNSIGNED (final_type
) || unsigned_arg
))
6484 /* Do an unsigned shift if the operand was zero-extended. */
6486 = c_common_signed_or_unsigned_type (unsigned_arg
,
6488 /* Convert value-to-be-shifted to that type. */
6489 if (TREE_TYPE (op0
) != result_type
)
6490 op0
= convert (result_type
, op0
);
6495 /* Comparison operations are shortened too but differently.
6496 They identify themselves by setting short_compare = 1. */
6500 /* We call shorten_compare only for diagnostics. */
6501 tree xop0
= fold_simple (op0
);
6502 tree xop1
= fold_simple (op1
);
6503 tree xresult_type
= result_type
;
6504 enum tree_code xresultcode
= resultcode
;
6505 shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
6509 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
6510 && warn_sign_compare
6511 /* Do not warn until the template is instantiated; we cannot
6512 bound the ranges of the arguments until that point. */
6513 && !processing_template_decl
6514 && (complain
& tf_warning
)
6515 && c_inhibit_evaluation_warnings
== 0
6516 /* Even unsigned enum types promote to signed int. We don't
6517 want to issue -Wsign-compare warnings for this case. */
6518 && !enum_cast_to_int (orig_op0
)
6519 && !enum_cast_to_int (orig_op1
))
6521 warn_for_sign_compare (location
, orig_op0
, orig_op1
, op0
, op1
,
6522 result_type
, resultcode
);
6526 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
6527 Then the expression will be built.
6528 It will be given type FINAL_TYPE if that is nonzero;
6529 otherwise, it will be given type RESULT_TYPE. */
6532 warning_sentinel
w (warn_sign_conversion
, short_compare
);
6533 if (!same_type_p (TREE_TYPE (op0
), result_type
))
6534 op0
= cp_convert_and_check (result_type
, op0
, complain
);
6535 if (!same_type_p (TREE_TYPE (op1
), result_type
))
6536 op1
= cp_convert_and_check (result_type
, op1
, complain
);
6538 if (op0
== error_mark_node
|| op1
== error_mark_node
)
6539 return error_mark_node
;
6542 if (build_type
== NULL_TREE
)
6543 build_type
= result_type
;
6546 && flag_strong_eval_order
== 2
6547 && TREE_SIDE_EFFECTS (op1
)
6548 && !processing_template_decl
)
6550 /* In C++17, in both op0 << op1 and op0 >> op1 op0 is sequenced before
6551 op1, so if op1 has side-effects, use SAVE_EXPR around op0. */
6552 op0
= cp_save_expr (op0
);
6553 instrument_expr
= op0
;
6556 if (sanitize_flags_p ((SANITIZE_SHIFT
6558 | SANITIZE_FLOAT_DIVIDE
6559 | SANITIZE_SI_OVERFLOW
))
6560 && current_function_decl
!= NULL_TREE
6561 && !processing_template_decl
6562 && (doing_div_or_mod
|| doing_shift
))
6564 /* OP0 and/or OP1 might have side-effects. */
6565 op0
= cp_save_expr (op0
);
6566 op1
= cp_save_expr (op1
);
6567 op0
= fold_non_dependent_expr (op0
, complain
);
6568 op1
= fold_non_dependent_expr (op1
, complain
);
6569 tree instrument_expr1
= NULL_TREE
;
6570 if (doing_div_or_mod
6571 && sanitize_flags_p (SANITIZE_DIVIDE
6572 | SANITIZE_FLOAT_DIVIDE
6573 | SANITIZE_SI_OVERFLOW
))
6575 /* For diagnostics we want to use the promoted types without
6576 shorten_binary_op. So convert the arguments to the
6577 original result_type. */
6580 if (TREE_TYPE (cop0
) != orig_type
)
6581 cop0
= cp_convert (orig_type
, op0
, complain
);
6582 if (TREE_TYPE (cop1
) != orig_type
)
6583 cop1
= cp_convert (orig_type
, op1
, complain
);
6584 instrument_expr1
= ubsan_instrument_division (location
, cop0
, cop1
);
6586 else if (doing_shift
&& sanitize_flags_p (SANITIZE_SHIFT
))
6587 instrument_expr1
= ubsan_instrument_shift (location
, code
, op0
, op1
);
6588 if (instrument_expr
!= NULL
)
6589 instrument_expr
= add_stmt_to_compound (instrument_expr
,
6592 instrument_expr
= instrument_expr1
;
6595 result
= build2_loc (location
, resultcode
, build_type
, op0
, op1
);
6596 if (final_type
!= 0)
6597 result
= cp_convert (final_type
, result
, complain
);
6599 if (instrument_expr
!= NULL
)
6600 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
6601 instrument_expr
, result
);
6603 if (resultcode
== SPACESHIP_EXPR
&& !processing_template_decl
)
6604 result
= get_target_expr (result
, complain
);
6606 if (semantic_result_type
)
6607 result
= build1 (EXCESS_PRECISION_EXPR
, semantic_result_type
, result
);
6609 if (!c_inhibit_evaluation_warnings
)
6611 if (!processing_template_decl
)
6613 op0
= cp_fully_fold (op0
);
6614 /* Only consider the second argument if the first isn't overflowed. */
6615 if (!CONSTANT_CLASS_P (op0
) || TREE_OVERFLOW_P (op0
))
6617 op1
= cp_fully_fold (op1
);
6618 if (!CONSTANT_CLASS_P (op1
) || TREE_OVERFLOW_P (op1
))
6621 else if (!CONSTANT_CLASS_P (op0
) || !CONSTANT_CLASS_P (op1
)
6622 || TREE_OVERFLOW_P (op0
) || TREE_OVERFLOW_P (op1
))
6625 tree result_ovl
= fold_build2 (resultcode
, build_type
, op0
, op1
);
6626 if (TREE_OVERFLOW_P (result_ovl
))
6627 overflow_warning (location
, result_ovl
);
6633 /* Build a VEC_PERM_EXPR.
6634 This is a simple wrapper for c_build_vec_perm_expr. */
6636 build_x_vec_perm_expr (location_t loc
,
6637 tree arg0
, tree arg1
, tree arg2
,
6638 tsubst_flags_t complain
)
6640 tree orig_arg0
= arg0
;
6641 tree orig_arg1
= arg1
;
6642 tree orig_arg2
= arg2
;
6643 if (processing_template_decl
)
6645 if (type_dependent_expression_p (arg0
)
6646 || type_dependent_expression_p (arg1
)
6647 || type_dependent_expression_p (arg2
))
6648 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
6650 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
6651 if (processing_template_decl
&& exp
!= error_mark_node
)
6652 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
6653 orig_arg1
, orig_arg2
);
6657 /* Build a VEC_PERM_EXPR.
6658 This is a simple wrapper for c_build_shufflevector. */
6660 build_x_shufflevector (location_t loc
, vec
<tree
, va_gc
> *args
,
6661 tsubst_flags_t complain
)
6663 tree arg0
= (*args
)[0];
6664 tree arg1
= (*args
)[1];
6665 if (processing_template_decl
)
6667 for (unsigned i
= 0; i
< args
->length (); ++i
)
6669 ? type_dependent_expression_p ((*args
)[i
])
6670 : instantiation_dependent_expression_p ((*args
)[i
]))
6672 tree exp
= build_min_nt_call_vec (NULL
, args
);
6673 CALL_EXPR_IFN (exp
) = IFN_SHUFFLEVECTOR
;
6677 auto_vec
<tree
, 16> mask
;
6678 for (unsigned i
= 2; i
< args
->length (); ++i
)
6680 tree idx
= fold_non_dependent_expr ((*args
)[i
], complain
);
6681 mask
.safe_push (idx
);
6683 tree exp
= c_build_shufflevector (loc
, arg0
, arg1
, mask
, complain
& tf_error
);
6684 if (processing_template_decl
&& exp
!= error_mark_node
)
6686 exp
= build_min_non_dep_call_vec (exp
, NULL
, args
);
6687 CALL_EXPR_IFN (exp
) = IFN_SHUFFLEVECTOR
;
6692 /* Return a tree for the sum or difference (RESULTCODE says which)
6693 of pointer PTROP and integer INTOP. */
6696 cp_pointer_int_sum (location_t loc
, enum tree_code resultcode
, tree ptrop
,
6697 tree intop
, tsubst_flags_t complain
)
6699 tree res_type
= TREE_TYPE (ptrop
);
6701 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
6702 in certain circumstance (when it's valid to do so). So we need
6703 to make sure it's complete. We don't need to check here, if we
6704 can actually complete it at all, as those checks will be done in
6705 pointer_int_sum() anyway. */
6706 complete_type (TREE_TYPE (res_type
));
6708 return pointer_int_sum (loc
, resultcode
, ptrop
,
6709 intop
, complain
& tf_warning_or_error
);
6712 /* Return a tree for the difference of pointers OP0 and OP1.
6713 The resulting tree has type int. If POINTER_SUBTRACT sanitization is
6714 enabled, assign to INSTRUMENT_EXPR call to libsanitizer. */
6717 pointer_diff (location_t loc
, tree op0
, tree op1
, tree ptrtype
,
6718 tsubst_flags_t complain
, tree
*instrument_expr
)
6720 tree result
, inttype
;
6721 tree restype
= ptrdiff_type_node
;
6722 tree target_type
= TREE_TYPE (ptrtype
);
6724 if (!complete_type_or_maybe_complain (target_type
, NULL_TREE
, complain
))
6725 return error_mark_node
;
6727 if (VOID_TYPE_P (target_type
))
6729 if (complain
& tf_error
)
6730 permerror (loc
, "ISO C++ forbids using pointer of "
6731 "type %<void *%> in subtraction");
6733 return error_mark_node
;
6735 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
6737 if (complain
& tf_error
)
6738 permerror (loc
, "ISO C++ forbids using pointer to "
6739 "a function in subtraction");
6741 return error_mark_node
;
6743 if (TREE_CODE (target_type
) == METHOD_TYPE
)
6745 if (complain
& tf_error
)
6746 permerror (loc
, "ISO C++ forbids using pointer to "
6747 "a method in subtraction");
6749 return error_mark_node
;
6751 else if (!verify_type_context (loc
, TCTX_POINTER_ARITH
,
6752 TREE_TYPE (TREE_TYPE (op0
)),
6753 !(complain
& tf_error
))
6754 || !verify_type_context (loc
, TCTX_POINTER_ARITH
,
6755 TREE_TYPE (TREE_TYPE (op1
)),
6756 !(complain
& tf_error
)))
6757 return error_mark_node
;
6759 /* Determine integer type result of the subtraction. This will usually
6760 be the same as the result type (ptrdiff_t), but may need to be a wider
6761 type if pointers for the address space are wider than ptrdiff_t. */
6762 if (TYPE_PRECISION (restype
) < TYPE_PRECISION (TREE_TYPE (op0
)))
6763 inttype
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op0
)), 0);
6767 if (!processing_template_decl
6768 && sanitize_flags_p (SANITIZE_POINTER_SUBTRACT
))
6770 op0
= save_expr (op0
);
6771 op1
= save_expr (op1
);
6773 tree tt
= builtin_decl_explicit (BUILT_IN_ASAN_POINTER_SUBTRACT
);
6774 *instrument_expr
= build_call_expr_loc (loc
, tt
, 2, op0
, op1
);
6777 /* First do the subtraction, then build the divide operator
6778 and only convert at the very end.
6779 Do not do default conversions in case restype is a short type. */
6781 /* POINTER_DIFF_EXPR requires a signed integer type of the same size as
6782 pointers. If some platform cannot provide that, or has a larger
6783 ptrdiff_type to support differences larger than half the address
6784 space, cast the pointers to some larger integer type and do the
6785 computations in that type. */
6786 if (TYPE_PRECISION (inttype
) > TYPE_PRECISION (TREE_TYPE (op0
)))
6787 op0
= cp_build_binary_op (loc
,
6789 cp_convert (inttype
, op0
, complain
),
6790 cp_convert (inttype
, op1
, complain
),
6793 op0
= build2_loc (loc
, POINTER_DIFF_EXPR
, inttype
, op0
, op1
);
6795 /* This generates an error if op1 is a pointer to an incomplete type. */
6796 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
6798 if (complain
& tf_error
)
6799 error_at (loc
, "invalid use of a pointer to an incomplete type in "
6800 "pointer arithmetic");
6802 return error_mark_node
;
6805 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
6807 if (complain
& tf_error
)
6808 error_at (loc
, "arithmetic on pointer to an empty aggregate");
6810 return error_mark_node
;
6813 op1
= (TYPE_PTROB_P (ptrtype
)
6814 ? size_in_bytes_loc (loc
, target_type
)
6815 : integer_one_node
);
6817 /* Do the division. */
6819 result
= build2_loc (loc
, EXACT_DIV_EXPR
, inttype
, op0
,
6820 cp_convert (inttype
, op1
, complain
));
6821 return cp_convert (restype
, result
, complain
);
6824 /* Construct and perhaps optimize a tree representation
6825 for a unary operation. CODE, a tree_code, specifies the operation
6826 and XARG is the operand. */
6829 build_x_unary_op (location_t loc
, enum tree_code code
, cp_expr xarg
,
6830 tree lookups
, tsubst_flags_t complain
)
6832 tree orig_expr
= xarg
;
6835 tree overload
= NULL_TREE
;
6837 if (processing_template_decl
)
6839 if (type_dependent_expression_p (xarg
))
6841 tree e
= build_min_nt_loc (loc
, code
, xarg
.get_value (), NULL_TREE
);
6842 TREE_TYPE (e
) = build_dependent_operator_type (lookups
, code
, false);
6849 /* [expr.unary.op] says:
6851 The address of an object of incomplete type can be taken.
6853 (And is just the ordinary address operator, not an overloaded
6854 "operator &".) However, if the type is a template
6855 specialization, we must complete the type at this point so that
6856 an overloaded "operator &" will be available if required. */
6857 if (code
== ADDR_EXPR
6858 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
6859 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
6860 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
6861 || (TREE_CODE (xarg
) == OFFSET_REF
)))
6862 /* Don't look for a function. */;
6864 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
6865 NULL_TREE
, lookups
, &overload
, complain
);
6867 if (!exp
&& code
== ADDR_EXPR
)
6869 if (is_overloaded_fn (xarg
))
6871 tree fn
= get_first_fn (xarg
);
6872 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
6874 if (complain
& tf_error
)
6875 error_at (loc
, DECL_CONSTRUCTOR_P (fn
)
6876 ? G_("taking address of constructor %qD")
6877 : G_("taking address of destructor %qD"),
6879 return error_mark_node
;
6883 /* A pointer to member-function can be formed only by saying
6885 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
6886 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
6888 if (TREE_CODE (xarg
) != OFFSET_REF
6889 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
6891 if (complain
& tf_error
)
6893 error_at (loc
, "invalid use of %qE to form a "
6894 "pointer-to-member-function", xarg
.get_value ());
6895 if (TREE_CODE (xarg
) != OFFSET_REF
)
6896 inform (loc
, " a qualified-id is required");
6898 return error_mark_node
;
6902 if (complain
& tf_error
)
6903 error_at (loc
, "parentheses around %qE cannot be used to "
6904 "form a pointer-to-member-function",
6907 return error_mark_node
;
6908 PTRMEM_OK_P (xarg
) = 1;
6912 if (TREE_CODE (xarg
) == OFFSET_REF
)
6914 ptrmem
= PTRMEM_OK_P (xarg
);
6916 if (!ptrmem
&& !flag_ms_extensions
6917 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
6919 /* A single non-static member, make sure we don't allow a
6920 pointer-to-member. */
6921 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
6922 TREE_OPERAND (xarg
, 0),
6923 ovl_make (TREE_OPERAND (xarg
, 1)));
6924 PTRMEM_OK_P (xarg
) = ptrmem
;
6928 exp
= cp_build_addr_expr_strict (xarg
, complain
);
6930 if (TREE_CODE (exp
) == PTRMEM_CST
)
6931 PTRMEM_CST_LOCATION (exp
) = loc
;
6933 protected_set_expr_location (exp
, loc
);
6936 if (processing_template_decl
&& exp
!= error_mark_node
)
6938 if (overload
!= NULL_TREE
)
6939 return (build_min_non_dep_op_overload
6940 (code
, exp
, overload
, orig_expr
, integer_zero_node
));
6942 exp
= build_min_non_dep (code
, exp
, orig_expr
,
6943 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
6945 if (TREE_CODE (exp
) == ADDR_EXPR
)
6946 PTRMEM_OK_P (exp
) = ptrmem
;
6950 /* Construct and perhaps optimize a tree representation
6951 for __builtin_addressof operation. ARG specifies the operand. */
6954 cp_build_addressof (location_t loc
, tree arg
, tsubst_flags_t complain
)
6956 tree orig_expr
= arg
;
6958 if (processing_template_decl
)
6960 if (type_dependent_expression_p (arg
))
6961 return build_min_nt_loc (loc
, ADDRESSOF_EXPR
, arg
, NULL_TREE
);
6964 tree exp
= cp_build_addr_expr_strict (arg
, complain
);
6966 if (processing_template_decl
&& exp
!= error_mark_node
)
6967 exp
= build_min_non_dep (ADDRESSOF_EXPR
, exp
, orig_expr
, NULL_TREE
);
6971 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
6972 constants, where a null value is represented by an INTEGER_CST of
6976 cp_truthvalue_conversion (tree expr
, tsubst_flags_t complain
)
6978 tree type
= TREE_TYPE (expr
);
6979 location_t loc
= cp_expr_loc_or_input_loc (expr
);
6980 if (TYPE_PTR_OR_PTRMEM_P (type
)
6981 /* Avoid ICE on invalid use of non-static member function. */
6982 || TREE_CODE (expr
) == FUNCTION_DECL
)
6983 return cp_build_binary_op (loc
, NE_EXPR
, expr
, nullptr_node
, complain
);
6985 return c_common_truthvalue_conversion (loc
, expr
);
6988 /* Returns EXPR contextually converted to bool. */
6991 contextual_conv_bool (tree expr
, tsubst_flags_t complain
)
6993 return perform_implicit_conversion_flags (boolean_type_node
, expr
,
6994 complain
, LOOKUP_NORMAL
);
6997 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. This
6998 is a low-level function; most callers should use maybe_convert_cond. */
7001 condition_conversion (tree expr
)
7003 tree t
= contextual_conv_bool (expr
, tf_warning_or_error
);
7004 if (!processing_template_decl
)
7005 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
7009 /* Returns the address of T. This function will fold away
7010 ADDR_EXPR of INDIRECT_REF. This is only for low-level usage;
7011 most places should use cp_build_addr_expr instead. */
7014 build_address (tree t
)
7016 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
7017 return error_mark_node
;
7018 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
7019 || processing_template_decl
);
7020 t
= build_fold_addr_expr_loc (EXPR_LOCATION (t
), t
);
7021 if (TREE_CODE (t
) != ADDR_EXPR
)
7026 /* Return a NOP_EXPR converting EXPR to TYPE. */
7029 build_nop (tree type
, tree expr
)
7031 if (type
== error_mark_node
|| error_operand_p (expr
))
7033 return build1_loc (EXPR_LOCATION (expr
), NOP_EXPR
, type
, expr
);
7036 /* Take the address of ARG, whatever that means under C++ semantics.
7037 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
7038 and class rvalues as well.
7040 Nothing should call this function directly; instead, callers should use
7041 cp_build_addr_expr or cp_build_addr_expr_strict. */
7044 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
7049 if (!arg
|| error_operand_p (arg
))
7050 return error_mark_node
;
7052 arg
= mark_lvalue_use (arg
);
7053 if (error_operand_p (arg
))
7054 return error_mark_node
;
7056 argtype
= lvalue_type (arg
);
7057 location_t loc
= cp_expr_loc_or_input_loc (arg
);
7059 gcc_assert (!(identifier_p (arg
) && IDENTIFIER_ANY_OP_P (arg
)));
7061 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
7062 && !really_overloaded_fn (arg
))
7064 /* They're trying to take the address of a unique non-static
7065 member function. This is ill-formed (except in MS-land),
7066 but let's try to DTRT.
7067 Note: We only handle unique functions here because we don't
7068 want to complain if there's a static overload; non-unique
7069 cases will be handled by instantiate_type. But we need to
7070 handle this case here to allow casts on the resulting PMF.
7071 We could defer this in non-MS mode, but it's easier to give
7072 a useful error here. */
7074 /* Inside constant member functions, the `this' pointer
7075 contains an extra const qualifier. TYPE_MAIN_VARIANT
7076 is used here to remove this const from the diagnostics
7077 and the created OFFSET_REF. */
7078 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
7079 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
7080 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
7081 return error_mark_node
;
7083 if (! flag_ms_extensions
)
7085 tree name
= DECL_NAME (fn
);
7086 if (!(complain
& tf_error
))
7087 return error_mark_node
;
7088 else if (current_class_type
7089 && TREE_OPERAND (arg
, 0) == current_class_ref
)
7090 /* An expression like &memfn. */
7092 "ISO C++ forbids taking the address of an unqualified"
7093 " or parenthesized non-static member function to form"
7094 " a pointer to member function. Say %<&%T::%D%>",
7098 "ISO C++ forbids taking the address of a bound member"
7099 " function to form a pointer to member function."
7103 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
7106 /* Uninstantiated types are all functions. Taking the
7107 address of a function is a no-op, so just return the
7109 if (type_unknown_p (arg
))
7110 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
7112 if (TREE_CODE (arg
) == OFFSET_REF
)
7113 /* We want a pointer to member; bypass all the code for actually taking
7114 the address of something. */
7117 /* Anything not already handled and not a true memory reference
7119 if (!FUNC_OR_METHOD_TYPE_P (argtype
))
7121 cp_lvalue_kind kind
= lvalue_kind (arg
);
7122 if (kind
== clk_none
)
7124 if (complain
& tf_error
)
7125 lvalue_error (loc
, lv_addressof
);
7126 return error_mark_node
;
7128 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
7130 if (!(complain
& tf_error
))
7131 return error_mark_node
;
7132 /* Make this a permerror because we used to accept it. */
7133 permerror (loc
, "taking address of rvalue");
7137 if (TYPE_REF_P (argtype
))
7139 tree type
= build_pointer_type (TREE_TYPE (argtype
));
7140 arg
= build1 (CONVERT_EXPR
, type
, arg
);
7143 else if (pedantic
&& DECL_MAIN_P (tree_strip_any_location_wrapper (arg
)))
7146 /* Apparently a lot of autoconf scripts for C++ packages do this,
7147 so only complain if -Wpedantic. */
7148 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
7149 pedwarn (loc
, OPT_Wpedantic
,
7150 "ISO C++ forbids taking address of function %<::main%>");
7151 else if (flag_pedantic_errors
)
7152 return error_mark_node
;
7155 /* Let &* cancel out to simplify resulting code. */
7156 if (INDIRECT_REF_P (arg
))
7158 arg
= TREE_OPERAND (arg
, 0);
7159 if (TYPE_REF_P (TREE_TYPE (arg
)))
7161 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
7162 arg
= build1 (CONVERT_EXPR
, type
, arg
);
7165 /* Don't let this be an lvalue. */
7170 /* Handle complex lvalues (when permitted)
7171 by reduction to simpler cases. */
7172 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
7176 switch (TREE_CODE (arg
))
7180 case FIX_TRUNC_EXPR
:
7181 /* We should have handled this above in the lvalue_kind check. */
7186 arg
= BASELINK_FUNCTIONS (arg
);
7190 arg
= OVL_FIRST (arg
);
7195 /* Turn a reference to a non-static data member into a
7196 pointer-to-member. */
7201 gcc_assert (PTRMEM_OK_P (arg
));
7203 t
= TREE_OPERAND (arg
, 1);
7204 if (TYPE_REF_P (TREE_TYPE (t
)))
7206 if (complain
& tf_error
)
7208 "cannot create pointer to reference member %qD", t
);
7209 return error_mark_node
;
7212 /* Forming a pointer-to-member is a use of non-pure-virtual fns. */
7213 if (TREE_CODE (t
) == FUNCTION_DECL
7214 && !DECL_PURE_VIRTUAL_P (t
)
7215 && !mark_used (t
, complain
) && !(complain
& tf_error
))
7216 return error_mark_node
;
7218 type
= build_ptrmem_type (context_for_name_lookup (t
),
7220 t
= make_ptrmem_cst (type
, t
);
7228 if (argtype
!= error_mark_node
)
7229 argtype
= build_pointer_type (argtype
);
7231 if (bitfield_p (arg
))
7233 if (complain
& tf_error
)
7234 error_at (loc
, "attempt to take address of bit-field");
7235 return error_mark_node
;
7238 /* In a template, we are processing a non-dependent expression
7239 so we can just form an ADDR_EXPR with the correct type. */
7240 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
7242 if (!mark_single_function (arg
, complain
))
7243 return error_mark_node
;
7244 val
= build_address (arg
);
7245 if (TREE_CODE (arg
) == OFFSET_REF
)
7246 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
7248 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
7250 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
7252 /* We can only get here with a single static member
7254 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7255 && DECL_STATIC_FUNCTION_P (fn
));
7256 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
7257 return error_mark_node
;
7258 val
= build_address (fn
);
7259 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
7260 /* Do not lose object's side effects. */
7261 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
7262 TREE_OPERAND (arg
, 0), val
);
7266 tree object
= TREE_OPERAND (arg
, 0);
7267 tree field
= TREE_OPERAND (arg
, 1);
7268 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7269 (TREE_TYPE (object
), decl_type_context (field
)));
7270 val
= build_address (arg
);
7273 if (TYPE_PTR_P (argtype
)
7274 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
7276 build_ptrmemfunc_type (argtype
);
7277 val
= build_ptrmemfunc (argtype
, val
, 0,
7282 /* Ensure we have EXPR_LOCATION set for possible later diagnostics. */
7283 if (TREE_CODE (val
) == ADDR_EXPR
7284 && TREE_CODE (TREE_OPERAND (val
, 0)) == FUNCTION_DECL
)
7285 SET_EXPR_LOCATION (val
, input_location
);
7290 /* Take the address of ARG if it has one, even if it's an rvalue. */
7293 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
7295 return cp_build_addr_expr_1 (arg
, 0, complain
);
7298 /* Take the address of ARG, but only if it's an lvalue. */
7301 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
7303 return cp_build_addr_expr_1 (arg
, 1, complain
);
7306 /* C++: Must handle pointers to members.
7308 Perhaps type instantiation should be extended to handle conversion
7309 from aggregates to types we don't yet know we want? (Or are those
7310 cases typically errors which should be reported?)
7312 NOCONVERT suppresses the default promotions (such as from short to int). */
7315 cp_build_unary_op (enum tree_code code
, tree xarg
, bool noconvert
,
7316 tsubst_flags_t complain
)
7318 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
7320 location_t location
= cp_expr_loc_or_input_loc (arg
);
7322 tree eptype
= NULL_TREE
;
7323 const char *errstring
= NULL
;
7325 const char *invalid_op_diag
;
7327 if (!arg
|| error_operand_p (arg
))
7328 return error_mark_node
;
7330 arg
= resolve_nondeduced_context (arg
, complain
);
7332 if ((invalid_op_diag
7333 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
7338 if (complain
& tf_error
)
7339 error (invalid_op_diag
);
7340 return error_mark_node
;
7343 if (TREE_CODE (arg
) == EXCESS_PRECISION_EXPR
)
7345 eptype
= TREE_TYPE (arg
);
7346 arg
= TREE_OPERAND (arg
, 0);
7351 case UNARY_PLUS_EXPR
:
7354 int flags
= WANT_ARITH
| WANT_ENUM
;
7355 /* Unary plus (but not unary minus) is allowed on pointers. */
7356 if (code
== UNARY_PLUS_EXPR
)
7357 flags
|= WANT_POINTER
;
7358 arg
= build_expr_type_conversion (flags
, arg
, true);
7360 errstring
= (code
== NEGATE_EXPR
7361 ? _("wrong type argument to unary minus")
7362 : _("wrong type argument to unary plus"));
7365 if (!noconvert
&& INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg
)))
7366 arg
= cp_perform_integral_promotions (arg
, complain
);
7368 /* Make sure the result is not an lvalue: a unary plus or minus
7369 expression is always a rvalue. */
7376 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
7381 arg
= cp_default_conversion (arg
, complain
);
7382 if (arg
== error_mark_node
)
7383 return error_mark_node
;
7386 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
7387 | WANT_VECTOR_OR_COMPLEX
,
7389 errstring
= _("wrong type argument to bit-complement");
7390 else if (!noconvert
&& INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg
)))
7392 /* Warn if the expression has boolean value. */
7393 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
7394 && (complain
& tf_warning
)
7395 && warning_at (location
, OPT_Wbool_operation
,
7396 "%<~%> on an expression of type %<bool%>"))
7397 inform (location
, "did you mean to use logical not (%<!%>)?");
7398 arg
= cp_perform_integral_promotions (arg
, complain
);
7400 else if (!noconvert
&& VECTOR_TYPE_P (TREE_TYPE (arg
)))
7401 arg
= mark_rvalue_use (arg
);
7405 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
7406 errstring
= _("wrong type argument to abs");
7407 else if (!noconvert
)
7409 arg
= cp_default_conversion (arg
, complain
);
7410 if (arg
== error_mark_node
)
7411 return error_mark_node
;
7416 /* Conjugating a real value is a no-op, but allow it anyway. */
7417 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
7418 errstring
= _("wrong type argument to conjugation");
7419 else if (!noconvert
)
7421 arg
= cp_default_conversion (arg
, complain
);
7422 if (arg
== error_mark_node
)
7423 return error_mark_node
;
7427 case TRUTH_NOT_EXPR
:
7428 if (gnu_vector_type_p (TREE_TYPE (arg
)))
7429 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
7430 build_zero_cst (TREE_TYPE (arg
)), complain
);
7431 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
7433 if (arg
!= error_mark_node
)
7435 if (processing_template_decl
)
7436 return build1_loc (location
, TRUTH_NOT_EXPR
, boolean_type_node
, arg
);
7437 val
= invert_truthvalue_loc (location
, arg
);
7438 if (obvalue_p (val
))
7439 val
= non_lvalue_loc (location
, val
);
7442 errstring
= _("in argument to unary !");
7450 val
= build_real_imag_expr (input_location
, code
, arg
);
7451 if (eptype
&& TREE_CODE (eptype
) == COMPLEX_EXPR
)
7452 val
= build1_loc (input_location
, EXCESS_PRECISION_EXPR
,
7453 TREE_TYPE (eptype
), val
);
7456 case PREINCREMENT_EXPR
:
7457 case POSTINCREMENT_EXPR
:
7458 case PREDECREMENT_EXPR
:
7459 case POSTDECREMENT_EXPR
:
7460 /* Handle complex lvalues (when permitted)
7461 by reduction to simpler cases. */
7463 val
= unary_complex_lvalue (code
, arg
);
7465 goto return_build_unary_op
;
7467 arg
= mark_lvalue_use (arg
);
7469 /* Increment or decrement the real part of the value,
7470 and don't change the imaginary part. */
7471 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
7475 arg
= cp_stabilize_reference (arg
);
7476 real
= cp_build_unary_op (REALPART_EXPR
, arg
, true, complain
);
7477 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, true, complain
);
7478 real
= cp_build_unary_op (code
, real
, true, complain
);
7479 if (real
== error_mark_node
|| imag
== error_mark_node
)
7480 return error_mark_node
;
7481 val
= build2 (COMPLEX_EXPR
, TREE_TYPE (arg
), real
, imag
);
7482 goto return_build_unary_op
;
7485 /* Report invalid types. */
7487 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
7490 if (code
== PREINCREMENT_EXPR
)
7491 errstring
= _("no pre-increment operator for type");
7492 else if (code
== POSTINCREMENT_EXPR
)
7493 errstring
= _("no post-increment operator for type");
7494 else if (code
== PREDECREMENT_EXPR
)
7495 errstring
= _("no pre-decrement operator for type");
7497 errstring
= _("no post-decrement operator for type");
7500 else if (arg
== error_mark_node
)
7501 return error_mark_node
;
7503 /* Report something read-only. */
7505 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
7506 || TREE_READONLY (arg
))
7508 if (complain
& tf_error
)
7509 cxx_readonly_error (location
, arg
,
7510 ((code
== PREINCREMENT_EXPR
7511 || code
== POSTINCREMENT_EXPR
)
7512 ? lv_increment
: lv_decrement
));
7514 return error_mark_node
;
7519 tree declared_type
= unlowered_expr_type (arg
);
7521 argtype
= TREE_TYPE (arg
);
7523 /* ARM $5.2.5 last annotation says this should be forbidden. */
7524 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
7526 if (complain
& tf_error
)
7527 permerror (location
, (code
== PREINCREMENT_EXPR
7528 || code
== POSTINCREMENT_EXPR
)
7529 ? G_("ISO C++ forbids incrementing an enum")
7530 : G_("ISO C++ forbids decrementing an enum"));
7532 return error_mark_node
;
7535 /* Compute the increment. */
7537 if (TYPE_PTR_P (argtype
))
7539 tree type
= complete_type (TREE_TYPE (argtype
));
7541 if (!COMPLETE_OR_VOID_TYPE_P (type
))
7543 if (complain
& tf_error
)
7544 error_at (location
, ((code
== PREINCREMENT_EXPR
7545 || code
== POSTINCREMENT_EXPR
))
7546 ? G_("cannot increment a pointer to incomplete "
7548 : G_("cannot decrement a pointer to incomplete "
7550 TREE_TYPE (argtype
));
7552 return error_mark_node
;
7554 else if (!TYPE_PTROB_P (argtype
))
7556 if (complain
& tf_error
)
7557 pedwarn (location
, OPT_Wpointer_arith
,
7558 (code
== PREINCREMENT_EXPR
7559 || code
== POSTINCREMENT_EXPR
)
7560 ? G_("ISO C++ forbids incrementing a pointer "
7562 : G_("ISO C++ forbids decrementing a pointer "
7566 return error_mark_node
;
7568 else if (!verify_type_context (location
, TCTX_POINTER_ARITH
,
7569 TREE_TYPE (argtype
),
7570 !(complain
& tf_error
)))
7571 return error_mark_node
;
7573 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
7576 inc
= VECTOR_TYPE_P (argtype
)
7577 ? build_one_cst (argtype
)
7580 inc
= cp_convert (argtype
, inc
, complain
);
7582 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
7583 need to ask Objective-C to build the increment or decrement
7584 expression for it. */
7585 if (objc_is_property_ref (arg
))
7586 return objc_build_incr_expr_for_property_ref (input_location
, code
,
7589 /* Complain about anything else that is not a true lvalue. */
7590 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
7591 || code
== POSTINCREMENT_EXPR
)
7592 ? lv_increment
: lv_decrement
),
7594 return error_mark_node
;
7596 /* [depr.volatile.type] "Postfix ++ and -- expressions and
7597 prefix ++ and -- expressions of volatile-qualified arithmetic
7598 and pointer types are deprecated." */
7599 if ((TREE_THIS_VOLATILE (arg
) || CP_TYPE_VOLATILE_P (TREE_TYPE (arg
)))
7600 && (complain
& tf_warning
))
7601 warning_at (location
, OPT_Wvolatile
,
7602 "%qs expression of %<volatile%>-qualified type is "
7604 ((code
== PREINCREMENT_EXPR
7605 || code
== POSTINCREMENT_EXPR
)
7608 /* Forbid using -- or ++ in C++17 on `bool'. */
7609 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
7611 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
7613 if (complain
& tf_error
)
7615 "use of an operand of type %qT in %<operator--%> "
7616 "is forbidden", boolean_type_node
);
7617 return error_mark_node
;
7621 if (cxx_dialect
>= cxx17
)
7623 if (complain
& tf_error
)
7625 "use of an operand of type %qT in "
7626 "%<operator++%> is forbidden in C++17",
7628 return error_mark_node
;
7630 /* Otherwise, [depr.incr.bool] says this is deprecated. */
7631 else if (complain
& tf_warning
)
7632 warning_at (location
, OPT_Wdeprecated
,
7633 "use of an operand of type %qT "
7634 "in %<operator++%> is deprecated",
7637 val
= boolean_increment (code
, arg
);
7639 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
7640 /* An rvalue has no cv-qualifiers. */
7641 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
7643 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
7645 TREE_SIDE_EFFECTS (val
) = 1;
7646 goto return_build_unary_op
;
7650 /* Note that this operation never does default_conversion
7651 regardless of NOCONVERT. */
7652 return cp_build_addr_expr (arg
, complain
);
7661 argtype
= TREE_TYPE (arg
);
7662 val
= build1 (code
, argtype
, arg
);
7663 return_build_unary_op
:
7665 val
= build1 (EXCESS_PRECISION_EXPR
, eptype
, val
);
7669 if (complain
& tf_error
)
7670 error_at (location
, "%s", errstring
);
7671 return error_mark_node
;
7674 /* Hook for the c-common bits that build a unary op. */
7676 build_unary_op (location_t
/*location*/,
7677 enum tree_code code
, tree xarg
, bool noconvert
)
7679 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
7682 /* Adjust LVALUE, an MODIFY_EXPR, PREINCREMENT_EXPR or PREDECREMENT_EXPR,
7683 so that it is a valid lvalue even for GENERIC by replacing
7684 (lhs = rhs) with ((lhs = rhs), lhs)
7685 (--lhs) with ((--lhs), lhs)
7686 (++lhs) with ((++lhs), lhs)
7687 and if lhs has side-effects, calling cp_stabilize_reference on it, so
7688 that it can be evaluated multiple times. */
7691 genericize_compound_lvalue (tree lvalue
)
7693 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lvalue
, 0)))
7694 lvalue
= build2 (TREE_CODE (lvalue
), TREE_TYPE (lvalue
),
7695 cp_stabilize_reference (TREE_OPERAND (lvalue
, 0)),
7696 TREE_OPERAND (lvalue
, 1));
7697 return build2 (COMPOUND_EXPR
, TREE_TYPE (TREE_OPERAND (lvalue
, 0)),
7698 lvalue
, TREE_OPERAND (lvalue
, 0));
7701 /* Apply unary lvalue-demanding operator CODE to the expression ARG
7702 for certain kinds of expressions which are not really lvalues
7703 but which we can accept as lvalues.
7705 If ARG is not a kind of expression we can handle, return
7709 unary_complex_lvalue (enum tree_code code
, tree arg
)
7711 /* Inside a template, making these kinds of adjustments is
7712 pointless; we are only concerned with the type of the
7714 if (processing_template_decl
)
7717 /* Handle (a, b) used as an "lvalue". */
7718 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
7720 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), false,
7721 tf_warning_or_error
);
7722 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
7723 TREE_OPERAND (arg
, 0), real_result
);
7726 /* Handle (a ? b : c) used as an "lvalue". */
7727 if (TREE_CODE (arg
) == COND_EXPR
7728 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
7729 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
7731 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
7732 if (TREE_CODE (arg
) == MODIFY_EXPR
7733 || TREE_CODE (arg
) == PREINCREMENT_EXPR
7734 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
7735 return unary_complex_lvalue (code
, genericize_compound_lvalue (arg
));
7737 if (code
!= ADDR_EXPR
)
7740 /* Handle (a = b) used as an "lvalue" for `&'. */
7741 if (TREE_CODE (arg
) == MODIFY_EXPR
7742 || TREE_CODE (arg
) == INIT_EXPR
)
7744 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), false,
7745 tf_warning_or_error
);
7746 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
7748 suppress_warning (arg
/* What warning? */);
7752 if (FUNC_OR_METHOD_TYPE_P (TREE_TYPE (arg
))
7753 || TREE_CODE (arg
) == OFFSET_REF
)
7756 /* We permit compiler to make function calls returning
7757 objects of aggregate type look like lvalues. */
7761 if (TREE_CODE (targ
) == SAVE_EXPR
)
7762 targ
= TREE_OPERAND (targ
, 0);
7764 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
7766 if (TREE_CODE (arg
) == SAVE_EXPR
)
7769 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
7770 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
7773 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
7774 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
7775 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
7778 /* Don't let anything else be handled specially. */
7782 /* Mark EXP saying that we need to be able to take the
7783 address of it; it should not be allocated in a register.
7784 Value is true if successful. ARRAY_REF_P is true if this
7785 is for ARRAY_REF construction - in that case we don't want
7786 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
7787 it is fine to use ARRAY_REFs for vector subscripts on vector
7790 C++: we do not allow `current_class_ptr' to be addressable. */
7793 cxx_mark_addressable (tree exp
, bool array_ref_p
)
7798 switch (TREE_CODE (x
))
7800 case VIEW_CONVERT_EXPR
:
7802 && TREE_CODE (TREE_TYPE (x
)) == ARRAY_TYPE
7803 && VECTOR_TYPE_P (TREE_TYPE (TREE_OPERAND (x
, 0))))
7805 x
= TREE_OPERAND (x
, 0);
7810 error ("attempt to take address of bit-field");
7816 x
= TREE_OPERAND (x
, 0);
7820 if (x
== current_class_ptr
)
7822 error ("cannot take the address of %<this%>, which is an rvalue expression");
7823 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
7829 /* Caller should not be trying to mark initialized
7830 constant fields addressable. */
7831 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
7832 || DECL_IN_AGGR_P (x
) == 0
7834 || DECL_EXTERNAL (x
));
7838 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
7839 && !DECL_ARTIFICIAL (x
))
7841 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
7844 ("address of explicit register variable %qD requested", x
);
7847 else if (extra_warnings
)
7849 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
7851 TREE_ADDRESSABLE (x
) = 1;
7856 TREE_ADDRESSABLE (x
) = 1;
7860 TREE_ADDRESSABLE (x
) = 1;
7864 TREE_ADDRESSABLE (x
) = 1;
7865 cxx_mark_addressable (TREE_OPERAND (x
, 0));
7873 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
7876 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
7877 tsubst_flags_t complain
)
7879 tree orig_ifexp
= ifexp
;
7880 tree orig_op1
= op1
;
7881 tree orig_op2
= op2
;
7884 if (processing_template_decl
)
7886 /* The standard says that the expression is type-dependent if
7887 IFEXP is type-dependent, even though the eventual type of the
7888 expression doesn't dependent on IFEXP. */
7889 if (type_dependent_expression_p (ifexp
)
7890 /* As a GNU extension, the middle operand may be omitted. */
7891 || (op1
&& type_dependent_expression_p (op1
))
7892 || type_dependent_expression_p (op2
))
7893 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
7896 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
7897 if (processing_template_decl
&& expr
!= error_mark_node
)
7899 tree min
= build_min_non_dep (COND_EXPR
, expr
,
7900 orig_ifexp
, orig_op1
, orig_op2
);
7901 expr
= convert_from_reference (min
);
7906 /* Given a list of expressions, return a compound expression
7907 that performs them all and returns the value of the last of them. */
7910 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
7911 tsubst_flags_t complain
)
7913 tree expr
= TREE_VALUE (list
);
7915 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7916 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
7918 if (complain
& tf_error
)
7919 pedwarn (cp_expr_loc_or_input_loc (expr
), 0,
7920 "list-initializer for non-class type must not "
7921 "be parenthesized");
7923 return error_mark_node
;
7926 if (TREE_CHAIN (list
))
7928 if (complain
& tf_error
)
7932 permerror (input_location
, "expression list treated as compound "
7933 "expression in initializer");
7936 permerror (input_location
, "expression list treated as compound "
7937 "expression in mem-initializer");
7940 permerror (input_location
, "expression list treated as compound "
7941 "expression in functional cast");
7947 return error_mark_node
;
7949 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
7950 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
7951 expr
, TREE_VALUE (list
), NULL_TREE
,
7958 /* Like build_x_compound_expr_from_list, but using a VEC. */
7961 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
7962 tsubst_flags_t complain
)
7964 if (vec_safe_is_empty (vec
))
7966 else if (vec
->length () == 1)
7976 if (complain
& tf_error
)
7977 permerror (input_location
,
7978 "%s expression list treated as compound expression",
7981 return error_mark_node
;
7985 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
7986 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
7987 t
, NULL_TREE
, complain
);
7993 /* Handle overloading of the ',' operator when needed. */
7996 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
7997 tree lookups
, tsubst_flags_t complain
)
8000 tree orig_op1
= op1
;
8001 tree orig_op2
= op2
;
8002 tree overload
= NULL_TREE
;
8004 if (processing_template_decl
)
8006 if (type_dependent_expression_p (op1
)
8007 || type_dependent_expression_p (op2
))
8009 result
= build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
8011 = build_dependent_operator_type (lookups
, COMPOUND_EXPR
, false);
8016 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
8017 NULL_TREE
, lookups
, &overload
, complain
);
8019 result
= cp_build_compound_expr (op1
, op2
, complain
);
8021 if (processing_template_decl
&& result
!= error_mark_node
)
8023 if (overload
!= NULL_TREE
)
8024 return (build_min_non_dep_op_overload
8025 (COMPOUND_EXPR
, result
, overload
, orig_op1
, orig_op2
));
8027 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
8033 /* Like cp_build_compound_expr, but for the c-common bits. */
8036 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
8038 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
8041 /* Build a compound expression. */
8044 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
8046 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
8048 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
8049 return error_mark_node
;
8051 if (TREE_CODE (lhs
) == EXCESS_PRECISION_EXPR
)
8052 lhs
= TREE_OPERAND (lhs
, 0);
8053 tree eptype
= NULL_TREE
;
8054 if (TREE_CODE (rhs
) == EXCESS_PRECISION_EXPR
)
8056 eptype
= TREE_TYPE (rhs
);
8057 rhs
= TREE_OPERAND (rhs
, 0);
8060 if (TREE_CODE (rhs
) == TARGET_EXPR
)
8062 /* If the rhs is a TARGET_EXPR, then build the compound
8063 expression inside the target_expr's initializer. This
8064 helps the compiler to eliminate unnecessary temporaries. */
8065 tree init
= TREE_OPERAND (rhs
, 1);
8067 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
8068 TREE_OPERAND (rhs
, 1) = init
;
8071 rhs
= build1 (EXCESS_PRECISION_EXPR
, eptype
, rhs
);
8075 if (type_unknown_p (rhs
))
8077 if (complain
& tf_error
)
8078 error_at (cp_expr_loc_or_input_loc (rhs
),
8079 "no context to resolve type of %qE", rhs
);
8080 return error_mark_node
;
8083 tree ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
8085 ret
= build1 (EXCESS_PRECISION_EXPR
, eptype
, ret
);
8089 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
8090 casts away constness. CAST gives the type of cast. Returns true
8091 if the cast is ill-formed, false if it is well-formed.
8093 ??? This function warns for casting away any qualifier not just
8094 const. We would like to specify exactly what qualifiers are casted
8099 check_for_casting_away_constness (location_t loc
, tree src_type
,
8100 tree dest_type
, enum tree_code cast
,
8101 tsubst_flags_t complain
)
8103 /* C-style casts are allowed to cast away constness. With
8104 WARN_CAST_QUAL, we still want to issue a warning. */
8105 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
8108 if (!casts_away_constness (src_type
, dest_type
, complain
))
8114 if (complain
& tf_warning
)
8115 warning_at (loc
, OPT_Wcast_qual
,
8116 "cast from type %qT to type %qT casts away qualifiers",
8117 src_type
, dest_type
);
8120 case STATIC_CAST_EXPR
:
8121 if (complain
& tf_error
)
8122 error_at (loc
, "%<static_cast%> from type %qT to type %qT casts "
8124 src_type
, dest_type
);
8127 case REINTERPRET_CAST_EXPR
:
8128 if (complain
& tf_error
)
8129 error_at (loc
, "%<reinterpret_cast%> from type %qT to type %qT "
8130 "casts away qualifiers",
8131 src_type
, dest_type
);
8139 /* Warns if the cast from expression EXPR to type TYPE is useless. */
8141 maybe_warn_about_useless_cast (location_t loc
, tree type
, tree expr
,
8142 tsubst_flags_t complain
)
8144 if (warn_useless_cast
8145 && complain
& tf_warning
)
8147 if (TYPE_REF_P (type
)
8148 ? ((TYPE_REF_IS_RVALUE (type
)
8149 ? xvalue_p (expr
) : lvalue_p (expr
))
8150 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
8151 /* Don't warn when converting a class object to a non-reference type,
8152 because that's a common way to create a temporary. */
8153 : (!glvalue_p (expr
) && same_type_p (TREE_TYPE (expr
), type
)))
8154 warning_at (loc
, OPT_Wuseless_cast
,
8155 "useless cast to type %q#T", type
);
8159 /* Warns if the cast ignores cv-qualifiers on TYPE. */
8161 maybe_warn_about_cast_ignoring_quals (location_t loc
, tree type
,
8162 tsubst_flags_t complain
)
8164 if (warn_ignored_qualifiers
8165 && complain
& tf_warning
8166 && !CLASS_TYPE_P (type
)
8167 && (cp_type_quals (type
) & (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)))
8168 warning_at (loc
, OPT_Wignored_qualifiers
,
8169 "type qualifiers ignored on cast result type");
8172 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
8173 (another pointer-to-member type in the same hierarchy) and return
8174 the converted expression. If ALLOW_INVERSE_P is permitted, a
8175 pointer-to-derived may be converted to pointer-to-base; otherwise,
8176 only the other direction is permitted. If C_CAST_P is true, this
8177 conversion is taking place as part of a C-style cast. */
8180 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
8181 bool c_cast_p
, tsubst_flags_t complain
)
8183 if (same_type_p (type
, TREE_TYPE (expr
)))
8186 if (TYPE_PTRDATAMEM_P (type
))
8188 tree obase
= TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
));
8189 tree nbase
= TYPE_PTRMEM_CLASS_TYPE (type
);
8190 tree delta
= (get_delta_difference
8192 allow_inverse_p
, c_cast_p
, complain
));
8194 if (delta
== error_mark_node
)
8195 return error_mark_node
;
8197 if (!same_type_p (obase
, nbase
))
8199 if (TREE_CODE (expr
) == PTRMEM_CST
)
8200 expr
= cplus_expand_constant (expr
);
8202 tree cond
= cp_build_binary_op (input_location
, EQ_EXPR
, expr
,
8203 build_int_cst (TREE_TYPE (expr
), -1),
8205 tree op1
= build_nop (ptrdiff_type_node
, expr
);
8206 tree op2
= cp_build_binary_op (input_location
, PLUS_EXPR
, op1
, delta
,
8209 expr
= fold_build3_loc (input_location
,
8210 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
8213 return build_nop (type
, expr
);
8216 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
8217 allow_inverse_p
, c_cast_p
, complain
);
8220 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
8221 this static_cast is being attempted as one of the possible casts
8222 allowed by a C-style cast. (In that case, accessibility of base
8223 classes is not considered, and it is OK to cast away
8224 constness.) Return the result of the cast. *VALID_P is set to
8225 indicate whether or not the cast was valid. */
8228 build_static_cast_1 (location_t loc
, tree type
, tree expr
, bool c_cast_p
,
8229 bool *valid_p
, tsubst_flags_t complain
)
8235 /* Assume the cast is valid. */
8238 intype
= unlowered_expr_type (expr
);
8240 /* Save casted types in the function's used types hash table. */
8241 used_types_insert (type
);
8243 /* A prvalue of non-class type is cv-unqualified. */
8244 if (!CLASS_TYPE_P (type
))
8245 type
= cv_unqualified (type
);
8247 /* [expr.static.cast]
8249 An lvalue of type "cv1 B", where B is a class type, can be cast
8250 to type "reference to cv2 D", where D is a class derived (clause
8251 _class.derived_) from B, if a valid standard conversion from
8252 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
8253 same cv-qualification as, or greater cv-qualification than, cv1,
8254 and B is not a virtual base class of D. */
8255 /* We check this case before checking the validity of "TYPE t =
8256 EXPR;" below because for this case:
8259 struct D : public B { D(const B&); };
8261 void f() { static_cast<const D&>(b); }
8263 we want to avoid constructing a new D. The standard is not
8264 completely clear about this issue, but our interpretation is
8265 consistent with other compilers. */
8266 if (TYPE_REF_P (type
)
8267 && CLASS_TYPE_P (TREE_TYPE (type
))
8268 && CLASS_TYPE_P (intype
)
8269 && (TYPE_REF_IS_RVALUE (type
) || lvalue_p (expr
))
8270 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
8271 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
8272 build_pointer_type (TYPE_MAIN_VARIANT
8273 (TREE_TYPE (type
))),
8276 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
8280 if (processing_template_decl
)
8283 /* There is a standard conversion from "D*" to "B*" even if "B"
8284 is ambiguous or inaccessible. If this is really a
8285 static_cast, then we check both for inaccessibility and
8286 ambiguity. However, if this is a static_cast being performed
8287 because the user wrote a C-style cast, then accessibility is
8289 base
= lookup_base (TREE_TYPE (type
), intype
,
8290 c_cast_p
? ba_unique
: ba_check
,
8292 expr
= cp_build_addr_expr (expr
, complain
);
8294 if (sanitize_flags_p (SANITIZE_VPTR
))
8297 = cp_ubsan_maybe_instrument_downcast (loc
, type
,
8303 /* Convert from "B*" to "D*". This function will check that "B"
8304 is not a virtual base of "D". Even if we don't have a guarantee
8305 that expr is NULL, if the static_cast is to a reference type,
8306 it is UB if it would be NULL, so omit the non-NULL check. */
8307 expr
= build_base_path (MINUS_EXPR
, expr
, base
,
8308 /*nonnull=*/flag_delete_null_pointer_checks
,
8311 /* Convert the pointer to a reference -- but then remember that
8312 there are no expressions with reference type in C++.
8314 We call rvalue so that there's an actual tree code
8315 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
8316 is a variable with the same type, the conversion would get folded
8317 away, leaving just the variable and causing lvalue_kind to give
8318 the wrong answer. */
8319 expr
= cp_fold_convert (type
, expr
);
8321 /* When -fsanitize=null, make sure to diagnose reference binding to
8322 NULL even when the reference is converted to pointer later on. */
8323 if (sanitize_flags_p (SANITIZE_NULL
)
8324 && TREE_CODE (expr
) == COND_EXPR
8325 && TREE_OPERAND (expr
, 2)
8326 && TREE_CODE (TREE_OPERAND (expr
, 2)) == INTEGER_CST
8327 && TREE_TYPE (TREE_OPERAND (expr
, 2)) == type
)
8328 ubsan_maybe_instrument_reference (&TREE_OPERAND (expr
, 2));
8330 return convert_from_reference (rvalue (expr
));
8333 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
8334 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
8335 if (TYPE_REF_P (type
)
8336 && TYPE_REF_IS_RVALUE (type
)
8337 && (clk
= real_lvalue_p (expr
))
8338 && reference_compatible_p (TREE_TYPE (type
), intype
)
8339 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
8341 if (processing_template_decl
)
8343 if (clk
== clk_ordinary
)
8345 /* Handle the (non-bit-field) lvalue case here by casting to
8346 lvalue reference and then changing it to an rvalue reference.
8347 Casting an xvalue to rvalue reference will be handled by the
8349 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
8350 result
= (perform_direct_initialization_if_possible
8351 (lref
, expr
, c_cast_p
, complain
));
8352 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
8353 return convert_from_reference (result
);
8356 /* For a bit-field or packed field, bind to a temporary. */
8357 expr
= rvalue (expr
);
8360 /* Resolve overloaded address here rather than once in
8361 implicit_conversion and again in the inverse code below. */
8362 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
8364 expr
= instantiate_type (type
, expr
, complain
);
8365 intype
= TREE_TYPE (expr
);
8368 /* [expr.static.cast]
8370 Any expression can be explicitly converted to type cv void. */
8371 if (VOID_TYPE_P (type
))
8373 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
8374 expr
= TREE_OPERAND (expr
, 0);
8375 return convert_to_void (expr
, ICV_CAST
, complain
);
8379 An abstract class shall not be used ... as the type of an explicit
8381 if (abstract_virtuals_error (ACU_CAST
, type
, complain
))
8382 return error_mark_node
;
8384 /* [expr.static.cast]
8386 An expression e can be explicitly converted to a type T using a
8387 static_cast of the form static_cast<T>(e) if the declaration T
8388 t(e);" is well-formed, for some invented temporary variable
8390 result
= perform_direct_initialization_if_possible (type
, expr
,
8391 c_cast_p
, complain
);
8392 /* P1975 allows static_cast<Aggr>(42), as well as static_cast<T[5]>(42),
8393 which initialize the first element of the aggregate. We need to handle
8394 the array case specifically. */
8395 if (result
== NULL_TREE
8396 && cxx_dialect
>= cxx20
8397 && TREE_CODE (type
) == ARRAY_TYPE
)
8399 /* Create { EXPR } and perform direct-initialization from it. */
8400 tree e
= build_constructor_single (init_list_type_node
, NULL_TREE
, expr
);
8401 CONSTRUCTOR_IS_DIRECT_INIT (e
) = true;
8402 CONSTRUCTOR_IS_PAREN_INIT (e
) = true;
8403 result
= perform_direct_initialization_if_possible (type
, e
, c_cast_p
,
8408 if (processing_template_decl
)
8411 result
= convert_from_reference (result
);
8413 /* [expr.static.cast]
8415 If T is a reference type, the result is an lvalue; otherwise,
8416 the result is an rvalue. */
8417 if (!TYPE_REF_P (type
))
8419 result
= rvalue (result
);
8421 if (result
== expr
&& SCALAR_TYPE_P (type
))
8422 /* Leave some record of the cast. */
8423 result
= build_nop (type
, expr
);
8428 /* [expr.static.cast]
8430 The inverse of any standard conversion sequence (clause _conv_),
8431 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
8432 (_conv.array_), function-to-pointer (_conv.func_), and boolean
8433 (_conv.bool_) conversions, can be performed explicitly using
8434 static_cast subject to the restriction that the explicit
8435 conversion does not cast away constness (_expr.const.cast_), and
8436 the following additional rules for specific cases: */
8437 /* For reference, the conversions not excluded are: integral
8438 promotions, floating-point promotion, integral conversions,
8439 floating-point conversions, floating-integral conversions,
8440 pointer conversions, and pointer to member conversions. */
8443 A value of integral _or enumeration_ type can be explicitly
8444 converted to an enumeration type. */
8445 /* The effect of all that is that any conversion between any two
8446 types which are integral, floating, or enumeration types can be
8448 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
8449 || SCALAR_FLOAT_TYPE_P (type
))
8450 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
8451 || SCALAR_FLOAT_TYPE_P (intype
)))
8453 if (processing_template_decl
)
8455 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
8456 expr
= TREE_OPERAND (expr
, 0);
8457 /* [expr.static.cast]: "If the value is not a bit-field, the result
8458 refers to the object or the specified base class subobject thereof;
8459 otherwise, the lvalue-to-rvalue conversion is applied to the
8460 bit-field and the resulting prvalue is used as the operand of the
8461 static_cast." There are no prvalue bit-fields; the l-to-r conversion
8462 will give us an object of the underlying type of the bit-field. */
8463 expr
= decay_conversion (expr
, complain
);
8464 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
8467 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
8468 && CLASS_TYPE_P (TREE_TYPE (type
))
8469 && CLASS_TYPE_P (TREE_TYPE (intype
))
8470 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
8471 (TREE_TYPE (intype
))),
8472 build_pointer_type (TYPE_MAIN_VARIANT
8473 (TREE_TYPE (type
))),
8478 if (processing_template_decl
)
8482 && check_for_casting_away_constness (loc
, intype
, type
,
8485 return error_mark_node
;
8486 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
8487 c_cast_p
? ba_unique
: ba_check
,
8489 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
8492 if (sanitize_flags_p (SANITIZE_VPTR
))
8495 = cp_ubsan_maybe_instrument_downcast (loc
, type
,
8501 return cp_fold_convert (type
, expr
);
8504 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
8505 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
8512 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
8513 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
8515 if (TYPE_PTRDATAMEM_P (type
))
8517 t1
= (build_ptrmem_type
8519 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
8520 t2
= (build_ptrmem_type
8522 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
8529 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
8532 && check_for_casting_away_constness (loc
, intype
, type
,
8535 return error_mark_node
;
8536 if (processing_template_decl
)
8538 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
8539 c_cast_p
, complain
);
8543 /* [expr.static.cast]
8545 An rvalue of type "pointer to cv void" can be explicitly
8546 converted to a pointer to object type. A value of type pointer
8547 to object converted to "pointer to cv void" and back to the
8548 original pointer type will have its original value. */
8549 if (TYPE_PTR_P (intype
)
8550 && VOID_TYPE_P (TREE_TYPE (intype
))
8551 && TYPE_PTROB_P (type
))
8554 && check_for_casting_away_constness (loc
, intype
, type
,
8557 return error_mark_node
;
8558 if (processing_template_decl
)
8560 return build_nop (type
, expr
);
8564 return error_mark_node
;
8567 /* Return an expression representing static_cast<TYPE>(EXPR). */
8570 build_static_cast (location_t loc
, tree type
, tree oexpr
,
8571 tsubst_flags_t complain
)
8577 if (type
== error_mark_node
|| expr
== error_mark_node
)
8578 return error_mark_node
;
8580 bool dependent
= (dependent_type_p (type
)
8581 || type_dependent_expression_p (expr
));
8585 expr
= build_min (STATIC_CAST_EXPR
, type
, oexpr
);
8586 /* We don't know if it will or will not have side effects. */
8587 TREE_SIDE_EFFECTS (expr
) = 1;
8588 result
= convert_from_reference (expr
);
8589 protected_set_expr_location (result
, loc
);
8593 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8594 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
8595 if (!TYPE_REF_P (type
)
8596 && TREE_CODE (expr
) == NOP_EXPR
8597 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
8598 expr
= TREE_OPERAND (expr
, 0);
8600 result
= build_static_cast_1 (loc
, type
, expr
, /*c_cast_p=*/false,
8601 &valid_p
, complain
);
8604 if (result
!= error_mark_node
)
8606 maybe_warn_about_useless_cast (loc
, type
, expr
, complain
);
8607 maybe_warn_about_cast_ignoring_quals (loc
, type
, complain
);
8609 if (processing_template_decl
)
8611 protected_set_expr_location (result
, loc
);
8615 if (complain
& tf_error
)
8617 error_at (loc
, "invalid %<static_cast%> from type %qT to type %qT",
8618 TREE_TYPE (expr
), type
);
8619 if ((TYPE_PTR_P (type
) || TYPE_REF_P (type
))
8620 && CLASS_TYPE_P (TREE_TYPE (type
))
8621 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
8622 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (TREE_TYPE (type
))),
8623 "class type %qT is incomplete", TREE_TYPE (type
));
8624 tree expr_type
= TREE_TYPE (expr
);
8625 if (TYPE_PTR_P (expr_type
))
8626 expr_type
= TREE_TYPE (expr_type
);
8627 if (CLASS_TYPE_P (expr_type
) && !COMPLETE_TYPE_P (expr_type
))
8628 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (expr_type
)),
8629 "class type %qT is incomplete", expr_type
);
8631 return error_mark_node
;
8634 /* EXPR is an expression with member function or pointer-to-member
8635 function type. TYPE is a pointer type. Converting EXPR to TYPE is
8636 not permitted by ISO C++, but we accept it in some modes. If we
8637 are not in one of those modes, issue a diagnostic. Return the
8638 converted expression. */
8641 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
8646 intype
= TREE_TYPE (expr
);
8647 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
8648 || TREE_CODE (intype
) == METHOD_TYPE
);
8650 if (!(complain
& tf_warning_or_error
))
8651 return error_mark_node
;
8653 location_t loc
= cp_expr_loc_or_input_loc (expr
);
8655 if (pedantic
|| warn_pmf2ptr
)
8656 pedwarn (loc
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
8657 "converting from %qH to %qI", intype
, type
);
8659 STRIP_ANY_LOCATION_WRAPPER (expr
);
8661 if (TREE_CODE (intype
) == METHOD_TYPE
)
8662 expr
= build_addr_func (expr
, complain
);
8663 else if (TREE_CODE (expr
) == PTRMEM_CST
)
8664 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
8667 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
8668 decl
= build_address (decl
);
8669 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
8672 if (expr
== error_mark_node
)
8673 return error_mark_node
;
8675 expr
= build_nop (type
, expr
);
8676 SET_EXPR_LOCATION (expr
, loc
);
8680 /* Build a NOP_EXPR to TYPE, but mark it as a reinterpret_cast so that
8681 constexpr evaluation knows to reject it. */
8684 build_nop_reinterpret (tree type
, tree expr
)
8686 tree ret
= build_nop (type
, expr
);
8688 REINTERPRET_CAST_P (ret
) = true;
8692 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
8693 If C_CAST_P is true, this reinterpret cast is being done as part of
8694 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
8695 indicate whether or not reinterpret_cast was valid. */
8698 build_reinterpret_cast_1 (location_t loc
, tree type
, tree expr
,
8699 bool c_cast_p
, bool *valid_p
,
8700 tsubst_flags_t complain
)
8704 /* Assume the cast is invalid. */
8708 if (type
== error_mark_node
|| error_operand_p (expr
))
8709 return error_mark_node
;
8711 intype
= TREE_TYPE (expr
);
8713 /* Save casted types in the function's used types hash table. */
8714 used_types_insert (type
);
8716 /* A prvalue of non-class type is cv-unqualified. */
8717 if (!CLASS_TYPE_P (type
))
8718 type
= cv_unqualified (type
);
8720 /* [expr.reinterpret.cast]
8721 A glvalue of type T1, designating an object x, can be cast to the type
8722 "reference to T2" if an expression of type "pointer to T1" can be
8723 explicitly converted to the type "pointer to T2" using a reinterpret_cast.
8724 The result is that of *reinterpret_cast<T2 *>(p) where p is a pointer to x
8725 of type "pointer to T1". No temporary is created, no copy is made, and no
8726 constructors (11.4.4) or conversion functions (11.4.7) are called. */
8727 if (TYPE_REF_P (type
))
8729 if (!glvalue_p (expr
))
8731 if (complain
& tf_error
)
8732 error_at (loc
, "invalid cast of a prvalue expression of type "
8735 return error_mark_node
;
8738 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
8739 "B" are related class types; the reinterpret_cast does not
8740 adjust the pointer. */
8741 if (TYPE_PTR_P (intype
)
8742 && (complain
& tf_warning
)
8743 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
8744 COMPARE_BASE
| COMPARE_DERIVED
)))
8745 warning_at (loc
, 0, "casting %qT to %qT does not dereference pointer",
8748 expr
= cp_build_addr_expr (expr
, complain
);
8750 if (warn_strict_aliasing
> 2)
8751 cp_strict_aliasing_warning (EXPR_LOCATION (expr
), type
, expr
);
8753 if (expr
!= error_mark_node
)
8754 expr
= build_reinterpret_cast_1
8755 (loc
, build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
8757 if (expr
!= error_mark_node
)
8758 /* cp_build_indirect_ref isn't right for rvalue refs. */
8759 expr
= convert_from_reference (fold_convert (type
, expr
));
8763 /* As a G++ extension, we consider conversions from member
8764 functions, and pointers to member functions to
8765 pointer-to-function and pointer-to-void types. If
8766 -Wno-pmf-conversions has not been specified,
8767 convert_member_func_to_ptr will issue an error message. */
8768 if ((TYPE_PTRMEMFUNC_P (intype
)
8769 || TREE_CODE (intype
) == METHOD_TYPE
)
8770 && TYPE_PTR_P (type
)
8771 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
8772 || VOID_TYPE_P (TREE_TYPE (type
))))
8773 return convert_member_func_to_ptr (type
, expr
, complain
);
8775 /* If the cast is not to a reference type, the lvalue-to-rvalue,
8776 array-to-pointer, and function-to-pointer conversions are
8778 expr
= decay_conversion (expr
, complain
);
8780 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8781 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
8782 if (TREE_CODE (expr
) == NOP_EXPR
8783 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
8784 expr
= TREE_OPERAND (expr
, 0);
8786 if (error_operand_p (expr
))
8787 return error_mark_node
;
8789 intype
= TREE_TYPE (expr
);
8791 /* [expr.reinterpret.cast]
8792 A pointer can be converted to any integral type large enough to
8793 hold it. ... A value of type std::nullptr_t can be converted to
8794 an integral type; the conversion has the same meaning and
8795 validity as a conversion of (void*)0 to the integral type. */
8796 if (CP_INTEGRAL_TYPE_P (type
)
8797 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
8799 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
8801 if (complain
& tf_error
)
8802 permerror (loc
, "cast from %qH to %qI loses precision",
8805 return error_mark_node
;
8807 if (NULLPTR_TYPE_P (intype
))
8808 return build_int_cst (type
, 0);
8810 /* [expr.reinterpret.cast]
8811 A value of integral or enumeration type can be explicitly
8812 converted to a pointer. */
8813 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
8816 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
8817 || TYPE_PTR_OR_PTRMEM_P (type
))
8818 && same_type_p (type
, intype
))
8820 return rvalue (expr
);
8821 else if (TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
8823 if ((complain
& tf_warning
)
8824 && !cxx_safe_function_type_cast_p (TREE_TYPE (type
),
8825 TREE_TYPE (intype
)))
8826 warning_at (loc
, OPT_Wcast_function_type
,
8827 "cast between incompatible function types"
8828 " from %qH to %qI", intype
, type
);
8829 return build_nop_reinterpret (type
, expr
);
8831 else if (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
))
8833 if ((complain
& tf_warning
)
8834 && !cxx_safe_function_type_cast_p
8835 (TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (type
)),
8836 TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE_RAW (intype
))))
8837 warning_at (loc
, OPT_Wcast_function_type
,
8838 "cast between incompatible pointer to member types"
8839 " from %qH to %qI", intype
, type
);
8840 return build_nop_reinterpret (type
, expr
);
8842 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
8843 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
8846 && check_for_casting_away_constness (loc
, intype
, type
,
8847 REINTERPRET_CAST_EXPR
,
8849 return error_mark_node
;
8850 /* Warn about possible alignment problems. */
8851 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
8852 && (complain
& tf_warning
)
8853 && !VOID_TYPE_P (type
)
8854 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
8855 && COMPLETE_TYPE_P (TREE_TYPE (type
))
8856 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
8857 && min_align_of_type (TREE_TYPE (type
))
8858 > min_align_of_type (TREE_TYPE (intype
)))
8859 warning_at (loc
, OPT_Wcast_align
, "cast from %qH to %qI "
8860 "increases required alignment of target type",
8863 if (warn_strict_aliasing
<= 2)
8864 /* strict_aliasing_warning STRIP_NOPs its expr. */
8865 cp_strict_aliasing_warning (EXPR_LOCATION (expr
), type
, expr
);
8867 return build_nop_reinterpret (type
, expr
);
8869 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
8870 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
8872 if (complain
& tf_warning
)
8873 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
8874 object pointer type or vice versa is conditionally-supported." */
8875 warning_at (loc
, OPT_Wconditionally_supported
,
8876 "casting between pointer-to-function and "
8877 "pointer-to-object is conditionally-supported");
8878 return build_nop_reinterpret (type
, expr
);
8880 else if (gnu_vector_type_p (type
) && scalarish_type_p (intype
))
8881 return convert_to_vector (type
, rvalue (expr
));
8882 else if (gnu_vector_type_p (intype
)
8883 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
8884 return convert_to_integer_nofold (type
, expr
);
8889 if (complain
& tf_error
)
8890 error_at (loc
, "invalid cast from type %qT to type %qT",
8892 return error_mark_node
;
8895 expr
= cp_convert (type
, expr
, complain
);
8896 if (TREE_CODE (expr
) == NOP_EXPR
)
8897 /* Mark any nop_expr that created as a reintepret_cast. */
8898 REINTERPRET_CAST_P (expr
) = true;
8903 build_reinterpret_cast (location_t loc
, tree type
, tree expr
,
8904 tsubst_flags_t complain
)
8908 if (type
== error_mark_node
|| expr
== error_mark_node
)
8909 return error_mark_node
;
8911 if (processing_template_decl
)
8913 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
8915 if (!TREE_SIDE_EFFECTS (t
)
8916 && type_dependent_expression_p (expr
))
8917 /* There might turn out to be side effects inside expr. */
8918 TREE_SIDE_EFFECTS (t
) = 1;
8919 r
= convert_from_reference (t
);
8920 protected_set_expr_location (r
, loc
);
8924 r
= build_reinterpret_cast_1 (loc
, type
, expr
, /*c_cast_p=*/false,
8925 /*valid_p=*/NULL
, complain
);
8926 if (r
!= error_mark_node
)
8928 maybe_warn_about_useless_cast (loc
, type
, expr
, complain
);
8929 maybe_warn_about_cast_ignoring_quals (loc
, type
, complain
);
8931 protected_set_expr_location (r
, loc
);
8935 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
8936 return an appropriate expression. Otherwise, return
8937 error_mark_node. If the cast is not valid, and COMPLAIN is true,
8938 then a diagnostic will be issued. If VALID_P is non-NULL, we are
8939 performing a C-style cast, its value upon return will indicate
8940 whether or not the conversion succeeded. */
8943 build_const_cast_1 (location_t loc
, tree dst_type
, tree expr
,
8944 tsubst_flags_t complain
, bool *valid_p
)
8947 tree reference_type
;
8949 /* Callers are responsible for handling error_mark_node as a
8950 destination type. */
8951 gcc_assert (dst_type
!= error_mark_node
);
8952 /* In a template, callers should be building syntactic
8953 representations of casts, not using this machinery. */
8954 gcc_assert (!processing_template_decl
);
8956 /* Assume the conversion is invalid. */
8960 if (!INDIRECT_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
8962 if (complain
& tf_error
)
8963 error_at (loc
, "invalid use of %<const_cast%> with type %qT, "
8964 "which is not a pointer, reference, "
8965 "nor a pointer-to-data-member type", dst_type
);
8966 return error_mark_node
;
8969 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
8971 if (complain
& tf_error
)
8972 error_at (loc
, "invalid use of %<const_cast%> with type %qT, "
8973 "which is a pointer or reference to a function type",
8975 return error_mark_node
;
8978 /* A prvalue of non-class type is cv-unqualified. */
8979 dst_type
= cv_unqualified (dst_type
);
8981 /* Save casted types in the function's used types hash table. */
8982 used_types_insert (dst_type
);
8984 src_type
= TREE_TYPE (expr
);
8985 /* Expressions do not really have reference types. */
8986 if (TYPE_REF_P (src_type
))
8987 src_type
= TREE_TYPE (src_type
);
8989 /* [expr.const.cast]
8991 For two object types T1 and T2, if a pointer to T1 can be explicitly
8992 converted to the type "pointer to T2" using a const_cast, then the
8993 following conversions can also be made:
8995 -- an lvalue of type T1 can be explicitly converted to an lvalue of
8996 type T2 using the cast const_cast<T2&>;
8998 -- a glvalue of type T1 can be explicitly converted to an xvalue of
8999 type T2 using the cast const_cast<T2&&>; and
9001 -- if T1 is a class type, a prvalue of type T1 can be explicitly
9002 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
9004 if (TYPE_REF_P (dst_type
))
9006 reference_type
= dst_type
;
9007 if (!TYPE_REF_IS_RVALUE (dst_type
)
9013 if (complain
& tf_error
)
9014 error_at (loc
, "invalid %<const_cast%> of an rvalue of type %qT "
9016 src_type
, dst_type
);
9017 return error_mark_node
;
9019 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
9020 src_type
= build_pointer_type (src_type
);
9024 reference_type
= NULL_TREE
;
9025 /* If the destination type is not a reference type, the
9026 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
9027 conversions are performed. */
9028 src_type
= type_decays_to (src_type
);
9029 if (src_type
== error_mark_node
)
9030 return error_mark_node
;
9033 if (TYPE_PTR_P (src_type
) || TYPE_PTRDATAMEM_P (src_type
))
9035 if (comp_ptr_ttypes_const (dst_type
, src_type
, bounds_none
))
9040 /* This cast is actually a C-style cast. Issue a warning if
9041 the user is making a potentially unsafe cast. */
9042 check_for_casting_away_constness (loc
, src_type
, dst_type
,
9043 CAST_EXPR
, complain
);
9044 /* ??? comp_ptr_ttypes_const ignores TYPE_ALIGN. */
9045 if ((STRICT_ALIGNMENT
|| warn_cast_align
== 2)
9046 && (complain
& tf_warning
)
9047 && min_align_of_type (TREE_TYPE (dst_type
))
9048 > min_align_of_type (TREE_TYPE (src_type
)))
9049 warning_at (loc
, OPT_Wcast_align
, "cast from %qH to %qI "
9050 "increases required alignment of target type",
9051 src_type
, dst_type
);
9055 expr
= cp_build_addr_expr (expr
, complain
);
9056 if (expr
== error_mark_node
)
9057 return error_mark_node
;
9058 expr
= build_nop (reference_type
, expr
);
9059 return convert_from_reference (expr
);
9063 expr
= decay_conversion (expr
, complain
);
9064 if (expr
== error_mark_node
)
9065 return error_mark_node
;
9067 /* build_c_cast puts on a NOP_EXPR to make the result not an
9068 lvalue. Strip such NOP_EXPRs if VALUE is being used in
9069 non-lvalue context. */
9070 if (TREE_CODE (expr
) == NOP_EXPR
9071 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
9072 expr
= TREE_OPERAND (expr
, 0);
9073 return build_nop (dst_type
, expr
);
9077 && !at_least_as_qualified_p (TREE_TYPE (dst_type
),
9078 TREE_TYPE (src_type
)))
9079 check_for_casting_away_constness (loc
, src_type
, dst_type
,
9080 CAST_EXPR
, complain
);
9083 if (complain
& tf_error
)
9084 error_at (loc
, "invalid %<const_cast%> from type %qT to type %qT",
9085 src_type
, dst_type
);
9086 return error_mark_node
;
9090 build_const_cast (location_t loc
, tree type
, tree expr
,
9091 tsubst_flags_t complain
)
9095 if (type
== error_mark_node
|| error_operand_p (expr
))
9096 return error_mark_node
;
9098 if (processing_template_decl
)
9100 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
9102 if (!TREE_SIDE_EFFECTS (t
)
9103 && type_dependent_expression_p (expr
))
9104 /* There might turn out to be side effects inside expr. */
9105 TREE_SIDE_EFFECTS (t
) = 1;
9106 r
= convert_from_reference (t
);
9107 protected_set_expr_location (r
, loc
);
9111 r
= build_const_cast_1 (loc
, type
, expr
, complain
, /*valid_p=*/NULL
);
9112 if (r
!= error_mark_node
)
9114 maybe_warn_about_useless_cast (loc
, type
, expr
, complain
);
9115 maybe_warn_about_cast_ignoring_quals (loc
, type
, complain
);
9117 protected_set_expr_location (r
, loc
);
9121 /* Like cp_build_c_cast, but for the c-common bits. */
9124 build_c_cast (location_t loc
, tree type
, tree expr
)
9126 return cp_build_c_cast (loc
, type
, expr
, tf_warning_or_error
);
9129 /* Like the "build_c_cast" used for c-common, but using cp_expr to
9130 preserve location information even for tree nodes that don't
9134 build_c_cast (location_t loc
, tree type
, cp_expr expr
)
9136 cp_expr result
= cp_build_c_cast (loc
, type
, expr
, tf_warning_or_error
);
9137 result
.set_location (loc
);
9141 /* Build an expression representing an explicit C-style cast to type
9142 TYPE of expression EXPR. */
9145 cp_build_c_cast (location_t loc
, tree type
, tree expr
,
9146 tsubst_flags_t complain
)
9152 if (type
== error_mark_node
|| error_operand_p (expr
))
9153 return error_mark_node
;
9155 if (processing_template_decl
)
9157 tree t
= build_min (CAST_EXPR
, type
,
9158 tree_cons (NULL_TREE
, value
, NULL_TREE
));
9159 /* We don't know if it will or will not have side effects. */
9160 TREE_SIDE_EFFECTS (t
) = 1;
9161 return convert_from_reference (t
);
9164 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
9165 'Class') should always be retained, because this information aids
9166 in method lookup. */
9167 if (objc_is_object_ptr (type
)
9168 && objc_is_object_ptr (TREE_TYPE (expr
)))
9169 return build_nop (type
, expr
);
9171 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
9172 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
9173 if (!TYPE_REF_P (type
)
9174 && TREE_CODE (value
) == NOP_EXPR
9175 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
9176 value
= TREE_OPERAND (value
, 0);
9178 if (TREE_CODE (type
) == ARRAY_TYPE
)
9180 /* Allow casting from T1* to T2[] because Cfront allows it.
9181 NIHCL uses it. It is not valid ISO C++ however. */
9182 if (TYPE_PTR_P (TREE_TYPE (expr
)))
9184 if (complain
& tf_error
)
9185 permerror (loc
, "ISO C++ forbids casting to an array type %qT",
9188 return error_mark_node
;
9189 type
= build_pointer_type (TREE_TYPE (type
));
9193 if (complain
& tf_error
)
9194 error_at (loc
, "ISO C++ forbids casting to an array type %qT",
9196 return error_mark_node
;
9200 if (FUNC_OR_METHOD_TYPE_P (type
))
9202 if (complain
& tf_error
)
9203 error_at (loc
, "invalid cast to function type %qT", type
);
9204 return error_mark_node
;
9207 if (TYPE_PTR_P (type
)
9208 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
9209 /* Casting to an integer of smaller size is an error detected elsewhere. */
9210 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
9211 /* Don't warn about converting any constant. */
9212 && !TREE_CONSTANT (value
))
9213 warning_at (loc
, OPT_Wint_to_pointer_cast
,
9214 "cast to pointer from integer of different size");
9216 /* A C-style cast can be a const_cast. */
9217 result
= build_const_cast_1 (loc
, type
, value
, complain
& tf_warning
,
9221 if (result
!= error_mark_node
)
9223 maybe_warn_about_useless_cast (loc
, type
, value
, complain
);
9224 maybe_warn_about_cast_ignoring_quals (loc
, type
, complain
);
9226 else if (complain
& tf_error
)
9227 build_const_cast_1 (loc
, type
, value
, tf_error
, &valid_p
);
9231 /* Or a static cast. */
9232 result
= build_static_cast_1 (loc
, type
, value
, /*c_cast_p=*/true,
9233 &valid_p
, complain
);
9234 /* Or a reinterpret_cast. */
9236 result
= build_reinterpret_cast_1 (loc
, type
, value
, /*c_cast_p=*/true,
9237 &valid_p
, complain
);
9238 /* The static_cast or reinterpret_cast may be followed by a
9241 /* A valid cast may result in errors if, for example, a
9242 conversion to an ambiguous base class is required. */
9243 && !error_operand_p (result
))
9247 maybe_warn_about_useless_cast (loc
, type
, value
, complain
);
9248 maybe_warn_about_cast_ignoring_quals (loc
, type
, complain
);
9250 /* Non-class rvalues always have cv-unqualified type. */
9251 if (!CLASS_TYPE_P (type
))
9252 type
= TYPE_MAIN_VARIANT (type
);
9253 result_type
= TREE_TYPE (result
);
9254 if (!CLASS_TYPE_P (result_type
) && !TYPE_REF_P (type
))
9255 result_type
= TYPE_MAIN_VARIANT (result_type
);
9256 /* If the type of RESULT does not match TYPE, perform a
9257 const_cast to make it match. If the static_cast or
9258 reinterpret_cast succeeded, we will differ by at most
9259 cv-qualification, so the follow-on const_cast is guaranteed
9261 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
9263 result
= build_const_cast_1 (loc
, type
, result
, tf_none
, &valid_p
);
9264 gcc_assert (valid_p
);
9269 return error_mark_node
;
9272 /* Warn when a value is moved to itself with std::move. LHS is the target,
9273 RHS may be the std::move call, and LOC is the location of the whole
9277 maybe_warn_self_move (location_t loc
, tree lhs
, tree rhs
)
9279 if (!warn_self_move
)
9282 /* C++98 doesn't know move. */
9283 if (cxx_dialect
< cxx11
)
9286 if (processing_template_decl
)
9289 if (!REFERENCE_REF_P (rhs
)
9290 || TREE_CODE (TREE_OPERAND (rhs
, 0)) != CALL_EXPR
)
9292 tree fn
= TREE_OPERAND (rhs
, 0);
9293 if (!is_std_move_p (fn
))
9296 /* Just a little helper to strip * and various NOPs. */
9297 auto extract_op
= [] (tree
&op
) {
9299 while (INDIRECT_REF_P (op
))
9300 op
= TREE_OPERAND (op
, 0);
9301 op
= maybe_undo_parenthesized_ref (op
);
9302 STRIP_ANY_LOCATION_WRAPPER (op
);
9305 tree arg
= CALL_EXPR_ARG (fn
, 0);
9307 if (TREE_CODE (arg
) == ADDR_EXPR
)
9308 arg
= TREE_OPERAND (arg
, 0);
9309 tree type
= TREE_TYPE (lhs
);
9310 tree orig_lhs
= lhs
;
9312 if (cp_tree_equal (lhs
, arg
))
9314 auto_diagnostic_group d
;
9315 if (warning_at (loc
, OPT_Wself_move
,
9316 "moving %qE of type %qT to itself", orig_lhs
, type
))
9317 inform (loc
, "remove %<std::move%> call");
9321 /* For use from the C common bits. */
9323 build_modify_expr (location_t location
,
9324 tree lhs
, tree
/*lhs_origtype*/,
9325 enum tree_code modifycode
,
9326 location_t
/*rhs_location*/, tree rhs
,
9327 tree
/*rhs_origtype*/)
9329 return cp_build_modify_expr (location
, lhs
, modifycode
, rhs
,
9330 tf_warning_or_error
);
9333 /* Build an assignment expression of lvalue LHS from value RHS.
9334 MODIFYCODE is the code for a binary operator that we use
9335 to combine the old value of LHS with RHS to get the new value.
9336 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
9338 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
9341 cp_build_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
9342 tree rhs
, tsubst_flags_t complain
)
9344 lhs
= mark_lvalue_use_nonread (lhs
);
9346 tree result
= NULL_TREE
;
9348 tree lhstype
= TREE_TYPE (lhs
);
9350 tree olhstype
= lhstype
;
9351 bool plain_assign
= (modifycode
== NOP_EXPR
);
9352 bool compound_side_effects_p
= false;
9353 tree preeval
= NULL_TREE
;
9355 /* Avoid duplicate error messages from operands that had errors. */
9356 if (error_operand_p (lhs
) || error_operand_p (rhs
))
9357 return error_mark_node
;
9359 while (TREE_CODE (lhs
) == COMPOUND_EXPR
)
9361 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
9362 compound_side_effects_p
= true;
9363 lhs
= TREE_OPERAND (lhs
, 1);
9366 /* Handle control structure constructs used as "lvalues". Note that we
9367 leave COMPOUND_EXPR on the LHS because it is sequenced after the RHS. */
9368 switch (TREE_CODE (lhs
))
9370 /* Handle --foo = 5; as these are valid constructs in C++. */
9371 case PREDECREMENT_EXPR
:
9372 case PREINCREMENT_EXPR
:
9373 if (compound_side_effects_p
)
9374 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
9375 lhs
= genericize_compound_lvalue (lhs
);
9377 /* If we had (bar, --foo) = 5; or (bar, (baz, --foo)) = 5;
9378 and looked through the COMPOUND_EXPRs, readd them now around
9379 the resulting lhs. */
9380 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
9382 lhs
= build2 (COMPOUND_EXPR
, lhstype
, TREE_OPERAND (olhs
, 0), lhs
);
9383 tree
*ptr
= &TREE_OPERAND (lhs
, 1);
9384 for (olhs
= TREE_OPERAND (olhs
, 1);
9385 TREE_CODE (olhs
) == COMPOUND_EXPR
;
9386 olhs
= TREE_OPERAND (olhs
, 1))
9388 *ptr
= build2 (COMPOUND_EXPR
, lhstype
,
9389 TREE_OPERAND (olhs
, 0), *ptr
);
9390 ptr
= &TREE_OPERAND (*ptr
, 1);
9396 if (compound_side_effects_p
)
9397 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
9398 lhs
= genericize_compound_lvalue (lhs
);
9399 goto maybe_add_compound
;
9403 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
9404 when neither operand has side-effects. */
9405 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
9406 return error_mark_node
;
9408 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
9409 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
9411 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
9412 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
9414 TREE_OPERAND (lhs
, 0),
9415 TREE_OPERAND (lhs
, 1)),
9416 TREE_OPERAND (lhs
, 0),
9417 TREE_OPERAND (lhs
, 1));
9420 /* Handle (a ? b : c) used as an "lvalue". */
9423 /* Produce (a ? (b = rhs) : (c = rhs))
9424 except that the RHS goes through a save-expr
9425 so the code to compute it is only emitted once. */
9426 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
9428 if (complain
& tf_error
)
9429 error_at (cp_expr_loc_or_loc (rhs
, loc
),
9430 "void value not ignored as it ought to be");
9431 return error_mark_node
;
9434 rhs
= stabilize_expr (rhs
, &preeval
);
9436 /* Check this here to avoid odd errors when trying to convert
9437 a throw to the type of the COND_EXPR. */
9438 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
9439 return error_mark_node
;
9441 tree op1
= TREE_OPERAND (lhs
, 1);
9442 if (TREE_CODE (op1
) != THROW_EXPR
)
9443 op1
= cp_build_modify_expr (loc
, op1
, modifycode
, rhs
, complain
);
9444 /* When sanitizing undefined behavior, even when rhs doesn't need
9445 stabilization at this point, the sanitization might add extra
9446 SAVE_EXPRs in there and so make sure there is no tree sharing
9447 in the rhs, otherwise those SAVE_EXPRs will have initialization
9448 only in one of the two branches. */
9449 if (sanitize_flags_p (SANITIZE_UNDEFINED
9450 | SANITIZE_UNDEFINED_NONDEFAULT
))
9451 rhs
= unshare_expr (rhs
);
9452 tree op2
= TREE_OPERAND (lhs
, 2);
9453 if (TREE_CODE (op2
) != THROW_EXPR
)
9454 op2
= cp_build_modify_expr (loc
, op2
, modifycode
, rhs
, complain
);
9455 tree cond
= build_conditional_expr (input_location
,
9456 TREE_OPERAND (lhs
, 0), op1
, op2
,
9459 if (cond
== error_mark_node
)
9461 /* If we had (e, (a ? b : c)) = d; or (e, (f, (a ? b : c))) = d;
9462 and looked through the COMPOUND_EXPRs, readd them now around
9463 the resulting cond before adding the preevaluated rhs. */
9464 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
9466 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
9467 TREE_OPERAND (olhs
, 0), cond
);
9468 tree
*ptr
= &TREE_OPERAND (cond
, 1);
9469 for (olhs
= TREE_OPERAND (olhs
, 1);
9470 TREE_CODE (olhs
) == COMPOUND_EXPR
;
9471 olhs
= TREE_OPERAND (olhs
, 1))
9473 *ptr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
9474 TREE_OPERAND (olhs
, 0), *ptr
);
9475 ptr
= &TREE_OPERAND (*ptr
, 1);
9478 /* Make sure the code to compute the rhs comes out
9479 before the split. */
9489 if (modifycode
== INIT_EXPR
)
9491 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
9492 /* Do the default thing. */;
9493 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
9495 /* Compound literal. */
9496 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
9497 /* Call convert to generate an error; see PR 11063. */
9498 rhs
= convert (lhstype
, rhs
);
9499 result
= cp_build_init_expr (lhs
, rhs
);
9500 TREE_SIDE_EFFECTS (result
) = 1;
9503 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
9504 /* Do the default thing. */;
9507 releasing_vec rhs_vec
= make_tree_vector_single (rhs
);
9508 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
9509 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
9511 if (result
== NULL_TREE
)
9512 return error_mark_node
;
9518 lhs
= require_complete_type (lhs
, complain
);
9519 if (lhs
== error_mark_node
)
9520 return error_mark_node
;
9522 if (modifycode
== NOP_EXPR
)
9524 maybe_warn_self_move (loc
, lhs
, rhs
);
9526 if (c_dialect_objc ())
9528 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
9533 /* `operator=' is not an inheritable operator. */
9534 if (! MAYBE_CLASS_TYPE_P (lhstype
))
9535 /* Do the default thing. */;
9538 result
= build_new_op (input_location
, MODIFY_EXPR
,
9539 LOOKUP_NORMAL
, lhs
, rhs
,
9540 make_node (NOP_EXPR
), NULL_TREE
,
9541 /*overload=*/NULL
, complain
);
9542 if (result
== NULL_TREE
)
9543 return error_mark_node
;
9550 tree init
= NULL_TREE
;
9552 /* A binary op has been requested. Combine the old LHS
9553 value with the RHS producing the value we should actually
9554 store into the LHS. */
9555 gcc_assert (!((TYPE_REF_P (lhstype
)
9556 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
9557 || MAYBE_CLASS_TYPE_P (lhstype
)));
9559 /* Preevaluate the RHS to make sure its evaluation is complete
9560 before the lvalue-to-rvalue conversion of the LHS:
9562 [expr.ass] With respect to an indeterminately-sequenced
9563 function call, the operation of a compound assignment is a
9564 single evaluation. [ Note: Therefore, a function call shall
9565 not intervene between the lvalue-to-rvalue conversion and the
9566 side effect associated with any single compound assignment
9567 operator. -- end note ] */
9568 lhs
= cp_stabilize_reference (lhs
);
9569 rhs
= decay_conversion (rhs
, complain
);
9570 if (rhs
== error_mark_node
)
9571 return error_mark_node
;
9572 rhs
= stabilize_expr (rhs
, &init
);
9573 newrhs
= cp_build_binary_op (loc
, modifycode
, lhs
, rhs
, complain
);
9574 if (newrhs
== error_mark_node
)
9576 if (complain
& tf_error
)
9577 inform (loc
, " in evaluation of %<%Q(%#T, %#T)%>",
9578 modifycode
, TREE_TYPE (lhs
), TREE_TYPE (rhs
));
9579 return error_mark_node
;
9583 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
9585 /* Now it looks like a plain assignment. */
9586 modifycode
= NOP_EXPR
;
9587 if (c_dialect_objc ())
9589 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
9594 gcc_assert (!TYPE_REF_P (lhstype
));
9595 gcc_assert (!TYPE_REF_P (TREE_TYPE (newrhs
)));
9598 /* The left-hand side must be an lvalue. */
9599 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
9600 return error_mark_node
;
9602 /* Warn about modifying something that is `const'. Don't warn if
9603 this is initialization. */
9604 if (modifycode
!= INIT_EXPR
9605 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
9606 /* Functions are not modifiable, even though they are
9608 || FUNC_OR_METHOD_TYPE_P (TREE_TYPE (lhs
))
9609 /* If it's an aggregate and any field is const, then it is
9610 effectively const. */
9611 || (CLASS_TYPE_P (lhstype
)
9612 && C_TYPE_FIELDS_READONLY (lhstype
))))
9614 if (complain
& tf_error
)
9615 cxx_readonly_error (loc
, lhs
, lv_assign
);
9616 return error_mark_node
;
9619 /* If storing into a structure or union member, it may have been given a
9620 lowered bitfield type. We need to convert to the declared type first,
9621 so retrieve it now. */
9623 olhstype
= unlowered_expr_type (lhs
);
9625 /* Convert new value to destination type. */
9627 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
9631 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
9633 if (modifycode
!= INIT_EXPR
)
9635 if (complain
& tf_error
)
9637 "assigning to an array from an initializer list");
9638 return error_mark_node
;
9640 if (check_array_initializer (lhs
, lhstype
, newrhs
))
9641 return error_mark_node
;
9642 newrhs
= digest_init (lhstype
, newrhs
, complain
);
9643 if (newrhs
== error_mark_node
)
9644 return error_mark_node
;
9647 /* C++11 8.5/17: "If the destination type is an array of characters,
9648 an array of char16_t, an array of char32_t, or an array of wchar_t,
9649 and the initializer is a string literal...". */
9650 else if ((TREE_CODE (tree_strip_any_location_wrapper (newrhs
))
9652 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
9653 && modifycode
== INIT_EXPR
)
9655 newrhs
= digest_init (lhstype
, newrhs
, complain
);
9656 if (newrhs
== error_mark_node
)
9657 return error_mark_node
;
9660 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
9661 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
9663 if (complain
& tf_error
)
9664 error_at (loc
, "incompatible types in assignment of %qT to %qT",
9665 TREE_TYPE (rhs
), lhstype
);
9666 return error_mark_node
;
9669 /* Allow array assignment in compiler-generated code. */
9670 else if (DECL_P (lhs
) && DECL_ARTIFICIAL (lhs
))
9671 /* OK, used by coroutines (co-await-initlist1.C). */;
9672 else if (!current_function_decl
9673 || !DECL_DEFAULTED_FN (current_function_decl
))
9675 /* This routine is used for both initialization and assignment.
9676 Make sure the diagnostic message differentiates the context. */
9677 if (complain
& tf_error
)
9679 if (modifycode
== INIT_EXPR
)
9680 error_at (loc
, "array used as initializer");
9682 error_at (loc
, "invalid array assignment");
9684 return error_mark_node
;
9687 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
9688 ? 1 + (modifycode
!= INIT_EXPR
): 0;
9689 result
= build_vec_init (lhs
, NULL_TREE
, newrhs
,
9690 /*explicit_value_init_p=*/false,
9691 from_array
, complain
);
9695 if (modifycode
== INIT_EXPR
)
9696 /* Calls with INIT_EXPR are all direct-initialization, so don't set
9697 LOOKUP_ONLYCONVERTING. */
9698 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
9699 ICR_INIT
, NULL_TREE
, 0,
9700 complain
| tf_no_cleanup
);
9702 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
9703 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
9705 if (!same_type_p (lhstype
, olhstype
))
9706 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
9708 if (modifycode
!= INIT_EXPR
)
9710 if (TREE_CODE (newrhs
) == CALL_EXPR
9711 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
9712 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
9714 /* Can't initialize directly from a TARGET_EXPR, since that would
9715 cause the lhs to be constructed twice, and possibly result in
9716 accidental self-initialization. So we force the TARGET_EXPR to be
9717 expanded without a target. */
9718 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
9719 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
9720 TREE_OPERAND (newrhs
, 0));
9723 if (newrhs
== error_mark_node
)
9724 return error_mark_node
;
9726 if (c_dialect_objc () && flag_objc_gc
)
9728 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
9734 result
= build2_loc (loc
, modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
9735 lhstype
, lhs
, newrhs
);
9736 if (modifycode
== INIT_EXPR
)
9737 set_target_expr_eliding (newrhs
);
9739 TREE_SIDE_EFFECTS (result
) = 1;
9741 suppress_warning (result
, OPT_Wparentheses
);
9745 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), preeval
, result
);
9750 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
9751 tree rhs
, tree lookups
, tsubst_flags_t complain
)
9753 tree orig_lhs
= lhs
;
9754 tree orig_rhs
= rhs
;
9755 tree overload
= NULL_TREE
;
9757 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
9758 return cp_expr (error_mark_node
, loc
);
9760 tree op
= build_min (modifycode
, void_type_node
, NULL_TREE
, NULL_TREE
);
9762 if (processing_template_decl
)
9764 if (type_dependent_expression_p (lhs
)
9765 || type_dependent_expression_p (rhs
))
9767 tree rval
= build_min_nt_loc (loc
, MODOP_EXPR
, lhs
, op
, rhs
);
9768 if (modifycode
!= NOP_EXPR
)
9770 = build_dependent_operator_type (lookups
, modifycode
, true);
9776 if (modifycode
== NOP_EXPR
)
9777 rval
= cp_build_modify_expr (loc
, lhs
, modifycode
, rhs
, complain
);
9779 rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
,
9780 lhs
, rhs
, op
, lookups
, &overload
, complain
);
9781 if (rval
== error_mark_node
)
9782 return error_mark_node
;
9783 if (processing_template_decl
)
9785 if (overload
!= NULL_TREE
)
9786 return (build_min_non_dep_op_overload
9787 (MODIFY_EXPR
, rval
, overload
, orig_lhs
, orig_rhs
));
9789 return (build_min_non_dep
9790 (MODOP_EXPR
, rval
, orig_lhs
, op
, orig_rhs
));
9795 /* Helper function for get_delta_difference which assumes FROM is a base
9796 class of TO. Returns a delta for the conversion of pointer-to-member
9797 of FROM to pointer-to-member of TO. If the conversion is invalid and
9798 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
9799 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
9800 If C_CAST_P is true, this conversion is taking place as part of a
9804 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
9805 tsubst_flags_t complain
)
9810 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
9813 if (binfo
== error_mark_node
)
9815 if (!(complain
& tf_error
))
9816 return error_mark_node
;
9818 inform (input_location
, " in pointer to member function conversion");
9819 return size_zero_node
;
9823 if (kind
!= bk_via_virtual
)
9824 return BINFO_OFFSET (binfo
);
9826 /* FROM is a virtual base class of TO. Issue an error or warning
9827 depending on whether or not this is a reinterpret cast. */
9829 if (!(complain
& tf_error
))
9830 return error_mark_node
;
9832 error ("pointer to member conversion via virtual base %qT",
9833 BINFO_TYPE (binfo_from_vbase (binfo
)));
9835 return size_zero_node
;
9842 /* Get difference in deltas for different pointer to member function
9843 types. If the conversion is invalid and tf_error is not set in
9844 COMPLAIN, returns error_mark_node, otherwise returns an integer
9845 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
9846 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
9847 conversions as well. If C_CAST_P is true this conversion is taking
9848 place as part of a C-style cast.
9850 Note that the naming of FROM and TO is kind of backwards; the return
9851 value is what we add to a TO in order to get a FROM. They are named
9852 this way because we call this function to find out how to convert from
9853 a pointer to member of FROM to a pointer to member of TO. */
9856 get_delta_difference (tree from
, tree to
,
9857 bool allow_inverse_p
,
9858 bool c_cast_p
, tsubst_flags_t complain
)
9862 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
9863 /* Pointer to member of incomplete class is permitted*/
9864 result
= size_zero_node
;
9866 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
9868 if (result
== error_mark_node
)
9869 return error_mark_node
;
9873 if (!allow_inverse_p
)
9875 if (!(complain
& tf_error
))
9876 return error_mark_node
;
9878 error_not_base_type (from
, to
);
9879 inform (input_location
, " in pointer to member conversion");
9880 result
= size_zero_node
;
9884 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
9886 if (result
== error_mark_node
)
9887 return error_mark_node
;
9890 result
= size_diffop_loc (input_location
,
9891 size_zero_node
, result
);
9894 if (!(complain
& tf_error
))
9895 return error_mark_node
;
9897 error_not_base_type (from
, to
);
9898 inform (input_location
, " in pointer to member conversion");
9899 result
= size_zero_node
;
9904 return convert_to_integer (ptrdiff_type_node
, result
);
9907 /* Return a constructor for the pointer-to-member-function TYPE using
9908 the other components as specified. */
9911 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
9916 vec
<constructor_elt
, va_gc
> *v
;
9918 /* Pull the FIELD_DECLs out of the type. */
9919 pfn_field
= TYPE_FIELDS (type
);
9920 delta_field
= DECL_CHAIN (pfn_field
);
9922 /* Make sure DELTA has the type we want. */
9923 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
9925 /* Convert to the correct target type if necessary. */
9926 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
9928 /* Finish creating the initializer. */
9930 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
9931 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
9932 u
= build_constructor (type
, v
);
9933 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
9934 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
9935 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
9937 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
9942 /* Build a constructor for a pointer to member function. It can be
9943 used to initialize global variables, local variable, or used
9944 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
9947 If FORCE is nonzero, then force this conversion, even if
9948 we would rather not do it. Usually set when using an explicit
9949 cast. A C-style cast is being processed iff C_CAST_P is true.
9951 Return error_mark_node, if something goes wrong. */
9954 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
9955 tsubst_flags_t complain
)
9961 if (error_operand_p (pfn
))
9962 return error_mark_node
;
9964 pfn_type
= TREE_TYPE (pfn
);
9965 to_type
= build_ptrmemfunc_type (type
);
9967 /* Handle multiple conversions of pointer to member functions. */
9968 if (TYPE_PTRMEMFUNC_P (pfn_type
))
9970 tree delta
= NULL_TREE
;
9971 tree npfn
= NULL_TREE
;
9975 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
9976 LOOKUP_NORMAL
, complain
))
9978 if (complain
& tf_error
)
9979 error ("invalid conversion to type %qT from type %qT",
9982 return error_mark_node
;
9985 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
9986 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
9988 c_cast_p
, complain
);
9989 if (n
== error_mark_node
)
9990 return error_mark_node
;
9992 STRIP_ANY_LOCATION_WRAPPER (pfn
);
9994 /* We don't have to do any conversion to convert a
9995 pointer-to-member to its own type. But, we don't want to
9996 just return a PTRMEM_CST if there's an explicit cast; that
9997 cast should make the expression an invalid template argument. */
9998 if (TREE_CODE (pfn
) != PTRMEM_CST
9999 && same_type_p (to_type
, pfn_type
))
10002 if (TREE_SIDE_EFFECTS (pfn
))
10003 pfn
= save_expr (pfn
);
10005 /* Obtain the function pointer and the current DELTA. */
10006 if (TREE_CODE (pfn
) == PTRMEM_CST
)
10007 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
10010 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
10011 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
10014 /* Just adjust the DELTA field. */
10015 gcc_assert (same_type_ignoring_top_level_qualifiers_p
10016 (TREE_TYPE (delta
), ptrdiff_type_node
));
10017 if (!integer_zerop (n
))
10019 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
10020 n
= cp_build_binary_op (input_location
,
10021 LSHIFT_EXPR
, n
, integer_one_node
,
10023 delta
= cp_build_binary_op (input_location
,
10024 PLUS_EXPR
, delta
, n
, complain
);
10026 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
10029 /* Handle null pointer to member function conversions. */
10030 if (null_ptr_cst_p (pfn
))
10032 pfn
= cp_build_c_cast (input_location
,
10033 TYPE_PTRMEMFUNC_FN_TYPE_RAW (to_type
),
10035 return build_ptrmemfunc1 (to_type
,
10040 if (type_unknown_p (pfn
))
10041 return instantiate_type (type
, pfn
, complain
);
10043 fn
= TREE_OPERAND (pfn
, 0);
10044 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
10045 /* In a template, we will have preserved the
10047 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
10048 return make_ptrmem_cst (to_type
, fn
);
10051 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
10054 ??? There is no consistency as to the types returned for the above
10055 values. Some code acts as if it were a sizetype and some as if it were
10056 integer_type_node. */
10059 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
10061 tree type
= TREE_TYPE (cst
);
10062 tree fn
= PTRMEM_CST_MEMBER (cst
);
10063 tree ptr_class
, fn_class
;
10065 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
10067 /* The class that the function belongs to. */
10068 fn_class
= DECL_CONTEXT (fn
);
10070 /* The class that we're creating a pointer to member of. */
10071 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
10073 /* First, calculate the adjustment to the function's class. */
10074 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
10075 /*c_cast_p=*/0, tf_warning_or_error
);
10077 if (!DECL_VIRTUAL_P (fn
))
10079 tree t
= build_addr_func (fn
, tf_warning_or_error
);
10080 if (TREE_CODE (t
) == ADDR_EXPR
)
10081 SET_EXPR_LOCATION (t
, PTRMEM_CST_LOCATION (cst
));
10082 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), t
);
10086 /* If we're dealing with a virtual function, we have to adjust 'this'
10087 again, to point to the base which provides the vtable entry for
10088 fn; the call will do the opposite adjustment. */
10089 tree orig_class
= DECL_CONTEXT (fn
);
10090 tree binfo
= binfo_or_else (orig_class
, fn_class
);
10091 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
10092 *delta
, BINFO_OFFSET (binfo
));
10094 /* We set PFN to the vtable offset at which the function can be
10095 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
10096 case delta is shifted left, and then incremented). */
10097 *pfn
= DECL_VINDEX (fn
);
10098 *pfn
= fold_build2 (MULT_EXPR
, integer_type_node
, *pfn
,
10099 TYPE_SIZE_UNIT (vtable_entry_type
));
10101 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
10103 case ptrmemfunc_vbit_in_pfn
:
10104 *pfn
= fold_build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
10108 case ptrmemfunc_vbit_in_delta
:
10109 *delta
= fold_build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
10110 *delta
, integer_one_node
);
10111 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
10112 *delta
, integer_one_node
);
10116 gcc_unreachable ();
10119 *pfn
= fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
10123 /* Return an expression for PFN from the pointer-to-member function
10127 pfn_from_ptrmemfunc (tree t
)
10129 if (TREE_CODE (t
) == PTRMEM_CST
)
10134 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
10139 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
10142 /* Return an expression for DELTA from the pointer-to-member function
10146 delta_from_ptrmemfunc (tree t
)
10148 if (TREE_CODE (t
) == PTRMEM_CST
)
10153 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
10158 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
10161 /* Convert value RHS to type TYPE as preparation for an assignment to
10162 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
10163 implicit conversion is. If FNDECL is non-NULL, we are doing the
10164 conversion in order to pass the PARMNUMth argument of FNDECL.
10165 If FNDECL is NULL, we are doing the conversion in function pointer
10166 argument passing, conversion in initialization, etc. */
10169 convert_for_assignment (tree type
, tree rhs
,
10170 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
10171 tsubst_flags_t complain
, int flags
)
10174 enum tree_code coder
;
10176 location_t rhs_loc
= cp_expr_loc_or_input_loc (rhs
);
10177 bool has_loc
= EXPR_LOCATION (rhs
) != UNKNOWN_LOCATION
;
10178 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue,
10179 but preserve location wrappers. */
10180 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
10181 && !location_wrapper_p (rhs
))
10182 rhs
= TREE_OPERAND (rhs
, 0);
10184 /* Handle [dcl.init.list] direct-list-initialization from
10185 single element of enumeration with a fixed underlying type. */
10186 if (is_direct_enum_init (type
, rhs
))
10188 tree elt
= CONSTRUCTOR_ELT (rhs
, 0)->value
;
10189 if (check_narrowing (ENUM_UNDERLYING_TYPE (type
), elt
, complain
))
10191 warning_sentinel
w (warn_useless_cast
);
10192 warning_sentinel
w2 (warn_ignored_qualifiers
);
10193 rhs
= cp_build_c_cast (rhs_loc
, type
, elt
, complain
);
10196 rhs
= error_mark_node
;
10199 rhstype
= TREE_TYPE (rhs
);
10200 coder
= TREE_CODE (rhstype
);
10202 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
10203 && vector_types_convertible_p (type
, rhstype
, true))
10205 rhs
= mark_rvalue_use (rhs
);
10206 return convert (type
, rhs
);
10209 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
10210 return error_mark_node
;
10211 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
10212 return error_mark_node
;
10214 /* The RHS of an assignment cannot have void type. */
10215 if (coder
== VOID_TYPE
)
10217 if (complain
& tf_error
)
10218 error_at (rhs_loc
, "void value not ignored as it ought to be");
10219 return error_mark_node
;
10222 if (c_dialect_objc ())
10226 tree rname
= fndecl
;
10237 selector
= objc_message_selector ();
10239 if (selector
&& parmno
> 1)
10246 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
10248 rhs
= mark_rvalue_use (rhs
);
10249 return convert (type
, rhs
);
10255 The expression is implicitly converted (clause _conv_) to the
10256 cv-unqualified type of the left operand.
10258 We allow bad conversions here because by the time we get to this point
10259 we are committed to doing the conversion. If we end up doing a bad
10260 conversion, convert_like will complain. */
10261 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
10263 /* When -Wno-pmf-conversions is use, we just silently allow
10264 conversions from pointers-to-members to plain pointers. If
10265 the conversion doesn't work, cp_convert will complain. */
10267 && TYPE_PTR_P (type
)
10268 && TYPE_PTRMEMFUNC_P (rhstype
))
10269 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
10272 if (complain
& tf_error
)
10274 /* If the right-hand side has unknown type, then it is an
10275 overloaded function. Call instantiate_type to get error
10277 if (rhstype
== unknown_type_node
)
10279 tree r
= instantiate_type (type
, rhs
, tf_warning_or_error
);
10280 /* -fpermissive might allow this; recurse. */
10281 if (!seen_error ())
10282 return convert_for_assignment (type
, r
, errtype
, fndecl
,
10283 parmnum
, complain
, flags
);
10286 complain_about_bad_argument (rhs_loc
,
10291 range_label_for_type_mismatch
label (rhstype
, type
);
10292 gcc_rich_location
richloc (rhs_loc
, has_loc
? &label
: NULL
);
10293 auto_diagnostic_group d
;
10297 case ICR_DEFAULT_ARGUMENT
:
10298 error_at (&richloc
,
10299 "cannot convert %qH to %qI in default argument",
10303 error_at (&richloc
,
10304 "cannot convert %qH to %qI in argument passing",
10307 case ICR_CONVERTING
:
10308 error_at (&richloc
, "cannot convert %qH to %qI",
10312 error_at (&richloc
,
10313 "cannot convert %qH to %qI in initialization",
10317 error_at (&richloc
, "cannot convert %qH to %qI in return",
10321 error_at (&richloc
,
10322 "cannot convert %qH to %qI in assignment",
10330 /* See if we can be more helpful. */
10331 maybe_show_nonconverting_candidate (type
, rhstype
, rhs
, flags
);
10333 if (TYPE_PTR_P (rhstype
)
10334 && TYPE_PTR_P (type
)
10335 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
10336 && CLASS_TYPE_P (TREE_TYPE (type
))
10337 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
10338 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
10339 (TREE_TYPE (rhstype
))),
10340 "class type %qT is incomplete", TREE_TYPE (rhstype
));
10342 return error_mark_node
;
10345 if (warn_suggest_attribute_format
)
10347 const enum tree_code codel
= TREE_CODE (type
);
10348 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
10350 && check_missing_format_attribute (type
, rhstype
)
10351 && (complain
& tf_warning
))
10355 case ICR_DEFAULT_ARGUMENT
:
10357 warning (OPT_Wsuggest_attribute_format
,
10358 "parameter %qP of %qD might be a candidate "
10359 "for a format attribute", parmnum
, fndecl
);
10361 warning (OPT_Wsuggest_attribute_format
,
10362 "parameter might be a candidate "
10363 "for a format attribute");
10365 case ICR_CONVERTING
:
10366 warning (OPT_Wsuggest_attribute_format
,
10367 "target of conversion might be a candidate "
10368 "for a format attribute");
10371 warning (OPT_Wsuggest_attribute_format
,
10372 "target of initialization might be a candidate "
10373 "for a format attribute");
10376 warning (OPT_Wsuggest_attribute_format
,
10377 "return type might be a candidate "
10378 "for a format attribute");
10381 warning (OPT_Wsuggest_attribute_format
,
10382 "left-hand side of assignment might be a candidate "
10383 "for a format attribute");
10390 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
10391 maybe_warn_unparenthesized_assignment (rhs
, /*nested_p=*/true, complain
);
10393 if (complain
& tf_warning
)
10394 warn_for_address_of_packed_member (type
, rhs
);
10396 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
10400 /* Convert RHS to be of type TYPE.
10401 If EXP is nonzero, it is the target of the initialization.
10402 ERRTYPE indicates what kind of error the implicit conversion is.
10404 Two major differences between the behavior of
10405 `convert_for_assignment' and `convert_for_initialization'
10406 are that references are bashed in the former, while
10407 copied in the latter, and aggregates are assigned in
10408 the former (operator=) while initialized in the
10411 If using constructor make sure no conversion operator exists, if one does
10412 exist, an ambiguity exists. */
10415 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
10416 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
10417 tsubst_flags_t complain
)
10419 enum tree_code codel
= TREE_CODE (type
);
10421 enum tree_code coder
;
10423 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
10424 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
10425 if (TREE_CODE (rhs
) == NOP_EXPR
10426 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
10427 && codel
!= REFERENCE_TYPE
)
10428 rhs
= TREE_OPERAND (rhs
, 0);
10430 if (type
== error_mark_node
10431 || rhs
== error_mark_node
10432 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
10433 return error_mark_node
;
10435 if (MAYBE_CLASS_TYPE_P (non_reference (type
)))
10437 else if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
10438 && TREE_CODE (type
) != ARRAY_TYPE
10439 && (!TYPE_REF_P (type
)
10440 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
10441 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
10442 && !TYPE_REFFN_P (type
))
10443 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
10444 rhs
= decay_conversion (rhs
, complain
);
10446 rhstype
= TREE_TYPE (rhs
);
10447 coder
= TREE_CODE (rhstype
);
10449 if (coder
== ERROR_MARK
)
10450 return error_mark_node
;
10452 /* We accept references to incomplete types, so we can
10453 return here before checking if RHS is of complete type. */
10455 if (codel
== REFERENCE_TYPE
)
10457 auto_diagnostic_group d
;
10458 /* This should eventually happen in convert_arguments. */
10459 int savew
= 0, savee
= 0;
10462 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
10463 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
10466 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
10467 inform (get_fndecl_argument_location (fndecl
, parmnum
),
10468 "in passing argument %P of %qD", parmnum
, fndecl
);
10473 exp
= require_complete_type (exp
, complain
);
10474 if (exp
== error_mark_node
)
10475 return error_mark_node
;
10477 type
= complete_type (type
);
10479 if (DIRECT_INIT_EXPR_P (type
, rhs
))
10480 /* Don't try to do copy-initialization if we already have
10481 direct-initialization. */
10484 if (MAYBE_CLASS_TYPE_P (type
))
10485 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
10487 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
10491 /* If RETVAL is the address of, or a reference to, a local variable or
10492 temporary give an appropriate warning and return true. */
10495 maybe_warn_about_returning_address_of_local (tree retval
, location_t loc
)
10497 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
10498 tree whats_returned
= fold_for_warn (retval
);
10500 loc
= cp_expr_loc_or_input_loc (retval
);
10504 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
10505 whats_returned
= TREE_OPERAND (whats_returned
, 1);
10506 else if (CONVERT_EXPR_P (whats_returned
)
10507 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
10508 whats_returned
= TREE_OPERAND (whats_returned
, 0);
10513 if (TREE_CODE (whats_returned
) == TARGET_EXPR
10514 && is_std_init_list (TREE_TYPE (whats_returned
)))
10516 tree init
= TARGET_EXPR_INITIAL (whats_returned
);
10517 if (TREE_CODE (init
) == CONSTRUCTOR
)
10518 /* Pull out the array address. */
10519 whats_returned
= CONSTRUCTOR_ELT (init
, 0)->value
;
10520 else if (TREE_CODE (init
) == INDIRECT_REF
)
10521 /* The source of a trivial copy looks like *(T*)&var. */
10522 whats_returned
= TREE_OPERAND (init
, 0);
10525 STRIP_NOPS (whats_returned
);
10528 /* As a special case, we handle a call to std::move or std::forward. */
10529 if (TREE_CODE (whats_returned
) == CALL_EXPR
10530 && (is_std_move_p (whats_returned
)
10531 || is_std_forward_p (whats_returned
)))
10533 tree arg
= CALL_EXPR_ARG (whats_returned
, 0);
10534 return maybe_warn_about_returning_address_of_local (arg
, loc
);
10537 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
10539 whats_returned
= TREE_OPERAND (whats_returned
, 0);
10541 while (TREE_CODE (whats_returned
) == COMPONENT_REF
10542 || TREE_CODE (whats_returned
) == ARRAY_REF
)
10543 whats_returned
= TREE_OPERAND (whats_returned
, 0);
10545 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
10546 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
10548 if (TYPE_REF_P (valtype
))
10549 warning_at (loc
, OPT_Wreturn_local_addr
,
10550 "returning reference to temporary");
10551 else if (TYPE_PTR_P (valtype
))
10552 warning_at (loc
, OPT_Wreturn_local_addr
,
10553 "returning pointer to temporary");
10554 else if (is_std_init_list (valtype
))
10555 warning_at (loc
, OPT_Winit_list_lifetime
,
10556 "returning temporary %<initializer_list%> does not extend "
10557 "the lifetime of the underlying array");
10561 STRIP_ANY_LOCATION_WRAPPER (whats_returned
);
10563 if (DECL_P (whats_returned
)
10564 && DECL_NAME (whats_returned
)
10565 && DECL_FUNCTION_SCOPE_P (whats_returned
)
10566 && !is_capture_proxy (whats_returned
)
10567 && !(TREE_STATIC (whats_returned
)
10568 || TREE_PUBLIC (whats_returned
)))
10570 if (VAR_P (whats_returned
)
10571 && DECL_DECOMPOSITION_P (whats_returned
)
10572 && DECL_DECOMP_BASE (whats_returned
)
10573 && DECL_HAS_VALUE_EXPR_P (whats_returned
))
10575 /* When returning address of a structured binding, if the structured
10576 binding is not a reference, continue normally, if it is a
10577 reference, recurse on the initializer of the structured
10579 tree base
= DECL_DECOMP_BASE (whats_returned
);
10580 if (TYPE_REF_P (TREE_TYPE (base
)))
10582 if (tree init
= DECL_INITIAL (base
))
10583 return maybe_warn_about_returning_address_of_local (init
, loc
);
10589 auto_diagnostic_group d
;
10590 if (TYPE_REF_P (valtype
))
10591 w
= warning_at (loc
, OPT_Wreturn_local_addr
,
10592 "reference to local variable %qD returned",
10594 else if (is_std_init_list (valtype
))
10595 w
= warning_at (loc
, OPT_Winit_list_lifetime
,
10596 "returning local %<initializer_list%> variable %qD "
10597 "does not extend the lifetime of the underlying array",
10599 else if (POINTER_TYPE_P (valtype
)
10600 && TREE_CODE (whats_returned
) == LABEL_DECL
)
10601 w
= warning_at (loc
, OPT_Wreturn_local_addr
,
10602 "address of label %qD returned",
10604 else if (POINTER_TYPE_P (valtype
))
10605 w
= warning_at (loc
, OPT_Wreturn_local_addr
,
10606 "address of local variable %qD returned",
10609 inform (DECL_SOURCE_LOCATION (whats_returned
),
10617 /* Returns true if DECL is in the std namespace. */
10620 decl_in_std_namespace_p (tree decl
)
10624 decl
= decl_namespace_context (decl
);
10625 if (DECL_NAMESPACE_STD_P (decl
))
10627 /* Allow inline namespaces inside of std namespace, e.g. with
10628 --enable-symvers=gnu-versioned-namespace std::forward would be
10629 actually std::_8::forward. */
10630 if (!DECL_NAMESPACE_INLINE_P (decl
))
10632 decl
= CP_DECL_CONTEXT (decl
);
10637 /* Returns true if FN, a CALL_EXPR, is a call to std::forward. */
10640 is_std_forward_p (tree fn
)
10642 /* std::forward only takes one argument. */
10643 if (call_expr_nargs (fn
) != 1)
10646 tree fndecl
= cp_get_callee_fndecl_nofold (fn
);
10647 if (!decl_in_std_namespace_p (fndecl
))
10650 tree name
= DECL_NAME (fndecl
);
10651 return name
&& id_equal (name
, "forward");
10654 /* Returns true if FN, a CALL_EXPR, is a call to std::move. */
10657 is_std_move_p (tree fn
)
10659 /* std::move only takes one argument. */
10660 if (call_expr_nargs (fn
) != 1)
10663 tree fndecl
= cp_get_callee_fndecl_nofold (fn
);
10664 if (!decl_in_std_namespace_p (fndecl
))
10667 tree name
= DECL_NAME (fndecl
);
10668 return name
&& id_equal (name
, "move");
10671 /* Returns true if RETVAL is a good candidate for the NRVO as per
10672 [class.copy.elision]. FUNCTYPE is the type the function is declared
10676 can_do_nrvo_p (tree retval
, tree functype
)
10678 if (functype
== error_mark_node
)
10681 STRIP_ANY_LOCATION_WRAPPER (retval
);
10682 tree result
= DECL_RESULT (current_function_decl
);
10683 return (retval
!= NULL_TREE
10684 && !processing_template_decl
10685 /* Must be a local, automatic variable. */
10687 && DECL_CONTEXT (retval
) == current_function_decl
10688 && !TREE_STATIC (retval
)
10689 /* And not a lambda or anonymous union proxy. */
10690 && !DECL_HAS_VALUE_EXPR_P (retval
)
10691 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
10692 /* The cv-unqualified type of the returned value must be the
10693 same as the cv-unqualified return type of the
10695 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (retval
)),
10696 TYPE_MAIN_VARIANT (functype
))
10697 /* And the returned value must be non-volatile. */
10698 && !TYPE_VOLATILE (TREE_TYPE (retval
)));
10701 /* True if we would like to perform NRVO, i.e. can_do_nrvo_p is true and we
10702 would otherwise return in memory. */
10705 want_nrvo_p (tree retval
, tree functype
)
10707 return (can_do_nrvo_p (retval
, functype
)
10708 && aggregate_value_p (functype
, current_function_decl
));
10711 /* Like can_do_nrvo_p, but we check if we're trying to move a class
10715 can_elide_copy_prvalue_p (tree retval
, tree functype
)
10717 if (functype
== error_mark_node
)
10720 STRIP_ANY_LOCATION_WRAPPER (retval
);
10721 return (retval
!= NULL_TREE
10722 && !glvalue_p (retval
)
10723 && same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (retval
)),
10724 TYPE_MAIN_VARIANT (functype
))
10725 && !TYPE_VOLATILE (TREE_TYPE (retval
)));
10728 /* If we should treat RETVAL, an expression being returned, as if it were
10729 designated by an rvalue, returns it adjusted accordingly; otherwise, returns
10730 NULL_TREE. See [class.copy.elision]. RETURN_P is true if this is a return
10731 context (rather than throw). */
10734 treat_lvalue_as_rvalue_p (tree expr
, bool return_p
)
10736 if (cxx_dialect
== cxx98
)
10739 tree retval
= expr
;
10740 STRIP_ANY_LOCATION_WRAPPER (retval
);
10741 if (REFERENCE_REF_P (retval
))
10742 retval
= TREE_OPERAND (retval
, 0);
10744 /* An implicitly movable entity is a variable of automatic storage duration
10745 that is either a non-volatile object or (C++20) an rvalue reference to a
10746 non-volatile object type. */
10747 if (!(((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
10748 || TREE_CODE (retval
) == PARM_DECL
)
10749 && !TREE_STATIC (retval
)
10750 && !CP_TYPE_VOLATILE_P (non_reference (TREE_TYPE (retval
)))
10751 && (TREE_CODE (TREE_TYPE (retval
)) != REFERENCE_TYPE
10752 || (cxx_dialect
>= cxx20
10753 && TYPE_REF_IS_RVALUE (TREE_TYPE (retval
))))))
10756 /* If the expression in a return or co_return statement is a (possibly
10757 parenthesized) id-expression that names an implicitly movable entity
10758 declared in the body or parameter-declaration-clause of the innermost
10759 enclosing function or lambda-expression, */
10760 if (DECL_CONTEXT (retval
) != current_function_decl
)
10764 expr
= move (expr
);
10765 if (expr
== error_mark_node
)
10767 return set_implicit_rvalue_p (expr
);
10770 /* if the operand of a throw-expression is a (possibly parenthesized)
10771 id-expression that names an implicitly movable entity whose scope does not
10772 extend beyond the compound-statement of the innermost try-block or
10773 function-try-block (if any) whose compound-statement or ctor-initializer
10774 encloses the throw-expression, */
10776 /* C++20 added move on throw of parms. */
10777 if (TREE_CODE (retval
) == PARM_DECL
&& cxx_dialect
< cxx20
)
10780 for (cp_binding_level
*b
= current_binding_level
;
10781 ; b
= b
->level_chain
)
10783 for (tree decl
= b
->names
; decl
; decl
= TREE_CHAIN (decl
))
10784 if (decl
== retval
)
10785 return set_implicit_rvalue_p (move (expr
));
10786 if (b
->kind
== sk_function_parms
|| b
->kind
== sk_try
)
10791 /* Warn about dubious usage of std::move (in a return statement, if RETURN_P
10792 is true). EXPR is the std::move expression; TYPE is the type of the object
10793 being initialized. */
10796 maybe_warn_pessimizing_move (tree expr
, tree type
, bool return_p
)
10798 if (!(warn_pessimizing_move
|| warn_redundant_move
))
10801 const location_t loc
= cp_expr_loc_or_input_loc (expr
);
10803 /* C++98 doesn't know move. */
10804 if (cxx_dialect
< cxx11
)
10807 /* Wait until instantiation time, since we can't gauge if we should do
10808 the NRVO until then. */
10809 if (processing_template_decl
)
10812 /* This is only interesting for class types. */
10813 if (!CLASS_TYPE_P (type
))
10816 bool wrapped_p
= false;
10817 /* A a = std::move (A()); */
10818 if (TREE_CODE (expr
) == TREE_LIST
)
10820 if (list_length (expr
) == 1)
10822 expr
= TREE_VALUE (expr
);
10828 /* A a = {std::move (A())};
10829 A a{std::move (A())}; */
10830 else if (TREE_CODE (expr
) == CONSTRUCTOR
)
10832 if (CONSTRUCTOR_NELTS (expr
) == 1)
10834 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
10841 /* First, check if this is a call to std::move. */
10842 if (!REFERENCE_REF_P (expr
)
10843 || TREE_CODE (TREE_OPERAND (expr
, 0)) != CALL_EXPR
)
10845 tree fn
= TREE_OPERAND (expr
, 0);
10846 if (!is_std_move_p (fn
))
10848 tree arg
= CALL_EXPR_ARG (fn
, 0);
10849 if (TREE_CODE (arg
) != NOP_EXPR
)
10851 /* If we're looking at *std::move<T&> ((T &) &arg), do the pessimizing N/RVO
10852 and implicitly-movable warnings. */
10853 if (TREE_CODE (TREE_OPERAND (arg
, 0)) == ADDR_EXPR
)
10855 arg
= TREE_OPERAND (arg
, 0);
10856 arg
= TREE_OPERAND (arg
, 0);
10857 arg
= convert_from_reference (arg
);
10858 if (can_elide_copy_prvalue_p (arg
, type
))
10860 auto_diagnostic_group d
;
10861 if (warning_at (loc
, OPT_Wpessimizing_move
,
10862 "moving a temporary object prevents copy elision"))
10863 inform (loc
, "remove %<std::move%> call");
10865 /* The rest of the warnings is only relevant for when we are returning
10866 from a function. */
10871 /* Warn if we could do copy elision were it not for the move. */
10872 if (can_do_nrvo_p (arg
, type
))
10874 auto_diagnostic_group d
;
10875 if (!warning_suppressed_p (expr
, OPT_Wpessimizing_move
)
10876 && warning_at (loc
, OPT_Wpessimizing_move
,
10877 "moving a local object in a return statement "
10878 "prevents copy elision"))
10879 inform (loc
, "remove %<std::move%> call");
10881 /* Warn if the move is redundant. It is redundant when we would
10882 do maybe-rvalue overload resolution even without std::move. */
10883 else if (warn_redundant_move
10884 /* This doesn't apply for return {std::move (t)};. */
10886 && !warning_suppressed_p (expr
, OPT_Wredundant_move
)
10887 && (moved
= treat_lvalue_as_rvalue_p (arg
, /*return*/true)))
10889 /* Make sure that overload resolution would actually succeed
10890 if we removed the std::move call. */
10891 tree t
= convert_for_initialization (NULL_TREE
, type
,
10894 | LOOKUP_ONLYCONVERTING
),
10895 ICR_RETURN
, NULL_TREE
, 0,
10897 /* If this worked, implicit rvalue would work, so the call to
10898 std::move is redundant. */
10899 if (t
!= error_mark_node
)
10901 auto_diagnostic_group d
;
10902 if (warning_at (loc
, OPT_Wredundant_move
,
10903 "redundant move in return statement"))
10904 inform (loc
, "remove %<std::move%> call");
10908 /* Also try to warn about redundant std::move in code such as
10911 return std::move(t);
10913 for which EXPR will be something like
10914 *std::move<const T&> ((const struct T &) (const struct T *) t)
10915 and where the std::move does nothing if T does not have a T(const T&&)
10916 constructor, because the argument is const. It will not use T(T&&)
10917 because that would mean losing the const. */
10918 else if (warn_redundant_move
10919 && !warning_suppressed_p (expr
, OPT_Wredundant_move
)
10920 && TYPE_REF_P (TREE_TYPE (arg
))
10921 && CP_TYPE_CONST_P (TREE_TYPE (TREE_TYPE (arg
))))
10923 tree rtype
= TREE_TYPE (TREE_TYPE (arg
));
10924 if (!same_type_ignoring_top_level_qualifiers_p (rtype
, type
))
10926 /* Check for the unlikely case there's T(const T&&) (we don't care if
10928 for (tree fn
: ovl_range (CLASSTYPE_CONSTRUCTORS (rtype
)))
10929 if (move_fn_p (fn
))
10931 tree t
= TREE_VALUE (FUNCTION_FIRST_USER_PARMTYPE (fn
));
10932 if (UNLIKELY (CP_TYPE_CONST_P (TREE_TYPE (t
))))
10935 auto_diagnostic_group d
;
10937 ? warning_at (loc
, OPT_Wredundant_move
,
10938 "redundant move in return statement")
10939 : warning_at (loc
, OPT_Wredundant_move
,
10940 "redundant move in initialization"))
10941 inform (loc
, "remove %<std::move%> call");
10945 /* Check that returning RETVAL from the current function is valid.
10946 Return an expression explicitly showing all conversions required to
10947 change RETVAL into the function return type, and to assign it to
10948 the DECL_RESULT for the function. Set *NO_WARNING to true if
10949 code reaches end of non-void function warning shouldn't be issued
10950 on this RETURN_EXPR. Set *DANGLING to true if code returns the
10951 address of a local variable. */
10954 check_return_expr (tree retval
, bool *no_warning
, bool *dangling
)
10957 /* The type actually returned by the function. */
10959 /* The type the function is declared to return, or void if
10960 the declared type is incomplete. */
10962 int fn_returns_value_p
;
10963 location_t loc
= cp_expr_loc_or_input_loc (retval
);
10965 *no_warning
= false;
10968 /* A `volatile' function is one that isn't supposed to return, ever.
10969 (This is a G++ extension, used to get better code for functions
10970 that call the `volatile' function.) */
10971 if (TREE_THIS_VOLATILE (current_function_decl
))
10972 warning (0, "function declared %<noreturn%> has a %<return%> statement");
10974 /* Check for various simple errors. */
10975 if (DECL_DESTRUCTOR_P (current_function_decl
))
10978 error_at (loc
, "returning a value from a destructor");
10980 if (targetm
.cxx
.cdtor_returns_this () && !processing_template_decl
)
10981 retval
= current_class_ptr
;
10985 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
10987 if (in_function_try_handler
)
10988 /* If a return statement appears in a handler of the
10989 function-try-block of a constructor, the program is ill-formed. */
10990 error ("cannot return from a handler of a function-try-block of a constructor");
10992 /* You can't return a value from a constructor. */
10993 error_at (loc
, "returning a value from a constructor");
10995 if (targetm
.cxx
.cdtor_returns_this () && !processing_template_decl
)
10996 retval
= current_class_ptr
;
11001 const tree saved_retval
= retval
;
11003 if (processing_template_decl
)
11005 current_function_returns_value
= 1;
11007 if (check_for_bare_parameter_packs (retval
))
11008 return error_mark_node
;
11010 /* If one of the types might be void, we can't tell whether we're
11011 returning a value. */
11012 if ((WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
11013 && !FNDECL_USED_AUTO (current_function_decl
))
11014 || (retval
!= NULL_TREE
11015 && (TREE_TYPE (retval
) == NULL_TREE
11016 || WILDCARD_TYPE_P (TREE_TYPE (retval
)))))
11020 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
11022 /* Deduce auto return type from a return statement. */
11023 if (FNDECL_USED_AUTO (current_function_decl
))
11025 tree pattern
= DECL_SAVED_AUTO_RETURN_TYPE (current_function_decl
);
11029 if (!retval
&& !is_auto (pattern
))
11031 /* Give a helpful error message. */
11032 error ("return-statement with no value, in function returning %qT",
11034 inform (input_location
, "only plain %<auto%> return type can be "
11035 "deduced to %<void%>");
11036 type
= error_mark_node
;
11038 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
11040 error ("returning initializer list");
11041 type
= error_mark_node
;
11046 retval
= void_node
;
11047 auto_node
= type_uses_auto (pattern
);
11048 type
= do_auto_deduction (pattern
, retval
, auto_node
,
11049 tf_warning_or_error
, adc_return_type
);
11052 if (type
== error_mark_node
)
11054 else if (functype
== pattern
)
11055 apply_deduced_return_type (current_function_decl
, type
);
11056 else if (!same_type_p (type
, functype
))
11058 if (LAMBDA_FUNCTION_P (current_function_decl
))
11059 error_at (loc
, "inconsistent types %qT and %qT deduced for "
11060 "lambda return type", functype
, type
);
11062 error_at (loc
, "inconsistent deduction for auto return type: "
11063 "%qT and then %qT", functype
, type
);
11068 result
= DECL_RESULT (current_function_decl
);
11069 valtype
= TREE_TYPE (result
);
11070 gcc_assert (valtype
!= NULL_TREE
);
11071 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
11073 /* Check for a return statement with no return value in a function
11074 that's supposed to return a value. */
11075 if (!retval
&& fn_returns_value_p
)
11077 if (functype
!= error_mark_node
)
11078 permerror (input_location
, "return-statement with no value, in "
11079 "function returning %qT", valtype
);
11080 /* Remember that this function did return. */
11081 current_function_returns_value
= 1;
11082 /* And signal caller that TREE_NO_WARNING should be set on the
11083 RETURN_EXPR to avoid control reaches end of non-void function
11084 warnings in tree-cfg.cc. */
11085 *no_warning
= true;
11087 /* Check for a return statement with a value in a function that
11088 isn't supposed to return a value. */
11089 else if (retval
&& !fn_returns_value_p
)
11091 if (VOID_TYPE_P (TREE_TYPE (retval
)))
11092 /* You can return a `void' value from a function of `void'
11093 type. In that case, we have to evaluate the expression for
11094 its side-effects. */
11095 finish_expr_stmt (retval
);
11096 else if (retval
!= error_mark_node
)
11097 permerror (loc
, "return-statement with a value, in function "
11098 "returning %qT", valtype
);
11099 current_function_returns_null
= 1;
11101 /* There's really no value to return, after all. */
11105 /* Remember that this function can sometimes return without a
11107 current_function_returns_null
= 1;
11109 /* Remember that this function did return a value. */
11110 current_function_returns_value
= 1;
11112 /* Check for erroneous operands -- but after giving ourselves a
11113 chance to provide an error about returning a value from a void
11115 if (error_operand_p (retval
))
11117 current_function_return_value
= error_mark_node
;
11118 return error_mark_node
;
11121 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
11122 if (IDENTIFIER_NEW_OP_P (DECL_NAME (current_function_decl
))
11123 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
11124 && ! flag_check_new
11125 && retval
&& null_ptr_cst_p (retval
))
11126 warning (0, "%<operator new%> must not return NULL unless it is "
11127 "declared %<throw()%> (or %<-fcheck-new%> is in effect)");
11129 /* Effective C++ rule 15. See also start_function. */
11131 && DECL_NAME (current_function_decl
) == assign_op_identifier
11132 && !type_dependent_expression_p (retval
))
11136 /* The function return type must be a reference to the current
11138 if (TYPE_REF_P (valtype
)
11139 && same_type_ignoring_top_level_qualifiers_p
11140 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
11142 /* Returning '*this' is obviously OK. */
11143 if (retval
== current_class_ref
)
11145 /* If we are calling a function whose return type is the same of
11146 the current class reference, it is ok. */
11147 else if (INDIRECT_REF_P (retval
)
11148 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
11153 warning_at (loc
, OPT_Weffc__
,
11154 "%<operator=%> should return a reference to %<*this%>");
11157 if (dependent_type_p (functype
)
11158 || type_dependent_expression_p (retval
))
11161 /* We should not have changed the return value. */
11162 gcc_assert (retval
== saved_retval
);
11163 /* We don't know if this is an lvalue or rvalue use, but
11164 either way we can mark it as read. */
11165 mark_exp_read (retval
);
11169 /* The fabled Named Return Value optimization, as per [class.copy]/15:
11171 [...] For a function with a class return type, if the expression
11172 in the return statement is the name of a local object, and the cv-
11173 unqualified type of the local object is the same as the function
11174 return type, an implementation is permitted to omit creating the tem-
11175 porary object to hold the function return value [...]
11177 So, if this is a value-returning function that always returns the same
11178 local variable, remember it.
11180 We choose the first suitable variable even if the function sometimes
11181 returns something else, but only if the variable is out of scope at the
11182 other return sites, or else we run the risk of clobbering the variable we
11183 chose if the other returned expression uses the chosen variable somehow.
11185 We don't currently do this if the first return is a non-variable, as it
11186 would be complicated to determine whether an NRV selected later was in
11187 scope at the point of the earlier return. We also don't currently support
11188 multiple variables with non-overlapping scopes (53637).
11190 See finish_function and finalize_nrv for the rest of this optimization. */
11191 tree bare_retval
= NULL_TREE
;
11194 retval
= maybe_undo_parenthesized_ref (retval
);
11195 bare_retval
= tree_strip_any_location_wrapper (retval
);
11198 bool named_return_value_okay_p
= want_nrvo_p (bare_retval
, functype
);
11199 if (fn_returns_value_p
&& flag_elide_constructors
11200 && current_function_return_value
!= bare_retval
)
11202 if (named_return_value_okay_p
11203 && current_function_return_value
== NULL_TREE
)
11204 current_function_return_value
= bare_retval
;
11205 else if (current_function_return_value
11206 && VAR_P (current_function_return_value
)
11207 && DECL_NAME (current_function_return_value
)
11208 && !decl_in_scope_p (current_function_return_value
))
11210 /* The earlier NRV is out of scope at this point, so it's safe to
11211 leave it alone; the current return can't refer to it. */;
11212 if (named_return_value_okay_p
11213 && !warning_suppressed_p (current_function_decl
, OPT_Wnrvo
))
11215 warning (OPT_Wnrvo
, "not eliding copy on return from %qD",
11217 suppress_warning (current_function_decl
, OPT_Wnrvo
);
11222 if ((named_return_value_okay_p
11223 || (current_function_return_value
11224 && current_function_return_value
!= error_mark_node
))
11225 && !warning_suppressed_p (current_function_decl
, OPT_Wnrvo
))
11227 warning (OPT_Wnrvo
, "not eliding copy on return in %qD",
11228 current_function_decl
);
11229 suppress_warning (current_function_decl
, OPT_Wnrvo
);
11231 current_function_return_value
= error_mark_node
;
11235 /* We don't need to do any conversions when there's nothing being
11240 if (!named_return_value_okay_p
)
11241 maybe_warn_pessimizing_move (retval
, functype
, /*return_p*/true);
11243 /* Do any required conversions. */
11244 if (bare_retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
11245 /* No conversions are required. */
11249 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
11251 /* The functype's return type will have been set to void, if it
11252 was an incomplete type. Just treat this as 'return;' */
11253 if (VOID_TYPE_P (functype
))
11254 return error_mark_node
;
11256 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
11257 treated as an rvalue for the purposes of overload resolution to
11258 favor move constructors over copy constructors.
11260 Note that these conditions are similar to, but not as strict as,
11261 the conditions for the named return value optimization. */
11262 bool converted
= false;
11264 /* Until C++23, this was only interesting for class type, but in C++23,
11265 we should do the below when we're converting rom/to a class/reference
11266 (a non-scalar type). */
11267 if ((cxx_dialect
< cxx23
11268 ? CLASS_TYPE_P (functype
)
11269 : !SCALAR_TYPE_P (functype
) || !SCALAR_TYPE_P (TREE_TYPE (retval
)))
11270 && (moved
= treat_lvalue_as_rvalue_p (retval
, /*return*/true)))
11271 /* In C++20 and earlier we treat the return value as an rvalue
11272 that can bind to lvalue refs. In C++23, such an expression is just
11273 an xvalue (see reference_binding). */
11276 /* The call in a (lambda) thunk needs no conversions. */
11277 if (TREE_CODE (retval
) == CALL_EXPR
11278 && call_from_lambda_thunk_p (retval
))
11281 /* First convert the value to the function's return type, then
11282 to the type of return value's location to handle the
11283 case that functype is smaller than the valtype. */
11285 retval
= convert_for_initialization
11286 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
11287 tf_warning_or_error
);
11288 retval
= convert (valtype
, retval
);
11290 /* If the conversion failed, treat this just like `return;'. */
11291 if (retval
== error_mark_node
)
11293 /* We can't initialize a register from a AGGR_INIT_EXPR. */
11294 else if (! cfun
->returns_struct
11295 && TREE_CODE (retval
) == TARGET_EXPR
11296 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
11297 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
11298 TREE_OPERAND (retval
, 0));
11299 else if (!processing_template_decl
11300 && maybe_warn_about_returning_address_of_local (retval
, loc
)
11301 && INDIRECT_TYPE_P (valtype
))
11305 /* A naive attempt to reduce the number of -Wdangling-reference false
11306 positives: if we know that this function can return a variable with
11307 static storage duration rather than one of its parameters, suppress
11309 if (warn_dangling_reference
11310 && TYPE_REF_P (functype
)
11312 && VAR_P (bare_retval
)
11313 && TREE_STATIC (bare_retval
))
11314 suppress_warning (current_function_decl
, OPT_Wdangling_reference
);
11316 if (processing_template_decl
)
11317 return saved_retval
;
11319 /* Actually copy the value returned into the appropriate location. */
11320 if (retval
&& retval
!= result
)
11322 /* If there's a postcondition for a scalar return value, wrap
11323 retval in a call to the postcondition function. */
11324 if (tree post
= apply_postcondition_to_return (retval
))
11326 retval
= cp_build_init_expr (result
, retval
);
11329 if (current_function_return_value
== bare_retval
)
11330 INIT_EXPR_NRV_P (retval
) = true;
11332 if (tree set
= maybe_set_retval_sentinel ())
11333 retval
= build2 (COMPOUND_EXPR
, void_type_node
, retval
, set
);
11335 /* If there's a postcondition for an aggregate return value, call the
11336 postcondition function after the return object is initialized. */
11337 if (tree post
= apply_postcondition_to_return (result
))
11338 retval
= build2 (COMPOUND_EXPR
, void_type_node
, retval
, post
);
11344 /* Returns nonzero if the pointer-type FROM can be converted to the
11345 pointer-type TO via a qualification conversion. If CONSTP is -1,
11346 then we return nonzero if the pointers are similar, and the
11347 cv-qualification signature of FROM is a proper subset of that of TO.
11349 If CONSTP is positive, then all outer pointers have been
11350 const-qualified. */
11353 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
11355 bool to_more_cv_qualified
= false;
11356 bool is_opaque_pointer
= false;
11358 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
11360 if (TREE_CODE (to
) != TREE_CODE (from
))
11363 if (TREE_CODE (from
) == OFFSET_TYPE
11364 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
11365 TYPE_OFFSET_BASETYPE (to
)))
11368 /* Const and volatile mean something different for function and
11369 array types, so the usual checks are not appropriate. We'll
11370 check the array type elements in further iterations. */
11371 if (!FUNC_OR_METHOD_TYPE_P (to
) && TREE_CODE (to
) != ARRAY_TYPE
)
11373 if (!at_least_as_qualified_p (to
, from
))
11376 if (!at_least_as_qualified_p (from
, to
))
11380 to_more_cv_qualified
= true;
11384 constp
&= TYPE_READONLY (to
);
11387 if (VECTOR_TYPE_P (to
))
11388 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
11390 /* P0388R4 allows a conversion from int[N] to int[] but not the
11391 other way round. When both arrays have bounds but they do
11392 not match, then no conversion is possible. */
11393 if (TREE_CODE (to
) == ARRAY_TYPE
11394 && !comp_array_types (to
, from
, bounds_first
, /*strict=*/false))
11397 if (!TYPE_PTR_P (to
)
11398 && !TYPE_PTRDATAMEM_P (to
)
11399 /* CWG 330 says we need to look through arrays. */
11400 && TREE_CODE (to
) != ARRAY_TYPE
)
11401 return ((constp
>= 0 || to_more_cv_qualified
)
11402 && (is_opaque_pointer
11403 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
11407 /* When comparing, say, char ** to char const **, this function takes
11408 the 'char *' and 'char const *'. Do not pass non-pointer/reference
11409 types to this function. */
11412 comp_ptr_ttypes (tree to
, tree from
)
11414 return comp_ptr_ttypes_real (to
, from
, 1);
11417 /* Returns true iff FNTYPE is a non-class type that involves
11418 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
11419 if a parameter type is ill-formed. */
11422 error_type_p (const_tree type
)
11426 switch (TREE_CODE (type
))
11432 case REFERENCE_TYPE
:
11434 return error_type_p (TREE_TYPE (type
));
11436 case FUNCTION_TYPE
:
11438 if (error_type_p (TREE_TYPE (type
)))
11440 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
11441 if (error_type_p (TREE_VALUE (t
)))
11446 if (TYPE_PTRMEMFUNC_P (type
))
11447 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
11455 /* Returns true if to and from are (possibly multi-level) pointers to the same
11456 type or inheritance-related types, regardless of cv-quals. */
11459 ptr_reasonably_similar (const_tree to
, const_tree from
)
11461 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
11463 /* Any target type is similar enough to void. */
11464 if (VOID_TYPE_P (to
))
11465 return !error_type_p (from
);
11466 if (VOID_TYPE_P (from
))
11467 return !error_type_p (to
);
11469 if (TREE_CODE (to
) != TREE_CODE (from
))
11472 if (TREE_CODE (from
) == OFFSET_TYPE
11473 && comptypes (TYPE_OFFSET_BASETYPE (to
),
11474 TYPE_OFFSET_BASETYPE (from
),
11475 COMPARE_BASE
| COMPARE_DERIVED
))
11478 if (VECTOR_TYPE_P (to
)
11479 && vector_types_convertible_p (to
, from
, false))
11482 if (TREE_CODE (to
) == INTEGER_TYPE
11483 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
11486 if (TREE_CODE (to
) == FUNCTION_TYPE
)
11487 return !error_type_p (to
) && !error_type_p (from
);
11489 if (!TYPE_PTR_P (to
))
11491 /* When either type is incomplete avoid DERIVED_FROM_P,
11492 which may call complete_type (c++/57942). */
11493 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
11495 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
11496 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
11501 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
11502 pointer-to-member types) are the same, ignoring cv-qualification at
11503 all levels. CB says how we should behave when comparing array bounds. */
11506 comp_ptr_ttypes_const (tree to
, tree from
, compare_bounds_t cb
)
11508 bool is_opaque_pointer
= false;
11510 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
11512 if (TREE_CODE (to
) != TREE_CODE (from
))
11515 if (TREE_CODE (from
) == OFFSET_TYPE
11516 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
11517 TYPE_OFFSET_BASETYPE (to
)))
11520 if (VECTOR_TYPE_P (to
))
11521 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
11523 if (TREE_CODE (to
) == ARRAY_TYPE
11524 /* Ignore cv-qualification, but if we see e.g. int[3] and int[4],
11526 && !comp_array_types (to
, from
, cb
, /*strict=*/false))
11529 /* CWG 330 says we need to look through arrays. */
11530 if (!TYPE_PTR_P (to
) && TREE_CODE (to
) != ARRAY_TYPE
)
11531 return (is_opaque_pointer
11532 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
11536 /* Returns the type qualifiers for this type, including the qualifiers on the
11537 elements for an array type. */
11540 cp_type_quals (const_tree type
)
11543 /* This CONST_CAST is okay because strip_array_types returns its
11544 argument unmodified and we assign it to a const_tree. */
11545 type
= strip_array_types (CONST_CAST_TREE (type
));
11546 if (type
== error_mark_node
11547 /* Quals on a FUNCTION_TYPE are memfn quals. */
11548 || TREE_CODE (type
) == FUNCTION_TYPE
)
11549 return TYPE_UNQUALIFIED
;
11550 quals
= TYPE_QUALS (type
);
11551 /* METHOD and REFERENCE_TYPEs should never have quals. */
11552 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
11553 && !TYPE_REF_P (type
))
11554 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
11555 == TYPE_UNQUALIFIED
));
11559 /* Returns the function-ref-qualifier for TYPE */
11562 type_memfn_rqual (const_tree type
)
11564 gcc_assert (FUNC_OR_METHOD_TYPE_P (type
));
11566 if (!FUNCTION_REF_QUALIFIED (type
))
11567 return REF_QUAL_NONE
;
11568 else if (FUNCTION_RVALUE_QUALIFIED (type
))
11569 return REF_QUAL_RVALUE
;
11571 return REF_QUAL_LVALUE
;
11574 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
11578 type_memfn_quals (const_tree type
)
11580 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11581 return TYPE_QUALS (type
);
11582 else if (TREE_CODE (type
) == METHOD_TYPE
)
11583 return cp_type_quals (class_of_this_parm (type
));
11585 gcc_unreachable ();
11588 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
11589 MEMFN_QUALS and its ref-qualifier to RQUAL. */
11592 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
11594 /* Could handle METHOD_TYPE here if necessary. */
11595 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
11596 if (TYPE_QUALS (type
) == memfn_quals
11597 && type_memfn_rqual (type
) == rqual
)
11600 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
11602 tree result
= build_qualified_type (type
, memfn_quals
);
11603 return build_ref_qualified_type (result
, rqual
);
11606 /* Returns nonzero if TYPE is const or volatile. */
11609 cv_qualified_p (const_tree type
)
11611 int quals
= cp_type_quals (type
);
11612 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
11615 /* Returns nonzero if the TYPE contains a mutable member. */
11618 cp_has_mutable_p (const_tree type
)
11620 /* This CONST_CAST is okay because strip_array_types returns its
11621 argument unmodified and we assign it to a const_tree. */
11622 type
= strip_array_types (CONST_CAST_TREE(type
));
11624 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
11627 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
11628 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
11629 approximation. In particular, consider:
11632 struct S { int i; };
11633 const S s = { f(); }
11635 Here, we will make "s" as TREE_READONLY (because it is declared
11636 "const") -- only to reverse ourselves upon seeing that the
11637 initializer is non-constant. */
11640 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
11642 tree type
= TREE_TYPE (decl
);
11644 if (type
== error_mark_node
)
11647 if (TREE_CODE (decl
) == TYPE_DECL
)
11650 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
11651 && type_quals
!= TYPE_UNQUALIFIED
));
11653 /* Avoid setting TREE_READONLY incorrectly. */
11654 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
11655 constructor can produce constant init, so rely on cp_finish_decl to
11656 clear TREE_READONLY if the variable has non-constant init. */
11658 /* If the type has (or might have) a mutable component, that component
11659 might be modified. */
11660 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
11661 type_quals
&= ~TYPE_QUAL_CONST
;
11663 c_apply_type_quals_to_decl (type_quals
, decl
);
11666 /* Subroutine of casts_away_constness. Make T1 and T2 point at
11667 exemplar types such that casting T1 to T2 is casting away constness
11668 if and only if there is no implicit conversion from T1 to T2. */
11671 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
11676 /* [expr.const.cast]
11678 For multi-level pointer to members and multi-level mixed pointers
11679 and pointers to members (conv.qual), the "member" aspect of a
11680 pointer to member level is ignored when determining if a const
11681 cv-qualifier has been cast away. */
11682 /* [expr.const.cast]
11684 For two pointer types:
11686 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
11687 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
11690 casting from X1 to X2 casts away constness if, for a non-pointer
11691 type T there does not exist an implicit conversion (clause
11694 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
11698 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
11699 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
11700 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
11702 *t1
= cp_build_qualified_type (void_type_node
,
11703 cp_type_quals (*t1
));
11704 *t2
= cp_build_qualified_type (void_type_node
,
11705 cp_type_quals (*t2
));
11709 quals1
= cp_type_quals (*t1
);
11710 quals2
= cp_type_quals (*t2
);
11712 if (TYPE_PTRDATAMEM_P (*t1
))
11713 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
11715 *t1
= TREE_TYPE (*t1
);
11716 if (TYPE_PTRDATAMEM_P (*t2
))
11717 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
11719 *t2
= TREE_TYPE (*t2
);
11721 casts_away_constness_r (t1
, t2
, complain
);
11722 *t1
= build_pointer_type (*t1
);
11723 *t2
= build_pointer_type (*t2
);
11724 *t1
= cp_build_qualified_type (*t1
, quals1
);
11725 *t2
= cp_build_qualified_type (*t2
, quals2
);
11728 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
11731 ??? This function returns non-zero if casting away qualifiers not
11732 just const. We would like to return to the caller exactly which
11733 qualifiers are casted away to give more accurate diagnostics.
11737 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
11739 if (TYPE_REF_P (t2
))
11741 /* [expr.const.cast]
11743 Casting from an lvalue of type T1 to an lvalue of type T2
11744 using a reference cast casts away constness if a cast from an
11745 rvalue of type "pointer to T1" to the type "pointer to T2"
11746 casts away constness. */
11747 t1
= (TYPE_REF_P (t1
) ? TREE_TYPE (t1
) : t1
);
11748 return casts_away_constness (build_pointer_type (t1
),
11749 build_pointer_type (TREE_TYPE (t2
)),
11753 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
11754 /* [expr.const.cast]
11756 Casting from an rvalue of type "pointer to data member of X
11757 of type T1" to the type "pointer to data member of Y of type
11758 T2" casts away constness if a cast from an rvalue of type
11759 "pointer to T1" to the type "pointer to T2" casts away
11761 return casts_away_constness
11762 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
11763 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
11766 /* Casting away constness is only something that makes sense for
11767 pointer or reference types. */
11768 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
11771 /* Top-level qualifiers don't matter. */
11772 t1
= TYPE_MAIN_VARIANT (t1
);
11773 t2
= TYPE_MAIN_VARIANT (t2
);
11774 casts_away_constness_r (&t1
, &t2
, complain
);
11775 if (!can_convert (t2
, t1
, complain
))
11781 /* If T is a REFERENCE_TYPE return the type to which T refers.
11782 Otherwise, return T itself. */
11785 non_reference (tree t
)
11787 if (t
&& TYPE_REF_P (t
))
11793 /* Return nonzero if REF is an lvalue valid for this language;
11794 otherwise, print an error message and return zero. USE says
11795 how the lvalue is being used and so selects the error message. */
11798 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
11800 cp_lvalue_kind kind
= lvalue_kind (ref
);
11802 if (kind
== clk_none
)
11804 if (complain
& tf_error
)
11805 lvalue_error (cp_expr_loc_or_input_loc (ref
), use
);
11808 else if (kind
& (clk_rvalueref
|clk_class
))
11810 if (!(complain
& tf_error
))
11812 /* Make this a permerror because we used to accept it. */
11813 permerror (cp_expr_loc_or_input_loc (ref
),
11814 "using rvalue as lvalue");
11819 /* Return true if a user-defined literal operator is a raw operator. */
11822 check_raw_literal_operator (const_tree decl
)
11824 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11827 bool maybe_raw_p
= false;
11829 /* Count the number and type of arguments and check for ellipsis. */
11830 for (argtype
= argtypes
, arity
= 0;
11831 argtype
&& argtype
!= void_list_node
;
11832 ++arity
, argtype
= TREE_CHAIN (argtype
))
11834 tree t
= TREE_VALUE (argtype
);
11836 if (same_type_p (t
, const_string_type_node
))
11837 maybe_raw_p
= true;
11840 return false; /* Found ellipsis. */
11842 if (!maybe_raw_p
|| arity
!= 1)
11849 /* Return true if a user-defined literal operator has one of the allowed
11853 check_literal_operator_args (const_tree decl
,
11854 bool *long_long_unsigned_p
, bool *long_double_p
)
11856 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11858 *long_long_unsigned_p
= false;
11859 *long_double_p
= false;
11860 if (processing_template_decl
|| processing_specialization
)
11861 return argtypes
== void_list_node
;
11868 /* Count the number and type of arguments and check for ellipsis. */
11869 for (argtype
= argtypes
, arity
= 0;
11870 argtype
&& argtype
!= void_list_node
;
11871 argtype
= TREE_CHAIN (argtype
))
11873 tree t
= TREE_VALUE (argtype
);
11876 if (TYPE_PTR_P (t
))
11878 bool maybe_raw_p
= false;
11880 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
11882 t
= TYPE_MAIN_VARIANT (t
);
11883 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
11884 || same_type_p (t
, wchar_type_node
)
11885 || same_type_p (t
, char8_type_node
)
11886 || same_type_p (t
, char16_type_node
)
11887 || same_type_p (t
, char32_type_node
))
11889 argtype
= TREE_CHAIN (argtype
);
11892 t
= TREE_VALUE (argtype
);
11893 if (maybe_raw_p
&& argtype
== void_list_node
)
11895 else if (same_type_p (t
, size_type_node
))
11904 else if (same_type_p (t
, long_long_unsigned_type_node
))
11907 *long_long_unsigned_p
= true;
11909 else if (same_type_p (t
, long_double_type_node
))
11912 *long_double_p
= true;
11914 else if (same_type_p (t
, char_type_node
))
11916 else if (same_type_p (t
, wchar_type_node
))
11918 else if (same_type_p (t
, char8_type_node
))
11920 else if (same_type_p (t
, char16_type_node
))
11922 else if (same_type_p (t
, char32_type_node
))
11928 return false; /* Found ellipsis. */
11930 if (arity
!= max_arity
)
11937 /* Always returns false since unlike C90, C++ has no concept of implicit
11938 function declarations. */
11941 c_decl_implicit (const_tree
)