1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
4 Free Software Foundation, Inc.
5 Hacked by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization. */
31 #include "coretypes.h"
37 #include "diagnostic.h"
41 #include "c-family/c-common.h"
42 #include "c-family/c-objc.h"
45 static tree pfn_from_ptrmemfunc (tree);
46 static tree delta_from_ptrmemfunc (tree);
47 static tree convert_for_assignment (tree, tree, impl_conv_rhs, tree, int,
49 static tree cp_pointer_int_sum (enum tree_code, tree, tree);
50 static tree rationalize_conditional_expr (enum tree_code, tree,
52 static int comp_ptr_ttypes_real (tree, tree, int);
53 static bool comp_except_types (tree, tree, bool);
54 static bool comp_array_types (const_tree, const_tree, bool);
55 static tree pointer_diff (tree, tree, tree);
56 static tree get_delta_difference (tree, tree, bool, bool, tsubst_flags_t);
57 static void casts_away_constness_r (tree *, tree *);
58 static bool casts_away_constness (tree, tree);
59 static void maybe_warn_about_returning_address_of_local (tree);
60 static tree lookup_destructor (tree, tree, tree);
61 static void warn_args_num (location_t, tree, bool);
62 static int convert_arguments (tree, VEC(tree,gc) **, tree, int,
65 /* Do `exp = require_complete_type (exp);' to make sure exp
66 does not have an incomplete type. (That includes void types.)
67 Returns error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type_sfinae (tree value, tsubst_flags_t complain)
75 if (processing_template_decl || value == error_mark_node)
78 if (TREE_CODE (value) == OVERLOAD)
79 type = unknown_type_node;
81 type = TREE_TYPE (value);
83 if (type == error_mark_node)
84 return error_mark_node;
86 /* First, detect a valid value with a complete type. */
87 if (COMPLETE_TYPE_P (type))
90 if (complete_type_or_maybe_complain (type, value, complain))
93 return error_mark_node;
97 require_complete_type (tree value)
99 return require_complete_type_sfinae (value, tf_warning_or_error);
102 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
103 a template instantiation, do the instantiation. Returns TYPE,
104 whether or not it could be completed, unless something goes
105 horribly wrong, in which case the error_mark_node is returned. */
108 complete_type (tree type)
110 if (type == NULL_TREE)
111 /* Rather than crash, we return something sure to cause an error
113 return error_mark_node;
115 if (type == error_mark_node || COMPLETE_TYPE_P (type))
117 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
119 tree t = complete_type (TREE_TYPE (type));
120 unsigned int needs_constructing, has_nontrivial_dtor;
121 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
124 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
126 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
127 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
129 TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
130 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
133 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
134 instantiate_class_template (TYPE_MAIN_VARIANT (type));
139 /* Like complete_type, but issue an error if the TYPE cannot be completed.
140 VALUE is used for informative diagnostics.
141 Returns NULL_TREE if the type cannot be made complete. */
144 complete_type_or_maybe_complain (tree type, tree value, tsubst_flags_t complain)
146 type = complete_type (type);
147 if (type == error_mark_node)
148 /* We already issued an error. */
150 else if (!COMPLETE_TYPE_P (type))
152 if (complain & tf_error)
153 cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
161 complete_type_or_else (tree type, tree value)
163 return complete_type_or_maybe_complain (type, value, tf_warning_or_error);
166 /* Return truthvalue of whether type of EXP is instantiated. */
169 type_unknown_p (const_tree exp)
171 return (TREE_CODE (exp) == TREE_LIST
172 || TREE_TYPE (exp) == unknown_type_node);
176 /* Return the common type of two parameter lists.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash.
180 As an optimization, free the space we allocate if the parameter
181 lists are already common. */
184 commonparms (tree p1, tree p2)
186 tree oldargs = p1, newargs, n;
190 len = list_length (p1);
191 newargs = tree_last (p1);
193 if (newargs == void_list_node)
202 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
207 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
209 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
211 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
214 else if (! TREE_PURPOSE (p1))
216 if (TREE_PURPOSE (p2))
218 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
224 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
226 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
228 if (TREE_VALUE (p1) != TREE_VALUE (p2))
231 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
234 TREE_VALUE (n) = TREE_VALUE (p1);
242 /* Given a type, perhaps copied for a typedef,
243 find the "original" version of it. */
245 original_type (tree t)
247 int quals = cp_type_quals (t);
248 while (t != error_mark_node
249 && TYPE_NAME (t) != NULL_TREE)
251 tree x = TYPE_NAME (t);
252 if (TREE_CODE (x) != TYPE_DECL)
254 x = DECL_ORIGINAL_TYPE (x);
259 return cp_build_qualified_type (t, quals);
262 /* Return the common type for two arithmetic types T1 and T2 under the
263 usual arithmetic conversions. The default conversions have already
264 been applied, and enumerated types converted to their compatible
268 cp_common_type (tree t1, tree t2)
270 enum tree_code code1 = TREE_CODE (t1);
271 enum tree_code code2 = TREE_CODE (t2);
275 /* In what follows, we slightly generalize the rules given in [expr] so
276 as to deal with `long long' and `complex'. First, merge the
278 attributes = (*targetm.merge_type_attributes) (t1, t2);
280 if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
282 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
283 return build_type_attribute_variant (t1, attributes);
288 /* FIXME: Attributes. */
289 gcc_assert (ARITHMETIC_TYPE_P (t1)
290 || TREE_CODE (t1) == VECTOR_TYPE
291 || UNSCOPED_ENUM_P (t1));
292 gcc_assert (ARITHMETIC_TYPE_P (t2)
293 || TREE_CODE (t2) == VECTOR_TYPE
294 || UNSCOPED_ENUM_P (t2));
296 /* If one type is complex, form the common type of the non-complex
297 components, then make that complex. Use T1 or T2 if it is the
299 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
301 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
302 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
304 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
306 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
307 return build_type_attribute_variant (t1, attributes);
308 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
309 return build_type_attribute_variant (t2, attributes);
311 return build_type_attribute_variant (build_complex_type (subtype),
315 if (code1 == VECTOR_TYPE)
317 /* When we get here we should have two vectors of the same size.
318 Just prefer the unsigned one if present. */
319 if (TYPE_UNSIGNED (t1))
320 return build_type_attribute_variant (t1, attributes);
322 return build_type_attribute_variant (t2, attributes);
325 /* If only one is real, use it as the result. */
326 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
327 return build_type_attribute_variant (t1, attributes);
328 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
329 return build_type_attribute_variant (t2, attributes);
331 /* Both real or both integers; use the one with greater precision. */
332 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
333 return build_type_attribute_variant (t1, attributes);
334 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
335 return build_type_attribute_variant (t2, attributes);
337 /* The types are the same; no need to do anything fancy. */
338 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
339 return build_type_attribute_variant (t1, attributes);
341 if (code1 != REAL_TYPE)
343 /* If one is unsigned long long, then convert the other to unsigned
345 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
346 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
347 return build_type_attribute_variant (long_long_unsigned_type_node,
349 /* If one is a long long, and the other is an unsigned long, and
350 long long can represent all the values of an unsigned long, then
351 convert to a long long. Otherwise, convert to an unsigned long
352 long. Otherwise, if either operand is long long, convert the
355 Since we're here, we know the TYPE_PRECISION is the same;
356 therefore converting to long long cannot represent all the values
357 of an unsigned long, so we choose unsigned long long in that
359 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
360 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
362 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
363 ? long_long_unsigned_type_node
364 : long_long_integer_type_node);
365 return build_type_attribute_variant (t, attributes);
367 if (int128_integer_type_node != NULL_TREE
368 && (same_type_p (TYPE_MAIN_VARIANT (t1),
369 int128_integer_type_node)
370 || same_type_p (TYPE_MAIN_VARIANT (t2),
371 int128_integer_type_node)))
373 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
374 ? int128_unsigned_type_node
375 : int128_integer_type_node);
376 return build_type_attribute_variant (t, attributes);
379 /* Go through the same procedure, but for longs. */
380 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
381 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
382 return build_type_attribute_variant (long_unsigned_type_node,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
385 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
387 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
388 ? long_unsigned_type_node : long_integer_type_node);
389 return build_type_attribute_variant (t, attributes);
391 /* Otherwise prefer the unsigned one. */
392 if (TYPE_UNSIGNED (t1))
393 return build_type_attribute_variant (t1, attributes);
395 return build_type_attribute_variant (t2, attributes);
399 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
400 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
401 return build_type_attribute_variant (long_double_type_node,
403 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
404 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
405 return build_type_attribute_variant (double_type_node,
407 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
408 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
409 return build_type_attribute_variant (float_type_node,
412 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
413 the standard C++ floating-point types. Logic earlier in this
414 function has already eliminated the possibility that
415 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
416 compelling reason to choose one or the other. */
417 return build_type_attribute_variant (t1, attributes);
421 /* T1 and T2 are arithmetic or enumeration types. Return the type
422 that will result from the "usual arithmetic conversions" on T1 and
423 T2 as described in [expr]. */
426 type_after_usual_arithmetic_conversions (tree t1, tree t2)
428 gcc_assert (ARITHMETIC_TYPE_P (t1)
429 || TREE_CODE (t1) == VECTOR_TYPE
430 || UNSCOPED_ENUM_P (t1));
431 gcc_assert (ARITHMETIC_TYPE_P (t2)
432 || TREE_CODE (t2) == VECTOR_TYPE
433 || UNSCOPED_ENUM_P (t2));
435 /* Perform the integral promotions. We do not promote real types here. */
436 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
437 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
439 t1 = type_promotes_to (t1);
440 t2 = type_promotes_to (t2);
443 return cp_common_type (t1, t2);
447 composite_pointer_error (diagnostic_t kind, tree t1, tree t2,
448 composite_pointer_operation operation)
453 emit_diagnostic (kind, input_location, 0,
454 "comparison between "
455 "distinct pointer types %qT and %qT lacks a cast",
459 emit_diagnostic (kind, input_location, 0,
460 "conversion between "
461 "distinct pointer types %qT and %qT lacks a cast",
464 case CPO_CONDITIONAL_EXPR:
465 emit_diagnostic (kind, input_location, 0,
466 "conditional expression between "
467 "distinct pointer types %qT and %qT lacks a cast",
475 /* Subroutine of composite_pointer_type to implement the recursive
476 case. See that function for documentation of the parameters. */
479 composite_pointer_type_r (tree t1, tree t2,
480 composite_pointer_operation operation,
481 tsubst_flags_t complain)
488 /* Determine the types pointed to by T1 and T2. */
489 if (TREE_CODE (t1) == POINTER_TYPE)
491 pointee1 = TREE_TYPE (t1);
492 pointee2 = TREE_TYPE (t2);
496 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
497 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
502 Otherwise, the composite pointer type is a pointer type
503 similar (_conv.qual_) to the type of one of the operands,
504 with a cv-qualification signature (_conv.qual_) that is the
505 union of the cv-qualification signatures of the operand
507 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
508 result_type = pointee1;
509 else if ((TREE_CODE (pointee1) == POINTER_TYPE
510 && TREE_CODE (pointee2) == POINTER_TYPE)
511 || (TYPE_PTR_TO_MEMBER_P (pointee1)
512 && TYPE_PTR_TO_MEMBER_P (pointee2)))
513 result_type = composite_pointer_type_r (pointee1, pointee2, operation,
517 if (complain & tf_error)
518 composite_pointer_error (DK_PERMERROR, t1, t2, operation);
520 return error_mark_node;
521 result_type = void_type_node;
523 result_type = cp_build_qualified_type (result_type,
524 (cp_type_quals (pointee1)
525 | cp_type_quals (pointee2)));
526 /* If the original types were pointers to members, so is the
528 if (TYPE_PTR_TO_MEMBER_P (t1))
530 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
531 TYPE_PTRMEM_CLASS_TYPE (t2)))
533 if (complain & tf_error)
534 composite_pointer_error (DK_PERMERROR, t1, t2, operation);
536 return error_mark_node;
538 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
542 result_type = build_pointer_type (result_type);
544 /* Merge the attributes. */
545 attributes = (*targetm.merge_type_attributes) (t1, t2);
546 return build_type_attribute_variant (result_type, attributes);
549 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
550 ARG1 and ARG2 are the values with those types. The OPERATION is to
551 describe the operation between the pointer types,
552 in case an error occurs.
554 This routine also implements the computation of a common type for
555 pointers-to-members as per [expr.eq]. */
558 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
559 composite_pointer_operation operation,
560 tsubst_flags_t complain)
567 If one operand is a null pointer constant, the composite pointer
568 type is the type of the other operand. */
569 if (null_ptr_cst_p (arg1))
571 if (null_ptr_cst_p (arg2))
578 If one of the operands has type "pointer to cv1 void*", then
579 the other has type "pointer to cv2T", and the composite pointer
580 type is "pointer to cv12 void", where cv12 is the union of cv1
583 If either type is a pointer to void, make sure it is T1. */
584 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
592 /* Now, if T1 is a pointer to void, merge the qualifiers. */
593 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
598 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
603 pedwarn (input_location, OPT_pedantic,
604 "ISO C++ forbids comparison between "
605 "pointer of type %<void *%> and pointer-to-function");
608 pedwarn (input_location, OPT_pedantic,
609 "ISO C++ forbids conversion between "
610 "pointer of type %<void *%> and pointer-to-function");
612 case CPO_CONDITIONAL_EXPR:
613 pedwarn (input_location, OPT_pedantic,
614 "ISO C++ forbids conditional expression between "
615 "pointer of type %<void *%> and pointer-to-function");
622 = cp_build_qualified_type (void_type_node,
623 (cp_type_quals (TREE_TYPE (t1))
624 | cp_type_quals (TREE_TYPE (t2))));
625 result_type = build_pointer_type (result_type);
626 /* Merge the attributes. */
627 attributes = (*targetm.merge_type_attributes) (t1, t2);
628 return build_type_attribute_variant (result_type, attributes);
631 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
632 && TREE_CODE (t2) == POINTER_TYPE)
634 if (objc_have_common_type (t1, t2, -3, NULL_TREE))
635 return objc_common_type (t1, t2);
638 /* [expr.eq] permits the application of a pointer conversion to
639 bring the pointers to a common type. */
640 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
641 && CLASS_TYPE_P (TREE_TYPE (t1))
642 && CLASS_TYPE_P (TREE_TYPE (t2))
643 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
646 class1 = TREE_TYPE (t1);
647 class2 = TREE_TYPE (t2);
649 if (DERIVED_FROM_P (class1, class2))
650 t2 = (build_pointer_type
651 (cp_build_qualified_type (class1, cp_type_quals (class2))));
652 else if (DERIVED_FROM_P (class2, class1))
653 t1 = (build_pointer_type
654 (cp_build_qualified_type (class2, cp_type_quals (class1))));
657 if (complain & tf_error)
658 composite_pointer_error (DK_ERROR, t1, t2, operation);
659 return error_mark_node;
662 /* [expr.eq] permits the application of a pointer-to-member
663 conversion to change the class type of one of the types. */
664 else if (TYPE_PTR_TO_MEMBER_P (t1)
665 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
666 TYPE_PTRMEM_CLASS_TYPE (t2)))
668 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
669 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
671 if (DERIVED_FROM_P (class1, class2))
672 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
673 else if (DERIVED_FROM_P (class2, class1))
674 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
677 if (complain & tf_error)
681 error ("comparison between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
686 error ("conversion between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
690 case CPO_CONDITIONAL_EXPR:
691 error ("conditional expression between distinct "
692 "pointer-to-member types %qT and %qT lacks a cast",
698 return error_mark_node;
702 return composite_pointer_type_r (t1, t2, operation, complain);
705 /* Return the merged type of two types.
706 We assume that comptypes has already been done and returned 1;
707 if that isn't so, this may crash.
709 This just combines attributes and default arguments; any other
710 differences would cause the two types to compare unalike. */
713 merge_types (tree t1, tree t2)
715 enum tree_code code1;
716 enum tree_code code2;
719 /* Save time if the two types are the same. */
722 if (original_type (t1) == original_type (t2))
725 /* If one type is nonsense, use the other. */
726 if (t1 == error_mark_node)
728 if (t2 == error_mark_node)
731 /* Merge the attributes. */
732 attributes = (*targetm.merge_type_attributes) (t1, t2);
734 if (TYPE_PTRMEMFUNC_P (t1))
735 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
736 if (TYPE_PTRMEMFUNC_P (t2))
737 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
739 code1 = TREE_CODE (t1);
740 code2 = TREE_CODE (t2);
743 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
744 if (code1 == TYPENAME_TYPE)
746 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
747 code1 = TREE_CODE (t1);
751 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
752 code2 = TREE_CODE (t2);
760 /* For two pointers, do this recursively on the target type. */
762 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
763 int quals = cp_type_quals (t1);
765 if (code1 == POINTER_TYPE)
766 t1 = build_pointer_type (target);
768 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
769 t1 = build_type_attribute_variant (t1, attributes);
770 t1 = cp_build_qualified_type (t1, quals);
772 if (TREE_CODE (target) == METHOD_TYPE)
773 t1 = build_ptrmemfunc_type (t1);
782 quals = cp_type_quals (t1);
783 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
784 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
785 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
787 t1 = cp_build_qualified_type (t1, quals);
793 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
794 /* Save space: see if the result is identical to one of the args. */
795 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
796 return build_type_attribute_variant (t1, attributes);
797 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
798 return build_type_attribute_variant (t2, attributes);
799 /* Merge the element types, and have a size if either arg has one. */
800 t1 = build_cplus_array_type
801 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
806 /* Function types: prefer the one that specified arg types.
807 If both do, merge the arg types. Also merge the return types. */
809 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
810 tree p1 = TYPE_ARG_TYPES (t1);
811 tree p2 = TYPE_ARG_TYPES (t2);
815 /* Save space: see if the result is identical to one of the args. */
816 if (valtype == TREE_TYPE (t1) && ! p2)
817 return cp_build_type_attribute_variant (t1, attributes);
818 if (valtype == TREE_TYPE (t2) && ! p1)
819 return cp_build_type_attribute_variant (t2, attributes);
821 /* Simple way if one arg fails to specify argument types. */
822 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
824 else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
827 parms = commonparms (p1, p2);
829 rval = build_function_type (valtype, parms);
830 gcc_assert (type_memfn_quals (t1) == type_memfn_quals (t2));
831 rval = apply_memfn_quals (rval, type_memfn_quals (t1));
832 raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
833 TYPE_RAISES_EXCEPTIONS (t2),
835 t1 = build_exception_variant (rval, raises);
841 /* Get this value the long way, since TYPE_METHOD_BASETYPE
842 is just the main variant of this. */
843 tree basetype = class_of_this_parm (t2);
844 tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
845 TYPE_RAISES_EXCEPTIONS (t2),
849 /* If this was a member function type, get back to the
850 original type of type member function (i.e., without
851 the class instance variable up front. */
852 t1 = build_function_type (TREE_TYPE (t1),
853 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
854 t2 = build_function_type (TREE_TYPE (t2),
855 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
856 t3 = merge_types (t1, t2);
857 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
858 TYPE_ARG_TYPES (t3));
859 t1 = build_exception_variant (t3, raises);
864 /* There is no need to merge attributes into a TYPENAME_TYPE.
865 When the type is instantiated it will have whatever
866 attributes result from the instantiation. */
872 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
874 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
877 return cp_build_type_attribute_variant (t1, attributes);
880 /* Return the ARRAY_TYPE type without its domain. */
883 strip_array_domain (tree type)
886 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
887 if (TYPE_DOMAIN (type) == NULL_TREE)
889 t2 = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
890 return cp_build_type_attribute_variant (t2, TYPE_ATTRIBUTES (type));
893 /* Wrapper around cp_common_type that is used by c-common.c and other
894 front end optimizations that remove promotions.
896 Return the common type for two arithmetic types T1 and T2 under the
897 usual arithmetic conversions. The default conversions have already
898 been applied, and enumerated types converted to their compatible
902 common_type (tree t1, tree t2)
904 /* If one type is nonsense, use the other */
905 if (t1 == error_mark_node)
907 if (t2 == error_mark_node)
910 return cp_common_type (t1, t2);
913 /* Return the common type of two pointer types T1 and T2. This is the
914 type for the result of most arithmetic operations if the operands
915 have the given two types.
917 We assume that comp_target_types has already been done and returned
918 nonzero; if that isn't so, this may crash. */
921 common_pointer_type (tree t1, tree t2)
923 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
924 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
925 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
927 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
928 CPO_CONVERSION, tf_warning_or_error);
931 /* Compare two exception specifier types for exactness or subsetness, if
932 allowed. Returns false for mismatch, true for match (same, or
935 [except.spec] "If a class X ... objects of class X or any class publicly
936 and unambiguously derived from X. Similarly, if a pointer type Y * ...
937 exceptions of type Y * or that are pointers to any type publicly and
938 unambiguously derived from Y. Otherwise a function only allows exceptions
939 that have the same type ..."
940 This does not mention cv qualifiers and is different to what throw
941 [except.throw] and catch [except.catch] will do. They will ignore the
942 top level cv qualifiers, and allow qualifiers in the pointer to class
945 We implement the letter of the standard. */
948 comp_except_types (tree a, tree b, bool exact)
950 if (same_type_p (a, b))
954 if (cp_type_quals (a) || cp_type_quals (b))
957 if (TREE_CODE (a) == POINTER_TYPE
958 && TREE_CODE (b) == POINTER_TYPE)
962 if (cp_type_quals (a) || cp_type_quals (b))
966 if (TREE_CODE (a) != RECORD_TYPE
967 || TREE_CODE (b) != RECORD_TYPE)
970 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
976 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
977 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
978 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
979 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
980 are unordered, but we've already filtered out duplicates. Most lists will
981 be in order, we should try to make use of that. */
984 comp_except_specs (const_tree t1, const_tree t2, int exact)
993 /* First handle noexcept. */
994 if (exact < ce_exact)
996 /* noexcept(false) is compatible with no exception-specification,
997 and stricter than any spec. */
998 if (t1 == noexcept_false_spec)
999 return t2 == NULL_TREE || exact == ce_derived;
1000 /* Even a derived noexcept(false) is compatible with no
1001 exception-specification. */
1002 if (t2 == noexcept_false_spec)
1003 return t1 == NULL_TREE;
1005 /* Otherwise, if we aren't looking for an exact match, noexcept is
1006 equivalent to throw(). */
1007 if (t1 == noexcept_true_spec)
1008 t1 = empty_except_spec;
1009 if (t2 == noexcept_true_spec)
1010 t2 = empty_except_spec;
1013 /* If any noexcept is left, it is only comparable to itself;
1014 either we're looking for an exact match or we're redeclaring a
1015 template with dependent noexcept. */
1016 if ((t1 && TREE_PURPOSE (t1))
1017 || (t2 && TREE_PURPOSE (t2)))
1019 && cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)));
1021 if (t1 == NULL_TREE) /* T1 is ... */
1022 return t2 == NULL_TREE || exact == ce_derived;
1023 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
1024 return t2 != NULL_TREE && !TREE_VALUE (t2);
1025 if (t2 == NULL_TREE) /* T2 is ... */
1027 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1028 return exact == ce_derived;
1030 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1031 Count how many we find, to determine exactness. For exact matching and
1032 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1034 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1036 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1038 tree a = TREE_VALUE (probe);
1039 tree b = TREE_VALUE (t2);
1041 if (comp_except_types (a, b, exact))
1043 if (probe == base && exact > ce_derived)
1044 base = TREE_CHAIN (probe);
1049 if (probe == NULL_TREE)
1052 return exact == ce_derived || base == NULL_TREE || length == list_length (t1);
1055 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1056 [] can match [size]. */
1059 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1068 /* The type of the array elements must be the same. */
1069 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1072 d1 = TYPE_DOMAIN (t1);
1073 d2 = TYPE_DOMAIN (t2);
1078 /* If one of the arrays is dimensionless, and the other has a
1079 dimension, they are of different types. However, it is valid to
1087 declarations for an array object can specify
1088 array types that differ by the presence or absence of a major
1089 array bound (_dcl.array_). */
1091 return allow_redeclaration;
1093 /* Check that the dimensions are the same. */
1095 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1097 max1 = TYPE_MAX_VALUE (d1);
1098 max2 = TYPE_MAX_VALUE (d2);
1099 if (processing_template_decl && !abi_version_at_least (2)
1100 && !value_dependent_expression_p (max1)
1101 && !value_dependent_expression_p (max2))
1103 /* With abi-1 we do not fold non-dependent array bounds, (and
1104 consequently mangle them incorrectly). We must therefore
1105 fold them here, to verify the domains have the same
1111 if (!cp_tree_equal (max1, max2))
1117 /* Compare the relative position of T1 and T2 into their respective
1118 template parameter list.
1119 T1 and T2 must be template parameter types.
1120 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1123 comp_template_parms_position (tree t1, tree t2)
1125 tree index1, index2;
1126 gcc_assert (t1 && t2
1127 && TREE_CODE (t1) == TREE_CODE (t2)
1128 && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1129 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1130 || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1132 index1 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1));
1133 index2 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2));
1135 /* If T1 and T2 belong to template parm lists of different size,
1136 let's assume they are different. */
1137 if (TEMPLATE_PARM_NUM_SIBLINGS (index1)
1138 != TEMPLATE_PARM_NUM_SIBLINGS (index2))
1141 /* Then compare their relative position. */
1142 if (TEMPLATE_PARM_IDX (index1) != TEMPLATE_PARM_IDX (index2)
1143 || TEMPLATE_PARM_LEVEL (index1) != TEMPLATE_PARM_LEVEL (index2)
1144 || (TEMPLATE_PARM_PARAMETER_PACK (index1)
1145 != TEMPLATE_PARM_PARAMETER_PACK (index2)))
1151 /* Subroutine in comptypes. */
1154 structural_comptypes (tree t1, tree t2, int strict)
1159 /* Suppress errors caused by previously reported errors. */
1160 if (t1 == error_mark_node || t2 == error_mark_node)
1163 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1165 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1166 current instantiation. */
1167 if (TREE_CODE (t1) == TYPENAME_TYPE)
1168 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1170 if (TREE_CODE (t2) == TYPENAME_TYPE)
1171 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1173 if (TYPE_PTRMEMFUNC_P (t1))
1174 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1175 if (TYPE_PTRMEMFUNC_P (t2))
1176 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1178 /* Different classes of types can't be compatible. */
1179 if (TREE_CODE (t1) != TREE_CODE (t2))
1182 /* Qualifiers must match. For array types, we will check when we
1183 recur on the array element types. */
1184 if (TREE_CODE (t1) != ARRAY_TYPE
1185 && cp_type_quals (t1) != cp_type_quals (t2))
1187 if (TREE_CODE (t1) == FUNCTION_TYPE
1188 && type_memfn_quals (t1) != type_memfn_quals (t2))
1190 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1193 /* Allow for two different type nodes which have essentially the same
1194 definition. Note that we already checked for equality of the type
1195 qualifiers (just above). */
1197 if (TREE_CODE (t1) != ARRAY_TYPE
1198 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1202 /* Compare the types. Break out if they could be the same. */
1203 switch (TREE_CODE (t1))
1207 /* All void and bool types are the same. */
1211 case FIXED_POINT_TYPE:
1213 /* With these nodes, we can't determine type equivalence by
1214 looking at what is stored in the nodes themselves, because
1215 two nodes might have different TYPE_MAIN_VARIANTs but still
1216 represent the same type. For example, wchar_t and int could
1217 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1218 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1219 and are distinct types. On the other hand, int and the
1222 typedef int INT __attribute((may_alias));
1224 have identical properties, different TYPE_MAIN_VARIANTs, but
1225 represent the same type. The canonical type system keeps
1226 track of equivalence in this case, so we fall back on it. */
1227 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1229 case TEMPLATE_TEMPLATE_PARM:
1230 case BOUND_TEMPLATE_TEMPLATE_PARM:
1231 if (!comp_template_parms_position (t1, t2))
1233 if (!comp_template_parms
1234 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1235 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1237 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1239 /* Don't check inheritance. */
1240 strict = COMPARE_STRICT;
1245 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1246 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1247 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1248 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1251 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1253 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1259 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1260 strict & ~COMPARE_REDECLARATION))
1262 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1266 case REFERENCE_TYPE:
1267 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1269 /* fall through to checks for pointer types */
1272 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1273 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1274 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1280 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1282 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1287 /* Target types must match incl. qualifiers. */
1288 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1292 case TEMPLATE_TYPE_PARM:
1293 /* If T1 and T2 don't have the same relative position in their
1294 template parameters set, they can't be equal. */
1295 if (!comp_template_parms_position (t1, t2))
1300 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1301 TYPENAME_TYPE_FULLNAME (t2)))
1303 /* Qualifiers don't matter on scopes. */
1304 if (!same_type_ignoring_top_level_qualifiers_p (TYPE_CONTEXT (t1),
1309 case UNBOUND_CLASS_TEMPLATE:
1310 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1312 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1317 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1322 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1323 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1327 case TYPE_PACK_EXPANSION:
1328 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1329 PACK_EXPANSION_PATTERN (t2));
1332 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1333 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1334 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1335 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1336 || (DECLTYPE_FOR_LAMBDA_PROXY (t1)
1337 != DECLTYPE_FOR_LAMBDA_PROXY (t2))
1338 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1339 DECLTYPE_TYPE_EXPR (t2)))
1343 case UNDERLYING_TYPE:
1344 return same_type_p (UNDERLYING_TYPE_TYPE (t1),
1345 UNDERLYING_TYPE_TYPE (t2));
1351 /* If we get here, we know that from a target independent POV the
1352 types are the same. Make sure the target attributes are also
1354 return comp_type_attributes (t1, t2);
1357 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1358 is a bitwise-or of the COMPARE_* flags. */
1361 comptypes (tree t1, tree t2, int strict)
1363 if (strict == COMPARE_STRICT)
1368 if (t1 == error_mark_node || t2 == error_mark_node)
1371 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1372 /* At least one of the types requires structural equality, so
1373 perform a deep check. */
1374 return structural_comptypes (t1, t2, strict);
1376 #ifdef ENABLE_CHECKING
1377 if (USE_CANONICAL_TYPES)
1379 bool result = structural_comptypes (t1, t2, strict);
1381 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1382 /* The two types are structurally equivalent, but their
1383 canonical types were different. This is a failure of the
1384 canonical type propagation code.*/
1386 ("canonical types differ for identical types %T and %T",
1388 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1389 /* Two types are structurally different, but the canonical
1390 types are the same. This means we were over-eager in
1391 assigning canonical types. */
1393 ("same canonical type node for different types %T and %T",
1399 if (USE_CANONICAL_TYPES)
1400 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1403 return structural_comptypes (t1, t2, strict);
1405 else if (strict == COMPARE_STRUCTURAL)
1406 return structural_comptypes (t1, t2, COMPARE_STRICT);
1408 return structural_comptypes (t1, t2, strict);
1411 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1412 top-level qualifiers. */
1415 same_type_ignoring_top_level_qualifiers_p (tree type1, tree type2)
1417 if (type1 == error_mark_node || type2 == error_mark_node)
1420 return same_type_p (TYPE_MAIN_VARIANT (type1), TYPE_MAIN_VARIANT (type2));
1423 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1426 at_least_as_qualified_p (const_tree type1, const_tree type2)
1428 int q1 = cp_type_quals (type1);
1429 int q2 = cp_type_quals (type2);
1431 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1432 return (q1 & q2) == q2;
1435 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1436 more cv-qualified that TYPE1, and 0 otherwise. */
1439 comp_cv_qualification (const_tree type1, const_tree type2)
1441 int q1 = cp_type_quals (type1);
1442 int q2 = cp_type_quals (type2);
1447 if ((q1 & q2) == q2)
1449 else if ((q1 & q2) == q1)
1455 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1456 subset of the cv-qualification signature of TYPE2, and the types
1457 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1460 comp_cv_qual_signature (tree type1, tree type2)
1462 if (comp_ptr_ttypes_real (type2, type1, -1))
1464 else if (comp_ptr_ttypes_real (type1, type2, -1))
1470 /* Subroutines of `comptypes'. */
1472 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1473 equivalent in the sense that functions with those parameter types
1474 can have equivalent types. The two lists must be equivalent,
1475 element by element. */
1478 compparms (const_tree parms1, const_tree parms2)
1482 /* An unspecified parmlist matches any specified parmlist
1483 whose argument types don't need default promotions. */
1485 for (t1 = parms1, t2 = parms2;
1487 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1489 /* If one parmlist is shorter than the other,
1490 they fail to match. */
1493 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1500 /* Process a sizeof or alignof expression where the operand is a
1504 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1509 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1510 if (type == error_mark_node)
1511 return error_mark_node;
1513 type = non_reference (type);
1514 if (TREE_CODE (type) == METHOD_TYPE)
1517 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1518 "invalid application of %qs to a member function",
1519 operator_name_info[(int) op].name);
1520 value = size_one_node;
1523 dependent_p = dependent_type_p (type);
1525 complete_type (type);
1527 /* VLA types will have a non-constant size. In the body of an
1528 uninstantiated template, we don't need to try to compute the
1529 value, because the sizeof expression is not an integral
1530 constant expression in that case. And, if we do try to
1531 compute the value, we'll likely end up with SAVE_EXPRs, which
1532 the template substitution machinery does not expect to see. */
1533 || (processing_template_decl
1534 && COMPLETE_TYPE_P (type)
1535 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1537 value = build_min (op, size_type_node, type);
1538 TREE_READONLY (value) = 1;
1542 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1547 /* Return the size of the type, without producing any warnings for
1548 types whose size cannot be taken. This routine should be used only
1549 in some other routine that has already produced a diagnostic about
1550 using the size of such a type. */
1552 cxx_sizeof_nowarn (tree type)
1554 if (TREE_CODE (type) == FUNCTION_TYPE
1555 || TREE_CODE (type) == VOID_TYPE
1556 || TREE_CODE (type) == ERROR_MARK)
1557 return size_one_node;
1558 else if (!COMPLETE_TYPE_P (type))
1559 return size_zero_node;
1561 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1564 /* Process a sizeof expression where the operand is an expression. */
1567 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1569 if (e == error_mark_node)
1570 return error_mark_node;
1572 if (processing_template_decl)
1574 e = build_min (SIZEOF_EXPR, size_type_node, e);
1575 TREE_SIDE_EFFECTS (e) = 0;
1576 TREE_READONLY (e) = 1;
1581 /* To get the size of a static data member declared as an array of
1582 unknown bound, we need to instantiate it. */
1583 if (TREE_CODE (e) == VAR_DECL
1584 && VAR_HAD_UNKNOWN_BOUND (e)
1585 && DECL_TEMPLATE_INSTANTIATION (e))
1586 instantiate_decl (e, /*defer_ok*/true, /*expl_inst_mem*/false);
1588 e = mark_type_use (e);
1590 if (TREE_CODE (e) == COMPONENT_REF
1591 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1592 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1594 if (complain & tf_error)
1595 error ("invalid application of %<sizeof%> to a bit-field");
1597 return error_mark_node;
1600 else if (is_overloaded_fn (e))
1602 if (complain & tf_error)
1603 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1606 return error_mark_node;
1609 else if (type_unknown_p (e))
1611 if (complain & tf_error)
1612 cxx_incomplete_type_error (e, TREE_TYPE (e));
1614 return error_mark_node;
1620 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1623 /* Implement the __alignof keyword: Return the minimum required
1624 alignment of E, measured in bytes. For VAR_DECL's and
1625 FIELD_DECL's return DECL_ALIGN (which can be set from an
1626 "aligned" __attribute__ specification). */
1629 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1633 if (e == error_mark_node)
1634 return error_mark_node;
1636 if (processing_template_decl)
1638 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1639 TREE_SIDE_EFFECTS (e) = 0;
1640 TREE_READONLY (e) = 1;
1645 e = mark_type_use (e);
1647 if (TREE_CODE (e) == VAR_DECL)
1648 t = size_int (DECL_ALIGN_UNIT (e));
1649 else if (TREE_CODE (e) == COMPONENT_REF
1650 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1651 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1653 if (complain & tf_error)
1654 error ("invalid application of %<__alignof%> to a bit-field");
1656 return error_mark_node;
1659 else if (TREE_CODE (e) == COMPONENT_REF
1660 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1661 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1662 else if (is_overloaded_fn (e))
1664 if (complain & tf_error)
1665 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1668 return error_mark_node;
1669 if (TREE_CODE (e) == FUNCTION_DECL)
1670 t = size_int (DECL_ALIGN_UNIT (e));
1674 else if (type_unknown_p (e))
1676 if (complain & tf_error)
1677 cxx_incomplete_type_error (e, TREE_TYPE (e));
1679 return error_mark_node;
1683 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1684 complain & tf_error);
1686 return fold_convert (size_type_node, t);
1689 /* Process a sizeof or alignof expression E with code OP where the operand
1690 is an expression. */
1693 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1695 if (op == SIZEOF_EXPR)
1696 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1698 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1701 /* EXPR is being used in a context that is not a function call.
1706 The expression can be used only as the left-hand operand of a
1707 member function call.
1709 [expr.mptr.operator]
1711 If the result of .* or ->* is a function, then that result can be
1712 used only as the operand for the function call operator ().
1714 by issuing an error message if appropriate. Returns true iff EXPR
1715 violates these rules. */
1718 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1720 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1722 if (complain & tf_error)
1723 error ("invalid use of non-static member function");
1729 /* If EXP is a reference to a bitfield, and the type of EXP does not
1730 match the declared type of the bitfield, return the declared type
1731 of the bitfield. Otherwise, return NULL_TREE. */
1734 is_bitfield_expr_with_lowered_type (const_tree exp)
1736 switch (TREE_CODE (exp))
1739 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1740 ? TREE_OPERAND (exp, 1)
1741 : TREE_OPERAND (exp, 0)))
1743 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1746 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1750 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1756 field = TREE_OPERAND (exp, 1);
1757 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1759 if (same_type_ignoring_top_level_qualifiers_p
1760 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1762 return DECL_BIT_FIELD_TYPE (field);
1766 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1767 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1768 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1776 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1777 bitfield with a lowered type, the type of EXP is returned, rather
1781 unlowered_expr_type (const_tree exp)
1784 tree etype = TREE_TYPE (exp);
1786 type = is_bitfield_expr_with_lowered_type (exp);
1788 type = cp_build_qualified_type (type, cp_type_quals (etype));
1795 /* Perform the conversions in [expr] that apply when an lvalue appears
1796 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1797 function-to-pointer conversions. In addition, manifest constants
1798 are replaced by their values, and bitfield references are converted
1799 to their declared types. Note that this function does not perform the
1800 lvalue-to-rvalue conversion for class types. If you need that conversion
1801 to for class types, then you probably need to use force_rvalue.
1803 Although the returned value is being used as an rvalue, this
1804 function does not wrap the returned expression in a
1805 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1806 that the return value is no longer an lvalue. */
1809 decay_conversion (tree exp)
1812 enum tree_code code;
1814 type = TREE_TYPE (exp);
1815 if (type == error_mark_node)
1816 return error_mark_node;
1818 exp = mark_rvalue_use (exp);
1820 exp = resolve_nondeduced_context (exp);
1821 if (type_unknown_p (exp))
1823 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1824 return error_mark_node;
1827 /* FIXME remove? at least need to remember that this isn't really a
1828 constant expression if EXP isn't decl_constant_var_p, like with
1829 C_MAYBE_CONST_EXPR. */
1830 exp = decl_constant_value_safe (exp);
1831 if (error_operand_p (exp))
1832 return error_mark_node;
1834 if (NULLPTR_TYPE_P (type))
1835 return nullptr_node;
1837 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1838 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1839 code = TREE_CODE (type);
1840 if (code == VOID_TYPE)
1842 error ("void value not ignored as it ought to be");
1843 return error_mark_node;
1845 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1846 return error_mark_node;
1847 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1848 return cp_build_addr_expr (exp, tf_warning_or_error);
1849 if (code == ARRAY_TYPE)
1854 if (TREE_CODE (exp) == INDIRECT_REF)
1855 return build_nop (build_pointer_type (TREE_TYPE (type)),
1856 TREE_OPERAND (exp, 0));
1858 if (TREE_CODE (exp) == COMPOUND_EXPR)
1860 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1861 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1862 TREE_OPERAND (exp, 0), op1);
1866 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1868 error ("invalid use of non-lvalue array");
1869 return error_mark_node;
1872 ptrtype = build_pointer_type (TREE_TYPE (type));
1874 if (TREE_CODE (exp) == VAR_DECL)
1876 if (!cxx_mark_addressable (exp))
1877 return error_mark_node;
1878 adr = build_nop (ptrtype, build_address (exp));
1881 /* This way is better for a COMPONENT_REF since it can
1882 simplify the offset for a component. */
1883 adr = cp_build_addr_expr (exp, tf_warning_or_error);
1884 return cp_convert (ptrtype, adr);
1887 /* If a bitfield is used in a context where integral promotion
1888 applies, then the caller is expected to have used
1889 default_conversion. That function promotes bitfields correctly
1890 before calling this function. At this point, if we have a
1891 bitfield referenced, we may assume that is not subject to
1892 promotion, and that, therefore, the type of the resulting rvalue
1893 is the declared type of the bitfield. */
1894 exp = convert_bitfield_to_declared_type (exp);
1896 /* We do not call rvalue() here because we do not want to wrap EXP
1897 in a NON_LVALUE_EXPR. */
1901 Non-class rvalues always have cv-unqualified types. */
1902 type = TREE_TYPE (exp);
1903 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
1904 exp = build_nop (cv_unqualified (type), exp);
1909 /* Perform preparatory conversions, as part of the "usual arithmetic
1910 conversions". In particular, as per [expr]:
1912 Whenever an lvalue expression appears as an operand of an
1913 operator that expects the rvalue for that operand, the
1914 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1915 standard conversions are applied to convert the expression to an
1918 In addition, we perform integral promotions here, as those are
1919 applied to both operands to a binary operator before determining
1920 what additional conversions should apply. */
1923 default_conversion (tree exp)
1925 /* Check for target-specific promotions. */
1926 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
1928 exp = cp_convert (promoted_type, exp);
1929 /* Perform the integral promotions first so that bitfield
1930 expressions (which may promote to "int", even if the bitfield is
1931 declared "unsigned") are promoted correctly. */
1932 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1933 exp = perform_integral_promotions (exp);
1934 /* Perform the other conversions. */
1935 exp = decay_conversion (exp);
1940 /* EXPR is an expression with an integral or enumeration type.
1941 Perform the integral promotions in [conv.prom], and return the
1945 perform_integral_promotions (tree expr)
1950 expr = mark_rvalue_use (expr);
1954 If the bitfield has an enumerated type, it is treated as any
1955 other value of that type for promotion purposes. */
1956 type = is_bitfield_expr_with_lowered_type (expr);
1957 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
1958 type = TREE_TYPE (expr);
1959 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1960 /* Scoped enums don't promote. */
1961 if (SCOPED_ENUM_P (type))
1963 promoted_type = type_promotes_to (type);
1964 if (type != promoted_type)
1965 expr = cp_convert (promoted_type, expr);
1969 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1970 decay_conversion to one. */
1973 string_conv_p (const_tree totype, const_tree exp, int warn)
1977 if (TREE_CODE (totype) != POINTER_TYPE)
1980 t = TREE_TYPE (totype);
1981 if (!same_type_p (t, char_type_node)
1982 && !same_type_p (t, char16_type_node)
1983 && !same_type_p (t, char32_type_node)
1984 && !same_type_p (t, wchar_type_node))
1987 if (TREE_CODE (exp) == STRING_CST)
1989 /* Make sure that we don't try to convert between char and wide chars. */
1990 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1995 /* Is this a string constant which has decayed to 'const char *'? */
1996 t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
1997 if (!same_type_p (TREE_TYPE (exp), t))
2000 if (TREE_CODE (exp) != ADDR_EXPR
2001 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
2005 /* This warning is not very useful, as it complains about printf. */
2007 warning (OPT_Wwrite_strings,
2008 "deprecated conversion from string constant to %qT",
2014 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2015 can, for example, use as an lvalue. This code used to be in
2016 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2017 expressions, where we're dealing with aggregates. But now it's again only
2018 called from unary_complex_lvalue. The case (in particular) that led to
2019 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2023 rationalize_conditional_expr (enum tree_code code, tree t,
2024 tsubst_flags_t complain)
2026 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2027 the first operand is always the one to be used if both operands
2028 are equal, so we know what conditional expression this used to be. */
2029 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2031 tree op0 = TREE_OPERAND (t, 0);
2032 tree op1 = TREE_OPERAND (t, 1);
2034 /* The following code is incorrect if either operand side-effects. */
2035 gcc_assert (!TREE_SIDE_EFFECTS (op0)
2036 && !TREE_SIDE_EFFECTS (op1));
2038 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
2039 ? LE_EXPR : GE_EXPR),
2040 op0, TREE_CODE (op0),
2041 op1, TREE_CODE (op1),
2044 cp_build_unary_op (code, op0, 0, complain),
2045 cp_build_unary_op (code, op1, 0, complain),
2050 build_conditional_expr (TREE_OPERAND (t, 0),
2051 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
2053 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
2058 /* Given the TYPE of an anonymous union field inside T, return the
2059 FIELD_DECL for the field. If not found return NULL_TREE. Because
2060 anonymous unions can nest, we must also search all anonymous unions
2061 that are directly reachable. */
2064 lookup_anon_field (tree t, tree type)
2068 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
2070 if (TREE_STATIC (field))
2072 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
2075 /* If we find it directly, return the field. */
2076 if (DECL_NAME (field) == NULL_TREE
2077 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
2082 /* Otherwise, it could be nested, search harder. */
2083 if (DECL_NAME (field) == NULL_TREE
2084 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2086 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2094 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2095 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2096 non-NULL, it indicates the path to the base used to name MEMBER.
2097 If PRESERVE_REFERENCE is true, the expression returned will have
2098 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2099 returned will have the type referred to by the reference.
2101 This function does not perform access control; that is either done
2102 earlier by the parser when the name of MEMBER is resolved to MEMBER
2103 itself, or later when overload resolution selects one of the
2104 functions indicated by MEMBER. */
2107 build_class_member_access_expr (tree object, tree member,
2108 tree access_path, bool preserve_reference,
2109 tsubst_flags_t complain)
2113 tree result = NULL_TREE;
2115 if (error_operand_p (object) || error_operand_p (member))
2116 return error_mark_node;
2118 gcc_assert (DECL_P (member) || BASELINK_P (member));
2122 The type of the first expression shall be "class object" (of a
2124 object_type = TREE_TYPE (object);
2125 if (!currently_open_class (object_type)
2126 && !complete_type_or_maybe_complain (object_type, object, complain))
2127 return error_mark_node;
2128 if (!CLASS_TYPE_P (object_type))
2130 if (complain & tf_error)
2132 if (POINTER_TYPE_P (object_type)
2133 && CLASS_TYPE_P (TREE_TYPE (object_type)))
2134 error ("request for member %qD in %qE, which is of pointer "
2135 "type %qT (maybe you meant to use %<->%> ?)",
2136 member, object, object_type);
2138 error ("request for member %qD in %qE, which is of non-class "
2139 "type %qT", member, object, object_type);
2141 return error_mark_node;
2144 /* The standard does not seem to actually say that MEMBER must be a
2145 member of OBJECT_TYPE. However, that is clearly what is
2147 if (DECL_P (member))
2149 member_scope = DECL_CLASS_CONTEXT (member);
2151 if (TREE_DEPRECATED (member))
2152 warn_deprecated_use (member, NULL_TREE);
2155 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2156 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2157 presently be the anonymous union. Go outwards until we find a
2158 type related to OBJECT_TYPE. */
2159 while (ANON_AGGR_TYPE_P (member_scope)
2160 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2162 member_scope = TYPE_CONTEXT (member_scope);
2163 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2165 if (complain & tf_error)
2167 if (TREE_CODE (member) == FIELD_DECL)
2168 error ("invalid use of nonstatic data member %qE", member);
2170 error ("%qD is not a member of %qT", member, object_type);
2172 return error_mark_node;
2175 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2176 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2177 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2179 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2181 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2184 /* In [expr.ref], there is an explicit list of the valid choices for
2185 MEMBER. We check for each of those cases here. */
2186 if (TREE_CODE (member) == VAR_DECL)
2188 /* A static data member. */
2190 mark_exp_read (object);
2191 /* If OBJECT has side-effects, they are supposed to occur. */
2192 if (TREE_SIDE_EFFECTS (object))
2193 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2195 else if (TREE_CODE (member) == FIELD_DECL)
2197 /* A non-static data member. */
2202 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2203 && integer_zerop (TREE_OPERAND (object, 0)));
2205 /* Convert OBJECT to the type of MEMBER. */
2206 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2207 TYPE_MAIN_VARIANT (member_scope)))
2212 binfo = lookup_base (access_path ? access_path : object_type,
2213 member_scope, ba_unique, &kind);
2214 if (binfo == error_mark_node)
2215 return error_mark_node;
2217 /* It is invalid to try to get to a virtual base of a
2218 NULL object. The most common cause is invalid use of
2220 if (null_object_p && kind == bk_via_virtual)
2222 if (complain & tf_error)
2224 error ("invalid access to non-static data member %qD of "
2227 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2229 return error_mark_node;
2232 /* Convert to the base. */
2233 object = build_base_path (PLUS_EXPR, object, binfo,
2234 /*nonnull=*/1, complain);
2235 /* If we found the base successfully then we should be able
2236 to convert to it successfully. */
2237 gcc_assert (object != error_mark_node);
2240 /* Complain about other invalid uses of offsetof, even though they will
2241 give the right answer. Note that we complain whether or not they
2242 actually used the offsetof macro, since there's no way to know at this
2243 point. So we just give a warning, instead of a pedwarn. */
2244 /* Do not produce this warning for base class field references, because
2245 we know for a fact that didn't come from offsetof. This does occur
2246 in various testsuite cases where a null object is passed where a
2247 vtable access is required. */
2248 if (null_object_p && warn_invalid_offsetof
2249 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2250 && !DECL_FIELD_IS_BASE (member)
2251 && cp_unevaluated_operand == 0
2252 && (complain & tf_warning))
2254 warning (OPT_Winvalid_offsetof,
2255 "invalid access to non-static data member %qD "
2256 " of NULL object", member);
2257 warning (OPT_Winvalid_offsetof,
2258 "(perhaps the %<offsetof%> macro was used incorrectly)");
2261 /* If MEMBER is from an anonymous aggregate, we have converted
2262 OBJECT so that it refers to the class containing the
2263 anonymous union. Generate a reference to the anonymous union
2264 itself, and recur to find MEMBER. */
2265 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2266 /* When this code is called from build_field_call, the
2267 object already has the type of the anonymous union.
2268 That is because the COMPONENT_REF was already
2269 constructed, and was then disassembled before calling
2270 build_field_call. After the function-call code is
2271 cleaned up, this waste can be eliminated. */
2272 && (!same_type_ignoring_top_level_qualifiers_p
2273 (TREE_TYPE (object), DECL_CONTEXT (member))))
2275 tree anonymous_union;
2277 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2278 DECL_CONTEXT (member));
2279 object = build_class_member_access_expr (object,
2281 /*access_path=*/NULL_TREE,
2286 /* Compute the type of the field, as described in [expr.ref]. */
2287 type_quals = TYPE_UNQUALIFIED;
2288 member_type = TREE_TYPE (member);
2289 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2291 type_quals = (cp_type_quals (member_type)
2292 | cp_type_quals (object_type));
2294 /* A field is const (volatile) if the enclosing object, or the
2295 field itself, is const (volatile). But, a mutable field is
2296 not const, even within a const object. */
2297 if (DECL_MUTABLE_P (member))
2298 type_quals &= ~TYPE_QUAL_CONST;
2299 member_type = cp_build_qualified_type (member_type, type_quals);
2302 result = build3 (COMPONENT_REF, member_type, object, member,
2304 result = fold_if_not_in_template (result);
2306 /* Mark the expression const or volatile, as appropriate. Even
2307 though we've dealt with the type above, we still have to mark the
2308 expression itself. */
2309 if (type_quals & TYPE_QUAL_CONST)
2310 TREE_READONLY (result) = 1;
2311 if (type_quals & TYPE_QUAL_VOLATILE)
2312 TREE_THIS_VOLATILE (result) = 1;
2314 else if (BASELINK_P (member))
2316 /* The member is a (possibly overloaded) member function. */
2320 /* If the MEMBER is exactly one static member function, then we
2321 know the type of the expression. Otherwise, we must wait
2322 until overload resolution has been performed. */
2323 functions = BASELINK_FUNCTIONS (member);
2324 if (TREE_CODE (functions) == FUNCTION_DECL
2325 && DECL_STATIC_FUNCTION_P (functions))
2326 type = TREE_TYPE (functions);
2328 type = unknown_type_node;
2329 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2330 base. That will happen when the function is called. */
2331 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2333 else if (TREE_CODE (member) == CONST_DECL)
2335 /* The member is an enumerator. */
2337 /* If OBJECT has side-effects, they are supposed to occur. */
2338 if (TREE_SIDE_EFFECTS (object))
2339 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2344 if (complain & tf_error)
2345 error ("invalid use of %qD", member);
2346 return error_mark_node;
2349 if (!preserve_reference)
2352 If E2 is declared to have type "reference to T", then ... the
2353 type of E1.E2 is T. */
2354 result = convert_from_reference (result);
2359 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2360 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2363 lookup_destructor (tree object, tree scope, tree dtor_name)
2365 tree object_type = TREE_TYPE (object);
2366 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2369 if (scope && !check_dtor_name (scope, dtor_type))
2371 error ("qualified type %qT does not match destructor name ~%qT",
2373 return error_mark_node;
2375 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2377 /* In a template, names we can't find a match for are still accepted
2378 destructor names, and we check them here. */
2379 if (check_dtor_name (object_type, dtor_type))
2380 dtor_type = object_type;
2383 error ("object type %qT does not match destructor name ~%qT",
2384 object_type, dtor_type);
2385 return error_mark_node;
2389 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2391 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2392 TYPE_MAIN_VARIANT (object_type), dtor_type);
2393 return error_mark_node;
2395 expr = lookup_member (dtor_type, complete_dtor_identifier,
2396 /*protect=*/1, /*want_type=*/false);
2397 expr = (adjust_result_of_qualified_name_lookup
2398 (expr, dtor_type, object_type));
2402 /* An expression of the form "A::template B" has been resolved to
2403 DECL. Issue a diagnostic if B is not a template or template
2407 check_template_keyword (tree decl)
2409 /* The standard says:
2413 If a name prefixed by the keyword template is not a member
2414 template, the program is ill-formed.
2416 DR 228 removed the restriction that the template be a member
2419 DR 96, if accepted would add the further restriction that explicit
2420 template arguments must be provided if the template keyword is
2421 used, but, as of 2005-10-16, that DR is still in "drafting". If
2422 this DR is accepted, then the semantic checks here can be
2423 simplified, as the entity named must in fact be a template
2424 specialization, rather than, as at present, a set of overloaded
2425 functions containing at least one template function. */
2426 if (TREE_CODE (decl) != TEMPLATE_DECL
2427 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2429 if (!is_overloaded_fn (decl))
2430 permerror (input_location, "%qD is not a template", decl);
2435 if (BASELINK_P (fns))
2436 fns = BASELINK_FUNCTIONS (fns);
2439 tree fn = OVL_CURRENT (fns);
2440 if (TREE_CODE (fn) == TEMPLATE_DECL
2441 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2443 if (TREE_CODE (fn) == FUNCTION_DECL
2444 && DECL_USE_TEMPLATE (fn)
2445 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2447 fns = OVL_NEXT (fns);
2450 permerror (input_location, "%qD is not a template", decl);
2455 /* This function is called by the parser to process a class member
2456 access expression of the form OBJECT.NAME. NAME is a node used by
2457 the parser to represent a name; it is not yet a DECL. It may,
2458 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2459 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2460 there is no reason to do the lookup twice, so the parser keeps the
2461 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2462 be a template via the use of the "A::template B" syntax. */
2465 finish_class_member_access_expr (tree object, tree name, bool template_p,
2466 tsubst_flags_t complain)
2471 tree access_path = NULL_TREE;
2472 tree orig_object = object;
2473 tree orig_name = name;
2475 if (object == error_mark_node || name == error_mark_node)
2476 return error_mark_node;
2478 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2479 if (!objc_is_public (object, name))
2480 return error_mark_node;
2482 object_type = TREE_TYPE (object);
2484 if (processing_template_decl)
2486 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2487 dependent_type_p (object_type)
2488 /* If NAME is just an IDENTIFIER_NODE, then the expression
2490 || TREE_CODE (object) == IDENTIFIER_NODE
2491 /* If NAME is "f<args>", where either 'f' or 'args' is
2492 dependent, then the expression is dependent. */
2493 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2494 && dependent_template_id_p (TREE_OPERAND (name, 0),
2495 TREE_OPERAND (name, 1)))
2496 /* If NAME is "T::X" where "T" is dependent, then the
2497 expression is dependent. */
2498 || (TREE_CODE (name) == SCOPE_REF
2499 && TYPE_P (TREE_OPERAND (name, 0))
2500 && dependent_type_p (TREE_OPERAND (name, 0))))
2501 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2502 object = build_non_dependent_expr (object);
2504 else if (c_dialect_objc ()
2505 && TREE_CODE (name) == IDENTIFIER_NODE
2506 && (expr = objc_maybe_build_component_ref (object, name)))
2511 The type of the first expression shall be "class object" (of a
2513 if (!currently_open_class (object_type)
2514 && !complete_type_or_maybe_complain (object_type, object, complain))
2515 return error_mark_node;
2516 if (!CLASS_TYPE_P (object_type))
2518 if (complain & tf_error)
2520 if (POINTER_TYPE_P (object_type)
2521 && CLASS_TYPE_P (TREE_TYPE (object_type)))
2522 error ("request for member %qD in %qE, which is of pointer "
2523 "type %qT (maybe you meant to use %<->%> ?)",
2524 name, object, object_type);
2526 error ("request for member %qD in %qE, which is of non-class "
2527 "type %qT", name, object, object_type);
2529 return error_mark_node;
2532 if (BASELINK_P (name))
2533 /* A member function that has already been looked up. */
2537 bool is_template_id = false;
2538 tree template_args = NULL_TREE;
2541 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2543 is_template_id = true;
2544 template_args = TREE_OPERAND (name, 1);
2545 name = TREE_OPERAND (name, 0);
2547 if (TREE_CODE (name) == OVERLOAD)
2548 name = DECL_NAME (get_first_fn (name));
2549 else if (DECL_P (name))
2550 name = DECL_NAME (name);
2553 if (TREE_CODE (name) == SCOPE_REF)
2555 /* A qualified name. The qualifying class or namespace `S'
2556 has already been looked up; it is either a TYPE or a
2558 scope = TREE_OPERAND (name, 0);
2559 name = TREE_OPERAND (name, 1);
2561 /* If SCOPE is a namespace, then the qualified name does not
2562 name a member of OBJECT_TYPE. */
2563 if (TREE_CODE (scope) == NAMESPACE_DECL)
2565 if (complain & tf_error)
2566 error ("%<%D::%D%> is not a member of %qT",
2567 scope, name, object_type);
2568 return error_mark_node;
2571 gcc_assert (CLASS_TYPE_P (scope));
2572 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2573 || TREE_CODE (name) == BIT_NOT_EXPR);
2575 if (constructor_name_p (name, scope))
2577 if (complain & tf_error)
2578 error ("cannot call constructor %<%T::%D%> directly",
2580 return error_mark_node;
2583 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2584 access_path = lookup_base (object_type, scope, ba_check, NULL);
2585 if (access_path == error_mark_node)
2586 return error_mark_node;
2589 if (complain & tf_error)
2590 error ("%qT is not a base of %qT", scope, object_type);
2591 return error_mark_node;
2597 access_path = object_type;
2600 if (TREE_CODE (name) == BIT_NOT_EXPR)
2601 member = lookup_destructor (object, scope, name);
2604 /* Look up the member. */
2605 member = lookup_member (access_path, name, /*protect=*/1,
2606 /*want_type=*/false);
2607 if (member == NULL_TREE)
2609 if (complain & tf_error)
2610 error ("%qD has no member named %qE",
2611 TREE_CODE (access_path) == TREE_BINFO
2612 ? TREE_TYPE (access_path) : object_type, name);
2613 return error_mark_node;
2615 if (member == error_mark_node)
2616 return error_mark_node;
2621 tree templ = member;
2623 if (BASELINK_P (templ))
2624 templ = lookup_template_function (templ, template_args);
2627 if (complain & tf_error)
2628 error ("%qD is not a member template function", name);
2629 return error_mark_node;
2634 if (TREE_DEPRECATED (member))
2635 warn_deprecated_use (member, NULL_TREE);
2638 check_template_keyword (member);
2640 expr = build_class_member_access_expr (object, member, access_path,
2641 /*preserve_reference=*/false,
2643 if (processing_template_decl && expr != error_mark_node)
2645 if (BASELINK_P (member))
2647 if (TREE_CODE (orig_name) == SCOPE_REF)
2648 BASELINK_QUALIFIED_P (member) = 1;
2651 return build_min_non_dep (COMPONENT_REF, expr,
2652 orig_object, orig_name,
2659 /* Return an expression for the MEMBER_NAME field in the internal
2660 representation of PTRMEM, a pointer-to-member function. (Each
2661 pointer-to-member function type gets its own RECORD_TYPE so it is
2662 more convenient to access the fields by name than by FIELD_DECL.)
2663 This routine converts the NAME to a FIELD_DECL and then creates the
2664 node for the complete expression. */
2667 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2673 /* This code is a stripped down version of
2674 build_class_member_access_expr. It does not work to use that
2675 routine directly because it expects the object to be of class
2677 ptrmem_type = TREE_TYPE (ptrmem);
2678 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2679 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2680 /*want_type=*/false);
2681 member_type = cp_build_qualified_type (TREE_TYPE (member),
2682 cp_type_quals (ptrmem_type));
2683 return fold_build3_loc (input_location,
2684 COMPONENT_REF, member_type,
2685 ptrmem, member, NULL_TREE);
2688 /* Given an expression PTR for a pointer, return an expression
2689 for the value pointed to.
2690 ERRORSTRING is the name of the operator to appear in error messages.
2692 This function may need to overload OPERATOR_FNNAME.
2693 Must also handle REFERENCE_TYPEs for C++. */
2696 build_x_indirect_ref (tree expr, ref_operator errorstring,
2697 tsubst_flags_t complain)
2699 tree orig_expr = expr;
2702 if (processing_template_decl)
2704 /* Retain the type if we know the operand is a pointer. */
2705 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2706 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2707 if (type_dependent_expression_p (expr))
2708 return build_min_nt (INDIRECT_REF, expr);
2709 expr = build_non_dependent_expr (expr);
2712 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2713 NULL_TREE, /*overload=*/NULL, complain);
2715 rval = cp_build_indirect_ref (expr, errorstring, complain);
2717 if (processing_template_decl && rval != error_mark_node)
2718 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2723 /* Helper function called from c-common. */
2725 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2726 tree ptr, ref_operator errorstring)
2728 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2732 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2733 tsubst_flags_t complain)
2737 if (ptr == error_mark_node)
2738 return error_mark_node;
2740 if (ptr == current_class_ptr)
2741 return current_class_ref;
2743 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2744 ? ptr : decay_conversion (ptr));
2745 type = TREE_TYPE (pointer);
2747 if (POINTER_TYPE_P (type))
2751 If the type of the expression is "pointer to T," the type
2752 of the result is "T." */
2753 tree t = TREE_TYPE (type);
2755 if (CONVERT_EXPR_P (ptr)
2756 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2758 /* If a warning is issued, mark it to avoid duplicates from
2759 the backend. This only needs to be done at
2760 warn_strict_aliasing > 2. */
2761 if (warn_strict_aliasing > 2)
2762 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2763 type, TREE_OPERAND (ptr, 0)))
2764 TREE_NO_WARNING (ptr) = 1;
2767 if (VOID_TYPE_P (t))
2769 /* A pointer to incomplete type (other than cv void) can be
2770 dereferenced [expr.unary.op]/1 */
2771 if (complain & tf_error)
2772 error ("%qT is not a pointer-to-object type", type);
2773 return error_mark_node;
2775 else if (TREE_CODE (pointer) == ADDR_EXPR
2776 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2777 /* The POINTER was something like `&x'. We simplify `*&x' to
2779 return TREE_OPERAND (pointer, 0);
2782 tree ref = build1 (INDIRECT_REF, t, pointer);
2784 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2785 so that we get the proper error message if the result is used
2786 to assign to. Also, &* is supposed to be a no-op. */
2787 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2788 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2789 TREE_SIDE_EFFECTS (ref)
2790 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2794 else if (!(complain & tf_error))
2795 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2797 /* `pointer' won't be an error_mark_node if we were given a
2798 pointer to member, so it's cool to check for this here. */
2799 else if (TYPE_PTR_TO_MEMBER_P (type))
2800 switch (errorstring)
2802 case RO_ARRAY_INDEXING:
2803 error ("invalid use of array indexing on pointer to member");
2806 error ("invalid use of unary %<*%> on pointer to member");
2808 case RO_IMPLICIT_CONVERSION:
2809 error ("invalid use of implicit conversion on pointer to member");
2814 else if (pointer != error_mark_node)
2815 invalid_indirection_error (input_location, type, errorstring);
2817 return error_mark_node;
2820 /* This handles expressions of the form "a[i]", which denotes
2823 This is logically equivalent in C to *(a+i), but we may do it differently.
2824 If A is a variable or a member, we generate a primitive ARRAY_REF.
2825 This avoids forcing the array out of registers, and can work on
2826 arrays that are not lvalues (for example, members of structures returned
2829 If INDEX is of some user-defined type, it must be converted to
2830 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2831 will inherit the type of the array, which will be some pointer type.
2833 LOC is the location to use in building the array reference. */
2836 cp_build_array_ref (location_t loc, tree array, tree idx,
2837 tsubst_flags_t complain)
2843 if (complain & tf_error)
2844 error_at (loc, "subscript missing in array reference");
2845 return error_mark_node;
2848 if (TREE_TYPE (array) == error_mark_node
2849 || TREE_TYPE (idx) == error_mark_node)
2850 return error_mark_node;
2852 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2854 switch (TREE_CODE (array))
2858 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2860 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2861 TREE_OPERAND (array, 0), value);
2862 SET_EXPR_LOCATION (ret, loc);
2867 ret = build_conditional_expr
2868 (TREE_OPERAND (array, 0),
2869 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2871 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
2873 tf_warning_or_error);
2874 protected_set_expr_location (ret, loc);
2881 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2885 warn_array_subscript_with_type_char (idx);
2887 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2889 if (complain & tf_error)
2890 error_at (loc, "array subscript is not an integer");
2891 return error_mark_node;
2894 /* Apply integral promotions *after* noticing character types.
2895 (It is unclear why we do these promotions -- the standard
2896 does not say that we should. In fact, the natural thing would
2897 seem to be to convert IDX to ptrdiff_t; we're performing
2898 pointer arithmetic.) */
2899 idx = perform_integral_promotions (idx);
2901 /* An array that is indexed by a non-constant
2902 cannot be stored in a register; we must be able to do
2903 address arithmetic on its address.
2904 Likewise an array of elements of variable size. */
2905 if (TREE_CODE (idx) != INTEGER_CST
2906 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2907 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2910 if (!cxx_mark_addressable (array))
2911 return error_mark_node;
2914 /* An array that is indexed by a constant value which is not within
2915 the array bounds cannot be stored in a register either; because we
2916 would get a crash in store_bit_field/extract_bit_field when trying
2917 to access a non-existent part of the register. */
2918 if (TREE_CODE (idx) == INTEGER_CST
2919 && TYPE_DOMAIN (TREE_TYPE (array))
2920 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2922 if (!cxx_mark_addressable (array))
2923 return error_mark_node;
2926 if (!lvalue_p (array) && (complain & tf_error))
2927 pedwarn (loc, OPT_pedantic,
2928 "ISO C++ forbids subscripting non-lvalue array");
2930 /* Note in C++ it is valid to subscript a `register' array, since
2931 it is valid to take the address of something with that
2932 storage specification. */
2936 while (TREE_CODE (foo) == COMPONENT_REF)
2937 foo = TREE_OPERAND (foo, 0);
2938 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)
2939 && (complain & tf_warning))
2940 warning_at (loc, OPT_Wextra,
2941 "subscripting array declared %<register%>");
2944 type = TREE_TYPE (TREE_TYPE (array));
2945 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2946 /* Array ref is const/volatile if the array elements are
2947 or if the array is.. */
2948 TREE_READONLY (rval)
2949 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2950 TREE_SIDE_EFFECTS (rval)
2951 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2952 TREE_THIS_VOLATILE (rval)
2953 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2954 ret = require_complete_type_sfinae (fold_if_not_in_template (rval),
2956 protected_set_expr_location (ret, loc);
2961 tree ar = default_conversion (array);
2962 tree ind = default_conversion (idx);
2964 /* Put the integer in IND to simplify error checking. */
2965 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2972 if (ar == error_mark_node)
2975 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2977 if (complain & tf_error)
2978 error_at (loc, "subscripted value is neither array nor pointer");
2979 return error_mark_node;
2981 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2983 if (complain & tf_error)
2984 error_at (loc, "array subscript is not an integer");
2985 return error_mark_node;
2988 warn_array_subscript_with_type_char (idx);
2990 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
2995 protected_set_expr_location (ret, loc);
3000 /* Entry point for Obj-C++. */
3003 build_array_ref (location_t loc, tree array, tree idx)
3005 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
3008 /* Resolve a pointer to member function. INSTANCE is the object
3009 instance to use, if the member points to a virtual member.
3011 This used to avoid checking for virtual functions if basetype
3012 has no virtual functions, according to an earlier ANSI draft.
3013 With the final ISO C++ rules, such an optimization is
3014 incorrect: A pointer to a derived member can be static_cast
3015 to pointer-to-base-member, as long as the dynamic object
3016 later has the right member. */
3019 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
3021 if (TREE_CODE (function) == OFFSET_REF)
3022 function = TREE_OPERAND (function, 1);
3024 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
3026 tree idx, delta, e1, e2, e3, vtbl, basetype;
3027 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
3029 tree instance_ptr = *instance_ptrptr;
3030 tree instance_save_expr = 0;
3031 if (instance_ptr == error_mark_node)
3033 if (TREE_CODE (function) == PTRMEM_CST)
3035 /* Extracting the function address from a pmf is only
3036 allowed with -Wno-pmf-conversions. It only works for
3038 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
3039 e1 = convert (fntype, e1);
3044 error ("object missing in use of %qE", function);
3045 return error_mark_node;
3049 if (TREE_SIDE_EFFECTS (instance_ptr))
3050 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3052 if (TREE_SIDE_EFFECTS (function))
3053 function = save_expr (function);
3055 /* Start by extracting all the information from the PMF itself. */
3056 e3 = pfn_from_ptrmemfunc (function);
3057 delta = delta_from_ptrmemfunc (function);
3058 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3059 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3061 case ptrmemfunc_vbit_in_pfn:
3062 e1 = cp_build_binary_op (input_location,
3063 BIT_AND_EXPR, idx, integer_one_node,
3064 tf_warning_or_error);
3065 idx = cp_build_binary_op (input_location,
3066 MINUS_EXPR, idx, integer_one_node,
3067 tf_warning_or_error);
3070 case ptrmemfunc_vbit_in_delta:
3071 e1 = cp_build_binary_op (input_location,
3072 BIT_AND_EXPR, delta, integer_one_node,
3073 tf_warning_or_error);
3074 delta = cp_build_binary_op (input_location,
3075 RSHIFT_EXPR, delta, integer_one_node,
3076 tf_warning_or_error);
3083 /* Convert down to the right base before using the instance. A
3084 special case is that in a pointer to member of class C, C may
3085 be incomplete. In that case, the function will of course be
3086 a member of C, and no conversion is required. In fact,
3087 lookup_base will fail in that case, because incomplete
3088 classes do not have BINFOs. */
3089 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3090 if (!same_type_ignoring_top_level_qualifiers_p
3091 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3093 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3094 basetype, ba_check, NULL);
3095 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3096 1, tf_warning_or_error);
3097 if (instance_ptr == error_mark_node)
3098 return error_mark_node;
3100 /* ...and then the delta in the PMF. */
3101 instance_ptr = fold_build_pointer_plus (instance_ptr, delta);
3103 /* Hand back the adjusted 'this' argument to our caller. */
3104 *instance_ptrptr = instance_ptr;
3106 /* Next extract the vtable pointer from the object. */
3107 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3109 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, tf_warning_or_error);
3110 /* If the object is not dynamic the access invokes undefined
3111 behavior. As it is not executed in this case silence the
3112 spurious warnings it may provoke. */
3113 TREE_NO_WARNING (vtbl) = 1;
3115 /* Finally, extract the function pointer from the vtable. */
3116 e2 = fold_build_pointer_plus_loc (input_location, vtbl, idx);
3117 e2 = cp_build_indirect_ref (e2, RO_NULL, tf_warning_or_error);
3118 TREE_CONSTANT (e2) = 1;
3120 /* When using function descriptors, the address of the
3121 vtable entry is treated as a function pointer. */
3122 if (TARGET_VTABLE_USES_DESCRIPTORS)
3123 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3124 cp_build_addr_expr (e2, tf_warning_or_error));
3126 e2 = fold_convert (TREE_TYPE (e3), e2);
3127 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
3129 /* Make sure this doesn't get evaluated first inside one of the
3130 branches of the COND_EXPR. */
3131 if (instance_save_expr)
3132 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3133 instance_save_expr, e1);
3140 /* Used by the C-common bits. */
3142 build_function_call (location_t loc ATTRIBUTE_UNUSED,
3143 tree function, tree params)
3145 return cp_build_function_call (function, params, tf_warning_or_error);
3148 /* Used by the C-common bits. */
3150 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
3151 tree function, VEC(tree,gc) *params,
3152 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
3154 VEC(tree,gc) *orig_params = params;
3155 tree ret = cp_build_function_call_vec (function, ¶ms,
3156 tf_warning_or_error);
3158 /* cp_build_function_call_vec can reallocate PARAMS by adding
3159 default arguments. That should never happen here. Verify
3161 gcc_assert (params == orig_params);
3166 /* Build a function call using a tree list of arguments. */
3169 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3174 vec = make_tree_vector ();
3175 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3176 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3177 ret = cp_build_function_call_vec (function, &vec, complain);
3178 release_tree_vector (vec);
3182 /* Build a function call using varargs. */
3185 cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
3191 vec = make_tree_vector ();
3192 va_start (args, complain);
3193 for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
3194 VEC_safe_push (tree, gc, vec, t);
3196 ret = cp_build_function_call_vec (function, &vec, complain);
3197 release_tree_vector (vec);
3201 /* Build a function call using a vector of arguments. PARAMS may be
3202 NULL if there are no parameters. This changes the contents of
3206 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3207 tsubst_flags_t complain)
3209 tree fntype, fndecl;
3211 tree original = function;
3215 VEC(tree,gc) *allocated = NULL;
3218 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3219 expressions, like those used for ObjC messenger dispatches. */
3220 if (params != NULL && !VEC_empty (tree, *params))
3221 function = objc_rewrite_function_call (function,
3222 VEC_index (tree, *params, 0));
3224 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3225 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3226 if (TREE_CODE (function) == NOP_EXPR
3227 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3228 function = TREE_OPERAND (function, 0);
3230 if (TREE_CODE (function) == FUNCTION_DECL)
3232 mark_used (function);
3235 /* Convert anything with function type to a pointer-to-function. */
3236 if (DECL_MAIN_P (function) && (complain & tf_error))
3237 pedwarn (input_location, OPT_pedantic,
3238 "ISO C++ forbids calling %<::main%> from within program");
3240 function = build_addr_func (function);
3246 function = build_addr_func (function);
3249 if (function == error_mark_node)
3250 return error_mark_node;
3252 fntype = TREE_TYPE (function);
3254 if (TYPE_PTRMEMFUNC_P (fntype))
3256 if (complain & tf_error)
3257 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3258 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3259 original, original);
3260 return error_mark_node;
3263 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3264 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3266 if (!((TREE_CODE (fntype) == POINTER_TYPE
3267 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3269 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3271 if (complain & tf_error)
3272 error ("%qE cannot be used as a function", original);
3273 return error_mark_node;
3276 /* fntype now gets the type of function pointed to. */
3277 fntype = TREE_TYPE (fntype);
3278 parm_types = TYPE_ARG_TYPES (fntype);
3282 allocated = make_tree_vector ();
3283 params = &allocated;
3286 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3289 return error_mark_node;
3291 argarray = VEC_address (tree, *params);
3293 /* Check for errors in format strings and inappropriately
3295 check_function_arguments (fntype, nargs, argarray);
3297 ret = build_cxx_call (function, nargs, argarray);
3299 if (allocated != NULL)
3300 release_tree_vector (allocated);
3305 /* Subroutine of convert_arguments.
3306 Warn about wrong number of args are genereted. */
3309 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3313 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3315 if (DECL_NAME (fndecl) == NULL_TREE
3316 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3319 ? G_("too many arguments to constructor %q#D")
3320 : G_("too few arguments to constructor %q#D"),
3325 ? G_("too many arguments to member function %q#D")
3326 : G_("too few arguments to member function %q#D"),
3332 ? G_("too many arguments to function %q#D")
3333 : G_("too few arguments to function %q#D"),
3335 inform (DECL_SOURCE_LOCATION (fndecl),
3340 if (c_dialect_objc () && objc_message_selector ())
3343 ? G_("too many arguments to method %q#D")
3344 : G_("too few arguments to method %q#D"),
3345 objc_message_selector ());
3347 error_at (loc, too_many_p ? G_("too many arguments to function")
3348 : G_("too few arguments to function"));
3352 /* Convert the actual parameter expressions in the list VALUES to the
3353 types in the list TYPELIST. The converted expressions are stored
3354 back in the VALUES vector.
3355 If parmdecls is exhausted, or when an element has NULL as its type,
3356 perform the default conversions.
3358 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3360 This is also where warnings about wrong number of args are generated.
3362 Returns the actual number of arguments processed (which might be less
3363 than the length of the vector), or -1 on error.
3365 In C++, unspecified trailing parameters can be filled in with their
3366 default arguments, if such were specified. Do so here. */
3369 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3370 int flags, tsubst_flags_t complain)
3375 /* Argument passing is always copy-initialization. */
3376 flags |= LOOKUP_ONLYCONVERTING;
3378 for (i = 0, typetail = typelist;
3379 i < VEC_length (tree, *values);
3382 tree type = typetail ? TREE_VALUE (typetail) : 0;
3383 tree val = VEC_index (tree, *values, i);
3385 if (val == error_mark_node || type == error_mark_node)
3388 if (type == void_type_node)
3390 if (complain & tf_error)
3392 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3399 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3400 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3401 if (TREE_CODE (val) == NOP_EXPR
3402 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3403 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3404 val = TREE_OPERAND (val, 0);
3406 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3408 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3409 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3410 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3411 val = decay_conversion (val);
3414 if (val == error_mark_node)
3419 /* Formal parm type is specified by a function prototype. */
3422 if (!COMPLETE_TYPE_P (complete_type (type)))
3424 if (complain & tf_error)
3427 error ("parameter %P of %qD has incomplete type %qT",
3430 error ("parameter %P has incomplete type %qT", i, type);
3432 parmval = error_mark_node;
3436 parmval = convert_for_initialization
3437 (NULL_TREE, type, val, flags,
3438 ICR_ARGPASS, fndecl, i, complain);
3439 parmval = convert_for_arg_passing (type, parmval);
3442 if (parmval == error_mark_node)
3445 VEC_replace (tree, *values, i, parmval);
3449 if (fndecl && DECL_BUILT_IN (fndecl)
3450 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3451 /* Don't do ellipsis conversion for __built_in_constant_p
3452 as this will result in spurious errors for non-trivial
3454 val = require_complete_type_sfinae (val, complain);
3456 val = convert_arg_to_ellipsis (val);
3458 VEC_replace (tree, *values, i, val);
3462 typetail = TREE_CHAIN (typetail);
3465 if (typetail != 0 && typetail != void_list_node)
3467 /* See if there are default arguments that can be used. Because
3468 we hold default arguments in the FUNCTION_TYPE (which is so
3469 wrong), we can see default parameters here from deduced
3470 contexts (and via typeof) for indirect function calls.
3471 Fortunately we know whether we have a function decl to
3472 provide default arguments in a language conformant
3474 if (fndecl && TREE_PURPOSE (typetail)
3475 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3477 for (; typetail != void_list_node; ++i)
3480 = convert_default_arg (TREE_VALUE (typetail),
3481 TREE_PURPOSE (typetail),
3484 if (parmval == error_mark_node)
3487 VEC_safe_push (tree, gc, *values, parmval);
3488 typetail = TREE_CHAIN (typetail);
3489 /* ends with `...'. */
3490 if (typetail == NULL_TREE)
3496 if (complain & tf_error)
3497 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3505 /* Build a binary-operation expression, after performing default
3506 conversions on the operands. CODE is the kind of expression to
3507 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3508 are the tree codes which correspond to ARG1 and ARG2 when issuing
3509 warnings about possibly misplaced parentheses. They may differ
3510 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3511 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3512 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3513 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3514 ARG2_CODE as ERROR_MARK. */
3517 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3518 tree arg2, enum tree_code arg2_code, tree *overload,
3519 tsubst_flags_t complain)
3528 if (processing_template_decl)
3530 if (type_dependent_expression_p (arg1)
3531 || type_dependent_expression_p (arg2))
3532 return build_min_nt (code, arg1, arg2);
3533 arg1 = build_non_dependent_expr (arg1);
3534 arg2 = build_non_dependent_expr (arg2);
3537 if (code == DOTSTAR_EXPR)
3538 expr = build_m_component_ref (arg1, arg2);
3540 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3541 overload, complain);
3543 /* Check for cases such as x+y<<z which users are likely to
3544 misinterpret. But don't warn about obj << x + y, since that is a
3545 common idiom for I/O. */
3546 if (warn_parentheses
3547 && (complain & tf_warning)
3548 && !processing_template_decl
3549 && !error_operand_p (arg1)
3550 && !error_operand_p (arg2)
3551 && (code != LSHIFT_EXPR
3552 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3553 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3555 if (processing_template_decl && expr != error_mark_node)
3556 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3561 /* Build and return an ARRAY_REF expression. */
3564 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3566 tree orig_arg1 = arg1;
3567 tree orig_arg2 = arg2;
3570 if (processing_template_decl)
3572 if (type_dependent_expression_p (arg1)
3573 || type_dependent_expression_p (arg2))
3574 return build_min_nt (ARRAY_REF, arg1, arg2,
3575 NULL_TREE, NULL_TREE);
3576 arg1 = build_non_dependent_expr (arg1);
3577 arg2 = build_non_dependent_expr (arg2);
3580 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3581 /*overload=*/NULL, complain);
3583 if (processing_template_decl && expr != error_mark_node)
3584 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3585 NULL_TREE, NULL_TREE);
3589 /* For the c-common bits. */
3591 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3592 int convert_p ATTRIBUTE_UNUSED)
3594 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3598 /* Build a binary-operation expression without default conversions.
3599 CODE is the kind of expression to build.
3600 LOCATION is the location_t of the operator in the source code.
3601 This function differs from `build' in several ways:
3602 the data type of the result is computed and recorded in it,
3603 warnings are generated if arg data types are invalid,
3604 special handling for addition and subtraction of pointers is known,
3605 and some optimization is done (operations on narrow ints
3606 are done in the narrower type when that gives the same result).
3607 Constant folding is also done before the result is returned.
3609 Note that the operands will never have enumeral types
3610 because either they have just had the default conversions performed
3611 or they have both just been converted to some other type in which
3612 the arithmetic is to be done.
3614 C++: must do special pointer arithmetic when implementing
3615 multiple inheritance, and deal with pointer to member functions. */
3618 cp_build_binary_op (location_t location,
3619 enum tree_code code, tree orig_op0, tree orig_op1,
3620 tsubst_flags_t complain)
3623 enum tree_code code0, code1;
3625 const char *invalid_op_diag;
3627 /* Expression code to give to the expression when it is built.
3628 Normally this is CODE, which is what the caller asked for,
3629 but in some special cases we change it. */
3630 enum tree_code resultcode = code;
3632 /* Data type in which the computation is to be performed.
3633 In the simplest cases this is the common type of the arguments. */
3634 tree result_type = NULL;
3636 /* Nonzero means operands have already been type-converted
3637 in whatever way is necessary.
3638 Zero means they need to be converted to RESULT_TYPE. */
3641 /* Nonzero means create the expression with this type, rather than
3643 tree build_type = 0;
3645 /* Nonzero means after finally constructing the expression
3646 convert it to this type. */
3647 tree final_type = 0;
3651 /* Nonzero if this is an operation like MIN or MAX which can
3652 safely be computed in short if both args are promoted shorts.
3653 Also implies COMMON.
3654 -1 indicates a bitwise operation; this makes a difference
3655 in the exact conditions for when it is safe to do the operation
3656 in a narrower mode. */
3659 /* Nonzero if this is a comparison operation;
3660 if both args are promoted shorts, compare the original shorts.
3661 Also implies COMMON. */
3662 int short_compare = 0;
3664 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3667 /* True if both operands have arithmetic type. */
3668 bool arithmetic_types_p;
3670 /* Apply default conversions. */
3674 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3675 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3676 || code == TRUTH_XOR_EXPR)
3678 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3679 op0 = decay_conversion (op0);
3680 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3681 op1 = decay_conversion (op1);
3685 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3686 op0 = default_conversion (op0);
3687 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3688 op1 = default_conversion (op1);
3691 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3692 STRIP_TYPE_NOPS (op0);
3693 STRIP_TYPE_NOPS (op1);
3695 /* DTRT if one side is an overloaded function, but complain about it. */
3696 if (type_unknown_p (op0))
3698 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3699 if (t != error_mark_node)
3701 if (complain & tf_error)
3702 permerror (input_location, "assuming cast to type %qT from overloaded function",
3707 if (type_unknown_p (op1))
3709 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3710 if (t != error_mark_node)
3712 if (complain & tf_error)
3713 permerror (input_location, "assuming cast to type %qT from overloaded function",
3719 type0 = TREE_TYPE (op0);
3720 type1 = TREE_TYPE (op1);
3722 /* The expression codes of the data types of the arguments tell us
3723 whether the arguments are integers, floating, pointers, etc. */
3724 code0 = TREE_CODE (type0);
3725 code1 = TREE_CODE (type1);
3727 /* If an error was already reported for one of the arguments,
3728 avoid reporting another error. */
3729 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3730 return error_mark_node;
3732 if ((invalid_op_diag
3733 = targetm.invalid_binary_op (code, type0, type1)))
3735 error (invalid_op_diag);
3736 return error_mark_node;
3739 /* Issue warnings about peculiar, but valid, uses of NULL. */
3740 if ((orig_op0 == null_node || orig_op1 == null_node)
3741 /* It's reasonable to use pointer values as operands of &&
3742 and ||, so NULL is no exception. */
3743 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3744 && ( /* Both are NULL (or 0) and the operation was not a
3745 comparison or a pointer subtraction. */
3746 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3747 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3748 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3749 || (!null_ptr_cst_p (orig_op0)
3750 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3751 || (!null_ptr_cst_p (orig_op1)
3752 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3753 && (complain & tf_warning))
3754 /* Some sort of arithmetic operation involving NULL was
3756 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3761 /* Subtraction of two similar pointers.
3762 We must subtract them as integers, then divide by object size. */
3763 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3764 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3766 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3767 /* In all other cases except pointer - int, the usual arithmetic
3769 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3774 /* The pointer - int case is just like pointer + int; fall
3777 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3778 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3782 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3783 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3784 if (processing_template_decl)
3786 result_type = TREE_TYPE (ptr_operand);
3789 return cp_pointer_int_sum (code,
3800 case TRUNC_DIV_EXPR:
3802 case FLOOR_DIV_EXPR:
3803 case ROUND_DIV_EXPR:
3804 case EXACT_DIV_EXPR:
3805 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3806 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3807 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3808 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3810 enum tree_code tcode0 = code0, tcode1 = code1;
3812 warn_for_div_by_zero (location, op1);
3814 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3815 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3816 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3817 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3819 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3820 resultcode = RDIV_EXPR;
3822 /* When dividing two signed integers, we have to promote to int.
3823 unless we divide by a constant != -1. Note that default
3824 conversion will have been performed on the operands at this
3825 point, so we have to dig out the original type to find out if
3827 shorten = ((TREE_CODE (op0) == NOP_EXPR
3828 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3829 || (TREE_CODE (op1) == INTEGER_CST
3830 && ! integer_all_onesp (op1)));
3839 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3840 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3841 && !VECTOR_FLOAT_TYPE_P (type0)
3842 && !VECTOR_FLOAT_TYPE_P (type1)))
3846 case TRUNC_MOD_EXPR:
3847 case FLOOR_MOD_EXPR:
3848 warn_for_div_by_zero (location, op1);
3850 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3851 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3852 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3854 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3856 /* Although it would be tempting to shorten always here, that loses
3857 on some targets, since the modulo instruction is undefined if the
3858 quotient can't be represented in the computation mode. We shorten
3859 only if unsigned or if dividing by something we know != -1. */
3860 shorten = ((TREE_CODE (op0) == NOP_EXPR
3861 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3862 || (TREE_CODE (op1) == INTEGER_CST
3863 && ! integer_all_onesp (op1)));
3868 case TRUTH_ANDIF_EXPR:
3869 case TRUTH_ORIF_EXPR:
3870 case TRUTH_AND_EXPR:
3872 result_type = boolean_type_node;
3875 /* Shift operations: result has same type as first operand;
3876 always convert second operand to int.
3877 Also set SHORT_SHIFT if shifting rightward. */
3880 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3882 result_type = type0;
3883 if (TREE_CODE (op1) == INTEGER_CST)
3885 if (tree_int_cst_lt (op1, integer_zero_node))
3887 if ((complain & tf_warning)
3888 && c_inhibit_evaluation_warnings == 0)
3889 warning (0, "right shift count is negative");
3893 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3894 && (complain & tf_warning)
3895 && c_inhibit_evaluation_warnings == 0)
3896 warning (0, "right shift count >= width of type");
3899 /* Convert the shift-count to an integer, regardless of
3900 size of value being shifted. */
3901 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3902 op1 = cp_convert (integer_type_node, op1);
3903 /* Avoid converting op1 to result_type later. */
3909 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3911 result_type = type0;
3912 if (TREE_CODE (op1) == INTEGER_CST)
3914 if (tree_int_cst_lt (op1, integer_zero_node))
3916 if ((complain & tf_warning)
3917 && c_inhibit_evaluation_warnings == 0)
3918 warning (0, "left shift count is negative");
3920 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3922 if ((complain & tf_warning)
3923 && c_inhibit_evaluation_warnings == 0)
3924 warning (0, "left shift count >= width of type");
3927 /* Convert the shift-count to an integer, regardless of
3928 size of value being shifted. */
3929 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3930 op1 = cp_convert (integer_type_node, op1);
3931 /* Avoid converting op1 to result_type later. */
3938 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3940 result_type = type0;
3941 if (TREE_CODE (op1) == INTEGER_CST)
3943 if (tree_int_cst_lt (op1, integer_zero_node))
3945 if (complain & tf_warning)
3946 warning (0, (code == LROTATE_EXPR)
3947 ? G_("left rotate count is negative")
3948 : G_("right rotate count is negative"));
3950 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3952 if (complain & tf_warning)
3953 warning (0, (code == LROTATE_EXPR)
3954 ? G_("left rotate count >= width of type")
3955 : G_("right rotate count >= width of type"));
3958 /* Convert the shift-count to an integer, regardless of
3959 size of value being shifted. */
3960 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3961 op1 = cp_convert (integer_type_node, op1);
3967 if ((complain & tf_warning)
3968 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3969 warning (OPT_Wfloat_equal,
3970 "comparing floating point with == or != is unsafe");
3971 if ((complain & tf_warning)
3972 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3973 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3974 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3976 build_type = boolean_type_node;
3977 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3978 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
3979 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3980 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
3982 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3983 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3984 result_type = composite_pointer_type (type0, type1, op0, op1,
3985 CPO_COMPARISON, complain);
3986 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3987 && null_ptr_cst_p (op1))
3989 if (TREE_CODE (op0) == ADDR_EXPR
3990 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
3992 if (complain & tf_warning)
3993 warning (OPT_Waddress, "the address of %qD will never be NULL",
3994 TREE_OPERAND (op0, 0));
3996 result_type = type0;
3998 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3999 && null_ptr_cst_p (op0))
4001 if (TREE_CODE (op1) == ADDR_EXPR
4002 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
4004 if (complain & tf_warning)
4005 warning (OPT_Waddress, "the address of %qD will never be NULL",
4006 TREE_OPERAND (op1, 0));
4008 result_type = type1;
4010 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4011 /* One of the operands must be of nullptr_t type. */
4012 result_type = TREE_TYPE (nullptr_node);
4013 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4015 result_type = type0;
4016 if (complain & tf_error)
4017 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4019 return error_mark_node;
4021 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4023 result_type = type1;
4024 if (complain & tf_error)
4025 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4027 return error_mark_node;
4029 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4031 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4032 == ptrmemfunc_vbit_in_delta)
4034 tree pfn0 = pfn_from_ptrmemfunc (op0);
4035 tree delta0 = delta_from_ptrmemfunc (op0);
4036 tree e1 = cp_build_binary_op (location,
4039 build_zero_cst (TREE_TYPE (pfn0)),
4041 tree e2 = cp_build_binary_op (location,
4046 e2 = cp_build_binary_op (location,
4047 EQ_EXPR, e2, integer_zero_node,
4049 op0 = cp_build_binary_op (location,
4050 TRUTH_ANDIF_EXPR, e1, e2,
4052 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
4056 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4057 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
4059 result_type = TREE_TYPE (op0);
4061 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4062 return cp_build_binary_op (location, code, op1, op0, complain);
4063 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4066 /* E will be the final comparison. */
4068 /* E1 and E2 are for scratch. */
4076 type = composite_pointer_type (type0, type1, op0, op1,
4077 CPO_COMPARISON, complain);
4079 if (!same_type_p (TREE_TYPE (op0), type))
4080 op0 = cp_convert_and_check (type, op0);
4081 if (!same_type_p (TREE_TYPE (op1), type))
4082 op1 = cp_convert_and_check (type, op1);
4084 if (op0 == error_mark_node || op1 == error_mark_node)
4085 return error_mark_node;
4087 if (TREE_SIDE_EFFECTS (op0))
4088 op0 = save_expr (op0);
4089 if (TREE_SIDE_EFFECTS (op1))
4090 op1 = save_expr (op1);
4092 pfn0 = pfn_from_ptrmemfunc (op0);
4093 pfn1 = pfn_from_ptrmemfunc (op1);
4094 delta0 = delta_from_ptrmemfunc (op0);
4095 delta1 = delta_from_ptrmemfunc (op1);
4096 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4097 == ptrmemfunc_vbit_in_delta)
4102 && ((op0.delta == op1.delta)
4103 || (!op0.pfn && op0.delta & 1 == 0
4104 && op1.delta & 1 == 0))
4106 The reason for the `!op0.pfn' bit is that a NULL
4107 pointer-to-member is any member with a zero PFN and
4108 LSB of the DELTA field is 0. */
4110 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4114 e1 = cp_build_binary_op (location,
4115 EQ_EXPR, e1, integer_zero_node,
4117 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4121 e2 = cp_build_binary_op (location,
4122 EQ_EXPR, e2, integer_zero_node,
4124 e1 = cp_build_binary_op (location,
4125 TRUTH_ANDIF_EXPR, e2, e1,
4127 e2 = cp_build_binary_op (location, EQ_EXPR,
4129 build_zero_cst (TREE_TYPE (pfn0)),
4131 e2 = cp_build_binary_op (location,
4132 TRUTH_ANDIF_EXPR, e2, e1, complain);
4133 e1 = cp_build_binary_op (location,
4134 EQ_EXPR, delta0, delta1, complain);
4135 e1 = cp_build_binary_op (location,
4136 TRUTH_ORIF_EXPR, e1, e2, complain);
4143 && (!op0.pfn || op0.delta == op1.delta))
4145 The reason for the `!op0.pfn' bit is that a NULL
4146 pointer-to-member is any member with a zero PFN; the
4147 DELTA field is unspecified. */
4149 e1 = cp_build_binary_op (location,
4150 EQ_EXPR, delta0, delta1, complain);
4151 e2 = cp_build_binary_op (location,
4154 build_zero_cst (TREE_TYPE (pfn0)),
4156 e1 = cp_build_binary_op (location,
4157 TRUTH_ORIF_EXPR, e1, e2, complain);
4159 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4160 e = cp_build_binary_op (location,
4161 TRUTH_ANDIF_EXPR, e2, e1, complain);
4162 if (code == EQ_EXPR)
4164 return cp_build_binary_op (location,
4165 EQ_EXPR, e, integer_zero_node, complain);
4169 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4170 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4172 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4173 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4181 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4182 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4184 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4185 result_type = composite_pointer_type (type0, type1, op0, op1,
4186 CPO_COMPARISON, complain);
4193 if (TREE_CODE (orig_op0) == STRING_CST
4194 || TREE_CODE (orig_op1) == STRING_CST)
4196 if (complain & tf_warning)
4197 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4200 build_type = boolean_type_node;
4201 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4202 || code0 == ENUMERAL_TYPE)
4203 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4204 || code1 == ENUMERAL_TYPE))
4206 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4207 result_type = composite_pointer_type (type0, type1, op0, op1,
4208 CPO_COMPARISON, complain);
4209 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4211 result_type = type0;
4212 if (extra_warnings && (complain & tf_warning))
4213 warning (OPT_Wextra,
4214 "ordered comparison of pointer with integer zero");
4216 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4218 result_type = type1;
4219 if (extra_warnings && (complain & tf_warning))
4220 warning (OPT_Wextra,
4221 "ordered comparison of pointer with integer zero");
4223 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4224 /* One of the operands must be of nullptr_t type. */
4225 result_type = TREE_TYPE (nullptr_node);
4226 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4228 result_type = type0;
4229 if (complain & tf_error)
4230 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4232 return error_mark_node;
4234 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4236 result_type = type1;
4237 if (complain & tf_error)
4238 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4240 return error_mark_node;
4244 case UNORDERED_EXPR:
4251 build_type = integer_type_node;
4252 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4254 if (complain & tf_error)
4255 error ("unordered comparison on non-floating point argument");
4256 return error_mark_node;
4265 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4266 || code0 == ENUMERAL_TYPE)
4267 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4268 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4269 arithmetic_types_p = 1;
4272 arithmetic_types_p = 0;
4273 /* Vector arithmetic is only allowed when both sides are vectors. */
4274 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4276 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4277 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4280 binary_op_error (location, code, type0, type1);
4281 return error_mark_node;
4283 arithmetic_types_p = 1;
4286 /* Determine the RESULT_TYPE, if it is not already known. */
4288 && arithmetic_types_p
4289 && (shorten || common || short_compare))
4291 result_type = cp_common_type (type0, type1);
4292 do_warn_double_promotion (result_type, type0, type1,
4293 "implicit conversion from %qT to %qT "
4294 "to match other operand of binary "
4301 if (complain & tf_error)
4302 error ("invalid operands of types %qT and %qT to binary %qO",
4303 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4304 return error_mark_node;
4307 /* If we're in a template, the only thing we need to know is the
4309 if (processing_template_decl)
4311 /* Since the middle-end checks the type when doing a build2, we
4312 need to build the tree in pieces. This built tree will never
4313 get out of the front-end as we replace it when instantiating
4315 tree tmp = build2 (resultcode,
4316 build_type ? build_type : result_type,
4318 TREE_OPERAND (tmp, 0) = op0;
4322 if (arithmetic_types_p)
4324 bool first_complex = (code0 == COMPLEX_TYPE);
4325 bool second_complex = (code1 == COMPLEX_TYPE);
4326 int none_complex = (!first_complex && !second_complex);
4328 /* Adapted from patch for c/24581. */
4329 if (first_complex != second_complex
4330 && (code == PLUS_EXPR
4331 || code == MINUS_EXPR
4332 || code == MULT_EXPR
4333 || (code == TRUNC_DIV_EXPR && first_complex))
4334 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4335 && flag_signed_zeros)
4337 /* An operation on mixed real/complex operands must be
4338 handled specially, but the language-independent code can
4339 more easily optimize the plain complex arithmetic if
4340 -fno-signed-zeros. */
4341 tree real_type = TREE_TYPE (result_type);
4345 if (TREE_TYPE (op0) != result_type)
4346 op0 = cp_convert_and_check (result_type, op0);
4347 if (TREE_TYPE (op1) != real_type)
4348 op1 = cp_convert_and_check (real_type, op1);
4352 if (TREE_TYPE (op0) != real_type)
4353 op0 = cp_convert_and_check (real_type, op0);
4354 if (TREE_TYPE (op1) != result_type)
4355 op1 = cp_convert_and_check (result_type, op1);
4357 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4358 return error_mark_node;
4361 op0 = save_expr (op0);
4362 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4363 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4367 case TRUNC_DIV_EXPR:
4368 op1 = save_expr (op1);
4369 imag = build2 (resultcode, real_type, imag, op1);
4373 real = build2 (resultcode, real_type, real, op1);
4381 op1 = save_expr (op1);
4382 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4383 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4387 op0 = save_expr (op0);
4388 imag = build2 (resultcode, real_type, op0, imag);
4391 real = build2 (resultcode, real_type, op0, real);
4394 real = build2 (resultcode, real_type, op0, real);
4395 imag = build1 (NEGATE_EXPR, real_type, imag);
4401 real = fold_if_not_in_template (real);
4402 imag = fold_if_not_in_template (imag);
4403 result = build2 (COMPLEX_EXPR, result_type, real, imag);
4404 result = fold_if_not_in_template (result);
4408 /* For certain operations (which identify themselves by shorten != 0)
4409 if both args were extended from the same smaller type,
4410 do the arithmetic in that type and then extend.
4412 shorten !=0 and !=1 indicates a bitwise operation.
4413 For them, this optimization is safe only if
4414 both args are zero-extended or both are sign-extended.
4415 Otherwise, we might change the result.
4416 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4417 but calculated in (unsigned short) it would be (unsigned short)-1. */
4419 if (shorten && none_complex)
4421 final_type = result_type;
4422 result_type = shorten_binary_op (result_type, op0, op1,
4426 /* Comparison operations are shortened too but differently.
4427 They identify themselves by setting short_compare = 1. */
4431 /* Don't write &op0, etc., because that would prevent op0
4432 from being kept in a register.
4433 Instead, make copies of the our local variables and
4434 pass the copies by reference, then copy them back afterward. */
4435 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4436 enum tree_code xresultcode = resultcode;
4438 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4440 return cp_convert (boolean_type_node, val);
4441 op0 = xop0, op1 = xop1;
4443 resultcode = xresultcode;
4446 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4447 && warn_sign_compare
4448 && !TREE_NO_WARNING (orig_op0)
4449 && !TREE_NO_WARNING (orig_op1)
4450 /* Do not warn until the template is instantiated; we cannot
4451 bound the ranges of the arguments until that point. */
4452 && !processing_template_decl
4453 && (complain & tf_warning)
4454 && c_inhibit_evaluation_warnings == 0)
4456 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4457 result_type, resultcode);
4461 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4462 Then the expression will be built.
4463 It will be given type FINAL_TYPE if that is nonzero;
4464 otherwise, it will be given type RESULT_TYPE. */
4467 if (TREE_TYPE (op0) != result_type)
4468 op0 = cp_convert_and_check (result_type, op0);
4469 if (TREE_TYPE (op1) != result_type)
4470 op1 = cp_convert_and_check (result_type, op1);
4472 if (op0 == error_mark_node || op1 == error_mark_node)
4473 return error_mark_node;
4476 if (build_type == NULL_TREE)
4477 build_type = result_type;
4479 result = build2 (resultcode, build_type, op0, op1);
4480 result = fold_if_not_in_template (result);
4481 if (final_type != 0)
4482 result = cp_convert (final_type, result);
4484 if (TREE_OVERFLOW_P (result)
4485 && !TREE_OVERFLOW_P (op0)
4486 && !TREE_OVERFLOW_P (op1))
4487 overflow_warning (location, result);
4492 /* Return a tree for the sum or difference (RESULTCODE says which)
4493 of pointer PTROP and integer INTOP. */
4496 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4498 tree res_type = TREE_TYPE (ptrop);
4500 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4501 in certain circumstance (when it's valid to do so). So we need
4502 to make sure it's complete. We don't need to check here, if we
4503 can actually complete it at all, as those checks will be done in
4504 pointer_int_sum() anyway. */
4505 complete_type (TREE_TYPE (res_type));
4507 return pointer_int_sum (input_location, resultcode, ptrop,
4508 fold_if_not_in_template (intop));
4511 /* Return a tree for the difference of pointers OP0 and OP1.
4512 The resulting tree has type int. */
4515 pointer_diff (tree op0, tree op1, tree ptrtype)
4518 tree restype = ptrdiff_type_node;
4519 tree target_type = TREE_TYPE (ptrtype);
4521 if (!complete_type_or_else (target_type, NULL_TREE))
4522 return error_mark_node;
4524 if (TREE_CODE (target_type) == VOID_TYPE)
4525 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4526 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4527 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4528 if (TREE_CODE (target_type) == METHOD_TYPE)
4529 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4531 /* First do the subtraction as integers;
4532 then drop through to build the divide operator. */
4534 op0 = cp_build_binary_op (input_location,
4536 cp_convert (restype, op0),
4537 cp_convert (restype, op1),
4538 tf_warning_or_error);
4540 /* This generates an error if op1 is a pointer to an incomplete type. */
4541 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4542 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4544 op1 = (TYPE_PTROB_P (ptrtype)
4545 ? size_in_bytes (target_type)
4546 : integer_one_node);
4548 /* Do the division. */
4550 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4551 return fold_if_not_in_template (result);
4554 /* Construct and perhaps optimize a tree representation
4555 for a unary operation. CODE, a tree_code, specifies the operation
4556 and XARG is the operand. */
4559 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4561 tree orig_expr = xarg;
4565 if (processing_template_decl)
4567 if (type_dependent_expression_p (xarg))
4568 return build_min_nt (code, xarg, NULL_TREE);
4570 xarg = build_non_dependent_expr (xarg);
4575 /* [expr.unary.op] says:
4577 The address of an object of incomplete type can be taken.
4579 (And is just the ordinary address operator, not an overloaded
4580 "operator &".) However, if the type is a template
4581 specialization, we must complete the type at this point so that
4582 an overloaded "operator &" will be available if required. */
4583 if (code == ADDR_EXPR
4584 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4585 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4586 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4587 || (TREE_CODE (xarg) == OFFSET_REF)))
4588 /* Don't look for a function. */;
4590 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4591 /*overload=*/NULL, complain);
4592 if (!exp && code == ADDR_EXPR)
4594 if (is_overloaded_fn (xarg))
4596 tree fn = get_first_fn (xarg);
4597 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4599 error (DECL_CONSTRUCTOR_P (fn)
4600 ? G_("taking address of constructor %qE")
4601 : G_("taking address of destructor %qE"),
4603 return error_mark_node;
4607 /* A pointer to member-function can be formed only by saying
4609 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4610 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4612 if (TREE_CODE (xarg) != OFFSET_REF
4613 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4615 error ("invalid use of %qE to form a pointer-to-member-function",
4617 if (TREE_CODE (xarg) != OFFSET_REF)
4618 inform (input_location, " a qualified-id is required");
4619 return error_mark_node;
4623 error ("parentheses around %qE cannot be used to form a"
4624 " pointer-to-member-function",
4626 PTRMEM_OK_P (xarg) = 1;
4630 if (TREE_CODE (xarg) == OFFSET_REF)
4632 ptrmem = PTRMEM_OK_P (xarg);
4634 if (!ptrmem && !flag_ms_extensions
4635 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4637 /* A single non-static member, make sure we don't allow a
4638 pointer-to-member. */
4639 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4640 TREE_OPERAND (xarg, 0),
4641 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4642 PTRMEM_OK_P (xarg) = ptrmem;
4646 exp = cp_build_addr_expr_strict (xarg, complain);
4649 if (processing_template_decl && exp != error_mark_node)
4650 exp = build_min_non_dep (code, exp, orig_expr,
4651 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4652 if (TREE_CODE (exp) == ADDR_EXPR)
4653 PTRMEM_OK_P (exp) = ptrmem;
4657 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4658 constants, where a null value is represented by an INTEGER_CST of
4662 cp_truthvalue_conversion (tree expr)
4664 tree type = TREE_TYPE (expr);
4665 if (TYPE_PTRMEM_P (type))
4666 return build_binary_op (EXPR_LOCATION (expr),
4667 NE_EXPR, expr, integer_zero_node, 1);
4669 return c_common_truthvalue_conversion (input_location, expr);
4672 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4675 condition_conversion (tree expr)
4678 if (processing_template_decl)
4680 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4681 tf_warning_or_error, LOOKUP_NORMAL);
4682 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4686 /* Returns the address of T. This function will fold away
4687 ADDR_EXPR of INDIRECT_REF. */
4690 build_address (tree t)
4692 if (error_operand_p (t) || !cxx_mark_addressable (t))
4693 return error_mark_node;
4694 t = build_fold_addr_expr (t);
4695 if (TREE_CODE (t) != ADDR_EXPR)
4700 /* Returns the address of T with type TYPE. */
4703 build_typed_address (tree t, tree type)
4705 if (error_operand_p (t) || !cxx_mark_addressable (t))
4706 return error_mark_node;
4707 t = build_fold_addr_expr_with_type (t, type);
4708 if (TREE_CODE (t) != ADDR_EXPR)
4713 /* Return a NOP_EXPR converting EXPR to TYPE. */
4716 build_nop (tree type, tree expr)
4718 if (type == error_mark_node || error_operand_p (expr))
4720 return build1 (NOP_EXPR, type, expr);
4723 /* Take the address of ARG, whatever that means under C++ semantics.
4724 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4725 and class rvalues as well.
4727 Nothing should call this function directly; instead, callers should use
4728 cp_build_addr_expr or cp_build_addr_expr_strict. */
4731 cp_build_addr_expr_1 (tree arg, bool strict_lvalue, tsubst_flags_t complain)
4736 if (!arg || error_operand_p (arg))
4737 return error_mark_node;
4739 arg = mark_lvalue_use (arg);
4740 argtype = lvalue_type (arg);
4742 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4743 || !IDENTIFIER_OPNAME_P (arg));
4745 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4746 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4748 /* They're trying to take the address of a unique non-static
4749 member function. This is ill-formed (except in MS-land),
4750 but let's try to DTRT.
4751 Note: We only handle unique functions here because we don't
4752 want to complain if there's a static overload; non-unique
4753 cases will be handled by instantiate_type. But we need to
4754 handle this case here to allow casts on the resulting PMF.
4755 We could defer this in non-MS mode, but it's easier to give
4756 a useful error here. */
4758 /* Inside constant member functions, the `this' pointer
4759 contains an extra const qualifier. TYPE_MAIN_VARIANT
4760 is used here to remove this const from the diagnostics
4761 and the created OFFSET_REF. */
4762 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4763 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4766 if (! flag_ms_extensions)
4768 tree name = DECL_NAME (fn);
4769 if (!(complain & tf_error))
4770 return error_mark_node;
4771 else if (current_class_type
4772 && TREE_OPERAND (arg, 0) == current_class_ref)
4773 /* An expression like &memfn. */
4774 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4775 " or parenthesized non-static member function to form"
4776 " a pointer to member function. Say %<&%T::%D%>",
4779 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4780 " function to form a pointer to member function."
4784 arg = build_offset_ref (base, fn, /*address_p=*/true);
4787 /* Uninstantiated types are all functions. Taking the
4788 address of a function is a no-op, so just return the
4790 if (type_unknown_p (arg))
4791 return build1 (ADDR_EXPR, unknown_type_node, arg);
4793 if (TREE_CODE (arg) == OFFSET_REF)
4794 /* We want a pointer to member; bypass all the code for actually taking
4795 the address of something. */
4798 /* Anything not already handled and not a true memory reference
4800 if (TREE_CODE (argtype) != FUNCTION_TYPE
4801 && TREE_CODE (argtype) != METHOD_TYPE)
4803 cp_lvalue_kind kind = lvalue_kind (arg);
4804 if (kind == clk_none)
4806 if (complain & tf_error)
4807 lvalue_error (input_location, lv_addressof);
4808 return error_mark_node;
4810 if (strict_lvalue && (kind & (clk_rvalueref|clk_class)))
4812 if (!(complain & tf_error))
4813 return error_mark_node;
4814 if (kind & clk_class)
4815 /* Make this a permerror because we used to accept it. */
4816 permerror (input_location, "taking address of temporary");
4818 error ("taking address of xvalue (rvalue reference)");
4822 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4824 tree type = build_pointer_type (TREE_TYPE (argtype));
4825 arg = build1 (CONVERT_EXPR, type, arg);
4828 else if (pedantic && DECL_MAIN_P (arg))
4831 /* Apparently a lot of autoconf scripts for C++ packages do this,
4832 so only complain if -pedantic. */
4833 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4834 pedwarn (input_location, OPT_pedantic,
4835 "ISO C++ forbids taking address of function %<::main%>");
4836 else if (flag_pedantic_errors)
4837 return error_mark_node;
4840 /* Let &* cancel out to simplify resulting code. */
4841 if (TREE_CODE (arg) == INDIRECT_REF)
4843 /* We don't need to have `current_class_ptr' wrapped in a
4844 NON_LVALUE_EXPR node. */
4845 if (arg == current_class_ref)
4846 return current_class_ptr;
4848 arg = TREE_OPERAND (arg, 0);
4849 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4851 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4852 arg = build1 (CONVERT_EXPR, type, arg);
4855 /* Don't let this be an lvalue. */
4860 /* ??? Cope with user tricks that amount to offsetof. */
4861 if (TREE_CODE (argtype) != FUNCTION_TYPE
4862 && TREE_CODE (argtype) != METHOD_TYPE
4863 && argtype != unknown_type_node
4864 && (val = get_base_address (arg))
4865 && COMPLETE_TYPE_P (TREE_TYPE (val))
4866 && TREE_CODE (val) == INDIRECT_REF
4867 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
4869 tree type = build_pointer_type (argtype);
4870 tree op0 = fold_convert (type, TREE_OPERAND (val, 0));
4871 tree op1 = fold_offsetof (arg, val);
4872 return fold_build_pointer_plus (op0, op1);
4875 /* Handle complex lvalues (when permitted)
4876 by reduction to simpler cases. */
4877 val = unary_complex_lvalue (ADDR_EXPR, arg);
4881 switch (TREE_CODE (arg))
4885 case FIX_TRUNC_EXPR:
4886 /* Even if we're not being pedantic, we cannot allow this
4887 extension when we're instantiating in a SFINAE
4889 if (! lvalue_p (arg) && complain == tf_none)
4891 if (complain & tf_error)
4892 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4894 return error_mark_node;
4899 arg = BASELINK_FUNCTIONS (arg);
4903 arg = OVL_CURRENT (arg);
4908 /* Turn a reference to a non-static data member into a
4909 pointer-to-member. */
4914 gcc_assert (PTRMEM_OK_P (arg));
4916 t = TREE_OPERAND (arg, 1);
4917 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4919 if (complain & tf_error)
4920 error ("cannot create pointer to reference member %qD", t);
4921 return error_mark_node;
4924 type = build_ptrmem_type (context_for_name_lookup (t),
4926 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4934 if (argtype != error_mark_node)
4935 argtype = build_pointer_type (argtype);
4937 /* In a template, we are processing a non-dependent expression
4938 so we can just form an ADDR_EXPR with the correct type. */
4939 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
4941 val = build_address (arg);
4942 if (TREE_CODE (arg) == OFFSET_REF)
4943 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4945 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
4947 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4949 /* We can only get here with a single static member
4951 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4952 && DECL_STATIC_FUNCTION_P (fn));
4954 val = build_address (fn);
4955 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4956 /* Do not lose object's side effects. */
4957 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4958 TREE_OPERAND (arg, 0), val);
4960 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4962 if (complain & tf_error)
4963 error ("attempt to take address of bit-field structure member %qD",
4964 TREE_OPERAND (arg, 1));
4965 return error_mark_node;
4969 tree object = TREE_OPERAND (arg, 0);
4970 tree field = TREE_OPERAND (arg, 1);
4971 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4972 (TREE_TYPE (object), decl_type_context (field)));
4973 val = build_address (arg);
4976 if (TREE_CODE (argtype) == POINTER_TYPE
4977 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4979 build_ptrmemfunc_type (argtype);
4980 val = build_ptrmemfunc (argtype, val, 0,
4982 tf_warning_or_error);
4988 /* Take the address of ARG if it has one, even if it's an rvalue. */
4991 cp_build_addr_expr (tree arg, tsubst_flags_t complain)
4993 return cp_build_addr_expr_1 (arg, 0, complain);
4996 /* Take the address of ARG, but only if it's an lvalue. */
4999 cp_build_addr_expr_strict (tree arg, tsubst_flags_t complain)
5001 return cp_build_addr_expr_1 (arg, 1, complain);
5004 /* C++: Must handle pointers to members.
5006 Perhaps type instantiation should be extended to handle conversion
5007 from aggregates to types we don't yet know we want? (Or are those
5008 cases typically errors which should be reported?)
5010 NOCONVERT nonzero suppresses the default promotions
5011 (such as from short to int). */
5014 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
5015 tsubst_flags_t complain)
5017 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5020 const char *errstring = NULL;
5022 const char *invalid_op_diag;
5024 if (!arg || error_operand_p (arg))
5025 return error_mark_node;
5027 if ((invalid_op_diag
5028 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
5033 error (invalid_op_diag);
5034 return error_mark_node;
5039 case UNARY_PLUS_EXPR:
5042 int flags = WANT_ARITH | WANT_ENUM;
5043 /* Unary plus (but not unary minus) is allowed on pointers. */
5044 if (code == UNARY_PLUS_EXPR)
5045 flags |= WANT_POINTER;
5046 arg = build_expr_type_conversion (flags, arg, true);
5048 errstring = (code == NEGATE_EXPR
5049 ? _("wrong type argument to unary minus")
5050 : _("wrong type argument to unary plus"));
5053 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5054 arg = perform_integral_promotions (arg);
5056 /* Make sure the result is not an lvalue: a unary plus or minus
5057 expression is always a rvalue. */
5064 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5068 arg = default_conversion (arg);
5070 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
5071 | WANT_VECTOR_OR_COMPLEX,
5073 errstring = _("wrong type argument to bit-complement");
5074 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5075 arg = perform_integral_promotions (arg);
5079 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5080 errstring = _("wrong type argument to abs");
5081 else if (!noconvert)
5082 arg = default_conversion (arg);
5086 /* Conjugating a real value is a no-op, but allow it anyway. */
5087 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5088 errstring = _("wrong type argument to conjugation");
5089 else if (!noconvert)
5090 arg = default_conversion (arg);
5093 case TRUTH_NOT_EXPR:
5094 arg = perform_implicit_conversion (boolean_type_node, arg,
5096 val = invert_truthvalue_loc (input_location, arg);
5097 if (arg != error_mark_node)
5099 errstring = _("in argument to unary !");
5107 arg = build_real_imag_expr (input_location, code, arg);
5108 if (arg == error_mark_node)
5111 return fold_if_not_in_template (arg);
5113 case PREINCREMENT_EXPR:
5114 case POSTINCREMENT_EXPR:
5115 case PREDECREMENT_EXPR:
5116 case POSTDECREMENT_EXPR:
5117 /* Handle complex lvalues (when permitted)
5118 by reduction to simpler cases. */
5120 val = unary_complex_lvalue (code, arg);
5124 arg = mark_lvalue_use (arg);
5126 /* Increment or decrement the real part of the value,
5127 and don't change the imaginary part. */
5128 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5132 arg = stabilize_reference (arg);
5133 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
5134 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
5135 real = cp_build_unary_op (code, real, 1, complain);
5136 if (real == error_mark_node || imag == error_mark_node)
5137 return error_mark_node;
5138 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
5142 /* Report invalid types. */
5144 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
5147 if (code == PREINCREMENT_EXPR)
5148 errstring = _("no pre-increment operator for type");
5149 else if (code == POSTINCREMENT_EXPR)
5150 errstring = _("no post-increment operator for type");
5151 else if (code == PREDECREMENT_EXPR)
5152 errstring = _("no pre-decrement operator for type");
5154 errstring = _("no post-decrement operator for type");
5157 else if (arg == error_mark_node)
5158 return error_mark_node;
5160 /* Report something read-only. */
5162 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
5163 || TREE_READONLY (arg))
5165 if (complain & tf_error)
5166 cxx_readonly_error (arg, ((code == PREINCREMENT_EXPR
5167 || code == POSTINCREMENT_EXPR)
5168 ? lv_increment : lv_decrement));
5170 return error_mark_node;
5175 tree declared_type = unlowered_expr_type (arg);
5177 argtype = TREE_TYPE (arg);
5179 /* ARM $5.2.5 last annotation says this should be forbidden. */
5180 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
5182 if (complain & tf_error)
5183 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
5184 ? G_("ISO C++ forbids incrementing an enum")
5185 : G_("ISO C++ forbids decrementing an enum"));
5187 return error_mark_node;
5190 /* Compute the increment. */
5192 if (TREE_CODE (argtype) == POINTER_TYPE)
5194 tree type = complete_type (TREE_TYPE (argtype));
5196 if (!COMPLETE_OR_VOID_TYPE_P (type))
5198 if (complain & tf_error)
5199 error (((code == PREINCREMENT_EXPR
5200 || code == POSTINCREMENT_EXPR))
5201 ? G_("cannot increment a pointer to incomplete type %qT")
5202 : G_("cannot decrement a pointer to incomplete type %qT"),
5203 TREE_TYPE (argtype));
5205 return error_mark_node;
5207 else if ((pedantic || warn_pointer_arith)
5208 && !TYPE_PTROB_P (argtype))
5210 if (complain & tf_error)
5211 permerror (input_location, (code == PREINCREMENT_EXPR
5212 || code == POSTINCREMENT_EXPR)
5213 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5214 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5217 return error_mark_node;
5220 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
5223 inc = integer_one_node;
5225 inc = cp_convert (argtype, inc);
5227 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5228 need to ask Objective-C to build the increment or decrement
5229 expression for it. */
5230 if (objc_is_property_ref (arg))
5231 return objc_build_incr_expr_for_property_ref (input_location, code,
5234 /* Complain about anything else that is not a true lvalue. */
5235 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
5236 || code == POSTINCREMENT_EXPR)
5237 ? lv_increment : lv_decrement),
5239 return error_mark_node;
5241 /* Forbid using -- on `bool'. */
5242 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
5244 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
5246 if (complain & tf_error)
5247 error ("invalid use of Boolean expression as operand "
5248 "to %<operator--%>");
5249 return error_mark_node;
5251 val = boolean_increment (code, arg);
5253 else if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5254 /* An rvalue has no cv-qualifiers. */
5255 val = build2 (code, cv_unqualified (TREE_TYPE (arg)), arg, inc);
5257 val = build2 (code, TREE_TYPE (arg), arg, inc);
5259 TREE_SIDE_EFFECTS (val) = 1;
5264 /* Note that this operation never does default_conversion
5265 regardless of NOCONVERT. */
5266 return cp_build_addr_expr (arg, complain);
5275 argtype = TREE_TYPE (arg);
5276 return fold_if_not_in_template (build1 (code, argtype, arg));
5279 if (complain & tf_error)
5280 error ("%s", errstring);
5281 return error_mark_node;
5284 /* Hook for the c-common bits that build a unary op. */
5286 build_unary_op (location_t location ATTRIBUTE_UNUSED,
5287 enum tree_code code, tree xarg, int noconvert)
5289 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5292 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5293 for certain kinds of expressions which are not really lvalues
5294 but which we can accept as lvalues.
5296 If ARG is not a kind of expression we can handle, return
5300 unary_complex_lvalue (enum tree_code code, tree arg)
5302 /* Inside a template, making these kinds of adjustments is
5303 pointless; we are only concerned with the type of the
5305 if (processing_template_decl)
5308 /* Handle (a, b) used as an "lvalue". */
5309 if (TREE_CODE (arg) == COMPOUND_EXPR)
5311 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5312 tf_warning_or_error);
5313 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5314 TREE_OPERAND (arg, 0), real_result);
5317 /* Handle (a ? b : c) used as an "lvalue". */
5318 if (TREE_CODE (arg) == COND_EXPR
5319 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5320 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5322 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5323 if (TREE_CODE (arg) == MODIFY_EXPR
5324 || TREE_CODE (arg) == PREINCREMENT_EXPR
5325 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5327 tree lvalue = TREE_OPERAND (arg, 0);
5328 if (TREE_SIDE_EFFECTS (lvalue))
5330 lvalue = stabilize_reference (lvalue);
5331 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5332 lvalue, TREE_OPERAND (arg, 1));
5334 return unary_complex_lvalue
5335 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5338 if (code != ADDR_EXPR)
5341 /* Handle (a = b) used as an "lvalue" for `&'. */
5342 if (TREE_CODE (arg) == MODIFY_EXPR
5343 || TREE_CODE (arg) == INIT_EXPR)
5345 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5346 tf_warning_or_error);
5347 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5349 TREE_NO_WARNING (arg) = 1;
5353 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5354 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5355 || TREE_CODE (arg) == OFFSET_REF)
5358 /* We permit compiler to make function calls returning
5359 objects of aggregate type look like lvalues. */
5363 if (TREE_CODE (targ) == SAVE_EXPR)
5364 targ = TREE_OPERAND (targ, 0);
5366 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5368 if (TREE_CODE (arg) == SAVE_EXPR)
5371 targ = build_cplus_new (TREE_TYPE (arg), arg, tf_warning_or_error);
5372 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5375 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5376 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5377 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5380 /* Don't let anything else be handled specially. */
5384 /* Mark EXP saying that we need to be able to take the
5385 address of it; it should not be allocated in a register.
5386 Value is true if successful.
5388 C++: we do not allow `current_class_ptr' to be addressable. */
5391 cxx_mark_addressable (tree exp)
5396 switch (TREE_CODE (x))
5403 x = TREE_OPERAND (x, 0);
5407 if (x == current_class_ptr)
5409 error ("cannot take the address of %<this%>, which is an rvalue expression");
5410 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5416 /* Caller should not be trying to mark initialized
5417 constant fields addressable. */
5418 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5419 || DECL_IN_AGGR_P (x) == 0
5421 || DECL_EXTERNAL (x));
5425 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5426 && !DECL_ARTIFICIAL (x))
5428 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5431 ("address of explicit register variable %qD requested", x);
5434 else if (extra_warnings)
5436 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5438 TREE_ADDRESSABLE (x) = 1;
5443 TREE_ADDRESSABLE (x) = 1;
5447 TREE_ADDRESSABLE (x) = 1;
5451 TREE_ADDRESSABLE (x) = 1;
5452 cxx_mark_addressable (TREE_OPERAND (x, 0));
5460 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5463 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5464 tsubst_flags_t complain)
5466 tree orig_ifexp = ifexp;
5467 tree orig_op1 = op1;
5468 tree orig_op2 = op2;
5471 if (processing_template_decl)
5473 /* The standard says that the expression is type-dependent if
5474 IFEXP is type-dependent, even though the eventual type of the
5475 expression doesn't dependent on IFEXP. */
5476 if (type_dependent_expression_p (ifexp)
5477 /* As a GNU extension, the middle operand may be omitted. */
5478 || (op1 && type_dependent_expression_p (op1))
5479 || type_dependent_expression_p (op2))
5480 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5481 ifexp = build_non_dependent_expr (ifexp);
5483 op1 = build_non_dependent_expr (op1);
5484 op2 = build_non_dependent_expr (op2);
5487 expr = build_conditional_expr (ifexp, op1, op2, complain);
5488 if (processing_template_decl && expr != error_mark_node)
5489 return build_min_non_dep (COND_EXPR, expr,
5490 orig_ifexp, orig_op1, orig_op2);
5494 /* Given a list of expressions, return a compound expression
5495 that performs them all and returns the value of the last of them. */
5498 build_x_compound_expr_from_list (tree list, expr_list_kind exp,
5499 tsubst_flags_t complain)
5501 tree expr = TREE_VALUE (list);
5503 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5504 && !CONSTRUCTOR_IS_DIRECT_INIT (expr))
5506 if (complain & tf_error)
5507 pedwarn (EXPR_LOC_OR_HERE (expr), 0, "list-initializer for "
5508 "non-class type must not be parenthesized");
5510 return error_mark_node;
5513 if (TREE_CHAIN (list))
5515 if (complain & tf_error)
5519 permerror (input_location, "expression list treated as compound "
5520 "expression in initializer");
5523 permerror (input_location, "expression list treated as compound "
5524 "expression in mem-initializer");
5527 permerror (input_location, "expression list treated as compound "
5528 "expression in functional cast");
5534 return error_mark_node;
5536 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5537 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5544 /* Like build_x_compound_expr_from_list, but using a VEC. */
5547 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5549 if (VEC_empty (tree, vec))
5551 else if (VEC_length (tree, vec) == 1)
5552 return VEC_index (tree, vec, 0);
5560 permerror (input_location,
5561 "%s expression list treated as compound expression",
5564 expr = VEC_index (tree, vec, 0);
5565 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5566 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5572 /* Handle overloading of the ',' operator when needed. */
5575 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5578 tree orig_op1 = op1;
5579 tree orig_op2 = op2;
5581 if (processing_template_decl)
5583 if (type_dependent_expression_p (op1)
5584 || type_dependent_expression_p (op2))
5585 return build_min_nt (COMPOUND_EXPR, op1, op2);
5586 op1 = build_non_dependent_expr (op1);
5587 op2 = build_non_dependent_expr (op2);
5590 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5591 /*overload=*/NULL, complain);
5593 result = cp_build_compound_expr (op1, op2, complain);
5595 if (processing_template_decl && result != error_mark_node)
5596 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5601 /* Like cp_build_compound_expr, but for the c-common bits. */
5604 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5606 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5609 /* Build a compound expression. */
5612 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5614 lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
5616 if (lhs == error_mark_node || rhs == error_mark_node)
5617 return error_mark_node;
5619 if (TREE_CODE (rhs) == TARGET_EXPR)
5621 /* If the rhs is a TARGET_EXPR, then build the compound
5622 expression inside the target_expr's initializer. This
5623 helps the compiler to eliminate unnecessary temporaries. */
5624 tree init = TREE_OPERAND (rhs, 1);
5626 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5627 TREE_OPERAND (rhs, 1) = init;
5632 if (type_unknown_p (rhs))
5634 error ("no context to resolve type of %qE", rhs);
5635 return error_mark_node;
5638 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5641 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5642 casts away constness. CAST gives the type of cast. Returns true
5643 if the cast is ill-formed, false if it is well-formed.
5645 ??? This function warns for casting away any qualifier not just
5646 const. We would like to specify exactly what qualifiers are casted
5651 check_for_casting_away_constness (tree src_type, tree dest_type,
5652 enum tree_code cast, tsubst_flags_t complain)
5654 /* C-style casts are allowed to cast away constness. With
5655 WARN_CAST_QUAL, we still want to issue a warning. */
5656 if (cast == CAST_EXPR && !warn_cast_qual)
5659 if (!casts_away_constness (src_type, dest_type))
5665 if (complain & tf_warning)
5666 warning (OPT_Wcast_qual,
5667 "cast from type %qT to type %qT casts away qualifiers",
5668 src_type, dest_type);
5671 case STATIC_CAST_EXPR:
5672 if (complain & tf_error)
5673 error ("static_cast from type %qT to type %qT casts away qualifiers",
5674 src_type, dest_type);
5677 case REINTERPRET_CAST_EXPR:
5678 if (complain & tf_error)
5679 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5680 src_type, dest_type);
5688 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5689 (another pointer-to-member type in the same hierarchy) and return
5690 the converted expression. If ALLOW_INVERSE_P is permitted, a
5691 pointer-to-derived may be converted to pointer-to-base; otherwise,
5692 only the other direction is permitted. If C_CAST_P is true, this
5693 conversion is taking place as part of a C-style cast. */
5696 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5697 bool c_cast_p, tsubst_flags_t complain)
5699 if (TYPE_PTRMEM_P (type))
5703 if (TREE_CODE (expr) == PTRMEM_CST)
5704 expr = cplus_expand_constant (expr);
5705 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5706 TYPE_PTRMEM_CLASS_TYPE (type),
5708 c_cast_p, complain);
5709 if (delta == error_mark_node)
5710 return error_mark_node;
5712 if (!integer_zerop (delta))
5714 tree cond, op1, op2;
5716 cond = cp_build_binary_op (input_location,
5719 build_int_cst (TREE_TYPE (expr), -1),
5720 tf_warning_or_error);
5721 op1 = build_nop (ptrdiff_type_node, expr);
5722 op2 = cp_build_binary_op (input_location,
5723 PLUS_EXPR, op1, delta,
5724 tf_warning_or_error);
5726 expr = fold_build3_loc (input_location,
5727 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5731 return build_nop (type, expr);
5734 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5735 allow_inverse_p, c_cast_p, complain);
5738 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5739 this static_cast is being attempted as one of the possible casts
5740 allowed by a C-style cast. (In that case, accessibility of base
5741 classes is not considered, and it is OK to cast away
5742 constness.) Return the result of the cast. *VALID_P is set to
5743 indicate whether or not the cast was valid. */
5746 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5747 bool *valid_p, tsubst_flags_t complain)
5752 /* Assume the cast is valid. */
5755 intype = TREE_TYPE (expr);
5757 /* Save casted types in the function's used types hash table. */
5758 used_types_insert (type);
5760 /* [expr.static.cast]
5762 An lvalue of type "cv1 B", where B is a class type, can be cast
5763 to type "reference to cv2 D", where D is a class derived (clause
5764 _class.derived_) from B, if a valid standard conversion from
5765 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5766 same cv-qualification as, or greater cv-qualification than, cv1,
5767 and B is not a virtual base class of D. */
5768 /* We check this case before checking the validity of "TYPE t =
5769 EXPR;" below because for this case:
5772 struct D : public B { D(const B&); };
5774 void f() { static_cast<const D&>(b); }
5776 we want to avoid constructing a new D. The standard is not
5777 completely clear about this issue, but our interpretation is
5778 consistent with other compilers. */
5779 if (TREE_CODE (type) == REFERENCE_TYPE
5780 && CLASS_TYPE_P (TREE_TYPE (type))
5781 && CLASS_TYPE_P (intype)
5782 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5783 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5784 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5785 build_pointer_type (TYPE_MAIN_VARIANT
5786 (TREE_TYPE (type))))
5788 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5792 /* There is a standard conversion from "D*" to "B*" even if "B"
5793 is ambiguous or inaccessible. If this is really a
5794 static_cast, then we check both for inaccessibility and
5795 ambiguity. However, if this is a static_cast being performed
5796 because the user wrote a C-style cast, then accessibility is
5798 base = lookup_base (TREE_TYPE (type), intype,
5799 c_cast_p ? ba_unique : ba_check,
5802 /* Convert from "B*" to "D*". This function will check that "B"
5803 is not a virtual base of "D". */
5804 expr = build_base_path (MINUS_EXPR, build_address (expr),
5805 base, /*nonnull=*/false, complain);
5806 /* Convert the pointer to a reference -- but then remember that
5807 there are no expressions with reference type in C++.
5809 We call rvalue so that there's an actual tree code
5810 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5811 is a variable with the same type, the conversion would get folded
5812 away, leaving just the variable and causing lvalue_kind to give
5813 the wrong answer. */
5814 return convert_from_reference (rvalue (cp_fold_convert (type, expr)));
5817 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
5818 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5819 if (TREE_CODE (type) == REFERENCE_TYPE
5820 && TYPE_REF_IS_RVALUE (type)
5821 && lvalue_or_rvalue_with_address_p (expr)
5822 && reference_related_p (TREE_TYPE (type), intype)
5823 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5825 expr = build_typed_address (expr, type);
5826 return convert_from_reference (expr);
5829 /* Resolve overloaded address here rather than once in
5830 implicit_conversion and again in the inverse code below. */
5831 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5833 expr = instantiate_type (type, expr, complain);
5834 intype = TREE_TYPE (expr);
5837 /* [expr.static.cast]
5839 An expression e can be explicitly converted to a type T using a
5840 static_cast of the form static_cast<T>(e) if the declaration T
5841 t(e);" is well-formed, for some invented temporary variable
5843 result = perform_direct_initialization_if_possible (type, expr,
5844 c_cast_p, complain);
5847 result = convert_from_reference (result);
5849 /* [expr.static.cast]
5851 If T is a reference type, the result is an lvalue; otherwise,
5852 the result is an rvalue. */
5853 if (TREE_CODE (type) != REFERENCE_TYPE)
5854 result = rvalue (result);
5858 /* [expr.static.cast]
5860 Any expression can be explicitly converted to type cv void. */
5861 if (TREE_CODE (type) == VOID_TYPE)
5862 return convert_to_void (expr, ICV_CAST, complain);
5864 /* [expr.static.cast]
5866 The inverse of any standard conversion sequence (clause _conv_),
5867 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5868 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5869 (_conv.bool_) conversions, can be performed explicitly using
5870 static_cast subject to the restriction that the explicit
5871 conversion does not cast away constness (_expr.const.cast_), and
5872 the following additional rules for specific cases: */
5873 /* For reference, the conversions not excluded are: integral
5874 promotions, floating point promotion, integral conversions,
5875 floating point conversions, floating-integral conversions,
5876 pointer conversions, and pointer to member conversions. */
5879 A value of integral _or enumeration_ type can be explicitly
5880 converted to an enumeration type. */
5881 /* The effect of all that is that any conversion between any two
5882 types which are integral, floating, or enumeration types can be
5884 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5885 || SCALAR_FLOAT_TYPE_P (type))
5886 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5887 || SCALAR_FLOAT_TYPE_P (intype)))
5888 return ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5890 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5891 && CLASS_TYPE_P (TREE_TYPE (type))
5892 && CLASS_TYPE_P (TREE_TYPE (intype))
5893 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5894 (TREE_TYPE (intype))),
5895 build_pointer_type (TYPE_MAIN_VARIANT
5896 (TREE_TYPE (type)))))
5901 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5903 return error_mark_node;
5904 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5905 c_cast_p ? ba_unique : ba_check,
5907 expr = build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false,
5909 return cp_fold_convert(type, expr);
5912 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5913 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5920 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5921 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5923 if (TYPE_PTRMEM_P (type))
5925 t1 = (build_ptrmem_type
5927 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5928 t2 = (build_ptrmem_type
5930 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5937 if (can_convert (t1, t2) || can_convert (t2, t1))
5940 && check_for_casting_away_constness (intype, type,
5943 return error_mark_node;
5944 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5945 c_cast_p, complain);
5949 /* [expr.static.cast]
5951 An rvalue of type "pointer to cv void" can be explicitly
5952 converted to a pointer to object type. A value of type pointer
5953 to object converted to "pointer to cv void" and back to the
5954 original pointer type will have its original value. */
5955 if (TREE_CODE (intype) == POINTER_TYPE
5956 && VOID_TYPE_P (TREE_TYPE (intype))
5957 && TYPE_PTROB_P (type))
5960 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5962 return error_mark_node;
5963 return build_nop (type, expr);
5967 return error_mark_node;
5970 /* Return an expression representing static_cast<TYPE>(EXPR). */
5973 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5978 if (type == error_mark_node || expr == error_mark_node)
5979 return error_mark_node;
5981 if (processing_template_decl)
5983 expr = build_min (STATIC_CAST_EXPR, type, expr);
5984 /* We don't know if it will or will not have side effects. */
5985 TREE_SIDE_EFFECTS (expr) = 1;
5986 return convert_from_reference (expr);
5989 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5990 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5991 if (TREE_CODE (type) != REFERENCE_TYPE
5992 && TREE_CODE (expr) == NOP_EXPR
5993 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5994 expr = TREE_OPERAND (expr, 0);
5996 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
6001 if (complain & tf_error)
6002 error ("invalid static_cast from type %qT to type %qT",
6003 TREE_TYPE (expr), type);
6004 return error_mark_node;
6007 /* EXPR is an expression with member function or pointer-to-member
6008 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6009 not permitted by ISO C++, but we accept it in some modes. If we
6010 are not in one of those modes, issue a diagnostic. Return the
6011 converted expression. */
6014 convert_member_func_to_ptr (tree type, tree expr)
6019 intype = TREE_TYPE (expr);
6020 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
6021 || TREE_CODE (intype) == METHOD_TYPE);
6023 if (pedantic || warn_pmf2ptr)
6024 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
6025 "converting from %qT to %qT", intype, type);
6027 if (TREE_CODE (intype) == METHOD_TYPE)
6028 expr = build_addr_func (expr);
6029 else if (TREE_CODE (expr) == PTRMEM_CST)
6030 expr = build_address (PTRMEM_CST_MEMBER (expr));
6033 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
6034 decl = build_address (decl);
6035 expr = get_member_function_from_ptrfunc (&decl, expr);
6038 return build_nop (type, expr);
6041 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6042 If C_CAST_P is true, this reinterpret cast is being done as part of
6043 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6044 indicate whether or not reinterpret_cast was valid. */
6047 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
6048 bool *valid_p, tsubst_flags_t complain)
6052 /* Assume the cast is invalid. */
6056 if (type == error_mark_node || error_operand_p (expr))
6057 return error_mark_node;
6059 intype = TREE_TYPE (expr);
6061 /* Save casted types in the function's used types hash table. */
6062 used_types_insert (type);
6064 /* [expr.reinterpret.cast]
6065 An lvalue expression of type T1 can be cast to the type
6066 "reference to T2" if an expression of type "pointer to T1" can be
6067 explicitly converted to the type "pointer to T2" using a
6068 reinterpret_cast. */
6069 if (TREE_CODE (type) == REFERENCE_TYPE)
6071 if (! real_lvalue_p (expr))
6073 if (complain & tf_error)
6074 error ("invalid cast of an rvalue expression of type "
6077 return error_mark_node;
6080 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6081 "B" are related class types; the reinterpret_cast does not
6082 adjust the pointer. */
6083 if (TYPE_PTR_P (intype)
6084 && (complain & tf_warning)
6085 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6086 COMPARE_BASE | COMPARE_DERIVED)))
6087 warning (0, "casting %qT to %qT does not dereference pointer",
6090 expr = cp_build_addr_expr (expr, complain);
6092 if (warn_strict_aliasing > 2)
6093 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6095 if (expr != error_mark_node)
6096 expr = build_reinterpret_cast_1
6097 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6099 if (expr != error_mark_node)
6100 /* cp_build_indirect_ref isn't right for rvalue refs. */
6101 expr = convert_from_reference (fold_convert (type, expr));
6105 /* As a G++ extension, we consider conversions from member
6106 functions, and pointers to member functions to
6107 pointer-to-function and pointer-to-void types. If
6108 -Wno-pmf-conversions has not been specified,
6109 convert_member_func_to_ptr will issue an error message. */
6110 if ((TYPE_PTRMEMFUNC_P (intype)
6111 || TREE_CODE (intype) == METHOD_TYPE)
6112 && TYPE_PTR_P (type)
6113 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6114 || VOID_TYPE_P (TREE_TYPE (type))))
6115 return convert_member_func_to_ptr (type, expr);
6117 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6118 array-to-pointer, and function-to-pointer conversions are
6120 expr = decay_conversion (expr);
6122 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6123 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6124 if (TREE_CODE (expr) == NOP_EXPR
6125 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6126 expr = TREE_OPERAND (expr, 0);
6128 if (error_operand_p (expr))
6129 return error_mark_node;
6131 intype = TREE_TYPE (expr);
6133 /* [expr.reinterpret.cast]
6134 A pointer can be converted to any integral type large enough to
6135 hold it. ... A value of type std::nullptr_t can be converted to
6136 an integral type; the conversion has the same meaning and
6137 validity as a conversion of (void*)0 to the integral type. */
6138 if (CP_INTEGRAL_TYPE_P (type)
6139 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6141 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6143 if (complain & tf_error)
6144 permerror (input_location, "cast from %qT to %qT loses precision",
6147 return error_mark_node;
6149 if (NULLPTR_TYPE_P (intype))
6150 return build_int_cst (type, 0);
6152 /* [expr.reinterpret.cast]
6153 A value of integral or enumeration type can be explicitly
6154 converted to a pointer. */
6155 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6158 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6159 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6160 return fold_if_not_in_template (build_nop (type, expr));
6161 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6162 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6167 && check_for_casting_away_constness (intype, type,
6168 REINTERPRET_CAST_EXPR,
6170 return error_mark_node;
6171 /* Warn about possible alignment problems. */
6172 if (STRICT_ALIGNMENT && warn_cast_align
6173 && (complain & tf_warning)
6174 && !VOID_TYPE_P (type)
6175 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6176 && COMPLETE_TYPE_P (TREE_TYPE (type))
6177 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6178 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6179 warning (OPT_Wcast_align, "cast from %qT to %qT "
6180 "increases required alignment of target type", intype, type);
6182 /* We need to strip nops here, because the front end likes to
6183 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6185 if (warn_strict_aliasing <= 2)
6186 strict_aliasing_warning (intype, type, sexpr);
6188 return fold_if_not_in_template (build_nop (type, expr));
6190 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6191 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6193 if (pedantic && (complain & tf_warning))
6194 /* Only issue a warning, as we have always supported this
6195 where possible, and it is necessary in some cases. DR 195
6196 addresses this issue, but as of 2004/10/26 is still in
6198 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6199 return fold_if_not_in_template (build_nop (type, expr));
6201 else if (TREE_CODE (type) == VECTOR_TYPE)
6202 return fold_if_not_in_template (convert_to_vector (type, expr));
6203 else if (TREE_CODE (intype) == VECTOR_TYPE
6204 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6205 return fold_if_not_in_template (convert_to_integer (type, expr));
6210 if (complain & tf_error)
6211 error ("invalid cast from type %qT to type %qT", intype, type);
6212 return error_mark_node;
6215 return cp_convert (type, expr);
6219 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6221 if (type == error_mark_node || expr == error_mark_node)
6222 return error_mark_node;
6224 if (processing_template_decl)
6226 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6228 if (!TREE_SIDE_EFFECTS (t)
6229 && type_dependent_expression_p (expr))
6230 /* There might turn out to be side effects inside expr. */
6231 TREE_SIDE_EFFECTS (t) = 1;
6232 return convert_from_reference (t);
6235 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6236 /*valid_p=*/NULL, complain);
6239 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6240 return an appropriate expression. Otherwise, return
6241 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6242 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6243 performing a C-style cast, its value upon return will indicate
6244 whether or not the conversion succeeded. */
6247 build_const_cast_1 (tree dst_type, tree expr, tsubst_flags_t complain,
6251 tree reference_type;
6253 /* Callers are responsible for handling error_mark_node as a
6254 destination type. */
6255 gcc_assert (dst_type != error_mark_node);
6256 /* In a template, callers should be building syntactic
6257 representations of casts, not using this machinery. */
6258 gcc_assert (!processing_template_decl);
6260 /* Assume the conversion is invalid. */
6264 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
6266 if (complain & tf_error)
6267 error ("invalid use of const_cast with type %qT, "
6268 "which is not a pointer, "
6269 "reference, nor a pointer-to-data-member type", dst_type);
6270 return error_mark_node;
6273 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
6275 if (complain & tf_error)
6276 error ("invalid use of const_cast with type %qT, which is a pointer "
6277 "or reference to a function type", dst_type);
6278 return error_mark_node;
6281 /* Save casted types in the function's used types hash table. */
6282 used_types_insert (dst_type);
6284 src_type = TREE_TYPE (expr);
6285 /* Expressions do not really have reference types. */
6286 if (TREE_CODE (src_type) == REFERENCE_TYPE)
6287 src_type = TREE_TYPE (src_type);
6289 /* [expr.const.cast]
6291 For two object types T1 and T2, if a pointer to T1 can be explicitly
6292 converted to the type "pointer to T2" using a const_cast, then the
6293 following conversions can also be made:
6295 -- an lvalue of type T1 can be explicitly converted to an lvalue of
6296 type T2 using the cast const_cast<T2&>;
6298 -- a glvalue of type T1 can be explicitly converted to an xvalue of
6299 type T2 using the cast const_cast<T2&&>; and
6301 -- if T1 is a class type, a prvalue of type T1 can be explicitly
6302 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
6304 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
6306 reference_type = dst_type;
6307 if (!TYPE_REF_IS_RVALUE (dst_type)
6308 ? real_lvalue_p (expr)
6309 : (CLASS_TYPE_P (TREE_TYPE (dst_type))
6311 : lvalue_or_rvalue_with_address_p (expr)))
6315 if (complain & tf_error)
6316 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6317 src_type, dst_type);
6318 return error_mark_node;
6320 dst_type = build_pointer_type (TREE_TYPE (dst_type));
6321 src_type = build_pointer_type (src_type);
6325 reference_type = NULL_TREE;
6326 /* If the destination type is not a reference type, the
6327 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6328 conversions are performed. */
6329 src_type = type_decays_to (src_type);
6330 if (src_type == error_mark_node)
6331 return error_mark_node;
6334 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
6335 && comp_ptr_ttypes_const (dst_type, src_type))
6340 /* This cast is actually a C-style cast. Issue a warning if
6341 the user is making a potentially unsafe cast. */
6342 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR,
6347 expr = cp_build_addr_expr (expr, complain);
6348 expr = build_nop (reference_type, expr);
6349 return convert_from_reference (expr);
6353 expr = decay_conversion (expr);
6354 /* build_c_cast puts on a NOP_EXPR to make the result not an
6355 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6356 non-lvalue context. */
6357 if (TREE_CODE (expr) == NOP_EXPR
6358 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6359 expr = TREE_OPERAND (expr, 0);
6360 return build_nop (dst_type, expr);
6364 if (complain & tf_error)
6365 error ("invalid const_cast from type %qT to type %qT",
6366 src_type, dst_type);
6367 return error_mark_node;
6371 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
6373 if (type == error_mark_node || error_operand_p (expr))
6374 return error_mark_node;
6376 if (processing_template_decl)
6378 tree t = build_min (CONST_CAST_EXPR, type, expr);
6380 if (!TREE_SIDE_EFFECTS (t)
6381 && type_dependent_expression_p (expr))
6382 /* There might turn out to be side effects inside expr. */
6383 TREE_SIDE_EFFECTS (t) = 1;
6384 return convert_from_reference (t);
6387 return build_const_cast_1 (type, expr, complain,
6391 /* Like cp_build_c_cast, but for the c-common bits. */
6394 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
6396 return cp_build_c_cast (type, expr, tf_warning_or_error);
6399 /* Build an expression representing an explicit C-style cast to type
6400 TYPE of expression EXPR. */
6403 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
6409 if (type == error_mark_node || error_operand_p (expr))
6410 return error_mark_node;
6412 if (processing_template_decl)
6414 tree t = build_min (CAST_EXPR, type,
6415 tree_cons (NULL_TREE, value, NULL_TREE));
6416 /* We don't know if it will or will not have side effects. */
6417 TREE_SIDE_EFFECTS (t) = 1;
6418 return convert_from_reference (t);
6421 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6422 'Class') should always be retained, because this information aids
6423 in method lookup. */
6424 if (objc_is_object_ptr (type)
6425 && objc_is_object_ptr (TREE_TYPE (expr)))
6426 return build_nop (type, expr);
6428 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6429 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6430 if (TREE_CODE (type) != REFERENCE_TYPE
6431 && TREE_CODE (value) == NOP_EXPR
6432 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6433 value = TREE_OPERAND (value, 0);
6435 if (TREE_CODE (type) == ARRAY_TYPE)
6437 /* Allow casting from T1* to T2[] because Cfront allows it.
6438 NIHCL uses it. It is not valid ISO C++ however. */
6439 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6441 if (complain & tf_error)
6442 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6444 return error_mark_node;
6445 type = build_pointer_type (TREE_TYPE (type));
6449 if (complain & tf_error)
6450 error ("ISO C++ forbids casting to an array type %qT", type);
6451 return error_mark_node;
6455 if (TREE_CODE (type) == FUNCTION_TYPE
6456 || TREE_CODE (type) == METHOD_TYPE)
6458 if (complain & tf_error)
6459 error ("invalid cast to function type %qT", type);
6460 return error_mark_node;
6463 if (TREE_CODE (type) == POINTER_TYPE
6464 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
6465 /* Casting to an integer of smaller size is an error detected elsewhere. */
6466 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
6467 /* Don't warn about converting any constant. */
6468 && !TREE_CONSTANT (value))
6469 warning_at (input_location, OPT_Wint_to_pointer_cast,
6470 "cast to pointer from integer of different size");
6472 /* A C-style cast can be a const_cast. */
6473 result = build_const_cast_1 (type, value, complain & tf_warning,
6478 /* Or a static cast. */
6479 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6480 &valid_p, complain);
6481 /* Or a reinterpret_cast. */
6483 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6484 &valid_p, complain);
6485 /* The static_cast or reinterpret_cast may be followed by a
6488 /* A valid cast may result in errors if, for example, a
6489 conversion to am ambiguous base class is required. */
6490 && !error_operand_p (result))
6494 /* Non-class rvalues always have cv-unqualified type. */
6495 if (!CLASS_TYPE_P (type))
6496 type = TYPE_MAIN_VARIANT (type);
6497 result_type = TREE_TYPE (result);
6498 if (!CLASS_TYPE_P (result_type) && TREE_CODE (type) != REFERENCE_TYPE)
6499 result_type = TYPE_MAIN_VARIANT (result_type);
6500 /* If the type of RESULT does not match TYPE, perform a
6501 const_cast to make it match. If the static_cast or
6502 reinterpret_cast succeeded, we will differ by at most
6503 cv-qualification, so the follow-on const_cast is guaranteed
6505 if (!same_type_p (non_reference (type), non_reference (result_type)))
6507 result = build_const_cast_1 (type, result, false, &valid_p);
6508 gcc_assert (valid_p);
6513 return error_mark_node;
6516 /* For use from the C common bits. */
6518 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6519 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6520 enum tree_code modifycode,
6521 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6522 tree rhs_origtype ATTRIBUTE_UNUSED)
6524 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6527 /* Build an assignment expression of lvalue LHS from value RHS.
6528 MODIFYCODE is the code for a binary operator that we use
6529 to combine the old value of LHS with RHS to get the new value.
6530 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6532 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6535 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6536 tsubst_flags_t complain)
6540 tree lhstype = TREE_TYPE (lhs);
6541 tree olhstype = lhstype;
6542 bool plain_assign = (modifycode == NOP_EXPR);
6544 /* Avoid duplicate error messages from operands that had errors. */
6545 if (error_operand_p (lhs) || error_operand_p (rhs))
6546 return error_mark_node;
6548 /* Handle control structure constructs used as "lvalues". */
6549 switch (TREE_CODE (lhs))
6551 /* Handle --foo = 5; as these are valid constructs in C++. */
6552 case PREDECREMENT_EXPR:
6553 case PREINCREMENT_EXPR:
6554 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6555 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6556 stabilize_reference (TREE_OPERAND (lhs, 0)),
6557 TREE_OPERAND (lhs, 1));
6558 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6559 modifycode, rhs, complain);
6560 if (newrhs == error_mark_node)
6561 return error_mark_node;
6562 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6564 /* Handle (a, b) used as an "lvalue". */
6566 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6567 modifycode, rhs, complain);
6568 if (newrhs == error_mark_node)
6569 return error_mark_node;
6570 return build2 (COMPOUND_EXPR, lhstype,
6571 TREE_OPERAND (lhs, 0), newrhs);
6574 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6575 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6576 stabilize_reference (TREE_OPERAND (lhs, 0)),
6577 TREE_OPERAND (lhs, 1));
6578 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6580 if (newrhs == error_mark_node)
6581 return error_mark_node;
6582 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6586 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6587 when neither operand has side-effects. */
6588 if (!lvalue_or_else (lhs, lv_assign, complain))
6589 return error_mark_node;
6591 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6592 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6594 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6595 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6597 TREE_OPERAND (lhs, 0),
6598 TREE_OPERAND (lhs, 1)),
6599 TREE_OPERAND (lhs, 0),
6600 TREE_OPERAND (lhs, 1));
6603 /* Handle (a ? b : c) used as an "lvalue". */
6606 /* Produce (a ? (b = rhs) : (c = rhs))
6607 except that the RHS goes through a save-expr
6608 so the code to compute it is only emitted once. */
6610 tree preeval = NULL_TREE;
6612 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6614 if (complain & tf_error)
6615 error ("void value not ignored as it ought to be");
6616 return error_mark_node;
6619 rhs = stabilize_expr (rhs, &preeval);
6621 /* Check this here to avoid odd errors when trying to convert
6622 a throw to the type of the COND_EXPR. */
6623 if (!lvalue_or_else (lhs, lv_assign, complain))
6624 return error_mark_node;
6626 cond = build_conditional_expr
6627 (TREE_OPERAND (lhs, 0),
6628 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6629 modifycode, rhs, complain),
6630 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6631 modifycode, rhs, complain),
6634 if (cond == error_mark_node)
6636 /* Make sure the code to compute the rhs comes out
6637 before the split. */
6639 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6647 if (modifycode == INIT_EXPR)
6649 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6650 /* Do the default thing. */;
6651 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6653 /* Compound literal. */
6654 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6655 /* Call convert to generate an error; see PR 11063. */
6656 rhs = convert (lhstype, rhs);
6657 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6658 TREE_SIDE_EFFECTS (result) = 1;
6661 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6662 /* Do the default thing. */;
6665 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6666 result = build_special_member_call (lhs, complete_ctor_identifier,
6667 &rhs_vec, lhstype, LOOKUP_NORMAL,
6669 release_tree_vector (rhs_vec);
6670 if (result == NULL_TREE)
6671 return error_mark_node;
6677 lhs = require_complete_type_sfinae (lhs, complain);
6678 if (lhs == error_mark_node)
6679 return error_mark_node;
6681 if (modifycode == NOP_EXPR)
6683 if (c_dialect_objc ())
6685 result = objc_maybe_build_modify_expr (lhs, rhs);
6690 /* `operator=' is not an inheritable operator. */
6691 if (! MAYBE_CLASS_TYPE_P (lhstype))
6692 /* Do the default thing. */;
6695 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6696 lhs, rhs, make_node (NOP_EXPR),
6699 if (result == NULL_TREE)
6700 return error_mark_node;
6707 tree init = NULL_TREE;
6709 /* A binary op has been requested. Combine the old LHS
6710 value with the RHS producing the value we should actually
6711 store into the LHS. */
6712 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6713 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6714 || MAYBE_CLASS_TYPE_P (lhstype)));
6716 /* Preevaluate the RHS to make sure its evaluation is complete
6717 before the lvalue-to-rvalue conversion of the LHS:
6719 [expr.ass] With respect to an indeterminately-sequenced
6720 function call, the operation of a compound assignment is a
6721 single evaluation. [ Note: Therefore, a function call shall
6722 not intervene between the lvalue-to-rvalue conversion and the
6723 side effect associated with any single compound assignment
6724 operator. -- end note ] */
6725 lhs = stabilize_reference (lhs);
6726 if (TREE_SIDE_EFFECTS (rhs))
6727 rhs = mark_rvalue_use (rhs);
6728 rhs = stabilize_expr (rhs, &init);
6729 newrhs = cp_build_binary_op (input_location,
6730 modifycode, lhs, rhs,
6732 if (newrhs == error_mark_node)
6734 if (complain & tf_error)
6735 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6736 TREE_TYPE (lhs), TREE_TYPE (rhs));
6737 return error_mark_node;
6741 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), init, newrhs);
6743 /* Now it looks like a plain assignment. */
6744 modifycode = NOP_EXPR;
6745 if (c_dialect_objc ())
6747 result = objc_maybe_build_modify_expr (lhs, newrhs);
6752 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6753 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6756 /* The left-hand side must be an lvalue. */
6757 if (!lvalue_or_else (lhs, lv_assign, complain))
6758 return error_mark_node;
6760 /* Warn about modifying something that is `const'. Don't warn if
6761 this is initialization. */
6762 if (modifycode != INIT_EXPR
6763 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6764 /* Functions are not modifiable, even though they are
6766 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6767 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6768 /* If it's an aggregate and any field is const, then it is
6769 effectively const. */
6770 || (CLASS_TYPE_P (lhstype)
6771 && C_TYPE_FIELDS_READONLY (lhstype))))
6773 if (complain & tf_error)
6774 cxx_readonly_error (lhs, lv_assign);
6776 return error_mark_node;
6779 /* If storing into a structure or union member, it may have been given a
6780 lowered bitfield type. We need to convert to the declared type first,
6781 so retrieve it now. */
6783 olhstype = unlowered_expr_type (lhs);
6785 /* Convert new value to destination type. */
6787 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6791 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
6793 if (modifycode != INIT_EXPR)
6795 if (complain & tf_error)
6796 error ("assigning to an array from an initializer list");
6797 return error_mark_node;
6799 if (check_array_initializer (lhs, lhstype, newrhs))
6800 return error_mark_node;
6801 newrhs = digest_init (lhstype, newrhs, complain);
6802 if (newrhs == error_mark_node)
6803 return error_mark_node;
6806 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6807 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
6809 if (complain & tf_error)
6810 error ("incompatible types in assignment of %qT to %qT",
6811 TREE_TYPE (rhs), lhstype);
6812 return error_mark_node;
6815 /* Allow array assignment in compiler-generated code. */
6816 else if (!current_function_decl
6817 || !DECL_DEFAULTED_FN (current_function_decl))
6819 /* This routine is used for both initialization and assignment.
6820 Make sure the diagnostic message differentiates the context. */
6821 if (complain & tf_error)
6823 if (modifycode == INIT_EXPR)
6824 error ("array used as initializer");
6826 error ("invalid array assignment");
6828 return error_mark_node;
6831 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6832 ? 1 + (modifycode != INIT_EXPR): 0;
6833 return build_vec_init (lhs, NULL_TREE, newrhs,
6834 /*explicit_value_init_p=*/false,
6835 from_array, complain);
6838 if (modifycode == INIT_EXPR)
6839 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6840 LOOKUP_ONLYCONVERTING. */
6841 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6842 ICR_INIT, NULL_TREE, 0,
6845 newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
6846 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6848 if (!same_type_p (lhstype, olhstype))
6849 newrhs = cp_convert_and_check (lhstype, newrhs);
6851 if (modifycode != INIT_EXPR)
6853 if (TREE_CODE (newrhs) == CALL_EXPR
6854 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6855 newrhs = build_cplus_new (lhstype, newrhs, complain);
6857 /* Can't initialize directly from a TARGET_EXPR, since that would
6858 cause the lhs to be constructed twice, and possibly result in
6859 accidental self-initialization. So we force the TARGET_EXPR to be
6860 expanded without a target. */
6861 if (TREE_CODE (newrhs) == TARGET_EXPR)
6862 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6863 TREE_OPERAND (newrhs, 0));
6866 if (newrhs == error_mark_node)
6867 return error_mark_node;
6869 if (c_dialect_objc () && flag_objc_gc)
6871 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6877 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6878 lhstype, lhs, newrhs);
6880 TREE_SIDE_EFFECTS (result) = 1;
6882 TREE_NO_WARNING (result) = 1;
6888 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6889 tsubst_flags_t complain)
6891 if (processing_template_decl)
6892 return build_min_nt (MODOP_EXPR, lhs,
6893 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6895 if (modifycode != NOP_EXPR)
6897 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6898 make_node (modifycode),
6903 TREE_NO_WARNING (rval) = 1;
6907 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6910 /* Helper function for get_delta_difference which assumes FROM is a base
6911 class of TO. Returns a delta for the conversion of pointer-to-member
6912 of FROM to pointer-to-member of TO. If the conversion is invalid and
6913 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6914 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6915 If C_CAST_P is true, this conversion is taking place as part of a
6919 get_delta_difference_1 (tree from, tree to, bool c_cast_p,
6920 tsubst_flags_t complain)
6924 base_access access = c_cast_p ? ba_unique : ba_check;
6926 /* Note: ba_quiet does not distinguish between access control and
6928 if (!(complain & tf_error))
6931 binfo = lookup_base (to, from, access, &kind);
6933 if (kind == bk_inaccessible || kind == bk_ambig)
6935 if (!(complain & tf_error))
6936 return error_mark_node;
6938 error (" in pointer to member function conversion");
6939 return size_zero_node;
6943 if (kind != bk_via_virtual)
6944 return BINFO_OFFSET (binfo);
6946 /* FROM is a virtual base class of TO. Issue an error or warning
6947 depending on whether or not this is a reinterpret cast. */
6949 if (!(complain & tf_error))
6950 return error_mark_node;
6952 error ("pointer to member conversion via virtual base %qT",
6953 BINFO_TYPE (binfo_from_vbase (binfo)));
6955 return size_zero_node;
6962 /* Get difference in deltas for different pointer to member function
6963 types. If the conversion is invalid and tf_error is not set in
6964 COMPLAIN, returns error_mark_node, otherwise returns an integer
6965 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6966 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6967 conversions as well. If C_CAST_P is true this conversion is taking
6968 place as part of a C-style cast.
6970 Note that the naming of FROM and TO is kind of backwards; the return
6971 value is what we add to a TO in order to get a FROM. They are named
6972 this way because we call this function to find out how to convert from
6973 a pointer to member of FROM to a pointer to member of TO. */
6976 get_delta_difference (tree from, tree to,
6977 bool allow_inverse_p,
6978 bool c_cast_p, tsubst_flags_t complain)
6982 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6983 /* Pointer to member of incomplete class is permitted*/
6984 result = size_zero_node;
6986 result = get_delta_difference_1 (from, to, c_cast_p, complain);
6988 if (result == error_mark_node)
6989 return error_mark_node;
6993 if (!allow_inverse_p)
6995 if (!(complain & tf_error))
6996 return error_mark_node;
6998 error_not_base_type (from, to);
6999 error (" in pointer to member conversion");
7000 result = size_zero_node;
7004 result = get_delta_difference_1 (to, from, c_cast_p, complain);
7006 if (result == error_mark_node)
7007 return error_mark_node;
7010 result = size_diffop_loc (input_location,
7011 size_zero_node, result);
7014 if (!(complain & tf_error))
7015 return error_mark_node;
7017 error_not_base_type (from, to);
7018 error (" in pointer to member conversion");
7019 result = size_zero_node;
7024 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
7028 /* Return a constructor for the pointer-to-member-function TYPE using
7029 the other components as specified. */
7032 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
7037 VEC(constructor_elt, gc) *v;
7039 /* Pull the FIELD_DECLs out of the type. */
7040 pfn_field = TYPE_FIELDS (type);
7041 delta_field = DECL_CHAIN (pfn_field);
7043 /* Make sure DELTA has the type we want. */
7044 delta = convert_and_check (delta_type_node, delta);
7046 /* Convert to the correct target type if necessary. */
7047 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
7049 /* Finish creating the initializer. */
7050 v = VEC_alloc(constructor_elt, gc, 2);
7051 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
7052 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
7053 u = build_constructor (type, v);
7054 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
7055 TREE_STATIC (u) = (TREE_CONSTANT (u)
7056 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
7058 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
7063 /* Build a constructor for a pointer to member function. It can be
7064 used to initialize global variables, local variable, or used
7065 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7068 If FORCE is nonzero, then force this conversion, even if
7069 we would rather not do it. Usually set when using an explicit
7070 cast. A C-style cast is being processed iff C_CAST_P is true.
7072 Return error_mark_node, if something goes wrong. */
7075 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
7076 tsubst_flags_t complain)
7082 if (error_operand_p (pfn))
7083 return error_mark_node;
7085 pfn_type = TREE_TYPE (pfn);
7086 to_type = build_ptrmemfunc_type (type);
7088 /* Handle multiple conversions of pointer to member functions. */
7089 if (TYPE_PTRMEMFUNC_P (pfn_type))
7091 tree delta = NULL_TREE;
7092 tree npfn = NULL_TREE;
7096 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
7097 error ("invalid conversion to type %qT from type %qT",
7100 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
7101 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
7103 c_cast_p, complain);
7104 if (n == error_mark_node)
7105 return error_mark_node;
7107 /* We don't have to do any conversion to convert a
7108 pointer-to-member to its own type. But, we don't want to
7109 just return a PTRMEM_CST if there's an explicit cast; that
7110 cast should make the expression an invalid template argument. */
7111 if (TREE_CODE (pfn) != PTRMEM_CST)
7113 if (same_type_p (to_type, pfn_type))
7115 else if (integer_zerop (n))
7116 return build_reinterpret_cast (to_type, pfn,
7117 tf_warning_or_error);
7120 if (TREE_SIDE_EFFECTS (pfn))
7121 pfn = save_expr (pfn);
7123 /* Obtain the function pointer and the current DELTA. */
7124 if (TREE_CODE (pfn) == PTRMEM_CST)
7125 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
7128 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
7129 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
7132 /* Just adjust the DELTA field. */
7133 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7134 (TREE_TYPE (delta), ptrdiff_type_node));
7135 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
7136 n = cp_build_binary_op (input_location,
7137 LSHIFT_EXPR, n, integer_one_node,
7138 tf_warning_or_error);
7139 delta = cp_build_binary_op (input_location,
7140 PLUS_EXPR, delta, n, tf_warning_or_error);
7141 return build_ptrmemfunc1 (to_type, delta, npfn);
7144 /* Handle null pointer to member function conversions. */
7145 if (null_ptr_cst_p (pfn))
7147 pfn = build_c_cast (input_location, type, integer_zero_node);
7148 return build_ptrmemfunc1 (to_type,
7153 if (type_unknown_p (pfn))
7154 return instantiate_type (type, pfn, tf_warning_or_error);
7156 fn = TREE_OPERAND (pfn, 0);
7157 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7158 /* In a template, we will have preserved the
7160 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7161 return make_ptrmem_cst (to_type, fn);
7164 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7167 ??? There is no consistency as to the types returned for the above
7168 values. Some code acts as if it were a sizetype and some as if it were
7169 integer_type_node. */
7172 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7174 tree type = TREE_TYPE (cst);
7175 tree fn = PTRMEM_CST_MEMBER (cst);
7176 tree ptr_class, fn_class;
7178 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7180 /* The class that the function belongs to. */
7181 fn_class = DECL_CONTEXT (fn);
7183 /* The class that we're creating a pointer to member of. */
7184 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7186 /* First, calculate the adjustment to the function's class. */
7187 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7188 /*c_cast_p=*/0, tf_warning_or_error);
7190 if (!DECL_VIRTUAL_P (fn))
7191 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
7194 /* If we're dealing with a virtual function, we have to adjust 'this'
7195 again, to point to the base which provides the vtable entry for
7196 fn; the call will do the opposite adjustment. */
7197 tree orig_class = DECL_CONTEXT (fn);
7198 tree binfo = binfo_or_else (orig_class, fn_class);
7199 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7200 *delta, BINFO_OFFSET (binfo));
7201 *delta = fold_if_not_in_template (*delta);
7203 /* We set PFN to the vtable offset at which the function can be
7204 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7205 case delta is shifted left, and then incremented). */
7206 *pfn = DECL_VINDEX (fn);
7207 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7208 TYPE_SIZE_UNIT (vtable_entry_type));
7209 *pfn = fold_if_not_in_template (*pfn);
7211 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7213 case ptrmemfunc_vbit_in_pfn:
7214 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7216 *pfn = fold_if_not_in_template (*pfn);
7219 case ptrmemfunc_vbit_in_delta:
7220 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7221 *delta, integer_one_node);
7222 *delta = fold_if_not_in_template (*delta);
7223 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7224 *delta, integer_one_node);
7225 *delta = fold_if_not_in_template (*delta);
7232 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
7233 *pfn = fold_if_not_in_template (*pfn);
7237 /* Return an expression for PFN from the pointer-to-member function
7241 pfn_from_ptrmemfunc (tree t)
7243 if (TREE_CODE (t) == PTRMEM_CST)
7248 expand_ptrmemfunc_cst (t, &delta, &pfn);
7253 return build_ptrmemfunc_access_expr (t, pfn_identifier);
7256 /* Return an expression for DELTA from the pointer-to-member function
7260 delta_from_ptrmemfunc (tree t)
7262 if (TREE_CODE (t) == PTRMEM_CST)
7267 expand_ptrmemfunc_cst (t, &delta, &pfn);
7272 return build_ptrmemfunc_access_expr (t, delta_identifier);
7275 /* Convert value RHS to type TYPE as preparation for an assignment to
7276 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7277 implicit conversion is. If FNDECL is non-NULL, we are doing the
7278 conversion in order to pass the PARMNUMth argument of FNDECL.
7279 If FNDECL is NULL, we are doing the conversion in function pointer
7280 argument passing, conversion in initialization, etc. */
7283 convert_for_assignment (tree type, tree rhs,
7284 impl_conv_rhs errtype, tree fndecl, int parmnum,
7285 tsubst_flags_t complain, int flags)
7288 enum tree_code coder;
7290 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7291 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
7292 rhs = TREE_OPERAND (rhs, 0);
7294 rhstype = TREE_TYPE (rhs);
7295 coder = TREE_CODE (rhstype);
7297 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
7298 && vector_types_convertible_p (type, rhstype, true))
7300 rhs = mark_rvalue_use (rhs);
7301 return convert (type, rhs);
7304 if (rhs == error_mark_node || rhstype == error_mark_node)
7305 return error_mark_node;
7306 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
7307 return error_mark_node;
7309 /* The RHS of an assignment cannot have void type. */
7310 if (coder == VOID_TYPE)
7312 if (complain & tf_error)
7313 error ("void value not ignored as it ought to be");
7314 return error_mark_node;
7317 /* Simplify the RHS if possible. */
7318 if (TREE_CODE (rhs) == CONST_DECL)
7319 rhs = DECL_INITIAL (rhs);
7321 if (c_dialect_objc ())
7325 tree rname = fndecl;
7336 selector = objc_message_selector ();
7338 if (selector && parmno > 1)
7345 if (objc_compare_types (type, rhstype, parmno, rname))
7347 rhs = mark_rvalue_use (rhs);
7348 return convert (type, rhs);
7354 The expression is implicitly converted (clause _conv_) to the
7355 cv-unqualified type of the left operand.
7357 We allow bad conversions here because by the time we get to this point
7358 we are committed to doing the conversion. If we end up doing a bad
7359 conversion, convert_like will complain. */
7360 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
7362 /* When -Wno-pmf-conversions is use, we just silently allow
7363 conversions from pointers-to-members to plain pointers. If
7364 the conversion doesn't work, cp_convert will complain. */
7366 && TYPE_PTR_P (type)
7367 && TYPE_PTRMEMFUNC_P (rhstype))
7368 rhs = cp_convert (strip_top_quals (type), rhs);
7371 if (complain & tf_error)
7373 /* If the right-hand side has unknown type, then it is an
7374 overloaded function. Call instantiate_type to get error
7376 if (rhstype == unknown_type_node)
7377 instantiate_type (type, rhs, tf_warning_or_error);
7379 error ("cannot convert %qT to %qT for argument %qP to %qD",
7380 rhstype, type, parmnum, fndecl);
7384 case ICR_DEFAULT_ARGUMENT:
7385 error ("cannot convert %qT to %qT in default argument",
7389 error ("cannot convert %qT to %qT in argument passing",
7392 case ICR_CONVERTING:
7393 error ("cannot convert %qT to %qT",
7397 error ("cannot convert %qT to %qT in initialization",
7401 error ("cannot convert %qT to %qT in return",
7405 error ("cannot convert %qT to %qT in assignment",
7412 return error_mark_node;
7415 if (warn_missing_format_attribute)
7417 const enum tree_code codel = TREE_CODE (type);
7418 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7420 && check_missing_format_attribute (type, rhstype)
7421 && (complain & tf_warning))
7425 case ICR_DEFAULT_ARGUMENT:
7427 warning (OPT_Wmissing_format_attribute,
7428 "parameter %qP of %qD might be a candidate "
7429 "for a format attribute", parmnum, fndecl);
7431 warning (OPT_Wmissing_format_attribute,
7432 "parameter might be a candidate "
7433 "for a format attribute");
7435 case ICR_CONVERTING:
7436 warning (OPT_Wmissing_format_attribute,
7437 "target of conversion might be a candidate "
7438 "for a format attribute");
7441 warning (OPT_Wmissing_format_attribute,
7442 "target of initialization might be a candidate "
7443 "for a format attribute");
7446 warning (OPT_Wmissing_format_attribute,
7447 "return type might be a candidate "
7448 "for a format attribute");
7451 warning (OPT_Wmissing_format_attribute,
7452 "left-hand side of assignment might be a candidate "
7453 "for a format attribute");
7460 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7462 if (warn_parentheses
7463 && TREE_CODE (type) == BOOLEAN_TYPE
7464 && TREE_CODE (rhs) == MODIFY_EXPR
7465 && !TREE_NO_WARNING (rhs)
7466 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
7467 && (complain & tf_warning))
7469 location_t loc = EXPR_LOC_OR_HERE (rhs);
7471 warning_at (loc, OPT_Wparentheses,
7472 "suggest parentheses around assignment used as truth value");
7473 TREE_NO_WARNING (rhs) = 1;
7476 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
7480 /* Convert RHS to be of type TYPE.
7481 If EXP is nonzero, it is the target of the initialization.
7482 ERRTYPE indicates what kind of error the implicit conversion is.
7484 Two major differences between the behavior of
7485 `convert_for_assignment' and `convert_for_initialization'
7486 are that references are bashed in the former, while
7487 copied in the latter, and aggregates are assigned in
7488 the former (operator=) while initialized in the
7491 If using constructor make sure no conversion operator exists, if one does
7492 exist, an ambiguity exists.
7494 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7497 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
7498 impl_conv_rhs errtype, tree fndecl, int parmnum,
7499 tsubst_flags_t complain)
7501 enum tree_code codel = TREE_CODE (type);
7503 enum tree_code coder;
7505 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7506 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7507 if (TREE_CODE (rhs) == NOP_EXPR
7508 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
7509 && codel != REFERENCE_TYPE)
7510 rhs = TREE_OPERAND (rhs, 0);
7512 if (type == error_mark_node
7513 || rhs == error_mark_node
7514 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
7515 return error_mark_node;
7517 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
7518 && TREE_CODE (type) != ARRAY_TYPE
7519 && (TREE_CODE (type) != REFERENCE_TYPE
7520 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
7521 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
7522 && (TREE_CODE (type) != REFERENCE_TYPE
7523 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
7524 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
7525 rhs = decay_conversion (rhs);
7527 rhstype = TREE_TYPE (rhs);
7528 coder = TREE_CODE (rhstype);
7530 if (coder == ERROR_MARK)
7531 return error_mark_node;
7533 /* We accept references to incomplete types, so we can
7534 return here before checking if RHS is of complete type. */
7536 if (codel == REFERENCE_TYPE)
7538 /* This should eventually happen in convert_arguments. */
7539 int savew = 0, savee = 0;
7542 savew = warningcount, savee = errorcount;
7543 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
7544 /*cleanup=*/NULL, flags, complain);
7547 if (warningcount > savew)
7548 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
7549 else if (errorcount > savee)
7550 error ("in passing argument %P of %q+D", parmnum, fndecl);
7556 exp = require_complete_type_sfinae (exp, complain);
7557 if (exp == error_mark_node)
7558 return error_mark_node;
7560 rhstype = non_reference (rhstype);
7562 type = complete_type (type);
7564 if (DIRECT_INIT_EXPR_P (type, rhs))
7565 /* Don't try to do copy-initialization if we already have
7566 direct-initialization. */
7569 if (MAYBE_CLASS_TYPE_P (type))
7570 return perform_implicit_conversion_flags (type, rhs, complain, flags);
7572 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7576 /* If RETVAL is the address of, or a reference to, a local variable or
7577 temporary give an appropriate warning. */
7580 maybe_warn_about_returning_address_of_local (tree retval)
7582 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7583 tree whats_returned = retval;
7587 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7588 whats_returned = TREE_OPERAND (whats_returned, 1);
7589 else if (CONVERT_EXPR_P (whats_returned)
7590 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7591 whats_returned = TREE_OPERAND (whats_returned, 0);
7596 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7598 whats_returned = TREE_OPERAND (whats_returned, 0);
7600 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7602 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7603 || TREE_CODE (whats_returned) == TARGET_EXPR)
7605 warning (0, "returning reference to temporary");
7608 if (TREE_CODE (whats_returned) == VAR_DECL
7609 && DECL_NAME (whats_returned)
7610 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7612 warning (0, "reference to non-lvalue returned");
7617 while (TREE_CODE (whats_returned) == COMPONENT_REF
7618 || TREE_CODE (whats_returned) == ARRAY_REF)
7619 whats_returned = TREE_OPERAND (whats_returned, 0);
7621 if (DECL_P (whats_returned)
7622 && DECL_NAME (whats_returned)
7623 && DECL_FUNCTION_SCOPE_P (whats_returned)
7624 && !(TREE_STATIC (whats_returned)
7625 || TREE_PUBLIC (whats_returned)))
7627 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7628 warning (0, "reference to local variable %q+D returned",
7631 warning (0, "address of local variable %q+D returned",
7637 /* Check that returning RETVAL from the current function is valid.
7638 Return an expression explicitly showing all conversions required to
7639 change RETVAL into the function return type, and to assign it to
7640 the DECL_RESULT for the function. Set *NO_WARNING to true if
7641 code reaches end of non-void function warning shouldn't be issued
7642 on this RETURN_EXPR. */
7645 check_return_expr (tree retval, bool *no_warning)
7648 /* The type actually returned by the function, after any
7651 int fn_returns_value_p;
7652 bool named_return_value_okay_p;
7654 *no_warning = false;
7656 /* A `volatile' function is one that isn't supposed to return, ever.
7657 (This is a G++ extension, used to get better code for functions
7658 that call the `volatile' function.) */
7659 if (TREE_THIS_VOLATILE (current_function_decl))
7660 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7662 /* Check for various simple errors. */
7663 if (DECL_DESTRUCTOR_P (current_function_decl))
7666 error ("returning a value from a destructor");
7669 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7671 if (in_function_try_handler)
7672 /* If a return statement appears in a handler of the
7673 function-try-block of a constructor, the program is ill-formed. */
7674 error ("cannot return from a handler of a function-try-block of a constructor");
7676 /* You can't return a value from a constructor. */
7677 error ("returning a value from a constructor");
7681 /* As an extension, deduce lambda return type from a return statement
7682 anywhere in the body. */
7683 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7685 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7686 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7688 tree type = lambda_return_type (retval);
7689 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7691 if (oldtype == NULL_TREE)
7692 apply_lambda_return_type (lambda, type);
7693 /* If one of the answers is type-dependent, we can't do any
7694 better until instantiation time. */
7695 else if (oldtype == dependent_lambda_return_type_node)
7697 else if (type == dependent_lambda_return_type_node)
7698 apply_lambda_return_type (lambda, type);
7699 else if (!same_type_p (type, oldtype))
7700 error ("inconsistent types %qT and %qT deduced for "
7701 "lambda return type", type, oldtype);
7705 if (processing_template_decl)
7707 current_function_returns_value = 1;
7708 if (check_for_bare_parameter_packs (retval))
7709 retval = error_mark_node;
7713 /* When no explicit return-value is given in a function with a named
7714 return value, the named return value is used. */
7715 result = DECL_RESULT (current_function_decl);
7716 valtype = TREE_TYPE (result);
7717 gcc_assert (valtype != NULL_TREE);
7718 fn_returns_value_p = !VOID_TYPE_P (valtype);
7719 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7722 /* Check for a return statement with no return value in a function
7723 that's supposed to return a value. */
7724 if (!retval && fn_returns_value_p)
7726 permerror (input_location, "return-statement with no value, in function returning %qT",
7728 /* Clear this, so finish_function won't say that we reach the
7729 end of a non-void function (which we don't, we gave a
7731 current_function_returns_null = 0;
7732 /* And signal caller that TREE_NO_WARNING should be set on the
7733 RETURN_EXPR to avoid control reaches end of non-void function
7734 warnings in tree-cfg.c. */
7737 /* Check for a return statement with a value in a function that
7738 isn't supposed to return a value. */
7739 else if (retval && !fn_returns_value_p)
7741 if (VOID_TYPE_P (TREE_TYPE (retval)))
7742 /* You can return a `void' value from a function of `void'
7743 type. In that case, we have to evaluate the expression for
7744 its side-effects. */
7745 finish_expr_stmt (retval);
7747 permerror (input_location, "return-statement with a value, in function "
7748 "returning 'void'");
7749 current_function_returns_null = 1;
7751 /* There's really no value to return, after all. */
7755 /* Remember that this function can sometimes return without a
7757 current_function_returns_null = 1;
7759 /* Remember that this function did return a value. */
7760 current_function_returns_value = 1;
7762 /* Check for erroneous operands -- but after giving ourselves a
7763 chance to provide an error about returning a value from a void
7765 if (error_operand_p (retval))
7767 current_function_return_value = error_mark_node;
7768 return error_mark_node;
7771 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7772 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7773 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7774 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7776 && retval && null_ptr_cst_p (retval))
7777 warning (0, "%<operator new%> must not return NULL unless it is "
7778 "declared %<throw()%> (or -fcheck-new is in effect)");
7780 /* Effective C++ rule 15. See also start_function. */
7782 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7786 /* The function return type must be a reference to the current
7788 if (TREE_CODE (valtype) == REFERENCE_TYPE
7789 && same_type_ignoring_top_level_qualifiers_p
7790 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7792 /* Returning '*this' is obviously OK. */
7793 if (retval == current_class_ref)
7795 /* If we are calling a function whose return type is the same of
7796 the current class reference, it is ok. */
7797 else if (TREE_CODE (retval) == INDIRECT_REF
7798 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7803 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7806 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7808 [...] For a function with a class return type, if the expression
7809 in the return statement is the name of a local object, and the cv-
7810 unqualified type of the local object is the same as the function
7811 return type, an implementation is permitted to omit creating the tem-
7812 porary object to hold the function return value [...]
7814 So, if this is a value-returning function that always returns the same
7815 local variable, remember it.
7817 It might be nice to be more flexible, and choose the first suitable
7818 variable even if the function sometimes returns something else, but
7819 then we run the risk of clobbering the variable we chose if the other
7820 returned expression uses the chosen variable somehow. And people expect
7821 this restriction, anyway. (jason 2000-11-19)
7823 See finish_function and finalize_nrv for the rest of this optimization. */
7825 named_return_value_okay_p =
7826 (retval != NULL_TREE
7827 /* Must be a local, automatic variable. */
7828 && TREE_CODE (retval) == VAR_DECL
7829 && DECL_CONTEXT (retval) == current_function_decl
7830 && ! TREE_STATIC (retval)
7831 && ! DECL_ANON_UNION_VAR_P (retval)
7832 && (DECL_ALIGN (retval)
7833 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7834 /* The cv-unqualified type of the returned value must be the
7835 same as the cv-unqualified return type of the
7837 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7839 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7840 /* And the returned value must be non-volatile. */
7841 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7843 if (fn_returns_value_p && flag_elide_constructors)
7845 if (named_return_value_okay_p
7846 && (current_function_return_value == NULL_TREE
7847 || current_function_return_value == retval))
7848 current_function_return_value = retval;
7850 current_function_return_value = error_mark_node;
7853 /* We don't need to do any conversions when there's nothing being
7858 /* Do any required conversions. */
7859 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7860 /* No conversions are required. */
7864 /* The type the function is declared to return. */
7865 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7866 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7868 /* The functype's return type will have been set to void, if it
7869 was an incomplete type. Just treat this as 'return;' */
7870 if (VOID_TYPE_P (functype))
7871 return error_mark_node;
7873 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7874 treated as an rvalue for the purposes of overload resolution to
7875 favor move constructors over copy constructors.
7877 Note that these conditions are similar to, but not as strict as,
7878 the conditions for the named return value optimization. */
7879 if ((cxx_dialect != cxx98)
7880 && (TREE_CODE (retval) == VAR_DECL
7881 || TREE_CODE (retval) == PARM_DECL)
7882 && DECL_CONTEXT (retval) == current_function_decl
7883 && !TREE_STATIC (retval)
7884 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7886 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7887 /* This is only interesting for class type. */
7888 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7889 flags = flags | LOOKUP_PREFER_RVALUE;
7891 /* First convert the value to the function's return type, then
7892 to the type of return value's location to handle the
7893 case that functype is smaller than the valtype. */
7894 retval = convert_for_initialization
7895 (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
7896 tf_warning_or_error);
7897 retval = convert (valtype, retval);
7899 /* If the conversion failed, treat this just like `return;'. */
7900 if (retval == error_mark_node)
7902 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7903 else if (! cfun->returns_struct
7904 && TREE_CODE (retval) == TARGET_EXPR
7905 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7906 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7907 TREE_OPERAND (retval, 0));
7909 maybe_warn_about_returning_address_of_local (retval);
7912 /* Actually copy the value returned into the appropriate location. */
7913 if (retval && retval != result)
7914 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7920 /* Returns nonzero if the pointer-type FROM can be converted to the
7921 pointer-type TO via a qualification conversion. If CONSTP is -1,
7922 then we return nonzero if the pointers are similar, and the
7923 cv-qualification signature of FROM is a proper subset of that of TO.
7925 If CONSTP is positive, then all outer pointers have been
7929 comp_ptr_ttypes_real (tree to, tree from, int constp)
7931 bool to_more_cv_qualified = false;
7932 bool is_opaque_pointer = false;
7934 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7936 if (TREE_CODE (to) != TREE_CODE (from))
7939 if (TREE_CODE (from) == OFFSET_TYPE
7940 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7941 TYPE_OFFSET_BASETYPE (to)))
7944 /* Const and volatile mean something different for function types,
7945 so the usual checks are not appropriate. */
7946 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7948 if (!at_least_as_qualified_p (to, from))
7951 if (!at_least_as_qualified_p (from, to))
7955 to_more_cv_qualified = true;
7959 constp &= TYPE_READONLY (to);
7962 if (TREE_CODE (to) == VECTOR_TYPE)
7963 is_opaque_pointer = vector_targets_convertible_p (to, from);
7965 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7966 return ((constp >= 0 || to_more_cv_qualified)
7967 && (is_opaque_pointer
7968 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7972 /* When comparing, say, char ** to char const **, this function takes
7973 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7974 types to this function. */
7977 comp_ptr_ttypes (tree to, tree from)
7979 return comp_ptr_ttypes_real (to, from, 1);
7982 /* Returns true iff FNTYPE is a non-class type that involves
7983 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7984 if a parameter type is ill-formed. */
7987 error_type_p (const_tree type)
7991 switch (TREE_CODE (type))
7997 case REFERENCE_TYPE:
7999 return error_type_p (TREE_TYPE (type));
8003 if (error_type_p (TREE_TYPE (type)))
8005 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
8006 if (error_type_p (TREE_VALUE (t)))
8011 if (TYPE_PTRMEMFUNC_P (type))
8012 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
8020 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
8021 type or inheritance-related types, regardless of cv-quals. */
8024 ptr_reasonably_similar (const_tree to, const_tree from)
8026 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8028 /* Any target type is similar enough to void. */
8029 if (TREE_CODE (to) == VOID_TYPE)
8030 return !error_type_p (from);
8031 if (TREE_CODE (from) == VOID_TYPE)
8032 return !error_type_p (to);
8034 if (TREE_CODE (to) != TREE_CODE (from))
8037 if (TREE_CODE (from) == OFFSET_TYPE
8038 && comptypes (TYPE_OFFSET_BASETYPE (to),
8039 TYPE_OFFSET_BASETYPE (from),
8040 COMPARE_BASE | COMPARE_DERIVED))
8043 if (TREE_CODE (to) == VECTOR_TYPE
8044 && vector_types_convertible_p (to, from, false))
8047 if (TREE_CODE (to) == INTEGER_TYPE
8048 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
8051 if (TREE_CODE (to) == FUNCTION_TYPE)
8052 return !error_type_p (to) && !error_type_p (from);
8054 if (TREE_CODE (to) != POINTER_TYPE)
8056 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
8057 COMPARE_BASE | COMPARE_DERIVED);
8061 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8062 pointer-to-member types) are the same, ignoring cv-qualification at
8066 comp_ptr_ttypes_const (tree to, tree from)
8068 bool is_opaque_pointer = false;
8070 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8072 if (TREE_CODE (to) != TREE_CODE (from))
8075 if (TREE_CODE (from) == OFFSET_TYPE
8076 && same_type_p (TYPE_OFFSET_BASETYPE (from),
8077 TYPE_OFFSET_BASETYPE (to)))
8080 if (TREE_CODE (to) == VECTOR_TYPE)
8081 is_opaque_pointer = vector_targets_convertible_p (to, from);
8083 if (TREE_CODE (to) != POINTER_TYPE)
8084 return (is_opaque_pointer
8085 || same_type_ignoring_top_level_qualifiers_p (to, from));
8089 /* Returns the type qualifiers for this type, including the qualifiers on the
8090 elements for an array type. */
8093 cp_type_quals (const_tree type)
8096 /* This CONST_CAST is okay because strip_array_types returns its
8097 argument unmodified and we assign it to a const_tree. */
8098 type = strip_array_types (CONST_CAST_TREE (type));
8099 if (type == error_mark_node
8100 /* Quals on a FUNCTION_TYPE are memfn quals. */
8101 || TREE_CODE (type) == FUNCTION_TYPE)
8102 return TYPE_UNQUALIFIED;
8103 quals = TYPE_QUALS (type);
8104 /* METHOD and REFERENCE_TYPEs should never have quals. */
8105 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
8106 && TREE_CODE (type) != REFERENCE_TYPE)
8107 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
8108 == TYPE_UNQUALIFIED));
8112 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8116 type_memfn_quals (const_tree type)
8118 if (TREE_CODE (type) == FUNCTION_TYPE)
8119 return TYPE_QUALS (type);
8120 else if (TREE_CODE (type) == METHOD_TYPE)
8121 return cp_type_quals (class_of_this_parm (type));
8126 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8130 apply_memfn_quals (tree type, cp_cv_quals memfn_quals)
8132 /* Could handle METHOD_TYPE here if necessary. */
8133 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8134 if (TYPE_QUALS (type) == memfn_quals)
8136 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8138 return build_qualified_type (type, memfn_quals);
8141 /* Returns nonzero if TYPE is const or volatile. */
8144 cv_qualified_p (const_tree type)
8146 int quals = cp_type_quals (type);
8147 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
8150 /* Returns nonzero if the TYPE contains a mutable member. */
8153 cp_has_mutable_p (const_tree type)
8155 /* This CONST_CAST is okay because strip_array_types returns its
8156 argument unmodified and we assign it to a const_tree. */
8157 type = strip_array_types (CONST_CAST_TREE(type));
8159 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
8162 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8163 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8164 approximation. In particular, consider:
8167 struct S { int i; };
8168 const S s = { f(); }
8170 Here, we will make "s" as TREE_READONLY (because it is declared
8171 "const") -- only to reverse ourselves upon seeing that the
8172 initializer is non-constant. */
8175 cp_apply_type_quals_to_decl (int type_quals, tree decl)
8177 tree type = TREE_TYPE (decl);
8179 if (type == error_mark_node)
8182 if (TREE_CODE (decl) == TYPE_DECL)
8185 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
8186 && type_quals != TYPE_UNQUALIFIED));
8188 /* Avoid setting TREE_READONLY incorrectly. */
8189 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
8190 constructor can produce constant init, so rely on cp_finish_decl to
8191 clear TREE_READONLY if the variable has non-constant init. */
8193 /* If the type has a mutable component, that component might be
8195 if (TYPE_HAS_MUTABLE_P (type))
8196 type_quals &= ~TYPE_QUAL_CONST;
8198 c_apply_type_quals_to_decl (type_quals, decl);
8201 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8202 exemplar types such that casting T1 to T2 is casting away constness
8203 if and only if there is no implicit conversion from T1 to T2. */
8206 casts_away_constness_r (tree *t1, tree *t2)
8211 /* [expr.const.cast]
8213 For multi-level pointer to members and multi-level mixed pointers
8214 and pointers to members (conv.qual), the "member" aspect of a
8215 pointer to member level is ignored when determining if a const
8216 cv-qualifier has been cast away. */
8217 /* [expr.const.cast]
8219 For two pointer types:
8221 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8222 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8225 casting from X1 to X2 casts away constness if, for a non-pointer
8226 type T there does not exist an implicit conversion (clause
8229 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8233 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8234 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
8235 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
8237 *t1 = cp_build_qualified_type (void_type_node,
8238 cp_type_quals (*t1));
8239 *t2 = cp_build_qualified_type (void_type_node,
8240 cp_type_quals (*t2));
8244 quals1 = cp_type_quals (*t1);
8245 quals2 = cp_type_quals (*t2);
8247 if (TYPE_PTRMEM_P (*t1))
8248 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
8250 *t1 = TREE_TYPE (*t1);
8251 if (TYPE_PTRMEM_P (*t2))
8252 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
8254 *t2 = TREE_TYPE (*t2);
8256 casts_away_constness_r (t1, t2);
8257 *t1 = build_pointer_type (*t1);
8258 *t2 = build_pointer_type (*t2);
8259 *t1 = cp_build_qualified_type (*t1, quals1);
8260 *t2 = cp_build_qualified_type (*t2, quals2);
8263 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8266 ??? This function returns non-zero if casting away qualifiers not
8267 just const. We would like to return to the caller exactly which
8268 qualifiers are casted away to give more accurate diagnostics.
8272 casts_away_constness (tree t1, tree t2)
8274 if (TREE_CODE (t2) == REFERENCE_TYPE)
8276 /* [expr.const.cast]
8278 Casting from an lvalue of type T1 to an lvalue of type T2
8279 using a reference cast casts away constness if a cast from an
8280 rvalue of type "pointer to T1" to the type "pointer to T2"
8281 casts away constness. */
8282 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
8283 return casts_away_constness (build_pointer_type (t1),
8284 build_pointer_type (TREE_TYPE (t2)));
8287 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
8288 /* [expr.const.cast]
8290 Casting from an rvalue of type "pointer to data member of X
8291 of type T1" to the type "pointer to data member of Y of type
8292 T2" casts away constness if a cast from an rvalue of type
8293 "pointer to T1" to the type "pointer to T2" casts away
8295 return casts_away_constness
8296 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
8297 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
8299 /* Casting away constness is only something that makes sense for
8300 pointer or reference types. */
8301 if (TREE_CODE (t1) != POINTER_TYPE
8302 || TREE_CODE (t2) != POINTER_TYPE)
8305 /* Top-level qualifiers don't matter. */
8306 t1 = TYPE_MAIN_VARIANT (t1);
8307 t2 = TYPE_MAIN_VARIANT (t2);
8308 casts_away_constness_r (&t1, &t2);
8309 if (!can_convert (t2, t1))
8315 /* If T is a REFERENCE_TYPE return the type to which T refers.
8316 Otherwise, return T itself. */
8319 non_reference (tree t)
8321 if (TREE_CODE (t) == REFERENCE_TYPE)
8327 /* Return nonzero if REF is an lvalue valid for this language;
8328 otherwise, print an error message and return zero. USE says
8329 how the lvalue is being used and so selects the error message. */
8332 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
8334 cp_lvalue_kind kind = lvalue_kind (ref);
8336 if (kind == clk_none)
8338 if (complain & tf_error)
8339 lvalue_error (input_location, use);
8342 else if (kind & (clk_rvalueref|clk_class))
8344 if (!(complain & tf_error))
8346 if (kind & clk_class)
8347 /* Make this a permerror because we used to accept it. */
8348 permerror (input_location, "using temporary as lvalue");
8350 error ("using xvalue (rvalue reference) as lvalue");