1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* This file is part of the C++ front end.
23 It contains routines to build C++ expressions given their operands,
24 including computing the types of the result, C and C++ specific error
25 checks, and some optimization. */
29 #include "coretypes.h"
32 #include "stor-layout.h"
36 #include "c-family/c-objc.h"
37 #include "c-family/c-ubsan.h"
39 #include "gcc-rich-location.h"
42 static tree
cp_build_addr_expr_strict (tree
, tsubst_flags_t
);
43 static tree
cp_build_function_call (tree
, tree
, tsubst_flags_t
);
44 static tree
pfn_from_ptrmemfunc (tree
);
45 static tree
delta_from_ptrmemfunc (tree
);
46 static tree
convert_for_assignment (tree
, tree
, impl_conv_rhs
, tree
, int,
48 static tree
cp_pointer_int_sum (location_t
, enum tree_code
, tree
, tree
,
50 static tree
rationalize_conditional_expr (enum tree_code
, tree
,
52 static int comp_ptr_ttypes_real (tree
, tree
, int);
53 static bool comp_except_types (tree
, tree
, bool);
54 static bool comp_array_types (const_tree
, const_tree
, bool);
55 static tree
pointer_diff (location_t
, tree
, tree
, tree
, tsubst_flags_t
);
56 static tree
get_delta_difference (tree
, tree
, bool, bool, tsubst_flags_t
);
57 static void casts_away_constness_r (tree
*, tree
*, tsubst_flags_t
);
58 static bool casts_away_constness (tree
, tree
, tsubst_flags_t
);
59 static bool maybe_warn_about_returning_address_of_local (tree
);
60 static tree
lookup_destructor (tree
, tree
, tree
, tsubst_flags_t
);
61 static void error_args_num (location_t
, tree
, bool);
62 static int convert_arguments (tree
, vec
<tree
, va_gc
> **, tree
, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value
, tsubst_flags_t complain
)
75 if (processing_template_decl
|| value
== error_mark_node
)
78 if (TREE_CODE (value
) == OVERLOAD
)
79 type
= unknown_type_node
;
81 type
= TREE_TYPE (value
);
83 if (type
== error_mark_node
)
84 return error_mark_node
;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type
))
90 if (complete_type_or_maybe_complain (type
, value
, complain
))
93 return error_mark_node
;
97 require_complete_type (tree value
)
99 return require_complete_type_sfinae (value
, tf_warning_or_error
);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type
)
110 if (type
== NULL_TREE
)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node
;
115 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
117 else if (TREE_CODE (type
) == ARRAY_TYPE
)
119 tree t
= complete_type (TREE_TYPE (type
));
120 unsigned int needs_constructing
, has_nontrivial_dtor
;
121 if (COMPLETE_TYPE_P (t
) && !dependent_type_p (type
))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
127 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
129 TYPE_NEEDS_CONSTRUCTING (t
) = needs_constructing
;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t
) = has_nontrivial_dtor
;
133 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type
, tree value
, tsubst_flags_t complain
)
146 type
= complete_type (type
);
147 if (type
== error_mark_node
)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type
))
152 if (complain
& tf_error
)
153 cxx_incomplete_type_diagnostic (value
, type
, DK_ERROR
);
161 complete_type_or_else (tree type
, tree value
)
163 return complete_type_or_maybe_complain (type
, value
, tf_warning_or_error
);
167 /* Return the common type of two parameter lists.
168 We assume that comptypes has already been done and returned 1;
169 if that isn't so, this may crash.
171 As an optimization, free the space we allocate if the parameter
172 lists are already common. */
175 commonparms (tree p1
, tree p2
)
177 tree oldargs
= p1
, newargs
, n
;
181 len
= list_length (p1
);
182 newargs
= tree_last (p1
);
184 if (newargs
== void_list_node
)
193 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
198 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
200 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
202 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
205 else if (! TREE_PURPOSE (p1
))
207 if (TREE_PURPOSE (p2
))
209 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
215 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
217 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
219 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
222 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
225 TREE_VALUE (n
) = TREE_VALUE (p1
);
233 /* Given a type, perhaps copied for a typedef,
234 find the "original" version of it. */
236 original_type (tree t
)
238 int quals
= cp_type_quals (t
);
239 while (t
!= error_mark_node
240 && TYPE_NAME (t
) != NULL_TREE
)
242 tree x
= TYPE_NAME (t
);
243 if (TREE_CODE (x
) != TYPE_DECL
)
245 x
= DECL_ORIGINAL_TYPE (x
);
250 return cp_build_qualified_type (t
, quals
);
253 /* Return the common type for two arithmetic types T1 and T2 under the
254 usual arithmetic conversions. The default conversions have already
255 been applied, and enumerated types converted to their compatible
259 cp_common_type (tree t1
, tree t2
)
261 enum tree_code code1
= TREE_CODE (t1
);
262 enum tree_code code2
= TREE_CODE (t2
);
267 /* In what follows, we slightly generalize the rules given in [expr] so
268 as to deal with `long long' and `complex'. First, merge the
270 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
272 if (SCOPED_ENUM_P (t1
) || SCOPED_ENUM_P (t2
))
274 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
275 return build_type_attribute_variant (t1
, attributes
);
280 /* FIXME: Attributes. */
281 gcc_assert (ARITHMETIC_TYPE_P (t1
)
282 || VECTOR_TYPE_P (t1
)
283 || UNSCOPED_ENUM_P (t1
));
284 gcc_assert (ARITHMETIC_TYPE_P (t2
)
285 || VECTOR_TYPE_P (t2
)
286 || UNSCOPED_ENUM_P (t2
));
288 /* If one type is complex, form the common type of the non-complex
289 components, then make that complex. Use T1 or T2 if it is the
291 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
293 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
294 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
296 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
298 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
299 return build_type_attribute_variant (t1
, attributes
);
300 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
301 return build_type_attribute_variant (t2
, attributes
);
303 return build_type_attribute_variant (build_complex_type (subtype
),
307 if (code1
== VECTOR_TYPE
)
309 /* When we get here we should have two vectors of the same size.
310 Just prefer the unsigned one if present. */
311 if (TYPE_UNSIGNED (t1
))
312 return build_type_attribute_variant (t1
, attributes
);
314 return build_type_attribute_variant (t2
, attributes
);
317 /* If only one is real, use it as the result. */
318 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
319 return build_type_attribute_variant (t1
, attributes
);
320 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
321 return build_type_attribute_variant (t2
, attributes
);
323 /* Both real or both integers; use the one with greater precision. */
324 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
325 return build_type_attribute_variant (t1
, attributes
);
326 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
327 return build_type_attribute_variant (t2
, attributes
);
329 /* The types are the same; no need to do anything fancy. */
330 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
331 return build_type_attribute_variant (t1
, attributes
);
333 if (code1
!= REAL_TYPE
)
335 /* If one is unsigned long long, then convert the other to unsigned
337 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
338 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
339 return build_type_attribute_variant (long_long_unsigned_type_node
,
341 /* If one is a long long, and the other is an unsigned long, and
342 long long can represent all the values of an unsigned long, then
343 convert to a long long. Otherwise, convert to an unsigned long
344 long. Otherwise, if either operand is long long, convert the
347 Since we're here, we know the TYPE_PRECISION is the same;
348 therefore converting to long long cannot represent all the values
349 of an unsigned long, so we choose unsigned long long in that
351 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
352 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
354 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
355 ? long_long_unsigned_type_node
356 : long_long_integer_type_node
);
357 return build_type_attribute_variant (t
, attributes
);
360 /* Go through the same procedure, but for longs. */
361 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
362 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
363 return build_type_attribute_variant (long_unsigned_type_node
,
365 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
366 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
368 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
369 ? long_unsigned_type_node
: long_integer_type_node
);
370 return build_type_attribute_variant (t
, attributes
);
373 /* For __intN types, either the type is __int128 (and is lower
374 priority than the types checked above, but higher than other
375 128-bit types) or it's known to not be the same size as other
376 types (enforced in toplev.c). Prefer the unsigned type. */
377 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
379 if (int_n_enabled_p
[i
]
380 && (same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].signed_type
)
381 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].signed_type
)
382 || same_type_p (TYPE_MAIN_VARIANT (t1
), int_n_trees
[i
].unsigned_type
)
383 || same_type_p (TYPE_MAIN_VARIANT (t2
), int_n_trees
[i
].unsigned_type
)))
385 tree t
= ((TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
386 ? int_n_trees
[i
].unsigned_type
387 : int_n_trees
[i
].signed_type
);
388 return build_type_attribute_variant (t
, attributes
);
392 /* Otherwise prefer the unsigned one. */
393 if (TYPE_UNSIGNED (t1
))
394 return build_type_attribute_variant (t1
, attributes
);
396 return build_type_attribute_variant (t2
, attributes
);
400 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
401 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
402 return build_type_attribute_variant (long_double_type_node
,
404 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
405 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
406 return build_type_attribute_variant (double_type_node
,
408 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
409 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
410 return build_type_attribute_variant (float_type_node
,
413 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
414 the standard C++ floating-point types. Logic earlier in this
415 function has already eliminated the possibility that
416 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
417 compelling reason to choose one or the other. */
418 return build_type_attribute_variant (t1
, attributes
);
422 /* T1 and T2 are arithmetic or enumeration types. Return the type
423 that will result from the "usual arithmetic conversions" on T1 and
424 T2 as described in [expr]. */
427 type_after_usual_arithmetic_conversions (tree t1
, tree t2
)
429 gcc_assert (ARITHMETIC_TYPE_P (t1
)
430 || VECTOR_TYPE_P (t1
)
431 || UNSCOPED_ENUM_P (t1
));
432 gcc_assert (ARITHMETIC_TYPE_P (t2
)
433 || VECTOR_TYPE_P (t2
)
434 || UNSCOPED_ENUM_P (t2
));
436 /* Perform the integral promotions. We do not promote real types here. */
437 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1
)
438 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2
))
440 t1
= type_promotes_to (t1
);
441 t2
= type_promotes_to (t2
);
444 return cp_common_type (t1
, t2
);
448 composite_pointer_error (diagnostic_t kind
, tree t1
, tree t2
,
449 composite_pointer_operation operation
)
454 emit_diagnostic (kind
, input_location
, 0,
455 "comparison between "
456 "distinct pointer types %qT and %qT lacks a cast",
460 emit_diagnostic (kind
, input_location
, 0,
461 "conversion between "
462 "distinct pointer types %qT and %qT lacks a cast",
465 case CPO_CONDITIONAL_EXPR
:
466 emit_diagnostic (kind
, input_location
, 0,
467 "conditional expression between "
468 "distinct pointer types %qT and %qT lacks a cast",
476 /* Subroutine of composite_pointer_type to implement the recursive
477 case. See that function for documentation of the parameters. */
480 composite_pointer_type_r (tree t1
, tree t2
,
481 composite_pointer_operation operation
,
482 tsubst_flags_t complain
)
489 /* Determine the types pointed to by T1 and T2. */
492 pointee1
= TREE_TYPE (t1
);
493 pointee2
= TREE_TYPE (t2
);
497 pointee1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
498 pointee2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
503 Otherwise, the composite pointer type is a pointer type
504 similar (_conv.qual_) to the type of one of the operands,
505 with a cv-qualification signature (_conv.qual_) that is the
506 union of the cv-qualification signatures of the operand
508 if (same_type_ignoring_top_level_qualifiers_p (pointee1
, pointee2
))
509 result_type
= pointee1
;
510 else if ((TYPE_PTR_P (pointee1
) && TYPE_PTR_P (pointee2
))
511 || (TYPE_PTRMEM_P (pointee1
) && TYPE_PTRMEM_P (pointee2
)))
513 result_type
= composite_pointer_type_r (pointee1
, pointee2
, operation
,
515 if (result_type
== error_mark_node
)
516 return error_mark_node
;
520 if (complain
& tf_error
)
521 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
523 return error_mark_node
;
524 result_type
= void_type_node
;
526 result_type
= cp_build_qualified_type (result_type
,
527 (cp_type_quals (pointee1
)
528 | cp_type_quals (pointee2
)));
529 /* If the original types were pointers to members, so is the
531 if (TYPE_PTRMEM_P (t1
))
533 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
534 TYPE_PTRMEM_CLASS_TYPE (t2
)))
536 if (complain
& tf_error
)
537 composite_pointer_error (DK_PERMERROR
, t1
, t2
, operation
);
539 return error_mark_node
;
541 result_type
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
545 result_type
= build_pointer_type (result_type
);
547 /* Merge the attributes. */
548 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
549 return build_type_attribute_variant (result_type
, attributes
);
552 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
553 ARG1 and ARG2 are the values with those types. The OPERATION is to
554 describe the operation between the pointer types,
555 in case an error occurs.
557 This routine also implements the computation of a common type for
558 pointers-to-members as per [expr.eq]. */
561 composite_pointer_type (tree t1
, tree t2
, tree arg1
, tree arg2
,
562 composite_pointer_operation operation
,
563 tsubst_flags_t complain
)
570 If one operand is a null pointer constant, the composite pointer
571 type is the type of the other operand. */
572 if (null_ptr_cst_p (arg1
))
574 if (null_ptr_cst_p (arg2
))
581 If one of the operands has type "pointer to cv1 void*", then
582 the other has type "pointer to cv2T", and the composite pointer
583 type is "pointer to cv12 void", where cv12 is the union of cv1
586 If either type is a pointer to void, make sure it is T1. */
587 if (TYPE_PTR_P (t2
) && VOID_TYPE_P (TREE_TYPE (t2
)))
590 /* Now, if T1 is a pointer to void, merge the qualifiers. */
591 if (TYPE_PTR_P (t1
) && VOID_TYPE_P (TREE_TYPE (t1
)))
596 if (TYPE_PTRFN_P (t2
))
598 if (complain
& tf_error
)
603 pedwarn (input_location
, OPT_Wpedantic
,
604 "ISO C++ forbids comparison between pointer "
605 "of type %<void *%> and pointer-to-function");
608 pedwarn (input_location
, OPT_Wpedantic
,
609 "ISO C++ forbids conversion between pointer "
610 "of type %<void *%> and pointer-to-function");
612 case CPO_CONDITIONAL_EXPR
:
613 pedwarn (input_location
, OPT_Wpedantic
,
614 "ISO C++ forbids conditional expression between "
615 "pointer of type %<void *%> and "
616 "pointer-to-function");
623 return error_mark_node
;
626 = cp_build_qualified_type (void_type_node
,
627 (cp_type_quals (TREE_TYPE (t1
))
628 | cp_type_quals (TREE_TYPE (t2
))));
629 result_type
= build_pointer_type (result_type
);
630 /* Merge the attributes. */
631 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
632 return build_type_attribute_variant (result_type
, attributes
);
635 if (c_dialect_objc () && TYPE_PTR_P (t1
)
638 if (objc_have_common_type (t1
, t2
, -3, NULL_TREE
))
639 return objc_common_type (t1
, t2
);
642 /* if T1 or T2 is "pointer to noexcept function" and the other type is
643 "pointer to function", where the function types are otherwise the same,
644 "pointer to function" */
645 if (fnptr_conv_p (t1
, t2
))
647 if (fnptr_conv_p (t2
, t1
))
650 /* [expr.eq] permits the application of a pointer conversion to
651 bring the pointers to a common type. */
652 if (TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
)
653 && CLASS_TYPE_P (TREE_TYPE (t1
))
654 && CLASS_TYPE_P (TREE_TYPE (t2
))
655 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1
),
658 class1
= TREE_TYPE (t1
);
659 class2
= TREE_TYPE (t2
);
661 if (DERIVED_FROM_P (class1
, class2
))
662 t2
= (build_pointer_type
663 (cp_build_qualified_type (class1
, cp_type_quals (class2
))));
664 else if (DERIVED_FROM_P (class2
, class1
))
665 t1
= (build_pointer_type
666 (cp_build_qualified_type (class2
, cp_type_quals (class1
))));
669 if (complain
& tf_error
)
670 composite_pointer_error (DK_ERROR
, t1
, t2
, operation
);
671 return error_mark_node
;
674 /* [expr.eq] permits the application of a pointer-to-member
675 conversion to change the class type of one of the types. */
676 else if (TYPE_PTRMEM_P (t1
)
677 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1
),
678 TYPE_PTRMEM_CLASS_TYPE (t2
)))
680 class1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
681 class2
= TYPE_PTRMEM_CLASS_TYPE (t2
);
683 if (DERIVED_FROM_P (class1
, class2
))
684 t1
= build_ptrmem_type (class2
, TYPE_PTRMEM_POINTED_TO_TYPE (t1
));
685 else if (DERIVED_FROM_P (class2
, class1
))
686 t2
= build_ptrmem_type (class1
, TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
689 if (complain
& tf_error
)
693 error ("comparison between distinct "
694 "pointer-to-member types %qT and %qT lacks a cast",
698 error ("conversion between distinct "
699 "pointer-to-member types %qT and %qT lacks a cast",
702 case CPO_CONDITIONAL_EXPR
:
703 error ("conditional expression between distinct "
704 "pointer-to-member types %qT and %qT lacks a cast",
710 return error_mark_node
;
714 return composite_pointer_type_r (t1
, t2
, operation
, complain
);
717 /* Return the merged type of two types.
718 We assume that comptypes has already been done and returned 1;
719 if that isn't so, this may crash.
721 This just combines attributes and default arguments; any other
722 differences would cause the two types to compare unalike. */
725 merge_types (tree t1
, tree t2
)
727 enum tree_code code1
;
728 enum tree_code code2
;
731 /* Save time if the two types are the same. */
734 if (original_type (t1
) == original_type (t2
))
737 /* If one type is nonsense, use the other. */
738 if (t1
== error_mark_node
)
740 if (t2
== error_mark_node
)
743 /* Handle merging an auto redeclaration with a previous deduced
748 /* Merge the attributes. */
749 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
751 if (TYPE_PTRMEMFUNC_P (t1
))
752 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
753 if (TYPE_PTRMEMFUNC_P (t2
))
754 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
756 code1
= TREE_CODE (t1
);
757 code2
= TREE_CODE (t2
);
760 gcc_assert (code1
== TYPENAME_TYPE
|| code2
== TYPENAME_TYPE
);
761 if (code1
== TYPENAME_TYPE
)
763 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
764 code1
= TREE_CODE (t1
);
768 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
769 code2
= TREE_CODE (t2
);
777 /* For two pointers, do this recursively on the target type. */
779 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
780 int quals
= cp_type_quals (t1
);
782 if (code1
== POINTER_TYPE
)
784 t1
= build_pointer_type (target
);
785 if (TREE_CODE (target
) == METHOD_TYPE
)
786 t1
= build_ptrmemfunc_type (t1
);
789 t1
= cp_build_reference_type (target
, TYPE_REF_IS_RVALUE (t1
));
790 t1
= build_type_attribute_variant (t1
, attributes
);
791 t1
= cp_build_qualified_type (t1
, quals
);
800 quals
= cp_type_quals (t1
);
801 pointee
= merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1
),
802 TYPE_PTRMEM_POINTED_TO_TYPE (t2
));
803 t1
= build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1
),
805 t1
= cp_build_qualified_type (t1
, quals
);
811 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
812 /* Save space: see if the result is identical to one of the args. */
813 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
814 return build_type_attribute_variant (t1
, attributes
);
815 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
816 return build_type_attribute_variant (t2
, attributes
);
817 /* Merge the element types, and have a size if either arg has one. */
818 t1
= build_cplus_array_type
819 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
824 /* Function types: prefer the one that specified arg types.
825 If both do, merge the arg types. Also merge the return types. */
827 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
828 tree p1
= TYPE_ARG_TYPES (t1
);
829 tree p2
= TYPE_ARG_TYPES (t2
);
832 bool late_return_type_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
834 /* Save space: see if the result is identical to one of the args. */
835 if (valtype
== TREE_TYPE (t1
) && ! p2
)
836 return cp_build_type_attribute_variant (t1
, attributes
);
837 if (valtype
== TREE_TYPE (t2
) && ! p1
)
838 return cp_build_type_attribute_variant (t2
, attributes
);
840 /* Simple way if one arg fails to specify argument types. */
841 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
843 else if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
846 parms
= commonparms (p1
, p2
);
848 rval
= build_function_type (valtype
, parms
);
849 gcc_assert (type_memfn_quals (t1
) == type_memfn_quals (t2
));
850 gcc_assert (type_memfn_rqual (t1
) == type_memfn_rqual (t2
));
851 rval
= apply_memfn_quals (rval
,
852 type_memfn_quals (t1
),
853 type_memfn_rqual (t1
));
854 raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
855 TYPE_RAISES_EXCEPTIONS (t2
));
856 t1
= build_exception_variant (rval
, raises
);
857 if (late_return_type_p
)
858 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
864 /* Get this value the long way, since TYPE_METHOD_BASETYPE
865 is just the main variant of this. */
866 tree basetype
= class_of_this_parm (t2
);
867 tree raises
= merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1
),
868 TYPE_RAISES_EXCEPTIONS (t2
));
869 cp_ref_qualifier rqual
= type_memfn_rqual (t1
);
871 bool late_return_type_1_p
= TYPE_HAS_LATE_RETURN_TYPE (t1
);
872 bool late_return_type_2_p
= TYPE_HAS_LATE_RETURN_TYPE (t2
);
874 /* If this was a member function type, get back to the
875 original type of type member function (i.e., without
876 the class instance variable up front. */
877 t1
= build_function_type (TREE_TYPE (t1
),
878 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
879 t2
= build_function_type (TREE_TYPE (t2
),
880 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
881 t3
= merge_types (t1
, t2
);
882 t3
= build_method_type_directly (basetype
, TREE_TYPE (t3
),
883 TYPE_ARG_TYPES (t3
));
884 t1
= build_exception_variant (t3
, raises
);
885 t1
= build_ref_qualified_type (t1
, rqual
);
886 if (late_return_type_1_p
)
887 TYPE_HAS_LATE_RETURN_TYPE (t1
) = 1;
888 if (late_return_type_2_p
)
889 TYPE_HAS_LATE_RETURN_TYPE (t2
) = 1;
894 /* There is no need to merge attributes into a TYPENAME_TYPE.
895 When the type is instantiated it will have whatever
896 attributes result from the instantiation. */
902 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
904 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
907 return cp_build_type_attribute_variant (t1
, attributes
);
910 /* Return the ARRAY_TYPE type without its domain. */
913 strip_array_domain (tree type
)
916 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
917 if (TYPE_DOMAIN (type
) == NULL_TREE
)
919 t2
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
920 return cp_build_type_attribute_variant (t2
, TYPE_ATTRIBUTES (type
));
923 /* Wrapper around cp_common_type that is used by c-common.c and other
924 front end optimizations that remove promotions.
926 Return the common type for two arithmetic types T1 and T2 under the
927 usual arithmetic conversions. The default conversions have already
928 been applied, and enumerated types converted to their compatible
932 common_type (tree t1
, tree t2
)
934 /* If one type is nonsense, use the other */
935 if (t1
== error_mark_node
)
937 if (t2
== error_mark_node
)
940 return cp_common_type (t1
, t2
);
943 /* Return the common type of two pointer types T1 and T2. This is the
944 type for the result of most arithmetic operations if the operands
945 have the given two types.
947 We assume that comp_target_types has already been done and returned
948 nonzero; if that isn't so, this may crash. */
951 common_pointer_type (tree t1
, tree t2
)
953 gcc_assert ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
954 || (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
955 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)));
957 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
958 CPO_CONVERSION
, tf_warning_or_error
);
961 /* Compare two exception specifier types for exactness or subsetness, if
962 allowed. Returns false for mismatch, true for match (same, or
965 [except.spec] "If a class X ... objects of class X or any class publicly
966 and unambiguously derived from X. Similarly, if a pointer type Y * ...
967 exceptions of type Y * or that are pointers to any type publicly and
968 unambiguously derived from Y. Otherwise a function only allows exceptions
969 that have the same type ..."
970 This does not mention cv qualifiers and is different to what throw
971 [except.throw] and catch [except.catch] will do. They will ignore the
972 top level cv qualifiers, and allow qualifiers in the pointer to class
975 We implement the letter of the standard. */
978 comp_except_types (tree a
, tree b
, bool exact
)
980 if (same_type_p (a
, b
))
984 if (cp_type_quals (a
) || cp_type_quals (b
))
987 if (TYPE_PTR_P (a
) && TYPE_PTR_P (b
))
991 if (cp_type_quals (a
) || cp_type_quals (b
))
995 if (TREE_CODE (a
) != RECORD_TYPE
996 || TREE_CODE (b
) != RECORD_TYPE
)
999 if (publicly_uniquely_derived_p (a
, b
))
1005 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1006 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1007 If EXACT is ce_type, the C++17 type compatibility rules apply.
1008 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1009 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1010 are unordered, but we've already filtered out duplicates. Most lists will
1011 be in order, we should try to make use of that. */
1014 comp_except_specs (const_tree t1
, const_tree t2
, int exact
)
1023 /* First handle noexcept. */
1024 if (exact
< ce_exact
)
1026 if (exact
== ce_type
1027 && (canonical_eh_spec (CONST_CAST_TREE (t1
))
1028 == canonical_eh_spec (CONST_CAST_TREE (t2
))))
1031 /* noexcept(false) is compatible with no exception-specification,
1032 and less strict than any spec. */
1033 if (t1
== noexcept_false_spec
)
1034 return t2
== NULL_TREE
|| exact
== ce_derived
;
1035 /* Even a derived noexcept(false) is compatible with no
1036 exception-specification. */
1037 if (t2
== noexcept_false_spec
)
1038 return t1
== NULL_TREE
;
1040 /* Otherwise, if we aren't looking for an exact match, noexcept is
1041 equivalent to throw(). */
1042 if (t1
== noexcept_true_spec
)
1043 t1
= empty_except_spec
;
1044 if (t2
== noexcept_true_spec
)
1045 t2
= empty_except_spec
;
1048 /* If any noexcept is left, it is only comparable to itself;
1049 either we're looking for an exact match or we're redeclaring a
1050 template with dependent noexcept. */
1051 if ((t1
&& TREE_PURPOSE (t1
))
1052 || (t2
&& TREE_PURPOSE (t2
)))
1054 && cp_tree_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
)));
1056 if (t1
== NULL_TREE
) /* T1 is ... */
1057 return t2
== NULL_TREE
|| exact
== ce_derived
;
1058 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
1059 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
1060 if (t2
== NULL_TREE
) /* T2 is ... */
1062 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
1063 return exact
== ce_derived
;
1065 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1066 Count how many we find, to determine exactness. For exact matching and
1067 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1069 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
1071 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
1073 tree a
= TREE_VALUE (probe
);
1074 tree b
= TREE_VALUE (t2
);
1076 if (comp_except_types (a
, b
, exact
))
1078 if (probe
== base
&& exact
> ce_derived
)
1079 base
= TREE_CHAIN (probe
);
1084 if (probe
== NULL_TREE
)
1087 return exact
== ce_derived
|| base
== NULL_TREE
|| length
== list_length (t1
);
1090 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1091 [] can match [size]. */
1094 comp_array_types (const_tree t1
, const_tree t2
, bool allow_redeclaration
)
1103 /* The type of the array elements must be the same. */
1104 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1107 d1
= TYPE_DOMAIN (t1
);
1108 d2
= TYPE_DOMAIN (t2
);
1113 /* If one of the arrays is dimensionless, and the other has a
1114 dimension, they are of different types. However, it is valid to
1122 declarations for an array object can specify
1123 array types that differ by the presence or absence of a major
1124 array bound (_dcl.array_). */
1126 return allow_redeclaration
;
1128 /* Check that the dimensions are the same. */
1130 if (!cp_tree_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
)))
1132 max1
= TYPE_MAX_VALUE (d1
);
1133 max2
= TYPE_MAX_VALUE (d2
);
1135 if (!cp_tree_equal (max1
, max2
))
1141 /* Compare the relative position of T1 and T2 into their respective
1142 template parameter list.
1143 T1 and T2 must be template parameter types.
1144 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1147 comp_template_parms_position (tree t1
, tree t2
)
1149 tree index1
, index2
;
1150 gcc_assert (t1
&& t2
1151 && TREE_CODE (t1
) == TREE_CODE (t2
)
1152 && (TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
1153 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
1154 || TREE_CODE (t1
) == TEMPLATE_TYPE_PARM
));
1156 index1
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1
));
1157 index2
= TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2
));
1159 /* Then compare their relative position. */
1160 if (TEMPLATE_PARM_IDX (index1
) != TEMPLATE_PARM_IDX (index2
)
1161 || TEMPLATE_PARM_LEVEL (index1
) != TEMPLATE_PARM_LEVEL (index2
)
1162 || (TEMPLATE_PARM_PARAMETER_PACK (index1
)
1163 != TEMPLATE_PARM_PARAMETER_PACK (index2
)))
1166 /* In C++14 we can end up comparing 'auto' to a normal template
1167 parameter. Don't confuse them. */
1168 if (cxx_dialect
>= cxx14
&& (is_auto (t1
) || is_auto (t2
)))
1169 return TYPE_IDENTIFIER (t1
) == TYPE_IDENTIFIER (t2
);
1174 /* Subroutine in comptypes. */
1177 structural_comptypes (tree t1
, tree t2
, int strict
)
1182 /* Suppress errors caused by previously reported errors. */
1183 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1186 gcc_assert (TYPE_P (t1
) && TYPE_P (t2
));
1188 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1189 current instantiation. */
1190 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
1191 t1
= resolve_typename_type (t1
, /*only_current_p=*/true);
1193 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
1194 t2
= resolve_typename_type (t2
, /*only_current_p=*/true);
1196 if (TYPE_PTRMEMFUNC_P (t1
))
1197 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
1198 if (TYPE_PTRMEMFUNC_P (t2
))
1199 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
1201 /* Different classes of types can't be compatible. */
1202 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1205 /* Qualifiers must match. For array types, we will check when we
1206 recur on the array element types. */
1207 if (TREE_CODE (t1
) != ARRAY_TYPE
1208 && cp_type_quals (t1
) != cp_type_quals (t2
))
1210 if (TREE_CODE (t1
) == FUNCTION_TYPE
1211 && type_memfn_quals (t1
) != type_memfn_quals (t2
))
1213 /* Need to check this before TYPE_MAIN_VARIANT.
1214 FIXME function qualifiers should really change the main variant. */
1215 if (TREE_CODE (t1
) == FUNCTION_TYPE
1216 || TREE_CODE (t1
) == METHOD_TYPE
)
1218 if (type_memfn_rqual (t1
) != type_memfn_rqual (t2
))
1220 if (flag_noexcept_type
1221 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (t1
),
1222 TYPE_RAISES_EXCEPTIONS (t2
),
1227 /* Allow for two different type nodes which have essentially the same
1228 definition. Note that we already checked for equality of the type
1229 qualifiers (just above). */
1231 if (TREE_CODE (t1
) != ARRAY_TYPE
1232 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1236 /* Compare the types. Break out if they could be the same. */
1237 switch (TREE_CODE (t1
))
1241 /* All void and bool types are the same. */
1245 case FIXED_POINT_TYPE
:
1247 /* With these nodes, we can't determine type equivalence by
1248 looking at what is stored in the nodes themselves, because
1249 two nodes might have different TYPE_MAIN_VARIANTs but still
1250 represent the same type. For example, wchar_t and int could
1251 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1252 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1253 and are distinct types. On the other hand, int and the
1256 typedef int INT __attribute((may_alias));
1258 have identical properties, different TYPE_MAIN_VARIANTs, but
1259 represent the same type. The canonical type system keeps
1260 track of equivalence in this case, so we fall back on it. */
1261 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1263 case TEMPLATE_TEMPLATE_PARM
:
1264 case BOUND_TEMPLATE_TEMPLATE_PARM
:
1265 if (!comp_template_parms_position (t1
, t2
))
1267 if (!comp_template_parms
1268 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
1269 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
1271 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
1273 /* Don't check inheritance. */
1274 strict
= COMPARE_STRICT
;
1279 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1280 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1281 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
1282 && comp_template_args (TYPE_TI_ARGS (t1
), TYPE_TI_ARGS (t2
)))
1285 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1287 else if ((strict
& COMPARE_DERIVED
) && DERIVED_FROM_P (t2
, t1
))
1293 if (!comptypes (TYPE_OFFSET_BASETYPE (t1
), TYPE_OFFSET_BASETYPE (t2
),
1294 strict
& ~COMPARE_REDECLARATION
))
1296 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1300 case REFERENCE_TYPE
:
1301 if (TYPE_REF_IS_RVALUE (t1
) != TYPE_REF_IS_RVALUE (t2
))
1303 /* fall through to checks for pointer types */
1307 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1308 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1314 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1316 if (!compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)))
1321 /* Target types must match incl. qualifiers. */
1322 if (!comp_array_types (t1
, t2
, !!(strict
& COMPARE_REDECLARATION
)))
1326 case TEMPLATE_TYPE_PARM
:
1327 /* If T1 and T2 don't have the same relative position in their
1328 template parameters set, they can't be equal. */
1329 if (!comp_template_parms_position (t1
, t2
))
1331 /* Constrained 'auto's are distinct from parms that don't have the same
1333 if (!equivalent_placeholder_constraints (t1
, t2
))
1338 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1339 TYPENAME_TYPE_FULLNAME (t2
)))
1341 /* Qualifiers don't matter on scopes. */
1342 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1
),
1347 case UNBOUND_CLASS_TEMPLATE
:
1348 if (!cp_tree_equal (TYPE_IDENTIFIER (t1
), TYPE_IDENTIFIER (t2
)))
1350 if (!same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
)))
1355 if (!same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1360 if (TYPE_VECTOR_SUBPARTS (t1
) != TYPE_VECTOR_SUBPARTS (t2
)
1361 || !same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
1365 case TYPE_PACK_EXPANSION
:
1366 return (same_type_p (PACK_EXPANSION_PATTERN (t1
),
1367 PACK_EXPANSION_PATTERN (t2
))
1368 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1
),
1369 PACK_EXPANSION_EXTRA_ARGS (t2
)));
1372 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1
)
1373 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2
)
1374 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1
)
1375 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2
))
1376 || (DECLTYPE_FOR_LAMBDA_PROXY (t1
)
1377 != DECLTYPE_FOR_LAMBDA_PROXY (t2
))
1378 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1
),
1379 DECLTYPE_TYPE_EXPR (t2
)))
1383 case UNDERLYING_TYPE
:
1384 return same_type_p (UNDERLYING_TYPE_TYPE (t1
),
1385 UNDERLYING_TYPE_TYPE (t2
));
1391 /* If we get here, we know that from a target independent POV the
1392 types are the same. Make sure the target attributes are also
1394 return comp_type_attributes (t1
, t2
);
1397 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1398 is a bitwise-or of the COMPARE_* flags. */
1401 comptypes (tree t1
, tree t2
, int strict
)
1403 if (strict
== COMPARE_STRICT
)
1408 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1411 if (TYPE_STRUCTURAL_EQUALITY_P (t1
) || TYPE_STRUCTURAL_EQUALITY_P (t2
))
1412 /* At least one of the types requires structural equality, so
1413 perform a deep check. */
1414 return structural_comptypes (t1
, t2
, strict
);
1416 if (flag_checking
&& USE_CANONICAL_TYPES
)
1418 bool result
= structural_comptypes (t1
, t2
, strict
);
1420 if (result
&& TYPE_CANONICAL (t1
) != TYPE_CANONICAL (t2
))
1421 /* The two types are structurally equivalent, but their
1422 canonical types were different. This is a failure of the
1423 canonical type propagation code.*/
1425 ("canonical types differ for identical types %qT and %qT",
1427 else if (!result
&& TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
1428 /* Two types are structurally different, but the canonical
1429 types are the same. This means we were over-eager in
1430 assigning canonical types. */
1432 ("same canonical type node for different types %qT and %qT",
1437 if (!flag_checking
&& USE_CANONICAL_TYPES
)
1438 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
1440 return structural_comptypes (t1
, t2
, strict
);
1442 else if (strict
== COMPARE_STRUCTURAL
)
1443 return structural_comptypes (t1
, t2
, COMPARE_STRICT
);
1445 return structural_comptypes (t1
, t2
, strict
);
1448 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1449 top-level qualifiers. */
1452 same_type_ignoring_top_level_qualifiers_p (tree type1
, tree type2
)
1454 if (type1
== error_mark_node
|| type2
== error_mark_node
)
1457 type1
= cp_build_qualified_type (type1
, TYPE_UNQUALIFIED
);
1458 type2
= cp_build_qualified_type (type2
, TYPE_UNQUALIFIED
);
1459 return same_type_p (type1
, type2
);
1462 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1465 at_least_as_qualified_p (const_tree type1
, const_tree type2
)
1467 int q1
= cp_type_quals (type1
);
1468 int q2
= cp_type_quals (type2
);
1470 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1471 return (q1
& q2
) == q2
;
1474 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1475 more cv-qualified that TYPE1, and 0 otherwise. */
1478 comp_cv_qualification (int q1
, int q2
)
1483 if ((q1
& q2
) == q2
)
1485 else if ((q1
& q2
) == q1
)
1492 comp_cv_qualification (const_tree type1
, const_tree type2
)
1494 int q1
= cp_type_quals (type1
);
1495 int q2
= cp_type_quals (type2
);
1496 return comp_cv_qualification (q1
, q2
);
1499 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1500 subset of the cv-qualification signature of TYPE2, and the types
1501 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1504 comp_cv_qual_signature (tree type1
, tree type2
)
1506 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1508 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1514 /* Subroutines of `comptypes'. */
1516 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1517 equivalent in the sense that functions with those parameter types
1518 can have equivalent types. The two lists must be equivalent,
1519 element by element. */
1522 compparms (const_tree parms1
, const_tree parms2
)
1526 /* An unspecified parmlist matches any specified parmlist
1527 whose argument types don't need default promotions. */
1529 for (t1
= parms1
, t2
= parms2
;
1531 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1533 /* If one parmlist is shorter than the other,
1534 they fail to match. */
1537 if (!same_type_p (TREE_VALUE (t1
), TREE_VALUE (t2
)))
1544 /* Process a sizeof or alignof expression where the operand is a
1548 cxx_sizeof_or_alignof_type (tree type
, enum tree_code op
, bool complain
)
1553 gcc_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
);
1554 if (type
== error_mark_node
)
1555 return error_mark_node
;
1557 type
= non_reference (type
);
1558 if (TREE_CODE (type
) == METHOD_TYPE
)
1561 pedwarn (input_location
, OPT_Wpointer_arith
,
1562 "invalid application of %qs to a member function",
1563 operator_name_info
[(int) op
].name
);
1565 return error_mark_node
;
1566 value
= size_one_node
;
1569 dependent_p
= dependent_type_p (type
);
1571 complete_type (type
);
1573 /* VLA types will have a non-constant size. In the body of an
1574 uninstantiated template, we don't need to try to compute the
1575 value, because the sizeof expression is not an integral
1576 constant expression in that case. And, if we do try to
1577 compute the value, we'll likely end up with SAVE_EXPRs, which
1578 the template substitution machinery does not expect to see. */
1579 || (processing_template_decl
1580 && COMPLETE_TYPE_P (type
)
1581 && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
))
1583 value
= build_min (op
, size_type_node
, type
);
1584 TREE_READONLY (value
) = 1;
1588 return c_sizeof_or_alignof_type (input_location
, complete_type (type
),
1589 op
== SIZEOF_EXPR
, false,
1593 /* Return the size of the type, without producing any warnings for
1594 types whose size cannot be taken. This routine should be used only
1595 in some other routine that has already produced a diagnostic about
1596 using the size of such a type. */
1598 cxx_sizeof_nowarn (tree type
)
1600 if (TREE_CODE (type
) == FUNCTION_TYPE
1601 || VOID_TYPE_P (type
)
1602 || TREE_CODE (type
) == ERROR_MARK
)
1603 return size_one_node
;
1604 else if (!COMPLETE_TYPE_P (type
))
1605 return size_zero_node
;
1607 return cxx_sizeof_or_alignof_type (type
, SIZEOF_EXPR
, false);
1610 /* Process a sizeof expression where the operand is an expression. */
1613 cxx_sizeof_expr (tree e
, tsubst_flags_t complain
)
1615 if (e
== error_mark_node
)
1616 return error_mark_node
;
1618 if (processing_template_decl
)
1620 e
= build_min (SIZEOF_EXPR
, size_type_node
, e
);
1621 TREE_SIDE_EFFECTS (e
) = 0;
1622 TREE_READONLY (e
) = 1;
1627 /* To get the size of a static data member declared as an array of
1628 unknown bound, we need to instantiate it. */
1630 && VAR_HAD_UNKNOWN_BOUND (e
)
1631 && DECL_TEMPLATE_INSTANTIATION (e
))
1632 instantiate_decl (e
, /*defer_ok*/true, /*expl_inst_mem*/false);
1634 if (TREE_CODE (e
) == PARM_DECL
1635 && DECL_ARRAY_PARAMETER_P (e
)
1636 && (complain
& tf_warning
))
1638 if (warning (OPT_Wsizeof_array_argument
, "%<sizeof%> on array function "
1639 "parameter %qE will return size of %qT", e
, TREE_TYPE (e
)))
1640 inform (DECL_SOURCE_LOCATION (e
), "declared here");
1643 e
= mark_type_use (e
);
1647 if (complain
& tf_error
)
1648 error ("invalid application of %<sizeof%> to a bit-field");
1650 return error_mark_node
;
1653 else if (is_overloaded_fn (e
))
1655 if (complain
& tf_error
)
1656 permerror (input_location
, "ISO C++ forbids applying %<sizeof%> to an expression of "
1659 return error_mark_node
;
1662 else if (type_unknown_p (e
))
1664 if (complain
& tf_error
)
1665 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1667 return error_mark_node
;
1673 return cxx_sizeof_or_alignof_type (e
, SIZEOF_EXPR
, complain
& tf_error
);
1676 /* Implement the __alignof keyword: Return the minimum required
1677 alignment of E, measured in bytes. For VAR_DECL's and
1678 FIELD_DECL's return DECL_ALIGN (which can be set from an
1679 "aligned" __attribute__ specification). */
1682 cxx_alignof_expr (tree e
, tsubst_flags_t complain
)
1686 if (e
== error_mark_node
)
1687 return error_mark_node
;
1689 if (processing_template_decl
)
1691 e
= build_min (ALIGNOF_EXPR
, size_type_node
, e
);
1692 TREE_SIDE_EFFECTS (e
) = 0;
1693 TREE_READONLY (e
) = 1;
1698 e
= mark_type_use (e
);
1701 t
= size_int (DECL_ALIGN_UNIT (e
));
1702 else if (bitfield_p (e
))
1704 if (complain
& tf_error
)
1705 error ("invalid application of %<__alignof%> to a bit-field");
1707 return error_mark_node
;
1710 else if (TREE_CODE (e
) == COMPONENT_REF
1711 && TREE_CODE (TREE_OPERAND (e
, 1)) == FIELD_DECL
)
1712 t
= size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e
, 1)));
1713 else if (is_overloaded_fn (e
))
1715 if (complain
& tf_error
)
1716 permerror (input_location
, "ISO C++ forbids applying %<__alignof%> to an expression of "
1719 return error_mark_node
;
1720 if (TREE_CODE (e
) == FUNCTION_DECL
)
1721 t
= size_int (DECL_ALIGN_UNIT (e
));
1725 else if (type_unknown_p (e
))
1727 if (complain
& tf_error
)
1728 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1730 return error_mark_node
;
1734 return cxx_sizeof_or_alignof_type (TREE_TYPE (e
), ALIGNOF_EXPR
,
1735 complain
& tf_error
);
1737 return fold_convert (size_type_node
, t
);
1740 /* Process a sizeof or alignof expression E with code OP where the operand
1741 is an expression. */
1744 cxx_sizeof_or_alignof_expr (tree e
, enum tree_code op
, bool complain
)
1746 if (op
== SIZEOF_EXPR
)
1747 return cxx_sizeof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1749 return cxx_alignof_expr (e
, complain
? tf_warning_or_error
: tf_none
);
1752 /* Build a representation of an expression 'alignas(E).' Return the
1753 folded integer value of E if it is an integral constant expression
1754 that resolves to a valid alignment. If E depends on a template
1755 parameter, return a syntactic representation tree of kind
1756 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1757 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1760 cxx_alignas_expr (tree e
)
1762 if (e
== NULL_TREE
|| e
== error_mark_node
1763 || (!TYPE_P (e
) && !require_potential_rvalue_constant_expression (e
)))
1769 When the alignment-specifier is of the form
1770 alignas(type-id ), it shall have the same effect as
1771 alignas(alignof(type-id )). */
1773 return cxx_sizeof_or_alignof_type (e
, ALIGNOF_EXPR
, false);
1775 /* If we reach this point, it means the alignas expression if of
1776 the form "alignas(assignment-expression)", so we should follow
1777 what is stated by [dcl.align]/2. */
1779 if (value_dependent_expression_p (e
))
1780 /* Leave value-dependent expression alone for now. */
1783 e
= instantiate_non_dependent_expr (e
);
1784 e
= mark_rvalue_use (e
);
1786 /* [dcl.align]/2 says:
1788 the assignment-expression shall be an integral constant
1791 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (e
)))
1793 error ("%<alignas%> argument has non-integral type %qT", TREE_TYPE (e
));
1794 return error_mark_node
;
1797 return cxx_constant_value (e
);
1801 /* EXPR is being used in a context that is not a function call.
1806 The expression can be used only as the left-hand operand of a
1807 member function call.
1809 [expr.mptr.operator]
1811 If the result of .* or ->* is a function, then that result can be
1812 used only as the operand for the function call operator ().
1814 by issuing an error message if appropriate. Returns true iff EXPR
1815 violates these rules. */
1818 invalid_nonstatic_memfn_p (location_t loc
, tree expr
, tsubst_flags_t complain
)
1820 if (expr
== NULL_TREE
)
1822 /* Don't enforce this in MS mode. */
1823 if (flag_ms_extensions
)
1825 if (is_overloaded_fn (expr
) && !really_overloaded_fn (expr
))
1826 expr
= get_first_fn (expr
);
1827 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr
))
1829 if (complain
& tf_error
)
1833 error_at (loc
, "invalid use of non-static member function %qD",
1835 inform (DECL_SOURCE_LOCATION (expr
), "declared here");
1838 error_at (loc
, "invalid use of non-static member function of "
1839 "type %qT", TREE_TYPE (expr
));
1846 /* If EXP is a reference to a bitfield, and the type of EXP does not
1847 match the declared type of the bitfield, return the declared type
1848 of the bitfield. Otherwise, return NULL_TREE. */
1851 is_bitfield_expr_with_lowered_type (const_tree exp
)
1853 switch (TREE_CODE (exp
))
1856 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1)
1857 ? TREE_OPERAND (exp
, 1)
1858 : TREE_OPERAND (exp
, 0)))
1860 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 2));
1863 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 1));
1867 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1873 field
= TREE_OPERAND (exp
, 1);
1874 if (TREE_CODE (field
) != FIELD_DECL
|| !DECL_BIT_FIELD_TYPE (field
))
1876 if (same_type_ignoring_top_level_qualifiers_p
1877 (TREE_TYPE (exp
), DECL_BIT_FIELD_TYPE (field
)))
1879 return DECL_BIT_FIELD_TYPE (field
);
1883 if (DECL_HAS_VALUE_EXPR_P (exp
))
1884 return is_bitfield_expr_with_lowered_type (DECL_VALUE_EXPR
1885 (CONST_CAST_TREE (exp
)));
1889 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp
, 0)))
1890 == TYPE_MAIN_VARIANT (TREE_TYPE (exp
)))
1891 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp
, 0));
1899 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1900 bitfield with a lowered type, the type of EXP is returned, rather
1904 unlowered_expr_type (const_tree exp
)
1907 tree etype
= TREE_TYPE (exp
);
1909 type
= is_bitfield_expr_with_lowered_type (exp
);
1911 type
= cp_build_qualified_type (type
, cp_type_quals (etype
));
1918 /* Perform the conversions in [expr] that apply when an lvalue appears
1919 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1920 function-to-pointer conversions. In addition, bitfield references are
1921 converted to their declared types. Note that this function does not perform
1922 the lvalue-to-rvalue conversion for class types. If you need that conversion
1923 for class types, then you probably need to use force_rvalue.
1925 Although the returned value is being used as an rvalue, this
1926 function does not wrap the returned expression in a
1927 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1928 that the return value is no longer an lvalue. */
1931 decay_conversion (tree exp
,
1932 tsubst_flags_t complain
,
1933 bool reject_builtin
/* = true */)
1936 enum tree_code code
;
1937 location_t loc
= EXPR_LOC_OR_LOC (exp
, input_location
);
1939 type
= TREE_TYPE (exp
);
1940 if (type
== error_mark_node
)
1941 return error_mark_node
;
1943 exp
= resolve_nondeduced_context (exp
, complain
);
1944 if (type_unknown_p (exp
))
1946 if (complain
& tf_error
)
1947 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1948 return error_mark_node
;
1951 code
= TREE_CODE (type
);
1953 if (error_operand_p (exp
))
1954 return error_mark_node
;
1956 if (NULLPTR_TYPE_P (type
) && !TREE_SIDE_EFFECTS (exp
))
1957 return nullptr_node
;
1959 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1960 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1961 if (code
== VOID_TYPE
)
1963 if (complain
& tf_error
)
1964 error_at (loc
, "void value not ignored as it ought to be");
1965 return error_mark_node
;
1967 if (invalid_nonstatic_memfn_p (loc
, exp
, complain
))
1968 return error_mark_node
;
1969 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1971 exp
= mark_lvalue_use (exp
);
1972 if (reject_builtin
&& reject_gcc_builtin (exp
, loc
))
1973 return error_mark_node
;
1974 return cp_build_addr_expr (exp
, complain
);
1976 if (code
== ARRAY_TYPE
)
1981 exp
= mark_lvalue_use (exp
);
1983 if (INDIRECT_REF_P (exp
))
1984 return build_nop (build_pointer_type (TREE_TYPE (type
)),
1985 TREE_OPERAND (exp
, 0));
1987 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1989 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1), complain
);
1990 if (op1
== error_mark_node
)
1991 return error_mark_node
;
1992 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1993 TREE_OPERAND (exp
, 0), op1
);
1996 if (!obvalue_p (exp
)
1997 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1999 if (complain
& tf_error
)
2000 error_at (loc
, "invalid use of non-lvalue array");
2001 return error_mark_node
;
2004 /* Don't let an array compound literal decay to a pointer. It can
2005 still be used to initialize an array or bind to a reference. */
2006 if (TREE_CODE (exp
) == TARGET_EXPR
)
2008 if (complain
& tf_error
)
2009 error_at (loc
, "taking address of temporary array");
2010 return error_mark_node
;
2013 ptrtype
= build_pointer_type (TREE_TYPE (type
));
2017 if (!cxx_mark_addressable (exp
))
2018 return error_mark_node
;
2019 adr
= build_nop (ptrtype
, build_address (exp
));
2022 /* This way is better for a COMPONENT_REF since it can
2023 simplify the offset for a component. */
2024 adr
= cp_build_addr_expr (exp
, complain
);
2025 return cp_convert (ptrtype
, adr
, complain
);
2028 /* Otherwise, it's the lvalue-to-rvalue conversion. */
2029 exp
= mark_rvalue_use (exp
, loc
, reject_builtin
);
2031 /* If a bitfield is used in a context where integral promotion
2032 applies, then the caller is expected to have used
2033 default_conversion. That function promotes bitfields correctly
2034 before calling this function. At this point, if we have a
2035 bitfield referenced, we may assume that is not subject to
2036 promotion, and that, therefore, the type of the resulting rvalue
2037 is the declared type of the bitfield. */
2038 exp
= convert_bitfield_to_declared_type (exp
);
2040 /* We do not call rvalue() here because we do not want to wrap EXP
2041 in a NON_LVALUE_EXPR. */
2045 Non-class rvalues always have cv-unqualified types. */
2046 type
= TREE_TYPE (exp
);
2047 if (!CLASS_TYPE_P (type
) && cv_qualified_p (type
))
2048 exp
= build_nop (cv_unqualified (type
), exp
);
2050 if (!complete_type_or_maybe_complain (type
, exp
, complain
))
2051 return error_mark_node
;
2056 /* Perform preparatory conversions, as part of the "usual arithmetic
2057 conversions". In particular, as per [expr]:
2059 Whenever an lvalue expression appears as an operand of an
2060 operator that expects the rvalue for that operand, the
2061 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2062 standard conversions are applied to convert the expression to an
2065 In addition, we perform integral promotions here, as those are
2066 applied to both operands to a binary operator before determining
2067 what additional conversions should apply. */
2070 cp_default_conversion (tree exp
, tsubst_flags_t complain
)
2072 /* Check for target-specific promotions. */
2073 tree promoted_type
= targetm
.promoted_type (TREE_TYPE (exp
));
2075 exp
= cp_convert (promoted_type
, exp
, complain
);
2076 /* Perform the integral promotions first so that bitfield
2077 expressions (which may promote to "int", even if the bitfield is
2078 declared "unsigned") are promoted correctly. */
2079 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp
)))
2080 exp
= cp_perform_integral_promotions (exp
, complain
);
2081 /* Perform the other conversions. */
2082 exp
= decay_conversion (exp
, complain
);
2090 default_conversion (tree exp
)
2092 return cp_default_conversion (exp
, tf_warning_or_error
);
2095 /* EXPR is an expression with an integral or enumeration type.
2096 Perform the integral promotions in [conv.prom], and return the
2100 cp_perform_integral_promotions (tree expr
, tsubst_flags_t complain
)
2105 expr
= mark_rvalue_use (expr
);
2109 If the bitfield has an enumerated type, it is treated as any
2110 other value of that type for promotion purposes. */
2111 type
= is_bitfield_expr_with_lowered_type (expr
);
2112 if (!type
|| TREE_CODE (type
) != ENUMERAL_TYPE
)
2113 type
= TREE_TYPE (expr
);
2114 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
2115 /* Scoped enums don't promote. */
2116 if (SCOPED_ENUM_P (type
))
2118 promoted_type
= type_promotes_to (type
);
2119 if (type
!= promoted_type
)
2120 expr
= cp_convert (promoted_type
, expr
, complain
);
2127 perform_integral_promotions (tree expr
)
2129 return cp_perform_integral_promotions (expr
, tf_warning_or_error
);
2132 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2133 decay_conversion to one. */
2136 string_conv_p (const_tree totype
, const_tree exp
, int warn
)
2140 if (!TYPE_PTR_P (totype
))
2143 t
= TREE_TYPE (totype
);
2144 if (!same_type_p (t
, char_type_node
)
2145 && !same_type_p (t
, char16_type_node
)
2146 && !same_type_p (t
, char32_type_node
)
2147 && !same_type_p (t
, wchar_type_node
))
2150 if (TREE_CODE (exp
) == STRING_CST
)
2152 /* Make sure that we don't try to convert between char and wide chars. */
2153 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
2158 /* Is this a string constant which has decayed to 'const char *'? */
2159 t
= build_pointer_type (cp_build_qualified_type (t
, TYPE_QUAL_CONST
));
2160 if (!same_type_p (TREE_TYPE (exp
), t
))
2163 if (TREE_CODE (exp
) != ADDR_EXPR
2164 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
2169 if (cxx_dialect
>= cxx11
)
2170 pedwarn (input_location
, OPT_Wwrite_strings
,
2171 "ISO C++ forbids converting a string constant to %qT",
2174 warning (OPT_Wwrite_strings
,
2175 "deprecated conversion from string constant to %qT",
2182 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2183 can, for example, use as an lvalue. This code used to be in
2184 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2185 expressions, where we're dealing with aggregates. But now it's again only
2186 called from unary_complex_lvalue. The case (in particular) that led to
2187 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2191 rationalize_conditional_expr (enum tree_code code
, tree t
,
2192 tsubst_flags_t complain
)
2194 location_t loc
= EXPR_LOC_OR_LOC (t
, input_location
);
2196 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2197 the first operand is always the one to be used if both operands
2198 are equal, so we know what conditional expression this used to be. */
2199 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
2201 tree op0
= TREE_OPERAND (t
, 0);
2202 tree op1
= TREE_OPERAND (t
, 1);
2204 /* The following code is incorrect if either operand side-effects. */
2205 gcc_assert (!TREE_SIDE_EFFECTS (op0
)
2206 && !TREE_SIDE_EFFECTS (op1
));
2208 build_conditional_expr (loc
,
2209 build_x_binary_op (loc
,
2210 (TREE_CODE (t
) == MIN_EXPR
2211 ? LE_EXPR
: GE_EXPR
),
2212 op0
, TREE_CODE (op0
),
2213 op1
, TREE_CODE (op1
),
2216 cp_build_unary_op (code
, op0
, false, complain
),
2217 cp_build_unary_op (code
, op1
, false, complain
),
2222 build_conditional_expr (loc
, TREE_OPERAND (t
, 0),
2223 cp_build_unary_op (code
, TREE_OPERAND (t
, 1), false,
2225 cp_build_unary_op (code
, TREE_OPERAND (t
, 2), false,
2230 /* Given the TYPE of an anonymous union field inside T, return the
2231 FIELD_DECL for the field. If not found return NULL_TREE. Because
2232 anonymous unions can nest, we must also search all anonymous unions
2233 that are directly reachable. */
2236 lookup_anon_field (tree t
, tree type
)
2240 t
= TYPE_MAIN_VARIANT (t
);
2242 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2244 if (TREE_STATIC (field
))
2246 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
2249 /* If we find it directly, return the field. */
2250 if (DECL_NAME (field
) == NULL_TREE
2251 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
2256 /* Otherwise, it could be nested, search harder. */
2257 if (DECL_NAME (field
) == NULL_TREE
2258 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2260 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
2268 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2269 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2270 non-NULL, it indicates the path to the base used to name MEMBER.
2271 If PRESERVE_REFERENCE is true, the expression returned will have
2272 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2273 returned will have the type referred to by the reference.
2275 This function does not perform access control; that is either done
2276 earlier by the parser when the name of MEMBER is resolved to MEMBER
2277 itself, or later when overload resolution selects one of the
2278 functions indicated by MEMBER. */
2281 build_class_member_access_expr (cp_expr object
, tree member
,
2282 tree access_path
, bool preserve_reference
,
2283 tsubst_flags_t complain
)
2287 tree result
= NULL_TREE
;
2288 tree using_decl
= NULL_TREE
;
2290 if (error_operand_p (object
) || error_operand_p (member
))
2291 return error_mark_node
;
2293 gcc_assert (DECL_P (member
) || BASELINK_P (member
));
2297 The type of the first expression shall be "class object" (of a
2299 object_type
= TREE_TYPE (object
);
2300 if (!currently_open_class (object_type
)
2301 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2302 return error_mark_node
;
2303 if (!CLASS_TYPE_P (object_type
))
2305 if (complain
& tf_error
)
2307 if (POINTER_TYPE_P (object_type
)
2308 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2309 error ("request for member %qD in %qE, which is of pointer "
2310 "type %qT (maybe you meant to use %<->%> ?)",
2311 member
, object
.get_value (), object_type
);
2313 error ("request for member %qD in %qE, which is of non-class "
2314 "type %qT", member
, object
.get_value (), object_type
);
2316 return error_mark_node
;
2319 /* The standard does not seem to actually say that MEMBER must be a
2320 member of OBJECT_TYPE. However, that is clearly what is
2322 if (DECL_P (member
))
2324 member_scope
= DECL_CLASS_CONTEXT (member
);
2325 if (!mark_used (member
, complain
) && !(complain
& tf_error
))
2326 return error_mark_node
;
2327 if (TREE_DEPRECATED (member
))
2328 warn_deprecated_use (member
, NULL_TREE
);
2331 member_scope
= BINFO_TYPE (BASELINK_ACCESS_BINFO (member
));
2332 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2333 presently be the anonymous union. Go outwards until we find a
2334 type related to OBJECT_TYPE. */
2335 while ((ANON_AGGR_TYPE_P (member_scope
) || UNSCOPED_ENUM_P (member_scope
))
2336 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
2338 member_scope
= TYPE_CONTEXT (member_scope
);
2339 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
2341 if (complain
& tf_error
)
2343 if (TREE_CODE (member
) == FIELD_DECL
)
2344 error ("invalid use of nonstatic data member %qE", member
);
2346 error ("%qD is not a member of %qT", member
, object_type
);
2348 return error_mark_node
;
2351 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2352 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2353 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2355 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
2357 object
= cp_build_indirect_ref (temp
, RO_NULL
, complain
);
2360 /* In [expr.ref], there is an explicit list of the valid choices for
2361 MEMBER. We check for each of those cases here. */
2364 /* A static data member. */
2366 mark_exp_read (object
);
2367 /* If OBJECT has side-effects, they are supposed to occur. */
2368 if (TREE_SIDE_EFFECTS (object
))
2369 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
2371 else if (TREE_CODE (member
) == FIELD_DECL
)
2373 /* A non-static data member. */
2378 if (INDIRECT_REF_P (object
))
2380 integer_zerop (tree_strip_nop_conversions (TREE_OPERAND (object
, 0)));
2382 null_object_p
= false;
2384 /* Convert OBJECT to the type of MEMBER. */
2385 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
2386 TYPE_MAIN_VARIANT (member_scope
)))
2391 binfo
= lookup_base (access_path
? access_path
: object_type
,
2392 member_scope
, ba_unique
, &kind
, complain
);
2393 if (binfo
== error_mark_node
)
2394 return error_mark_node
;
2396 /* It is invalid to try to get to a virtual base of a
2397 NULL object. The most common cause is invalid use of
2399 if (null_object_p
&& kind
== bk_via_virtual
)
2401 if (complain
& tf_error
)
2403 error ("invalid access to non-static data member %qD in "
2404 "virtual base of NULL object", member
);
2406 return error_mark_node
;
2409 /* Convert to the base. */
2410 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
2411 /*nonnull=*/1, complain
);
2412 /* If we found the base successfully then we should be able
2413 to convert to it successfully. */
2414 gcc_assert (object
!= error_mark_node
);
2417 /* If MEMBER is from an anonymous aggregate, we have converted
2418 OBJECT so that it refers to the class containing the
2419 anonymous union. Generate a reference to the anonymous union
2420 itself, and recur to find MEMBER. */
2421 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
2422 /* When this code is called from build_field_call, the
2423 object already has the type of the anonymous union.
2424 That is because the COMPONENT_REF was already
2425 constructed, and was then disassembled before calling
2426 build_field_call. After the function-call code is
2427 cleaned up, this waste can be eliminated. */
2428 && (!same_type_ignoring_top_level_qualifiers_p
2429 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2431 tree anonymous_union
;
2433 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2434 DECL_CONTEXT (member
));
2435 object
= build_class_member_access_expr (object
,
2437 /*access_path=*/NULL_TREE
,
2442 /* Compute the type of the field, as described in [expr.ref]. */
2443 type_quals
= TYPE_UNQUALIFIED
;
2444 member_type
= TREE_TYPE (member
);
2445 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2447 type_quals
= (cp_type_quals (member_type
)
2448 | cp_type_quals (object_type
));
2450 /* A field is const (volatile) if the enclosing object, or the
2451 field itself, is const (volatile). But, a mutable field is
2452 not const, even within a const object. */
2453 if (DECL_MUTABLE_P (member
))
2454 type_quals
&= ~TYPE_QUAL_CONST
;
2455 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2458 result
= build3_loc (input_location
, COMPONENT_REF
, member_type
,
2459 object
, member
, NULL_TREE
);
2461 /* Mark the expression const or volatile, as appropriate. Even
2462 though we've dealt with the type above, we still have to mark the
2463 expression itself. */
2464 if (type_quals
& TYPE_QUAL_CONST
)
2465 TREE_READONLY (result
) = 1;
2466 if (type_quals
& TYPE_QUAL_VOLATILE
)
2467 TREE_THIS_VOLATILE (result
) = 1;
2469 else if (BASELINK_P (member
))
2471 /* The member is a (possibly overloaded) member function. */
2475 /* If the MEMBER is exactly one static member function, then we
2476 know the type of the expression. Otherwise, we must wait
2477 until overload resolution has been performed. */
2478 functions
= BASELINK_FUNCTIONS (member
);
2479 if (TREE_CODE (functions
) == FUNCTION_DECL
2480 && DECL_STATIC_FUNCTION_P (functions
))
2481 type
= TREE_TYPE (functions
);
2483 type
= unknown_type_node
;
2484 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2485 base. That will happen when the function is called. */
2486 result
= build3 (COMPONENT_REF
, type
, object
, member
, NULL_TREE
);
2488 else if (TREE_CODE (member
) == CONST_DECL
)
2490 /* The member is an enumerator. */
2492 /* If OBJECT has side-effects, they are supposed to occur. */
2493 if (TREE_SIDE_EFFECTS (object
))
2494 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
2497 else if ((using_decl
= strip_using_decl (member
)) != member
)
2498 result
= build_class_member_access_expr (object
,
2500 access_path
, preserve_reference
,
2504 if (complain
& tf_error
)
2505 error ("invalid use of %qD", member
);
2506 return error_mark_node
;
2509 if (!preserve_reference
)
2512 If E2 is declared to have type "reference to T", then ... the
2513 type of E1.E2 is T. */
2514 result
= convert_from_reference (result
);
2519 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2520 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2523 lookup_destructor (tree object
, tree scope
, tree dtor_name
,
2524 tsubst_flags_t complain
)
2526 tree object_type
= TREE_TYPE (object
);
2527 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2530 /* We've already complained about this destructor. */
2531 if (dtor_type
== error_mark_node
)
2532 return error_mark_node
;
2534 if (scope
&& !check_dtor_name (scope
, dtor_type
))
2536 if (complain
& tf_error
)
2537 error ("qualified type %qT does not match destructor name ~%qT",
2539 return error_mark_node
;
2541 if (is_auto (dtor_type
))
2542 dtor_type
= object_type
;
2543 else if (identifier_p (dtor_type
))
2545 /* In a template, names we can't find a match for are still accepted
2546 destructor names, and we check them here. */
2547 if (check_dtor_name (object_type
, dtor_type
))
2548 dtor_type
= object_type
;
2551 if (complain
& tf_error
)
2552 error ("object type %qT does not match destructor name ~%qT",
2553 object_type
, dtor_type
);
2554 return error_mark_node
;
2558 else if (!DERIVED_FROM_P (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2560 if (complain
& tf_error
)
2561 error ("the type being destroyed is %qT, but the destructor "
2562 "refers to %qT", TYPE_MAIN_VARIANT (object_type
), dtor_type
);
2563 return error_mark_node
;
2565 expr
= lookup_member (dtor_type
, complete_dtor_identifier
,
2566 /*protect=*/1, /*want_type=*/false,
2567 tf_warning_or_error
);
2570 if (complain
& tf_error
)
2571 cxx_incomplete_type_error (dtor_name
, dtor_type
);
2572 return error_mark_node
;
2574 expr
= (adjust_result_of_qualified_name_lookup
2575 (expr
, dtor_type
, object_type
));
2576 if (scope
== NULL_TREE
)
2577 /* We need to call adjust_result_of_qualified_name_lookup in case the
2578 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2579 that we still get virtual function binding. */
2580 BASELINK_QUALIFIED_P (expr
) = false;
2584 /* An expression of the form "A::template B" has been resolved to
2585 DECL. Issue a diagnostic if B is not a template or template
2589 check_template_keyword (tree decl
)
2591 /* The standard says:
2595 If a name prefixed by the keyword template is not a member
2596 template, the program is ill-formed.
2598 DR 228 removed the restriction that the template be a member
2601 DR 96, if accepted would add the further restriction that explicit
2602 template arguments must be provided if the template keyword is
2603 used, but, as of 2005-10-16, that DR is still in "drafting". If
2604 this DR is accepted, then the semantic checks here can be
2605 simplified, as the entity named must in fact be a template
2606 specialization, rather than, as at present, a set of overloaded
2607 functions containing at least one template function. */
2608 if (TREE_CODE (decl
) != TEMPLATE_DECL
2609 && TREE_CODE (decl
) != TEMPLATE_ID_EXPR
)
2613 if (DECL_USE_TEMPLATE (decl
)
2614 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (decl
)))
2617 permerror (input_location
, "%qD is not a template", decl
);
2619 else if (!is_overloaded_fn (decl
))
2620 permerror (input_location
, "%qD is not a template", decl
);
2625 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (decl
));
2626 !found
&& iter
; ++iter
)
2629 if (TREE_CODE (fn
) == TEMPLATE_DECL
2630 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
2631 || (TREE_CODE (fn
) == FUNCTION_DECL
2632 && DECL_USE_TEMPLATE (fn
)
2633 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn
))))
2637 permerror (input_location
, "%qD is not a template", decl
);
2642 /* Record that an access failure occurred on BASETYPE_PATH attempting
2643 to access FIELD_DECL. */
2646 access_failure_info::record_access_failure (tree basetype_path
,
2649 m_was_inaccessible
= true;
2650 m_basetype_path
= basetype_path
;
2651 m_field_decl
= field_decl
;
2654 /* If an access failure was recorded, then attempt to locate an
2655 accessor function for the pertinent field, and if one is
2656 available, add a note and fix-it hint suggesting using it. */
2659 access_failure_info::maybe_suggest_accessor (bool const_p
) const
2661 if (!m_was_inaccessible
)
2665 = locate_field_accessor (m_basetype_path
, m_field_decl
, const_p
);
2669 /* The accessor must itself be accessible for it to be a reasonable
2671 if (!accessible_p (m_basetype_path
, accessor
, true))
2674 rich_location
richloc (line_table
, input_location
);
2676 pp_printf (&pp
, "%s()", IDENTIFIER_POINTER (DECL_NAME (accessor
)));
2677 richloc
.add_fixit_replace (pp_formatted_text (&pp
));
2678 inform_at_rich_loc (&richloc
, "field %q#D can be accessed via %q#D",
2679 m_field_decl
, accessor
);
2682 /* This function is called by the parser to process a class member
2683 access expression of the form OBJECT.NAME. NAME is a node used by
2684 the parser to represent a name; it is not yet a DECL. It may,
2685 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2686 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2687 there is no reason to do the lookup twice, so the parser keeps the
2688 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2689 be a template via the use of the "A::template B" syntax. */
2692 finish_class_member_access_expr (cp_expr object
, tree name
, bool template_p
,
2693 tsubst_flags_t complain
)
2698 tree access_path
= NULL_TREE
;
2699 tree orig_object
= object
;
2700 tree orig_name
= name
;
2702 if (object
== error_mark_node
|| name
== error_mark_node
)
2703 return error_mark_node
;
2705 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2706 if (!objc_is_public (object
, name
))
2707 return error_mark_node
;
2709 object_type
= TREE_TYPE (object
);
2711 if (processing_template_decl
)
2713 if (/* If OBJECT is dependent, so is OBJECT.NAME. */
2714 type_dependent_object_expression_p (object
)
2715 /* If NAME is "f<args>", where either 'f' or 'args' is
2716 dependent, then the expression is dependent. */
2717 || (TREE_CODE (name
) == TEMPLATE_ID_EXPR
2718 && dependent_template_id_p (TREE_OPERAND (name
, 0),
2719 TREE_OPERAND (name
, 1)))
2720 /* If NAME is "T::X" where "T" is dependent, then the
2721 expression is dependent. */
2722 || (TREE_CODE (name
) == SCOPE_REF
2723 && TYPE_P (TREE_OPERAND (name
, 0))
2724 && dependent_scope_p (TREE_OPERAND (name
, 0))))
2727 return build_min_nt_loc (UNKNOWN_LOCATION
, COMPONENT_REF
,
2728 orig_object
, orig_name
, NULL_TREE
);
2730 object
= build_non_dependent_expr (object
);
2732 else if (c_dialect_objc ()
2733 && identifier_p (name
)
2734 && (expr
= objc_maybe_build_component_ref (object
, name
)))
2739 The type of the first expression shall be "class object" (of a
2741 if (!currently_open_class (object_type
)
2742 && !complete_type_or_maybe_complain (object_type
, object
, complain
))
2743 return error_mark_node
;
2744 if (!CLASS_TYPE_P (object_type
))
2746 if (complain
& tf_error
)
2748 if (POINTER_TYPE_P (object_type
)
2749 && CLASS_TYPE_P (TREE_TYPE (object_type
)))
2750 error ("request for member %qD in %qE, which is of pointer "
2751 "type %qT (maybe you meant to use %<->%> ?)",
2752 name
, object
.get_value (), object_type
);
2754 error ("request for member %qD in %qE, which is of non-class "
2755 "type %qT", name
, object
.get_value (), object_type
);
2757 return error_mark_node
;
2760 if (BASELINK_P (name
))
2761 /* A member function that has already been looked up. */
2765 bool is_template_id
= false;
2766 tree template_args
= NULL_TREE
;
2767 tree scope
= NULL_TREE
;
2769 access_path
= object_type
;
2771 if (TREE_CODE (name
) == SCOPE_REF
)
2773 /* A qualified name. The qualifying class or namespace `S'
2774 has already been looked up; it is either a TYPE or a
2776 scope
= TREE_OPERAND (name
, 0);
2777 name
= TREE_OPERAND (name
, 1);
2779 /* If SCOPE is a namespace, then the qualified name does not
2780 name a member of OBJECT_TYPE. */
2781 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2783 if (complain
& tf_error
)
2784 error ("%<%D::%D%> is not a member of %qT",
2785 scope
, name
, object_type
);
2786 return error_mark_node
;
2790 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2792 is_template_id
= true;
2793 template_args
= TREE_OPERAND (name
, 1);
2794 name
= TREE_OPERAND (name
, 0);
2796 if (!identifier_p (name
))
2797 name
= OVL_NAME (name
);
2802 if (TREE_CODE (scope
) == ENUMERAL_TYPE
)
2804 gcc_assert (!is_template_id
);
2805 /* Looking up a member enumerator (c++/56793). */
2806 if (!TYPE_CLASS_SCOPE_P (scope
)
2807 || !DERIVED_FROM_P (TYPE_CONTEXT (scope
), object_type
))
2809 if (complain
& tf_error
)
2810 error ("%<%D::%D%> is not a member of %qT",
2811 scope
, name
, object_type
);
2812 return error_mark_node
;
2814 tree val
= lookup_enumerator (scope
, name
);
2817 if (complain
& tf_error
)
2818 error ("%qD is not a member of %qD",
2820 return error_mark_node
;
2823 if (TREE_SIDE_EFFECTS (object
))
2824 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
), object
, val
);
2828 gcc_assert (CLASS_TYPE_P (scope
));
2829 gcc_assert (identifier_p (name
) || TREE_CODE (name
) == BIT_NOT_EXPR
);
2831 if (constructor_name_p (name
, scope
))
2833 if (complain
& tf_error
)
2834 error ("cannot call constructor %<%T::%D%> directly",
2836 return error_mark_node
;
2839 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2840 access_path
= lookup_base (object_type
, scope
, ba_check
,
2842 if (access_path
== error_mark_node
)
2843 return error_mark_node
;
2846 if (any_dependent_bases_p (object_type
))
2848 if (complain
& tf_error
)
2849 error ("%qT is not a base of %qT", scope
, object_type
);
2850 return error_mark_node
;
2854 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2856 if (dependent_type_p (object_type
))
2857 /* The destructor isn't declared yet. */
2859 member
= lookup_destructor (object
, scope
, name
, complain
);
2863 /* Look up the member. */
2864 access_failure_info afi
;
2865 member
= lookup_member (access_path
, name
, /*protect=*/1,
2866 /*want_type=*/false, complain
,
2868 afi
.maybe_suggest_accessor (TYPE_READONLY (object_type
));
2869 if (member
== NULL_TREE
)
2871 if (dependent_type_p (object_type
))
2872 /* Try again at instantiation time. */
2874 if (complain
& tf_error
)
2876 tree guessed_id
= lookup_member_fuzzy (access_path
, name
,
2877 /*want_type=*/false);
2880 location_t bogus_component_loc
= input_location
;
2881 gcc_rich_location
rich_loc (bogus_component_loc
);
2882 rich_loc
.add_fixit_misspelled_id (bogus_component_loc
,
2886 "%q#T has no member named %qE; did you mean %qE?",
2887 TREE_CODE (access_path
) == TREE_BINFO
2888 ? TREE_TYPE (access_path
) : object_type
, name
,
2892 error ("%q#T has no member named %qE",
2893 TREE_CODE (access_path
) == TREE_BINFO
2894 ? TREE_TYPE (access_path
) : object_type
, name
);
2896 return error_mark_node
;
2898 if (member
== error_mark_node
)
2899 return error_mark_node
;
2901 && any_dependent_type_attributes_p (DECL_ATTRIBUTES (member
)))
2902 /* Dependent type attributes on the decl mean that the TREE_TYPE is
2903 wrong, so don't use it. */
2905 if (TREE_CODE (member
) == USING_DECL
&& DECL_DEPENDENT_P (member
))
2911 tree templ
= member
;
2913 if (BASELINK_P (templ
))
2914 member
= lookup_template_function (templ
, template_args
);
2915 else if (variable_template_p (templ
))
2916 member
= (lookup_and_finish_template_variable
2917 (templ
, template_args
, complain
));
2920 if (complain
& tf_error
)
2921 error ("%qD is not a member template function", name
);
2922 return error_mark_node
;
2927 if (TREE_DEPRECATED (member
))
2928 warn_deprecated_use (member
, NULL_TREE
);
2931 check_template_keyword (member
);
2933 expr
= build_class_member_access_expr (object
, member
, access_path
,
2934 /*preserve_reference=*/false,
2936 if (processing_template_decl
&& expr
!= error_mark_node
)
2938 if (BASELINK_P (member
))
2940 if (TREE_CODE (orig_name
) == SCOPE_REF
)
2941 BASELINK_QUALIFIED_P (member
) = 1;
2944 return build_min_non_dep (COMPONENT_REF
, expr
,
2945 orig_object
, orig_name
,
2952 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
2956 build_simple_component_ref (tree object
, tree member
)
2958 tree type
= cp_build_qualified_type (TREE_TYPE (member
),
2959 cp_type_quals (TREE_TYPE (object
)));
2960 return build3_loc (input_location
,
2961 COMPONENT_REF
, type
,
2962 object
, member
, NULL_TREE
);
2965 /* Return an expression for the MEMBER_NAME field in the internal
2966 representation of PTRMEM, a pointer-to-member function. (Each
2967 pointer-to-member function type gets its own RECORD_TYPE so it is
2968 more convenient to access the fields by name than by FIELD_DECL.)
2969 This routine converts the NAME to a FIELD_DECL and then creates the
2970 node for the complete expression. */
2973 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2978 /* This code is a stripped down version of
2979 build_class_member_access_expr. It does not work to use that
2980 routine directly because it expects the object to be of class
2982 ptrmem_type
= TREE_TYPE (ptrmem
);
2983 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
));
2984 for (member
= TYPE_FIELDS (ptrmem_type
); member
;
2985 member
= DECL_CHAIN (member
))
2986 if (DECL_NAME (member
) == member_name
)
2988 tree res
= build_simple_component_ref (ptrmem
, member
);
2990 TREE_NO_WARNING (res
) = 1;
2994 /* Given an expression PTR for a pointer, return an expression
2995 for the value pointed to.
2996 ERRORSTRING is the name of the operator to appear in error messages.
2998 This function may need to overload OPERATOR_FNNAME.
2999 Must also handle REFERENCE_TYPEs for C++. */
3002 build_x_indirect_ref (location_t loc
, tree expr
, ref_operator errorstring
,
3003 tsubst_flags_t complain
)
3005 tree orig_expr
= expr
;
3007 tree overload
= NULL_TREE
;
3009 if (processing_template_decl
)
3011 /* Retain the type if we know the operand is a pointer. */
3012 if (TREE_TYPE (expr
) && POINTER_TYPE_P (TREE_TYPE (expr
)))
3013 return build_min (INDIRECT_REF
, TREE_TYPE (TREE_TYPE (expr
)), expr
);
3014 if (type_dependent_expression_p (expr
))
3015 return build_min_nt_loc (loc
, INDIRECT_REF
, expr
);
3016 expr
= build_non_dependent_expr (expr
);
3019 rval
= build_new_op (loc
, INDIRECT_REF
, LOOKUP_NORMAL
, expr
,
3020 NULL_TREE
, NULL_TREE
, &overload
, complain
);
3022 rval
= cp_build_indirect_ref (expr
, errorstring
, complain
);
3024 if (processing_template_decl
&& rval
!= error_mark_node
)
3026 if (overload
!= NULL_TREE
)
3027 return (build_min_non_dep_op_overload
3028 (INDIRECT_REF
, rval
, overload
, orig_expr
));
3030 return build_min_non_dep (INDIRECT_REF
, rval
, orig_expr
);
3036 /* Helper function called from c-common. */
3038 build_indirect_ref (location_t
/*loc*/,
3039 tree ptr
, ref_operator errorstring
)
3041 return cp_build_indirect_ref (ptr
, errorstring
, tf_warning_or_error
);
3045 cp_build_indirect_ref (tree ptr
, ref_operator errorstring
,
3046 tsubst_flags_t complain
)
3050 if (ptr
== current_class_ptr
3051 || (TREE_CODE (ptr
) == NOP_EXPR
3052 && TREE_OPERAND (ptr
, 0) == current_class_ptr
3053 && (same_type_ignoring_top_level_qualifiers_p
3054 (TREE_TYPE (ptr
), TREE_TYPE (current_class_ptr
)))))
3055 return current_class_ref
;
3057 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
3058 ? ptr
: decay_conversion (ptr
, complain
));
3059 if (pointer
== error_mark_node
)
3060 return error_mark_node
;
3062 type
= TREE_TYPE (pointer
);
3064 if (POINTER_TYPE_P (type
))
3068 If the type of the expression is "pointer to T," the type
3069 of the result is "T." */
3070 tree t
= TREE_TYPE (type
);
3072 if ((CONVERT_EXPR_P (ptr
)
3073 || TREE_CODE (ptr
) == VIEW_CONVERT_EXPR
)
3074 && (!CLASS_TYPE_P (t
) || !CLASSTYPE_EMPTY_P (t
)))
3076 /* If a warning is issued, mark it to avoid duplicates from
3077 the backend. This only needs to be done at
3078 warn_strict_aliasing > 2. */
3079 if (warn_strict_aliasing
> 2)
3080 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr
, 0)),
3081 type
, TREE_OPERAND (ptr
, 0)))
3082 TREE_NO_WARNING (ptr
) = 1;
3085 if (VOID_TYPE_P (t
))
3087 /* A pointer to incomplete type (other than cv void) can be
3088 dereferenced [expr.unary.op]/1 */
3089 if (complain
& tf_error
)
3090 error ("%qT is not a pointer-to-object type", type
);
3091 return error_mark_node
;
3093 else if (TREE_CODE (pointer
) == ADDR_EXPR
3094 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
3095 /* The POINTER was something like `&x'. We simplify `*&x' to
3097 return TREE_OPERAND (pointer
, 0);
3100 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
3102 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
3103 so that we get the proper error message if the result is used
3104 to assign to. Also, &* is supposed to be a no-op. */
3105 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
3106 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
3107 TREE_SIDE_EFFECTS (ref
)
3108 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
3112 else if (!(complain
& tf_error
))
3113 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
3115 /* `pointer' won't be an error_mark_node if we were given a
3116 pointer to member, so it's cool to check for this here. */
3117 else if (TYPE_PTRMEM_P (type
))
3118 switch (errorstring
)
3120 case RO_ARRAY_INDEXING
:
3121 error ("invalid use of array indexing on pointer to member");
3124 error ("invalid use of unary %<*%> on pointer to member");
3126 case RO_IMPLICIT_CONVERSION
:
3127 error ("invalid use of implicit conversion on pointer to member");
3130 error ("left hand operand of %<->*%> must be a pointer to class, "
3131 "but is a pointer to member of type %qT", type
);
3136 else if (pointer
!= error_mark_node
)
3137 invalid_indirection_error (input_location
, type
, errorstring
);
3139 return error_mark_node
;
3142 /* This handles expressions of the form "a[i]", which denotes
3145 This is logically equivalent in C to *(a+i), but we may do it differently.
3146 If A is a variable or a member, we generate a primitive ARRAY_REF.
3147 This avoids forcing the array out of registers, and can work on
3148 arrays that are not lvalues (for example, members of structures returned
3151 If INDEX is of some user-defined type, it must be converted to
3152 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3153 will inherit the type of the array, which will be some pointer type.
3155 LOC is the location to use in building the array reference. */
3158 cp_build_array_ref (location_t loc
, tree array
, tree idx
,
3159 tsubst_flags_t complain
)
3165 if (complain
& tf_error
)
3166 error_at (loc
, "subscript missing in array reference");
3167 return error_mark_node
;
3170 /* If an array's index is an array notation, then its rank cannot be
3171 greater than one. */
3172 if (flag_cilkplus
&& contains_array_notation_expr (idx
))
3176 /* If find_rank returns false, then it should have reported an error,
3177 thus it is unnecessary for repetition. */
3178 if (!find_rank (loc
, idx
, idx
, true, &rank
))
3179 return error_mark_node
;
3182 error_at (loc
, "rank of the array%'s index is greater than 1");
3183 return error_mark_node
;
3186 if (TREE_TYPE (array
) == error_mark_node
3187 || TREE_TYPE (idx
) == error_mark_node
)
3188 return error_mark_node
;
3190 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3192 switch (TREE_CODE (array
))
3196 tree value
= cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3198 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (value
),
3199 TREE_OPERAND (array
, 0), value
);
3200 SET_EXPR_LOCATION (ret
, loc
);
3205 ret
= build_conditional_expr
3206 (loc
, TREE_OPERAND (array
, 0),
3207 cp_build_array_ref (loc
, TREE_OPERAND (array
, 1), idx
,
3209 cp_build_array_ref (loc
, TREE_OPERAND (array
, 2), idx
,
3212 protected_set_expr_location (ret
, loc
);
3219 bool non_lvalue
= convert_vector_to_array_for_subscript (loc
, &array
, idx
);
3221 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
3225 warn_array_subscript_with_type_char (loc
, idx
);
3227 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx
)))
3229 if (complain
& tf_error
)
3230 error_at (loc
, "array subscript is not an integer");
3231 return error_mark_node
;
3234 /* Apply integral promotions *after* noticing character types.
3235 (It is unclear why we do these promotions -- the standard
3236 does not say that we should. In fact, the natural thing would
3237 seem to be to convert IDX to ptrdiff_t; we're performing
3238 pointer arithmetic.) */
3239 idx
= cp_perform_integral_promotions (idx
, complain
);
3241 /* An array that is indexed by a non-constant
3242 cannot be stored in a register; we must be able to do
3243 address arithmetic on its address.
3244 Likewise an array of elements of variable size. */
3245 if (TREE_CODE (idx
) != INTEGER_CST
3246 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
3247 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
3250 if (!cxx_mark_addressable (array
, true))
3251 return error_mark_node
;
3254 /* An array that is indexed by a constant value which is not within
3255 the array bounds cannot be stored in a register either; because we
3256 would get a crash in store_bit_field/extract_bit_field when trying
3257 to access a non-existent part of the register. */
3258 if (TREE_CODE (idx
) == INTEGER_CST
3259 && TYPE_DOMAIN (TREE_TYPE (array
))
3260 && ! int_fits_type_p (idx
, TYPE_DOMAIN (TREE_TYPE (array
))))
3262 if (!cxx_mark_addressable (array
))
3263 return error_mark_node
;
3266 /* Note in C++ it is valid to subscript a `register' array, since
3267 it is valid to take the address of something with that
3268 storage specification. */
3272 while (TREE_CODE (foo
) == COMPONENT_REF
)
3273 foo
= TREE_OPERAND (foo
, 0);
3274 if (VAR_P (foo
) && DECL_REGISTER (foo
)
3275 && (complain
& tf_warning
))
3276 warning_at (loc
, OPT_Wextra
,
3277 "subscripting array declared %<register%>");
3280 type
= TREE_TYPE (TREE_TYPE (array
));
3281 rval
= build4 (ARRAY_REF
, type
, array
, idx
, NULL_TREE
, NULL_TREE
);
3282 /* Array ref is const/volatile if the array elements are
3283 or if the array is.. */
3284 TREE_READONLY (rval
)
3285 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
3286 TREE_SIDE_EFFECTS (rval
)
3287 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
3288 TREE_THIS_VOLATILE (rval
)
3289 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
3290 ret
= require_complete_type_sfinae (rval
, complain
);
3291 protected_set_expr_location (ret
, loc
);
3293 ret
= non_lvalue_loc (loc
, ret
);
3298 tree ar
= cp_default_conversion (array
, complain
);
3299 tree ind
= cp_default_conversion (idx
, complain
);
3301 /* Put the integer in IND to simplify error checking. */
3302 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
3303 std::swap (ar
, ind
);
3305 if (ar
== error_mark_node
|| ind
== error_mark_node
)
3306 return error_mark_node
;
3308 if (!TYPE_PTR_P (TREE_TYPE (ar
)))
3310 if (complain
& tf_error
)
3311 error_at (loc
, "subscripted value is neither array nor pointer");
3312 return error_mark_node
;
3314 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
3316 if (complain
& tf_error
)
3317 error_at (loc
, "array subscript is not an integer");
3318 return error_mark_node
;
3321 warn_array_subscript_with_type_char (loc
, idx
);
3323 ret
= cp_build_indirect_ref (cp_build_binary_op (input_location
,
3328 protected_set_expr_location (ret
, loc
);
3330 ret
= non_lvalue_loc (loc
, ret
);
3335 /* Entry point for Obj-C++. */
3338 build_array_ref (location_t loc
, tree array
, tree idx
)
3340 return cp_build_array_ref (loc
, array
, idx
, tf_warning_or_error
);
3343 /* Resolve a pointer to member function. INSTANCE is the object
3344 instance to use, if the member points to a virtual member.
3346 This used to avoid checking for virtual functions if basetype
3347 has no virtual functions, according to an earlier ANSI draft.
3348 With the final ISO C++ rules, such an optimization is
3349 incorrect: A pointer to a derived member can be static_cast
3350 to pointer-to-base-member, as long as the dynamic object
3351 later has the right member. So now we only do this optimization
3352 when we know the dynamic type of the object. */
3355 get_member_function_from_ptrfunc (tree
*instance_ptrptr
, tree function
,
3356 tsubst_flags_t complain
)
3358 if (TREE_CODE (function
) == OFFSET_REF
)
3359 function
= TREE_OPERAND (function
, 1);
3361 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
3363 tree idx
, delta
, e1
, e2
, e3
, vtbl
;
3365 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
3366 tree basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
3368 tree instance_ptr
= *instance_ptrptr
;
3369 tree instance_save_expr
= 0;
3370 if (instance_ptr
== error_mark_node
)
3372 if (TREE_CODE (function
) == PTRMEM_CST
)
3374 /* Extracting the function address from a pmf is only
3375 allowed with -Wno-pmf-conversions. It only works for
3377 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
), complain
);
3378 e1
= convert (fntype
, e1
);
3383 if (complain
& tf_error
)
3384 error ("object missing in use of %qE", function
);
3385 return error_mark_node
;
3389 /* True if we know that the dynamic type of the object doesn't have
3390 virtual functions, so we can assume the PFN field is a pointer. */
3391 nonvirtual
= (COMPLETE_TYPE_P (basetype
)
3392 && !TYPE_POLYMORPHIC_P (basetype
)
3393 && resolves_to_fixed_type_p (instance_ptr
, 0));
3395 /* If we don't really have an object (i.e. in an ill-formed
3396 conversion from PMF to pointer), we can't resolve virtual
3397 functions anyway. */
3398 if (!nonvirtual
&& is_dummy_object (instance_ptr
))
3401 if (TREE_SIDE_EFFECTS (instance_ptr
))
3402 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
3404 if (TREE_SIDE_EFFECTS (function
))
3405 function
= save_expr (function
);
3407 /* Start by extracting all the information from the PMF itself. */
3408 e3
= pfn_from_ptrmemfunc (function
);
3409 delta
= delta_from_ptrmemfunc (function
);
3410 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
3411 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
3413 int flag_sanitize_save
;
3414 case ptrmemfunc_vbit_in_pfn
:
3415 e1
= cp_build_binary_op (input_location
,
3416 BIT_AND_EXPR
, idx
, integer_one_node
,
3418 idx
= cp_build_binary_op (input_location
,
3419 MINUS_EXPR
, idx
, integer_one_node
,
3421 if (idx
== error_mark_node
)
3422 return error_mark_node
;
3425 case ptrmemfunc_vbit_in_delta
:
3426 e1
= cp_build_binary_op (input_location
,
3427 BIT_AND_EXPR
, delta
, integer_one_node
,
3429 /* Don't instrument the RSHIFT_EXPR we're about to create because
3430 we're going to use DELTA number of times, and that wouldn't play
3431 well with SAVE_EXPRs therein. */
3432 flag_sanitize_save
= flag_sanitize
;
3434 delta
= cp_build_binary_op (input_location
,
3435 RSHIFT_EXPR
, delta
, integer_one_node
,
3437 flag_sanitize
= flag_sanitize_save
;
3438 if (delta
== error_mark_node
)
3439 return error_mark_node
;
3446 if (e1
== error_mark_node
)
3447 return error_mark_node
;
3449 /* Convert down to the right base before using the instance. A
3450 special case is that in a pointer to member of class C, C may
3451 be incomplete. In that case, the function will of course be
3452 a member of C, and no conversion is required. In fact,
3453 lookup_base will fail in that case, because incomplete
3454 classes do not have BINFOs. */
3455 if (!same_type_ignoring_top_level_qualifiers_p
3456 (basetype
, TREE_TYPE (TREE_TYPE (instance_ptr
))))
3458 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
3459 basetype
, ba_check
, NULL
, complain
);
3460 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
,
3462 if (instance_ptr
== error_mark_node
)
3463 return error_mark_node
;
3465 /* ...and then the delta in the PMF. */
3466 instance_ptr
= fold_build_pointer_plus (instance_ptr
, delta
);
3468 /* Hand back the adjusted 'this' argument to our caller. */
3469 *instance_ptrptr
= instance_ptr
;
3472 /* Now just return the pointer. */
3475 /* Next extract the vtable pointer from the object. */
3476 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
3478 vtbl
= cp_build_indirect_ref (vtbl
, RO_NULL
, complain
);
3479 if (vtbl
== error_mark_node
)
3480 return error_mark_node
;
3482 /* Finally, extract the function pointer from the vtable. */
3483 e2
= fold_build_pointer_plus_loc (input_location
, vtbl
, idx
);
3484 e2
= cp_build_indirect_ref (e2
, RO_NULL
, complain
);
3485 if (e2
== error_mark_node
)
3486 return error_mark_node
;
3487 TREE_CONSTANT (e2
) = 1;
3489 /* When using function descriptors, the address of the
3490 vtable entry is treated as a function pointer. */
3491 if (TARGET_VTABLE_USES_DESCRIPTORS
)
3492 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
3493 cp_build_addr_expr (e2
, complain
));
3495 e2
= fold_convert (TREE_TYPE (e3
), e2
);
3496 e1
= build_conditional_expr (input_location
, e1
, e2
, e3
, complain
);
3497 if (e1
== error_mark_node
)
3498 return error_mark_node
;
3500 /* Make sure this doesn't get evaluated first inside one of the
3501 branches of the COND_EXPR. */
3502 if (instance_save_expr
)
3503 e1
= build2 (COMPOUND_EXPR
, TREE_TYPE (e1
),
3504 instance_save_expr
, e1
);
3511 /* Used by the C-common bits. */
3513 build_function_call (location_t
/*loc*/,
3514 tree function
, tree params
)
3516 return cp_build_function_call (function
, params
, tf_warning_or_error
);
3519 /* Used by the C-common bits. */
3521 build_function_call_vec (location_t
/*loc*/, vec
<location_t
> /*arg_loc*/,
3522 tree function
, vec
<tree
, va_gc
> *params
,
3523 vec
<tree
, va_gc
> * /*origtypes*/)
3525 vec
<tree
, va_gc
> *orig_params
= params
;
3526 tree ret
= cp_build_function_call_vec (function
, ¶ms
,
3527 tf_warning_or_error
);
3529 /* cp_build_function_call_vec can reallocate PARAMS by adding
3530 default arguments. That should never happen here. Verify
3532 gcc_assert (params
== orig_params
);
3537 /* Build a function call using a tree list of arguments. */
3540 cp_build_function_call (tree function
, tree params
, tsubst_flags_t complain
)
3542 vec
<tree
, va_gc
> *vec
;
3545 vec
= make_tree_vector ();
3546 for (; params
!= NULL_TREE
; params
= TREE_CHAIN (params
))
3547 vec_safe_push (vec
, TREE_VALUE (params
));
3548 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3549 release_tree_vector (vec
);
3553 /* Build a function call using varargs. */
3556 cp_build_function_call_nary (tree function
, tsubst_flags_t complain
, ...)
3558 vec
<tree
, va_gc
> *vec
;
3562 vec
= make_tree_vector ();
3563 va_start (args
, complain
);
3564 for (t
= va_arg (args
, tree
); t
!= NULL_TREE
; t
= va_arg (args
, tree
))
3565 vec_safe_push (vec
, t
);
3567 ret
= cp_build_function_call_vec (function
, &vec
, complain
);
3568 release_tree_vector (vec
);
3572 /* Build a function call using a vector of arguments. PARAMS may be
3573 NULL if there are no parameters. This changes the contents of
3577 cp_build_function_call_vec (tree function
, vec
<tree
, va_gc
> **params
,
3578 tsubst_flags_t complain
)
3580 tree fntype
, fndecl
;
3582 tree original
= function
;
3586 vec
<tree
, va_gc
> *allocated
= NULL
;
3589 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3590 expressions, like those used for ObjC messenger dispatches. */
3591 if (params
!= NULL
&& !vec_safe_is_empty (*params
))
3592 function
= objc_rewrite_function_call (function
, (**params
)[0]);
3594 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3595 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3596 if (TREE_CODE (function
) == NOP_EXPR
3597 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
3598 function
= TREE_OPERAND (function
, 0);
3600 if (TREE_CODE (function
) == FUNCTION_DECL
)
3602 /* If the function is a non-template member function
3603 or a non-template friend, then we need to check the
3606 Note that if overload resolution failed with a single
3607 candidate this function will be used to explicitly diagnose
3608 the failure for the single call expression. The check is
3609 technically redundant since we also would have failed in
3610 add_function_candidate. */
3612 && (complain
& tf_error
)
3613 && !constraints_satisfied_p (function
))
3615 error ("cannot call function %qD", function
);
3616 location_t loc
= DECL_SOURCE_LOCATION (function
);
3617 diagnose_constraints (loc
, function
, NULL_TREE
);
3618 return error_mark_node
;
3621 if (!mark_used (function
, complain
) && !(complain
& tf_error
))
3622 return error_mark_node
;
3625 /* Convert anything with function type to a pointer-to-function. */
3626 if (DECL_MAIN_P (function
))
3628 if (complain
& tf_error
)
3629 pedwarn (input_location
, OPT_Wpedantic
,
3630 "ISO C++ forbids calling %<::main%> from within program");
3632 return error_mark_node
;
3634 function
= build_addr_func (function
, complain
);
3640 function
= build_addr_func (function
, complain
);
3643 if (function
== error_mark_node
)
3644 return error_mark_node
;
3646 fntype
= TREE_TYPE (function
);
3648 if (TYPE_PTRMEMFUNC_P (fntype
))
3650 if (complain
& tf_error
)
3651 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3652 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3653 original
, original
);
3654 return error_mark_node
;
3657 is_method
= (TYPE_PTR_P (fntype
)
3658 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
3660 if (!(TYPE_PTRFN_P (fntype
)
3662 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
3664 if (complain
& tf_error
)
3666 if (!flag_diagnostics_show_caret
)
3667 error_at (input_location
,
3668 "%qE cannot be used as a function", original
);
3669 else if (DECL_P (original
))
3670 error_at (input_location
,
3671 "%qD cannot be used as a function", original
);
3673 error_at (input_location
,
3674 "expression cannot be used as a function");
3677 return error_mark_node
;
3680 /* fntype now gets the type of function pointed to. */
3681 fntype
= TREE_TYPE (fntype
);
3682 parm_types
= TYPE_ARG_TYPES (fntype
);
3686 allocated
= make_tree_vector ();
3687 params
= &allocated
;
3690 nargs
= convert_arguments (parm_types
, params
, fndecl
, LOOKUP_NORMAL
,
3693 return error_mark_node
;
3695 argarray
= (*params
)->address ();
3697 /* Check for errors in format strings and inappropriately
3699 bool warned_p
= check_function_arguments (input_location
, fndecl
, fntype
,
3702 ret
= build_cxx_call (function
, nargs
, argarray
, complain
);
3706 tree c
= extract_call_expr (ret
);
3707 if (TREE_CODE (c
) == CALL_EXPR
)
3708 TREE_NO_WARNING (c
) = 1;
3711 if (allocated
!= NULL
)
3712 release_tree_vector (allocated
);
3717 /* Subroutine of convert_arguments.
3718 Print an error message about a wrong number of arguments. */
3721 error_args_num (location_t loc
, tree fndecl
, bool too_many_p
)
3725 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
3727 if (DECL_NAME (fndecl
) == NULL_TREE
3728 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
3731 ? G_("too many arguments to constructor %q#D")
3732 : G_("too few arguments to constructor %q#D"),
3737 ? G_("too many arguments to member function %q#D")
3738 : G_("too few arguments to member function %q#D"),
3744 ? G_("too many arguments to function %q#D")
3745 : G_("too few arguments to function %q#D"),
3747 if (!DECL_IS_BUILTIN (fndecl
))
3748 inform (DECL_SOURCE_LOCATION (fndecl
), "declared here");
3752 if (c_dialect_objc () && objc_message_selector ())
3755 ? G_("too many arguments to method %q#D")
3756 : G_("too few arguments to method %q#D"),
3757 objc_message_selector ());
3759 error_at (loc
, too_many_p
? G_("too many arguments to function")
3760 : G_("too few arguments to function"));
3764 /* Convert the actual parameter expressions in the list VALUES to the
3765 types in the list TYPELIST. The converted expressions are stored
3766 back in the VALUES vector.
3767 If parmdecls is exhausted, or when an element has NULL as its type,
3768 perform the default conversions.
3770 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3772 This is also where warnings about wrong number of args are generated.
3774 Returns the actual number of arguments processed (which might be less
3775 than the length of the vector), or -1 on error.
3777 In C++, unspecified trailing parameters can be filled in with their
3778 default arguments, if such were specified. Do so here. */
3781 convert_arguments (tree typelist
, vec
<tree
, va_gc
> **values
, tree fndecl
,
3782 int flags
, tsubst_flags_t complain
)
3787 /* Argument passing is always copy-initialization. */
3788 flags
|= LOOKUP_ONLYCONVERTING
;
3790 for (i
= 0, typetail
= typelist
;
3791 i
< vec_safe_length (*values
);
3794 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
3795 tree val
= (**values
)[i
];
3797 if (val
== error_mark_node
|| type
== error_mark_node
)
3800 if (type
== void_type_node
)
3802 if (complain
& tf_error
)
3804 error_args_num (input_location
, fndecl
, /*too_many_p=*/true);
3811 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3812 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3813 if (TREE_CODE (val
) == NOP_EXPR
3814 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3815 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3816 val
= TREE_OPERAND (val
, 0);
3818 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3820 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3821 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3822 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3823 val
= decay_conversion (val
, complain
);
3826 if (val
== error_mark_node
)
3831 /* Formal parm type is specified by a function prototype. */
3834 if (!COMPLETE_TYPE_P (complete_type (type
)))
3836 if (complain
& tf_error
)
3839 error ("parameter %P of %qD has incomplete type %qT",
3842 error ("parameter %P has incomplete type %qT", i
, type
);
3844 parmval
= error_mark_node
;
3848 parmval
= convert_for_initialization
3849 (NULL_TREE
, type
, val
, flags
,
3850 ICR_ARGPASS
, fndecl
, i
, complain
);
3851 parmval
= convert_for_arg_passing (type
, parmval
, complain
);
3854 if (parmval
== error_mark_node
)
3857 (**values
)[i
] = parmval
;
3861 if (fndecl
&& magic_varargs_p (fndecl
))
3862 /* Don't do ellipsis conversion for __built_in_constant_p
3863 as this will result in spurious errors for non-trivial
3865 val
= require_complete_type_sfinae (val
, complain
);
3867 val
= convert_arg_to_ellipsis (val
, complain
);
3869 (**values
)[i
] = val
;
3873 typetail
= TREE_CHAIN (typetail
);
3876 if (typetail
!= 0 && typetail
!= void_list_node
)
3878 /* See if there are default arguments that can be used. Because
3879 we hold default arguments in the FUNCTION_TYPE (which is so
3880 wrong), we can see default parameters here from deduced
3881 contexts (and via typeof) for indirect function calls.
3882 Fortunately we know whether we have a function decl to
3883 provide default arguments in a language conformant
3885 if (fndecl
&& TREE_PURPOSE (typetail
)
3886 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
3888 for (; typetail
!= void_list_node
; ++i
)
3890 /* After DR777, with explicit template args we can end up with a
3891 default argument followed by no default argument. */
3892 if (!TREE_PURPOSE (typetail
))
3895 = convert_default_arg (TREE_VALUE (typetail
),
3896 TREE_PURPOSE (typetail
),
3897 fndecl
, i
, complain
);
3899 if (parmval
== error_mark_node
)
3902 vec_safe_push (*values
, parmval
);
3903 typetail
= TREE_CHAIN (typetail
);
3904 /* ends with `...'. */
3905 if (typetail
== NULL_TREE
)
3910 if (typetail
&& typetail
!= void_list_node
)
3912 if (complain
& tf_error
)
3913 error_args_num (input_location
, fndecl
, /*too_many_p=*/false);
3921 /* Build a binary-operation expression, after performing default
3922 conversions on the operands. CODE is the kind of expression to
3923 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3924 are the tree codes which correspond to ARG1 and ARG2 when issuing
3925 warnings about possibly misplaced parentheses. They may differ
3926 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3927 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3928 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3929 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3930 ARG2_CODE as ERROR_MARK. */
3933 build_x_binary_op (location_t loc
, enum tree_code code
, tree arg1
,
3934 enum tree_code arg1_code
, tree arg2
,
3935 enum tree_code arg2_code
, tree
*overload_p
,
3936 tsubst_flags_t complain
)
3941 tree overload
= NULL_TREE
;
3946 if (processing_template_decl
)
3948 if (type_dependent_expression_p (arg1
)
3949 || type_dependent_expression_p (arg2
))
3950 return build_min_nt_loc (loc
, code
, arg1
, arg2
);
3951 arg1
= build_non_dependent_expr (arg1
);
3952 arg2
= build_non_dependent_expr (arg2
);
3955 if (code
== DOTSTAR_EXPR
)
3956 expr
= build_m_component_ref (arg1
, arg2
, complain
);
3958 expr
= build_new_op (loc
, code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
,
3959 &overload
, complain
);
3961 if (overload_p
!= NULL
)
3962 *overload_p
= overload
;
3964 /* Check for cases such as x+y<<z which users are likely to
3965 misinterpret. But don't warn about obj << x + y, since that is a
3966 common idiom for I/O. */
3967 if (warn_parentheses
3968 && (complain
& tf_warning
)
3969 && !processing_template_decl
3970 && !error_operand_p (arg1
)
3971 && !error_operand_p (arg2
)
3972 && (code
!= LSHIFT_EXPR
3973 || !CLASS_TYPE_P (TREE_TYPE (arg1
))))
3974 warn_about_parentheses (loc
, code
, arg1_code
, orig_arg1
,
3975 arg2_code
, orig_arg2
);
3977 if (processing_template_decl
&& expr
!= error_mark_node
)
3979 if (overload
!= NULL_TREE
)
3980 return (build_min_non_dep_op_overload
3981 (code
, expr
, overload
, orig_arg1
, orig_arg2
));
3983 return build_min_non_dep (code
, expr
, orig_arg1
, orig_arg2
);
3989 /* Build and return an ARRAY_REF expression. */
3992 build_x_array_ref (location_t loc
, tree arg1
, tree arg2
,
3993 tsubst_flags_t complain
)
3995 tree orig_arg1
= arg1
;
3996 tree orig_arg2
= arg2
;
3998 tree overload
= NULL_TREE
;
4000 if (processing_template_decl
)
4002 if (type_dependent_expression_p (arg1
)
4003 || type_dependent_expression_p (arg2
))
4004 return build_min_nt_loc (loc
, ARRAY_REF
, arg1
, arg2
,
4005 NULL_TREE
, NULL_TREE
);
4006 arg1
= build_non_dependent_expr (arg1
);
4007 arg2
= build_non_dependent_expr (arg2
);
4010 expr
= build_new_op (loc
, ARRAY_REF
, LOOKUP_NORMAL
, arg1
, arg2
,
4011 NULL_TREE
, &overload
, complain
);
4013 if (processing_template_decl
&& expr
!= error_mark_node
)
4015 if (overload
!= NULL_TREE
)
4016 return (build_min_non_dep_op_overload
4017 (ARRAY_REF
, expr
, overload
, orig_arg1
, orig_arg2
));
4019 return build_min_non_dep (ARRAY_REF
, expr
, orig_arg1
, orig_arg2
,
4020 NULL_TREE
, NULL_TREE
);
4025 /* Return whether OP is an expression of enum type cast to integer
4026 type. In C++ even unsigned enum types are cast to signed integer
4027 types. We do not want to issue warnings about comparisons between
4028 signed and unsigned types when one of the types is an enum type.
4029 Those warnings are always false positives in practice. */
4032 enum_cast_to_int (tree op
)
4034 if (CONVERT_EXPR_P (op
)
4035 && TREE_TYPE (op
) == integer_type_node
4036 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == ENUMERAL_TYPE
4037 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 0))))
4040 /* The cast may have been pushed into a COND_EXPR. */
4041 if (TREE_CODE (op
) == COND_EXPR
)
4042 return (enum_cast_to_int (TREE_OPERAND (op
, 1))
4043 || enum_cast_to_int (TREE_OPERAND (op
, 2)));
4048 /* For the c-common bits. */
4050 build_binary_op (location_t location
, enum tree_code code
, tree op0
, tree op1
,
4053 return cp_build_binary_op (location
, code
, op0
, op1
, tf_warning_or_error
);
4056 /* Build a vector comparison of ARG0 and ARG1 using CODE opcode
4057 into a value of TYPE type. Comparison is done via VEC_COND_EXPR. */
4060 build_vec_cmp (tree_code code
, tree type
,
4061 tree arg0
, tree arg1
)
4063 tree zero_vec
= build_zero_cst (type
);
4064 tree minus_one_vec
= build_minus_one_cst (type
);
4065 tree cmp_type
= build_same_sized_truth_vector_type(type
);
4066 tree cmp
= build2 (code
, cmp_type
, arg0
, arg1
);
4067 return build3 (VEC_COND_EXPR
, type
, cmp
, minus_one_vec
, zero_vec
);
4070 /* Possibly warn about an address never being NULL. */
4073 warn_for_null_address (location_t location
, tree op
, tsubst_flags_t complain
)
4076 || (complain
& tf_warning
) == 0
4077 || c_inhibit_evaluation_warnings
!= 0
4078 || TREE_NO_WARNING (op
))
4081 tree cop
= fold_non_dependent_expr (op
);
4083 if (TREE_CODE (cop
) == ADDR_EXPR
4084 && decl_with_nonnull_addr_p (TREE_OPERAND (cop
, 0))
4085 && !TREE_NO_WARNING (cop
))
4086 warning_at (location
, OPT_Waddress
, "the address of %qD will never "
4087 "be NULL", TREE_OPERAND (cop
, 0));
4089 if (CONVERT_EXPR_P (op
)
4090 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == REFERENCE_TYPE
)
4093 STRIP_NOPS (inner_op
);
4095 if (DECL_P (inner_op
))
4096 warning_at (location
, OPT_Waddress
,
4097 "the compiler can assume that the address of "
4098 "%qD will never be NULL", inner_op
);
4102 /* Build a binary-operation expression without default conversions.
4103 CODE is the kind of expression to build.
4104 LOCATION is the location_t of the operator in the source code.
4105 This function differs from `build' in several ways:
4106 the data type of the result is computed and recorded in it,
4107 warnings are generated if arg data types are invalid,
4108 special handling for addition and subtraction of pointers is known,
4109 and some optimization is done (operations on narrow ints
4110 are done in the narrower type when that gives the same result).
4111 Constant folding is also done before the result is returned.
4113 Note that the operands will never have enumeral types
4114 because either they have just had the default conversions performed
4115 or they have both just been converted to some other type in which
4116 the arithmetic is to be done.
4118 C++: must do special pointer arithmetic when implementing
4119 multiple inheritance, and deal with pointer to member functions. */
4122 cp_build_binary_op (location_t location
,
4123 enum tree_code code
, tree orig_op0
, tree orig_op1
,
4124 tsubst_flags_t complain
)
4127 enum tree_code code0
, code1
;
4129 const char *invalid_op_diag
;
4131 /* Expression code to give to the expression when it is built.
4132 Normally this is CODE, which is what the caller asked for,
4133 but in some special cases we change it. */
4134 enum tree_code resultcode
= code
;
4136 /* Data type in which the computation is to be performed.
4137 In the simplest cases this is the common type of the arguments. */
4138 tree result_type
= NULL_TREE
;
4140 /* Nonzero means operands have already been type-converted
4141 in whatever way is necessary.
4142 Zero means they need to be converted to RESULT_TYPE. */
4145 /* Nonzero means create the expression with this type, rather than
4147 tree build_type
= 0;
4149 /* Nonzero means after finally constructing the expression
4150 convert it to this type. */
4151 tree final_type
= 0;
4153 tree result
, result_ovl
;
4155 /* Nonzero if this is an operation like MIN or MAX which can
4156 safely be computed in short if both args are promoted shorts.
4157 Also implies COMMON.
4158 -1 indicates a bitwise operation; this makes a difference
4159 in the exact conditions for when it is safe to do the operation
4160 in a narrower mode. */
4163 /* Nonzero if this is a comparison operation;
4164 if both args are promoted shorts, compare the original shorts.
4165 Also implies COMMON. */
4166 int short_compare
= 0;
4168 /* Nonzero means set RESULT_TYPE to the common type of the args. */
4171 /* True if both operands have arithmetic type. */
4172 bool arithmetic_types_p
;
4174 /* Apply default conversions. */
4178 /* Remember whether we're doing / or %. */
4179 bool doing_div_or_mod
= false;
4181 /* Remember whether we're doing << or >>. */
4182 bool doing_shift
= false;
4184 /* Tree holding instrumentation expression. */
4185 tree instrument_expr
= NULL_TREE
;
4187 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
4188 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
4189 || code
== TRUTH_XOR_EXPR
)
4191 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4192 op0
= decay_conversion (op0
, complain
);
4193 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4194 op1
= decay_conversion (op1
, complain
);
4198 if (!really_overloaded_fn (op0
) && !VOID_TYPE_P (TREE_TYPE (op0
)))
4199 op0
= cp_default_conversion (op0
, complain
);
4200 if (!really_overloaded_fn (op1
) && !VOID_TYPE_P (TREE_TYPE (op1
)))
4201 op1
= cp_default_conversion (op1
, complain
);
4204 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
4205 STRIP_TYPE_NOPS (op0
);
4206 STRIP_TYPE_NOPS (op1
);
4208 /* DTRT if one side is an overloaded function, but complain about it. */
4209 if (type_unknown_p (op0
))
4211 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
4212 if (t
!= error_mark_node
)
4214 if (complain
& tf_error
)
4215 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4220 if (type_unknown_p (op1
))
4222 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
4223 if (t
!= error_mark_node
)
4225 if (complain
& tf_error
)
4226 permerror (input_location
, "assuming cast to type %qT from overloaded function",
4232 type0
= TREE_TYPE (op0
);
4233 type1
= TREE_TYPE (op1
);
4235 /* The expression codes of the data types of the arguments tell us
4236 whether the arguments are integers, floating, pointers, etc. */
4237 code0
= TREE_CODE (type0
);
4238 code1
= TREE_CODE (type1
);
4240 /* If an error was already reported for one of the arguments,
4241 avoid reporting another error. */
4242 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
4243 return error_mark_node
;
4245 if ((invalid_op_diag
4246 = targetm
.invalid_binary_op (code
, type0
, type1
)))
4248 if (complain
& tf_error
)
4249 error (invalid_op_diag
);
4250 return error_mark_node
;
4253 /* Issue warnings about peculiar, but valid, uses of NULL. */
4254 if ((orig_op0
== null_node
|| orig_op1
== null_node
)
4255 /* It's reasonable to use pointer values as operands of &&
4256 and ||, so NULL is no exception. */
4257 && code
!= TRUTH_ANDIF_EXPR
&& code
!= TRUTH_ORIF_EXPR
4258 && ( /* Both are NULL (or 0) and the operation was not a
4259 comparison or a pointer subtraction. */
4260 (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
)
4261 && code
!= EQ_EXPR
&& code
!= NE_EXPR
&& code
!= MINUS_EXPR
)
4262 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4263 || (!null_ptr_cst_p (orig_op0
)
4264 && !TYPE_PTR_OR_PTRMEM_P (type0
))
4265 || (!null_ptr_cst_p (orig_op1
)
4266 && !TYPE_PTR_OR_PTRMEM_P (type1
)))
4267 && (complain
& tf_warning
))
4269 source_location loc
=
4270 expansion_point_location_if_in_system_header (input_location
);
4272 warning_at (loc
, OPT_Wpointer_arith
, "NULL used in arithmetic");
4275 /* In case when one of the operands of the binary operation is
4276 a vector and another is a scalar -- convert scalar to vector. */
4277 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
4279 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
4280 complain
& tf_error
);
4282 switch (convert_flag
)
4285 return error_mark_node
;
4288 op0
= convert (TREE_TYPE (type1
), op0
);
4289 op0
= save_expr (op0
);
4290 op0
= build_vector_from_val (type1
, op0
);
4291 type0
= TREE_TYPE (op0
);
4292 code0
= TREE_CODE (type0
);
4298 op1
= convert (TREE_TYPE (type0
), op1
);
4299 op1
= save_expr (op1
);
4300 op1
= build_vector_from_val (type0
, op1
);
4301 type1
= TREE_TYPE (op1
);
4302 code1
= TREE_CODE (type1
);
4314 /* Subtraction of two similar pointers.
4315 We must subtract them as integers, then divide by object size. */
4316 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
4317 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4319 return pointer_diff (location
, op0
, op1
,
4320 common_pointer_type (type0
, type1
), complain
);
4321 /* In all other cases except pointer - int, the usual arithmetic
4323 else if (!(code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
))
4328 /* The pointer - int case is just like pointer + int; fall
4332 if ((code0
== POINTER_TYPE
|| code1
== POINTER_TYPE
)
4333 && (code0
== INTEGER_TYPE
|| code1
== INTEGER_TYPE
))
4337 ptr_operand
= ((code0
== POINTER_TYPE
) ? op0
: op1
);
4338 int_operand
= ((code0
== INTEGER_TYPE
) ? op0
: op1
);
4339 if (processing_template_decl
)
4341 result_type
= TREE_TYPE (ptr_operand
);
4344 return cp_pointer_int_sum (location
, code
,
4356 case TRUNC_DIV_EXPR
:
4358 case FLOOR_DIV_EXPR
:
4359 case ROUND_DIV_EXPR
:
4360 case EXACT_DIV_EXPR
:
4361 if (TREE_CODE (op0
) == SIZEOF_EXPR
&& TREE_CODE (op1
) == SIZEOF_EXPR
)
4363 tree type0
= TREE_OPERAND (op0
, 0);
4364 tree type1
= TREE_OPERAND (op1
, 0);
4365 tree first_arg
= type0
;
4366 if (!TYPE_P (type0
))
4367 type0
= TREE_TYPE (type0
);
4368 if (!TYPE_P (type1
))
4369 type1
= TREE_TYPE (type1
);
4370 if (POINTER_TYPE_P (type0
) && same_type_p (TREE_TYPE (type0
), type1
)
4371 && !(TREE_CODE (first_arg
) == PARM_DECL
4372 && DECL_ARRAY_PARAMETER_P (first_arg
)
4373 && warn_sizeof_array_argument
)
4374 && (complain
& tf_warning
))
4375 if (warning_at (location
, OPT_Wsizeof_pointer_div
,
4376 "division %<sizeof (%T) / sizeof (%T)%> does "
4377 "not compute the number of array elements",
4379 if (DECL_P (first_arg
))
4380 inform (DECL_SOURCE_LOCATION (first_arg
),
4381 "first %<sizeof%> operand was declared here");
4384 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4385 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
4386 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4387 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
4389 enum tree_code tcode0
= code0
, tcode1
= code1
;
4390 tree cop1
= fold_non_dependent_expr (op1
);
4391 doing_div_or_mod
= true;
4392 warn_for_div_by_zero (location
, cop1
);
4394 if (tcode0
== COMPLEX_TYPE
|| tcode0
== VECTOR_TYPE
)
4395 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
4396 if (tcode1
== COMPLEX_TYPE
|| tcode1
== VECTOR_TYPE
)
4397 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
4399 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
4400 resultcode
= RDIV_EXPR
;
4402 /* When dividing two signed integers, we have to promote to int.
4403 unless we divide by a constant != -1. Note that default
4404 conversion will have been performed on the operands at this
4405 point, so we have to dig out the original type to find out if
4407 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4408 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4409 || (TREE_CODE (op1
) == INTEGER_CST
4410 && ! integer_all_onesp (op1
)));
4419 if ((code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4420 || (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4421 && !VECTOR_FLOAT_TYPE_P (type0
)
4422 && !VECTOR_FLOAT_TYPE_P (type1
)))
4426 case TRUNC_MOD_EXPR
:
4427 case FLOOR_MOD_EXPR
:
4429 tree cop1
= fold_non_dependent_expr (op1
);
4430 doing_div_or_mod
= true;
4431 warn_for_div_by_zero (location
, cop1
);
4434 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4435 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4436 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
4438 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4440 /* Although it would be tempting to shorten always here, that loses
4441 on some targets, since the modulo instruction is undefined if the
4442 quotient can't be represented in the computation mode. We shorten
4443 only if unsigned or if dividing by something we know != -1. */
4444 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
4445 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
4446 || (TREE_CODE (op1
) == INTEGER_CST
4447 && ! integer_all_onesp (op1
)));
4452 case TRUTH_ANDIF_EXPR
:
4453 case TRUTH_ORIF_EXPR
:
4454 case TRUTH_AND_EXPR
:
4456 if (!VECTOR_TYPE_P (type0
) && VECTOR_TYPE_P (type1
))
4458 if (!COMPARISON_CLASS_P (op1
))
4459 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4460 build_zero_cst (type1
), complain
);
4461 if (code
== TRUTH_ANDIF_EXPR
)
4463 tree z
= build_zero_cst (TREE_TYPE (op1
));
4464 return build_conditional_expr (location
, op0
, op1
, z
, complain
);
4466 else if (code
== TRUTH_ORIF_EXPR
)
4468 tree m1
= build_all_ones_cst (TREE_TYPE (op1
));
4469 return build_conditional_expr (location
, op0
, m1
, op1
, complain
);
4474 if (VECTOR_TYPE_P (type0
))
4476 if (!COMPARISON_CLASS_P (op0
))
4477 op0
= cp_build_binary_op (EXPR_LOCATION (op0
), NE_EXPR
, op0
,
4478 build_zero_cst (type0
), complain
);
4479 if (!VECTOR_TYPE_P (type1
))
4481 tree m1
= build_all_ones_cst (TREE_TYPE (op0
));
4482 tree z
= build_zero_cst (TREE_TYPE (op0
));
4483 op1
= build_conditional_expr (location
, op1
, m1
, z
, complain
);
4485 else if (!COMPARISON_CLASS_P (op1
))
4486 op1
= cp_build_binary_op (EXPR_LOCATION (op1
), NE_EXPR
, op1
,
4487 build_zero_cst (type1
), complain
);
4489 if (code
== TRUTH_ANDIF_EXPR
)
4490 code
= BIT_AND_EXPR
;
4491 else if (code
== TRUTH_ORIF_EXPR
)
4492 code
= BIT_IOR_EXPR
;
4496 return cp_build_binary_op (location
, code
, op0
, op1
, complain
);
4499 result_type
= boolean_type_node
;
4502 /* Shift operations: result has same type as first operand;
4503 always convert second operand to int.
4504 Also set SHORT_SHIFT if shifting rightward. */
4507 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4508 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4510 result_type
= type0
;
4513 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4514 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4515 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4516 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4518 result_type
= type0
;
4521 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4523 tree const_op1
= fold_non_dependent_expr (op1
);
4524 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4526 result_type
= type0
;
4528 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4530 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4532 if ((complain
& tf_warning
)
4533 && c_inhibit_evaluation_warnings
== 0)
4534 warning (OPT_Wshift_count_negative
,
4535 "right shift count is negative");
4539 if (compare_tree_int (const_op1
, TYPE_PRECISION (type0
)) >= 0
4540 && (complain
& tf_warning
)
4541 && c_inhibit_evaluation_warnings
== 0)
4542 warning (OPT_Wshift_count_overflow
,
4543 "right shift count >= width of type");
4546 /* Avoid converting op1 to result_type later. */
4552 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
4553 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
4555 result_type
= type0
;
4558 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
4559 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
4560 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
4561 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
4563 result_type
= type0
;
4566 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4568 tree const_op0
= fold_non_dependent_expr (op0
);
4569 if (TREE_CODE (const_op0
) != INTEGER_CST
)
4571 tree const_op1
= fold_non_dependent_expr (op1
);
4572 if (TREE_CODE (const_op1
) != INTEGER_CST
)
4574 result_type
= type0
;
4576 if (TREE_CODE (const_op0
) == INTEGER_CST
4577 && tree_int_cst_sgn (const_op0
) < 0
4578 && (complain
& tf_warning
)
4579 && c_inhibit_evaluation_warnings
== 0)
4580 warning (OPT_Wshift_negative_value
,
4581 "left shift of negative value");
4582 if (TREE_CODE (const_op1
) == INTEGER_CST
)
4584 if (tree_int_cst_lt (const_op1
, integer_zero_node
))
4586 if ((complain
& tf_warning
)
4587 && c_inhibit_evaluation_warnings
== 0)
4588 warning (OPT_Wshift_count_negative
,
4589 "left shift count is negative");
4591 else if (compare_tree_int (const_op1
,
4592 TYPE_PRECISION (type0
)) >= 0)
4594 if ((complain
& tf_warning
)
4595 && c_inhibit_evaluation_warnings
== 0)
4596 warning (OPT_Wshift_count_overflow
,
4597 "left shift count >= width of type");
4599 else if (TREE_CODE (const_op0
) == INTEGER_CST
4600 && (complain
& tf_warning
))
4601 maybe_warn_shift_overflow (location
, const_op0
, const_op1
);
4603 /* Avoid converting op1 to result_type later. */
4610 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
4612 result_type
= type0
;
4613 if (TREE_CODE (op1
) == INTEGER_CST
)
4615 if (tree_int_cst_lt (op1
, integer_zero_node
))
4617 if (complain
& tf_warning
)
4618 warning (0, (code
== LROTATE_EXPR
)
4619 ? G_("left rotate count is negative")
4620 : G_("right rotate count is negative"));
4622 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
4624 if (complain
& tf_warning
)
4625 warning (0, (code
== LROTATE_EXPR
)
4626 ? G_("left rotate count >= width of type")
4627 : G_("right rotate count >= width of type"));
4630 /* Convert the shift-count to an integer, regardless of
4631 size of value being shifted. */
4632 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
4633 op1
= cp_convert (integer_type_node
, op1
, complain
);
4639 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4640 goto vector_compare
;
4641 if ((complain
& tf_warning
)
4642 && (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
)))
4643 warning (OPT_Wfloat_equal
,
4644 "comparing floating point with == or != is unsafe");
4645 if ((complain
& tf_warning
)
4646 && ((TREE_CODE (orig_op0
) == STRING_CST
4647 && !integer_zerop (cp_fully_fold (op1
)))
4648 || (TREE_CODE (orig_op1
) == STRING_CST
4649 && !integer_zerop (cp_fully_fold (op0
)))))
4650 warning (OPT_Waddress
, "comparison with string literal results "
4651 "in unspecified behavior");
4653 build_type
= boolean_type_node
;
4654 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4655 || code0
== COMPLEX_TYPE
|| code0
== ENUMERAL_TYPE
)
4656 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4657 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
))
4659 else if (((code0
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type0
))
4660 && null_ptr_cst_p (orig_op1
))
4661 /* Handle, eg, (void*)0 (c++/43906), and more. */
4662 || (code0
== POINTER_TYPE
4663 && TYPE_PTR_P (type1
) && integer_zerop (op1
)))
4665 if (TYPE_PTR_P (type1
))
4666 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4667 CPO_COMPARISON
, complain
);
4669 result_type
= type0
;
4671 if (char_type_p (TREE_TYPE (orig_op1
))
4672 && warning (OPT_Wpointer_compare
,
4673 "comparison between pointer and zero character "
4675 inform (input_location
,
4676 "did you mean to dereference the pointer?");
4677 warn_for_null_address (location
, op0
, complain
);
4679 else if (((code1
== POINTER_TYPE
|| TYPE_PTRDATAMEM_P (type1
))
4680 && null_ptr_cst_p (orig_op0
))
4681 /* Handle, eg, (void*)0 (c++/43906), and more. */
4682 || (code1
== POINTER_TYPE
4683 && TYPE_PTR_P (type0
) && integer_zerop (op0
)))
4685 if (TYPE_PTR_P (type0
))
4686 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4687 CPO_COMPARISON
, complain
);
4689 result_type
= type1
;
4691 if (char_type_p (TREE_TYPE (orig_op0
))
4692 && warning (OPT_Wpointer_compare
,
4693 "comparison between pointer and zero character "
4695 inform (input_location
,
4696 "did you mean to dereference the pointer?");
4697 warn_for_null_address (location
, op1
, complain
);
4699 else if ((code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4700 || (TYPE_PTRDATAMEM_P (type0
) && TYPE_PTRDATAMEM_P (type1
)))
4701 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4702 CPO_COMPARISON
, complain
);
4703 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
4704 /* One of the operands must be of nullptr_t type. */
4705 result_type
= TREE_TYPE (nullptr_node
);
4706 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4708 result_type
= type0
;
4709 if (complain
& tf_error
)
4710 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4712 return error_mark_node
;
4714 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
4716 result_type
= type1
;
4717 if (complain
& tf_error
)
4718 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4720 return error_mark_node
;
4722 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (orig_op1
))
4724 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4725 == ptrmemfunc_vbit_in_delta
)
4727 tree pfn0
, delta0
, e1
, e2
;
4729 if (TREE_SIDE_EFFECTS (op0
))
4730 op0
= save_expr (op0
);
4732 pfn0
= pfn_from_ptrmemfunc (op0
);
4733 delta0
= delta_from_ptrmemfunc (op0
);
4734 e1
= cp_build_binary_op (location
,
4737 build_zero_cst (TREE_TYPE (pfn0
)),
4739 e2
= cp_build_binary_op (location
,
4745 if (complain
& tf_warning
)
4746 maybe_warn_zero_as_null_pointer_constant (op1
, input_location
);
4748 e2
= cp_build_binary_op (location
,
4749 EQ_EXPR
, e2
, integer_zero_node
,
4751 op0
= cp_build_binary_op (location
,
4752 TRUTH_ANDIF_EXPR
, e1
, e2
,
4754 op1
= cp_convert (TREE_TYPE (op0
), integer_one_node
, complain
);
4758 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
4759 op1
= cp_convert (TREE_TYPE (op0
), op1
, complain
);
4761 result_type
= TREE_TYPE (op0
);
4763 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (orig_op0
))
4764 return cp_build_binary_op (location
, code
, op1
, op0
, complain
);
4765 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
))
4768 /* E will be the final comparison. */
4770 /* E1 and E2 are for scratch. */
4778 type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4779 CPO_COMPARISON
, complain
);
4781 if (!same_type_p (TREE_TYPE (op0
), type
))
4782 op0
= cp_convert_and_check (type
, op0
, complain
);
4783 if (!same_type_p (TREE_TYPE (op1
), type
))
4784 op1
= cp_convert_and_check (type
, op1
, complain
);
4786 if (op0
== error_mark_node
|| op1
== error_mark_node
)
4787 return error_mark_node
;
4789 if (TREE_SIDE_EFFECTS (op0
))
4790 op0
= save_expr (op0
);
4791 if (TREE_SIDE_EFFECTS (op1
))
4792 op1
= save_expr (op1
);
4794 pfn0
= pfn_from_ptrmemfunc (op0
);
4795 pfn0
= cp_fully_fold (pfn0
);
4796 /* Avoid -Waddress warnings (c++/64877). */
4797 if (TREE_CODE (pfn0
) == ADDR_EXPR
)
4798 TREE_NO_WARNING (pfn0
) = 1;
4799 pfn1
= pfn_from_ptrmemfunc (op1
);
4800 pfn1
= cp_fully_fold (pfn1
);
4801 delta0
= delta_from_ptrmemfunc (op0
);
4802 delta1
= delta_from_ptrmemfunc (op1
);
4803 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4804 == ptrmemfunc_vbit_in_delta
)
4809 && ((op0.delta == op1.delta)
4810 || (!op0.pfn && op0.delta & 1 == 0
4811 && op1.delta & 1 == 0))
4813 The reason for the `!op0.pfn' bit is that a NULL
4814 pointer-to-member is any member with a zero PFN and
4815 LSB of the DELTA field is 0. */
4817 e1
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4821 e1
= cp_build_binary_op (location
,
4822 EQ_EXPR
, e1
, integer_zero_node
,
4824 e2
= cp_build_binary_op (location
, BIT_AND_EXPR
,
4828 e2
= cp_build_binary_op (location
,
4829 EQ_EXPR
, e2
, integer_zero_node
,
4831 e1
= cp_build_binary_op (location
,
4832 TRUTH_ANDIF_EXPR
, e2
, e1
,
4834 e2
= cp_build_binary_op (location
, EQ_EXPR
,
4836 build_zero_cst (TREE_TYPE (pfn0
)),
4838 e2
= cp_build_binary_op (location
,
4839 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4840 e1
= cp_build_binary_op (location
,
4841 EQ_EXPR
, delta0
, delta1
, complain
);
4842 e1
= cp_build_binary_op (location
,
4843 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4850 && (!op0.pfn || op0.delta == op1.delta))
4852 The reason for the `!op0.pfn' bit is that a NULL
4853 pointer-to-member is any member with a zero PFN; the
4854 DELTA field is unspecified. */
4856 e1
= cp_build_binary_op (location
,
4857 EQ_EXPR
, delta0
, delta1
, complain
);
4858 e2
= cp_build_binary_op (location
,
4861 build_zero_cst (TREE_TYPE (pfn0
)),
4863 e1
= cp_build_binary_op (location
,
4864 TRUTH_ORIF_EXPR
, e1
, e2
, complain
);
4866 e2
= build2 (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
4867 e
= cp_build_binary_op (location
,
4868 TRUTH_ANDIF_EXPR
, e2
, e1
, complain
);
4869 if (code
== EQ_EXPR
)
4871 return cp_build_binary_op (location
,
4872 EQ_EXPR
, e
, integer_zero_node
, complain
);
4876 gcc_assert (!TYPE_PTRMEMFUNC_P (type0
)
4877 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
),
4879 gcc_assert (!TYPE_PTRMEMFUNC_P (type1
)
4880 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
),
4888 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
4889 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
4891 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4892 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4893 CPO_COMPARISON
, complain
);
4900 if (TREE_CODE (orig_op0
) == STRING_CST
4901 || TREE_CODE (orig_op1
) == STRING_CST
)
4903 if (complain
& tf_warning
)
4904 warning (OPT_Waddress
, "comparison with string literal results "
4905 "in unspecified behavior");
4908 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
4912 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0
),
4914 && !vector_types_compatible_elements_p (type0
, type1
))
4916 if (complain
& tf_error
)
4918 error_at (location
, "comparing vectors with different "
4920 inform (location
, "operand types are %qT and %qT",
4923 return error_mark_node
;
4926 if (TYPE_VECTOR_SUBPARTS (type0
) != TYPE_VECTOR_SUBPARTS (type1
))
4928 if (complain
& tf_error
)
4930 error_at (location
, "comparing vectors with different "
4931 "number of elements");
4932 inform (location
, "operand types are %qT and %qT",
4935 return error_mark_node
;
4938 /* It's not precisely specified how the usual arithmetic
4939 conversions apply to the vector types. Here, we use
4940 the unsigned type if one of the operands is signed and
4941 the other one is unsigned. */
4942 if (TYPE_UNSIGNED (type0
) != TYPE_UNSIGNED (type1
))
4944 if (!TYPE_UNSIGNED (type0
))
4945 op0
= build1 (VIEW_CONVERT_EXPR
, type1
, op0
);
4947 op1
= build1 (VIEW_CONVERT_EXPR
, type0
, op1
);
4948 warning_at (location
, OPT_Wsign_compare
, "comparison between "
4949 "types %qT and %qT", type0
, type1
);
4952 /* Always construct signed integer vector type. */
4953 intt
= c_common_type_for_size (GET_MODE_BITSIZE
4954 (TYPE_MODE (TREE_TYPE (type0
))), 0);
4957 if (complain
& tf_error
)
4958 error_at (location
, "could not find an integer type "
4959 "of the same size as %qT", TREE_TYPE (type0
));
4960 return error_mark_node
;
4962 result_type
= build_opaque_vector_type (intt
,
4963 TYPE_VECTOR_SUBPARTS (type0
));
4965 return build_vec_cmp (resultcode
, result_type
, op0
, op1
);
4967 build_type
= boolean_type_node
;
4968 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
4969 || code0
== ENUMERAL_TYPE
)
4970 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4971 || code1
== ENUMERAL_TYPE
))
4973 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
4974 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
4975 CPO_COMPARISON
, complain
);
4976 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (orig_op1
))
4978 result_type
= type0
;
4979 if (extra_warnings
&& (complain
& tf_warning
))
4980 warning (OPT_Wextra
,
4981 "ordered comparison of pointer with integer zero");
4983 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (orig_op0
))
4985 result_type
= type1
;
4986 if (extra_warnings
&& (complain
& tf_warning
))
4987 warning (OPT_Wextra
,
4988 "ordered comparison of pointer with integer zero");
4990 else if (null_ptr_cst_p (orig_op0
) && null_ptr_cst_p (orig_op1
))
4991 /* One of the operands must be of nullptr_t type. */
4992 result_type
= TREE_TYPE (nullptr_node
);
4993 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4995 result_type
= type0
;
4996 if (complain
& tf_error
)
4997 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
4999 return error_mark_node
;
5001 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
5003 result_type
= type1
;
5004 if (complain
& tf_error
)
5005 permerror (input_location
, "ISO C++ forbids comparison between pointer and integer");
5007 return error_mark_node
;
5011 case UNORDERED_EXPR
:
5018 build_type
= integer_type_node
;
5019 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
5021 if (complain
& tf_error
)
5022 error ("unordered comparison on non-floating point argument");
5023 return error_mark_node
;
5032 if (((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
5033 || code0
== ENUMERAL_TYPE
)
5034 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
5035 || code1
== COMPLEX_TYPE
|| code1
== ENUMERAL_TYPE
)))
5036 arithmetic_types_p
= 1;
5039 arithmetic_types_p
= 0;
5040 /* Vector arithmetic is only allowed when both sides are vectors. */
5041 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
5043 if (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
5044 || !vector_types_compatible_elements_p (type0
, type1
))
5046 if (complain
& tf_error
)
5048 /* "location" already embeds the locations of the
5049 operands, so we don't need to add them separately
5051 rich_location
richloc (line_table
, location
);
5052 binary_op_error (&richloc
, code
, type0
, type1
);
5054 return error_mark_node
;
5056 arithmetic_types_p
= 1;
5059 /* Determine the RESULT_TYPE, if it is not already known. */
5061 && arithmetic_types_p
5062 && (shorten
|| common
|| short_compare
))
5064 result_type
= cp_common_type (type0
, type1
);
5065 if (complain
& tf_warning
)
5066 do_warn_double_promotion (result_type
, type0
, type1
,
5067 "implicit conversion from %qH to %qI "
5068 "to match other operand of binary "
5075 if (complain
& tf_error
)
5077 "invalid operands of types %qT and %qT to binary %qO",
5078 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
5079 return error_mark_node
;
5082 /* If we're in a template, the only thing we need to know is the
5084 if (processing_template_decl
)
5086 /* Since the middle-end checks the type when doing a build2, we
5087 need to build the tree in pieces. This built tree will never
5088 get out of the front-end as we replace it when instantiating
5090 tree tmp
= build2 (resultcode
,
5091 build_type
? build_type
: result_type
,
5093 TREE_OPERAND (tmp
, 0) = op0
;
5097 /* Remember the original type; RESULT_TYPE might be changed later on
5098 by shorten_binary_op. */
5099 tree orig_type
= result_type
;
5101 if (arithmetic_types_p
)
5103 bool first_complex
= (code0
== COMPLEX_TYPE
);
5104 bool second_complex
= (code1
== COMPLEX_TYPE
);
5105 int none_complex
= (!first_complex
&& !second_complex
);
5107 /* Adapted from patch for c/24581. */
5108 if (first_complex
!= second_complex
5109 && (code
== PLUS_EXPR
5110 || code
== MINUS_EXPR
5111 || code
== MULT_EXPR
5112 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
5113 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
5114 && flag_signed_zeros
)
5116 /* An operation on mixed real/complex operands must be
5117 handled specially, but the language-independent code can
5118 more easily optimize the plain complex arithmetic if
5119 -fno-signed-zeros. */
5120 tree real_type
= TREE_TYPE (result_type
);
5124 if (TREE_TYPE (op0
) != result_type
)
5125 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5126 if (TREE_TYPE (op1
) != real_type
)
5127 op1
= cp_convert_and_check (real_type
, op1
, complain
);
5131 if (TREE_TYPE (op0
) != real_type
)
5132 op0
= cp_convert_and_check (real_type
, op0
, complain
);
5133 if (TREE_TYPE (op1
) != result_type
)
5134 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5136 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
5137 return error_mark_node
;
5140 op0
= save_expr (op0
);
5141 real
= cp_build_unary_op (REALPART_EXPR
, op0
, true, complain
);
5142 imag
= cp_build_unary_op (IMAGPART_EXPR
, op0
, true, complain
);
5146 case TRUNC_DIV_EXPR
:
5147 op1
= save_expr (op1
);
5148 imag
= build2 (resultcode
, real_type
, imag
, op1
);
5152 real
= build2 (resultcode
, real_type
, real
, op1
);
5160 op1
= save_expr (op1
);
5161 real
= cp_build_unary_op (REALPART_EXPR
, op1
, true, complain
);
5162 imag
= cp_build_unary_op (IMAGPART_EXPR
, op1
, true, complain
);
5166 op0
= save_expr (op0
);
5167 imag
= build2 (resultcode
, real_type
, op0
, imag
);
5170 real
= build2 (resultcode
, real_type
, op0
, real
);
5173 real
= build2 (resultcode
, real_type
, op0
, real
);
5174 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
5180 result
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
5184 /* For certain operations (which identify themselves by shorten != 0)
5185 if both args were extended from the same smaller type,
5186 do the arithmetic in that type and then extend.
5188 shorten !=0 and !=1 indicates a bitwise operation.
5189 For them, this optimization is safe only if
5190 both args are zero-extended or both are sign-extended.
5191 Otherwise, we might change the result.
5192 E.g., (short)-1 | (unsigned short)-1 is (int)-1
5193 but calculated in (unsigned short) it would be (unsigned short)-1. */
5195 if (shorten
&& none_complex
)
5197 final_type
= result_type
;
5198 result_type
= shorten_binary_op (result_type
, op0
, op1
,
5202 /* Comparison operations are shortened too but differently.
5203 They identify themselves by setting short_compare = 1. */
5207 /* We call shorten_compare only for diagnostic-reason. */
5208 tree xop0
= fold_simple (op0
), xop1
= fold_simple (op1
),
5209 xresult_type
= result_type
;
5210 enum tree_code xresultcode
= resultcode
;
5211 shorten_compare (location
, &xop0
, &xop1
, &xresult_type
,
5215 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
5216 && warn_sign_compare
5217 /* Do not warn until the template is instantiated; we cannot
5218 bound the ranges of the arguments until that point. */
5219 && !processing_template_decl
5220 && (complain
& tf_warning
)
5221 && c_inhibit_evaluation_warnings
== 0
5222 /* Even unsigned enum types promote to signed int. We don't
5223 want to issue -Wsign-compare warnings for this case. */
5224 && !enum_cast_to_int (orig_op0
)
5225 && !enum_cast_to_int (orig_op1
))
5227 tree oop0
= maybe_constant_value (orig_op0
);
5228 tree oop1
= maybe_constant_value (orig_op1
);
5230 if (TREE_CODE (oop0
) != INTEGER_CST
)
5231 oop0
= cp_fully_fold (orig_op0
);
5232 if (TREE_CODE (oop1
) != INTEGER_CST
)
5233 oop1
= cp_fully_fold (orig_op1
);
5234 warn_for_sign_compare (location
, oop0
, oop1
, op0
, op1
,
5235 result_type
, resultcode
);
5239 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
5240 Then the expression will be built.
5241 It will be given type FINAL_TYPE if that is nonzero;
5242 otherwise, it will be given type RESULT_TYPE. */
5245 if (TREE_TYPE (op0
) != result_type
)
5246 op0
= cp_convert_and_check (result_type
, op0
, complain
);
5247 if (TREE_TYPE (op1
) != result_type
)
5248 op1
= cp_convert_and_check (result_type
, op1
, complain
);
5250 if (op0
== error_mark_node
|| op1
== error_mark_node
)
5251 return error_mark_node
;
5254 if (build_type
== NULL_TREE
)
5255 build_type
= result_type
;
5257 if (sanitize_flags_p ((SANITIZE_SHIFT
5258 | SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5259 && !processing_template_decl
5260 && (doing_div_or_mod
|| doing_shift
))
5262 /* OP0 and/or OP1 might have side-effects. */
5263 op0
= cp_save_expr (op0
);
5264 op1
= cp_save_expr (op1
);
5265 op0
= fold_non_dependent_expr (op0
);
5266 op1
= fold_non_dependent_expr (op1
);
5267 if (doing_div_or_mod
5268 && sanitize_flags_p (SANITIZE_DIVIDE
| SANITIZE_FLOAT_DIVIDE
))
5270 /* For diagnostics we want to use the promoted types without
5271 shorten_binary_op. So convert the arguments to the
5272 original result_type. */
5275 if (TREE_TYPE (cop0
) != orig_type
)
5276 cop0
= cp_convert (orig_type
, op0
, complain
);
5277 if (TREE_TYPE (cop1
) != orig_type
)
5278 cop1
= cp_convert (orig_type
, op1
, complain
);
5279 instrument_expr
= ubsan_instrument_division (location
, cop0
, cop1
);
5281 else if (doing_shift
&& sanitize_flags_p (SANITIZE_SHIFT
))
5282 instrument_expr
= ubsan_instrument_shift (location
, code
, op0
, op1
);
5285 result
= build2_loc (location
, resultcode
, build_type
, op0
, op1
);
5286 if (final_type
!= 0)
5287 result
= cp_convert (final_type
, result
, complain
);
5289 if (instrument_expr
!= NULL
)
5290 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
),
5291 instrument_expr
, result
);
5293 if (!processing_template_decl
)
5295 op0
= cp_fully_fold (op0
);
5296 /* Only consider the second argument if the first isn't overflowed. */
5297 if (!CONSTANT_CLASS_P (op0
) || TREE_OVERFLOW_P (op0
))
5299 op1
= cp_fully_fold (op1
);
5300 if (!CONSTANT_CLASS_P (op1
) || TREE_OVERFLOW_P (op1
))
5303 else if (!CONSTANT_CLASS_P (op0
) || !CONSTANT_CLASS_P (op1
)
5304 || TREE_OVERFLOW_P (op0
) || TREE_OVERFLOW_P (op1
))
5307 result_ovl
= fold_build2 (resultcode
, build_type
, op0
, op1
);
5308 if (TREE_OVERFLOW_P (result_ovl
))
5309 overflow_warning (location
, result_ovl
);
5314 /* Build a VEC_PERM_EXPR.
5315 This is a simple wrapper for c_build_vec_perm_expr. */
5317 build_x_vec_perm_expr (location_t loc
,
5318 tree arg0
, tree arg1
, tree arg2
,
5319 tsubst_flags_t complain
)
5321 tree orig_arg0
= arg0
;
5322 tree orig_arg1
= arg1
;
5323 tree orig_arg2
= arg2
;
5324 if (processing_template_decl
)
5326 if (type_dependent_expression_p (arg0
)
5327 || type_dependent_expression_p (arg1
)
5328 || type_dependent_expression_p (arg2
))
5329 return build_min_nt_loc (loc
, VEC_PERM_EXPR
, arg0
, arg1
, arg2
);
5330 arg0
= build_non_dependent_expr (arg0
);
5332 arg1
= build_non_dependent_expr (arg1
);
5333 arg2
= build_non_dependent_expr (arg2
);
5335 tree exp
= c_build_vec_perm_expr (loc
, arg0
, arg1
, arg2
, complain
& tf_error
);
5336 if (processing_template_decl
&& exp
!= error_mark_node
)
5337 return build_min_non_dep (VEC_PERM_EXPR
, exp
, orig_arg0
,
5338 orig_arg1
, orig_arg2
);
5342 /* Return a tree for the sum or difference (RESULTCODE says which)
5343 of pointer PTROP and integer INTOP. */
5346 cp_pointer_int_sum (location_t loc
, enum tree_code resultcode
, tree ptrop
,
5347 tree intop
, tsubst_flags_t complain
)
5349 tree res_type
= TREE_TYPE (ptrop
);
5351 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5352 in certain circumstance (when it's valid to do so). So we need
5353 to make sure it's complete. We don't need to check here, if we
5354 can actually complete it at all, as those checks will be done in
5355 pointer_int_sum() anyway. */
5356 complete_type (TREE_TYPE (res_type
));
5358 return pointer_int_sum (loc
, resultcode
, ptrop
,
5359 intop
, complain
& tf_warning_or_error
);
5362 /* Return a tree for the difference of pointers OP0 and OP1.
5363 The resulting tree has type int. */
5366 pointer_diff (location_t loc
, tree op0
, tree op1
, tree ptrtype
,
5367 tsubst_flags_t complain
)
5370 tree restype
= ptrdiff_type_node
;
5371 tree target_type
= TREE_TYPE (ptrtype
);
5373 if (!complete_type_or_else (target_type
, NULL_TREE
))
5374 return error_mark_node
;
5376 if (VOID_TYPE_P (target_type
))
5378 if (complain
& tf_error
)
5379 permerror (loc
, "ISO C++ forbids using pointer of "
5380 "type %<void *%> in subtraction");
5382 return error_mark_node
;
5384 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
5386 if (complain
& tf_error
)
5387 permerror (loc
, "ISO C++ forbids using pointer to "
5388 "a function in subtraction");
5390 return error_mark_node
;
5392 if (TREE_CODE (target_type
) == METHOD_TYPE
)
5394 if (complain
& tf_error
)
5395 permerror (loc
, "ISO C++ forbids using pointer to "
5396 "a method in subtraction");
5398 return error_mark_node
;
5401 /* First do the subtraction as integers;
5402 then drop through to build the divide operator. */
5404 op0
= cp_build_binary_op (loc
,
5406 cp_convert (restype
, op0
, complain
),
5407 cp_convert (restype
, op1
, complain
),
5410 /* This generates an error if op1 is a pointer to an incomplete type. */
5411 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
5413 if (complain
& tf_error
)
5414 error_at (loc
, "invalid use of a pointer to an incomplete type in "
5415 "pointer arithmetic");
5417 return error_mark_node
;
5420 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1
)))
5422 if (complain
& tf_error
)
5423 error_at (loc
, "arithmetic on pointer to an empty aggregate");
5425 return error_mark_node
;
5428 op1
= (TYPE_PTROB_P (ptrtype
)
5429 ? size_in_bytes_loc (loc
, target_type
)
5430 : integer_one_node
);
5432 /* Do the division. */
5434 result
= build2_loc (loc
, EXACT_DIV_EXPR
, restype
, op0
,
5435 cp_convert (restype
, op1
, complain
));
5439 /* Construct and perhaps optimize a tree representation
5440 for a unary operation. CODE, a tree_code, specifies the operation
5441 and XARG is the operand. */
5444 build_x_unary_op (location_t loc
, enum tree_code code
, cp_expr xarg
,
5445 tsubst_flags_t complain
)
5447 tree orig_expr
= xarg
;
5450 tree overload
= NULL_TREE
;
5452 if (processing_template_decl
)
5454 if (type_dependent_expression_p (xarg
))
5455 return build_min_nt_loc (loc
, code
, xarg
.get_value (), NULL_TREE
);
5457 xarg
= build_non_dependent_expr (xarg
);
5462 /* [expr.unary.op] says:
5464 The address of an object of incomplete type can be taken.
5466 (And is just the ordinary address operator, not an overloaded
5467 "operator &".) However, if the type is a template
5468 specialization, we must complete the type at this point so that
5469 an overloaded "operator &" will be available if required. */
5470 if (code
== ADDR_EXPR
5471 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
5472 && ((CLASS_TYPE_P (TREE_TYPE (xarg
))
5473 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg
))))
5474 || (TREE_CODE (xarg
) == OFFSET_REF
)))
5475 /* Don't look for a function. */;
5477 exp
= build_new_op (loc
, code
, LOOKUP_NORMAL
, xarg
, NULL_TREE
,
5478 NULL_TREE
, &overload
, complain
);
5480 if (!exp
&& code
== ADDR_EXPR
)
5482 if (is_overloaded_fn (xarg
))
5484 tree fn
= get_first_fn (xarg
);
5485 if (DECL_CONSTRUCTOR_P (fn
) || DECL_DESTRUCTOR_P (fn
))
5487 if (complain
& tf_error
)
5488 error (DECL_CONSTRUCTOR_P (fn
)
5489 ? G_("taking address of constructor %qE")
5490 : G_("taking address of destructor %qE"),
5492 return error_mark_node
;
5496 /* A pointer to member-function can be formed only by saying
5498 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
5499 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
5501 if (TREE_CODE (xarg
) != OFFSET_REF
5502 || !TYPE_P (TREE_OPERAND (xarg
, 0)))
5504 if (complain
& tf_error
)
5506 error ("invalid use of %qE to form a "
5507 "pointer-to-member-function", xarg
.get_value ());
5508 if (TREE_CODE (xarg
) != OFFSET_REF
)
5509 inform (input_location
, " a qualified-id is required");
5511 return error_mark_node
;
5515 if (complain
& tf_error
)
5516 error ("parentheses around %qE cannot be used to form a"
5517 " pointer-to-member-function",
5520 return error_mark_node
;
5521 PTRMEM_OK_P (xarg
) = 1;
5525 if (TREE_CODE (xarg
) == OFFSET_REF
)
5527 ptrmem
= PTRMEM_OK_P (xarg
);
5529 if (!ptrmem
&& !flag_ms_extensions
5530 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
5532 /* A single non-static member, make sure we don't allow a
5533 pointer-to-member. */
5534 xarg
= build2 (OFFSET_REF
, TREE_TYPE (xarg
),
5535 TREE_OPERAND (xarg
, 0),
5536 ovl_make (TREE_OPERAND (xarg
, 1)));
5537 PTRMEM_OK_P (xarg
) = ptrmem
;
5541 exp
= cp_build_addr_expr_strict (xarg
, complain
);
5544 if (processing_template_decl
&& exp
!= error_mark_node
)
5546 if (overload
!= NULL_TREE
)
5547 return (build_min_non_dep_op_overload
5548 (code
, exp
, overload
, orig_expr
, integer_zero_node
));
5550 exp
= build_min_non_dep (code
, exp
, orig_expr
,
5551 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE
);
5553 if (TREE_CODE (exp
) == ADDR_EXPR
)
5554 PTRMEM_OK_P (exp
) = ptrmem
;
5558 /* Construct and perhaps optimize a tree representation
5559 for __builtin_addressof operation. ARG specifies the operand. */
5562 cp_build_addressof (location_t loc
, tree arg
, tsubst_flags_t complain
)
5564 tree orig_expr
= arg
;
5566 if (processing_template_decl
)
5568 if (type_dependent_expression_p (arg
))
5569 return build_min_nt_loc (loc
, ADDRESSOF_EXPR
, arg
, NULL_TREE
);
5571 arg
= build_non_dependent_expr (arg
);
5574 tree exp
= cp_build_addr_expr_strict (arg
, complain
);
5576 if (processing_template_decl
&& exp
!= error_mark_node
)
5577 exp
= build_min_non_dep (ADDRESSOF_EXPR
, exp
, orig_expr
, NULL_TREE
);
5581 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5582 constants, where a null value is represented by an INTEGER_CST of
5586 cp_truthvalue_conversion (tree expr
)
5588 tree type
= TREE_TYPE (expr
);
5589 if (TYPE_PTR_OR_PTRMEM_P (type
)
5590 /* Avoid ICE on invalid use of non-static member function. */
5591 || TREE_CODE (expr
) == FUNCTION_DECL
)
5592 return build_binary_op (input_location
, NE_EXPR
, expr
, nullptr_node
, 1);
5594 return c_common_truthvalue_conversion (input_location
, expr
);
5597 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5600 condition_conversion (tree expr
)
5603 if (processing_template_decl
)
5605 t
= perform_implicit_conversion_flags (boolean_type_node
, expr
,
5606 tf_warning_or_error
, LOOKUP_NORMAL
);
5607 t
= fold_build_cleanup_point_expr (boolean_type_node
, t
);
5611 /* Returns the address of T. This function will fold away
5612 ADDR_EXPR of INDIRECT_REF. */
5615 build_address (tree t
)
5617 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
5618 return error_mark_node
;
5619 gcc_checking_assert (TREE_CODE (t
) != CONSTRUCTOR
);
5620 t
= build_fold_addr_expr (t
);
5621 if (TREE_CODE (t
) != ADDR_EXPR
)
5626 /* Return a NOP_EXPR converting EXPR to TYPE. */
5629 build_nop (tree type
, tree expr
)
5631 if (type
== error_mark_node
|| error_operand_p (expr
))
5633 return build1_loc (EXPR_LOCATION (expr
), NOP_EXPR
, type
, expr
);
5636 /* Take the address of ARG, whatever that means under C++ semantics.
5637 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5638 and class rvalues as well.
5640 Nothing should call this function directly; instead, callers should use
5641 cp_build_addr_expr or cp_build_addr_expr_strict. */
5644 cp_build_addr_expr_1 (tree arg
, bool strict_lvalue
, tsubst_flags_t complain
)
5649 if (!arg
|| error_operand_p (arg
))
5650 return error_mark_node
;
5652 arg
= mark_lvalue_use (arg
);
5653 argtype
= lvalue_type (arg
);
5655 gcc_assert (!(identifier_p (arg
) && IDENTIFIER_ANY_OP_P (arg
)));
5657 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
5658 && !really_overloaded_fn (arg
))
5660 /* They're trying to take the address of a unique non-static
5661 member function. This is ill-formed (except in MS-land),
5662 but let's try to DTRT.
5663 Note: We only handle unique functions here because we don't
5664 want to complain if there's a static overload; non-unique
5665 cases will be handled by instantiate_type. But we need to
5666 handle this case here to allow casts on the resulting PMF.
5667 We could defer this in non-MS mode, but it's easier to give
5668 a useful error here. */
5670 /* Inside constant member functions, the `this' pointer
5671 contains an extra const qualifier. TYPE_MAIN_VARIANT
5672 is used here to remove this const from the diagnostics
5673 and the created OFFSET_REF. */
5674 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
5675 tree fn
= get_first_fn (TREE_OPERAND (arg
, 1));
5676 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5677 return error_mark_node
;
5679 if (! flag_ms_extensions
)
5681 tree name
= DECL_NAME (fn
);
5682 if (!(complain
& tf_error
))
5683 return error_mark_node
;
5684 else if (current_class_type
5685 && TREE_OPERAND (arg
, 0) == current_class_ref
)
5686 /* An expression like &memfn. */
5687 permerror (input_location
, "ISO C++ forbids taking the address of an unqualified"
5688 " or parenthesized non-static member function to form"
5689 " a pointer to member function. Say %<&%T::%D%>",
5692 permerror (input_location
, "ISO C++ forbids taking the address of a bound member"
5693 " function to form a pointer to member function."
5697 arg
= build_offset_ref (base
, fn
, /*address_p=*/true, complain
);
5700 /* Uninstantiated types are all functions. Taking the
5701 address of a function is a no-op, so just return the
5703 if (type_unknown_p (arg
))
5704 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
5706 if (TREE_CODE (arg
) == OFFSET_REF
)
5707 /* We want a pointer to member; bypass all the code for actually taking
5708 the address of something. */
5711 /* Anything not already handled and not a true memory reference
5713 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5714 && TREE_CODE (argtype
) != METHOD_TYPE
)
5716 cp_lvalue_kind kind
= lvalue_kind (arg
);
5717 if (kind
== clk_none
)
5719 if (complain
& tf_error
)
5720 lvalue_error (input_location
, lv_addressof
);
5721 return error_mark_node
;
5723 if (strict_lvalue
&& (kind
& (clk_rvalueref
|clk_class
)))
5725 if (!(complain
& tf_error
))
5726 return error_mark_node
;
5727 if (kind
& clk_class
)
5728 /* Make this a permerror because we used to accept it. */
5729 permerror (input_location
, "taking address of temporary");
5731 error ("taking address of xvalue (rvalue reference)");
5735 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
5737 tree type
= build_pointer_type (TREE_TYPE (argtype
));
5738 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5741 else if (pedantic
&& DECL_MAIN_P (arg
))
5744 /* Apparently a lot of autoconf scripts for C++ packages do this,
5745 so only complain if -Wpedantic. */
5746 if (complain
& (flag_pedantic_errors
? tf_error
: tf_warning
))
5747 pedwarn (input_location
, OPT_Wpedantic
,
5748 "ISO C++ forbids taking address of function %<::main%>");
5749 else if (flag_pedantic_errors
)
5750 return error_mark_node
;
5753 /* Let &* cancel out to simplify resulting code. */
5754 if (INDIRECT_REF_P (arg
))
5756 arg
= TREE_OPERAND (arg
, 0);
5757 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
5759 tree type
= build_pointer_type (TREE_TYPE (TREE_TYPE (arg
)));
5760 arg
= build1 (CONVERT_EXPR
, type
, arg
);
5763 /* Don't let this be an lvalue. */
5768 /* ??? Cope with user tricks that amount to offsetof. */
5769 if (TREE_CODE (argtype
) != FUNCTION_TYPE
5770 && TREE_CODE (argtype
) != METHOD_TYPE
5771 && argtype
!= unknown_type_node
5772 && (val
= get_base_address (arg
))
5773 && COMPLETE_TYPE_P (TREE_TYPE (val
))
5774 && INDIRECT_REF_P (val
)
5775 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
5777 tree type
= build_pointer_type (argtype
);
5778 return fold_convert (type
, fold_offsetof_1 (arg
));
5781 /* Handle complex lvalues (when permitted)
5782 by reduction to simpler cases. */
5783 val
= unary_complex_lvalue (ADDR_EXPR
, arg
);
5787 switch (TREE_CODE (arg
))
5791 case FIX_TRUNC_EXPR
:
5792 /* We should have handled this above in the lvalue_kind check. */
5797 arg
= BASELINK_FUNCTIONS (arg
);
5801 arg
= OVL_FIRST (arg
);
5806 /* Turn a reference to a non-static data member into a
5807 pointer-to-member. */
5812 gcc_assert (PTRMEM_OK_P (arg
));
5814 t
= TREE_OPERAND (arg
, 1);
5815 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
5817 if (complain
& tf_error
)
5818 error ("cannot create pointer to reference member %qD", t
);
5819 return error_mark_node
;
5822 type
= build_ptrmem_type (context_for_name_lookup (t
),
5824 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
5832 if (argtype
!= error_mark_node
)
5833 argtype
= build_pointer_type (argtype
);
5835 if (bitfield_p (arg
))
5837 if (complain
& tf_error
)
5838 error ("attempt to take address of bit-field");
5839 return error_mark_node
;
5842 /* In a template, we are processing a non-dependent expression
5843 so we can just form an ADDR_EXPR with the correct type. */
5844 if (processing_template_decl
|| TREE_CODE (arg
) != COMPONENT_REF
)
5846 val
= build_address (arg
);
5847 if (TREE_CODE (arg
) == OFFSET_REF
)
5848 PTRMEM_OK_P (val
) = PTRMEM_OK_P (arg
);
5850 else if (BASELINK_P (TREE_OPERAND (arg
, 1)))
5852 tree fn
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
5854 /* We can only get here with a single static member
5856 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
5857 && DECL_STATIC_FUNCTION_P (fn
));
5858 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
5859 return error_mark_node
;
5860 val
= build_address (fn
);
5861 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg
, 0)))
5862 /* Do not lose object's side effects. */
5863 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (val
),
5864 TREE_OPERAND (arg
, 0), val
);
5868 tree object
= TREE_OPERAND (arg
, 0);
5869 tree field
= TREE_OPERAND (arg
, 1);
5870 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5871 (TREE_TYPE (object
), decl_type_context (field
)));
5872 val
= build_address (arg
);
5875 if (TYPE_PTR_P (argtype
)
5876 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
5878 build_ptrmemfunc_type (argtype
);
5879 val
= build_ptrmemfunc (argtype
, val
, 0,
5887 /* Take the address of ARG if it has one, even if it's an rvalue. */
5890 cp_build_addr_expr (tree arg
, tsubst_flags_t complain
)
5892 return cp_build_addr_expr_1 (arg
, 0, complain
);
5895 /* Take the address of ARG, but only if it's an lvalue. */
5898 cp_build_addr_expr_strict (tree arg
, tsubst_flags_t complain
)
5900 return cp_build_addr_expr_1 (arg
, 1, complain
);
5903 /* C++: Must handle pointers to members.
5905 Perhaps type instantiation should be extended to handle conversion
5906 from aggregates to types we don't yet know we want? (Or are those
5907 cases typically errors which should be reported?)
5909 NOCONVERT suppresses the default promotions (such as from short to int). */
5912 cp_build_unary_op (enum tree_code code
, tree xarg
, bool noconvert
,
5913 tsubst_flags_t complain
)
5915 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5917 location_t location
= EXPR_LOC_OR_LOC (arg
, input_location
);
5919 const char *errstring
= NULL
;
5921 const char *invalid_op_diag
;
5923 if (!arg
|| error_operand_p (arg
))
5924 return error_mark_node
;
5926 if ((invalid_op_diag
5927 = targetm
.invalid_unary_op ((code
== UNARY_PLUS_EXPR
5932 if (complain
& tf_error
)
5933 error (invalid_op_diag
);
5934 return error_mark_node
;
5939 case UNARY_PLUS_EXPR
:
5942 int flags
= WANT_ARITH
| WANT_ENUM
;
5943 /* Unary plus (but not unary minus) is allowed on pointers. */
5944 if (code
== UNARY_PLUS_EXPR
)
5945 flags
|= WANT_POINTER
;
5946 arg
= build_expr_type_conversion (flags
, arg
, true);
5948 errstring
= (code
== NEGATE_EXPR
5949 ? _("wrong type argument to unary minus")
5950 : _("wrong type argument to unary plus"));
5953 if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5954 arg
= cp_perform_integral_promotions (arg
, complain
);
5956 /* Make sure the result is not an lvalue: a unary plus or minus
5957 expression is always a rvalue. */
5964 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
5969 arg
= cp_default_conversion (arg
, complain
);
5970 if (arg
== error_mark_node
)
5971 return error_mark_node
;
5974 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
5975 | WANT_VECTOR_OR_COMPLEX
,
5977 errstring
= _("wrong type argument to bit-complement");
5978 else if (!noconvert
&& CP_INTEGRAL_TYPE_P (TREE_TYPE (arg
)))
5980 /* Warn if the expression has boolean value. */
5981 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
5982 && warning_at (location
, OPT_Wbool_operation
,
5983 "%<~%> on an expression of type bool"))
5984 inform (location
, "did you mean to use logical not (%<!%>)?");
5985 arg
= cp_perform_integral_promotions (arg
, complain
);
5987 else if (!noconvert
&& VECTOR_TYPE_P (TREE_TYPE (arg
)))
5988 arg
= mark_rvalue_use (arg
);
5992 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
5993 errstring
= _("wrong type argument to abs");
5994 else if (!noconvert
)
5996 arg
= cp_default_conversion (arg
, complain
);
5997 if (arg
== error_mark_node
)
5998 return error_mark_node
;
6003 /* Conjugating a real value is a no-op, but allow it anyway. */
6004 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
6005 errstring
= _("wrong type argument to conjugation");
6006 else if (!noconvert
)
6008 arg
= cp_default_conversion (arg
, complain
);
6009 if (arg
== error_mark_node
)
6010 return error_mark_node
;
6014 case TRUTH_NOT_EXPR
:
6015 if (VECTOR_TYPE_P (TREE_TYPE (arg
)))
6016 return cp_build_binary_op (input_location
, EQ_EXPR
, arg
,
6017 build_zero_cst (TREE_TYPE (arg
)), complain
);
6018 arg
= perform_implicit_conversion (boolean_type_node
, arg
,
6020 val
= invert_truthvalue_loc (input_location
, arg
);
6021 if (arg
!= error_mark_node
)
6023 errstring
= _("in argument to unary !");
6031 arg
= build_real_imag_expr (input_location
, code
, arg
);
6034 case PREINCREMENT_EXPR
:
6035 case POSTINCREMENT_EXPR
:
6036 case PREDECREMENT_EXPR
:
6037 case POSTDECREMENT_EXPR
:
6038 /* Handle complex lvalues (when permitted)
6039 by reduction to simpler cases. */
6041 val
= unary_complex_lvalue (code
, arg
);
6045 arg
= mark_lvalue_use (arg
);
6047 /* Increment or decrement the real part of the value,
6048 and don't change the imaginary part. */
6049 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
6053 arg
= cp_stabilize_reference (arg
);
6054 real
= cp_build_unary_op (REALPART_EXPR
, arg
, true, complain
);
6055 imag
= cp_build_unary_op (IMAGPART_EXPR
, arg
, true, complain
);
6056 real
= cp_build_unary_op (code
, real
, true, complain
);
6057 if (real
== error_mark_node
|| imag
== error_mark_node
)
6058 return error_mark_node
;
6059 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
6063 /* Report invalid types. */
6065 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
6068 if (code
== PREINCREMENT_EXPR
)
6069 errstring
= _("no pre-increment operator for type");
6070 else if (code
== POSTINCREMENT_EXPR
)
6071 errstring
= _("no post-increment operator for type");
6072 else if (code
== PREDECREMENT_EXPR
)
6073 errstring
= _("no pre-decrement operator for type");
6075 errstring
= _("no post-decrement operator for type");
6078 else if (arg
== error_mark_node
)
6079 return error_mark_node
;
6081 /* Report something read-only. */
6083 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
6084 || TREE_READONLY (arg
))
6086 if (complain
& tf_error
)
6087 cxx_readonly_error (arg
, ((code
== PREINCREMENT_EXPR
6088 || code
== POSTINCREMENT_EXPR
)
6089 ? lv_increment
: lv_decrement
));
6091 return error_mark_node
;
6096 tree declared_type
= unlowered_expr_type (arg
);
6098 argtype
= TREE_TYPE (arg
);
6100 /* ARM $5.2.5 last annotation says this should be forbidden. */
6101 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
6103 if (complain
& tf_error
)
6104 permerror (input_location
, (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
6105 ? G_("ISO C++ forbids incrementing an enum")
6106 : G_("ISO C++ forbids decrementing an enum"));
6108 return error_mark_node
;
6111 /* Compute the increment. */
6113 if (TYPE_PTR_P (argtype
))
6115 tree type
= complete_type (TREE_TYPE (argtype
));
6117 if (!COMPLETE_OR_VOID_TYPE_P (type
))
6119 if (complain
& tf_error
)
6120 error (((code
== PREINCREMENT_EXPR
6121 || code
== POSTINCREMENT_EXPR
))
6122 ? G_("cannot increment a pointer to incomplete type %qT")
6123 : G_("cannot decrement a pointer to incomplete type %qT"),
6124 TREE_TYPE (argtype
));
6126 return error_mark_node
;
6128 else if (!TYPE_PTROB_P (argtype
))
6130 if (complain
& tf_error
)
6131 pedwarn (input_location
, OPT_Wpointer_arith
,
6132 (code
== PREINCREMENT_EXPR
6133 || code
== POSTINCREMENT_EXPR
)
6134 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
6135 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
6138 return error_mark_node
;
6141 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
6144 inc
= VECTOR_TYPE_P (argtype
)
6145 ? build_one_cst (argtype
)
6148 inc
= cp_convert (argtype
, inc
, complain
);
6150 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
6151 need to ask Objective-C to build the increment or decrement
6152 expression for it. */
6153 if (objc_is_property_ref (arg
))
6154 return objc_build_incr_expr_for_property_ref (input_location
, code
,
6157 /* Complain about anything else that is not a true lvalue. */
6158 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
6159 || code
== POSTINCREMENT_EXPR
)
6160 ? lv_increment
: lv_decrement
),
6162 return error_mark_node
;
6164 /* Forbid using -- or ++ in C++17 on `bool'. */
6165 if (TREE_CODE (declared_type
) == BOOLEAN_TYPE
)
6167 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
6169 if (complain
& tf_error
)
6170 error ("use of an operand of type %qT in %<operator--%> "
6171 "is forbidden", boolean_type_node
);
6172 return error_mark_node
;
6176 if (cxx_dialect
>= cxx1z
)
6178 if (complain
& tf_error
)
6179 error ("use of an operand of type %qT in "
6180 "%<operator++%> is forbidden in C++1z",
6182 return error_mark_node
;
6184 /* Otherwise, [depr.incr.bool] says this is deprecated. */
6185 else if (!in_system_header_at (input_location
))
6186 warning (OPT_Wdeprecated
, "use of an operand of type %qT "
6187 "in %<operator++%> is deprecated",
6190 val
= boolean_increment (code
, arg
);
6192 else if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6193 /* An rvalue has no cv-qualifiers. */
6194 val
= build2 (code
, cv_unqualified (TREE_TYPE (arg
)), arg
, inc
);
6196 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
6198 TREE_SIDE_EFFECTS (val
) = 1;
6203 /* Note that this operation never does default_conversion
6204 regardless of NOCONVERT. */
6205 return cp_build_addr_expr (arg
, complain
);
6214 argtype
= TREE_TYPE (arg
);
6215 return build1 (code
, argtype
, arg
);
6218 if (complain
& tf_error
)
6219 error ("%s", errstring
);
6220 return error_mark_node
;
6223 /* Hook for the c-common bits that build a unary op. */
6225 build_unary_op (location_t
/*location*/,
6226 enum tree_code code
, tree xarg
, bool noconvert
)
6228 return cp_build_unary_op (code
, xarg
, noconvert
, tf_warning_or_error
);
6231 /* Apply unary lvalue-demanding operator CODE to the expression ARG
6232 for certain kinds of expressions which are not really lvalues
6233 but which we can accept as lvalues.
6235 If ARG is not a kind of expression we can handle, return
6239 unary_complex_lvalue (enum tree_code code
, tree arg
)
6241 /* Inside a template, making these kinds of adjustments is
6242 pointless; we are only concerned with the type of the
6244 if (processing_template_decl
)
6247 /* Handle (a, b) used as an "lvalue". */
6248 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
6250 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 1), false,
6251 tf_warning_or_error
);
6252 return build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6253 TREE_OPERAND (arg
, 0), real_result
);
6256 /* Handle (a ? b : c) used as an "lvalue". */
6257 if (TREE_CODE (arg
) == COND_EXPR
6258 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
6259 return rationalize_conditional_expr (code
, arg
, tf_warning_or_error
);
6261 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
6262 if (TREE_CODE (arg
) == MODIFY_EXPR
6263 || TREE_CODE (arg
) == PREINCREMENT_EXPR
6264 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
6266 tree lvalue
= TREE_OPERAND (arg
, 0);
6267 if (TREE_SIDE_EFFECTS (lvalue
))
6269 lvalue
= cp_stabilize_reference (lvalue
);
6270 arg
= build2 (TREE_CODE (arg
), TREE_TYPE (arg
),
6271 lvalue
, TREE_OPERAND (arg
, 1));
6273 return unary_complex_lvalue
6274 (code
, build2 (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
6277 if (code
!= ADDR_EXPR
)
6280 /* Handle (a = b) used as an "lvalue" for `&'. */
6281 if (TREE_CODE (arg
) == MODIFY_EXPR
6282 || TREE_CODE (arg
) == INIT_EXPR
)
6284 tree real_result
= cp_build_unary_op (code
, TREE_OPERAND (arg
, 0), false,
6285 tf_warning_or_error
);
6286 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (real_result
),
6288 TREE_NO_WARNING (arg
) = 1;
6292 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
6293 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
6294 || TREE_CODE (arg
) == OFFSET_REF
)
6297 /* We permit compiler to make function calls returning
6298 objects of aggregate type look like lvalues. */
6302 if (TREE_CODE (targ
) == SAVE_EXPR
)
6303 targ
= TREE_OPERAND (targ
, 0);
6305 if (TREE_CODE (targ
) == CALL_EXPR
&& MAYBE_CLASS_TYPE_P (TREE_TYPE (targ
)))
6307 if (TREE_CODE (arg
) == SAVE_EXPR
)
6310 targ
= build_cplus_new (TREE_TYPE (arg
), arg
, tf_warning_or_error
);
6311 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
6314 if (TREE_CODE (arg
) == SAVE_EXPR
&& INDIRECT_REF_P (targ
))
6315 return build3 (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
6316 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
6319 /* Don't let anything else be handled specially. */
6323 /* Mark EXP saying that we need to be able to take the
6324 address of it; it should not be allocated in a register.
6325 Value is true if successful. ARRAY_REF_P is true if this
6326 is for ARRAY_REF construction - in that case we don't want
6327 to look through VIEW_CONVERT_EXPR from VECTOR_TYPE to ARRAY_TYPE,
6328 it is fine to use ARRAY_REFs for vector subscripts on vector
6331 C++: we do not allow `current_class_ptr' to be addressable. */
6334 cxx_mark_addressable (tree exp
, bool array_ref_p
)
6339 switch (TREE_CODE (x
))
6341 case VIEW_CONVERT_EXPR
:
6343 && TREE_CODE (TREE_TYPE (x
)) == ARRAY_TYPE
6344 && VECTOR_TYPE_P (TREE_TYPE (TREE_OPERAND (x
, 0))))
6352 x
= TREE_OPERAND (x
, 0);
6356 if (x
== current_class_ptr
)
6358 error ("cannot take the address of %<this%>, which is an rvalue expression");
6359 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later. */
6365 /* Caller should not be trying to mark initialized
6366 constant fields addressable. */
6367 gcc_assert (DECL_LANG_SPECIFIC (x
) == 0
6368 || DECL_IN_AGGR_P (x
) == 0
6370 || DECL_EXTERNAL (x
));
6374 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
6375 && !DECL_ARTIFICIAL (x
))
6377 if (VAR_P (x
) && DECL_HARD_REGISTER (x
))
6380 ("address of explicit register variable %qD requested", x
);
6383 else if (extra_warnings
)
6385 (OPT_Wextra
, "address requested for %qD, which is declared %<register%>", x
);
6387 TREE_ADDRESSABLE (x
) = 1;
6392 TREE_ADDRESSABLE (x
) = 1;
6396 TREE_ADDRESSABLE (x
) = 1;
6400 TREE_ADDRESSABLE (x
) = 1;
6401 cxx_mark_addressable (TREE_OPERAND (x
, 0));
6409 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6412 build_x_conditional_expr (location_t loc
, tree ifexp
, tree op1
, tree op2
,
6413 tsubst_flags_t complain
)
6415 tree orig_ifexp
= ifexp
;
6416 tree orig_op1
= op1
;
6417 tree orig_op2
= op2
;
6420 if (processing_template_decl
)
6422 /* The standard says that the expression is type-dependent if
6423 IFEXP is type-dependent, even though the eventual type of the
6424 expression doesn't dependent on IFEXP. */
6425 if (type_dependent_expression_p (ifexp
)
6426 /* As a GNU extension, the middle operand may be omitted. */
6427 || (op1
&& type_dependent_expression_p (op1
))
6428 || type_dependent_expression_p (op2
))
6429 return build_min_nt_loc (loc
, COND_EXPR
, ifexp
, op1
, op2
);
6430 ifexp
= build_non_dependent_expr (ifexp
);
6432 op1
= build_non_dependent_expr (op1
);
6433 op2
= build_non_dependent_expr (op2
);
6436 expr
= build_conditional_expr (loc
, ifexp
, op1
, op2
, complain
);
6437 if (processing_template_decl
&& expr
!= error_mark_node
)
6439 tree min
= build_min_non_dep (COND_EXPR
, expr
,
6440 orig_ifexp
, orig_op1
, orig_op2
);
6441 /* Remember that the result is an lvalue or xvalue. */
6442 if (glvalue_p (expr
) && !glvalue_p (min
))
6443 TREE_TYPE (min
) = cp_build_reference_type (TREE_TYPE (min
),
6445 expr
= convert_from_reference (min
);
6450 /* Given a list of expressions, return a compound expression
6451 that performs them all and returns the value of the last of them. */
6454 build_x_compound_expr_from_list (tree list
, expr_list_kind exp
,
6455 tsubst_flags_t complain
)
6457 tree expr
= TREE_VALUE (list
);
6459 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6460 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
))
6462 if (complain
& tf_error
)
6463 pedwarn (EXPR_LOC_OR_LOC (expr
, input_location
), 0,
6464 "list-initializer for non-class type must not "
6465 "be parenthesized");
6467 return error_mark_node
;
6470 if (TREE_CHAIN (list
))
6472 if (complain
& tf_error
)
6476 permerror (input_location
, "expression list treated as compound "
6477 "expression in initializer");
6480 permerror (input_location
, "expression list treated as compound "
6481 "expression in mem-initializer");
6484 permerror (input_location
, "expression list treated as compound "
6485 "expression in functional cast");
6491 return error_mark_node
;
6493 for (list
= TREE_CHAIN (list
); list
; list
= TREE_CHAIN (list
))
6494 expr
= build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list
)),
6495 expr
, TREE_VALUE (list
), complain
);
6501 /* Like build_x_compound_expr_from_list, but using a VEC. */
6504 build_x_compound_expr_from_vec (vec
<tree
, va_gc
> *vec
, const char *msg
,
6505 tsubst_flags_t complain
)
6507 if (vec_safe_is_empty (vec
))
6509 else if (vec
->length () == 1)
6519 if (complain
& tf_error
)
6520 permerror (input_location
,
6521 "%s expression list treated as compound expression",
6524 return error_mark_node
;
6528 for (ix
= 1; vec
->iterate (ix
, &t
); ++ix
)
6529 expr
= build_x_compound_expr (EXPR_LOCATION (t
), expr
,
6536 /* Handle overloading of the ',' operator when needed. */
6539 build_x_compound_expr (location_t loc
, tree op1
, tree op2
,
6540 tsubst_flags_t complain
)
6543 tree orig_op1
= op1
;
6544 tree orig_op2
= op2
;
6545 tree overload
= NULL_TREE
;
6547 if (processing_template_decl
)
6549 if (type_dependent_expression_p (op1
)
6550 || type_dependent_expression_p (op2
))
6551 return build_min_nt_loc (loc
, COMPOUND_EXPR
, op1
, op2
);
6552 op1
= build_non_dependent_expr (op1
);
6553 op2
= build_non_dependent_expr (op2
);
6556 result
= build_new_op (loc
, COMPOUND_EXPR
, LOOKUP_NORMAL
, op1
, op2
,
6557 NULL_TREE
, &overload
, complain
);
6559 result
= cp_build_compound_expr (op1
, op2
, complain
);
6561 if (processing_template_decl
&& result
!= error_mark_node
)
6563 if (overload
!= NULL_TREE
)
6564 return (build_min_non_dep_op_overload
6565 (COMPOUND_EXPR
, result
, overload
, orig_op1
, orig_op2
));
6567 return build_min_non_dep (COMPOUND_EXPR
, result
, orig_op1
, orig_op2
);
6573 /* Like cp_build_compound_expr, but for the c-common bits. */
6576 build_compound_expr (location_t
/*loc*/, tree lhs
, tree rhs
)
6578 return cp_build_compound_expr (lhs
, rhs
, tf_warning_or_error
);
6581 /* Build a compound expression. */
6584 cp_build_compound_expr (tree lhs
, tree rhs
, tsubst_flags_t complain
)
6586 lhs
= convert_to_void (lhs
, ICV_LEFT_OF_COMMA
, complain
);
6588 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
6589 return error_mark_node
;
6592 && (TREE_CODE (lhs
) == CILK_SPAWN_STMT
6593 || TREE_CODE (rhs
) == CILK_SPAWN_STMT
))
6595 location_t loc
= (EXPR_HAS_LOCATION (lhs
) ? EXPR_LOCATION (lhs
)
6596 : EXPR_LOCATION (rhs
));
6598 "spawned function call cannot be part of a comma expression");
6599 return error_mark_node
;
6602 if (TREE_CODE (rhs
) == TARGET_EXPR
)
6604 /* If the rhs is a TARGET_EXPR, then build the compound
6605 expression inside the target_expr's initializer. This
6606 helps the compiler to eliminate unnecessary temporaries. */
6607 tree init
= TREE_OPERAND (rhs
, 1);
6609 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), lhs
, init
);
6610 TREE_OPERAND (rhs
, 1) = init
;
6615 if (type_unknown_p (rhs
))
6617 if (complain
& tf_error
)
6618 error ("no context to resolve type of %qE", rhs
);
6619 return error_mark_node
;
6622 return build2 (COMPOUND_EXPR
, TREE_TYPE (rhs
), lhs
, rhs
);
6625 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6626 casts away constness. CAST gives the type of cast. Returns true
6627 if the cast is ill-formed, false if it is well-formed.
6629 ??? This function warns for casting away any qualifier not just
6630 const. We would like to specify exactly what qualifiers are casted
6635 check_for_casting_away_constness (tree src_type
, tree dest_type
,
6636 enum tree_code cast
, tsubst_flags_t complain
)
6638 /* C-style casts are allowed to cast away constness. With
6639 WARN_CAST_QUAL, we still want to issue a warning. */
6640 if (cast
== CAST_EXPR
&& !warn_cast_qual
)
6643 if (!casts_away_constness (src_type
, dest_type
, complain
))
6649 if (complain
& tf_warning
)
6650 warning (OPT_Wcast_qual
,
6651 "cast from type %qT to type %qT casts away qualifiers",
6652 src_type
, dest_type
);
6655 case STATIC_CAST_EXPR
:
6656 if (complain
& tf_error
)
6657 error ("static_cast from type %qT to type %qT casts away qualifiers",
6658 src_type
, dest_type
);
6661 case REINTERPRET_CAST_EXPR
:
6662 if (complain
& tf_error
)
6663 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6664 src_type
, dest_type
);
6672 /* Warns if the cast from expression EXPR to type TYPE is useless. */
6674 maybe_warn_about_useless_cast (tree type
, tree expr
, tsubst_flags_t complain
)
6676 if (warn_useless_cast
6677 && complain
& tf_warning
)
6679 if ((TREE_CODE (type
) == REFERENCE_TYPE
6680 && (TYPE_REF_IS_RVALUE (type
)
6681 ? xvalue_p (expr
) : lvalue_p (expr
))
6682 && same_type_p (TREE_TYPE (expr
), TREE_TYPE (type
)))
6683 || same_type_p (TREE_TYPE (expr
), type
))
6684 warning (OPT_Wuseless_cast
, "useless cast to type %qT", type
);
6688 /* Warns if the cast ignores cv-qualifiers on TYPE. */
6690 maybe_warn_about_cast_ignoring_quals (tree type
, tsubst_flags_t complain
)
6692 if (warn_ignored_qualifiers
6693 && complain
& tf_warning
6694 && !CLASS_TYPE_P (type
)
6695 && (cp_type_quals (type
) & (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)))
6697 warning (OPT_Wignored_qualifiers
, "type qualifiers ignored on cast "
6702 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6703 (another pointer-to-member type in the same hierarchy) and return
6704 the converted expression. If ALLOW_INVERSE_P is permitted, a
6705 pointer-to-derived may be converted to pointer-to-base; otherwise,
6706 only the other direction is permitted. If C_CAST_P is true, this
6707 conversion is taking place as part of a C-style cast. */
6710 convert_ptrmem (tree type
, tree expr
, bool allow_inverse_p
,
6711 bool c_cast_p
, tsubst_flags_t complain
)
6713 if (same_type_p (type
, TREE_TYPE (expr
)))
6716 if (TYPE_PTRDATAMEM_P (type
))
6720 delta
= get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr
)),
6721 TYPE_PTRMEM_CLASS_TYPE (type
),
6723 c_cast_p
, complain
);
6724 if (delta
== error_mark_node
)
6725 return error_mark_node
;
6727 if (!integer_zerop (delta
))
6729 tree cond
, op1
, op2
;
6731 if (TREE_CODE (expr
) == PTRMEM_CST
)
6732 expr
= cplus_expand_constant (expr
);
6733 cond
= cp_build_binary_op (input_location
,
6736 build_int_cst (TREE_TYPE (expr
), -1),
6738 op1
= build_nop (ptrdiff_type_node
, expr
);
6739 op2
= cp_build_binary_op (input_location
,
6740 PLUS_EXPR
, op1
, delta
,
6743 expr
= fold_build3_loc (input_location
,
6744 COND_EXPR
, ptrdiff_type_node
, cond
, op1
, op2
);
6748 return build_nop (type
, expr
);
6751 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type
), expr
,
6752 allow_inverse_p
, c_cast_p
, complain
);
6755 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6756 this static_cast is being attempted as one of the possible casts
6757 allowed by a C-style cast. (In that case, accessibility of base
6758 classes is not considered, and it is OK to cast away
6759 constness.) Return the result of the cast. *VALID_P is set to
6760 indicate whether or not the cast was valid. */
6763 build_static_cast_1 (tree type
, tree expr
, bool c_cast_p
,
6764 bool *valid_p
, tsubst_flags_t complain
)
6770 /* Assume the cast is valid. */
6773 intype
= unlowered_expr_type (expr
);
6775 /* Save casted types in the function's used types hash table. */
6776 used_types_insert (type
);
6778 /* A prvalue of non-class type is cv-unqualified. */
6779 if (!CLASS_TYPE_P (type
))
6780 type
= cv_unqualified (type
);
6782 /* [expr.static.cast]
6784 An lvalue of type "cv1 B", where B is a class type, can be cast
6785 to type "reference to cv2 D", where D is a class derived (clause
6786 _class.derived_) from B, if a valid standard conversion from
6787 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6788 same cv-qualification as, or greater cv-qualification than, cv1,
6789 and B is not a virtual base class of D. */
6790 /* We check this case before checking the validity of "TYPE t =
6791 EXPR;" below because for this case:
6794 struct D : public B { D(const B&); };
6796 void f() { static_cast<const D&>(b); }
6798 we want to avoid constructing a new D. The standard is not
6799 completely clear about this issue, but our interpretation is
6800 consistent with other compilers. */
6801 if (TREE_CODE (type
) == REFERENCE_TYPE
6802 && CLASS_TYPE_P (TREE_TYPE (type
))
6803 && CLASS_TYPE_P (intype
)
6804 && (TYPE_REF_IS_RVALUE (type
) || lvalue_p (expr
))
6805 && DERIVED_FROM_P (intype
, TREE_TYPE (type
))
6806 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype
)),
6807 build_pointer_type (TYPE_MAIN_VARIANT
6808 (TREE_TYPE (type
))),
6811 || at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6815 /* There is a standard conversion from "D*" to "B*" even if "B"
6816 is ambiguous or inaccessible. If this is really a
6817 static_cast, then we check both for inaccessibility and
6818 ambiguity. However, if this is a static_cast being performed
6819 because the user wrote a C-style cast, then accessibility is
6821 base
= lookup_base (TREE_TYPE (type
), intype
,
6822 c_cast_p
? ba_unique
: ba_check
,
6824 expr
= build_address (expr
);
6826 if (sanitize_flags_p (SANITIZE_VPTR
))
6829 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6835 /* Convert from "B*" to "D*". This function will check that "B"
6836 is not a virtual base of "D". */
6837 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6840 /* Convert the pointer to a reference -- but then remember that
6841 there are no expressions with reference type in C++.
6843 We call rvalue so that there's an actual tree code
6844 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6845 is a variable with the same type, the conversion would get folded
6846 away, leaving just the variable and causing lvalue_kind to give
6847 the wrong answer. */
6848 return convert_from_reference (rvalue (cp_fold_convert (type
, expr
)));
6851 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6852 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6853 if (TREE_CODE (type
) == REFERENCE_TYPE
6854 && TYPE_REF_IS_RVALUE (type
)
6855 && (clk
= real_lvalue_p (expr
))
6856 && reference_related_p (TREE_TYPE (type
), intype
)
6857 && (c_cast_p
|| at_least_as_qualified_p (TREE_TYPE (type
), intype
)))
6859 if (clk
== clk_ordinary
)
6861 /* Handle the (non-bit-field) lvalue case here by casting to
6862 lvalue reference and then changing it to an rvalue reference.
6863 Casting an xvalue to rvalue reference will be handled by the
6865 tree lref
= cp_build_reference_type (TREE_TYPE (type
), false);
6866 result
= (perform_direct_initialization_if_possible
6867 (lref
, expr
, c_cast_p
, complain
));
6868 result
= build1 (NON_LVALUE_EXPR
, type
, result
);
6869 return convert_from_reference (result
);
6872 /* For a bit-field or packed field, bind to a temporary. */
6873 expr
= rvalue (expr
);
6876 /* Resolve overloaded address here rather than once in
6877 implicit_conversion and again in the inverse code below. */
6878 if (TYPE_PTRMEMFUNC_P (type
) && type_unknown_p (expr
))
6880 expr
= instantiate_type (type
, expr
, complain
);
6881 intype
= TREE_TYPE (expr
);
6884 /* [expr.static.cast]
6886 Any expression can be explicitly converted to type cv void. */
6887 if (VOID_TYPE_P (type
))
6888 return convert_to_void (expr
, ICV_CAST
, complain
);
6891 An abstract class shall not be used ... as the type of an explicit
6893 if (abstract_virtuals_error_sfinae (ACU_CAST
, type
, complain
))
6894 return error_mark_node
;
6896 /* [expr.static.cast]
6898 An expression e can be explicitly converted to a type T using a
6899 static_cast of the form static_cast<T>(e) if the declaration T
6900 t(e);" is well-formed, for some invented temporary variable
6902 result
= perform_direct_initialization_if_possible (type
, expr
,
6903 c_cast_p
, complain
);
6906 result
= convert_from_reference (result
);
6908 /* [expr.static.cast]
6910 If T is a reference type, the result is an lvalue; otherwise,
6911 the result is an rvalue. */
6912 if (TREE_CODE (type
) != REFERENCE_TYPE
)
6914 result
= rvalue (result
);
6916 if (result
== expr
&& SCALAR_TYPE_P (type
))
6917 /* Leave some record of the cast. */
6918 result
= build_nop (type
, expr
);
6923 /* [expr.static.cast]
6925 The inverse of any standard conversion sequence (clause _conv_),
6926 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
6927 (_conv.array_), function-to-pointer (_conv.func_), and boolean
6928 (_conv.bool_) conversions, can be performed explicitly using
6929 static_cast subject to the restriction that the explicit
6930 conversion does not cast away constness (_expr.const.cast_), and
6931 the following additional rules for specific cases: */
6932 /* For reference, the conversions not excluded are: integral
6933 promotions, floating point promotion, integral conversions,
6934 floating point conversions, floating-integral conversions,
6935 pointer conversions, and pointer to member conversions. */
6938 A value of integral _or enumeration_ type can be explicitly
6939 converted to an enumeration type. */
6940 /* The effect of all that is that any conversion between any two
6941 types which are integral, floating, or enumeration types can be
6943 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
6944 || SCALAR_FLOAT_TYPE_P (type
))
6945 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype
)
6946 || SCALAR_FLOAT_TYPE_P (intype
)))
6947 return ocp_convert (type
, expr
, CONV_C_CAST
, LOOKUP_NORMAL
, complain
);
6949 if (TYPE_PTR_P (type
) && TYPE_PTR_P (intype
)
6950 && CLASS_TYPE_P (TREE_TYPE (type
))
6951 && CLASS_TYPE_P (TREE_TYPE (intype
))
6952 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
6953 (TREE_TYPE (intype
))),
6954 build_pointer_type (TYPE_MAIN_VARIANT
6955 (TREE_TYPE (type
))),
6961 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
6963 return error_mark_node
;
6964 base
= lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
6965 c_cast_p
? ba_unique
: ba_check
,
6967 expr
= build_base_path (MINUS_EXPR
, expr
, base
, /*nonnull=*/false,
6970 if (sanitize_flags_p (SANITIZE_VPTR
))
6973 = cp_ubsan_maybe_instrument_downcast (input_location
, type
,
6979 return cp_fold_convert (type
, expr
);
6982 if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
6983 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
6990 c1
= TYPE_PTRMEM_CLASS_TYPE (intype
);
6991 c2
= TYPE_PTRMEM_CLASS_TYPE (type
);
6993 if (TYPE_PTRDATAMEM_P (type
))
6995 t1
= (build_ptrmem_type
6997 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype
))));
6998 t2
= (build_ptrmem_type
7000 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type
))));
7007 if (can_convert (t1
, t2
, complain
) || can_convert (t2
, t1
, complain
))
7010 && check_for_casting_away_constness (intype
, type
,
7013 return error_mark_node
;
7014 return convert_ptrmem (type
, expr
, /*allow_inverse_p=*/1,
7015 c_cast_p
, complain
);
7019 /* [expr.static.cast]
7021 An rvalue of type "pointer to cv void" can be explicitly
7022 converted to a pointer to object type. A value of type pointer
7023 to object converted to "pointer to cv void" and back to the
7024 original pointer type will have its original value. */
7025 if (TYPE_PTR_P (intype
)
7026 && VOID_TYPE_P (TREE_TYPE (intype
))
7027 && TYPE_PTROB_P (type
))
7030 && check_for_casting_away_constness (intype
, type
, STATIC_CAST_EXPR
,
7032 return error_mark_node
;
7033 return build_nop (type
, expr
);
7037 return error_mark_node
;
7040 /* Return an expression representing static_cast<TYPE>(EXPR). */
7043 build_static_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7048 if (type
== error_mark_node
|| expr
== error_mark_node
)
7049 return error_mark_node
;
7051 if (processing_template_decl
)
7053 expr
= build_min (STATIC_CAST_EXPR
, type
, expr
);
7054 /* We don't know if it will or will not have side effects. */
7055 TREE_SIDE_EFFECTS (expr
) = 1;
7056 return convert_from_reference (expr
);
7059 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7060 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7061 if (TREE_CODE (type
) != REFERENCE_TYPE
7062 && TREE_CODE (expr
) == NOP_EXPR
7063 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7064 expr
= TREE_OPERAND (expr
, 0);
7066 result
= build_static_cast_1 (type
, expr
, /*c_cast_p=*/false, &valid_p
,
7070 if (result
!= error_mark_node
)
7072 maybe_warn_about_useless_cast (type
, expr
, complain
);
7073 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7078 if (complain
& tf_error
)
7079 error ("invalid static_cast from type %qT to type %qT",
7080 TREE_TYPE (expr
), type
);
7081 return error_mark_node
;
7084 /* EXPR is an expression with member function or pointer-to-member
7085 function type. TYPE is a pointer type. Converting EXPR to TYPE is
7086 not permitted by ISO C++, but we accept it in some modes. If we
7087 are not in one of those modes, issue a diagnostic. Return the
7088 converted expression. */
7091 convert_member_func_to_ptr (tree type
, tree expr
, tsubst_flags_t complain
)
7096 intype
= TREE_TYPE (expr
);
7097 gcc_assert (TYPE_PTRMEMFUNC_P (intype
)
7098 || TREE_CODE (intype
) == METHOD_TYPE
);
7100 if (!(complain
& tf_warning_or_error
))
7101 return error_mark_node
;
7103 if (pedantic
|| warn_pmf2ptr
)
7104 pedwarn (input_location
, pedantic
? OPT_Wpedantic
: OPT_Wpmf_conversions
,
7105 "converting from %qH to %qI", intype
, type
);
7107 if (TREE_CODE (intype
) == METHOD_TYPE
)
7108 expr
= build_addr_func (expr
, complain
);
7109 else if (TREE_CODE (expr
) == PTRMEM_CST
)
7110 expr
= build_address (PTRMEM_CST_MEMBER (expr
));
7113 decl
= maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype
), 0);
7114 decl
= build_address (decl
);
7115 expr
= get_member_function_from_ptrfunc (&decl
, expr
, complain
);
7118 if (expr
== error_mark_node
)
7119 return error_mark_node
;
7121 return build_nop (type
, expr
);
7124 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
7125 If C_CAST_P is true, this reinterpret cast is being done as part of
7126 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
7127 indicate whether or not reinterpret_cast was valid. */
7130 build_reinterpret_cast_1 (tree type
, tree expr
, bool c_cast_p
,
7131 bool *valid_p
, tsubst_flags_t complain
)
7135 /* Assume the cast is invalid. */
7139 if (type
== error_mark_node
|| error_operand_p (expr
))
7140 return error_mark_node
;
7142 intype
= TREE_TYPE (expr
);
7144 /* Save casted types in the function's used types hash table. */
7145 used_types_insert (type
);
7147 /* A prvalue of non-class type is cv-unqualified. */
7148 if (!CLASS_TYPE_P (type
))
7149 type
= cv_unqualified (type
);
7151 /* [expr.reinterpret.cast]
7152 An lvalue expression of type T1 can be cast to the type
7153 "reference to T2" if an expression of type "pointer to T1" can be
7154 explicitly converted to the type "pointer to T2" using a
7155 reinterpret_cast. */
7156 if (TREE_CODE (type
) == REFERENCE_TYPE
)
7158 if (! lvalue_p (expr
))
7160 if (complain
& tf_error
)
7161 error ("invalid cast of an rvalue expression of type "
7164 return error_mark_node
;
7167 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
7168 "B" are related class types; the reinterpret_cast does not
7169 adjust the pointer. */
7170 if (TYPE_PTR_P (intype
)
7171 && (complain
& tf_warning
)
7172 && (comptypes (TREE_TYPE (intype
), TREE_TYPE (type
),
7173 COMPARE_BASE
| COMPARE_DERIVED
)))
7174 warning (0, "casting %qT to %qT does not dereference pointer",
7177 expr
= cp_build_addr_expr (expr
, complain
);
7179 if (warn_strict_aliasing
> 2)
7180 strict_aliasing_warning (TREE_TYPE (expr
), type
, expr
);
7182 if (expr
!= error_mark_node
)
7183 expr
= build_reinterpret_cast_1
7184 (build_pointer_type (TREE_TYPE (type
)), expr
, c_cast_p
,
7186 if (expr
!= error_mark_node
)
7187 /* cp_build_indirect_ref isn't right for rvalue refs. */
7188 expr
= convert_from_reference (fold_convert (type
, expr
));
7192 /* As a G++ extension, we consider conversions from member
7193 functions, and pointers to member functions to
7194 pointer-to-function and pointer-to-void types. If
7195 -Wno-pmf-conversions has not been specified,
7196 convert_member_func_to_ptr will issue an error message. */
7197 if ((TYPE_PTRMEMFUNC_P (intype
)
7198 || TREE_CODE (intype
) == METHOD_TYPE
)
7199 && TYPE_PTR_P (type
)
7200 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
7201 || VOID_TYPE_P (TREE_TYPE (type
))))
7202 return convert_member_func_to_ptr (type
, expr
, complain
);
7204 /* If the cast is not to a reference type, the lvalue-to-rvalue,
7205 array-to-pointer, and function-to-pointer conversions are
7207 expr
= decay_conversion (expr
, complain
);
7209 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7210 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7211 if (TREE_CODE (expr
) == NOP_EXPR
7212 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7213 expr
= TREE_OPERAND (expr
, 0);
7215 if (error_operand_p (expr
))
7216 return error_mark_node
;
7218 intype
= TREE_TYPE (expr
);
7220 /* [expr.reinterpret.cast]
7221 A pointer can be converted to any integral type large enough to
7222 hold it. ... A value of type std::nullptr_t can be converted to
7223 an integral type; the conversion has the same meaning and
7224 validity as a conversion of (void*)0 to the integral type. */
7225 if (CP_INTEGRAL_TYPE_P (type
)
7226 && (TYPE_PTR_P (intype
) || NULLPTR_TYPE_P (intype
)))
7228 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
7230 if (complain
& tf_error
)
7231 permerror (input_location
, "cast from %qH to %qI loses precision",
7234 return error_mark_node
;
7236 if (NULLPTR_TYPE_P (intype
))
7237 return build_int_cst (type
, 0);
7239 /* [expr.reinterpret.cast]
7240 A value of integral or enumeration type can be explicitly
7241 converted to a pointer. */
7242 else if (TYPE_PTR_P (type
) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype
))
7245 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type
)
7246 || TYPE_PTR_OR_PTRMEM_P (type
))
7247 && same_type_p (type
, intype
))
7249 return rvalue (expr
);
7250 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
7251 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
7252 return build_nop (type
, expr
);
7253 else if ((TYPE_PTRDATAMEM_P (type
) && TYPE_PTRDATAMEM_P (intype
))
7254 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
7259 && check_for_casting_away_constness (intype
, type
,
7260 REINTERPRET_CAST_EXPR
,
7262 return error_mark_node
;
7263 /* Warn about possible alignment problems. */
7264 if (STRICT_ALIGNMENT
&& warn_cast_align
7265 && (complain
& tf_warning
)
7266 && !VOID_TYPE_P (type
)
7267 && TREE_CODE (TREE_TYPE (intype
)) != FUNCTION_TYPE
7268 && COMPLETE_TYPE_P (TREE_TYPE (type
))
7269 && COMPLETE_TYPE_P (TREE_TYPE (intype
))
7270 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (intype
)))
7271 warning (OPT_Wcast_align
, "cast from %qH to %qI "
7272 "increases required alignment of target type", intype
, type
);
7274 /* We need to strip nops here, because the front end likes to
7275 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
7277 if (warn_strict_aliasing
<= 2)
7278 strict_aliasing_warning (intype
, type
, sexpr
);
7280 return build_nop (type
, expr
);
7282 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
7283 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
7285 if (complain
& tf_warning
)
7286 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
7287 object pointer type or vice versa is conditionally-supported." */
7288 warning (OPT_Wconditionally_supported
,
7289 "casting between pointer-to-function and pointer-to-object "
7290 "is conditionally-supported");
7291 return build_nop (type
, expr
);
7293 else if (VECTOR_TYPE_P (type
))
7294 return convert_to_vector (type
, expr
);
7295 else if (VECTOR_TYPE_P (intype
)
7296 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
7297 return convert_to_integer_nofold (type
, expr
);
7302 if (complain
& tf_error
)
7303 error ("invalid cast from type %qT to type %qT", intype
, type
);
7304 return error_mark_node
;
7307 return cp_convert (type
, expr
, complain
);
7311 build_reinterpret_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7315 if (type
== error_mark_node
|| expr
== error_mark_node
)
7316 return error_mark_node
;
7318 if (processing_template_decl
)
7320 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
7322 if (!TREE_SIDE_EFFECTS (t
)
7323 && type_dependent_expression_p (expr
))
7324 /* There might turn out to be side effects inside expr. */
7325 TREE_SIDE_EFFECTS (t
) = 1;
7326 return convert_from_reference (t
);
7329 r
= build_reinterpret_cast_1 (type
, expr
, /*c_cast_p=*/false,
7330 /*valid_p=*/NULL
, complain
);
7331 if (r
!= error_mark_node
)
7333 maybe_warn_about_useless_cast (type
, expr
, complain
);
7334 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7339 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
7340 return an appropriate expression. Otherwise, return
7341 error_mark_node. If the cast is not valid, and COMPLAIN is true,
7342 then a diagnostic will be issued. If VALID_P is non-NULL, we are
7343 performing a C-style cast, its value upon return will indicate
7344 whether or not the conversion succeeded. */
7347 build_const_cast_1 (tree dst_type
, tree expr
, tsubst_flags_t complain
,
7351 tree reference_type
;
7353 /* Callers are responsible for handling error_mark_node as a
7354 destination type. */
7355 gcc_assert (dst_type
!= error_mark_node
);
7356 /* In a template, callers should be building syntactic
7357 representations of casts, not using this machinery. */
7358 gcc_assert (!processing_template_decl
);
7360 /* Assume the conversion is invalid. */
7364 if (!POINTER_TYPE_P (dst_type
) && !TYPE_PTRDATAMEM_P (dst_type
))
7366 if (complain
& tf_error
)
7367 error ("invalid use of const_cast with type %qT, "
7368 "which is not a pointer, "
7369 "reference, nor a pointer-to-data-member type", dst_type
);
7370 return error_mark_node
;
7373 if (TREE_CODE (TREE_TYPE (dst_type
)) == FUNCTION_TYPE
)
7375 if (complain
& tf_error
)
7376 error ("invalid use of const_cast with type %qT, which is a pointer "
7377 "or reference to a function type", dst_type
);
7378 return error_mark_node
;
7381 /* A prvalue of non-class type is cv-unqualified. */
7382 dst_type
= cv_unqualified (dst_type
);
7384 /* Save casted types in the function's used types hash table. */
7385 used_types_insert (dst_type
);
7387 src_type
= TREE_TYPE (expr
);
7388 /* Expressions do not really have reference types. */
7389 if (TREE_CODE (src_type
) == REFERENCE_TYPE
)
7390 src_type
= TREE_TYPE (src_type
);
7392 /* [expr.const.cast]
7394 For two object types T1 and T2, if a pointer to T1 can be explicitly
7395 converted to the type "pointer to T2" using a const_cast, then the
7396 following conversions can also be made:
7398 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7399 type T2 using the cast const_cast<T2&>;
7401 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7402 type T2 using the cast const_cast<T2&&>; and
7404 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7405 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7407 if (TREE_CODE (dst_type
) == REFERENCE_TYPE
)
7409 reference_type
= dst_type
;
7410 if (!TYPE_REF_IS_RVALUE (dst_type
)
7416 if (complain
& tf_error
)
7417 error ("invalid const_cast of an rvalue of type %qT to type %qT",
7418 src_type
, dst_type
);
7419 return error_mark_node
;
7421 dst_type
= build_pointer_type (TREE_TYPE (dst_type
));
7422 src_type
= build_pointer_type (src_type
);
7426 reference_type
= NULL_TREE
;
7427 /* If the destination type is not a reference type, the
7428 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7429 conversions are performed. */
7430 src_type
= type_decays_to (src_type
);
7431 if (src_type
== error_mark_node
)
7432 return error_mark_node
;
7435 if (TYPE_PTR_P (src_type
) || TYPE_PTRDATAMEM_P (src_type
))
7437 if (comp_ptr_ttypes_const (dst_type
, src_type
))
7442 /* This cast is actually a C-style cast. Issue a warning if
7443 the user is making a potentially unsafe cast. */
7444 check_for_casting_away_constness (src_type
, dst_type
,
7445 CAST_EXPR
, complain
);
7449 expr
= cp_build_addr_expr (expr
, complain
);
7450 if (expr
== error_mark_node
)
7451 return error_mark_node
;
7452 expr
= build_nop (reference_type
, expr
);
7453 return convert_from_reference (expr
);
7457 expr
= decay_conversion (expr
, complain
);
7458 if (expr
== error_mark_node
)
7459 return error_mark_node
;
7461 /* build_c_cast puts on a NOP_EXPR to make the result not an
7462 lvalue. Strip such NOP_EXPRs if VALUE is being used in
7463 non-lvalue context. */
7464 if (TREE_CODE (expr
) == NOP_EXPR
7465 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
7466 expr
= TREE_OPERAND (expr
, 0);
7467 return build_nop (dst_type
, expr
);
7471 && !at_least_as_qualified_p (TREE_TYPE (dst_type
),
7472 TREE_TYPE (src_type
)))
7473 check_for_casting_away_constness (src_type
, dst_type
, CAST_EXPR
,
7477 if (complain
& tf_error
)
7478 error ("invalid const_cast from type %qT to type %qT",
7479 src_type
, dst_type
);
7480 return error_mark_node
;
7484 build_const_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7488 if (type
== error_mark_node
|| error_operand_p (expr
))
7489 return error_mark_node
;
7491 if (processing_template_decl
)
7493 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
7495 if (!TREE_SIDE_EFFECTS (t
)
7496 && type_dependent_expression_p (expr
))
7497 /* There might turn out to be side effects inside expr. */
7498 TREE_SIDE_EFFECTS (t
) = 1;
7499 return convert_from_reference (t
);
7502 r
= build_const_cast_1 (type
, expr
, complain
, /*valid_p=*/NULL
);
7503 if (r
!= error_mark_node
)
7505 maybe_warn_about_useless_cast (type
, expr
, complain
);
7506 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7511 /* Like cp_build_c_cast, but for the c-common bits. */
7514 build_c_cast (location_t
/*loc*/, tree type
, tree expr
)
7516 return cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7519 /* Like the "build_c_cast" used for c-common, but using cp_expr to
7520 preserve location information even for tree nodes that don't
7524 build_c_cast (location_t loc
, tree type
, cp_expr expr
)
7526 cp_expr result
= cp_build_c_cast (type
, expr
, tf_warning_or_error
);
7527 result
.set_location (loc
);
7531 /* Build an expression representing an explicit C-style cast to type
7532 TYPE of expression EXPR. */
7535 cp_build_c_cast (tree type
, tree expr
, tsubst_flags_t complain
)
7541 if (type
== error_mark_node
|| error_operand_p (expr
))
7542 return error_mark_node
;
7544 if (processing_template_decl
)
7546 tree t
= build_min (CAST_EXPR
, type
,
7547 tree_cons (NULL_TREE
, value
, NULL_TREE
));
7548 /* We don't know if it will or will not have side effects. */
7549 TREE_SIDE_EFFECTS (t
) = 1;
7550 return convert_from_reference (t
);
7553 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
7554 'Class') should always be retained, because this information aids
7555 in method lookup. */
7556 if (objc_is_object_ptr (type
)
7557 && objc_is_object_ptr (TREE_TYPE (expr
)))
7558 return build_nop (type
, expr
);
7560 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7561 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7562 if (TREE_CODE (type
) != REFERENCE_TYPE
7563 && TREE_CODE (value
) == NOP_EXPR
7564 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
7565 value
= TREE_OPERAND (value
, 0);
7567 if (TREE_CODE (type
) == ARRAY_TYPE
)
7569 /* Allow casting from T1* to T2[] because Cfront allows it.
7570 NIHCL uses it. It is not valid ISO C++ however. */
7571 if (TYPE_PTR_P (TREE_TYPE (expr
)))
7573 if (complain
& tf_error
)
7574 permerror (input_location
, "ISO C++ forbids casting to an array type %qT", type
);
7576 return error_mark_node
;
7577 type
= build_pointer_type (TREE_TYPE (type
));
7581 if (complain
& tf_error
)
7582 error ("ISO C++ forbids casting to an array type %qT", type
);
7583 return error_mark_node
;
7587 if (TREE_CODE (type
) == FUNCTION_TYPE
7588 || TREE_CODE (type
) == METHOD_TYPE
)
7590 if (complain
& tf_error
)
7591 error ("invalid cast to function type %qT", type
);
7592 return error_mark_node
;
7595 if (TYPE_PTR_P (type
)
7596 && TREE_CODE (TREE_TYPE (value
)) == INTEGER_TYPE
7597 /* Casting to an integer of smaller size is an error detected elsewhere. */
7598 && TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (value
))
7599 /* Don't warn about converting any constant. */
7600 && !TREE_CONSTANT (value
))
7601 warning_at (input_location
, OPT_Wint_to_pointer_cast
,
7602 "cast to pointer from integer of different size");
7604 /* A C-style cast can be a const_cast. */
7605 result
= build_const_cast_1 (type
, value
, complain
& tf_warning
,
7609 if (result
!= error_mark_node
)
7611 maybe_warn_about_useless_cast (type
, value
, complain
);
7612 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7617 /* Or a static cast. */
7618 result
= build_static_cast_1 (type
, value
, /*c_cast_p=*/true,
7619 &valid_p
, complain
);
7620 /* Or a reinterpret_cast. */
7622 result
= build_reinterpret_cast_1 (type
, value
, /*c_cast_p=*/true,
7623 &valid_p
, complain
);
7624 /* The static_cast or reinterpret_cast may be followed by a
7627 /* A valid cast may result in errors if, for example, a
7628 conversion to an ambiguous base class is required. */
7629 && !error_operand_p (result
))
7633 maybe_warn_about_useless_cast (type
, value
, complain
);
7634 maybe_warn_about_cast_ignoring_quals (type
, complain
);
7636 /* Non-class rvalues always have cv-unqualified type. */
7637 if (!CLASS_TYPE_P (type
))
7638 type
= TYPE_MAIN_VARIANT (type
);
7639 result_type
= TREE_TYPE (result
);
7640 if (!CLASS_TYPE_P (result_type
) && TREE_CODE (type
) != REFERENCE_TYPE
)
7641 result_type
= TYPE_MAIN_VARIANT (result_type
);
7642 /* If the type of RESULT does not match TYPE, perform a
7643 const_cast to make it match. If the static_cast or
7644 reinterpret_cast succeeded, we will differ by at most
7645 cv-qualification, so the follow-on const_cast is guaranteed
7647 if (!same_type_p (non_reference (type
), non_reference (result_type
)))
7649 result
= build_const_cast_1 (type
, result
, false, &valid_p
);
7650 gcc_assert (valid_p
);
7655 return error_mark_node
;
7658 /* For use from the C common bits. */
7660 build_modify_expr (location_t location
,
7661 tree lhs
, tree
/*lhs_origtype*/,
7662 enum tree_code modifycode
,
7663 location_t
/*rhs_location*/, tree rhs
,
7664 tree
/*rhs_origtype*/)
7666 return cp_build_modify_expr (location
, lhs
, modifycode
, rhs
,
7667 tf_warning_or_error
);
7670 /* Build an assignment expression of lvalue LHS from value RHS.
7671 MODIFYCODE is the code for a binary operator that we use
7672 to combine the old value of LHS with RHS to get the new value.
7673 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
7675 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
7678 cp_build_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
7679 tree rhs
, tsubst_flags_t complain
)
7681 tree result
= NULL_TREE
;
7683 tree lhstype
= TREE_TYPE (lhs
);
7685 tree olhstype
= lhstype
;
7686 bool plain_assign
= (modifycode
== NOP_EXPR
);
7687 bool compound_side_effects_p
= false;
7688 tree preeval
= NULL_TREE
;
7690 /* Avoid duplicate error messages from operands that had errors. */
7691 if (error_operand_p (lhs
) || error_operand_p (rhs
))
7692 return error_mark_node
;
7694 while (TREE_CODE (lhs
) == COMPOUND_EXPR
)
7696 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7697 compound_side_effects_p
= true;
7698 lhs
= TREE_OPERAND (lhs
, 1);
7701 /* Handle control structure constructs used as "lvalues". Note that we
7702 leave COMPOUND_EXPR on the LHS because it is sequenced after the RHS. */
7703 switch (TREE_CODE (lhs
))
7705 /* Handle --foo = 5; as these are valid constructs in C++. */
7706 case PREDECREMENT_EXPR
:
7707 case PREINCREMENT_EXPR
:
7708 if (compound_side_effects_p
)
7709 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7710 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7711 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7712 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7713 TREE_OPERAND (lhs
, 1));
7714 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7716 /* If we had (bar, --foo) = 5; or (bar, (baz, --foo)) = 5;
7717 and looked through the COMPOUND_EXPRs, readd them now around
7718 the resulting lhs. */
7719 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7721 lhs
= build2 (COMPOUND_EXPR
, lhstype
, TREE_OPERAND (olhs
, 0), lhs
);
7722 tree
*ptr
= &TREE_OPERAND (lhs
, 1);
7723 for (olhs
= TREE_OPERAND (olhs
, 1);
7724 TREE_CODE (olhs
) == COMPOUND_EXPR
;
7725 olhs
= TREE_OPERAND (olhs
, 1))
7727 *ptr
= build2 (COMPOUND_EXPR
, lhstype
,
7728 TREE_OPERAND (olhs
, 0), *ptr
);
7729 ptr
= &TREE_OPERAND (*ptr
, 1);
7735 if (compound_side_effects_p
)
7736 newrhs
= rhs
= stabilize_expr (rhs
, &preeval
);
7737 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
7738 lhs
= build2 (TREE_CODE (lhs
), TREE_TYPE (lhs
),
7739 cp_stabilize_reference (TREE_OPERAND (lhs
, 0)),
7740 TREE_OPERAND (lhs
, 1));
7741 lhs
= build2 (COMPOUND_EXPR
, lhstype
, lhs
, TREE_OPERAND (lhs
, 0));
7742 goto maybe_add_compound
;
7746 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7747 when neither operand has side-effects. */
7748 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7749 return error_mark_node
;
7751 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0))
7752 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 1)));
7754 lhs
= build3 (COND_EXPR
, TREE_TYPE (lhs
),
7755 build2 (TREE_CODE (lhs
) == MIN_EXPR
? LE_EXPR
: GE_EXPR
,
7757 TREE_OPERAND (lhs
, 0),
7758 TREE_OPERAND (lhs
, 1)),
7759 TREE_OPERAND (lhs
, 0),
7760 TREE_OPERAND (lhs
, 1));
7763 /* Handle (a ? b : c) used as an "lvalue". */
7766 /* Produce (a ? (b = rhs) : (c = rhs))
7767 except that the RHS goes through a save-expr
7768 so the code to compute it is only emitted once. */
7771 if (VOID_TYPE_P (TREE_TYPE (rhs
)))
7773 if (complain
& tf_error
)
7774 error ("void value not ignored as it ought to be");
7775 return error_mark_node
;
7778 rhs
= stabilize_expr (rhs
, &preeval
);
7780 /* Check this here to avoid odd errors when trying to convert
7781 a throw to the type of the COND_EXPR. */
7782 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7783 return error_mark_node
;
7785 cond
= build_conditional_expr
7786 (input_location
, TREE_OPERAND (lhs
, 0),
7787 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 1),
7788 modifycode
, rhs
, complain
),
7789 cp_build_modify_expr (loc
, TREE_OPERAND (lhs
, 2),
7790 modifycode
, rhs
, complain
),
7793 if (cond
== error_mark_node
)
7795 /* If we had (e, (a ? b : c)) = d; or (e, (f, (a ? b : c))) = d;
7796 and looked through the COMPOUND_EXPRs, readd them now around
7797 the resulting cond before adding the preevaluated rhs. */
7798 if (TREE_CODE (olhs
) == COMPOUND_EXPR
)
7800 cond
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
7801 TREE_OPERAND (olhs
, 0), cond
);
7802 tree
*ptr
= &TREE_OPERAND (cond
, 1);
7803 for (olhs
= TREE_OPERAND (olhs
, 1);
7804 TREE_CODE (olhs
) == COMPOUND_EXPR
;
7805 olhs
= TREE_OPERAND (olhs
, 1))
7807 *ptr
= build2 (COMPOUND_EXPR
, TREE_TYPE (cond
),
7808 TREE_OPERAND (olhs
, 0), *ptr
);
7809 ptr
= &TREE_OPERAND (*ptr
, 1);
7812 /* Make sure the code to compute the rhs comes out
7813 before the split. */
7823 if (modifycode
== INIT_EXPR
)
7825 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
7826 /* Do the default thing. */;
7827 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
7829 /* Compound literal. */
7830 if (! same_type_p (TREE_TYPE (rhs
), lhstype
))
7831 /* Call convert to generate an error; see PR 11063. */
7832 rhs
= convert (lhstype
, rhs
);
7833 result
= build2 (INIT_EXPR
, lhstype
, lhs
, rhs
);
7834 TREE_SIDE_EFFECTS (result
) = 1;
7837 else if (! MAYBE_CLASS_TYPE_P (lhstype
))
7838 /* Do the default thing. */;
7841 vec
<tree
, va_gc
> *rhs_vec
= make_tree_vector_single (rhs
);
7842 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
7843 &rhs_vec
, lhstype
, LOOKUP_NORMAL
,
7845 release_tree_vector (rhs_vec
);
7846 if (result
== NULL_TREE
)
7847 return error_mark_node
;
7853 lhs
= require_complete_type_sfinae (lhs
, complain
);
7854 if (lhs
== error_mark_node
)
7855 return error_mark_node
;
7857 if (modifycode
== NOP_EXPR
)
7859 if (c_dialect_objc ())
7861 result
= objc_maybe_build_modify_expr (lhs
, rhs
);
7866 /* `operator=' is not an inheritable operator. */
7867 if (! MAYBE_CLASS_TYPE_P (lhstype
))
7868 /* Do the default thing. */;
7871 result
= build_new_op (input_location
, MODIFY_EXPR
,
7872 LOOKUP_NORMAL
, lhs
, rhs
,
7873 make_node (NOP_EXPR
), /*overload=*/NULL
,
7875 if (result
== NULL_TREE
)
7876 return error_mark_node
;
7883 tree init
= NULL_TREE
;
7885 /* A binary op has been requested. Combine the old LHS
7886 value with the RHS producing the value we should actually
7887 store into the LHS. */
7888 gcc_assert (!((TREE_CODE (lhstype
) == REFERENCE_TYPE
7889 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype
)))
7890 || MAYBE_CLASS_TYPE_P (lhstype
)));
7892 /* Preevaluate the RHS to make sure its evaluation is complete
7893 before the lvalue-to-rvalue conversion of the LHS:
7895 [expr.ass] With respect to an indeterminately-sequenced
7896 function call, the operation of a compound assignment is a
7897 single evaluation. [ Note: Therefore, a function call shall
7898 not intervene between the lvalue-to-rvalue conversion and the
7899 side effect associated with any single compound assignment
7900 operator. -- end note ] */
7901 lhs
= cp_stabilize_reference (lhs
);
7903 rhs
= stabilize_expr (rhs
, &init
);
7904 newrhs
= cp_build_binary_op (loc
, modifycode
, lhs
, rhs
, complain
);
7905 if (newrhs
== error_mark_node
)
7907 if (complain
& tf_error
)
7908 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode
,
7909 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
7910 return error_mark_node
;
7914 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), init
, newrhs
);
7916 /* Now it looks like a plain assignment. */
7917 modifycode
= NOP_EXPR
;
7918 if (c_dialect_objc ())
7920 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
7925 gcc_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
);
7926 gcc_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
);
7929 /* The left-hand side must be an lvalue. */
7930 if (!lvalue_or_else (lhs
, lv_assign
, complain
))
7931 return error_mark_node
;
7933 /* Warn about modifying something that is `const'. Don't warn if
7934 this is initialization. */
7935 if (modifycode
!= INIT_EXPR
7936 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
7937 /* Functions are not modifiable, even though they are
7939 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
7940 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
7941 /* If it's an aggregate and any field is const, then it is
7942 effectively const. */
7943 || (CLASS_TYPE_P (lhstype
)
7944 && C_TYPE_FIELDS_READONLY (lhstype
))))
7946 if (complain
& tf_error
)
7947 cxx_readonly_error (lhs
, lv_assign
);
7949 return error_mark_node
;
7952 /* If storing into a structure or union member, it may have been given a
7953 lowered bitfield type. We need to convert to the declared type first,
7954 so retrieve it now. */
7956 olhstype
= unlowered_expr_type (lhs
);
7958 /* Convert new value to destination type. */
7960 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
7964 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs
))
7966 if (modifycode
!= INIT_EXPR
)
7968 if (complain
& tf_error
)
7969 error ("assigning to an array from an initializer list");
7970 return error_mark_node
;
7972 if (check_array_initializer (lhs
, lhstype
, newrhs
))
7973 return error_mark_node
;
7974 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7975 if (newrhs
== error_mark_node
)
7976 return error_mark_node
;
7979 /* C++11 8.5/17: "If the destination type is an array of characters,
7980 an array of char16_t, an array of char32_t, or an array of wchar_t,
7981 and the initializer is a string literal...". */
7982 else if (TREE_CODE (newrhs
) == STRING_CST
7983 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype
)))
7984 && modifycode
== INIT_EXPR
)
7986 newrhs
= digest_init (lhstype
, newrhs
, complain
);
7987 if (newrhs
== error_mark_node
)
7988 return error_mark_node
;
7991 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
7992 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs
))))
7994 if (complain
& tf_error
)
7995 error ("incompatible types in assignment of %qT to %qT",
7996 TREE_TYPE (rhs
), lhstype
);
7997 return error_mark_node
;
8000 /* Allow array assignment in compiler-generated code. */
8001 else if (!current_function_decl
8002 || !DECL_DEFAULTED_FN (current_function_decl
))
8004 /* This routine is used for both initialization and assignment.
8005 Make sure the diagnostic message differentiates the context. */
8006 if (complain
& tf_error
)
8008 if (modifycode
== INIT_EXPR
)
8009 error ("array used as initializer");
8011 error ("invalid array assignment");
8013 return error_mark_node
;
8016 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
8017 ? 1 + (modifycode
!= INIT_EXPR
): 0;
8018 result
= build_vec_init (lhs
, NULL_TREE
, newrhs
,
8019 /*explicit_value_init_p=*/false,
8020 from_array
, complain
);
8024 if (modifycode
== INIT_EXPR
)
8025 /* Calls with INIT_EXPR are all direct-initialization, so don't set
8026 LOOKUP_ONLYCONVERTING. */
8027 newrhs
= convert_for_initialization (lhs
, olhstype
, newrhs
, LOOKUP_NORMAL
,
8028 ICR_INIT
, NULL_TREE
, 0,
8031 newrhs
= convert_for_assignment (olhstype
, newrhs
, ICR_ASSIGN
,
8032 NULL_TREE
, 0, complain
, LOOKUP_IMPLICIT
);
8034 if (!same_type_p (lhstype
, olhstype
))
8035 newrhs
= cp_convert_and_check (lhstype
, newrhs
, complain
);
8037 if (modifycode
!= INIT_EXPR
)
8039 if (TREE_CODE (newrhs
) == CALL_EXPR
8040 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
8041 newrhs
= build_cplus_new (lhstype
, newrhs
, complain
);
8043 /* Can't initialize directly from a TARGET_EXPR, since that would
8044 cause the lhs to be constructed twice, and possibly result in
8045 accidental self-initialization. So we force the TARGET_EXPR to be
8046 expanded without a target. */
8047 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
8048 newrhs
= build2 (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
8049 TREE_OPERAND (newrhs
, 0));
8052 if (newrhs
== error_mark_node
)
8053 return error_mark_node
;
8055 if (c_dialect_objc () && flag_objc_gc
)
8057 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
8063 result
= build2 (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
8064 lhstype
, lhs
, newrhs
);
8066 TREE_SIDE_EFFECTS (result
) = 1;
8068 TREE_NO_WARNING (result
) = 1;
8072 result
= build2 (COMPOUND_EXPR
, TREE_TYPE (result
), preeval
, result
);
8077 build_x_modify_expr (location_t loc
, tree lhs
, enum tree_code modifycode
,
8078 tree rhs
, tsubst_flags_t complain
)
8080 tree orig_lhs
= lhs
;
8081 tree orig_rhs
= rhs
;
8082 tree overload
= NULL_TREE
;
8083 tree op
= build_nt (modifycode
, NULL_TREE
, NULL_TREE
);
8085 if (processing_template_decl
)
8087 if (modifycode
== NOP_EXPR
8088 || type_dependent_expression_p (lhs
)
8089 || type_dependent_expression_p (rhs
))
8090 return build_min_nt_loc (loc
, MODOP_EXPR
, lhs
,
8091 build_min_nt_loc (loc
, modifycode
, NULL_TREE
,
8094 lhs
= build_non_dependent_expr (lhs
);
8095 rhs
= build_non_dependent_expr (rhs
);
8098 if (modifycode
!= NOP_EXPR
)
8100 tree rval
= build_new_op (loc
, MODIFY_EXPR
, LOOKUP_NORMAL
,
8101 lhs
, rhs
, op
, &overload
, complain
);
8104 if (rval
== error_mark_node
)
8106 TREE_NO_WARNING (rval
) = 1;
8107 if (processing_template_decl
)
8109 if (overload
!= NULL_TREE
)
8110 return (build_min_non_dep_op_overload
8111 (MODIFY_EXPR
, rval
, overload
, orig_lhs
, orig_rhs
));
8113 return (build_min_non_dep
8114 (MODOP_EXPR
, rval
, orig_lhs
, op
, orig_rhs
));
8119 return cp_build_modify_expr (loc
, lhs
, modifycode
, rhs
, complain
);
8122 /* Helper function for get_delta_difference which assumes FROM is a base
8123 class of TO. Returns a delta for the conversion of pointer-to-member
8124 of FROM to pointer-to-member of TO. If the conversion is invalid and
8125 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
8126 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
8127 If C_CAST_P is true, this conversion is taking place as part of a
8131 get_delta_difference_1 (tree from
, tree to
, bool c_cast_p
,
8132 tsubst_flags_t complain
)
8137 binfo
= lookup_base (to
, from
, c_cast_p
? ba_unique
: ba_check
,
8140 if (binfo
== error_mark_node
)
8142 if (!(complain
& tf_error
))
8143 return error_mark_node
;
8145 error (" in pointer to member function conversion");
8146 return size_zero_node
;
8150 if (kind
!= bk_via_virtual
)
8151 return BINFO_OFFSET (binfo
);
8153 /* FROM is a virtual base class of TO. Issue an error or warning
8154 depending on whether or not this is a reinterpret cast. */
8156 if (!(complain
& tf_error
))
8157 return error_mark_node
;
8159 error ("pointer to member conversion via virtual base %qT",
8160 BINFO_TYPE (binfo_from_vbase (binfo
)));
8162 return size_zero_node
;
8169 /* Get difference in deltas for different pointer to member function
8170 types. If the conversion is invalid and tf_error is not set in
8171 COMPLAIN, returns error_mark_node, otherwise returns an integer
8172 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
8173 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
8174 conversions as well. If C_CAST_P is true this conversion is taking
8175 place as part of a C-style cast.
8177 Note that the naming of FROM and TO is kind of backwards; the return
8178 value is what we add to a TO in order to get a FROM. They are named
8179 this way because we call this function to find out how to convert from
8180 a pointer to member of FROM to a pointer to member of TO. */
8183 get_delta_difference (tree from
, tree to
,
8184 bool allow_inverse_p
,
8185 bool c_cast_p
, tsubst_flags_t complain
)
8189 if (same_type_ignoring_top_level_qualifiers_p (from
, to
))
8190 /* Pointer to member of incomplete class is permitted*/
8191 result
= size_zero_node
;
8193 result
= get_delta_difference_1 (from
, to
, c_cast_p
, complain
);
8195 if (result
== error_mark_node
)
8196 return error_mark_node
;
8200 if (!allow_inverse_p
)
8202 if (!(complain
& tf_error
))
8203 return error_mark_node
;
8205 error_not_base_type (from
, to
);
8206 error (" in pointer to member conversion");
8207 result
= size_zero_node
;
8211 result
= get_delta_difference_1 (to
, from
, c_cast_p
, complain
);
8213 if (result
== error_mark_node
)
8214 return error_mark_node
;
8217 result
= size_diffop_loc (input_location
,
8218 size_zero_node
, result
);
8221 if (!(complain
& tf_error
))
8222 return error_mark_node
;
8224 error_not_base_type (from
, to
);
8225 error (" in pointer to member conversion");
8226 result
= size_zero_node
;
8231 return convert_to_integer (ptrdiff_type_node
, result
);
8234 /* Return a constructor for the pointer-to-member-function TYPE using
8235 the other components as specified. */
8238 build_ptrmemfunc1 (tree type
, tree delta
, tree pfn
)
8243 vec
<constructor_elt
, va_gc
> *v
;
8245 /* Pull the FIELD_DECLs out of the type. */
8246 pfn_field
= TYPE_FIELDS (type
);
8247 delta_field
= DECL_CHAIN (pfn_field
);
8249 /* Make sure DELTA has the type we want. */
8250 delta
= convert_and_check (input_location
, delta_type_node
, delta
);
8252 /* Convert to the correct target type if necessary. */
8253 pfn
= fold_convert (TREE_TYPE (pfn_field
), pfn
);
8255 /* Finish creating the initializer. */
8257 CONSTRUCTOR_APPEND_ELT(v
, pfn_field
, pfn
);
8258 CONSTRUCTOR_APPEND_ELT(v
, delta_field
, delta
);
8259 u
= build_constructor (type
, v
);
8260 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) & TREE_CONSTANT (delta
);
8261 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
8262 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
8264 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
8269 /* Build a constructor for a pointer to member function. It can be
8270 used to initialize global variables, local variable, or used
8271 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
8274 If FORCE is nonzero, then force this conversion, even if
8275 we would rather not do it. Usually set when using an explicit
8276 cast. A C-style cast is being processed iff C_CAST_P is true.
8278 Return error_mark_node, if something goes wrong. */
8281 build_ptrmemfunc (tree type
, tree pfn
, int force
, bool c_cast_p
,
8282 tsubst_flags_t complain
)
8288 if (error_operand_p (pfn
))
8289 return error_mark_node
;
8291 pfn_type
= TREE_TYPE (pfn
);
8292 to_type
= build_ptrmemfunc_type (type
);
8294 /* Handle multiple conversions of pointer to member functions. */
8295 if (TYPE_PTRMEMFUNC_P (pfn_type
))
8297 tree delta
= NULL_TREE
;
8298 tree npfn
= NULL_TREE
;
8302 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
,
8303 LOOKUP_NORMAL
, complain
))
8305 if (complain
& tf_error
)
8306 error ("invalid conversion to type %qT from type %qT",
8309 return error_mark_node
;
8312 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
8313 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
8315 c_cast_p
, complain
);
8316 if (n
== error_mark_node
)
8317 return error_mark_node
;
8319 /* We don't have to do any conversion to convert a
8320 pointer-to-member to its own type. But, we don't want to
8321 just return a PTRMEM_CST if there's an explicit cast; that
8322 cast should make the expression an invalid template argument. */
8323 if (TREE_CODE (pfn
) != PTRMEM_CST
)
8325 if (same_type_p (to_type
, pfn_type
))
8327 else if (integer_zerop (n
))
8328 return build_reinterpret_cast (to_type
, pfn
,
8332 if (TREE_SIDE_EFFECTS (pfn
))
8333 pfn
= save_expr (pfn
);
8335 /* Obtain the function pointer and the current DELTA. */
8336 if (TREE_CODE (pfn
) == PTRMEM_CST
)
8337 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
8340 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
8341 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
8344 /* Just adjust the DELTA field. */
8345 gcc_assert (same_type_ignoring_top_level_qualifiers_p
8346 (TREE_TYPE (delta
), ptrdiff_type_node
));
8347 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
8348 n
= cp_build_binary_op (input_location
,
8349 LSHIFT_EXPR
, n
, integer_one_node
,
8351 delta
= cp_build_binary_op (input_location
,
8352 PLUS_EXPR
, delta
, n
, complain
);
8353 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
8356 /* Handle null pointer to member function conversions. */
8357 if (null_ptr_cst_p (pfn
))
8359 pfn
= cp_build_c_cast (type
, pfn
, complain
);
8360 return build_ptrmemfunc1 (to_type
,
8365 if (type_unknown_p (pfn
))
8366 return instantiate_type (type
, pfn
, complain
);
8368 fn
= TREE_OPERAND (pfn
, 0);
8369 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8370 /* In a template, we will have preserved the
8372 || (processing_template_decl
&& TREE_CODE (fn
) == OFFSET_REF
));
8373 return make_ptrmem_cst (to_type
, fn
);
8376 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
8379 ??? There is no consistency as to the types returned for the above
8380 values. Some code acts as if it were a sizetype and some as if it were
8381 integer_type_node. */
8384 expand_ptrmemfunc_cst (tree cst
, tree
*delta
, tree
*pfn
)
8386 tree type
= TREE_TYPE (cst
);
8387 tree fn
= PTRMEM_CST_MEMBER (cst
);
8388 tree ptr_class
, fn_class
;
8390 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8392 /* The class that the function belongs to. */
8393 fn_class
= DECL_CONTEXT (fn
);
8395 /* The class that we're creating a pointer to member of. */
8396 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
8398 /* First, calculate the adjustment to the function's class. */
8399 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0,
8400 /*c_cast_p=*/0, tf_warning_or_error
);
8402 if (!DECL_VIRTUAL_P (fn
))
8403 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
),
8404 build_addr_func (fn
, tf_warning_or_error
));
8407 /* If we're dealing with a virtual function, we have to adjust 'this'
8408 again, to point to the base which provides the vtable entry for
8409 fn; the call will do the opposite adjustment. */
8410 tree orig_class
= DECL_CONTEXT (fn
);
8411 tree binfo
= binfo_or_else (orig_class
, fn_class
);
8412 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8413 *delta
, BINFO_OFFSET (binfo
));
8415 /* We set PFN to the vtable offset at which the function can be
8416 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
8417 case delta is shifted left, and then incremented). */
8418 *pfn
= DECL_VINDEX (fn
);
8419 *pfn
= fold_build2 (MULT_EXPR
, integer_type_node
, *pfn
,
8420 TYPE_SIZE_UNIT (vtable_entry_type
));
8422 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
8424 case ptrmemfunc_vbit_in_pfn
:
8425 *pfn
= fold_build2 (PLUS_EXPR
, integer_type_node
, *pfn
,
8429 case ptrmemfunc_vbit_in_delta
:
8430 *delta
= fold_build2 (LSHIFT_EXPR
, TREE_TYPE (*delta
),
8431 *delta
, integer_one_node
);
8432 *delta
= fold_build2 (PLUS_EXPR
, TREE_TYPE (*delta
),
8433 *delta
, integer_one_node
);
8440 *pfn
= fold_convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), *pfn
);
8444 /* Return an expression for PFN from the pointer-to-member function
8448 pfn_from_ptrmemfunc (tree t
)
8450 if (TREE_CODE (t
) == PTRMEM_CST
)
8455 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8460 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
8463 /* Return an expression for DELTA from the pointer-to-member function
8467 delta_from_ptrmemfunc (tree t
)
8469 if (TREE_CODE (t
) == PTRMEM_CST
)
8474 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
8479 return build_ptrmemfunc_access_expr (t
, delta_identifier
);
8482 /* Convert value RHS to type TYPE as preparation for an assignment to
8483 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8484 implicit conversion is. If FNDECL is non-NULL, we are doing the
8485 conversion in order to pass the PARMNUMth argument of FNDECL.
8486 If FNDECL is NULL, we are doing the conversion in function pointer
8487 argument passing, conversion in initialization, etc. */
8490 convert_for_assignment (tree type
, tree rhs
,
8491 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8492 tsubst_flags_t complain
, int flags
)
8495 enum tree_code coder
;
8497 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8498 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
8499 rhs
= TREE_OPERAND (rhs
, 0);
8501 /* Handle [dcl.init.list] direct-list-initialization from
8502 single element of enumeration with a fixed underlying type. */
8503 if (is_direct_enum_init (type
, rhs
))
8505 tree elt
= CONSTRUCTOR_ELT (rhs
, 0)->value
;
8506 if (check_narrowing (ENUM_UNDERLYING_TYPE (type
), elt
, complain
))
8507 rhs
= cp_build_c_cast (type
, elt
, complain
);
8509 rhs
= error_mark_node
;
8512 rhstype
= TREE_TYPE (rhs
);
8513 coder
= TREE_CODE (rhstype
);
8515 if (VECTOR_TYPE_P (type
) && coder
== VECTOR_TYPE
8516 && vector_types_convertible_p (type
, rhstype
, true))
8518 rhs
= mark_rvalue_use (rhs
);
8519 return convert (type
, rhs
);
8522 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
8523 return error_mark_node
;
8524 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
8525 return error_mark_node
;
8527 /* The RHS of an assignment cannot have void type. */
8528 if (coder
== VOID_TYPE
)
8530 if (complain
& tf_error
)
8531 error ("void value not ignored as it ought to be");
8532 return error_mark_node
;
8535 if (c_dialect_objc ())
8539 tree rname
= fndecl
;
8550 selector
= objc_message_selector ();
8552 if (selector
&& parmno
> 1)
8559 if (objc_compare_types (type
, rhstype
, parmno
, rname
))
8561 rhs
= mark_rvalue_use (rhs
);
8562 return convert (type
, rhs
);
8568 The expression is implicitly converted (clause _conv_) to the
8569 cv-unqualified type of the left operand.
8571 We allow bad conversions here because by the time we get to this point
8572 we are committed to doing the conversion. If we end up doing a bad
8573 conversion, convert_like will complain. */
8574 if (!can_convert_arg_bad (type
, rhstype
, rhs
, flags
, complain
))
8576 /* When -Wno-pmf-conversions is use, we just silently allow
8577 conversions from pointers-to-members to plain pointers. If
8578 the conversion doesn't work, cp_convert will complain. */
8580 && TYPE_PTR_P (type
)
8581 && TYPE_PTRMEMFUNC_P (rhstype
))
8582 rhs
= cp_convert (strip_top_quals (type
), rhs
, complain
);
8585 if (complain
& tf_error
)
8587 /* If the right-hand side has unknown type, then it is an
8588 overloaded function. Call instantiate_type to get error
8590 if (rhstype
== unknown_type_node
)
8592 tree r
= instantiate_type (type
, rhs
, tf_warning_or_error
);
8593 /* -fpermissive might allow this; recurse. */
8595 return convert_for_assignment (type
, r
, errtype
, fndecl
,
8596 parmnum
, complain
, flags
);
8599 error ("cannot convert %qH to %qI for argument %qP to %qD",
8600 rhstype
, type
, parmnum
, fndecl
);
8604 case ICR_DEFAULT_ARGUMENT
:
8605 error ("cannot convert %qH to %qI in default argument",
8609 error ("cannot convert %qH to %qI in argument passing",
8612 case ICR_CONVERTING
:
8613 error ("cannot convert %qH to %qI",
8617 error ("cannot convert %qH to %qI in initialization",
8621 error ("cannot convert %qH to %qI in return",
8625 error ("cannot convert %qH to %qI in assignment",
8631 if (TYPE_PTR_P (rhstype
)
8632 && TYPE_PTR_P (type
)
8633 && CLASS_TYPE_P (TREE_TYPE (rhstype
))
8634 && CLASS_TYPE_P (TREE_TYPE (type
))
8635 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype
)))
8636 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8637 (TREE_TYPE (rhstype
))),
8638 "class type %qT is incomplete", TREE_TYPE (rhstype
));
8640 return error_mark_node
;
8643 if (warn_suggest_attribute_format
)
8645 const enum tree_code codel
= TREE_CODE (type
);
8646 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8648 && check_missing_format_attribute (type
, rhstype
)
8649 && (complain
& tf_warning
))
8653 case ICR_DEFAULT_ARGUMENT
:
8655 warning (OPT_Wsuggest_attribute_format
,
8656 "parameter %qP of %qD might be a candidate "
8657 "for a format attribute", parmnum
, fndecl
);
8659 warning (OPT_Wsuggest_attribute_format
,
8660 "parameter might be a candidate "
8661 "for a format attribute");
8663 case ICR_CONVERTING
:
8664 warning (OPT_Wsuggest_attribute_format
,
8665 "target of conversion might be a candidate "
8666 "for a format attribute");
8669 warning (OPT_Wsuggest_attribute_format
,
8670 "target of initialization might be a candidate "
8671 "for a format attribute");
8674 warning (OPT_Wsuggest_attribute_format
,
8675 "return type might be a candidate "
8676 "for a format attribute");
8679 warning (OPT_Wsuggest_attribute_format
,
8680 "left-hand side of assignment might be a candidate "
8681 "for a format attribute");
8688 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8690 if (warn_parentheses
8691 && TREE_CODE (type
) == BOOLEAN_TYPE
8692 && TREE_CODE (rhs
) == MODIFY_EXPR
8693 && !TREE_NO_WARNING (rhs
)
8694 && TREE_CODE (TREE_TYPE (rhs
)) != BOOLEAN_TYPE
8695 && (complain
& tf_warning
))
8697 location_t loc
= EXPR_LOC_OR_LOC (rhs
, input_location
);
8699 warning_at (loc
, OPT_Wparentheses
,
8700 "suggest parentheses around assignment used as truth value");
8701 TREE_NO_WARNING (rhs
) = 1;
8704 return perform_implicit_conversion_flags (strip_top_quals (type
), rhs
,
8708 /* Convert RHS to be of type TYPE.
8709 If EXP is nonzero, it is the target of the initialization.
8710 ERRTYPE indicates what kind of error the implicit conversion is.
8712 Two major differences between the behavior of
8713 `convert_for_assignment' and `convert_for_initialization'
8714 are that references are bashed in the former, while
8715 copied in the latter, and aggregates are assigned in
8716 the former (operator=) while initialized in the
8719 If using constructor make sure no conversion operator exists, if one does
8720 exist, an ambiguity exists. */
8723 convert_for_initialization (tree exp
, tree type
, tree rhs
, int flags
,
8724 impl_conv_rhs errtype
, tree fndecl
, int parmnum
,
8725 tsubst_flags_t complain
)
8727 enum tree_code codel
= TREE_CODE (type
);
8729 enum tree_code coder
;
8731 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8732 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8733 if (TREE_CODE (rhs
) == NOP_EXPR
8734 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
8735 && codel
!= REFERENCE_TYPE
)
8736 rhs
= TREE_OPERAND (rhs
, 0);
8738 if (type
== error_mark_node
8739 || rhs
== error_mark_node
8740 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
8741 return error_mark_node
;
8743 if (MAYBE_CLASS_TYPE_P (non_reference (type
)))
8745 else if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
8746 && TREE_CODE (type
) != ARRAY_TYPE
8747 && (TREE_CODE (type
) != REFERENCE_TYPE
8748 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
8749 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
8750 && !TYPE_REFFN_P (type
))
8751 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
8752 rhs
= decay_conversion (rhs
, complain
);
8754 rhstype
= TREE_TYPE (rhs
);
8755 coder
= TREE_CODE (rhstype
);
8757 if (coder
== ERROR_MARK
)
8758 return error_mark_node
;
8760 /* We accept references to incomplete types, so we can
8761 return here before checking if RHS is of complete type. */
8763 if (codel
== REFERENCE_TYPE
)
8765 /* This should eventually happen in convert_arguments. */
8766 int savew
= 0, savee
= 0;
8769 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
8770 rhs
= initialize_reference (type
, rhs
, flags
, complain
);
8773 && (warningcount
+ werrorcount
> savew
|| errorcount
> savee
))
8774 inform (DECL_SOURCE_LOCATION (fndecl
),
8775 "in passing argument %P of %qD", parmnum
, fndecl
);
8781 exp
= require_complete_type_sfinae (exp
, complain
);
8782 if (exp
== error_mark_node
)
8783 return error_mark_node
;
8785 rhstype
= non_reference (rhstype
);
8787 type
= complete_type (type
);
8789 if (DIRECT_INIT_EXPR_P (type
, rhs
))
8790 /* Don't try to do copy-initialization if we already have
8791 direct-initialization. */
8794 if (MAYBE_CLASS_TYPE_P (type
))
8795 return perform_implicit_conversion_flags (type
, rhs
, complain
, flags
);
8797 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
,
8801 /* If RETVAL is the address of, or a reference to, a local variable or
8802 temporary give an appropriate warning and return true. */
8805 maybe_warn_about_returning_address_of_local (tree retval
)
8807 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
8808 tree whats_returned
= fold_for_warn (retval
);
8812 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
8813 whats_returned
= TREE_OPERAND (whats_returned
, 1);
8814 else if (CONVERT_EXPR_P (whats_returned
)
8815 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
)
8816 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8821 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
8823 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8825 while (TREE_CODE (whats_returned
) == COMPONENT_REF
8826 || TREE_CODE (whats_returned
) == ARRAY_REF
)
8827 whats_returned
= TREE_OPERAND (whats_returned
, 0);
8829 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8831 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
8832 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
8834 warning (OPT_Wreturn_local_addr
, "returning reference to temporary");
8837 if (VAR_P (whats_returned
)
8838 && DECL_NAME (whats_returned
)
8839 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
8841 warning (OPT_Wreturn_local_addr
, "reference to non-lvalue returned");
8846 if (DECL_P (whats_returned
)
8847 && DECL_NAME (whats_returned
)
8848 && DECL_FUNCTION_SCOPE_P (whats_returned
)
8849 && !is_capture_proxy (whats_returned
)
8850 && !(TREE_STATIC (whats_returned
)
8851 || TREE_PUBLIC (whats_returned
)))
8853 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
8854 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8855 OPT_Wreturn_local_addr
,
8856 "reference to local variable %qD returned",
8858 else if (TREE_CODE (whats_returned
) == LABEL_DECL
)
8859 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8860 OPT_Wreturn_local_addr
, "address of label %qD returned",
8863 warning_at (DECL_SOURCE_LOCATION (whats_returned
),
8864 OPT_Wreturn_local_addr
, "address of local variable %qD "
8865 "returned", whats_returned
);
8872 /* Check that returning RETVAL from the current function is valid.
8873 Return an expression explicitly showing all conversions required to
8874 change RETVAL into the function return type, and to assign it to
8875 the DECL_RESULT for the function. Set *NO_WARNING to true if
8876 code reaches end of non-void function warning shouldn't be issued
8877 on this RETURN_EXPR. */
8880 check_return_expr (tree retval
, bool *no_warning
)
8883 /* The type actually returned by the function. */
8885 /* The type the function is declared to return, or void if
8886 the declared type is incomplete. */
8888 int fn_returns_value_p
;
8889 bool named_return_value_okay_p
;
8891 *no_warning
= false;
8893 if (flag_cilkplus
&& retval
&& contains_cilk_spawn_stmt (retval
))
8895 error_at (EXPR_LOCATION (retval
), "use of %<_Cilk_spawn%> in a return "
8896 "statement is not allowed");
8900 /* A `volatile' function is one that isn't supposed to return, ever.
8901 (This is a G++ extension, used to get better code for functions
8902 that call the `volatile' function.) */
8903 if (TREE_THIS_VOLATILE (current_function_decl
))
8904 warning (0, "function declared %<noreturn%> has a %<return%> statement");
8906 /* Check for various simple errors. */
8907 if (DECL_DESTRUCTOR_P (current_function_decl
))
8910 error ("returning a value from a destructor");
8913 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
8915 if (in_function_try_handler
)
8916 /* If a return statement appears in a handler of the
8917 function-try-block of a constructor, the program is ill-formed. */
8918 error ("cannot return from a handler of a function-try-block of a constructor");
8920 /* You can't return a value from a constructor. */
8921 error ("returning a value from a constructor");
8925 const tree saved_retval
= retval
;
8927 if (processing_template_decl
)
8929 current_function_returns_value
= 1;
8931 if (check_for_bare_parameter_packs (retval
))
8932 return error_mark_node
;
8934 if (WILDCARD_TYPE_P (TREE_TYPE (DECL_RESULT (current_function_decl
)))
8935 || (retval
!= NULL_TREE
8936 && type_dependent_expression_p (retval
)))
8940 functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
8942 /* Deduce auto return type from a return statement. */
8943 if (current_function_auto_return_pattern
)
8948 if (!retval
&& !is_auto (current_function_auto_return_pattern
))
8950 /* Give a helpful error message. */
8951 error ("return-statement with no value, in function returning %qT",
8952 current_function_auto_return_pattern
);
8953 inform (input_location
, "only plain %<auto%> return type can be "
8954 "deduced to %<void%>");
8955 type
= error_mark_node
;
8957 else if (retval
&& BRACE_ENCLOSED_INITIALIZER_P (retval
))
8959 error ("returning initializer list");
8960 type
= error_mark_node
;
8966 auto_node
= type_uses_auto (current_function_auto_return_pattern
);
8967 type
= do_auto_deduction (current_function_auto_return_pattern
,
8971 if (type
== error_mark_node
)
8973 else if (functype
== current_function_auto_return_pattern
)
8974 apply_deduced_return_type (current_function_decl
, type
);
8975 else if (!same_type_p (type
, functype
))
8977 if (LAMBDA_FUNCTION_P (current_function_decl
))
8978 error ("inconsistent types %qT and %qT deduced for "
8979 "lambda return type", functype
, type
);
8981 error ("inconsistent deduction for auto return type: "
8982 "%qT and then %qT", functype
, type
);
8987 result
= DECL_RESULT (current_function_decl
);
8988 valtype
= TREE_TYPE (result
);
8989 gcc_assert (valtype
!= NULL_TREE
);
8990 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
8992 /* Check for a return statement with no return value in a function
8993 that's supposed to return a value. */
8994 if (!retval
&& fn_returns_value_p
)
8996 if (functype
!= error_mark_node
)
8997 permerror (input_location
, "return-statement with no value, in "
8998 "function returning %qT", valtype
);
8999 /* Remember that this function did return. */
9000 current_function_returns_value
= 1;
9001 /* And signal caller that TREE_NO_WARNING should be set on the
9002 RETURN_EXPR to avoid control reaches end of non-void function
9003 warnings in tree-cfg.c. */
9006 /* Check for a return statement with a value in a function that
9007 isn't supposed to return a value. */
9008 else if (retval
&& !fn_returns_value_p
)
9010 if (VOID_TYPE_P (TREE_TYPE (retval
)))
9011 /* You can return a `void' value from a function of `void'
9012 type. In that case, we have to evaluate the expression for
9013 its side-effects. */
9014 finish_expr_stmt (retval
);
9016 permerror (input_location
, "return-statement with a value, in function "
9017 "returning 'void'");
9018 current_function_returns_null
= 1;
9020 /* There's really no value to return, after all. */
9024 /* Remember that this function can sometimes return without a
9026 current_function_returns_null
= 1;
9028 /* Remember that this function did return a value. */
9029 current_function_returns_value
= 1;
9031 /* Check for erroneous operands -- but after giving ourselves a
9032 chance to provide an error about returning a value from a void
9034 if (error_operand_p (retval
))
9036 current_function_return_value
= error_mark_node
;
9037 return error_mark_node
;
9040 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
9041 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
9042 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
9043 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
9045 && retval
&& null_ptr_cst_p (retval
))
9046 warning (0, "%<operator new%> must not return NULL unless it is "
9047 "declared %<throw()%> (or -fcheck-new is in effect)");
9049 /* Effective C++ rule 15. See also start_function. */
9051 && DECL_NAME (current_function_decl
) == cp_assignment_operator_id (NOP_EXPR
))
9055 /* The function return type must be a reference to the current
9057 if (TREE_CODE (valtype
) == REFERENCE_TYPE
9058 && same_type_ignoring_top_level_qualifiers_p
9059 (TREE_TYPE (valtype
), TREE_TYPE (current_class_ref
)))
9061 /* Returning '*this' is obviously OK. */
9062 if (retval
== current_class_ref
)
9064 /* If we are calling a function whose return type is the same of
9065 the current class reference, it is ok. */
9066 else if (INDIRECT_REF_P (retval
)
9067 && TREE_CODE (TREE_OPERAND (retval
, 0)) == CALL_EXPR
)
9072 warning (OPT_Weffc__
, "%<operator=%> should return a reference to %<*this%>");
9075 if (processing_template_decl
)
9077 /* We should not have changed the return value. */
9078 gcc_assert (retval
== saved_retval
);
9082 /* The fabled Named Return Value optimization, as per [class.copy]/15:
9084 [...] For a function with a class return type, if the expression
9085 in the return statement is the name of a local object, and the cv-
9086 unqualified type of the local object is the same as the function
9087 return type, an implementation is permitted to omit creating the tem-
9088 porary object to hold the function return value [...]
9090 So, if this is a value-returning function that always returns the same
9091 local variable, remember it.
9093 It might be nice to be more flexible, and choose the first suitable
9094 variable even if the function sometimes returns something else, but
9095 then we run the risk of clobbering the variable we chose if the other
9096 returned expression uses the chosen variable somehow. And people expect
9097 this restriction, anyway. (jason 2000-11-19)
9099 See finish_function and finalize_nrv for the rest of this optimization. */
9101 named_return_value_okay_p
=
9102 (retval
!= NULL_TREE
9103 /* Must be a local, automatic variable. */
9105 && DECL_CONTEXT (retval
) == current_function_decl
9106 && ! TREE_STATIC (retval
)
9107 /* And not a lambda or anonymous union proxy. */
9108 && !DECL_HAS_VALUE_EXPR_P (retval
)
9109 && (DECL_ALIGN (retval
) <= DECL_ALIGN (result
))
9110 /* The cv-unqualified type of the returned value must be the
9111 same as the cv-unqualified return type of the
9113 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval
))),
9114 (TYPE_MAIN_VARIANT (functype
)))
9115 /* And the returned value must be non-volatile. */
9116 && ! TYPE_VOLATILE (TREE_TYPE (retval
)));
9118 if (fn_returns_value_p
&& flag_elide_constructors
)
9120 if (named_return_value_okay_p
9121 && (current_function_return_value
== NULL_TREE
9122 || current_function_return_value
== retval
))
9123 current_function_return_value
= retval
;
9125 current_function_return_value
= error_mark_node
;
9128 /* We don't need to do any conversions when there's nothing being
9133 /* Do any required conversions. */
9134 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
9135 /* No conversions are required. */
9139 int flags
= LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
;
9141 /* The functype's return type will have been set to void, if it
9142 was an incomplete type. Just treat this as 'return;' */
9143 if (VOID_TYPE_P (functype
))
9144 return error_mark_node
;
9146 /* If we had an id-expression obfuscated by force_paren_expr, we need
9147 to undo it so we can try to treat it as an rvalue below. */
9148 retval
= maybe_undo_parenthesized_ref (retval
);
9150 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
9151 treated as an rvalue for the purposes of overload resolution to
9152 favor move constructors over copy constructors.
9154 Note that these conditions are similar to, but not as strict as,
9155 the conditions for the named return value optimization. */
9156 if ((cxx_dialect
!= cxx98
)
9157 && ((VAR_P (retval
) && !DECL_HAS_VALUE_EXPR_P (retval
))
9158 || TREE_CODE (retval
) == PARM_DECL
)
9159 && DECL_CONTEXT (retval
) == current_function_decl
9160 && !TREE_STATIC (retval
)
9161 /* This is only interesting for class type. */
9162 && CLASS_TYPE_P (functype
))
9163 flags
= flags
| LOOKUP_PREFER_RVALUE
;
9165 /* First convert the value to the function's return type, then
9166 to the type of return value's location to handle the
9167 case that functype is smaller than the valtype. */
9168 retval
= convert_for_initialization
9169 (NULL_TREE
, functype
, retval
, flags
, ICR_RETURN
, NULL_TREE
, 0,
9170 tf_warning_or_error
);
9171 retval
= convert (valtype
, retval
);
9173 /* If the conversion failed, treat this just like `return;'. */
9174 if (retval
== error_mark_node
)
9176 /* We can't initialize a register from a AGGR_INIT_EXPR. */
9177 else if (! cfun
->returns_struct
9178 && TREE_CODE (retval
) == TARGET_EXPR
9179 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
9180 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9181 TREE_OPERAND (retval
, 0));
9182 else if (maybe_warn_about_returning_address_of_local (retval
))
9183 retval
= build2 (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
9184 build_zero_cst (TREE_TYPE (retval
)));
9187 /* Actually copy the value returned into the appropriate location. */
9188 if (retval
&& retval
!= result
)
9189 retval
= build2 (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
9195 /* Returns nonzero if the pointer-type FROM can be converted to the
9196 pointer-type TO via a qualification conversion. If CONSTP is -1,
9197 then we return nonzero if the pointers are similar, and the
9198 cv-qualification signature of FROM is a proper subset of that of TO.
9200 If CONSTP is positive, then all outer pointers have been
9204 comp_ptr_ttypes_real (tree to
, tree from
, int constp
)
9206 bool to_more_cv_qualified
= false;
9207 bool is_opaque_pointer
= false;
9209 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9211 if (TREE_CODE (to
) != TREE_CODE (from
))
9214 if (TREE_CODE (from
) == OFFSET_TYPE
9215 && !same_type_p (TYPE_OFFSET_BASETYPE (from
),
9216 TYPE_OFFSET_BASETYPE (to
)))
9219 /* Const and volatile mean something different for function types,
9220 so the usual checks are not appropriate. */
9221 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
9223 if (!at_least_as_qualified_p (to
, from
))
9226 if (!at_least_as_qualified_p (from
, to
))
9230 to_more_cv_qualified
= true;
9234 constp
&= TYPE_READONLY (to
);
9237 if (VECTOR_TYPE_P (to
))
9238 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9240 if (!TYPE_PTR_P (to
) && !TYPE_PTRDATAMEM_P (to
))
9241 return ((constp
>= 0 || to_more_cv_qualified
)
9242 && (is_opaque_pointer
9243 || same_type_ignoring_top_level_qualifiers_p (to
, from
)));
9247 /* When comparing, say, char ** to char const **, this function takes
9248 the 'char *' and 'char const *'. Do not pass non-pointer/reference
9249 types to this function. */
9252 comp_ptr_ttypes (tree to
, tree from
)
9254 return comp_ptr_ttypes_real (to
, from
, 1);
9257 /* Returns true iff FNTYPE is a non-class type that involves
9258 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
9259 if a parameter type is ill-formed. */
9262 error_type_p (const_tree type
)
9266 switch (TREE_CODE (type
))
9272 case REFERENCE_TYPE
:
9274 return error_type_p (TREE_TYPE (type
));
9278 if (error_type_p (TREE_TYPE (type
)))
9280 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
9281 if (error_type_p (TREE_VALUE (t
)))
9286 if (TYPE_PTRMEMFUNC_P (type
))
9287 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type
));
9295 /* Returns true if to and from are (possibly multi-level) pointers to the same
9296 type or inheritance-related types, regardless of cv-quals. */
9299 ptr_reasonably_similar (const_tree to
, const_tree from
)
9301 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9303 /* Any target type is similar enough to void. */
9304 if (VOID_TYPE_P (to
))
9305 return !error_type_p (from
);
9306 if (VOID_TYPE_P (from
))
9307 return !error_type_p (to
);
9309 if (TREE_CODE (to
) != TREE_CODE (from
))
9312 if (TREE_CODE (from
) == OFFSET_TYPE
9313 && comptypes (TYPE_OFFSET_BASETYPE (to
),
9314 TYPE_OFFSET_BASETYPE (from
),
9315 COMPARE_BASE
| COMPARE_DERIVED
))
9318 if (VECTOR_TYPE_P (to
)
9319 && vector_types_convertible_p (to
, from
, false))
9322 if (TREE_CODE (to
) == INTEGER_TYPE
9323 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
9326 if (TREE_CODE (to
) == FUNCTION_TYPE
)
9327 return !error_type_p (to
) && !error_type_p (from
);
9329 if (!TYPE_PTR_P (to
))
9331 /* When either type is incomplete avoid DERIVED_FROM_P,
9332 which may call complete_type (c++/57942). */
9333 bool b
= !COMPLETE_TYPE_P (to
) || !COMPLETE_TYPE_P (from
);
9335 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
9336 b
? COMPARE_STRICT
: COMPARE_BASE
| COMPARE_DERIVED
);
9341 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
9342 pointer-to-member types) are the same, ignoring cv-qualification at
9346 comp_ptr_ttypes_const (tree to
, tree from
)
9348 bool is_opaque_pointer
= false;
9350 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
9352 if (TREE_CODE (to
) != TREE_CODE (from
))
9355 if (TREE_CODE (from
) == OFFSET_TYPE
9356 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
9357 TYPE_OFFSET_BASETYPE (to
)))
9360 if (VECTOR_TYPE_P (to
))
9361 is_opaque_pointer
= vector_targets_convertible_p (to
, from
);
9363 if (!TYPE_PTR_P (to
))
9364 return (is_opaque_pointer
9365 || same_type_ignoring_top_level_qualifiers_p (to
, from
));
9369 /* Returns the type qualifiers for this type, including the qualifiers on the
9370 elements for an array type. */
9373 cp_type_quals (const_tree type
)
9376 /* This CONST_CAST is okay because strip_array_types returns its
9377 argument unmodified and we assign it to a const_tree. */
9378 type
= strip_array_types (CONST_CAST_TREE (type
));
9379 if (type
== error_mark_node
9380 /* Quals on a FUNCTION_TYPE are memfn quals. */
9381 || TREE_CODE (type
) == FUNCTION_TYPE
)
9382 return TYPE_UNQUALIFIED
;
9383 quals
= TYPE_QUALS (type
);
9384 /* METHOD and REFERENCE_TYPEs should never have quals. */
9385 gcc_assert ((TREE_CODE (type
) != METHOD_TYPE
9386 && TREE_CODE (type
) != REFERENCE_TYPE
)
9387 || ((quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
))
9388 == TYPE_UNQUALIFIED
));
9392 /* Returns the function-ref-qualifier for TYPE */
9395 type_memfn_rqual (const_tree type
)
9397 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
9398 || TREE_CODE (type
) == METHOD_TYPE
);
9400 if (!FUNCTION_REF_QUALIFIED (type
))
9401 return REF_QUAL_NONE
;
9402 else if (FUNCTION_RVALUE_QUALIFIED (type
))
9403 return REF_QUAL_RVALUE
;
9405 return REF_QUAL_LVALUE
;
9408 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
9412 type_memfn_quals (const_tree type
)
9414 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9415 return TYPE_QUALS (type
);
9416 else if (TREE_CODE (type
) == METHOD_TYPE
)
9417 return cp_type_quals (class_of_this_parm (type
));
9422 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
9423 MEMFN_QUALS and its ref-qualifier to RQUAL. */
9426 apply_memfn_quals (tree type
, cp_cv_quals memfn_quals
, cp_ref_qualifier rqual
)
9428 /* Could handle METHOD_TYPE here if necessary. */
9429 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
9430 if (TYPE_QUALS (type
) == memfn_quals
9431 && type_memfn_rqual (type
) == rqual
)
9434 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
9436 tree result
= build_qualified_type (type
, memfn_quals
);
9437 return build_ref_qualified_type (result
, rqual
);
9440 /* Returns nonzero if TYPE is const or volatile. */
9443 cv_qualified_p (const_tree type
)
9445 int quals
= cp_type_quals (type
);
9446 return (quals
& (TYPE_QUAL_CONST
|TYPE_QUAL_VOLATILE
)) != 0;
9449 /* Returns nonzero if the TYPE contains a mutable member. */
9452 cp_has_mutable_p (const_tree type
)
9454 /* This CONST_CAST is okay because strip_array_types returns its
9455 argument unmodified and we assign it to a const_tree. */
9456 type
= strip_array_types (CONST_CAST_TREE(type
));
9458 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
9461 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9462 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9463 approximation. In particular, consider:
9466 struct S { int i; };
9467 const S s = { f(); }
9469 Here, we will make "s" as TREE_READONLY (because it is declared
9470 "const") -- only to reverse ourselves upon seeing that the
9471 initializer is non-constant. */
9474 cp_apply_type_quals_to_decl (int type_quals
, tree decl
)
9476 tree type
= TREE_TYPE (decl
);
9478 if (type
== error_mark_node
)
9481 if (TREE_CODE (decl
) == TYPE_DECL
)
9484 gcc_assert (!(TREE_CODE (type
) == FUNCTION_TYPE
9485 && type_quals
!= TYPE_UNQUALIFIED
));
9487 /* Avoid setting TREE_READONLY incorrectly. */
9488 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9489 constructor can produce constant init, so rely on cp_finish_decl to
9490 clear TREE_READONLY if the variable has non-constant init. */
9492 /* If the type has (or might have) a mutable component, that component
9493 might be modified. */
9494 if (TYPE_HAS_MUTABLE_P (type
) || !COMPLETE_TYPE_P (type
))
9495 type_quals
&= ~TYPE_QUAL_CONST
;
9497 c_apply_type_quals_to_decl (type_quals
, decl
);
9500 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9501 exemplar types such that casting T1 to T2 is casting away constness
9502 if and only if there is no implicit conversion from T1 to T2. */
9505 casts_away_constness_r (tree
*t1
, tree
*t2
, tsubst_flags_t complain
)
9510 /* [expr.const.cast]
9512 For multi-level pointer to members and multi-level mixed pointers
9513 and pointers to members (conv.qual), the "member" aspect of a
9514 pointer to member level is ignored when determining if a const
9515 cv-qualifier has been cast away. */
9516 /* [expr.const.cast]
9518 For two pointer types:
9520 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9521 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9524 casting from X1 to X2 casts away constness if, for a non-pointer
9525 type T there does not exist an implicit conversion (clause
9528 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9532 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9533 if ((!TYPE_PTR_P (*t1
) && !TYPE_PTRDATAMEM_P (*t1
))
9534 || (!TYPE_PTR_P (*t2
) && !TYPE_PTRDATAMEM_P (*t2
)))
9536 *t1
= cp_build_qualified_type (void_type_node
,
9537 cp_type_quals (*t1
));
9538 *t2
= cp_build_qualified_type (void_type_node
,
9539 cp_type_quals (*t2
));
9543 quals1
= cp_type_quals (*t1
);
9544 quals2
= cp_type_quals (*t2
);
9546 if (TYPE_PTRDATAMEM_P (*t1
))
9547 *t1
= TYPE_PTRMEM_POINTED_TO_TYPE (*t1
);
9549 *t1
= TREE_TYPE (*t1
);
9550 if (TYPE_PTRDATAMEM_P (*t2
))
9551 *t2
= TYPE_PTRMEM_POINTED_TO_TYPE (*t2
);
9553 *t2
= TREE_TYPE (*t2
);
9555 casts_away_constness_r (t1
, t2
, complain
);
9556 *t1
= build_pointer_type (*t1
);
9557 *t2
= build_pointer_type (*t2
);
9558 *t1
= cp_build_qualified_type (*t1
, quals1
);
9559 *t2
= cp_build_qualified_type (*t2
, quals2
);
9562 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9565 ??? This function returns non-zero if casting away qualifiers not
9566 just const. We would like to return to the caller exactly which
9567 qualifiers are casted away to give more accurate diagnostics.
9571 casts_away_constness (tree t1
, tree t2
, tsubst_flags_t complain
)
9573 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
9575 /* [expr.const.cast]
9577 Casting from an lvalue of type T1 to an lvalue of type T2
9578 using a reference cast casts away constness if a cast from an
9579 rvalue of type "pointer to T1" to the type "pointer to T2"
9580 casts away constness. */
9581 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
? TREE_TYPE (t1
) : t1
);
9582 return casts_away_constness (build_pointer_type (t1
),
9583 build_pointer_type (TREE_TYPE (t2
)),
9587 if (TYPE_PTRDATAMEM_P (t1
) && TYPE_PTRDATAMEM_P (t2
))
9588 /* [expr.const.cast]
9590 Casting from an rvalue of type "pointer to data member of X
9591 of type T1" to the type "pointer to data member of Y of type
9592 T2" casts away constness if a cast from an rvalue of type
9593 "pointer to T1" to the type "pointer to T2" casts away
9595 return casts_away_constness
9596 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1
)),
9597 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2
)),
9600 /* Casting away constness is only something that makes sense for
9601 pointer or reference types. */
9602 if (!TYPE_PTR_P (t1
) || !TYPE_PTR_P (t2
))
9605 /* Top-level qualifiers don't matter. */
9606 t1
= TYPE_MAIN_VARIANT (t1
);
9607 t2
= TYPE_MAIN_VARIANT (t2
);
9608 casts_away_constness_r (&t1
, &t2
, complain
);
9609 if (!can_convert (t2
, t1
, complain
))
9615 /* If T is a REFERENCE_TYPE return the type to which T refers.
9616 Otherwise, return T itself. */
9619 non_reference (tree t
)
9621 if (t
&& TREE_CODE (t
) == REFERENCE_TYPE
)
9627 /* Return nonzero if REF is an lvalue valid for this language;
9628 otherwise, print an error message and return zero. USE says
9629 how the lvalue is being used and so selects the error message. */
9632 lvalue_or_else (tree ref
, enum lvalue_use use
, tsubst_flags_t complain
)
9634 cp_lvalue_kind kind
= lvalue_kind (ref
);
9636 if (kind
== clk_none
)
9638 if (complain
& tf_error
)
9639 lvalue_error (input_location
, use
);
9642 else if (kind
& (clk_rvalueref
|clk_class
))
9644 if (!(complain
& tf_error
))
9646 if (kind
& clk_class
)
9647 /* Make this a permerror because we used to accept it. */
9648 permerror (input_location
, "using temporary as lvalue");
9650 error ("using xvalue (rvalue reference) as lvalue");
9655 /* Return true if a user-defined literal operator is a raw operator. */
9658 check_raw_literal_operator (const_tree decl
)
9660 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9663 bool maybe_raw_p
= false;
9665 /* Count the number and type of arguments and check for ellipsis. */
9666 for (argtype
= argtypes
, arity
= 0;
9667 argtype
&& argtype
!= void_list_node
;
9668 ++arity
, argtype
= TREE_CHAIN (argtype
))
9670 tree t
= TREE_VALUE (argtype
);
9672 if (same_type_p (t
, const_string_type_node
))
9676 return false; /* Found ellipsis. */
9678 if (!maybe_raw_p
|| arity
!= 1)
9685 /* Return true if a user-defined literal operator has one of the allowed
9689 check_literal_operator_args (const_tree decl
,
9690 bool *long_long_unsigned_p
, bool *long_double_p
)
9692 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
9694 *long_long_unsigned_p
= false;
9695 *long_double_p
= false;
9696 if (processing_template_decl
|| processing_specialization
)
9697 return argtypes
== void_list_node
;
9704 /* Count the number and type of arguments and check for ellipsis. */
9705 for (argtype
= argtypes
, arity
= 0;
9706 argtype
&& argtype
!= void_list_node
;
9707 argtype
= TREE_CHAIN (argtype
))
9709 tree t
= TREE_VALUE (argtype
);
9714 bool maybe_raw_p
= false;
9716 if (cp_type_quals (t
) != TYPE_QUAL_CONST
)
9718 t
= TYPE_MAIN_VARIANT (t
);
9719 if ((maybe_raw_p
= same_type_p (t
, char_type_node
))
9720 || same_type_p (t
, wchar_type_node
)
9721 || same_type_p (t
, char16_type_node
)
9722 || same_type_p (t
, char32_type_node
))
9724 argtype
= TREE_CHAIN (argtype
);
9727 t
= TREE_VALUE (argtype
);
9728 if (maybe_raw_p
&& argtype
== void_list_node
)
9730 else if (same_type_p (t
, size_type_node
))
9739 else if (same_type_p (t
, long_long_unsigned_type_node
))
9742 *long_long_unsigned_p
= true;
9744 else if (same_type_p (t
, long_double_type_node
))
9747 *long_double_p
= true;
9749 else if (same_type_p (t
, char_type_node
))
9751 else if (same_type_p (t
, wchar_type_node
))
9753 else if (same_type_p (t
, char16_type_node
))
9755 else if (same_type_p (t
, char32_type_node
))
9761 return false; /* Found ellipsis. */
9763 if (arity
!= max_arity
)
9770 /* Always returns false since unlike C90, C++ has no concept of implicit
9771 function declarations. */
9774 c_decl_implicit (const_tree
)