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 result_type = void_type_node;
522 result_type = cp_build_qualified_type (result_type,
523 (cp_type_quals (pointee1)
524 | cp_type_quals (pointee2)));
525 /* If the original types were pointers to members, so is the
527 if (TYPE_PTR_TO_MEMBER_P (t1))
529 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
530 TYPE_PTRMEM_CLASS_TYPE (t2))
531 && (complain & tf_error))
532 composite_pointer_error (DK_PERMERROR, t1, t2, operation);
533 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
537 result_type = build_pointer_type (result_type);
539 /* Merge the attributes. */
540 attributes = (*targetm.merge_type_attributes) (t1, t2);
541 return build_type_attribute_variant (result_type, attributes);
544 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
545 ARG1 and ARG2 are the values with those types. The OPERATION is to
546 describe the operation between the pointer types,
547 in case an error occurs.
549 This routine also implements the computation of a common type for
550 pointers-to-members as per [expr.eq]. */
553 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
554 composite_pointer_operation operation,
555 tsubst_flags_t complain)
562 If one operand is a null pointer constant, the composite pointer
563 type is the type of the other operand. */
564 if (null_ptr_cst_p (arg1))
566 if (null_ptr_cst_p (arg2))
573 If one of the operands has type "pointer to cv1 void*", then
574 the other has type "pointer to cv2T", and the composite pointer
575 type is "pointer to cv12 void", where cv12 is the union of cv1
578 If either type is a pointer to void, make sure it is T1. */
579 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
587 /* Now, if T1 is a pointer to void, merge the qualifiers. */
588 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
593 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
598 pedwarn (input_location, OPT_pedantic,
599 "ISO C++ forbids comparison between "
600 "pointer of type %<void *%> and pointer-to-function");
603 pedwarn (input_location, OPT_pedantic,
604 "ISO C++ forbids conversion between "
605 "pointer of type %<void *%> and pointer-to-function");
607 case CPO_CONDITIONAL_EXPR:
608 pedwarn (input_location, OPT_pedantic,
609 "ISO C++ forbids conditional expression between "
610 "pointer of type %<void *%> and pointer-to-function");
617 = cp_build_qualified_type (void_type_node,
618 (cp_type_quals (TREE_TYPE (t1))
619 | cp_type_quals (TREE_TYPE (t2))));
620 result_type = build_pointer_type (result_type);
621 /* Merge the attributes. */
622 attributes = (*targetm.merge_type_attributes) (t1, t2);
623 return build_type_attribute_variant (result_type, attributes);
626 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
627 && TREE_CODE (t2) == POINTER_TYPE)
629 if (objc_have_common_type (t1, t2, -3, NULL_TREE))
630 return objc_common_type (t1, t2);
633 /* [expr.eq] permits the application of a pointer conversion to
634 bring the pointers to a common type. */
635 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
636 && CLASS_TYPE_P (TREE_TYPE (t1))
637 && CLASS_TYPE_P (TREE_TYPE (t2))
638 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
641 class1 = TREE_TYPE (t1);
642 class2 = TREE_TYPE (t2);
644 if (DERIVED_FROM_P (class1, class2))
645 t2 = (build_pointer_type
646 (cp_build_qualified_type (class1, cp_type_quals (class2))));
647 else if (DERIVED_FROM_P (class2, class1))
648 t1 = (build_pointer_type
649 (cp_build_qualified_type (class2, cp_type_quals (class1))));
652 if (complain & tf_error)
653 composite_pointer_error (DK_ERROR, t1, t2, operation);
654 return error_mark_node;
657 /* [expr.eq] permits the application of a pointer-to-member
658 conversion to change the class type of one of the types. */
659 else if (TYPE_PTR_TO_MEMBER_P (t1)
660 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
661 TYPE_PTRMEM_CLASS_TYPE (t2)))
663 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
664 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
666 if (DERIVED_FROM_P (class1, class2))
667 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
668 else if (DERIVED_FROM_P (class2, class1))
669 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
672 if (complain & tf_error)
676 error ("comparison between distinct "
677 "pointer-to-member types %qT and %qT lacks a cast",
681 error ("conversion between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
685 case CPO_CONDITIONAL_EXPR:
686 error ("conditional expression between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
693 return error_mark_node;
697 return composite_pointer_type_r (t1, t2, operation, complain);
700 /* Return the merged type of two types.
701 We assume that comptypes has already been done and returned 1;
702 if that isn't so, this may crash.
704 This just combines attributes and default arguments; any other
705 differences would cause the two types to compare unalike. */
708 merge_types (tree t1, tree t2)
710 enum tree_code code1;
711 enum tree_code code2;
714 /* Save time if the two types are the same. */
717 if (original_type (t1) == original_type (t2))
720 /* If one type is nonsense, use the other. */
721 if (t1 == error_mark_node)
723 if (t2 == error_mark_node)
726 /* Merge the attributes. */
727 attributes = (*targetm.merge_type_attributes) (t1, t2);
729 if (TYPE_PTRMEMFUNC_P (t1))
730 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
731 if (TYPE_PTRMEMFUNC_P (t2))
732 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
734 code1 = TREE_CODE (t1);
735 code2 = TREE_CODE (t2);
738 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
739 if (code1 == TYPENAME_TYPE)
741 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
742 code1 = TREE_CODE (t1);
746 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
747 code2 = TREE_CODE (t2);
755 /* For two pointers, do this recursively on the target type. */
757 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
758 int quals = cp_type_quals (t1);
760 if (code1 == POINTER_TYPE)
761 t1 = build_pointer_type (target);
763 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
764 t1 = build_type_attribute_variant (t1, attributes);
765 t1 = cp_build_qualified_type (t1, quals);
767 if (TREE_CODE (target) == METHOD_TYPE)
768 t1 = build_ptrmemfunc_type (t1);
777 quals = cp_type_quals (t1);
778 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
779 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
780 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
782 t1 = cp_build_qualified_type (t1, quals);
788 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
789 /* Save space: see if the result is identical to one of the args. */
790 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
791 return build_type_attribute_variant (t1, attributes);
792 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
793 return build_type_attribute_variant (t2, attributes);
794 /* Merge the element types, and have a size if either arg has one. */
795 t1 = build_cplus_array_type
796 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
801 /* Function types: prefer the one that specified arg types.
802 If both do, merge the arg types. Also merge the return types. */
804 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
805 tree p1 = TYPE_ARG_TYPES (t1);
806 tree p2 = TYPE_ARG_TYPES (t2);
810 /* Save space: see if the result is identical to one of the args. */
811 if (valtype == TREE_TYPE (t1) && ! p2)
812 return cp_build_type_attribute_variant (t1, attributes);
813 if (valtype == TREE_TYPE (t2) && ! p1)
814 return cp_build_type_attribute_variant (t2, attributes);
816 /* Simple way if one arg fails to specify argument types. */
817 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
819 else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
822 parms = commonparms (p1, p2);
824 rval = build_function_type (valtype, parms);
825 gcc_assert (type_memfn_quals (t1) == type_memfn_quals (t2));
826 rval = apply_memfn_quals (rval, type_memfn_quals (t1));
827 raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
828 TYPE_RAISES_EXCEPTIONS (t2));
829 t1 = build_exception_variant (rval, raises);
835 /* Get this value the long way, since TYPE_METHOD_BASETYPE
836 is just the main variant of this. */
837 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
838 tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
839 TYPE_RAISES_EXCEPTIONS (t2));
842 /* If this was a member function type, get back to the
843 original type of type member function (i.e., without
844 the class instance variable up front. */
845 t1 = build_function_type (TREE_TYPE (t1),
846 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
847 t2 = build_function_type (TREE_TYPE (t2),
848 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
849 t3 = merge_types (t1, t2);
850 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
851 TYPE_ARG_TYPES (t3));
852 t1 = build_exception_variant (t3, raises);
857 /* There is no need to merge attributes into a TYPENAME_TYPE.
858 When the type is instantiated it will have whatever
859 attributes result from the instantiation. */
865 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
867 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
870 return cp_build_type_attribute_variant (t1, attributes);
873 /* Return the ARRAY_TYPE type without its domain. */
876 strip_array_domain (tree type)
879 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
880 if (TYPE_DOMAIN (type) == NULL_TREE)
882 t2 = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
883 return cp_build_type_attribute_variant (t2, TYPE_ATTRIBUTES (type));
886 /* Wrapper around cp_common_type that is used by c-common.c and other
887 front end optimizations that remove promotions.
889 Return the common type for two arithmetic types T1 and T2 under the
890 usual arithmetic conversions. The default conversions have already
891 been applied, and enumerated types converted to their compatible
895 common_type (tree t1, tree t2)
897 /* If one type is nonsense, use the other */
898 if (t1 == error_mark_node)
900 if (t2 == error_mark_node)
903 return cp_common_type (t1, t2);
906 /* Return the common type of two pointer types T1 and T2. This is the
907 type for the result of most arithmetic operations if the operands
908 have the given two types.
910 We assume that comp_target_types has already been done and returned
911 nonzero; if that isn't so, this may crash. */
914 common_pointer_type (tree t1, tree t2)
916 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
917 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
918 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
920 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
921 CPO_CONVERSION, tf_warning_or_error);
924 /* Compare two exception specifier types for exactness or subsetness, if
925 allowed. Returns false for mismatch, true for match (same, or
928 [except.spec] "If a class X ... objects of class X or any class publicly
929 and unambiguously derived from X. Similarly, if a pointer type Y * ...
930 exceptions of type Y * or that are pointers to any type publicly and
931 unambiguously derived from Y. Otherwise a function only allows exceptions
932 that have the same type ..."
933 This does not mention cv qualifiers and is different to what throw
934 [except.throw] and catch [except.catch] will do. They will ignore the
935 top level cv qualifiers, and allow qualifiers in the pointer to class
938 We implement the letter of the standard. */
941 comp_except_types (tree a, tree b, bool exact)
943 if (same_type_p (a, b))
947 if (cp_type_quals (a) || cp_type_quals (b))
950 if (TREE_CODE (a) == POINTER_TYPE
951 && TREE_CODE (b) == POINTER_TYPE)
955 if (cp_type_quals (a) || cp_type_quals (b))
959 if (TREE_CODE (a) != RECORD_TYPE
960 || TREE_CODE (b) != RECORD_TYPE)
963 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
969 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
970 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
971 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
972 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
973 are unordered, but we've already filtered out duplicates. Most lists will
974 be in order, we should try to make use of that. */
977 comp_except_specs (const_tree t1, const_tree t2, int exact)
986 /* First handle noexcept. */
987 if (exact < ce_exact)
989 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
990 and stricter than any spec. */
991 if (t1 == noexcept_false_spec)
992 return !nothrow_spec_p (t2) || exact == ce_derived;
993 /* Even a derived noexcept(false) is compatible with a throwing
995 if (t2 == noexcept_false_spec)
996 return !nothrow_spec_p (t1);
998 /* Otherwise, if we aren't looking for an exact match, noexcept is
999 equivalent to throw(). */
1000 if (t1 == noexcept_true_spec)
1001 t1 = empty_except_spec;
1002 if (t2 == noexcept_true_spec)
1003 t2 = empty_except_spec;
1006 /* If any noexcept is left, it is only comparable to itself;
1007 either we're looking for an exact match or we're redeclaring a
1008 template with dependent noexcept. */
1009 if ((t1 && TREE_PURPOSE (t1))
1010 || (t2 && TREE_PURPOSE (t2)))
1012 && cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)));
1014 if (t1 == NULL_TREE) /* T1 is ... */
1015 return t2 == NULL_TREE || exact == ce_derived;
1016 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
1017 return t2 != NULL_TREE && !TREE_VALUE (t2);
1018 if (t2 == NULL_TREE) /* T2 is ... */
1020 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1021 return exact == ce_derived;
1023 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1024 Count how many we find, to determine exactness. For exact matching and
1025 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1027 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1029 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1031 tree a = TREE_VALUE (probe);
1032 tree b = TREE_VALUE (t2);
1034 if (comp_except_types (a, b, exact))
1036 if (probe == base && exact > ce_derived)
1037 base = TREE_CHAIN (probe);
1042 if (probe == NULL_TREE)
1045 return exact == ce_derived || base == NULL_TREE || length == list_length (t1);
1048 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1049 [] can match [size]. */
1052 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1061 /* The type of the array elements must be the same. */
1062 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1065 d1 = TYPE_DOMAIN (t1);
1066 d2 = TYPE_DOMAIN (t2);
1071 /* If one of the arrays is dimensionless, and the other has a
1072 dimension, they are of different types. However, it is valid to
1080 declarations for an array object can specify
1081 array types that differ by the presence or absence of a major
1082 array bound (_dcl.array_). */
1084 return allow_redeclaration;
1086 /* Check that the dimensions are the same. */
1088 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1090 max1 = TYPE_MAX_VALUE (d1);
1091 max2 = TYPE_MAX_VALUE (d2);
1092 if (processing_template_decl && !abi_version_at_least (2)
1093 && !value_dependent_expression_p (max1)
1094 && !value_dependent_expression_p (max2))
1096 /* With abi-1 we do not fold non-dependent array bounds, (and
1097 consequently mangle them incorrectly). We must therefore
1098 fold them here, to verify the domains have the same
1104 if (!cp_tree_equal (max1, max2))
1110 /* Compare the relative position of T1 and T2 into their respective
1111 template parameter list.
1112 T1 and T2 must be template parameter types.
1113 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1116 comp_template_parms_position (tree t1, tree t2)
1118 tree index1, index2;
1119 gcc_assert (t1 && t2
1120 && TREE_CODE (t1) == TREE_CODE (t2)
1121 && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1122 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1123 || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1125 index1 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t1));
1126 index2 = TEMPLATE_TYPE_PARM_INDEX (TYPE_MAIN_VARIANT (t2));
1128 /* If T1 and T2 belong to template parm lists of different size,
1129 let's assume they are different. */
1130 if (TEMPLATE_PARM_NUM_SIBLINGS (index1)
1131 != TEMPLATE_PARM_NUM_SIBLINGS (index2))
1134 /* Then compare their relative position. */
1135 if (TEMPLATE_PARM_IDX (index1) != TEMPLATE_PARM_IDX (index2)
1136 || TEMPLATE_PARM_LEVEL (index1) != TEMPLATE_PARM_LEVEL (index2)
1137 || (TEMPLATE_PARM_PARAMETER_PACK (index1)
1138 != TEMPLATE_PARM_PARAMETER_PACK (index2)))
1144 /* Subroutine in comptypes. */
1147 structural_comptypes (tree t1, tree t2, int strict)
1152 /* Suppress errors caused by previously reported errors. */
1153 if (t1 == error_mark_node || t2 == error_mark_node)
1156 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1158 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1159 current instantiation. */
1160 if (TREE_CODE (t1) == TYPENAME_TYPE)
1161 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1163 if (TREE_CODE (t2) == TYPENAME_TYPE)
1164 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1166 if (TYPE_PTRMEMFUNC_P (t1))
1167 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1168 if (TYPE_PTRMEMFUNC_P (t2))
1169 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1171 /* Different classes of types can't be compatible. */
1172 if (TREE_CODE (t1) != TREE_CODE (t2))
1175 /* Qualifiers must match. For array types, we will check when we
1176 recur on the array element types. */
1177 if (TREE_CODE (t1) != ARRAY_TYPE
1178 && cp_type_quals (t1) != cp_type_quals (t2))
1180 if (TREE_CODE (t1) == FUNCTION_TYPE
1181 && type_memfn_quals (t1) != type_memfn_quals (t2))
1183 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1186 /* Allow for two different type nodes which have essentially the same
1187 definition. Note that we already checked for equality of the type
1188 qualifiers (just above). */
1190 if (TREE_CODE (t1) != ARRAY_TYPE
1191 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1195 /* Compare the types. Break out if they could be the same. */
1196 switch (TREE_CODE (t1))
1200 /* All void and bool types are the same. */
1204 case FIXED_POINT_TYPE:
1206 /* With these nodes, we can't determine type equivalence by
1207 looking at what is stored in the nodes themselves, because
1208 two nodes might have different TYPE_MAIN_VARIANTs but still
1209 represent the same type. For example, wchar_t and int could
1210 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1211 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1212 and are distinct types. On the other hand, int and the
1215 typedef int INT __attribute((may_alias));
1217 have identical properties, different TYPE_MAIN_VARIANTs, but
1218 represent the same type. The canonical type system keeps
1219 track of equivalence in this case, so we fall back on it. */
1220 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1222 case TEMPLATE_TEMPLATE_PARM:
1223 case BOUND_TEMPLATE_TEMPLATE_PARM:
1224 if (!comp_template_parms_position (t1, t2))
1226 if (!comp_template_parms
1227 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1228 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1230 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1232 /* Don't check inheritance. */
1233 strict = COMPARE_STRICT;
1238 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1239 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1240 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1241 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1244 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1246 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1252 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1253 strict & ~COMPARE_REDECLARATION))
1255 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1259 case REFERENCE_TYPE:
1260 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1262 /* fall through to checks for pointer types */
1265 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1266 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1267 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1273 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1275 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1280 /* Target types must match incl. qualifiers. */
1281 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1285 case TEMPLATE_TYPE_PARM:
1286 /* If T1 and T2 don't have the same relative position in their
1287 template parameters set, they can't be equal. */
1288 if (!comp_template_parms_position (t1, t2))
1293 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1294 TYPENAME_TYPE_FULLNAME (t2)))
1296 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1300 case UNBOUND_CLASS_TEMPLATE:
1301 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1303 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1308 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1313 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1314 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1318 case TYPE_PACK_EXPANSION:
1319 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1320 PACK_EXPANSION_PATTERN (t2));
1323 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1324 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1325 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1326 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1327 || (DECLTYPE_FOR_LAMBDA_RETURN (t1)
1328 != DECLTYPE_FOR_LAMBDA_RETURN (t2))
1329 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1330 DECLTYPE_TYPE_EXPR (t2)))
1338 /* If we get here, we know that from a target independent POV the
1339 types are the same. Make sure the target attributes are also
1341 return comp_type_attributes (t1, t2);
1344 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1345 is a bitwise-or of the COMPARE_* flags. */
1348 comptypes (tree t1, tree t2, int strict)
1350 if (strict == COMPARE_STRICT)
1355 if (t1 == error_mark_node || t2 == error_mark_node)
1358 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1359 /* At least one of the types requires structural equality, so
1360 perform a deep check. */
1361 return structural_comptypes (t1, t2, strict);
1363 #ifdef ENABLE_CHECKING
1364 if (USE_CANONICAL_TYPES)
1366 bool result = structural_comptypes (t1, t2, strict);
1368 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1369 /* The two types are structurally equivalent, but their
1370 canonical types were different. This is a failure of the
1371 canonical type propagation code.*/
1373 ("canonical types differ for identical types %T and %T",
1375 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1376 /* Two types are structurally different, but the canonical
1377 types are the same. This means we were over-eager in
1378 assigning canonical types. */
1380 ("same canonical type node for different types %T and %T",
1386 if (USE_CANONICAL_TYPES)
1387 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1390 return structural_comptypes (t1, t2, strict);
1392 else if (strict == COMPARE_STRUCTURAL)
1393 return structural_comptypes (t1, t2, COMPARE_STRICT);
1395 return structural_comptypes (t1, t2, strict);
1398 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1399 top-level qualifiers. */
1402 same_type_ignoring_top_level_qualifiers_p (tree type1, tree type2)
1404 if (type1 == error_mark_node || type2 == error_mark_node)
1407 return same_type_p (TYPE_MAIN_VARIANT (type1), TYPE_MAIN_VARIANT (type2));
1410 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1413 at_least_as_qualified_p (const_tree type1, const_tree type2)
1415 int q1 = cp_type_quals (type1);
1416 int q2 = cp_type_quals (type2);
1418 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1419 return (q1 & q2) == q2;
1422 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1423 more cv-qualified that TYPE1, and 0 otherwise. */
1426 comp_cv_qualification (const_tree type1, const_tree type2)
1428 int q1 = cp_type_quals (type1);
1429 int q2 = cp_type_quals (type2);
1434 if ((q1 & q2) == q2)
1436 else if ((q1 & q2) == q1)
1442 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1443 subset of the cv-qualification signature of TYPE2, and the types
1444 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1447 comp_cv_qual_signature (tree type1, tree type2)
1449 if (comp_ptr_ttypes_real (type2, type1, -1))
1451 else if (comp_ptr_ttypes_real (type1, type2, -1))
1457 /* Subroutines of `comptypes'. */
1459 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1460 equivalent in the sense that functions with those parameter types
1461 can have equivalent types. The two lists must be equivalent,
1462 element by element. */
1465 compparms (const_tree parms1, const_tree parms2)
1469 /* An unspecified parmlist matches any specified parmlist
1470 whose argument types don't need default promotions. */
1472 for (t1 = parms1, t2 = parms2;
1474 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1476 /* If one parmlist is shorter than the other,
1477 they fail to match. */
1480 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1487 /* Process a sizeof or alignof expression where the operand is a
1491 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1496 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1497 if (type == error_mark_node)
1498 return error_mark_node;
1500 type = non_reference (type);
1501 if (TREE_CODE (type) == METHOD_TYPE)
1504 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1505 "invalid application of %qs to a member function",
1506 operator_name_info[(int) op].name);
1507 value = size_one_node;
1510 dependent_p = dependent_type_p (type);
1512 complete_type (type);
1514 /* VLA types will have a non-constant size. In the body of an
1515 uninstantiated template, we don't need to try to compute the
1516 value, because the sizeof expression is not an integral
1517 constant expression in that case. And, if we do try to
1518 compute the value, we'll likely end up with SAVE_EXPRs, which
1519 the template substitution machinery does not expect to see. */
1520 || (processing_template_decl
1521 && COMPLETE_TYPE_P (type)
1522 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1524 value = build_min (op, size_type_node, type);
1525 TREE_READONLY (value) = 1;
1529 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1534 /* Return the size of the type, without producing any warnings for
1535 types whose size cannot be taken. This routine should be used only
1536 in some other routine that has already produced a diagnostic about
1537 using the size of such a type. */
1539 cxx_sizeof_nowarn (tree type)
1541 if (TREE_CODE (type) == FUNCTION_TYPE
1542 || TREE_CODE (type) == VOID_TYPE
1543 || TREE_CODE (type) == ERROR_MARK)
1544 return size_one_node;
1545 else if (!COMPLETE_TYPE_P (type))
1546 return size_zero_node;
1548 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1551 /* Process a sizeof expression where the operand is an expression. */
1554 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1556 if (e == error_mark_node)
1557 return error_mark_node;
1559 if (processing_template_decl)
1561 e = build_min (SIZEOF_EXPR, size_type_node, e);
1562 TREE_SIDE_EFFECTS (e) = 0;
1563 TREE_READONLY (e) = 1;
1568 /* To get the size of a static data member declared as an array of
1569 unknown bound, we need to instantiate it. */
1570 if (TREE_CODE (e) == VAR_DECL
1571 && VAR_HAD_UNKNOWN_BOUND (e)
1572 && DECL_TEMPLATE_INSTANTIATION (e))
1573 instantiate_decl (e, /*defer_ok*/true, /*expl_inst_mem*/false);
1575 e = mark_type_use (e);
1577 if (TREE_CODE (e) == COMPONENT_REF
1578 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1579 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1581 if (complain & tf_error)
1582 error ("invalid application of %<sizeof%> to a bit-field");
1584 return error_mark_node;
1587 else if (is_overloaded_fn (e))
1589 if (complain & tf_error)
1590 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1593 return error_mark_node;
1596 else if (type_unknown_p (e))
1598 if (complain & tf_error)
1599 cxx_incomplete_type_error (e, TREE_TYPE (e));
1601 return error_mark_node;
1607 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1610 /* Implement the __alignof keyword: Return the minimum required
1611 alignment of E, measured in bytes. For VAR_DECL's and
1612 FIELD_DECL's return DECL_ALIGN (which can be set from an
1613 "aligned" __attribute__ specification). */
1616 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1620 if (e == error_mark_node)
1621 return error_mark_node;
1623 if (processing_template_decl)
1625 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1626 TREE_SIDE_EFFECTS (e) = 0;
1627 TREE_READONLY (e) = 1;
1632 e = mark_type_use (e);
1634 if (TREE_CODE (e) == VAR_DECL)
1635 t = size_int (DECL_ALIGN_UNIT (e));
1636 else if (TREE_CODE (e) == COMPONENT_REF
1637 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1638 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1640 if (complain & tf_error)
1641 error ("invalid application of %<__alignof%> to a bit-field");
1643 return error_mark_node;
1646 else if (TREE_CODE (e) == COMPONENT_REF
1647 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1648 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1649 else if (is_overloaded_fn (e))
1651 if (complain & tf_error)
1652 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1655 return error_mark_node;
1656 if (TREE_CODE (e) == FUNCTION_DECL)
1657 t = size_int (DECL_ALIGN_UNIT (e));
1661 else if (type_unknown_p (e))
1663 if (complain & tf_error)
1664 cxx_incomplete_type_error (e, TREE_TYPE (e));
1666 return error_mark_node;
1670 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1671 complain & tf_error);
1673 return fold_convert (size_type_node, t);
1676 /* Process a sizeof or alignof expression E with code OP where the operand
1677 is an expression. */
1680 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1682 if (op == SIZEOF_EXPR)
1683 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1685 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1688 /* EXPR is being used in a context that is not a function call.
1693 The expression can be used only as the left-hand operand of a
1694 member function call.
1696 [expr.mptr.operator]
1698 If the result of .* or ->* is a function, then that result can be
1699 used only as the operand for the function call operator ().
1701 by issuing an error message if appropriate. Returns true iff EXPR
1702 violates these rules. */
1705 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1707 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1709 if (complain & tf_error)
1710 error ("invalid use of non-static member function");
1716 /* If EXP is a reference to a bitfield, and the type of EXP does not
1717 match the declared type of the bitfield, return the declared type
1718 of the bitfield. Otherwise, return NULL_TREE. */
1721 is_bitfield_expr_with_lowered_type (const_tree exp)
1723 switch (TREE_CODE (exp))
1726 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1727 ? TREE_OPERAND (exp, 1)
1728 : TREE_OPERAND (exp, 0)))
1730 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1733 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1737 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1743 field = TREE_OPERAND (exp, 1);
1744 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1746 if (same_type_ignoring_top_level_qualifiers_p
1747 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1749 return DECL_BIT_FIELD_TYPE (field);
1753 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1754 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1755 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1763 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1764 bitfield with a lowered type, the type of EXP is returned, rather
1768 unlowered_expr_type (const_tree exp)
1771 tree etype = TREE_TYPE (exp);
1773 type = is_bitfield_expr_with_lowered_type (exp);
1775 type = cp_build_qualified_type (type, cp_type_quals (etype));
1782 /* Perform the conversions in [expr] that apply when an lvalue appears
1783 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1784 function-to-pointer conversions. In addition, manifest constants
1785 are replaced by their values, and bitfield references are converted
1786 to their declared types. Note that this function does not perform the
1787 lvalue-to-rvalue conversion for class types. If you need that conversion
1788 to for class types, then you probably need to use force_rvalue.
1790 Although the returned value is being used as an rvalue, this
1791 function does not wrap the returned expression in a
1792 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1793 that the return value is no longer an lvalue. */
1796 decay_conversion (tree exp)
1799 enum tree_code code;
1801 type = TREE_TYPE (exp);
1802 if (type == error_mark_node)
1803 return error_mark_node;
1805 exp = mark_rvalue_use (exp);
1807 exp = resolve_nondeduced_context (exp);
1808 if (type_unknown_p (exp))
1810 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1811 return error_mark_node;
1814 /* FIXME remove? at least need to remember that this isn't really a
1815 constant expression if EXP isn't decl_constant_var_p, like with
1816 C_MAYBE_CONST_EXPR. */
1817 exp = decl_constant_value (exp);
1818 if (error_operand_p (exp))
1819 return error_mark_node;
1821 if (NULLPTR_TYPE_P (type))
1822 return nullptr_node;
1824 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1825 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1826 code = TREE_CODE (type);
1827 if (code == VOID_TYPE)
1829 error ("void value not ignored as it ought to be");
1830 return error_mark_node;
1832 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1833 return error_mark_node;
1834 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1835 return cp_build_addr_expr (exp, tf_warning_or_error);
1836 if (code == ARRAY_TYPE)
1841 if (TREE_CODE (exp) == INDIRECT_REF)
1842 return build_nop (build_pointer_type (TREE_TYPE (type)),
1843 TREE_OPERAND (exp, 0));
1845 if (TREE_CODE (exp) == COMPOUND_EXPR)
1847 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1848 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1849 TREE_OPERAND (exp, 0), op1);
1853 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1855 error ("invalid use of non-lvalue array");
1856 return error_mark_node;
1859 ptrtype = build_pointer_type (TREE_TYPE (type));
1861 if (TREE_CODE (exp) == VAR_DECL)
1863 if (!cxx_mark_addressable (exp))
1864 return error_mark_node;
1865 adr = build_nop (ptrtype, build_address (exp));
1868 /* This way is better for a COMPONENT_REF since it can
1869 simplify the offset for a component. */
1870 adr = cp_build_addr_expr (exp, tf_warning_or_error);
1871 return cp_convert (ptrtype, adr);
1874 /* If a bitfield is used in a context where integral promotion
1875 applies, then the caller is expected to have used
1876 default_conversion. That function promotes bitfields correctly
1877 before calling this function. At this point, if we have a
1878 bitfield referenced, we may assume that is not subject to
1879 promotion, and that, therefore, the type of the resulting rvalue
1880 is the declared type of the bitfield. */
1881 exp = convert_bitfield_to_declared_type (exp);
1883 /* We do not call rvalue() here because we do not want to wrap EXP
1884 in a NON_LVALUE_EXPR. */
1888 Non-class rvalues always have cv-unqualified types. */
1889 type = TREE_TYPE (exp);
1890 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
1891 exp = build_nop (cv_unqualified (type), exp);
1896 /* Perform preparatory conversions, as part of the "usual arithmetic
1897 conversions". In particular, as per [expr]:
1899 Whenever an lvalue expression appears as an operand of an
1900 operator that expects the rvalue for that operand, the
1901 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1902 standard conversions are applied to convert the expression to an
1905 In addition, we perform integral promotions here, as those are
1906 applied to both operands to a binary operator before determining
1907 what additional conversions should apply. */
1910 default_conversion (tree exp)
1912 /* Check for target-specific promotions. */
1913 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
1915 exp = cp_convert (promoted_type, exp);
1916 /* Perform the integral promotions first so that bitfield
1917 expressions (which may promote to "int", even if the bitfield is
1918 declared "unsigned") are promoted correctly. */
1919 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1920 exp = perform_integral_promotions (exp);
1921 /* Perform the other conversions. */
1922 exp = decay_conversion (exp);
1927 /* EXPR is an expression with an integral or enumeration type.
1928 Perform the integral promotions in [conv.prom], and return the
1932 perform_integral_promotions (tree expr)
1937 expr = mark_rvalue_use (expr);
1941 If the bitfield has an enumerated type, it is treated as any
1942 other value of that type for promotion purposes. */
1943 type = is_bitfield_expr_with_lowered_type (expr);
1944 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
1945 type = TREE_TYPE (expr);
1946 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1947 promoted_type = type_promotes_to (type);
1948 if (type != promoted_type)
1949 expr = cp_convert (promoted_type, expr);
1953 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1954 decay_conversion to one. */
1957 string_conv_p (const_tree totype, const_tree exp, int warn)
1961 if (TREE_CODE (totype) != POINTER_TYPE)
1964 t = TREE_TYPE (totype);
1965 if (!same_type_p (t, char_type_node)
1966 && !same_type_p (t, char16_type_node)
1967 && !same_type_p (t, char32_type_node)
1968 && !same_type_p (t, wchar_type_node))
1971 if (TREE_CODE (exp) == STRING_CST)
1973 /* Make sure that we don't try to convert between char and wide chars. */
1974 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1979 /* Is this a string constant which has decayed to 'const char *'? */
1980 t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
1981 if (!same_type_p (TREE_TYPE (exp), t))
1984 if (TREE_CODE (exp) != ADDR_EXPR
1985 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
1989 /* This warning is not very useful, as it complains about printf. */
1991 warning (OPT_Wwrite_strings,
1992 "deprecated conversion from string constant to %qT",
1998 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1999 can, for example, use as an lvalue. This code used to be in
2000 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2001 expressions, where we're dealing with aggregates. But now it's again only
2002 called from unary_complex_lvalue. The case (in particular) that led to
2003 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2007 rationalize_conditional_expr (enum tree_code code, tree t,
2008 tsubst_flags_t complain)
2010 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2011 the first operand is always the one to be used if both operands
2012 are equal, so we know what conditional expression this used to be. */
2013 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2015 tree op0 = TREE_OPERAND (t, 0);
2016 tree op1 = TREE_OPERAND (t, 1);
2018 /* The following code is incorrect if either operand side-effects. */
2019 gcc_assert (!TREE_SIDE_EFFECTS (op0)
2020 && !TREE_SIDE_EFFECTS (op1));
2022 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
2023 ? LE_EXPR : GE_EXPR),
2024 op0, TREE_CODE (op0),
2025 op1, TREE_CODE (op1),
2026 /*overloaded_p=*/NULL,
2028 cp_build_unary_op (code, op0, 0, complain),
2029 cp_build_unary_op (code, op1, 0, complain),
2034 build_conditional_expr (TREE_OPERAND (t, 0),
2035 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
2037 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
2042 /* Given the TYPE of an anonymous union field inside T, return the
2043 FIELD_DECL for the field. If not found return NULL_TREE. Because
2044 anonymous unions can nest, we must also search all anonymous unions
2045 that are directly reachable. */
2048 lookup_anon_field (tree t, tree type)
2052 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
2054 if (TREE_STATIC (field))
2056 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
2059 /* If we find it directly, return the field. */
2060 if (DECL_NAME (field) == NULL_TREE
2061 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
2066 /* Otherwise, it could be nested, search harder. */
2067 if (DECL_NAME (field) == NULL_TREE
2068 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2070 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2078 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2079 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2080 non-NULL, it indicates the path to the base used to name MEMBER.
2081 If PRESERVE_REFERENCE is true, the expression returned will have
2082 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2083 returned will have the type referred to by the reference.
2085 This function does not perform access control; that is either done
2086 earlier by the parser when the name of MEMBER is resolved to MEMBER
2087 itself, or later when overload resolution selects one of the
2088 functions indicated by MEMBER. */
2091 build_class_member_access_expr (tree object, tree member,
2092 tree access_path, bool preserve_reference,
2093 tsubst_flags_t complain)
2097 tree result = NULL_TREE;
2099 if (error_operand_p (object) || error_operand_p (member))
2100 return error_mark_node;
2102 gcc_assert (DECL_P (member) || BASELINK_P (member));
2106 The type of the first expression shall be "class object" (of a
2108 object_type = TREE_TYPE (object);
2109 if (!currently_open_class (object_type)
2110 && !complete_type_or_maybe_complain (object_type, object, complain))
2111 return error_mark_node;
2112 if (!CLASS_TYPE_P (object_type))
2114 if (complain & tf_error)
2115 error ("request for member %qD in %qE, which is of non-class type %qT",
2116 member, object, object_type);
2117 return error_mark_node;
2120 /* The standard does not seem to actually say that MEMBER must be a
2121 member of OBJECT_TYPE. However, that is clearly what is
2123 if (DECL_P (member))
2125 member_scope = DECL_CLASS_CONTEXT (member);
2127 if (TREE_DEPRECATED (member))
2128 warn_deprecated_use (member, NULL_TREE);
2131 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2132 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2133 presently be the anonymous union. Go outwards until we find a
2134 type related to OBJECT_TYPE. */
2135 while (ANON_AGGR_TYPE_P (member_scope)
2136 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2138 member_scope = TYPE_CONTEXT (member_scope);
2139 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2141 if (complain & tf_error)
2143 if (TREE_CODE (member) == FIELD_DECL)
2144 error ("invalid use of nonstatic data member %qE", member);
2146 error ("%qD is not a member of %qT", member, object_type);
2148 return error_mark_node;
2151 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2152 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2153 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2155 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2157 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2160 /* In [expr.ref], there is an explicit list of the valid choices for
2161 MEMBER. We check for each of those cases here. */
2162 if (TREE_CODE (member) == VAR_DECL)
2164 /* A static data member. */
2166 mark_exp_read (object);
2167 /* If OBJECT has side-effects, they are supposed to occur. */
2168 if (TREE_SIDE_EFFECTS (object))
2169 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2171 else if (TREE_CODE (member) == FIELD_DECL)
2173 /* A non-static data member. */
2178 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2179 && integer_zerop (TREE_OPERAND (object, 0)));
2181 /* Convert OBJECT to the type of MEMBER. */
2182 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2183 TYPE_MAIN_VARIANT (member_scope)))
2188 binfo = lookup_base (access_path ? access_path : object_type,
2189 member_scope, ba_unique, &kind);
2190 if (binfo == error_mark_node)
2191 return error_mark_node;
2193 /* It is invalid to try to get to a virtual base of a
2194 NULL object. The most common cause is invalid use of
2196 if (null_object_p && kind == bk_via_virtual)
2198 if (complain & tf_error)
2200 error ("invalid access to non-static data member %qD of "
2203 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2205 return error_mark_node;
2208 /* Convert to the base. */
2209 object = build_base_path (PLUS_EXPR, object, binfo,
2211 /* If we found the base successfully then we should be able
2212 to convert to it successfully. */
2213 gcc_assert (object != error_mark_node);
2216 /* Complain about other invalid uses of offsetof, even though they will
2217 give the right answer. Note that we complain whether or not they
2218 actually used the offsetof macro, since there's no way to know at this
2219 point. So we just give a warning, instead of a pedwarn. */
2220 /* Do not produce this warning for base class field references, because
2221 we know for a fact that didn't come from offsetof. This does occur
2222 in various testsuite cases where a null object is passed where a
2223 vtable access is required. */
2224 if (null_object_p && warn_invalid_offsetof
2225 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2226 && !DECL_FIELD_IS_BASE (member)
2227 && cp_unevaluated_operand == 0
2228 && (complain & tf_warning))
2230 warning (OPT_Winvalid_offsetof,
2231 "invalid access to non-static data member %qD "
2232 " of NULL object", member);
2233 warning (OPT_Winvalid_offsetof,
2234 "(perhaps the %<offsetof%> macro was used incorrectly)");
2237 /* If MEMBER is from an anonymous aggregate, we have converted
2238 OBJECT so that it refers to the class containing the
2239 anonymous union. Generate a reference to the anonymous union
2240 itself, and recur to find MEMBER. */
2241 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2242 /* When this code is called from build_field_call, the
2243 object already has the type of the anonymous union.
2244 That is because the COMPONENT_REF was already
2245 constructed, and was then disassembled before calling
2246 build_field_call. After the function-call code is
2247 cleaned up, this waste can be eliminated. */
2248 && (!same_type_ignoring_top_level_qualifiers_p
2249 (TREE_TYPE (object), DECL_CONTEXT (member))))
2251 tree anonymous_union;
2253 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2254 DECL_CONTEXT (member));
2255 object = build_class_member_access_expr (object,
2257 /*access_path=*/NULL_TREE,
2262 /* Compute the type of the field, as described in [expr.ref]. */
2263 type_quals = TYPE_UNQUALIFIED;
2264 member_type = TREE_TYPE (member);
2265 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2267 type_quals = (cp_type_quals (member_type)
2268 | cp_type_quals (object_type));
2270 /* A field is const (volatile) if the enclosing object, or the
2271 field itself, is const (volatile). But, a mutable field is
2272 not const, even within a const object. */
2273 if (DECL_MUTABLE_P (member))
2274 type_quals &= ~TYPE_QUAL_CONST;
2275 member_type = cp_build_qualified_type (member_type, type_quals);
2278 result = build3 (COMPONENT_REF, member_type, object, member,
2280 result = fold_if_not_in_template (result);
2282 /* Mark the expression const or volatile, as appropriate. Even
2283 though we've dealt with the type above, we still have to mark the
2284 expression itself. */
2285 if (type_quals & TYPE_QUAL_CONST)
2286 TREE_READONLY (result) = 1;
2287 if (type_quals & TYPE_QUAL_VOLATILE)
2288 TREE_THIS_VOLATILE (result) = 1;
2290 else if (BASELINK_P (member))
2292 /* The member is a (possibly overloaded) member function. */
2296 /* If the MEMBER is exactly one static member function, then we
2297 know the type of the expression. Otherwise, we must wait
2298 until overload resolution has been performed. */
2299 functions = BASELINK_FUNCTIONS (member);
2300 if (TREE_CODE (functions) == FUNCTION_DECL
2301 && DECL_STATIC_FUNCTION_P (functions))
2302 type = TREE_TYPE (functions);
2304 type = unknown_type_node;
2305 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2306 base. That will happen when the function is called. */
2307 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2309 else if (TREE_CODE (member) == CONST_DECL)
2311 /* The member is an enumerator. */
2313 /* If OBJECT has side-effects, they are supposed to occur. */
2314 if (TREE_SIDE_EFFECTS (object))
2315 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2320 if (complain & tf_error)
2321 error ("invalid use of %qD", member);
2322 return error_mark_node;
2325 if (!preserve_reference)
2328 If E2 is declared to have type "reference to T", then ... the
2329 type of E1.E2 is T. */
2330 result = convert_from_reference (result);
2335 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2336 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2339 lookup_destructor (tree object, tree scope, tree dtor_name)
2341 tree object_type = TREE_TYPE (object);
2342 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2345 if (scope && !check_dtor_name (scope, dtor_type))
2347 error ("qualified type %qT does not match destructor name ~%qT",
2349 return error_mark_node;
2351 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2353 /* In a template, names we can't find a match for are still accepted
2354 destructor names, and we check them here. */
2355 if (check_dtor_name (object_type, dtor_type))
2356 dtor_type = object_type;
2359 error ("object type %qT does not match destructor name ~%qT",
2360 object_type, dtor_type);
2361 return error_mark_node;
2365 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2367 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2368 TYPE_MAIN_VARIANT (object_type), dtor_type);
2369 return error_mark_node;
2371 expr = lookup_member (dtor_type, complete_dtor_identifier,
2372 /*protect=*/1, /*want_type=*/false);
2373 expr = (adjust_result_of_qualified_name_lookup
2374 (expr, dtor_type, object_type));
2378 /* An expression of the form "A::template B" has been resolved to
2379 DECL. Issue a diagnostic if B is not a template or template
2383 check_template_keyword (tree decl)
2385 /* The standard says:
2389 If a name prefixed by the keyword template is not a member
2390 template, the program is ill-formed.
2392 DR 228 removed the restriction that the template be a member
2395 DR 96, if accepted would add the further restriction that explicit
2396 template arguments must be provided if the template keyword is
2397 used, but, as of 2005-10-16, that DR is still in "drafting". If
2398 this DR is accepted, then the semantic checks here can be
2399 simplified, as the entity named must in fact be a template
2400 specialization, rather than, as at present, a set of overloaded
2401 functions containing at least one template function. */
2402 if (TREE_CODE (decl) != TEMPLATE_DECL
2403 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2405 if (!is_overloaded_fn (decl))
2406 permerror (input_location, "%qD is not a template", decl);
2411 if (BASELINK_P (fns))
2412 fns = BASELINK_FUNCTIONS (fns);
2415 tree fn = OVL_CURRENT (fns);
2416 if (TREE_CODE (fn) == TEMPLATE_DECL
2417 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2419 if (TREE_CODE (fn) == FUNCTION_DECL
2420 && DECL_USE_TEMPLATE (fn)
2421 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2423 fns = OVL_NEXT (fns);
2426 permerror (input_location, "%qD is not a template", decl);
2431 /* This function is called by the parser to process a class member
2432 access expression of the form OBJECT.NAME. NAME is a node used by
2433 the parser to represent a name; it is not yet a DECL. It may,
2434 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2435 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2436 there is no reason to do the lookup twice, so the parser keeps the
2437 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2438 be a template via the use of the "A::template B" syntax. */
2441 finish_class_member_access_expr (tree object, tree name, bool template_p,
2442 tsubst_flags_t complain)
2447 tree access_path = NULL_TREE;
2448 tree orig_object = object;
2449 tree orig_name = name;
2451 if (object == error_mark_node || name == error_mark_node)
2452 return error_mark_node;
2454 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2455 if (!objc_is_public (object, name))
2456 return error_mark_node;
2458 object_type = TREE_TYPE (object);
2460 if (processing_template_decl)
2462 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2463 dependent_type_p (object_type)
2464 /* If NAME is just an IDENTIFIER_NODE, then the expression
2466 || TREE_CODE (object) == IDENTIFIER_NODE
2467 /* If NAME is "f<args>", where either 'f' or 'args' is
2468 dependent, then the expression is dependent. */
2469 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2470 && dependent_template_id_p (TREE_OPERAND (name, 0),
2471 TREE_OPERAND (name, 1)))
2472 /* If NAME is "T::X" where "T" is dependent, then the
2473 expression is dependent. */
2474 || (TREE_CODE (name) == SCOPE_REF
2475 && TYPE_P (TREE_OPERAND (name, 0))
2476 && dependent_type_p (TREE_OPERAND (name, 0))))
2477 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2478 object = build_non_dependent_expr (object);
2480 else if (c_dialect_objc ()
2481 && TREE_CODE (name) == IDENTIFIER_NODE
2482 && (expr = objc_maybe_build_component_ref (object, name)))
2487 The type of the first expression shall be "class object" (of a
2489 if (!currently_open_class (object_type)
2490 && !complete_type_or_maybe_complain (object_type, object, complain))
2491 return error_mark_node;
2492 if (!CLASS_TYPE_P (object_type))
2494 if (complain & tf_error)
2495 error ("request for member %qD in %qE, which is of non-class type %qT",
2496 name, object, object_type);
2497 return error_mark_node;
2500 if (BASELINK_P (name))
2501 /* A member function that has already been looked up. */
2505 bool is_template_id = false;
2506 tree template_args = NULL_TREE;
2509 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2511 is_template_id = true;
2512 template_args = TREE_OPERAND (name, 1);
2513 name = TREE_OPERAND (name, 0);
2515 if (TREE_CODE (name) == OVERLOAD)
2516 name = DECL_NAME (get_first_fn (name));
2517 else if (DECL_P (name))
2518 name = DECL_NAME (name);
2521 if (TREE_CODE (name) == SCOPE_REF)
2523 /* A qualified name. The qualifying class or namespace `S'
2524 has already been looked up; it is either a TYPE or a
2526 scope = TREE_OPERAND (name, 0);
2527 name = TREE_OPERAND (name, 1);
2529 /* If SCOPE is a namespace, then the qualified name does not
2530 name a member of OBJECT_TYPE. */
2531 if (TREE_CODE (scope) == NAMESPACE_DECL)
2533 if (complain & tf_error)
2534 error ("%<%D::%D%> is not a member of %qT",
2535 scope, name, object_type);
2536 return error_mark_node;
2539 gcc_assert (CLASS_TYPE_P (scope));
2540 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2541 || TREE_CODE (name) == BIT_NOT_EXPR);
2543 if (constructor_name_p (name, scope))
2545 if (complain & tf_error)
2546 error ("cannot call constructor %<%T::%D%> directly",
2548 return error_mark_node;
2551 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2552 access_path = lookup_base (object_type, scope, ba_check, NULL);
2553 if (access_path == error_mark_node)
2554 return error_mark_node;
2557 if (complain & tf_error)
2558 error ("%qT is not a base of %qT", scope, object_type);
2559 return error_mark_node;
2565 access_path = object_type;
2568 if (TREE_CODE (name) == BIT_NOT_EXPR)
2569 member = lookup_destructor (object, scope, name);
2572 /* Look up the member. */
2573 member = lookup_member (access_path, name, /*protect=*/1,
2574 /*want_type=*/false);
2575 if (member == NULL_TREE)
2577 if (complain & tf_error)
2578 error ("%qD has no member named %qE", object_type, name);
2579 return error_mark_node;
2581 if (member == error_mark_node)
2582 return error_mark_node;
2587 tree templ = member;
2589 if (BASELINK_P (templ))
2590 templ = lookup_template_function (templ, template_args);
2593 if (complain & tf_error)
2594 error ("%qD is not a member template function", name);
2595 return error_mark_node;
2600 if (TREE_DEPRECATED (member))
2601 warn_deprecated_use (member, NULL_TREE);
2604 check_template_keyword (member);
2606 expr = build_class_member_access_expr (object, member, access_path,
2607 /*preserve_reference=*/false,
2609 if (processing_template_decl && expr != error_mark_node)
2611 if (BASELINK_P (member))
2613 if (TREE_CODE (orig_name) == SCOPE_REF)
2614 BASELINK_QUALIFIED_P (member) = 1;
2617 return build_min_non_dep (COMPONENT_REF, expr,
2618 orig_object, orig_name,
2625 /* Return an expression for the MEMBER_NAME field in the internal
2626 representation of PTRMEM, a pointer-to-member function. (Each
2627 pointer-to-member function type gets its own RECORD_TYPE so it is
2628 more convenient to access the fields by name than by FIELD_DECL.)
2629 This routine converts the NAME to a FIELD_DECL and then creates the
2630 node for the complete expression. */
2633 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2639 /* This code is a stripped down version of
2640 build_class_member_access_expr. It does not work to use that
2641 routine directly because it expects the object to be of class
2643 ptrmem_type = TREE_TYPE (ptrmem);
2644 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2645 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2646 /*want_type=*/false);
2647 member_type = cp_build_qualified_type (TREE_TYPE (member),
2648 cp_type_quals (ptrmem_type));
2649 return fold_build3_loc (input_location,
2650 COMPONENT_REF, member_type,
2651 ptrmem, member, NULL_TREE);
2654 /* Given an expression PTR for a pointer, return an expression
2655 for the value pointed to.
2656 ERRORSTRING is the name of the operator to appear in error messages.
2658 This function may need to overload OPERATOR_FNNAME.
2659 Must also handle REFERENCE_TYPEs for C++. */
2662 build_x_indirect_ref (tree expr, ref_operator errorstring,
2663 tsubst_flags_t complain)
2665 tree orig_expr = expr;
2668 if (processing_template_decl)
2670 /* Retain the type if we know the operand is a pointer so that
2671 describable_type doesn't make auto deduction break. */
2672 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2673 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2674 if (type_dependent_expression_p (expr))
2675 return build_min_nt (INDIRECT_REF, expr);
2676 expr = build_non_dependent_expr (expr);
2679 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2680 NULL_TREE, /*overloaded_p=*/NULL, complain);
2682 rval = cp_build_indirect_ref (expr, errorstring, complain);
2684 if (processing_template_decl && rval != error_mark_node)
2685 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2690 /* Helper function called from c-common. */
2692 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2693 tree ptr, ref_operator errorstring)
2695 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2699 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2700 tsubst_flags_t complain)
2704 if (ptr == error_mark_node)
2705 return error_mark_node;
2707 if (ptr == current_class_ptr)
2708 return current_class_ref;
2710 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2711 ? ptr : decay_conversion (ptr));
2712 type = TREE_TYPE (pointer);
2714 if (POINTER_TYPE_P (type))
2718 If the type of the expression is "pointer to T," the type
2719 of the result is "T." */
2720 tree t = TREE_TYPE (type);
2722 if (CONVERT_EXPR_P (ptr)
2723 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2725 /* If a warning is issued, mark it to avoid duplicates from
2726 the backend. This only needs to be done at
2727 warn_strict_aliasing > 2. */
2728 if (warn_strict_aliasing > 2)
2729 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2730 type, TREE_OPERAND (ptr, 0)))
2731 TREE_NO_WARNING (ptr) = 1;
2734 if (VOID_TYPE_P (t))
2736 /* A pointer to incomplete type (other than cv void) can be
2737 dereferenced [expr.unary.op]/1 */
2738 if (complain & tf_error)
2739 error ("%qT is not a pointer-to-object type", type);
2740 return error_mark_node;
2742 else if (TREE_CODE (pointer) == ADDR_EXPR
2743 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2744 /* The POINTER was something like `&x'. We simplify `*&x' to
2746 return TREE_OPERAND (pointer, 0);
2749 tree ref = build1 (INDIRECT_REF, t, pointer);
2751 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2752 so that we get the proper error message if the result is used
2753 to assign to. Also, &* is supposed to be a no-op. */
2754 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2755 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2756 TREE_SIDE_EFFECTS (ref)
2757 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2761 else if (!(complain & tf_error))
2762 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2764 /* `pointer' won't be an error_mark_node if we were given a
2765 pointer to member, so it's cool to check for this here. */
2766 else if (TYPE_PTR_TO_MEMBER_P (type))
2767 switch (errorstring)
2769 case RO_ARRAY_INDEXING:
2770 error ("invalid use of array indexing on pointer to member");
2773 error ("invalid use of unary %<*%> on pointer to member");
2775 case RO_IMPLICIT_CONVERSION:
2776 error ("invalid use of implicit conversion on pointer to member");
2781 else if (pointer != error_mark_node)
2782 invalid_indirection_error (input_location, type, errorstring);
2784 return error_mark_node;
2787 /* This handles expressions of the form "a[i]", which denotes
2790 This is logically equivalent in C to *(a+i), but we may do it differently.
2791 If A is a variable or a member, we generate a primitive ARRAY_REF.
2792 This avoids forcing the array out of registers, and can work on
2793 arrays that are not lvalues (for example, members of structures returned
2796 If INDEX is of some user-defined type, it must be converted to
2797 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2798 will inherit the type of the array, which will be some pointer type.
2800 LOC is the location to use in building the array reference. */
2803 cp_build_array_ref (location_t loc, tree array, tree idx,
2804 tsubst_flags_t complain)
2810 if (complain & tf_error)
2811 error_at (loc, "subscript missing in array reference");
2812 return error_mark_node;
2815 if (TREE_TYPE (array) == error_mark_node
2816 || TREE_TYPE (idx) == error_mark_node)
2817 return error_mark_node;
2819 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2821 switch (TREE_CODE (array))
2825 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2827 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2828 TREE_OPERAND (array, 0), value);
2829 SET_EXPR_LOCATION (ret, loc);
2834 ret = build_conditional_expr
2835 (TREE_OPERAND (array, 0),
2836 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2838 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
2840 tf_warning_or_error);
2841 protected_set_expr_location (ret, loc);
2848 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2852 warn_array_subscript_with_type_char (idx);
2854 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2856 if (complain & tf_error)
2857 error_at (loc, "array subscript is not an integer");
2858 return error_mark_node;
2861 /* Apply integral promotions *after* noticing character types.
2862 (It is unclear why we do these promotions -- the standard
2863 does not say that we should. In fact, the natural thing would
2864 seem to be to convert IDX to ptrdiff_t; we're performing
2865 pointer arithmetic.) */
2866 idx = perform_integral_promotions (idx);
2868 /* An array that is indexed by a non-constant
2869 cannot be stored in a register; we must be able to do
2870 address arithmetic on its address.
2871 Likewise an array of elements of variable size. */
2872 if (TREE_CODE (idx) != INTEGER_CST
2873 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2874 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2877 if (!cxx_mark_addressable (array))
2878 return error_mark_node;
2881 /* An array that is indexed by a constant value which is not within
2882 the array bounds cannot be stored in a register either; because we
2883 would get a crash in store_bit_field/extract_bit_field when trying
2884 to access a non-existent part of the register. */
2885 if (TREE_CODE (idx) == INTEGER_CST
2886 && TYPE_DOMAIN (TREE_TYPE (array))
2887 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2889 if (!cxx_mark_addressable (array))
2890 return error_mark_node;
2893 if (!lvalue_p (array) && (complain & tf_error))
2894 pedwarn (loc, OPT_pedantic,
2895 "ISO C++ forbids subscripting non-lvalue array");
2897 /* Note in C++ it is valid to subscript a `register' array, since
2898 it is valid to take the address of something with that
2899 storage specification. */
2903 while (TREE_CODE (foo) == COMPONENT_REF)
2904 foo = TREE_OPERAND (foo, 0);
2905 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)
2906 && (complain & tf_warning))
2907 warning_at (loc, OPT_Wextra,
2908 "subscripting array declared %<register%>");
2911 type = TREE_TYPE (TREE_TYPE (array));
2912 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2913 /* Array ref is const/volatile if the array elements are
2914 or if the array is.. */
2915 TREE_READONLY (rval)
2916 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2917 TREE_SIDE_EFFECTS (rval)
2918 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2919 TREE_THIS_VOLATILE (rval)
2920 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2921 ret = require_complete_type_sfinae (fold_if_not_in_template (rval),
2923 protected_set_expr_location (ret, loc);
2928 tree ar = default_conversion (array);
2929 tree ind = default_conversion (idx);
2931 /* Put the integer in IND to simplify error checking. */
2932 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2939 if (ar == error_mark_node)
2942 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2944 if (complain & tf_error)
2945 error_at (loc, "subscripted value is neither array nor pointer");
2946 return error_mark_node;
2948 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2950 if (complain & tf_error)
2951 error_at (loc, "array subscript is not an integer");
2952 return error_mark_node;
2955 warn_array_subscript_with_type_char (idx);
2957 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
2962 protected_set_expr_location (ret, loc);
2967 /* Entry point for Obj-C++. */
2970 build_array_ref (location_t loc, tree array, tree idx)
2972 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
2975 /* Resolve a pointer to member function. INSTANCE is the object
2976 instance to use, if the member points to a virtual member.
2978 This used to avoid checking for virtual functions if basetype
2979 has no virtual functions, according to an earlier ANSI draft.
2980 With the final ISO C++ rules, such an optimization is
2981 incorrect: A pointer to a derived member can be static_cast
2982 to pointer-to-base-member, as long as the dynamic object
2983 later has the right member. */
2986 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
2988 if (TREE_CODE (function) == OFFSET_REF)
2989 function = TREE_OPERAND (function, 1);
2991 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2993 tree idx, delta, e1, e2, e3, vtbl, basetype;
2994 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2996 tree instance_ptr = *instance_ptrptr;
2997 tree instance_save_expr = 0;
2998 if (instance_ptr == error_mark_node)
3000 if (TREE_CODE (function) == PTRMEM_CST)
3002 /* Extracting the function address from a pmf is only
3003 allowed with -Wno-pmf-conversions. It only works for
3005 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
3006 e1 = convert (fntype, e1);
3011 error ("object missing in use of %qE", function);
3012 return error_mark_node;
3016 if (TREE_SIDE_EFFECTS (instance_ptr))
3017 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3019 if (TREE_SIDE_EFFECTS (function))
3020 function = save_expr (function);
3022 /* Start by extracting all the information from the PMF itself. */
3023 e3 = pfn_from_ptrmemfunc (function);
3024 delta = delta_from_ptrmemfunc (function);
3025 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3026 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3028 case ptrmemfunc_vbit_in_pfn:
3029 e1 = cp_build_binary_op (input_location,
3030 BIT_AND_EXPR, idx, integer_one_node,
3031 tf_warning_or_error);
3032 idx = cp_build_binary_op (input_location,
3033 MINUS_EXPR, idx, integer_one_node,
3034 tf_warning_or_error);
3037 case ptrmemfunc_vbit_in_delta:
3038 e1 = cp_build_binary_op (input_location,
3039 BIT_AND_EXPR, delta, integer_one_node,
3040 tf_warning_or_error);
3041 delta = cp_build_binary_op (input_location,
3042 RSHIFT_EXPR, delta, integer_one_node,
3043 tf_warning_or_error);
3050 /* Convert down to the right base before using the instance. A
3051 special case is that in a pointer to member of class C, C may
3052 be incomplete. In that case, the function will of course be
3053 a member of C, and no conversion is required. In fact,
3054 lookup_base will fail in that case, because incomplete
3055 classes do not have BINFOs. */
3056 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3057 if (!same_type_ignoring_top_level_qualifiers_p
3058 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3060 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3061 basetype, ba_check, NULL);
3062 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3064 if (instance_ptr == error_mark_node)
3065 return error_mark_node;
3067 /* ...and then the delta in the PMF. */
3068 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
3069 instance_ptr, fold_convert (sizetype, delta));
3071 /* Hand back the adjusted 'this' argument to our caller. */
3072 *instance_ptrptr = instance_ptr;
3074 /* Next extract the vtable pointer from the object. */
3075 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3077 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, tf_warning_or_error);
3078 /* If the object is not dynamic the access invokes undefined
3079 behavior. As it is not executed in this case silence the
3080 spurious warnings it may provoke. */
3081 TREE_NO_WARNING (vtbl) = 1;
3083 /* Finally, extract the function pointer from the vtable. */
3084 e2 = fold_build2_loc (input_location,
3085 POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
3086 fold_convert (sizetype, idx));
3087 e2 = cp_build_indirect_ref (e2, RO_NULL, tf_warning_or_error);
3088 TREE_CONSTANT (e2) = 1;
3090 /* When using function descriptors, the address of the
3091 vtable entry is treated as a function pointer. */
3092 if (TARGET_VTABLE_USES_DESCRIPTORS)
3093 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3094 cp_build_addr_expr (e2, tf_warning_or_error));
3096 e2 = fold_convert (TREE_TYPE (e3), e2);
3097 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
3099 /* Make sure this doesn't get evaluated first inside one of the
3100 branches of the COND_EXPR. */
3101 if (instance_save_expr)
3102 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3103 instance_save_expr, e1);
3110 /* Used by the C-common bits. */
3112 build_function_call (location_t loc ATTRIBUTE_UNUSED,
3113 tree function, tree params)
3115 return cp_build_function_call (function, params, tf_warning_or_error);
3118 /* Used by the C-common bits. */
3120 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
3121 tree function, VEC(tree,gc) *params,
3122 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
3124 VEC(tree,gc) *orig_params = params;
3125 tree ret = cp_build_function_call_vec (function, ¶ms,
3126 tf_warning_or_error);
3128 /* cp_build_function_call_vec can reallocate PARAMS by adding
3129 default arguments. That should never happen here. Verify
3131 gcc_assert (params == orig_params);
3136 /* Build a function call using a tree list of arguments. */
3139 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3144 vec = make_tree_vector ();
3145 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3146 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3147 ret = cp_build_function_call_vec (function, &vec, complain);
3148 release_tree_vector (vec);
3152 /* Build a function call using varargs. */
3155 cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
3161 vec = make_tree_vector ();
3162 va_start (args, complain);
3163 for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
3164 VEC_safe_push (tree, gc, vec, t);
3166 ret = cp_build_function_call_vec (function, &vec, complain);
3167 release_tree_vector (vec);
3171 /* Build a function call using a vector of arguments. PARAMS may be
3172 NULL if there are no parameters. This changes the contents of
3176 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3177 tsubst_flags_t complain)
3179 tree fntype, fndecl;
3181 tree original = function;
3185 VEC(tree,gc) *allocated = NULL;
3188 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3189 expressions, like those used for ObjC messenger dispatches. */
3190 if (params != NULL && !VEC_empty (tree, *params))
3191 function = objc_rewrite_function_call (function,
3192 VEC_index (tree, *params, 0));
3194 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3195 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3196 if (TREE_CODE (function) == NOP_EXPR
3197 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3198 function = TREE_OPERAND (function, 0);
3200 if (TREE_CODE (function) == FUNCTION_DECL)
3202 mark_used (function);
3205 /* Convert anything with function type to a pointer-to-function. */
3206 if (DECL_MAIN_P (function) && (complain & tf_error))
3207 pedwarn (input_location, OPT_pedantic,
3208 "ISO C++ forbids calling %<::main%> from within program");
3210 function = build_addr_func (function);
3216 function = build_addr_func (function);
3219 if (function == error_mark_node)
3220 return error_mark_node;
3222 fntype = TREE_TYPE (function);
3224 if (TYPE_PTRMEMFUNC_P (fntype))
3226 if (complain & tf_error)
3227 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3228 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3229 original, original);
3230 return error_mark_node;
3233 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3234 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3236 if (!((TREE_CODE (fntype) == POINTER_TYPE
3237 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3239 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3241 if (complain & tf_error)
3242 error ("%qE cannot be used as a function", original);
3243 return error_mark_node;
3246 /* fntype now gets the type of function pointed to. */
3247 fntype = TREE_TYPE (fntype);
3248 parm_types = TYPE_ARG_TYPES (fntype);
3252 allocated = make_tree_vector ();
3253 params = &allocated;
3256 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3259 return error_mark_node;
3261 argarray = VEC_address (tree, *params);
3263 /* Check for errors in format strings and inappropriately
3265 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
3268 ret = build_cxx_call (function, nargs, argarray);
3270 if (allocated != NULL)
3271 release_tree_vector (allocated);
3276 /* Subroutine of convert_arguments.
3277 Warn about wrong number of args are genereted. */
3280 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3284 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3286 if (DECL_NAME (fndecl) == NULL_TREE
3287 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3290 ? G_("too many arguments to constructor %q#D")
3291 : G_("too few arguments to constructor %q#D"),
3296 ? G_("too many arguments to member function %q#D")
3297 : G_("too few arguments to member function %q#D"),
3303 ? G_("too many arguments to function %q#D")
3304 : G_("too few arguments to function %q#D"),
3306 inform (DECL_SOURCE_LOCATION (fndecl),
3311 if (c_dialect_objc () && objc_message_selector ())
3314 ? G_("too many arguments to method %q#D")
3315 : G_("too few arguments to method %q#D"),
3316 objc_message_selector ());
3318 error_at (loc, too_many_p ? G_("too many arguments to function")
3319 : G_("too few arguments to function"));
3323 /* Convert the actual parameter expressions in the list VALUES to the
3324 types in the list TYPELIST. The converted expressions are stored
3325 back in the VALUES vector.
3326 If parmdecls is exhausted, or when an element has NULL as its type,
3327 perform the default conversions.
3329 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3331 This is also where warnings about wrong number of args are generated.
3333 Returns the actual number of arguments processed (which might be less
3334 than the length of the vector), or -1 on error.
3336 In C++, unspecified trailing parameters can be filled in with their
3337 default arguments, if such were specified. Do so here. */
3340 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3341 int flags, tsubst_flags_t complain)
3346 /* Argument passing is always copy-initialization. */
3347 flags |= LOOKUP_ONLYCONVERTING;
3349 for (i = 0, typetail = typelist;
3350 i < VEC_length (tree, *values);
3353 tree type = typetail ? TREE_VALUE (typetail) : 0;
3354 tree val = VEC_index (tree, *values, i);
3356 if (val == error_mark_node || type == error_mark_node)
3359 if (type == void_type_node)
3361 if (complain & tf_error)
3363 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3370 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3371 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3372 if (TREE_CODE (val) == NOP_EXPR
3373 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3374 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3375 val = TREE_OPERAND (val, 0);
3377 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3379 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3380 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3381 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3382 val = decay_conversion (val);
3385 if (val == error_mark_node)
3390 /* Formal parm type is specified by a function prototype. */
3393 if (!COMPLETE_TYPE_P (complete_type (type)))
3395 if (complain & tf_error)
3398 error ("parameter %P of %qD has incomplete type %qT",
3401 error ("parameter %P has incomplete type %qT", i, type);
3403 parmval = error_mark_node;
3407 parmval = convert_for_initialization
3408 (NULL_TREE, type, val, flags,
3409 ICR_ARGPASS, fndecl, i, complain);
3410 parmval = convert_for_arg_passing (type, parmval);
3413 if (parmval == error_mark_node)
3416 VEC_replace (tree, *values, i, parmval);
3420 if (fndecl && DECL_BUILT_IN (fndecl)
3421 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3422 /* Don't do ellipsis conversion for __built_in_constant_p
3423 as this will result in spurious errors for non-trivial
3425 val = require_complete_type_sfinae (val, complain);
3427 val = convert_arg_to_ellipsis (val);
3429 VEC_replace (tree, *values, i, val);
3433 typetail = TREE_CHAIN (typetail);
3436 if (typetail != 0 && typetail != void_list_node)
3438 /* See if there are default arguments that can be used. Because
3439 we hold default arguments in the FUNCTION_TYPE (which is so
3440 wrong), we can see default parameters here from deduced
3441 contexts (and via typeof) for indirect function calls.
3442 Fortunately we know whether we have a function decl to
3443 provide default arguments in a language conformant
3445 if (fndecl && TREE_PURPOSE (typetail)
3446 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3448 for (; typetail != void_list_node; ++i)
3451 = convert_default_arg (TREE_VALUE (typetail),
3452 TREE_PURPOSE (typetail),
3455 if (parmval == error_mark_node)
3458 VEC_safe_push (tree, gc, *values, parmval);
3459 typetail = TREE_CHAIN (typetail);
3460 /* ends with `...'. */
3461 if (typetail == NULL_TREE)
3467 if (complain & tf_error)
3468 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3476 /* Build a binary-operation expression, after performing default
3477 conversions on the operands. CODE is the kind of expression to
3478 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3479 are the tree codes which correspond to ARG1 and ARG2 when issuing
3480 warnings about possibly misplaced parentheses. They may differ
3481 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3482 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3483 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3484 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3485 ARG2_CODE as ERROR_MARK. */
3488 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3489 tree arg2, enum tree_code arg2_code, bool *overloaded_p,
3490 tsubst_flags_t complain)
3499 if (processing_template_decl)
3501 if (type_dependent_expression_p (arg1)
3502 || type_dependent_expression_p (arg2))
3503 return build_min_nt (code, arg1, arg2);
3504 arg1 = build_non_dependent_expr (arg1);
3505 arg2 = build_non_dependent_expr (arg2);
3508 if (code == DOTSTAR_EXPR)
3509 expr = build_m_component_ref (arg1, arg2);
3511 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3512 overloaded_p, complain);
3514 /* Check for cases such as x+y<<z which users are likely to
3515 misinterpret. But don't warn about obj << x + y, since that is a
3516 common idiom for I/O. */
3517 if (warn_parentheses
3518 && (complain & tf_warning)
3519 && !processing_template_decl
3520 && !error_operand_p (arg1)
3521 && !error_operand_p (arg2)
3522 && (code != LSHIFT_EXPR
3523 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3524 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3526 if (processing_template_decl && expr != error_mark_node)
3527 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3532 /* Build and return an ARRAY_REF expression. */
3535 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3537 tree orig_arg1 = arg1;
3538 tree orig_arg2 = arg2;
3541 if (processing_template_decl)
3543 if (type_dependent_expression_p (arg1)
3544 || type_dependent_expression_p (arg2))
3545 return build_min_nt (ARRAY_REF, arg1, arg2,
3546 NULL_TREE, NULL_TREE);
3547 arg1 = build_non_dependent_expr (arg1);
3548 arg2 = build_non_dependent_expr (arg2);
3551 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3552 /*overloaded_p=*/NULL, complain);
3554 if (processing_template_decl && expr != error_mark_node)
3555 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3556 NULL_TREE, NULL_TREE);
3560 /* For the c-common bits. */
3562 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3563 int convert_p ATTRIBUTE_UNUSED)
3565 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3569 /* Build a binary-operation expression without default conversions.
3570 CODE is the kind of expression to build.
3571 LOCATION is the location_t of the operator in the source code.
3572 This function differs from `build' in several ways:
3573 the data type of the result is computed and recorded in it,
3574 warnings are generated if arg data types are invalid,
3575 special handling for addition and subtraction of pointers is known,
3576 and some optimization is done (operations on narrow ints
3577 are done in the narrower type when that gives the same result).
3578 Constant folding is also done before the result is returned.
3580 Note that the operands will never have enumeral types
3581 because either they have just had the default conversions performed
3582 or they have both just been converted to some other type in which
3583 the arithmetic is to be done.
3585 C++: must do special pointer arithmetic when implementing
3586 multiple inheritance, and deal with pointer to member functions. */
3589 cp_build_binary_op (location_t location,
3590 enum tree_code code, tree orig_op0, tree orig_op1,
3591 tsubst_flags_t complain)
3594 enum tree_code code0, code1;
3596 const char *invalid_op_diag;
3598 /* Expression code to give to the expression when it is built.
3599 Normally this is CODE, which is what the caller asked for,
3600 but in some special cases we change it. */
3601 enum tree_code resultcode = code;
3603 /* Data type in which the computation is to be performed.
3604 In the simplest cases this is the common type of the arguments. */
3605 tree result_type = NULL;
3607 /* Nonzero means operands have already been type-converted
3608 in whatever way is necessary.
3609 Zero means they need to be converted to RESULT_TYPE. */
3612 /* Nonzero means create the expression with this type, rather than
3614 tree build_type = 0;
3616 /* Nonzero means after finally constructing the expression
3617 convert it to this type. */
3618 tree final_type = 0;
3622 /* Nonzero if this is an operation like MIN or MAX which can
3623 safely be computed in short if both args are promoted shorts.
3624 Also implies COMMON.
3625 -1 indicates a bitwise operation; this makes a difference
3626 in the exact conditions for when it is safe to do the operation
3627 in a narrower mode. */
3630 /* Nonzero if this is a comparison operation;
3631 if both args are promoted shorts, compare the original shorts.
3632 Also implies COMMON. */
3633 int short_compare = 0;
3635 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3638 /* True if both operands have arithmetic type. */
3639 bool arithmetic_types_p;
3641 /* Apply default conversions. */
3645 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3646 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3647 || code == TRUTH_XOR_EXPR)
3649 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3650 op0 = decay_conversion (op0);
3651 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3652 op1 = decay_conversion (op1);
3656 if (!really_overloaded_fn (op0) && !VOID_TYPE_P (TREE_TYPE (op0)))
3657 op0 = default_conversion (op0);
3658 if (!really_overloaded_fn (op1) && !VOID_TYPE_P (TREE_TYPE (op1)))
3659 op1 = default_conversion (op1);
3662 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3663 STRIP_TYPE_NOPS (op0);
3664 STRIP_TYPE_NOPS (op1);
3666 /* DTRT if one side is an overloaded function, but complain about it. */
3667 if (type_unknown_p (op0))
3669 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3670 if (t != error_mark_node)
3672 if (complain & tf_error)
3673 permerror (input_location, "assuming cast to type %qT from overloaded function",
3678 if (type_unknown_p (op1))
3680 tree t = instantiate_type (TREE_TYPE (op0), op1, 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",
3690 type0 = TREE_TYPE (op0);
3691 type1 = TREE_TYPE (op1);
3693 /* The expression codes of the data types of the arguments tell us
3694 whether the arguments are integers, floating, pointers, etc. */
3695 code0 = TREE_CODE (type0);
3696 code1 = TREE_CODE (type1);
3698 /* If an error was already reported for one of the arguments,
3699 avoid reporting another error. */
3700 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3701 return error_mark_node;
3703 if ((invalid_op_diag
3704 = targetm.invalid_binary_op (code, type0, type1)))
3706 error (invalid_op_diag);
3707 return error_mark_node;
3710 /* Issue warnings about peculiar, but valid, uses of NULL. */
3711 if ((orig_op0 == null_node || orig_op1 == null_node)
3712 /* It's reasonable to use pointer values as operands of &&
3713 and ||, so NULL is no exception. */
3714 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3715 && ( /* Both are NULL (or 0) and the operation was not a
3716 comparison or a pointer subtraction. */
3717 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3718 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3719 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3720 || (!null_ptr_cst_p (orig_op0)
3721 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3722 || (!null_ptr_cst_p (orig_op1)
3723 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3724 && (complain & tf_warning))
3725 /* Some sort of arithmetic operation involving NULL was
3727 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3732 /* Subtraction of two similar pointers.
3733 We must subtract them as integers, then divide by object size. */
3734 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3735 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3737 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3738 /* In all other cases except pointer - int, the usual arithmetic
3740 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3745 /* The pointer - int case is just like pointer + int; fall
3748 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3749 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3753 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3754 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3755 if (processing_template_decl)
3757 result_type = TREE_TYPE (ptr_operand);
3760 return cp_pointer_int_sum (code,
3771 case TRUNC_DIV_EXPR:
3773 case FLOOR_DIV_EXPR:
3774 case ROUND_DIV_EXPR:
3775 case EXACT_DIV_EXPR:
3776 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3777 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3778 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3779 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3781 enum tree_code tcode0 = code0, tcode1 = code1;
3783 warn_for_div_by_zero (location, op1);
3785 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3786 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3787 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3788 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3790 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3791 resultcode = RDIV_EXPR;
3793 /* When dividing two signed integers, we have to promote to int.
3794 unless we divide by a constant != -1. Note that default
3795 conversion will have been performed on the operands at this
3796 point, so we have to dig out the original type to find out if
3798 shorten = ((TREE_CODE (op0) == NOP_EXPR
3799 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3800 || (TREE_CODE (op1) == INTEGER_CST
3801 && ! integer_all_onesp (op1)));
3810 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3811 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3812 && !VECTOR_FLOAT_TYPE_P (type0)
3813 && !VECTOR_FLOAT_TYPE_P (type1)))
3817 case TRUNC_MOD_EXPR:
3818 case FLOOR_MOD_EXPR:
3819 warn_for_div_by_zero (location, op1);
3821 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3822 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3823 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3825 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3827 /* Although it would be tempting to shorten always here, that loses
3828 on some targets, since the modulo instruction is undefined if the
3829 quotient can't be represented in the computation mode. We shorten
3830 only if unsigned or if dividing by something we know != -1. */
3831 shorten = ((TREE_CODE (op0) == NOP_EXPR
3832 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3833 || (TREE_CODE (op1) == INTEGER_CST
3834 && ! integer_all_onesp (op1)));
3839 case TRUTH_ANDIF_EXPR:
3840 case TRUTH_ORIF_EXPR:
3841 case TRUTH_AND_EXPR:
3843 result_type = boolean_type_node;
3846 /* Shift operations: result has same type as first operand;
3847 always convert second operand to int.
3848 Also set SHORT_SHIFT if shifting rightward. */
3851 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3853 result_type = type0;
3854 if (TREE_CODE (op1) == INTEGER_CST)
3856 if (tree_int_cst_lt (op1, integer_zero_node))
3858 if ((complain & tf_warning)
3859 && c_inhibit_evaluation_warnings == 0)
3860 warning (0, "right shift count is negative");
3864 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3865 && (complain & tf_warning)
3866 && c_inhibit_evaluation_warnings == 0)
3867 warning (0, "right shift count >= width of type");
3870 /* Convert the shift-count to an integer, regardless of
3871 size of value being shifted. */
3872 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3873 op1 = cp_convert (integer_type_node, op1);
3874 /* Avoid converting op1 to result_type later. */
3880 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3882 result_type = type0;
3883 if (TREE_CODE (op1) == INTEGER_CST)
3885 if (tree_int_cst_lt (op1, integer_zero_node))
3887 if ((complain & tf_warning)
3888 && c_inhibit_evaluation_warnings == 0)
3889 warning (0, "left shift count is negative");
3891 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3893 if ((complain & tf_warning)
3894 && c_inhibit_evaluation_warnings == 0)
3895 warning (0, "left shift count >= width of type");
3898 /* Convert the shift-count to an integer, regardless of
3899 size of value being shifted. */
3900 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3901 op1 = cp_convert (integer_type_node, op1);
3902 /* Avoid converting op1 to result_type later. */
3909 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3911 result_type = type0;
3912 if (TREE_CODE (op1) == INTEGER_CST)
3914 if (tree_int_cst_lt (op1, integer_zero_node))
3916 if (complain & tf_warning)
3917 warning (0, (code == LROTATE_EXPR)
3918 ? G_("left rotate count is negative")
3919 : G_("right rotate count is negative"));
3921 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3923 if (complain & tf_warning)
3924 warning (0, (code == LROTATE_EXPR)
3925 ? G_("left rotate count >= width of type")
3926 : G_("right rotate count >= width of type"));
3929 /* Convert the shift-count to an integer, regardless of
3930 size of value being shifted. */
3931 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3932 op1 = cp_convert (integer_type_node, op1);
3938 if ((complain & tf_warning)
3939 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3940 warning (OPT_Wfloat_equal,
3941 "comparing floating point with == or != is unsafe");
3942 if ((complain & tf_warning)
3943 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3944 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3945 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3947 build_type = boolean_type_node;
3948 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3949 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
3950 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3951 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
3953 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3954 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3955 result_type = composite_pointer_type (type0, type1, op0, op1,
3956 CPO_COMPARISON, complain);
3957 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3958 && null_ptr_cst_p (op1))
3960 if (TREE_CODE (op0) == ADDR_EXPR
3961 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
3963 if (complain & tf_warning)
3964 warning (OPT_Waddress, "the address of %qD will never be NULL",
3965 TREE_OPERAND (op0, 0));
3967 result_type = type0;
3969 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3970 && null_ptr_cst_p (op0))
3972 if (TREE_CODE (op1) == ADDR_EXPR
3973 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
3975 if (complain & tf_warning)
3976 warning (OPT_Waddress, "the address of %qD will never be NULL",
3977 TREE_OPERAND (op1, 0));
3979 result_type = type1;
3981 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
3982 /* One of the operands must be of nullptr_t type. */
3983 result_type = TREE_TYPE (nullptr_node);
3984 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3986 result_type = type0;
3987 if (complain & tf_error)
3988 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3990 return error_mark_node;
3992 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3994 result_type = type1;
3995 if (complain & tf_error)
3996 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3998 return error_mark_node;
4000 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4002 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4003 == ptrmemfunc_vbit_in_delta)
4005 tree pfn0 = pfn_from_ptrmemfunc (op0);
4006 tree delta0 = delta_from_ptrmemfunc (op0);
4007 tree e1 = cp_build_binary_op (location,
4010 build_zero_cst (TREE_TYPE (pfn0)),
4012 tree e2 = cp_build_binary_op (location,
4017 e2 = cp_build_binary_op (location,
4018 EQ_EXPR, e2, integer_zero_node,
4020 op0 = cp_build_binary_op (location,
4021 TRUTH_ANDIF_EXPR, e1, e2,
4023 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
4027 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4028 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
4030 result_type = TREE_TYPE (op0);
4032 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4033 return cp_build_binary_op (location, code, op1, op0, complain);
4034 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4037 /* E will be the final comparison. */
4039 /* E1 and E2 are for scratch. */
4047 type = composite_pointer_type (type0, type1, op0, op1,
4048 CPO_COMPARISON, complain);
4050 if (!same_type_p (TREE_TYPE (op0), type))
4051 op0 = cp_convert_and_check (type, op0);
4052 if (!same_type_p (TREE_TYPE (op1), type))
4053 op1 = cp_convert_and_check (type, op1);
4055 if (op0 == error_mark_node || op1 == error_mark_node)
4056 return error_mark_node;
4058 if (TREE_SIDE_EFFECTS (op0))
4059 op0 = save_expr (op0);
4060 if (TREE_SIDE_EFFECTS (op1))
4061 op1 = save_expr (op1);
4063 pfn0 = pfn_from_ptrmemfunc (op0);
4064 pfn1 = pfn_from_ptrmemfunc (op1);
4065 delta0 = delta_from_ptrmemfunc (op0);
4066 delta1 = delta_from_ptrmemfunc (op1);
4067 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4068 == ptrmemfunc_vbit_in_delta)
4073 && ((op0.delta == op1.delta)
4074 || (!op0.pfn && op0.delta & 1 == 0
4075 && op1.delta & 1 == 0))
4077 The reason for the `!op0.pfn' bit is that a NULL
4078 pointer-to-member is any member with a zero PFN and
4079 LSB of the DELTA field is 0. */
4081 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4085 e1 = cp_build_binary_op (location,
4086 EQ_EXPR, e1, integer_zero_node,
4088 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4092 e2 = cp_build_binary_op (location,
4093 EQ_EXPR, e2, integer_zero_node,
4095 e1 = cp_build_binary_op (location,
4096 TRUTH_ANDIF_EXPR, e2, e1,
4098 e2 = cp_build_binary_op (location, EQ_EXPR,
4100 build_zero_cst (TREE_TYPE (pfn0)),
4102 e2 = cp_build_binary_op (location,
4103 TRUTH_ANDIF_EXPR, e2, e1, complain);
4104 e1 = cp_build_binary_op (location,
4105 EQ_EXPR, delta0, delta1, complain);
4106 e1 = cp_build_binary_op (location,
4107 TRUTH_ORIF_EXPR, e1, e2, complain);
4114 && (!op0.pfn || op0.delta == op1.delta))
4116 The reason for the `!op0.pfn' bit is that a NULL
4117 pointer-to-member is any member with a zero PFN; the
4118 DELTA field is unspecified. */
4120 e1 = cp_build_binary_op (location,
4121 EQ_EXPR, delta0, delta1, complain);
4122 e2 = cp_build_binary_op (location,
4125 build_zero_cst (TREE_TYPE (pfn0)),
4127 e1 = cp_build_binary_op (location,
4128 TRUTH_ORIF_EXPR, e1, e2, complain);
4130 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4131 e = cp_build_binary_op (location,
4132 TRUTH_ANDIF_EXPR, e2, e1, complain);
4133 if (code == EQ_EXPR)
4135 return cp_build_binary_op (location,
4136 EQ_EXPR, e, integer_zero_node, complain);
4140 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4141 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4143 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4144 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4152 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4153 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4155 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4156 result_type = composite_pointer_type (type0, type1, op0, op1,
4157 CPO_COMPARISON, complain);
4164 if (TREE_CODE (orig_op0) == STRING_CST
4165 || TREE_CODE (orig_op1) == STRING_CST)
4167 if (complain & tf_warning)
4168 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4171 build_type = boolean_type_node;
4172 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4173 || code0 == ENUMERAL_TYPE)
4174 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4175 || code1 == ENUMERAL_TYPE))
4177 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4178 result_type = composite_pointer_type (type0, type1, op0, op1,
4179 CPO_COMPARISON, complain);
4180 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4181 result_type = type0;
4182 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4183 result_type = type1;
4184 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4185 /* One of the operands must be of nullptr_t type. */
4186 result_type = TREE_TYPE (nullptr_node);
4187 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4189 result_type = type0;
4190 if (complain & tf_error)
4191 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4193 return error_mark_node;
4195 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4197 result_type = type1;
4198 if (complain & tf_error)
4199 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4201 return error_mark_node;
4205 case UNORDERED_EXPR:
4212 build_type = integer_type_node;
4213 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4215 if (complain & tf_error)
4216 error ("unordered comparison on non-floating point argument");
4217 return error_mark_node;
4226 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4227 || code0 == ENUMERAL_TYPE)
4228 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4229 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4230 arithmetic_types_p = 1;
4233 arithmetic_types_p = 0;
4234 /* Vector arithmetic is only allowed when both sides are vectors. */
4235 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4237 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4238 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4241 binary_op_error (location, code, type0, type1);
4242 return error_mark_node;
4244 arithmetic_types_p = 1;
4247 /* Determine the RESULT_TYPE, if it is not already known. */
4249 && arithmetic_types_p
4250 && (shorten || common || short_compare))
4252 result_type = cp_common_type (type0, type1);
4253 do_warn_double_promotion (result_type, type0, type1,
4254 "implicit conversion from %qT to %qT "
4255 "to match other operand of binary "
4262 if (complain & tf_error)
4263 error ("invalid operands of types %qT and %qT to binary %qO",
4264 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4265 return error_mark_node;
4268 /* If we're in a template, the only thing we need to know is the
4270 if (processing_template_decl)
4272 /* Since the middle-end checks the type when doing a build2, we
4273 need to build the tree in pieces. This built tree will never
4274 get out of the front-end as we replace it when instantiating
4276 tree tmp = build2 (resultcode,
4277 build_type ? build_type : result_type,
4279 TREE_OPERAND (tmp, 0) = op0;
4283 if (arithmetic_types_p)
4285 bool first_complex = (code0 == COMPLEX_TYPE);
4286 bool second_complex = (code1 == COMPLEX_TYPE);
4287 int none_complex = (!first_complex && !second_complex);
4289 /* Adapted from patch for c/24581. */
4290 if (first_complex != second_complex
4291 && (code == PLUS_EXPR
4292 || code == MINUS_EXPR
4293 || code == MULT_EXPR
4294 || (code == TRUNC_DIV_EXPR && first_complex))
4295 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4296 && flag_signed_zeros)
4298 /* An operation on mixed real/complex operands must be
4299 handled specially, but the language-independent code can
4300 more easily optimize the plain complex arithmetic if
4301 -fno-signed-zeros. */
4302 tree real_type = TREE_TYPE (result_type);
4306 if (TREE_TYPE (op0) != result_type)
4307 op0 = cp_convert_and_check (result_type, op0);
4308 if (TREE_TYPE (op1) != real_type)
4309 op1 = cp_convert_and_check (real_type, op1);
4313 if (TREE_TYPE (op0) != real_type)
4314 op0 = cp_convert_and_check (real_type, op0);
4315 if (TREE_TYPE (op1) != result_type)
4316 op1 = cp_convert_and_check (result_type, op1);
4318 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4319 return error_mark_node;
4322 op0 = save_expr (op0);
4323 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4324 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4328 case TRUNC_DIV_EXPR:
4329 imag = build2 (resultcode, real_type, imag, op1);
4333 real = build2 (resultcode, real_type, real, op1);
4341 op1 = save_expr (op1);
4342 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4343 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4347 imag = build2 (resultcode, real_type, op0, imag);
4350 real = build2 (resultcode, real_type, op0, real);
4353 real = build2 (resultcode, real_type, op0, real);
4354 imag = build1 (NEGATE_EXPR, real_type, imag);
4360 return build2 (COMPLEX_EXPR, result_type, real, imag);
4363 /* For certain operations (which identify themselves by shorten != 0)
4364 if both args were extended from the same smaller type,
4365 do the arithmetic in that type and then extend.
4367 shorten !=0 and !=1 indicates a bitwise operation.
4368 For them, this optimization is safe only if
4369 both args are zero-extended or both are sign-extended.
4370 Otherwise, we might change the result.
4371 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4372 but calculated in (unsigned short) it would be (unsigned short)-1. */
4374 if (shorten && none_complex)
4376 final_type = result_type;
4377 result_type = shorten_binary_op (result_type, op0, op1,
4381 /* Comparison operations are shortened too but differently.
4382 They identify themselves by setting short_compare = 1. */
4386 /* Don't write &op0, etc., because that would prevent op0
4387 from being kept in a register.
4388 Instead, make copies of the our local variables and
4389 pass the copies by reference, then copy them back afterward. */
4390 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4391 enum tree_code xresultcode = resultcode;
4393 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4395 return cp_convert (boolean_type_node, val);
4396 op0 = xop0, op1 = xop1;
4398 resultcode = xresultcode;
4401 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4402 && warn_sign_compare
4403 && !TREE_NO_WARNING (orig_op0)
4404 && !TREE_NO_WARNING (orig_op1)
4405 /* Do not warn until the template is instantiated; we cannot
4406 bound the ranges of the arguments until that point. */
4407 && !processing_template_decl
4408 && (complain & tf_warning)
4409 && c_inhibit_evaluation_warnings == 0)
4411 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4412 result_type, resultcode);
4416 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4417 Then the expression will be built.
4418 It will be given type FINAL_TYPE if that is nonzero;
4419 otherwise, it will be given type RESULT_TYPE. */
4422 if (TREE_TYPE (op0) != result_type)
4423 op0 = cp_convert_and_check (result_type, op0);
4424 if (TREE_TYPE (op1) != result_type)
4425 op1 = cp_convert_and_check (result_type, op1);
4427 if (op0 == error_mark_node || op1 == error_mark_node)
4428 return error_mark_node;
4431 if (build_type == NULL_TREE)
4432 build_type = result_type;
4434 result = build2 (resultcode, build_type, op0, op1);
4435 result = fold_if_not_in_template (result);
4436 if (final_type != 0)
4437 result = cp_convert (final_type, result);
4439 if (TREE_OVERFLOW_P (result)
4440 && !TREE_OVERFLOW_P (op0)
4441 && !TREE_OVERFLOW_P (op1))
4442 overflow_warning (location, result);
4447 /* Return a tree for the sum or difference (RESULTCODE says which)
4448 of pointer PTROP and integer INTOP. */
4451 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4453 tree res_type = TREE_TYPE (ptrop);
4455 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4456 in certain circumstance (when it's valid to do so). So we need
4457 to make sure it's complete. We don't need to check here, if we
4458 can actually complete it at all, as those checks will be done in
4459 pointer_int_sum() anyway. */
4460 complete_type (TREE_TYPE (res_type));
4462 return pointer_int_sum (input_location, resultcode, ptrop,
4463 fold_if_not_in_template (intop));
4466 /* Return a tree for the difference of pointers OP0 and OP1.
4467 The resulting tree has type int. */
4470 pointer_diff (tree op0, tree op1, tree ptrtype)
4473 tree restype = ptrdiff_type_node;
4474 tree target_type = TREE_TYPE (ptrtype);
4476 if (!complete_type_or_else (target_type, NULL_TREE))
4477 return error_mark_node;
4479 if (TREE_CODE (target_type) == VOID_TYPE)
4480 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4481 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4482 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4483 if (TREE_CODE (target_type) == METHOD_TYPE)
4484 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4486 /* First do the subtraction as integers;
4487 then drop through to build the divide operator. */
4489 op0 = cp_build_binary_op (input_location,
4491 cp_convert (restype, op0),
4492 cp_convert (restype, op1),
4493 tf_warning_or_error);
4495 /* This generates an error if op1 is a pointer to an incomplete type. */
4496 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4497 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4499 op1 = (TYPE_PTROB_P (ptrtype)
4500 ? size_in_bytes (target_type)
4501 : integer_one_node);
4503 /* Do the division. */
4505 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4506 return fold_if_not_in_template (result);
4509 /* Construct and perhaps optimize a tree representation
4510 for a unary operation. CODE, a tree_code, specifies the operation
4511 and XARG is the operand. */
4514 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4516 tree orig_expr = xarg;
4520 if (processing_template_decl)
4522 if (type_dependent_expression_p (xarg))
4523 return build_min_nt (code, xarg, NULL_TREE);
4525 xarg = build_non_dependent_expr (xarg);
4530 /* [expr.unary.op] says:
4532 The address of an object of incomplete type can be taken.
4534 (And is just the ordinary address operator, not an overloaded
4535 "operator &".) However, if the type is a template
4536 specialization, we must complete the type at this point so that
4537 an overloaded "operator &" will be available if required. */
4538 if (code == ADDR_EXPR
4539 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4540 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4541 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4542 || (TREE_CODE (xarg) == OFFSET_REF)))
4543 /* Don't look for a function. */;
4545 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4546 /*overloaded_p=*/NULL, complain);
4547 if (!exp && code == ADDR_EXPR)
4549 if (is_overloaded_fn (xarg))
4551 tree fn = get_first_fn (xarg);
4552 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4554 error (DECL_CONSTRUCTOR_P (fn)
4555 ? G_("taking address of constructor %qE")
4556 : G_("taking address of destructor %qE"),
4558 return error_mark_node;
4562 /* A pointer to member-function can be formed only by saying
4564 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4565 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4567 if (TREE_CODE (xarg) != OFFSET_REF
4568 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4570 error ("invalid use of %qE to form a pointer-to-member-function",
4572 if (TREE_CODE (xarg) != OFFSET_REF)
4573 inform (input_location, " a qualified-id is required");
4574 return error_mark_node;
4578 error ("parentheses around %qE cannot be used to form a"
4579 " pointer-to-member-function",
4581 PTRMEM_OK_P (xarg) = 1;
4585 if (TREE_CODE (xarg) == OFFSET_REF)
4587 ptrmem = PTRMEM_OK_P (xarg);
4589 if (!ptrmem && !flag_ms_extensions
4590 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4592 /* A single non-static member, make sure we don't allow a
4593 pointer-to-member. */
4594 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4595 TREE_OPERAND (xarg, 0),
4596 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4597 PTRMEM_OK_P (xarg) = ptrmem;
4601 exp = cp_build_addr_expr_strict (xarg, complain);
4604 if (processing_template_decl && exp != error_mark_node)
4605 exp = build_min_non_dep (code, exp, orig_expr,
4606 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4607 if (TREE_CODE (exp) == ADDR_EXPR)
4608 PTRMEM_OK_P (exp) = ptrmem;
4612 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4613 constants, where a null value is represented by an INTEGER_CST of
4617 cp_truthvalue_conversion (tree expr)
4619 tree type = TREE_TYPE (expr);
4620 if (TYPE_PTRMEM_P (type))
4621 return build_binary_op (EXPR_LOCATION (expr),
4622 NE_EXPR, expr, integer_zero_node, 1);
4624 return c_common_truthvalue_conversion (input_location, expr);
4627 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4630 condition_conversion (tree expr)
4633 if (processing_template_decl)
4635 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4636 tf_warning_or_error, LOOKUP_NORMAL);
4637 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4641 /* Returns the address of T. This function will fold away
4642 ADDR_EXPR of INDIRECT_REF. */
4645 build_address (tree t)
4647 if (error_operand_p (t) || !cxx_mark_addressable (t))
4648 return error_mark_node;
4649 t = build_fold_addr_expr (t);
4650 if (TREE_CODE (t) != ADDR_EXPR)
4655 /* Returns the address of T with type TYPE. */
4658 build_typed_address (tree t, tree type)
4660 if (error_operand_p (t) || !cxx_mark_addressable (t))
4661 return error_mark_node;
4662 t = build_fold_addr_expr_with_type (t, type);
4663 if (TREE_CODE (t) != ADDR_EXPR)
4668 /* Return a NOP_EXPR converting EXPR to TYPE. */
4671 build_nop (tree type, tree expr)
4673 if (type == error_mark_node || error_operand_p (expr))
4675 return build1 (NOP_EXPR, type, expr);
4678 /* Take the address of ARG, whatever that means under C++ semantics.
4679 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4680 and class rvalues as well.
4682 Nothing should call this function directly; instead, callers should use
4683 cp_build_addr_expr or cp_build_addr_expr_strict. */
4686 cp_build_addr_expr_1 (tree arg, bool strict_lvalue, tsubst_flags_t complain)
4691 if (!arg || error_operand_p (arg))
4692 return error_mark_node;
4694 arg = mark_lvalue_use (arg);
4695 argtype = lvalue_type (arg);
4697 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4698 || !IDENTIFIER_OPNAME_P (arg));
4700 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4701 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4703 /* They're trying to take the address of a unique non-static
4704 member function. This is ill-formed (except in MS-land),
4705 but let's try to DTRT.
4706 Note: We only handle unique functions here because we don't
4707 want to complain if there's a static overload; non-unique
4708 cases will be handled by instantiate_type. But we need to
4709 handle this case here to allow casts on the resulting PMF.
4710 We could defer this in non-MS mode, but it's easier to give
4711 a useful error here. */
4713 /* Inside constant member functions, the `this' pointer
4714 contains an extra const qualifier. TYPE_MAIN_VARIANT
4715 is used here to remove this const from the diagnostics
4716 and the created OFFSET_REF. */
4717 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4718 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4721 if (! flag_ms_extensions)
4723 tree name = DECL_NAME (fn);
4724 if (!(complain & tf_error))
4725 return error_mark_node;
4726 else if (current_class_type
4727 && TREE_OPERAND (arg, 0) == current_class_ref)
4728 /* An expression like &memfn. */
4729 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4730 " or parenthesized non-static member function to form"
4731 " a pointer to member function. Say %<&%T::%D%>",
4734 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4735 " function to form a pointer to member function."
4739 arg = build_offset_ref (base, fn, /*address_p=*/true);
4742 /* Uninstantiated types are all functions. Taking the
4743 address of a function is a no-op, so just return the
4745 if (type_unknown_p (arg))
4746 return build1 (ADDR_EXPR, unknown_type_node, arg);
4748 if (TREE_CODE (arg) == OFFSET_REF)
4749 /* We want a pointer to member; bypass all the code for actually taking
4750 the address of something. */
4753 /* Anything not already handled and not a true memory reference
4755 if (TREE_CODE (argtype) != FUNCTION_TYPE
4756 && TREE_CODE (argtype) != METHOD_TYPE)
4758 cp_lvalue_kind kind = lvalue_kind (arg);
4759 if (kind == clk_none)
4761 if (complain & tf_error)
4762 lvalue_error (input_location, lv_addressof);
4763 return error_mark_node;
4765 if (strict_lvalue && (kind & (clk_rvalueref|clk_class)))
4767 if (!(complain & tf_error))
4768 return error_mark_node;
4769 if (kind & clk_class)
4770 /* Make this a permerror because we used to accept it. */
4771 permerror (input_location, "taking address of temporary");
4773 error ("taking address of xvalue (rvalue reference)");
4777 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4779 tree type = build_pointer_type (TREE_TYPE (argtype));
4780 arg = build1 (CONVERT_EXPR, type, arg);
4783 else if (pedantic && DECL_MAIN_P (arg))
4786 /* Apparently a lot of autoconf scripts for C++ packages do this,
4787 so only complain if -pedantic. */
4788 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4789 pedwarn (input_location, OPT_pedantic,
4790 "ISO C++ forbids taking address of function %<::main%>");
4791 else if (flag_pedantic_errors)
4792 return error_mark_node;
4795 /* Let &* cancel out to simplify resulting code. */
4796 if (TREE_CODE (arg) == INDIRECT_REF)
4798 /* We don't need to have `current_class_ptr' wrapped in a
4799 NON_LVALUE_EXPR node. */
4800 if (arg == current_class_ref)
4801 return current_class_ptr;
4803 arg = TREE_OPERAND (arg, 0);
4804 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4806 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4807 arg = build1 (CONVERT_EXPR, type, arg);
4810 /* Don't let this be an lvalue. */
4815 /* ??? Cope with user tricks that amount to offsetof. */
4816 if (TREE_CODE (argtype) != FUNCTION_TYPE
4817 && TREE_CODE (argtype) != METHOD_TYPE
4818 && argtype != unknown_type_node
4819 && (val = get_base_address (arg))
4820 && COMPLETE_TYPE_P (TREE_TYPE (val))
4821 && TREE_CODE (val) == INDIRECT_REF
4822 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
4824 tree type = build_pointer_type (argtype);
4825 tree op0 = fold_convert (type, TREE_OPERAND (val, 0));
4826 tree op1 = fold_convert (sizetype, fold_offsetof (arg, val));
4827 return fold_build2 (POINTER_PLUS_EXPR, type, op0, op1);
4830 /* Handle complex lvalues (when permitted)
4831 by reduction to simpler cases. */
4832 val = unary_complex_lvalue (ADDR_EXPR, arg);
4836 switch (TREE_CODE (arg))
4840 case FIX_TRUNC_EXPR:
4841 /* Even if we're not being pedantic, we cannot allow this
4842 extension when we're instantiating in a SFINAE
4844 if (! lvalue_p (arg) && complain == tf_none)
4846 if (complain & tf_error)
4847 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4849 return error_mark_node;
4854 arg = BASELINK_FUNCTIONS (arg);
4858 arg = OVL_CURRENT (arg);
4863 /* Turn a reference to a non-static data member into a
4864 pointer-to-member. */
4869 gcc_assert (PTRMEM_OK_P (arg));
4871 t = TREE_OPERAND (arg, 1);
4872 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4874 if (complain & tf_error)
4875 error ("cannot create pointer to reference member %qD", t);
4876 return error_mark_node;
4879 type = build_ptrmem_type (context_for_name_lookup (t),
4881 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4889 if (argtype != error_mark_node)
4890 argtype = build_pointer_type (argtype);
4892 /* In a template, we are processing a non-dependent expression
4893 so we can just form an ADDR_EXPR with the correct type. */
4894 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
4896 val = build_address (arg);
4897 if (TREE_CODE (arg) == OFFSET_REF)
4898 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4900 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
4902 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4904 /* We can only get here with a single static member
4906 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4907 && DECL_STATIC_FUNCTION_P (fn));
4909 val = build_address (fn);
4910 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4911 /* Do not lose object's side effects. */
4912 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4913 TREE_OPERAND (arg, 0), val);
4915 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4917 if (complain & tf_error)
4918 error ("attempt to take address of bit-field structure member %qD",
4919 TREE_OPERAND (arg, 1));
4920 return error_mark_node;
4924 tree object = TREE_OPERAND (arg, 0);
4925 tree field = TREE_OPERAND (arg, 1);
4926 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4927 (TREE_TYPE (object), decl_type_context (field)));
4928 val = build_address (arg);
4931 if (TREE_CODE (argtype) == POINTER_TYPE
4932 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4934 build_ptrmemfunc_type (argtype);
4935 val = build_ptrmemfunc (argtype, val, 0,
4937 tf_warning_or_error);
4943 /* Take the address of ARG if it has one, even if it's an rvalue. */
4946 cp_build_addr_expr (tree arg, tsubst_flags_t complain)
4948 return cp_build_addr_expr_1 (arg, 0, complain);
4951 /* Take the address of ARG, but only if it's an lvalue. */
4954 cp_build_addr_expr_strict (tree arg, tsubst_flags_t complain)
4956 return cp_build_addr_expr_1 (arg, 1, complain);
4959 /* C++: Must handle pointers to members.
4961 Perhaps type instantiation should be extended to handle conversion
4962 from aggregates to types we don't yet know we want? (Or are those
4963 cases typically errors which should be reported?)
4965 NOCONVERT nonzero suppresses the default promotions
4966 (such as from short to int). */
4969 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
4970 tsubst_flags_t complain)
4972 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4975 const char *errstring = NULL;
4977 const char *invalid_op_diag;
4979 if (!arg || error_operand_p (arg))
4980 return error_mark_node;
4982 if ((invalid_op_diag
4983 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
4988 error (invalid_op_diag);
4989 return error_mark_node;
4994 case UNARY_PLUS_EXPR:
4997 int flags = WANT_ARITH | WANT_ENUM;
4998 /* Unary plus (but not unary minus) is allowed on pointers. */
4999 if (code == UNARY_PLUS_EXPR)
5000 flags |= WANT_POINTER;
5001 arg = build_expr_type_conversion (flags, arg, true);
5003 errstring = (code == NEGATE_EXPR
5004 ? _("wrong type argument to unary minus")
5005 : _("wrong type argument to unary plus"));
5008 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5009 arg = perform_integral_promotions (arg);
5011 /* Make sure the result is not an lvalue: a unary plus or minus
5012 expression is always a rvalue. */
5019 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5023 arg = default_conversion (arg);
5025 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
5026 | WANT_VECTOR_OR_COMPLEX,
5028 errstring = _("wrong type argument to bit-complement");
5029 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5030 arg = perform_integral_promotions (arg);
5034 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5035 errstring = _("wrong type argument to abs");
5036 else if (!noconvert)
5037 arg = default_conversion (arg);
5041 /* Conjugating a real value is a no-op, but allow it anyway. */
5042 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5043 errstring = _("wrong type argument to conjugation");
5044 else if (!noconvert)
5045 arg = default_conversion (arg);
5048 case TRUTH_NOT_EXPR:
5049 arg = perform_implicit_conversion (boolean_type_node, arg,
5051 val = invert_truthvalue_loc (input_location, arg);
5052 if (arg != error_mark_node)
5054 errstring = _("in argument to unary !");
5062 arg = build_real_imag_expr (input_location, code, arg);
5063 if (arg == error_mark_node)
5066 return fold_if_not_in_template (arg);
5068 case PREINCREMENT_EXPR:
5069 case POSTINCREMENT_EXPR:
5070 case PREDECREMENT_EXPR:
5071 case POSTDECREMENT_EXPR:
5072 /* Handle complex lvalues (when permitted)
5073 by reduction to simpler cases. */
5075 val = unary_complex_lvalue (code, arg);
5079 arg = mark_lvalue_use (arg);
5081 /* Increment or decrement the real part of the value,
5082 and don't change the imaginary part. */
5083 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5087 arg = stabilize_reference (arg);
5088 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
5089 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
5090 real = cp_build_unary_op (code, real, 1, complain);
5091 if (real == error_mark_node || imag == error_mark_node)
5092 return error_mark_node;
5093 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
5097 /* Report invalid types. */
5099 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
5102 if (code == PREINCREMENT_EXPR)
5103 errstring = _("no pre-increment operator for type");
5104 else if (code == POSTINCREMENT_EXPR)
5105 errstring = _("no post-increment operator for type");
5106 else if (code == PREDECREMENT_EXPR)
5107 errstring = _("no pre-decrement operator for type");
5109 errstring = _("no post-decrement operator for type");
5112 else if (arg == error_mark_node)
5113 return error_mark_node;
5115 /* Report something read-only. */
5117 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
5118 || TREE_READONLY (arg))
5120 if (complain & tf_error)
5121 cxx_readonly_error (arg, ((code == PREINCREMENT_EXPR
5122 || code == POSTINCREMENT_EXPR)
5123 ? lv_increment : lv_decrement));
5125 return error_mark_node;
5130 tree declared_type = unlowered_expr_type (arg);
5132 argtype = TREE_TYPE (arg);
5134 /* ARM $5.2.5 last annotation says this should be forbidden. */
5135 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
5137 if (complain & tf_error)
5138 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
5139 ? G_("ISO C++ forbids incrementing an enum")
5140 : G_("ISO C++ forbids decrementing an enum"));
5142 return error_mark_node;
5145 /* Compute the increment. */
5147 if (TREE_CODE (argtype) == POINTER_TYPE)
5149 tree type = complete_type (TREE_TYPE (argtype));
5151 if (!COMPLETE_OR_VOID_TYPE_P (type))
5153 if (complain & tf_error)
5154 error (((code == PREINCREMENT_EXPR
5155 || code == POSTINCREMENT_EXPR))
5156 ? G_("cannot increment a pointer to incomplete type %qT")
5157 : G_("cannot decrement a pointer to incomplete type %qT"),
5158 TREE_TYPE (argtype));
5160 return error_mark_node;
5162 else if ((pedantic || warn_pointer_arith)
5163 && !TYPE_PTROB_P (argtype))
5165 if (complain & tf_error)
5166 permerror (input_location, (code == PREINCREMENT_EXPR
5167 || code == POSTINCREMENT_EXPR)
5168 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5169 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5172 return error_mark_node;
5175 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
5178 inc = integer_one_node;
5180 inc = cp_convert (argtype, inc);
5182 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
5183 need to ask Objective-C to build the increment or decrement
5184 expression for it. */
5185 if (objc_is_property_ref (arg))
5186 return objc_build_incr_expr_for_property_ref (input_location, code,
5189 /* Complain about anything else that is not a true lvalue. */
5190 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
5191 || code == POSTINCREMENT_EXPR)
5192 ? lv_increment : lv_decrement),
5194 return error_mark_node;
5196 /* Forbid using -- on `bool'. */
5197 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
5199 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
5201 if (complain & tf_error)
5202 error ("invalid use of Boolean expression as operand "
5203 "to %<operator--%>");
5204 return error_mark_node;
5206 val = boolean_increment (code, arg);
5209 val = build2 (code, TREE_TYPE (arg), arg, inc);
5211 TREE_SIDE_EFFECTS (val) = 1;
5216 /* Note that this operation never does default_conversion
5217 regardless of NOCONVERT. */
5218 return cp_build_addr_expr (arg, complain);
5227 argtype = TREE_TYPE (arg);
5228 return fold_if_not_in_template (build1 (code, argtype, arg));
5231 if (complain & tf_error)
5232 error ("%s", errstring);
5233 return error_mark_node;
5236 /* Hook for the c-common bits that build a unary op. */
5238 build_unary_op (location_t location ATTRIBUTE_UNUSED,
5239 enum tree_code code, tree xarg, int noconvert)
5241 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5244 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5245 for certain kinds of expressions which are not really lvalues
5246 but which we can accept as lvalues.
5248 If ARG is not a kind of expression we can handle, return
5252 unary_complex_lvalue (enum tree_code code, tree arg)
5254 /* Inside a template, making these kinds of adjustments is
5255 pointless; we are only concerned with the type of the
5257 if (processing_template_decl)
5260 /* Handle (a, b) used as an "lvalue". */
5261 if (TREE_CODE (arg) == COMPOUND_EXPR)
5263 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5264 tf_warning_or_error);
5265 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5266 TREE_OPERAND (arg, 0), real_result);
5269 /* Handle (a ? b : c) used as an "lvalue". */
5270 if (TREE_CODE (arg) == COND_EXPR
5271 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5272 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5274 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5275 if (TREE_CODE (arg) == MODIFY_EXPR
5276 || TREE_CODE (arg) == PREINCREMENT_EXPR
5277 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5279 tree lvalue = TREE_OPERAND (arg, 0);
5280 if (TREE_SIDE_EFFECTS (lvalue))
5282 lvalue = stabilize_reference (lvalue);
5283 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5284 lvalue, TREE_OPERAND (arg, 1));
5286 return unary_complex_lvalue
5287 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5290 if (code != ADDR_EXPR)
5293 /* Handle (a = b) used as an "lvalue" for `&'. */
5294 if (TREE_CODE (arg) == MODIFY_EXPR
5295 || TREE_CODE (arg) == INIT_EXPR)
5297 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5298 tf_warning_or_error);
5299 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5301 TREE_NO_WARNING (arg) = 1;
5305 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5306 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5307 || TREE_CODE (arg) == OFFSET_REF)
5310 /* We permit compiler to make function calls returning
5311 objects of aggregate type look like lvalues. */
5315 if (TREE_CODE (targ) == SAVE_EXPR)
5316 targ = TREE_OPERAND (targ, 0);
5318 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5320 if (TREE_CODE (arg) == SAVE_EXPR)
5323 targ = build_cplus_new (TREE_TYPE (arg), arg, tf_warning_or_error);
5324 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5327 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5328 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5329 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5332 /* Don't let anything else be handled specially. */
5336 /* Mark EXP saying that we need to be able to take the
5337 address of it; it should not be allocated in a register.
5338 Value is true if successful.
5340 C++: we do not allow `current_class_ptr' to be addressable. */
5343 cxx_mark_addressable (tree exp)
5348 switch (TREE_CODE (x))
5355 x = TREE_OPERAND (x, 0);
5359 if (x == current_class_ptr)
5361 error ("cannot take the address of %<this%>, which is an rvalue expression");
5362 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5368 /* Caller should not be trying to mark initialized
5369 constant fields addressable. */
5370 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5371 || DECL_IN_AGGR_P (x) == 0
5373 || DECL_EXTERNAL (x));
5378 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5379 && !DECL_ARTIFICIAL (x))
5381 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5384 ("address of explicit register variable %qD requested", x);
5387 else if (extra_warnings)
5389 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5391 TREE_ADDRESSABLE (x) = 1;
5395 TREE_ADDRESSABLE (x) = 1;
5399 TREE_ADDRESSABLE (x) = 1;
5403 TREE_ADDRESSABLE (x) = 1;
5404 cxx_mark_addressable (TREE_OPERAND (x, 0));
5412 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5415 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5416 tsubst_flags_t complain)
5418 tree orig_ifexp = ifexp;
5419 tree orig_op1 = op1;
5420 tree orig_op2 = op2;
5423 if (processing_template_decl)
5425 /* The standard says that the expression is type-dependent if
5426 IFEXP is type-dependent, even though the eventual type of the
5427 expression doesn't dependent on IFEXP. */
5428 if (type_dependent_expression_p (ifexp)
5429 /* As a GNU extension, the middle operand may be omitted. */
5430 || (op1 && type_dependent_expression_p (op1))
5431 || type_dependent_expression_p (op2))
5432 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5433 ifexp = build_non_dependent_expr (ifexp);
5435 op1 = build_non_dependent_expr (op1);
5436 op2 = build_non_dependent_expr (op2);
5439 expr = build_conditional_expr (ifexp, op1, op2, complain);
5440 if (processing_template_decl && expr != error_mark_node)
5441 return build_min_non_dep (COND_EXPR, expr,
5442 orig_ifexp, orig_op1, orig_op2);
5446 /* Given a list of expressions, return a compound expression
5447 that performs them all and returns the value of the last of them. */
5450 build_x_compound_expr_from_list (tree list, expr_list_kind exp,
5451 tsubst_flags_t complain)
5453 tree expr = TREE_VALUE (list);
5455 if (TREE_CHAIN (list))
5457 if (complain & tf_error)
5461 permerror (input_location, "expression list treated as compound "
5462 "expression in initializer");
5465 permerror (input_location, "expression list treated as compound "
5466 "expression in mem-initializer");
5469 permerror (input_location, "expression list treated as compound "
5470 "expression in functional cast");
5476 return error_mark_node;
5478 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5479 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5486 /* Like build_x_compound_expr_from_list, but using a VEC. */
5489 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5491 if (VEC_empty (tree, vec))
5493 else if (VEC_length (tree, vec) == 1)
5494 return VEC_index (tree, vec, 0);
5502 permerror (input_location,
5503 "%s expression list treated as compound expression",
5506 expr = VEC_index (tree, vec, 0);
5507 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5508 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5514 /* Handle overloading of the ',' operator when needed. */
5517 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5520 tree orig_op1 = op1;
5521 tree orig_op2 = op2;
5523 if (processing_template_decl)
5525 if (type_dependent_expression_p (op1)
5526 || type_dependent_expression_p (op2))
5527 return build_min_nt (COMPOUND_EXPR, op1, op2);
5528 op1 = build_non_dependent_expr (op1);
5529 op2 = build_non_dependent_expr (op2);
5532 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5533 /*overloaded_p=*/NULL, complain);
5535 result = cp_build_compound_expr (op1, op2, complain);
5537 if (processing_template_decl && result != error_mark_node)
5538 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5543 /* Like cp_build_compound_expr, but for the c-common bits. */
5546 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5548 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5551 /* Build a compound expression. */
5554 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5556 lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
5558 if (lhs == error_mark_node || rhs == error_mark_node)
5559 return error_mark_node;
5561 if (TREE_CODE (rhs) == TARGET_EXPR)
5563 /* If the rhs is a TARGET_EXPR, then build the compound
5564 expression inside the target_expr's initializer. This
5565 helps the compiler to eliminate unnecessary temporaries. */
5566 tree init = TREE_OPERAND (rhs, 1);
5568 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5569 TREE_OPERAND (rhs, 1) = init;
5574 if (type_unknown_p (rhs))
5576 error ("no context to resolve type of %qE", rhs);
5577 return error_mark_node;
5580 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5583 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5584 casts away constness. CAST gives the type of cast. Returns true
5585 if the cast is ill-formed, false if it is well-formed.
5587 ??? This function warns for casting away any qualifier not just
5588 const. We would like to specify exactly what qualifiers are casted
5593 check_for_casting_away_constness (tree src_type, tree dest_type,
5594 enum tree_code cast, tsubst_flags_t complain)
5596 /* C-style casts are allowed to cast away constness. With
5597 WARN_CAST_QUAL, we still want to issue a warning. */
5598 if (cast == CAST_EXPR && !warn_cast_qual)
5601 if (!casts_away_constness (src_type, dest_type))
5607 if (complain & tf_warning)
5608 warning (OPT_Wcast_qual,
5609 "cast from type %qT to type %qT casts away qualifiers",
5610 src_type, dest_type);
5613 case STATIC_CAST_EXPR:
5614 if (complain & tf_error)
5615 error ("static_cast from type %qT to type %qT casts away qualifiers",
5616 src_type, dest_type);
5619 case REINTERPRET_CAST_EXPR:
5620 if (complain & tf_error)
5621 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5622 src_type, dest_type);
5630 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5631 (another pointer-to-member type in the same hierarchy) and return
5632 the converted expression. If ALLOW_INVERSE_P is permitted, a
5633 pointer-to-derived may be converted to pointer-to-base; otherwise,
5634 only the other direction is permitted. If C_CAST_P is true, this
5635 conversion is taking place as part of a C-style cast. */
5638 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5639 bool c_cast_p, tsubst_flags_t complain)
5641 if (TYPE_PTRMEM_P (type))
5645 if (TREE_CODE (expr) == PTRMEM_CST)
5646 expr = cplus_expand_constant (expr);
5647 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5648 TYPE_PTRMEM_CLASS_TYPE (type),
5650 c_cast_p, complain);
5651 if (delta == error_mark_node)
5652 return error_mark_node;
5654 if (!integer_zerop (delta))
5656 tree cond, op1, op2;
5658 cond = cp_build_binary_op (input_location,
5661 build_int_cst (TREE_TYPE (expr), -1),
5662 tf_warning_or_error);
5663 op1 = build_nop (ptrdiff_type_node, expr);
5664 op2 = cp_build_binary_op (input_location,
5665 PLUS_EXPR, op1, delta,
5666 tf_warning_or_error);
5668 expr = fold_build3_loc (input_location,
5669 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5673 return build_nop (type, expr);
5676 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5677 allow_inverse_p, c_cast_p, complain);
5680 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5681 this static_cast is being attempted as one of the possible casts
5682 allowed by a C-style cast. (In that case, accessibility of base
5683 classes is not considered, and it is OK to cast away
5684 constness.) Return the result of the cast. *VALID_P is set to
5685 indicate whether or not the cast was valid. */
5688 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5689 bool *valid_p, tsubst_flags_t complain)
5694 /* Assume the cast is valid. */
5697 intype = TREE_TYPE (expr);
5699 /* Save casted types in the function's used types hash table. */
5700 used_types_insert (type);
5702 /* [expr.static.cast]
5704 An lvalue of type "cv1 B", where B is a class type, can be cast
5705 to type "reference to cv2 D", where D is a class derived (clause
5706 _class.derived_) from B, if a valid standard conversion from
5707 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5708 same cv-qualification as, or greater cv-qualification than, cv1,
5709 and B is not a virtual base class of D. */
5710 /* We check this case before checking the validity of "TYPE t =
5711 EXPR;" below because for this case:
5714 struct D : public B { D(const B&); };
5716 void f() { static_cast<const D&>(b); }
5718 we want to avoid constructing a new D. The standard is not
5719 completely clear about this issue, but our interpretation is
5720 consistent with other compilers. */
5721 if (TREE_CODE (type) == REFERENCE_TYPE
5722 && CLASS_TYPE_P (TREE_TYPE (type))
5723 && CLASS_TYPE_P (intype)
5724 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5725 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5726 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5727 build_pointer_type (TYPE_MAIN_VARIANT
5728 (TREE_TYPE (type))))
5730 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5734 /* There is a standard conversion from "D*" to "B*" even if "B"
5735 is ambiguous or inaccessible. If this is really a
5736 static_cast, then we check both for inaccessibility and
5737 ambiguity. However, if this is a static_cast being performed
5738 because the user wrote a C-style cast, then accessibility is
5740 base = lookup_base (TREE_TYPE (type), intype,
5741 c_cast_p ? ba_unique : ba_check,
5744 /* Convert from "B*" to "D*". This function will check that "B"
5745 is not a virtual base of "D". */
5746 expr = build_base_path (MINUS_EXPR, build_address (expr),
5747 base, /*nonnull=*/false);
5748 /* Convert the pointer to a reference -- but then remember that
5749 there are no expressions with reference type in C++.
5751 We call rvalue so that there's an actual tree code
5752 (NON_LVALUE_EXPR) for the static_cast; otherwise, if the operand
5753 is a variable with the same type, the conversion would get folded
5754 away, leaving just the variable and causing lvalue_kind to give
5755 the wrong answer. */
5756 return convert_from_reference (rvalue (cp_fold_convert (type, expr)));
5759 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5760 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5761 if (TREE_CODE (type) == REFERENCE_TYPE
5762 && TYPE_REF_IS_RVALUE (type)
5763 && real_lvalue_p (expr)
5764 && reference_related_p (TREE_TYPE (type), intype)
5765 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5767 expr = build_typed_address (expr, type);
5768 return convert_from_reference (expr);
5771 /* Resolve overloaded address here rather than once in
5772 implicit_conversion and again in the inverse code below. */
5773 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5775 expr = instantiate_type (type, expr, complain);
5776 intype = TREE_TYPE (expr);
5779 /* [expr.static.cast]
5781 An expression e can be explicitly converted to a type T using a
5782 static_cast of the form static_cast<T>(e) if the declaration T
5783 t(e);" is well-formed, for some invented temporary variable
5785 result = perform_direct_initialization_if_possible (type, expr,
5786 c_cast_p, complain);
5789 result = convert_from_reference (result);
5791 /* [expr.static.cast]
5793 If T is a reference type, the result is an lvalue; otherwise,
5794 the result is an rvalue. */
5795 if (TREE_CODE (type) != REFERENCE_TYPE)
5796 result = rvalue (result);
5800 /* [expr.static.cast]
5802 Any expression can be explicitly converted to type cv void. */
5803 if (TREE_CODE (type) == VOID_TYPE)
5804 return convert_to_void (expr, ICV_CAST, complain);
5806 /* [expr.static.cast]
5808 The inverse of any standard conversion sequence (clause _conv_),
5809 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5810 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5811 (_conv.bool_) conversions, can be performed explicitly using
5812 static_cast subject to the restriction that the explicit
5813 conversion does not cast away constness (_expr.const.cast_), and
5814 the following additional rules for specific cases: */
5815 /* For reference, the conversions not excluded are: integral
5816 promotions, floating point promotion, integral conversions,
5817 floating point conversions, floating-integral conversions,
5818 pointer conversions, and pointer to member conversions. */
5821 A value of integral _or enumeration_ type can be explicitly
5822 converted to an enumeration type. */
5823 /* The effect of all that is that any conversion between any two
5824 types which are integral, floating, or enumeration types can be
5826 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5827 || SCALAR_FLOAT_TYPE_P (type))
5828 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5829 || SCALAR_FLOAT_TYPE_P (intype)))
5830 return ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5832 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5833 && CLASS_TYPE_P (TREE_TYPE (type))
5834 && CLASS_TYPE_P (TREE_TYPE (intype))
5835 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5836 (TREE_TYPE (intype))),
5837 build_pointer_type (TYPE_MAIN_VARIANT
5838 (TREE_TYPE (type)))))
5843 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5845 return error_mark_node;
5846 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5847 c_cast_p ? ba_unique : ba_check,
5849 expr = build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
5850 return cp_fold_convert(type, expr);
5853 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5854 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5861 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5862 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5864 if (TYPE_PTRMEM_P (type))
5866 t1 = (build_ptrmem_type
5868 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5869 t2 = (build_ptrmem_type
5871 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5878 if (can_convert (t1, t2) || can_convert (t2, t1))
5881 && check_for_casting_away_constness (intype, type,
5884 return error_mark_node;
5885 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5886 c_cast_p, complain);
5890 /* [expr.static.cast]
5892 An rvalue of type "pointer to cv void" can be explicitly
5893 converted to a pointer to object type. A value of type pointer
5894 to object converted to "pointer to cv void" and back to the
5895 original pointer type will have its original value. */
5896 if (TREE_CODE (intype) == POINTER_TYPE
5897 && VOID_TYPE_P (TREE_TYPE (intype))
5898 && TYPE_PTROB_P (type))
5901 && check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR,
5903 return error_mark_node;
5904 return build_nop (type, expr);
5908 return error_mark_node;
5911 /* Return an expression representing static_cast<TYPE>(EXPR). */
5914 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5919 if (type == error_mark_node || expr == error_mark_node)
5920 return error_mark_node;
5922 if (processing_template_decl)
5924 expr = build_min (STATIC_CAST_EXPR, type, expr);
5925 /* We don't know if it will or will not have side effects. */
5926 TREE_SIDE_EFFECTS (expr) = 1;
5927 return convert_from_reference (expr);
5930 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5931 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5932 if (TREE_CODE (type) != REFERENCE_TYPE
5933 && TREE_CODE (expr) == NOP_EXPR
5934 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5935 expr = TREE_OPERAND (expr, 0);
5937 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
5942 if (complain & tf_error)
5943 error ("invalid static_cast from type %qT to type %qT",
5944 TREE_TYPE (expr), type);
5945 return error_mark_node;
5948 /* EXPR is an expression with member function or pointer-to-member
5949 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5950 not permitted by ISO C++, but we accept it in some modes. If we
5951 are not in one of those modes, issue a diagnostic. Return the
5952 converted expression. */
5955 convert_member_func_to_ptr (tree type, tree expr)
5960 intype = TREE_TYPE (expr);
5961 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
5962 || TREE_CODE (intype) == METHOD_TYPE);
5964 if (pedantic || warn_pmf2ptr)
5965 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
5966 "converting from %qT to %qT", intype, type);
5968 if (TREE_CODE (intype) == METHOD_TYPE)
5969 expr = build_addr_func (expr);
5970 else if (TREE_CODE (expr) == PTRMEM_CST)
5971 expr = build_address (PTRMEM_CST_MEMBER (expr));
5974 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
5975 decl = build_address (decl);
5976 expr = get_member_function_from_ptrfunc (&decl, expr);
5979 return build_nop (type, expr);
5982 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5983 If C_CAST_P is true, this reinterpret cast is being done as part of
5984 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5985 indicate whether or not reinterpret_cast was valid. */
5988 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
5989 bool *valid_p, tsubst_flags_t complain)
5993 /* Assume the cast is invalid. */
5997 if (type == error_mark_node || error_operand_p (expr))
5998 return error_mark_node;
6000 intype = TREE_TYPE (expr);
6002 /* Save casted types in the function's used types hash table. */
6003 used_types_insert (type);
6005 /* [expr.reinterpret.cast]
6006 An lvalue expression of type T1 can be cast to the type
6007 "reference to T2" if an expression of type "pointer to T1" can be
6008 explicitly converted to the type "pointer to T2" using a
6009 reinterpret_cast. */
6010 if (TREE_CODE (type) == REFERENCE_TYPE)
6012 if (! real_lvalue_p (expr))
6014 if (complain & tf_error)
6015 error ("invalid cast of an rvalue expression of type "
6018 return error_mark_node;
6021 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6022 "B" are related class types; the reinterpret_cast does not
6023 adjust the pointer. */
6024 if (TYPE_PTR_P (intype)
6025 && (complain & tf_warning)
6026 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6027 COMPARE_BASE | COMPARE_DERIVED)))
6028 warning (0, "casting %qT to %qT does not dereference pointer",
6031 expr = cp_build_addr_expr (expr, complain);
6033 if (warn_strict_aliasing > 2)
6034 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6036 if (expr != error_mark_node)
6037 expr = build_reinterpret_cast_1
6038 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6040 if (expr != error_mark_node)
6041 /* cp_build_indirect_ref isn't right for rvalue refs. */
6042 expr = convert_from_reference (fold_convert (type, expr));
6046 /* As a G++ extension, we consider conversions from member
6047 functions, and pointers to member functions to
6048 pointer-to-function and pointer-to-void types. If
6049 -Wno-pmf-conversions has not been specified,
6050 convert_member_func_to_ptr will issue an error message. */
6051 if ((TYPE_PTRMEMFUNC_P (intype)
6052 || TREE_CODE (intype) == METHOD_TYPE)
6053 && TYPE_PTR_P (type)
6054 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6055 || VOID_TYPE_P (TREE_TYPE (type))))
6056 return convert_member_func_to_ptr (type, expr);
6058 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6059 array-to-pointer, and function-to-pointer conversions are
6061 expr = decay_conversion (expr);
6063 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6064 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6065 if (TREE_CODE (expr) == NOP_EXPR
6066 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6067 expr = TREE_OPERAND (expr, 0);
6069 if (error_operand_p (expr))
6070 return error_mark_node;
6072 intype = TREE_TYPE (expr);
6074 /* [expr.reinterpret.cast]
6075 A pointer can be converted to any integral type large enough to
6076 hold it. ... A value of type std::nullptr_t can be converted to
6077 an integral type; the conversion has the same meaning and
6078 validity as a conversion of (void*)0 to the integral type. */
6079 if (CP_INTEGRAL_TYPE_P (type)
6080 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6082 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6084 if (complain & tf_error)
6085 permerror (input_location, "cast from %qT to %qT loses precision",
6088 return error_mark_node;
6090 if (NULLPTR_TYPE_P (intype))
6091 return build_int_cst (type, 0);
6093 /* [expr.reinterpret.cast]
6094 A value of integral or enumeration type can be explicitly
6095 converted to a pointer. */
6096 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6099 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6100 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6101 return fold_if_not_in_template (build_nop (type, expr));
6102 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6103 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6108 && check_for_casting_away_constness (intype, type,
6109 REINTERPRET_CAST_EXPR,
6111 return error_mark_node;
6112 /* Warn about possible alignment problems. */
6113 if (STRICT_ALIGNMENT && warn_cast_align
6114 && (complain & tf_warning)
6115 && !VOID_TYPE_P (type)
6116 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6117 && COMPLETE_TYPE_P (TREE_TYPE (type))
6118 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6119 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6120 warning (OPT_Wcast_align, "cast from %qT to %qT "
6121 "increases required alignment of target type", intype, type);
6123 /* We need to strip nops here, because the front end likes to
6124 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6126 if (warn_strict_aliasing <= 2)
6127 strict_aliasing_warning (intype, type, sexpr);
6129 return fold_if_not_in_template (build_nop (type, expr));
6131 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6132 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6134 if (pedantic && (complain & tf_warning))
6135 /* Only issue a warning, as we have always supported this
6136 where possible, and it is necessary in some cases. DR 195
6137 addresses this issue, but as of 2004/10/26 is still in
6139 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6140 return fold_if_not_in_template (build_nop (type, expr));
6142 else if (TREE_CODE (type) == VECTOR_TYPE)
6143 return fold_if_not_in_template (convert_to_vector (type, expr));
6144 else if (TREE_CODE (intype) == VECTOR_TYPE
6145 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6146 return fold_if_not_in_template (convert_to_integer (type, expr));
6151 if (complain & tf_error)
6152 error ("invalid cast from type %qT to type %qT", intype, type);
6153 return error_mark_node;
6156 return cp_convert (type, expr);
6160 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6162 if (type == error_mark_node || expr == error_mark_node)
6163 return error_mark_node;
6165 if (processing_template_decl)
6167 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6169 if (!TREE_SIDE_EFFECTS (t)
6170 && type_dependent_expression_p (expr))
6171 /* There might turn out to be side effects inside expr. */
6172 TREE_SIDE_EFFECTS (t) = 1;
6173 return convert_from_reference (t);
6176 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6177 /*valid_p=*/NULL, complain);
6180 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6181 return an appropriate expression. Otherwise, return
6182 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6183 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6184 performing a C-style cast, its value upon return will indicate
6185 whether or not the conversion succeeded. */
6188 build_const_cast_1 (tree dst_type, tree expr, tsubst_flags_t complain,
6192 tree reference_type;
6194 /* Callers are responsible for handling error_mark_node as a
6195 destination type. */
6196 gcc_assert (dst_type != error_mark_node);
6197 /* In a template, callers should be building syntactic
6198 representations of casts, not using this machinery. */
6199 gcc_assert (!processing_template_decl);
6201 /* Assume the conversion is invalid. */
6205 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
6207 if (complain & tf_error)
6208 error ("invalid use of const_cast with type %qT, "
6209 "which is not a pointer, "
6210 "reference, nor a pointer-to-data-member type", dst_type);
6211 return error_mark_node;
6214 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
6216 if (complain & tf_error)
6217 error ("invalid use of const_cast with type %qT, which is a pointer "
6218 "or reference to a function type", dst_type);
6219 return error_mark_node;
6222 /* Save casted types in the function's used types hash table. */
6223 used_types_insert (dst_type);
6225 src_type = TREE_TYPE (expr);
6226 /* Expressions do not really have reference types. */
6227 if (TREE_CODE (src_type) == REFERENCE_TYPE)
6228 src_type = TREE_TYPE (src_type);
6230 /* [expr.const.cast]
6232 An lvalue of type T1 can be explicitly converted to an lvalue of
6233 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6234 types) if a pointer to T1 can be explicitly converted to the type
6235 pointer to T2 using a const_cast. */
6236 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
6238 reference_type = dst_type;
6239 if (! real_lvalue_p (expr))
6241 if (complain & tf_error)
6242 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6243 src_type, dst_type);
6244 return error_mark_node;
6246 dst_type = build_pointer_type (TREE_TYPE (dst_type));
6247 src_type = build_pointer_type (src_type);
6251 reference_type = NULL_TREE;
6252 /* If the destination type is not a reference type, the
6253 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6254 conversions are performed. */
6255 src_type = type_decays_to (src_type);
6256 if (src_type == error_mark_node)
6257 return error_mark_node;
6260 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
6261 && comp_ptr_ttypes_const (dst_type, src_type))
6266 /* This cast is actually a C-style cast. Issue a warning if
6267 the user is making a potentially unsafe cast. */
6268 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR,
6273 expr = cp_build_addr_expr (expr, complain);
6274 expr = build_nop (reference_type, expr);
6275 return convert_from_reference (expr);
6279 expr = decay_conversion (expr);
6280 /* build_c_cast puts on a NOP_EXPR to make the result not an
6281 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6282 non-lvalue context. */
6283 if (TREE_CODE (expr) == NOP_EXPR
6284 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6285 expr = TREE_OPERAND (expr, 0);
6286 return build_nop (dst_type, expr);
6290 if (complain & tf_error)
6291 error ("invalid const_cast from type %qT to type %qT",
6292 src_type, dst_type);
6293 return error_mark_node;
6297 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
6299 if (type == error_mark_node || error_operand_p (expr))
6300 return error_mark_node;
6302 if (processing_template_decl)
6304 tree t = build_min (CONST_CAST_EXPR, type, expr);
6306 if (!TREE_SIDE_EFFECTS (t)
6307 && type_dependent_expression_p (expr))
6308 /* There might turn out to be side effects inside expr. */
6309 TREE_SIDE_EFFECTS (t) = 1;
6310 return convert_from_reference (t);
6313 return build_const_cast_1 (type, expr, complain,
6317 /* Like cp_build_c_cast, but for the c-common bits. */
6320 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
6322 return cp_build_c_cast (type, expr, tf_warning_or_error);
6325 /* Build an expression representing an explicit C-style cast to type
6326 TYPE of expression EXPR. */
6329 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
6335 if (type == error_mark_node || error_operand_p (expr))
6336 return error_mark_node;
6338 if (processing_template_decl)
6340 tree t = build_min (CAST_EXPR, type,
6341 tree_cons (NULL_TREE, value, NULL_TREE));
6342 /* We don't know if it will or will not have side effects. */
6343 TREE_SIDE_EFFECTS (t) = 1;
6344 return convert_from_reference (t);
6347 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6348 'Class') should always be retained, because this information aids
6349 in method lookup. */
6350 if (objc_is_object_ptr (type)
6351 && objc_is_object_ptr (TREE_TYPE (expr)))
6352 return build_nop (type, expr);
6354 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6355 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6356 if (TREE_CODE (type) != REFERENCE_TYPE
6357 && TREE_CODE (value) == NOP_EXPR
6358 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6359 value = TREE_OPERAND (value, 0);
6361 if (TREE_CODE (type) == ARRAY_TYPE)
6363 /* Allow casting from T1* to T2[] because Cfront allows it.
6364 NIHCL uses it. It is not valid ISO C++ however. */
6365 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6367 if (complain & tf_error)
6368 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6370 return error_mark_node;
6371 type = build_pointer_type (TREE_TYPE (type));
6375 if (complain & tf_error)
6376 error ("ISO C++ forbids casting to an array type %qT", type);
6377 return error_mark_node;
6381 if (TREE_CODE (type) == FUNCTION_TYPE
6382 || TREE_CODE (type) == METHOD_TYPE)
6384 if (complain & tf_error)
6385 error ("invalid cast to function type %qT", type);
6386 return error_mark_node;
6389 if (TREE_CODE (type) == POINTER_TYPE
6390 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
6391 /* Casting to an integer of smaller size is an error detected elsewhere. */
6392 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
6393 /* Don't warn about converting any constant. */
6394 && !TREE_CONSTANT (value))
6395 warning_at (input_location, OPT_Wint_to_pointer_cast,
6396 "cast to pointer from integer of different size");
6398 /* A C-style cast can be a const_cast. */
6399 result = build_const_cast_1 (type, value, complain & tf_warning,
6404 /* Or a static cast. */
6405 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6406 &valid_p, complain);
6407 /* Or a reinterpret_cast. */
6409 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6410 &valid_p, complain);
6411 /* The static_cast or reinterpret_cast may be followed by a
6414 /* A valid cast may result in errors if, for example, a
6415 conversion to am ambiguous base class is required. */
6416 && !error_operand_p (result))
6420 /* Non-class rvalues always have cv-unqualified type. */
6421 if (!CLASS_TYPE_P (type))
6422 type = TYPE_MAIN_VARIANT (type);
6423 result_type = TREE_TYPE (result);
6424 if (!CLASS_TYPE_P (result_type))
6425 result_type = TYPE_MAIN_VARIANT (result_type);
6426 /* If the type of RESULT does not match TYPE, perform a
6427 const_cast to make it match. If the static_cast or
6428 reinterpret_cast succeeded, we will differ by at most
6429 cv-qualification, so the follow-on const_cast is guaranteed
6431 if (!same_type_p (non_reference (type), non_reference (result_type)))
6433 result = build_const_cast_1 (type, result, false, &valid_p);
6434 gcc_assert (valid_p);
6439 return error_mark_node;
6442 /* For use from the C common bits. */
6444 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6445 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6446 enum tree_code modifycode,
6447 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6448 tree rhs_origtype ATTRIBUTE_UNUSED)
6450 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6453 /* Build an assignment expression of lvalue LHS from value RHS.
6454 MODIFYCODE is the code for a binary operator that we use
6455 to combine the old value of LHS with RHS to get the new value.
6456 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6458 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6461 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6462 tsubst_flags_t complain)
6466 tree lhstype = TREE_TYPE (lhs);
6467 tree olhstype = lhstype;
6468 bool plain_assign = (modifycode == NOP_EXPR);
6470 /* Avoid duplicate error messages from operands that had errors. */
6471 if (error_operand_p (lhs) || error_operand_p (rhs))
6472 return error_mark_node;
6474 /* Handle control structure constructs used as "lvalues". */
6475 switch (TREE_CODE (lhs))
6477 /* Handle --foo = 5; as these are valid constructs in C++. */
6478 case PREDECREMENT_EXPR:
6479 case PREINCREMENT_EXPR:
6480 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6481 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6482 stabilize_reference (TREE_OPERAND (lhs, 0)),
6483 TREE_OPERAND (lhs, 1));
6484 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6485 modifycode, rhs, complain);
6486 if (newrhs == error_mark_node)
6487 return error_mark_node;
6488 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6490 /* Handle (a, b) used as an "lvalue". */
6492 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6493 modifycode, rhs, complain);
6494 if (newrhs == error_mark_node)
6495 return error_mark_node;
6496 return build2 (COMPOUND_EXPR, lhstype,
6497 TREE_OPERAND (lhs, 0), newrhs);
6500 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6501 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6502 stabilize_reference (TREE_OPERAND (lhs, 0)),
6503 TREE_OPERAND (lhs, 1));
6504 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6506 if (newrhs == error_mark_node)
6507 return error_mark_node;
6508 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6512 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6513 when neither operand has side-effects. */
6514 if (!lvalue_or_else (lhs, lv_assign, complain))
6515 return error_mark_node;
6517 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6518 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6520 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6521 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6523 TREE_OPERAND (lhs, 0),
6524 TREE_OPERAND (lhs, 1)),
6525 TREE_OPERAND (lhs, 0),
6526 TREE_OPERAND (lhs, 1));
6529 /* Handle (a ? b : c) used as an "lvalue". */
6532 /* Produce (a ? (b = rhs) : (c = rhs))
6533 except that the RHS goes through a save-expr
6534 so the code to compute it is only emitted once. */
6536 tree preeval = NULL_TREE;
6538 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6540 if (complain & tf_error)
6541 error ("void value not ignored as it ought to be");
6542 return error_mark_node;
6545 rhs = stabilize_expr (rhs, &preeval);
6547 /* Check this here to avoid odd errors when trying to convert
6548 a throw to the type of the COND_EXPR. */
6549 if (!lvalue_or_else (lhs, lv_assign, complain))
6550 return error_mark_node;
6552 cond = build_conditional_expr
6553 (TREE_OPERAND (lhs, 0),
6554 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6555 modifycode, rhs, complain),
6556 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6557 modifycode, rhs, complain),
6560 if (cond == error_mark_node)
6562 /* Make sure the code to compute the rhs comes out
6563 before the split. */
6565 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6573 if (modifycode == INIT_EXPR)
6575 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6576 /* Do the default thing. */;
6577 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6579 /* Compound literal. */
6580 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6581 /* Call convert to generate an error; see PR 11063. */
6582 rhs = convert (lhstype, rhs);
6583 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6584 TREE_SIDE_EFFECTS (result) = 1;
6587 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6588 /* Do the default thing. */;
6591 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6592 result = build_special_member_call (lhs, complete_ctor_identifier,
6593 &rhs_vec, lhstype, LOOKUP_NORMAL,
6595 release_tree_vector (rhs_vec);
6596 if (result == NULL_TREE)
6597 return error_mark_node;
6603 lhs = require_complete_type_sfinae (lhs, complain);
6604 if (lhs == error_mark_node)
6605 return error_mark_node;
6607 if (modifycode == NOP_EXPR)
6609 if (c_dialect_objc ())
6611 result = objc_maybe_build_modify_expr (lhs, rhs);
6616 /* `operator=' is not an inheritable operator. */
6617 if (! MAYBE_CLASS_TYPE_P (lhstype))
6618 /* Do the default thing. */;
6621 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6622 lhs, rhs, make_node (NOP_EXPR),
6623 /*overloaded_p=*/NULL,
6625 if (result == NULL_TREE)
6626 return error_mark_node;
6633 /* A binary op has been requested. Combine the old LHS
6634 value with the RHS producing the value we should actually
6635 store into the LHS. */
6636 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6637 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6638 || MAYBE_CLASS_TYPE_P (lhstype)));
6640 lhs = stabilize_reference (lhs);
6641 newrhs = cp_build_binary_op (input_location,
6642 modifycode, lhs, rhs,
6644 if (newrhs == error_mark_node)
6646 if (complain & tf_error)
6647 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6648 TREE_TYPE (lhs), TREE_TYPE (rhs));
6649 return error_mark_node;
6652 /* Now it looks like a plain assignment. */
6653 modifycode = NOP_EXPR;
6654 if (c_dialect_objc ())
6656 result = objc_maybe_build_modify_expr (lhs, newrhs);
6661 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6662 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6665 /* The left-hand side must be an lvalue. */
6666 if (!lvalue_or_else (lhs, lv_assign, complain))
6667 return error_mark_node;
6669 /* Warn about modifying something that is `const'. Don't warn if
6670 this is initialization. */
6671 if (modifycode != INIT_EXPR
6672 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6673 /* Functions are not modifiable, even though they are
6675 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6676 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6677 /* If it's an aggregate and any field is const, then it is
6678 effectively const. */
6679 || (CLASS_TYPE_P (lhstype)
6680 && C_TYPE_FIELDS_READONLY (lhstype))))
6682 if (complain & tf_error)
6683 cxx_readonly_error (lhs, lv_assign);
6685 return error_mark_node;
6688 /* If storing into a structure or union member, it may have been given a
6689 lowered bitfield type. We need to convert to the declared type first,
6690 so retrieve it now. */
6692 olhstype = unlowered_expr_type (lhs);
6694 /* Convert new value to destination type. */
6696 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6700 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
6702 if (modifycode != INIT_EXPR)
6704 if (complain & tf_error)
6705 error ("assigning to an array from an initializer list");
6706 return error_mark_node;
6708 if (check_array_initializer (lhs, lhstype, newrhs))
6709 return error_mark_node;
6710 newrhs = digest_init (lhstype, newrhs);
6713 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6714 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
6716 if (complain & tf_error)
6717 error ("incompatible types in assignment of %qT to %qT",
6718 TREE_TYPE (rhs), lhstype);
6719 return error_mark_node;
6722 /* Allow array assignment in compiler-generated code. */
6723 else if (!current_function_decl
6724 || !DECL_ARTIFICIAL (current_function_decl))
6726 /* This routine is used for both initialization and assignment.
6727 Make sure the diagnostic message differentiates the context. */
6728 if (complain & tf_error)
6730 if (modifycode == INIT_EXPR)
6731 error ("array used as initializer");
6733 error ("invalid array assignment");
6735 return error_mark_node;
6738 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6739 ? 1 + (modifycode != INIT_EXPR): 0;
6740 return build_vec_init (lhs, NULL_TREE, newrhs,
6741 /*explicit_value_init_p=*/false,
6742 from_array, complain);
6745 if (modifycode == INIT_EXPR)
6746 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6747 LOOKUP_ONLYCONVERTING. */
6748 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6749 ICR_INIT, NULL_TREE, 0,
6752 newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
6753 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6755 if (!same_type_p (lhstype, olhstype))
6756 newrhs = cp_convert_and_check (lhstype, newrhs);
6758 if (modifycode != INIT_EXPR)
6760 if (TREE_CODE (newrhs) == CALL_EXPR
6761 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6762 newrhs = build_cplus_new (lhstype, newrhs, complain);
6764 /* Can't initialize directly from a TARGET_EXPR, since that would
6765 cause the lhs to be constructed twice, and possibly result in
6766 accidental self-initialization. So we force the TARGET_EXPR to be
6767 expanded without a target. */
6768 if (TREE_CODE (newrhs) == TARGET_EXPR)
6769 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6770 TREE_OPERAND (newrhs, 0));
6773 if (newrhs == error_mark_node)
6774 return error_mark_node;
6776 if (c_dialect_objc () && flag_objc_gc)
6778 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6784 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6785 lhstype, lhs, newrhs);
6787 TREE_SIDE_EFFECTS (result) = 1;
6789 TREE_NO_WARNING (result) = 1;
6795 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6796 tsubst_flags_t complain)
6798 if (processing_template_decl)
6799 return build_min_nt (MODOP_EXPR, lhs,
6800 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6802 if (modifycode != NOP_EXPR)
6804 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6805 make_node (modifycode),
6806 /*overloaded_p=*/NULL,
6810 TREE_NO_WARNING (rval) = 1;
6814 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6817 /* Helper function for get_delta_difference which assumes FROM is a base
6818 class of TO. Returns a delta for the conversion of pointer-to-member
6819 of FROM to pointer-to-member of TO. If the conversion is invalid and
6820 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6821 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6822 If C_CAST_P is true, this conversion is taking place as part of a
6826 get_delta_difference_1 (tree from, tree to, bool c_cast_p,
6827 tsubst_flags_t complain)
6831 base_access access = c_cast_p ? ba_unique : ba_check;
6833 /* Note: ba_quiet does not distinguish between access control and
6835 if (!(complain & tf_error))
6838 binfo = lookup_base (to, from, access, &kind);
6840 if (kind == bk_inaccessible || kind == bk_ambig)
6842 if (!(complain & tf_error))
6843 return error_mark_node;
6845 error (" in pointer to member function conversion");
6846 return size_zero_node;
6850 if (kind != bk_via_virtual)
6851 return BINFO_OFFSET (binfo);
6853 /* FROM is a virtual base class of TO. Issue an error or warning
6854 depending on whether or not this is a reinterpret cast. */
6856 if (!(complain & tf_error))
6857 return error_mark_node;
6859 error ("pointer to member conversion via virtual base %qT",
6860 BINFO_TYPE (binfo_from_vbase (binfo)));
6862 return size_zero_node;
6869 /* Get difference in deltas for different pointer to member function
6870 types. If the conversion is invalid and tf_error is not set in
6871 COMPLAIN, returns error_mark_node, otherwise returns an integer
6872 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6873 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6874 conversions as well. If C_CAST_P is true this conversion is taking
6875 place as part of a C-style cast.
6877 Note that the naming of FROM and TO is kind of backwards; the return
6878 value is what we add to a TO in order to get a FROM. They are named
6879 this way because we call this function to find out how to convert from
6880 a pointer to member of FROM to a pointer to member of TO. */
6883 get_delta_difference (tree from, tree to,
6884 bool allow_inverse_p,
6885 bool c_cast_p, tsubst_flags_t complain)
6889 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6890 /* Pointer to member of incomplete class is permitted*/
6891 result = size_zero_node;
6893 result = get_delta_difference_1 (from, to, c_cast_p, complain);
6895 if (result == error_mark_node)
6896 return error_mark_node;
6900 if (!allow_inverse_p)
6902 if (!(complain & tf_error))
6903 return error_mark_node;
6905 error_not_base_type (from, to);
6906 error (" in pointer to member conversion");
6907 result = size_zero_node;
6911 result = get_delta_difference_1 (to, from, c_cast_p, complain);
6913 if (result == error_mark_node)
6914 return error_mark_node;
6917 result = size_diffop_loc (input_location,
6918 size_zero_node, result);
6921 if (!(complain & tf_error))
6922 return error_mark_node;
6924 error_not_base_type (from, to);
6925 error (" in pointer to member conversion");
6926 result = size_zero_node;
6931 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
6935 /* Return a constructor for the pointer-to-member-function TYPE using
6936 the other components as specified. */
6939 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
6944 VEC(constructor_elt, gc) *v;
6946 /* Pull the FIELD_DECLs out of the type. */
6947 pfn_field = TYPE_FIELDS (type);
6948 delta_field = DECL_CHAIN (pfn_field);
6950 /* Make sure DELTA has the type we want. */
6951 delta = convert_and_check (delta_type_node, delta);
6953 /* Convert to the correct target type if necessary. */
6954 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
6956 /* Finish creating the initializer. */
6957 v = VEC_alloc(constructor_elt, gc, 2);
6958 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
6959 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
6960 u = build_constructor (type, v);
6961 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
6962 TREE_STATIC (u) = (TREE_CONSTANT (u)
6963 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6965 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
6970 /* Build a constructor for a pointer to member function. It can be
6971 used to initialize global variables, local variable, or used
6972 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6975 If FORCE is nonzero, then force this conversion, even if
6976 we would rather not do it. Usually set when using an explicit
6977 cast. A C-style cast is being processed iff C_CAST_P is true.
6979 Return error_mark_node, if something goes wrong. */
6982 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
6983 tsubst_flags_t complain)
6989 if (error_operand_p (pfn))
6990 return error_mark_node;
6992 pfn_type = TREE_TYPE (pfn);
6993 to_type = build_ptrmemfunc_type (type);
6995 /* Handle multiple conversions of pointer to member functions. */
6996 if (TYPE_PTRMEMFUNC_P (pfn_type))
6998 tree delta = NULL_TREE;
6999 tree npfn = NULL_TREE;
7003 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
7004 error ("invalid conversion to type %qT from type %qT",
7007 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
7008 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
7010 c_cast_p, complain);
7011 if (n == error_mark_node)
7012 return error_mark_node;
7014 /* We don't have to do any conversion to convert a
7015 pointer-to-member to its own type. But, we don't want to
7016 just return a PTRMEM_CST if there's an explicit cast; that
7017 cast should make the expression an invalid template argument. */
7018 if (TREE_CODE (pfn) != PTRMEM_CST)
7020 if (same_type_p (to_type, pfn_type))
7022 else if (integer_zerop (n))
7023 return build_reinterpret_cast (to_type, pfn,
7024 tf_warning_or_error);
7027 if (TREE_SIDE_EFFECTS (pfn))
7028 pfn = save_expr (pfn);
7030 /* Obtain the function pointer and the current DELTA. */
7031 if (TREE_CODE (pfn) == PTRMEM_CST)
7032 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
7035 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
7036 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
7039 /* Just adjust the DELTA field. */
7040 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7041 (TREE_TYPE (delta), ptrdiff_type_node));
7042 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
7043 n = cp_build_binary_op (input_location,
7044 LSHIFT_EXPR, n, integer_one_node,
7045 tf_warning_or_error);
7046 delta = cp_build_binary_op (input_location,
7047 PLUS_EXPR, delta, n, tf_warning_or_error);
7048 return build_ptrmemfunc1 (to_type, delta, npfn);
7051 /* Handle null pointer to member function conversions. */
7052 if (null_ptr_cst_p (pfn))
7054 pfn = build_c_cast (input_location, type, integer_zero_node);
7055 return build_ptrmemfunc1 (to_type,
7060 if (type_unknown_p (pfn))
7061 return instantiate_type (type, pfn, tf_warning_or_error);
7063 fn = TREE_OPERAND (pfn, 0);
7064 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7065 /* In a template, we will have preserved the
7067 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7068 return make_ptrmem_cst (to_type, fn);
7071 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7074 ??? There is no consistency as to the types returned for the above
7075 values. Some code acts as if it were a sizetype and some as if it were
7076 integer_type_node. */
7079 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7081 tree type = TREE_TYPE (cst);
7082 tree fn = PTRMEM_CST_MEMBER (cst);
7083 tree ptr_class, fn_class;
7085 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7087 /* The class that the function belongs to. */
7088 fn_class = DECL_CONTEXT (fn);
7090 /* The class that we're creating a pointer to member of. */
7091 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7093 /* First, calculate the adjustment to the function's class. */
7094 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7095 /*c_cast_p=*/0, tf_warning_or_error);
7097 if (!DECL_VIRTUAL_P (fn))
7098 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
7101 /* If we're dealing with a virtual function, we have to adjust 'this'
7102 again, to point to the base which provides the vtable entry for
7103 fn; the call will do the opposite adjustment. */
7104 tree orig_class = DECL_CONTEXT (fn);
7105 tree binfo = binfo_or_else (orig_class, fn_class);
7106 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7107 *delta, BINFO_OFFSET (binfo));
7108 *delta = fold_if_not_in_template (*delta);
7110 /* We set PFN to the vtable offset at which the function can be
7111 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7112 case delta is shifted left, and then incremented). */
7113 *pfn = DECL_VINDEX (fn);
7114 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7115 TYPE_SIZE_UNIT (vtable_entry_type));
7116 *pfn = fold_if_not_in_template (*pfn);
7118 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7120 case ptrmemfunc_vbit_in_pfn:
7121 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7123 *pfn = fold_if_not_in_template (*pfn);
7126 case ptrmemfunc_vbit_in_delta:
7127 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7128 *delta, integer_one_node);
7129 *delta = fold_if_not_in_template (*delta);
7130 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7131 *delta, integer_one_node);
7132 *delta = fold_if_not_in_template (*delta);
7139 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
7140 *pfn = fold_if_not_in_template (*pfn);
7144 /* Return an expression for PFN from the pointer-to-member function
7148 pfn_from_ptrmemfunc (tree t)
7150 if (TREE_CODE (t) == PTRMEM_CST)
7155 expand_ptrmemfunc_cst (t, &delta, &pfn);
7160 return build_ptrmemfunc_access_expr (t, pfn_identifier);
7163 /* Return an expression for DELTA from the pointer-to-member function
7167 delta_from_ptrmemfunc (tree t)
7169 if (TREE_CODE (t) == PTRMEM_CST)
7174 expand_ptrmemfunc_cst (t, &delta, &pfn);
7179 return build_ptrmemfunc_access_expr (t, delta_identifier);
7182 /* Convert value RHS to type TYPE as preparation for an assignment to
7183 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7184 implicit conversion is. If FNDECL is non-NULL, we are doing the
7185 conversion in order to pass the PARMNUMth argument of FNDECL.
7186 If FNDECL is NULL, we are doing the conversion in function pointer
7187 argument passing, conversion in initialization, etc. */
7190 convert_for_assignment (tree type, tree rhs,
7191 impl_conv_rhs errtype, tree fndecl, int parmnum,
7192 tsubst_flags_t complain, int flags)
7195 enum tree_code coder;
7197 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7198 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
7199 rhs = TREE_OPERAND (rhs, 0);
7201 rhstype = TREE_TYPE (rhs);
7202 coder = TREE_CODE (rhstype);
7204 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
7205 && vector_types_convertible_p (type, rhstype, true))
7207 rhs = mark_rvalue_use (rhs);
7208 return convert (type, rhs);
7211 if (rhs == error_mark_node || rhstype == error_mark_node)
7212 return error_mark_node;
7213 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
7214 return error_mark_node;
7216 /* The RHS of an assignment cannot have void type. */
7217 if (coder == VOID_TYPE)
7219 if (complain & tf_error)
7220 error ("void value not ignored as it ought to be");
7221 return error_mark_node;
7224 /* Simplify the RHS if possible. */
7225 if (TREE_CODE (rhs) == CONST_DECL)
7226 rhs = DECL_INITIAL (rhs);
7228 if (c_dialect_objc ())
7232 tree rname = fndecl;
7243 selector = objc_message_selector ();
7245 if (selector && parmno > 1)
7252 if (objc_compare_types (type, rhstype, parmno, rname))
7254 rhs = mark_rvalue_use (rhs);
7255 return convert (type, rhs);
7261 The expression is implicitly converted (clause _conv_) to the
7262 cv-unqualified type of the left operand.
7264 We allow bad conversions here because by the time we get to this point
7265 we are committed to doing the conversion. If we end up doing a bad
7266 conversion, convert_like will complain. */
7267 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
7269 /* When -Wno-pmf-conversions is use, we just silently allow
7270 conversions from pointers-to-members to plain pointers. If
7271 the conversion doesn't work, cp_convert will complain. */
7273 && TYPE_PTR_P (type)
7274 && TYPE_PTRMEMFUNC_P (rhstype))
7275 rhs = cp_convert (strip_top_quals (type), rhs);
7278 if (complain & tf_error)
7280 /* If the right-hand side has unknown type, then it is an
7281 overloaded function. Call instantiate_type to get error
7283 if (rhstype == unknown_type_node)
7284 instantiate_type (type, rhs, tf_warning_or_error);
7286 error ("cannot convert %qT to %qT for argument %qP to %qD",
7287 rhstype, type, parmnum, fndecl);
7291 case ICR_DEFAULT_ARGUMENT:
7292 error ("cannot convert %qT to %qT in default argument",
7296 error ("cannot convert %qT to %qT in argument passing",
7299 case ICR_CONVERTING:
7300 error ("cannot convert %qT to %qT",
7304 error ("cannot convert %qT to %qT in initialization",
7308 error ("cannot convert %qT to %qT in return",
7312 error ("cannot convert %qT to %qT in assignment",
7319 return error_mark_node;
7322 if (warn_missing_format_attribute)
7324 const enum tree_code codel = TREE_CODE (type);
7325 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7327 && check_missing_format_attribute (type, rhstype)
7328 && (complain & tf_warning))
7332 case ICR_DEFAULT_ARGUMENT:
7334 warning (OPT_Wmissing_format_attribute,
7335 "parameter %qP of %qD might be a candidate "
7336 "for a format attribute", parmnum, fndecl);
7338 warning (OPT_Wmissing_format_attribute,
7339 "parameter might be a candidate "
7340 "for a format attribute");
7342 case ICR_CONVERTING:
7343 warning (OPT_Wmissing_format_attribute,
7344 "target of conversion might be a candidate "
7345 "for a format attribute");
7348 warning (OPT_Wmissing_format_attribute,
7349 "target of initialization might be a candidate "
7350 "for a format attribute");
7353 warning (OPT_Wmissing_format_attribute,
7354 "return type might be a candidate "
7355 "for a format attribute");
7358 warning (OPT_Wmissing_format_attribute,
7359 "left-hand side of assignment might be a candidate "
7360 "for a format attribute");
7367 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7369 if (warn_parentheses
7370 && TREE_CODE (type) == BOOLEAN_TYPE
7371 && TREE_CODE (rhs) == MODIFY_EXPR
7372 && !TREE_NO_WARNING (rhs)
7373 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
7374 && (complain & tf_warning))
7376 location_t loc = EXPR_LOC_OR_HERE (rhs);
7378 warning_at (loc, OPT_Wparentheses,
7379 "suggest parentheses around assignment used as truth value");
7380 TREE_NO_WARNING (rhs) = 1;
7383 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
7387 /* Convert RHS to be of type TYPE.
7388 If EXP is nonzero, it is the target of the initialization.
7389 ERRTYPE indicates what kind of error the implicit conversion is.
7391 Two major differences between the behavior of
7392 `convert_for_assignment' and `convert_for_initialization'
7393 are that references are bashed in the former, while
7394 copied in the latter, and aggregates are assigned in
7395 the former (operator=) while initialized in the
7398 If using constructor make sure no conversion operator exists, if one does
7399 exist, an ambiguity exists.
7401 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7404 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
7405 impl_conv_rhs errtype, tree fndecl, int parmnum,
7406 tsubst_flags_t complain)
7408 enum tree_code codel = TREE_CODE (type);
7410 enum tree_code coder;
7412 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7413 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7414 if (TREE_CODE (rhs) == NOP_EXPR
7415 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
7416 && codel != REFERENCE_TYPE)
7417 rhs = TREE_OPERAND (rhs, 0);
7419 if (type == error_mark_node
7420 || rhs == error_mark_node
7421 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
7422 return error_mark_node;
7424 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
7425 && TREE_CODE (type) != ARRAY_TYPE
7426 && (TREE_CODE (type) != REFERENCE_TYPE
7427 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
7428 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
7429 && (TREE_CODE (type) != REFERENCE_TYPE
7430 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
7431 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
7432 rhs = decay_conversion (rhs);
7434 rhstype = TREE_TYPE (rhs);
7435 coder = TREE_CODE (rhstype);
7437 if (coder == ERROR_MARK)
7438 return error_mark_node;
7440 /* We accept references to incomplete types, so we can
7441 return here before checking if RHS is of complete type. */
7443 if (codel == REFERENCE_TYPE)
7445 /* This should eventually happen in convert_arguments. */
7446 int savew = 0, savee = 0;
7449 savew = warningcount, savee = errorcount;
7450 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
7451 /*cleanup=*/NULL, complain);
7454 if (warningcount > savew)
7455 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
7456 else if (errorcount > savee)
7457 error ("in passing argument %P of %q+D", parmnum, fndecl);
7463 exp = require_complete_type_sfinae (exp, complain);
7464 if (exp == error_mark_node)
7465 return error_mark_node;
7467 rhstype = non_reference (rhstype);
7469 type = complete_type (type);
7471 if (DIRECT_INIT_EXPR_P (type, rhs))
7472 /* Don't try to do copy-initialization if we already have
7473 direct-initialization. */
7476 if (MAYBE_CLASS_TYPE_P (type))
7477 return perform_implicit_conversion_flags (type, rhs, complain, flags);
7479 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7483 /* If RETVAL is the address of, or a reference to, a local variable or
7484 temporary give an appropriate warning. */
7487 maybe_warn_about_returning_address_of_local (tree retval)
7489 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7490 tree whats_returned = retval;
7494 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7495 whats_returned = TREE_OPERAND (whats_returned, 1);
7496 else if (CONVERT_EXPR_P (whats_returned)
7497 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7498 whats_returned = TREE_OPERAND (whats_returned, 0);
7503 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7505 whats_returned = TREE_OPERAND (whats_returned, 0);
7507 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7509 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7510 || TREE_CODE (whats_returned) == TARGET_EXPR)
7512 warning (0, "returning reference to temporary");
7515 if (TREE_CODE (whats_returned) == VAR_DECL
7516 && DECL_NAME (whats_returned)
7517 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7519 warning (0, "reference to non-lvalue returned");
7524 while (TREE_CODE (whats_returned) == COMPONENT_REF
7525 || TREE_CODE (whats_returned) == ARRAY_REF)
7526 whats_returned = TREE_OPERAND (whats_returned, 0);
7528 if (DECL_P (whats_returned)
7529 && DECL_NAME (whats_returned)
7530 && DECL_FUNCTION_SCOPE_P (whats_returned)
7531 && !(TREE_STATIC (whats_returned)
7532 || TREE_PUBLIC (whats_returned)))
7534 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7535 warning (0, "reference to local variable %q+D returned",
7538 warning (0, "address of local variable %q+D returned",
7544 /* Check that returning RETVAL from the current function is valid.
7545 Return an expression explicitly showing all conversions required to
7546 change RETVAL into the function return type, and to assign it to
7547 the DECL_RESULT for the function. Set *NO_WARNING to true if
7548 code reaches end of non-void function warning shouldn't be issued
7549 on this RETURN_EXPR. */
7552 check_return_expr (tree retval, bool *no_warning)
7555 /* The type actually returned by the function, after any
7558 int fn_returns_value_p;
7559 bool named_return_value_okay_p;
7561 *no_warning = false;
7563 /* A `volatile' function is one that isn't supposed to return, ever.
7564 (This is a G++ extension, used to get better code for functions
7565 that call the `volatile' function.) */
7566 if (TREE_THIS_VOLATILE (current_function_decl))
7567 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7569 /* Check for various simple errors. */
7570 if (DECL_DESTRUCTOR_P (current_function_decl))
7573 error ("returning a value from a destructor");
7576 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7578 if (in_function_try_handler)
7579 /* If a return statement appears in a handler of the
7580 function-try-block of a constructor, the program is ill-formed. */
7581 error ("cannot return from a handler of a function-try-block of a constructor");
7583 /* You can't return a value from a constructor. */
7584 error ("returning a value from a constructor");
7588 /* As an extension, deduce lambda return type from a return statement
7589 anywhere in the body. */
7590 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7592 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7593 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7595 tree type = lambda_return_type (retval);
7596 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7598 if (VOID_TYPE_P (type))
7600 else if (oldtype == NULL_TREE)
7602 pedwarn (input_location, OPT_pedantic, "lambda return type "
7603 "can only be deduced when the return statement is "
7604 "the only statement in the function body");
7605 apply_lambda_return_type (lambda, type);
7607 else if (!same_type_p (type, oldtype))
7608 error ("inconsistent types %qT and %qT deduced for "
7609 "lambda return type", type, oldtype);
7613 if (processing_template_decl)
7615 current_function_returns_value = 1;
7616 if (check_for_bare_parameter_packs (retval))
7617 retval = error_mark_node;
7621 /* When no explicit return-value is given in a function with a named
7622 return value, the named return value is used. */
7623 result = DECL_RESULT (current_function_decl);
7624 valtype = TREE_TYPE (result);
7625 gcc_assert (valtype != NULL_TREE);
7626 fn_returns_value_p = !VOID_TYPE_P (valtype);
7627 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7630 /* Check for a return statement with no return value in a function
7631 that's supposed to return a value. */
7632 if (!retval && fn_returns_value_p)
7634 permerror (input_location, "return-statement with no value, in function returning %qT",
7636 /* Clear this, so finish_function won't say that we reach the
7637 end of a non-void function (which we don't, we gave a
7639 current_function_returns_null = 0;
7640 /* And signal caller that TREE_NO_WARNING should be set on the
7641 RETURN_EXPR to avoid control reaches end of non-void function
7642 warnings in tree-cfg.c. */
7645 /* Check for a return statement with a value in a function that
7646 isn't supposed to return a value. */
7647 else if (retval && !fn_returns_value_p)
7649 if (VOID_TYPE_P (TREE_TYPE (retval)))
7650 /* You can return a `void' value from a function of `void'
7651 type. In that case, we have to evaluate the expression for
7652 its side-effects. */
7653 finish_expr_stmt (retval);
7655 permerror (input_location, "return-statement with a value, in function "
7656 "returning 'void'");
7657 current_function_returns_null = 1;
7659 /* There's really no value to return, after all. */
7663 /* Remember that this function can sometimes return without a
7665 current_function_returns_null = 1;
7667 /* Remember that this function did return a value. */
7668 current_function_returns_value = 1;
7670 /* Check for erroneous operands -- but after giving ourselves a
7671 chance to provide an error about returning a value from a void
7673 if (error_operand_p (retval))
7675 current_function_return_value = error_mark_node;
7676 return error_mark_node;
7679 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7680 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7681 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7682 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7684 && retval && null_ptr_cst_p (retval))
7685 warning (0, "%<operator new%> must not return NULL unless it is "
7686 "declared %<throw()%> (or -fcheck-new is in effect)");
7688 /* Effective C++ rule 15. See also start_function. */
7690 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7694 /* The function return type must be a reference to the current
7696 if (TREE_CODE (valtype) == REFERENCE_TYPE
7697 && same_type_ignoring_top_level_qualifiers_p
7698 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7700 /* Returning '*this' is obviously OK. */
7701 if (retval == current_class_ref)
7703 /* If we are calling a function whose return type is the same of
7704 the current class reference, it is ok. */
7705 else if (TREE_CODE (retval) == INDIRECT_REF
7706 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7711 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7714 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7716 [...] For a function with a class return type, if the expression
7717 in the return statement is the name of a local object, and the cv-
7718 unqualified type of the local object is the same as the function
7719 return type, an implementation is permitted to omit creating the tem-
7720 porary object to hold the function return value [...]
7722 So, if this is a value-returning function that always returns the same
7723 local variable, remember it.
7725 It might be nice to be more flexible, and choose the first suitable
7726 variable even if the function sometimes returns something else, but
7727 then we run the risk of clobbering the variable we chose if the other
7728 returned expression uses the chosen variable somehow. And people expect
7729 this restriction, anyway. (jason 2000-11-19)
7731 See finish_function and finalize_nrv for the rest of this optimization. */
7733 named_return_value_okay_p =
7734 (retval != NULL_TREE
7735 /* Must be a local, automatic variable. */
7736 && TREE_CODE (retval) == VAR_DECL
7737 && DECL_CONTEXT (retval) == current_function_decl
7738 && ! TREE_STATIC (retval)
7739 && ! DECL_ANON_UNION_VAR_P (retval)
7740 && (DECL_ALIGN (retval)
7741 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7742 /* The cv-unqualified type of the returned value must be the
7743 same as the cv-unqualified return type of the
7745 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7747 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7748 /* And the returned value must be non-volatile. */
7749 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7751 if (fn_returns_value_p && flag_elide_constructors)
7753 if (named_return_value_okay_p
7754 && (current_function_return_value == NULL_TREE
7755 || current_function_return_value == retval))
7756 current_function_return_value = retval;
7758 current_function_return_value = error_mark_node;
7761 /* We don't need to do any conversions when there's nothing being
7766 /* Do any required conversions. */
7767 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7768 /* No conversions are required. */
7772 /* The type the function is declared to return. */
7773 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7774 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7776 /* The functype's return type will have been set to void, if it
7777 was an incomplete type. Just treat this as 'return;' */
7778 if (VOID_TYPE_P (functype))
7779 return error_mark_node;
7781 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7782 treated as an rvalue for the purposes of overload resolution to
7783 favor move constructors over copy constructors.
7785 Note that these conditions are similar to, but not as strict as,
7786 the conditions for the named return value optimization. */
7787 if ((cxx_dialect != cxx98)
7788 && (TREE_CODE (retval) == VAR_DECL
7789 || TREE_CODE (retval) == PARM_DECL)
7790 && DECL_CONTEXT (retval) == current_function_decl
7791 && !TREE_STATIC (retval)
7792 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7794 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7795 /* This is only interesting for class type. */
7796 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7797 flags = flags | LOOKUP_PREFER_RVALUE;
7799 /* First convert the value to the function's return type, then
7800 to the type of return value's location to handle the
7801 case that functype is smaller than the valtype. */
7802 retval = convert_for_initialization
7803 (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
7804 tf_warning_or_error);
7805 retval = convert (valtype, retval);
7807 /* If the conversion failed, treat this just like `return;'. */
7808 if (retval == error_mark_node)
7810 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7811 else if (! cfun->returns_struct
7812 && TREE_CODE (retval) == TARGET_EXPR
7813 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7814 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7815 TREE_OPERAND (retval, 0));
7817 maybe_warn_about_returning_address_of_local (retval);
7820 /* Actually copy the value returned into the appropriate location. */
7821 if (retval && retval != result)
7822 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7828 /* Returns nonzero if the pointer-type FROM can be converted to the
7829 pointer-type TO via a qualification conversion. If CONSTP is -1,
7830 then we return nonzero if the pointers are similar, and the
7831 cv-qualification signature of FROM is a proper subset of that of TO.
7833 If CONSTP is positive, then all outer pointers have been
7837 comp_ptr_ttypes_real (tree to, tree from, int constp)
7839 bool to_more_cv_qualified = false;
7840 bool is_opaque_pointer = false;
7842 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7844 if (TREE_CODE (to) != TREE_CODE (from))
7847 if (TREE_CODE (from) == OFFSET_TYPE
7848 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7849 TYPE_OFFSET_BASETYPE (to)))
7852 /* Const and volatile mean something different for function types,
7853 so the usual checks are not appropriate. */
7854 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7856 if (!at_least_as_qualified_p (to, from))
7859 if (!at_least_as_qualified_p (from, to))
7863 to_more_cv_qualified = true;
7867 constp &= TYPE_READONLY (to);
7870 if (TREE_CODE (to) == VECTOR_TYPE)
7871 is_opaque_pointer = vector_targets_convertible_p (to, from);
7873 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7874 return ((constp >= 0 || to_more_cv_qualified)
7875 && (is_opaque_pointer
7876 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7880 /* When comparing, say, char ** to char const **, this function takes
7881 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7882 types to this function. */
7885 comp_ptr_ttypes (tree to, tree from)
7887 return comp_ptr_ttypes_real (to, from, 1);
7890 /* Returns true iff FNTYPE is a non-class type that involves
7891 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7892 if a parameter type is ill-formed. */
7895 error_type_p (const_tree type)
7899 switch (TREE_CODE (type))
7905 case REFERENCE_TYPE:
7907 return error_type_p (TREE_TYPE (type));
7911 if (error_type_p (TREE_TYPE (type)))
7913 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
7914 if (error_type_p (TREE_VALUE (t)))
7919 if (TYPE_PTRMEMFUNC_P (type))
7920 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
7928 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7929 type or inheritance-related types, regardless of cv-quals. */
7932 ptr_reasonably_similar (const_tree to, const_tree from)
7934 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7936 /* Any target type is similar enough to void. */
7937 if (TREE_CODE (to) == VOID_TYPE)
7938 return !error_type_p (from);
7939 if (TREE_CODE (from) == VOID_TYPE)
7940 return !error_type_p (to);
7942 if (TREE_CODE (to) != TREE_CODE (from))
7945 if (TREE_CODE (from) == OFFSET_TYPE
7946 && comptypes (TYPE_OFFSET_BASETYPE (to),
7947 TYPE_OFFSET_BASETYPE (from),
7948 COMPARE_BASE | COMPARE_DERIVED))
7951 if (TREE_CODE (to) == VECTOR_TYPE
7952 && vector_types_convertible_p (to, from, false))
7955 if (TREE_CODE (to) == INTEGER_TYPE
7956 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
7959 if (TREE_CODE (to) == FUNCTION_TYPE)
7960 return !error_type_p (to) && !error_type_p (from);
7962 if (TREE_CODE (to) != POINTER_TYPE)
7964 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
7965 COMPARE_BASE | COMPARE_DERIVED);
7969 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7970 pointer-to-member types) are the same, ignoring cv-qualification at
7974 comp_ptr_ttypes_const (tree to, tree from)
7976 bool is_opaque_pointer = false;
7978 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7980 if (TREE_CODE (to) != TREE_CODE (from))
7983 if (TREE_CODE (from) == OFFSET_TYPE
7984 && same_type_p (TYPE_OFFSET_BASETYPE (from),
7985 TYPE_OFFSET_BASETYPE (to)))
7988 if (TREE_CODE (to) == VECTOR_TYPE)
7989 is_opaque_pointer = vector_targets_convertible_p (to, from);
7991 if (TREE_CODE (to) != POINTER_TYPE)
7992 return (is_opaque_pointer
7993 || same_type_ignoring_top_level_qualifiers_p (to, from));
7997 /* Returns the type qualifiers for this type, including the qualifiers on the
7998 elements for an array type. */
8001 cp_type_quals (const_tree type)
8004 /* This CONST_CAST is okay because strip_array_types returns its
8005 argument unmodified and we assign it to a const_tree. */
8006 type = strip_array_types (CONST_CAST_TREE (type));
8007 if (type == error_mark_node
8008 /* Quals on a FUNCTION_TYPE are memfn quals. */
8009 || TREE_CODE (type) == FUNCTION_TYPE)
8010 return TYPE_UNQUALIFIED;
8011 quals = TYPE_QUALS (type);
8012 /* METHOD and REFERENCE_TYPEs should never have quals. */
8013 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
8014 && TREE_CODE (type) != REFERENCE_TYPE)
8015 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
8016 == TYPE_UNQUALIFIED));
8020 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8024 type_memfn_quals (const_tree type)
8026 if (TREE_CODE (type) == FUNCTION_TYPE)
8027 return TYPE_QUALS (type);
8028 else if (TREE_CODE (type) == METHOD_TYPE)
8029 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))));
8034 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8038 apply_memfn_quals (tree type, cp_cv_quals memfn_quals)
8040 /* Could handle METHOD_TYPE here if necessary. */
8041 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8042 if (TYPE_QUALS (type) == memfn_quals)
8044 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8046 return build_qualified_type (type, memfn_quals);
8049 /* Returns nonzero if TYPE is const or volatile. */
8052 cv_qualified_p (const_tree type)
8054 int quals = cp_type_quals (type);
8055 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
8058 /* Returns nonzero if the TYPE contains a mutable member. */
8061 cp_has_mutable_p (const_tree type)
8063 /* This CONST_CAST is okay because strip_array_types returns its
8064 argument unmodified and we assign it to a const_tree. */
8065 type = strip_array_types (CONST_CAST_TREE(type));
8067 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
8070 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8071 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8072 approximation. In particular, consider:
8075 struct S { int i; };
8076 const S s = { f(); }
8078 Here, we will make "s" as TREE_READONLY (because it is declared
8079 "const") -- only to reverse ourselves upon seeing that the
8080 initializer is non-constant. */
8083 cp_apply_type_quals_to_decl (int type_quals, tree decl)
8085 tree type = TREE_TYPE (decl);
8087 if (type == error_mark_node)
8090 if (TREE_CODE (decl) == TYPE_DECL)
8093 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
8094 && type_quals != TYPE_UNQUALIFIED));
8096 /* Avoid setting TREE_READONLY incorrectly. */
8097 if (/* If the object has a constructor, the constructor may modify
8099 TYPE_NEEDS_CONSTRUCTING (type)
8100 /* If the type isn't complete, we don't know yet if it will need
8102 || !COMPLETE_TYPE_P (type)
8103 /* If the type has a mutable component, that component might be
8105 || TYPE_HAS_MUTABLE_P (type))
8106 type_quals &= ~TYPE_QUAL_CONST;
8108 c_apply_type_quals_to_decl (type_quals, decl);
8111 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8112 exemplar types such that casting T1 to T2 is casting away constness
8113 if and only if there is no implicit conversion from T1 to T2. */
8116 casts_away_constness_r (tree *t1, tree *t2)
8121 /* [expr.const.cast]
8123 For multi-level pointer to members and multi-level mixed pointers
8124 and pointers to members (conv.qual), the "member" aspect of a
8125 pointer to member level is ignored when determining if a const
8126 cv-qualifier has been cast away. */
8127 /* [expr.const.cast]
8129 For two pointer types:
8131 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8132 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8135 casting from X1 to X2 casts away constness if, for a non-pointer
8136 type T there does not exist an implicit conversion (clause
8139 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8143 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8144 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
8145 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
8147 *t1 = cp_build_qualified_type (void_type_node,
8148 cp_type_quals (*t1));
8149 *t2 = cp_build_qualified_type (void_type_node,
8150 cp_type_quals (*t2));
8154 quals1 = cp_type_quals (*t1);
8155 quals2 = cp_type_quals (*t2);
8157 if (TYPE_PTRMEM_P (*t1))
8158 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
8160 *t1 = TREE_TYPE (*t1);
8161 if (TYPE_PTRMEM_P (*t2))
8162 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
8164 *t2 = TREE_TYPE (*t2);
8166 casts_away_constness_r (t1, t2);
8167 *t1 = build_pointer_type (*t1);
8168 *t2 = build_pointer_type (*t2);
8169 *t1 = cp_build_qualified_type (*t1, quals1);
8170 *t2 = cp_build_qualified_type (*t2, quals2);
8173 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8176 ??? This function returns non-zero if casting away qualifiers not
8177 just const. We would like to return to the caller exactly which
8178 qualifiers are casted away to give more accurate diagnostics.
8182 casts_away_constness (tree t1, tree t2)
8184 if (TREE_CODE (t2) == REFERENCE_TYPE)
8186 /* [expr.const.cast]
8188 Casting from an lvalue of type T1 to an lvalue of type T2
8189 using a reference cast casts away constness if a cast from an
8190 rvalue of type "pointer to T1" to the type "pointer to T2"
8191 casts away constness. */
8192 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
8193 return casts_away_constness (build_pointer_type (t1),
8194 build_pointer_type (TREE_TYPE (t2)));
8197 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
8198 /* [expr.const.cast]
8200 Casting from an rvalue of type "pointer to data member of X
8201 of type T1" to the type "pointer to data member of Y of type
8202 T2" casts away constness if a cast from an rvalue of type
8203 "pointer to T1" to the type "pointer to T2" casts away
8205 return casts_away_constness
8206 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
8207 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
8209 /* Casting away constness is only something that makes sense for
8210 pointer or reference types. */
8211 if (TREE_CODE (t1) != POINTER_TYPE
8212 || TREE_CODE (t2) != POINTER_TYPE)
8215 /* Top-level qualifiers don't matter. */
8216 t1 = TYPE_MAIN_VARIANT (t1);
8217 t2 = TYPE_MAIN_VARIANT (t2);
8218 casts_away_constness_r (&t1, &t2);
8219 if (!can_convert (t2, t1))
8225 /* If T is a REFERENCE_TYPE return the type to which T refers.
8226 Otherwise, return T itself. */
8229 non_reference (tree t)
8231 if (TREE_CODE (t) == REFERENCE_TYPE)
8237 /* Return nonzero if REF is an lvalue valid for this language;
8238 otherwise, print an error message and return zero. USE says
8239 how the lvalue is being used and so selects the error message. */
8242 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
8244 cp_lvalue_kind kind = lvalue_kind (ref);
8246 if (kind == clk_none)
8248 if (complain & tf_error)
8249 lvalue_error (input_location, use);
8252 else if (kind & (clk_rvalueref|clk_class))
8254 if (!(complain & tf_error))
8256 if (kind & clk_class)
8257 /* Make this a permerror because we used to accept it. */
8258 permerror (input_location, "using temporary as lvalue");
8260 error ("using xvalue (rvalue reference) as lvalue");