1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987-2015 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* This file is part of the C++ front end.
23 It contains routines to build C++ expressions given their operands,
24 including computing the types of the result, C and C++ specific error
25 checks, and some optimization. */
29 #include "coretypes.h"
34 #include "double-int.h"
41 #include "fold-const.h"
42 #include "stor-layout.h"
46 #include "diagnostic.h"
50 #include "c-family/c-common.h"
51 #include "c-family/c-objc.h"
52 #include "c-family/c-ubsan.h"
55 static tree cp_build_addr_expr_strict (tree, tsubst_flags_t);
56 static tree cp_build_function_call (tree, tree, tsubst_flags_t);
57 static tree pfn_from_ptrmemfunc (tree);
58 static tree delta_from_ptrmemfunc (tree);
59 static tree convert_for_assignment (tree, tree, impl_conv_rhs, tree, int,
61 static tree cp_pointer_int_sum (enum tree_code, tree, tree, tsubst_flags_t);
62 static tree rationalize_conditional_expr (enum tree_code, tree,
64 static int comp_ptr_ttypes_real (tree, tree, int);
65 static bool comp_except_types (tree, tree, bool);
66 static bool comp_array_types (const_tree, const_tree, bool);
67 static tree pointer_diff (tree, tree, tree, tsubst_flags_t);
68 static tree get_delta_difference (tree, tree, bool, bool, tsubst_flags_t);
69 static void casts_away_constness_r (tree *, tree *, tsubst_flags_t);
70 static bool casts_away_constness (tree, tree, tsubst_flags_t);
71 static bool maybe_warn_about_returning_address_of_local (tree);
72 static tree lookup_destructor (tree, tree, tree, tsubst_flags_t);
73 static void warn_args_num (location_t, tree, bool);
74 static int convert_arguments (tree, vec<tree, va_gc> **, tree, int,
77 /* Do `exp = require_complete_type (exp);' to make sure exp
78 does not have an incomplete type. (That includes void types.)
79 Returns error_mark_node if the VALUE does not have
80 complete type when this function returns. */
83 require_complete_type_sfinae (tree value, tsubst_flags_t complain)
87 if (processing_template_decl || value == error_mark_node)
90 if (TREE_CODE (value) == OVERLOAD)
91 type = unknown_type_node;
93 type = TREE_TYPE (value);
95 if (type == error_mark_node)
96 return error_mark_node;
98 /* First, detect a valid value with a complete type. */
99 if (COMPLETE_TYPE_P (type))
102 if (complete_type_or_maybe_complain (type, value, complain))
105 return error_mark_node;
109 require_complete_type (tree value)
111 return require_complete_type_sfinae (value, tf_warning_or_error);
114 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
115 a template instantiation, do the instantiation. Returns TYPE,
116 whether or not it could be completed, unless something goes
117 horribly wrong, in which case the error_mark_node is returned. */
120 complete_type (tree type)
122 if (type == NULL_TREE)
123 /* Rather than crash, we return something sure to cause an error
125 return error_mark_node;
127 if (type == error_mark_node || COMPLETE_TYPE_P (type))
129 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
131 tree t = complete_type (TREE_TYPE (type));
132 unsigned int needs_constructing, has_nontrivial_dtor;
133 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
136 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
138 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
139 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
141 TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
142 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
145 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
146 instantiate_class_template (TYPE_MAIN_VARIANT (type));
151 /* Like complete_type, but issue an error if the TYPE cannot be completed.
152 VALUE is used for informative diagnostics.
153 Returns NULL_TREE if the type cannot be made complete. */
156 complete_type_or_maybe_complain (tree type, tree value, tsubst_flags_t complain)
158 type = complete_type (type);
159 if (type == error_mark_node)
160 /* We already issued an error. */
162 else if (!COMPLETE_TYPE_P (type))
164 if (complain & tf_error)
165 cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
173 complete_type_or_else (tree type, tree value)
175 return complete_type_or_maybe_complain (type, value, tf_warning_or_error);
178 /* Return truthvalue of whether type of EXP is instantiated. */
181 type_unknown_p (const_tree exp)
183 return (TREE_CODE (exp) == TREE_LIST
184 || TREE_TYPE (exp) == unknown_type_node);
188 /* Return the common type of two parameter lists.
189 We assume that comptypes has already been done and returned 1;
190 if that isn't so, this may crash.
192 As an optimization, free the space we allocate if the parameter
193 lists are already common. */
196 commonparms (tree p1, tree p2)
198 tree oldargs = p1, newargs, n;
202 len = list_length (p1);
203 newargs = tree_last (p1);
205 if (newargs == void_list_node)
214 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
219 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
221 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
223 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
226 else if (! TREE_PURPOSE (p1))
228 if (TREE_PURPOSE (p2))
230 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
236 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
238 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
240 if (TREE_VALUE (p1) != TREE_VALUE (p2))
243 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
246 TREE_VALUE (n) = TREE_VALUE (p1);
254 /* Given a type, perhaps copied for a typedef,
255 find the "original" version of it. */
257 original_type (tree t)
259 int quals = cp_type_quals (t);
260 while (t != error_mark_node
261 && TYPE_NAME (t) != NULL_TREE)
263 tree x = TYPE_NAME (t);
264 if (TREE_CODE (x) != TYPE_DECL)
266 x = DECL_ORIGINAL_TYPE (x);
271 return cp_build_qualified_type (t, quals);
274 /* Return the common type for two arithmetic types T1 and T2 under the
275 usual arithmetic conversions. The default conversions have already
276 been applied, and enumerated types converted to their compatible
280 cp_common_type (tree t1, tree t2)
282 enum tree_code code1 = TREE_CODE (t1);
283 enum tree_code code2 = TREE_CODE (t2);
288 /* In what follows, we slightly generalize the rules given in [expr] so
289 as to deal with `long long' and `complex'. First, merge the
291 attributes = (*targetm.merge_type_attributes) (t1, t2);
293 if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
295 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
296 return build_type_attribute_variant (t1, attributes);
301 /* FIXME: Attributes. */
302 gcc_assert (ARITHMETIC_TYPE_P (t1)
303 || TREE_CODE (t1) == VECTOR_TYPE
304 || UNSCOPED_ENUM_P (t1));
305 gcc_assert (ARITHMETIC_TYPE_P (t2)
306 || TREE_CODE (t2) == VECTOR_TYPE
307 || UNSCOPED_ENUM_P (t2));
309 /* If one type is complex, form the common type of the non-complex
310 components, then make that complex. Use T1 or T2 if it is the
312 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
314 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
315 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
317 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
319 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
320 return build_type_attribute_variant (t1, attributes);
321 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
322 return build_type_attribute_variant (t2, attributes);
324 return build_type_attribute_variant (build_complex_type (subtype),
328 if (code1 == VECTOR_TYPE)
330 /* When we get here we should have two vectors of the same size.
331 Just prefer the unsigned one if present. */
332 if (TYPE_UNSIGNED (t1))
333 return build_type_attribute_variant (t1, attributes);
335 return build_type_attribute_variant (t2, attributes);
338 /* If only one is real, use it as the result. */
339 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
340 return build_type_attribute_variant (t1, attributes);
341 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
342 return build_type_attribute_variant (t2, attributes);
344 /* Both real or both integers; use the one with greater precision. */
345 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
346 return build_type_attribute_variant (t1, attributes);
347 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
348 return build_type_attribute_variant (t2, attributes);
350 /* The types are the same; no need to do anything fancy. */
351 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
352 return build_type_attribute_variant (t1, attributes);
354 if (code1 != REAL_TYPE)
356 /* If one is unsigned long long, then convert the other to unsigned
358 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
359 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
360 return build_type_attribute_variant (long_long_unsigned_type_node,
362 /* If one is a long long, and the other is an unsigned long, and
363 long long can represent all the values of an unsigned long, then
364 convert to a long long. Otherwise, convert to an unsigned long
365 long. Otherwise, if either operand is long long, convert the
368 Since we're here, we know the TYPE_PRECISION is the same;
369 therefore converting to long long cannot represent all the values
370 of an unsigned long, so we choose unsigned long long in that
372 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
373 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
375 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
376 ? long_long_unsigned_type_node
377 : long_long_integer_type_node);
378 return build_type_attribute_variant (t, attributes);
381 /* Go through the same procedure, but for longs. */
382 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
383 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
384 return build_type_attribute_variant (long_unsigned_type_node,
386 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
387 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
389 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
390 ? long_unsigned_type_node : long_integer_type_node);
391 return build_type_attribute_variant (t, attributes);
394 /* For __intN types, either the type is __int128 (and is lower
395 priority than the types checked above, but higher than other
396 128-bit types) or it's known to not be the same size as other
397 types (enforced in toplev.c). Prefer the unsigned type. */
398 for (i = 0; i < NUM_INT_N_ENTS; i ++)
400 if (int_n_enabled_p [i]
401 && (same_type_p (TYPE_MAIN_VARIANT (t1), int_n_trees[i].signed_type)
402 || same_type_p (TYPE_MAIN_VARIANT (t2), int_n_trees[i].signed_type)
403 || same_type_p (TYPE_MAIN_VARIANT (t1), int_n_trees[i].unsigned_type)
404 || same_type_p (TYPE_MAIN_VARIANT (t2), int_n_trees[i].unsigned_type)))
406 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
407 ? int_n_trees[i].unsigned_type
408 : int_n_trees[i].signed_type);
409 return build_type_attribute_variant (t, attributes);
413 /* Otherwise prefer the unsigned one. */
414 if (TYPE_UNSIGNED (t1))
415 return build_type_attribute_variant (t1, attributes);
417 return build_type_attribute_variant (t2, attributes);
421 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
422 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
423 return build_type_attribute_variant (long_double_type_node,
425 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
426 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
427 return build_type_attribute_variant (double_type_node,
429 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
430 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
431 return build_type_attribute_variant (float_type_node,
434 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
435 the standard C++ floating-point types. Logic earlier in this
436 function has already eliminated the possibility that
437 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
438 compelling reason to choose one or the other. */
439 return build_type_attribute_variant (t1, attributes);
443 /* T1 and T2 are arithmetic or enumeration types. Return the type
444 that will result from the "usual arithmetic conversions" on T1 and
445 T2 as described in [expr]. */
448 type_after_usual_arithmetic_conversions (tree t1, tree t2)
450 gcc_assert (ARITHMETIC_TYPE_P (t1)
451 || TREE_CODE (t1) == VECTOR_TYPE
452 || UNSCOPED_ENUM_P (t1));
453 gcc_assert (ARITHMETIC_TYPE_P (t2)
454 || TREE_CODE (t2) == VECTOR_TYPE
455 || UNSCOPED_ENUM_P (t2));
457 /* Perform the integral promotions. We do not promote real types here. */
458 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
459 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
461 t1 = type_promotes_to (t1);
462 t2 = type_promotes_to (t2);
465 return cp_common_type (t1, t2);
469 composite_pointer_error (diagnostic_t kind, tree t1, tree t2,
470 composite_pointer_operation operation)
475 emit_diagnostic (kind, input_location, 0,
476 "comparison between "
477 "distinct pointer types %qT and %qT lacks a cast",
481 emit_diagnostic (kind, input_location, 0,
482 "conversion between "
483 "distinct pointer types %qT and %qT lacks a cast",
486 case CPO_CONDITIONAL_EXPR:
487 emit_diagnostic (kind, input_location, 0,
488 "conditional expression between "
489 "distinct pointer types %qT and %qT lacks a cast",
497 /* Subroutine of composite_pointer_type to implement the recursive
498 case. See that function for documentation of the parameters. */
501 composite_pointer_type_r (tree t1, tree t2,
502 composite_pointer_operation operation,
503 tsubst_flags_t complain)
510 /* Determine the types pointed to by T1 and T2. */
513 pointee1 = TREE_TYPE (t1);
514 pointee2 = TREE_TYPE (t2);
518 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
519 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
524 Otherwise, the composite pointer type is a pointer type
525 similar (_conv.qual_) to the type of one of the operands,
526 with a cv-qualification signature (_conv.qual_) that is the
527 union of the cv-qualification signatures of the operand
529 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
530 result_type = pointee1;
531 else if ((TYPE_PTR_P (pointee1) && TYPE_PTR_P (pointee2))
532 || (TYPE_PTRMEM_P (pointee1) && TYPE_PTRMEM_P (pointee2)))
534 result_type = composite_pointer_type_r (pointee1, pointee2, operation,
536 if (result_type == error_mark_node)
537 return error_mark_node;
541 if (complain & tf_error)
542 composite_pointer_error (DK_PERMERROR, t1, t2, operation);
544 return error_mark_node;
545 result_type = void_type_node;
547 result_type = cp_build_qualified_type (result_type,
548 (cp_type_quals (pointee1)
549 | cp_type_quals (pointee2)));
550 /* If the original types were pointers to members, so is the
552 if (TYPE_PTRMEM_P (t1))
554 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
555 TYPE_PTRMEM_CLASS_TYPE (t2)))
557 if (complain & tf_error)
558 composite_pointer_error (DK_PERMERROR, t1, t2, operation);
560 return error_mark_node;
562 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
566 result_type = build_pointer_type (result_type);
568 /* Merge the attributes. */
569 attributes = (*targetm.merge_type_attributes) (t1, t2);
570 return build_type_attribute_variant (result_type, attributes);
573 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
574 ARG1 and ARG2 are the values with those types. The OPERATION is to
575 describe the operation between the pointer types,
576 in case an error occurs.
578 This routine also implements the computation of a common type for
579 pointers-to-members as per [expr.eq]. */
582 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
583 composite_pointer_operation operation,
584 tsubst_flags_t complain)
591 If one operand is a null pointer constant, the composite pointer
592 type is the type of the other operand. */
593 if (null_ptr_cst_p (arg1))
595 if (null_ptr_cst_p (arg2))
602 If one of the operands has type "pointer to cv1 void*", then
603 the other has type "pointer to cv2T", and the composite pointer
604 type is "pointer to cv12 void", where cv12 is the union of cv1
607 If either type is a pointer to void, make sure it is T1. */
608 if (TYPE_PTR_P (t2) && VOID_TYPE_P (TREE_TYPE (t2)))
616 /* Now, if T1 is a pointer to void, merge the qualifiers. */
617 if (TYPE_PTR_P (t1) && VOID_TYPE_P (TREE_TYPE (t1)))
622 if (TYPE_PTRFN_P (t2))
624 if (complain & tf_error)
629 pedwarn (input_location, OPT_Wpedantic,
630 "ISO C++ forbids comparison between pointer "
631 "of type %<void *%> and pointer-to-function");
634 pedwarn (input_location, OPT_Wpedantic,
635 "ISO C++ forbids conversion between pointer "
636 "of type %<void *%> and pointer-to-function");
638 case CPO_CONDITIONAL_EXPR:
639 pedwarn (input_location, OPT_Wpedantic,
640 "ISO C++ forbids conditional expression between "
641 "pointer of type %<void *%> and "
642 "pointer-to-function");
649 return error_mark_node;
652 = cp_build_qualified_type (void_type_node,
653 (cp_type_quals (TREE_TYPE (t1))
654 | cp_type_quals (TREE_TYPE (t2))));
655 result_type = build_pointer_type (result_type);
656 /* Merge the attributes. */
657 attributes = (*targetm.merge_type_attributes) (t1, t2);
658 return build_type_attribute_variant (result_type, attributes);
661 if (c_dialect_objc () && TYPE_PTR_P (t1)
664 if (objc_have_common_type (t1, t2, -3, NULL_TREE))
665 return objc_common_type (t1, t2);
668 /* [expr.eq] permits the application of a pointer conversion to
669 bring the pointers to a common type. */
670 if (TYPE_PTR_P (t1) && TYPE_PTR_P (t2)
671 && CLASS_TYPE_P (TREE_TYPE (t1))
672 && CLASS_TYPE_P (TREE_TYPE (t2))
673 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
676 class1 = TREE_TYPE (t1);
677 class2 = TREE_TYPE (t2);
679 if (DERIVED_FROM_P (class1, class2))
680 t2 = (build_pointer_type
681 (cp_build_qualified_type (class1, cp_type_quals (class2))));
682 else if (DERIVED_FROM_P (class2, class1))
683 t1 = (build_pointer_type
684 (cp_build_qualified_type (class2, cp_type_quals (class1))));
687 if (complain & tf_error)
688 composite_pointer_error (DK_ERROR, t1, t2, operation);
689 return error_mark_node;
692 /* [expr.eq] permits the application of a pointer-to-member
693 conversion to change the class type of one of the types. */
694 else if (TYPE_PTRMEM_P (t1)
695 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
696 TYPE_PTRMEM_CLASS_TYPE (t2)))
698 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
699 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
701 if (DERIVED_FROM_P (class1, class2))
702 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
703 else if (DERIVED_FROM_P (class2, class1))
704 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
707 if (complain & tf_error)
711 error ("comparison between distinct "
712 "pointer-to-member types %qT and %qT lacks a cast",
716 error ("conversion between distinct "
717 "pointer-to-member types %qT and %qT lacks a cast",
720 case CPO_CONDITIONAL_EXPR:
721 error ("conditional expression between distinct "
722 "pointer-to-member types %qT and %qT lacks a cast",
728 return error_mark_node;
732 return composite_pointer_type_r (t1, t2, operation, complain);
735 /* Return the merged type of two types.
736 We assume that comptypes has already been done and returned 1;
737 if that isn't so, this may crash.
739 This just combines attributes and default arguments; any other
740 differences would cause the two types to compare unalike. */
743 merge_types (tree t1, tree t2)
745 enum tree_code code1;
746 enum tree_code code2;
749 /* Save time if the two types are the same. */
752 if (original_type (t1) == original_type (t2))
755 /* If one type is nonsense, use the other. */
756 if (t1 == error_mark_node)
758 if (t2 == error_mark_node)
761 /* Handle merging an auto redeclaration with a previous deduced
766 /* Merge the attributes. */
767 attributes = (*targetm.merge_type_attributes) (t1, t2);
769 if (TYPE_PTRMEMFUNC_P (t1))
770 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
771 if (TYPE_PTRMEMFUNC_P (t2))
772 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
774 code1 = TREE_CODE (t1);
775 code2 = TREE_CODE (t2);
778 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
779 if (code1 == TYPENAME_TYPE)
781 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
782 code1 = TREE_CODE (t1);
786 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
787 code2 = TREE_CODE (t2);
795 /* For two pointers, do this recursively on the target type. */
797 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
798 int quals = cp_type_quals (t1);
800 if (code1 == POINTER_TYPE)
801 t1 = build_pointer_type (target);
803 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
804 t1 = build_type_attribute_variant (t1, attributes);
805 t1 = cp_build_qualified_type (t1, quals);
807 if (TREE_CODE (target) == METHOD_TYPE)
808 t1 = build_ptrmemfunc_type (t1);
817 quals = cp_type_quals (t1);
818 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
819 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
820 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
822 t1 = cp_build_qualified_type (t1, quals);
828 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
829 /* Save space: see if the result is identical to one of the args. */
830 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
831 return build_type_attribute_variant (t1, attributes);
832 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
833 return build_type_attribute_variant (t2, attributes);
834 /* Merge the element types, and have a size if either arg has one. */
835 t1 = build_cplus_array_type
836 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
841 /* Function types: prefer the one that specified arg types.
842 If both do, merge the arg types. Also merge the return types. */
844 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
845 tree p1 = TYPE_ARG_TYPES (t1);
846 tree p2 = TYPE_ARG_TYPES (t2);
849 bool late_return_type_p = TYPE_HAS_LATE_RETURN_TYPE (t1);
851 /* Save space: see if the result is identical to one of the args. */
852 if (valtype == TREE_TYPE (t1) && ! p2)
853 return cp_build_type_attribute_variant (t1, attributes);
854 if (valtype == TREE_TYPE (t2) && ! p1)
855 return cp_build_type_attribute_variant (t2, attributes);
857 /* Simple way if one arg fails to specify argument types. */
858 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
860 else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
863 parms = commonparms (p1, p2);
865 rval = build_function_type (valtype, parms);
866 gcc_assert (type_memfn_quals (t1) == type_memfn_quals (t2));
867 gcc_assert (type_memfn_rqual (t1) == type_memfn_rqual (t2));
868 rval = apply_memfn_quals (rval,
869 type_memfn_quals (t1),
870 type_memfn_rqual (t1));
871 raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
872 TYPE_RAISES_EXCEPTIONS (t2));
873 t1 = build_exception_variant (rval, raises);
874 if (late_return_type_p)
875 TYPE_HAS_LATE_RETURN_TYPE (t1) = 1;
881 /* Get this value the long way, since TYPE_METHOD_BASETYPE
882 is just the main variant of this. */
883 tree basetype = class_of_this_parm (t2);
884 tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
885 TYPE_RAISES_EXCEPTIONS (t2));
886 cp_ref_qualifier rqual = type_memfn_rqual (t1);
888 bool late_return_type_1_p = TYPE_HAS_LATE_RETURN_TYPE (t1);
889 bool late_return_type_2_p = TYPE_HAS_LATE_RETURN_TYPE (t2);
891 /* If this was a member function type, get back to the
892 original type of type member function (i.e., without
893 the class instance variable up front. */
894 t1 = build_function_type (TREE_TYPE (t1),
895 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
896 t2 = build_function_type (TREE_TYPE (t2),
897 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
898 t3 = merge_types (t1, t2);
899 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
900 TYPE_ARG_TYPES (t3));
901 t1 = build_exception_variant (t3, raises);
902 t1 = build_ref_qualified_type (t1, rqual);
903 if (late_return_type_1_p)
904 TYPE_HAS_LATE_RETURN_TYPE (t1) = 1;
905 if (late_return_type_2_p)
906 TYPE_HAS_LATE_RETURN_TYPE (t2) = 1;
911 /* There is no need to merge attributes into a TYPENAME_TYPE.
912 When the type is instantiated it will have whatever
913 attributes result from the instantiation. */
919 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
921 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
924 return cp_build_type_attribute_variant (t1, attributes);
927 /* Return the ARRAY_TYPE type without its domain. */
930 strip_array_domain (tree type)
933 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
934 if (TYPE_DOMAIN (type) == NULL_TREE)
936 t2 = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
937 return cp_build_type_attribute_variant (t2, TYPE_ATTRIBUTES (type));
940 /* Wrapper around cp_common_type that is used by c-common.c and other
941 front end optimizations that remove promotions.
943 Return the common type for two arithmetic types T1 and T2 under the
944 usual arithmetic conversions. The default conversions have already
945 been applied, and enumerated types converted to their compatible
949 common_type (tree t1, tree t2)
951 /* If one type is nonsense, use the other */
952 if (t1 == error_mark_node)
954 if (t2 == error_mark_node)
957 return cp_common_type (t1, t2);
960 /* Return the common type of two pointer types T1 and T2. This is the
961 type for the result of most arithmetic operations if the operands
962 have the given two types.
964 We assume that comp_target_types has already been done and returned
965 nonzero; if that isn't so, this may crash. */
968 common_pointer_type (tree t1, tree t2)
970 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
971 || (TYPE_PTRDATAMEM_P (t1) && TYPE_PTRDATAMEM_P (t2))
972 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
974 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
975 CPO_CONVERSION, tf_warning_or_error);
978 /* Compare two exception specifier types for exactness or subsetness, if
979 allowed. Returns false for mismatch, true for match (same, or
982 [except.spec] "If a class X ... objects of class X or any class publicly
983 and unambiguously derived from X. Similarly, if a pointer type Y * ...
984 exceptions of type Y * or that are pointers to any type publicly and
985 unambiguously derived from Y. Otherwise a function only allows exceptions
986 that have the same type ..."
987 This does not mention cv qualifiers and is different to what throw
988 [except.throw] and catch [except.catch] will do. They will ignore the
989 top level cv qualifiers, and allow qualifiers in the pointer to class
992 We implement the letter of the standard. */
995 comp_except_types (tree a, tree b, bool exact)
997 if (same_type_p (a, b))
1001 if (cp_type_quals (a) || cp_type_quals (b))
1004 if (TYPE_PTR_P (a) && TYPE_PTR_P (b))
1008 if (cp_type_quals (a) || cp_type_quals (b))
1012 if (TREE_CODE (a) != RECORD_TYPE
1013 || TREE_CODE (b) != RECORD_TYPE)
1016 if (publicly_uniquely_derived_p (a, b))
1022 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
1023 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
1024 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1025 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1026 are unordered, but we've already filtered out duplicates. Most lists will
1027 be in order, we should try to make use of that. */
1030 comp_except_specs (const_tree t1, const_tree t2, int exact)
1039 /* First handle noexcept. */
1040 if (exact < ce_exact)
1042 /* noexcept(false) is compatible with no exception-specification,
1043 and stricter than any spec. */
1044 if (t1 == noexcept_false_spec)
1045 return t2 == NULL_TREE || exact == ce_derived;
1046 /* Even a derived noexcept(false) is compatible with no
1047 exception-specification. */
1048 if (t2 == noexcept_false_spec)
1049 return t1 == NULL_TREE;
1051 /* Otherwise, if we aren't looking for an exact match, noexcept is
1052 equivalent to throw(). */
1053 if (t1 == noexcept_true_spec)
1054 t1 = empty_except_spec;
1055 if (t2 == noexcept_true_spec)
1056 t2 = empty_except_spec;
1059 /* If any noexcept is left, it is only comparable to itself;
1060 either we're looking for an exact match or we're redeclaring a
1061 template with dependent noexcept. */
1062 if ((t1 && TREE_PURPOSE (t1))
1063 || (t2 && TREE_PURPOSE (t2)))
1065 && cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)));
1067 if (t1 == NULL_TREE) /* T1 is ... */
1068 return t2 == NULL_TREE || exact == ce_derived;
1069 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
1070 return t2 != NULL_TREE && !TREE_VALUE (t2);
1071 if (t2 == NULL_TREE) /* T2 is ... */
1073 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1074 return exact == ce_derived;
1076 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1077 Count how many we find, to determine exactness. For exact matching and
1078 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1080 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1082 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1084 tree a = TREE_VALUE (probe);
1085 tree b = TREE_VALUE (t2);
1087 if (comp_except_types (a, b, exact))
1089 if (probe == base && exact > ce_derived)
1090 base = TREE_CHAIN (probe);
1095 if (probe == NULL_TREE)
1098 return exact == ce_derived || base == NULL_TREE || length == list_length (t1);
1101 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1102 [] can match [size]. */
1105 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1114 /* The type of the array elements must be the same. */
1115 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1118 d1 = TYPE_DOMAIN (t1);
1119 d2 = TYPE_DOMAIN (t2);
1124 /* If one of the arrays is dimensionless, and the other has a
1125 dimension, they are of different types. However, it is valid to
1133 declarations for an array object can specify
1134 array types that differ by the presence or absence of a major
1135 array bound (_dcl.array_). */
1137 return allow_redeclaration;
1139 /* Check that the dimensions are the same. */
1141 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1143 max1 = TYPE_MAX_VALUE (d1);
1144 max2 = TYPE_MAX_VALUE (d2);
1146 if (!cp_tree_equal (max1, max2))
1152 /* Compare the relative position of T1 and T2 into their respective
1153 template parameter list.
1154 T1 and T2 must be template parameter types.
1155 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1158 comp_template_parms_position (tree t1, tree t2)
1160 tree index1, index2;
1161 gcc_assert (t1 && t2
1162 && TREE_CODE (t1) == TREE_CODE (t2)
1163 && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1164 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1165 || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1167 index1 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1));
1168 index2 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2));
1170 /* Then compare their relative position. */
1171 if (TEMPLATE_PARM_IDX (index1) != TEMPLATE_PARM_IDX (index2)
1172 || TEMPLATE_PARM_LEVEL (index1) != TEMPLATE_PARM_LEVEL (index2)
1173 || (TEMPLATE_PARM_PARAMETER_PACK (index1)
1174 != TEMPLATE_PARM_PARAMETER_PACK (index2)))
1177 /* In C++14 we can end up comparing 'auto' to a normal template
1178 parameter. Don't confuse them. */
1179 if (cxx_dialect >= cxx14 && (is_auto (t1) || is_auto (t2)))
1180 return TYPE_IDENTIFIER (t1) == TYPE_IDENTIFIER (t2);
1185 /* Subroutine in comptypes. */
1188 structural_comptypes (tree t1, tree t2, int strict)
1193 /* Suppress errors caused by previously reported errors. */
1194 if (t1 == error_mark_node || t2 == error_mark_node)
1197 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1199 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1200 current instantiation. */
1201 if (TREE_CODE (t1) == TYPENAME_TYPE)
1202 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1204 if (TREE_CODE (t2) == TYPENAME_TYPE)
1205 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1207 if (TYPE_PTRMEMFUNC_P (t1))
1208 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1209 if (TYPE_PTRMEMFUNC_P (t2))
1210 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1212 /* Different classes of types can't be compatible. */
1213 if (TREE_CODE (t1) != TREE_CODE (t2))
1216 /* Qualifiers must match. For array types, we will check when we
1217 recur on the array element types. */
1218 if (TREE_CODE (t1) != ARRAY_TYPE
1219 && cp_type_quals (t1) != cp_type_quals (t2))
1221 if (TREE_CODE (t1) == FUNCTION_TYPE
1222 && type_memfn_quals (t1) != type_memfn_quals (t2))
1224 /* Need to check this before TYPE_MAIN_VARIANT.
1225 FIXME function qualifiers should really change the main variant. */
1226 if ((TREE_CODE (t1) == FUNCTION_TYPE
1227 || TREE_CODE (t1) == METHOD_TYPE)
1228 && type_memfn_rqual (t1) != type_memfn_rqual (t2))
1230 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1233 /* Allow for two different type nodes which have essentially the same
1234 definition. Note that we already checked for equality of the type
1235 qualifiers (just above). */
1237 if (TREE_CODE (t1) != ARRAY_TYPE
1238 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1242 /* Compare the types. Break out if they could be the same. */
1243 switch (TREE_CODE (t1))
1247 /* All void and bool types are the same. */
1251 case FIXED_POINT_TYPE:
1253 /* With these nodes, we can't determine type equivalence by
1254 looking at what is stored in the nodes themselves, because
1255 two nodes might have different TYPE_MAIN_VARIANTs but still
1256 represent the same type. For example, wchar_t and int could
1257 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1258 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1259 and are distinct types. On the other hand, int and the
1262 typedef int INT __attribute((may_alias));
1264 have identical properties, different TYPE_MAIN_VARIANTs, but
1265 represent the same type. The canonical type system keeps
1266 track of equivalence in this case, so we fall back on it. */
1267 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1269 case TEMPLATE_TEMPLATE_PARM:
1270 case BOUND_TEMPLATE_TEMPLATE_PARM:
1271 if (!comp_template_parms_position (t1, t2))
1273 if (!comp_template_parms
1274 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1275 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1277 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1279 /* Don't check inheritance. */
1280 strict = COMPARE_STRICT;
1285 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1286 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1287 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1288 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1291 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1293 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1299 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1300 strict & ~COMPARE_REDECLARATION))
1302 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1306 case REFERENCE_TYPE:
1307 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1309 /* fall through to checks for pointer types */
1312 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1313 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1314 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1320 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1322 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1327 /* Target types must match incl. qualifiers. */
1328 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1332 case TEMPLATE_TYPE_PARM:
1333 /* If T1 and T2 don't have the same relative position in their
1334 template parameters set, they can't be equal. */
1335 if (!comp_template_parms_position (t1, t2))
1340 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1341 TYPENAME_TYPE_FULLNAME (t2)))
1343 /* Qualifiers don't matter on scopes. */
1344 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1),
1349 case UNBOUND_CLASS_TEMPLATE:
1350 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1352 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1357 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1362 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1363 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1367 case TYPE_PACK_EXPANSION:
1368 return (same_type_p (PACK_EXPANSION_PATTERN (t1),
1369 PACK_EXPANSION_PATTERN (t2))
1370 && comp_template_args (PACK_EXPANSION_EXTRA_ARGS (t1),
1371 PACK_EXPANSION_EXTRA_ARGS (t2)));
1374 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1375 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1376 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1377 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1378 || (DECLTYPE_FOR_LAMBDA_PROXY (t1)
1379 != DECLTYPE_FOR_LAMBDA_PROXY (t2))
1380 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1381 DECLTYPE_TYPE_EXPR (t2)))
1385 case UNDERLYING_TYPE:
1386 return same_type_p (UNDERLYING_TYPE_TYPE (t1),
1387 UNDERLYING_TYPE_TYPE (t2));
1393 /* If we get here, we know that from a target independent POV the
1394 types are the same. Make sure the target attributes are also
1396 return comp_type_attributes (t1, t2);
1399 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1400 is a bitwise-or of the COMPARE_* flags. */
1403 comptypes (tree t1, tree t2, int strict)
1405 if (strict == COMPARE_STRICT)
1410 if (t1 == error_mark_node || t2 == error_mark_node)
1413 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1414 /* At least one of the types requires structural equality, so
1415 perform a deep check. */
1416 return structural_comptypes (t1, t2, strict);
1418 #ifdef ENABLE_CHECKING
1419 if (USE_CANONICAL_TYPES)
1421 bool result = structural_comptypes (t1, t2, strict);
1423 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1424 /* The two types are structurally equivalent, but their
1425 canonical types were different. This is a failure of the
1426 canonical type propagation code.*/
1428 ("canonical types differ for identical types %T and %T",
1430 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1431 /* Two types are structurally different, but the canonical
1432 types are the same. This means we were over-eager in
1433 assigning canonical types. */
1435 ("same canonical type node for different types %T and %T",
1441 if (USE_CANONICAL_TYPES)
1442 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1445 return structural_comptypes (t1, t2, strict);
1447 else if (strict == COMPARE_STRUCTURAL)
1448 return structural_comptypes (t1, t2, COMPARE_STRICT);
1450 return structural_comptypes (t1, t2, strict);
1453 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1454 top-level qualifiers. */
1457 same_type_ignoring_top_level_qualifiers_p (tree type1, tree type2)
1459 if (type1 == error_mark_node || type2 == error_mark_node)
1462 return same_type_p (TYPE_MAIN_VARIANT (type1), TYPE_MAIN_VARIANT (type2));
1465 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1468 at_least_as_qualified_p (const_tree type1, const_tree type2)
1470 int q1 = cp_type_quals (type1);
1471 int q2 = cp_type_quals (type2);
1473 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1474 return (q1 & q2) == q2;
1477 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1478 more cv-qualified that TYPE1, and 0 otherwise. */
1481 comp_cv_qualification (int q1, int q2)
1486 if ((q1 & q2) == q2)
1488 else if ((q1 & q2) == q1)
1495 comp_cv_qualification (const_tree type1, const_tree type2)
1497 int q1 = cp_type_quals (type1);
1498 int q2 = cp_type_quals (type2);
1499 return comp_cv_qualification (q1, q2);
1502 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1503 subset of the cv-qualification signature of TYPE2, and the types
1504 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1507 comp_cv_qual_signature (tree type1, tree type2)
1509 if (comp_ptr_ttypes_real (type2, type1, -1))
1511 else if (comp_ptr_ttypes_real (type1, type2, -1))
1517 /* Subroutines of `comptypes'. */
1519 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1520 equivalent in the sense that functions with those parameter types
1521 can have equivalent types. The two lists must be equivalent,
1522 element by element. */
1525 compparms (const_tree parms1, const_tree parms2)
1529 /* An unspecified parmlist matches any specified parmlist
1530 whose argument types don't need default promotions. */
1532 for (t1 = parms1, t2 = parms2;
1534 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1536 /* If one parmlist is shorter than the other,
1537 they fail to match. */
1540 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1547 /* Process a sizeof or alignof expression where the operand is a
1551 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1556 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1557 if (type == error_mark_node)
1558 return error_mark_node;
1560 type = non_reference (type);
1561 if (TREE_CODE (type) == METHOD_TYPE)
1564 pedwarn (input_location, OPT_Wpointer_arith,
1565 "invalid application of %qs to a member function",
1566 operator_name_info[(int) op].name);
1568 return error_mark_node;
1569 value = size_one_node;
1572 dependent_p = dependent_type_p (type);
1574 complete_type (type);
1576 /* VLA types will have a non-constant size. In the body of an
1577 uninstantiated template, we don't need to try to compute the
1578 value, because the sizeof expression is not an integral
1579 constant expression in that case. And, if we do try to
1580 compute the value, we'll likely end up with SAVE_EXPRs, which
1581 the template substitution machinery does not expect to see. */
1582 || (processing_template_decl
1583 && COMPLETE_TYPE_P (type)
1584 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1586 value = build_min (op, size_type_node, type);
1587 TREE_READONLY (value) = 1;
1591 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1592 op == SIZEOF_EXPR, false,
1596 /* Return the size of the type, without producing any warnings for
1597 types whose size cannot be taken. This routine should be used only
1598 in some other routine that has already produced a diagnostic about
1599 using the size of such a type. */
1601 cxx_sizeof_nowarn (tree type)
1603 if (TREE_CODE (type) == FUNCTION_TYPE
1604 || VOID_TYPE_P (type)
1605 || TREE_CODE (type) == ERROR_MARK)
1606 return size_one_node;
1607 else if (!COMPLETE_TYPE_P (type))
1608 return size_zero_node;
1610 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1613 /* Process a sizeof expression where the operand is an expression. */
1616 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1618 if (e == error_mark_node)
1619 return error_mark_node;
1621 if (processing_template_decl)
1623 e = build_min (SIZEOF_EXPR, size_type_node, e);
1624 TREE_SIDE_EFFECTS (e) = 0;
1625 TREE_READONLY (e) = 1;
1630 /* To get the size of a static data member declared as an array of
1631 unknown bound, we need to instantiate it. */
1633 && VAR_HAD_UNKNOWN_BOUND (e)
1634 && DECL_TEMPLATE_INSTANTIATION (e))
1635 instantiate_decl (e, /*defer_ok*/true, /*expl_inst_mem*/false);
1637 if (TREE_CODE (e) == PARM_DECL
1638 && DECL_ARRAY_PARAMETER_P (e)
1639 && (complain & tf_warning))
1641 if (warning (OPT_Wsizeof_array_argument, "%<sizeof%> on array function "
1642 "parameter %qE will return size of %qT", e, TREE_TYPE (e)))
1643 inform (DECL_SOURCE_LOCATION (e), "declared here");
1646 e = mark_type_use (e);
1648 if (TREE_CODE (e) == COMPONENT_REF
1649 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1650 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1652 if (complain & tf_error)
1653 error ("invalid application of %<sizeof%> to a bit-field");
1655 return error_mark_node;
1658 else if (is_overloaded_fn (e))
1660 if (complain & tf_error)
1661 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1664 return error_mark_node;
1667 else if (type_unknown_p (e))
1669 if (complain & tf_error)
1670 cxx_incomplete_type_error (e, TREE_TYPE (e));
1672 return error_mark_node;
1678 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1681 /* Implement the __alignof keyword: Return the minimum required
1682 alignment of E, measured in bytes. For VAR_DECL's and
1683 FIELD_DECL's return DECL_ALIGN (which can be set from an
1684 "aligned" __attribute__ specification). */
1687 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1691 if (e == error_mark_node)
1692 return error_mark_node;
1694 if (processing_template_decl)
1696 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1697 TREE_SIDE_EFFECTS (e) = 0;
1698 TREE_READONLY (e) = 1;
1703 e = mark_type_use (e);
1706 t = size_int (DECL_ALIGN_UNIT (e));
1707 else if (TREE_CODE (e) == COMPONENT_REF
1708 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1709 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1711 if (complain & tf_error)
1712 error ("invalid application of %<__alignof%> to a bit-field");
1714 return error_mark_node;
1717 else if (TREE_CODE (e) == COMPONENT_REF
1718 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1719 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1720 else if (is_overloaded_fn (e))
1722 if (complain & tf_error)
1723 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1726 return error_mark_node;
1727 if (TREE_CODE (e) == FUNCTION_DECL)
1728 t = size_int (DECL_ALIGN_UNIT (e));
1732 else if (type_unknown_p (e))
1734 if (complain & tf_error)
1735 cxx_incomplete_type_error (e, TREE_TYPE (e));
1737 return error_mark_node;
1741 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1742 complain & tf_error);
1744 return fold_convert (size_type_node, t);
1747 /* Process a sizeof or alignof expression E with code OP where the operand
1748 is an expression. */
1751 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1753 if (op == SIZEOF_EXPR)
1754 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1756 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1759 /* Build a representation of an expression 'alignas(E).' Return the
1760 folded integer value of E if it is an integral constant expression
1761 that resolves to a valid alignment. If E depends on a template
1762 parameter, return a syntactic representation tree of kind
1763 ALIGNOF_EXPR. Otherwise, return an error_mark_node if the
1764 expression is ill formed, or NULL_TREE if E is NULL_TREE. */
1767 cxx_alignas_expr (tree e)
1769 if (e == NULL_TREE || e == error_mark_node
1770 || (!TYPE_P (e) && !require_potential_rvalue_constant_expression (e)))
1776 When the alignment-specifier is of the form
1777 alignas(type-id ), it shall have the same effect as
1778 alignas(alignof(type-id )). */
1780 return cxx_sizeof_or_alignof_type (e, ALIGNOF_EXPR, false);
1782 /* If we reach this point, it means the alignas expression if of
1783 the form "alignas(assignment-expression)", so we should follow
1784 what is stated by [dcl.align]/2. */
1786 if (value_dependent_expression_p (e))
1787 /* Leave value-dependent expression alone for now. */
1790 e = instantiate_non_dependent_expr (e);
1791 e = mark_rvalue_use (e);
1793 /* [dcl.align]/2 says:
1795 the assignment-expression shall be an integral constant
1798 return cxx_constant_value (e);
1802 /* EXPR is being used in a context that is not a function call.
1807 The expression can be used only as the left-hand operand of a
1808 member function call.
1810 [expr.mptr.operator]
1812 If the result of .* or ->* is a function, then that result can be
1813 used only as the operand for the function call operator ().
1815 by issuing an error message if appropriate. Returns true iff EXPR
1816 violates these rules. */
1819 invalid_nonstatic_memfn_p (tree expr, tsubst_flags_t complain)
1821 if (expr == NULL_TREE)
1823 /* Don't enforce this in MS mode. */
1824 if (flag_ms_extensions)
1826 if (is_overloaded_fn (expr) && !really_overloaded_fn (expr))
1827 expr = get_first_fn (expr);
1828 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1830 if (complain & tf_error)
1831 error ("invalid use of non-static member function");
1837 /* If EXP is a reference to a bitfield, and the type of EXP does not
1838 match the declared type of the bitfield, return the declared type
1839 of the bitfield. Otherwise, return NULL_TREE. */
1842 is_bitfield_expr_with_lowered_type (const_tree exp)
1844 switch (TREE_CODE (exp))
1847 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1848 ? TREE_OPERAND (exp, 1)
1849 : TREE_OPERAND (exp, 0)))
1851 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1854 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1858 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1864 field = TREE_OPERAND (exp, 1);
1865 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1867 if (same_type_ignoring_top_level_qualifiers_p
1868 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1870 return DECL_BIT_FIELD_TYPE (field);
1874 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1875 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1876 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1884 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1885 bitfield with a lowered type, the type of EXP is returned, rather
1889 unlowered_expr_type (const_tree exp)
1892 tree etype = TREE_TYPE (exp);
1894 type = is_bitfield_expr_with_lowered_type (exp);
1896 type = cp_build_qualified_type (type, cp_type_quals (etype));
1903 /* Perform the conversions in [expr] that apply when an lvalue appears
1904 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1905 function-to-pointer conversions. In addition, manifest constants
1906 are replaced by their values, and bitfield references are converted
1907 to their declared types. Note that this function does not perform the
1908 lvalue-to-rvalue conversion for class types. If you need that conversion
1909 to for class types, then you probably need to use force_rvalue.
1911 Although the returned value is being used as an rvalue, this
1912 function does not wrap the returned expression in a
1913 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1914 that the return value is no longer an lvalue. */
1917 decay_conversion (tree exp, tsubst_flags_t complain)
1920 enum tree_code code;
1921 location_t loc = EXPR_LOC_OR_LOC (exp, input_location);
1923 type = TREE_TYPE (exp);
1924 if (type == error_mark_node)
1925 return error_mark_node;
1927 exp = mark_rvalue_use (exp);
1929 exp = resolve_nondeduced_context (exp);
1930 if (type_unknown_p (exp))
1932 if (complain & tf_error)
1933 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1934 return error_mark_node;
1937 code = TREE_CODE (type);
1939 /* FIXME remove for delayed folding. */
1940 exp = scalar_constant_value (exp);
1941 if (error_operand_p (exp))
1942 return error_mark_node;
1944 if (NULLPTR_TYPE_P (type) && !TREE_SIDE_EFFECTS (exp))
1945 return nullptr_node;
1947 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1948 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1949 if (code == VOID_TYPE)
1951 if (complain & tf_error)
1952 error_at (loc, "void value not ignored as it ought to be");
1953 return error_mark_node;
1955 if (invalid_nonstatic_memfn_p (exp, complain))
1956 return error_mark_node;
1957 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1958 return cp_build_addr_expr (exp, complain);
1959 if (code == ARRAY_TYPE)
1964 if (INDIRECT_REF_P (exp))
1965 return build_nop (build_pointer_type (TREE_TYPE (type)),
1966 TREE_OPERAND (exp, 0));
1968 if (TREE_CODE (exp) == COMPOUND_EXPR)
1970 tree op1 = decay_conversion (TREE_OPERAND (exp, 1), complain);
1971 if (op1 == error_mark_node)
1972 return error_mark_node;
1973 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1974 TREE_OPERAND (exp, 0), op1);
1978 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1980 if (complain & tf_error)
1981 error_at (loc, "invalid use of non-lvalue array");
1982 return error_mark_node;
1985 /* Don't let an array compound literal decay to a pointer. It can
1986 still be used to initialize an array or bind to a reference. */
1987 if (TREE_CODE (exp) == TARGET_EXPR)
1989 if (complain & tf_error)
1990 error_at (loc, "taking address of temporary array");
1991 return error_mark_node;
1994 ptrtype = build_pointer_type (TREE_TYPE (type));
1998 if (!cxx_mark_addressable (exp))
1999 return error_mark_node;
2000 adr = build_nop (ptrtype, build_address (exp));
2003 /* This way is better for a COMPONENT_REF since it can
2004 simplify the offset for a component. */
2005 adr = cp_build_addr_expr (exp, complain);
2006 return cp_convert (ptrtype, adr, complain);
2009 /* If a bitfield is used in a context where integral promotion
2010 applies, then the caller is expected to have used
2011 default_conversion. That function promotes bitfields correctly
2012 before calling this function. At this point, if we have a
2013 bitfield referenced, we may assume that is not subject to
2014 promotion, and that, therefore, the type of the resulting rvalue
2015 is the declared type of the bitfield. */
2016 exp = convert_bitfield_to_declared_type (exp);
2018 /* We do not call rvalue() here because we do not want to wrap EXP
2019 in a NON_LVALUE_EXPR. */
2023 Non-class rvalues always have cv-unqualified types. */
2024 type = TREE_TYPE (exp);
2025 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
2026 exp = build_nop (cv_unqualified (type), exp);
2031 /* Perform preparatory conversions, as part of the "usual arithmetic
2032 conversions". In particular, as per [expr]:
2034 Whenever an lvalue expression appears as an operand of an
2035 operator that expects the rvalue for that operand, the
2036 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2037 standard conversions are applied to convert the expression to an
2040 In addition, we perform integral promotions here, as those are
2041 applied to both operands to a binary operator before determining
2042 what additional conversions should apply. */
2045 cp_default_conversion (tree exp, tsubst_flags_t complain)
2047 /* Check for target-specific promotions. */
2048 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
2050 exp = cp_convert (promoted_type, exp, complain);
2051 /* Perform the integral promotions first so that bitfield
2052 expressions (which may promote to "int", even if the bitfield is
2053 declared "unsigned") are promoted correctly. */
2054 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
2055 exp = cp_perform_integral_promotions (exp, complain);
2056 /* Perform the other conversions. */
2057 exp = decay_conversion (exp, complain);
2065 default_conversion (tree exp)
2067 return cp_default_conversion (exp, tf_warning_or_error);
2070 /* EXPR is an expression with an integral or enumeration type.
2071 Perform the integral promotions in [conv.prom], and return the
2075 cp_perform_integral_promotions (tree expr, tsubst_flags_t complain)
2080 expr = mark_rvalue_use (expr);
2084 If the bitfield has an enumerated type, it is treated as any
2085 other value of that type for promotion purposes. */
2086 type = is_bitfield_expr_with_lowered_type (expr);
2087 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
2088 type = TREE_TYPE (expr);
2089 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
2090 /* Scoped enums don't promote. */
2091 if (SCOPED_ENUM_P (type))
2093 promoted_type = type_promotes_to (type);
2094 if (type != promoted_type)
2095 expr = cp_convert (promoted_type, expr, complain);
2102 perform_integral_promotions (tree expr)
2104 return cp_perform_integral_promotions (expr, tf_warning_or_error);
2107 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2108 decay_conversion to one. */
2111 string_conv_p (const_tree totype, const_tree exp, int warn)
2115 if (!TYPE_PTR_P (totype))
2118 t = TREE_TYPE (totype);
2119 if (!same_type_p (t, char_type_node)
2120 && !same_type_p (t, char16_type_node)
2121 && !same_type_p (t, char32_type_node)
2122 && !same_type_p (t, wchar_type_node))
2125 if (TREE_CODE (exp) == STRING_CST)
2127 /* Make sure that we don't try to convert between char and wide chars. */
2128 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
2133 /* Is this a string constant which has decayed to 'const char *'? */
2134 t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
2135 if (!same_type_p (TREE_TYPE (exp), t))
2138 if (TREE_CODE (exp) != ADDR_EXPR
2139 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
2144 if (cxx_dialect >= cxx11)
2145 pedwarn (input_location,
2146 pedantic ? OPT_Wpedantic : OPT_Wwrite_strings,
2147 "ISO C++ forbids converting a string constant to %qT",
2150 warning (OPT_Wwrite_strings,
2151 "deprecated conversion from string constant to %qT",
2158 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2159 can, for example, use as an lvalue. This code used to be in
2160 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2161 expressions, where we're dealing with aggregates. But now it's again only
2162 called from unary_complex_lvalue. The case (in particular) that led to
2163 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2167 rationalize_conditional_expr (enum tree_code code, tree t,
2168 tsubst_flags_t complain)
2170 location_t loc = EXPR_LOC_OR_LOC (t, input_location);
2172 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2173 the first operand is always the one to be used if both operands
2174 are equal, so we know what conditional expression this used to be. */
2175 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2177 tree op0 = TREE_OPERAND (t, 0);
2178 tree op1 = TREE_OPERAND (t, 1);
2180 /* The following code is incorrect if either operand side-effects. */
2181 gcc_assert (!TREE_SIDE_EFFECTS (op0)
2182 && !TREE_SIDE_EFFECTS (op1));
2184 build_conditional_expr (loc,
2185 build_x_binary_op (loc,
2186 (TREE_CODE (t) == MIN_EXPR
2187 ? LE_EXPR : GE_EXPR),
2188 op0, TREE_CODE (op0),
2189 op1, TREE_CODE (op1),
2192 cp_build_unary_op (code, op0, 0, complain),
2193 cp_build_unary_op (code, op1, 0, complain),
2198 build_conditional_expr (loc, TREE_OPERAND (t, 0),
2199 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
2201 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
2206 /* Given the TYPE of an anonymous union field inside T, return the
2207 FIELD_DECL for the field. If not found return NULL_TREE. Because
2208 anonymous unions can nest, we must also search all anonymous unions
2209 that are directly reachable. */
2212 lookup_anon_field (tree t, tree type)
2216 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
2218 if (TREE_STATIC (field))
2220 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
2223 /* If we find it directly, return the field. */
2224 if (DECL_NAME (field) == NULL_TREE
2225 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
2230 /* Otherwise, it could be nested, search harder. */
2231 if (DECL_NAME (field) == NULL_TREE
2232 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2234 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2242 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2243 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2244 non-NULL, it indicates the path to the base used to name MEMBER.
2245 If PRESERVE_REFERENCE is true, the expression returned will have
2246 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2247 returned will have the type referred to by the reference.
2249 This function does not perform access control; that is either done
2250 earlier by the parser when the name of MEMBER is resolved to MEMBER
2251 itself, or later when overload resolution selects one of the
2252 functions indicated by MEMBER. */
2255 build_class_member_access_expr (tree object, tree member,
2256 tree access_path, bool preserve_reference,
2257 tsubst_flags_t complain)
2261 tree result = NULL_TREE;
2262 tree using_decl = NULL_TREE;
2264 if (error_operand_p (object) || error_operand_p (member))
2265 return error_mark_node;
2267 gcc_assert (DECL_P (member) || BASELINK_P (member));
2271 The type of the first expression shall be "class object" (of a
2273 object_type = TREE_TYPE (object);
2274 if (!currently_open_class (object_type)
2275 && !complete_type_or_maybe_complain (object_type, object, complain))
2276 return error_mark_node;
2277 if (!CLASS_TYPE_P (object_type))
2279 if (complain & tf_error)
2281 if (POINTER_TYPE_P (object_type)
2282 && CLASS_TYPE_P (TREE_TYPE (object_type)))
2283 error ("request for member %qD in %qE, which is of pointer "
2284 "type %qT (maybe you meant to use %<->%> ?)",
2285 member, object, object_type);
2287 error ("request for member %qD in %qE, which is of non-class "
2288 "type %qT", member, object, object_type);
2290 return error_mark_node;
2293 /* The standard does not seem to actually say that MEMBER must be a
2294 member of OBJECT_TYPE. However, that is clearly what is
2296 if (DECL_P (member))
2298 member_scope = DECL_CLASS_CONTEXT (member);
2300 if (TREE_DEPRECATED (member))
2301 warn_deprecated_use (member, NULL_TREE);
2304 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2305 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2306 presently be the anonymous union. Go outwards until we find a
2307 type related to OBJECT_TYPE. */
2308 while ((ANON_AGGR_TYPE_P (member_scope) || UNSCOPED_ENUM_P (member_scope))
2309 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2311 member_scope = TYPE_CONTEXT (member_scope);
2312 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2314 if (complain & tf_error)
2316 if (TREE_CODE (member) == FIELD_DECL)
2317 error ("invalid use of nonstatic data member %qE", member);
2319 error ("%qD is not a member of %qT", member, object_type);
2321 return error_mark_node;
2324 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2325 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2326 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2328 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2330 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2333 /* In [expr.ref], there is an explicit list of the valid choices for
2334 MEMBER. We check for each of those cases here. */
2337 /* A static data member. */
2339 mark_exp_read (object);
2340 /* If OBJECT has side-effects, they are supposed to occur. */
2341 if (TREE_SIDE_EFFECTS (object))
2342 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2344 else if (TREE_CODE (member) == FIELD_DECL)
2346 /* A non-static data member. */
2351 null_object_p = (INDIRECT_REF_P (object)
2352 && integer_zerop (TREE_OPERAND (object, 0)));
2354 /* Convert OBJECT to the type of MEMBER. */
2355 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2356 TYPE_MAIN_VARIANT (member_scope)))
2361 binfo = lookup_base (access_path ? access_path : object_type,
2362 member_scope, ba_unique, &kind, complain);
2363 if (binfo == error_mark_node)
2364 return error_mark_node;
2366 /* It is invalid to try to get to a virtual base of a
2367 NULL object. The most common cause is invalid use of
2369 if (null_object_p && kind == bk_via_virtual)
2371 if (complain & tf_error)
2373 error ("invalid access to non-static data member %qD in "
2374 "virtual base of NULL object", member);
2376 return error_mark_node;
2379 /* Convert to the base. */
2380 object = build_base_path (PLUS_EXPR, object, binfo,
2381 /*nonnull=*/1, complain);
2382 /* If we found the base successfully then we should be able
2383 to convert to it successfully. */
2384 gcc_assert (object != error_mark_node);
2387 /* If MEMBER is from an anonymous aggregate, we have converted
2388 OBJECT so that it refers to the class containing the
2389 anonymous union. Generate a reference to the anonymous union
2390 itself, and recur to find MEMBER. */
2391 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2392 /* When this code is called from build_field_call, the
2393 object already has the type of the anonymous union.
2394 That is because the COMPONENT_REF was already
2395 constructed, and was then disassembled before calling
2396 build_field_call. After the function-call code is
2397 cleaned up, this waste can be eliminated. */
2398 && (!same_type_ignoring_top_level_qualifiers_p
2399 (TREE_TYPE (object), DECL_CONTEXT (member))))
2401 tree anonymous_union;
2403 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2404 DECL_CONTEXT (member));
2405 object = build_class_member_access_expr (object,
2407 /*access_path=*/NULL_TREE,
2412 /* Compute the type of the field, as described in [expr.ref]. */
2413 type_quals = TYPE_UNQUALIFIED;
2414 member_type = TREE_TYPE (member);
2415 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2417 type_quals = (cp_type_quals (member_type)
2418 | cp_type_quals (object_type));
2420 /* A field is const (volatile) if the enclosing object, or the
2421 field itself, is const (volatile). But, a mutable field is
2422 not const, even within a const object. */
2423 if (DECL_MUTABLE_P (member))
2424 type_quals &= ~TYPE_QUAL_CONST;
2425 member_type = cp_build_qualified_type (member_type, type_quals);
2428 result = build3_loc (input_location, COMPONENT_REF, member_type,
2429 object, member, NULL_TREE);
2430 result = fold_if_not_in_template (result);
2432 /* Mark the expression const or volatile, as appropriate. Even
2433 though we've dealt with the type above, we still have to mark the
2434 expression itself. */
2435 if (type_quals & TYPE_QUAL_CONST)
2436 TREE_READONLY (result) = 1;
2437 if (type_quals & TYPE_QUAL_VOLATILE)
2438 TREE_THIS_VOLATILE (result) = 1;
2440 else if (BASELINK_P (member))
2442 /* The member is a (possibly overloaded) member function. */
2446 /* If the MEMBER is exactly one static member function, then we
2447 know the type of the expression. Otherwise, we must wait
2448 until overload resolution has been performed. */
2449 functions = BASELINK_FUNCTIONS (member);
2450 if (TREE_CODE (functions) == FUNCTION_DECL
2451 && DECL_STATIC_FUNCTION_P (functions))
2452 type = TREE_TYPE (functions);
2454 type = unknown_type_node;
2455 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2456 base. That will happen when the function is called. */
2457 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2459 else if (TREE_CODE (member) == CONST_DECL)
2461 /* The member is an enumerator. */
2463 /* If OBJECT has side-effects, they are supposed to occur. */
2464 if (TREE_SIDE_EFFECTS (object))
2465 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2468 else if ((using_decl = strip_using_decl (member)) != member)
2469 result = build_class_member_access_expr (object,
2471 access_path, preserve_reference,
2475 if (complain & tf_error)
2476 error ("invalid use of %qD", member);
2477 return error_mark_node;
2480 if (!preserve_reference)
2483 If E2 is declared to have type "reference to T", then ... the
2484 type of E1.E2 is T. */
2485 result = convert_from_reference (result);
2490 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2491 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2494 lookup_destructor (tree object, tree scope, tree dtor_name,
2495 tsubst_flags_t complain)
2497 tree object_type = TREE_TYPE (object);
2498 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2501 /* We've already complained about this destructor. */
2502 if (dtor_type == error_mark_node)
2503 return error_mark_node;
2505 if (scope && !check_dtor_name (scope, dtor_type))
2507 if (complain & tf_error)
2508 error ("qualified type %qT does not match destructor name ~%qT",
2510 return error_mark_node;
2512 if (is_auto (dtor_type))
2513 dtor_type = object_type;
2514 else if (identifier_p (dtor_type))
2516 /* In a template, names we can't find a match for are still accepted
2517 destructor names, and we check them here. */
2518 if (check_dtor_name (object_type, dtor_type))
2519 dtor_type = object_type;
2522 if (complain & tf_error)
2523 error ("object type %qT does not match destructor name ~%qT",
2524 object_type, dtor_type);
2525 return error_mark_node;
2529 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2531 if (complain & tf_error)
2532 error ("the type being destroyed is %qT, but the destructor "
2533 "refers to %qT", TYPE_MAIN_VARIANT (object_type), dtor_type);
2534 return error_mark_node;
2536 expr = lookup_member (dtor_type, complete_dtor_identifier,
2537 /*protect=*/1, /*want_type=*/false,
2538 tf_warning_or_error);
2541 if (complain & tf_error)
2542 cxx_incomplete_type_error (dtor_name, dtor_type);
2543 return error_mark_node;
2545 expr = (adjust_result_of_qualified_name_lookup
2546 (expr, dtor_type, object_type));
2547 if (scope == NULL_TREE)
2548 /* We need to call adjust_result_of_qualified_name_lookup in case the
2549 destructor names a base class, but we unset BASELINK_QUALIFIED_P so
2550 that we still get virtual function binding. */
2551 BASELINK_QUALIFIED_P (expr) = false;
2555 /* An expression of the form "A::template B" has been resolved to
2556 DECL. Issue a diagnostic if B is not a template or template
2560 check_template_keyword (tree decl)
2562 /* The standard says:
2566 If a name prefixed by the keyword template is not a member
2567 template, the program is ill-formed.
2569 DR 228 removed the restriction that the template be a member
2572 DR 96, if accepted would add the further restriction that explicit
2573 template arguments must be provided if the template keyword is
2574 used, but, as of 2005-10-16, that DR is still in "drafting". If
2575 this DR is accepted, then the semantic checks here can be
2576 simplified, as the entity named must in fact be a template
2577 specialization, rather than, as at present, a set of overloaded
2578 functions containing at least one template function. */
2579 if (TREE_CODE (decl) != TEMPLATE_DECL
2580 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2582 if (!is_overloaded_fn (decl))
2583 permerror (input_location, "%qD is not a template", decl);
2588 if (BASELINK_P (fns))
2589 fns = BASELINK_FUNCTIONS (fns);
2592 tree fn = OVL_CURRENT (fns);
2593 if (TREE_CODE (fn) == TEMPLATE_DECL
2594 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2596 if (TREE_CODE (fn) == FUNCTION_DECL
2597 && DECL_USE_TEMPLATE (fn)
2598 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2600 fns = OVL_NEXT (fns);
2603 permerror (input_location, "%qD is not a template", decl);
2608 /* This function is called by the parser to process a class member
2609 access expression of the form OBJECT.NAME. NAME is a node used by
2610 the parser to represent a name; it is not yet a DECL. It may,
2611 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2612 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2613 there is no reason to do the lookup twice, so the parser keeps the
2614 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2615 be a template via the use of the "A::template B" syntax. */
2618 finish_class_member_access_expr (tree object, tree name, bool template_p,
2619 tsubst_flags_t complain)
2624 tree access_path = NULL_TREE;
2625 tree orig_object = object;
2626 tree orig_name = name;
2628 if (object == error_mark_node || name == error_mark_node)
2629 return error_mark_node;
2631 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2632 if (!objc_is_public (object, name))
2633 return error_mark_node;
2635 object_type = TREE_TYPE (object);
2637 if (processing_template_decl)
2639 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2640 dependent_type_p (object_type)
2641 /* If NAME is just an IDENTIFIER_NODE, then the expression
2643 || identifier_p (object)
2644 /* If NAME is "f<args>", where either 'f' or 'args' is
2645 dependent, then the expression is dependent. */
2646 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2647 && dependent_template_id_p (TREE_OPERAND (name, 0),
2648 TREE_OPERAND (name, 1)))
2649 /* If NAME is "T::X" where "T" is dependent, then the
2650 expression is dependent. */
2651 || (TREE_CODE (name) == SCOPE_REF
2652 && TYPE_P (TREE_OPERAND (name, 0))
2653 && dependent_type_p (TREE_OPERAND (name, 0))))
2654 return build_min_nt_loc (UNKNOWN_LOCATION, COMPONENT_REF,
2655 object, name, NULL_TREE);
2656 object = build_non_dependent_expr (object);
2658 else if (c_dialect_objc ()
2659 && identifier_p (name)
2660 && (expr = objc_maybe_build_component_ref (object, name)))
2665 The type of the first expression shall be "class object" (of a
2667 if (!currently_open_class (object_type)
2668 && !complete_type_or_maybe_complain (object_type, object, complain))
2669 return error_mark_node;
2670 if (!CLASS_TYPE_P (object_type))
2672 if (complain & tf_error)
2674 if (POINTER_TYPE_P (object_type)
2675 && CLASS_TYPE_P (TREE_TYPE (object_type)))
2676 error ("request for member %qD in %qE, which is of pointer "
2677 "type %qT (maybe you meant to use %<->%> ?)",
2678 name, object, object_type);
2680 error ("request for member %qD in %qE, which is of non-class "
2681 "type %qT", name, object, object_type);
2683 return error_mark_node;
2686 if (BASELINK_P (name))
2687 /* A member function that has already been looked up. */
2691 bool is_template_id = false;
2692 tree template_args = NULL_TREE;
2695 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2697 is_template_id = true;
2698 template_args = TREE_OPERAND (name, 1);
2699 name = TREE_OPERAND (name, 0);
2701 if (TREE_CODE (name) == OVERLOAD)
2702 name = DECL_NAME (get_first_fn (name));
2703 else if (DECL_P (name))
2704 name = DECL_NAME (name);
2707 if (TREE_CODE (name) == SCOPE_REF)
2709 /* A qualified name. The qualifying class or namespace `S'
2710 has already been looked up; it is either a TYPE or a
2712 scope = TREE_OPERAND (name, 0);
2713 name = TREE_OPERAND (name, 1);
2715 /* If SCOPE is a namespace, then the qualified name does not
2716 name a member of OBJECT_TYPE. */
2717 if (TREE_CODE (scope) == NAMESPACE_DECL)
2719 if (complain & tf_error)
2720 error ("%<%D::%D%> is not a member of %qT",
2721 scope, name, object_type);
2722 return error_mark_node;
2725 if (TREE_CODE (scope) == ENUMERAL_TYPE)
2727 /* Looking up a member enumerator (c++/56793). */
2728 if (!TYPE_CLASS_SCOPE_P (scope)
2729 || !DERIVED_FROM_P (TYPE_CONTEXT (scope), object_type))
2731 if (complain & tf_error)
2732 error ("%<%D::%D%> is not a member of %qT",
2733 scope, name, object_type);
2734 return error_mark_node;
2736 tree val = lookup_enumerator (scope, name);
2737 if (TREE_SIDE_EFFECTS (object))
2738 val = build2 (COMPOUND_EXPR, TREE_TYPE (val), object, val);
2742 gcc_assert (CLASS_TYPE_P (scope));
2743 gcc_assert (identifier_p (name) || TREE_CODE (name) == BIT_NOT_EXPR);
2745 if (constructor_name_p (name, scope))
2747 if (complain & tf_error)
2748 error ("cannot call constructor %<%T::%D%> directly",
2750 return error_mark_node;
2753 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2754 access_path = lookup_base (object_type, scope, ba_check,
2756 if (access_path == error_mark_node)
2757 return error_mark_node;
2760 if (complain & tf_error)
2761 error ("%qT is not a base of %qT", scope, object_type);
2762 return error_mark_node;
2768 access_path = object_type;
2771 if (TREE_CODE (name) == BIT_NOT_EXPR)
2772 member = lookup_destructor (object, scope, name, complain);
2775 /* Look up the member. */
2776 member = lookup_member (access_path, name, /*protect=*/1,
2777 /*want_type=*/false, complain);
2778 if (member == NULL_TREE)
2780 if (complain & tf_error)
2781 error ("%q#T has no member named %qE",
2782 TREE_CODE (access_path) == TREE_BINFO
2783 ? TREE_TYPE (access_path) : object_type, name);
2784 return error_mark_node;
2786 if (member == error_mark_node)
2787 return error_mark_node;
2792 tree templ = member;
2794 if (BASELINK_P (templ))
2795 templ = lookup_template_function (templ, template_args);
2798 if (complain & tf_error)
2799 error ("%qD is not a member template function", name);
2800 return error_mark_node;
2805 if (TREE_DEPRECATED (member))
2806 warn_deprecated_use (member, NULL_TREE);
2809 check_template_keyword (member);
2811 expr = build_class_member_access_expr (object, member, access_path,
2812 /*preserve_reference=*/false,
2814 if (processing_template_decl && expr != error_mark_node)
2816 if (BASELINK_P (member))
2818 if (TREE_CODE (orig_name) == SCOPE_REF)
2819 BASELINK_QUALIFIED_P (member) = 1;
2822 return build_min_non_dep (COMPONENT_REF, expr,
2823 orig_object, orig_name,
2830 /* Build a COMPONENT_REF of OBJECT and MEMBER with the appropriate
2834 build_simple_component_ref (tree object, tree member)
2836 tree type = cp_build_qualified_type (TREE_TYPE (member),
2837 cp_type_quals (TREE_TYPE (object)));
2838 return fold_build3_loc (input_location,
2839 COMPONENT_REF, type,
2840 object, member, NULL_TREE);
2843 /* Return an expression for the MEMBER_NAME field in the internal
2844 representation of PTRMEM, a pointer-to-member function. (Each
2845 pointer-to-member function type gets its own RECORD_TYPE so it is
2846 more convenient to access the fields by name than by FIELD_DECL.)
2847 This routine converts the NAME to a FIELD_DECL and then creates the
2848 node for the complete expression. */
2851 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2856 /* This code is a stripped down version of
2857 build_class_member_access_expr. It does not work to use that
2858 routine directly because it expects the object to be of class
2860 ptrmem_type = TREE_TYPE (ptrmem);
2861 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2862 for (member = TYPE_FIELDS (ptrmem_type); member;
2863 member = DECL_CHAIN (member))
2864 if (DECL_NAME (member) == member_name)
2866 return build_simple_component_ref (ptrmem, member);
2869 /* Given an expression PTR for a pointer, return an expression
2870 for the value pointed to.
2871 ERRORSTRING is the name of the operator to appear in error messages.
2873 This function may need to overload OPERATOR_FNNAME.
2874 Must also handle REFERENCE_TYPEs for C++. */
2877 build_x_indirect_ref (location_t loc, tree expr, ref_operator errorstring,
2878 tsubst_flags_t complain)
2880 tree orig_expr = expr;
2883 if (processing_template_decl)
2885 /* Retain the type if we know the operand is a pointer. */
2886 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2887 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2888 if (type_dependent_expression_p (expr))
2889 return build_min_nt_loc (loc, INDIRECT_REF, expr);
2890 expr = build_non_dependent_expr (expr);
2893 rval = build_new_op (loc, INDIRECT_REF, LOOKUP_NORMAL, expr,
2894 NULL_TREE, NULL_TREE, /*overload=*/NULL, complain);
2896 rval = cp_build_indirect_ref (expr, errorstring, complain);
2898 if (processing_template_decl && rval != error_mark_node)
2899 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2904 /* Helper function called from c-common. */
2906 build_indirect_ref (location_t /*loc*/,
2907 tree ptr, ref_operator errorstring)
2909 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2913 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2914 tsubst_flags_t complain)
2918 if (ptr == current_class_ptr
2919 || (TREE_CODE (ptr) == NOP_EXPR
2920 && TREE_OPERAND (ptr, 0) == current_class_ptr
2921 && (same_type_ignoring_top_level_qualifiers_p
2922 (TREE_TYPE (ptr), TREE_TYPE (current_class_ptr)))))
2923 return current_class_ref;
2925 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2926 ? ptr : decay_conversion (ptr, complain));
2927 if (pointer == error_mark_node)
2928 return error_mark_node;
2930 type = TREE_TYPE (pointer);
2932 if (POINTER_TYPE_P (type))
2936 If the type of the expression is "pointer to T," the type
2937 of the result is "T." */
2938 tree t = TREE_TYPE (type);
2940 if ((CONVERT_EXPR_P (ptr)
2941 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2942 && (!CLASS_TYPE_P (t) || !CLASSTYPE_EMPTY_P (t)))
2944 /* If a warning is issued, mark it to avoid duplicates from
2945 the backend. This only needs to be done at
2946 warn_strict_aliasing > 2. */
2947 if (warn_strict_aliasing > 2)
2948 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2949 type, TREE_OPERAND (ptr, 0)))
2950 TREE_NO_WARNING (ptr) = 1;
2953 if (VOID_TYPE_P (t))
2955 /* A pointer to incomplete type (other than cv void) can be
2956 dereferenced [expr.unary.op]/1 */
2957 if (complain & tf_error)
2958 error ("%qT is not a pointer-to-object type", type);
2959 return error_mark_node;
2961 else if (TREE_CODE (pointer) == ADDR_EXPR
2962 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2963 /* The POINTER was something like `&x'. We simplify `*&x' to
2965 return TREE_OPERAND (pointer, 0);
2968 tree ref = build1 (INDIRECT_REF, t, pointer);
2970 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2971 so that we get the proper error message if the result is used
2972 to assign to. Also, &* is supposed to be a no-op. */
2973 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2974 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2975 TREE_SIDE_EFFECTS (ref)
2976 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2980 else if (!(complain & tf_error))
2981 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2983 /* `pointer' won't be an error_mark_node if we were given a
2984 pointer to member, so it's cool to check for this here. */
2985 else if (TYPE_PTRMEM_P (type))
2986 switch (errorstring)
2988 case RO_ARRAY_INDEXING:
2989 error ("invalid use of array indexing on pointer to member");
2992 error ("invalid use of unary %<*%> on pointer to member");
2994 case RO_IMPLICIT_CONVERSION:
2995 error ("invalid use of implicit conversion on pointer to member");
2998 error ("left hand operand of %<->*%> must be a pointer to class, "
2999 "but is a pointer to member of type %qT", type);
3004 else if (pointer != error_mark_node)
3005 invalid_indirection_error (input_location, type, errorstring);
3007 return error_mark_node;
3010 /* This handles expressions of the form "a[i]", which denotes
3013 This is logically equivalent in C to *(a+i), but we may do it differently.
3014 If A is a variable or a member, we generate a primitive ARRAY_REF.
3015 This avoids forcing the array out of registers, and can work on
3016 arrays that are not lvalues (for example, members of structures returned
3019 If INDEX is of some user-defined type, it must be converted to
3020 integer type. Otherwise, to make a compatible PLUS_EXPR, it
3021 will inherit the type of the array, which will be some pointer type.
3023 LOC is the location to use in building the array reference. */
3026 cp_build_array_ref (location_t loc, tree array, tree idx,
3027 tsubst_flags_t complain)
3033 if (complain & tf_error)
3034 error_at (loc, "subscript missing in array reference");
3035 return error_mark_node;
3038 /* If an array's index is an array notation, then its rank cannot be
3039 greater than one. */
3040 if (flag_cilkplus && contains_array_notation_expr (idx))
3044 /* If find_rank returns false, then it should have reported an error,
3045 thus it is unnecessary for repetition. */
3046 if (!find_rank (loc, idx, idx, true, &rank))
3047 return error_mark_node;
3050 error_at (loc, "rank of the array%'s index is greater than 1");
3051 return error_mark_node;
3054 if (TREE_TYPE (array) == error_mark_node
3055 || TREE_TYPE (idx) == error_mark_node)
3056 return error_mark_node;
3058 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
3060 switch (TREE_CODE (array))
3064 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
3066 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
3067 TREE_OPERAND (array, 0), value);
3068 SET_EXPR_LOCATION (ret, loc);
3073 ret = build_conditional_expr
3074 (loc, TREE_OPERAND (array, 0),
3075 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
3077 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
3080 protected_set_expr_location (ret, loc);
3088 = convert_vector_to_pointer_for_subscript (loc, &array, idx);
3090 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
3094 warn_array_subscript_with_type_char (loc, idx);
3096 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
3098 if (complain & tf_error)
3099 error_at (loc, "array subscript is not an integer");
3100 return error_mark_node;
3103 /* Apply integral promotions *after* noticing character types.
3104 (It is unclear why we do these promotions -- the standard
3105 does not say that we should. In fact, the natural thing would
3106 seem to be to convert IDX to ptrdiff_t; we're performing
3107 pointer arithmetic.) */
3108 idx = cp_perform_integral_promotions (idx, complain);
3110 /* An array that is indexed by a non-constant
3111 cannot be stored in a register; we must be able to do
3112 address arithmetic on its address.
3113 Likewise an array of elements of variable size. */
3114 if (TREE_CODE (idx) != INTEGER_CST
3115 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
3116 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
3119 if (!cxx_mark_addressable (array))
3120 return error_mark_node;
3123 /* An array that is indexed by a constant value which is not within
3124 the array bounds cannot be stored in a register either; because we
3125 would get a crash in store_bit_field/extract_bit_field when trying
3126 to access a non-existent part of the register. */
3127 if (TREE_CODE (idx) == INTEGER_CST
3128 && TYPE_DOMAIN (TREE_TYPE (array))
3129 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
3131 if (!cxx_mark_addressable (array))
3132 return error_mark_node;
3135 if (!lvalue_p (array))
3137 if (complain & tf_error)
3138 pedwarn (loc, OPT_Wpedantic,
3139 "ISO C++ forbids subscripting non-lvalue array");
3141 return error_mark_node;
3144 /* Note in C++ it is valid to subscript a `register' array, since
3145 it is valid to take the address of something with that
3146 storage specification. */
3150 while (TREE_CODE (foo) == COMPONENT_REF)
3151 foo = TREE_OPERAND (foo, 0);
3152 if (VAR_P (foo) && DECL_REGISTER (foo)
3153 && (complain & tf_warning))
3154 warning_at (loc, OPT_Wextra,
3155 "subscripting array declared %<register%>");
3158 type = TREE_TYPE (TREE_TYPE (array));
3159 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
3160 /* Array ref is const/volatile if the array elements are
3161 or if the array is.. */
3162 TREE_READONLY (rval)
3163 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
3164 TREE_SIDE_EFFECTS (rval)
3165 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
3166 TREE_THIS_VOLATILE (rval)
3167 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
3168 ret = require_complete_type_sfinae (fold_if_not_in_template (rval),
3170 protected_set_expr_location (ret, loc);
3172 ret = non_lvalue_loc (loc, ret);
3177 tree ar = cp_default_conversion (array, complain);
3178 tree ind = cp_default_conversion (idx, complain);
3180 /* Put the integer in IND to simplify error checking. */
3181 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
3188 if (ar == error_mark_node || ind == error_mark_node)
3189 return error_mark_node;
3191 if (!TYPE_PTR_P (TREE_TYPE (ar)))
3193 if (complain & tf_error)
3194 error_at (loc, "subscripted value is neither array nor pointer");
3195 return error_mark_node;
3197 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
3199 if (complain & tf_error)
3200 error_at (loc, "array subscript is not an integer");
3201 return error_mark_node;
3204 warn_array_subscript_with_type_char (loc, idx);
3206 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
3211 protected_set_expr_location (ret, loc);
3213 ret = non_lvalue_loc (loc, ret);
3218 /* Entry point for Obj-C++. */
3221 build_array_ref (location_t loc, tree array, tree idx)
3223 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
3226 /* Resolve a pointer to member function. INSTANCE is the object
3227 instance to use, if the member points to a virtual member.
3229 This used to avoid checking for virtual functions if basetype
3230 has no virtual functions, according to an earlier ANSI draft.
3231 With the final ISO C++ rules, such an optimization is
3232 incorrect: A pointer to a derived member can be static_cast
3233 to pointer-to-base-member, as long as the dynamic object
3234 later has the right member. So now we only do this optimization
3235 when we know the dynamic type of the object. */
3238 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function,
3239 tsubst_flags_t complain)
3241 if (TREE_CODE (function) == OFFSET_REF)
3242 function = TREE_OPERAND (function, 1);
3244 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
3246 tree idx, delta, e1, e2, e3, vtbl;
3248 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
3249 tree basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3251 tree instance_ptr = *instance_ptrptr;
3252 tree instance_save_expr = 0;
3253 if (instance_ptr == error_mark_node)
3255 if (TREE_CODE (function) == PTRMEM_CST)
3257 /* Extracting the function address from a pmf is only
3258 allowed with -Wno-pmf-conversions. It only works for
3260 e1 = build_addr_func (PTRMEM_CST_MEMBER (function), complain);
3261 e1 = convert (fntype, e1);
3266 if (complain & tf_error)
3267 error ("object missing in use of %qE", function);
3268 return error_mark_node;
3272 /* True if we know that the dynamic type of the object doesn't have
3273 virtual functions, so we can assume the PFN field is a pointer. */
3274 nonvirtual = (COMPLETE_TYPE_P (basetype)
3275 && !TYPE_POLYMORPHIC_P (basetype)
3276 && resolves_to_fixed_type_p (instance_ptr, 0));
3278 /* If we don't really have an object (i.e. in an ill-formed
3279 conversion from PMF to pointer), we can't resolve virtual
3280 functions anyway. */
3281 if (!nonvirtual && is_dummy_object (instance_ptr))
3284 if (TREE_SIDE_EFFECTS (instance_ptr))
3285 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3287 if (TREE_SIDE_EFFECTS (function))
3288 function = save_expr (function);
3290 /* Start by extracting all the information from the PMF itself. */
3291 e3 = pfn_from_ptrmemfunc (function);
3292 delta = delta_from_ptrmemfunc (function);
3293 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3294 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3296 case ptrmemfunc_vbit_in_pfn:
3297 e1 = cp_build_binary_op (input_location,
3298 BIT_AND_EXPR, idx, integer_one_node,
3300 idx = cp_build_binary_op (input_location,
3301 MINUS_EXPR, idx, integer_one_node,
3303 if (idx == error_mark_node)
3304 return error_mark_node;
3307 case ptrmemfunc_vbit_in_delta:
3308 e1 = cp_build_binary_op (input_location,
3309 BIT_AND_EXPR, delta, integer_one_node,
3311 delta = cp_build_binary_op (input_location,
3312 RSHIFT_EXPR, delta, integer_one_node,
3314 if (delta == error_mark_node)
3315 return error_mark_node;
3322 if (e1 == error_mark_node)
3323 return error_mark_node;
3325 /* Convert down to the right base before using the instance. A
3326 special case is that in a pointer to member of class C, C may
3327 be incomplete. In that case, the function will of course be
3328 a member of C, and no conversion is required. In fact,
3329 lookup_base will fail in that case, because incomplete
3330 classes do not have BINFOs. */
3331 if (!same_type_ignoring_top_level_qualifiers_p
3332 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3334 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3335 basetype, ba_check, NULL, complain);
3336 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3338 if (instance_ptr == error_mark_node)
3339 return error_mark_node;
3341 /* ...and then the delta in the PMF. */
3342 instance_ptr = fold_build_pointer_plus (instance_ptr, delta);
3344 /* Hand back the adjusted 'this' argument to our caller. */
3345 *instance_ptrptr = instance_ptr;
3348 /* Now just return the pointer. */
3351 /* Next extract the vtable pointer from the object. */
3352 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3354 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, complain);
3355 if (vtbl == error_mark_node)
3356 return error_mark_node;
3358 /* Finally, extract the function pointer from the vtable. */
3359 e2 = fold_build_pointer_plus_loc (input_location, vtbl, idx);
3360 e2 = cp_build_indirect_ref (e2, RO_NULL, complain);
3361 if (e2 == error_mark_node)
3362 return error_mark_node;
3363 TREE_CONSTANT (e2) = 1;
3365 /* When using function descriptors, the address of the
3366 vtable entry is treated as a function pointer. */
3367 if (TARGET_VTABLE_USES_DESCRIPTORS)
3368 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3369 cp_build_addr_expr (e2, complain));
3371 e2 = fold_convert (TREE_TYPE (e3), e2);
3372 e1 = build_conditional_expr (input_location, e1, e2, e3, complain);
3373 if (e1 == error_mark_node)
3374 return error_mark_node;
3376 /* Make sure this doesn't get evaluated first inside one of the
3377 branches of the COND_EXPR. */
3378 if (instance_save_expr)
3379 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3380 instance_save_expr, e1);
3387 /* Used by the C-common bits. */
3389 build_function_call (location_t /*loc*/,
3390 tree function, tree params)
3392 return cp_build_function_call (function, params, tf_warning_or_error);
3395 /* Used by the C-common bits. */
3397 build_function_call_vec (location_t /*loc*/, vec<location_t> /*arg_loc*/,
3398 tree function, vec<tree, va_gc> *params,
3399 vec<tree, va_gc> * /*origtypes*/)
3401 vec<tree, va_gc> *orig_params = params;
3402 tree ret = cp_build_function_call_vec (function, ¶ms,
3403 tf_warning_or_error);
3405 /* cp_build_function_call_vec can reallocate PARAMS by adding
3406 default arguments. That should never happen here. Verify
3408 gcc_assert (params == orig_params);
3413 /* Build a function call using a tree list of arguments. */
3416 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3418 vec<tree, va_gc> *vec;
3421 vec = make_tree_vector ();
3422 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3423 vec_safe_push (vec, TREE_VALUE (params));
3424 ret = cp_build_function_call_vec (function, &vec, complain);
3425 release_tree_vector (vec);
3429 /* Build a function call using varargs. */
3432 cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
3434 vec<tree, va_gc> *vec;
3438 vec = make_tree_vector ();
3439 va_start (args, complain);
3440 for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
3441 vec_safe_push (vec, t);
3443 ret = cp_build_function_call_vec (function, &vec, complain);
3444 release_tree_vector (vec);
3448 /* Build a function call using a vector of arguments. PARAMS may be
3449 NULL if there are no parameters. This changes the contents of
3453 cp_build_function_call_vec (tree function, vec<tree, va_gc> **params,
3454 tsubst_flags_t complain)
3456 tree fntype, fndecl;
3458 tree original = function;
3462 vec<tree, va_gc> *allocated = NULL;
3465 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3466 expressions, like those used for ObjC messenger dispatches. */
3467 if (params != NULL && !vec_safe_is_empty (*params))
3468 function = objc_rewrite_function_call (function, (**params)[0]);
3470 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3471 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3472 if (TREE_CODE (function) == NOP_EXPR
3473 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3474 function = TREE_OPERAND (function, 0);
3476 if (TREE_CODE (function) == FUNCTION_DECL)
3478 mark_used (function);
3481 /* Convert anything with function type to a pointer-to-function. */
3482 if (DECL_MAIN_P (function))
3484 if (complain & tf_error)
3485 pedwarn (input_location, OPT_Wpedantic,
3486 "ISO C++ forbids calling %<::main%> from within program");
3488 return error_mark_node;
3490 function = build_addr_func (function, complain);
3496 function = build_addr_func (function, complain);
3499 if (function == error_mark_node)
3500 return error_mark_node;
3502 fntype = TREE_TYPE (function);
3504 if (TYPE_PTRMEMFUNC_P (fntype))
3506 if (complain & tf_error)
3507 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3508 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3509 original, original);
3510 return error_mark_node;
3513 is_method = (TYPE_PTR_P (fntype)
3514 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3516 if (!(TYPE_PTRFN_P (fntype)
3518 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3520 if (complain & tf_error)
3522 if (!flag_diagnostics_show_caret)
3523 error_at (input_location,
3524 "%qE cannot be used as a function", original);
3525 else if (DECL_P (original))
3526 error_at (input_location,
3527 "%qD cannot be used as a function", original);
3529 error_at (input_location,
3530 "expression cannot be used as a function");
3533 return error_mark_node;
3536 /* fntype now gets the type of function pointed to. */
3537 fntype = TREE_TYPE (fntype);
3538 parm_types = TYPE_ARG_TYPES (fntype);
3542 allocated = make_tree_vector ();
3543 params = &allocated;
3546 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3549 return error_mark_node;
3551 argarray = (*params)->address ();
3553 /* Check for errors in format strings and inappropriately
3555 check_function_arguments (fntype, nargs, argarray);
3557 ret = build_cxx_call (function, nargs, argarray, complain);
3559 if (allocated != NULL)
3560 release_tree_vector (allocated);
3565 /* Subroutine of convert_arguments.
3566 Warn about wrong number of args are genereted. */
3569 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3573 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3575 if (DECL_NAME (fndecl) == NULL_TREE
3576 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3579 ? G_("too many arguments to constructor %q#D")
3580 : G_("too few arguments to constructor %q#D"),
3585 ? G_("too many arguments to member function %q#D")
3586 : G_("too few arguments to member function %q#D"),
3592 ? G_("too many arguments to function %q#D")
3593 : G_("too few arguments to function %q#D"),
3595 inform (DECL_SOURCE_LOCATION (fndecl),
3600 if (c_dialect_objc () && objc_message_selector ())
3603 ? G_("too many arguments to method %q#D")
3604 : G_("too few arguments to method %q#D"),
3605 objc_message_selector ());
3607 error_at (loc, too_many_p ? G_("too many arguments to function")
3608 : G_("too few arguments to function"));
3612 /* Convert the actual parameter expressions in the list VALUES to the
3613 types in the list TYPELIST. The converted expressions are stored
3614 back in the VALUES vector.
3615 If parmdecls is exhausted, or when an element has NULL as its type,
3616 perform the default conversions.
3618 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3620 This is also where warnings about wrong number of args are generated.
3622 Returns the actual number of arguments processed (which might be less
3623 than the length of the vector), or -1 on error.
3625 In C++, unspecified trailing parameters can be filled in with their
3626 default arguments, if such were specified. Do so here. */
3629 convert_arguments (tree typelist, vec<tree, va_gc> **values, tree fndecl,
3630 int flags, tsubst_flags_t complain)
3635 /* Argument passing is always copy-initialization. */
3636 flags |= LOOKUP_ONLYCONVERTING;
3638 for (i = 0, typetail = typelist;
3639 i < vec_safe_length (*values);
3642 tree type = typetail ? TREE_VALUE (typetail) : 0;
3643 tree val = (**values)[i];
3645 if (val == error_mark_node || type == error_mark_node)
3648 if (type == void_type_node)
3650 if (complain & tf_error)
3652 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3659 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3660 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3661 if (TREE_CODE (val) == NOP_EXPR
3662 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3663 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3664 val = TREE_OPERAND (val, 0);
3666 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3668 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3669 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3670 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3671 val = decay_conversion (val, complain);
3674 if (val == error_mark_node)
3679 /* Formal parm type is specified by a function prototype. */
3682 if (!COMPLETE_TYPE_P (complete_type (type)))
3684 if (complain & tf_error)
3687 error ("parameter %P of %qD has incomplete type %qT",
3690 error ("parameter %P has incomplete type %qT", i, type);
3692 parmval = error_mark_node;
3696 parmval = convert_for_initialization
3697 (NULL_TREE, type, val, flags,
3698 ICR_ARGPASS, fndecl, i, complain);
3699 parmval = convert_for_arg_passing (type, parmval, complain);
3702 if (parmval == error_mark_node)
3705 (**values)[i] = parmval;
3709 if (fndecl && magic_varargs_p (fndecl))
3710 /* Don't do ellipsis conversion for __built_in_constant_p
3711 as this will result in spurious errors for non-trivial
3713 val = require_complete_type_sfinae (val, complain);
3715 val = convert_arg_to_ellipsis (val, complain);
3717 (**values)[i] = val;
3721 typetail = TREE_CHAIN (typetail);
3724 if (typetail != 0 && typetail != void_list_node)
3726 /* See if there are default arguments that can be used. Because
3727 we hold default arguments in the FUNCTION_TYPE (which is so
3728 wrong), we can see default parameters here from deduced
3729 contexts (and via typeof) for indirect function calls.
3730 Fortunately we know whether we have a function decl to
3731 provide default arguments in a language conformant
3733 if (fndecl && TREE_PURPOSE (typetail)
3734 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3736 for (; typetail != void_list_node; ++i)
3739 = convert_default_arg (TREE_VALUE (typetail),
3740 TREE_PURPOSE (typetail),
3741 fndecl, i, complain);
3743 if (parmval == error_mark_node)
3746 vec_safe_push (*values, parmval);
3747 typetail = TREE_CHAIN (typetail);
3748 /* ends with `...'. */
3749 if (typetail == NULL_TREE)
3755 if (complain & tf_error)
3756 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3764 /* Build a binary-operation expression, after performing default
3765 conversions on the operands. CODE is the kind of expression to
3766 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3767 are the tree codes which correspond to ARG1 and ARG2 when issuing
3768 warnings about possibly misplaced parentheses. They may differ
3769 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3770 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3771 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3772 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3773 ARG2_CODE as ERROR_MARK. */
3776 build_x_binary_op (location_t loc, enum tree_code code, tree arg1,
3777 enum tree_code arg1_code, tree arg2,
3778 enum tree_code arg2_code, tree *overload,
3779 tsubst_flags_t complain)
3788 if (processing_template_decl)
3790 if (type_dependent_expression_p (arg1)
3791 || type_dependent_expression_p (arg2))
3792 return build_min_nt_loc (loc, code, arg1, arg2);
3793 arg1 = build_non_dependent_expr (arg1);
3794 arg2 = build_non_dependent_expr (arg2);
3797 if (code == DOTSTAR_EXPR)
3798 expr = build_m_component_ref (arg1, arg2, complain);
3800 expr = build_new_op (loc, code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3801 overload, complain);
3803 /* Check for cases such as x+y<<z which users are likely to
3804 misinterpret. But don't warn about obj << x + y, since that is a
3805 common idiom for I/O. */
3806 if (warn_parentheses
3807 && (complain & tf_warning)
3808 && !processing_template_decl
3809 && !error_operand_p (arg1)
3810 && !error_operand_p (arg2)
3811 && (code != LSHIFT_EXPR
3812 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3813 warn_about_parentheses (loc, code, arg1_code, orig_arg1,
3814 arg2_code, orig_arg2);
3816 if (processing_template_decl && expr != error_mark_node)
3817 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3822 /* Build and return an ARRAY_REF expression. */
3825 build_x_array_ref (location_t loc, tree arg1, tree arg2,
3826 tsubst_flags_t complain)
3828 tree orig_arg1 = arg1;
3829 tree orig_arg2 = arg2;
3832 if (processing_template_decl)
3834 if (type_dependent_expression_p (arg1)
3835 || type_dependent_expression_p (arg2))
3836 return build_min_nt_loc (loc, ARRAY_REF, arg1, arg2,
3837 NULL_TREE, NULL_TREE);
3838 arg1 = build_non_dependent_expr (arg1);
3839 arg2 = build_non_dependent_expr (arg2);
3842 expr = build_new_op (loc, ARRAY_REF, LOOKUP_NORMAL, arg1, arg2,
3843 NULL_TREE, /*overload=*/NULL, complain);
3845 if (processing_template_decl && expr != error_mark_node)
3846 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3847 NULL_TREE, NULL_TREE);
3851 /* Return whether OP is an expression of enum type cast to integer
3852 type. In C++ even unsigned enum types are cast to signed integer
3853 types. We do not want to issue warnings about comparisons between
3854 signed and unsigned types when one of the types is an enum type.
3855 Those warnings are always false positives in practice. */
3858 enum_cast_to_int (tree op)
3860 if (CONVERT_EXPR_P (op)
3861 && TREE_TYPE (op) == integer_type_node
3862 && TREE_CODE (TREE_TYPE (TREE_OPERAND (op, 0))) == ENUMERAL_TYPE
3863 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op, 0))))
3866 /* The cast may have been pushed into a COND_EXPR. */
3867 if (TREE_CODE (op) == COND_EXPR)
3868 return (enum_cast_to_int (TREE_OPERAND (op, 1))
3869 || enum_cast_to_int (TREE_OPERAND (op, 2)));
3874 /* For the c-common bits. */
3876 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3879 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3883 /* Build a binary-operation expression without default conversions.
3884 CODE is the kind of expression to build.
3885 LOCATION is the location_t of the operator in the source code.
3886 This function differs from `build' in several ways:
3887 the data type of the result is computed and recorded in it,
3888 warnings are generated if arg data types are invalid,
3889 special handling for addition and subtraction of pointers is known,
3890 and some optimization is done (operations on narrow ints
3891 are done in the narrower type when that gives the same result).
3892 Constant folding is also done before the result is returned.
3894 Note that the operands will never have enumeral types
3895 because either they have just had the default conversions performed
3896 or they have both just been converted to some other type in which
3897 the arithmetic is to be done.
3899 C++: must do special pointer arithmetic when implementing
3900 multiple inheritance, and deal with pointer to member functions. */
3903 cp_build_binary_op (location_t location,
3904 enum tree_code code, tree orig_op0, tree orig_op1,
3905 tsubst_flags_t complain)
3908 enum tree_code code0, code1;
3910 const char *invalid_op_diag;
3912 /* Expression code to give to the expression when it is built.
3913 Normally this is CODE, which is what the caller asked for,
3914 but in some special cases we change it. */
3915 enum tree_code resultcode = code;
3917 /* Data type in which the computation is to be performed.
3918 In the simplest cases this is the common type of the arguments. */
3919 tree result_type = NULL;
3921 /* Nonzero means operands have already been type-converted
3922 in whatever way is necessary.
3923 Zero means they need to be converted to RESULT_TYPE. */
3926 /* Nonzero means create the expression with this type, rather than
3928 tree build_type = 0;
3930 /* Nonzero means after finally constructing the expression
3931 convert it to this type. */
3932 tree final_type = 0;
3935 tree orig_type = NULL;
3937 /* Nonzero if this is an operation like MIN or MAX which can
3938 safely be computed in short if both args are promoted shorts.
3939 Also implies COMMON.
3940 -1 indicates a bitwise operation; this makes a difference
3941 in the exact conditions for when it is safe to do the operation
3942 in a narrower mode. */
3945 /* Nonzero if this is a comparison operation;
3946 if both args are promoted shorts, compare the original shorts.
3947 Also implies COMMON. */
3948 int short_compare = 0;
3950 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3953 /* True if both operands have arithmetic type. */
3954 bool arithmetic_types_p;
3956 /* Apply default conversions. */
3960 /* Remember whether we're doing / or %. */
3961 bool doing_div_or_mod = false;
3963 /* Remember whether we're doing << or >>. */
3964 bool doing_shift = false;
3966 /* Tree holding instrumentation expression. */
3967 tree instrument_expr = NULL;
3969 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3970 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3971 || code == TRUTH_XOR_EXPR)
3973 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3974 op0 = decay_conversion (op0, complain);
3975 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3976 op1 = decay_conversion (op1, complain);
3980 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3981 op0 = cp_default_conversion (op0, complain);
3982 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3983 op1 = cp_default_conversion (op1, complain);
3986 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3987 STRIP_TYPE_NOPS (op0);
3988 STRIP_TYPE_NOPS (op1);
3990 /* DTRT if one side is an overloaded function, but complain about it. */
3991 if (type_unknown_p (op0))
3993 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3994 if (t != error_mark_node)
3996 if (complain & tf_error)
3997 permerror (input_location, "assuming cast to type %qT from overloaded function",
4002 if (type_unknown_p (op1))
4004 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
4005 if (t != error_mark_node)
4007 if (complain & tf_error)
4008 permerror (input_location, "assuming cast to type %qT from overloaded function",
4014 type0 = TREE_TYPE (op0);
4015 type1 = TREE_TYPE (op1);
4017 /* The expression codes of the data types of the arguments tell us
4018 whether the arguments are integers, floating, pointers, etc. */
4019 code0 = TREE_CODE (type0);
4020 code1 = TREE_CODE (type1);
4022 /* If an error was already reported for one of the arguments,
4023 avoid reporting another error. */
4024 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
4025 return error_mark_node;
4027 if ((invalid_op_diag
4028 = targetm.invalid_binary_op (code, type0, type1)))
4030 if (complain & tf_error)
4031 error (invalid_op_diag);
4032 return error_mark_node;
4035 /* Issue warnings about peculiar, but valid, uses of NULL. */
4036 if ((orig_op0 == null_node || orig_op1 == null_node)
4037 /* It's reasonable to use pointer values as operands of &&
4038 and ||, so NULL is no exception. */
4039 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
4040 && ( /* Both are NULL (or 0) and the operation was not a
4041 comparison or a pointer subtraction. */
4042 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
4043 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
4044 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4045 || (!null_ptr_cst_p (orig_op0)
4046 && !TYPE_PTR_OR_PTRMEM_P (type0))
4047 || (!null_ptr_cst_p (orig_op1)
4048 && !TYPE_PTR_OR_PTRMEM_P (type1)))
4049 && (complain & tf_warning))
4051 source_location loc =
4052 expansion_point_location_if_in_system_header (input_location);
4054 warning_at (loc, OPT_Wpointer_arith, "NULL used in arithmetic");
4057 /* In case when one of the operands of the binary operation is
4058 a vector and another is a scalar -- convert scalar to vector. */
4059 if ((code0 == VECTOR_TYPE) != (code1 == VECTOR_TYPE))
4061 enum stv_conv convert_flag = scalar_to_vector (location, code, op0, op1,
4062 complain & tf_error);
4064 switch (convert_flag)
4067 return error_mark_node;
4070 op0 = convert (TREE_TYPE (type1), op0);
4071 op0 = save_expr (op0);
4072 op0 = build_vector_from_val (type1, op0);
4073 type0 = TREE_TYPE (op0);
4074 code0 = TREE_CODE (type0);
4080 op1 = convert (TREE_TYPE (type0), op1);
4081 op1 = save_expr (op1);
4082 op1 = build_vector_from_val (type0, op1);
4083 type1 = TREE_TYPE (op1);
4084 code1 = TREE_CODE (type1);
4096 /* Subtraction of two similar pointers.
4097 We must subtract them as integers, then divide by object size. */
4098 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
4099 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
4101 return pointer_diff (op0, op1, common_pointer_type (type0, type1),
4103 /* In all other cases except pointer - int, the usual arithmetic
4105 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
4110 /* The pointer - int case is just like pointer + int; fall
4113 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
4114 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
4118 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
4119 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
4120 if (processing_template_decl)
4122 result_type = TREE_TYPE (ptr_operand);
4125 return cp_pointer_int_sum (code,
4137 case TRUNC_DIV_EXPR:
4139 case FLOOR_DIV_EXPR:
4140 case ROUND_DIV_EXPR:
4141 case EXACT_DIV_EXPR:
4142 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4143 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
4144 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4145 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
4147 enum tree_code tcode0 = code0, tcode1 = code1;
4148 tree cop1 = fold_non_dependent_expr (op1);
4149 doing_div_or_mod = true;
4150 warn_for_div_by_zero (location, cop1);
4152 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
4153 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
4154 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
4155 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
4157 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
4158 resultcode = RDIV_EXPR;
4160 /* When dividing two signed integers, we have to promote to int.
4161 unless we divide by a constant != -1. Note that default
4162 conversion will have been performed on the operands at this
4163 point, so we have to dig out the original type to find out if
4165 shorten = ((TREE_CODE (op0) == NOP_EXPR
4166 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
4167 || (TREE_CODE (op1) == INTEGER_CST
4168 && ! integer_all_onesp (op1)));
4177 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4178 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
4179 && !VECTOR_FLOAT_TYPE_P (type0)
4180 && !VECTOR_FLOAT_TYPE_P (type1)))
4184 case TRUNC_MOD_EXPR:
4185 case FLOOR_MOD_EXPR:
4187 tree cop1 = fold_non_dependent_expr (op1);
4188 doing_div_or_mod = true;
4189 warn_for_div_by_zero (location, cop1);
4192 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
4193 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
4194 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
4196 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4198 /* Although it would be tempting to shorten always here, that loses
4199 on some targets, since the modulo instruction is undefined if the
4200 quotient can't be represented in the computation mode. We shorten
4201 only if unsigned or if dividing by something we know != -1. */
4202 shorten = ((TREE_CODE (op0) == NOP_EXPR
4203 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
4204 || (TREE_CODE (op1) == INTEGER_CST
4205 && ! integer_all_onesp (op1)));
4210 case TRUTH_ANDIF_EXPR:
4211 case TRUTH_ORIF_EXPR:
4212 case TRUTH_AND_EXPR:
4214 if (!VECTOR_TYPE_P (type0) && VECTOR_TYPE_P (type1))
4216 if (!COMPARISON_CLASS_P (op1))
4217 op1 = cp_build_binary_op (EXPR_LOCATION (op1), NE_EXPR, op1,
4218 build_zero_cst (type1), complain);
4219 if (code == TRUTH_ANDIF_EXPR)
4221 tree z = build_zero_cst (TREE_TYPE (op1));
4222 return build_conditional_expr (location, op0, op1, z, complain);
4224 else if (code == TRUTH_ORIF_EXPR)
4226 tree m1 = build_all_ones_cst (TREE_TYPE (op1));
4227 return build_conditional_expr (location, op0, m1, op1, complain);
4232 if (VECTOR_TYPE_P (type0))
4234 if (!COMPARISON_CLASS_P (op0))
4235 op0 = cp_build_binary_op (EXPR_LOCATION (op0), NE_EXPR, op0,
4236 build_zero_cst (type0), complain);
4237 if (!VECTOR_TYPE_P (type1))
4239 tree m1 = build_all_ones_cst (TREE_TYPE (op0));
4240 tree z = build_zero_cst (TREE_TYPE (op0));
4241 op1 = build_conditional_expr (location, op1, z, m1, complain);
4243 else if (!COMPARISON_CLASS_P (op1))
4244 op1 = cp_build_binary_op (EXPR_LOCATION (op1), NE_EXPR, op1,
4245 build_zero_cst (type1), complain);
4247 if (code == TRUTH_ANDIF_EXPR)
4248 code = BIT_AND_EXPR;
4249 else if (code == TRUTH_ORIF_EXPR)
4250 code = BIT_IOR_EXPR;
4254 return cp_build_binary_op (location, code, op0, op1, complain);
4257 result_type = boolean_type_node;
4260 /* Shift operations: result has same type as first operand;
4261 always convert second operand to int.
4262 Also set SHORT_SHIFT if shifting rightward. */
4265 if (code0 == VECTOR_TYPE && code1 == INTEGER_TYPE
4266 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
4268 result_type = type0;
4271 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
4272 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
4273 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
4274 && TYPE_VECTOR_SUBPARTS (type0) == TYPE_VECTOR_SUBPARTS (type1))
4276 result_type = type0;
4279 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4281 tree const_op1 = fold_non_dependent_expr (op1);
4282 if (TREE_CODE (const_op1) != INTEGER_CST)
4284 result_type = type0;
4286 if (TREE_CODE (const_op1) == INTEGER_CST)
4288 if (tree_int_cst_lt (const_op1, integer_zero_node))
4290 if ((complain & tf_warning)
4291 && c_inhibit_evaluation_warnings == 0)
4292 warning (OPT_Wshift_count_negative,
4293 "right shift count is negative");
4297 if (compare_tree_int (const_op1, TYPE_PRECISION (type0)) >= 0
4298 && (complain & tf_warning)
4299 && c_inhibit_evaluation_warnings == 0)
4300 warning (OPT_Wshift_count_overflow,
4301 "right shift count >= width of type");
4304 /* Avoid converting op1 to result_type later. */
4310 if (code0 == VECTOR_TYPE && code1 == INTEGER_TYPE
4311 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE)
4313 result_type = type0;
4316 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
4317 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
4318 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE
4319 && TYPE_VECTOR_SUBPARTS (type0) == TYPE_VECTOR_SUBPARTS (type1))
4321 result_type = type0;
4324 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4326 tree const_op1 = fold_non_dependent_expr (op1);
4327 if (TREE_CODE (const_op1) != INTEGER_CST)
4329 result_type = type0;
4331 if (TREE_CODE (const_op1) == INTEGER_CST)
4333 if (tree_int_cst_lt (const_op1, integer_zero_node))
4335 if ((complain & tf_warning)
4336 && c_inhibit_evaluation_warnings == 0)
4337 warning (OPT_Wshift_count_negative,
4338 "left shift count is negative");
4340 else if (compare_tree_int (const_op1,
4341 TYPE_PRECISION (type0)) >= 0)
4343 if ((complain & tf_warning)
4344 && c_inhibit_evaluation_warnings == 0)
4345 warning (OPT_Wshift_count_overflow,
4346 "left shift count >= width of type");
4349 /* Avoid converting op1 to result_type later. */
4356 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4358 result_type = type0;
4359 if (TREE_CODE (op1) == INTEGER_CST)
4361 if (tree_int_cst_lt (op1, integer_zero_node))
4363 if (complain & tf_warning)
4364 warning (0, (code == LROTATE_EXPR)
4365 ? G_("left rotate count is negative")
4366 : G_("right rotate count is negative"));
4368 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
4370 if (complain & tf_warning)
4371 warning (0, (code == LROTATE_EXPR)
4372 ? G_("left rotate count >= width of type")
4373 : G_("right rotate count >= width of type"));
4376 /* Convert the shift-count to an integer, regardless of
4377 size of value being shifted. */
4378 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
4379 op1 = cp_convert (integer_type_node, op1, complain);
4385 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4386 goto vector_compare;
4387 if ((complain & tf_warning)
4388 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
4389 warning (OPT_Wfloat_equal,
4390 "comparing floating point with == or != is unsafe");
4391 if ((complain & tf_warning)
4392 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
4393 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
4394 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4396 build_type = boolean_type_node;
4397 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4398 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
4399 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4400 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
4402 else if (((code0 == POINTER_TYPE || TYPE_PTRDATAMEM_P (type0))
4403 && null_ptr_cst_p (op1))
4404 /* Handle, eg, (void*)0 (c++/43906), and more. */
4405 || (code0 == POINTER_TYPE
4406 && TYPE_PTR_P (type1) && integer_zerop (op1)))
4408 if (TYPE_PTR_P (type1))
4409 result_type = composite_pointer_type (type0, type1, op0, op1,
4410 CPO_COMPARISON, complain);
4412 result_type = type0;
4414 if (TREE_CODE (op0) == ADDR_EXPR
4415 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
4417 if ((complain & tf_warning)
4418 && c_inhibit_evaluation_warnings == 0)
4419 warning (OPT_Waddress, "the address of %qD will never be NULL",
4420 TREE_OPERAND (op0, 0));
4423 else if (((code1 == POINTER_TYPE || TYPE_PTRDATAMEM_P (type1))
4424 && null_ptr_cst_p (op0))
4425 /* Handle, eg, (void*)0 (c++/43906), and more. */
4426 || (code1 == POINTER_TYPE
4427 && TYPE_PTR_P (type0) && integer_zerop (op0)))
4429 if (TYPE_PTR_P (type0))
4430 result_type = composite_pointer_type (type0, type1, op0, op1,
4431 CPO_COMPARISON, complain);
4433 result_type = type1;
4435 if (TREE_CODE (op1) == ADDR_EXPR
4436 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
4438 if ((complain & tf_warning)
4439 && c_inhibit_evaluation_warnings == 0)
4440 warning (OPT_Waddress, "the address of %qD will never be NULL",
4441 TREE_OPERAND (op1, 0));
4444 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4445 || (TYPE_PTRDATAMEM_P (type0) && TYPE_PTRDATAMEM_P (type1)))
4446 result_type = composite_pointer_type (type0, type1, op0, op1,
4447 CPO_COMPARISON, complain);
4448 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4449 /* One of the operands must be of nullptr_t type. */
4450 result_type = TREE_TYPE (nullptr_node);
4451 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4453 result_type = type0;
4454 if (complain & tf_error)
4455 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4457 return error_mark_node;
4459 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4461 result_type = type1;
4462 if (complain & tf_error)
4463 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4465 return error_mark_node;
4467 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4469 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4470 == ptrmemfunc_vbit_in_delta)
4472 tree pfn0, delta0, e1, e2;
4474 if (TREE_SIDE_EFFECTS (op0))
4475 op0 = save_expr (op0);
4477 pfn0 = pfn_from_ptrmemfunc (op0);
4478 delta0 = delta_from_ptrmemfunc (op0);
4479 e1 = cp_build_binary_op (location,
4482 build_zero_cst (TREE_TYPE (pfn0)),
4484 e2 = cp_build_binary_op (location,
4490 if (complain & tf_warning)
4491 maybe_warn_zero_as_null_pointer_constant (op1, input_location);
4493 e2 = cp_build_binary_op (location,
4494 EQ_EXPR, e2, integer_zero_node,
4496 op0 = cp_build_binary_op (location,
4497 TRUTH_ANDIF_EXPR, e1, e2,
4499 op1 = cp_convert (TREE_TYPE (op0), integer_one_node, complain);
4503 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4504 op1 = cp_convert (TREE_TYPE (op0), op1, complain);
4506 result_type = TREE_TYPE (op0);
4508 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4509 return cp_build_binary_op (location, code, op1, op0, complain);
4510 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4513 /* E will be the final comparison. */
4515 /* E1 and E2 are for scratch. */
4523 type = composite_pointer_type (type0, type1, op0, op1,
4524 CPO_COMPARISON, complain);
4526 if (!same_type_p (TREE_TYPE (op0), type))
4527 op0 = cp_convert_and_check (type, op0, complain);
4528 if (!same_type_p (TREE_TYPE (op1), type))
4529 op1 = cp_convert_and_check (type, op1, complain);
4531 if (op0 == error_mark_node || op1 == error_mark_node)
4532 return error_mark_node;
4534 if (TREE_SIDE_EFFECTS (op0))
4535 op0 = save_expr (op0);
4536 if (TREE_SIDE_EFFECTS (op1))
4537 op1 = save_expr (op1);
4539 pfn0 = pfn_from_ptrmemfunc (op0);
4540 pfn1 = pfn_from_ptrmemfunc (op1);
4541 delta0 = delta_from_ptrmemfunc (op0);
4542 delta1 = delta_from_ptrmemfunc (op1);
4543 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4544 == ptrmemfunc_vbit_in_delta)
4549 && ((op0.delta == op1.delta)
4550 || (!op0.pfn && op0.delta & 1 == 0
4551 && op1.delta & 1 == 0))
4553 The reason for the `!op0.pfn' bit is that a NULL
4554 pointer-to-member is any member with a zero PFN and
4555 LSB of the DELTA field is 0. */
4557 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4561 e1 = cp_build_binary_op (location,
4562 EQ_EXPR, e1, integer_zero_node,
4564 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4568 e2 = cp_build_binary_op (location,
4569 EQ_EXPR, e2, integer_zero_node,
4571 e1 = cp_build_binary_op (location,
4572 TRUTH_ANDIF_EXPR, e2, e1,
4574 e2 = cp_build_binary_op (location, EQ_EXPR,
4576 build_zero_cst (TREE_TYPE (pfn0)),
4578 e2 = cp_build_binary_op (location,
4579 TRUTH_ANDIF_EXPR, e2, e1, complain);
4580 e1 = cp_build_binary_op (location,
4581 EQ_EXPR, delta0, delta1, complain);
4582 e1 = cp_build_binary_op (location,
4583 TRUTH_ORIF_EXPR, e1, e2, complain);
4590 && (!op0.pfn || op0.delta == op1.delta))
4592 The reason for the `!op0.pfn' bit is that a NULL
4593 pointer-to-member is any member with a zero PFN; the
4594 DELTA field is unspecified. */
4596 e1 = cp_build_binary_op (location,
4597 EQ_EXPR, delta0, delta1, complain);
4598 e2 = cp_build_binary_op (location,
4601 build_zero_cst (TREE_TYPE (pfn0)),
4603 e1 = cp_build_binary_op (location,
4604 TRUTH_ORIF_EXPR, e1, e2, complain);
4606 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4607 e = cp_build_binary_op (location,
4608 TRUTH_ANDIF_EXPR, e2, e1, complain);
4609 if (code == EQ_EXPR)
4611 return cp_build_binary_op (location,
4612 EQ_EXPR, e, integer_zero_node, complain);
4616 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4617 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4619 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4620 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4628 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4629 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4631 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4632 result_type = composite_pointer_type (type0, type1, op0, op1,
4633 CPO_COMPARISON, complain);
4640 if (TREE_CODE (orig_op0) == STRING_CST
4641 || TREE_CODE (orig_op1) == STRING_CST)
4643 if (complain & tf_warning)
4644 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4647 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4651 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
4653 && !vector_types_compatible_elements_p (type0, type1))
4655 if (complain & tf_error)
4657 error_at (location, "comparing vectors with different "
4659 inform (location, "operand types are %qT and %qT",
4662 return error_mark_node;
4665 if (TYPE_VECTOR_SUBPARTS (type0) != TYPE_VECTOR_SUBPARTS (type1))
4667 if (complain & tf_error)
4669 error_at (location, "comparing vectors with different "
4670 "number of elements");
4671 inform (location, "operand types are %qT and %qT",
4674 return error_mark_node;
4677 /* Always construct signed integer vector type. */
4678 intt = c_common_type_for_size (GET_MODE_BITSIZE
4679 (TYPE_MODE (TREE_TYPE (type0))), 0);
4682 if (complain & tf_error)
4683 error_at (location, "could not find an integer type "
4684 "of the same size as %qT", TREE_TYPE (type0));
4685 return error_mark_node;
4687 result_type = build_opaque_vector_type (intt,
4688 TYPE_VECTOR_SUBPARTS (type0));
4692 build_type = boolean_type_node;
4693 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4694 || code0 == ENUMERAL_TYPE)
4695 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4696 || code1 == ENUMERAL_TYPE))
4698 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4699 result_type = composite_pointer_type (type0, type1, op0, op1,
4700 CPO_COMPARISON, complain);
4701 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4703 result_type = type0;
4704 if (extra_warnings && (complain & tf_warning))
4705 warning (OPT_Wextra,
4706 "ordered comparison of pointer with integer zero");
4708 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4710 result_type = type1;
4711 if (extra_warnings && (complain & tf_warning))
4712 warning (OPT_Wextra,
4713 "ordered comparison of pointer with integer zero");
4715 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4716 /* One of the operands must be of nullptr_t type. */
4717 result_type = TREE_TYPE (nullptr_node);
4718 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4720 result_type = type0;
4721 if (complain & tf_error)
4722 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4724 return error_mark_node;
4726 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4728 result_type = type1;
4729 if (complain & tf_error)
4730 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4732 return error_mark_node;
4736 case UNORDERED_EXPR:
4743 build_type = integer_type_node;
4744 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4746 if (complain & tf_error)
4747 error ("unordered comparison on non-floating point argument");
4748 return error_mark_node;
4757 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4758 || code0 == ENUMERAL_TYPE)
4759 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4760 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4761 arithmetic_types_p = 1;
4764 arithmetic_types_p = 0;
4765 /* Vector arithmetic is only allowed when both sides are vectors. */
4766 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4768 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4769 || !vector_types_compatible_elements_p (type0, type1))
4771 if (complain & tf_error)
4772 binary_op_error (location, code, type0, type1);
4773 return error_mark_node;
4775 arithmetic_types_p = 1;
4778 /* Determine the RESULT_TYPE, if it is not already known. */
4780 && arithmetic_types_p
4781 && (shorten || common || short_compare))
4783 result_type = cp_common_type (type0, type1);
4784 if (complain & tf_warning)
4785 do_warn_double_promotion (result_type, type0, type1,
4786 "implicit conversion from %qT to %qT "
4787 "to match other operand of binary "
4794 if (complain & tf_error)
4795 error ("invalid operands of types %qT and %qT to binary %qO",
4796 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4797 return error_mark_node;
4800 /* If we're in a template, the only thing we need to know is the
4802 if (processing_template_decl)
4804 /* Since the middle-end checks the type when doing a build2, we
4805 need to build the tree in pieces. This built tree will never
4806 get out of the front-end as we replace it when instantiating
4808 tree tmp = build2 (resultcode,
4809 build_type ? build_type : result_type,
4811 TREE_OPERAND (tmp, 0) = op0;
4815 if (arithmetic_types_p)
4817 bool first_complex = (code0 == COMPLEX_TYPE);
4818 bool second_complex = (code1 == COMPLEX_TYPE);
4819 int none_complex = (!first_complex && !second_complex);
4821 /* Adapted from patch for c/24581. */
4822 if (first_complex != second_complex
4823 && (code == PLUS_EXPR
4824 || code == MINUS_EXPR
4825 || code == MULT_EXPR
4826 || (code == TRUNC_DIV_EXPR && first_complex))
4827 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4828 && flag_signed_zeros)
4830 /* An operation on mixed real/complex operands must be
4831 handled specially, but the language-independent code can
4832 more easily optimize the plain complex arithmetic if
4833 -fno-signed-zeros. */
4834 tree real_type = TREE_TYPE (result_type);
4838 if (TREE_TYPE (op0) != result_type)
4839 op0 = cp_convert_and_check (result_type, op0, complain);
4840 if (TREE_TYPE (op1) != real_type)
4841 op1 = cp_convert_and_check (real_type, op1, complain);
4845 if (TREE_TYPE (op0) != real_type)
4846 op0 = cp_convert_and_check (real_type, op0, complain);
4847 if (TREE_TYPE (op1) != result_type)
4848 op1 = cp_convert_and_check (result_type, op1, complain);
4850 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4851 return error_mark_node;
4854 op0 = save_expr (op0);
4855 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4856 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4860 case TRUNC_DIV_EXPR:
4861 op1 = save_expr (op1);
4862 imag = build2 (resultcode, real_type, imag, op1);
4866 real = build2 (resultcode, real_type, real, op1);
4874 op1 = save_expr (op1);
4875 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4876 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4880 op0 = save_expr (op0);
4881 imag = build2 (resultcode, real_type, op0, imag);
4884 real = build2 (resultcode, real_type, op0, real);
4887 real = build2 (resultcode, real_type, op0, real);
4888 imag = build1 (NEGATE_EXPR, real_type, imag);
4894 real = fold_if_not_in_template (real);
4895 imag = fold_if_not_in_template (imag);
4896 result = build2 (COMPLEX_EXPR, result_type, real, imag);
4897 result = fold_if_not_in_template (result);
4901 /* For certain operations (which identify themselves by shorten != 0)
4902 if both args were extended from the same smaller type,
4903 do the arithmetic in that type and then extend.
4905 shorten !=0 and !=1 indicates a bitwise operation.
4906 For them, this optimization is safe only if
4907 both args are zero-extended or both are sign-extended.
4908 Otherwise, we might change the result.
4909 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4910 but calculated in (unsigned short) it would be (unsigned short)-1. */
4912 if (shorten && none_complex)
4914 orig_type = result_type;
4915 final_type = result_type;
4916 result_type = shorten_binary_op (result_type, op0, op1,
4920 /* Comparison operations are shortened too but differently.
4921 They identify themselves by setting short_compare = 1. */
4925 /* Don't write &op0, etc., because that would prevent op0
4926 from being kept in a register.
4927 Instead, make copies of the our local variables and
4928 pass the copies by reference, then copy them back afterward. */
4929 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4930 enum tree_code xresultcode = resultcode;
4932 = shorten_compare (location, &xop0, &xop1, &xresult_type,
4935 return cp_convert (boolean_type_node, val, complain);
4936 op0 = xop0, op1 = xop1;
4938 resultcode = xresultcode;
4941 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4942 && warn_sign_compare
4943 /* Do not warn until the template is instantiated; we cannot
4944 bound the ranges of the arguments until that point. */
4945 && !processing_template_decl
4946 && (complain & tf_warning)
4947 && c_inhibit_evaluation_warnings == 0
4948 /* Even unsigned enum types promote to signed int. We don't
4949 want to issue -Wsign-compare warnings for this case. */
4950 && !enum_cast_to_int (orig_op0)
4951 && !enum_cast_to_int (orig_op1))
4953 tree oop0 = maybe_constant_value (orig_op0);
4954 tree oop1 = maybe_constant_value (orig_op1);
4956 if (TREE_CODE (oop0) != INTEGER_CST)
4958 if (TREE_CODE (oop1) != INTEGER_CST)
4960 warn_for_sign_compare (location, oop0, oop1, op0, op1,
4961 result_type, resultcode);
4965 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4966 Then the expression will be built.
4967 It will be given type FINAL_TYPE if that is nonzero;
4968 otherwise, it will be given type RESULT_TYPE. */
4971 if (TREE_TYPE (op0) != result_type)
4972 op0 = cp_convert_and_check (result_type, op0, complain);
4973 if (TREE_TYPE (op1) != result_type)
4974 op1 = cp_convert_and_check (result_type, op1, complain);
4976 if (op0 == error_mark_node || op1 == error_mark_node)
4977 return error_mark_node;
4980 if (build_type == NULL_TREE)
4981 build_type = result_type;
4983 if ((flag_sanitize & (SANITIZE_SHIFT | SANITIZE_DIVIDE
4984 | SANITIZE_FLOAT_DIVIDE))
4985 && !processing_template_decl
4986 && do_ubsan_in_current_function ()
4987 && (doing_div_or_mod || doing_shift))
4989 /* OP0 and/or OP1 might have side-effects. */
4990 op0 = cp_save_expr (op0);
4991 op1 = cp_save_expr (op1);
4992 op0 = fold_non_dependent_expr (op0);
4993 op1 = fold_non_dependent_expr (op1);
4994 if (doing_div_or_mod && (flag_sanitize & (SANITIZE_DIVIDE
4995 | SANITIZE_FLOAT_DIVIDE)))
4997 /* For diagnostics we want to use the promoted types without
4998 shorten_binary_op. So convert the arguments to the
4999 original result_type. */
5002 if (orig_type != NULL && result_type != orig_type)
5004 cop0 = cp_convert (orig_type, op0, complain);
5005 cop1 = cp_convert (orig_type, op1, complain);
5007 instrument_expr = ubsan_instrument_division (location, cop0, cop1);
5009 else if (doing_shift && (flag_sanitize & SANITIZE_SHIFT))
5010 instrument_expr = ubsan_instrument_shift (location, code, op0, op1);
5013 result = build2 (resultcode, build_type, op0, op1);
5014 result = fold_if_not_in_template (result);
5015 if (final_type != 0)
5016 result = cp_convert (final_type, result, complain);
5018 if (TREE_OVERFLOW_P (result)
5019 && !TREE_OVERFLOW_P (op0)
5020 && !TREE_OVERFLOW_P (op1))
5021 overflow_warning (location, result);
5023 if (instrument_expr != NULL)
5024 result = fold_build2 (COMPOUND_EXPR, TREE_TYPE (result),
5025 instrument_expr, result);
5030 /* Build a VEC_PERM_EXPR.
5031 This is a simple wrapper for c_build_vec_perm_expr. */
5033 build_x_vec_perm_expr (location_t loc,
5034 tree arg0, tree arg1, tree arg2,
5035 tsubst_flags_t complain)
5037 tree orig_arg0 = arg0;
5038 tree orig_arg1 = arg1;
5039 tree orig_arg2 = arg2;
5040 if (processing_template_decl)
5042 if (type_dependent_expression_p (arg0)
5043 || type_dependent_expression_p (arg1)
5044 || type_dependent_expression_p (arg2))
5045 return build_min_nt_loc (loc, VEC_PERM_EXPR, arg0, arg1, arg2);
5046 arg0 = build_non_dependent_expr (arg0);
5048 arg1 = build_non_dependent_expr (arg1);
5049 arg2 = build_non_dependent_expr (arg2);
5051 tree exp = c_build_vec_perm_expr (loc, arg0, arg1, arg2, complain & tf_error);
5052 if (processing_template_decl && exp != error_mark_node)
5053 return build_min_non_dep (VEC_PERM_EXPR, exp, orig_arg0,
5054 orig_arg1, orig_arg2);
5058 /* Return a tree for the sum or difference (RESULTCODE says which)
5059 of pointer PTROP and integer INTOP. */
5062 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop,
5063 tsubst_flags_t complain)
5065 tree res_type = TREE_TYPE (ptrop);
5067 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
5068 in certain circumstance (when it's valid to do so). So we need
5069 to make sure it's complete. We don't need to check here, if we
5070 can actually complete it at all, as those checks will be done in
5071 pointer_int_sum() anyway. */
5072 complete_type (TREE_TYPE (res_type));
5074 return pointer_int_sum (input_location, resultcode, ptrop,
5075 fold_if_not_in_template (intop),
5076 complain & tf_warning_or_error);
5079 /* Return a tree for the difference of pointers OP0 and OP1.
5080 The resulting tree has type int. */
5083 pointer_diff (tree op0, tree op1, tree ptrtype, tsubst_flags_t complain)
5086 tree restype = ptrdiff_type_node;
5087 tree target_type = TREE_TYPE (ptrtype);
5089 if (!complete_type_or_else (target_type, NULL_TREE))
5090 return error_mark_node;
5092 if (VOID_TYPE_P (target_type))
5094 if (complain & tf_error)
5095 permerror (input_location, "ISO C++ forbids using pointer of "
5096 "type %<void *%> in subtraction");
5098 return error_mark_node;
5100 if (TREE_CODE (target_type) == FUNCTION_TYPE)
5102 if (complain & tf_error)
5103 permerror (input_location, "ISO C++ forbids using pointer to "
5104 "a function in subtraction");
5106 return error_mark_node;
5108 if (TREE_CODE (target_type) == METHOD_TYPE)
5110 if (complain & tf_error)
5111 permerror (input_location, "ISO C++ forbids using pointer to "
5112 "a method in subtraction");
5114 return error_mark_node;
5117 /* First do the subtraction as integers;
5118 then drop through to build the divide operator. */
5120 op0 = cp_build_binary_op (input_location,
5122 cp_convert (restype, op0, complain),
5123 cp_convert (restype, op1, complain),
5126 /* This generates an error if op1 is a pointer to an incomplete type. */
5127 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
5129 if (complain & tf_error)
5130 error ("invalid use of a pointer to an incomplete type in "
5131 "pointer arithmetic");
5133 return error_mark_node;
5136 if (pointer_to_zero_sized_aggr_p (TREE_TYPE (op1)))
5138 if (complain & tf_error)
5139 error ("arithmetic on pointer to an empty aggregate");
5141 return error_mark_node;
5144 op1 = (TYPE_PTROB_P (ptrtype)
5145 ? size_in_bytes (target_type)
5146 : integer_one_node);
5148 /* Do the division. */
5150 result = build2 (EXACT_DIV_EXPR, restype, op0,
5151 cp_convert (restype, op1, complain));
5152 return fold_if_not_in_template (result);
5155 /* Construct and perhaps optimize a tree representation
5156 for a unary operation. CODE, a tree_code, specifies the operation
5157 and XARG is the operand. */
5160 build_x_unary_op (location_t loc, enum tree_code code, tree xarg,
5161 tsubst_flags_t complain)
5163 tree orig_expr = xarg;
5167 if (processing_template_decl)
5169 if (type_dependent_expression_p (xarg))
5170 return build_min_nt_loc (loc, code, xarg, NULL_TREE);
5172 xarg = build_non_dependent_expr (xarg);
5177 /* [expr.unary.op] says:
5179 The address of an object of incomplete type can be taken.
5181 (And is just the ordinary address operator, not an overloaded
5182 "operator &".) However, if the type is a template
5183 specialization, we must complete the type at this point so that
5184 an overloaded "operator &" will be available if required. */
5185 if (code == ADDR_EXPR
5186 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
5187 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
5188 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
5189 || (TREE_CODE (xarg) == OFFSET_REF)))
5190 /* Don't look for a function. */;
5192 exp = build_new_op (loc, code, LOOKUP_NORMAL, xarg, NULL_TREE,
5193 NULL_TREE, /*overload=*/NULL, complain);
5194 if (!exp && code == ADDR_EXPR)
5196 if (is_overloaded_fn (xarg))
5198 tree fn = get_first_fn (xarg);
5199 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
5201 if (complain & tf_error)
5202 error (DECL_CONSTRUCTOR_P (fn)
5203 ? G_("taking address of constructor %qE")
5204 : G_("taking address of destructor %qE"),
5206 return error_mark_node;
5210 /* A pointer to member-function can be formed only by saying
5212 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
5213 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
5215 if (TREE_CODE (xarg) != OFFSET_REF
5216 || !TYPE_P (TREE_OPERAND (xarg, 0)))
5218 if (complain & tf_error)
5220 error ("invalid use of %qE to form a "
5221 "pointer-to-member-function", xarg);
5222 if (TREE_CODE (xarg) != OFFSET_REF)
5223 inform (input_location, " a qualified-id is required");
5225 return error_mark_node;
5229 if (complain & tf_error)
5230 error ("parentheses around %qE cannot be used to form a"
5231 " pointer-to-member-function",
5234 return error_mark_node;
5235 PTRMEM_OK_P (xarg) = 1;
5239 if (TREE_CODE (xarg) == OFFSET_REF)
5241 ptrmem = PTRMEM_OK_P (xarg);
5243 if (!ptrmem && !flag_ms_extensions
5244 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
5246 /* A single non-static member, make sure we don't allow a
5247 pointer-to-member. */
5248 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
5249 TREE_OPERAND (xarg, 0),
5250 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
5251 PTRMEM_OK_P (xarg) = ptrmem;
5255 exp = cp_build_addr_expr_strict (xarg, complain);
5258 if (processing_template_decl && exp != error_mark_node)
5259 exp = build_min_non_dep (code, exp, orig_expr,
5260 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
5261 if (TREE_CODE (exp) == ADDR_EXPR)
5262 PTRMEM_OK_P (exp) = ptrmem;
5266 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
5267 constants, where a null value is represented by an INTEGER_CST of
5271 cp_truthvalue_conversion (tree expr)
5273 tree type = TREE_TYPE (expr);
5274 if (TYPE_PTRDATAMEM_P (type)
5275 /* Avoid ICE on invalid use of non-static member function. */
5276 || TREE_CODE (expr) == FUNCTION_DECL)
5277 return build_binary_op (EXPR_LOCATION (expr),
5278 NE_EXPR, expr, nullptr_node, 1);
5279 else if (TYPE_PTR_P (type) || TYPE_PTRMEMFUNC_P (type))
5281 /* With -Wzero-as-null-pointer-constant do not warn for an
5282 'if (p)' or a 'while (!p)', where p is a pointer. */
5284 ++c_inhibit_evaluation_warnings;
5285 ret = c_common_truthvalue_conversion (input_location, expr);
5286 --c_inhibit_evaluation_warnings;
5290 return c_common_truthvalue_conversion (input_location, expr);
5293 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
5296 condition_conversion (tree expr)
5299 if (processing_template_decl)
5301 t = perform_implicit_conversion_flags (boolean_type_node, expr,
5302 tf_warning_or_error, LOOKUP_NORMAL);
5303 t = fold_build_cleanup_point_expr (boolean_type_node, t);
5307 /* Returns the address of T. This function will fold away
5308 ADDR_EXPR of INDIRECT_REF. */
5311 build_address (tree t)
5313 if (error_operand_p (t) || !cxx_mark_addressable (t))
5314 return error_mark_node;
5315 gcc_checking_assert (TREE_CODE (t) != CONSTRUCTOR);
5316 t = build_fold_addr_expr (t);
5317 if (TREE_CODE (t) != ADDR_EXPR)
5322 /* Return a NOP_EXPR converting EXPR to TYPE. */
5325 build_nop (tree type, tree expr)
5327 if (type == error_mark_node || error_operand_p (expr))
5329 return build1 (NOP_EXPR, type, expr);
5332 /* Take the address of ARG, whatever that means under C++ semantics.
5333 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
5334 and class rvalues as well.
5336 Nothing should call this function directly; instead, callers should use
5337 cp_build_addr_expr or cp_build_addr_expr_strict. */
5340 cp_build_addr_expr_1 (tree arg, bool strict_lvalue, tsubst_flags_t complain)
5345 if (!arg || error_operand_p (arg))
5346 return error_mark_node;
5348 arg = mark_lvalue_use (arg);
5349 argtype = lvalue_type (arg);
5351 gcc_assert (!identifier_p (arg) || !IDENTIFIER_OPNAME_P (arg));
5353 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
5354 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
5356 /* They're trying to take the address of a unique non-static
5357 member function. This is ill-formed (except in MS-land),
5358 but let's try to DTRT.
5359 Note: We only handle unique functions here because we don't
5360 want to complain if there's a static overload; non-unique
5361 cases will be handled by instantiate_type. But we need to
5362 handle this case here to allow casts on the resulting PMF.
5363 We could defer this in non-MS mode, but it's easier to give
5364 a useful error here. */
5366 /* Inside constant member functions, the `this' pointer
5367 contains an extra const qualifier. TYPE_MAIN_VARIANT
5368 is used here to remove this const from the diagnostics
5369 and the created OFFSET_REF. */
5370 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
5371 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
5374 if (! flag_ms_extensions)
5376 tree name = DECL_NAME (fn);
5377 if (!(complain & tf_error))
5378 return error_mark_node;
5379 else if (current_class_type
5380 && TREE_OPERAND (arg, 0) == current_class_ref)
5381 /* An expression like &memfn. */
5382 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
5383 " or parenthesized non-static member function to form"
5384 " a pointer to member function. Say %<&%T::%D%>",
5387 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
5388 " function to form a pointer to member function."
5392 arg = build_offset_ref (base, fn, /*address_p=*/true, complain);
5395 /* Uninstantiated types are all functions. Taking the
5396 address of a function is a no-op, so just return the
5398 if (type_unknown_p (arg))
5399 return build1 (ADDR_EXPR, unknown_type_node, arg);
5401 if (TREE_CODE (arg) == OFFSET_REF)
5402 /* We want a pointer to member; bypass all the code for actually taking
5403 the address of something. */
5406 /* Anything not already handled and not a true memory reference
5408 if (TREE_CODE (argtype) != FUNCTION_TYPE
5409 && TREE_CODE (argtype) != METHOD_TYPE)
5411 cp_lvalue_kind kind = lvalue_kind (arg);
5412 if (kind == clk_none)
5414 if (complain & tf_error)
5415 lvalue_error (input_location, lv_addressof);
5416 return error_mark_node;
5418 if (strict_lvalue && (kind & (clk_rvalueref|clk_class)))
5420 if (!(complain & tf_error))
5421 return error_mark_node;
5422 if (kind & clk_class)
5423 /* Make this a permerror because we used to accept it. */
5424 permerror (input_location, "taking address of temporary");
5426 error ("taking address of xvalue (rvalue reference)");
5430 if (TREE_CODE (argtype) == REFERENCE_TYPE)
5432 tree type = build_pointer_type (TREE_TYPE (argtype));
5433 arg = build1 (CONVERT_EXPR, type, arg);
5436 else if (pedantic && DECL_MAIN_P (arg))
5439 /* Apparently a lot of autoconf scripts for C++ packages do this,
5440 so only complain if -Wpedantic. */
5441 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
5442 pedwarn (input_location, OPT_Wpedantic,
5443 "ISO C++ forbids taking address of function %<::main%>");
5444 else if (flag_pedantic_errors)
5445 return error_mark_node;
5448 /* Let &* cancel out to simplify resulting code. */
5449 if (INDIRECT_REF_P (arg))
5451 /* We don't need to have `current_class_ptr' wrapped in a
5452 NON_LVALUE_EXPR node. */
5453 if (arg == current_class_ref)
5454 return current_class_ptr;
5456 arg = TREE_OPERAND (arg, 0);
5457 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
5459 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
5460 arg = build1 (CONVERT_EXPR, type, arg);
5463 /* Don't let this be an lvalue. */
5468 /* ??? Cope with user tricks that amount to offsetof. */
5469 if (TREE_CODE (argtype) != FUNCTION_TYPE
5470 && TREE_CODE (argtype) != METHOD_TYPE
5471 && argtype != unknown_type_node
5472 && (val = get_base_address (arg))
5473 && COMPLETE_TYPE_P (TREE_TYPE (val))
5474 && INDIRECT_REF_P (val)
5475 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
5477 tree type = build_pointer_type (argtype);
5478 return fold_convert (type, fold_offsetof_1 (arg));
5481 /* Handle complex lvalues (when permitted)
5482 by reduction to simpler cases. */
5483 val = unary_complex_lvalue (ADDR_EXPR, arg);
5487 switch (TREE_CODE (arg))
5491 case FIX_TRUNC_EXPR:
5492 /* Even if we're not being pedantic, we cannot allow this
5493 extension when we're instantiating in a SFINAE
5495 if (! lvalue_p (arg) && complain == tf_none)
5497 if (complain & tf_error)
5498 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5500 return error_mark_node;
5505 arg = BASELINK_FUNCTIONS (arg);
5509 arg = OVL_CURRENT (arg);
5514 /* Turn a reference to a non-static data member into a
5515 pointer-to-member. */
5520 gcc_assert (PTRMEM_OK_P (arg));
5522 t = TREE_OPERAND (arg, 1);
5523 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
5525 if (complain & tf_error)
5526 error ("cannot create pointer to reference member %qD", t);
5527 return error_mark_node;
5530 type = build_ptrmem_type (context_for_name_lookup (t),
5532 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
5540 if (argtype != error_mark_node)
5541 argtype = build_pointer_type (argtype);
5543 /* In a template, we are processing a non-dependent expression
5544 so we can just form an ADDR_EXPR with the correct type. */
5545 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
5547 val = build_address (arg);
5548 if (TREE_CODE (arg) == OFFSET_REF)
5549 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
5551 else if (BASELINK_P (TREE_OPERAND (arg, 1)))
5553 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
5555 /* We can only get here with a single static member
5557 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
5558 && DECL_STATIC_FUNCTION_P (fn));
5560 val = build_address (fn);
5561 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
5562 /* Do not lose object's side effects. */
5563 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
5564 TREE_OPERAND (arg, 0), val);
5566 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
5568 if (complain & tf_error)
5569 error ("attempt to take address of bit-field structure member %qD",
5570 TREE_OPERAND (arg, 1));
5571 return error_mark_node;
5575 tree object = TREE_OPERAND (arg, 0);
5576 tree field = TREE_OPERAND (arg, 1);
5577 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5578 (TREE_TYPE (object), decl_type_context (field)));
5579 val = build_address (arg);
5582 if (TYPE_PTR_P (argtype)
5583 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
5585 build_ptrmemfunc_type (argtype);
5586 val = build_ptrmemfunc (argtype, val, 0,
5594 /* Take the address of ARG if it has one, even if it's an rvalue. */
5597 cp_build_addr_expr (tree arg, tsubst_flags_t complain)
5599 return cp_build_addr_expr_1 (arg, 0, complain);
5602 /* Take the address of ARG, but only if it's an lvalue. */
5605 cp_build_addr_expr_strict (tree arg, tsubst_flags_t complain)
5607 return cp_build_addr_expr_1 (arg, 1, complain);
5610 /* C++: Must handle pointers to members.
5612 Perhaps type instantiation should be extended to handle conversion
5613 from aggregates to types we don't yet know we want? (Or are those
5614 cases typically errors which should be reported?)
5616 NOCONVERT nonzero suppresses the default promotions
5617 (such as from short to int). */
5620 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
5621 tsubst_flags_t complain)
5623 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5626 const char *errstring = NULL;
5628 const char *invalid_op_diag;
5630 if (!arg || error_operand_p (arg))
5631 return error_mark_node;
5633 if ((invalid_op_diag
5634 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
5639 if (complain & tf_error)
5640 error (invalid_op_diag);
5641 return error_mark_node;
5646 case UNARY_PLUS_EXPR:
5649 int flags = WANT_ARITH | WANT_ENUM;
5650 /* Unary plus (but not unary minus) is allowed on pointers. */
5651 if (code == UNARY_PLUS_EXPR)
5652 flags |= WANT_POINTER;
5653 arg = build_expr_type_conversion (flags, arg, true);
5655 errstring = (code == NEGATE_EXPR
5656 ? _("wrong type argument to unary minus")
5657 : _("wrong type argument to unary plus"));
5660 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5661 arg = cp_perform_integral_promotions (arg, complain);
5663 /* Make sure the result is not an lvalue: a unary plus or minus
5664 expression is always a rvalue. */
5671 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5676 arg = cp_default_conversion (arg, complain);
5677 if (arg == error_mark_node)
5678 return error_mark_node;
5681 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
5682 | WANT_VECTOR_OR_COMPLEX,
5684 errstring = _("wrong type argument to bit-complement");
5685 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5686 arg = cp_perform_integral_promotions (arg, complain);
5690 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5691 errstring = _("wrong type argument to abs");
5692 else if (!noconvert)
5694 arg = cp_default_conversion (arg, complain);
5695 if (arg == error_mark_node)
5696 return error_mark_node;
5701 /* Conjugating a real value is a no-op, but allow it anyway. */
5702 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5703 errstring = _("wrong type argument to conjugation");
5704 else if (!noconvert)
5706 arg = cp_default_conversion (arg, complain);
5707 if (arg == error_mark_node)
5708 return error_mark_node;
5712 case TRUTH_NOT_EXPR:
5713 if (VECTOR_TYPE_P (TREE_TYPE (arg)))
5714 return cp_build_binary_op (input_location, EQ_EXPR, arg,
5715 build_zero_cst (TREE_TYPE (arg)), complain);
5716 arg = perform_implicit_conversion (boolean_type_node, arg,
5718 val = invert_truthvalue_loc (input_location, arg);
5719 if (arg != error_mark_node)
5721 errstring = _("in argument to unary !");
5729 arg = build_real_imag_expr (input_location, code, arg);
5730 if (arg == error_mark_node)
5733 return fold_if_not_in_template (arg);
5735 case PREINCREMENT_EXPR:
5736 case POSTINCREMENT_EXPR:
5737 case PREDECREMENT_EXPR:
5738 case POSTDECREMENT_EXPR:
5739 /* Handle complex lvalues (when permitted)
5740 by reduction to simpler cases. */
5742 val = unary_complex_lvalue (code, arg);
5746 arg = mark_lvalue_use (arg);
5748 /* Increment or decrement the real part of the value,
5749 and don't change the imaginary part. */
5750 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5754 arg = stabilize_reference (arg);
5755 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
5756 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
5757 real = cp_build_unary_op (code, real, 1, complain);
5758 if (real == error_mark_node || imag == error_mark_node)
5759 return error_mark_node;
5760 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
5764 /* Report invalid types. */
5766 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
5769 if (code == PREINCREMENT_EXPR)
5770 errstring = _("no pre-increment operator for type");
5771 else if (code == POSTINCREMENT_EXPR)
5772 errstring = _("no post-increment operator for type");
5773 else if (code == PREDECREMENT_EXPR)
5774 errstring = _("no pre-decrement operator for type");
5776 errstring = _("no post-decrement operator for type");
5779 else if (arg == error_mark_node)
5780 return error_mark_node;
5782 /* Report something read-only. */
5784 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
5785 || TREE_READONLY (arg))
5787 if (complain & tf_error)
5788 cxx_readonly_error (arg, ((code == PREINCREMENT_EXPR
5789 || code == POSTINCREMENT_EXPR)
5790 ? lv_increment : lv_decrement));
5792 return error_mark_node;
5797 tree declared_type = unlowered_expr_type (arg);
5799 argtype = TREE_TYPE (arg);
5801 /* ARM $5.2.5 last annotation says this should be forbidden. */
5802 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
5804 if (complain & tf_error)
5805 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
5806 ? G_("ISO C++ forbids incrementing an enum")
5807 : G_("ISO C++ forbids decrementing an enum"));
5809 return error_mark_node;
5812 /* Compute the increment. */
5814 if (TYPE_PTR_P (argtype))
5816 tree type = complete_type (TREE_TYPE (argtype));
5818 if (!COMPLETE_OR_VOID_TYPE_P (type))
5820 if (complain & tf_error)
5821 error (((code == PREINCREMENT_EXPR
5822 || code == POSTINCREMENT_EXPR))
5823 ? G_("cannot increment a pointer to incomplete type %qT")
5824 : G_("cannot decrement a pointer to incomplete type %qT"),
5825 TREE_TYPE (argtype));
5827 return error_mark_node;
5829 else if (!TYPE_PTROB_P (argtype))
5831 if (complain & tf_error)
5832 pedwarn (input_location, OPT_Wpointer_arith,
5833 (code == PREINCREMENT_EXPR
5834 || code == POSTINCREMENT_EXPR)
5835 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5836 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5839 return error_mark_node;
5842 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
5845 inc = VECTOR_TYPE_P (argtype)
5846 ? build_one_cst (argtype)
5849 inc = cp_convert (argtype, inc, complain);
5851 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5852 need to ask Objective-C to build the increment or decrement
5853 expression for it. */
5854 if (objc_is_property_ref (arg))
5855 return objc_build_incr_expr_for_property_ref (input_location, code,
5858 /* Complain about anything else that is not a true lvalue. */
5859 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
5860 || code == POSTINCREMENT_EXPR)
5861 ? lv_increment : lv_decrement),
5863 return error_mark_node;
5865 /* Forbid using -- on `bool'. */
5866 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
5868 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
5870 if (complain & tf_error)
5871 error ("invalid use of Boolean expression as operand "
5872 "to %<operator--%>");
5873 return error_mark_node;
5875 val = boolean_increment (code, arg);
5877 else if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5878 /* An rvalue has no cv-qualifiers. */
5879 val = build2 (code, cv_unqualified (TREE_TYPE (arg)), arg, inc);
5881 val = build2 (code, TREE_TYPE (arg), arg, inc);
5883 TREE_SIDE_EFFECTS (val) = 1;
5888 /* Note that this operation never does default_conversion
5889 regardless of NOCONVERT. */
5890 return cp_build_addr_expr (arg, complain);
5899 argtype = TREE_TYPE (arg);
5900 return fold_if_not_in_template (build1 (code, argtype, arg));
5903 if (complain & tf_error)
5904 error ("%s", errstring);
5905 return error_mark_node;
5908 /* Hook for the c-common bits that build a unary op. */
5910 build_unary_op (location_t /*location*/,
5911 enum tree_code code, tree xarg, int noconvert)
5913 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5916 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5917 for certain kinds of expressions which are not really lvalues
5918 but which we can accept as lvalues.
5920 If ARG is not a kind of expression we can handle, return
5924 unary_complex_lvalue (enum tree_code code, tree arg)
5926 /* Inside a template, making these kinds of adjustments is
5927 pointless; we are only concerned with the type of the
5929 if (processing_template_decl)
5932 /* Handle (a, b) used as an "lvalue". */
5933 if (TREE_CODE (arg) == COMPOUND_EXPR)
5935 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5936 tf_warning_or_error);
5937 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5938 TREE_OPERAND (arg, 0), real_result);
5941 /* Handle (a ? b : c) used as an "lvalue". */
5942 if (TREE_CODE (arg) == COND_EXPR
5943 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5944 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5946 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5947 if (TREE_CODE (arg) == MODIFY_EXPR
5948 || TREE_CODE (arg) == PREINCREMENT_EXPR
5949 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5951 tree lvalue = TREE_OPERAND (arg, 0);
5952 if (TREE_SIDE_EFFECTS (lvalue))
5954 lvalue = stabilize_reference (lvalue);
5955 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5956 lvalue, TREE_OPERAND (arg, 1));
5958 return unary_complex_lvalue
5959 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5962 if (code != ADDR_EXPR)
5965 /* Handle (a = b) used as an "lvalue" for `&'. */
5966 if (TREE_CODE (arg) == MODIFY_EXPR
5967 || TREE_CODE (arg) == INIT_EXPR)
5969 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5970 tf_warning_or_error);
5971 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5973 TREE_NO_WARNING (arg) = 1;
5977 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5978 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5979 || TREE_CODE (arg) == OFFSET_REF)
5982 /* We permit compiler to make function calls returning
5983 objects of aggregate type look like lvalues. */
5987 if (TREE_CODE (targ) == SAVE_EXPR)
5988 targ = TREE_OPERAND (targ, 0);
5990 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5992 if (TREE_CODE (arg) == SAVE_EXPR)
5995 targ = build_cplus_new (TREE_TYPE (arg), arg, tf_warning_or_error);
5996 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5999 if (TREE_CODE (arg) == SAVE_EXPR && INDIRECT_REF_P (targ))
6000 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
6001 TREE_OPERAND (targ, 0), current_function_decl, NULL);
6004 /* Don't let anything else be handled specially. */
6008 /* Mark EXP saying that we need to be able to take the
6009 address of it; it should not be allocated in a register.
6010 Value is true if successful.
6012 C++: we do not allow `current_class_ptr' to be addressable. */
6015 cxx_mark_addressable (tree exp)
6020 switch (TREE_CODE (x))
6027 x = TREE_OPERAND (x, 0);
6031 if (x == current_class_ptr)
6033 error ("cannot take the address of %<this%>, which is an rvalue expression");
6034 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
6040 /* Caller should not be trying to mark initialized
6041 constant fields addressable. */
6042 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
6043 || DECL_IN_AGGR_P (x) == 0
6045 || DECL_EXTERNAL (x));
6049 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
6050 && !DECL_ARTIFICIAL (x))
6052 if (VAR_P (x) && DECL_HARD_REGISTER (x))
6055 ("address of explicit register variable %qD requested", x);
6058 else if (extra_warnings)
6060 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
6062 TREE_ADDRESSABLE (x) = 1;
6067 TREE_ADDRESSABLE (x) = 1;
6071 TREE_ADDRESSABLE (x) = 1;
6075 TREE_ADDRESSABLE (x) = 1;
6076 cxx_mark_addressable (TREE_OPERAND (x, 0));
6084 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
6087 build_x_conditional_expr (location_t loc, tree ifexp, tree op1, tree op2,
6088 tsubst_flags_t complain)
6090 tree orig_ifexp = ifexp;
6091 tree orig_op1 = op1;
6092 tree orig_op2 = op2;
6095 if (processing_template_decl)
6097 /* The standard says that the expression is type-dependent if
6098 IFEXP is type-dependent, even though the eventual type of the
6099 expression doesn't dependent on IFEXP. */
6100 if (type_dependent_expression_p (ifexp)
6101 /* As a GNU extension, the middle operand may be omitted. */
6102 || (op1 && type_dependent_expression_p (op1))
6103 || type_dependent_expression_p (op2))
6104 return build_min_nt_loc (loc, COND_EXPR, ifexp, op1, op2);
6105 ifexp = build_non_dependent_expr (ifexp);
6107 op1 = build_non_dependent_expr (op1);
6108 op2 = build_non_dependent_expr (op2);
6111 expr = build_conditional_expr (loc, ifexp, op1, op2, complain);
6112 if (processing_template_decl && expr != error_mark_node
6113 && TREE_CODE (expr) != VEC_COND_EXPR)
6115 tree min = build_min_non_dep (COND_EXPR, expr,
6116 orig_ifexp, orig_op1, orig_op2);
6117 /* In C++11, remember that the result is an lvalue or xvalue.
6118 In C++98, lvalue_kind can just assume lvalue in a template. */
6119 if (cxx_dialect >= cxx11
6120 && lvalue_or_rvalue_with_address_p (expr)
6121 && !lvalue_or_rvalue_with_address_p (min))
6122 TREE_TYPE (min) = cp_build_reference_type (TREE_TYPE (min),
6123 !real_lvalue_p (expr));
6124 expr = convert_from_reference (min);
6129 /* Given a list of expressions, return a compound expression
6130 that performs them all and returns the value of the last of them. */
6133 build_x_compound_expr_from_list (tree list, expr_list_kind exp,
6134 tsubst_flags_t complain)
6136 tree expr = TREE_VALUE (list);
6138 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
6139 && !CONSTRUCTOR_IS_DIRECT_INIT (expr))
6141 if (complain & tf_error)
6142 pedwarn (EXPR_LOC_OR_LOC (expr, input_location), 0,
6143 "list-initializer for non-class type must not "
6144 "be parenthesized");
6146 return error_mark_node;
6149 if (TREE_CHAIN (list))
6151 if (complain & tf_error)
6155 permerror (input_location, "expression list treated as compound "
6156 "expression in initializer");
6159 permerror (input_location, "expression list treated as compound "
6160 "expression in mem-initializer");
6163 permerror (input_location, "expression list treated as compound "
6164 "expression in functional cast");
6170 return error_mark_node;
6172 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
6173 expr = build_x_compound_expr (EXPR_LOCATION (TREE_VALUE (list)),
6174 expr, TREE_VALUE (list), complain);
6180 /* Like build_x_compound_expr_from_list, but using a VEC. */
6183 build_x_compound_expr_from_vec (vec<tree, va_gc> *vec, const char *msg,
6184 tsubst_flags_t complain)
6186 if (vec_safe_is_empty (vec))
6188 else if (vec->length () == 1)
6198 if (complain & tf_error)
6199 permerror (input_location,
6200 "%s expression list treated as compound expression",
6203 return error_mark_node;
6207 for (ix = 1; vec->iterate (ix, &t); ++ix)
6208 expr = build_x_compound_expr (EXPR_LOCATION (t), expr,
6215 /* Handle overloading of the ',' operator when needed. */
6218 build_x_compound_expr (location_t loc, tree op1, tree op2,
6219 tsubst_flags_t complain)
6222 tree orig_op1 = op1;
6223 tree orig_op2 = op2;
6225 if (processing_template_decl)
6227 if (type_dependent_expression_p (op1)
6228 || type_dependent_expression_p (op2))
6229 return build_min_nt_loc (loc, COMPOUND_EXPR, op1, op2);
6230 op1 = build_non_dependent_expr (op1);
6231 op2 = build_non_dependent_expr (op2);
6234 result = build_new_op (loc, COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2,
6235 NULL_TREE, /*overload=*/NULL, complain);
6237 result = cp_build_compound_expr (op1, op2, complain);
6239 if (processing_template_decl && result != error_mark_node)
6240 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
6245 /* Like cp_build_compound_expr, but for the c-common bits. */
6248 build_compound_expr (location_t /*loc*/, tree lhs, tree rhs)
6250 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
6253 /* Build a compound expression. */
6256 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
6258 lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
6260 if (lhs == error_mark_node || rhs == error_mark_node)
6261 return error_mark_node;
6264 && (TREE_CODE (lhs) == CILK_SPAWN_STMT
6265 || TREE_CODE (rhs) == CILK_SPAWN_STMT))
6267 location_t loc = (EXPR_HAS_LOCATION (lhs) ? EXPR_LOCATION (lhs)
6268 : EXPR_LOCATION (rhs));
6270 "spawned function call cannot be part of a comma expression");
6271 return error_mark_node;
6274 if (TREE_CODE (rhs) == TARGET_EXPR)
6276 /* If the rhs is a TARGET_EXPR, then build the compound
6277 expression inside the target_expr's initializer. This
6278 helps the compiler to eliminate unnecessary temporaries. */
6279 tree init = TREE_OPERAND (rhs, 1);
6281 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
6282 TREE_OPERAND (rhs, 1) = init;
6287 if (type_unknown_p (rhs))
6289 if (complain & tf_error)
6290 error ("no context to resolve type of %qE", rhs);
6291 return error_mark_node;
6294 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
6297 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
6298 casts away constness. CAST gives the type of cast. Returns true
6299 if the cast is ill-formed, false if it is well-formed.
6301 ??? This function warns for casting away any qualifier not just
6302 const. We would like to specify exactly what qualifiers are casted
6307 check_for_casting_away_constness (tree src_type, tree dest_type,
6308 enum tree_code cast, tsubst_flags_t complain)
6310 /* C-style casts are allowed to cast away constness. With
6311 WARN_CAST_QUAL, we still want to issue a warning. */
6312 if (cast == CAST_EXPR && !warn_cast_qual)
6315 if (!casts_away_constness (src_type, dest_type, complain))
6321 if (complain & tf_warning)
6322 warning (OPT_Wcast_qual,
6323 "cast from type %qT to type %qT casts away qualifiers",
6324 src_type, dest_type);
6327 case STATIC_CAST_EXPR:
6328 if (complain & tf_error)
6329 error ("static_cast from type %qT to type %qT casts away qualifiers",
6330 src_type, dest_type);
6333 case REINTERPRET_CAST_EXPR:
6334 if (complain & tf_error)
6335 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
6336 src_type, dest_type);
6345 Warns if the cast from expression EXPR to type TYPE is useless.
6348 maybe_warn_about_useless_cast (tree type, tree expr, tsubst_flags_t complain)
6350 if (warn_useless_cast
6351 && complain & tf_warning)
6353 if ((TREE_CODE (type) == REFERENCE_TYPE
6354 && (TYPE_REF_IS_RVALUE (type)
6355 ? xvalue_p (expr) : real_lvalue_p (expr))
6356 && same_type_p (TREE_TYPE (expr), TREE_TYPE (type)))
6357 || same_type_p (TREE_TYPE (expr), type))
6358 warning (OPT_Wuseless_cast, "useless cast to type %qT", type);
6362 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
6363 (another pointer-to-member type in the same hierarchy) and return
6364 the converted expression. If ALLOW_INVERSE_P is permitted, a
6365 pointer-to-derived may be converted to pointer-to-base; otherwise,
6366 only the other direction is permitted. If C_CAST_P is true, this
6367 conversion is taking place as part of a C-style cast. */
6370 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
6371 bool c_cast_p, tsubst_flags_t complain)
6373 if (TYPE_PTRDATAMEM_P (type))
6377 if (TREE_CODE (expr) == PTRMEM_CST)
6378 expr = cplus_expand_constant (expr);
6379 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
6380 TYPE_PTRMEM_CLASS_TYPE (type),
6382 c_cast_p, complain);
6383 if (delta == error_mark_node)
6384 return error_mark_node;
6386 if (!integer_zerop (delta))
6388 tree cond, op1, op2;
6390 cond = cp_build_binary_op (input_location,
6393 build_int_cst (TREE_TYPE (expr), -1),
6395 op1 = build_nop (ptrdiff_type_node, expr);
6396 op2 = cp_build_binary_op (input_location,
6397 PLUS_EXPR, op1, delta,
6400 expr = fold_build3_loc (input_location,
6401 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
6405 return build_nop (type, expr);
6408 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
6409 allow_inverse_p, c_cast_p, complain);
6412 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
6413 this static_cast is being attempted as one of the possible casts
6414 allowed by a C-style cast. (In that case, accessibility of base
6415 classes is not considered, and it is OK to cast away
6416 constness.) Return the result of the cast. *VALID_P is set to
6417 indicate whether or not the cast was valid. */
6420 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
6421 bool *valid_p, tsubst_flags_t complain)
6427 /* Assume the cast is valid. */
6430 intype = unlowered_expr_type (expr);
6432 /* Save casted types in the function's used types hash table. */
6433 used_types_insert (type);
6435 /* [expr.static.cast]
6437 An lvalue of type "cv1 B", where B is a class type, can be cast
6438 to type "reference to cv2 D", where D is a class derived (clause
6439 _class.derived_) from B, if a valid standard conversion from
6440 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
6441 same cv-qualification as, or greater cv-qualification than, cv1,
6442 and B is not a virtual base class of D. */
6443 /* We check this case before checking the validity of "TYPE t =
6444 EXPR;" below because for this case:
6447 struct D : public B { D(const B&); };
6449 void f() { static_cast<const D&>(b); }
6451 we want to avoid constructing a new D. The standard is not
6452 completely clear about this issue, but our interpretation is
6453 consistent with other compilers. */
6454 if (TREE_CODE (type) == REFERENCE_TYPE
6455 && CLASS_TYPE_P (TREE_TYPE (type))
6456 && CLASS_TYPE_P (intype)
6457 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
6458 && DERIVED_FROM_P (intype, TREE_TYPE (type))
6459 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
6460 build_pointer_type (TYPE_MAIN_VARIANT
6461 (TREE_TYPE (type))),
6464 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
6468 /* There is a standard conversion from "D*" to "B*" even if "B"
6469 is ambiguous or inaccessible. If this is really a
6470 static_cast, then we check both for inaccessibility and
6471 ambiguity. However, if this is a static_cast being performed
6472 because the user wrote a C-style cast, then accessibility is
6474 base = lookup_base (TREE_TYPE (type), intype,
6475 c_cast_p ? ba_unique : ba_check,
6477 expr = build_address (expr);
6479 if (flag_sanitize & SANITIZE_VPTR)
6482 = cp_ubsan_maybe_instrument_downcast (input_location, type, expr);
6487 /* Convert from "B*" to "D*". This function will check that "B"
6488 is not a virtual base of "D". */
6489 expr = build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false,
6492 /* Convert the pointer to a reference -- but then remember that
6493 there are no expressions with reference type in C++.
6495 We call rvalue so that there's an actual tree code
6496 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
6497 is a variable with the same type, the conversion would get folded
6498 away, leaving just the variable and causing lvalue_kind to give
6499 the wrong answer. */
6500 return convert_from_reference (rvalue (cp_fold_convert (type, expr)));
6503 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
6504 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
6505 if (TREE_CODE (type) == REFERENCE_TYPE
6506 && TYPE_REF_IS_RVALUE (type)
6507 && (clk = real_lvalue_p (expr))
6508 && reference_related_p (TREE_TYPE (type), intype)
6509 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
6511 if (clk == clk_ordinary)
6513 /* Handle the (non-bit-field) lvalue case here by casting to
6514 lvalue reference and then changing it to an rvalue reference.
6515 Casting an xvalue to rvalue reference will be handled by the
6517 tree lref = cp_build_reference_type (TREE_TYPE (type), false);
6518 result = (perform_direct_initialization_if_possible
6519 (lref, expr, c_cast_p, complain));
6520 result = cp_fold_convert (type, result);
6521 /* Make sure we don't fold back down to a named rvalue reference,
6522 because that would be an lvalue. */
6523 if (DECL_P (result))
6524 result = build1 (NON_LVALUE_EXPR, type, result);
6525 return convert_from_reference (result);
6528 /* For a bit-field or packed field, bind to a temporary. */
6529 expr = rvalue (expr);
6532 /* Resolve overloaded address here rather than once in
6533 implicit_conversion and again in the inverse code below. */
6534 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
6536 expr = instantiate_type (type, expr, complain);
6537 intype = TREE_TYPE (expr);
6540 /* [expr.static.cast]
6542 Any expression can be explicitly converted to type cv void. */
6543 if (VOID_TYPE_P (type))
6544 return convert_to_void (expr, ICV_CAST, complain);
6547 An abstract class shall not be used ... as the type of an explicit
6549 if (abstract_virtuals_error_sfinae (ACU_CAST, type, complain))
6550 return error_mark_node;
6552 /* [expr.static.cast]
6554 An expression e can be explicitly converted to a type T using a
6555 static_cast of the form static_cast<T>(e) if the declaration T
6556 t(e);" is well-formed, for some invented temporary variable
6558 result = perform_direct_initialization_if_possible (type, expr,
6559 c_cast_p, complain);
6562 result = convert_from_reference (result);
6564 /* [expr.static.cast]
6566 If T is a reference type, the result is an lvalue; otherwise,
6567 the result is an rvalue. */
6568 if (TREE_CODE (type) != REFERENCE_TYPE)
6569 result = rvalue (result);
6573 /* [expr.static.cast]
6575 The inverse of any standard conversion sequence (clause _conv_),
6576 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
6577 (_conv.array_), function-to-pointer (_conv.func_), and boolean
6578 (_conv.bool_) conversions, can be performed explicitly using
6579 static_cast subject to the restriction that the explicit
6580 conversion does not cast away constness (_expr.const.cast_), and
6581 the following additional rules for specific cases: */
6582 /* For reference, the conversions not excluded are: integral
6583 promotions, floating point promotion, integral conversions,
6584 floating point conversions, floating-integral conversions,
6585 pointer conversions, and pointer to member conversions. */
6588 A value of integral _or enumeration_ type can be explicitly
6589 converted to an enumeration type. */
6590 /* The effect of all that is that any conversion between any two
6591 types which are integral, floating, or enumeration types can be
6593 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
6594 || SCALAR_FLOAT_TYPE_P (type))
6595 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
6596 || SCALAR_FLOAT_TYPE_P (intype)))
6597 return ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL, complain);
6599 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
6600 && CLASS_TYPE_P (TREE_TYPE (type))
6601 && CLASS_TYPE_P (TREE_TYPE (intype))
6602 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
6603 (TREE_TYPE (intype))),
6604 build_pointer_type (TYPE_MAIN_VARIANT
6605 (TREE_TYPE (type))),
6611 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
6613 return error_mark_node;
6614 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
6615 c_cast_p ? ba_unique : ba_check,
6617 expr = build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false,
6620 if (flag_sanitize & SANITIZE_VPTR)
6623 = cp_ubsan_maybe_instrument_downcast (input_location, type, expr);
6628 return cp_fold_convert (type, expr);
6631 if ((TYPE_PTRDATAMEM_P (type) && TYPE_PTRDATAMEM_P (intype))
6632 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6639 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
6640 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
6642 if (TYPE_PTRDATAMEM_P (type))
6644 t1 = (build_ptrmem_type
6646 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
6647 t2 = (build_ptrmem_type
6649 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
6656 if (can_convert (t1, t2, complain) || can_convert (t2, t1, complain))
6659 && check_for_casting_away_constness (intype, type,
6662 return error_mark_node;
6663 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
6664 c_cast_p, complain);
6668 /* [expr.static.cast]
6670 An rvalue of type "pointer to cv void" can be explicitly
6671 converted to a pointer to object type. A value of type pointer
6672 to object converted to "pointer to cv void" and back to the
6673 original pointer type will have its original value. */
6674 if (TYPE_PTR_P (intype)
6675 && VOID_TYPE_P (TREE_TYPE (intype))
6676 && TYPE_PTROB_P (type))
6679 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
6681 return error_mark_node;
6682 return build_nop (type, expr);
6686 return error_mark_node;
6689 /* Return an expression representing static_cast<TYPE>(EXPR). */
6692 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
6697 if (type == error_mark_node || expr == error_mark_node)
6698 return error_mark_node;
6700 if (processing_template_decl)
6702 expr = build_min (STATIC_CAST_EXPR, type, expr);
6703 /* We don't know if it will or will not have side effects. */
6704 TREE_SIDE_EFFECTS (expr) = 1;
6705 return convert_from_reference (expr);
6708 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6709 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6710 if (TREE_CODE (type) != REFERENCE_TYPE
6711 && TREE_CODE (expr) == NOP_EXPR
6712 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6713 expr = TREE_OPERAND (expr, 0);
6715 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
6719 if (result != error_mark_node)
6720 maybe_warn_about_useless_cast (type, expr, complain);
6724 if (complain & tf_error)
6725 error ("invalid static_cast from type %qT to type %qT",
6726 TREE_TYPE (expr), type);
6727 return error_mark_node;
6730 /* EXPR is an expression with member function or pointer-to-member
6731 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6732 not permitted by ISO C++, but we accept it in some modes. If we
6733 are not in one of those modes, issue a diagnostic. Return the
6734 converted expression. */
6737 convert_member_func_to_ptr (tree type, tree expr, tsubst_flags_t complain)
6742 intype = TREE_TYPE (expr);
6743 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
6744 || TREE_CODE (intype) == METHOD_TYPE);
6746 if (!(complain & tf_warning_or_error))
6747 return error_mark_node;
6749 if (pedantic || warn_pmf2ptr)
6750 pedwarn (input_location, pedantic ? OPT_Wpedantic : OPT_Wpmf_conversions,
6751 "converting from %qT to %qT", intype, type);
6753 if (TREE_CODE (intype) == METHOD_TYPE)
6754 expr = build_addr_func (expr, complain);
6755 else if (TREE_CODE (expr) == PTRMEM_CST)
6756 expr = build_address (PTRMEM_CST_MEMBER (expr));
6759 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
6760 decl = build_address (decl);
6761 expr = get_member_function_from_ptrfunc (&decl, expr, complain);
6764 if (expr == error_mark_node)
6765 return error_mark_node;
6767 return build_nop (type, expr);
6770 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6771 If C_CAST_P is true, this reinterpret cast is being done as part of
6772 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6773 indicate whether or not reinterpret_cast was valid. */
6776 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
6777 bool *valid_p, tsubst_flags_t complain)
6781 /* Assume the cast is invalid. */
6785 if (type == error_mark_node || error_operand_p (expr))
6786 return error_mark_node;
6788 intype = TREE_TYPE (expr);
6790 /* Save casted types in the function's used types hash table. */
6791 used_types_insert (type);
6793 /* [expr.reinterpret.cast]
6794 An lvalue expression of type T1 can be cast to the type
6795 "reference to T2" if an expression of type "pointer to T1" can be
6796 explicitly converted to the type "pointer to T2" using a
6797 reinterpret_cast. */
6798 if (TREE_CODE (type) == REFERENCE_TYPE)
6800 if (! real_lvalue_p (expr))
6802 if (complain & tf_error)
6803 error ("invalid cast of an rvalue expression of type "
6806 return error_mark_node;
6809 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6810 "B" are related class types; the reinterpret_cast does not
6811 adjust the pointer. */
6812 if (TYPE_PTR_P (intype)
6813 && (complain & tf_warning)
6814 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6815 COMPARE_BASE | COMPARE_DERIVED)))
6816 warning (0, "casting %qT to %qT does not dereference pointer",
6819 expr = cp_build_addr_expr (expr, complain);
6821 if (warn_strict_aliasing > 2)
6822 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6824 if (expr != error_mark_node)
6825 expr = build_reinterpret_cast_1
6826 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6828 if (expr != error_mark_node)
6829 /* cp_build_indirect_ref isn't right for rvalue refs. */
6830 expr = convert_from_reference (fold_convert (type, expr));
6834 /* As a G++ extension, we consider conversions from member
6835 functions, and pointers to member functions to
6836 pointer-to-function and pointer-to-void types. If
6837 -Wno-pmf-conversions has not been specified,
6838 convert_member_func_to_ptr will issue an error message. */
6839 if ((TYPE_PTRMEMFUNC_P (intype)
6840 || TREE_CODE (intype) == METHOD_TYPE)
6841 && TYPE_PTR_P (type)
6842 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6843 || VOID_TYPE_P (TREE_TYPE (type))))
6844 return convert_member_func_to_ptr (type, expr, complain);
6846 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6847 array-to-pointer, and function-to-pointer conversions are
6849 expr = decay_conversion (expr, complain);
6851 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6852 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6853 if (TREE_CODE (expr) == NOP_EXPR
6854 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6855 expr = TREE_OPERAND (expr, 0);
6857 if (error_operand_p (expr))
6858 return error_mark_node;
6860 intype = TREE_TYPE (expr);
6862 /* [expr.reinterpret.cast]
6863 A pointer can be converted to any integral type large enough to
6864 hold it. ... A value of type std::nullptr_t can be converted to
6865 an integral type; the conversion has the same meaning and
6866 validity as a conversion of (void*)0 to the integral type. */
6867 if (CP_INTEGRAL_TYPE_P (type)
6868 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6870 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6872 if (complain & tf_error)
6873 permerror (input_location, "cast from %qT to %qT loses precision",
6876 return error_mark_node;
6878 if (NULLPTR_TYPE_P (intype))
6879 return build_int_cst (type, 0);
6881 /* [expr.reinterpret.cast]
6882 A value of integral or enumeration type can be explicitly
6883 converted to a pointer. */
6884 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6887 else if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
6888 || TYPE_PTR_OR_PTRMEM_P (type))
6889 && same_type_p (type, intype))
6891 return rvalue (expr);
6892 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6893 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6894 return fold_if_not_in_template (build_nop (type, expr));
6895 else if ((TYPE_PTRDATAMEM_P (type) && TYPE_PTRDATAMEM_P (intype))
6896 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6901 && check_for_casting_away_constness (intype, type,
6902 REINTERPRET_CAST_EXPR,
6904 return error_mark_node;
6905 /* Warn about possible alignment problems. */
6906 if (STRICT_ALIGNMENT && warn_cast_align
6907 && (complain & tf_warning)
6908 && !VOID_TYPE_P (type)
6909 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6910 && COMPLETE_TYPE_P (TREE_TYPE (type))
6911 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6912 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6913 warning (OPT_Wcast_align, "cast from %qT to %qT "
6914 "increases required alignment of target type", intype, type);
6916 /* We need to strip nops here, because the front end likes to
6917 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6919 if (warn_strict_aliasing <= 2)
6920 strict_aliasing_warning (intype, type, sexpr);
6922 return fold_if_not_in_template (build_nop (type, expr));
6924 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6925 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6927 if (complain & tf_warning)
6928 /* C++11 5.2.10 p8 says that "Converting a function pointer to an
6929 object pointer type or vice versa is conditionally-supported." */
6930 warning (OPT_Wconditionally_supported,
6931 "casting between pointer-to-function and pointer-to-object "
6932 "is conditionally-supported");
6933 return fold_if_not_in_template (build_nop (type, expr));
6935 else if (TREE_CODE (type) == VECTOR_TYPE)
6936 return fold_if_not_in_template (convert_to_vector (type, expr));
6937 else if (TREE_CODE (intype) == VECTOR_TYPE
6938 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6939 return fold_if_not_in_template (convert_to_integer (type, expr));
6944 if (complain & tf_error)
6945 error ("invalid cast from type %qT to type %qT", intype, type);
6946 return error_mark_node;
6949 return cp_convert (type, expr, complain);
6953 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6957 if (type == error_mark_node || expr == error_mark_node)
6958 return error_mark_node;
6960 if (processing_template_decl)
6962 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6964 if (!TREE_SIDE_EFFECTS (t)
6965 && type_dependent_expression_p (expr))
6966 /* There might turn out to be side effects inside expr. */
6967 TREE_SIDE_EFFECTS (t) = 1;
6968 return convert_from_reference (t);
6971 r = build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6972 /*valid_p=*/NULL, complain);
6973 if (r != error_mark_node)
6974 maybe_warn_about_useless_cast (type, expr, complain);
6978 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6979 return an appropriate expression. Otherwise, return
6980 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6981 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6982 performing a C-style cast, its value upon return will indicate
6983 whether or not the conversion succeeded. */
6986 build_const_cast_1 (tree dst_type, tree expr, tsubst_flags_t complain,
6990 tree reference_type;
6992 /* Callers are responsible for handling error_mark_node as a
6993 destination type. */
6994 gcc_assert (dst_type != error_mark_node);
6995 /* In a template, callers should be building syntactic
6996 representations of casts, not using this machinery. */
6997 gcc_assert (!processing_template_decl);
6999 /* Assume the conversion is invalid. */
7003 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRDATAMEM_P (dst_type))
7005 if (complain & tf_error)
7006 error ("invalid use of const_cast with type %qT, "
7007 "which is not a pointer, "
7008 "reference, nor a pointer-to-data-member type", dst_type);
7009 return error_mark_node;
7012 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
7014 if (complain & tf_error)
7015 error ("invalid use of const_cast with type %qT, which is a pointer "
7016 "or reference to a function type", dst_type);
7017 return error_mark_node;
7020 /* Save casted types in the function's used types hash table. */
7021 used_types_insert (dst_type);
7023 src_type = TREE_TYPE (expr);
7024 /* Expressions do not really have reference types. */
7025 if (TREE_CODE (src_type) == REFERENCE_TYPE)
7026 src_type = TREE_TYPE (src_type);
7028 /* [expr.const.cast]
7030 For two object types T1 and T2, if a pointer to T1 can be explicitly
7031 converted to the type "pointer to T2" using a const_cast, then the
7032 following conversions can also be made:
7034 -- an lvalue of type T1 can be explicitly converted to an lvalue of
7035 type T2 using the cast const_cast<T2&>;
7037 -- a glvalue of type T1 can be explicitly converted to an xvalue of
7038 type T2 using the cast const_cast<T2&&>; and
7040 -- if T1 is a class type, a prvalue of type T1 can be explicitly
7041 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
7043 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
7045 reference_type = dst_type;
7046 if (!TYPE_REF_IS_RVALUE (dst_type)
7047 ? real_lvalue_p (expr)
7048 : (CLASS_TYPE_P (TREE_TYPE (dst_type))
7050 : lvalue_or_rvalue_with_address_p (expr)))
7054 if (complain & tf_error)
7055 error ("invalid const_cast of an rvalue of type %qT to type %qT",
7056 src_type, dst_type);
7057 return error_mark_node;
7059 dst_type = build_pointer_type (TREE_TYPE (dst_type));
7060 src_type = build_pointer_type (src_type);
7064 reference_type = NULL_TREE;
7065 /* If the destination type is not a reference type, the
7066 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7067 conversions are performed. */
7068 src_type = type_decays_to (src_type);
7069 if (src_type == error_mark_node)
7070 return error_mark_node;
7073 if (TYPE_PTR_P (src_type) || TYPE_PTRDATAMEM_P (src_type))
7075 if (comp_ptr_ttypes_const (dst_type, src_type))
7080 /* This cast is actually a C-style cast. Issue a warning if
7081 the user is making a potentially unsafe cast. */
7082 check_for_casting_away_constness (src_type, dst_type,
7083 CAST_EXPR, complain);
7087 expr = cp_build_addr_expr (expr, complain);
7088 if (expr == error_mark_node)
7089 return error_mark_node;
7090 expr = build_nop (reference_type, expr);
7091 return convert_from_reference (expr);
7095 expr = decay_conversion (expr, complain);
7096 if (expr == error_mark_node)
7097 return error_mark_node;
7099 /* build_c_cast puts on a NOP_EXPR to make the result not an
7100 lvalue. Strip such NOP_EXPRs if VALUE is being used in
7101 non-lvalue context. */
7102 if (TREE_CODE (expr) == NOP_EXPR
7103 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
7104 expr = TREE_OPERAND (expr, 0);
7105 return build_nop (dst_type, expr);
7109 && !at_least_as_qualified_p (TREE_TYPE (dst_type),
7110 TREE_TYPE (src_type)))
7111 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR,
7115 if (complain & tf_error)
7116 error ("invalid const_cast from type %qT to type %qT",
7117 src_type, dst_type);
7118 return error_mark_node;
7122 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
7126 if (type == error_mark_node || error_operand_p (expr))
7127 return error_mark_node;
7129 if (processing_template_decl)
7131 tree t = build_min (CONST_CAST_EXPR, type, expr);
7133 if (!TREE_SIDE_EFFECTS (t)
7134 && type_dependent_expression_p (expr))
7135 /* There might turn out to be side effects inside expr. */
7136 TREE_SIDE_EFFECTS (t) = 1;
7137 return convert_from_reference (t);
7140 r = build_const_cast_1 (type, expr, complain, /*valid_p=*/NULL);
7141 if (r != error_mark_node)
7142 maybe_warn_about_useless_cast (type, expr, complain);
7146 /* Like cp_build_c_cast, but for the c-common bits. */
7149 build_c_cast (location_t /*loc*/, tree type, tree expr)
7151 return cp_build_c_cast (type, expr, tf_warning_or_error);
7154 /* Build an expression representing an explicit C-style cast to type
7155 TYPE of expression EXPR. */
7158 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
7164 if (type == error_mark_node || error_operand_p (expr))
7165 return error_mark_node;
7167 if (processing_template_decl)
7169 tree t = build_min (CAST_EXPR, type,
7170 tree_cons (NULL_TREE, value, NULL_TREE));
7171 /* We don't know if it will or will not have side effects. */
7172 TREE_SIDE_EFFECTS (t) = 1;
7173 return convert_from_reference (t);
7176 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
7177 'Class') should always be retained, because this information aids
7178 in method lookup. */
7179 if (objc_is_object_ptr (type)
7180 && objc_is_object_ptr (TREE_TYPE (expr)))
7181 return build_nop (type, expr);
7183 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7184 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
7185 if (TREE_CODE (type) != REFERENCE_TYPE
7186 && TREE_CODE (value) == NOP_EXPR
7187 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
7188 value = TREE_OPERAND (value, 0);
7190 if (TREE_CODE (type) == ARRAY_TYPE)
7192 /* Allow casting from T1* to T2[] because Cfront allows it.
7193 NIHCL uses it. It is not valid ISO C++ however. */
7194 if (TYPE_PTR_P (TREE_TYPE (expr)))
7196 if (complain & tf_error)
7197 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
7199 return error_mark_node;
7200 type = build_pointer_type (TREE_TYPE (type));
7204 if (complain & tf_error)
7205 error ("ISO C++ forbids casting to an array type %qT", type);
7206 return error_mark_node;
7210 if (TREE_CODE (type) == FUNCTION_TYPE
7211 || TREE_CODE (type) == METHOD_TYPE)
7213 if (complain & tf_error)
7214 error ("invalid cast to function type %qT", type);
7215 return error_mark_node;
7218 if (TYPE_PTR_P (type)
7219 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
7220 /* Casting to an integer of smaller size is an error detected elsewhere. */
7221 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
7222 /* Don't warn about converting any constant. */
7223 && !TREE_CONSTANT (value))
7224 warning_at (input_location, OPT_Wint_to_pointer_cast,
7225 "cast to pointer from integer of different size");
7227 /* A C-style cast can be a const_cast. */
7228 result = build_const_cast_1 (type, value, complain & tf_warning,
7232 if (result != error_mark_node)
7233 maybe_warn_about_useless_cast (type, value, complain);
7237 /* Or a static cast. */
7238 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
7239 &valid_p, complain);
7240 /* Or a reinterpret_cast. */
7242 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
7243 &valid_p, complain);
7244 /* The static_cast or reinterpret_cast may be followed by a
7247 /* A valid cast may result in errors if, for example, a
7248 conversion to an ambiguous base class is required. */
7249 && !error_operand_p (result))
7253 maybe_warn_about_useless_cast (type, value, complain);
7255 /* Non-class rvalues always have cv-unqualified type. */
7256 if (!CLASS_TYPE_P (type))
7257 type = TYPE_MAIN_VARIANT (type);
7258 result_type = TREE_TYPE (result);
7259 if (!CLASS_TYPE_P (result_type) && TREE_CODE (type) != REFERENCE_TYPE)
7260 result_type = TYPE_MAIN_VARIANT (result_type);
7261 /* If the type of RESULT does not match TYPE, perform a
7262 const_cast to make it match. If the static_cast or
7263 reinterpret_cast succeeded, we will differ by at most
7264 cv-qualification, so the follow-on const_cast is guaranteed
7266 if (!same_type_p (non_reference (type), non_reference (result_type)))
7268 result = build_const_cast_1 (type, result, false, &valid_p);
7269 gcc_assert (valid_p);
7274 return error_mark_node;
7277 /* For use from the C common bits. */
7279 build_modify_expr (location_t /*location*/,
7280 tree lhs, tree /*lhs_origtype*/,
7281 enum tree_code modifycode,
7282 location_t /*rhs_location*/, tree rhs,
7283 tree /*rhs_origtype*/)
7285 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
7288 /* Build an assignment expression of lvalue LHS from value RHS.
7289 MODIFYCODE is the code for a binary operator that we use
7290 to combine the old value of LHS with RHS to get the new value.
7291 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
7293 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
7296 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
7297 tsubst_flags_t complain)
7301 tree lhstype = TREE_TYPE (lhs);
7302 tree olhstype = lhstype;
7303 bool plain_assign = (modifycode == NOP_EXPR);
7305 /* Avoid duplicate error messages from operands that had errors. */
7306 if (error_operand_p (lhs) || error_operand_p (rhs))
7307 return error_mark_node;
7309 /* Handle control structure constructs used as "lvalues". */
7310 switch (TREE_CODE (lhs))
7312 /* Handle --foo = 5; as these are valid constructs in C++. */
7313 case PREDECREMENT_EXPR:
7314 case PREINCREMENT_EXPR:
7315 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
7316 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
7317 stabilize_reference (TREE_OPERAND (lhs, 0)),
7318 TREE_OPERAND (lhs, 1));
7319 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
7320 modifycode, rhs, complain);
7321 if (newrhs == error_mark_node)
7322 return error_mark_node;
7323 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
7325 /* Handle (a, b) used as an "lvalue". */
7327 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
7328 modifycode, rhs, complain);
7329 if (newrhs == error_mark_node)
7330 return error_mark_node;
7331 return build2 (COMPOUND_EXPR, lhstype,
7332 TREE_OPERAND (lhs, 0), newrhs);
7335 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
7336 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
7337 stabilize_reference (TREE_OPERAND (lhs, 0)),
7338 TREE_OPERAND (lhs, 1));
7339 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
7341 if (newrhs == error_mark_node)
7342 return error_mark_node;
7343 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
7347 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
7348 when neither operand has side-effects. */
7349 if (!lvalue_or_else (lhs, lv_assign, complain))
7350 return error_mark_node;
7352 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
7353 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
7355 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
7356 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
7358 TREE_OPERAND (lhs, 0),
7359 TREE_OPERAND (lhs, 1)),
7360 TREE_OPERAND (lhs, 0),
7361 TREE_OPERAND (lhs, 1));
7364 /* Handle (a ? b : c) used as an "lvalue". */
7367 /* Produce (a ? (b = rhs) : (c = rhs))
7368 except that the RHS goes through a save-expr
7369 so the code to compute it is only emitted once. */
7371 tree preeval = NULL_TREE;
7373 if (VOID_TYPE_P (TREE_TYPE (rhs)))
7375 if (complain & tf_error)
7376 error ("void value not ignored as it ought to be");
7377 return error_mark_node;
7380 rhs = stabilize_expr (rhs, &preeval);
7382 /* Check this here to avoid odd errors when trying to convert
7383 a throw to the type of the COND_EXPR. */
7384 if (!lvalue_or_else (lhs, lv_assign, complain))
7385 return error_mark_node;
7387 cond = build_conditional_expr
7388 (input_location, TREE_OPERAND (lhs, 0),
7389 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
7390 modifycode, rhs, complain),
7391 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
7392 modifycode, rhs, complain),
7395 if (cond == error_mark_node)
7397 /* Make sure the code to compute the rhs comes out
7398 before the split. */
7400 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
7408 if (modifycode == INIT_EXPR)
7410 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
7411 /* Do the default thing. */;
7412 else if (TREE_CODE (rhs) == CONSTRUCTOR)
7414 /* Compound literal. */
7415 if (! same_type_p (TREE_TYPE (rhs), lhstype))
7416 /* Call convert to generate an error; see PR 11063. */
7417 rhs = convert (lhstype, rhs);
7418 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
7419 TREE_SIDE_EFFECTS (result) = 1;
7422 else if (! MAYBE_CLASS_TYPE_P (lhstype))
7423 /* Do the default thing. */;
7426 vec<tree, va_gc> *rhs_vec = make_tree_vector_single (rhs);
7427 result = build_special_member_call (lhs, complete_ctor_identifier,
7428 &rhs_vec, lhstype, LOOKUP_NORMAL,
7430 release_tree_vector (rhs_vec);
7431 if (result == NULL_TREE)
7432 return error_mark_node;
7438 lhs = require_complete_type_sfinae (lhs, complain);
7439 if (lhs == error_mark_node)
7440 return error_mark_node;
7442 if (modifycode == NOP_EXPR)
7444 if (c_dialect_objc ())
7446 result = objc_maybe_build_modify_expr (lhs, rhs);
7451 /* `operator=' is not an inheritable operator. */
7452 if (! MAYBE_CLASS_TYPE_P (lhstype))
7453 /* Do the default thing. */;
7456 result = build_new_op (input_location, MODIFY_EXPR,
7457 LOOKUP_NORMAL, lhs, rhs,
7458 make_node (NOP_EXPR), /*overload=*/NULL,
7460 if (result == NULL_TREE)
7461 return error_mark_node;
7468 tree init = NULL_TREE;
7470 /* A binary op has been requested. Combine the old LHS
7471 value with the RHS producing the value we should actually
7472 store into the LHS. */
7473 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
7474 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
7475 || MAYBE_CLASS_TYPE_P (lhstype)));
7477 /* Preevaluate the RHS to make sure its evaluation is complete
7478 before the lvalue-to-rvalue conversion of the LHS:
7480 [expr.ass] With respect to an indeterminately-sequenced
7481 function call, the operation of a compound assignment is a
7482 single evaluation. [ Note: Therefore, a function call shall
7483 not intervene between the lvalue-to-rvalue conversion and the
7484 side effect associated with any single compound assignment
7485 operator. -- end note ] */
7486 lhs = stabilize_reference (lhs);
7488 rhs = stabilize_expr (rhs, &init);
7489 newrhs = cp_build_binary_op (input_location,
7490 modifycode, lhs, rhs,
7492 if (newrhs == error_mark_node)
7494 if (complain & tf_error)
7495 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
7496 TREE_TYPE (lhs), TREE_TYPE (rhs));
7497 return error_mark_node;
7501 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), init, newrhs);
7503 /* Now it looks like a plain assignment. */
7504 modifycode = NOP_EXPR;
7505 if (c_dialect_objc ())
7507 result = objc_maybe_build_modify_expr (lhs, newrhs);
7512 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
7513 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
7516 /* The left-hand side must be an lvalue. */
7517 if (!lvalue_or_else (lhs, lv_assign, complain))
7518 return error_mark_node;
7520 /* Warn about modifying something that is `const'. Don't warn if
7521 this is initialization. */
7522 if (modifycode != INIT_EXPR
7523 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
7524 /* Functions are not modifiable, even though they are
7526 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
7527 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
7528 /* If it's an aggregate and any field is const, then it is
7529 effectively const. */
7530 || (CLASS_TYPE_P (lhstype)
7531 && C_TYPE_FIELDS_READONLY (lhstype))))
7533 if (complain & tf_error)
7534 cxx_readonly_error (lhs, lv_assign);
7536 return error_mark_node;
7539 /* If storing into a structure or union member, it may have been given a
7540 lowered bitfield type. We need to convert to the declared type first,
7541 so retrieve it now. */
7543 olhstype = unlowered_expr_type (lhs);
7545 /* Convert new value to destination type. */
7547 if (TREE_CODE (lhstype) == ARRAY_TYPE)
7551 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
7553 if (modifycode != INIT_EXPR)
7555 if (complain & tf_error)
7556 error ("assigning to an array from an initializer list");
7557 return error_mark_node;
7559 if (check_array_initializer (lhs, lhstype, newrhs))
7560 return error_mark_node;
7561 newrhs = digest_init (lhstype, newrhs, complain);
7562 if (newrhs == error_mark_node)
7563 return error_mark_node;
7566 /* C++11 8.5/17: "If the destination type is an array of characters,
7567 an array of char16_t, an array of char32_t, or an array of wchar_t,
7568 and the initializer is a string literal...". */
7569 else if (TREE_CODE (newrhs) == STRING_CST
7570 && char_type_p (TREE_TYPE (TYPE_MAIN_VARIANT (lhstype)))
7571 && modifycode == INIT_EXPR)
7573 newrhs = digest_init (lhstype, newrhs, complain);
7574 if (newrhs == error_mark_node)
7575 return error_mark_node;
7578 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
7579 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
7581 if (complain & tf_error)
7582 error ("incompatible types in assignment of %qT to %qT",
7583 TREE_TYPE (rhs), lhstype);
7584 return error_mark_node;
7587 /* Allow array assignment in compiler-generated code. */
7588 else if (!current_function_decl
7589 || !DECL_DEFAULTED_FN (current_function_decl))
7591 /* This routine is used for both initialization and assignment.
7592 Make sure the diagnostic message differentiates the context. */
7593 if (complain & tf_error)
7595 if (modifycode == INIT_EXPR)
7596 error ("array used as initializer");
7598 error ("invalid array assignment");
7600 return error_mark_node;
7603 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
7604 ? 1 + (modifycode != INIT_EXPR): 0;
7605 return build_vec_init (lhs, NULL_TREE, newrhs,
7606 /*explicit_value_init_p=*/false,
7607 from_array, complain);
7610 if (modifycode == INIT_EXPR)
7611 /* Calls with INIT_EXPR are all direct-initialization, so don't set
7612 LOOKUP_ONLYCONVERTING. */
7613 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
7614 ICR_INIT, NULL_TREE, 0,
7617 newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
7618 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
7620 if (!same_type_p (lhstype, olhstype))
7621 newrhs = cp_convert_and_check (lhstype, newrhs, complain);
7623 if (modifycode != INIT_EXPR)
7625 if (TREE_CODE (newrhs) == CALL_EXPR
7626 && TYPE_NEEDS_CONSTRUCTING (lhstype))
7627 newrhs = build_cplus_new (lhstype, newrhs, complain);
7629 /* Can't initialize directly from a TARGET_EXPR, since that would
7630 cause the lhs to be constructed twice, and possibly result in
7631 accidental self-initialization. So we force the TARGET_EXPR to be
7632 expanded without a target. */
7633 if (TREE_CODE (newrhs) == TARGET_EXPR)
7634 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
7635 TREE_OPERAND (newrhs, 0));
7638 if (newrhs == error_mark_node)
7639 return error_mark_node;
7641 if (c_dialect_objc () && flag_objc_gc)
7643 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
7649 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
7650 lhstype, lhs, newrhs);
7652 TREE_SIDE_EFFECTS (result) = 1;
7654 TREE_NO_WARNING (result) = 1;
7660 build_x_modify_expr (location_t loc, tree lhs, enum tree_code modifycode,
7661 tree rhs, tsubst_flags_t complain)
7663 if (processing_template_decl)
7664 return build_min_nt_loc (loc, MODOP_EXPR, lhs,
7665 build_min_nt_loc (loc, modifycode, NULL_TREE,
7668 if (modifycode != NOP_EXPR)
7670 tree rval = build_new_op (loc, MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
7671 make_node (modifycode), /*overload=*/NULL,
7675 TREE_NO_WARNING (rval) = 1;
7679 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
7682 /* Helper function for get_delta_difference which assumes FROM is a base
7683 class of TO. Returns a delta for the conversion of pointer-to-member
7684 of FROM to pointer-to-member of TO. If the conversion is invalid and
7685 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
7686 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
7687 If C_CAST_P is true, this conversion is taking place as part of a
7691 get_delta_difference_1 (tree from, tree to, bool c_cast_p,
7692 tsubst_flags_t complain)
7697 binfo = lookup_base (to, from, c_cast_p ? ba_unique : ba_check,
7700 if (binfo == error_mark_node)
7702 if (!(complain & tf_error))
7703 return error_mark_node;
7705 error (" in pointer to member function conversion");
7706 return size_zero_node;
7710 if (kind != bk_via_virtual)
7711 return BINFO_OFFSET (binfo);
7713 /* FROM is a virtual base class of TO. Issue an error or warning
7714 depending on whether or not this is a reinterpret cast. */
7716 if (!(complain & tf_error))
7717 return error_mark_node;
7719 error ("pointer to member conversion via virtual base %qT",
7720 BINFO_TYPE (binfo_from_vbase (binfo)));
7722 return size_zero_node;
7729 /* Get difference in deltas for different pointer to member function
7730 types. If the conversion is invalid and tf_error is not set in
7731 COMPLAIN, returns error_mark_node, otherwise returns an integer
7732 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7733 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7734 conversions as well. If C_CAST_P is true this conversion is taking
7735 place as part of a C-style cast.
7737 Note that the naming of FROM and TO is kind of backwards; the return
7738 value is what we add to a TO in order to get a FROM. They are named
7739 this way because we call this function to find out how to convert from
7740 a pointer to member of FROM to a pointer to member of TO. */
7743 get_delta_difference (tree from, tree to,
7744 bool allow_inverse_p,
7745 bool c_cast_p, tsubst_flags_t complain)
7749 if (same_type_ignoring_top_level_qualifiers_p (from, to))
7750 /* Pointer to member of incomplete class is permitted*/
7751 result = size_zero_node;
7753 result = get_delta_difference_1 (from, to, c_cast_p, complain);
7755 if (result == error_mark_node)
7756 return error_mark_node;
7760 if (!allow_inverse_p)
7762 if (!(complain & tf_error))
7763 return error_mark_node;
7765 error_not_base_type (from, to);
7766 error (" in pointer to member conversion");
7767 result = size_zero_node;
7771 result = get_delta_difference_1 (to, from, c_cast_p, complain);
7773 if (result == error_mark_node)
7774 return error_mark_node;
7777 result = size_diffop_loc (input_location,
7778 size_zero_node, result);
7781 if (!(complain & tf_error))
7782 return error_mark_node;
7784 error_not_base_type (from, to);
7785 error (" in pointer to member conversion");
7786 result = size_zero_node;
7791 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
7795 /* Return a constructor for the pointer-to-member-function TYPE using
7796 the other components as specified. */
7799 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
7804 vec<constructor_elt, va_gc> *v;
7806 /* Pull the FIELD_DECLs out of the type. */
7807 pfn_field = TYPE_FIELDS (type);
7808 delta_field = DECL_CHAIN (pfn_field);
7810 /* Make sure DELTA has the type we want. */
7811 delta = convert_and_check (input_location, delta_type_node, delta);
7813 /* Convert to the correct target type if necessary. */
7814 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
7816 /* Finish creating the initializer. */
7818 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
7819 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
7820 u = build_constructor (type, v);
7821 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
7822 TREE_STATIC (u) = (TREE_CONSTANT (u)
7823 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
7825 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
7830 /* Build a constructor for a pointer to member function. It can be
7831 used to initialize global variables, local variable, or used
7832 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7835 If FORCE is nonzero, then force this conversion, even if
7836 we would rather not do it. Usually set when using an explicit
7837 cast. A C-style cast is being processed iff C_CAST_P is true.
7839 Return error_mark_node, if something goes wrong. */
7842 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
7843 tsubst_flags_t complain)
7849 if (error_operand_p (pfn))
7850 return error_mark_node;
7852 pfn_type = TREE_TYPE (pfn);
7853 to_type = build_ptrmemfunc_type (type);
7855 /* Handle multiple conversions of pointer to member functions. */
7856 if (TYPE_PTRMEMFUNC_P (pfn_type))
7858 tree delta = NULL_TREE;
7859 tree npfn = NULL_TREE;
7863 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn,
7864 LOOKUP_NORMAL, complain))
7866 if (complain & tf_error)
7867 error ("invalid conversion to type %qT from type %qT",
7870 return error_mark_node;
7873 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
7874 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
7876 c_cast_p, complain);
7877 if (n == error_mark_node)
7878 return error_mark_node;
7880 /* We don't have to do any conversion to convert a
7881 pointer-to-member to its own type. But, we don't want to
7882 just return a PTRMEM_CST if there's an explicit cast; that
7883 cast should make the expression an invalid template argument. */
7884 if (TREE_CODE (pfn) != PTRMEM_CST)
7886 if (same_type_p (to_type, pfn_type))
7888 else if (integer_zerop (n))
7889 return build_reinterpret_cast (to_type, pfn,
7893 if (TREE_SIDE_EFFECTS (pfn))
7894 pfn = save_expr (pfn);
7896 /* Obtain the function pointer and the current DELTA. */
7897 if (TREE_CODE (pfn) == PTRMEM_CST)
7898 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
7901 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
7902 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
7905 /* Just adjust the DELTA field. */
7906 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7907 (TREE_TYPE (delta), ptrdiff_type_node));
7908 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
7909 n = cp_build_binary_op (input_location,
7910 LSHIFT_EXPR, n, integer_one_node,
7912 delta = cp_build_binary_op (input_location,
7913 PLUS_EXPR, delta, n, complain);
7914 return build_ptrmemfunc1 (to_type, delta, npfn);
7917 /* Handle null pointer to member function conversions. */
7918 if (null_ptr_cst_p (pfn))
7920 pfn = cp_build_c_cast (type, pfn, complain);
7921 return build_ptrmemfunc1 (to_type,
7926 if (type_unknown_p (pfn))
7927 return instantiate_type (type, pfn, complain);
7929 fn = TREE_OPERAND (pfn, 0);
7930 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7931 /* In a template, we will have preserved the
7933 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7934 return make_ptrmem_cst (to_type, fn);
7937 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7940 ??? There is no consistency as to the types returned for the above
7941 values. Some code acts as if it were a sizetype and some as if it were
7942 integer_type_node. */
7945 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7947 tree type = TREE_TYPE (cst);
7948 tree fn = PTRMEM_CST_MEMBER (cst);
7949 tree ptr_class, fn_class;
7951 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7953 /* The class that the function belongs to. */
7954 fn_class = DECL_CONTEXT (fn);
7956 /* The class that we're creating a pointer to member of. */
7957 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7959 /* First, calculate the adjustment to the function's class. */
7960 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7961 /*c_cast_p=*/0, tf_warning_or_error);
7963 if (!DECL_VIRTUAL_P (fn))
7964 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type),
7965 build_addr_func (fn, tf_warning_or_error));
7968 /* If we're dealing with a virtual function, we have to adjust 'this'
7969 again, to point to the base which provides the vtable entry for
7970 fn; the call will do the opposite adjustment. */
7971 tree orig_class = DECL_CONTEXT (fn);
7972 tree binfo = binfo_or_else (orig_class, fn_class);
7973 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7974 *delta, BINFO_OFFSET (binfo));
7975 *delta = fold_if_not_in_template (*delta);
7977 /* We set PFN to the vtable offset at which the function can be
7978 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7979 case delta is shifted left, and then incremented). */
7980 *pfn = DECL_VINDEX (fn);
7981 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7982 TYPE_SIZE_UNIT (vtable_entry_type));
7983 *pfn = fold_if_not_in_template (*pfn);
7985 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7987 case ptrmemfunc_vbit_in_pfn:
7988 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7990 *pfn = fold_if_not_in_template (*pfn);
7993 case ptrmemfunc_vbit_in_delta:
7994 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7995 *delta, integer_one_node);
7996 *delta = fold_if_not_in_template (*delta);
7997 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7998 *delta, integer_one_node);
7999 *delta = fold_if_not_in_template (*delta);
8006 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
8007 *pfn = fold_if_not_in_template (*pfn);
8011 /* Return an expression for PFN from the pointer-to-member function
8015 pfn_from_ptrmemfunc (tree t)
8017 if (TREE_CODE (t) == PTRMEM_CST)
8022 expand_ptrmemfunc_cst (t, &delta, &pfn);
8027 return build_ptrmemfunc_access_expr (t, pfn_identifier);
8030 /* Return an expression for DELTA from the pointer-to-member function
8034 delta_from_ptrmemfunc (tree t)
8036 if (TREE_CODE (t) == PTRMEM_CST)
8041 expand_ptrmemfunc_cst (t, &delta, &pfn);
8046 return build_ptrmemfunc_access_expr (t, delta_identifier);
8049 /* Convert value RHS to type TYPE as preparation for an assignment to
8050 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
8051 implicit conversion is. If FNDECL is non-NULL, we are doing the
8052 conversion in order to pass the PARMNUMth argument of FNDECL.
8053 If FNDECL is NULL, we are doing the conversion in function pointer
8054 argument passing, conversion in initialization, etc. */
8057 convert_for_assignment (tree type, tree rhs,
8058 impl_conv_rhs errtype, tree fndecl, int parmnum,
8059 tsubst_flags_t complain, int flags)
8062 enum tree_code coder;
8064 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
8065 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
8066 rhs = TREE_OPERAND (rhs, 0);
8068 rhstype = TREE_TYPE (rhs);
8069 coder = TREE_CODE (rhstype);
8071 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
8072 && vector_types_convertible_p (type, rhstype, true))
8074 rhs = mark_rvalue_use (rhs);
8075 return convert (type, rhs);
8078 if (rhs == error_mark_node || rhstype == error_mark_node)
8079 return error_mark_node;
8080 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
8081 return error_mark_node;
8083 /* The RHS of an assignment cannot have void type. */
8084 if (coder == VOID_TYPE)
8086 if (complain & tf_error)
8087 error ("void value not ignored as it ought to be");
8088 return error_mark_node;
8091 if (c_dialect_objc ())
8095 tree rname = fndecl;
8106 selector = objc_message_selector ();
8108 if (selector && parmno > 1)
8115 if (objc_compare_types (type, rhstype, parmno, rname))
8117 rhs = mark_rvalue_use (rhs);
8118 return convert (type, rhs);
8124 The expression is implicitly converted (clause _conv_) to the
8125 cv-unqualified type of the left operand.
8127 We allow bad conversions here because by the time we get to this point
8128 we are committed to doing the conversion. If we end up doing a bad
8129 conversion, convert_like will complain. */
8130 if (!can_convert_arg_bad (type, rhstype, rhs, flags, complain))
8132 /* When -Wno-pmf-conversions is use, we just silently allow
8133 conversions from pointers-to-members to plain pointers. If
8134 the conversion doesn't work, cp_convert will complain. */
8136 && TYPE_PTR_P (type)
8137 && TYPE_PTRMEMFUNC_P (rhstype))
8138 rhs = cp_convert (strip_top_quals (type), rhs, complain);
8141 if (complain & tf_error)
8143 /* If the right-hand side has unknown type, then it is an
8144 overloaded function. Call instantiate_type to get error
8146 if (rhstype == unknown_type_node)
8147 instantiate_type (type, rhs, tf_warning_or_error);
8149 error ("cannot convert %qT to %qT for argument %qP to %qD",
8150 rhstype, type, parmnum, fndecl);
8154 case ICR_DEFAULT_ARGUMENT:
8155 error ("cannot convert %qT to %qT in default argument",
8159 error ("cannot convert %qT to %qT in argument passing",
8162 case ICR_CONVERTING:
8163 error ("cannot convert %qT to %qT",
8167 error ("cannot convert %qT to %qT in initialization",
8171 error ("cannot convert %qT to %qT in return",
8175 error ("cannot convert %qT to %qT in assignment",
8181 if (TYPE_PTR_P (rhstype)
8182 && TYPE_PTR_P (type)
8183 && CLASS_TYPE_P (TREE_TYPE (rhstype))
8184 && CLASS_TYPE_P (TREE_TYPE (type))
8185 && !COMPLETE_TYPE_P (TREE_TYPE (rhstype)))
8186 inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL
8187 (TREE_TYPE (rhstype))),
8188 "class type %qT is incomplete", TREE_TYPE (rhstype));
8190 return error_mark_node;
8193 if (warn_suggest_attribute_format)
8195 const enum tree_code codel = TREE_CODE (type);
8196 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
8198 && check_missing_format_attribute (type, rhstype)
8199 && (complain & tf_warning))
8203 case ICR_DEFAULT_ARGUMENT:
8205 warning (OPT_Wsuggest_attribute_format,
8206 "parameter %qP of %qD might be a candidate "
8207 "for a format attribute", parmnum, fndecl);
8209 warning (OPT_Wsuggest_attribute_format,
8210 "parameter might be a candidate "
8211 "for a format attribute");
8213 case ICR_CONVERTING:
8214 warning (OPT_Wsuggest_attribute_format,
8215 "target of conversion might be a candidate "
8216 "for a format attribute");
8219 warning (OPT_Wsuggest_attribute_format,
8220 "target of initialization might be a candidate "
8221 "for a format attribute");
8224 warning (OPT_Wsuggest_attribute_format,
8225 "return type might be a candidate "
8226 "for a format attribute");
8229 warning (OPT_Wsuggest_attribute_format,
8230 "left-hand side of assignment might be a candidate "
8231 "for a format attribute");
8238 /* If -Wparentheses, warn about a = b = c when a has type bool and b
8240 if (warn_parentheses
8241 && TREE_CODE (type) == BOOLEAN_TYPE
8242 && TREE_CODE (rhs) == MODIFY_EXPR
8243 && !TREE_NO_WARNING (rhs)
8244 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
8245 && (complain & tf_warning))
8247 location_t loc = EXPR_LOC_OR_LOC (rhs, input_location);
8249 warning_at (loc, OPT_Wparentheses,
8250 "suggest parentheses around assignment used as truth value");
8251 TREE_NO_WARNING (rhs) = 1;
8254 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
8258 /* Convert RHS to be of type TYPE.
8259 If EXP is nonzero, it is the target of the initialization.
8260 ERRTYPE indicates what kind of error the implicit conversion is.
8262 Two major differences between the behavior of
8263 `convert_for_assignment' and `convert_for_initialization'
8264 are that references are bashed in the former, while
8265 copied in the latter, and aggregates are assigned in
8266 the former (operator=) while initialized in the
8269 If using constructor make sure no conversion operator exists, if one does
8270 exist, an ambiguity exists. */
8273 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
8274 impl_conv_rhs errtype, tree fndecl, int parmnum,
8275 tsubst_flags_t complain)
8277 enum tree_code codel = TREE_CODE (type);
8279 enum tree_code coder;
8281 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
8282 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
8283 if (TREE_CODE (rhs) == NOP_EXPR
8284 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
8285 && codel != REFERENCE_TYPE)
8286 rhs = TREE_OPERAND (rhs, 0);
8288 if (type == error_mark_node
8289 || rhs == error_mark_node
8290 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
8291 return error_mark_node;
8293 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
8294 && TREE_CODE (type) != ARRAY_TYPE
8295 && (TREE_CODE (type) != REFERENCE_TYPE
8296 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
8297 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
8298 && !TYPE_REFFN_P (type))
8299 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
8300 rhs = decay_conversion (rhs, complain);
8302 rhstype = TREE_TYPE (rhs);
8303 coder = TREE_CODE (rhstype);
8305 if (coder == ERROR_MARK)
8306 return error_mark_node;
8308 /* We accept references to incomplete types, so we can
8309 return here before checking if RHS is of complete type. */
8311 if (codel == REFERENCE_TYPE)
8313 /* This should eventually happen in convert_arguments. */
8314 int savew = 0, savee = 0;
8317 savew = warningcount + werrorcount, savee = errorcount;
8318 rhs = initialize_reference (type, rhs, flags, complain);
8321 && (warningcount + werrorcount > savew || errorcount > savee))
8322 inform (input_location,
8323 "in passing argument %P of %q+D", parmnum, fndecl);
8329 exp = require_complete_type_sfinae (exp, complain);
8330 if (exp == error_mark_node)
8331 return error_mark_node;
8333 rhstype = non_reference (rhstype);
8335 type = complete_type (type);
8337 if (DIRECT_INIT_EXPR_P (type, rhs))
8338 /* Don't try to do copy-initialization if we already have
8339 direct-initialization. */
8342 if (MAYBE_CLASS_TYPE_P (type))
8343 return perform_implicit_conversion_flags (type, rhs, complain, flags);
8345 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
8349 /* If RETVAL is the address of, or a reference to, a local variable or
8350 temporary give an appropriate warning and return true. */
8353 maybe_warn_about_returning_address_of_local (tree retval)
8355 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
8356 tree whats_returned = retval;
8360 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
8361 whats_returned = TREE_OPERAND (whats_returned, 1);
8362 else if (CONVERT_EXPR_P (whats_returned)
8363 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
8364 whats_returned = TREE_OPERAND (whats_returned, 0);
8369 if (TREE_CODE (whats_returned) != ADDR_EXPR)
8371 whats_returned = TREE_OPERAND (whats_returned, 0);
8373 while (TREE_CODE (whats_returned) == COMPONENT_REF
8374 || TREE_CODE (whats_returned) == ARRAY_REF)
8375 whats_returned = TREE_OPERAND (whats_returned, 0);
8377 if (TREE_CODE (valtype) == REFERENCE_TYPE)
8379 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
8380 || TREE_CODE (whats_returned) == TARGET_EXPR)
8382 warning (OPT_Wreturn_local_addr, "returning reference to temporary");
8385 if (VAR_P (whats_returned)
8386 && DECL_NAME (whats_returned)
8387 && TEMP_NAME_P (DECL_NAME (whats_returned)))
8389 warning (OPT_Wreturn_local_addr, "reference to non-lvalue returned");
8394 if (DECL_P (whats_returned)
8395 && DECL_NAME (whats_returned)
8396 && DECL_FUNCTION_SCOPE_P (whats_returned)
8397 && !is_capture_proxy (whats_returned)
8398 && !(TREE_STATIC (whats_returned)
8399 || TREE_PUBLIC (whats_returned)))
8401 if (TREE_CODE (valtype) == REFERENCE_TYPE)
8402 warning (OPT_Wreturn_local_addr, "reference to local variable %q+D returned",
8404 else if (TREE_CODE (whats_returned) == LABEL_DECL)
8405 warning (OPT_Wreturn_local_addr, "address of label %q+D returned",
8408 warning (OPT_Wreturn_local_addr, "address of local variable %q+D "
8409 "returned", whats_returned);
8416 /* Check that returning RETVAL from the current function is valid.
8417 Return an expression explicitly showing all conversions required to
8418 change RETVAL into the function return type, and to assign it to
8419 the DECL_RESULT for the function. Set *NO_WARNING to true if
8420 code reaches end of non-void function warning shouldn't be issued
8421 on this RETURN_EXPR. */
8424 check_return_expr (tree retval, bool *no_warning)
8427 /* The type actually returned by the function. */
8429 /* The type the function is declared to return, or void if
8430 the declared type is incomplete. */
8432 int fn_returns_value_p;
8433 bool named_return_value_okay_p;
8435 *no_warning = false;
8437 if (flag_cilkplus && retval && contains_cilk_spawn_stmt (retval))
8439 error_at (EXPR_LOCATION (retval), "use of %<_Cilk_spawn%> in a return "
8440 "statement is not allowed");
8444 /* A `volatile' function is one that isn't supposed to return, ever.
8445 (This is a G++ extension, used to get better code for functions
8446 that call the `volatile' function.) */
8447 if (TREE_THIS_VOLATILE (current_function_decl))
8448 warning (0, "function declared %<noreturn%> has a %<return%> statement");
8450 /* Check for various simple errors. */
8451 if (DECL_DESTRUCTOR_P (current_function_decl))
8454 error ("returning a value from a destructor");
8457 else if (DECL_CONSTRUCTOR_P (current_function_decl))
8459 if (in_function_try_handler)
8460 /* If a return statement appears in a handler of the
8461 function-try-block of a constructor, the program is ill-formed. */
8462 error ("cannot return from a handler of a function-try-block of a constructor");
8464 /* You can't return a value from a constructor. */
8465 error ("returning a value from a constructor");
8469 if (processing_template_decl)
8471 current_function_returns_value = 1;
8472 if (check_for_bare_parameter_packs (retval))
8473 retval = error_mark_node;
8477 functype = TREE_TYPE (TREE_TYPE (current_function_decl));
8479 /* Deduce auto return type from a return statement. */
8480 if (current_function_auto_return_pattern)
8485 if (!retval && !is_auto (current_function_auto_return_pattern))
8487 /* Give a helpful error message. */
8488 error ("return-statement with no value, in function returning %qT",
8489 current_function_auto_return_pattern);
8490 inform (input_location, "only plain %<auto%> return type can be "
8491 "deduced to %<void%>");
8492 type = error_mark_node;
8494 else if (retval && BRACE_ENCLOSED_INITIALIZER_P (retval))
8496 error ("returning initializer list");
8497 type = error_mark_node;
8503 auto_node = type_uses_auto (current_function_auto_return_pattern);
8504 type = do_auto_deduction (current_function_auto_return_pattern,
8508 if (type == error_mark_node)
8510 else if (functype == current_function_auto_return_pattern)
8511 apply_deduced_return_type (current_function_decl, type);
8513 /* A mismatch should have been diagnosed in do_auto_deduction. */
8514 gcc_assert (same_type_p (type, functype));
8518 /* When no explicit return-value is given in a function with a named
8519 return value, the named return value is used. */
8520 result = DECL_RESULT (current_function_decl);
8521 valtype = TREE_TYPE (result);
8522 gcc_assert (valtype != NULL_TREE);
8523 fn_returns_value_p = !VOID_TYPE_P (valtype);
8524 if (!retval && DECL_NAME (result) && fn_returns_value_p)
8527 /* Check for a return statement with no return value in a function
8528 that's supposed to return a value. */
8529 if (!retval && fn_returns_value_p)
8531 if (functype != error_mark_node)
8532 permerror (input_location, "return-statement with no value, in "
8533 "function returning %qT", valtype);
8534 /* Remember that this function did return. */
8535 current_function_returns_value = 1;
8536 /* And signal caller that TREE_NO_WARNING should be set on the
8537 RETURN_EXPR to avoid control reaches end of non-void function
8538 warnings in tree-cfg.c. */
8541 /* Check for a return statement with a value in a function that
8542 isn't supposed to return a value. */
8543 else if (retval && !fn_returns_value_p)
8545 if (VOID_TYPE_P (TREE_TYPE (retval)))
8546 /* You can return a `void' value from a function of `void'
8547 type. In that case, we have to evaluate the expression for
8548 its side-effects. */
8549 finish_expr_stmt (retval);
8551 permerror (input_location, "return-statement with a value, in function "
8552 "returning 'void'");
8553 current_function_returns_null = 1;
8555 /* There's really no value to return, after all. */
8559 /* Remember that this function can sometimes return without a
8561 current_function_returns_null = 1;
8563 /* Remember that this function did return a value. */
8564 current_function_returns_value = 1;
8566 /* Check for erroneous operands -- but after giving ourselves a
8567 chance to provide an error about returning a value from a void
8569 if (error_operand_p (retval))
8571 current_function_return_value = error_mark_node;
8572 return error_mark_node;
8575 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
8576 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
8577 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
8578 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
8580 && retval && null_ptr_cst_p (retval))
8581 warning (0, "%<operator new%> must not return NULL unless it is "
8582 "declared %<throw()%> (or -fcheck-new is in effect)");
8584 /* Effective C++ rule 15. See also start_function. */
8586 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
8590 /* The function return type must be a reference to the current
8592 if (TREE_CODE (valtype) == REFERENCE_TYPE
8593 && same_type_ignoring_top_level_qualifiers_p
8594 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
8596 /* Returning '*this' is obviously OK. */
8597 if (retval == current_class_ref)
8599 /* If we are calling a function whose return type is the same of
8600 the current class reference, it is ok. */
8601 else if (INDIRECT_REF_P (retval)
8602 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
8607 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
8610 /* The fabled Named Return Value optimization, as per [class.copy]/15:
8612 [...] For a function with a class return type, if the expression
8613 in the return statement is the name of a local object, and the cv-
8614 unqualified type of the local object is the same as the function
8615 return type, an implementation is permitted to omit creating the tem-
8616 porary object to hold the function return value [...]
8618 So, if this is a value-returning function that always returns the same
8619 local variable, remember it.
8621 It might be nice to be more flexible, and choose the first suitable
8622 variable even if the function sometimes returns something else, but
8623 then we run the risk of clobbering the variable we chose if the other
8624 returned expression uses the chosen variable somehow. And people expect
8625 this restriction, anyway. (jason 2000-11-19)
8627 See finish_function and finalize_nrv for the rest of this optimization. */
8629 named_return_value_okay_p =
8630 (retval != NULL_TREE
8631 /* Must be a local, automatic variable. */
8633 && DECL_CONTEXT (retval) == current_function_decl
8634 && ! TREE_STATIC (retval)
8635 /* And not a lambda or anonymous union proxy. */
8636 && !DECL_HAS_VALUE_EXPR_P (retval)
8637 && (DECL_ALIGN (retval) <= DECL_ALIGN (result))
8638 /* The cv-unqualified type of the returned value must be the
8639 same as the cv-unqualified return type of the
8641 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
8642 (TYPE_MAIN_VARIANT (functype)))
8643 /* And the returned value must be non-volatile. */
8644 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
8646 if (fn_returns_value_p && flag_elide_constructors)
8648 if (named_return_value_okay_p
8649 && (current_function_return_value == NULL_TREE
8650 || current_function_return_value == retval))
8651 current_function_return_value = retval;
8653 current_function_return_value = error_mark_node;
8656 /* We don't need to do any conversions when there's nothing being
8661 /* Do any required conversions. */
8662 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
8663 /* No conversions are required. */
8667 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
8669 /* The functype's return type will have been set to void, if it
8670 was an incomplete type. Just treat this as 'return;' */
8671 if (VOID_TYPE_P (functype))
8672 return error_mark_node;
8674 /* If we had an id-expression obfuscated by force_paren_expr, we need
8675 to undo it so we can try to treat it as an rvalue below. */
8676 if (cxx_dialect >= cxx14
8677 && INDIRECT_REF_P (retval)
8678 && REF_PARENTHESIZED_P (retval))
8680 retval = TREE_OPERAND (retval, 0);
8681 while (TREE_CODE (retval) == NON_LVALUE_EXPR
8682 || TREE_CODE (retval) == NOP_EXPR)
8683 retval = TREE_OPERAND (retval, 0);
8684 gcc_assert (TREE_CODE (retval) == ADDR_EXPR);
8685 retval = TREE_OPERAND (retval, 0);
8688 /* Under C++11 [12.8/32 class.copy], a returned lvalue is sometimes
8689 treated as an rvalue for the purposes of overload resolution to
8690 favor move constructors over copy constructors.
8692 Note that these conditions are similar to, but not as strict as,
8693 the conditions for the named return value optimization. */
8694 if ((cxx_dialect != cxx98)
8695 && ((VAR_P (retval) && !DECL_HAS_VALUE_EXPR_P (retval))
8696 || TREE_CODE (retval) == PARM_DECL)
8697 && DECL_CONTEXT (retval) == current_function_decl
8698 && !TREE_STATIC (retval)
8699 /* This is only interesting for class type. */
8700 && CLASS_TYPE_P (functype))
8701 flags = flags | LOOKUP_PREFER_RVALUE;
8703 /* First convert the value to the function's return type, then
8704 to the type of return value's location to handle the
8705 case that functype is smaller than the valtype. */
8706 retval = convert_for_initialization
8707 (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
8708 tf_warning_or_error);
8709 retval = convert (valtype, retval);
8711 /* If the conversion failed, treat this just like `return;'. */
8712 if (retval == error_mark_node)
8714 /* We can't initialize a register from a AGGR_INIT_EXPR. */
8715 else if (! cfun->returns_struct
8716 && TREE_CODE (retval) == TARGET_EXPR
8717 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
8718 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
8719 TREE_OPERAND (retval, 0));
8720 else if (maybe_warn_about_returning_address_of_local (retval))
8721 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
8722 build_zero_cst (TREE_TYPE (retval)));
8725 /* Actually copy the value returned into the appropriate location. */
8726 if (retval && retval != result)
8727 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
8733 /* Returns nonzero if the pointer-type FROM can be converted to the
8734 pointer-type TO via a qualification conversion. If CONSTP is -1,
8735 then we return nonzero if the pointers are similar, and the
8736 cv-qualification signature of FROM is a proper subset of that of TO.
8738 If CONSTP is positive, then all outer pointers have been
8742 comp_ptr_ttypes_real (tree to, tree from, int constp)
8744 bool to_more_cv_qualified = false;
8745 bool is_opaque_pointer = false;
8747 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8749 if (TREE_CODE (to) != TREE_CODE (from))
8752 if (TREE_CODE (from) == OFFSET_TYPE
8753 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
8754 TYPE_OFFSET_BASETYPE (to)))
8757 /* Const and volatile mean something different for function types,
8758 so the usual checks are not appropriate. */
8759 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
8761 if (!at_least_as_qualified_p (to, from))
8764 if (!at_least_as_qualified_p (from, to))
8768 to_more_cv_qualified = true;
8772 constp &= TYPE_READONLY (to);
8775 if (TREE_CODE (to) == VECTOR_TYPE)
8776 is_opaque_pointer = vector_targets_convertible_p (to, from);
8778 if (!TYPE_PTR_P (to) && !TYPE_PTRDATAMEM_P (to))
8779 return ((constp >= 0 || to_more_cv_qualified)
8780 && (is_opaque_pointer
8781 || same_type_ignoring_top_level_qualifiers_p (to, from)));
8785 /* When comparing, say, char ** to char const **, this function takes
8786 the 'char *' and 'char const *'. Do not pass non-pointer/reference
8787 types to this function. */
8790 comp_ptr_ttypes (tree to, tree from)
8792 return comp_ptr_ttypes_real (to, from, 1);
8795 /* Returns true iff FNTYPE is a non-class type that involves
8796 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
8797 if a parameter type is ill-formed. */
8800 error_type_p (const_tree type)
8804 switch (TREE_CODE (type))
8810 case REFERENCE_TYPE:
8812 return error_type_p (TREE_TYPE (type));
8816 if (error_type_p (TREE_TYPE (type)))
8818 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
8819 if (error_type_p (TREE_VALUE (t)))
8824 if (TYPE_PTRMEMFUNC_P (type))
8825 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
8833 /* Returns true if to and from are (possibly multi-level) pointers to the same
8834 type or inheritance-related types, regardless of cv-quals. */
8837 ptr_reasonably_similar (const_tree to, const_tree from)
8839 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8841 /* Any target type is similar enough to void. */
8842 if (VOID_TYPE_P (to))
8843 return !error_type_p (from);
8844 if (VOID_TYPE_P (from))
8845 return !error_type_p (to);
8847 if (TREE_CODE (to) != TREE_CODE (from))
8850 if (TREE_CODE (from) == OFFSET_TYPE
8851 && comptypes (TYPE_OFFSET_BASETYPE (to),
8852 TYPE_OFFSET_BASETYPE (from),
8853 COMPARE_BASE | COMPARE_DERIVED))
8856 if (TREE_CODE (to) == VECTOR_TYPE
8857 && vector_types_convertible_p (to, from, false))
8860 if (TREE_CODE (to) == INTEGER_TYPE
8861 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
8864 if (TREE_CODE (to) == FUNCTION_TYPE)
8865 return !error_type_p (to) && !error_type_p (from);
8867 if (!TYPE_PTR_P (to))
8869 /* When either type is incomplete avoid DERIVED_FROM_P,
8870 which may call complete_type (c++/57942). */
8871 bool b = !COMPLETE_TYPE_P (to) || !COMPLETE_TYPE_P (from);
8873 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
8874 b ? COMPARE_STRICT : COMPARE_BASE | COMPARE_DERIVED);
8879 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8880 pointer-to-member types) are the same, ignoring cv-qualification at
8884 comp_ptr_ttypes_const (tree to, tree from)
8886 bool is_opaque_pointer = false;
8888 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8890 if (TREE_CODE (to) != TREE_CODE (from))
8893 if (TREE_CODE (from) == OFFSET_TYPE
8894 && same_type_p (TYPE_OFFSET_BASETYPE (from),
8895 TYPE_OFFSET_BASETYPE (to)))
8898 if (TREE_CODE (to) == VECTOR_TYPE)
8899 is_opaque_pointer = vector_targets_convertible_p (to, from);
8901 if (!TYPE_PTR_P (to))
8902 return (is_opaque_pointer
8903 || same_type_ignoring_top_level_qualifiers_p (to, from));
8907 /* Returns the type qualifiers for this type, including the qualifiers on the
8908 elements for an array type. */
8911 cp_type_quals (const_tree type)
8914 /* This CONST_CAST is okay because strip_array_types returns its
8915 argument unmodified and we assign it to a const_tree. */
8916 type = strip_array_types (CONST_CAST_TREE (type));
8917 if (type == error_mark_node
8918 /* Quals on a FUNCTION_TYPE are memfn quals. */
8919 || TREE_CODE (type) == FUNCTION_TYPE)
8920 return TYPE_UNQUALIFIED;
8921 quals = TYPE_QUALS (type);
8922 /* METHOD and REFERENCE_TYPEs should never have quals. */
8923 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
8924 && TREE_CODE (type) != REFERENCE_TYPE)
8925 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
8926 == TYPE_UNQUALIFIED));
8930 /* Returns the function-ref-qualifier for TYPE */
8933 type_memfn_rqual (const_tree type)
8935 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE
8936 || TREE_CODE (type) == METHOD_TYPE);
8938 if (!FUNCTION_REF_QUALIFIED (type))
8939 return REF_QUAL_NONE;
8940 else if (FUNCTION_RVALUE_QUALIFIED (type))
8941 return REF_QUAL_RVALUE;
8943 return REF_QUAL_LVALUE;
8946 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8950 type_memfn_quals (const_tree type)
8952 if (TREE_CODE (type) == FUNCTION_TYPE)
8953 return TYPE_QUALS (type);
8954 else if (TREE_CODE (type) == METHOD_TYPE)
8955 return cp_type_quals (class_of_this_parm (type));
8960 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8961 MEMFN_QUALS and its ref-qualifier to RQUAL. */
8964 apply_memfn_quals (tree type, cp_cv_quals memfn_quals, cp_ref_qualifier rqual)
8966 /* Could handle METHOD_TYPE here if necessary. */
8967 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8968 if (TYPE_QUALS (type) == memfn_quals
8969 && type_memfn_rqual (type) == rqual)
8972 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8974 tree result = build_qualified_type (type, memfn_quals);
8975 if (tree canon = TYPE_CANONICAL (result))
8976 if (canon != result)
8977 /* check_qualified_type doesn't check the ref-qualifier, so make sure
8978 TYPE_CANONICAL is correct. */
8979 TYPE_CANONICAL (result)
8980 = build_ref_qualified_type (canon, type_memfn_rqual (result));
8981 result = build_exception_variant (result, TYPE_RAISES_EXCEPTIONS (type));
8982 return build_ref_qualified_type (result, rqual);
8985 /* Returns nonzero if TYPE is const or volatile. */
8988 cv_qualified_p (const_tree type)
8990 int quals = cp_type_quals (type);
8991 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
8994 /* Returns nonzero if the TYPE contains a mutable member. */
8997 cp_has_mutable_p (const_tree type)
8999 /* This CONST_CAST is okay because strip_array_types returns its
9000 argument unmodified and we assign it to a const_tree. */
9001 type = strip_array_types (CONST_CAST_TREE(type));
9003 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
9006 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
9007 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
9008 approximation. In particular, consider:
9011 struct S { int i; };
9012 const S s = { f(); }
9014 Here, we will make "s" as TREE_READONLY (because it is declared
9015 "const") -- only to reverse ourselves upon seeing that the
9016 initializer is non-constant. */
9019 cp_apply_type_quals_to_decl (int type_quals, tree decl)
9021 tree type = TREE_TYPE (decl);
9023 if (type == error_mark_node)
9026 if (TREE_CODE (decl) == TYPE_DECL)
9029 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
9030 && type_quals != TYPE_UNQUALIFIED));
9032 /* Avoid setting TREE_READONLY incorrectly. */
9033 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
9034 constructor can produce constant init, so rely on cp_finish_decl to
9035 clear TREE_READONLY if the variable has non-constant init. */
9037 /* If the type has (or might have) a mutable component, that component
9038 might be modified. */
9039 if (TYPE_HAS_MUTABLE_P (type) || !COMPLETE_TYPE_P (type))
9040 type_quals &= ~TYPE_QUAL_CONST;
9042 c_apply_type_quals_to_decl (type_quals, decl);
9045 /* Subroutine of casts_away_constness. Make T1 and T2 point at
9046 exemplar types such that casting T1 to T2 is casting away constness
9047 if and only if there is no implicit conversion from T1 to T2. */
9050 casts_away_constness_r (tree *t1, tree *t2, tsubst_flags_t complain)
9055 /* [expr.const.cast]
9057 For multi-level pointer to members and multi-level mixed pointers
9058 and pointers to members (conv.qual), the "member" aspect of a
9059 pointer to member level is ignored when determining if a const
9060 cv-qualifier has been cast away. */
9061 /* [expr.const.cast]
9063 For two pointer types:
9065 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
9066 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
9069 casting from X1 to X2 casts away constness if, for a non-pointer
9070 type T there does not exist an implicit conversion (clause
9073 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
9077 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
9078 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRDATAMEM_P (*t1))
9079 || (!TYPE_PTR_P (*t2) && !TYPE_PTRDATAMEM_P (*t2)))
9081 *t1 = cp_build_qualified_type (void_type_node,
9082 cp_type_quals (*t1));
9083 *t2 = cp_build_qualified_type (void_type_node,
9084 cp_type_quals (*t2));
9088 quals1 = cp_type_quals (*t1);
9089 quals2 = cp_type_quals (*t2);
9091 if (TYPE_PTRDATAMEM_P (*t1))
9092 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
9094 *t1 = TREE_TYPE (*t1);
9095 if (TYPE_PTRDATAMEM_P (*t2))
9096 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
9098 *t2 = TREE_TYPE (*t2);
9100 casts_away_constness_r (t1, t2, complain);
9101 *t1 = build_pointer_type (*t1);
9102 *t2 = build_pointer_type (*t2);
9103 *t1 = cp_build_qualified_type (*t1, quals1);
9104 *t2 = cp_build_qualified_type (*t2, quals2);
9107 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
9110 ??? This function returns non-zero if casting away qualifiers not
9111 just const. We would like to return to the caller exactly which
9112 qualifiers are casted away to give more accurate diagnostics.
9116 casts_away_constness (tree t1, tree t2, tsubst_flags_t complain)
9118 if (TREE_CODE (t2) == REFERENCE_TYPE)
9120 /* [expr.const.cast]
9122 Casting from an lvalue of type T1 to an lvalue of type T2
9123 using a reference cast casts away constness if a cast from an
9124 rvalue of type "pointer to T1" to the type "pointer to T2"
9125 casts away constness. */
9126 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
9127 return casts_away_constness (build_pointer_type (t1),
9128 build_pointer_type (TREE_TYPE (t2)),
9132 if (TYPE_PTRDATAMEM_P (t1) && TYPE_PTRDATAMEM_P (t2))
9133 /* [expr.const.cast]
9135 Casting from an rvalue of type "pointer to data member of X
9136 of type T1" to the type "pointer to data member of Y of type
9137 T2" casts away constness if a cast from an rvalue of type
9138 "pointer to T1" to the type "pointer to T2" casts away
9140 return casts_away_constness
9141 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
9142 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)),
9145 /* Casting away constness is only something that makes sense for
9146 pointer or reference types. */
9147 if (!TYPE_PTR_P (t1) || !TYPE_PTR_P (t2))
9150 /* Top-level qualifiers don't matter. */
9151 t1 = TYPE_MAIN_VARIANT (t1);
9152 t2 = TYPE_MAIN_VARIANT (t2);
9153 casts_away_constness_r (&t1, &t2, complain);
9154 if (!can_convert (t2, t1, complain))
9160 /* If T is a REFERENCE_TYPE return the type to which T refers.
9161 Otherwise, return T itself. */
9164 non_reference (tree t)
9166 if (t && TREE_CODE (t) == REFERENCE_TYPE)
9172 /* Return nonzero if REF is an lvalue valid for this language;
9173 otherwise, print an error message and return zero. USE says
9174 how the lvalue is being used and so selects the error message. */
9177 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
9179 cp_lvalue_kind kind = lvalue_kind (ref);
9181 if (kind == clk_none)
9183 if (complain & tf_error)
9184 lvalue_error (input_location, use);
9187 else if (kind & (clk_rvalueref|clk_class))
9189 if (!(complain & tf_error))
9191 if (kind & clk_class)
9192 /* Make this a permerror because we used to accept it. */
9193 permerror (input_location, "using temporary as lvalue");
9195 error ("using xvalue (rvalue reference) as lvalue");
9200 /* Return true if a user-defined literal operator is a raw operator. */
9203 check_raw_literal_operator (const_tree decl)
9205 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
9208 bool maybe_raw_p = false;
9210 /* Count the number and type of arguments and check for ellipsis. */
9211 for (argtype = argtypes, arity = 0;
9212 argtype && argtype != void_list_node;
9213 ++arity, argtype = TREE_CHAIN (argtype))
9215 tree t = TREE_VALUE (argtype);
9217 if (same_type_p (t, const_string_type_node))
9221 return false; /* Found ellipsis. */
9223 if (!maybe_raw_p || arity != 1)
9230 /* Return true if a user-defined literal operator has one of the allowed
9234 check_literal_operator_args (const_tree decl,
9235 bool *long_long_unsigned_p, bool *long_double_p)
9237 tree argtypes = TYPE_ARG_TYPES (TREE_TYPE (decl));
9239 *long_long_unsigned_p = false;
9240 *long_double_p = false;
9241 if (processing_template_decl || processing_specialization)
9242 return argtypes == void_list_node;
9249 /* Count the number and type of arguments and check for ellipsis. */
9250 for (argtype = argtypes, arity = 0;
9251 argtype && argtype != void_list_node;
9252 argtype = TREE_CHAIN (argtype))
9254 tree t = TREE_VALUE (argtype);
9259 bool maybe_raw_p = false;
9261 if (cp_type_quals (t) != TYPE_QUAL_CONST)
9263 t = TYPE_MAIN_VARIANT (t);
9264 if ((maybe_raw_p = same_type_p (t, char_type_node))
9265 || same_type_p (t, wchar_type_node)
9266 || same_type_p (t, char16_type_node)
9267 || same_type_p (t, char32_type_node))
9269 argtype = TREE_CHAIN (argtype);
9272 t = TREE_VALUE (argtype);
9273 if (maybe_raw_p && argtype == void_list_node)
9275 else if (same_type_p (t, size_type_node))
9284 else if (same_type_p (t, long_long_unsigned_type_node))
9287 *long_long_unsigned_p = true;
9289 else if (same_type_p (t, long_double_type_node))
9292 *long_double_p = true;
9294 else if (same_type_p (t, char_type_node))
9296 else if (same_type_p (t, wchar_type_node))
9298 else if (same_type_p (t, char16_type_node))
9300 else if (same_type_p (t, char32_type_node))
9306 return false; /* Found ellipsis. */
9308 if (arity != max_arity)