1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987-2015 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"
33 #include "fold-const.h"
34 #include "stor-layout.h"
38 #include "diagnostic.h"
42 #include "c-family/c-common.h"
43 #include "c-family/c-objc.h"
44 #include "c-family/c-ubsan.h"
47 static tree
cp_build_addr_expr_strict (tree
, tsubst_flags_t
);
48 static tree
cp_build_function_call (tree
, tree
, tsubst_flags_t
);
49 static tree
pfn_from_ptrmemfunc (tree
);
50 static tree
delta_from_ptrmemfunc (tree
);
51 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
53 static tree
cp_pointer_int_sum (enum tree_code
, tree
, tree
, tsubst_flags_t
);
54 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
56 static int comp_ptr_ttypes_real (tree
, tree
, int);
57 static bool comp_except_types (tree
, tree
, bool);
58 static bool comp_array_types (const_tree
, const_tree
, bool);
59 static tree
pointer_diff (tree
, tree
, tree
, tsubst_flags_t
);
60 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
61 static void casts_away_constness_r (tree
*, tree
*, tsubst_flags_t
);
62 static bool casts_away_constness (tree
, tree
, tsubst_flags_t
);
63 static bool maybe_warn_about_returning_address_of_local (tree
);
64 static tree
lookup_destructor (tree
, tree
, tree
, tsubst_flags_t
);
65 static void error_args_num (location_t
, tree
, bool);
66 static int convert_arguments (tree
, vec
<tree
, va_gc
> **, tree
, int,
69 /* Do `exp = require_complete_type (exp);' to make sure exp
70 does not have an incomplete type. (That includes void types.)
71 Returns error_mark_node if the VALUE does not have
72 complete type when this function returns. */
75 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
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
;
101 require_complete_type (tree value
)
103 return require_complete_type_sfinae (value
, tf_warning_or_error
);
106 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
107 a template instantiation, do the instantiation. Returns TYPE,
108 whether or not it could be completed, unless something goes
109 horribly wrong, in which case the error_mark_node is returned. */
112 complete_type (tree type
)
114 if (type
== NULL_TREE
)
115 /* Rather than crash, we return something sure to cause an error
117 return error_mark_node
;
119 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
121 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
123 tree t
= complete_type (TREE_TYPE (type
));
124 unsigned int needs_constructing
, has_nontrivial_dtor
;
125 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
128 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
130 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
131 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
133 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
134 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
137 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
138 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
143 /* Like complete_type, but issue an error if the TYPE cannot be completed.
144 VALUE is used for informative diagnostics.
145 Returns NULL_TREE if the type cannot be made complete. */
148 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
150 type
= complete_type (type
);
151 if (type
== error_mark_node
)
152 /* We already issued an error. */
154 else if (!COMPLETE_TYPE_P (type
))
156 if (complain
& tf_error
)
157 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
165 complete_type_or_else (tree type
, tree value
)
167 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
170 /* Return truthvalue of whether type of EXP is instantiated. */
173 type_unknown_p (const_tree exp
)
175 return (TREE_CODE (exp
) == TREE_LIST
176 || TREE_TYPE (exp
) == unknown_type_node
);
180 /* Return the common type of two parameter lists.
181 We assume that comptypes has already been done and returned 1;
182 if that isn't so, this may crash.
184 As an optimization, free the space we allocate if the parameter
185 lists are already common. */
188 commonparms (tree p1
, tree p2
)
190 tree oldargs
= p1
, newargs
, n
;
194 len
= list_length (p1
);
195 newargs
= tree_last (p1
);
197 if (newargs
== void_list_node
)
206 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
211 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
213 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
215 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
218 else if (! TREE_PURPOSE (p1
))
220 if (TREE_PURPOSE (p2
))
222 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
228 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
230 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
232 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
235 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
238 TREE_VALUE (n
) = TREE_VALUE (p1
);
246 /* Given a type, perhaps copied for a typedef,
247 find the "original" version of it. */
249 original_type (tree t
)
251 int quals
= cp_type_quals (t
);
252 while (t
!= error_mark_node
253 && TYPE_NAME (t
) != NULL_TREE
)
255 tree x
= TYPE_NAME (t
);
256 if (TREE_CODE (x
) != TYPE_DECL
)
258 x
= DECL_ORIGINAL_TYPE (x
);
263 return cp_build_qualified_type (t
, quals
);
266 /* Return the common type for two arithmetic types T1 and T2 under the
267 usual arithmetic conversions. The default conversions have already
268 been applied, and enumerated types converted to their compatible
272 cp_common_type (tree t1
, tree t2
)
274 enum tree_code code1
= TREE_CODE (t1
);
275 enum tree_code code2
= TREE_CODE (t2
);
280 /* In what follows, we slightly generalize the rules given in [expr] so
281 as to deal with `long long' and `complex'. First, merge the
283 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
285 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
287 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
288 return build_type_attribute_variant (t1
, attributes
);
293 /* FIXME: Attributes. */
294 gcc_assert (ARITHMETIC_TYPE_P (t1
)
295 || VECTOR_TYPE_P (t1
)
296 || UNSCOPED_ENUM_P (t1
));
297 gcc_assert (ARITHMETIC_TYPE_P (t2
)
298 || VECTOR_TYPE_P (t2
)
299 || UNSCOPED_ENUM_P (t2
));
301 /* If one type is complex, form the common type of the non-complex
302 components, then make that complex. Use T1 or T2 if it is the
304 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
306 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
307 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
309 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
311 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
312 return build_type_attribute_variant (t1
, attributes
);
313 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
314 return build_type_attribute_variant (t2
, attributes
);
316 return build_type_attribute_variant (build_complex_type (subtype
),
320 if (code1
== VECTOR_TYPE
)
322 /* When we get here we should have two vectors of the same size.
323 Just prefer the unsigned one if present. */
324 if (TYPE_UNSIGNED (t1
))
325 return build_type_attribute_variant (t1
, attributes
);
327 return build_type_attribute_variant (t2
, attributes
);
330 /* If only one is real, use it as the result. */
331 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
332 return build_type_attribute_variant (t1
, attributes
);
333 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
334 return build_type_attribute_variant (t2
, attributes
);
336 /* Both real or both integers; use the one with greater precision. */
337 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
338 return build_type_attribute_variant (t1
, attributes
);
339 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
340 return build_type_attribute_variant (t2
, attributes
);
342 /* The types are the same; no need to do anything fancy. */
343 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
344 return build_type_attribute_variant (t1
, attributes
);
346 if (code1
!= REAL_TYPE
)
348 /* If one is unsigned long long, then convert the other to unsigned
350 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
351 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
352 return build_type_attribute_variant (long_long_unsigned_type_node
,
354 /* If one is a long long, and the other is an unsigned long, and
355 long long can represent all the values of an unsigned long, then
356 convert to a long long. Otherwise, convert to an unsigned long
357 long. Otherwise, if either operand is long long, convert the
360 Since we're here, we know the TYPE_PRECISION is the same;
361 therefore converting to long long cannot represent all the values
362 of an unsigned long, so we choose unsigned long long in that
364 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
365 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
367 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
368 ? long_long_unsigned_type_node
369 : long_long_integer_type_node
);
370 return build_type_attribute_variant (t
, attributes
);
373 /* Go through the same procedure, but for longs. */
374 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
375 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
376 return build_type_attribute_variant (long_unsigned_type_node
,
378 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
379 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
381 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
382 ? long_unsigned_type_node
: long_integer_type_node
);
383 return build_type_attribute_variant (t
, attributes
);
386 /* For __intN types, either the type is __int128 (and is lower
387 priority than the types checked above, but higher than other
388 128-bit types) or it's known to not be the same size as other
389 types (enforced in toplev.c). Prefer the unsigned type. */
390 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
392 if (int_n_enabled_p
[i
]
393 && (same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].signed_type
)
394 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].signed_type
)
395 || same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].unsigned_type
)
396 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].unsigned_type
)))
398 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
399 ? int_n_trees
[i
].unsigned_type
400 : int_n_trees
[i
].signed_type
);
401 return build_type_attribute_variant (t
, attributes
);
405 /* Otherwise prefer the unsigned one. */
406 if (TYPE_UNSIGNED (t1
))
407 return build_type_attribute_variant (t1
, attributes
);
409 return build_type_attribute_variant (t2
, attributes
);
413 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
414 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
415 return build_type_attribute_variant (long_double_type_node
,
417 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
418 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
419 return build_type_attribute_variant (double_type_node
,
421 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
422 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
423 return build_type_attribute_variant (float_type_node
,
426 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
427 the standard C++ floating-point types. Logic earlier in this
428 function has already eliminated the possibility that
429 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
430 compelling reason to choose one or the other. */
431 return build_type_attribute_variant (t1
, attributes
);
435 /* T1 and T2 are arithmetic or enumeration types. Return the type
436 that will result from the "usual arithmetic conversions" on T1 and
437 T2 as described in [expr]. */
440 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
442 gcc_assert (ARITHMETIC_TYPE_P (t1
)
443 || VECTOR_TYPE_P (t1
)
444 || UNSCOPED_ENUM_P (t1
));
445 gcc_assert (ARITHMETIC_TYPE_P (t2
)
446 || VECTOR_TYPE_P (t2
)
447 || UNSCOPED_ENUM_P (t2
));
449 /* Perform the integral promotions. We do not promote real types here. */
450 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
451 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
453 t1
= type_promotes_to (t1
);
454 t2
= type_promotes_to (t2
);
457 return cp_common_type (t1
, t2
);
461 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
462 composite_pointer_operation operation
)
467 emit_diagnostic (kind
, input_location
, 0,
468 "comparison between "
469 "distinct pointer types %qT and %qT lacks a cast",
473 emit_diagnostic (kind
, input_location
, 0,
474 "conversion between "
475 "distinct pointer types %qT and %qT lacks a cast",
478 case CPO_CONDITIONAL_EXPR
:
479 emit_diagnostic (kind
, input_location
, 0,
480 "conditional expression between "
481 "distinct pointer types %qT and %qT lacks a cast",
489 /* Subroutine of composite_pointer_type to implement the recursive
490 case. See that function for documentation of the parameters. */
493 composite_pointer_type_r (tree t1
, tree t2
,
494 composite_pointer_operation operation
,
495 tsubst_flags_t complain
)
502 /* Determine the types pointed to by T1 and T2. */
505 pointee1
= TREE_TYPE (t1
);
506 pointee2
= TREE_TYPE (t2
);
510 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
511 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
516 Otherwise, the composite pointer type is a pointer type
517 similar (_conv.qual_) to the type of one of the operands,
518 with a cv-qualification signature (_conv.qual_) that is the
519 union of the cv-qualification signatures of the operand
521 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
522 result_type
= pointee1
;
523 else if ((TYPE_PTR_P (pointee1
) && TYPE_PTR_P (pointee2
))
524 || (TYPE_PTRMEM_P (pointee1
) && TYPE_PTRMEM_P (pointee2
)))
526 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
528 if (result_type
== error_mark_node
)
529 return error_mark_node
;
533 if (complain
& tf_error
)
534 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
536 return error_mark_node
;
537 result_type
= void_type_node
;
539 result_type
= cp_build_qualified_type (result_type
,
540 (cp_type_quals (pointee1
)
541 | cp_type_quals (pointee2
)));
542 /* If the original types were pointers to members, so is the
544 if (TYPE_PTRMEM_P (t1
))
546 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
547 TYPE_PTRMEM_CLASS_TYPE (t2
)))
549 if (complain
& tf_error
)
550 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
552 return error_mark_node
;
554 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
558 result_type
= build_pointer_type (result_type
);
560 /* Merge the attributes. */
561 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
562 return build_type_attribute_variant (result_type
, attributes
);
565 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
566 ARG1 and ARG2 are the values with those types. The OPERATION is to
567 describe the operation between the pointer types,
568 in case an error occurs.
570 This routine also implements the computation of a common type for
571 pointers-to-members as per [expr.eq]. */
574 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
575 composite_pointer_operation operation
,
576 tsubst_flags_t complain
)
583 If one operand is a null pointer constant, the composite pointer
584 type is the type of the other operand. */
585 if (null_ptr_cst_p (arg1
))
587 if (null_ptr_cst_p (arg2
))
594 If one of the operands has type "pointer to cv1 void*", then
595 the other has type "pointer to cv2T", and the composite pointer
596 type is "pointer to cv12 void", where cv12 is the union of cv1
599 If either type is a pointer to void, make sure it is T1. */
600 if (TYPE_PTR_P (t2
) && VOID_TYPE_P (TREE_TYPE (t2
)))
603 /* Now, if T1 is a pointer to void, merge the qualifiers. */
604 if (TYPE_PTR_P (t1
) && VOID_TYPE_P (TREE_TYPE (t1
)))
609 if (TYPE_PTRFN_P (t2
))
611 if (complain
& tf_error
)
616 pedwarn (input_location
, OPT_Wpedantic
,
617 "ISO C++ forbids comparison between pointer "
618 "of type %<void *%> and pointer-to-function");
621 pedwarn (input_location
, OPT_Wpedantic
,
622 "ISO C++ forbids conversion between pointer "
623 "of type %<void *%> and pointer-to-function");
625 case CPO_CONDITIONAL_EXPR
:
626 pedwarn (input_location
, OPT_Wpedantic
,
627 "ISO C++ forbids conditional expression between "
628 "pointer of type %<void *%> and "
629 "pointer-to-function");
636 return error_mark_node
;
639 = cp_build_qualified_type (void_type_node
,
640 (cp_type_quals (TREE_TYPE (t1
))
641 | cp_type_quals (TREE_TYPE (t2
))));
642 result_type
= build_pointer_type (result_type
);
643 /* Merge the attributes. */
644 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
645 return build_type_attribute_variant (result_type
, attributes
);
648 if (c_dialect_objc () && TYPE_PTR_P (t1
)
651 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
652 return objc_common_type (t1
, t2
);
655 /* [expr.eq] permits the application of a pointer conversion to
656 bring the pointers to a common type. */
657 if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
658 && CLASS_TYPE_P (TREE_TYPE (t1
))
659 && CLASS_TYPE_P (TREE_TYPE (t2
))
660 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
663 class1
= TREE_TYPE (t1
);
664 class2
= TREE_TYPE (t2
);
666 if (DERIVED_FROM_P (class1
, class2
))
667 t2
= (build_pointer_type
668 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
669 else if (DERIVED_FROM_P (class2
, class1
))
670 t1
= (build_pointer_type
671 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
674 if (complain
& tf_error
)
675 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
676 return error_mark_node
;
679 /* [expr.eq] permits the application of a pointer-to-member
680 conversion to change the class type of one of the types. */
681 else if (TYPE_PTRMEM_P (t1
)
682 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
683 TYPE_PTRMEM_CLASS_TYPE (t2
)))
685 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
686 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
688 if (DERIVED_FROM_P (class1
, class2
))
689 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
690 else if (DERIVED_FROM_P (class2
, class1
))
691 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
694 if (complain
& tf_error
)
698 error ("comparison between distinct "
699 "pointer-to-member types %qT and %qT lacks a cast",
703 error ("conversion between distinct "
704 "pointer-to-member types %qT and %qT lacks a cast",
707 case CPO_CONDITIONAL_EXPR
:
708 error ("conditional expression between distinct "
709 "pointer-to-member types %qT and %qT lacks a cast",
715 return error_mark_node
;
719 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
722 /* Return the merged type of two types.
723 We assume that comptypes has already been done and returned 1;
724 if that isn't so, this may crash.
726 This just combines attributes and default arguments; any other
727 differences would cause the two types to compare unalike. */
730 merge_types (tree t1
, tree t2
)
732 enum tree_code code1
;
733 enum tree_code code2
;
736 /* Save time if the two types are the same. */
739 if (original_type (t1
) == original_type (t2
))
742 /* If one type is nonsense, use the other. */
743 if (t1
== error_mark_node
)
745 if (t2
== error_mark_node
)
748 /* Handle merging an auto redeclaration with a previous deduced
753 /* Merge the attributes. */
754 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
756 if (TYPE_PTRMEMFUNC_P (t1
))
757 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
758 if (TYPE_PTRMEMFUNC_P (t2
))
759 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
761 code1
= TREE_CODE (t1
);
762 code2
= TREE_CODE (t2
);
765 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
766 if (code1
== TYPENAME_TYPE
)
768 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
769 code1
= TREE_CODE (t1
);
773 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
774 code2
= TREE_CODE (t2
);
782 /* For two pointers, do this recursively on the target type. */
784 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
785 int quals
= cp_type_quals (t1
);
787 if (code1
== POINTER_TYPE
)
789 t1
= build_pointer_type (target
);
790 if (TREE_CODE (target
) == METHOD_TYPE
)
791 t1
= build_ptrmemfunc_type (t1
);
794 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
795 t1
= build_type_attribute_variant (t1
, attributes
);
796 t1
= cp_build_qualified_type (t1
, quals
);
805 quals
= cp_type_quals (t1
);
806 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
807 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
808 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
810 t1
= cp_build_qualified_type (t1
, quals
);
816 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
817 /* Save space: see if the result is identical to one of the args. */
818 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
819 return build_type_attribute_variant (t1
, attributes
);
820 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
821 return build_type_attribute_variant (t2
, attributes
);
822 /* Merge the element types, and have a size if either arg has one. */
823 t1
= build_cplus_array_type
824 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
829 /* Function types: prefer the one that specified arg types.
830 If both do, merge the arg types. Also merge the return types. */
832 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
833 tree p1
= TYPE_ARG_TYPES (t1
);
834 tree p2
= TYPE_ARG_TYPES (t2
);
837 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
839 /* Save space: see if the result is identical to one of the args. */
840 if (valtype
== TREE_TYPE (t1
) && ! p2
)
841 return cp_build_type_attribute_variant (t1
, attributes
);
842 if (valtype
== TREE_TYPE (t2
) && ! p1
)
843 return cp_build_type_attribute_variant (t2
, attributes
);
845 /* Simple way if one arg fails to specify argument types. */
846 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
848 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
851 parms
= commonparms (p1
, p2
);
853 rval
= build_function_type (valtype
, parms
);
854 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
855 gcc_assert (type_memfn_rqual (t1
) == type_memfn_rqual (t2
));
856 rval
= apply_memfn_quals (rval
,
857 type_memfn_quals (t1
),
858 type_memfn_rqual (t1
));
859 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
860 TYPE_RAISES_EXCEPTIONS (t2
));
861 t1
= build_exception_variant (rval
, raises
);
862 if (late_return_type_p
)
863 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
869 /* Get this value the long way, since TYPE_METHOD_BASETYPE
870 is just the main variant of this. */
871 tree basetype
= class_of_this_parm (t2
);
872 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
873 TYPE_RAISES_EXCEPTIONS (t2
));
874 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
876 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
877 bool late_return_type_2_p
= TYPE_HAS_LATE_RETURN_TYPE (t2
);
879 /* If this was a member function type, get back to the
880 original type of type member function (i.e., without
881 the class instance variable up front. */
882 t1
= build_function_type (TREE_TYPE (t1
),
883 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
884 t2
= build_function_type (TREE_TYPE (t2
),
885 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
886 t3
= merge_types (t1
, t2
);
887 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
888 TYPE_ARG_TYPES (t3
));
889 t1
= build_exception_variant (t3
, raises
);
890 t1
= build_ref_qualified_type (t1
, rqual
);
891 if (late_return_type_1_p
)
892 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
893 if (late_return_type_2_p
)
894 TYPE_HAS_LATE_RETURN_TYPE (t2
) = 1;
899 /* There is no need to merge attributes into a TYPENAME_TYPE.
900 When the type is instantiated it will have whatever
901 attributes result from the instantiation. */
907 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
909 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
912 return cp_build_type_attribute_variant (t1
, attributes
);
915 /* Return the ARRAY_TYPE type without its domain. */
918 strip_array_domain (tree type
)
921 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
922 if (TYPE_DOMAIN (type
) == NULL_TREE
)
924 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
925 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
928 /* Wrapper around cp_common_type that is used by c-common.c and other
929 front end optimizations that remove promotions.
931 Return the common type for two arithmetic types T1 and T2 under the
932 usual arithmetic conversions. The default conversions have already
933 been applied, and enumerated types converted to their compatible
937 common_type (tree t1
, tree t2
)
939 /* If one type is nonsense, use the other */
940 if (t1
== error_mark_node
)
942 if (t2
== error_mark_node
)
945 return cp_common_type (t1
, t2
);
948 /* Return the common type of two pointer types T1 and T2. This is the
949 type for the result of most arithmetic operations if the operands
950 have the given two types.
952 We assume that comp_target_types has already been done and returned
953 nonzero; if that isn't so, this may crash. */
956 common_pointer_type (tree t1
, tree t2
)
958 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
959 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
960 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
962 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
963 CPO_CONVERSION
, tf_warning_or_error
);
966 /* Compare two exception specifier types for exactness or subsetness, if
967 allowed. Returns false for mismatch, true for match (same, or
970 [except.spec] "If a class X ... objects of class X or any class publicly
971 and unambiguously derived from X. Similarly, if a pointer type Y * ...
972 exceptions of type Y * or that are pointers to any type publicly and
973 unambiguously derived from Y. Otherwise a function only allows exceptions
974 that have the same type ..."
975 This does not mention cv qualifiers and is different to what throw
976 [except.throw] and catch [except.catch] will do. They will ignore the
977 top level cv qualifiers, and allow qualifiers in the pointer to class
980 We implement the letter of the standard. */
983 comp_except_types (tree a
, tree b
, bool exact
)
985 if (same_type_p (a
, b
))
989 if (cp_type_quals (a
) || cp_type_quals (b
))
992 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
996 if (cp_type_quals (a
) || cp_type_quals (b
))
1000 if (TREE_CODE (a
) != RECORD_TYPE
1001 || TREE_CODE (b
) != RECORD_TYPE
)
1004 if (publicly_uniquely_derived_p (a
, b
))
1010 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1011 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1012 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1013 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1014 are unordered, but we've already filtered out duplicates. Most lists will
1015 be in order, we should try to make use of that. */
1018 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1027 /* First handle noexcept. */
1028 if (exact
< ce_exact
)
1030 /* noexcept(false) is compatible with no exception-specification,
1031 and stricter than any spec. */
1032 if (t1
== noexcept_false_spec
)
1033 return t2
== NULL_TREE
|| exact
== ce_derived
;
1034 /* Even a derived noexcept(false) is compatible with no
1035 exception-specification. */
1036 if (t2
== noexcept_false_spec
)
1037 return t1
== NULL_TREE
;
1039 /* Otherwise, if we aren't looking for an exact match, noexcept is
1040 equivalent to throw(). */
1041 if (t1
== noexcept_true_spec
)
1042 t1
= empty_except_spec
;
1043 if (t2
== noexcept_true_spec
)
1044 t2
= empty_except_spec
;
1047 /* If any noexcept is left, it is only comparable to itself;
1048 either we're looking for an exact match or we're redeclaring a
1049 template with dependent noexcept. */
1050 if ((t1
&& TREE_PURPOSE (t1
))
1051 || (t2
&& TREE_PURPOSE (t2
)))
1053 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1055 if (t1
== NULL_TREE
) /* T1 is ... */
1056 return t2
== NULL_TREE
|| exact
== ce_derived
;
1057 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1058 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1059 if (t2
== NULL_TREE
) /* T2 is ... */
1061 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1062 return exact
== ce_derived
;
1064 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1065 Count how many we find, to determine exactness. For exact matching and
1066 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1068 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1070 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1072 tree a
= TREE_VALUE (probe
);
1073 tree b
= TREE_VALUE (t2
);
1075 if (comp_except_types (a
, b
, exact
))
1077 if (probe
== base
&& exact
> ce_derived
)
1078 base
= TREE_CHAIN (probe
);
1083 if (probe
== NULL_TREE
)
1086 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1089 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1090 [] can match [size]. */
1093 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1102 /* The type of the array elements must be the same. */
1103 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1106 d1
= TYPE_DOMAIN (t1
);
1107 d2
= TYPE_DOMAIN (t2
);
1112 /* If one of the arrays is dimensionless, and the other has a
1113 dimension, they are of different types. However, it is valid to
1121 declarations for an array object can specify
1122 array types that differ by the presence or absence of a major
1123 array bound (_dcl.array_). */
1125 return allow_redeclaration
;
1127 /* Check that the dimensions are the same. */
1129 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1131 max1
= TYPE_MAX_VALUE (d1
);
1132 max2
= TYPE_MAX_VALUE (d2
);
1134 if (!cp_tree_equal (max1
, max2
))
1140 /* Compare the relative position of T1 and T2 into their respective
1141 template parameter list.
1142 T1 and T2 must be template parameter types.
1143 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1146 comp_template_parms_position (tree t1
, tree t2
)
1148 tree index1
, index2
;
1149 gcc_assert (t1
&& t2
1150 && TREE_CODE (t1
) == TREE_CODE (t2
)
1151 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1152 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1153 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1155 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1156 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1158 /* Then compare their relative position. */
1159 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1160 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1161 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1162 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1165 /* In C++14 we can end up comparing 'auto' to a normal template
1166 parameter. Don't confuse them. */
1167 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1168 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1173 /* Subroutine in comptypes. */
1176 structural_comptypes (tree t1
, tree t2
, int strict
)
1181 /* Suppress errors caused by previously reported errors. */
1182 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1185 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1187 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1188 current instantiation. */
1189 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1190 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1192 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1193 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1195 if (TYPE_PTRMEMFUNC_P (t1
))
1196 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1197 if (TYPE_PTRMEMFUNC_P (t2
))
1198 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1200 /* Different classes of types can't be compatible. */
1201 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1204 /* Qualifiers must match. For array types, we will check when we
1205 recur on the array element types. */
1206 if (TREE_CODE (t1
) != ARRAY_TYPE
1207 && cp_type_quals (t1
) != cp_type_quals (t2
))
1209 if (TREE_CODE (t1
) == FUNCTION_TYPE
1210 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1212 /* Need to check this before TYPE_MAIN_VARIANT.
1213 FIXME function qualifiers should really change the main variant. */
1214 if ((TREE_CODE (t1
) == FUNCTION_TYPE
1215 || TREE_CODE (t1
) == METHOD_TYPE
)
1216 && type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1218 if (TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
1221 /* Allow for two different type nodes which have essentially the same
1222 definition. Note that we already checked for equality of the type
1223 qualifiers (just above). */
1225 if (TREE_CODE (t1
) != ARRAY_TYPE
1226 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1230 /* Compare the types. Break out if they could be the same. */
1231 switch (TREE_CODE (t1
))
1235 /* All void and bool types are the same. */
1239 case FIXED_POINT_TYPE
:
1241 /* With these nodes, we can't determine type equivalence by
1242 looking at what is stored in the nodes themselves, because
1243 two nodes might have different TYPE_MAIN_VARIANTs but still
1244 represent the same type. For example, wchar_t and int could
1245 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1246 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1247 and are distinct types. On the other hand, int and the
1250 typedef int INT __attribute((may_alias));
1252 have identical properties, different TYPE_MAIN_VARIANTs, but
1253 represent the same type. The canonical type system keeps
1254 track of equivalence in this case, so we fall back on it. */
1255 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1257 case TEMPLATE_TEMPLATE_PARM
:
1258 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1259 if (!comp_template_parms_position (t1
, t2
))
1261 if (!comp_template_parms
1262 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1263 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1265 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1267 /* Don't check inheritance. */
1268 strict
= COMPARE_STRICT
;
1273 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1274 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1275 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1276 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1279 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1281 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1287 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1288 strict
& ~COMPARE_REDECLARATION
))
1290 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1294 case REFERENCE_TYPE
:
1295 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1297 /* fall through to checks for pointer types */
1300 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1301 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1307 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1309 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1314 /* Target types must match incl. qualifiers. */
1315 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1319 case TEMPLATE_TYPE_PARM
:
1320 /* If T1 and T2 don't have the same relative position in their
1321 template parameters set, they can't be equal. */
1322 if (!comp_template_parms_position (t1
, t2
))
1327 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1328 TYPENAME_TYPE_FULLNAME (t2
)))
1330 /* Qualifiers don't matter on scopes. */
1331 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1336 case UNBOUND_CLASS_TEMPLATE
:
1337 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1339 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1344 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1349 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1350 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1354 case TYPE_PACK_EXPANSION
:
1355 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1356 PACK_EXPANSION_PATTERN (t2
))
1357 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1358 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1361 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1362 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1363 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1364 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1365 || (DECLTYPE_FOR_LAMBDA_PROXY (t1
)
1366 != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1367 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1368 DECLTYPE_TYPE_EXPR (t2
)))
1372 case UNDERLYING_TYPE
:
1373 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1374 UNDERLYING_TYPE_TYPE (t2
));
1380 /* If we get here, we know that from a target independent POV the
1381 types are the same. Make sure the target attributes are also
1383 return comp_type_attributes (t1
, t2
);
1386 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1387 is a bitwise-or of the COMPARE_* flags. */
1390 comptypes (tree t1
, tree t2
, int strict
)
1392 if (strict
== COMPARE_STRICT
)
1397 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1400 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1401 /* At least one of the types requires structural equality, so
1402 perform a deep check. */
1403 return structural_comptypes (t1
, t2
, strict
);
1405 #ifdef ENABLE_CHECKING
1406 if (USE_CANONICAL_TYPES
)
1408 bool result
= structural_comptypes (t1
, t2
, strict
);
1410 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1411 /* The two types are structurally equivalent, but their
1412 canonical types were different. This is a failure of the
1413 canonical type propagation code.*/
1415 ("canonical types differ for identical types %T and %T",
1417 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1418 /* Two types are structurally different, but the canonical
1419 types are the same. This means we were over-eager in
1420 assigning canonical types. */
1422 ("same canonical type node for different types %T and %T",
1428 if (USE_CANONICAL_TYPES
)
1429 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1432 return structural_comptypes (t1
, t2
, strict
);
1434 else if (strict
== COMPARE_STRUCTURAL
)
1435 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1437 return structural_comptypes (t1
, t2
, strict
);
1440 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1441 top-level qualifiers. */
1444 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1446 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1449 return same_type_p (TYPE_MAIN_VARIANT (type1
), TYPE_MAIN_VARIANT (type2
));
1452 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1455 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1457 int q1
= cp_type_quals (type1
);
1458 int q2
= cp_type_quals (type2
);
1460 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1461 return (q1
& q2
) == q2
;
1464 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1465 more cv-qualified that TYPE1, and 0 otherwise. */
1468 comp_cv_qualification (int q1
, int q2
)
1473 if ((q1
& q2
) == q2
)
1475 else if ((q1
& q2
) == q1
)
1482 comp_cv_qualification (const_tree type1
, const_tree type2
)
1484 int q1
= cp_type_quals (type1
);
1485 int q2
= cp_type_quals (type2
);
1486 return comp_cv_qualification (q1
, q2
);
1489 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1490 subset of the cv-qualification signature of TYPE2, and the types
1491 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1494 comp_cv_qual_signature (tree type1
, tree type2
)
1496 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1498 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1504 /* Subroutines of `comptypes'. */
1506 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1507 equivalent in the sense that functions with those parameter types
1508 can have equivalent types. The two lists must be equivalent,
1509 element by element. */
1512 compparms (const_tree parms1
, const_tree parms2
)
1516 /* An unspecified parmlist matches any specified parmlist
1517 whose argument types don't need default promotions. */
1519 for (t1
= parms1
, t2
= parms2
;
1521 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1523 /* If one parmlist is shorter than the other,
1524 they fail to match. */
1527 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1534 /* Process a sizeof or alignof expression where the operand is a
1538 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1543 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1544 if (type
== error_mark_node
)
1545 return error_mark_node
;
1547 type
= non_reference (type
);
1548 if (TREE_CODE (type
) == METHOD_TYPE
)
1551 pedwarn (input_location
, OPT_Wpointer_arith
,
1552 "invalid application of %qs to a member function",
1553 operator_name_info
[(int) op
].name
);
1555 return error_mark_node
;
1556 value
= size_one_node
;
1559 dependent_p
= dependent_type_p (type
);
1561 complete_type (type
);
1563 /* VLA types will have a non-constant size. In the body of an
1564 uninstantiated template, we don't need to try to compute the
1565 value, because the sizeof expression is not an integral
1566 constant expression in that case. And, if we do try to
1567 compute the value, we'll likely end up with SAVE_EXPRs, which
1568 the template substitution machinery does not expect to see. */
1569 || (processing_template_decl
1570 && COMPLETE_TYPE_P (type
)
1571 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1573 value
= build_min (op
, size_type_node
, type
);
1574 TREE_READONLY (value
) = 1;
1578 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1579 op
== SIZEOF_EXPR
, false,
1583 /* Return the size of the type, without producing any warnings for
1584 types whose size cannot be taken. This routine should be used only
1585 in some other routine that has already produced a diagnostic about
1586 using the size of such a type. */
1588 cxx_sizeof_nowarn (tree type
)
1590 if (TREE_CODE (type
) == FUNCTION_TYPE
1591 || VOID_TYPE_P (type
)
1592 || TREE_CODE (type
) == ERROR_MARK
)
1593 return size_one_node
;
1594 else if (!COMPLETE_TYPE_P (type
))
1595 return size_zero_node
;
1597 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1600 /* Process a sizeof expression where the operand is an expression. */
1603 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1605 if (e
== error_mark_node
)
1606 return error_mark_node
;
1608 if (processing_template_decl
)
1610 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1611 TREE_SIDE_EFFECTS (e
) = 0;
1612 TREE_READONLY (e
) = 1;
1617 /* To get the size of a static data member declared as an array of
1618 unknown bound, we need to instantiate it. */
1620 && VAR_HAD_UNKNOWN_BOUND (e
)
1621 && DECL_TEMPLATE_INSTANTIATION (e
))
1622 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1624 if (TREE_CODE (e
) == PARM_DECL
1625 && DECL_ARRAY_PARAMETER_P (e
)
1626 && (complain
& tf_warning
))
1628 if (warning (OPT_Wsizeof_array_argument
, "%<sizeof%> on array function "
1629 "parameter %qE will return size of %qT", e
, TREE_TYPE (e
)))
1630 inform (DECL_SOURCE_LOCATION (e
), "declared here");
1633 e
= mark_type_use (e
);
1635 if (TREE_CODE (e
) == COMPONENT_REF
1636 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1637 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1639 if (complain
& tf_error
)
1640 error ("invalid application of %<sizeof%> to a bit-field");
1642 return error_mark_node
;
1645 else if (is_overloaded_fn (e
))
1647 if (complain
& tf_error
)
1648 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1651 return error_mark_node
;
1654 else if (type_unknown_p (e
))
1656 if (complain
& tf_error
)
1657 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1659 return error_mark_node
;
1665 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1668 /* Implement the __alignof keyword: Return the minimum required
1669 alignment of E, measured in bytes. For VAR_DECL's and
1670 FIELD_DECL's return DECL_ALIGN (which can be set from an
1671 "aligned" __attribute__ specification). */
1674 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1678 if (e
== error_mark_node
)
1679 return error_mark_node
;
1681 if (processing_template_decl
)
1683 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1684 TREE_SIDE_EFFECTS (e
) = 0;
1685 TREE_READONLY (e
) = 1;
1690 e
= mark_type_use (e
);
1693 t
= size_int (DECL_ALIGN_UNIT (e
));
1694 else if (TREE_CODE (e
) == COMPONENT_REF
1695 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
1696 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1698 if (complain
& tf_error
)
1699 error ("invalid application of %<__alignof%> to a bit-field");
1701 return error_mark_node
;
1704 else if (TREE_CODE (e
) == COMPONENT_REF
1705 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1706 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1707 else if (is_overloaded_fn (e
))
1709 if (complain
& tf_error
)
1710 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1713 return error_mark_node
;
1714 if (TREE_CODE (e
) == FUNCTION_DECL
)
1715 t
= size_int (DECL_ALIGN_UNIT (e
));
1719 else if (type_unknown_p (e
))
1721 if (complain
& tf_error
)
1722 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1724 return error_mark_node
;
1728 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1729 complain
& tf_error
);
1731 return fold_convert (size_type_node
, t
);
1734 /* Process a sizeof or alignof expression E with code OP where the operand
1735 is an expression. */
1738 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1740 if (op
== SIZEOF_EXPR
)
1741 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1743 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1746 /* Build a representation of an expression 'alignas(E).' Return the
1747 folded integer value of E if it is an integral constant expression
1748 that resolves to a valid alignment. If E depends on a template
1749 parameter, return a syntactic representation tree of kind
1750 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1751 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1754 cxx_alignas_expr (tree e
)
1756 if (e
== NULL_TREE
|| e
== error_mark_node
1757 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
1763 When the alignment-specifier is of the form
1764 alignas(type-id ), it shall have the same effect as
1765 alignas(alignof(type-id )). */
1767 return cxx_sizeof_or_alignof_type (e
, ALIGNOF_EXPR
, false);
1769 /* If we reach this point, it means the alignas expression if of
1770 the form "alignas(assignment-expression)", so we should follow
1771 what is stated by [dcl.align]/2. */
1773 if (value_dependent_expression_p (e
))
1774 /* Leave value-dependent expression alone for now. */
1777 e
= instantiate_non_dependent_expr (e
);
1778 e
= mark_rvalue_use (e
);
1780 /* [dcl.align]/2 says:
1782 the assignment-expression shall be an integral constant
1785 return cxx_constant_value (e
);
1789 /* EXPR is being used in a context that is not a function call.
1794 The expression can be used only as the left-hand operand of a
1795 member function call.
1797 [expr.mptr.operator]
1799 If the result of .* or ->* is a function, then that result can be
1800 used only as the operand for the function call operator ().
1802 by issuing an error message if appropriate. Returns true iff EXPR
1803 violates these rules. */
1806 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
1808 if (expr
== NULL_TREE
)
1810 /* Don't enforce this in MS mode. */
1811 if (flag_ms_extensions
)
1813 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
1814 expr
= get_first_fn (expr
);
1815 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1817 if (complain
& tf_error
)
1821 error_at (loc
, "invalid use of non-static member function %qD",
1823 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
1826 error_at (loc
, "invalid use of non-static member function of "
1827 "type %qT", TREE_TYPE (expr
));
1834 /* If EXP is a reference to a bitfield, and the type of EXP does not
1835 match the declared type of the bitfield, return the declared type
1836 of the bitfield. Otherwise, return NULL_TREE. */
1839 is_bitfield_expr_with_lowered_type (const_tree exp
)
1841 switch (TREE_CODE (exp
))
1844 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1845 ? TREE_OPERAND (exp
, 1)
1846 : TREE_OPERAND (exp
, 0)))
1848 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1851 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1855 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1861 field
= TREE_OPERAND (exp
, 1);
1862 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1864 if (same_type_ignoring_top_level_qualifiers_p
1865 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1867 return DECL_BIT_FIELD_TYPE (field
);
1871 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1872 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1873 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1881 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1882 bitfield with a lowered type, the type of EXP is returned, rather
1886 unlowered_expr_type (const_tree exp
)
1889 tree etype
= TREE_TYPE (exp
);
1891 type
= is_bitfield_expr_with_lowered_type (exp
);
1893 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1900 /* Perform the conversions in [expr] that apply when an lvalue appears
1901 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1902 function-to-pointer conversions. In addition, manifest constants
1903 are replaced by their values, and bitfield references are converted
1904 to their declared types. Note that this function does not perform the
1905 lvalue-to-rvalue conversion for class types. If you need that conversion
1906 to for class types, then you probably need to use force_rvalue.
1908 Although the returned value is being used as an rvalue, this
1909 function does not wrap the returned expression in a
1910 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1911 that the return value is no longer an lvalue. */
1914 decay_conversion (tree exp
, tsubst_flags_t complain
)
1917 enum tree_code code
;
1918 location_t loc
= EXPR_LOC_OR_LOC (exp
, input_location
);
1920 type
= TREE_TYPE (exp
);
1921 if (type
== error_mark_node
)
1922 return error_mark_node
;
1924 exp
= mark_rvalue_use (exp
);
1926 exp
= resolve_nondeduced_context (exp
);
1927 if (type_unknown_p (exp
))
1929 if (complain
& tf_error
)
1930 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1931 return error_mark_node
;
1934 code
= TREE_CODE (type
);
1936 /* FIXME remove for delayed folding. */
1937 exp
= scalar_constant_value (exp
);
1938 if (error_operand_p (exp
))
1939 return error_mark_node
;
1941 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
1942 return nullptr_node
;
1944 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1945 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1946 if (code
== VOID_TYPE
)
1948 if (complain
& tf_error
)
1949 error_at (loc
, "void value not ignored as it ought to be");
1950 return error_mark_node
;
1952 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
1953 return error_mark_node
;
1954 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1955 return cp_build_addr_expr (exp
, complain
);
1956 if (code
== ARRAY_TYPE
)
1961 if (INDIRECT_REF_P (exp
))
1962 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1963 TREE_OPERAND (exp
, 0));
1965 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1967 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
1968 if (op1
== error_mark_node
)
1969 return error_mark_node
;
1970 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1971 TREE_OPERAND (exp
, 0), op1
);
1975 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1977 if (complain
& tf_error
)
1978 error_at (loc
, "invalid use of non-lvalue array");
1979 return error_mark_node
;
1982 /* Don't let an array compound literal decay to a pointer. It can
1983 still be used to initialize an array or bind to a reference. */
1984 if (TREE_CODE (exp
) == TARGET_EXPR
)
1986 if (complain
& tf_error
)
1987 error_at (loc
, "taking address of temporary array");
1988 return error_mark_node
;
1991 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1995 if (!cxx_mark_addressable (exp
))
1996 return error_mark_node
;
1997 adr
= build_nop (ptrtype
, build_address (exp
));
2000 /* This way is better for a COMPONENT_REF since it can
2001 simplify the offset for a component. */
2002 adr
= cp_build_addr_expr (exp
, complain
);
2003 return cp_convert (ptrtype
, adr
, complain
);
2006 /* If a bitfield is used in a context where integral promotion
2007 applies, then the caller is expected to have used
2008 default_conversion. That function promotes bitfields correctly
2009 before calling this function. At this point, if we have a
2010 bitfield referenced, we may assume that is not subject to
2011 promotion, and that, therefore, the type of the resulting rvalue
2012 is the declared type of the bitfield. */
2013 exp
= convert_bitfield_to_declared_type (exp
);
2015 /* We do not call rvalue() here because we do not want to wrap EXP
2016 in a NON_LVALUE_EXPR. */
2020 Non-class rvalues always have cv-unqualified types. */
2021 type
= TREE_TYPE (exp
);
2022 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2023 exp
= build_nop (cv_unqualified (type
), exp
);
2028 /* Perform preparatory conversions, as part of the "usual arithmetic
2029 conversions". In particular, as per [expr]:
2031 Whenever an lvalue expression appears as an operand of an
2032 operator that expects the rvalue for that operand, the
2033 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2034 standard conversions are applied to convert the expression to an
2037 In addition, we perform integral promotions here, as those are
2038 applied to both operands to a binary operator before determining
2039 what additional conversions should apply. */
2042 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2044 /* Check for target-specific promotions. */
2045 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2047 exp
= cp_convert (promoted_type
, exp
, complain
);
2048 /* Perform the integral promotions first so that bitfield
2049 expressions (which may promote to "int", even if the bitfield is
2050 declared "unsigned") are promoted correctly. */
2051 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2052 exp
= cp_perform_integral_promotions (exp
, complain
);
2053 /* Perform the other conversions. */
2054 exp
= decay_conversion (exp
, complain
);
2062 default_conversion (tree exp
)
2064 return cp_default_conversion (exp
, tf_warning_or_error
);
2067 /* EXPR is an expression with an integral or enumeration type.
2068 Perform the integral promotions in [conv.prom], and return the
2072 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2077 expr
= mark_rvalue_use (expr
);
2081 If the bitfield has an enumerated type, it is treated as any
2082 other value of that type for promotion purposes. */
2083 type
= is_bitfield_expr_with_lowered_type (expr
);
2084 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2085 type
= TREE_TYPE (expr
);
2086 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2087 /* Scoped enums don't promote. */
2088 if (SCOPED_ENUM_P (type
))
2090 promoted_type
= type_promotes_to (type
);
2091 if (type
!= promoted_type
)
2092 expr
= cp_convert (promoted_type
, expr
, complain
);
2099 perform_integral_promotions (tree expr
)
2101 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2104 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2105 decay_conversion to one. */
2108 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2112 if (!TYPE_PTR_P (totype
))
2115 t
= TREE_TYPE (totype
);
2116 if (!same_type_p (t
, char_type_node
)
2117 && !same_type_p (t
, char16_type_node
)
2118 && !same_type_p (t
, char32_type_node
)
2119 && !same_type_p (t
, wchar_type_node
))
2122 if (TREE_CODE (exp
) == STRING_CST
)
2124 /* Make sure that we don't try to convert between char and wide chars. */
2125 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2130 /* Is this a string constant which has decayed to 'const char *'? */
2131 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2132 if (!same_type_p (TREE_TYPE (exp
), t
))
2135 if (TREE_CODE (exp
) != ADDR_EXPR
2136 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2141 if (cxx_dialect
>= cxx11
)
2142 pedwarn (input_location
,
2143 pedantic
? OPT_Wpedantic
: OPT_Wwrite_strings
,
2144 "ISO C++ forbids converting a string constant to %qT",
2147 warning (OPT_Wwrite_strings
,
2148 "deprecated conversion from string constant to %qT",
2155 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2156 can, for example, use as an lvalue. This code used to be in
2157 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2158 expressions, where we're dealing with aggregates. But now it's again only
2159 called from unary_complex_lvalue. The case (in particular) that led to
2160 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2164 rationalize_conditional_expr (enum tree_code code
, tree t
,
2165 tsubst_flags_t complain
)
2167 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
2169 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2170 the first operand is always the one to be used if both operands
2171 are equal, so we know what conditional expression this used to be. */
2172 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2174 tree op0
= TREE_OPERAND (t
, 0);
2175 tree op1
= TREE_OPERAND (t
, 1);
2177 /* The following code is incorrect if either operand side-effects. */
2178 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2179 && !TREE_SIDE_EFFECTS (op1
));
2181 build_conditional_expr (loc
,
2182 build_x_binary_op (loc
,
2183 (TREE_CODE (t
) == MIN_EXPR
2184 ? LE_EXPR
: GE_EXPR
),
2185 op0
, TREE_CODE (op0
),
2186 op1
, TREE_CODE (op1
),
2189 cp_build_unary_op (code
, op0
, 0, complain
),
2190 cp_build_unary_op (code
, op1
, 0, complain
),
2195 build_conditional_expr (loc
, TREE_OPERAND (t
, 0),
2196 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), 0,
2198 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), 0,
2203 /* Given the TYPE of an anonymous union field inside T, return the
2204 FIELD_DECL for the field. If not found return NULL_TREE. Because
2205 anonymous unions can nest, we must also search all anonymous unions
2206 that are directly reachable. */
2209 lookup_anon_field (tree t
, tree type
)
2213 t
= TYPE_MAIN_VARIANT (t
);
2215 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2217 if (TREE_STATIC (field
))
2219 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2222 /* If we find it directly, return the field. */
2223 if (DECL_NAME (field
) == NULL_TREE
2224 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2229 /* Otherwise, it could be nested, search harder. */
2230 if (DECL_NAME (field
) == NULL_TREE
2231 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2233 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2241 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2242 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2243 non-NULL, it indicates the path to the base used to name MEMBER.
2244 If PRESERVE_REFERENCE is true, the expression returned will have
2245 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2246 returned will have the type referred to by the reference.
2248 This function does not perform access control; that is either done
2249 earlier by the parser when the name of MEMBER is resolved to MEMBER
2250 itself, or later when overload resolution selects one of the
2251 functions indicated by MEMBER. */
2254 build_class_member_access_expr (tree object
, tree member
,
2255 tree access_path
, bool preserve_reference
,
2256 tsubst_flags_t complain
)
2260 tree result
= NULL_TREE
;
2261 tree using_decl
= NULL_TREE
;
2263 if (error_operand_p (object
) || error_operand_p (member
))
2264 return error_mark_node
;
2266 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2270 The type of the first expression shall be "class object" (of a
2272 object_type
= TREE_TYPE (object
);
2273 if (!currently_open_class (object_type
)
2274 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2275 return error_mark_node
;
2276 if (!CLASS_TYPE_P (object_type
))
2278 if (complain
& tf_error
)
2280 if (POINTER_TYPE_P (object_type
)
2281 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2282 error ("request for member %qD in %qE, which is of pointer "
2283 "type %qT (maybe you meant to use %<->%> ?)",
2284 member
, object
, object_type
);
2286 error ("request for member %qD in %qE, which is of non-class "
2287 "type %qT", member
, object
, object_type
);
2289 return error_mark_node
;
2292 /* The standard does not seem to actually say that MEMBER must be a
2293 member of OBJECT_TYPE. However, that is clearly what is
2295 if (DECL_P (member
))
2297 member_scope
= DECL_CLASS_CONTEXT (member
);
2298 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2299 return error_mark_node
;
2300 if (TREE_DEPRECATED (member
))
2301 warn_deprecated_use (member
, NULL_TREE
);
2304 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2305 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2306 presently be the anonymous union. Go outwards until we find a
2307 type related to OBJECT_TYPE. */
2308 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2309 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2311 member_scope
= TYPE_CONTEXT (member_scope
);
2312 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2314 if (complain
& tf_error
)
2316 if (TREE_CODE (member
) == FIELD_DECL
)
2317 error ("invalid use of nonstatic data member %qE", member
);
2319 error ("%qD is not a member of %qT", member
, object_type
);
2321 return error_mark_node
;
2324 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2325 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2326 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2328 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2330 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2333 /* In [expr.ref], there is an explicit list of the valid choices for
2334 MEMBER. We check for each of those cases here. */
2337 /* A static data member. */
2339 mark_exp_read (object
);
2340 /* If OBJECT has side-effects, they are supposed to occur. */
2341 if (TREE_SIDE_EFFECTS (object
))
2342 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2344 else if (TREE_CODE (member
) == FIELD_DECL
)
2346 /* A non-static data member. */
2351 null_object_p
= (INDIRECT_REF_P (object
)
2352 && integer_zerop (TREE_OPERAND (object
, 0)));
2354 /* Convert OBJECT to the type of MEMBER. */
2355 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2356 TYPE_MAIN_VARIANT (member_scope
)))
2361 binfo
= lookup_base (access_path
? access_path
: object_type
,
2362 member_scope
, ba_unique
, &kind
, complain
);
2363 if (binfo
== error_mark_node
)
2364 return error_mark_node
;
2366 /* It is invalid to try to get to a virtual base of a
2367 NULL object. The most common cause is invalid use of
2369 if (null_object_p
&& kind
== bk_via_virtual
)
2371 if (complain
& tf_error
)
2373 error ("invalid access to non-static data member %qD in "
2374 "virtual base of NULL object", member
);
2376 return error_mark_node
;
2379 /* Convert to the base. */
2380 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2381 /*nonnull=*/1, complain
);
2382 /* If we found the base successfully then we should be able
2383 to convert to it successfully. */
2384 gcc_assert (object
!= error_mark_node
);
2387 /* If MEMBER is from an anonymous aggregate, we have converted
2388 OBJECT so that it refers to the class containing the
2389 anonymous union. Generate a reference to the anonymous union
2390 itself, and recur to find MEMBER. */
2391 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2392 /* When this code is called from build_field_call, the
2393 object already has the type of the anonymous union.
2394 That is because the COMPONENT_REF was already
2395 constructed, and was then disassembled before calling
2396 build_field_call. After the function-call code is
2397 cleaned up, this waste can be eliminated. */
2398 && (!same_type_ignoring_top_level_qualifiers_p
2399 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2401 tree anonymous_union
;
2403 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2404 DECL_CONTEXT (member
));
2405 object
= build_class_member_access_expr (object
,
2407 /*access_path=*/NULL_TREE
,
2412 /* Compute the type of the field, as described in [expr.ref]. */
2413 type_quals
= TYPE_UNQUALIFIED
;
2414 member_type
= TREE_TYPE (member
);
2415 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2417 type_quals
= (cp_type_quals (member_type
)
2418 | cp_type_quals (object_type
));
2420 /* A field is const (volatile) if the enclosing object, or the
2421 field itself, is const (volatile). But, a mutable field is
2422 not const, even within a const object. */
2423 if (DECL_MUTABLE_P (member
))
2424 type_quals
&= ~TYPE_QUAL_CONST
;
2425 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2428 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
2429 object
, member
, NULL_TREE
);
2430 result
= fold_if_not_in_template (result
);
2432 /* Mark the expression const or volatile, as appropriate. Even
2433 though we've dealt with the type above, we still have to mark the
2434 expression itself. */
2435 if (type_quals
& TYPE_QUAL_CONST
)
2436 TREE_READONLY (result
) = 1;
2437 if (type_quals
& TYPE_QUAL_VOLATILE
)
2438 TREE_THIS_VOLATILE (result
) = 1;
2440 else if (BASELINK_P (member
))
2442 /* The member is a (possibly overloaded) member function. */
2446 /* If the MEMBER is exactly one static member function, then we
2447 know the type of the expression. Otherwise, we must wait
2448 until overload resolution has been performed. */
2449 functions
= BASELINK_FUNCTIONS (member
);
2450 if (TREE_CODE (functions
) == FUNCTION_DECL
2451 && DECL_STATIC_FUNCTION_P (functions
))
2452 type
= TREE_TYPE (functions
);
2454 type
= unknown_type_node
;
2455 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2456 base. That will happen when the function is called. */
2457 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2459 else if (TREE_CODE (member
) == CONST_DECL
)
2461 /* The member is an enumerator. */
2463 /* If OBJECT has side-effects, they are supposed to occur. */
2464 if (TREE_SIDE_EFFECTS (object
))
2465 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2468 else if ((using_decl
= strip_using_decl (member
)) != member
)
2469 result
= build_class_member_access_expr (object
,
2471 access_path
, preserve_reference
,
2475 if (complain
& tf_error
)
2476 error ("invalid use of %qD", member
);
2477 return error_mark_node
;
2480 if (!preserve_reference
)
2483 If E2 is declared to have type "reference to T", then ... the
2484 type of E1.E2 is T. */
2485 result
= convert_from_reference (result
);
2490 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2491 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2494 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
2495 tsubst_flags_t complain
)
2497 tree object_type
= TREE_TYPE (object
);
2498 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2501 /* We've already complained about this destructor. */
2502 if (dtor_type
== error_mark_node
)
2503 return error_mark_node
;
2505 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2507 if (complain
& tf_error
)
2508 error ("qualified type %qT does not match destructor name ~%qT",
2510 return error_mark_node
;
2512 if (is_auto (dtor_type
))
2513 dtor_type
= object_type
;
2514 else if (identifier_p (dtor_type
))
2516 /* In a template, names we can't find a match for are still accepted
2517 destructor names, and we check them here. */
2518 if (check_dtor_name (object_type
, dtor_type
))
2519 dtor_type
= object_type
;
2522 if (complain
& tf_error
)
2523 error ("object type %qT does not match destructor name ~%qT",
2524 object_type
, dtor_type
);
2525 return error_mark_node
;
2529 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2531 if (complain
& tf_error
)
2532 error ("the type being destroyed is %qT, but the destructor "
2533 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2534 return error_mark_node
;
2536 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2537 /*protect=*/1, /*want_type=*/false,
2538 tf_warning_or_error
);
2541 if (complain
& tf_error
)
2542 cxx_incomplete_type_error (dtor_name
, dtor_type
);
2543 return error_mark_node
;
2545 expr
= (adjust_result_of_qualified_name_lookup
2546 (expr
, dtor_type
, object_type
));
2547 if (scope
== NULL_TREE
)
2548 /* We need to call adjust_result_of_qualified_name_lookup in case the
2549 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2550 that we still get virtual function binding. */
2551 BASELINK_QUALIFIED_P (expr
) = false;
2555 /* An expression of the form "A::template B" has been resolved to
2556 DECL. Issue a diagnostic if B is not a template or template
2560 check_template_keyword (tree decl
)
2562 /* The standard says:
2566 If a name prefixed by the keyword template is not a member
2567 template, the program is ill-formed.
2569 DR 228 removed the restriction that the template be a member
2572 DR 96, if accepted would add the further restriction that explicit
2573 template arguments must be provided if the template keyword is
2574 used, but, as of 2005-10-16, that DR is still in "drafting". If
2575 this DR is accepted, then the semantic checks here can be
2576 simplified, as the entity named must in fact be a template
2577 specialization, rather than, as at present, a set of overloaded
2578 functions containing at least one template function. */
2579 if (TREE_CODE (decl
) != TEMPLATE_DECL
2580 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2582 if (!is_overloaded_fn (decl
))
2583 permerror (input_location
, "%qD is not a template", decl
);
2588 if (BASELINK_P (fns
))
2589 fns
= BASELINK_FUNCTIONS (fns
);
2592 tree fn
= OVL_CURRENT (fns
);
2593 if (TREE_CODE (fn
) == TEMPLATE_DECL
2594 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2596 if (TREE_CODE (fn
) == FUNCTION_DECL
2597 && DECL_USE_TEMPLATE (fn
)
2598 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
2600 fns
= OVL_NEXT (fns
);
2603 permerror (input_location
, "%qD is not a template", decl
);
2608 /* This function is called by the parser to process a class member
2609 access expression of the form OBJECT.NAME. NAME is a node used by
2610 the parser to represent a name; it is not yet a DECL. It may,
2611 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2612 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2613 there is no reason to do the lookup twice, so the parser keeps the
2614 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2615 be a template via the use of the "A::template B" syntax. */
2618 finish_class_member_access_expr (tree object
, tree name
, bool template_p
,
2619 tsubst_flags_t complain
)
2624 tree access_path
= NULL_TREE
;
2625 tree orig_object
= object
;
2626 tree orig_name
= name
;
2628 if (object
== error_mark_node
|| name
== error_mark_node
)
2629 return error_mark_node
;
2631 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2632 if (!objc_is_public (object
, name
))
2633 return error_mark_node
;
2635 object_type
= TREE_TYPE (object
);
2637 if (processing_template_decl
)
2639 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
2640 type_dependent_expression_p (object
)
2641 /* If NAME is "f<args>", where either 'f' or 'args' is
2642 dependent, then the expression is dependent. */
2643 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2644 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2645 TREE_OPERAND (name
, 1)))
2646 /* If NAME is "T::X" where "T" is dependent, then the
2647 expression is dependent. */
2648 || (TREE_CODE (name
) == SCOPE_REF
2649 && TYPE_P (TREE_OPERAND (name
, 0))
2650 && dependent_type_p (TREE_OPERAND (name
, 0))))
2651 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
2652 object
, name
, NULL_TREE
);
2653 object
= build_non_dependent_expr (object
);
2655 else if (c_dialect_objc ()
2656 && identifier_p (name
)
2657 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2662 The type of the first expression shall be "class object" (of a
2664 if (!currently_open_class (object_type
)
2665 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2666 return error_mark_node
;
2667 if (!CLASS_TYPE_P (object_type
))
2669 if (complain
& tf_error
)
2671 if (POINTER_TYPE_P (object_type
)
2672 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2673 error ("request for member %qD in %qE, which is of pointer "
2674 "type %qT (maybe you meant to use %<->%> ?)",
2675 name
, object
, object_type
);
2677 error ("request for member %qD in %qE, which is of non-class "
2678 "type %qT", name
, object
, object_type
);
2680 return error_mark_node
;
2683 if (BASELINK_P (name
))
2684 /* A member function that has already been looked up. */
2688 bool is_template_id
= false;
2689 tree template_args
= NULL_TREE
;
2692 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2694 is_template_id
= true;
2695 template_args
= TREE_OPERAND (name
, 1);
2696 name
= TREE_OPERAND (name
, 0);
2698 if (TREE_CODE (name
) == OVERLOAD
)
2699 name
= DECL_NAME (get_first_fn (name
));
2700 else if (DECL_P (name
))
2701 name
= DECL_NAME (name
);
2704 if (TREE_CODE (name
) == SCOPE_REF
)
2706 /* A qualified name. The qualifying class or namespace `S'
2707 has already been looked up; it is either a TYPE or a
2709 scope
= TREE_OPERAND (name
, 0);
2710 name
= TREE_OPERAND (name
, 1);
2712 /* If SCOPE is a namespace, then the qualified name does not
2713 name a member of OBJECT_TYPE. */
2714 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2716 if (complain
& tf_error
)
2717 error ("%<%D::%D%> is not a member of %qT",
2718 scope
, name
, object_type
);
2719 return error_mark_node
;
2722 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
2724 /* Looking up a member enumerator (c++/56793). */
2725 if (!TYPE_CLASS_SCOPE_P (scope
)
2726 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
2728 if (complain
& tf_error
)
2729 error ("%<%D::%D%> is not a member of %qT",
2730 scope
, name
, object_type
);
2731 return error_mark_node
;
2733 tree val
= lookup_enumerator (scope
, name
);
2736 if (complain
& tf_error
)
2737 error ("%qD is not a member of %qD",
2739 return error_mark_node
;
2742 if (TREE_SIDE_EFFECTS (object
))
2743 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
2747 gcc_assert (CLASS_TYPE_P (scope
));
2748 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
2750 if (constructor_name_p (name
, scope
))
2752 if (complain
& tf_error
)
2753 error ("cannot call constructor %<%T::%D%> directly",
2755 return error_mark_node
;
2758 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2759 access_path
= lookup_base (object_type
, scope
, ba_check
,
2761 if (access_path
== error_mark_node
)
2762 return error_mark_node
;
2765 if (complain
& tf_error
)
2766 error ("%qT is not a base of %qT", scope
, object_type
);
2767 return error_mark_node
;
2773 access_path
= object_type
;
2776 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2777 member
= lookup_destructor (object
, scope
, name
, complain
);
2780 /* Look up the member. */
2781 member
= lookup_member (access_path
, name
, /*protect=*/1,
2782 /*want_type=*/false, complain
);
2783 if (member
== NULL_TREE
)
2785 if (complain
& tf_error
)
2786 error ("%q#T has no member named %qE",
2787 TREE_CODE (access_path
) == TREE_BINFO
2788 ? TREE_TYPE (access_path
) : object_type
, name
);
2789 return error_mark_node
;
2791 if (member
== error_mark_node
)
2792 return error_mark_node
;
2797 tree templ
= member
;
2799 if (BASELINK_P (templ
))
2800 templ
= lookup_template_function (templ
, template_args
);
2803 if (complain
& tf_error
)
2804 error ("%qD is not a member template function", name
);
2805 return error_mark_node
;
2810 if (TREE_DEPRECATED (member
))
2811 warn_deprecated_use (member
, NULL_TREE
);
2814 check_template_keyword (member
);
2816 expr
= build_class_member_access_expr (object
, member
, access_path
,
2817 /*preserve_reference=*/false,
2819 if (processing_template_decl
&& expr
!= error_mark_node
)
2821 if (BASELINK_P (member
))
2823 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2824 BASELINK_QUALIFIED_P (member
) = 1;
2827 return build_min_non_dep (COMPONENT_REF
, expr
,
2828 orig_object
, orig_name
,
2835 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
2839 build_simple_component_ref (tree object
, tree member
)
2841 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
2842 cp_type_quals (TREE_TYPE (object
)));
2843 return fold_build3_loc (input_location
,
2844 COMPONENT_REF
, type
,
2845 object
, member
, NULL_TREE
);
2848 /* Return an expression for the MEMBER_NAME field in the internal
2849 representation of PTRMEM, a pointer-to-member function. (Each
2850 pointer-to-member function type gets its own RECORD_TYPE so it is
2851 more convenient to access the fields by name than by FIELD_DECL.)
2852 This routine converts the NAME to a FIELD_DECL and then creates the
2853 node for the complete expression. */
2856 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2861 /* This code is a stripped down version of
2862 build_class_member_access_expr. It does not work to use that
2863 routine directly because it expects the object to be of class
2865 ptrmem_type
= TREE_TYPE (ptrmem
);
2866 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2867 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
2868 member
= DECL_CHAIN (member
))
2869 if (DECL_NAME (member
) == member_name
)
2871 return build_simple_component_ref (ptrmem
, member
);
2874 /* Given an expression PTR for a pointer, return an expression
2875 for the value pointed to.
2876 ERRORSTRING is the name of the operator to appear in error messages.
2878 This function may need to overload OPERATOR_FNNAME.
2879 Must also handle REFERENCE_TYPEs for C++. */
2882 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
2883 tsubst_flags_t complain
)
2885 tree orig_expr
= expr
;
2888 if (processing_template_decl
)
2890 /* Retain the type if we know the operand is a pointer. */
2891 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
2892 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
2893 if (type_dependent_expression_p (expr
))
2894 return build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
2895 expr
= build_non_dependent_expr (expr
);
2898 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
2899 NULL_TREE
, NULL_TREE
, /*overload=*/NULL
, complain
);
2901 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
2903 if (processing_template_decl
&& rval
!= error_mark_node
)
2904 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
2909 /* Helper function called from c-common. */
2911 build_indirect_ref (location_t
/*loc*/,
2912 tree ptr
, ref_operator errorstring
)
2914 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
2918 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
2919 tsubst_flags_t complain
)
2923 if (ptr
== current_class_ptr
2924 || (TREE_CODE (ptr
) == NOP_EXPR
2925 && TREE_OPERAND (ptr
, 0) == current_class_ptr
2926 && (same_type_ignoring_top_level_qualifiers_p
2927 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
2928 return current_class_ref
;
2930 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2931 ? ptr
: decay_conversion (ptr
, complain
));
2932 if (pointer
== error_mark_node
)
2933 return error_mark_node
;
2935 type
= TREE_TYPE (pointer
);
2937 if (POINTER_TYPE_P (type
))
2941 If the type of the expression is "pointer to T," the type
2942 of the result is "T." */
2943 tree t
= TREE_TYPE (type
);
2945 if ((CONVERT_EXPR_P (ptr
)
2946 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
2947 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
2949 /* If a warning is issued, mark it to avoid duplicates from
2950 the backend. This only needs to be done at
2951 warn_strict_aliasing > 2. */
2952 if (warn_strict_aliasing
> 2)
2953 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
2954 type
, TREE_OPERAND (ptr
, 0)))
2955 TREE_NO_WARNING (ptr
) = 1;
2958 if (VOID_TYPE_P (t
))
2960 /* A pointer to incomplete type (other than cv void) can be
2961 dereferenced [expr.unary.op]/1 */
2962 if (complain
& tf_error
)
2963 error ("%qT is not a pointer-to-object type", type
);
2964 return error_mark_node
;
2966 else if (TREE_CODE (pointer
) == ADDR_EXPR
2967 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2968 /* The POINTER was something like `&x'. We simplify `*&x' to
2970 return TREE_OPERAND (pointer
, 0);
2973 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2975 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2976 so that we get the proper error message if the result is used
2977 to assign to. Also, &* is supposed to be a no-op. */
2978 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2979 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2980 TREE_SIDE_EFFECTS (ref
)
2981 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2985 else if (!(complain
& tf_error
))
2986 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2988 /* `pointer' won't be an error_mark_node if we were given a
2989 pointer to member, so it's cool to check for this here. */
2990 else if (TYPE_PTRMEM_P (type
))
2991 switch (errorstring
)
2993 case RO_ARRAY_INDEXING
:
2994 error ("invalid use of array indexing on pointer to member");
2997 error ("invalid use of unary %<*%> on pointer to member");
2999 case RO_IMPLICIT_CONVERSION
:
3000 error ("invalid use of implicit conversion on pointer to member");
3003 error ("left hand operand of %<->*%> must be a pointer to class, "
3004 "but is a pointer to member of type %qT", type
);
3009 else if (pointer
!= error_mark_node
)
3010 invalid_indirection_error (input_location
, type
, errorstring
);
3012 return error_mark_node
;
3015 /* This handles expressions of the form "a[i]", which denotes
3018 This is logically equivalent in C to *(a+i), but we may do it differently.
3019 If A is a variable or a member, we generate a primitive ARRAY_REF.
3020 This avoids forcing the array out of registers, and can work on
3021 arrays that are not lvalues (for example, members of structures returned
3024 If INDEX is of some user-defined type, it must be converted to
3025 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3026 will inherit the type of the array, which will be some pointer type.
3028 LOC is the location to use in building the array reference. */
3031 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3032 tsubst_flags_t complain
)
3038 if (complain
& tf_error
)
3039 error_at (loc
, "subscript missing in array reference");
3040 return error_mark_node
;
3043 /* If an array's index is an array notation, then its rank cannot be
3044 greater than one. */
3045 if (flag_cilkplus
&& contains_array_notation_expr (idx
))
3049 /* If find_rank returns false, then it should have reported an error,
3050 thus it is unnecessary for repetition. */
3051 if (!find_rank (loc
, idx
, idx
, true, &rank
))
3052 return error_mark_node
;
3055 error_at (loc
, "rank of the array%'s index is greater than 1");
3056 return error_mark_node
;
3059 if (TREE_TYPE (array
) == error_mark_node
3060 || TREE_TYPE (idx
) == error_mark_node
)
3061 return error_mark_node
;
3063 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3065 switch (TREE_CODE (array
))
3069 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3071 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3072 TREE_OPERAND (array
, 0), value
);
3073 SET_EXPR_LOCATION (ret
, loc
);
3078 ret
= build_conditional_expr
3079 (loc
, TREE_OPERAND (array
, 0),
3080 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3082 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3085 protected_set_expr_location (ret
, loc
);
3093 = convert_vector_to_pointer_for_subscript (loc
, &array
, idx
);
3095 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3099 warn_array_subscript_with_type_char (loc
, idx
);
3101 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
3103 if (complain
& tf_error
)
3104 error_at (loc
, "array subscript is not an integer");
3105 return error_mark_node
;
3108 /* Apply integral promotions *after* noticing character types.
3109 (It is unclear why we do these promotions -- the standard
3110 does not say that we should. In fact, the natural thing would
3111 seem to be to convert IDX to ptrdiff_t; we're performing
3112 pointer arithmetic.) */
3113 idx
= cp_perform_integral_promotions (idx
, complain
);
3115 /* An array that is indexed by a non-constant
3116 cannot be stored in a register; we must be able to do
3117 address arithmetic on its address.
3118 Likewise an array of elements of variable size. */
3119 if (TREE_CODE (idx
) != INTEGER_CST
3120 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3121 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3124 if (!cxx_mark_addressable (array
))
3125 return error_mark_node
;
3128 /* An array that is indexed by a constant value which is not within
3129 the array bounds cannot be stored in a register either; because we
3130 would get a crash in store_bit_field/extract_bit_field when trying
3131 to access a non-existent part of the register. */
3132 if (TREE_CODE (idx
) == INTEGER_CST
3133 && TYPE_DOMAIN (TREE_TYPE (array
))
3134 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3136 if (!cxx_mark_addressable (array
))
3137 return error_mark_node
;
3140 /* Note in C++ it is valid to subscript a `register' array, since
3141 it is valid to take the address of something with that
3142 storage specification. */
3146 while (TREE_CODE (foo
) == COMPONENT_REF
)
3147 foo
= TREE_OPERAND (foo
, 0);
3148 if (VAR_P (foo
) && DECL_REGISTER (foo
)
3149 && (complain
& tf_warning
))
3150 warning_at (loc
, OPT_Wextra
,
3151 "subscripting array declared %<register%>");
3154 type
= TREE_TYPE (TREE_TYPE (array
));
3155 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3156 /* Array ref is const/volatile if the array elements are
3157 or if the array is.. */
3158 TREE_READONLY (rval
)
3159 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3160 TREE_SIDE_EFFECTS (rval
)
3161 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3162 TREE_THIS_VOLATILE (rval
)
3163 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3164 ret
= require_complete_type_sfinae (fold_if_not_in_template (rval
),
3166 protected_set_expr_location (ret
, loc
);
3168 ret
= non_lvalue_loc (loc
, ret
);
3173 tree ar
= cp_default_conversion (array
, complain
);
3174 tree ind
= cp_default_conversion (idx
, complain
);
3176 /* Put the integer in IND to simplify error checking. */
3177 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3178 std::swap (ar
, ind
);
3180 if (ar
== error_mark_node
|| ind
== error_mark_node
)
3181 return error_mark_node
;
3183 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
3185 if (complain
& tf_error
)
3186 error_at (loc
, "subscripted value is neither array nor pointer");
3187 return error_mark_node
;
3189 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3191 if (complain
& tf_error
)
3192 error_at (loc
, "array subscript is not an integer");
3193 return error_mark_node
;
3196 warn_array_subscript_with_type_char (loc
, idx
);
3198 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3203 protected_set_expr_location (ret
, loc
);
3205 ret
= non_lvalue_loc (loc
, ret
);
3210 /* Entry point for Obj-C++. */
3213 build_array_ref (location_t loc
, tree array
, tree idx
)
3215 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3218 /* Resolve a pointer to member function. INSTANCE is the object
3219 instance to use, if the member points to a virtual member.
3221 This used to avoid checking for virtual functions if basetype
3222 has no virtual functions, according to an earlier ANSI draft.
3223 With the final ISO C++ rules, such an optimization is
3224 incorrect: A pointer to a derived member can be static_cast
3225 to pointer-to-base-member, as long as the dynamic object
3226 later has the right member. So now we only do this optimization
3227 when we know the dynamic type of the object. */
3230 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
3231 tsubst_flags_t complain
)
3233 if (TREE_CODE (function
) == OFFSET_REF
)
3234 function
= TREE_OPERAND (function
, 1);
3236 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3238 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
3240 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3241 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3243 tree instance_ptr
= *instance_ptrptr
;
3244 tree instance_save_expr
= 0;
3245 if (instance_ptr
== error_mark_node
)
3247 if (TREE_CODE (function
) == PTRMEM_CST
)
3249 /* Extracting the function address from a pmf is only
3250 allowed with -Wno-pmf-conversions. It only works for
3252 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
3253 e1
= convert (fntype
, e1
);
3258 if (complain
& tf_error
)
3259 error ("object missing in use of %qE", function
);
3260 return error_mark_node
;
3264 /* True if we know that the dynamic type of the object doesn't have
3265 virtual functions, so we can assume the PFN field is a pointer. */
3266 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
3267 && !TYPE_POLYMORPHIC_P (basetype
)
3268 && resolves_to_fixed_type_p (instance_ptr
, 0));
3270 /* If we don't really have an object (i.e. in an ill-formed
3271 conversion from PMF to pointer), we can't resolve virtual
3272 functions anyway. */
3273 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
3276 if (TREE_SIDE_EFFECTS (instance_ptr
))
3277 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3279 if (TREE_SIDE_EFFECTS (function
))
3280 function
= save_expr (function
);
3282 /* Start by extracting all the information from the PMF itself. */
3283 e3
= pfn_from_ptrmemfunc (function
);
3284 delta
= delta_from_ptrmemfunc (function
);
3285 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3286 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3288 int flag_sanitize_save
;
3289 case ptrmemfunc_vbit_in_pfn
:
3290 e1
= cp_build_binary_op (input_location
,
3291 BIT_AND_EXPR
, idx
, integer_one_node
,
3293 idx
= cp_build_binary_op (input_location
,
3294 MINUS_EXPR
, idx
, integer_one_node
,
3296 if (idx
== error_mark_node
)
3297 return error_mark_node
;
3300 case ptrmemfunc_vbit_in_delta
:
3301 e1
= cp_build_binary_op (input_location
,
3302 BIT_AND_EXPR
, delta
, integer_one_node
,
3304 /* Don't instrument the RSHIFT_EXPR we're about to create because
3305 we're going to use DELTA number of times, and that wouldn't play
3306 well with SAVE_EXPRs therein. */
3307 flag_sanitize_save
= flag_sanitize
;
3309 delta
= cp_build_binary_op (input_location
,
3310 RSHIFT_EXPR
, delta
, integer_one_node
,
3312 flag_sanitize
= flag_sanitize_save
;
3313 if (delta
== error_mark_node
)
3314 return error_mark_node
;
3321 if (e1
== error_mark_node
)
3322 return error_mark_node
;
3324 /* Convert down to the right base before using the instance. A
3325 special case is that in a pointer to member of class C, C may
3326 be incomplete. In that case, the function will of course be
3327 a member of C, and no conversion is required. In fact,
3328 lookup_base will fail in that case, because incomplete
3329 classes do not have BINFOs. */
3330 if (!same_type_ignoring_top_level_qualifiers_p
3331 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3333 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3334 basetype
, ba_check
, NULL
, complain
);
3335 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3337 if (instance_ptr
== error_mark_node
)
3338 return error_mark_node
;
3340 /* ...and then the delta in the PMF. */
3341 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3343 /* Hand back the adjusted 'this' argument to our caller. */
3344 *instance_ptrptr
= instance_ptr
;
3347 /* Now just return the pointer. */
3350 /* Next extract the vtable pointer from the object. */
3351 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3353 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, complain
);
3354 if (vtbl
== error_mark_node
)
3355 return error_mark_node
;
3357 /* Finally, extract the function pointer from the vtable. */
3358 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3359 e2
= cp_build_indirect_ref (e2
, RO_NULL
, complain
);
3360 if (e2
== error_mark_node
)
3361 return error_mark_node
;
3362 TREE_CONSTANT (e2
) = 1;
3364 /* When using function descriptors, the address of the
3365 vtable entry is treated as a function pointer. */
3366 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3367 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3368 cp_build_addr_expr (e2
, complain
));
3370 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3371 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
3372 if (e1
== error_mark_node
)
3373 return error_mark_node
;
3375 /* Make sure this doesn't get evaluated first inside one of the
3376 branches of the COND_EXPR. */
3377 if (instance_save_expr
)
3378 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3379 instance_save_expr
, e1
);
3386 /* Used by the C-common bits. */
3388 build_function_call (location_t
/*loc*/,
3389 tree function
, tree params
)
3391 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3394 /* Used by the C-common bits. */
3396 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
3397 tree function
, vec
<tree
, va_gc
> *params
,
3398 vec
<tree
, va_gc
> * /*origtypes*/)
3400 vec
<tree
, va_gc
> *orig_params
= params
;
3401 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3402 tf_warning_or_error
);
3404 /* cp_build_function_call_vec can reallocate PARAMS by adding
3405 default arguments. That should never happen here. Verify
3407 gcc_assert (params
== orig_params
);
3412 /* Build a function call using a tree list of arguments. */
3415 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3417 vec
<tree
, va_gc
> *vec
;
3420 vec
= make_tree_vector ();
3421 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3422 vec_safe_push (vec
, TREE_VALUE (params
));
3423 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3424 release_tree_vector (vec
);
3428 /* Build a function call using varargs. */
3431 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3433 vec
<tree
, va_gc
> *vec
;
3437 vec
= make_tree_vector ();
3438 va_start (args
, complain
);
3439 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3440 vec_safe_push (vec
, t
);
3442 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3443 release_tree_vector (vec
);
3447 /* Build a function call using a vector of arguments. PARAMS may be
3448 NULL if there are no parameters. This changes the contents of
3452 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
3453 tsubst_flags_t complain
)
3455 tree fntype
, fndecl
;
3457 tree original
= function
;
3461 vec
<tree
, va_gc
> *allocated
= NULL
;
3464 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3465 expressions, like those used for ObjC messenger dispatches. */
3466 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
3467 function
= objc_rewrite_function_call (function
, (**params
)[0]);
3469 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3470 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3471 if (TREE_CODE (function
) == NOP_EXPR
3472 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3473 function
= TREE_OPERAND (function
, 0);
3475 if (TREE_CODE (function
) == FUNCTION_DECL
)
3477 /* If the function is a non-template member function
3478 or a non-template friend, then we need to check the
3481 Note that if overload resolution failed with a single
3482 candidate this function will be used to explicitly diagnose
3483 the failure for the single call expression. The check is
3484 technically redundant since we also would have failed in
3485 add_function_candidate. */
3487 && (complain
& tf_error
)
3488 && !constraints_satisfied_p (function
))
3490 error ("cannot call function %qD", function
);
3491 location_t loc
= DECL_SOURCE_LOCATION (function
);
3492 diagnose_constraints (loc
, function
, NULL_TREE
);
3493 return error_mark_node
;
3496 if (!mark_used (function
, complain
) && !(complain
& tf_error
))
3497 return error_mark_node
;
3500 /* Convert anything with function type to a pointer-to-function. */
3501 if (DECL_MAIN_P (function
))
3503 if (complain
& tf_error
)
3504 pedwarn (input_location
, OPT_Wpedantic
,
3505 "ISO C++ forbids calling %<::main%> from within program");
3507 return error_mark_node
;
3509 function
= build_addr_func (function
, complain
);
3515 function
= build_addr_func (function
, complain
);
3518 if (function
== error_mark_node
)
3519 return error_mark_node
;
3521 fntype
= TREE_TYPE (function
);
3523 if (TYPE_PTRMEMFUNC_P (fntype
))
3525 if (complain
& tf_error
)
3526 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3527 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3528 original
, original
);
3529 return error_mark_node
;
3532 is_method
= (TYPE_PTR_P (fntype
)
3533 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3535 if (!(TYPE_PTRFN_P (fntype
)
3537 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3539 if (complain
& tf_error
)
3541 if (!flag_diagnostics_show_caret
)
3542 error_at (input_location
,
3543 "%qE cannot be used as a function", original
);
3544 else if (DECL_P (original
))
3545 error_at (input_location
,
3546 "%qD cannot be used as a function", original
);
3548 error_at (input_location
,
3549 "expression cannot be used as a function");
3552 return error_mark_node
;
3555 /* fntype now gets the type of function pointed to. */
3556 fntype
= TREE_TYPE (fntype
);
3557 parm_types
= TYPE_ARG_TYPES (fntype
);
3561 allocated
= make_tree_vector ();
3562 params
= &allocated
;
3565 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3568 return error_mark_node
;
3570 argarray
= (*params
)->address ();
3572 /* Check for errors in format strings and inappropriately
3574 check_function_arguments (fntype
, nargs
, argarray
);
3576 ret
= build_cxx_call (function
, nargs
, argarray
, complain
);
3578 if (allocated
!= NULL
)
3579 release_tree_vector (allocated
);
3584 /* Subroutine of convert_arguments.
3585 Print an error message about a wrong number of arguments. */
3588 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3592 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3594 if (DECL_NAME (fndecl
) == NULL_TREE
3595 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3598 ? G_("too many arguments to constructor %q#D")
3599 : G_("too few arguments to constructor %q#D"),
3604 ? G_("too many arguments to member function %q#D")
3605 : G_("too few arguments to member function %q#D"),
3611 ? G_("too many arguments to function %q#D")
3612 : G_("too few arguments to function %q#D"),
3614 if (!DECL_IS_BUILTIN (fndecl
))
3615 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
3619 if (c_dialect_objc () && objc_message_selector ())
3622 ? G_("too many arguments to method %q#D")
3623 : G_("too few arguments to method %q#D"),
3624 objc_message_selector ());
3626 error_at (loc
, too_many_p
? G_("too many arguments to function")
3627 : G_("too few arguments to function"));
3631 /* Convert the actual parameter expressions in the list VALUES to the
3632 types in the list TYPELIST. The converted expressions are stored
3633 back in the VALUES vector.
3634 If parmdecls is exhausted, or when an element has NULL as its type,
3635 perform the default conversions.
3637 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3639 This is also where warnings about wrong number of args are generated.
3641 Returns the actual number of arguments processed (which might be less
3642 than the length of the vector), or -1 on error.
3644 In C++, unspecified trailing parameters can be filled in with their
3645 default arguments, if such were specified. Do so here. */
3648 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
3649 int flags
, tsubst_flags_t complain
)
3654 /* Argument passing is always copy-initialization. */
3655 flags
|= LOOKUP_ONLYCONVERTING
;
3657 for (i
= 0, typetail
= typelist
;
3658 i
< vec_safe_length (*values
);
3661 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3662 tree val
= (**values
)[i
];
3664 if (val
== error_mark_node
|| type
== error_mark_node
)
3667 if (type
== void_type_node
)
3669 if (complain
& tf_error
)
3671 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3678 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3679 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3680 if (TREE_CODE (val
) == NOP_EXPR
3681 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3682 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3683 val
= TREE_OPERAND (val
, 0);
3685 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3687 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3688 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3689 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3690 val
= decay_conversion (val
, complain
);
3693 if (val
== error_mark_node
)
3698 /* Formal parm type is specified by a function prototype. */
3701 if (!COMPLETE_TYPE_P (complete_type (type
)))
3703 if (complain
& tf_error
)
3706 error ("parameter %P of %qD has incomplete type %qT",
3709 error ("parameter %P has incomplete type %qT", i
, type
);
3711 parmval
= error_mark_node
;
3715 parmval
= convert_for_initialization
3716 (NULL_TREE
, type
, val
, flags
,
3717 ICR_ARGPASS
, fndecl
, i
, complain
);
3718 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
3721 if (parmval
== error_mark_node
)
3724 (**values
)[i
] = parmval
;
3728 if (fndecl
&& magic_varargs_p (fndecl
))
3729 /* Don't do ellipsis conversion for __built_in_constant_p
3730 as this will result in spurious errors for non-trivial
3732 val
= require_complete_type_sfinae (val
, complain
);
3734 val
= convert_arg_to_ellipsis (val
, complain
);
3736 (**values
)[i
] = val
;
3740 typetail
= TREE_CHAIN (typetail
);
3743 if (typetail
!= 0 && typetail
!= void_list_node
)
3745 /* See if there are default arguments that can be used. Because
3746 we hold default arguments in the FUNCTION_TYPE (which is so
3747 wrong), we can see default parameters here from deduced
3748 contexts (and via typeof) for indirect function calls.
3749 Fortunately we know whether we have a function decl to
3750 provide default arguments in a language conformant
3752 if (fndecl
&& TREE_PURPOSE (typetail
)
3753 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3755 for (; typetail
!= void_list_node
; ++i
)
3758 = convert_default_arg (TREE_VALUE (typetail
),
3759 TREE_PURPOSE (typetail
),
3760 fndecl
, i
, complain
);
3762 if (parmval
== error_mark_node
)
3765 vec_safe_push (*values
, parmval
);
3766 typetail
= TREE_CHAIN (typetail
);
3767 /* ends with `...'. */
3768 if (typetail
== NULL_TREE
)
3774 if (complain
& tf_error
)
3775 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3783 /* Build a binary-operation expression, after performing default
3784 conversions on the operands. CODE is the kind of expression to
3785 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3786 are the tree codes which correspond to ARG1 and ARG2 when issuing
3787 warnings about possibly misplaced parentheses. They may differ
3788 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3789 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3790 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3791 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3792 ARG2_CODE as ERROR_MARK. */
3795 build_x_binary_op (location_t loc
, enum tree_code code
, tree arg1
,
3796 enum tree_code arg1_code
, tree arg2
,
3797 enum tree_code arg2_code
, tree
*overload
,
3798 tsubst_flags_t complain
)
3807 if (processing_template_decl
)
3809 if (type_dependent_expression_p (arg1
)
3810 || type_dependent_expression_p (arg2
))
3811 return build_min_nt_loc (loc
, code
, arg1
, arg2
);
3812 arg1
= build_non_dependent_expr (arg1
);
3813 arg2
= build_non_dependent_expr (arg2
);
3816 if (code
== DOTSTAR_EXPR
)
3817 expr
= build_m_component_ref (arg1
, arg2
, complain
);
3819 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3820 overload
, complain
);
3822 /* Check for cases such as x+y<<z which users are likely to
3823 misinterpret. But don't warn about obj << x + y, since that is a
3824 common idiom for I/O. */
3825 if (warn_parentheses
3826 && (complain
& tf_warning
)
3827 && !processing_template_decl
3828 && !error_operand_p (arg1
)
3829 && !error_operand_p (arg2
)
3830 && (code
!= LSHIFT_EXPR
3831 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3832 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
3833 arg2_code
, orig_arg2
);
3835 if (processing_template_decl
&& expr
!= error_mark_node
)
3836 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3841 /* Build and return an ARRAY_REF expression. */
3844 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
3845 tsubst_flags_t complain
)
3847 tree orig_arg1
= arg1
;
3848 tree orig_arg2
= arg2
;
3851 if (processing_template_decl
)
3853 if (type_dependent_expression_p (arg1
)
3854 || type_dependent_expression_p (arg2
))
3855 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
3856 NULL_TREE
, NULL_TREE
);
3857 arg1
= build_non_dependent_expr (arg1
);
3858 arg2
= build_non_dependent_expr (arg2
);
3861 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
3862 NULL_TREE
, /*overload=*/NULL
, complain
);
3864 if (processing_template_decl
&& expr
!= error_mark_node
)
3865 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
3866 NULL_TREE
, NULL_TREE
);
3870 /* Return whether OP is an expression of enum type cast to integer
3871 type. In C++ even unsigned enum types are cast to signed integer
3872 types. We do not want to issue warnings about comparisons between
3873 signed and unsigned types when one of the types is an enum type.
3874 Those warnings are always false positives in practice. */
3877 enum_cast_to_int (tree op
)
3879 if (CONVERT_EXPR_P (op
)
3880 && TREE_TYPE (op
) == integer_type_node
3881 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
3882 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
3885 /* The cast may have been pushed into a COND_EXPR. */
3886 if (TREE_CODE (op
) == COND_EXPR
)
3887 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
3888 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
3893 /* For the c-common bits. */
3895 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
3898 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
3902 /* Build a binary-operation expression without default conversions.
3903 CODE is the kind of expression to build.
3904 LOCATION is the location_t of the operator in the source code.
3905 This function differs from `build' in several ways:
3906 the data type of the result is computed and recorded in it,
3907 warnings are generated if arg data types are invalid,
3908 special handling for addition and subtraction of pointers is known,
3909 and some optimization is done (operations on narrow ints
3910 are done in the narrower type when that gives the same result).
3911 Constant folding is also done before the result is returned.
3913 Note that the operands will never have enumeral types
3914 because either they have just had the default conversions performed
3915 or they have both just been converted to some other type in which
3916 the arithmetic is to be done.
3918 C++: must do special pointer arithmetic when implementing
3919 multiple inheritance, and deal with pointer to member functions. */
3922 cp_build_binary_op (location_t location
,
3923 enum tree_code code
, tree orig_op0
, tree orig_op1
,
3924 tsubst_flags_t complain
)
3927 enum tree_code code0
, code1
;
3929 const char *invalid_op_diag
;
3931 /* Expression code to give to the expression when it is built.
3932 Normally this is CODE, which is what the caller asked for,
3933 but in some special cases we change it. */
3934 enum tree_code resultcode
= code
;
3936 /* Data type in which the computation is to be performed.
3937 In the simplest cases this is the common type of the arguments. */
3938 tree result_type
= NULL
;
3940 /* Nonzero means operands have already been type-converted
3941 in whatever way is necessary.
3942 Zero means they need to be converted to RESULT_TYPE. */
3945 /* Nonzero means create the expression with this type, rather than
3947 tree build_type
= 0;
3949 /* Nonzero means after finally constructing the expression
3950 convert it to this type. */
3951 tree final_type
= 0;
3954 tree orig_type
= NULL
;
3956 /* Nonzero if this is an operation like MIN or MAX which can
3957 safely be computed in short if both args are promoted shorts.
3958 Also implies COMMON.
3959 -1 indicates a bitwise operation; this makes a difference
3960 in the exact conditions for when it is safe to do the operation
3961 in a narrower mode. */
3964 /* Nonzero if this is a comparison operation;
3965 if both args are promoted shorts, compare the original shorts.
3966 Also implies COMMON. */
3967 int short_compare
= 0;
3969 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3972 /* True if both operands have arithmetic type. */
3973 bool arithmetic_types_p
;
3975 /* Apply default conversions. */
3979 /* Remember whether we're doing / or %. */
3980 bool doing_div_or_mod
= false;
3982 /* Remember whether we're doing << or >>. */
3983 bool doing_shift
= false;
3985 /* Tree holding instrumentation expression. */
3986 tree instrument_expr
= NULL
;
3988 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3989 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3990 || code
== TRUTH_XOR_EXPR
)
3992 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
3993 op0
= decay_conversion (op0
, complain
);
3994 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
3995 op1
= decay_conversion (op1
, complain
);
3999 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4000 op0
= cp_default_conversion (op0
, complain
);
4001 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4002 op1
= cp_default_conversion (op1
, complain
);
4005 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
4006 STRIP_TYPE_NOPS (op0
);
4007 STRIP_TYPE_NOPS (op1
);
4009 /* DTRT if one side is an overloaded function, but complain about it. */
4010 if (type_unknown_p (op0
))
4012 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
4013 if (t
!= error_mark_node
)
4015 if (complain
& tf_error
)
4016 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4021 if (type_unknown_p (op1
))
4023 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
4024 if (t
!= error_mark_node
)
4026 if (complain
& tf_error
)
4027 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4033 type0
= TREE_TYPE (op0
);
4034 type1
= TREE_TYPE (op1
);
4036 /* The expression codes of the data types of the arguments tell us
4037 whether the arguments are integers, floating, pointers, etc. */
4038 code0
= TREE_CODE (type0
);
4039 code1
= TREE_CODE (type1
);
4041 /* If an error was already reported for one of the arguments,
4042 avoid reporting another error. */
4043 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
4044 return error_mark_node
;
4046 if ((invalid_op_diag
4047 = targetm
.invalid_binary_op (code
, type0
, type1
)))
4049 if (complain
& tf_error
)
4050 error (invalid_op_diag
);
4051 return error_mark_node
;
4054 /* Issue warnings about peculiar, but valid, uses of NULL. */
4055 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
4056 /* It's reasonable to use pointer values as operands of &&
4057 and ||, so NULL is no exception. */
4058 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
4059 && ( /* Both are NULL (or 0) and the operation was not a
4060 comparison or a pointer subtraction. */
4061 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
4062 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
4063 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4064 || (!null_ptr_cst_p (orig_op0
)
4065 && !TYPE_PTR_OR_PTRMEM_P (type0
))
4066 || (!null_ptr_cst_p (orig_op1
)
4067 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
4068 && (complain
& tf_warning
))
4070 source_location loc
=
4071 expansion_point_location_if_in_system_header (input_location
);
4073 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
4076 /* In case when one of the operands of the binary operation is
4077 a vector and another is a scalar -- convert scalar to vector. */
4078 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
4080 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
4081 complain
& tf_error
);
4083 switch (convert_flag
)
4086 return error_mark_node
;
4089 op0
= convert (TREE_TYPE (type1
), op0
);
4090 op0
= save_expr (op0
);
4091 op0
= build_vector_from_val (type1
, op0
);
4092 type0
= TREE_TYPE (op0
);
4093 code0
= TREE_CODE (type0
);
4099 op1
= convert (TREE_TYPE (type0
), op1
);
4100 op1
= save_expr (op1
);
4101 op1
= build_vector_from_val (type0
, op1
);
4102 type1
= TREE_TYPE (op1
);
4103 code1
= TREE_CODE (type1
);
4115 /* Subtraction of two similar pointers.
4116 We must subtract them as integers, then divide by object size. */
4117 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
4118 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4120 return pointer_diff (op0
, op1
, common_pointer_type (type0
, type1
),
4122 /* In all other cases except pointer - int, the usual arithmetic
4124 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
4129 /* The pointer - int case is just like pointer + int; fall
4132 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
4133 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
4137 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
4138 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
4139 if (processing_template_decl
)
4141 result_type
= TREE_TYPE (ptr_operand
);
4144 return cp_pointer_int_sum (code
,
4156 case TRUNC_DIV_EXPR
:
4158 case FLOOR_DIV_EXPR
:
4159 case ROUND_DIV_EXPR
:
4160 case EXACT_DIV_EXPR
:
4161 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4162 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
4163 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4164 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
4166 enum tree_code tcode0
= code0
, tcode1
= code1
;
4167 tree cop1
= fold_non_dependent_expr (op1
);
4168 doing_div_or_mod
= true;
4169 warn_for_div_by_zero (location
, cop1
);
4171 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
4172 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
4173 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
4174 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
4176 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
4177 resultcode
= RDIV_EXPR
;
4179 /* When dividing two signed integers, we have to promote to int.
4180 unless we divide by a constant != -1. Note that default
4181 conversion will have been performed on the operands at this
4182 point, so we have to dig out the original type to find out if
4184 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4185 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4186 || (TREE_CODE (op1
) == INTEGER_CST
4187 && ! integer_all_onesp (op1
)));
4196 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4197 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4198 && !VECTOR_FLOAT_TYPE_P (type0
)
4199 && !VECTOR_FLOAT_TYPE_P (type1
)))
4203 case TRUNC_MOD_EXPR
:
4204 case FLOOR_MOD_EXPR
:
4206 tree cop1
= fold_non_dependent_expr (op1
);
4207 doing_div_or_mod
= true;
4208 warn_for_div_by_zero (location
, cop1
);
4211 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4212 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4213 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
4215 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4217 /* Although it would be tempting to shorten always here, that loses
4218 on some targets, since the modulo instruction is undefined if the
4219 quotient can't be represented in the computation mode. We shorten
4220 only if unsigned or if dividing by something we know != -1. */
4221 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4222 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4223 || (TREE_CODE (op1
) == INTEGER_CST
4224 && ! integer_all_onesp (op1
)));
4229 case TRUTH_ANDIF_EXPR
:
4230 case TRUTH_ORIF_EXPR
:
4231 case TRUTH_AND_EXPR
:
4233 if (!VECTOR_TYPE_P (type0
) && VECTOR_TYPE_P (type1
))
4235 if (!COMPARISON_CLASS_P (op1
))
4236 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4237 build_zero_cst (type1
), complain
);
4238 if (code
== TRUTH_ANDIF_EXPR
)
4240 tree z
= build_zero_cst (TREE_TYPE (op1
));
4241 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
4243 else if (code
== TRUTH_ORIF_EXPR
)
4245 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
4246 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
4251 if (VECTOR_TYPE_P (type0
))
4253 if (!COMPARISON_CLASS_P (op0
))
4254 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
4255 build_zero_cst (type0
), complain
);
4256 if (!VECTOR_TYPE_P (type1
))
4258 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
4259 tree z
= build_zero_cst (TREE_TYPE (op0
));
4260 op1
= build_conditional_expr (location
, op1
, z
, m1
, complain
);
4262 else if (!COMPARISON_CLASS_P (op1
))
4263 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4264 build_zero_cst (type1
), complain
);
4266 if (code
== TRUTH_ANDIF_EXPR
)
4267 code
= BIT_AND_EXPR
;
4268 else if (code
== TRUTH_ORIF_EXPR
)
4269 code
= BIT_IOR_EXPR
;
4273 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
4276 result_type
= boolean_type_node
;
4279 /* Shift operations: result has same type as first operand;
4280 always convert second operand to int.
4281 Also set SHORT_SHIFT if shifting rightward. */
4284 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4285 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4287 result_type
= type0
;
4290 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4291 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4292 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4293 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4295 result_type
= type0
;
4298 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4300 tree const_op1
= fold_non_dependent_expr (op1
);
4301 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4303 result_type
= type0
;
4305 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4307 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4309 if ((complain
& tf_warning
)
4310 && c_inhibit_evaluation_warnings
== 0)
4311 warning (OPT_Wshift_count_negative
,
4312 "right shift count is negative");
4316 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
4317 && (complain
& tf_warning
)
4318 && c_inhibit_evaluation_warnings
== 0)
4319 warning (OPT_Wshift_count_overflow
,
4320 "right shift count >= width of type");
4323 /* Avoid converting op1 to result_type later. */
4329 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4330 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4332 result_type
= type0
;
4335 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4336 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4337 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4338 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4340 result_type
= type0
;
4343 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4345 tree const_op0
= fold_non_dependent_expr (op0
);
4346 if (TREE_CODE (const_op0
) != INTEGER_CST
)
4348 tree const_op1
= fold_non_dependent_expr (op1
);
4349 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4351 result_type
= type0
;
4353 if (TREE_CODE (const_op0
) == INTEGER_CST
4354 && tree_int_cst_sgn (const_op0
) < 0
4355 && (complain
& tf_warning
)
4356 && c_inhibit_evaluation_warnings
== 0)
4357 warning (OPT_Wshift_negative_value
,
4358 "left shift of negative value");
4359 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4361 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4363 if ((complain
& tf_warning
)
4364 && c_inhibit_evaluation_warnings
== 0)
4365 warning (OPT_Wshift_count_negative
,
4366 "left shift count is negative");
4368 else if (compare_tree_int (const_op1
,
4369 TYPE_PRECISION (type0
)) >= 0)
4371 if ((complain
& tf_warning
)
4372 && c_inhibit_evaluation_warnings
== 0)
4373 warning (OPT_Wshift_count_overflow
,
4374 "left shift count >= width of type");
4376 else if (TREE_CODE (const_op0
) == INTEGER_CST
4377 && (complain
& tf_warning
))
4378 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
4380 /* Avoid converting op1 to result_type later. */
4387 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4389 result_type
= type0
;
4390 if (TREE_CODE (op1
) == INTEGER_CST
)
4392 if (tree_int_cst_lt (op1
, integer_zero_node
))
4394 if (complain
& tf_warning
)
4395 warning (0, (code
== LROTATE_EXPR
)
4396 ? G_("left rotate count is negative")
4397 : G_("right rotate count is negative"));
4399 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4401 if (complain
& tf_warning
)
4402 warning (0, (code
== LROTATE_EXPR
)
4403 ? G_("left rotate count >= width of type")
4404 : G_("right rotate count >= width of type"));
4407 /* Convert the shift-count to an integer, regardless of
4408 size of value being shifted. */
4409 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4410 op1
= cp_convert (integer_type_node
, op1
, complain
);
4416 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4417 goto vector_compare
;
4418 if ((complain
& tf_warning
)
4419 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4420 warning (OPT_Wfloat_equal
,
4421 "comparing floating point with == or != is unsafe");
4422 if ((complain
& tf_warning
)
4423 && ((TREE_CODE (orig_op0
) == STRING_CST
&& !integer_zerop (op1
))
4424 || (TREE_CODE (orig_op1
) == STRING_CST
&& !integer_zerop (op0
))))
4425 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4427 build_type
= boolean_type_node
;
4428 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4429 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4430 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4431 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4433 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
4434 && null_ptr_cst_p (op1
))
4435 /* Handle, eg, (void*)0 (c++/43906), and more. */
4436 || (code0
== POINTER_TYPE
4437 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
4439 if (TYPE_PTR_P (type1
))
4440 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4441 CPO_COMPARISON
, complain
);
4443 result_type
= type0
;
4445 if (TREE_CODE (op0
) == ADDR_EXPR
4446 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
4448 if ((complain
& tf_warning
)
4449 && c_inhibit_evaluation_warnings
== 0
4450 && !TREE_NO_WARNING (op0
))
4451 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4452 TREE_OPERAND (op0
, 0));
4455 if (CONVERT_EXPR_P (op0
)
4456 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op0
, 0)))
4459 tree inner_op0
= op0
;
4460 STRIP_NOPS (inner_op0
);
4462 if ((complain
& tf_warning
)
4463 && c_inhibit_evaluation_warnings
== 0
4464 && !TREE_NO_WARNING (op0
)
4465 && DECL_P (inner_op0
))
4466 warning_at (location
, OPT_Waddress
,
4467 "the compiler can assume that the address of "
4468 "%qD will never be NULL",
4472 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
4473 && null_ptr_cst_p (op0
))
4474 /* Handle, eg, (void*)0 (c++/43906), and more. */
4475 || (code1
== POINTER_TYPE
4476 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
4478 if (TYPE_PTR_P (type0
))
4479 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4480 CPO_COMPARISON
, complain
);
4482 result_type
= type1
;
4484 if (TREE_CODE (op1
) == ADDR_EXPR
4485 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
4487 if ((complain
& tf_warning
)
4488 && c_inhibit_evaluation_warnings
== 0
4489 && !TREE_NO_WARNING (op1
))
4490 warning (OPT_Waddress
, "the address of %qD will never be NULL",
4491 TREE_OPERAND (op1
, 0));
4494 if (CONVERT_EXPR_P (op1
)
4495 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op1
, 0)))
4498 tree inner_op1
= op1
;
4499 STRIP_NOPS (inner_op1
);
4501 if ((complain
& tf_warning
)
4502 && c_inhibit_evaluation_warnings
== 0
4503 && !TREE_NO_WARNING (op1
)
4504 && DECL_P (inner_op1
))
4505 warning_at (location
, OPT_Waddress
,
4506 "the compiler can assume that the address of "
4507 "%qD will never be NULL",
4511 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4512 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
4513 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4514 CPO_COMPARISON
, complain
);
4515 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4516 /* One of the operands must be of nullptr_t type. */
4517 result_type
= TREE_TYPE (nullptr_node
);
4518 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4520 result_type
= type0
;
4521 if (complain
& tf_error
)
4522 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4524 return error_mark_node
;
4526 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4528 result_type
= type1
;
4529 if (complain
& tf_error
)
4530 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4532 return error_mark_node
;
4534 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
4536 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4537 == ptrmemfunc_vbit_in_delta
)
4539 tree pfn0
, delta0
, e1
, e2
;
4541 if (TREE_SIDE_EFFECTS (op0
))
4542 op0
= save_expr (op0
);
4544 pfn0
= pfn_from_ptrmemfunc (op0
);
4545 delta0
= delta_from_ptrmemfunc (op0
);
4546 e1
= cp_build_binary_op (location
,
4549 build_zero_cst (TREE_TYPE (pfn0
)),
4551 e2
= cp_build_binary_op (location
,
4557 if (complain
& tf_warning
)
4558 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
4560 e2
= cp_build_binary_op (location
,
4561 EQ_EXPR
, e2
, integer_zero_node
,
4563 op0
= cp_build_binary_op (location
,
4564 TRUTH_ANDIF_EXPR
, e1
, e2
,
4566 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
4570 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4571 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
4573 result_type
= TREE_TYPE (op0
);
4575 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
4576 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4577 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4580 /* E will be the final comparison. */
4582 /* E1 and E2 are for scratch. */
4590 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4591 CPO_COMPARISON
, complain
);
4593 if (!same_type_p (TREE_TYPE (op0
), type
))
4594 op0
= cp_convert_and_check (type
, op0
, complain
);
4595 if (!same_type_p (TREE_TYPE (op1
), type
))
4596 op1
= cp_convert_and_check (type
, op1
, complain
);
4598 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4599 return error_mark_node
;
4601 if (TREE_SIDE_EFFECTS (op0
))
4602 op0
= save_expr (op0
);
4603 if (TREE_SIDE_EFFECTS (op1
))
4604 op1
= save_expr (op1
);
4606 pfn0
= pfn_from_ptrmemfunc (op0
);
4607 /* Avoid -Waddress warnings (c++/64877). */
4608 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
4609 TREE_NO_WARNING (pfn0
) = 1;
4610 pfn1
= pfn_from_ptrmemfunc (op1
);
4611 delta0
= delta_from_ptrmemfunc (op0
);
4612 delta1
= delta_from_ptrmemfunc (op1
);
4613 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4614 == ptrmemfunc_vbit_in_delta
)
4619 && ((op0.delta == op1.delta)
4620 || (!op0.pfn && op0.delta & 1 == 0
4621 && op1.delta & 1 == 0))
4623 The reason for the `!op0.pfn' bit is that a NULL
4624 pointer-to-member is any member with a zero PFN and
4625 LSB of the DELTA field is 0. */
4627 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4631 e1
= cp_build_binary_op (location
,
4632 EQ_EXPR
, e1
, integer_zero_node
,
4634 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4638 e2
= cp_build_binary_op (location
,
4639 EQ_EXPR
, e2
, integer_zero_node
,
4641 e1
= cp_build_binary_op (location
,
4642 TRUTH_ANDIF_EXPR
, e2
, e1
,
4644 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4646 build_zero_cst (TREE_TYPE (pfn0
)),
4648 e2
= cp_build_binary_op (location
,
4649 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4650 e1
= cp_build_binary_op (location
,
4651 EQ_EXPR
, delta0
, delta1
, complain
);
4652 e1
= cp_build_binary_op (location
,
4653 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4660 && (!op0.pfn || op0.delta == op1.delta))
4662 The reason for the `!op0.pfn' bit is that a NULL
4663 pointer-to-member is any member with a zero PFN; the
4664 DELTA field is unspecified. */
4666 e1
= cp_build_binary_op (location
,
4667 EQ_EXPR
, delta0
, delta1
, complain
);
4668 e2
= cp_build_binary_op (location
,
4671 build_zero_cst (TREE_TYPE (pfn0
)),
4673 e1
= cp_build_binary_op (location
,
4674 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4676 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4677 e
= cp_build_binary_op (location
,
4678 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4679 if (code
== EQ_EXPR
)
4681 return cp_build_binary_op (location
,
4682 EQ_EXPR
, e
, integer_zero_node
, complain
);
4686 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4687 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4689 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4690 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4698 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4699 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4701 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4702 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4703 CPO_COMPARISON
, complain
);
4710 if (TREE_CODE (orig_op0
) == STRING_CST
4711 || TREE_CODE (orig_op1
) == STRING_CST
)
4713 if (complain
& tf_warning
)
4714 warning (OPT_Waddress
, "comparison with string literal results in unspecified behaviour");
4717 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4721 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4723 && !vector_types_compatible_elements_p (type0
, type1
))
4725 if (complain
& tf_error
)
4727 error_at (location
, "comparing vectors with different "
4729 inform (location
, "operand types are %qT and %qT",
4732 return error_mark_node
;
4735 if (TYPE_VECTOR_SUBPARTS (type0
) != TYPE_VECTOR_SUBPARTS (type1
))
4737 if (complain
& tf_error
)
4739 error_at (location
, "comparing vectors with different "
4740 "number of elements");
4741 inform (location
, "operand types are %qT and %qT",
4744 return error_mark_node
;
4747 /* Always construct signed integer vector type. */
4748 intt
= c_common_type_for_size (GET_MODE_BITSIZE
4749 (TYPE_MODE (TREE_TYPE (type0
))), 0);
4752 if (complain
& tf_error
)
4753 error_at (location
, "could not find an integer type "
4754 "of the same size as %qT", TREE_TYPE (type0
));
4755 return error_mark_node
;
4757 result_type
= build_opaque_vector_type (intt
,
4758 TYPE_VECTOR_SUBPARTS (type0
));
4762 build_type
= boolean_type_node
;
4763 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4764 || code0
== ENUMERAL_TYPE
)
4765 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4766 || code1
== ENUMERAL_TYPE
))
4768 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4769 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4770 CPO_COMPARISON
, complain
);
4771 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
4773 result_type
= type0
;
4774 if (extra_warnings
&& (complain
& tf_warning
))
4775 warning (OPT_Wextra
,
4776 "ordered comparison of pointer with integer zero");
4778 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
4780 result_type
= type1
;
4781 if (extra_warnings
&& (complain
& tf_warning
))
4782 warning (OPT_Wextra
,
4783 "ordered comparison of pointer with integer zero");
4785 else if (null_ptr_cst_p (op0
) && null_ptr_cst_p (op1
))
4786 /* One of the operands must be of nullptr_t type. */
4787 result_type
= TREE_TYPE (nullptr_node
);
4788 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4790 result_type
= type0
;
4791 if (complain
& tf_error
)
4792 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4794 return error_mark_node
;
4796 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4798 result_type
= type1
;
4799 if (complain
& tf_error
)
4800 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4802 return error_mark_node
;
4806 case UNORDERED_EXPR
:
4813 build_type
= integer_type_node
;
4814 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
4816 if (complain
& tf_error
)
4817 error ("unordered comparison on non-floating point argument");
4818 return error_mark_node
;
4827 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
4828 || code0
== ENUMERAL_TYPE
)
4829 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4830 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
4831 arithmetic_types_p
= 1;
4834 arithmetic_types_p
= 0;
4835 /* Vector arithmetic is only allowed when both sides are vectors. */
4836 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4838 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
4839 || !vector_types_compatible_elements_p (type0
, type1
))
4841 if (complain
& tf_error
)
4842 binary_op_error (location
, code
, type0
, type1
);
4843 return error_mark_node
;
4845 arithmetic_types_p
= 1;
4848 /* Determine the RESULT_TYPE, if it is not already known. */
4850 && arithmetic_types_p
4851 && (shorten
|| common
|| short_compare
))
4853 result_type
= cp_common_type (type0
, type1
);
4854 if (complain
& tf_warning
)
4855 do_warn_double_promotion (result_type
, type0
, type1
,
4856 "implicit conversion from %qT to %qT "
4857 "to match other operand of binary "
4864 if (complain
& tf_error
)
4865 error ("invalid operands of types %qT and %qT to binary %qO",
4866 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
4867 return error_mark_node
;
4870 /* If we're in a template, the only thing we need to know is the
4872 if (processing_template_decl
)
4874 /* Since the middle-end checks the type when doing a build2, we
4875 need to build the tree in pieces. This built tree will never
4876 get out of the front-end as we replace it when instantiating
4878 tree tmp
= build2 (resultcode
,
4879 build_type
? build_type
: result_type
,
4881 TREE_OPERAND (tmp
, 0) = op0
;
4885 if (arithmetic_types_p
)
4887 bool first_complex
= (code0
== COMPLEX_TYPE
);
4888 bool second_complex
= (code1
== COMPLEX_TYPE
);
4889 int none_complex
= (!first_complex
&& !second_complex
);
4891 /* Adapted from patch for c/24581. */
4892 if (first_complex
!= second_complex
4893 && (code
== PLUS_EXPR
4894 || code
== MINUS_EXPR
4895 || code
== MULT_EXPR
4896 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
4897 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
4898 && flag_signed_zeros
)
4900 /* An operation on mixed real/complex operands must be
4901 handled specially, but the language-independent code can
4902 more easily optimize the plain complex arithmetic if
4903 -fno-signed-zeros. */
4904 tree real_type
= TREE_TYPE (result_type
);
4908 if (TREE_TYPE (op0
) != result_type
)
4909 op0
= cp_convert_and_check (result_type
, op0
, complain
);
4910 if (TREE_TYPE (op1
) != real_type
)
4911 op1
= cp_convert_and_check (real_type
, op1
, complain
);
4915 if (TREE_TYPE (op0
) != real_type
)
4916 op0
= cp_convert_and_check (real_type
, op0
, complain
);
4917 if (TREE_TYPE (op1
) != result_type
)
4918 op1
= cp_convert_and_check (result_type
, op1
, complain
);
4920 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
4921 return error_mark_node
;
4924 op0
= save_expr (op0
);
4925 real
= cp_build_unary_op (REALPART_EXPR
, op0
, 1, complain
);
4926 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, 1, complain
);
4930 case TRUNC_DIV_EXPR
:
4931 op1
= save_expr (op1
);
4932 imag
= build2 (resultcode
, real_type
, imag
, op1
);
4936 real
= build2 (resultcode
, real_type
, real
, op1
);
4944 op1
= save_expr (op1
);
4945 real
= cp_build_unary_op (REALPART_EXPR
, op1
, 1, complain
);
4946 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, 1, complain
);
4950 op0
= save_expr (op0
);
4951 imag
= build2 (resultcode
, real_type
, op0
, imag
);
4954 real
= build2 (resultcode
, real_type
, op0
, real
);
4957 real
= build2 (resultcode
, real_type
, op0
, real
);
4958 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
4964 real
= fold_if_not_in_template (real
);
4965 imag
= fold_if_not_in_template (imag
);
4966 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
4967 result
= fold_if_not_in_template (result
);
4971 /* For certain operations (which identify themselves by shorten != 0)
4972 if both args were extended from the same smaller type,
4973 do the arithmetic in that type and then extend.
4975 shorten !=0 and !=1 indicates a bitwise operation.
4976 For them, this optimization is safe only if
4977 both args are zero-extended or both are sign-extended.
4978 Otherwise, we might change the result.
4979 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4980 but calculated in (unsigned short) it would be (unsigned short)-1. */
4982 if (shorten
&& none_complex
)
4984 orig_type
= result_type
;
4985 final_type
= result_type
;
4986 result_type
= shorten_binary_op (result_type
, op0
, op1
,
4990 /* Comparison operations are shortened too but differently.
4991 They identify themselves by setting short_compare = 1. */
4995 /* Don't write &op0, etc., because that would prevent op0
4996 from being kept in a register.
4997 Instead, make copies of the our local variables and
4998 pass the copies by reference, then copy them back afterward. */
4999 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
5000 enum tree_code xresultcode
= resultcode
;
5002 = shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
5005 return cp_convert (boolean_type_node
, val
, complain
);
5006 op0
= xop0
, op1
= xop1
;
5008 resultcode
= xresultcode
;
5011 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
5012 && warn_sign_compare
5013 /* Do not warn until the template is instantiated; we cannot
5014 bound the ranges of the arguments until that point. */
5015 && !processing_template_decl
5016 && (complain
& tf_warning
)
5017 && c_inhibit_evaluation_warnings
== 0
5018 /* Even unsigned enum types promote to signed int. We don't
5019 want to issue -Wsign-compare warnings for this case. */
5020 && !enum_cast_to_int (orig_op0
)
5021 && !enum_cast_to_int (orig_op1
))
5023 tree oop0
= maybe_constant_value (orig_op0
);
5024 tree oop1
= maybe_constant_value (orig_op1
);
5026 if (TREE_CODE (oop0
) != INTEGER_CST
)
5028 if (TREE_CODE (oop1
) != INTEGER_CST
)
5030 warn_for_sign_compare (location
, oop0
, oop1
, op0
, op1
,
5031 result_type
, resultcode
);
5035 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
5036 Then the expression will be built.
5037 It will be given type FINAL_TYPE if that is nonzero;
5038 otherwise, it will be given type RESULT_TYPE. */
5041 if (TREE_TYPE (op0
) != result_type
)
5042 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5043 if (TREE_TYPE (op1
) != result_type
)
5044 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5046 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5047 return error_mark_node
;
5050 if (build_type
== NULL_TREE
)
5051 build_type
= result_type
;
5053 if ((flag_sanitize
& (SANITIZE_SHIFT
| SANITIZE_DIVIDE
5054 | SANITIZE_FLOAT_DIVIDE
))
5055 && !processing_template_decl
5056 && do_ubsan_in_current_function ()
5057 && (doing_div_or_mod
|| doing_shift
))
5059 /* OP0 and/or OP1 might have side-effects. */
5060 op0
= cp_save_expr (op0
);
5061 op1
= cp_save_expr (op1
);
5062 op0
= fold_non_dependent_expr (op0
);
5063 op1
= fold_non_dependent_expr (op1
);
5064 if (doing_div_or_mod
&& (flag_sanitize
& (SANITIZE_DIVIDE
5065 | SANITIZE_FLOAT_DIVIDE
)))
5067 /* For diagnostics we want to use the promoted types without
5068 shorten_binary_op. So convert the arguments to the
5069 original result_type. */
5072 if (orig_type
!= NULL
&& result_type
!= orig_type
)
5074 cop0
= cp_convert (orig_type
, op0
, complain
);
5075 cop1
= cp_convert (orig_type
, op1
, complain
);
5077 instrument_expr
= ubsan_instrument_division (location
, cop0
, cop1
);
5079 else if (doing_shift
&& (flag_sanitize
& SANITIZE_SHIFT
))
5080 instrument_expr
= ubsan_instrument_shift (location
, code
, op0
, op1
);
5083 result
= build2 (resultcode
, build_type
, op0
, op1
);
5084 result
= fold_if_not_in_template (result
);
5085 if (final_type
!= 0)
5086 result
= cp_convert (final_type
, result
, complain
);
5088 if (TREE_OVERFLOW_P (result
)
5089 && !TREE_OVERFLOW_P (op0
)
5090 && !TREE_OVERFLOW_P (op1
))
5091 overflow_warning (location
, result
);
5093 if (instrument_expr
!= NULL
)
5094 result
= fold_build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5095 instrument_expr
, result
);
5100 /* Build a VEC_PERM_EXPR.
5101 This is a simple wrapper for c_build_vec_perm_expr. */
5103 build_x_vec_perm_expr (location_t loc
,
5104 tree arg0
, tree arg1
, tree arg2
,
5105 tsubst_flags_t complain
)
5107 tree orig_arg0
= arg0
;
5108 tree orig_arg1
= arg1
;
5109 tree orig_arg2
= arg2
;
5110 if (processing_template_decl
)
5112 if (type_dependent_expression_p (arg0
)
5113 || type_dependent_expression_p (arg1
)
5114 || type_dependent_expression_p (arg2
))
5115 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
5116 arg0
= build_non_dependent_expr (arg0
);
5118 arg1
= build_non_dependent_expr (arg1
);
5119 arg2
= build_non_dependent_expr (arg2
);
5121 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
5122 if (processing_template_decl
&& exp
!= error_mark_node
)
5123 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
5124 orig_arg1
, orig_arg2
);
5128 /* Return a tree for the sum or difference (RESULTCODE says which)
5129 of pointer PTROP and integer INTOP. */
5132 cp_pointer_int_sum (enum tree_code resultcode
, tree ptrop
, tree intop
,
5133 tsubst_flags_t complain
)
5135 tree res_type
= TREE_TYPE (ptrop
);
5137 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5138 in certain circumstance (when it's valid to do so). So we need
5139 to make sure it's complete. We don't need to check here, if we
5140 can actually complete it at all, as those checks will be done in
5141 pointer_int_sum() anyway. */
5142 complete_type (TREE_TYPE (res_type
));
5144 return pointer_int_sum (input_location
, resultcode
, ptrop
,
5145 fold_if_not_in_template (intop
),
5146 complain
& tf_warning_or_error
);
5149 /* Return a tree for the difference of pointers OP0 and OP1.
5150 The resulting tree has type int. */
5153 pointer_diff (tree op0
, tree op1
, tree ptrtype
, tsubst_flags_t complain
)
5156 tree restype
= ptrdiff_type_node
;
5157 tree target_type
= TREE_TYPE (ptrtype
);
5159 if (!complete_type_or_else (target_type
, NULL_TREE
))
5160 return error_mark_node
;
5162 if (VOID_TYPE_P (target_type
))
5164 if (complain
& tf_error
)
5165 permerror (input_location
, "ISO C++ forbids using pointer of "
5166 "type %<void *%> in subtraction");
5168 return error_mark_node
;
5170 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5172 if (complain
& tf_error
)
5173 permerror (input_location
, "ISO C++ forbids using pointer to "
5174 "a function in subtraction");
5176 return error_mark_node
;
5178 if (TREE_CODE (target_type
) == METHOD_TYPE
)
5180 if (complain
& tf_error
)
5181 permerror (input_location
, "ISO C++ forbids using pointer to "
5182 "a method in subtraction");
5184 return error_mark_node
;
5187 /* First do the subtraction as integers;
5188 then drop through to build the divide operator. */
5190 op0
= cp_build_binary_op (input_location
,
5192 cp_convert (restype
, op0
, complain
),
5193 cp_convert (restype
, op1
, complain
),
5196 /* This generates an error if op1 is a pointer to an incomplete type. */
5197 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
5199 if (complain
& tf_error
)
5200 error ("invalid use of a pointer to an incomplete type in "
5201 "pointer arithmetic");
5203 return error_mark_node
;
5206 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
5208 if (complain
& tf_error
)
5209 error ("arithmetic on pointer to an empty aggregate");
5211 return error_mark_node
;
5214 op1
= (TYPE_PTROB_P (ptrtype
)
5215 ? size_in_bytes (target_type
)
5216 : integer_one_node
);
5218 /* Do the division. */
5220 result
= build2 (EXACT_DIV_EXPR
, restype
, op0
,
5221 cp_convert (restype
, op1
, complain
));
5222 return fold_if_not_in_template (result
);
5225 /* Construct and perhaps optimize a tree representation
5226 for a unary operation. CODE, a tree_code, specifies the operation
5227 and XARG is the operand. */
5230 build_x_unary_op (location_t loc
, enum tree_code code
, tree xarg
,
5231 tsubst_flags_t complain
)
5233 tree orig_expr
= xarg
;
5237 if (processing_template_decl
)
5239 if (type_dependent_expression_p (xarg
))
5240 return build_min_nt_loc (loc
, code
, xarg
, NULL_TREE
);
5242 xarg
= build_non_dependent_expr (xarg
);
5247 /* [expr.unary.op] says:
5249 The address of an object of incomplete type can be taken.
5251 (And is just the ordinary address operator, not an overloaded
5252 "operator &".) However, if the type is a template
5253 specialization, we must complete the type at this point so that
5254 an overloaded "operator &" will be available if required. */
5255 if (code
== ADDR_EXPR
5256 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
5257 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
5258 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
5259 || (TREE_CODE (xarg
) == OFFSET_REF
)))
5260 /* Don't look for a function. */;
5262 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
5263 NULL_TREE
, /*overload=*/NULL
, complain
);
5264 if (!exp
&& code
== ADDR_EXPR
)
5266 if (is_overloaded_fn (xarg
))
5268 tree fn
= get_first_fn (xarg
);
5269 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
5271 if (complain
& tf_error
)
5272 error (DECL_CONSTRUCTOR_P (fn
)
5273 ? G_("taking address of constructor %qE")
5274 : G_("taking address of destructor %qE"),
5276 return error_mark_node
;
5280 /* A pointer to member-function can be formed only by saying
5282 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
5283 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
5285 if (TREE_CODE (xarg
) != OFFSET_REF
5286 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
5288 if (complain
& tf_error
)
5290 error ("invalid use of %qE to form a "
5291 "pointer-to-member-function", xarg
);
5292 if (TREE_CODE (xarg
) != OFFSET_REF
)
5293 inform (input_location
, " a qualified-id is required");
5295 return error_mark_node
;
5299 if (complain
& tf_error
)
5300 error ("parentheses around %qE cannot be used to form a"
5301 " pointer-to-member-function",
5304 return error_mark_node
;
5305 PTRMEM_OK_P (xarg
) = 1;
5309 if (TREE_CODE (xarg
) == OFFSET_REF
)
5311 ptrmem
= PTRMEM_OK_P (xarg
);
5313 if (!ptrmem
&& !flag_ms_extensions
5314 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
5316 /* A single non-static member, make sure we don't allow a
5317 pointer-to-member. */
5318 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
5319 TREE_OPERAND (xarg
, 0),
5320 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
5321 PTRMEM_OK_P (xarg
) = ptrmem
;
5325 exp
= cp_build_addr_expr_strict (xarg
, complain
);
5328 if (processing_template_decl
&& exp
!= error_mark_node
)
5329 exp
= build_min_non_dep (code
, exp
, orig_expr
,
5330 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
5331 if (TREE_CODE (exp
) == ADDR_EXPR
)
5332 PTRMEM_OK_P (exp
) = ptrmem
;
5336 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5337 constants, where a null value is represented by an INTEGER_CST of
5341 cp_truthvalue_conversion (tree expr
)
5343 tree type
= TREE_TYPE (expr
);
5344 if (TYPE_PTRDATAMEM_P (type
)
5345 /* Avoid ICE on invalid use of non-static member function. */
5346 || TREE_CODE (expr
) == FUNCTION_DECL
)
5347 return build_binary_op (EXPR_LOCATION (expr
),
5348 NE_EXPR
, expr
, nullptr_node
, 1);
5349 else if (TYPE_PTR_P (type
) || TYPE_PTRMEMFUNC_P (type
))
5351 /* With -Wzero-as-null-pointer-constant do not warn for an
5352 'if (p)' or a 'while (!p)', where p is a pointer. */
5354 ++c_inhibit_evaluation_warnings
;
5355 ret
= c_common_truthvalue_conversion (input_location
, expr
);
5356 --c_inhibit_evaluation_warnings
;
5360 return c_common_truthvalue_conversion (input_location
, expr
);
5363 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5366 condition_conversion (tree expr
)
5369 if (processing_template_decl
)
5371 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
5372 tf_warning_or_error
, LOOKUP_NORMAL
);
5373 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
5377 /* Returns the address of T. This function will fold away
5378 ADDR_EXPR of INDIRECT_REF. */
5381 build_address (tree t
)
5383 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
5384 return error_mark_node
;
5385 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
);
5386 t
= build_fold_addr_expr (t
);
5387 if (TREE_CODE (t
) != ADDR_EXPR
)
5392 /* Return a NOP_EXPR converting EXPR to TYPE. */
5395 build_nop (tree type
, tree expr
)
5397 if (type
== error_mark_node
|| error_operand_p (expr
))
5399 return build1 (NOP_EXPR
, type
, expr
);
5402 /* Take the address of ARG, whatever that means under C++ semantics.
5403 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5404 and class rvalues as well.
5406 Nothing should call this function directly; instead, callers should use
5407 cp_build_addr_expr or cp_build_addr_expr_strict. */
5410 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
5415 if (!arg
|| error_operand_p (arg
))
5416 return error_mark_node
;
5418 arg
= mark_lvalue_use (arg
);
5419 argtype
= lvalue_type (arg
);
5421 gcc_assert (!identifier_p (arg
) || !IDENTIFIER_OPNAME_P (arg
));
5423 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5424 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
5426 /* They're trying to take the address of a unique non-static
5427 member function. This is ill-formed (except in MS-land),
5428 but let's try to DTRT.
5429 Note: We only handle unique functions here because we don't
5430 want to complain if there's a static overload; non-unique
5431 cases will be handled by instantiate_type. But we need to
5432 handle this case here to allow casts on the resulting PMF.
5433 We could defer this in non-MS mode, but it's easier to give
5434 a useful error here. */
5436 /* Inside constant member functions, the `this' pointer
5437 contains an extra const qualifier. TYPE_MAIN_VARIANT
5438 is used here to remove this const from the diagnostics
5439 and the created OFFSET_REF. */
5440 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5441 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5442 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5443 return error_mark_node
;
5445 if (! flag_ms_extensions
)
5447 tree name
= DECL_NAME (fn
);
5448 if (!(complain
& tf_error
))
5449 return error_mark_node
;
5450 else if (current_class_type
5451 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5452 /* An expression like &memfn. */
5453 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5454 " or parenthesized non-static member function to form"
5455 " a pointer to member function. Say %<&%T::%D%>",
5458 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5459 " function to form a pointer to member function."
5463 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
5466 /* Uninstantiated types are all functions. Taking the
5467 address of a function is a no-op, so just return the
5469 if (type_unknown_p (arg
))
5470 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5472 if (TREE_CODE (arg
) == OFFSET_REF
)
5473 /* We want a pointer to member; bypass all the code for actually taking
5474 the address of something. */
5477 /* Anything not already handled and not a true memory reference
5479 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5480 && TREE_CODE (argtype
) != METHOD_TYPE
)
5482 cp_lvalue_kind kind
= lvalue_kind (arg
);
5483 if (kind
== clk_none
)
5485 if (complain
& tf_error
)
5486 lvalue_error (input_location
, lv_addressof
);
5487 return error_mark_node
;
5489 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
5491 if (!(complain
& tf_error
))
5492 return error_mark_node
;
5493 if (kind
& clk_class
)
5494 /* Make this a permerror because we used to accept it. */
5495 permerror (input_location
, "taking address of temporary");
5497 error ("taking address of xvalue (rvalue reference)");
5501 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5503 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5504 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5507 else if (pedantic
&& DECL_MAIN_P (arg
))
5510 /* Apparently a lot of autoconf scripts for C++ packages do this,
5511 so only complain if -Wpedantic. */
5512 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5513 pedwarn (input_location
, OPT_Wpedantic
,
5514 "ISO C++ forbids taking address of function %<::main%>");
5515 else if (flag_pedantic_errors
)
5516 return error_mark_node
;
5519 /* Let &* cancel out to simplify resulting code. */
5520 if (INDIRECT_REF_P (arg
))
5522 /* We don't need to have `current_class_ptr' wrapped in a
5523 NON_LVALUE_EXPR node. */
5524 if (arg
== current_class_ref
)
5525 return current_class_ptr
;
5527 arg
= TREE_OPERAND (arg
, 0);
5528 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5530 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5531 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5534 /* Don't let this be an lvalue. */
5539 /* ??? Cope with user tricks that amount to offsetof. */
5540 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5541 && TREE_CODE (argtype
) != METHOD_TYPE
5542 && argtype
!= unknown_type_node
5543 && (val
= get_base_address (arg
))
5544 && COMPLETE_TYPE_P (TREE_TYPE (val
))
5545 && INDIRECT_REF_P (val
)
5546 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5548 tree type
= build_pointer_type (argtype
);
5549 return fold_convert (type
, fold_offsetof_1 (arg
));
5552 /* Handle complex lvalues (when permitted)
5553 by reduction to simpler cases. */
5554 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
5558 switch (TREE_CODE (arg
))
5562 case FIX_TRUNC_EXPR
:
5563 /* Even if we're not being pedantic, we cannot allow this
5564 extension when we're instantiating in a SFINAE
5566 if (! lvalue_p (arg
) && complain
== tf_none
)
5568 if (complain
& tf_error
)
5569 permerror (input_location
, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5571 return error_mark_node
;
5576 arg
= BASELINK_FUNCTIONS (arg
);
5580 arg
= OVL_CURRENT (arg
);
5585 /* Turn a reference to a non-static data member into a
5586 pointer-to-member. */
5591 gcc_assert (PTRMEM_OK_P (arg
));
5593 t
= TREE_OPERAND (arg
, 1);
5594 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5596 if (complain
& tf_error
)
5597 error ("cannot create pointer to reference member %qD", t
);
5598 return error_mark_node
;
5601 type
= build_ptrmem_type (context_for_name_lookup (t
),
5603 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5611 if (argtype
!= error_mark_node
)
5612 argtype
= build_pointer_type (argtype
);
5614 /* In a template, we are processing a non-dependent expression
5615 so we can just form an ADDR_EXPR with the correct type. */
5616 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5618 val
= build_address (arg
);
5619 if (TREE_CODE (arg
) == OFFSET_REF
)
5620 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5622 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
5624 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5626 /* We can only get here with a single static member
5628 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5629 && DECL_STATIC_FUNCTION_P (fn
));
5630 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5631 return error_mark_node
;
5632 val
= build_address (fn
);
5633 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5634 /* Do not lose object's side effects. */
5635 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5636 TREE_OPERAND (arg
, 0), val
);
5638 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
5640 if (complain
& tf_error
)
5641 error ("attempt to take address of bit-field structure member %qD",
5642 TREE_OPERAND (arg
, 1));
5643 return error_mark_node
;
5647 tree object
= TREE_OPERAND (arg
, 0);
5648 tree field
= TREE_OPERAND (arg
, 1);
5649 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5650 (TREE_TYPE (object
), decl_type_context (field
)));
5651 val
= build_address (arg
);
5654 if (TYPE_PTR_P (argtype
)
5655 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5657 build_ptrmemfunc_type (argtype
);
5658 val
= build_ptrmemfunc (argtype
, val
, 0,
5666 /* Take the address of ARG if it has one, even if it's an rvalue. */
5669 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
5671 return cp_build_addr_expr_1 (arg
, 0, complain
);
5674 /* Take the address of ARG, but only if it's an lvalue. */
5677 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
5679 return cp_build_addr_expr_1 (arg
, 1, complain
);
5682 /* C++: Must handle pointers to members.
5684 Perhaps type instantiation should be extended to handle conversion
5685 from aggregates to types we don't yet know we want? (Or are those
5686 cases typically errors which should be reported?)
5688 NOCONVERT nonzero suppresses the default promotions
5689 (such as from short to int). */
5692 cp_build_unary_op (enum tree_code code
, tree xarg
, int noconvert
,
5693 tsubst_flags_t complain
)
5695 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5698 const char *errstring
= NULL
;
5700 const char *invalid_op_diag
;
5702 if (!arg
|| error_operand_p (arg
))
5703 return error_mark_node
;
5705 if ((invalid_op_diag
5706 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5711 if (complain
& tf_error
)
5712 error (invalid_op_diag
);
5713 return error_mark_node
;
5718 case UNARY_PLUS_EXPR
:
5721 int flags
= WANT_ARITH
| WANT_ENUM
;
5722 /* Unary plus (but not unary minus) is allowed on pointers. */
5723 if (code
== UNARY_PLUS_EXPR
)
5724 flags
|= WANT_POINTER
;
5725 arg
= build_expr_type_conversion (flags
, arg
, true);
5727 errstring
= (code
== NEGATE_EXPR
5728 ? _("wrong type argument to unary minus")
5729 : _("wrong type argument to unary plus"));
5732 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5733 arg
= cp_perform_integral_promotions (arg
, complain
);
5735 /* Make sure the result is not an lvalue: a unary plus or minus
5736 expression is always a rvalue. */
5743 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5748 arg
= cp_default_conversion (arg
, complain
);
5749 if (arg
== error_mark_node
)
5750 return error_mark_node
;
5753 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5754 | WANT_VECTOR_OR_COMPLEX
,
5756 errstring
= _("wrong type argument to bit-complement");
5757 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5758 arg
= cp_perform_integral_promotions (arg
, complain
);
5762 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5763 errstring
= _("wrong type argument to abs");
5764 else if (!noconvert
)
5766 arg
= cp_default_conversion (arg
, complain
);
5767 if (arg
== error_mark_node
)
5768 return error_mark_node
;
5773 /* Conjugating a real value is a no-op, but allow it anyway. */
5774 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5775 errstring
= _("wrong type argument to conjugation");
5776 else if (!noconvert
)
5778 arg
= cp_default_conversion (arg
, complain
);
5779 if (arg
== error_mark_node
)
5780 return error_mark_node
;
5784 case TRUTH_NOT_EXPR
:
5785 if (VECTOR_TYPE_P (TREE_TYPE (arg
)))
5786 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
5787 build_zero_cst (TREE_TYPE (arg
)), complain
);
5788 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
5790 val
= invert_truthvalue_loc (input_location
, arg
);
5791 if (arg
!= error_mark_node
)
5793 errstring
= _("in argument to unary !");
5801 arg
= build_real_imag_expr (input_location
, code
, arg
);
5802 if (arg
== error_mark_node
)
5805 return fold_if_not_in_template (arg
);
5807 case PREINCREMENT_EXPR
:
5808 case POSTINCREMENT_EXPR
:
5809 case PREDECREMENT_EXPR
:
5810 case POSTDECREMENT_EXPR
:
5811 /* Handle complex lvalues (when permitted)
5812 by reduction to simpler cases. */
5814 val
= unary_complex_lvalue (code
, arg
);
5818 arg
= mark_lvalue_use (arg
);
5820 /* Increment or decrement the real part of the value,
5821 and don't change the imaginary part. */
5822 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5826 arg
= stabilize_reference (arg
);
5827 real
= cp_build_unary_op (REALPART_EXPR
, arg
, 1, complain
);
5828 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, 1, complain
);
5829 real
= cp_build_unary_op (code
, real
, 1, complain
);
5830 if (real
== error_mark_node
|| imag
== error_mark_node
)
5831 return error_mark_node
;
5832 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
5836 /* Report invalid types. */
5838 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
5841 if (code
== PREINCREMENT_EXPR
)
5842 errstring
= _("no pre-increment operator for type");
5843 else if (code
== POSTINCREMENT_EXPR
)
5844 errstring
= _("no post-increment operator for type");
5845 else if (code
== PREDECREMENT_EXPR
)
5846 errstring
= _("no pre-decrement operator for type");
5848 errstring
= _("no post-decrement operator for type");
5851 else if (arg
== error_mark_node
)
5852 return error_mark_node
;
5854 /* Report something read-only. */
5856 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
5857 || TREE_READONLY (arg
))
5859 if (complain
& tf_error
)
5860 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
5861 || code
== POSTINCREMENT_EXPR
)
5862 ? lv_increment
: lv_decrement
));
5864 return error_mark_node
;
5869 tree declared_type
= unlowered_expr_type (arg
);
5871 argtype
= TREE_TYPE (arg
);
5873 /* ARM $5.2.5 last annotation says this should be forbidden. */
5874 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
5876 if (complain
& tf_error
)
5877 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
5878 ? G_("ISO C++ forbids incrementing an enum")
5879 : G_("ISO C++ forbids decrementing an enum"));
5881 return error_mark_node
;
5884 /* Compute the increment. */
5886 if (TYPE_PTR_P (argtype
))
5888 tree type
= complete_type (TREE_TYPE (argtype
));
5890 if (!COMPLETE_OR_VOID_TYPE_P (type
))
5892 if (complain
& tf_error
)
5893 error (((code
== PREINCREMENT_EXPR
5894 || code
== POSTINCREMENT_EXPR
))
5895 ? G_("cannot increment a pointer to incomplete type %qT")
5896 : G_("cannot decrement a pointer to incomplete type %qT"),
5897 TREE_TYPE (argtype
));
5899 return error_mark_node
;
5901 else if (!TYPE_PTROB_P (argtype
))
5903 if (complain
& tf_error
)
5904 pedwarn (input_location
, OPT_Wpointer_arith
,
5905 (code
== PREINCREMENT_EXPR
5906 || code
== POSTINCREMENT_EXPR
)
5907 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5908 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5911 return error_mark_node
;
5914 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
5917 inc
= VECTOR_TYPE_P (argtype
)
5918 ? build_one_cst (argtype
)
5921 inc
= cp_convert (argtype
, inc
, complain
);
5923 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5924 need to ask Objective-C to build the increment or decrement
5925 expression for it. */
5926 if (objc_is_property_ref (arg
))
5927 return objc_build_incr_expr_for_property_ref (input_location
, code
,
5930 /* Complain about anything else that is not a true lvalue. */
5931 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
5932 || code
== POSTINCREMENT_EXPR
)
5933 ? lv_increment
: lv_decrement
),
5935 return error_mark_node
;
5937 /* Forbid using -- on `bool'. */
5938 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
5940 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
5942 if (complain
& tf_error
)
5943 error ("invalid use of Boolean expression as operand "
5944 "to %<operator--%>");
5945 return error_mark_node
;
5947 val
= boolean_increment (code
, arg
);
5949 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5950 /* An rvalue has no cv-qualifiers. */
5951 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
5953 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
5955 TREE_SIDE_EFFECTS (val
) = 1;
5960 /* Note that this operation never does default_conversion
5961 regardless of NOCONVERT. */
5962 return cp_build_addr_expr (arg
, complain
);
5971 argtype
= TREE_TYPE (arg
);
5972 return fold_if_not_in_template (build1 (code
, argtype
, arg
));
5975 if (complain
& tf_error
)
5976 error ("%s", errstring
);
5977 return error_mark_node
;
5980 /* Hook for the c-common bits that build a unary op. */
5982 build_unary_op (location_t
/*location*/,
5983 enum tree_code code
, tree xarg
, int noconvert
)
5985 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
5988 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5989 for certain kinds of expressions which are not really lvalues
5990 but which we can accept as lvalues.
5992 If ARG is not a kind of expression we can handle, return
5996 unary_complex_lvalue (enum tree_code code
, tree arg
)
5998 /* Inside a template, making these kinds of adjustments is
5999 pointless; we are only concerned with the type of the
6001 if (processing_template_decl
)
6004 /* Handle (a, b) used as an "lvalue". */
6005 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
6007 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), 0,
6008 tf_warning_or_error
);
6009 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6010 TREE_OPERAND (arg
, 0), real_result
);
6013 /* Handle (a ? b : c) used as an "lvalue". */
6014 if (TREE_CODE (arg
) == COND_EXPR
6015 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
6016 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
6018 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
6019 if (TREE_CODE (arg
) == MODIFY_EXPR
6020 || TREE_CODE (arg
) == PREINCREMENT_EXPR
6021 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
6023 tree lvalue
= TREE_OPERAND (arg
, 0);
6024 if (TREE_SIDE_EFFECTS (lvalue
))
6026 lvalue
= stabilize_reference (lvalue
);
6027 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
6028 lvalue
, TREE_OPERAND (arg
, 1));
6030 return unary_complex_lvalue
6031 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
6034 if (code
!= ADDR_EXPR
)
6037 /* Handle (a = b) used as an "lvalue" for `&'. */
6038 if (TREE_CODE (arg
) == MODIFY_EXPR
6039 || TREE_CODE (arg
) == INIT_EXPR
)
6041 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), 0,
6042 tf_warning_or_error
);
6043 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6045 TREE_NO_WARNING (arg
) = 1;
6049 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
6050 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
6051 || TREE_CODE (arg
) == OFFSET_REF
)
6054 /* We permit compiler to make function calls returning
6055 objects of aggregate type look like lvalues. */
6059 if (TREE_CODE (targ
) == SAVE_EXPR
)
6060 targ
= TREE_OPERAND (targ
, 0);
6062 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
6064 if (TREE_CODE (arg
) == SAVE_EXPR
)
6067 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
6068 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
6071 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
6072 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
6073 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
6076 /* Don't let anything else be handled specially. */
6080 /* Mark EXP saying that we need to be able to take the
6081 address of it; it should not be allocated in a register.
6082 Value is true if successful.
6084 C++: we do not allow `current_class_ptr' to be addressable. */
6087 cxx_mark_addressable (tree exp
)
6092 switch (TREE_CODE (x
))
6099 x
= TREE_OPERAND (x
, 0);
6103 if (x
== current_class_ptr
)
6105 error ("cannot take the address of %<this%>, which is an rvalue expression");
6106 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
6112 /* Caller should not be trying to mark initialized
6113 constant fields addressable. */
6114 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
6115 || DECL_IN_AGGR_P (x
) == 0
6117 || DECL_EXTERNAL (x
));
6121 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
6122 && !DECL_ARTIFICIAL (x
))
6124 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
6127 ("address of explicit register variable %qD requested", x
);
6130 else if (extra_warnings
)
6132 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
6134 TREE_ADDRESSABLE (x
) = 1;
6139 TREE_ADDRESSABLE (x
) = 1;
6143 TREE_ADDRESSABLE (x
) = 1;
6147 TREE_ADDRESSABLE (x
) = 1;
6148 cxx_mark_addressable (TREE_OPERAND (x
, 0));
6156 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6159 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
6160 tsubst_flags_t complain
)
6162 tree orig_ifexp
= ifexp
;
6163 tree orig_op1
= op1
;
6164 tree orig_op2
= op2
;
6167 if (processing_template_decl
)
6169 /* The standard says that the expression is type-dependent if
6170 IFEXP is type-dependent, even though the eventual type of the
6171 expression doesn't dependent on IFEXP. */
6172 if (type_dependent_expression_p (ifexp
)
6173 /* As a GNU extension, the middle operand may be omitted. */
6174 || (op1
&& type_dependent_expression_p (op1
))
6175 || type_dependent_expression_p (op2
))
6176 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
6177 ifexp
= build_non_dependent_expr (ifexp
);
6179 op1
= build_non_dependent_expr (op1
);
6180 op2
= build_non_dependent_expr (op2
);
6183 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
6184 if (processing_template_decl
&& expr
!= error_mark_node
6185 && TREE_CODE (expr
) != VEC_COND_EXPR
)
6187 tree min
= build_min_non_dep (COND_EXPR
, expr
,
6188 orig_ifexp
, orig_op1
, orig_op2
);
6189 /* In C++11, remember that the result is an lvalue or xvalue.
6190 In C++98, lvalue_kind can just assume lvalue in a template. */
6191 if (cxx_dialect
>= cxx11
6192 && lvalue_or_rvalue_with_address_p (expr
)
6193 && !lvalue_or_rvalue_with_address_p (min
))
6194 TREE_TYPE (min
) = cp_build_reference_type (TREE_TYPE (min
),
6195 !real_lvalue_p (expr
));
6196 expr
= convert_from_reference (min
);
6201 /* Given a list of expressions, return a compound expression
6202 that performs them all and returns the value of the last of them. */
6205 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
6206 tsubst_flags_t complain
)
6208 tree expr
= TREE_VALUE (list
);
6210 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6211 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
6213 if (complain
& tf_error
)
6214 pedwarn (EXPR_LOC_OR_LOC (expr
, input_location
), 0,
6215 "list-initializer for non-class type must not "
6216 "be parenthesized");
6218 return error_mark_node
;
6221 if (TREE_CHAIN (list
))
6223 if (complain
& tf_error
)
6227 permerror (input_location
, "expression list treated as compound "
6228 "expression in initializer");
6231 permerror (input_location
, "expression list treated as compound "
6232 "expression in mem-initializer");
6235 permerror (input_location
, "expression list treated as compound "
6236 "expression in functional cast");
6242 return error_mark_node
;
6244 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
6245 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
6246 expr
, TREE_VALUE (list
), complain
);
6252 /* Like build_x_compound_expr_from_list, but using a VEC. */
6255 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
6256 tsubst_flags_t complain
)
6258 if (vec_safe_is_empty (vec
))
6260 else if (vec
->length () == 1)
6270 if (complain
& tf_error
)
6271 permerror (input_location
,
6272 "%s expression list treated as compound expression",
6275 return error_mark_node
;
6279 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
6280 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
6287 /* Handle overloading of the ',' operator when needed. */
6290 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
6291 tsubst_flags_t complain
)
6294 tree orig_op1
= op1
;
6295 tree orig_op2
= op2
;
6297 if (processing_template_decl
)
6299 if (type_dependent_expression_p (op1
)
6300 || type_dependent_expression_p (op2
))
6301 return build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
6302 op1
= build_non_dependent_expr (op1
);
6303 op2
= build_non_dependent_expr (op2
);
6306 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
6307 NULL_TREE
, /*overload=*/NULL
, complain
);
6309 result
= cp_build_compound_expr (op1
, op2
, complain
);
6311 if (processing_template_decl
&& result
!= error_mark_node
)
6312 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
6317 /* Like cp_build_compound_expr, but for the c-common bits. */
6320 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
6322 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
6325 /* Build a compound expression. */
6328 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
6330 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
6332 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
6333 return error_mark_node
;
6336 && (TREE_CODE (lhs
) == CILK_SPAWN_STMT
6337 || TREE_CODE (rhs
) == CILK_SPAWN_STMT
))
6339 location_t loc
= (EXPR_HAS_LOCATION (lhs
) ? EXPR_LOCATION (lhs
)
6340 : EXPR_LOCATION (rhs
));
6342 "spawned function call cannot be part of a comma expression");
6343 return error_mark_node
;
6346 if (TREE_CODE (rhs
) == TARGET_EXPR
)
6348 /* If the rhs is a TARGET_EXPR, then build the compound
6349 expression inside the target_expr's initializer. This
6350 helps the compiler to eliminate unnecessary temporaries. */
6351 tree init
= TREE_OPERAND (rhs
, 1);
6353 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
6354 TREE_OPERAND (rhs
, 1) = init
;
6359 if (type_unknown_p (rhs
))
6361 if (complain
& tf_error
)
6362 error ("no context to resolve type of %qE", rhs
);
6363 return error_mark_node
;
6366 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
6369 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6370 casts away constness. CAST gives the type of cast. Returns true
6371 if the cast is ill-formed, false if it is well-formed.
6373 ??? This function warns for casting away any qualifier not just
6374 const. We would like to specify exactly what qualifiers are casted
6379 check_for_casting_away_constness (tree src_type
, tree dest_type
,
6380 enum tree_code cast
, tsubst_flags_t complain
)
6382 /* C-style casts are allowed to cast away constness. With
6383 WARN_CAST_QUAL, we still want to issue a warning. */
6384 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
6387 if (!casts_away_constness (src_type
, dest_type
, complain
))
6393 if (complain
& tf_warning
)
6394 warning (OPT_Wcast_qual
,
6395 "cast from type %qT to type %qT casts away qualifiers",
6396 src_type
, dest_type
);
6399 case STATIC_CAST_EXPR
:
6400 if (complain
& tf_error
)
6401 error ("static_cast from type %qT to type %qT casts away qualifiers",
6402 src_type
, dest_type
);
6405 case REINTERPRET_CAST_EXPR
:
6406 if (complain
& tf_error
)
6407 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6408 src_type
, dest_type
);
6417 Warns if the cast from expression EXPR to type TYPE is useless.
6420 maybe_warn_about_useless_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6422 if (warn_useless_cast
6423 && complain
& tf_warning
)
6425 if ((TREE_CODE (type
) == REFERENCE_TYPE
6426 && (TYPE_REF_IS_RVALUE (type
)
6427 ? xvalue_p (expr
) : real_lvalue_p (expr
))
6428 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
6429 || same_type_p (TREE_TYPE (expr
), type
))
6430 warning (OPT_Wuseless_cast
, "useless cast to type %qT", type
);
6434 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6435 (another pointer-to-member type in the same hierarchy) and return
6436 the converted expression. If ALLOW_INVERSE_P is permitted, a
6437 pointer-to-derived may be converted to pointer-to-base; otherwise,
6438 only the other direction is permitted. If C_CAST_P is true, this
6439 conversion is taking place as part of a C-style cast. */
6442 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
6443 bool c_cast_p
, tsubst_flags_t complain
)
6445 if (TYPE_PTRDATAMEM_P (type
))
6449 if (TREE_CODE (expr
) == PTRMEM_CST
)
6450 expr
= cplus_expand_constant (expr
);
6451 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
6452 TYPE_PTRMEM_CLASS_TYPE (type
),
6454 c_cast_p
, complain
);
6455 if (delta
== error_mark_node
)
6456 return error_mark_node
;
6458 if (!integer_zerop (delta
))
6460 tree cond
, op1
, op2
;
6462 cond
= cp_build_binary_op (input_location
,
6465 build_int_cst (TREE_TYPE (expr
), -1),
6467 op1
= build_nop (ptrdiff_type_node
, expr
);
6468 op2
= cp_build_binary_op (input_location
,
6469 PLUS_EXPR
, op1
, delta
,
6472 expr
= fold_build3_loc (input_location
,
6473 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
6477 return build_nop (type
, expr
);
6480 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
6481 allow_inverse_p
, c_cast_p
, complain
);
6484 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6485 this static_cast is being attempted as one of the possible casts
6486 allowed by a C-style cast. (In that case, accessibility of base
6487 classes is not considered, and it is OK to cast away
6488 constness.) Return the result of the cast. *VALID_P is set to
6489 indicate whether or not the cast was valid. */
6492 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6493 bool *valid_p
, tsubst_flags_t complain
)
6499 /* Assume the cast is valid. */
6502 intype
= unlowered_expr_type (expr
);
6504 /* Save casted types in the function's used types hash table. */
6505 used_types_insert (type
);
6507 /* [expr.static.cast]
6509 An lvalue of type "cv1 B", where B is a class type, can be cast
6510 to type "reference to cv2 D", where D is a class derived (clause
6511 _class.derived_) from B, if a valid standard conversion from
6512 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6513 same cv-qualification as, or greater cv-qualification than, cv1,
6514 and B is not a virtual base class of D. */
6515 /* We check this case before checking the validity of "TYPE t =
6516 EXPR;" below because for this case:
6519 struct D : public B { D(const B&); };
6521 void f() { static_cast<const D&>(b); }
6523 we want to avoid constructing a new D. The standard is not
6524 completely clear about this issue, but our interpretation is
6525 consistent with other compilers. */
6526 if (TREE_CODE (type
) == REFERENCE_TYPE
6527 && CLASS_TYPE_P (TREE_TYPE (type
))
6528 && CLASS_TYPE_P (intype
)
6529 && (TYPE_REF_IS_RVALUE (type
) || real_lvalue_p (expr
))
6530 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
6531 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
6532 build_pointer_type (TYPE_MAIN_VARIANT
6533 (TREE_TYPE (type
))),
6536 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6540 /* There is a standard conversion from "D*" to "B*" even if "B"
6541 is ambiguous or inaccessible. If this is really a
6542 static_cast, then we check both for inaccessibility and
6543 ambiguity. However, if this is a static_cast being performed
6544 because the user wrote a C-style cast, then accessibility is
6546 base
= lookup_base (TREE_TYPE (type
), intype
,
6547 c_cast_p
? ba_unique
: ba_check
,
6549 expr
= build_address (expr
);
6551 if (flag_sanitize
& SANITIZE_VPTR
)
6554 = cp_ubsan_maybe_instrument_downcast (input_location
, type
, expr
);
6559 /* Convert from "B*" to "D*". This function will check that "B"
6560 is not a virtual base of "D". */
6561 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6564 /* Convert the pointer to a reference -- but then remember that
6565 there are no expressions with reference type in C++.
6567 We call rvalue so that there's an actual tree code
6568 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6569 is a variable with the same type, the conversion would get folded
6570 away, leaving just the variable and causing lvalue_kind to give
6571 the wrong answer. */
6572 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
6575 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6576 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6577 if (TREE_CODE (type
) == REFERENCE_TYPE
6578 && TYPE_REF_IS_RVALUE (type
)
6579 && (clk
= real_lvalue_p (expr
))
6580 && reference_related_p (TREE_TYPE (type
), intype
)
6581 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6583 if (clk
== clk_ordinary
)
6585 /* Handle the (non-bit-field) lvalue case here by casting to
6586 lvalue reference and then changing it to an rvalue reference.
6587 Casting an xvalue to rvalue reference will be handled by the
6589 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
6590 result
= (perform_direct_initialization_if_possible
6591 (lref
, expr
, c_cast_p
, complain
));
6592 result
= cp_fold_convert (type
, result
);
6593 /* Make sure we don't fold back down to a named rvalue reference,
6594 because that would be an lvalue. */
6595 if (DECL_P (result
))
6596 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
6597 return convert_from_reference (result
);
6600 /* For a bit-field or packed field, bind to a temporary. */
6601 expr
= rvalue (expr
);
6604 /* Resolve overloaded address here rather than once in
6605 implicit_conversion and again in the inverse code below. */
6606 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
6608 expr
= instantiate_type (type
, expr
, complain
);
6609 intype
= TREE_TYPE (expr
);
6612 /* [expr.static.cast]
6614 Any expression can be explicitly converted to type cv void. */
6615 if (VOID_TYPE_P (type
))
6616 return convert_to_void (expr
, ICV_CAST
, complain
);
6619 An abstract class shall not be used ... as the type of an explicit
6621 if (abstract_virtuals_error_sfinae (ACU_CAST
, type
, complain
))
6622 return error_mark_node
;
6624 /* [expr.static.cast]
6626 An expression e can be explicitly converted to a type T using a
6627 static_cast of the form static_cast<T>(e) if the declaration T
6628 t(e);" is well-formed, for some invented temporary variable
6630 result
= perform_direct_initialization_if_possible (type
, expr
,
6631 c_cast_p
, complain
);
6634 result
= convert_from_reference (result
);
6636 /* [expr.static.cast]
6638 If T is a reference type, the result is an lvalue; otherwise,
6639 the result is an rvalue. */
6640 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6641 result
= rvalue (result
);
6645 /* [expr.static.cast]
6647 The inverse of any standard conversion sequence (clause _conv_),
6648 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
6649 (_conv.array_), function-to-pointer (_conv.func_), and boolean
6650 (_conv.bool_) conversions, can be performed explicitly using
6651 static_cast subject to the restriction that the explicit
6652 conversion does not cast away constness (_expr.const.cast_), and
6653 the following additional rules for specific cases: */
6654 /* For reference, the conversions not excluded are: integral
6655 promotions, floating point promotion, integral conversions,
6656 floating point conversions, floating-integral conversions,
6657 pointer conversions, and pointer to member conversions. */
6660 A value of integral _or enumeration_ type can be explicitly
6661 converted to an enumeration type. */
6662 /* The effect of all that is that any conversion between any two
6663 types which are integral, floating, or enumeration types can be
6665 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6666 || SCALAR_FLOAT_TYPE_P (type
))
6667 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
6668 || SCALAR_FLOAT_TYPE_P (intype
)))
6669 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
6671 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
6672 && CLASS_TYPE_P (TREE_TYPE (type
))
6673 && CLASS_TYPE_P (TREE_TYPE (intype
))
6674 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
6675 (TREE_TYPE (intype
))),
6676 build_pointer_type (TYPE_MAIN_VARIANT
6677 (TREE_TYPE (type
))),
6683 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
6685 return error_mark_node
;
6686 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
6687 c_cast_p
? ba_unique
: ba_check
,
6689 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6692 if (flag_sanitize
& SANITIZE_VPTR
)
6695 = cp_ubsan_maybe_instrument_downcast (input_location
, type
, expr
);
6700 return cp_fold_convert (type
, expr
);
6703 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
6704 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6711 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
6712 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
6714 if (TYPE_PTRDATAMEM_P (type
))
6716 t1
= (build_ptrmem_type
6718 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
6719 t2
= (build_ptrmem_type
6721 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
6728 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
6731 && check_for_casting_away_constness (intype
, type
,
6734 return error_mark_node
;
6735 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
6736 c_cast_p
, complain
);
6740 /* [expr.static.cast]
6742 An rvalue of type "pointer to cv void" can be explicitly
6743 converted to a pointer to object type. A value of type pointer
6744 to object converted to "pointer to cv void" and back to the
6745 original pointer type will have its original value. */
6746 if (TYPE_PTR_P (intype
)
6747 && VOID_TYPE_P (TREE_TYPE (intype
))
6748 && TYPE_PTROB_P (type
))
6751 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
6753 return error_mark_node
;
6754 return build_nop (type
, expr
);
6758 return error_mark_node
;
6761 /* Return an expression representing static_cast<TYPE>(EXPR). */
6764 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6769 if (type
== error_mark_node
|| expr
== error_mark_node
)
6770 return error_mark_node
;
6772 if (processing_template_decl
)
6774 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
6775 /* We don't know if it will or will not have side effects. */
6776 TREE_SIDE_EFFECTS (expr
) = 1;
6777 return convert_from_reference (expr
);
6780 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6781 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6782 if (TREE_CODE (type
) != REFERENCE_TYPE
6783 && TREE_CODE (expr
) == NOP_EXPR
6784 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6785 expr
= TREE_OPERAND (expr
, 0);
6787 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
6791 if (result
!= error_mark_node
)
6792 maybe_warn_about_useless_cast (type
, expr
, complain
);
6796 if (complain
& tf_error
)
6797 error ("invalid static_cast from type %qT to type %qT",
6798 TREE_TYPE (expr
), type
);
6799 return error_mark_node
;
6802 /* EXPR is an expression with member function or pointer-to-member
6803 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6804 not permitted by ISO C++, but we accept it in some modes. If we
6805 are not in one of those modes, issue a diagnostic. Return the
6806 converted expression. */
6809 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
6814 intype
= TREE_TYPE (expr
);
6815 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
6816 || TREE_CODE (intype
) == METHOD_TYPE
);
6818 if (!(complain
& tf_warning_or_error
))
6819 return error_mark_node
;
6821 if (pedantic
|| warn_pmf2ptr
)
6822 pedwarn (input_location
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
6823 "converting from %qT to %qT", intype
, type
);
6825 if (TREE_CODE (intype
) == METHOD_TYPE
)
6826 expr
= build_addr_func (expr
, complain
);
6827 else if (TREE_CODE (expr
) == PTRMEM_CST
)
6828 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
6831 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
6832 decl
= build_address (decl
);
6833 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
6836 if (expr
== error_mark_node
)
6837 return error_mark_node
;
6839 return build_nop (type
, expr
);
6842 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6843 If C_CAST_P is true, this reinterpret cast is being done as part of
6844 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6845 indicate whether or not reinterpret_cast was valid. */
6848 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6849 bool *valid_p
, tsubst_flags_t complain
)
6853 /* Assume the cast is invalid. */
6857 if (type
== error_mark_node
|| error_operand_p (expr
))
6858 return error_mark_node
;
6860 intype
= TREE_TYPE (expr
);
6862 /* Save casted types in the function's used types hash table. */
6863 used_types_insert (type
);
6865 /* [expr.reinterpret.cast]
6866 An lvalue expression of type T1 can be cast to the type
6867 "reference to T2" if an expression of type "pointer to T1" can be
6868 explicitly converted to the type "pointer to T2" using a
6869 reinterpret_cast. */
6870 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6872 if (! real_lvalue_p (expr
))
6874 if (complain
& tf_error
)
6875 error ("invalid cast of an rvalue expression of type "
6878 return error_mark_node
;
6881 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6882 "B" are related class types; the reinterpret_cast does not
6883 adjust the pointer. */
6884 if (TYPE_PTR_P (intype
)
6885 && (complain
& tf_warning
)
6886 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
6887 COMPARE_BASE
| COMPARE_DERIVED
)))
6888 warning (0, "casting %qT to %qT does not dereference pointer",
6891 expr
= cp_build_addr_expr (expr
, complain
);
6893 if (warn_strict_aliasing
> 2)
6894 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
6896 if (expr
!= error_mark_node
)
6897 expr
= build_reinterpret_cast_1
6898 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
6900 if (expr
!= error_mark_node
)
6901 /* cp_build_indirect_ref isn't right for rvalue refs. */
6902 expr
= convert_from_reference (fold_convert (type
, expr
));
6906 /* As a G++ extension, we consider conversions from member
6907 functions, and pointers to member functions to
6908 pointer-to-function and pointer-to-void types. If
6909 -Wno-pmf-conversions has not been specified,
6910 convert_member_func_to_ptr will issue an error message. */
6911 if ((TYPE_PTRMEMFUNC_P (intype
)
6912 || TREE_CODE (intype
) == METHOD_TYPE
)
6913 && TYPE_PTR_P (type
)
6914 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6915 || VOID_TYPE_P (TREE_TYPE (type
))))
6916 return convert_member_func_to_ptr (type
, expr
, complain
);
6918 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6919 array-to-pointer, and function-to-pointer conversions are
6921 expr
= decay_conversion (expr
, complain
);
6923 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6924 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6925 if (TREE_CODE (expr
) == NOP_EXPR
6926 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
6927 expr
= TREE_OPERAND (expr
, 0);
6929 if (error_operand_p (expr
))
6930 return error_mark_node
;
6932 intype
= TREE_TYPE (expr
);
6934 /* [expr.reinterpret.cast]
6935 A pointer can be converted to any integral type large enough to
6936 hold it. ... A value of type std::nullptr_t can be converted to
6937 an integral type; the conversion has the same meaning and
6938 validity as a conversion of (void*)0 to the integral type. */
6939 if (CP_INTEGRAL_TYPE_P (type
)
6940 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
6942 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
6944 if (complain
& tf_error
)
6945 permerror (input_location
, "cast from %qT to %qT loses precision",
6948 return error_mark_node
;
6950 if (NULLPTR_TYPE_P (intype
))
6951 return build_int_cst (type
, 0);
6953 /* [expr.reinterpret.cast]
6954 A value of integral or enumeration type can be explicitly
6955 converted to a pointer. */
6956 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
6959 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6960 || TYPE_PTR_OR_PTRMEM_P (type
))
6961 && same_type_p (type
, intype
))
6963 return rvalue (expr
);
6964 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
6965 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6966 return fold_if_not_in_template (build_nop (type
, expr
));
6967 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
6968 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
6973 && check_for_casting_away_constness (intype
, type
,
6974 REINTERPRET_CAST_EXPR
,
6976 return error_mark_node
;
6977 /* Warn about possible alignment problems. */
6978 if (STRICT_ALIGNMENT
&& warn_cast_align
6979 && (complain
& tf_warning
)
6980 && !VOID_TYPE_P (type
)
6981 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
6982 && COMPLETE_TYPE_P (TREE_TYPE (type
))
6983 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
6984 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
6985 warning (OPT_Wcast_align
, "cast from %qT to %qT "
6986 "increases required alignment of target type", intype
, type
);
6988 /* We need to strip nops here, because the front end likes to
6989 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6991 if (warn_strict_aliasing
<= 2)
6992 strict_aliasing_warning (intype
, type
, sexpr
);
6994 return fold_if_not_in_template (build_nop (type
, expr
));
6996 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
6997 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
6999 if (complain
& tf_warning
)
7000 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
7001 object pointer type or vice versa is conditionally-supported." */
7002 warning (OPT_Wconditionally_supported
,
7003 "casting between pointer-to-function and pointer-to-object "
7004 "is conditionally-supported");
7005 return fold_if_not_in_template (build_nop (type
, expr
));
7007 else if (VECTOR_TYPE_P (type
))
7008 return fold_if_not_in_template (convert_to_vector (type
, expr
));
7009 else if (VECTOR_TYPE_P (intype
)
7010 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7011 return fold_if_not_in_template (convert_to_integer (type
, expr
));
7016 if (complain
& tf_error
)
7017 error ("invalid cast from type %qT to type %qT", intype
, type
);
7018 return error_mark_node
;
7021 return cp_convert (type
, expr
, complain
);
7025 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7029 if (type
== error_mark_node
|| expr
== error_mark_node
)
7030 return error_mark_node
;
7032 if (processing_template_decl
)
7034 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
7036 if (!TREE_SIDE_EFFECTS (t
)
7037 && type_dependent_expression_p (expr
))
7038 /* There might turn out to be side effects inside expr. */
7039 TREE_SIDE_EFFECTS (t
) = 1;
7040 return convert_from_reference (t
);
7043 r
= build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
7044 /*valid_p=*/NULL
, complain
);
7045 if (r
!= error_mark_node
)
7046 maybe_warn_about_useless_cast (type
, expr
, complain
);
7050 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
7051 return an appropriate expression. Otherwise, return
7052 error_mark_node. If the cast is not valid, and COMPLAIN is true,
7053 then a diagnostic will be issued. If VALID_P is non-NULL, we are
7054 performing a C-style cast, its value upon return will indicate
7055 whether or not the conversion succeeded. */
7058 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
7062 tree reference_type
;
7064 /* Callers are responsible for handling error_mark_node as a
7065 destination type. */
7066 gcc_assert (dst_type
!= error_mark_node
);
7067 /* In a template, callers should be building syntactic
7068 representations of casts, not using this machinery. */
7069 gcc_assert (!processing_template_decl
);
7071 /* Assume the conversion is invalid. */
7075 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
7077 if (complain
& tf_error
)
7078 error ("invalid use of const_cast with type %qT, "
7079 "which is not a pointer, "
7080 "reference, nor a pointer-to-data-member type", dst_type
);
7081 return error_mark_node
;
7084 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
7086 if (complain
& tf_error
)
7087 error ("invalid use of const_cast with type %qT, which is a pointer "
7088 "or reference to a function type", dst_type
);
7089 return error_mark_node
;
7092 /* Save casted types in the function's used types hash table. */
7093 used_types_insert (dst_type
);
7095 src_type
= TREE_TYPE (expr
);
7096 /* Expressions do not really have reference types. */
7097 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
7098 src_type
= TREE_TYPE (src_type
);
7100 /* [expr.const.cast]
7102 For two object types T1 and T2, if a pointer to T1 can be explicitly
7103 converted to the type "pointer to T2" using a const_cast, then the
7104 following conversions can also be made:
7106 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7107 type T2 using the cast const_cast<T2&>;
7109 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7110 type T2 using the cast const_cast<T2&&>; and
7112 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7113 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7115 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
7117 reference_type
= dst_type
;
7118 if (!TYPE_REF_IS_RVALUE (dst_type
)
7119 ? real_lvalue_p (expr
)
7120 : (CLASS_TYPE_P (TREE_TYPE (dst_type
))
7122 : lvalue_or_rvalue_with_address_p (expr
)))
7126 if (complain
& tf_error
)
7127 error ("invalid const_cast of an rvalue of type %qT to type %qT",
7128 src_type
, dst_type
);
7129 return error_mark_node
;
7131 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
7132 src_type
= build_pointer_type (src_type
);
7136 reference_type
= NULL_TREE
;
7137 /* If the destination type is not a reference type, the
7138 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7139 conversions are performed. */
7140 src_type
= type_decays_to (src_type
);
7141 if (src_type
== error_mark_node
)
7142 return error_mark_node
;
7145 if (TYPE_PTR_P (src_type
) || TYPE_PTRDATAMEM_P (src_type
))
7147 if (comp_ptr_ttypes_const (dst_type
, src_type
))
7152 /* This cast is actually a C-style cast. Issue a warning if
7153 the user is making a potentially unsafe cast. */
7154 check_for_casting_away_constness (src_type
, dst_type
,
7155 CAST_EXPR
, complain
);
7159 expr
= cp_build_addr_expr (expr
, complain
);
7160 if (expr
== error_mark_node
)
7161 return error_mark_node
;
7162 expr
= build_nop (reference_type
, expr
);
7163 return convert_from_reference (expr
);
7167 expr
= decay_conversion (expr
, complain
);
7168 if (expr
== error_mark_node
)
7169 return error_mark_node
;
7171 /* build_c_cast puts on a NOP_EXPR to make the result not an
7172 lvalue. Strip such NOP_EXPRs if VALUE is being used in
7173 non-lvalue context. */
7174 if (TREE_CODE (expr
) == NOP_EXPR
7175 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7176 expr
= TREE_OPERAND (expr
, 0);
7177 return build_nop (dst_type
, expr
);
7181 && !at_least_as_qualified_p (TREE_TYPE (dst_type
),
7182 TREE_TYPE (src_type
)))
7183 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
7187 if (complain
& tf_error
)
7188 error ("invalid const_cast from type %qT to type %qT",
7189 src_type
, dst_type
);
7190 return error_mark_node
;
7194 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7198 if (type
== error_mark_node
|| error_operand_p (expr
))
7199 return error_mark_node
;
7201 if (processing_template_decl
)
7203 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
7205 if (!TREE_SIDE_EFFECTS (t
)
7206 && type_dependent_expression_p (expr
))
7207 /* There might turn out to be side effects inside expr. */
7208 TREE_SIDE_EFFECTS (t
) = 1;
7209 return convert_from_reference (t
);
7212 r
= build_const_cast_1 (type
, expr
, complain
, /*valid_p=*/NULL
);
7213 if (r
!= error_mark_node
)
7214 maybe_warn_about_useless_cast (type
, expr
, complain
);
7218 /* Like cp_build_c_cast, but for the c-common bits. */
7221 build_c_cast (location_t
/*loc*/, tree type
, tree expr
)
7223 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7226 /* Build an expression representing an explicit C-style cast to type
7227 TYPE of expression EXPR. */
7230 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7236 if (type
== error_mark_node
|| error_operand_p (expr
))
7237 return error_mark_node
;
7239 if (processing_template_decl
)
7241 tree t
= build_min (CAST_EXPR
, type
,
7242 tree_cons (NULL_TREE
, value
, NULL_TREE
));
7243 /* We don't know if it will or will not have side effects. */
7244 TREE_SIDE_EFFECTS (t
) = 1;
7245 return convert_from_reference (t
);
7248 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
7249 'Class') should always be retained, because this information aids
7250 in method lookup. */
7251 if (objc_is_object_ptr (type
)
7252 && objc_is_object_ptr (TREE_TYPE (expr
)))
7253 return build_nop (type
, expr
);
7255 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7256 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7257 if (TREE_CODE (type
) != REFERENCE_TYPE
7258 && TREE_CODE (value
) == NOP_EXPR
7259 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
7260 value
= TREE_OPERAND (value
, 0);
7262 if (TREE_CODE (type
) == ARRAY_TYPE
)
7264 /* Allow casting from T1* to T2[] because Cfront allows it.
7265 NIHCL uses it. It is not valid ISO C++ however. */
7266 if (TYPE_PTR_P (TREE_TYPE (expr
)))
7268 if (complain
& tf_error
)
7269 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
7271 return error_mark_node
;
7272 type
= build_pointer_type (TREE_TYPE (type
));
7276 if (complain
& tf_error
)
7277 error ("ISO C++ forbids casting to an array type %qT", type
);
7278 return error_mark_node
;
7282 if (TREE_CODE (type
) == FUNCTION_TYPE
7283 || TREE_CODE (type
) == METHOD_TYPE
)
7285 if (complain
& tf_error
)
7286 error ("invalid cast to function type %qT", type
);
7287 return error_mark_node
;
7290 if (TYPE_PTR_P (type
)
7291 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
7292 /* Casting to an integer of smaller size is an error detected elsewhere. */
7293 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
7294 /* Don't warn about converting any constant. */
7295 && !TREE_CONSTANT (value
))
7296 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
7297 "cast to pointer from integer of different size");
7299 /* A C-style cast can be a const_cast. */
7300 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
7304 if (result
!= error_mark_node
)
7305 maybe_warn_about_useless_cast (type
, value
, complain
);
7309 /* Or a static cast. */
7310 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
7311 &valid_p
, complain
);
7312 /* Or a reinterpret_cast. */
7314 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
7315 &valid_p
, complain
);
7316 /* The static_cast or reinterpret_cast may be followed by a
7319 /* A valid cast may result in errors if, for example, a
7320 conversion to an ambiguous base class is required. */
7321 && !error_operand_p (result
))
7325 maybe_warn_about_useless_cast (type
, value
, complain
);
7327 /* Non-class rvalues always have cv-unqualified type. */
7328 if (!CLASS_TYPE_P (type
))
7329 type
= TYPE_MAIN_VARIANT (type
);
7330 result_type
= TREE_TYPE (result
);
7331 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
7332 result_type
= TYPE_MAIN_VARIANT (result_type
);
7333 /* If the type of RESULT does not match TYPE, perform a
7334 const_cast to make it match. If the static_cast or
7335 reinterpret_cast succeeded, we will differ by at most
7336 cv-qualification, so the follow-on const_cast is guaranteed
7338 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
7340 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
7341 gcc_assert (valid_p
);
7346 return error_mark_node
;
7349 /* For use from the C common bits. */
7351 build_modify_expr (location_t
/*location*/,
7352 tree lhs
, tree
/*lhs_origtype*/,
7353 enum tree_code modifycode
,
7354 location_t
/*rhs_location*/, tree rhs
,
7355 tree
/*rhs_origtype*/)
7357 return cp_build_modify_expr (lhs
, modifycode
, rhs
, tf_warning_or_error
);
7360 /* Build an assignment expression of lvalue LHS from value RHS.
7361 MODIFYCODE is the code for a binary operator that we use
7362 to combine the old value of LHS with RHS to get the new value.
7363 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
7365 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
7368 cp_build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
,
7369 tsubst_flags_t complain
)
7373 tree lhstype
= TREE_TYPE (lhs
);
7374 tree olhstype
= lhstype
;
7375 bool plain_assign
= (modifycode
== NOP_EXPR
);
7377 /* Avoid duplicate error messages from operands that had errors. */
7378 if (error_operand_p (lhs
) || error_operand_p (rhs
))
7379 return error_mark_node
;
7381 /* Handle control structure constructs used as "lvalues". */
7382 switch (TREE_CODE (lhs
))
7384 /* Handle --foo = 5; as these are valid constructs in C++. */
7385 case PREDECREMENT_EXPR
:
7386 case PREINCREMENT_EXPR
:
7387 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7388 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7389 stabilize_reference (TREE_OPERAND (lhs
, 0)),
7390 TREE_OPERAND (lhs
, 1));
7391 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0),
7392 modifycode
, rhs
, complain
);
7393 if (newrhs
== error_mark_node
)
7394 return error_mark_node
;
7395 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
7397 /* Handle (a, b) used as an "lvalue". */
7399 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
7400 modifycode
, rhs
, complain
);
7401 if (newrhs
== error_mark_node
)
7402 return error_mark_node
;
7403 return build2 (COMPOUND_EXPR
, lhstype
,
7404 TREE_OPERAND (lhs
, 0), newrhs
);
7407 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7408 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7409 stabilize_reference (TREE_OPERAND (lhs
, 0)),
7410 TREE_OPERAND (lhs
, 1));
7411 newrhs
= cp_build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
,
7413 if (newrhs
== error_mark_node
)
7414 return error_mark_node
;
7415 return build2 (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
7419 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7420 when neither operand has side-effects. */
7421 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7422 return error_mark_node
;
7424 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
7425 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
7427 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
7428 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
7430 TREE_OPERAND (lhs
, 0),
7431 TREE_OPERAND (lhs
, 1)),
7432 TREE_OPERAND (lhs
, 0),
7433 TREE_OPERAND (lhs
, 1));
7436 /* Handle (a ? b : c) used as an "lvalue". */
7439 /* Produce (a ? (b = rhs) : (c = rhs))
7440 except that the RHS goes through a save-expr
7441 so the code to compute it is only emitted once. */
7443 tree preeval
= NULL_TREE
;
7445 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
7447 if (complain
& tf_error
)
7448 error ("void value not ignored as it ought to be");
7449 return error_mark_node
;
7452 rhs
= stabilize_expr (rhs
, &preeval
);
7454 /* Check this here to avoid odd errors when trying to convert
7455 a throw to the type of the COND_EXPR. */
7456 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7457 return error_mark_node
;
7459 cond
= build_conditional_expr
7460 (input_location
, TREE_OPERAND (lhs
, 0),
7461 cp_build_modify_expr (TREE_OPERAND (lhs
, 1),
7462 modifycode
, rhs
, complain
),
7463 cp_build_modify_expr (TREE_OPERAND (lhs
, 2),
7464 modifycode
, rhs
, complain
),
7467 if (cond
== error_mark_node
)
7469 /* Make sure the code to compute the rhs comes out
7470 before the split. */
7472 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
7480 if (modifycode
== INIT_EXPR
)
7482 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
7483 /* Do the default thing. */;
7484 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
7486 /* Compound literal. */
7487 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
7488 /* Call convert to generate an error; see PR 11063. */
7489 rhs
= convert (lhstype
, rhs
);
7490 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
7491 TREE_SIDE_EFFECTS (result
) = 1;
7494 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
7495 /* Do the default thing. */;
7498 vec
<tree
, va_gc
> *rhs_vec
= make_tree_vector_single (rhs
);
7499 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
7500 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
7502 release_tree_vector (rhs_vec
);
7503 if (result
== NULL_TREE
)
7504 return error_mark_node
;
7510 lhs
= require_complete_type_sfinae (lhs
, complain
);
7511 if (lhs
== error_mark_node
)
7512 return error_mark_node
;
7514 if (modifycode
== NOP_EXPR
)
7516 if (c_dialect_objc ())
7518 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
7523 /* `operator=' is not an inheritable operator. */
7524 if (! MAYBE_CLASS_TYPE_P (lhstype
))
7525 /* Do the default thing. */;
7528 result
= build_new_op (input_location
, MODIFY_EXPR
,
7529 LOOKUP_NORMAL
, lhs
, rhs
,
7530 make_node (NOP_EXPR
), /*overload=*/NULL
,
7532 if (result
== NULL_TREE
)
7533 return error_mark_node
;
7540 tree init
= NULL_TREE
;
7542 /* A binary op has been requested. Combine the old LHS
7543 value with the RHS producing the value we should actually
7544 store into the LHS. */
7545 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
7546 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
7547 || MAYBE_CLASS_TYPE_P (lhstype
)));
7549 /* Preevaluate the RHS to make sure its evaluation is complete
7550 before the lvalue-to-rvalue conversion of the LHS:
7552 [expr.ass] With respect to an indeterminately-sequenced
7553 function call, the operation of a compound assignment is a
7554 single evaluation. [ Note: Therefore, a function call shall
7555 not intervene between the lvalue-to-rvalue conversion and the
7556 side effect associated with any single compound assignment
7557 operator. -- end note ] */
7558 lhs
= stabilize_reference (lhs
);
7560 rhs
= stabilize_expr (rhs
, &init
);
7561 newrhs
= cp_build_binary_op (input_location
,
7562 modifycode
, lhs
, rhs
,
7564 if (newrhs
== error_mark_node
)
7566 if (complain
& tf_error
)
7567 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
7568 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
7569 return error_mark_node
;
7573 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
7575 /* Now it looks like a plain assignment. */
7576 modifycode
= NOP_EXPR
;
7577 if (c_dialect_objc ())
7579 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
7584 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
7585 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
7588 /* The left-hand side must be an lvalue. */
7589 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7590 return error_mark_node
;
7592 /* Warn about modifying something that is `const'. Don't warn if
7593 this is initialization. */
7594 if (modifycode
!= INIT_EXPR
7595 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
7596 /* Functions are not modifiable, even though they are
7598 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
7599 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
7600 /* If it's an aggregate and any field is const, then it is
7601 effectively const. */
7602 || (CLASS_TYPE_P (lhstype
)
7603 && C_TYPE_FIELDS_READONLY (lhstype
))))
7605 if (complain
& tf_error
)
7606 cxx_readonly_error (lhs
, lv_assign
);
7608 return error_mark_node
;
7611 /* If storing into a structure or union member, it may have been given a
7612 lowered bitfield type. We need to convert to the declared type first,
7613 so retrieve it now. */
7615 olhstype
= unlowered_expr_type (lhs
);
7617 /* Convert new value to destination type. */
7619 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
7623 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
7625 if (modifycode
!= INIT_EXPR
)
7627 if (complain
& tf_error
)
7628 error ("assigning to an array from an initializer list");
7629 return error_mark_node
;
7631 if (check_array_initializer (lhs
, lhstype
, newrhs
))
7632 return error_mark_node
;
7633 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7634 if (newrhs
== error_mark_node
)
7635 return error_mark_node
;
7638 /* C++11 8.5/17: "If the destination type is an array of characters,
7639 an array of char16_t, an array of char32_t, or an array of wchar_t,
7640 and the initializer is a string literal...". */
7641 else if (TREE_CODE (newrhs
) == STRING_CST
7642 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
7643 && modifycode
== INIT_EXPR
)
7645 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7646 if (newrhs
== error_mark_node
)
7647 return error_mark_node
;
7650 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
7651 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
7653 if (complain
& tf_error
)
7654 error ("incompatible types in assignment of %qT to %qT",
7655 TREE_TYPE (rhs
), lhstype
);
7656 return error_mark_node
;
7659 /* Allow array assignment in compiler-generated code. */
7660 else if (!current_function_decl
7661 || !DECL_DEFAULTED_FN (current_function_decl
))
7663 /* This routine is used for both initialization and assignment.
7664 Make sure the diagnostic message differentiates the context. */
7665 if (complain
& tf_error
)
7667 if (modifycode
== INIT_EXPR
)
7668 error ("array used as initializer");
7670 error ("invalid array assignment");
7672 return error_mark_node
;
7675 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
7676 ? 1 + (modifycode
!= INIT_EXPR
): 0;
7677 return build_vec_init (lhs
, NULL_TREE
, newrhs
,
7678 /*explicit_value_init_p=*/false,
7679 from_array
, complain
);
7682 if (modifycode
== INIT_EXPR
)
7683 /* Calls with INIT_EXPR are all direct-initialization, so don't set
7684 LOOKUP_ONLYCONVERTING. */
7685 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
7686 ICR_INIT
, NULL_TREE
, 0,
7689 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
7690 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
7692 if (!same_type_p (lhstype
, olhstype
))
7693 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
7695 if (modifycode
!= INIT_EXPR
)
7697 if (TREE_CODE (newrhs
) == CALL_EXPR
7698 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
7699 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
7701 /* Can't initialize directly from a TARGET_EXPR, since that would
7702 cause the lhs to be constructed twice, and possibly result in
7703 accidental self-initialization. So we force the TARGET_EXPR to be
7704 expanded without a target. */
7705 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
7706 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
7707 TREE_OPERAND (newrhs
, 0));
7710 if (newrhs
== error_mark_node
)
7711 return error_mark_node
;
7713 if (c_dialect_objc () && flag_objc_gc
)
7715 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
7721 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
7722 lhstype
, lhs
, newrhs
);
7724 TREE_SIDE_EFFECTS (result
) = 1;
7726 TREE_NO_WARNING (result
) = 1;
7732 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7733 tree rhs
, tsubst_flags_t complain
)
7735 if (processing_template_decl
)
7736 return build_min_nt_loc (loc
, MODOP_EXPR
, lhs
,
7737 build_min_nt_loc (loc
, modifycode
, NULL_TREE
,
7740 if (modifycode
!= NOP_EXPR
)
7742 tree rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
7743 make_node (modifycode
), /*overload=*/NULL
,
7747 TREE_NO_WARNING (rval
) = 1;
7751 return cp_build_modify_expr (lhs
, modifycode
, rhs
, complain
);
7754 /* Helper function for get_delta_difference which assumes FROM is a base
7755 class of TO. Returns a delta for the conversion of pointer-to-member
7756 of FROM to pointer-to-member of TO. If the conversion is invalid and
7757 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
7758 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
7759 If C_CAST_P is true, this conversion is taking place as part of a
7763 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
7764 tsubst_flags_t complain
)
7769 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
7772 if (binfo
== error_mark_node
)
7774 if (!(complain
& tf_error
))
7775 return error_mark_node
;
7777 error (" in pointer to member function conversion");
7778 return size_zero_node
;
7782 if (kind
!= bk_via_virtual
)
7783 return BINFO_OFFSET (binfo
);
7785 /* FROM is a virtual base class of TO. Issue an error or warning
7786 depending on whether or not this is a reinterpret cast. */
7788 if (!(complain
& tf_error
))
7789 return error_mark_node
;
7791 error ("pointer to member conversion via virtual base %qT",
7792 BINFO_TYPE (binfo_from_vbase (binfo
)));
7794 return size_zero_node
;
7801 /* Get difference in deltas for different pointer to member function
7802 types. If the conversion is invalid and tf_error is not set in
7803 COMPLAIN, returns error_mark_node, otherwise returns an integer
7804 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7805 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7806 conversions as well. If C_CAST_P is true this conversion is taking
7807 place as part of a C-style cast.
7809 Note that the naming of FROM and TO is kind of backwards; the return
7810 value is what we add to a TO in order to get a FROM. They are named
7811 this way because we call this function to find out how to convert from
7812 a pointer to member of FROM to a pointer to member of TO. */
7815 get_delta_difference (tree from
, tree to
,
7816 bool allow_inverse_p
,
7817 bool c_cast_p
, tsubst_flags_t complain
)
7821 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
7822 /* Pointer to member of incomplete class is permitted*/
7823 result
= size_zero_node
;
7825 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
7827 if (result
== error_mark_node
)
7828 return error_mark_node
;
7832 if (!allow_inverse_p
)
7834 if (!(complain
& tf_error
))
7835 return error_mark_node
;
7837 error_not_base_type (from
, to
);
7838 error (" in pointer to member conversion");
7839 result
= size_zero_node
;
7843 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
7845 if (result
== error_mark_node
)
7846 return error_mark_node
;
7849 result
= size_diffop_loc (input_location
,
7850 size_zero_node
, result
);
7853 if (!(complain
& tf_error
))
7854 return error_mark_node
;
7856 error_not_base_type (from
, to
);
7857 error (" in pointer to member conversion");
7858 result
= size_zero_node
;
7863 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node
,
7867 /* Return a constructor for the pointer-to-member-function TYPE using
7868 the other components as specified. */
7871 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
7876 vec
<constructor_elt
, va_gc
> *v
;
7878 /* Pull the FIELD_DECLs out of the type. */
7879 pfn_field
= TYPE_FIELDS (type
);
7880 delta_field
= DECL_CHAIN (pfn_field
);
7882 /* Make sure DELTA has the type we want. */
7883 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
7885 /* Convert to the correct target type if necessary. */
7886 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
7888 /* Finish creating the initializer. */
7890 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
7891 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
7892 u
= build_constructor (type
, v
);
7893 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
7894 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
7895 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
7897 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
7902 /* Build a constructor for a pointer to member function. It can be
7903 used to initialize global variables, local variable, or used
7904 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7907 If FORCE is nonzero, then force this conversion, even if
7908 we would rather not do it. Usually set when using an explicit
7909 cast. A C-style cast is being processed iff C_CAST_P is true.
7911 Return error_mark_node, if something goes wrong. */
7914 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
7915 tsubst_flags_t complain
)
7921 if (error_operand_p (pfn
))
7922 return error_mark_node
;
7924 pfn_type
= TREE_TYPE (pfn
);
7925 to_type
= build_ptrmemfunc_type (type
);
7927 /* Handle multiple conversions of pointer to member functions. */
7928 if (TYPE_PTRMEMFUNC_P (pfn_type
))
7930 tree delta
= NULL_TREE
;
7931 tree npfn
= NULL_TREE
;
7935 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
7936 LOOKUP_NORMAL
, complain
))
7938 if (complain
& tf_error
)
7939 error ("invalid conversion to type %qT from type %qT",
7942 return error_mark_node
;
7945 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
7946 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
7948 c_cast_p
, complain
);
7949 if (n
== error_mark_node
)
7950 return error_mark_node
;
7952 /* We don't have to do any conversion to convert a
7953 pointer-to-member to its own type. But, we don't want to
7954 just return a PTRMEM_CST if there's an explicit cast; that
7955 cast should make the expression an invalid template argument. */
7956 if (TREE_CODE (pfn
) != PTRMEM_CST
)
7958 if (same_type_p (to_type
, pfn_type
))
7960 else if (integer_zerop (n
))
7961 return build_reinterpret_cast (to_type
, pfn
,
7965 if (TREE_SIDE_EFFECTS (pfn
))
7966 pfn
= save_expr (pfn
);
7968 /* Obtain the function pointer and the current DELTA. */
7969 if (TREE_CODE (pfn
) == PTRMEM_CST
)
7970 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
7973 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
7974 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
7977 /* Just adjust the DELTA field. */
7978 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7979 (TREE_TYPE (delta
), ptrdiff_type_node
));
7980 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
7981 n
= cp_build_binary_op (input_location
,
7982 LSHIFT_EXPR
, n
, integer_one_node
,
7984 delta
= cp_build_binary_op (input_location
,
7985 PLUS_EXPR
, delta
, n
, complain
);
7986 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
7989 /* Handle null pointer to member function conversions. */
7990 if (null_ptr_cst_p (pfn
))
7992 pfn
= cp_build_c_cast (type
, pfn
, complain
);
7993 return build_ptrmemfunc1 (to_type
,
7998 if (type_unknown_p (pfn
))
7999 return instantiate_type (type
, pfn
, complain
);
8001 fn
= TREE_OPERAND (pfn
, 0);
8002 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8003 /* In a template, we will have preserved the
8005 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
8006 return make_ptrmem_cst (to_type
, fn
);
8009 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
8012 ??? There is no consistency as to the types returned for the above
8013 values. Some code acts as if it were a sizetype and some as if it were
8014 integer_type_node. */
8017 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
8019 tree type
= TREE_TYPE (cst
);
8020 tree fn
= PTRMEM_CST_MEMBER (cst
);
8021 tree ptr_class
, fn_class
;
8023 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8025 /* The class that the function belongs to. */
8026 fn_class
= DECL_CONTEXT (fn
);
8028 /* The class that we're creating a pointer to member of. */
8029 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
8031 /* First, calculate the adjustment to the function's class. */
8032 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
8033 /*c_cast_p=*/0, tf_warning_or_error
);
8035 if (!DECL_VIRTUAL_P (fn
))
8036 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
),
8037 build_addr_func (fn
, tf_warning_or_error
));
8040 /* If we're dealing with a virtual function, we have to adjust 'this'
8041 again, to point to the base which provides the vtable entry for
8042 fn; the call will do the opposite adjustment. */
8043 tree orig_class
= DECL_CONTEXT (fn
);
8044 tree binfo
= binfo_or_else (orig_class
, fn_class
);
8045 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8046 *delta
, BINFO_OFFSET (binfo
));
8047 *delta
= fold_if_not_in_template (*delta
);
8049 /* We set PFN to the vtable offset at which the function can be
8050 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
8051 case delta is shifted left, and then incremented). */
8052 *pfn
= DECL_VINDEX (fn
);
8053 *pfn
= build2 (MULT_EXPR
, integer_type_node
, *pfn
,
8054 TYPE_SIZE_UNIT (vtable_entry_type
));
8055 *pfn
= fold_if_not_in_template (*pfn
);
8057 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
8059 case ptrmemfunc_vbit_in_pfn
:
8060 *pfn
= build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
8062 *pfn
= fold_if_not_in_template (*pfn
);
8065 case ptrmemfunc_vbit_in_delta
:
8066 *delta
= build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
8067 *delta
, integer_one_node
);
8068 *delta
= fold_if_not_in_template (*delta
);
8069 *delta
= build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8070 *delta
, integer_one_node
);
8071 *delta
= fold_if_not_in_template (*delta
);
8078 *pfn
= build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
8079 *pfn
= fold_if_not_in_template (*pfn
);
8083 /* Return an expression for PFN from the pointer-to-member function
8087 pfn_from_ptrmemfunc (tree t
)
8089 if (TREE_CODE (t
) == PTRMEM_CST
)
8094 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8099 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
8102 /* Return an expression for DELTA from the pointer-to-member function
8106 delta_from_ptrmemfunc (tree t
)
8108 if (TREE_CODE (t
) == PTRMEM_CST
)
8113 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8118 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
8121 /* Convert value RHS to type TYPE as preparation for an assignment to
8122 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8123 implicit conversion is. If FNDECL is non-NULL, we are doing the
8124 conversion in order to pass the PARMNUMth argument of FNDECL.
8125 If FNDECL is NULL, we are doing the conversion in function pointer
8126 argument passing, conversion in initialization, etc. */
8129 convert_for_assignment (tree type
, tree rhs
,
8130 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8131 tsubst_flags_t complain
, int flags
)
8134 enum tree_code coder
;
8136 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8137 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
8138 rhs
= TREE_OPERAND (rhs
, 0);
8140 rhstype
= TREE_TYPE (rhs
);
8141 coder
= TREE_CODE (rhstype
);
8143 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
8144 && vector_types_convertible_p (type
, rhstype
, true))
8146 rhs
= mark_rvalue_use (rhs
);
8147 return convert (type
, rhs
);
8150 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
8151 return error_mark_node
;
8152 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
8153 return error_mark_node
;
8155 /* The RHS of an assignment cannot have void type. */
8156 if (coder
== VOID_TYPE
)
8158 if (complain
& tf_error
)
8159 error ("void value not ignored as it ought to be");
8160 return error_mark_node
;
8163 if (c_dialect_objc ())
8167 tree rname
= fndecl
;
8178 selector
= objc_message_selector ();
8180 if (selector
&& parmno
> 1)
8187 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
8189 rhs
= mark_rvalue_use (rhs
);
8190 return convert (type
, rhs
);
8196 The expression is implicitly converted (clause _conv_) to the
8197 cv-unqualified type of the left operand.
8199 We allow bad conversions here because by the time we get to this point
8200 we are committed to doing the conversion. If we end up doing a bad
8201 conversion, convert_like will complain. */
8202 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
8204 /* When -Wno-pmf-conversions is use, we just silently allow
8205 conversions from pointers-to-members to plain pointers. If
8206 the conversion doesn't work, cp_convert will complain. */
8208 && TYPE_PTR_P (type
)
8209 && TYPE_PTRMEMFUNC_P (rhstype
))
8210 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
8213 if (complain
& tf_error
)
8215 /* If the right-hand side has unknown type, then it is an
8216 overloaded function. Call instantiate_type to get error
8218 if (rhstype
== unknown_type_node
)
8219 instantiate_type (type
, rhs
, tf_warning_or_error
);
8221 error ("cannot convert %qT to %qT for argument %qP to %qD",
8222 rhstype
, type
, parmnum
, fndecl
);
8226 case ICR_DEFAULT_ARGUMENT
:
8227 error ("cannot convert %qT to %qT in default argument",
8231 error ("cannot convert %qT to %qT in argument passing",
8234 case ICR_CONVERTING
:
8235 error ("cannot convert %qT to %qT",
8239 error ("cannot convert %qT to %qT in initialization",
8243 error ("cannot convert %qT to %qT in return",
8247 error ("cannot convert %qT to %qT in assignment",
8253 if (TYPE_PTR_P (rhstype
)
8254 && TYPE_PTR_P (type
)
8255 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
8256 && CLASS_TYPE_P (TREE_TYPE (type
))
8257 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
8258 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8259 (TREE_TYPE (rhstype
))),
8260 "class type %qT is incomplete", TREE_TYPE (rhstype
));
8262 return error_mark_node
;
8265 if (warn_suggest_attribute_format
)
8267 const enum tree_code codel
= TREE_CODE (type
);
8268 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8270 && check_missing_format_attribute (type
, rhstype
)
8271 && (complain
& tf_warning
))
8275 case ICR_DEFAULT_ARGUMENT
:
8277 warning (OPT_Wsuggest_attribute_format
,
8278 "parameter %qP of %qD might be a candidate "
8279 "for a format attribute", parmnum
, fndecl
);
8281 warning (OPT_Wsuggest_attribute_format
,
8282 "parameter might be a candidate "
8283 "for a format attribute");
8285 case ICR_CONVERTING
:
8286 warning (OPT_Wsuggest_attribute_format
,
8287 "target of conversion might be a candidate "
8288 "for a format attribute");
8291 warning (OPT_Wsuggest_attribute_format
,
8292 "target of initialization might be a candidate "
8293 "for a format attribute");
8296 warning (OPT_Wsuggest_attribute_format
,
8297 "return type might be a candidate "
8298 "for a format attribute");
8301 warning (OPT_Wsuggest_attribute_format
,
8302 "left-hand side of assignment might be a candidate "
8303 "for a format attribute");
8310 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8312 if (warn_parentheses
8313 && TREE_CODE (type
) == BOOLEAN_TYPE
8314 && TREE_CODE (rhs
) == MODIFY_EXPR
8315 && !TREE_NO_WARNING (rhs
)
8316 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
8317 && (complain
& tf_warning
))
8319 location_t loc
= EXPR_LOC_OR_LOC (rhs
, input_location
);
8321 warning_at (loc
, OPT_Wparentheses
,
8322 "suggest parentheses around assignment used as truth value");
8323 TREE_NO_WARNING (rhs
) = 1;
8326 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
8330 /* Convert RHS to be of type TYPE.
8331 If EXP is nonzero, it is the target of the initialization.
8332 ERRTYPE indicates what kind of error the implicit conversion is.
8334 Two major differences between the behavior of
8335 `convert_for_assignment' and `convert_for_initialization'
8336 are that references are bashed in the former, while
8337 copied in the latter, and aggregates are assigned in
8338 the former (operator=) while initialized in the
8341 If using constructor make sure no conversion operator exists, if one does
8342 exist, an ambiguity exists. */
8345 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
8346 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8347 tsubst_flags_t complain
)
8349 enum tree_code codel
= TREE_CODE (type
);
8351 enum tree_code coder
;
8353 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8354 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8355 if (TREE_CODE (rhs
) == NOP_EXPR
8356 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
8357 && codel
!= REFERENCE_TYPE
)
8358 rhs
= TREE_OPERAND (rhs
, 0);
8360 if (type
== error_mark_node
8361 || rhs
== error_mark_node
8362 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
8363 return error_mark_node
;
8365 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
8366 && TREE_CODE (type
) != ARRAY_TYPE
8367 && (TREE_CODE (type
) != REFERENCE_TYPE
8368 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
8369 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
8370 && !TYPE_REFFN_P (type
))
8371 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
8372 rhs
= decay_conversion (rhs
, complain
);
8374 rhstype
= TREE_TYPE (rhs
);
8375 coder
= TREE_CODE (rhstype
);
8377 if (coder
== ERROR_MARK
)
8378 return error_mark_node
;
8380 /* We accept references to incomplete types, so we can
8381 return here before checking if RHS is of complete type. */
8383 if (codel
== REFERENCE_TYPE
)
8385 /* This should eventually happen in convert_arguments. */
8386 int savew
= 0, savee
= 0;
8389 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
8390 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
8393 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
8394 inform (DECL_SOURCE_LOCATION (fndecl
),
8395 "in passing argument %P of %qD", parmnum
, fndecl
);
8401 exp
= require_complete_type_sfinae (exp
, complain
);
8402 if (exp
== error_mark_node
)
8403 return error_mark_node
;
8405 rhstype
= non_reference (rhstype
);
8407 type
= complete_type (type
);
8409 if (DIRECT_INIT_EXPR_P (type
, rhs
))
8410 /* Don't try to do copy-initialization if we already have
8411 direct-initialization. */
8414 if (MAYBE_CLASS_TYPE_P (type
))
8415 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
8417 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
8421 /* If RETVAL is the address of, or a reference to, a local variable or
8422 temporary give an appropriate warning and return true. */
8425 maybe_warn_about_returning_address_of_local (tree retval
)
8427 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
8428 tree whats_returned
= retval
;
8432 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
8433 whats_returned
= TREE_OPERAND (whats_returned
, 1);
8434 else if (CONVERT_EXPR_P (whats_returned
)
8435 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
8436 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8441 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
8443 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8445 while (TREE_CODE (whats_returned
) == COMPONENT_REF
8446 || TREE_CODE (whats_returned
) == ARRAY_REF
)
8447 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8449 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8451 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
8452 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
8454 warning (OPT_Wreturn_local_addr
, "returning reference to temporary");
8457 if (VAR_P (whats_returned
)
8458 && DECL_NAME (whats_returned
)
8459 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
8461 warning (OPT_Wreturn_local_addr
, "reference to non-lvalue returned");
8466 if (DECL_P (whats_returned
)
8467 && DECL_NAME (whats_returned
)
8468 && DECL_FUNCTION_SCOPE_P (whats_returned
)
8469 && !is_capture_proxy (whats_returned
)
8470 && !(TREE_STATIC (whats_returned
)
8471 || TREE_PUBLIC (whats_returned
)))
8473 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8474 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8475 OPT_Wreturn_local_addr
,
8476 "reference to local variable %qD returned",
8478 else if (TREE_CODE (whats_returned
) == LABEL_DECL
)
8479 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8480 OPT_Wreturn_local_addr
, "address of label %qD returned",
8483 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8484 OPT_Wreturn_local_addr
, "address of local variable %qD "
8485 "returned", whats_returned
);
8492 /* Check that returning RETVAL from the current function is valid.
8493 Return an expression explicitly showing all conversions required to
8494 change RETVAL into the function return type, and to assign it to
8495 the DECL_RESULT for the function. Set *NO_WARNING to true if
8496 code reaches end of non-void function warning shouldn't be issued
8497 on this RETURN_EXPR. */
8500 check_return_expr (tree retval
, bool *no_warning
)
8503 /* The type actually returned by the function. */
8505 /* The type the function is declared to return, or void if
8506 the declared type is incomplete. */
8508 int fn_returns_value_p
;
8509 bool named_return_value_okay_p
;
8511 *no_warning
= false;
8513 if (flag_cilkplus
&& retval
&& contains_cilk_spawn_stmt (retval
))
8515 error_at (EXPR_LOCATION (retval
), "use of %<_Cilk_spawn%> in a return "
8516 "statement is not allowed");
8520 /* A `volatile' function is one that isn't supposed to return, ever.
8521 (This is a G++ extension, used to get better code for functions
8522 that call the `volatile' function.) */
8523 if (TREE_THIS_VOLATILE (current_function_decl
))
8524 warning (0, "function declared %<noreturn%> has a %<return%> statement");
8526 /* Check for various simple errors. */
8527 if (DECL_DESTRUCTOR_P (current_function_decl
))
8530 error ("returning a value from a destructor");
8533 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
8535 if (in_function_try_handler
)
8536 /* If a return statement appears in a handler of the
8537 function-try-block of a constructor, the program is ill-formed. */
8538 error ("cannot return from a handler of a function-try-block of a constructor");
8540 /* You can't return a value from a constructor. */
8541 error ("returning a value from a constructor");
8545 const tree saved_retval
= retval
;
8547 if (processing_template_decl
)
8549 current_function_returns_value
= 1;
8551 if (check_for_bare_parameter_packs (retval
))
8552 return error_mark_node
;
8554 if (WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
8555 || (retval
!= NULL_TREE
8556 && type_dependent_expression_p (retval
)))
8560 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
8562 /* Deduce auto return type from a return statement. */
8563 if (current_function_auto_return_pattern
)
8568 if (!retval
&& !is_auto (current_function_auto_return_pattern
))
8570 /* Give a helpful error message. */
8571 error ("return-statement with no value, in function returning %qT",
8572 current_function_auto_return_pattern
);
8573 inform (input_location
, "only plain %<auto%> return type can be "
8574 "deduced to %<void%>");
8575 type
= error_mark_node
;
8577 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
8579 error ("returning initializer list");
8580 type
= error_mark_node
;
8586 auto_node
= type_uses_auto (current_function_auto_return_pattern
);
8587 type
= do_auto_deduction (current_function_auto_return_pattern
,
8591 if (type
== error_mark_node
)
8593 else if (functype
== current_function_auto_return_pattern
)
8594 apply_deduced_return_type (current_function_decl
, type
);
8596 /* A mismatch should have been diagnosed in do_auto_deduction. */
8597 gcc_assert (same_type_p (type
, functype
));
8601 result
= DECL_RESULT (current_function_decl
);
8602 valtype
= TREE_TYPE (result
);
8603 gcc_assert (valtype
!= NULL_TREE
);
8604 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
8606 /* Check for a return statement with no return value in a function
8607 that's supposed to return a value. */
8608 if (!retval
&& fn_returns_value_p
)
8610 if (functype
!= error_mark_node
)
8611 permerror (input_location
, "return-statement with no value, in "
8612 "function returning %qT", valtype
);
8613 /* Remember that this function did return. */
8614 current_function_returns_value
= 1;
8615 /* And signal caller that TREE_NO_WARNING should be set on the
8616 RETURN_EXPR to avoid control reaches end of non-void function
8617 warnings in tree-cfg.c. */
8620 /* Check for a return statement with a value in a function that
8621 isn't supposed to return a value. */
8622 else if (retval
&& !fn_returns_value_p
)
8624 if (VOID_TYPE_P (TREE_TYPE (retval
)))
8625 /* You can return a `void' value from a function of `void'
8626 type. In that case, we have to evaluate the expression for
8627 its side-effects. */
8628 finish_expr_stmt (retval
);
8630 permerror (input_location
, "return-statement with a value, in function "
8631 "returning 'void'");
8632 current_function_returns_null
= 1;
8634 /* There's really no value to return, after all. */
8638 /* Remember that this function can sometimes return without a
8640 current_function_returns_null
= 1;
8642 /* Remember that this function did return a value. */
8643 current_function_returns_value
= 1;
8645 /* Check for erroneous operands -- but after giving ourselves a
8646 chance to provide an error about returning a value from a void
8648 if (error_operand_p (retval
))
8650 current_function_return_value
= error_mark_node
;
8651 return error_mark_node
;
8654 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
8655 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
8656 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
8657 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
8659 && retval
&& null_ptr_cst_p (retval
))
8660 warning (0, "%<operator new%> must not return NULL unless it is "
8661 "declared %<throw()%> (or -fcheck-new is in effect)");
8663 /* Effective C++ rule 15. See also start_function. */
8665 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
))
8669 /* The function return type must be a reference to the current
8671 if (TREE_CODE (valtype
) == REFERENCE_TYPE
8672 && same_type_ignoring_top_level_qualifiers_p
8673 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
8675 /* Returning '*this' is obviously OK. */
8676 if (retval
== current_class_ref
)
8678 /* If we are calling a function whose return type is the same of
8679 the current class reference, it is ok. */
8680 else if (INDIRECT_REF_P (retval
)
8681 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
8686 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
8689 if (processing_template_decl
)
8691 /* We should not have changed the return value. */
8692 gcc_assert (retval
== saved_retval
);
8696 /* The fabled Named Return Value optimization, as per [class.copy]/15:
8698 [...] For a function with a class return type, if the expression
8699 in the return statement is the name of a local object, and the cv-
8700 unqualified type of the local object is the same as the function
8701 return type, an implementation is permitted to omit creating the tem-
8702 porary object to hold the function return value [...]
8704 So, if this is a value-returning function that always returns the same
8705 local variable, remember it.
8707 It might be nice to be more flexible, and choose the first suitable
8708 variable even if the function sometimes returns something else, but
8709 then we run the risk of clobbering the variable we chose if the other
8710 returned expression uses the chosen variable somehow. And people expect
8711 this restriction, anyway. (jason 2000-11-19)
8713 See finish_function and finalize_nrv for the rest of this optimization. */
8715 named_return_value_okay_p
=
8716 (retval
!= NULL_TREE
8717 /* Must be a local, automatic variable. */
8719 && DECL_CONTEXT (retval
) == current_function_decl
8720 && ! TREE_STATIC (retval
)
8721 /* And not a lambda or anonymous union proxy. */
8722 && !DECL_HAS_VALUE_EXPR_P (retval
)
8723 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
8724 /* The cv-unqualified type of the returned value must be the
8725 same as the cv-unqualified return type of the
8727 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
8728 (TYPE_MAIN_VARIANT (functype
)))
8729 /* And the returned value must be non-volatile. */
8730 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
8732 if (fn_returns_value_p
&& flag_elide_constructors
)
8734 if (named_return_value_okay_p
8735 && (current_function_return_value
== NULL_TREE
8736 || current_function_return_value
== retval
))
8737 current_function_return_value
= retval
;
8739 current_function_return_value
= error_mark_node
;
8742 /* We don't need to do any conversions when there's nothing being
8747 /* Do any required conversions. */
8748 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
8749 /* No conversions are required. */
8753 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
8755 /* The functype's return type will have been set to void, if it
8756 was an incomplete type. Just treat this as 'return;' */
8757 if (VOID_TYPE_P (functype
))
8758 return error_mark_node
;
8760 /* If we had an id-expression obfuscated by force_paren_expr, we need
8761 to undo it so we can try to treat it as an rvalue below. */
8762 if (cxx_dialect
>= cxx14
8763 && INDIRECT_REF_P (retval
)
8764 && REF_PARENTHESIZED_P (retval
))
8766 retval
= TREE_OPERAND (retval
, 0);
8767 while (TREE_CODE (retval
) == NON_LVALUE_EXPR
8768 || TREE_CODE (retval
) == NOP_EXPR
)
8769 retval
= TREE_OPERAND (retval
, 0);
8770 gcc_assert (TREE_CODE (retval
) == ADDR_EXPR
);
8771 retval
= TREE_OPERAND (retval
, 0);
8774 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
8775 treated as an rvalue for the purposes of overload resolution to
8776 favor move constructors over copy constructors.
8778 Note that these conditions are similar to, but not as strict as,
8779 the conditions for the named return value optimization. */
8780 if ((cxx_dialect
!= cxx98
)
8781 && ((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
8782 || TREE_CODE (retval
) == PARM_DECL
)
8783 && DECL_CONTEXT (retval
) == current_function_decl
8784 && !TREE_STATIC (retval
)
8785 /* This is only interesting for class type. */
8786 && CLASS_TYPE_P (functype
))
8787 flags
= flags
| LOOKUP_PREFER_RVALUE
;
8789 /* First convert the value to the function's return type, then
8790 to the type of return value's location to handle the
8791 case that functype is smaller than the valtype. */
8792 retval
= convert_for_initialization
8793 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
8794 tf_warning_or_error
);
8795 retval
= convert (valtype
, retval
);
8797 /* If the conversion failed, treat this just like `return;'. */
8798 if (retval
== error_mark_node
)
8800 /* We can't initialize a register from a AGGR_INIT_EXPR. */
8801 else if (! cfun
->returns_struct
8802 && TREE_CODE (retval
) == TARGET_EXPR
8803 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
8804 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
8805 TREE_OPERAND (retval
, 0));
8806 else if (maybe_warn_about_returning_address_of_local (retval
))
8807 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
8808 build_zero_cst (TREE_TYPE (retval
)));
8811 /* Actually copy the value returned into the appropriate location. */
8812 if (retval
&& retval
!= result
)
8813 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
8819 /* Returns nonzero if the pointer-type FROM can be converted to the
8820 pointer-type TO via a qualification conversion. If CONSTP is -1,
8821 then we return nonzero if the pointers are similar, and the
8822 cv-qualification signature of FROM is a proper subset of that of TO.
8824 If CONSTP is positive, then all outer pointers have been
8828 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
8830 bool to_more_cv_qualified
= false;
8831 bool is_opaque_pointer
= false;
8833 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8835 if (TREE_CODE (to
) != TREE_CODE (from
))
8838 if (TREE_CODE (from
) == OFFSET_TYPE
8839 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
8840 TYPE_OFFSET_BASETYPE (to
)))
8843 /* Const and volatile mean something different for function types,
8844 so the usual checks are not appropriate. */
8845 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
8847 if (!at_least_as_qualified_p (to
, from
))
8850 if (!at_least_as_qualified_p (from
, to
))
8854 to_more_cv_qualified
= true;
8858 constp
&= TYPE_READONLY (to
);
8861 if (VECTOR_TYPE_P (to
))
8862 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8864 if (!TYPE_PTR_P (to
) && !TYPE_PTRDATAMEM_P (to
))
8865 return ((constp
>= 0 || to_more_cv_qualified
)
8866 && (is_opaque_pointer
8867 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
8871 /* When comparing, say, char ** to char const **, this function takes
8872 the 'char *' and 'char const *'. Do not pass non-pointer/reference
8873 types to this function. */
8876 comp_ptr_ttypes (tree to
, tree from
)
8878 return comp_ptr_ttypes_real (to
, from
, 1);
8881 /* Returns true iff FNTYPE is a non-class type that involves
8882 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
8883 if a parameter type is ill-formed. */
8886 error_type_p (const_tree type
)
8890 switch (TREE_CODE (type
))
8896 case REFERENCE_TYPE
:
8898 return error_type_p (TREE_TYPE (type
));
8902 if (error_type_p (TREE_TYPE (type
)))
8904 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
8905 if (error_type_p (TREE_VALUE (t
)))
8910 if (TYPE_PTRMEMFUNC_P (type
))
8911 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
8919 /* Returns true if to and from are (possibly multi-level) pointers to the same
8920 type or inheritance-related types, regardless of cv-quals. */
8923 ptr_reasonably_similar (const_tree to
, const_tree from
)
8925 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8927 /* Any target type is similar enough to void. */
8928 if (VOID_TYPE_P (to
))
8929 return !error_type_p (from
);
8930 if (VOID_TYPE_P (from
))
8931 return !error_type_p (to
);
8933 if (TREE_CODE (to
) != TREE_CODE (from
))
8936 if (TREE_CODE (from
) == OFFSET_TYPE
8937 && comptypes (TYPE_OFFSET_BASETYPE (to
),
8938 TYPE_OFFSET_BASETYPE (from
),
8939 COMPARE_BASE
| COMPARE_DERIVED
))
8942 if (VECTOR_TYPE_P (to
)
8943 && vector_types_convertible_p (to
, from
, false))
8946 if (TREE_CODE (to
) == INTEGER_TYPE
8947 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
8950 if (TREE_CODE (to
) == FUNCTION_TYPE
)
8951 return !error_type_p (to
) && !error_type_p (from
);
8953 if (!TYPE_PTR_P (to
))
8955 /* When either type is incomplete avoid DERIVED_FROM_P,
8956 which may call complete_type (c++/57942). */
8957 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
8959 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
8960 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
8965 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8966 pointer-to-member types) are the same, ignoring cv-qualification at
8970 comp_ptr_ttypes_const (tree to
, tree from
)
8972 bool is_opaque_pointer
= false;
8974 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
8976 if (TREE_CODE (to
) != TREE_CODE (from
))
8979 if (TREE_CODE (from
) == OFFSET_TYPE
8980 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
8981 TYPE_OFFSET_BASETYPE (to
)))
8984 if (VECTOR_TYPE_P (to
))
8985 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
8987 if (!TYPE_PTR_P (to
))
8988 return (is_opaque_pointer
8989 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
8993 /* Returns the type qualifiers for this type, including the qualifiers on the
8994 elements for an array type. */
8997 cp_type_quals (const_tree type
)
9000 /* This CONST_CAST is okay because strip_array_types returns its
9001 argument unmodified and we assign it to a const_tree. */
9002 type
= strip_array_types (CONST_CAST_TREE (type
));
9003 if (type
== error_mark_node
9004 /* Quals on a FUNCTION_TYPE are memfn quals. */
9005 || TREE_CODE (type
) == FUNCTION_TYPE
)
9006 return TYPE_UNQUALIFIED
;
9007 quals
= TYPE_QUALS (type
);
9008 /* METHOD and REFERENCE_TYPEs should never have quals. */
9009 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
9010 && TREE_CODE (type
) != REFERENCE_TYPE
)
9011 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
9012 == TYPE_UNQUALIFIED
));
9016 /* Returns the function-ref-qualifier for TYPE */
9019 type_memfn_rqual (const_tree type
)
9021 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
9022 || TREE_CODE (type
) == METHOD_TYPE
);
9024 if (!FUNCTION_REF_QUALIFIED (type
))
9025 return REF_QUAL_NONE
;
9026 else if (FUNCTION_RVALUE_QUALIFIED (type
))
9027 return REF_QUAL_RVALUE
;
9029 return REF_QUAL_LVALUE
;
9032 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
9036 type_memfn_quals (const_tree type
)
9038 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9039 return TYPE_QUALS (type
);
9040 else if (TREE_CODE (type
) == METHOD_TYPE
)
9041 return cp_type_quals (class_of_this_parm (type
));
9046 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
9047 MEMFN_QUALS and its ref-qualifier to RQUAL. */
9050 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
9052 /* Could handle METHOD_TYPE here if necessary. */
9053 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
9054 if (TYPE_QUALS (type
) == memfn_quals
9055 && type_memfn_rqual (type
) == rqual
)
9058 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
9060 tree result
= build_qualified_type (type
, memfn_quals
);
9061 if (tree canon
= TYPE_CANONICAL (result
))
9062 if (canon
!= result
)
9063 /* check_qualified_type doesn't check the ref-qualifier, so make sure
9064 TYPE_CANONICAL is correct. */
9065 TYPE_CANONICAL (result
)
9066 = build_ref_qualified_type (canon
, type_memfn_rqual (result
));
9067 result
= build_exception_variant (result
, TYPE_RAISES_EXCEPTIONS (type
));
9068 return build_ref_qualified_type (result
, rqual
);
9071 /* Returns nonzero if TYPE is const or volatile. */
9074 cv_qualified_p (const_tree type
)
9076 int quals
= cp_type_quals (type
);
9077 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
9080 /* Returns nonzero if the TYPE contains a mutable member. */
9083 cp_has_mutable_p (const_tree type
)
9085 /* This CONST_CAST is okay because strip_array_types returns its
9086 argument unmodified and we assign it to a const_tree. */
9087 type
= strip_array_types (CONST_CAST_TREE(type
));
9089 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
9092 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9093 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9094 approximation. In particular, consider:
9097 struct S { int i; };
9098 const S s = { f(); }
9100 Here, we will make "s" as TREE_READONLY (because it is declared
9101 "const") -- only to reverse ourselves upon seeing that the
9102 initializer is non-constant. */
9105 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
9107 tree type
= TREE_TYPE (decl
);
9109 if (type
== error_mark_node
)
9112 if (TREE_CODE (decl
) == TYPE_DECL
)
9115 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
9116 && type_quals
!= TYPE_UNQUALIFIED
));
9118 /* Avoid setting TREE_READONLY incorrectly. */
9119 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9120 constructor can produce constant init, so rely on cp_finish_decl to
9121 clear TREE_READONLY if the variable has non-constant init. */
9123 /* If the type has (or might have) a mutable component, that component
9124 might be modified. */
9125 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
9126 type_quals
&= ~TYPE_QUAL_CONST
;
9128 c_apply_type_quals_to_decl (type_quals
, decl
);
9131 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9132 exemplar types such that casting T1 to T2 is casting away constness
9133 if and only if there is no implicit conversion from T1 to T2. */
9136 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
9141 /* [expr.const.cast]
9143 For multi-level pointer to members and multi-level mixed pointers
9144 and pointers to members (conv.qual), the "member" aspect of a
9145 pointer to member level is ignored when determining if a const
9146 cv-qualifier has been cast away. */
9147 /* [expr.const.cast]
9149 For two pointer types:
9151 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9152 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9155 casting from X1 to X2 casts away constness if, for a non-pointer
9156 type T there does not exist an implicit conversion (clause
9159 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9163 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9164 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
9165 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
9167 *t1
= cp_build_qualified_type (void_type_node
,
9168 cp_type_quals (*t1
));
9169 *t2
= cp_build_qualified_type (void_type_node
,
9170 cp_type_quals (*t2
));
9174 quals1
= cp_type_quals (*t1
);
9175 quals2
= cp_type_quals (*t2
);
9177 if (TYPE_PTRDATAMEM_P (*t1
))
9178 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
9180 *t1
= TREE_TYPE (*t1
);
9181 if (TYPE_PTRDATAMEM_P (*t2
))
9182 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
9184 *t2
= TREE_TYPE (*t2
);
9186 casts_away_constness_r (t1
, t2
, complain
);
9187 *t1
= build_pointer_type (*t1
);
9188 *t2
= build_pointer_type (*t2
);
9189 *t1
= cp_build_qualified_type (*t1
, quals1
);
9190 *t2
= cp_build_qualified_type (*t2
, quals2
);
9193 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9196 ??? This function returns non-zero if casting away qualifiers not
9197 just const. We would like to return to the caller exactly which
9198 qualifiers are casted away to give more accurate diagnostics.
9202 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
9204 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
9206 /* [expr.const.cast]
9208 Casting from an lvalue of type T1 to an lvalue of type T2
9209 using a reference cast casts away constness if a cast from an
9210 rvalue of type "pointer to T1" to the type "pointer to T2"
9211 casts away constness. */
9212 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
9213 return casts_away_constness (build_pointer_type (t1
),
9214 build_pointer_type (TREE_TYPE (t2
)),
9218 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
9219 /* [expr.const.cast]
9221 Casting from an rvalue of type "pointer to data member of X
9222 of type T1" to the type "pointer to data member of Y of type
9223 T2" casts away constness if a cast from an rvalue of type
9224 "pointer to T1" to the type "pointer to T2" casts away
9226 return casts_away_constness
9227 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
9228 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
9231 /* Casting away constness is only something that makes sense for
9232 pointer or reference types. */
9233 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
9236 /* Top-level qualifiers don't matter. */
9237 t1
= TYPE_MAIN_VARIANT (t1
);
9238 t2
= TYPE_MAIN_VARIANT (t2
);
9239 casts_away_constness_r (&t1
, &t2
, complain
);
9240 if (!can_convert (t2
, t1
, complain
))
9246 /* If T is a REFERENCE_TYPE return the type to which T refers.
9247 Otherwise, return T itself. */
9250 non_reference (tree t
)
9252 if (t
&& TREE_CODE (t
) == REFERENCE_TYPE
)
9258 /* Return nonzero if REF is an lvalue valid for this language;
9259 otherwise, print an error message and return zero. USE says
9260 how the lvalue is being used and so selects the error message. */
9263 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
9265 cp_lvalue_kind kind
= lvalue_kind (ref
);
9267 if (kind
== clk_none
)
9269 if (complain
& tf_error
)
9270 lvalue_error (input_location
, use
);
9273 else if (kind
& (clk_rvalueref
|clk_class
))
9275 if (!(complain
& tf_error
))
9277 if (kind
& clk_class
)
9278 /* Make this a permerror because we used to accept it. */
9279 permerror (input_location
, "using temporary as lvalue");
9281 error ("using xvalue (rvalue reference) as lvalue");
9286 /* Return true if a user-defined literal operator is a raw operator. */
9289 check_raw_literal_operator (const_tree decl
)
9291 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9294 bool maybe_raw_p
= false;
9296 /* Count the number and type of arguments and check for ellipsis. */
9297 for (argtype
= argtypes
, arity
= 0;
9298 argtype
&& argtype
!= void_list_node
;
9299 ++arity
, argtype
= TREE_CHAIN (argtype
))
9301 tree t
= TREE_VALUE (argtype
);
9303 if (same_type_p (t
, const_string_type_node
))
9307 return false; /* Found ellipsis. */
9309 if (!maybe_raw_p
|| arity
!= 1)
9316 /* Return true if a user-defined literal operator has one of the allowed
9320 check_literal_operator_args (const_tree decl
,
9321 bool *long_long_unsigned_p
, bool *long_double_p
)
9323 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9325 *long_long_unsigned_p
= false;
9326 *long_double_p
= false;
9327 if (processing_template_decl
|| processing_specialization
)
9328 return argtypes
== void_list_node
;
9335 /* Count the number and type of arguments and check for ellipsis. */
9336 for (argtype
= argtypes
, arity
= 0;
9337 argtype
&& argtype
!= void_list_node
;
9338 argtype
= TREE_CHAIN (argtype
))
9340 tree t
= TREE_VALUE (argtype
);
9345 bool maybe_raw_p
= false;
9347 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
9349 t
= TYPE_MAIN_VARIANT (t
);
9350 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
9351 || same_type_p (t
, wchar_type_node
)
9352 || same_type_p (t
, char16_type_node
)
9353 || same_type_p (t
, char32_type_node
))
9355 argtype
= TREE_CHAIN (argtype
);
9358 t
= TREE_VALUE (argtype
);
9359 if (maybe_raw_p
&& argtype
== void_list_node
)
9361 else if (same_type_p (t
, size_type_node
))
9370 else if (same_type_p (t
, long_long_unsigned_type_node
))
9373 *long_long_unsigned_p
= true;
9375 else if (same_type_p (t
, long_double_type_node
))
9378 *long_double_p
= true;
9380 else if (same_type_p (t
, char_type_node
))
9382 else if (same_type_p (t
, wchar_type_node
))
9384 else if (same_type_p (t
, char16_type_node
))
9386 else if (same_type_p (t
, char32_type_node
))
9392 return false; /* Found ellipsis. */
9394 if (arity
!= max_arity
)