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 (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)
2131 error ("request for member %qD in %qE, which is of non-class type %qT",
2132 member, object, object_type);
2133 return error_mark_node;
2136 /* The standard does not seem to actually say that MEMBER must be a
2137 member of OBJECT_TYPE. However, that is clearly what is
2139 if (DECL_P (member))
2141 member_scope = DECL_CLASS_CONTEXT (member);
2143 if (TREE_DEPRECATED (member))
2144 warn_deprecated_use (member, NULL_TREE);
2147 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2148 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2149 presently be the anonymous union. Go outwards until we find a
2150 type related to OBJECT_TYPE. */
2151 while (ANON_AGGR_TYPE_P (member_scope)
2152 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2154 member_scope = TYPE_CONTEXT (member_scope);
2155 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2157 if (complain & tf_error)
2159 if (TREE_CODE (member) == FIELD_DECL)
2160 error ("invalid use of nonstatic data member %qE", member);
2162 error ("%qD is not a member of %qT", member, object_type);
2164 return error_mark_node;
2167 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2168 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2169 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2171 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2173 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2176 /* In [expr.ref], there is an explicit list of the valid choices for
2177 MEMBER. We check for each of those cases here. */
2178 if (TREE_CODE (member) == VAR_DECL)
2180 /* A static data member. */
2182 mark_exp_read (object);
2183 /* If OBJECT has side-effects, they are supposed to occur. */
2184 if (TREE_SIDE_EFFECTS (object))
2185 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2187 else if (TREE_CODE (member) == FIELD_DECL)
2189 /* A non-static data member. */
2194 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2195 && integer_zerop (TREE_OPERAND (object, 0)));
2197 /* Convert OBJECT to the type of MEMBER. */
2198 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2199 TYPE_MAIN_VARIANT (member_scope)))
2204 binfo = lookup_base (access_path ? access_path : object_type,
2205 member_scope, ba_unique, &kind);
2206 if (binfo == error_mark_node)
2207 return error_mark_node;
2209 /* It is invalid to try to get to a virtual base of a
2210 NULL object. The most common cause is invalid use of
2212 if (null_object_p && kind == bk_via_virtual)
2214 if (complain & tf_error)
2216 error ("invalid access to non-static data member %qD of "
2219 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2221 return error_mark_node;
2224 /* Convert to the base. */
2225 object = build_base_path (PLUS_EXPR, object, binfo,
2226 /*nonnull=*/1, complain);
2227 /* If we found the base successfully then we should be able
2228 to convert to it successfully. */
2229 gcc_assert (object != error_mark_node);
2232 /* Complain about other invalid uses of offsetof, even though they will
2233 give the right answer. Note that we complain whether or not they
2234 actually used the offsetof macro, since there's no way to know at this
2235 point. So we just give a warning, instead of a pedwarn. */
2236 /* Do not produce this warning for base class field references, because
2237 we know for a fact that didn't come from offsetof. This does occur
2238 in various testsuite cases where a null object is passed where a
2239 vtable access is required. */
2240 if (null_object_p && warn_invalid_offsetof
2241 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2242 && !DECL_FIELD_IS_BASE (member)
2243 && cp_unevaluated_operand == 0
2244 && (complain & tf_warning))
2246 warning (OPT_Winvalid_offsetof,
2247 "invalid access to non-static data member %qD "
2248 " of NULL object", member);
2249 warning (OPT_Winvalid_offsetof,
2250 "(perhaps the %<offsetof%> macro was used incorrectly)");
2253 /* If MEMBER is from an anonymous aggregate, we have converted
2254 OBJECT so that it refers to the class containing the
2255 anonymous union. Generate a reference to the anonymous union
2256 itself, and recur to find MEMBER. */
2257 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2258 /* When this code is called from build_field_call, the
2259 object already has the type of the anonymous union.
2260 That is because the COMPONENT_REF was already
2261 constructed, and was then disassembled before calling
2262 build_field_call. After the function-call code is
2263 cleaned up, this waste can be eliminated. */
2264 && (!same_type_ignoring_top_level_qualifiers_p
2265 (TREE_TYPE (object), DECL_CONTEXT (member))))
2267 tree anonymous_union;
2269 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2270 DECL_CONTEXT (member));
2271 object = build_class_member_access_expr (object,
2273 /*access_path=*/NULL_TREE,
2278 /* Compute the type of the field, as described in [expr.ref]. */
2279 type_quals = TYPE_UNQUALIFIED;
2280 member_type = TREE_TYPE (member);
2281 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2283 type_quals = (cp_type_quals (member_type)
2284 | cp_type_quals (object_type));
2286 /* A field is const (volatile) if the enclosing object, or the
2287 field itself, is const (volatile). But, a mutable field is
2288 not const, even within a const object. */
2289 if (DECL_MUTABLE_P (member))
2290 type_quals &= ~TYPE_QUAL_CONST;
2291 member_type = cp_build_qualified_type (member_type, type_quals);
2294 result = build3 (COMPONENT_REF, member_type, object, member,
2296 result = fold_if_not_in_template (result);
2298 /* Mark the expression const or volatile, as appropriate. Even
2299 though we've dealt with the type above, we still have to mark the
2300 expression itself. */
2301 if (type_quals & TYPE_QUAL_CONST)
2302 TREE_READONLY (result) = 1;
2303 if (type_quals & TYPE_QUAL_VOLATILE)
2304 TREE_THIS_VOLATILE (result) = 1;
2306 else if (BASELINK_P (member))
2308 /* The member is a (possibly overloaded) member function. */
2312 /* If the MEMBER is exactly one static member function, then we
2313 know the type of the expression. Otherwise, we must wait
2314 until overload resolution has been performed. */
2315 functions = BASELINK_FUNCTIONS (member);
2316 if (TREE_CODE (functions) == FUNCTION_DECL
2317 && DECL_STATIC_FUNCTION_P (functions))
2318 type = TREE_TYPE (functions);
2320 type = unknown_type_node;
2321 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2322 base. That will happen when the function is called. */
2323 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2325 else if (TREE_CODE (member) == CONST_DECL)
2327 /* The member is an enumerator. */
2329 /* If OBJECT has side-effects, they are supposed to occur. */
2330 if (TREE_SIDE_EFFECTS (object))
2331 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2336 if (complain & tf_error)
2337 error ("invalid use of %qD", member);
2338 return error_mark_node;
2341 if (!preserve_reference)
2344 If E2 is declared to have type "reference to T", then ... the
2345 type of E1.E2 is T. */
2346 result = convert_from_reference (result);
2351 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2352 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2355 lookup_destructor (tree object, tree scope, tree dtor_name)
2357 tree object_type = TREE_TYPE (object);
2358 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2361 if (scope && !check_dtor_name (scope, dtor_type))
2363 error ("qualified type %qT does not match destructor name ~%qT",
2365 return error_mark_node;
2367 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2369 /* In a template, names we can't find a match for are still accepted
2370 destructor names, and we check them here. */
2371 if (check_dtor_name (object_type, dtor_type))
2372 dtor_type = object_type;
2375 error ("object type %qT does not match destructor name ~%qT",
2376 object_type, dtor_type);
2377 return error_mark_node;
2381 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2383 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2384 TYPE_MAIN_VARIANT (object_type), dtor_type);
2385 return error_mark_node;
2387 expr = lookup_member (dtor_type, complete_dtor_identifier,
2388 /*protect=*/1, /*want_type=*/false);
2389 expr = (adjust_result_of_qualified_name_lookup
2390 (expr, dtor_type, object_type));
2394 /* An expression of the form "A::template B" has been resolved to
2395 DECL. Issue a diagnostic if B is not a template or template
2399 check_template_keyword (tree decl)
2401 /* The standard says:
2405 If a name prefixed by the keyword template is not a member
2406 template, the program is ill-formed.
2408 DR 228 removed the restriction that the template be a member
2411 DR 96, if accepted would add the further restriction that explicit
2412 template arguments must be provided if the template keyword is
2413 used, but, as of 2005-10-16, that DR is still in "drafting". If
2414 this DR is accepted, then the semantic checks here can be
2415 simplified, as the entity named must in fact be a template
2416 specialization, rather than, as at present, a set of overloaded
2417 functions containing at least one template function. */
2418 if (TREE_CODE (decl) != TEMPLATE_DECL
2419 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2421 if (!is_overloaded_fn (decl))
2422 permerror (input_location, "%qD is not a template", decl);
2427 if (BASELINK_P (fns))
2428 fns = BASELINK_FUNCTIONS (fns);
2431 tree fn = OVL_CURRENT (fns);
2432 if (TREE_CODE (fn) == TEMPLATE_DECL
2433 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2435 if (TREE_CODE (fn) == FUNCTION_DECL
2436 && DECL_USE_TEMPLATE (fn)
2437 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2439 fns = OVL_NEXT (fns);
2442 permerror (input_location, "%qD is not a template", decl);
2447 /* This function is called by the parser to process a class member
2448 access expression of the form OBJECT.NAME. NAME is a node used by
2449 the parser to represent a name; it is not yet a DECL. It may,
2450 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2451 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2452 there is no reason to do the lookup twice, so the parser keeps the
2453 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2454 be a template via the use of the "A::template B" syntax. */
2457 finish_class_member_access_expr (tree object, tree name, bool template_p,
2458 tsubst_flags_t complain)
2463 tree access_path = NULL_TREE;
2464 tree orig_object = object;
2465 tree orig_name = name;
2467 if (object == error_mark_node || name == error_mark_node)
2468 return error_mark_node;
2470 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2471 if (!objc_is_public (object, name))
2472 return error_mark_node;
2474 object_type = TREE_TYPE (object);
2476 if (processing_template_decl)
2478 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2479 dependent_type_p (object_type)
2480 /* If NAME is just an IDENTIFIER_NODE, then the expression
2482 || TREE_CODE (object) == IDENTIFIER_NODE
2483 /* If NAME is "f<args>", where either 'f' or 'args' is
2484 dependent, then the expression is dependent. */
2485 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2486 && dependent_template_id_p (TREE_OPERAND (name, 0),
2487 TREE_OPERAND (name, 1)))
2488 /* If NAME is "T::X" where "T" is dependent, then the
2489 expression is dependent. */
2490 || (TREE_CODE (name) == SCOPE_REF
2491 && TYPE_P (TREE_OPERAND (name, 0))
2492 && dependent_type_p (TREE_OPERAND (name, 0))))
2493 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2494 object = build_non_dependent_expr (object);
2496 else if (c_dialect_objc ()
2497 && TREE_CODE (name) == IDENTIFIER_NODE
2498 && (expr = objc_maybe_build_component_ref (object, name)))
2503 The type of the first expression shall be "class object" (of a
2505 if (!currently_open_class (object_type)
2506 && !complete_type_or_maybe_complain (object_type, object, complain))
2507 return error_mark_node;
2508 if (!CLASS_TYPE_P (object_type))
2510 if (complain & tf_error)
2511 error ("request for member %qD in %qE, which is of non-class type %qT",
2512 name, object, object_type);
2513 return error_mark_node;
2516 if (BASELINK_P (name))
2517 /* A member function that has already been looked up. */
2521 bool is_template_id = false;
2522 tree template_args = NULL_TREE;
2525 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2527 is_template_id = true;
2528 template_args = TREE_OPERAND (name, 1);
2529 name = TREE_OPERAND (name, 0);
2531 if (TREE_CODE (name) == OVERLOAD)
2532 name = DECL_NAME (get_first_fn (name));
2533 else if (DECL_P (name))
2534 name = DECL_NAME (name);
2537 if (TREE_CODE (name) == SCOPE_REF)
2539 /* A qualified name. The qualifying class or namespace `S'
2540 has already been looked up; it is either a TYPE or a
2542 scope = TREE_OPERAND (name, 0);
2543 name = TREE_OPERAND (name, 1);
2545 /* If SCOPE is a namespace, then the qualified name does not
2546 name a member of OBJECT_TYPE. */
2547 if (TREE_CODE (scope) == NAMESPACE_DECL)
2549 if (complain & tf_error)
2550 error ("%<%D::%D%> is not a member of %qT",
2551 scope, name, object_type);
2552 return error_mark_node;
2555 gcc_assert (CLASS_TYPE_P (scope));
2556 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2557 || TREE_CODE (name) == BIT_NOT_EXPR);
2559 if (constructor_name_p (name, scope))
2561 if (complain & tf_error)
2562 error ("cannot call constructor %<%T::%D%> directly",
2564 return error_mark_node;
2567 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2568 access_path = lookup_base (object_type, scope, ba_check, NULL);
2569 if (access_path == error_mark_node)
2570 return error_mark_node;
2573 if (complain & tf_error)
2574 error ("%qT is not a base of %qT", scope, object_type);
2575 return error_mark_node;
2581 access_path = object_type;
2584 if (TREE_CODE (name) == BIT_NOT_EXPR)
2585 member = lookup_destructor (object, scope, name);
2588 /* Look up the member. */
2589 member = lookup_member (access_path, name, /*protect=*/1,
2590 /*want_type=*/false);
2591 if (member == NULL_TREE)
2593 if (complain & tf_error)
2594 error ("%qD has no member named %qE", object_type, name);
2595 return error_mark_node;
2597 if (member == error_mark_node)
2598 return error_mark_node;
2603 tree templ = member;
2605 if (BASELINK_P (templ))
2606 templ = lookup_template_function (templ, template_args);
2609 if (complain & tf_error)
2610 error ("%qD is not a member template function", name);
2611 return error_mark_node;
2616 if (TREE_DEPRECATED (member))
2617 warn_deprecated_use (member, NULL_TREE);
2620 check_template_keyword (member);
2622 expr = build_class_member_access_expr (object, member, access_path,
2623 /*preserve_reference=*/false,
2625 if (processing_template_decl && expr != error_mark_node)
2627 if (BASELINK_P (member))
2629 if (TREE_CODE (orig_name) == SCOPE_REF)
2630 BASELINK_QUALIFIED_P (member) = 1;
2633 return build_min_non_dep (COMPONENT_REF, expr,
2634 orig_object, orig_name,
2641 /* Return an expression for the MEMBER_NAME field in the internal
2642 representation of PTRMEM, a pointer-to-member function. (Each
2643 pointer-to-member function type gets its own RECORD_TYPE so it is
2644 more convenient to access the fields by name than by FIELD_DECL.)
2645 This routine converts the NAME to a FIELD_DECL and then creates the
2646 node for the complete expression. */
2649 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2655 /* This code is a stripped down version of
2656 build_class_member_access_expr. It does not work to use that
2657 routine directly because it expects the object to be of class
2659 ptrmem_type = TREE_TYPE (ptrmem);
2660 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2661 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2662 /*want_type=*/false);
2663 member_type = cp_build_qualified_type (TREE_TYPE (member),
2664 cp_type_quals (ptrmem_type));
2665 return fold_build3_loc (input_location,
2666 COMPONENT_REF, member_type,
2667 ptrmem, member, NULL_TREE);
2670 /* Given an expression PTR for a pointer, return an expression
2671 for the value pointed to.
2672 ERRORSTRING is the name of the operator to appear in error messages.
2674 This function may need to overload OPERATOR_FNNAME.
2675 Must also handle REFERENCE_TYPEs for C++. */
2678 build_x_indirect_ref (tree expr, ref_operator errorstring,
2679 tsubst_flags_t complain)
2681 tree orig_expr = expr;
2684 if (processing_template_decl)
2686 /* Retain the type if we know the operand is a pointer. */
2687 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2688 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2689 if (type_dependent_expression_p (expr))
2690 return build_min_nt (INDIRECT_REF, expr);
2691 expr = build_non_dependent_expr (expr);
2694 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2695 NULL_TREE, /*overload=*/NULL, complain);
2697 rval = cp_build_indirect_ref (expr, errorstring, complain);
2699 if (processing_template_decl && rval != error_mark_node)
2700 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2705 /* Helper function called from c-common. */
2707 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2708 tree ptr, ref_operator errorstring)
2710 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2714 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2715 tsubst_flags_t complain)
2719 if (ptr == error_mark_node)
2720 return error_mark_node;
2722 if (ptr == current_class_ptr)
2723 return current_class_ref;
2725 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2726 ? ptr : decay_conversion (ptr));
2727 type = TREE_TYPE (pointer);
2729 if (POINTER_TYPE_P (type))
2733 If the type of the expression is "pointer to T," the type
2734 of the result is "T." */
2735 tree t = TREE_TYPE (type);
2737 if (CONVERT_EXPR_P (ptr)
2738 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2740 /* If a warning is issued, mark it to avoid duplicates from
2741 the backend. This only needs to be done at
2742 warn_strict_aliasing > 2. */
2743 if (warn_strict_aliasing > 2)
2744 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2745 type, TREE_OPERAND (ptr, 0)))
2746 TREE_NO_WARNING (ptr) = 1;
2749 if (VOID_TYPE_P (t))
2751 /* A pointer to incomplete type (other than cv void) can be
2752 dereferenced [expr.unary.op]/1 */
2753 if (complain & tf_error)
2754 error ("%qT is not a pointer-to-object type", type);
2755 return error_mark_node;
2757 else if (TREE_CODE (pointer) == ADDR_EXPR
2758 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2759 /* The POINTER was something like `&x'. We simplify `*&x' to
2761 return TREE_OPERAND (pointer, 0);
2764 tree ref = build1 (INDIRECT_REF, t, pointer);
2766 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2767 so that we get the proper error message if the result is used
2768 to assign to. Also, &* is supposed to be a no-op. */
2769 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2770 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2771 TREE_SIDE_EFFECTS (ref)
2772 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2776 else if (!(complain & tf_error))
2777 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2779 /* `pointer' won't be an error_mark_node if we were given a
2780 pointer to member, so it's cool to check for this here. */
2781 else if (TYPE_PTR_TO_MEMBER_P (type))
2782 switch (errorstring)
2784 case RO_ARRAY_INDEXING:
2785 error ("invalid use of array indexing on pointer to member");
2788 error ("invalid use of unary %<*%> on pointer to member");
2790 case RO_IMPLICIT_CONVERSION:
2791 error ("invalid use of implicit conversion on pointer to member");
2796 else if (pointer != error_mark_node)
2797 invalid_indirection_error (input_location, type, errorstring);
2799 return error_mark_node;
2802 /* This handles expressions of the form "a[i]", which denotes
2805 This is logically equivalent in C to *(a+i), but we may do it differently.
2806 If A is a variable or a member, we generate a primitive ARRAY_REF.
2807 This avoids forcing the array out of registers, and can work on
2808 arrays that are not lvalues (for example, members of structures returned
2811 If INDEX is of some user-defined type, it must be converted to
2812 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2813 will inherit the type of the array, which will be some pointer type.
2815 LOC is the location to use in building the array reference. */
2818 cp_build_array_ref (location_t loc, tree array, tree idx,
2819 tsubst_flags_t complain)
2825 if (complain & tf_error)
2826 error_at (loc, "subscript missing in array reference");
2827 return error_mark_node;
2830 if (TREE_TYPE (array) == error_mark_node
2831 || TREE_TYPE (idx) == error_mark_node)
2832 return error_mark_node;
2834 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2836 switch (TREE_CODE (array))
2840 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2842 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2843 TREE_OPERAND (array, 0), value);
2844 SET_EXPR_LOCATION (ret, loc);
2849 ret = build_conditional_expr
2850 (TREE_OPERAND (array, 0),
2851 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2853 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
2855 tf_warning_or_error);
2856 protected_set_expr_location (ret, loc);
2863 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2867 warn_array_subscript_with_type_char (idx);
2869 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2871 if (complain & tf_error)
2872 error_at (loc, "array subscript is not an integer");
2873 return error_mark_node;
2876 /* Apply integral promotions *after* noticing character types.
2877 (It is unclear why we do these promotions -- the standard
2878 does not say that we should. In fact, the natural thing would
2879 seem to be to convert IDX to ptrdiff_t; we're performing
2880 pointer arithmetic.) */
2881 idx = perform_integral_promotions (idx);
2883 /* An array that is indexed by a non-constant
2884 cannot be stored in a register; we must be able to do
2885 address arithmetic on its address.
2886 Likewise an array of elements of variable size. */
2887 if (TREE_CODE (idx) != INTEGER_CST
2888 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2889 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2892 if (!cxx_mark_addressable (array))
2893 return error_mark_node;
2896 /* An array that is indexed by a constant value which is not within
2897 the array bounds cannot be stored in a register either; because we
2898 would get a crash in store_bit_field/extract_bit_field when trying
2899 to access a non-existent part of the register. */
2900 if (TREE_CODE (idx) == INTEGER_CST
2901 && TYPE_DOMAIN (TREE_TYPE (array))
2902 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2904 if (!cxx_mark_addressable (array))
2905 return error_mark_node;
2908 if (!lvalue_p (array) && (complain & tf_error))
2909 pedwarn (loc, OPT_pedantic,
2910 "ISO C++ forbids subscripting non-lvalue array");
2912 /* Note in C++ it is valid to subscript a `register' array, since
2913 it is valid to take the address of something with that
2914 storage specification. */
2918 while (TREE_CODE (foo) == COMPONENT_REF)
2919 foo = TREE_OPERAND (foo, 0);
2920 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)
2921 && (complain & tf_warning))
2922 warning_at (loc, OPT_Wextra,
2923 "subscripting array declared %<register%>");
2926 type = TREE_TYPE (TREE_TYPE (array));
2927 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2928 /* Array ref is const/volatile if the array elements are
2929 or if the array is.. */
2930 TREE_READONLY (rval)
2931 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2932 TREE_SIDE_EFFECTS (rval)
2933 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2934 TREE_THIS_VOLATILE (rval)
2935 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2936 ret = require_complete_type_sfinae (fold_if_not_in_template (rval),
2938 protected_set_expr_location (ret, loc);
2943 tree ar = default_conversion (array);
2944 tree ind = default_conversion (idx);
2946 /* Put the integer in IND to simplify error checking. */
2947 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2954 if (ar == error_mark_node)
2957 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2959 if (complain & tf_error)
2960 error_at (loc, "subscripted value is neither array nor pointer");
2961 return error_mark_node;
2963 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2965 if (complain & tf_error)
2966 error_at (loc, "array subscript is not an integer");
2967 return error_mark_node;
2970 warn_array_subscript_with_type_char (idx);
2972 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
2977 protected_set_expr_location (ret, loc);
2982 /* Entry point for Obj-C++. */
2985 build_array_ref (location_t loc, tree array, tree idx)
2987 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
2990 /* Resolve a pointer to member function. INSTANCE is the object
2991 instance to use, if the member points to a virtual member.
2993 This used to avoid checking for virtual functions if basetype
2994 has no virtual functions, according to an earlier ANSI draft.
2995 With the final ISO C++ rules, such an optimization is
2996 incorrect: A pointer to a derived member can be static_cast
2997 to pointer-to-base-member, as long as the dynamic object
2998 later has the right member. */
3001 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
3003 if (TREE_CODE (function) == OFFSET_REF)
3004 function = TREE_OPERAND (function, 1);
3006 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
3008 tree idx, delta, e1, e2, e3, vtbl, basetype;
3009 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
3011 tree instance_ptr = *instance_ptrptr;
3012 tree instance_save_expr = 0;
3013 if (instance_ptr == error_mark_node)
3015 if (TREE_CODE (function) == PTRMEM_CST)
3017 /* Extracting the function address from a pmf is only
3018 allowed with -Wno-pmf-conversions. It only works for
3020 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
3021 e1 = convert (fntype, e1);
3026 error ("object missing in use of %qE", function);
3027 return error_mark_node;
3031 if (TREE_SIDE_EFFECTS (instance_ptr))
3032 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3034 if (TREE_SIDE_EFFECTS (function))
3035 function = save_expr (function);
3037 /* Start by extracting all the information from the PMF itself. */
3038 e3 = pfn_from_ptrmemfunc (function);
3039 delta = delta_from_ptrmemfunc (function);
3040 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3041 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3043 case ptrmemfunc_vbit_in_pfn:
3044 e1 = cp_build_binary_op (input_location,
3045 BIT_AND_EXPR, idx, integer_one_node,
3046 tf_warning_or_error);
3047 idx = cp_build_binary_op (input_location,
3048 MINUS_EXPR, idx, integer_one_node,
3049 tf_warning_or_error);
3052 case ptrmemfunc_vbit_in_delta:
3053 e1 = cp_build_binary_op (input_location,
3054 BIT_AND_EXPR, delta, integer_one_node,
3055 tf_warning_or_error);
3056 delta = cp_build_binary_op (input_location,
3057 RSHIFT_EXPR, delta, integer_one_node,
3058 tf_warning_or_error);
3065 /* Convert down to the right base before using the instance. A
3066 special case is that in a pointer to member of class C, C may
3067 be incomplete. In that case, the function will of course be
3068 a member of C, and no conversion is required. In fact,
3069 lookup_base will fail in that case, because incomplete
3070 classes do not have BINFOs. */
3071 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3072 if (!same_type_ignoring_top_level_qualifiers_p
3073 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3075 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3076 basetype, ba_check, NULL);
3077 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3078 1, tf_warning_or_error);
3079 if (instance_ptr == error_mark_node)
3080 return error_mark_node;
3082 /* ...and then the delta in the PMF. */
3083 instance_ptr = fold_build_pointer_plus (instance_ptr, delta);
3085 /* Hand back the adjusted 'this' argument to our caller. */
3086 *instance_ptrptr = instance_ptr;
3088 /* Next extract the vtable pointer from the object. */
3089 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3091 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, tf_warning_or_error);
3092 /* If the object is not dynamic the access invokes undefined
3093 behavior. As it is not executed in this case silence the
3094 spurious warnings it may provoke. */
3095 TREE_NO_WARNING (vtbl) = 1;
3097 /* Finally, extract the function pointer from the vtable. */
3098 e2 = fold_build_pointer_plus_loc (input_location, vtbl, idx);
3099 e2 = cp_build_indirect_ref (e2, RO_NULL, tf_warning_or_error);
3100 TREE_CONSTANT (e2) = 1;
3102 /* When using function descriptors, the address of the
3103 vtable entry is treated as a function pointer. */
3104 if (TARGET_VTABLE_USES_DESCRIPTORS)
3105 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3106 cp_build_addr_expr (e2, tf_warning_or_error));
3108 e2 = fold_convert (TREE_TYPE (e3), e2);
3109 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
3111 /* Make sure this doesn't get evaluated first inside one of the
3112 branches of the COND_EXPR. */
3113 if (instance_save_expr)
3114 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3115 instance_save_expr, e1);
3122 /* Used by the C-common bits. */
3124 build_function_call (location_t loc ATTRIBUTE_UNUSED,
3125 tree function, tree params)
3127 return cp_build_function_call (function, params, tf_warning_or_error);
3130 /* Used by the C-common bits. */
3132 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
3133 tree function, VEC(tree,gc) *params,
3134 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
3136 VEC(tree,gc) *orig_params = params;
3137 tree ret = cp_build_function_call_vec (function, ¶ms,
3138 tf_warning_or_error);
3140 /* cp_build_function_call_vec can reallocate PARAMS by adding
3141 default arguments. That should never happen here. Verify
3143 gcc_assert (params == orig_params);
3148 /* Build a function call using a tree list of arguments. */
3151 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3156 vec = make_tree_vector ();
3157 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3158 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3159 ret = cp_build_function_call_vec (function, &vec, complain);
3160 release_tree_vector (vec);
3164 /* Build a function call using varargs. */
3167 cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
3173 vec = make_tree_vector ();
3174 va_start (args, complain);
3175 for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
3176 VEC_safe_push (tree, gc, vec, t);
3178 ret = cp_build_function_call_vec (function, &vec, complain);
3179 release_tree_vector (vec);
3183 /* Build a function call using a vector of arguments. PARAMS may be
3184 NULL if there are no parameters. This changes the contents of
3188 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3189 tsubst_flags_t complain)
3191 tree fntype, fndecl;
3193 tree original = function;
3197 VEC(tree,gc) *allocated = NULL;
3200 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3201 expressions, like those used for ObjC messenger dispatches. */
3202 if (params != NULL && !VEC_empty (tree, *params))
3203 function = objc_rewrite_function_call (function,
3204 VEC_index (tree, *params, 0));
3206 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3207 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3208 if (TREE_CODE (function) == NOP_EXPR
3209 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3210 function = TREE_OPERAND (function, 0);
3212 if (TREE_CODE (function) == FUNCTION_DECL)
3214 mark_used (function);
3217 /* Convert anything with function type to a pointer-to-function. */
3218 if (DECL_MAIN_P (function) && (complain & tf_error))
3219 pedwarn (input_location, OPT_pedantic,
3220 "ISO C++ forbids calling %<::main%> from within program");
3222 function = build_addr_func (function);
3228 function = build_addr_func (function);
3231 if (function == error_mark_node)
3232 return error_mark_node;
3234 fntype = TREE_TYPE (function);
3236 if (TYPE_PTRMEMFUNC_P (fntype))
3238 if (complain & tf_error)
3239 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3240 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3241 original, original);
3242 return error_mark_node;
3245 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3246 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3248 if (!((TREE_CODE (fntype) == POINTER_TYPE
3249 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3251 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3253 if (complain & tf_error)
3254 error ("%qE cannot be used as a function", original);
3255 return error_mark_node;
3258 /* fntype now gets the type of function pointed to. */
3259 fntype = TREE_TYPE (fntype);
3260 parm_types = TYPE_ARG_TYPES (fntype);
3264 allocated = make_tree_vector ();
3265 params = &allocated;
3268 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3271 return error_mark_node;
3273 argarray = VEC_address (tree, *params);
3275 /* Check for errors in format strings and inappropriately
3277 check_function_arguments (fntype, nargs, argarray);
3279 ret = build_cxx_call (function, nargs, argarray);
3281 if (allocated != NULL)
3282 release_tree_vector (allocated);
3287 /* Subroutine of convert_arguments.
3288 Warn about wrong number of args are genereted. */
3291 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3295 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3297 if (DECL_NAME (fndecl) == NULL_TREE
3298 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3301 ? G_("too many arguments to constructor %q#D")
3302 : G_("too few arguments to constructor %q#D"),
3307 ? G_("too many arguments to member function %q#D")
3308 : G_("too few arguments to member function %q#D"),
3314 ? G_("too many arguments to function %q#D")
3315 : G_("too few arguments to function %q#D"),
3317 inform (DECL_SOURCE_LOCATION (fndecl),
3322 if (c_dialect_objc () && objc_message_selector ())
3325 ? G_("too many arguments to method %q#D")
3326 : G_("too few arguments to method %q#D"),
3327 objc_message_selector ());
3329 error_at (loc, too_many_p ? G_("too many arguments to function")
3330 : G_("too few arguments to function"));
3334 /* Convert the actual parameter expressions in the list VALUES to the
3335 types in the list TYPELIST. The converted expressions are stored
3336 back in the VALUES vector.
3337 If parmdecls is exhausted, or when an element has NULL as its type,
3338 perform the default conversions.
3340 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3342 This is also where warnings about wrong number of args are generated.
3344 Returns the actual number of arguments processed (which might be less
3345 than the length of the vector), or -1 on error.
3347 In C++, unspecified trailing parameters can be filled in with their
3348 default arguments, if such were specified. Do so here. */
3351 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3352 int flags, tsubst_flags_t complain)
3357 /* Argument passing is always copy-initialization. */
3358 flags |= LOOKUP_ONLYCONVERTING;
3360 for (i = 0, typetail = typelist;
3361 i < VEC_length (tree, *values);
3364 tree type = typetail ? TREE_VALUE (typetail) : 0;
3365 tree val = VEC_index (tree, *values, i);
3367 if (val == error_mark_node || type == error_mark_node)
3370 if (type == void_type_node)
3372 if (complain & tf_error)
3374 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3381 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3382 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3383 if (TREE_CODE (val) == NOP_EXPR
3384 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3385 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3386 val = TREE_OPERAND (val, 0);
3388 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3390 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3391 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3392 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3393 val = decay_conversion (val);
3396 if (val == error_mark_node)
3401 /* Formal parm type is specified by a function prototype. */
3404 if (!COMPLETE_TYPE_P (complete_type (type)))
3406 if (complain & tf_error)
3409 error ("parameter %P of %qD has incomplete type %qT",
3412 error ("parameter %P has incomplete type %qT", i, type);
3414 parmval = error_mark_node;
3418 parmval = convert_for_initialization
3419 (NULL_TREE, type, val, flags,
3420 ICR_ARGPASS, fndecl, i, complain);
3421 parmval = convert_for_arg_passing (type, parmval);
3424 if (parmval == error_mark_node)
3427 VEC_replace (tree, *values, i, parmval);
3431 if (fndecl && DECL_BUILT_IN (fndecl)
3432 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3433 /* Don't do ellipsis conversion for __built_in_constant_p
3434 as this will result in spurious errors for non-trivial
3436 val = require_complete_type_sfinae (val, complain);
3438 val = convert_arg_to_ellipsis (val);
3440 VEC_replace (tree, *values, i, val);
3444 typetail = TREE_CHAIN (typetail);
3447 if (typetail != 0 && typetail != void_list_node)
3449 /* See if there are default arguments that can be used. Because
3450 we hold default arguments in the FUNCTION_TYPE (which is so
3451 wrong), we can see default parameters here from deduced
3452 contexts (and via typeof) for indirect function calls.
3453 Fortunately we know whether we have a function decl to
3454 provide default arguments in a language conformant
3456 if (fndecl && TREE_PURPOSE (typetail)
3457 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3459 for (; typetail != void_list_node; ++i)
3462 = convert_default_arg (TREE_VALUE (typetail),
3463 TREE_PURPOSE (typetail),
3466 if (parmval == error_mark_node)
3469 VEC_safe_push (tree, gc, *values, parmval);
3470 typetail = TREE_CHAIN (typetail);
3471 /* ends with `...'. */
3472 if (typetail == NULL_TREE)
3478 if (complain & tf_error)
3479 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3487 /* Build a binary-operation expression, after performing default
3488 conversions on the operands. CODE is the kind of expression to
3489 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3490 are the tree codes which correspond to ARG1 and ARG2 when issuing
3491 warnings about possibly misplaced parentheses. They may differ
3492 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3493 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3494 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3495 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3496 ARG2_CODE as ERROR_MARK. */
3499 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3500 tree arg2, enum tree_code arg2_code, tree *overload,
3501 tsubst_flags_t complain)
3510 if (processing_template_decl)
3512 if (type_dependent_expression_p (arg1)
3513 || type_dependent_expression_p (arg2))
3514 return build_min_nt (code, arg1, arg2);
3515 arg1 = build_non_dependent_expr (arg1);
3516 arg2 = build_non_dependent_expr (arg2);
3519 if (code == DOTSTAR_EXPR)
3520 expr = build_m_component_ref (arg1, arg2);
3522 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3523 overload, complain);
3525 /* Check for cases such as x+y<<z which users are likely to
3526 misinterpret. But don't warn about obj << x + y, since that is a
3527 common idiom for I/O. */
3528 if (warn_parentheses
3529 && (complain & tf_warning)
3530 && !processing_template_decl
3531 && !error_operand_p (arg1)
3532 && !error_operand_p (arg2)
3533 && (code != LSHIFT_EXPR
3534 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3535 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3537 if (processing_template_decl && expr != error_mark_node)
3538 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3543 /* Build and return an ARRAY_REF expression. */
3546 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3548 tree orig_arg1 = arg1;
3549 tree orig_arg2 = arg2;
3552 if (processing_template_decl)
3554 if (type_dependent_expression_p (arg1)
3555 || type_dependent_expression_p (arg2))
3556 return build_min_nt (ARRAY_REF, arg1, arg2,
3557 NULL_TREE, NULL_TREE);
3558 arg1 = build_non_dependent_expr (arg1);
3559 arg2 = build_non_dependent_expr (arg2);
3562 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3563 /*overload=*/NULL, complain);
3565 if (processing_template_decl && expr != error_mark_node)
3566 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3567 NULL_TREE, NULL_TREE);
3571 /* For the c-common bits. */
3573 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3574 int convert_p ATTRIBUTE_UNUSED)
3576 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3580 /* Build a binary-operation expression without default conversions.
3581 CODE is the kind of expression to build.
3582 LOCATION is the location_t of the operator in the source code.
3583 This function differs from `build' in several ways:
3584 the data type of the result is computed and recorded in it,
3585 warnings are generated if arg data types are invalid,
3586 special handling for addition and subtraction of pointers is known,
3587 and some optimization is done (operations on narrow ints
3588 are done in the narrower type when that gives the same result).
3589 Constant folding is also done before the result is returned.
3591 Note that the operands will never have enumeral types
3592 because either they have just had the default conversions performed
3593 or they have both just been converted to some other type in which
3594 the arithmetic is to be done.
3596 C++: must do special pointer arithmetic when implementing
3597 multiple inheritance, and deal with pointer to member functions. */
3600 cp_build_binary_op (location_t location,
3601 enum tree_code code, tree orig_op0, tree orig_op1,
3602 tsubst_flags_t complain)
3605 enum tree_code code0, code1;
3607 const char *invalid_op_diag;
3609 /* Expression code to give to the expression when it is built.
3610 Normally this is CODE, which is what the caller asked for,
3611 but in some special cases we change it. */
3612 enum tree_code resultcode = code;
3614 /* Data type in which the computation is to be performed.
3615 In the simplest cases this is the common type of the arguments. */
3616 tree result_type = NULL;
3618 /* Nonzero means operands have already been type-converted
3619 in whatever way is necessary.
3620 Zero means they need to be converted to RESULT_TYPE. */
3623 /* Nonzero means create the expression with this type, rather than
3625 tree build_type = 0;
3627 /* Nonzero means after finally constructing the expression
3628 convert it to this type. */
3629 tree final_type = 0;
3633 /* Nonzero if this is an operation like MIN or MAX which can
3634 safely be computed in short if both args are promoted shorts.
3635 Also implies COMMON.
3636 -1 indicates a bitwise operation; this makes a difference
3637 in the exact conditions for when it is safe to do the operation
3638 in a narrower mode. */
3641 /* Nonzero if this is a comparison operation;
3642 if both args are promoted shorts, compare the original shorts.
3643 Also implies COMMON. */
3644 int short_compare = 0;
3646 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3649 /* True if both operands have arithmetic type. */
3650 bool arithmetic_types_p;
3652 /* Apply default conversions. */
3656 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3657 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3658 || code == TRUTH_XOR_EXPR)
3660 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3661 op0 = decay_conversion (op0);
3662 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3663 op1 = decay_conversion (op1);
3667 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3668 op0 = default_conversion (op0);
3669 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3670 op1 = default_conversion (op1);
3673 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3674 STRIP_TYPE_NOPS (op0);
3675 STRIP_TYPE_NOPS (op1);
3677 /* DTRT if one side is an overloaded function, but complain about it. */
3678 if (type_unknown_p (op0))
3680 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3681 if (t != error_mark_node)
3683 if (complain & tf_error)
3684 permerror (input_location, "assuming cast to type %qT from overloaded function",
3689 if (type_unknown_p (op1))
3691 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3692 if (t != error_mark_node)
3694 if (complain & tf_error)
3695 permerror (input_location, "assuming cast to type %qT from overloaded function",
3701 type0 = TREE_TYPE (op0);
3702 type1 = TREE_TYPE (op1);
3704 /* The expression codes of the data types of the arguments tell us
3705 whether the arguments are integers, floating, pointers, etc. */
3706 code0 = TREE_CODE (type0);
3707 code1 = TREE_CODE (type1);
3709 /* If an error was already reported for one of the arguments,
3710 avoid reporting another error. */
3711 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3712 return error_mark_node;
3714 if ((invalid_op_diag
3715 = targetm.invalid_binary_op (code, type0, type1)))
3717 error (invalid_op_diag);
3718 return error_mark_node;
3721 /* Issue warnings about peculiar, but valid, uses of NULL. */
3722 if ((orig_op0 == null_node || orig_op1 == null_node)
3723 /* It's reasonable to use pointer values as operands of &&
3724 and ||, so NULL is no exception. */
3725 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3726 && ( /* Both are NULL (or 0) and the operation was not a
3727 comparison or a pointer subtraction. */
3728 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3729 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3730 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3731 || (!null_ptr_cst_p (orig_op0)
3732 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3733 || (!null_ptr_cst_p (orig_op1)
3734 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3735 && (complain & tf_warning))
3736 /* Some sort of arithmetic operation involving NULL was
3738 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3743 /* Subtraction of two similar pointers.
3744 We must subtract them as integers, then divide by object size. */
3745 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3746 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3748 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3749 /* In all other cases except pointer - int, the usual arithmetic
3751 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3756 /* The pointer - int case is just like pointer + int; fall
3759 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3760 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3764 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3765 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3766 if (processing_template_decl)
3768 result_type = TREE_TYPE (ptr_operand);
3771 return cp_pointer_int_sum (code,
3782 case TRUNC_DIV_EXPR:
3784 case FLOOR_DIV_EXPR:
3785 case ROUND_DIV_EXPR:
3786 case EXACT_DIV_EXPR:
3787 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3788 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3789 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3790 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3792 enum tree_code tcode0 = code0, tcode1 = code1;
3794 warn_for_div_by_zero (location, op1);
3796 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3797 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3798 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3799 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3801 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3802 resultcode = RDIV_EXPR;
3804 /* When dividing two signed integers, we have to promote to int.
3805 unless we divide by a constant != -1. Note that default
3806 conversion will have been performed on the operands at this
3807 point, so we have to dig out the original type to find out if
3809 shorten = ((TREE_CODE (op0) == NOP_EXPR
3810 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3811 || (TREE_CODE (op1) == INTEGER_CST
3812 && ! integer_all_onesp (op1)));
3821 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3822 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3823 && !VECTOR_FLOAT_TYPE_P (type0)
3824 && !VECTOR_FLOAT_TYPE_P (type1)))
3828 case TRUNC_MOD_EXPR:
3829 case FLOOR_MOD_EXPR:
3830 warn_for_div_by_zero (location, op1);
3832 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3833 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3834 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3836 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3838 /* Although it would be tempting to shorten always here, that loses
3839 on some targets, since the modulo instruction is undefined if the
3840 quotient can't be represented in the computation mode. We shorten
3841 only if unsigned or if dividing by something we know != -1. */
3842 shorten = ((TREE_CODE (op0) == NOP_EXPR
3843 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3844 || (TREE_CODE (op1) == INTEGER_CST
3845 && ! integer_all_onesp (op1)));
3850 case TRUTH_ANDIF_EXPR:
3851 case TRUTH_ORIF_EXPR:
3852 case TRUTH_AND_EXPR:
3854 result_type = boolean_type_node;
3857 /* Shift operations: result has same type as first operand;
3858 always convert second operand to int.
3859 Also set SHORT_SHIFT if shifting rightward. */
3862 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3864 result_type = type0;
3865 if (TREE_CODE (op1) == INTEGER_CST)
3867 if (tree_int_cst_lt (op1, integer_zero_node))
3869 if ((complain & tf_warning)
3870 && c_inhibit_evaluation_warnings == 0)
3871 warning (0, "right shift count is negative");
3875 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3876 && (complain & tf_warning)
3877 && c_inhibit_evaluation_warnings == 0)
3878 warning (0, "right shift count >= width of type");
3881 /* Convert the shift-count to an integer, regardless of
3882 size of value being shifted. */
3883 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3884 op1 = cp_convert (integer_type_node, op1);
3885 /* Avoid converting op1 to result_type later. */
3891 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3893 result_type = type0;
3894 if (TREE_CODE (op1) == INTEGER_CST)
3896 if (tree_int_cst_lt (op1, integer_zero_node))
3898 if ((complain & tf_warning)
3899 && c_inhibit_evaluation_warnings == 0)
3900 warning (0, "left shift count is negative");
3902 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3904 if ((complain & tf_warning)
3905 && c_inhibit_evaluation_warnings == 0)
3906 warning (0, "left shift count >= width of type");
3909 /* Convert the shift-count to an integer, regardless of
3910 size of value being shifted. */
3911 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3912 op1 = cp_convert (integer_type_node, op1);
3913 /* Avoid converting op1 to result_type later. */
3920 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3922 result_type = type0;
3923 if (TREE_CODE (op1) == INTEGER_CST)
3925 if (tree_int_cst_lt (op1, integer_zero_node))
3927 if (complain & tf_warning)
3928 warning (0, (code == LROTATE_EXPR)
3929 ? G_("left rotate count is negative")
3930 : G_("right rotate count is negative"));
3932 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3934 if (complain & tf_warning)
3935 warning (0, (code == LROTATE_EXPR)
3936 ? G_("left rotate count >= width of type")
3937 : G_("right rotate count >= width of type"));
3940 /* Convert the shift-count to an integer, regardless of
3941 size of value being shifted. */
3942 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3943 op1 = cp_convert (integer_type_node, op1);
3949 if ((complain & tf_warning)
3950 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3951 warning (OPT_Wfloat_equal,
3952 "comparing floating point with == or != is unsafe");
3953 if ((complain & tf_warning)
3954 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3955 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3956 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3958 build_type = boolean_type_node;
3959 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3960 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
3961 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3962 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
3964 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3965 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3966 result_type = composite_pointer_type (type0, type1, op0, op1,
3967 CPO_COMPARISON, complain);
3968 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3969 && null_ptr_cst_p (op1))
3971 if (TREE_CODE (op0) == ADDR_EXPR
3972 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
3974 if (complain & tf_warning)
3975 warning (OPT_Waddress, "the address of %qD will never be NULL",
3976 TREE_OPERAND (op0, 0));
3978 result_type = type0;
3980 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3981 && null_ptr_cst_p (op0))
3983 if (TREE_CODE (op1) == ADDR_EXPR
3984 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
3986 if (complain & tf_warning)
3987 warning (OPT_Waddress, "the address of %qD will never be NULL",
3988 TREE_OPERAND (op1, 0));
3990 result_type = type1;
3992 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
3993 /* One of the operands must be of nullptr_t type. */
3994 result_type = TREE_TYPE (nullptr_node);
3995 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3997 result_type = type0;
3998 if (complain & tf_error)
3999 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4001 return error_mark_node;
4003 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4005 result_type = type1;
4006 if (complain & tf_error)
4007 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4009 return error_mark_node;
4011 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4013 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4014 == ptrmemfunc_vbit_in_delta)
4016 tree pfn0 = pfn_from_ptrmemfunc (op0);
4017 tree delta0 = delta_from_ptrmemfunc (op0);
4018 tree e1 = cp_build_binary_op (location,
4021 build_zero_cst (TREE_TYPE (pfn0)),
4023 tree e2 = cp_build_binary_op (location,
4028 e2 = cp_build_binary_op (location,
4029 EQ_EXPR, e2, integer_zero_node,
4031 op0 = cp_build_binary_op (location,
4032 TRUTH_ANDIF_EXPR, e1, e2,
4034 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
4038 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4039 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
4041 result_type = TREE_TYPE (op0);
4043 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4044 return cp_build_binary_op (location, code, op1, op0, complain);
4045 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4048 /* E will be the final comparison. */
4050 /* E1 and E2 are for scratch. */
4058 type = composite_pointer_type (type0, type1, op0, op1,
4059 CPO_COMPARISON, complain);
4061 if (!same_type_p (TREE_TYPE (op0), type))
4062 op0 = cp_convert_and_check (type, op0);
4063 if (!same_type_p (TREE_TYPE (op1), type))
4064 op1 = cp_convert_and_check (type, op1);
4066 if (op0 == error_mark_node || op1 == error_mark_node)
4067 return error_mark_node;
4069 if (TREE_SIDE_EFFECTS (op0))
4070 op0 = save_expr (op0);
4071 if (TREE_SIDE_EFFECTS (op1))
4072 op1 = save_expr (op1);
4074 pfn0 = pfn_from_ptrmemfunc (op0);
4075 pfn1 = pfn_from_ptrmemfunc (op1);
4076 delta0 = delta_from_ptrmemfunc (op0);
4077 delta1 = delta_from_ptrmemfunc (op1);
4078 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4079 == ptrmemfunc_vbit_in_delta)
4084 && ((op0.delta == op1.delta)
4085 || (!op0.pfn && op0.delta & 1 == 0
4086 && op1.delta & 1 == 0))
4088 The reason for the `!op0.pfn' bit is that a NULL
4089 pointer-to-member is any member with a zero PFN and
4090 LSB of the DELTA field is 0. */
4092 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4096 e1 = cp_build_binary_op (location,
4097 EQ_EXPR, e1, integer_zero_node,
4099 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4103 e2 = cp_build_binary_op (location,
4104 EQ_EXPR, e2, integer_zero_node,
4106 e1 = cp_build_binary_op (location,
4107 TRUTH_ANDIF_EXPR, e2, e1,
4109 e2 = cp_build_binary_op (location, EQ_EXPR,
4111 build_zero_cst (TREE_TYPE (pfn0)),
4113 e2 = cp_build_binary_op (location,
4114 TRUTH_ANDIF_EXPR, e2, e1, complain);
4115 e1 = cp_build_binary_op (location,
4116 EQ_EXPR, delta0, delta1, complain);
4117 e1 = cp_build_binary_op (location,
4118 TRUTH_ORIF_EXPR, e1, e2, complain);
4125 && (!op0.pfn || op0.delta == op1.delta))
4127 The reason for the `!op0.pfn' bit is that a NULL
4128 pointer-to-member is any member with a zero PFN; the
4129 DELTA field is unspecified. */
4131 e1 = cp_build_binary_op (location,
4132 EQ_EXPR, delta0, delta1, complain);
4133 e2 = cp_build_binary_op (location,
4136 build_zero_cst (TREE_TYPE (pfn0)),
4138 e1 = cp_build_binary_op (location,
4139 TRUTH_ORIF_EXPR, e1, e2, complain);
4141 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4142 e = cp_build_binary_op (location,
4143 TRUTH_ANDIF_EXPR, e2, e1, complain);
4144 if (code == EQ_EXPR)
4146 return cp_build_binary_op (location,
4147 EQ_EXPR, e, integer_zero_node, complain);
4151 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4152 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4154 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4155 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4163 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4164 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4166 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4167 result_type = composite_pointer_type (type0, type1, op0, op1,
4168 CPO_COMPARISON, complain);
4175 if (TREE_CODE (orig_op0) == STRING_CST
4176 || TREE_CODE (orig_op1) == STRING_CST)
4178 if (complain & tf_warning)
4179 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4182 build_type = boolean_type_node;
4183 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4184 || code0 == ENUMERAL_TYPE)
4185 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4186 || code1 == ENUMERAL_TYPE))
4188 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4189 result_type = composite_pointer_type (type0, type1, op0, op1,
4190 CPO_COMPARISON, complain);
4191 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4193 result_type = type0;
4194 if (extra_warnings && (complain & tf_warning))
4195 warning (OPT_Wextra,
4196 "ordered comparison of pointer with integer zero");
4198 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4200 result_type = type1;
4201 if (extra_warnings && (complain & tf_warning))
4202 warning (OPT_Wextra,
4203 "ordered comparison of pointer with integer zero");
4205 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4206 /* One of the operands must be of nullptr_t type. */
4207 result_type = TREE_TYPE (nullptr_node);
4208 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4210 result_type = type0;
4211 if (complain & tf_error)
4212 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4214 return error_mark_node;
4216 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4218 result_type = type1;
4219 if (complain & tf_error)
4220 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4222 return error_mark_node;
4226 case UNORDERED_EXPR:
4233 build_type = integer_type_node;
4234 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4236 if (complain & tf_error)
4237 error ("unordered comparison on non-floating point argument");
4238 return error_mark_node;
4247 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4248 || code0 == ENUMERAL_TYPE)
4249 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4250 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4251 arithmetic_types_p = 1;
4254 arithmetic_types_p = 0;
4255 /* Vector arithmetic is only allowed when both sides are vectors. */
4256 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4258 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4259 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4262 binary_op_error (location, code, type0, type1);
4263 return error_mark_node;
4265 arithmetic_types_p = 1;
4268 /* Determine the RESULT_TYPE, if it is not already known. */
4270 && arithmetic_types_p
4271 && (shorten || common || short_compare))
4273 result_type = cp_common_type (type0, type1);
4274 do_warn_double_promotion (result_type, type0, type1,
4275 "implicit conversion from %qT to %qT "
4276 "to match other operand of binary "
4283 if (complain & tf_error)
4284 error ("invalid operands of types %qT and %qT to binary %qO",
4285 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4286 return error_mark_node;
4289 /* If we're in a template, the only thing we need to know is the
4291 if (processing_template_decl)
4293 /* Since the middle-end checks the type when doing a build2, we
4294 need to build the tree in pieces. This built tree will never
4295 get out of the front-end as we replace it when instantiating
4297 tree tmp = build2 (resultcode,
4298 build_type ? build_type : result_type,
4300 TREE_OPERAND (tmp, 0) = op0;
4304 if (arithmetic_types_p)
4306 bool first_complex = (code0 == COMPLEX_TYPE);
4307 bool second_complex = (code1 == COMPLEX_TYPE);
4308 int none_complex = (!first_complex && !second_complex);
4310 /* Adapted from patch for c/24581. */
4311 if (first_complex != second_complex
4312 && (code == PLUS_EXPR
4313 || code == MINUS_EXPR
4314 || code == MULT_EXPR
4315 || (code == TRUNC_DIV_EXPR && first_complex))
4316 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4317 && flag_signed_zeros)
4319 /* An operation on mixed real/complex operands must be
4320 handled specially, but the language-independent code can
4321 more easily optimize the plain complex arithmetic if
4322 -fno-signed-zeros. */
4323 tree real_type = TREE_TYPE (result_type);
4327 if (TREE_TYPE (op0) != result_type)
4328 op0 = cp_convert_and_check (result_type, op0);
4329 if (TREE_TYPE (op1) != real_type)
4330 op1 = cp_convert_and_check (real_type, op1);
4334 if (TREE_TYPE (op0) != real_type)
4335 op0 = cp_convert_and_check (real_type, op0);
4336 if (TREE_TYPE (op1) != result_type)
4337 op1 = cp_convert_and_check (result_type, op1);
4339 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4340 return error_mark_node;
4343 op0 = save_expr (op0);
4344 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4345 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4349 case TRUNC_DIV_EXPR:
4350 op1 = save_expr (op1);
4351 imag = build2 (resultcode, real_type, imag, op1);
4355 real = build2 (resultcode, real_type, real, op1);
4363 op1 = save_expr (op1);
4364 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4365 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4369 op0 = save_expr (op0);
4370 imag = build2 (resultcode, real_type, op0, imag);
4373 real = build2 (resultcode, real_type, op0, real);
4376 real = build2 (resultcode, real_type, op0, real);
4377 imag = build1 (NEGATE_EXPR, real_type, imag);
4383 real = fold_if_not_in_template (real);
4384 imag = fold_if_not_in_template (imag);
4385 result = build2 (COMPLEX_EXPR, result_type, real, imag);
4386 result = fold_if_not_in_template (result);
4390 /* For certain operations (which identify themselves by shorten != 0)
4391 if both args were extended from the same smaller type,
4392 do the arithmetic in that type and then extend.
4394 shorten !=0 and !=1 indicates a bitwise operation.
4395 For them, this optimization is safe only if
4396 both args are zero-extended or both are sign-extended.
4397 Otherwise, we might change the result.
4398 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4399 but calculated in (unsigned short) it would be (unsigned short)-1. */
4401 if (shorten && none_complex)
4403 final_type = result_type;
4404 result_type = shorten_binary_op (result_type, op0, op1,
4408 /* Comparison operations are shortened too but differently.
4409 They identify themselves by setting short_compare = 1. */
4413 /* Don't write &op0, etc., because that would prevent op0
4414 from being kept in a register.
4415 Instead, make copies of the our local variables and
4416 pass the copies by reference, then copy them back afterward. */
4417 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4418 enum tree_code xresultcode = resultcode;
4420 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4422 return cp_convert (boolean_type_node, val);
4423 op0 = xop0, op1 = xop1;
4425 resultcode = xresultcode;
4428 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4429 && warn_sign_compare
4430 && !TREE_NO_WARNING (orig_op0)
4431 && !TREE_NO_WARNING (orig_op1)
4432 /* Do not warn until the template is instantiated; we cannot
4433 bound the ranges of the arguments until that point. */
4434 && !processing_template_decl
4435 && (complain & tf_warning)
4436 && c_inhibit_evaluation_warnings == 0)
4438 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4439 result_type, resultcode);
4443 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4444 Then the expression will be built.
4445 It will be given type FINAL_TYPE if that is nonzero;
4446 otherwise, it will be given type RESULT_TYPE. */
4449 if (TREE_TYPE (op0) != result_type)
4450 op0 = cp_convert_and_check (result_type, op0);
4451 if (TREE_TYPE (op1) != result_type)
4452 op1 = cp_convert_and_check (result_type, op1);
4454 if (op0 == error_mark_node || op1 == error_mark_node)
4455 return error_mark_node;
4458 if (build_type == NULL_TREE)
4459 build_type = result_type;
4461 result = build2 (resultcode, build_type, op0, op1);
4462 result = fold_if_not_in_template (result);
4463 if (final_type != 0)
4464 result = cp_convert (final_type, result);
4466 if (TREE_OVERFLOW_P (result)
4467 && !TREE_OVERFLOW_P (op0)
4468 && !TREE_OVERFLOW_P (op1))
4469 overflow_warning (location, result);
4474 /* Return a tree for the sum or difference (RESULTCODE says which)
4475 of pointer PTROP and integer INTOP. */
4478 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4480 tree res_type = TREE_TYPE (ptrop);
4482 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4483 in certain circumstance (when it's valid to do so). So we need
4484 to make sure it's complete. We don't need to check here, if we
4485 can actually complete it at all, as those checks will be done in
4486 pointer_int_sum() anyway. */
4487 complete_type (TREE_TYPE (res_type));
4489 return pointer_int_sum (input_location, resultcode, ptrop,
4490 fold_if_not_in_template (intop));
4493 /* Return a tree for the difference of pointers OP0 and OP1.
4494 The resulting tree has type int. */
4497 pointer_diff (tree op0, tree op1, tree ptrtype)
4500 tree restype = ptrdiff_type_node;
4501 tree target_type = TREE_TYPE (ptrtype);
4503 if (!complete_type_or_else (target_type, NULL_TREE))
4504 return error_mark_node;
4506 if (TREE_CODE (target_type) == VOID_TYPE)
4507 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4508 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4509 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4510 if (TREE_CODE (target_type) == METHOD_TYPE)
4511 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4513 /* First do the subtraction as integers;
4514 then drop through to build the divide operator. */
4516 op0 = cp_build_binary_op (input_location,
4518 cp_convert (restype, op0),
4519 cp_convert (restype, op1),
4520 tf_warning_or_error);
4522 /* This generates an error if op1 is a pointer to an incomplete type. */
4523 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4524 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4526 op1 = (TYPE_PTROB_P (ptrtype)
4527 ? size_in_bytes (target_type)
4528 : integer_one_node);
4530 /* Do the division. */
4532 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4533 return fold_if_not_in_template (result);
4536 /* Construct and perhaps optimize a tree representation
4537 for a unary operation. CODE, a tree_code, specifies the operation
4538 and XARG is the operand. */
4541 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4543 tree orig_expr = xarg;
4547 if (processing_template_decl)
4549 if (type_dependent_expression_p (xarg))
4550 return build_min_nt (code, xarg, NULL_TREE);
4552 xarg = build_non_dependent_expr (xarg);
4557 /* [expr.unary.op] says:
4559 The address of an object of incomplete type can be taken.
4561 (And is just the ordinary address operator, not an overloaded
4562 "operator &".) However, if the type is a template
4563 specialization, we must complete the type at this point so that
4564 an overloaded "operator &" will be available if required. */
4565 if (code == ADDR_EXPR
4566 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4567 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4568 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4569 || (TREE_CODE (xarg) == OFFSET_REF)))
4570 /* Don't look for a function. */;
4572 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4573 /*overload=*/NULL, complain);
4574 if (!exp && code == ADDR_EXPR)
4576 if (is_overloaded_fn (xarg))
4578 tree fn = get_first_fn (xarg);
4579 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4581 error (DECL_CONSTRUCTOR_P (fn)
4582 ? G_("taking address of constructor %qE")
4583 : G_("taking address of destructor %qE"),
4585 return error_mark_node;
4589 /* A pointer to member-function can be formed only by saying
4591 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4592 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4594 if (TREE_CODE (xarg) != OFFSET_REF
4595 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4597 error ("invalid use of %qE to form a pointer-to-member-function",
4599 if (TREE_CODE (xarg) != OFFSET_REF)
4600 inform (input_location, " a qualified-id is required");
4601 return error_mark_node;
4605 error ("parentheses around %qE cannot be used to form a"
4606 " pointer-to-member-function",
4608 PTRMEM_OK_P (xarg) = 1;
4612 if (TREE_CODE (xarg) == OFFSET_REF)
4614 ptrmem = PTRMEM_OK_P (xarg);
4616 if (!ptrmem && !flag_ms_extensions
4617 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4619 /* A single non-static member, make sure we don't allow a
4620 pointer-to-member. */
4621 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4622 TREE_OPERAND (xarg, 0),
4623 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4624 PTRMEM_OK_P (xarg) = ptrmem;
4628 exp = cp_build_addr_expr_strict (xarg, complain);
4631 if (processing_template_decl && exp != error_mark_node)
4632 exp = build_min_non_dep (code, exp, orig_expr,
4633 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4634 if (TREE_CODE (exp) == ADDR_EXPR)
4635 PTRMEM_OK_P (exp) = ptrmem;
4639 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4640 constants, where a null value is represented by an INTEGER_CST of
4644 cp_truthvalue_conversion (tree expr)
4646 tree type = TREE_TYPE (expr);
4647 if (TYPE_PTRMEM_P (type))
4648 return build_binary_op (EXPR_LOCATION (expr),
4649 NE_EXPR, expr, integer_zero_node, 1);
4651 return c_common_truthvalue_conversion (input_location, expr);
4654 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4657 condition_conversion (tree expr)
4660 if (processing_template_decl)
4662 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4663 tf_warning_or_error, LOOKUP_NORMAL);
4664 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4668 /* Returns the address of T. This function will fold away
4669 ADDR_EXPR of INDIRECT_REF. */
4672 build_address (tree t)
4674 if (error_operand_p (t) || !cxx_mark_addressable (t))
4675 return error_mark_node;
4676 t = build_fold_addr_expr (t);
4677 if (TREE_CODE (t) != ADDR_EXPR)
4682 /* Returns the address of T with type TYPE. */
4685 build_typed_address (tree t, tree type)
4687 if (error_operand_p (t) || !cxx_mark_addressable (t))
4688 return error_mark_node;
4689 t = build_fold_addr_expr_with_type (t, type);
4690 if (TREE_CODE (t) != ADDR_EXPR)
4695 /* Return a NOP_EXPR converting EXPR to TYPE. */
4698 build_nop (tree type, tree expr)
4700 if (type == error_mark_node || error_operand_p (expr))
4702 return build1 (NOP_EXPR, type, expr);
4705 /* Take the address of ARG, whatever that means under C++ semantics.
4706 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4707 and class rvalues as well.
4709 Nothing should call this function directly; instead, callers should use
4710 cp_build_addr_expr or cp_build_addr_expr_strict. */
4713 cp_build_addr_expr_1 (tree arg, bool strict_lvalue, tsubst_flags_t complain)
4718 if (!arg || error_operand_p (arg))
4719 return error_mark_node;
4721 arg = mark_lvalue_use (arg);
4722 argtype = lvalue_type (arg);
4724 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4725 || !IDENTIFIER_OPNAME_P (arg));
4727 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4728 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4730 /* They're trying to take the address of a unique non-static
4731 member function. This is ill-formed (except in MS-land),
4732 but let's try to DTRT.
4733 Note: We only handle unique functions here because we don't
4734 want to complain if there's a static overload; non-unique
4735 cases will be handled by instantiate_type. But we need to
4736 handle this case here to allow casts on the resulting PMF.
4737 We could defer this in non-MS mode, but it's easier to give
4738 a useful error here. */
4740 /* Inside constant member functions, the `this' pointer
4741 contains an extra const qualifier. TYPE_MAIN_VARIANT
4742 is used here to remove this const from the diagnostics
4743 and the created OFFSET_REF. */
4744 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4745 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4748 if (! flag_ms_extensions)
4750 tree name = DECL_NAME (fn);
4751 if (!(complain & tf_error))
4752 return error_mark_node;
4753 else if (current_class_type
4754 && TREE_OPERAND (arg, 0) == current_class_ref)
4755 /* An expression like &memfn. */
4756 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4757 " or parenthesized non-static member function to form"
4758 " a pointer to member function. Say %<&%T::%D%>",
4761 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4762 " function to form a pointer to member function."
4766 arg = build_offset_ref (base, fn, /*address_p=*/true);
4769 /* Uninstantiated types are all functions. Taking the
4770 address of a function is a no-op, so just return the
4772 if (type_unknown_p (arg))
4773 return build1 (ADDR_EXPR, unknown_type_node, arg);
4775 if (TREE_CODE (arg) == OFFSET_REF)
4776 /* We want a pointer to member; bypass all the code for actually taking
4777 the address of something. */
4780 /* Anything not already handled and not a true memory reference
4782 if (TREE_CODE (argtype) != FUNCTION_TYPE
4783 && TREE_CODE (argtype) != METHOD_TYPE)
4785 cp_lvalue_kind kind = lvalue_kind (arg);
4786 if (kind == clk_none)
4788 if (complain & tf_error)
4789 lvalue_error (input_location, lv_addressof);
4790 return error_mark_node;
4792 if (strict_lvalue && (kind & (clk_rvalueref|clk_class)))
4794 if (!(complain & tf_error))
4795 return error_mark_node;
4796 if (kind & clk_class)
4797 /* Make this a permerror because we used to accept it. */
4798 permerror (input_location, "taking address of temporary");
4800 error ("taking address of xvalue (rvalue reference)");
4804 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4806 tree type = build_pointer_type (TREE_TYPE (argtype));
4807 arg = build1 (CONVERT_EXPR, type, arg);
4810 else if (pedantic && DECL_MAIN_P (arg))
4813 /* Apparently a lot of autoconf scripts for C++ packages do this,
4814 so only complain if -pedantic. */
4815 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4816 pedwarn (input_location, OPT_pedantic,
4817 "ISO C++ forbids taking address of function %<::main%>");
4818 else if (flag_pedantic_errors)
4819 return error_mark_node;
4822 /* Let &* cancel out to simplify resulting code. */
4823 if (TREE_CODE (arg) == INDIRECT_REF)
4825 /* We don't need to have `current_class_ptr' wrapped in a
4826 NON_LVALUE_EXPR node. */
4827 if (arg == current_class_ref)
4828 return current_class_ptr;
4830 arg = TREE_OPERAND (arg, 0);
4831 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4833 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4834 arg = build1 (CONVERT_EXPR, type, arg);
4837 /* Don't let this be an lvalue. */
4842 /* ??? Cope with user tricks that amount to offsetof. */
4843 if (TREE_CODE (argtype) != FUNCTION_TYPE
4844 && TREE_CODE (argtype) != METHOD_TYPE
4845 && argtype != unknown_type_node
4846 && (val = get_base_address (arg))
4847 && COMPLETE_TYPE_P (TREE_TYPE (val))
4848 && TREE_CODE (val) == INDIRECT_REF
4849 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
4851 tree type = build_pointer_type (argtype);
4852 tree op0 = fold_convert (type, TREE_OPERAND (val, 0));
4853 tree op1 = fold_offsetof (arg, val);
4854 return fold_build_pointer_plus (op0, op1);
4857 /* Handle complex lvalues (when permitted)
4858 by reduction to simpler cases. */
4859 val = unary_complex_lvalue (ADDR_EXPR, arg);
4863 switch (TREE_CODE (arg))
4867 case FIX_TRUNC_EXPR:
4868 /* Even if we're not being pedantic, we cannot allow this
4869 extension when we're instantiating in a SFINAE
4871 if (! lvalue_p (arg) && complain == tf_none)
4873 if (complain & tf_error)
4874 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4876 return error_mark_node;
4881 arg = BASELINK_FUNCTIONS (arg);
4885 arg = OVL_CURRENT (arg);
4890 /* Turn a reference to a non-static data member into a
4891 pointer-to-member. */
4896 gcc_assert (PTRMEM_OK_P (arg));
4898 t = TREE_OPERAND (arg, 1);
4899 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4901 if (complain & tf_error)
4902 error ("cannot create pointer to reference member %qD", t);
4903 return error_mark_node;
4906 type = build_ptrmem_type (context_for_name_lookup (t),
4908 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4916 if (argtype != error_mark_node)
4917 argtype = build_pointer_type (argtype);
4919 /* In a template, we are processing a non-dependent expression
4920 so we can just form an ADDR_EXPR with the correct type. */
4921 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
4923 val = build_address (arg);
4924 if (TREE_CODE (arg) == OFFSET_REF)
4925 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4927 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
4929 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4931 /* We can only get here with a single static member
4933 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4934 && DECL_STATIC_FUNCTION_P (fn));
4936 val = build_address (fn);
4937 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4938 /* Do not lose object's side effects. */
4939 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4940 TREE_OPERAND (arg, 0), val);
4942 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4944 if (complain & tf_error)
4945 error ("attempt to take address of bit-field structure member %qD",
4946 TREE_OPERAND (arg, 1));
4947 return error_mark_node;
4951 tree object = TREE_OPERAND (arg, 0);
4952 tree field = TREE_OPERAND (arg, 1);
4953 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4954 (TREE_TYPE (object), decl_type_context (field)));
4955 val = build_address (arg);
4958 if (TREE_CODE (argtype) == POINTER_TYPE
4959 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4961 build_ptrmemfunc_type (argtype);
4962 val = build_ptrmemfunc (argtype, val, 0,
4964 tf_warning_or_error);
4970 /* Take the address of ARG if it has one, even if it's an rvalue. */
4973 cp_build_addr_expr (tree arg, tsubst_flags_t complain)
4975 return cp_build_addr_expr_1 (arg, 0, complain);
4978 /* Take the address of ARG, but only if it's an lvalue. */
4981 cp_build_addr_expr_strict (tree arg, tsubst_flags_t complain)
4983 return cp_build_addr_expr_1 (arg, 1, complain);
4986 /* C++: Must handle pointers to members.
4988 Perhaps type instantiation should be extended to handle conversion
4989 from aggregates to types we don't yet know we want? (Or are those
4990 cases typically errors which should be reported?)
4992 NOCONVERT nonzero suppresses the default promotions
4993 (such as from short to int). */
4996 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
4997 tsubst_flags_t complain)
4999 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5002 const char *errstring = NULL;
5004 const char *invalid_op_diag;
5006 if (!arg || error_operand_p (arg))
5007 return error_mark_node;
5009 if ((invalid_op_diag
5010 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
5015 error (invalid_op_diag);
5016 return error_mark_node;
5021 case UNARY_PLUS_EXPR:
5024 int flags = WANT_ARITH | WANT_ENUM;
5025 /* Unary plus (but not unary minus) is allowed on pointers. */
5026 if (code == UNARY_PLUS_EXPR)
5027 flags |= WANT_POINTER;
5028 arg = build_expr_type_conversion (flags, arg, true);
5030 errstring = (code == NEGATE_EXPR
5031 ? _("wrong type argument to unary minus")
5032 : _("wrong type argument to unary plus"));
5035 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5036 arg = perform_integral_promotions (arg);
5038 /* Make sure the result is not an lvalue: a unary plus or minus
5039 expression is always a rvalue. */
5046 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5050 arg = default_conversion (arg);
5052 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
5053 | WANT_VECTOR_OR_COMPLEX,
5055 errstring = _("wrong type argument to bit-complement");
5056 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5057 arg = perform_integral_promotions (arg);
5061 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5062 errstring = _("wrong type argument to abs");
5063 else if (!noconvert)
5064 arg = default_conversion (arg);
5068 /* Conjugating a real value is a no-op, but allow it anyway. */
5069 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5070 errstring = _("wrong type argument to conjugation");
5071 else if (!noconvert)
5072 arg = default_conversion (arg);
5075 case TRUTH_NOT_EXPR:
5076 arg = perform_implicit_conversion (boolean_type_node, arg,
5078 val = invert_truthvalue_loc (input_location, arg);
5079 if (arg != error_mark_node)
5081 errstring = _("in argument to unary !");
5089 arg = build_real_imag_expr (input_location, code, arg);
5090 if (arg == error_mark_node)
5093 return fold_if_not_in_template (arg);
5095 case PREINCREMENT_EXPR:
5096 case POSTINCREMENT_EXPR:
5097 case PREDECREMENT_EXPR:
5098 case POSTDECREMENT_EXPR:
5099 /* Handle complex lvalues (when permitted)
5100 by reduction to simpler cases. */
5102 val = unary_complex_lvalue (code, arg);
5106 arg = mark_lvalue_use (arg);
5108 /* Increment or decrement the real part of the value,
5109 and don't change the imaginary part. */
5110 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5114 arg = stabilize_reference (arg);
5115 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
5116 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
5117 real = cp_build_unary_op (code, real, 1, complain);
5118 if (real == error_mark_node || imag == error_mark_node)
5119 return error_mark_node;
5120 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
5124 /* Report invalid types. */
5126 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
5129 if (code == PREINCREMENT_EXPR)
5130 errstring = _("no pre-increment operator for type");
5131 else if (code == POSTINCREMENT_EXPR)
5132 errstring = _("no post-increment operator for type");
5133 else if (code == PREDECREMENT_EXPR)
5134 errstring = _("no pre-decrement operator for type");
5136 errstring = _("no post-decrement operator for type");
5139 else if (arg == error_mark_node)
5140 return error_mark_node;
5142 /* Report something read-only. */
5144 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
5145 || TREE_READONLY (arg))
5147 if (complain & tf_error)
5148 cxx_readonly_error (arg, ((code == PREINCREMENT_EXPR
5149 || code == POSTINCREMENT_EXPR)
5150 ? lv_increment : lv_decrement));
5152 return error_mark_node;
5157 tree declared_type = unlowered_expr_type (arg);
5159 argtype = TREE_TYPE (arg);
5161 /* ARM $5.2.5 last annotation says this should be forbidden. */
5162 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
5164 if (complain & tf_error)
5165 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
5166 ? G_("ISO C++ forbids incrementing an enum")
5167 : G_("ISO C++ forbids decrementing an enum"));
5169 return error_mark_node;
5172 /* Compute the increment. */
5174 if (TREE_CODE (argtype) == POINTER_TYPE)
5176 tree type = complete_type (TREE_TYPE (argtype));
5178 if (!COMPLETE_OR_VOID_TYPE_P (type))
5180 if (complain & tf_error)
5181 error (((code == PREINCREMENT_EXPR
5182 || code == POSTINCREMENT_EXPR))
5183 ? G_("cannot increment a pointer to incomplete type %qT")
5184 : G_("cannot decrement a pointer to incomplete type %qT"),
5185 TREE_TYPE (argtype));
5187 return error_mark_node;
5189 else if ((pedantic || warn_pointer_arith)
5190 && !TYPE_PTROB_P (argtype))
5192 if (complain & tf_error)
5193 permerror (input_location, (code == PREINCREMENT_EXPR
5194 || code == POSTINCREMENT_EXPR)
5195 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5196 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5199 return error_mark_node;
5202 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
5205 inc = integer_one_node;
5207 inc = cp_convert (argtype, inc);
5209 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5210 need to ask Objective-C to build the increment or decrement
5211 expression for it. */
5212 if (objc_is_property_ref (arg))
5213 return objc_build_incr_expr_for_property_ref (input_location, code,
5216 /* Complain about anything else that is not a true lvalue. */
5217 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
5218 || code == POSTINCREMENT_EXPR)
5219 ? lv_increment : lv_decrement),
5221 return error_mark_node;
5223 /* Forbid using -- on `bool'. */
5224 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
5226 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
5228 if (complain & tf_error)
5229 error ("invalid use of Boolean expression as operand "
5230 "to %<operator--%>");
5231 return error_mark_node;
5233 val = boolean_increment (code, arg);
5235 else if (code == POSTINCREMENT_EXPR || code == POSTDECREMENT_EXPR)
5236 /* An rvalue has no cv-qualifiers. */
5237 val = build2 (code, cv_unqualified (TREE_TYPE (arg)), arg, inc);
5239 val = build2 (code, TREE_TYPE (arg), arg, inc);
5241 TREE_SIDE_EFFECTS (val) = 1;
5246 /* Note that this operation never does default_conversion
5247 regardless of NOCONVERT. */
5248 return cp_build_addr_expr (arg, complain);
5257 argtype = TREE_TYPE (arg);
5258 return fold_if_not_in_template (build1 (code, argtype, arg));
5261 if (complain & tf_error)
5262 error ("%s", errstring);
5263 return error_mark_node;
5266 /* Hook for the c-common bits that build a unary op. */
5268 build_unary_op (location_t location ATTRIBUTE_UNUSED,
5269 enum tree_code code, tree xarg, int noconvert)
5271 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5274 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5275 for certain kinds of expressions which are not really lvalues
5276 but which we can accept as lvalues.
5278 If ARG is not a kind of expression we can handle, return
5282 unary_complex_lvalue (enum tree_code code, tree arg)
5284 /* Inside a template, making these kinds of adjustments is
5285 pointless; we are only concerned with the type of the
5287 if (processing_template_decl)
5290 /* Handle (a, b) used as an "lvalue". */
5291 if (TREE_CODE (arg) == COMPOUND_EXPR)
5293 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5294 tf_warning_or_error);
5295 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5296 TREE_OPERAND (arg, 0), real_result);
5299 /* Handle (a ? b : c) used as an "lvalue". */
5300 if (TREE_CODE (arg) == COND_EXPR
5301 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5302 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5304 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5305 if (TREE_CODE (arg) == MODIFY_EXPR
5306 || TREE_CODE (arg) == PREINCREMENT_EXPR
5307 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5309 tree lvalue = TREE_OPERAND (arg, 0);
5310 if (TREE_SIDE_EFFECTS (lvalue))
5312 lvalue = stabilize_reference (lvalue);
5313 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5314 lvalue, TREE_OPERAND (arg, 1));
5316 return unary_complex_lvalue
5317 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5320 if (code != ADDR_EXPR)
5323 /* Handle (a = b) used as an "lvalue" for `&'. */
5324 if (TREE_CODE (arg) == MODIFY_EXPR
5325 || TREE_CODE (arg) == INIT_EXPR)
5327 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5328 tf_warning_or_error);
5329 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5331 TREE_NO_WARNING (arg) = 1;
5335 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5336 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5337 || TREE_CODE (arg) == OFFSET_REF)
5340 /* We permit compiler to make function calls returning
5341 objects of aggregate type look like lvalues. */
5345 if (TREE_CODE (targ) == SAVE_EXPR)
5346 targ = TREE_OPERAND (targ, 0);
5348 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5350 if (TREE_CODE (arg) == SAVE_EXPR)
5353 targ = build_cplus_new (TREE_TYPE (arg), arg, tf_warning_or_error);
5354 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5357 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5358 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5359 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5362 /* Don't let anything else be handled specially. */
5366 /* Mark EXP saying that we need to be able to take the
5367 address of it; it should not be allocated in a register.
5368 Value is true if successful.
5370 C++: we do not allow `current_class_ptr' to be addressable. */
5373 cxx_mark_addressable (tree exp)
5378 switch (TREE_CODE (x))
5385 x = TREE_OPERAND (x, 0);
5389 if (x == current_class_ptr)
5391 error ("cannot take the address of %<this%>, which is an rvalue expression");
5392 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5398 /* Caller should not be trying to mark initialized
5399 constant fields addressable. */
5400 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5401 || DECL_IN_AGGR_P (x) == 0
5403 || DECL_EXTERNAL (x));
5407 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5408 && !DECL_ARTIFICIAL (x))
5410 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5413 ("address of explicit register variable %qD requested", x);
5416 else if (extra_warnings)
5418 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5420 TREE_ADDRESSABLE (x) = 1;
5425 TREE_ADDRESSABLE (x) = 1;
5429 TREE_ADDRESSABLE (x) = 1;
5433 TREE_ADDRESSABLE (x) = 1;
5434 cxx_mark_addressable (TREE_OPERAND (x, 0));
5442 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5445 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5446 tsubst_flags_t complain)
5448 tree orig_ifexp = ifexp;
5449 tree orig_op1 = op1;
5450 tree orig_op2 = op2;
5453 if (processing_template_decl)
5455 /* The standard says that the expression is type-dependent if
5456 IFEXP is type-dependent, even though the eventual type of the
5457 expression doesn't dependent on IFEXP. */
5458 if (type_dependent_expression_p (ifexp)
5459 /* As a GNU extension, the middle operand may be omitted. */
5460 || (op1 && type_dependent_expression_p (op1))
5461 || type_dependent_expression_p (op2))
5462 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5463 ifexp = build_non_dependent_expr (ifexp);
5465 op1 = build_non_dependent_expr (op1);
5466 op2 = build_non_dependent_expr (op2);
5469 expr = build_conditional_expr (ifexp, op1, op2, complain);
5470 if (processing_template_decl && expr != error_mark_node)
5471 return build_min_non_dep (COND_EXPR, expr,
5472 orig_ifexp, orig_op1, orig_op2);
5476 /* Given a list of expressions, return a compound expression
5477 that performs them all and returns the value of the last of them. */
5480 build_x_compound_expr_from_list (tree list, expr_list_kind exp,
5481 tsubst_flags_t complain)
5483 tree expr = TREE_VALUE (list);
5485 if (BRACE_ENCLOSED_INITIALIZER_P (expr)
5486 && !CONSTRUCTOR_IS_DIRECT_INIT (expr))
5488 if (complain & tf_error)
5489 pedwarn (EXPR_LOC_OR_HERE (expr), 0, "list-initializer for "
5490 "non-class type must not be parenthesized");
5492 return error_mark_node;
5495 if (TREE_CHAIN (list))
5497 if (complain & tf_error)
5501 permerror (input_location, "expression list treated as compound "
5502 "expression in initializer");
5505 permerror (input_location, "expression list treated as compound "
5506 "expression in mem-initializer");
5509 permerror (input_location, "expression list treated as compound "
5510 "expression in functional cast");
5516 return error_mark_node;
5518 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5519 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5526 /* Like build_x_compound_expr_from_list, but using a VEC. */
5529 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5531 if (VEC_empty (tree, vec))
5533 else if (VEC_length (tree, vec) == 1)
5534 return VEC_index (tree, vec, 0);
5542 permerror (input_location,
5543 "%s expression list treated as compound expression",
5546 expr = VEC_index (tree, vec, 0);
5547 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5548 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5554 /* Handle overloading of the ',' operator when needed. */
5557 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5560 tree orig_op1 = op1;
5561 tree orig_op2 = op2;
5563 if (processing_template_decl)
5565 if (type_dependent_expression_p (op1)
5566 || type_dependent_expression_p (op2))
5567 return build_min_nt (COMPOUND_EXPR, op1, op2);
5568 op1 = build_non_dependent_expr (op1);
5569 op2 = build_non_dependent_expr (op2);
5572 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5573 /*overload=*/NULL, complain);
5575 result = cp_build_compound_expr (op1, op2, complain);
5577 if (processing_template_decl && result != error_mark_node)
5578 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5583 /* Like cp_build_compound_expr, but for the c-common bits. */
5586 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5588 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5591 /* Build a compound expression. */
5594 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5596 lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
5598 if (lhs == error_mark_node || rhs == error_mark_node)
5599 return error_mark_node;
5601 if (TREE_CODE (rhs) == TARGET_EXPR)
5603 /* If the rhs is a TARGET_EXPR, then build the compound
5604 expression inside the target_expr's initializer. This
5605 helps the compiler to eliminate unnecessary temporaries. */
5606 tree init = TREE_OPERAND (rhs, 1);
5608 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5609 TREE_OPERAND (rhs, 1) = init;
5614 if (type_unknown_p (rhs))
5616 error ("no context to resolve type of %qE", rhs);
5617 return error_mark_node;
5620 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5623 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5624 casts away constness. CAST gives the type of cast. Returns true
5625 if the cast is ill-formed, false if it is well-formed.
5627 ??? This function warns for casting away any qualifier not just
5628 const. We would like to specify exactly what qualifiers are casted
5633 check_for_casting_away_constness (tree src_type, tree dest_type,
5634 enum tree_code cast, tsubst_flags_t complain)
5636 /* C-style casts are allowed to cast away constness. With
5637 WARN_CAST_QUAL, we still want to issue a warning. */
5638 if (cast == CAST_EXPR && !warn_cast_qual)
5641 if (!casts_away_constness (src_type, dest_type))
5647 if (complain & tf_warning)
5648 warning (OPT_Wcast_qual,
5649 "cast from type %qT to type %qT casts away qualifiers",
5650 src_type, dest_type);
5653 case STATIC_CAST_EXPR:
5654 if (complain & tf_error)
5655 error ("static_cast from type %qT to type %qT casts away qualifiers",
5656 src_type, dest_type);
5659 case REINTERPRET_CAST_EXPR:
5660 if (complain & tf_error)
5661 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5662 src_type, dest_type);
5670 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5671 (another pointer-to-member type in the same hierarchy) and return
5672 the converted expression. If ALLOW_INVERSE_P is permitted, a
5673 pointer-to-derived may be converted to pointer-to-base; otherwise,
5674 only the other direction is permitted. If C_CAST_P is true, this
5675 conversion is taking place as part of a C-style cast. */
5678 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5679 bool c_cast_p, tsubst_flags_t complain)
5681 if (TYPE_PTRMEM_P (type))
5685 if (TREE_CODE (expr) == PTRMEM_CST)
5686 expr = cplus_expand_constant (expr);
5687 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5688 TYPE_PTRMEM_CLASS_TYPE (type),
5690 c_cast_p, complain);
5691 if (delta == error_mark_node)
5692 return error_mark_node;
5694 if (!integer_zerop (delta))
5696 tree cond, op1, op2;
5698 cond = cp_build_binary_op (input_location,
5701 build_int_cst (TREE_TYPE (expr), -1),
5702 tf_warning_or_error);
5703 op1 = build_nop (ptrdiff_type_node, expr);
5704 op2 = cp_build_binary_op (input_location,
5705 PLUS_EXPR, op1, delta,
5706 tf_warning_or_error);
5708 expr = fold_build3_loc (input_location,
5709 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5713 return build_nop (type, expr);
5716 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5717 allow_inverse_p, c_cast_p, complain);
5720 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5721 this static_cast is being attempted as one of the possible casts
5722 allowed by a C-style cast. (In that case, accessibility of base
5723 classes is not considered, and it is OK to cast away
5724 constness.) Return the result of the cast. *VALID_P is set to
5725 indicate whether or not the cast was valid. */
5728 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5729 bool *valid_p, tsubst_flags_t complain)
5734 /* Assume the cast is valid. */
5737 intype = TREE_TYPE (expr);
5739 /* Save casted types in the function's used types hash table. */
5740 used_types_insert (type);
5742 /* [expr.static.cast]
5744 An lvalue of type "cv1 B", where B is a class type, can be cast
5745 to type "reference to cv2 D", where D is a class derived (clause
5746 _class.derived_) from B, if a valid standard conversion from
5747 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5748 same cv-qualification as, or greater cv-qualification than, cv1,
5749 and B is not a virtual base class of D. */
5750 /* We check this case before checking the validity of "TYPE t =
5751 EXPR;" below because for this case:
5754 struct D : public B { D(const B&); };
5756 void f() { static_cast<const D&>(b); }
5758 we want to avoid constructing a new D. The standard is not
5759 completely clear about this issue, but our interpretation is
5760 consistent with other compilers. */
5761 if (TREE_CODE (type) == REFERENCE_TYPE
5762 && CLASS_TYPE_P (TREE_TYPE (type))
5763 && CLASS_TYPE_P (intype)
5764 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5765 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5766 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5767 build_pointer_type (TYPE_MAIN_VARIANT
5768 (TREE_TYPE (type))))
5770 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5774 /* There is a standard conversion from "D*" to "B*" even if "B"
5775 is ambiguous or inaccessible. If this is really a
5776 static_cast, then we check both for inaccessibility and
5777 ambiguity. However, if this is a static_cast being performed
5778 because the user wrote a C-style cast, then accessibility is
5780 base = lookup_base (TREE_TYPE (type), intype,
5781 c_cast_p ? ba_unique : ba_check,
5784 /* Convert from "B*" to "D*". This function will check that "B"
5785 is not a virtual base of "D". */
5786 expr = build_base_path (MINUS_EXPR, build_address (expr),
5787 base, /*nonnull=*/false, complain);
5788 /* Convert the pointer to a reference -- but then remember that
5789 there are no expressions with reference type in C++.
5791 We call rvalue so that there's an actual tree code
5792 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5793 is a variable with the same type, the conversion would get folded
5794 away, leaving just the variable and causing lvalue_kind to give
5795 the wrong answer. */
5796 return convert_from_reference (rvalue (cp_fold_convert (type, expr)));
5799 /* "A glvalue of type cv1 T1 can be cast to type rvalue reference to
5800 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5801 if (TREE_CODE (type) == REFERENCE_TYPE
5802 && TYPE_REF_IS_RVALUE (type)
5803 && lvalue_or_rvalue_with_address_p (expr)
5804 && reference_related_p (TREE_TYPE (type), intype)
5805 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5807 expr = build_typed_address (expr, type);
5808 return convert_from_reference (expr);
5811 /* Resolve overloaded address here rather than once in
5812 implicit_conversion and again in the inverse code below. */
5813 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5815 expr = instantiate_type (type, expr, complain);
5816 intype = TREE_TYPE (expr);
5819 /* [expr.static.cast]
5821 An expression e can be explicitly converted to a type T using a
5822 static_cast of the form static_cast<T>(e) if the declaration T
5823 t(e);" is well-formed, for some invented temporary variable
5825 result = perform_direct_initialization_if_possible (type, expr,
5826 c_cast_p, complain);
5829 result = convert_from_reference (result);
5831 /* [expr.static.cast]
5833 If T is a reference type, the result is an lvalue; otherwise,
5834 the result is an rvalue. */
5835 if (TREE_CODE (type) != REFERENCE_TYPE)
5836 result = rvalue (result);
5840 /* [expr.static.cast]
5842 Any expression can be explicitly converted to type cv void. */
5843 if (TREE_CODE (type) == VOID_TYPE)
5844 return convert_to_void (expr, ICV_CAST, complain);
5846 /* [expr.static.cast]
5848 The inverse of any standard conversion sequence (clause _conv_),
5849 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5850 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5851 (_conv.bool_) conversions, can be performed explicitly using
5852 static_cast subject to the restriction that the explicit
5853 conversion does not cast away constness (_expr.const.cast_), and
5854 the following additional rules for specific cases: */
5855 /* For reference, the conversions not excluded are: integral
5856 promotions, floating point promotion, integral conversions,
5857 floating point conversions, floating-integral conversions,
5858 pointer conversions, and pointer to member conversions. */
5861 A value of integral _or enumeration_ type can be explicitly
5862 converted to an enumeration type. */
5863 /* The effect of all that is that any conversion between any two
5864 types which are integral, floating, or enumeration types can be
5866 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5867 || SCALAR_FLOAT_TYPE_P (type))
5868 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5869 || SCALAR_FLOAT_TYPE_P (intype)))
5870 return ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5872 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5873 && CLASS_TYPE_P (TREE_TYPE (type))
5874 && CLASS_TYPE_P (TREE_TYPE (intype))
5875 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5876 (TREE_TYPE (intype))),
5877 build_pointer_type (TYPE_MAIN_VARIANT
5878 (TREE_TYPE (type)))))
5883 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5885 return error_mark_node;
5886 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5887 c_cast_p ? ba_unique : ba_check,
5889 expr = build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false,
5891 return cp_fold_convert(type, expr);
5894 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5895 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5902 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5903 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5905 if (TYPE_PTRMEM_P (type))
5907 t1 = (build_ptrmem_type
5909 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5910 t2 = (build_ptrmem_type
5912 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5919 if (can_convert (t1, t2) || can_convert (t2, t1))
5922 && check_for_casting_away_constness (intype, type,
5925 return error_mark_node;
5926 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5927 c_cast_p, complain);
5931 /* [expr.static.cast]
5933 An rvalue of type "pointer to cv void" can be explicitly
5934 converted to a pointer to object type. A value of type pointer
5935 to object converted to "pointer to cv void" and back to the
5936 original pointer type will have its original value. */
5937 if (TREE_CODE (intype) == POINTER_TYPE
5938 && VOID_TYPE_P (TREE_TYPE (intype))
5939 && TYPE_PTROB_P (type))
5942 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5944 return error_mark_node;
5945 return build_nop (type, expr);
5949 return error_mark_node;
5952 /* Return an expression representing static_cast<TYPE>(EXPR). */
5955 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5960 if (type == error_mark_node || expr == error_mark_node)
5961 return error_mark_node;
5963 if (processing_template_decl)
5965 expr = build_min (STATIC_CAST_EXPR, type, expr);
5966 /* We don't know if it will or will not have side effects. */
5967 TREE_SIDE_EFFECTS (expr) = 1;
5968 return convert_from_reference (expr);
5971 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5972 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5973 if (TREE_CODE (type) != REFERENCE_TYPE
5974 && TREE_CODE (expr) == NOP_EXPR
5975 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5976 expr = TREE_OPERAND (expr, 0);
5978 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
5983 if (complain & tf_error)
5984 error ("invalid static_cast from type %qT to type %qT",
5985 TREE_TYPE (expr), type);
5986 return error_mark_node;
5989 /* EXPR is an expression with member function or pointer-to-member
5990 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5991 not permitted by ISO C++, but we accept it in some modes. If we
5992 are not in one of those modes, issue a diagnostic. Return the
5993 converted expression. */
5996 convert_member_func_to_ptr (tree type, tree expr)
6001 intype = TREE_TYPE (expr);
6002 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
6003 || TREE_CODE (intype) == METHOD_TYPE);
6005 if (pedantic || warn_pmf2ptr)
6006 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
6007 "converting from %qT to %qT", intype, type);
6009 if (TREE_CODE (intype) == METHOD_TYPE)
6010 expr = build_addr_func (expr);
6011 else if (TREE_CODE (expr) == PTRMEM_CST)
6012 expr = build_address (PTRMEM_CST_MEMBER (expr));
6015 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
6016 decl = build_address (decl);
6017 expr = get_member_function_from_ptrfunc (&decl, expr);
6020 return build_nop (type, expr);
6023 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6024 If C_CAST_P is true, this reinterpret cast is being done as part of
6025 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6026 indicate whether or not reinterpret_cast was valid. */
6029 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
6030 bool *valid_p, tsubst_flags_t complain)
6034 /* Assume the cast is invalid. */
6038 if (type == error_mark_node || error_operand_p (expr))
6039 return error_mark_node;
6041 intype = TREE_TYPE (expr);
6043 /* Save casted types in the function's used types hash table. */
6044 used_types_insert (type);
6046 /* [expr.reinterpret.cast]
6047 An lvalue expression of type T1 can be cast to the type
6048 "reference to T2" if an expression of type "pointer to T1" can be
6049 explicitly converted to the type "pointer to T2" using a
6050 reinterpret_cast. */
6051 if (TREE_CODE (type) == REFERENCE_TYPE)
6053 if (! real_lvalue_p (expr))
6055 if (complain & tf_error)
6056 error ("invalid cast of an rvalue expression of type "
6059 return error_mark_node;
6062 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6063 "B" are related class types; the reinterpret_cast does not
6064 adjust the pointer. */
6065 if (TYPE_PTR_P (intype)
6066 && (complain & tf_warning)
6067 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6068 COMPARE_BASE | COMPARE_DERIVED)))
6069 warning (0, "casting %qT to %qT does not dereference pointer",
6072 expr = cp_build_addr_expr (expr, complain);
6074 if (warn_strict_aliasing > 2)
6075 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6077 if (expr != error_mark_node)
6078 expr = build_reinterpret_cast_1
6079 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6081 if (expr != error_mark_node)
6082 /* cp_build_indirect_ref isn't right for rvalue refs. */
6083 expr = convert_from_reference (fold_convert (type, expr));
6087 /* As a G++ extension, we consider conversions from member
6088 functions, and pointers to member functions to
6089 pointer-to-function and pointer-to-void types. If
6090 -Wno-pmf-conversions has not been specified,
6091 convert_member_func_to_ptr will issue an error message. */
6092 if ((TYPE_PTRMEMFUNC_P (intype)
6093 || TREE_CODE (intype) == METHOD_TYPE)
6094 && TYPE_PTR_P (type)
6095 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6096 || VOID_TYPE_P (TREE_TYPE (type))))
6097 return convert_member_func_to_ptr (type, expr);
6099 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6100 array-to-pointer, and function-to-pointer conversions are
6102 expr = decay_conversion (expr);
6104 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6105 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6106 if (TREE_CODE (expr) == NOP_EXPR
6107 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6108 expr = TREE_OPERAND (expr, 0);
6110 if (error_operand_p (expr))
6111 return error_mark_node;
6113 intype = TREE_TYPE (expr);
6115 /* [expr.reinterpret.cast]
6116 A pointer can be converted to any integral type large enough to
6117 hold it. ... A value of type std::nullptr_t can be converted to
6118 an integral type; the conversion has the same meaning and
6119 validity as a conversion of (void*)0 to the integral type. */
6120 if (CP_INTEGRAL_TYPE_P (type)
6121 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6123 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6125 if (complain & tf_error)
6126 permerror (input_location, "cast from %qT to %qT loses precision",
6129 return error_mark_node;
6131 if (NULLPTR_TYPE_P (intype))
6132 return build_int_cst (type, 0);
6134 /* [expr.reinterpret.cast]
6135 A value of integral or enumeration type can be explicitly
6136 converted to a pointer. */
6137 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6140 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6141 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6142 return fold_if_not_in_template (build_nop (type, expr));
6143 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6144 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6149 && check_for_casting_away_constness (intype, type,
6150 REINTERPRET_CAST_EXPR,
6152 return error_mark_node;
6153 /* Warn about possible alignment problems. */
6154 if (STRICT_ALIGNMENT && warn_cast_align
6155 && (complain & tf_warning)
6156 && !VOID_TYPE_P (type)
6157 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6158 && COMPLETE_TYPE_P (TREE_TYPE (type))
6159 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6160 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6161 warning (OPT_Wcast_align, "cast from %qT to %qT "
6162 "increases required alignment of target type", intype, type);
6164 /* We need to strip nops here, because the front end likes to
6165 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6167 if (warn_strict_aliasing <= 2)
6168 strict_aliasing_warning (intype, type, sexpr);
6170 return fold_if_not_in_template (build_nop (type, expr));
6172 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6173 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6175 if (pedantic && (complain & tf_warning))
6176 /* Only issue a warning, as we have always supported this
6177 where possible, and it is necessary in some cases. DR 195
6178 addresses this issue, but as of 2004/10/26 is still in
6180 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6181 return fold_if_not_in_template (build_nop (type, expr));
6183 else if (TREE_CODE (type) == VECTOR_TYPE)
6184 return fold_if_not_in_template (convert_to_vector (type, expr));
6185 else if (TREE_CODE (intype) == VECTOR_TYPE
6186 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6187 return fold_if_not_in_template (convert_to_integer (type, expr));
6192 if (complain & tf_error)
6193 error ("invalid cast from type %qT to type %qT", intype, type);
6194 return error_mark_node;
6197 return cp_convert (type, expr);
6201 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6203 if (type == error_mark_node || expr == error_mark_node)
6204 return error_mark_node;
6206 if (processing_template_decl)
6208 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6210 if (!TREE_SIDE_EFFECTS (t)
6211 && type_dependent_expression_p (expr))
6212 /* There might turn out to be side effects inside expr. */
6213 TREE_SIDE_EFFECTS (t) = 1;
6214 return convert_from_reference (t);
6217 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6218 /*valid_p=*/NULL, complain);
6221 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6222 return an appropriate expression. Otherwise, return
6223 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6224 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6225 performing a C-style cast, its value upon return will indicate
6226 whether or not the conversion succeeded. */
6229 build_const_cast_1 (tree dst_type, tree expr, tsubst_flags_t complain,
6233 tree reference_type;
6235 /* Callers are responsible for handling error_mark_node as a
6236 destination type. */
6237 gcc_assert (dst_type != error_mark_node);
6238 /* In a template, callers should be building syntactic
6239 representations of casts, not using this machinery. */
6240 gcc_assert (!processing_template_decl);
6242 /* Assume the conversion is invalid. */
6246 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
6248 if (complain & tf_error)
6249 error ("invalid use of const_cast with type %qT, "
6250 "which is not a pointer, "
6251 "reference, nor a pointer-to-data-member type", dst_type);
6252 return error_mark_node;
6255 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
6257 if (complain & tf_error)
6258 error ("invalid use of const_cast with type %qT, which is a pointer "
6259 "or reference to a function type", dst_type);
6260 return error_mark_node;
6263 /* Save casted types in the function's used types hash table. */
6264 used_types_insert (dst_type);
6266 src_type = TREE_TYPE (expr);
6267 /* Expressions do not really have reference types. */
6268 if (TREE_CODE (src_type) == REFERENCE_TYPE)
6269 src_type = TREE_TYPE (src_type);
6271 /* [expr.const.cast]
6273 For two object types T1 and T2, if a pointer to T1 can be explicitly
6274 converted to the type "pointer to T2" using a const_cast, then the
6275 following conversions can also be made:
6277 -- an lvalue of type T1 can be explicitly converted to an lvalue of
6278 type T2 using the cast const_cast<T2&>;
6280 -- a glvalue of type T1 can be explicitly converted to an xvalue of
6281 type T2 using the cast const_cast<T2&&>; and
6283 -- if T1 is a class type, a prvalue of type T1 can be explicitly
6284 converted to an xvalue of type T2 using the cast const_cast<T2&&>. */
6286 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
6288 reference_type = dst_type;
6289 if (!TYPE_REF_IS_RVALUE (dst_type)
6290 ? real_lvalue_p (expr)
6291 : (CLASS_TYPE_P (TREE_TYPE (dst_type))
6293 : lvalue_or_rvalue_with_address_p (expr)))
6297 if (complain & tf_error)
6298 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6299 src_type, dst_type);
6300 return error_mark_node;
6302 dst_type = build_pointer_type (TREE_TYPE (dst_type));
6303 src_type = build_pointer_type (src_type);
6307 reference_type = NULL_TREE;
6308 /* If the destination type is not a reference type, the
6309 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6310 conversions are performed. */
6311 src_type = type_decays_to (src_type);
6312 if (src_type == error_mark_node)
6313 return error_mark_node;
6316 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
6317 && comp_ptr_ttypes_const (dst_type, src_type))
6322 /* This cast is actually a C-style cast. Issue a warning if
6323 the user is making a potentially unsafe cast. */
6324 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR,
6329 expr = cp_build_addr_expr (expr, complain);
6330 expr = build_nop (reference_type, expr);
6331 return convert_from_reference (expr);
6335 expr = decay_conversion (expr);
6336 /* build_c_cast puts on a NOP_EXPR to make the result not an
6337 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6338 non-lvalue context. */
6339 if (TREE_CODE (expr) == NOP_EXPR
6340 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6341 expr = TREE_OPERAND (expr, 0);
6342 return build_nop (dst_type, expr);
6346 if (complain & tf_error)
6347 error ("invalid const_cast from type %qT to type %qT",
6348 src_type, dst_type);
6349 return error_mark_node;
6353 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
6355 if (type == error_mark_node || error_operand_p (expr))
6356 return error_mark_node;
6358 if (processing_template_decl)
6360 tree t = build_min (CONST_CAST_EXPR, type, expr);
6362 if (!TREE_SIDE_EFFECTS (t)
6363 && type_dependent_expression_p (expr))
6364 /* There might turn out to be side effects inside expr. */
6365 TREE_SIDE_EFFECTS (t) = 1;
6366 return convert_from_reference (t);
6369 return build_const_cast_1 (type, expr, complain,
6373 /* Like cp_build_c_cast, but for the c-common bits. */
6376 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
6378 return cp_build_c_cast (type, expr, tf_warning_or_error);
6381 /* Build an expression representing an explicit C-style cast to type
6382 TYPE of expression EXPR. */
6385 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
6391 if (type == error_mark_node || error_operand_p (expr))
6392 return error_mark_node;
6394 if (processing_template_decl)
6396 tree t = build_min (CAST_EXPR, type,
6397 tree_cons (NULL_TREE, value, NULL_TREE));
6398 /* We don't know if it will or will not have side effects. */
6399 TREE_SIDE_EFFECTS (t) = 1;
6400 return convert_from_reference (t);
6403 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6404 'Class') should always be retained, because this information aids
6405 in method lookup. */
6406 if (objc_is_object_ptr (type)
6407 && objc_is_object_ptr (TREE_TYPE (expr)))
6408 return build_nop (type, expr);
6410 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6411 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6412 if (TREE_CODE (type) != REFERENCE_TYPE
6413 && TREE_CODE (value) == NOP_EXPR
6414 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6415 value = TREE_OPERAND (value, 0);
6417 if (TREE_CODE (type) == ARRAY_TYPE)
6419 /* Allow casting from T1* to T2[] because Cfront allows it.
6420 NIHCL uses it. It is not valid ISO C++ however. */
6421 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6423 if (complain & tf_error)
6424 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6426 return error_mark_node;
6427 type = build_pointer_type (TREE_TYPE (type));
6431 if (complain & tf_error)
6432 error ("ISO C++ forbids casting to an array type %qT", type);
6433 return error_mark_node;
6437 if (TREE_CODE (type) == FUNCTION_TYPE
6438 || TREE_CODE (type) == METHOD_TYPE)
6440 if (complain & tf_error)
6441 error ("invalid cast to function type %qT", type);
6442 return error_mark_node;
6445 if (TREE_CODE (type) == POINTER_TYPE
6446 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
6447 /* Casting to an integer of smaller size is an error detected elsewhere. */
6448 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
6449 /* Don't warn about converting any constant. */
6450 && !TREE_CONSTANT (value))
6451 warning_at (input_location, OPT_Wint_to_pointer_cast,
6452 "cast to pointer from integer of different size");
6454 /* A C-style cast can be a const_cast. */
6455 result = build_const_cast_1 (type, value, complain & tf_warning,
6460 /* Or a static cast. */
6461 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6462 &valid_p, complain);
6463 /* Or a reinterpret_cast. */
6465 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6466 &valid_p, complain);
6467 /* The static_cast or reinterpret_cast may be followed by a
6470 /* A valid cast may result in errors if, for example, a
6471 conversion to am ambiguous base class is required. */
6472 && !error_operand_p (result))
6476 /* Non-class rvalues always have cv-unqualified type. */
6477 if (!CLASS_TYPE_P (type))
6478 type = TYPE_MAIN_VARIANT (type);
6479 result_type = TREE_TYPE (result);
6480 if (!CLASS_TYPE_P (result_type) && TREE_CODE (type) != REFERENCE_TYPE)
6481 result_type = TYPE_MAIN_VARIANT (result_type);
6482 /* If the type of RESULT does not match TYPE, perform a
6483 const_cast to make it match. If the static_cast or
6484 reinterpret_cast succeeded, we will differ by at most
6485 cv-qualification, so the follow-on const_cast is guaranteed
6487 if (!same_type_p (non_reference (type), non_reference (result_type)))
6489 result = build_const_cast_1 (type, result, false, &valid_p);
6490 gcc_assert (valid_p);
6495 return error_mark_node;
6498 /* For use from the C common bits. */
6500 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6501 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6502 enum tree_code modifycode,
6503 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6504 tree rhs_origtype ATTRIBUTE_UNUSED)
6506 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6509 /* Build an assignment expression of lvalue LHS from value RHS.
6510 MODIFYCODE is the code for a binary operator that we use
6511 to combine the old value of LHS with RHS to get the new value.
6512 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6514 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6517 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6518 tsubst_flags_t complain)
6522 tree lhstype = TREE_TYPE (lhs);
6523 tree olhstype = lhstype;
6524 bool plain_assign = (modifycode == NOP_EXPR);
6526 /* Avoid duplicate error messages from operands that had errors. */
6527 if (error_operand_p (lhs) || error_operand_p (rhs))
6528 return error_mark_node;
6530 /* Handle control structure constructs used as "lvalues". */
6531 switch (TREE_CODE (lhs))
6533 /* Handle --foo = 5; as these are valid constructs in C++. */
6534 case PREDECREMENT_EXPR:
6535 case PREINCREMENT_EXPR:
6536 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6537 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6538 stabilize_reference (TREE_OPERAND (lhs, 0)),
6539 TREE_OPERAND (lhs, 1));
6540 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6541 modifycode, rhs, complain);
6542 if (newrhs == error_mark_node)
6543 return error_mark_node;
6544 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6546 /* Handle (a, b) used as an "lvalue". */
6548 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6549 modifycode, rhs, complain);
6550 if (newrhs == error_mark_node)
6551 return error_mark_node;
6552 return build2 (COMPOUND_EXPR, lhstype,
6553 TREE_OPERAND (lhs, 0), newrhs);
6556 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6557 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6558 stabilize_reference (TREE_OPERAND (lhs, 0)),
6559 TREE_OPERAND (lhs, 1));
6560 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6562 if (newrhs == error_mark_node)
6563 return error_mark_node;
6564 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6568 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6569 when neither operand has side-effects. */
6570 if (!lvalue_or_else (lhs, lv_assign, complain))
6571 return error_mark_node;
6573 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6574 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6576 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6577 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6579 TREE_OPERAND (lhs, 0),
6580 TREE_OPERAND (lhs, 1)),
6581 TREE_OPERAND (lhs, 0),
6582 TREE_OPERAND (lhs, 1));
6585 /* Handle (a ? b : c) used as an "lvalue". */
6588 /* Produce (a ? (b = rhs) : (c = rhs))
6589 except that the RHS goes through a save-expr
6590 so the code to compute it is only emitted once. */
6592 tree preeval = NULL_TREE;
6594 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6596 if (complain & tf_error)
6597 error ("void value not ignored as it ought to be");
6598 return error_mark_node;
6601 rhs = stabilize_expr (rhs, &preeval);
6603 /* Check this here to avoid odd errors when trying to convert
6604 a throw to the type of the COND_EXPR. */
6605 if (!lvalue_or_else (lhs, lv_assign, complain))
6606 return error_mark_node;
6608 cond = build_conditional_expr
6609 (TREE_OPERAND (lhs, 0),
6610 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6611 modifycode, rhs, complain),
6612 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6613 modifycode, rhs, complain),
6616 if (cond == error_mark_node)
6618 /* Make sure the code to compute the rhs comes out
6619 before the split. */
6621 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6629 if (modifycode == INIT_EXPR)
6631 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6632 /* Do the default thing. */;
6633 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6635 /* Compound literal. */
6636 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6637 /* Call convert to generate an error; see PR 11063. */
6638 rhs = convert (lhstype, rhs);
6639 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6640 TREE_SIDE_EFFECTS (result) = 1;
6643 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6644 /* Do the default thing. */;
6647 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6648 result = build_special_member_call (lhs, complete_ctor_identifier,
6649 &rhs_vec, lhstype, LOOKUP_NORMAL,
6651 release_tree_vector (rhs_vec);
6652 if (result == NULL_TREE)
6653 return error_mark_node;
6659 lhs = require_complete_type_sfinae (lhs, complain);
6660 if (lhs == error_mark_node)
6661 return error_mark_node;
6663 if (modifycode == NOP_EXPR)
6665 if (c_dialect_objc ())
6667 result = objc_maybe_build_modify_expr (lhs, rhs);
6672 /* `operator=' is not an inheritable operator. */
6673 if (! MAYBE_CLASS_TYPE_P (lhstype))
6674 /* Do the default thing. */;
6677 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6678 lhs, rhs, make_node (NOP_EXPR),
6681 if (result == NULL_TREE)
6682 return error_mark_node;
6689 tree init = NULL_TREE;
6691 /* A binary op has been requested. Combine the old LHS
6692 value with the RHS producing the value we should actually
6693 store into the LHS. */
6694 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6695 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6696 || MAYBE_CLASS_TYPE_P (lhstype)));
6698 /* Preevaluate the RHS to make sure its evaluation is complete
6699 before the lvalue-to-rvalue conversion of the LHS:
6701 [expr.ass] With respect to an indeterminately-sequenced
6702 function call, the operation of a compound assignment is a
6703 single evaluation. [ Note: Therefore, a function call shall
6704 not intervene between the lvalue-to-rvalue conversion and the
6705 side effect associated with any single compound assignment
6706 operator. -- end note ] */
6707 lhs = stabilize_reference (lhs);
6708 if (TREE_SIDE_EFFECTS (rhs))
6709 rhs = mark_rvalue_use (rhs);
6710 rhs = stabilize_expr (rhs, &init);
6711 newrhs = cp_build_binary_op (input_location,
6712 modifycode, lhs, rhs,
6714 if (newrhs == error_mark_node)
6716 if (complain & tf_error)
6717 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6718 TREE_TYPE (lhs), TREE_TYPE (rhs));
6719 return error_mark_node;
6723 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), init, newrhs);
6725 /* Now it looks like a plain assignment. */
6726 modifycode = NOP_EXPR;
6727 if (c_dialect_objc ())
6729 result = objc_maybe_build_modify_expr (lhs, newrhs);
6734 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6735 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6738 /* The left-hand side must be an lvalue. */
6739 if (!lvalue_or_else (lhs, lv_assign, complain))
6740 return error_mark_node;
6742 /* Warn about modifying something that is `const'. Don't warn if
6743 this is initialization. */
6744 if (modifycode != INIT_EXPR
6745 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6746 /* Functions are not modifiable, even though they are
6748 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6749 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6750 /* If it's an aggregate and any field is const, then it is
6751 effectively const. */
6752 || (CLASS_TYPE_P (lhstype)
6753 && C_TYPE_FIELDS_READONLY (lhstype))))
6755 if (complain & tf_error)
6756 cxx_readonly_error (lhs, lv_assign);
6758 return error_mark_node;
6761 /* If storing into a structure or union member, it may have been given a
6762 lowered bitfield type. We need to convert to the declared type first,
6763 so retrieve it now. */
6765 olhstype = unlowered_expr_type (lhs);
6767 /* Convert new value to destination type. */
6769 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6773 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
6775 if (modifycode != INIT_EXPR)
6777 if (complain & tf_error)
6778 error ("assigning to an array from an initializer list");
6779 return error_mark_node;
6781 if (check_array_initializer (lhs, lhstype, newrhs))
6782 return error_mark_node;
6783 newrhs = digest_init (lhstype, newrhs, complain);
6784 if (newrhs == error_mark_node)
6785 return error_mark_node;
6788 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6789 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
6791 if (complain & tf_error)
6792 error ("incompatible types in assignment of %qT to %qT",
6793 TREE_TYPE (rhs), lhstype);
6794 return error_mark_node;
6797 /* Allow array assignment in compiler-generated code. */
6798 else if (!current_function_decl
6799 || !DECL_DEFAULTED_FN (current_function_decl))
6801 /* This routine is used for both initialization and assignment.
6802 Make sure the diagnostic message differentiates the context. */
6803 if (complain & tf_error)
6805 if (modifycode == INIT_EXPR)
6806 error ("array used as initializer");
6808 error ("invalid array assignment");
6810 return error_mark_node;
6813 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6814 ? 1 + (modifycode != INIT_EXPR): 0;
6815 return build_vec_init (lhs, NULL_TREE, newrhs,
6816 /*explicit_value_init_p=*/false,
6817 from_array, complain);
6820 if (modifycode == INIT_EXPR)
6821 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6822 LOOKUP_ONLYCONVERTING. */
6823 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6824 ICR_INIT, NULL_TREE, 0,
6827 newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
6828 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6830 if (!same_type_p (lhstype, olhstype))
6831 newrhs = cp_convert_and_check (lhstype, newrhs);
6833 if (modifycode != INIT_EXPR)
6835 if (TREE_CODE (newrhs) == CALL_EXPR
6836 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6837 newrhs = build_cplus_new (lhstype, newrhs, complain);
6839 /* Can't initialize directly from a TARGET_EXPR, since that would
6840 cause the lhs to be constructed twice, and possibly result in
6841 accidental self-initialization. So we force the TARGET_EXPR to be
6842 expanded without a target. */
6843 if (TREE_CODE (newrhs) == TARGET_EXPR)
6844 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6845 TREE_OPERAND (newrhs, 0));
6848 if (newrhs == error_mark_node)
6849 return error_mark_node;
6851 if (c_dialect_objc () && flag_objc_gc)
6853 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6859 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6860 lhstype, lhs, newrhs);
6862 TREE_SIDE_EFFECTS (result) = 1;
6864 TREE_NO_WARNING (result) = 1;
6870 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6871 tsubst_flags_t complain)
6873 if (processing_template_decl)
6874 return build_min_nt (MODOP_EXPR, lhs,
6875 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6877 if (modifycode != NOP_EXPR)
6879 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6880 make_node (modifycode),
6885 TREE_NO_WARNING (rval) = 1;
6889 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6892 /* Helper function for get_delta_difference which assumes FROM is a base
6893 class of TO. Returns a delta for the conversion of pointer-to-member
6894 of FROM to pointer-to-member of TO. If the conversion is invalid and
6895 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6896 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6897 If C_CAST_P is true, this conversion is taking place as part of a
6901 get_delta_difference_1 (tree from, tree to, bool c_cast_p,
6902 tsubst_flags_t complain)
6906 base_access access = c_cast_p ? ba_unique : ba_check;
6908 /* Note: ba_quiet does not distinguish between access control and
6910 if (!(complain & tf_error))
6913 binfo = lookup_base (to, from, access, &kind);
6915 if (kind == bk_inaccessible || kind == bk_ambig)
6917 if (!(complain & tf_error))
6918 return error_mark_node;
6920 error (" in pointer to member function conversion");
6921 return size_zero_node;
6925 if (kind != bk_via_virtual)
6926 return BINFO_OFFSET (binfo);
6928 /* FROM is a virtual base class of TO. Issue an error or warning
6929 depending on whether or not this is a reinterpret cast. */
6931 if (!(complain & tf_error))
6932 return error_mark_node;
6934 error ("pointer to member conversion via virtual base %qT",
6935 BINFO_TYPE (binfo_from_vbase (binfo)));
6937 return size_zero_node;
6944 /* Get difference in deltas for different pointer to member function
6945 types. If the conversion is invalid and tf_error is not set in
6946 COMPLAIN, returns error_mark_node, otherwise returns an integer
6947 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6948 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6949 conversions as well. If C_CAST_P is true this conversion is taking
6950 place as part of a C-style cast.
6952 Note that the naming of FROM and TO is kind of backwards; the return
6953 value is what we add to a TO in order to get a FROM. They are named
6954 this way because we call this function to find out how to convert from
6955 a pointer to member of FROM to a pointer to member of TO. */
6958 get_delta_difference (tree from, tree to,
6959 bool allow_inverse_p,
6960 bool c_cast_p, tsubst_flags_t complain)
6964 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6965 /* Pointer to member of incomplete class is permitted*/
6966 result = size_zero_node;
6968 result = get_delta_difference_1 (from, to, c_cast_p, complain);
6970 if (result == error_mark_node)
6971 return error_mark_node;
6975 if (!allow_inverse_p)
6977 if (!(complain & tf_error))
6978 return error_mark_node;
6980 error_not_base_type (from, to);
6981 error (" in pointer to member conversion");
6982 result = size_zero_node;
6986 result = get_delta_difference_1 (to, from, c_cast_p, complain);
6988 if (result == error_mark_node)
6989 return error_mark_node;
6992 result = size_diffop_loc (input_location,
6993 size_zero_node, result);
6996 if (!(complain & tf_error))
6997 return error_mark_node;
6999 error_not_base_type (from, to);
7000 error (" in pointer to member conversion");
7001 result = size_zero_node;
7006 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
7010 /* Return a constructor for the pointer-to-member-function TYPE using
7011 the other components as specified. */
7014 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
7019 VEC(constructor_elt, gc) *v;
7021 /* Pull the FIELD_DECLs out of the type. */
7022 pfn_field = TYPE_FIELDS (type);
7023 delta_field = DECL_CHAIN (pfn_field);
7025 /* Make sure DELTA has the type we want. */
7026 delta = convert_and_check (delta_type_node, delta);
7028 /* Convert to the correct target type if necessary. */
7029 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
7031 /* Finish creating the initializer. */
7032 v = VEC_alloc(constructor_elt, gc, 2);
7033 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
7034 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
7035 u = build_constructor (type, v);
7036 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
7037 TREE_STATIC (u) = (TREE_CONSTANT (u)
7038 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
7040 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
7045 /* Build a constructor for a pointer to member function. It can be
7046 used to initialize global variables, local variable, or used
7047 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7050 If FORCE is nonzero, then force this conversion, even if
7051 we would rather not do it. Usually set when using an explicit
7052 cast. A C-style cast is being processed iff C_CAST_P is true.
7054 Return error_mark_node, if something goes wrong. */
7057 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
7058 tsubst_flags_t complain)
7064 if (error_operand_p (pfn))
7065 return error_mark_node;
7067 pfn_type = TREE_TYPE (pfn);
7068 to_type = build_ptrmemfunc_type (type);
7070 /* Handle multiple conversions of pointer to member functions. */
7071 if (TYPE_PTRMEMFUNC_P (pfn_type))
7073 tree delta = NULL_TREE;
7074 tree npfn = NULL_TREE;
7078 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
7079 error ("invalid conversion to type %qT from type %qT",
7082 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
7083 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
7085 c_cast_p, complain);
7086 if (n == error_mark_node)
7087 return error_mark_node;
7089 /* We don't have to do any conversion to convert a
7090 pointer-to-member to its own type. But, we don't want to
7091 just return a PTRMEM_CST if there's an explicit cast; that
7092 cast should make the expression an invalid template argument. */
7093 if (TREE_CODE (pfn) != PTRMEM_CST)
7095 if (same_type_p (to_type, pfn_type))
7097 else if (integer_zerop (n))
7098 return build_reinterpret_cast (to_type, pfn,
7099 tf_warning_or_error);
7102 if (TREE_SIDE_EFFECTS (pfn))
7103 pfn = save_expr (pfn);
7105 /* Obtain the function pointer and the current DELTA. */
7106 if (TREE_CODE (pfn) == PTRMEM_CST)
7107 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
7110 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
7111 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
7114 /* Just adjust the DELTA field. */
7115 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7116 (TREE_TYPE (delta), ptrdiff_type_node));
7117 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
7118 n = cp_build_binary_op (input_location,
7119 LSHIFT_EXPR, n, integer_one_node,
7120 tf_warning_or_error);
7121 delta = cp_build_binary_op (input_location,
7122 PLUS_EXPR, delta, n, tf_warning_or_error);
7123 return build_ptrmemfunc1 (to_type, delta, npfn);
7126 /* Handle null pointer to member function conversions. */
7127 if (null_ptr_cst_p (pfn))
7129 pfn = build_c_cast (input_location, type, integer_zero_node);
7130 return build_ptrmemfunc1 (to_type,
7135 if (type_unknown_p (pfn))
7136 return instantiate_type (type, pfn, tf_warning_or_error);
7138 fn = TREE_OPERAND (pfn, 0);
7139 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7140 /* In a template, we will have preserved the
7142 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7143 return make_ptrmem_cst (to_type, fn);
7146 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7149 ??? There is no consistency as to the types returned for the above
7150 values. Some code acts as if it were a sizetype and some as if it were
7151 integer_type_node. */
7154 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7156 tree type = TREE_TYPE (cst);
7157 tree fn = PTRMEM_CST_MEMBER (cst);
7158 tree ptr_class, fn_class;
7160 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7162 /* The class that the function belongs to. */
7163 fn_class = DECL_CONTEXT (fn);
7165 /* The class that we're creating a pointer to member of. */
7166 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7168 /* First, calculate the adjustment to the function's class. */
7169 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7170 /*c_cast_p=*/0, tf_warning_or_error);
7172 if (!DECL_VIRTUAL_P (fn))
7173 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
7176 /* If we're dealing with a virtual function, we have to adjust 'this'
7177 again, to point to the base which provides the vtable entry for
7178 fn; the call will do the opposite adjustment. */
7179 tree orig_class = DECL_CONTEXT (fn);
7180 tree binfo = binfo_or_else (orig_class, fn_class);
7181 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7182 *delta, BINFO_OFFSET (binfo));
7183 *delta = fold_if_not_in_template (*delta);
7185 /* We set PFN to the vtable offset at which the function can be
7186 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7187 case delta is shifted left, and then incremented). */
7188 *pfn = DECL_VINDEX (fn);
7189 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7190 TYPE_SIZE_UNIT (vtable_entry_type));
7191 *pfn = fold_if_not_in_template (*pfn);
7193 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7195 case ptrmemfunc_vbit_in_pfn:
7196 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7198 *pfn = fold_if_not_in_template (*pfn);
7201 case ptrmemfunc_vbit_in_delta:
7202 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7203 *delta, integer_one_node);
7204 *delta = fold_if_not_in_template (*delta);
7205 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7206 *delta, integer_one_node);
7207 *delta = fold_if_not_in_template (*delta);
7214 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
7215 *pfn = fold_if_not_in_template (*pfn);
7219 /* Return an expression for PFN from the pointer-to-member function
7223 pfn_from_ptrmemfunc (tree t)
7225 if (TREE_CODE (t) == PTRMEM_CST)
7230 expand_ptrmemfunc_cst (t, &delta, &pfn);
7235 return build_ptrmemfunc_access_expr (t, pfn_identifier);
7238 /* Return an expression for DELTA from the pointer-to-member function
7242 delta_from_ptrmemfunc (tree t)
7244 if (TREE_CODE (t) == PTRMEM_CST)
7249 expand_ptrmemfunc_cst (t, &delta, &pfn);
7254 return build_ptrmemfunc_access_expr (t, delta_identifier);
7257 /* Convert value RHS to type TYPE as preparation for an assignment to
7258 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7259 implicit conversion is. If FNDECL is non-NULL, we are doing the
7260 conversion in order to pass the PARMNUMth argument of FNDECL.
7261 If FNDECL is NULL, we are doing the conversion in function pointer
7262 argument passing, conversion in initialization, etc. */
7265 convert_for_assignment (tree type, tree rhs,
7266 impl_conv_rhs errtype, tree fndecl, int parmnum,
7267 tsubst_flags_t complain, int flags)
7270 enum tree_code coder;
7272 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7273 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
7274 rhs = TREE_OPERAND (rhs, 0);
7276 rhstype = TREE_TYPE (rhs);
7277 coder = TREE_CODE (rhstype);
7279 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
7280 && vector_types_convertible_p (type, rhstype, true))
7282 rhs = mark_rvalue_use (rhs);
7283 return convert (type, rhs);
7286 if (rhs == error_mark_node || rhstype == error_mark_node)
7287 return error_mark_node;
7288 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
7289 return error_mark_node;
7291 /* The RHS of an assignment cannot have void type. */
7292 if (coder == VOID_TYPE)
7294 if (complain & tf_error)
7295 error ("void value not ignored as it ought to be");
7296 return error_mark_node;
7299 /* Simplify the RHS if possible. */
7300 if (TREE_CODE (rhs) == CONST_DECL)
7301 rhs = DECL_INITIAL (rhs);
7303 if (c_dialect_objc ())
7307 tree rname = fndecl;
7318 selector = objc_message_selector ();
7320 if (selector && parmno > 1)
7327 if (objc_compare_types (type, rhstype, parmno, rname))
7329 rhs = mark_rvalue_use (rhs);
7330 return convert (type, rhs);
7336 The expression is implicitly converted (clause _conv_) to the
7337 cv-unqualified type of the left operand.
7339 We allow bad conversions here because by the time we get to this point
7340 we are committed to doing the conversion. If we end up doing a bad
7341 conversion, convert_like will complain. */
7342 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
7344 /* When -Wno-pmf-conversions is use, we just silently allow
7345 conversions from pointers-to-members to plain pointers. If
7346 the conversion doesn't work, cp_convert will complain. */
7348 && TYPE_PTR_P (type)
7349 && TYPE_PTRMEMFUNC_P (rhstype))
7350 rhs = cp_convert (strip_top_quals (type), rhs);
7353 if (complain & tf_error)
7355 /* If the right-hand side has unknown type, then it is an
7356 overloaded function. Call instantiate_type to get error
7358 if (rhstype == unknown_type_node)
7359 instantiate_type (type, rhs, tf_warning_or_error);
7361 error ("cannot convert %qT to %qT for argument %qP to %qD",
7362 rhstype, type, parmnum, fndecl);
7366 case ICR_DEFAULT_ARGUMENT:
7367 error ("cannot convert %qT to %qT in default argument",
7371 error ("cannot convert %qT to %qT in argument passing",
7374 case ICR_CONVERTING:
7375 error ("cannot convert %qT to %qT",
7379 error ("cannot convert %qT to %qT in initialization",
7383 error ("cannot convert %qT to %qT in return",
7387 error ("cannot convert %qT to %qT in assignment",
7394 return error_mark_node;
7397 if (warn_missing_format_attribute)
7399 const enum tree_code codel = TREE_CODE (type);
7400 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7402 && check_missing_format_attribute (type, rhstype)
7403 && (complain & tf_warning))
7407 case ICR_DEFAULT_ARGUMENT:
7409 warning (OPT_Wmissing_format_attribute,
7410 "parameter %qP of %qD might be a candidate "
7411 "for a format attribute", parmnum, fndecl);
7413 warning (OPT_Wmissing_format_attribute,
7414 "parameter might be a candidate "
7415 "for a format attribute");
7417 case ICR_CONVERTING:
7418 warning (OPT_Wmissing_format_attribute,
7419 "target of conversion might be a candidate "
7420 "for a format attribute");
7423 warning (OPT_Wmissing_format_attribute,
7424 "target of initialization might be a candidate "
7425 "for a format attribute");
7428 warning (OPT_Wmissing_format_attribute,
7429 "return type might be a candidate "
7430 "for a format attribute");
7433 warning (OPT_Wmissing_format_attribute,
7434 "left-hand side of assignment might be a candidate "
7435 "for a format attribute");
7442 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7444 if (warn_parentheses
7445 && TREE_CODE (type) == BOOLEAN_TYPE
7446 && TREE_CODE (rhs) == MODIFY_EXPR
7447 && !TREE_NO_WARNING (rhs)
7448 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
7449 && (complain & tf_warning))
7451 location_t loc = EXPR_LOC_OR_HERE (rhs);
7453 warning_at (loc, OPT_Wparentheses,
7454 "suggest parentheses around assignment used as truth value");
7455 TREE_NO_WARNING (rhs) = 1;
7458 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
7462 /* Convert RHS to be of type TYPE.
7463 If EXP is nonzero, it is the target of the initialization.
7464 ERRTYPE indicates what kind of error the implicit conversion is.
7466 Two major differences between the behavior of
7467 `convert_for_assignment' and `convert_for_initialization'
7468 are that references are bashed in the former, while
7469 copied in the latter, and aggregates are assigned in
7470 the former (operator=) while initialized in the
7473 If using constructor make sure no conversion operator exists, if one does
7474 exist, an ambiguity exists.
7476 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7479 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
7480 impl_conv_rhs errtype, tree fndecl, int parmnum,
7481 tsubst_flags_t complain)
7483 enum tree_code codel = TREE_CODE (type);
7485 enum tree_code coder;
7487 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7488 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7489 if (TREE_CODE (rhs) == NOP_EXPR
7490 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
7491 && codel != REFERENCE_TYPE)
7492 rhs = TREE_OPERAND (rhs, 0);
7494 if (type == error_mark_node
7495 || rhs == error_mark_node
7496 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
7497 return error_mark_node;
7499 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
7500 && TREE_CODE (type) != ARRAY_TYPE
7501 && (TREE_CODE (type) != REFERENCE_TYPE
7502 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
7503 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
7504 && (TREE_CODE (type) != REFERENCE_TYPE
7505 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
7506 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
7507 rhs = decay_conversion (rhs);
7509 rhstype = TREE_TYPE (rhs);
7510 coder = TREE_CODE (rhstype);
7512 if (coder == ERROR_MARK)
7513 return error_mark_node;
7515 /* We accept references to incomplete types, so we can
7516 return here before checking if RHS is of complete type. */
7518 if (codel == REFERENCE_TYPE)
7520 /* This should eventually happen in convert_arguments. */
7521 int savew = 0, savee = 0;
7524 savew = warningcount, savee = errorcount;
7525 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
7526 /*cleanup=*/NULL, flags, complain);
7529 if (warningcount > savew)
7530 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
7531 else if (errorcount > savee)
7532 error ("in passing argument %P of %q+D", parmnum, fndecl);
7538 exp = require_complete_type_sfinae (exp, complain);
7539 if (exp == error_mark_node)
7540 return error_mark_node;
7542 rhstype = non_reference (rhstype);
7544 type = complete_type (type);
7546 if (DIRECT_INIT_EXPR_P (type, rhs))
7547 /* Don't try to do copy-initialization if we already have
7548 direct-initialization. */
7551 if (MAYBE_CLASS_TYPE_P (type))
7552 return perform_implicit_conversion_flags (type, rhs, complain, flags);
7554 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7558 /* If RETVAL is the address of, or a reference to, a local variable or
7559 temporary give an appropriate warning. */
7562 maybe_warn_about_returning_address_of_local (tree retval)
7564 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7565 tree whats_returned = retval;
7569 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7570 whats_returned = TREE_OPERAND (whats_returned, 1);
7571 else if (CONVERT_EXPR_P (whats_returned)
7572 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7573 whats_returned = TREE_OPERAND (whats_returned, 0);
7578 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7580 whats_returned = TREE_OPERAND (whats_returned, 0);
7582 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7584 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7585 || TREE_CODE (whats_returned) == TARGET_EXPR)
7587 warning (0, "returning reference to temporary");
7590 if (TREE_CODE (whats_returned) == VAR_DECL
7591 && DECL_NAME (whats_returned)
7592 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7594 warning (0, "reference to non-lvalue returned");
7599 while (TREE_CODE (whats_returned) == COMPONENT_REF
7600 || TREE_CODE (whats_returned) == ARRAY_REF)
7601 whats_returned = TREE_OPERAND (whats_returned, 0);
7603 if (DECL_P (whats_returned)
7604 && DECL_NAME (whats_returned)
7605 && DECL_FUNCTION_SCOPE_P (whats_returned)
7606 && !(TREE_STATIC (whats_returned)
7607 || TREE_PUBLIC (whats_returned)))
7609 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7610 warning (0, "reference to local variable %q+D returned",
7613 warning (0, "address of local variable %q+D returned",
7619 /* Check that returning RETVAL from the current function is valid.
7620 Return an expression explicitly showing all conversions required to
7621 change RETVAL into the function return type, and to assign it to
7622 the DECL_RESULT for the function. Set *NO_WARNING to true if
7623 code reaches end of non-void function warning shouldn't be issued
7624 on this RETURN_EXPR. */
7627 check_return_expr (tree retval, bool *no_warning)
7630 /* The type actually returned by the function, after any
7633 int fn_returns_value_p;
7634 bool named_return_value_okay_p;
7636 *no_warning = false;
7638 /* A `volatile' function is one that isn't supposed to return, ever.
7639 (This is a G++ extension, used to get better code for functions
7640 that call the `volatile' function.) */
7641 if (TREE_THIS_VOLATILE (current_function_decl))
7642 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7644 /* Check for various simple errors. */
7645 if (DECL_DESTRUCTOR_P (current_function_decl))
7648 error ("returning a value from a destructor");
7651 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7653 if (in_function_try_handler)
7654 /* If a return statement appears in a handler of the
7655 function-try-block of a constructor, the program is ill-formed. */
7656 error ("cannot return from a handler of a function-try-block of a constructor");
7658 /* You can't return a value from a constructor. */
7659 error ("returning a value from a constructor");
7663 /* As an extension, deduce lambda return type from a return statement
7664 anywhere in the body. */
7665 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7667 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7668 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7670 tree type = lambda_return_type (retval);
7671 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7673 if (oldtype == NULL_TREE)
7674 apply_lambda_return_type (lambda, type);
7675 /* If one of the answers is type-dependent, we can't do any
7676 better until instantiation time. */
7677 else if (oldtype == dependent_lambda_return_type_node)
7679 else if (type == dependent_lambda_return_type_node)
7680 apply_lambda_return_type (lambda, type);
7681 else if (!same_type_p (type, oldtype))
7682 error ("inconsistent types %qT and %qT deduced for "
7683 "lambda return type", type, oldtype);
7687 if (processing_template_decl)
7689 current_function_returns_value = 1;
7690 if (check_for_bare_parameter_packs (retval))
7691 retval = error_mark_node;
7695 /* When no explicit return-value is given in a function with a named
7696 return value, the named return value is used. */
7697 result = DECL_RESULT (current_function_decl);
7698 valtype = TREE_TYPE (result);
7699 gcc_assert (valtype != NULL_TREE);
7700 fn_returns_value_p = !VOID_TYPE_P (valtype);
7701 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7704 /* Check for a return statement with no return value in a function
7705 that's supposed to return a value. */
7706 if (!retval && fn_returns_value_p)
7708 permerror (input_location, "return-statement with no value, in function returning %qT",
7710 /* Clear this, so finish_function won't say that we reach the
7711 end of a non-void function (which we don't, we gave a
7713 current_function_returns_null = 0;
7714 /* And signal caller that TREE_NO_WARNING should be set on the
7715 RETURN_EXPR to avoid control reaches end of non-void function
7716 warnings in tree-cfg.c. */
7719 /* Check for a return statement with a value in a function that
7720 isn't supposed to return a value. */
7721 else if (retval && !fn_returns_value_p)
7723 if (VOID_TYPE_P (TREE_TYPE (retval)))
7724 /* You can return a `void' value from a function of `void'
7725 type. In that case, we have to evaluate the expression for
7726 its side-effects. */
7727 finish_expr_stmt (retval);
7729 permerror (input_location, "return-statement with a value, in function "
7730 "returning 'void'");
7731 current_function_returns_null = 1;
7733 /* There's really no value to return, after all. */
7737 /* Remember that this function can sometimes return without a
7739 current_function_returns_null = 1;
7741 /* Remember that this function did return a value. */
7742 current_function_returns_value = 1;
7744 /* Check for erroneous operands -- but after giving ourselves a
7745 chance to provide an error about returning a value from a void
7747 if (error_operand_p (retval))
7749 current_function_return_value = error_mark_node;
7750 return error_mark_node;
7753 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7754 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7755 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7756 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7758 && retval && null_ptr_cst_p (retval))
7759 warning (0, "%<operator new%> must not return NULL unless it is "
7760 "declared %<throw()%> (or -fcheck-new is in effect)");
7762 /* Effective C++ rule 15. See also start_function. */
7764 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7768 /* The function return type must be a reference to the current
7770 if (TREE_CODE (valtype) == REFERENCE_TYPE
7771 && same_type_ignoring_top_level_qualifiers_p
7772 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7774 /* Returning '*this' is obviously OK. */
7775 if (retval == current_class_ref)
7777 /* If we are calling a function whose return type is the same of
7778 the current class reference, it is ok. */
7779 else if (TREE_CODE (retval) == INDIRECT_REF
7780 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7785 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7788 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7790 [...] For a function with a class return type, if the expression
7791 in the return statement is the name of a local object, and the cv-
7792 unqualified type of the local object is the same as the function
7793 return type, an implementation is permitted to omit creating the tem-
7794 porary object to hold the function return value [...]
7796 So, if this is a value-returning function that always returns the same
7797 local variable, remember it.
7799 It might be nice to be more flexible, and choose the first suitable
7800 variable even if the function sometimes returns something else, but
7801 then we run the risk of clobbering the variable we chose if the other
7802 returned expression uses the chosen variable somehow. And people expect
7803 this restriction, anyway. (jason 2000-11-19)
7805 See finish_function and finalize_nrv for the rest of this optimization. */
7807 named_return_value_okay_p =
7808 (retval != NULL_TREE
7809 /* Must be a local, automatic variable. */
7810 && TREE_CODE (retval) == VAR_DECL
7811 && DECL_CONTEXT (retval) == current_function_decl
7812 && ! TREE_STATIC (retval)
7813 && ! DECL_ANON_UNION_VAR_P (retval)
7814 && (DECL_ALIGN (retval)
7815 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7816 /* The cv-unqualified type of the returned value must be the
7817 same as the cv-unqualified return type of the
7819 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7821 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7822 /* And the returned value must be non-volatile. */
7823 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7825 if (fn_returns_value_p && flag_elide_constructors)
7827 if (named_return_value_okay_p
7828 && (current_function_return_value == NULL_TREE
7829 || current_function_return_value == retval))
7830 current_function_return_value = retval;
7832 current_function_return_value = error_mark_node;
7835 /* We don't need to do any conversions when there's nothing being
7840 /* Do any required conversions. */
7841 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7842 /* No conversions are required. */
7846 /* The type the function is declared to return. */
7847 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7848 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7850 /* The functype's return type will have been set to void, if it
7851 was an incomplete type. Just treat this as 'return;' */
7852 if (VOID_TYPE_P (functype))
7853 return error_mark_node;
7855 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7856 treated as an rvalue for the purposes of overload resolution to
7857 favor move constructors over copy constructors.
7859 Note that these conditions are similar to, but not as strict as,
7860 the conditions for the named return value optimization. */
7861 if ((cxx_dialect != cxx98)
7862 && (TREE_CODE (retval) == VAR_DECL
7863 || TREE_CODE (retval) == PARM_DECL)
7864 && DECL_CONTEXT (retval) == current_function_decl
7865 && !TREE_STATIC (retval)
7866 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7868 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7869 /* This is only interesting for class type. */
7870 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7871 flags = flags | LOOKUP_PREFER_RVALUE;
7873 /* First convert the value to the function's return type, then
7874 to the type of return value's location to handle the
7875 case that functype is smaller than the valtype. */
7876 retval = convert_for_initialization
7877 (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
7878 tf_warning_or_error);
7879 retval = convert (valtype, retval);
7881 /* If the conversion failed, treat this just like `return;'. */
7882 if (retval == error_mark_node)
7884 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7885 else if (! cfun->returns_struct
7886 && TREE_CODE (retval) == TARGET_EXPR
7887 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7888 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7889 TREE_OPERAND (retval, 0));
7891 maybe_warn_about_returning_address_of_local (retval);
7894 /* Actually copy the value returned into the appropriate location. */
7895 if (retval && retval != result)
7896 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7902 /* Returns nonzero if the pointer-type FROM can be converted to the
7903 pointer-type TO via a qualification conversion. If CONSTP is -1,
7904 then we return nonzero if the pointers are similar, and the
7905 cv-qualification signature of FROM is a proper subset of that of TO.
7907 If CONSTP is positive, then all outer pointers have been
7911 comp_ptr_ttypes_real (tree to, tree from, int constp)
7913 bool to_more_cv_qualified = false;
7914 bool is_opaque_pointer = false;
7916 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7918 if (TREE_CODE (to) != TREE_CODE (from))
7921 if (TREE_CODE (from) == OFFSET_TYPE
7922 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7923 TYPE_OFFSET_BASETYPE (to)))
7926 /* Const and volatile mean something different for function types,
7927 so the usual checks are not appropriate. */
7928 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7930 if (!at_least_as_qualified_p (to, from))
7933 if (!at_least_as_qualified_p (from, to))
7937 to_more_cv_qualified = true;
7941 constp &= TYPE_READONLY (to);
7944 if (TREE_CODE (to) == VECTOR_TYPE)
7945 is_opaque_pointer = vector_targets_convertible_p (to, from);
7947 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7948 return ((constp >= 0 || to_more_cv_qualified)
7949 && (is_opaque_pointer
7950 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7954 /* When comparing, say, char ** to char const **, this function takes
7955 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7956 types to this function. */
7959 comp_ptr_ttypes (tree to, tree from)
7961 return comp_ptr_ttypes_real (to, from, 1);
7964 /* Returns true iff FNTYPE is a non-class type that involves
7965 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7966 if a parameter type is ill-formed. */
7969 error_type_p (const_tree type)
7973 switch (TREE_CODE (type))
7979 case REFERENCE_TYPE:
7981 return error_type_p (TREE_TYPE (type));
7985 if (error_type_p (TREE_TYPE (type)))
7987 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
7988 if (error_type_p (TREE_VALUE (t)))
7993 if (TYPE_PTRMEMFUNC_P (type))
7994 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
8002 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
8003 type or inheritance-related types, regardless of cv-quals. */
8006 ptr_reasonably_similar (const_tree to, const_tree from)
8008 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8010 /* Any target type is similar enough to void. */
8011 if (TREE_CODE (to) == VOID_TYPE)
8012 return !error_type_p (from);
8013 if (TREE_CODE (from) == VOID_TYPE)
8014 return !error_type_p (to);
8016 if (TREE_CODE (to) != TREE_CODE (from))
8019 if (TREE_CODE (from) == OFFSET_TYPE
8020 && comptypes (TYPE_OFFSET_BASETYPE (to),
8021 TYPE_OFFSET_BASETYPE (from),
8022 COMPARE_BASE | COMPARE_DERIVED))
8025 if (TREE_CODE (to) == VECTOR_TYPE
8026 && vector_types_convertible_p (to, from, false))
8029 if (TREE_CODE (to) == INTEGER_TYPE
8030 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
8033 if (TREE_CODE (to) == FUNCTION_TYPE)
8034 return !error_type_p (to) && !error_type_p (from);
8036 if (TREE_CODE (to) != POINTER_TYPE)
8038 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
8039 COMPARE_BASE | COMPARE_DERIVED);
8043 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8044 pointer-to-member types) are the same, ignoring cv-qualification at
8048 comp_ptr_ttypes_const (tree to, tree from)
8050 bool is_opaque_pointer = false;
8052 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8054 if (TREE_CODE (to) != TREE_CODE (from))
8057 if (TREE_CODE (from) == OFFSET_TYPE
8058 && same_type_p (TYPE_OFFSET_BASETYPE (from),
8059 TYPE_OFFSET_BASETYPE (to)))
8062 if (TREE_CODE (to) == VECTOR_TYPE)
8063 is_opaque_pointer = vector_targets_convertible_p (to, from);
8065 if (TREE_CODE (to) != POINTER_TYPE)
8066 return (is_opaque_pointer
8067 || same_type_ignoring_top_level_qualifiers_p (to, from));
8071 /* Returns the type qualifiers for this type, including the qualifiers on the
8072 elements for an array type. */
8075 cp_type_quals (const_tree type)
8078 /* This CONST_CAST is okay because strip_array_types returns its
8079 argument unmodified and we assign it to a const_tree. */
8080 type = strip_array_types (CONST_CAST_TREE (type));
8081 if (type == error_mark_node
8082 /* Quals on a FUNCTION_TYPE are memfn quals. */
8083 || TREE_CODE (type) == FUNCTION_TYPE)
8084 return TYPE_UNQUALIFIED;
8085 quals = TYPE_QUALS (type);
8086 /* METHOD and REFERENCE_TYPEs should never have quals. */
8087 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
8088 && TREE_CODE (type) != REFERENCE_TYPE)
8089 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
8090 == TYPE_UNQUALIFIED));
8094 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8098 type_memfn_quals (const_tree type)
8100 if (TREE_CODE (type) == FUNCTION_TYPE)
8101 return TYPE_QUALS (type);
8102 else if (TREE_CODE (type) == METHOD_TYPE)
8103 return cp_type_quals (class_of_this_parm (type));
8108 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8112 apply_memfn_quals (tree type, cp_cv_quals memfn_quals)
8114 /* Could handle METHOD_TYPE here if necessary. */
8115 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8116 if (TYPE_QUALS (type) == memfn_quals)
8118 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8120 return build_qualified_type (type, memfn_quals);
8123 /* Returns nonzero if TYPE is const or volatile. */
8126 cv_qualified_p (const_tree type)
8128 int quals = cp_type_quals (type);
8129 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
8132 /* Returns nonzero if the TYPE contains a mutable member. */
8135 cp_has_mutable_p (const_tree type)
8137 /* This CONST_CAST is okay because strip_array_types returns its
8138 argument unmodified and we assign it to a const_tree. */
8139 type = strip_array_types (CONST_CAST_TREE(type));
8141 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
8144 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8145 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8146 approximation. In particular, consider:
8149 struct S { int i; };
8150 const S s = { f(); }
8152 Here, we will make "s" as TREE_READONLY (because it is declared
8153 "const") -- only to reverse ourselves upon seeing that the
8154 initializer is non-constant. */
8157 cp_apply_type_quals_to_decl (int type_quals, tree decl)
8159 tree type = TREE_TYPE (decl);
8161 if (type == error_mark_node)
8164 if (TREE_CODE (decl) == TYPE_DECL)
8167 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
8168 && type_quals != TYPE_UNQUALIFIED));
8170 /* Avoid setting TREE_READONLY incorrectly. */
8171 /* We used to check TYPE_NEEDS_CONSTRUCTING here, but now a constexpr
8172 constructor can produce constant init, so rely on cp_finish_decl to
8173 clear TREE_READONLY if the variable has non-constant init. */
8175 /* If the type has a mutable component, that component might be
8177 if (TYPE_HAS_MUTABLE_P (type))
8178 type_quals &= ~TYPE_QUAL_CONST;
8180 c_apply_type_quals_to_decl (type_quals, decl);
8183 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8184 exemplar types such that casting T1 to T2 is casting away constness
8185 if and only if there is no implicit conversion from T1 to T2. */
8188 casts_away_constness_r (tree *t1, tree *t2)
8193 /* [expr.const.cast]
8195 For multi-level pointer to members and multi-level mixed pointers
8196 and pointers to members (conv.qual), the "member" aspect of a
8197 pointer to member level is ignored when determining if a const
8198 cv-qualifier has been cast away. */
8199 /* [expr.const.cast]
8201 For two pointer types:
8203 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8204 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8207 casting from X1 to X2 casts away constness if, for a non-pointer
8208 type T there does not exist an implicit conversion (clause
8211 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8215 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8216 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
8217 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
8219 *t1 = cp_build_qualified_type (void_type_node,
8220 cp_type_quals (*t1));
8221 *t2 = cp_build_qualified_type (void_type_node,
8222 cp_type_quals (*t2));
8226 quals1 = cp_type_quals (*t1);
8227 quals2 = cp_type_quals (*t2);
8229 if (TYPE_PTRMEM_P (*t1))
8230 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
8232 *t1 = TREE_TYPE (*t1);
8233 if (TYPE_PTRMEM_P (*t2))
8234 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
8236 *t2 = TREE_TYPE (*t2);
8238 casts_away_constness_r (t1, t2);
8239 *t1 = build_pointer_type (*t1);
8240 *t2 = build_pointer_type (*t2);
8241 *t1 = cp_build_qualified_type (*t1, quals1);
8242 *t2 = cp_build_qualified_type (*t2, quals2);
8245 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8248 ??? This function returns non-zero if casting away qualifiers not
8249 just const. We would like to return to the caller exactly which
8250 qualifiers are casted away to give more accurate diagnostics.
8254 casts_away_constness (tree t1, tree t2)
8256 if (TREE_CODE (t2) == REFERENCE_TYPE)
8258 /* [expr.const.cast]
8260 Casting from an lvalue of type T1 to an lvalue of type T2
8261 using a reference cast casts away constness if a cast from an
8262 rvalue of type "pointer to T1" to the type "pointer to T2"
8263 casts away constness. */
8264 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
8265 return casts_away_constness (build_pointer_type (t1),
8266 build_pointer_type (TREE_TYPE (t2)));
8269 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
8270 /* [expr.const.cast]
8272 Casting from an rvalue of type "pointer to data member of X
8273 of type T1" to the type "pointer to data member of Y of type
8274 T2" casts away constness if a cast from an rvalue of type
8275 "pointer to T1" to the type "pointer to T2" casts away
8277 return casts_away_constness
8278 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
8279 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
8281 /* Casting away constness is only something that makes sense for
8282 pointer or reference types. */
8283 if (TREE_CODE (t1) != POINTER_TYPE
8284 || TREE_CODE (t2) != POINTER_TYPE)
8287 /* Top-level qualifiers don't matter. */
8288 t1 = TYPE_MAIN_VARIANT (t1);
8289 t2 = TYPE_MAIN_VARIANT (t2);
8290 casts_away_constness_r (&t1, &t2);
8291 if (!can_convert (t2, t1))
8297 /* If T is a REFERENCE_TYPE return the type to which T refers.
8298 Otherwise, return T itself. */
8301 non_reference (tree t)
8303 if (TREE_CODE (t) == REFERENCE_TYPE)
8309 /* Return nonzero if REF is an lvalue valid for this language;
8310 otherwise, print an error message and return zero. USE says
8311 how the lvalue is being used and so selects the error message. */
8314 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
8316 cp_lvalue_kind kind = lvalue_kind (ref);
8318 if (kind == clk_none)
8320 if (complain & tf_error)
8321 lvalue_error (input_location, use);
8324 else if (kind & (clk_rvalueref|clk_class))
8326 if (!(complain & tf_error))
8328 if (kind & clk_class)
8329 /* Make this a permerror because we used to accept it. */
8330 permerror (input_location, "using temporary as lvalue");
8332 error ("using xvalue (rvalue reference) as lvalue");