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
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"
38 #include "diagnostic.h"
42 #include "c-family/c-common.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);
446 /* Subroutine of composite_pointer_type to implement the recursive
447 case. See that function for documentation of the parameters. */
450 composite_pointer_type_r (tree t1, tree t2,
451 composite_pointer_operation operation,
452 tsubst_flags_t complain)
459 /* Determine the types pointed to by T1 and T2. */
460 if (TREE_CODE (t1) == POINTER_TYPE)
462 pointee1 = TREE_TYPE (t1);
463 pointee2 = TREE_TYPE (t2);
467 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
468 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
473 Otherwise, the composite pointer type is a pointer type
474 similar (_conv.qual_) to the type of one of the operands,
475 with a cv-qualification signature (_conv.qual_) that is the
476 union of the cv-qualification signatures of the operand
478 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
479 result_type = pointee1;
480 else if ((TREE_CODE (pointee1) == POINTER_TYPE
481 && TREE_CODE (pointee2) == POINTER_TYPE)
482 || (TYPE_PTR_TO_MEMBER_P (pointee1)
483 && TYPE_PTR_TO_MEMBER_P (pointee2)))
484 result_type = composite_pointer_type_r (pointee1, pointee2, operation,
488 if (complain & tf_error)
493 permerror (input_location, "comparison between "
494 "distinct pointer types %qT and %qT lacks a cast",
498 permerror (input_location, "conversion between "
499 "distinct pointer types %qT and %qT lacks a cast",
502 case CPO_CONDITIONAL_EXPR:
503 permerror (input_location, "conditional expression between "
504 "distinct pointer types %qT and %qT lacks a cast",
511 result_type = void_type_node;
513 result_type = cp_build_qualified_type (result_type,
514 (cp_type_quals (pointee1)
515 | cp_type_quals (pointee2)));
516 /* If the original types were pointers to members, so is the
518 if (TYPE_PTR_TO_MEMBER_P (t1))
520 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
521 TYPE_PTRMEM_CLASS_TYPE (t2))
522 && (complain & tf_error))
527 permerror (input_location, "comparison between "
528 "distinct pointer types %qT and %qT lacks a cast",
532 permerror (input_location, "conversion between "
533 "distinct pointer types %qT and %qT lacks a cast",
536 case CPO_CONDITIONAL_EXPR:
537 permerror (input_location, "conditional expression between "
538 "distinct pointer types %qT and %qT lacks a cast",
545 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
549 result_type = build_pointer_type (result_type);
551 /* Merge the attributes. */
552 attributes = (*targetm.merge_type_attributes) (t1, t2);
553 return build_type_attribute_variant (result_type, attributes);
556 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
557 ARG1 and ARG2 are the values with those types. The OPERATION is to
558 describe the operation between the pointer types,
559 in case an error occurs.
561 This routine also implements the computation of a common type for
562 pointers-to-members as per [expr.eq]. */
565 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
566 composite_pointer_operation operation,
567 tsubst_flags_t complain)
574 If one operand is a null pointer constant, the composite pointer
575 type is the type of the other operand. */
576 if (null_ptr_cst_p (arg1))
578 if (null_ptr_cst_p (arg2))
585 If one of the operands has type "pointer to cv1 void*", then
586 the other has type "pointer to cv2T", and the composite pointer
587 type is "pointer to cv12 void", where cv12 is the union of cv1
590 If either type is a pointer to void, make sure it is T1. */
591 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
599 /* Now, if T1 is a pointer to void, merge the qualifiers. */
600 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
605 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
610 pedwarn (input_location, OPT_pedantic,
611 "ISO C++ forbids comparison between "
612 "pointer of type %<void *%> and pointer-to-function");
615 pedwarn (input_location, OPT_pedantic,
616 "ISO C++ forbids conversion between "
617 "pointer of type %<void *%> and pointer-to-function");
619 case CPO_CONDITIONAL_EXPR:
620 pedwarn (input_location, OPT_pedantic,
621 "ISO C++ forbids conditional expression between "
622 "pointer of type %<void *%> and pointer-to-function");
629 = cp_build_qualified_type (void_type_node,
630 (cp_type_quals (TREE_TYPE (t1))
631 | cp_type_quals (TREE_TYPE (t2))));
632 result_type = build_pointer_type (result_type);
633 /* Merge the attributes. */
634 attributes = (*targetm.merge_type_attributes) (t1, t2);
635 return build_type_attribute_variant (result_type, attributes);
638 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
639 && TREE_CODE (t2) == POINTER_TYPE)
641 if (objc_have_common_type (t1, t2, -3, NULL_TREE))
642 return objc_common_type (t1, t2);
645 /* [expr.eq] permits the application of a pointer conversion to
646 bring the pointers to a common type. */
647 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
648 && CLASS_TYPE_P (TREE_TYPE (t1))
649 && CLASS_TYPE_P (TREE_TYPE (t2))
650 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
653 class1 = TREE_TYPE (t1);
654 class2 = TREE_TYPE (t2);
656 if (DERIVED_FROM_P (class1, class2))
657 t2 = (build_pointer_type
658 (cp_build_qualified_type (class1, cp_type_quals (class2))));
659 else if (DERIVED_FROM_P (class2, class1))
660 t1 = (build_pointer_type
661 (cp_build_qualified_type (class2, cp_type_quals (class1))));
664 if (complain & tf_error)
668 error ("comparison between distinct "
669 "pointer types %qT and %qT lacks a cast", t1, t2);
672 error ("conversion between distinct "
673 "pointer types %qT and %qT lacks a cast", t1, t2);
675 case CPO_CONDITIONAL_EXPR:
676 error ("conditional expression between distinct "
677 "pointer types %qT and %qT lacks a cast", t1, t2);
682 return error_mark_node;
685 /* [expr.eq] permits the application of a pointer-to-member
686 conversion to change the class type of one of the types. */
687 else if (TYPE_PTR_TO_MEMBER_P (t1)
688 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
689 TYPE_PTRMEM_CLASS_TYPE (t2)))
691 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
692 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
694 if (DERIVED_FROM_P (class1, class2))
695 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
696 else if (DERIVED_FROM_P (class2, class1))
697 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
700 if (complain & tf_error)
704 error ("comparison between distinct "
705 "pointer-to-member types %qT and %qT lacks a cast",
709 error ("conversion between distinct "
710 "pointer-to-member types %qT and %qT lacks a cast",
713 case CPO_CONDITIONAL_EXPR:
714 error ("conditional expression between distinct "
715 "pointer-to-member types %qT and %qT lacks a cast",
721 return error_mark_node;
725 return composite_pointer_type_r (t1, t2, operation, complain);
728 /* Return the merged type of two types.
729 We assume that comptypes has already been done and returned 1;
730 if that isn't so, this may crash.
732 This just combines attributes and default arguments; any other
733 differences would cause the two types to compare unalike. */
736 merge_types (tree t1, tree t2)
738 enum tree_code code1;
739 enum tree_code code2;
742 /* Save time if the two types are the same. */
745 if (original_type (t1) == original_type (t2))
748 /* If one type is nonsense, use the other. */
749 if (t1 == error_mark_node)
751 if (t2 == error_mark_node)
754 /* Merge the attributes. */
755 attributes = (*targetm.merge_type_attributes) (t1, t2);
757 if (TYPE_PTRMEMFUNC_P (t1))
758 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
759 if (TYPE_PTRMEMFUNC_P (t2))
760 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
762 code1 = TREE_CODE (t1);
763 code2 = TREE_CODE (t2);
766 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
767 if (code1 == TYPENAME_TYPE)
769 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
770 code1 = TREE_CODE (t1);
774 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
775 code2 = TREE_CODE (t2);
783 /* For two pointers, do this recursively on the target type. */
785 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
786 int quals = cp_type_quals (t1);
788 if (code1 == POINTER_TYPE)
789 t1 = build_pointer_type (target);
791 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
792 t1 = build_type_attribute_variant (t1, attributes);
793 t1 = cp_build_qualified_type (t1, quals);
795 if (TREE_CODE (target) == METHOD_TYPE)
796 t1 = build_ptrmemfunc_type (t1);
805 quals = cp_type_quals (t1);
806 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
807 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
808 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
810 t1 = cp_build_qualified_type (t1, quals);
816 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
817 /* Save space: see if the result is identical to one of the args. */
818 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
819 return build_type_attribute_variant (t1, attributes);
820 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
821 return build_type_attribute_variant (t2, attributes);
822 /* Merge the element types, and have a size if either arg has one. */
823 t1 = build_cplus_array_type
824 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
829 /* Function types: prefer the one that specified arg types.
830 If both do, merge the arg types. Also merge the return types. */
832 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
833 tree p1 = TYPE_ARG_TYPES (t1);
834 tree p2 = TYPE_ARG_TYPES (t2);
838 /* Save space: see if the result is identical to one of the args. */
839 if (valtype == TREE_TYPE (t1) && ! p2)
840 return cp_build_type_attribute_variant (t1, attributes);
841 if (valtype == TREE_TYPE (t2) && ! p1)
842 return cp_build_type_attribute_variant (t2, attributes);
844 /* Simple way if one arg fails to specify argument types. */
845 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
847 else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
850 parms = commonparms (p1, p2);
852 rval = build_function_type (valtype, parms);
853 gcc_assert (type_memfn_quals (t1) == type_memfn_quals (t2));
854 rval = apply_memfn_quals (rval, type_memfn_quals (t1));
855 raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
856 TYPE_RAISES_EXCEPTIONS (t2));
857 t1 = build_exception_variant (rval, raises);
863 /* Get this value the long way, since TYPE_METHOD_BASETYPE
864 is just the main variant of this. */
865 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
866 tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
867 TYPE_RAISES_EXCEPTIONS (t2));
870 /* If this was a member function type, get back to the
871 original type of type member function (i.e., without
872 the class instance variable up front. */
873 t1 = build_function_type (TREE_TYPE (t1),
874 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
875 t2 = build_function_type (TREE_TYPE (t2),
876 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
877 t3 = merge_types (t1, t2);
878 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
879 TYPE_ARG_TYPES (t3));
880 t1 = build_exception_variant (t3, raises);
885 /* There is no need to merge attributes into a TYPENAME_TYPE.
886 When the type is instantiated it will have whatever
887 attributes result from the instantiation. */
893 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
895 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
898 return cp_build_type_attribute_variant (t1, attributes);
901 /* Return the ARRAY_TYPE type without its domain. */
904 strip_array_domain (tree type)
907 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
908 if (TYPE_DOMAIN (type) == NULL_TREE)
910 t2 = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
911 return cp_build_type_attribute_variant (t2, TYPE_ATTRIBUTES (type));
914 /* Wrapper around cp_common_type that is used by c-common.c and other
915 front end optimizations that remove promotions.
917 Return the common type for two arithmetic types T1 and T2 under the
918 usual arithmetic conversions. The default conversions have already
919 been applied, and enumerated types converted to their compatible
923 common_type (tree t1, tree t2)
925 /* If one type is nonsense, use the other */
926 if (t1 == error_mark_node)
928 if (t2 == error_mark_node)
931 return cp_common_type (t1, t2);
934 /* Return the common type of two pointer types T1 and T2. This is the
935 type for the result of most arithmetic operations if the operands
936 have the given two types.
938 We assume that comp_target_types has already been done and returned
939 nonzero; if that isn't so, this may crash. */
942 common_pointer_type (tree t1, tree t2)
944 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
945 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
946 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
948 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
949 CPO_CONVERSION, tf_warning_or_error);
952 /* Compare two exception specifier types for exactness or subsetness, if
953 allowed. Returns false for mismatch, true for match (same, or
956 [except.spec] "If a class X ... objects of class X or any class publicly
957 and unambiguously derived from X. Similarly, if a pointer type Y * ...
958 exceptions of type Y * or that are pointers to any type publicly and
959 unambiguously derived from Y. Otherwise a function only allows exceptions
960 that have the same type ..."
961 This does not mention cv qualifiers and is different to what throw
962 [except.throw] and catch [except.catch] will do. They will ignore the
963 top level cv qualifiers, and allow qualifiers in the pointer to class
966 We implement the letter of the standard. */
969 comp_except_types (tree a, tree b, bool exact)
971 if (same_type_p (a, b))
975 if (cp_type_quals (a) || cp_type_quals (b))
978 if (TREE_CODE (a) == POINTER_TYPE
979 && TREE_CODE (b) == POINTER_TYPE)
983 if (cp_type_quals (a) || cp_type_quals (b))
987 if (TREE_CODE (a) != RECORD_TYPE
988 || TREE_CODE (b) != RECORD_TYPE)
991 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
997 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
998 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
999 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
1000 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
1001 are unordered, but we've already filtered out duplicates. Most lists will
1002 be in order, we should try to make use of that. */
1005 comp_except_specs (const_tree t1, const_tree t2, int exact)
1014 /* First handle noexcept. */
1015 if (exact < ce_exact)
1017 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
1018 and stricter than any spec. */
1019 if (t1 == noexcept_false_spec)
1020 return !nothrow_spec_p (t2) || exact == ce_derived;
1021 /* Even a derived noexcept(false) is compatible with a throwing
1023 if (t2 == noexcept_false_spec)
1024 return !nothrow_spec_p (t1);
1026 /* Otherwise, if we aren't looking for an exact match, noexcept is
1027 equivalent to throw(). */
1028 if (t1 == noexcept_true_spec)
1029 t1 = empty_except_spec;
1030 if (t2 == noexcept_true_spec)
1031 t2 = empty_except_spec;
1034 /* If any noexcept is left, it is only comparable to itself;
1035 either we're looking for an exact match or we're redeclaring a
1036 template with dependent noexcept. */
1037 if ((t1 && TREE_PURPOSE (t1))
1038 || (t2 && TREE_PURPOSE (t2)))
1040 && cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)));
1042 if (t1 == NULL_TREE) /* T1 is ... */
1043 return t2 == NULL_TREE || exact == ce_derived;
1044 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
1045 return t2 != NULL_TREE && !TREE_VALUE (t2);
1046 if (t2 == NULL_TREE) /* T2 is ... */
1048 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1049 return exact == ce_derived;
1051 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1052 Count how many we find, to determine exactness. For exact matching and
1053 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1055 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1057 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1059 tree a = TREE_VALUE (probe);
1060 tree b = TREE_VALUE (t2);
1062 if (comp_except_types (a, b, exact))
1064 if (probe == base && exact > ce_derived)
1065 base = TREE_CHAIN (probe);
1070 if (probe == NULL_TREE)
1073 return exact == ce_derived || base == NULL_TREE || length == list_length (t1);
1076 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1077 [] can match [size]. */
1080 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1089 /* The type of the array elements must be the same. */
1090 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1093 d1 = TYPE_DOMAIN (t1);
1094 d2 = TYPE_DOMAIN (t2);
1099 /* If one of the arrays is dimensionless, and the other has a
1100 dimension, they are of different types. However, it is valid to
1108 declarations for an array object can specify
1109 array types that differ by the presence or absence of a major
1110 array bound (_dcl.array_). */
1112 return allow_redeclaration;
1114 /* Check that the dimensions are the same. */
1116 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1118 max1 = TYPE_MAX_VALUE (d1);
1119 max2 = TYPE_MAX_VALUE (d2);
1120 if (processing_template_decl && !abi_version_at_least (2)
1121 && !value_dependent_expression_p (max1)
1122 && !value_dependent_expression_p (max2))
1124 /* With abi-1 we do not fold non-dependent array bounds, (and
1125 consequently mangle them incorrectly). We must therefore
1126 fold them here, to verify the domains have the same
1132 if (!cp_tree_equal (max1, max2))
1138 /* Compare the relative position of T1 and T2 into their respective
1139 template parameter list.
1140 T1 and T2 must be template parameter types.
1141 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1144 comp_template_parms_position (tree t1, tree t2)
1146 gcc_assert (t1 && t2
1147 && TREE_CODE (t1) == TREE_CODE (t2)
1148 && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1149 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1150 || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1152 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1153 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1154 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1155 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1161 /* Subroutine of incompatible_dependent_types_p.
1162 Return the template parameter of the dependent type T.
1163 If T is a typedef, return the template parameters of
1164 the _decl_ of the typedef. T must be a dependent type. */
1167 get_template_parms_of_dependent_type (tree t)
1169 tree tinfo = NULL_TREE, tparms = NULL_TREE;
1171 /* First, try the obvious case of getting the
1172 template info from T itself. */
1173 if ((tinfo = get_template_info (t)))
1175 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
1176 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t);
1177 else if (typedef_variant_p (t)
1178 && !NAMESPACE_SCOPE_P (TYPE_NAME (t)))
1179 tinfo = get_template_info (DECL_CONTEXT (TYPE_NAME (t)));
1180 /* If T is a TYPENAME_TYPE which context is a template type
1181 parameter, get the template parameters from that context. */
1182 else if (TYPE_CONTEXT (t)
1183 && TREE_CODE (TYPE_CONTEXT (t)) == TEMPLATE_TYPE_PARM)
1184 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t));
1185 else if (TYPE_CONTEXT (t)
1186 && !NAMESPACE_SCOPE_P (t))
1187 tinfo = get_template_info (TYPE_CONTEXT (t));
1190 tparms = DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo));
1195 /* Subroutine of structural_comptypes.
1196 Compare the dependent types T1 and T2.
1197 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1198 The whole point of this function is to support cases where either T1 or
1199 T2 is a typedef. In those cases, we need to compare the template parameters
1200 of the _decl_ of the typedef. If those don't match then we know T1
1201 and T2 cannot be equal. */
1204 incompatible_dependent_types_p (tree t1, tree t2)
1206 tree tparms1 = NULL_TREE, tparms2 = NULL_TREE;
1207 bool t1_typedef_variant_p, t2_typedef_variant_p;
1209 if (!uses_template_parms (t1) || !uses_template_parms (t2))
1212 if (TREE_CODE (t1) == TEMPLATE_TYPE_PARM)
1214 /* If T1 and T2 don't have the same relative position in their
1215 template parameters set, they can't be equal. */
1216 if (!comp_template_parms_position (t1, t2))
1220 t1_typedef_variant_p = typedef_variant_p (t1);
1221 t2_typedef_variant_p = typedef_variant_p (t2);
1223 /* Either T1 or T2 must be a typedef. */
1224 if (!t1_typedef_variant_p && !t2_typedef_variant_p)
1227 if (!t1_typedef_variant_p || !t2_typedef_variant_p)
1228 /* Either T1 or T2 is not a typedef so we cannot compare the
1229 template parms of the typedefs of T1 and T2.
1230 At this point, if the main variant type of T1 and T2 are equal
1231 it means the two types can't be incompatible, from the perspective
1232 of this function. */
1233 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1236 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1237 Let's compare their template parameters. */
1239 tparms1 = get_template_parms_of_dependent_type (t1);
1240 tparms2 = get_template_parms_of_dependent_type (t2);
1242 /* If T2 is a template type parm and if we could not get the template
1243 parms it belongs to, that means we have not finished parsing the
1244 full set of template parameters of the template declaration it
1245 belongs to yet. If we could get the template parms T1 belongs to,
1246 that mostly means T1 and T2 belongs to templates that are
1247 different and incompatible. */
1248 if (TREE_CODE (t1) == TEMPLATE_TYPE_PARM
1249 && (tparms1 == NULL_TREE || tparms2 == NULL_TREE)
1250 && tparms1 != tparms2)
1253 if (tparms1 == NULL_TREE
1254 || tparms2 == NULL_TREE
1255 || tparms1 == tparms2)
1258 /* And now compare the mighty template parms! */
1259 return !comp_template_parms (tparms1, tparms2);
1262 /* Subroutine in comptypes. */
1265 structural_comptypes (tree t1, tree t2, int strict)
1270 /* Suppress errors caused by previously reported errors. */
1271 if (t1 == error_mark_node || t2 == error_mark_node)
1274 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1276 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1277 current instantiation. */
1278 if (TREE_CODE (t1) == TYPENAME_TYPE)
1279 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1281 if (TREE_CODE (t2) == TYPENAME_TYPE)
1282 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1284 if (TYPE_PTRMEMFUNC_P (t1))
1285 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1286 if (TYPE_PTRMEMFUNC_P (t2))
1287 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1289 /* Different classes of types can't be compatible. */
1290 if (TREE_CODE (t1) != TREE_CODE (t2))
1293 /* Qualifiers must match. For array types, we will check when we
1294 recur on the array element types. */
1295 if (TREE_CODE (t1) != ARRAY_TYPE
1296 && cp_type_quals (t1) != cp_type_quals (t2))
1298 if (TREE_CODE (t1) == FUNCTION_TYPE
1299 && type_memfn_quals (t1) != type_memfn_quals (t2))
1301 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1304 /* If T1 and T2 are dependent typedefs then check upfront that
1305 the template parameters of their typedef DECLs match before
1306 going down checking their subtypes. */
1307 if (incompatible_dependent_types_p (t1, t2))
1310 /* Allow for two different type nodes which have essentially the same
1311 definition. Note that we already checked for equality of the type
1312 qualifiers (just above). */
1314 if (TREE_CODE (t1) != ARRAY_TYPE
1315 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1319 /* Compare the types. Break out if they could be the same. */
1320 switch (TREE_CODE (t1))
1324 /* All void and bool types are the same. */
1328 case FIXED_POINT_TYPE:
1330 /* With these nodes, we can't determine type equivalence by
1331 looking at what is stored in the nodes themselves, because
1332 two nodes might have different TYPE_MAIN_VARIANTs but still
1333 represent the same type. For example, wchar_t and int could
1334 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1335 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1336 and are distinct types. On the other hand, int and the
1339 typedef int INT __attribute((may_alias));
1341 have identical properties, different TYPE_MAIN_VARIANTs, but
1342 represent the same type. The canonical type system keeps
1343 track of equivalence in this case, so we fall back on it. */
1344 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1346 case TEMPLATE_TEMPLATE_PARM:
1347 case BOUND_TEMPLATE_TEMPLATE_PARM:
1348 if (!comp_template_parms_position (t1, t2))
1350 if (!comp_template_parms
1351 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1352 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1354 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1356 /* Don't check inheritance. */
1357 strict = COMPARE_STRICT;
1362 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1363 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1364 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1365 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1368 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1370 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1376 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1377 strict & ~COMPARE_REDECLARATION))
1379 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1383 case REFERENCE_TYPE:
1384 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1386 /* fall through to checks for pointer types */
1389 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1390 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1391 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1397 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1399 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1404 /* Target types must match incl. qualifiers. */
1405 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1409 case TEMPLATE_TYPE_PARM:
1410 /* If incompatible_dependent_types_p called earlier didn't decide
1411 T1 and T2 were different, they might be equal. */
1415 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1416 TYPENAME_TYPE_FULLNAME (t2)))
1418 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1422 case UNBOUND_CLASS_TEMPLATE:
1423 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1425 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1430 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1435 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1436 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1440 case TYPE_PACK_EXPANSION:
1441 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1442 PACK_EXPANSION_PATTERN (t2));
1445 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1446 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1447 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1448 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1449 || (DECLTYPE_FOR_LAMBDA_RETURN (t1)
1450 != DECLTYPE_FOR_LAMBDA_RETURN (t2))
1451 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1452 DECLTYPE_TYPE_EXPR (t2)))
1460 /* If we get here, we know that from a target independent POV the
1461 types are the same. Make sure the target attributes are also
1463 return targetm.comp_type_attributes (t1, t2);
1466 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1467 is a bitwise-or of the COMPARE_* flags. */
1470 comptypes (tree t1, tree t2, int strict)
1472 if (strict == COMPARE_STRICT)
1477 if (t1 == error_mark_node || t2 == error_mark_node)
1480 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1481 /* At least one of the types requires structural equality, so
1482 perform a deep check. */
1483 return structural_comptypes (t1, t2, strict);
1485 #ifdef ENABLE_CHECKING
1486 if (USE_CANONICAL_TYPES)
1488 bool result = structural_comptypes (t1, t2, strict);
1490 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1491 /* The two types are structurally equivalent, but their
1492 canonical types were different. This is a failure of the
1493 canonical type propagation code.*/
1495 ("canonical types differ for identical types %T and %T",
1497 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1498 /* Two types are structurally different, but the canonical
1499 types are the same. This means we were over-eager in
1500 assigning canonical types. */
1502 ("same canonical type node for different types %T and %T",
1508 if (USE_CANONICAL_TYPES)
1509 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1512 return structural_comptypes (t1, t2, strict);
1514 else if (strict == COMPARE_STRUCTURAL)
1515 return structural_comptypes (t1, t2, COMPARE_STRICT);
1517 return structural_comptypes (t1, t2, strict);
1520 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1521 top-level qualifiers. */
1524 same_type_ignoring_top_level_qualifiers_p (tree type1, tree type2)
1526 if (type1 == error_mark_node || type2 == error_mark_node)
1529 return same_type_p (TYPE_MAIN_VARIANT (type1), TYPE_MAIN_VARIANT (type2));
1532 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1535 at_least_as_qualified_p (const_tree type1, const_tree type2)
1537 int q1 = cp_type_quals (type1);
1538 int q2 = cp_type_quals (type2);
1540 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1541 return (q1 & q2) == q2;
1544 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1545 more cv-qualified that TYPE1, and 0 otherwise. */
1548 comp_cv_qualification (const_tree type1, const_tree type2)
1550 int q1 = cp_type_quals (type1);
1551 int q2 = cp_type_quals (type2);
1556 if ((q1 & q2) == q2)
1558 else if ((q1 & q2) == q1)
1564 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1565 subset of the cv-qualification signature of TYPE2, and the types
1566 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1569 comp_cv_qual_signature (tree type1, tree type2)
1571 if (comp_ptr_ttypes_real (type2, type1, -1))
1573 else if (comp_ptr_ttypes_real (type1, type2, -1))
1579 /* Subroutines of `comptypes'. */
1581 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1582 equivalent in the sense that functions with those parameter types
1583 can have equivalent types. The two lists must be equivalent,
1584 element by element. */
1587 compparms (const_tree parms1, const_tree parms2)
1591 /* An unspecified parmlist matches any specified parmlist
1592 whose argument types don't need default promotions. */
1594 for (t1 = parms1, t2 = parms2;
1596 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1598 /* If one parmlist is shorter than the other,
1599 they fail to match. */
1602 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1609 /* Process a sizeof or alignof expression where the operand is a
1613 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1618 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1619 if (type == error_mark_node)
1620 return error_mark_node;
1622 type = non_reference (type);
1623 if (TREE_CODE (type) == METHOD_TYPE)
1626 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1627 "invalid application of %qs to a member function",
1628 operator_name_info[(int) op].name);
1629 value = size_one_node;
1632 dependent_p = dependent_type_p (type);
1634 complete_type (type);
1636 /* VLA types will have a non-constant size. In the body of an
1637 uninstantiated template, we don't need to try to compute the
1638 value, because the sizeof expression is not an integral
1639 constant expression in that case. And, if we do try to
1640 compute the value, we'll likely end up with SAVE_EXPRs, which
1641 the template substitution machinery does not expect to see. */
1642 || (processing_template_decl
1643 && COMPLETE_TYPE_P (type)
1644 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1646 value = build_min (op, size_type_node, type);
1647 TREE_READONLY (value) = 1;
1651 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1656 /* Return the size of the type, without producing any warnings for
1657 types whose size cannot be taken. This routine should be used only
1658 in some other routine that has already produced a diagnostic about
1659 using the size of such a type. */
1661 cxx_sizeof_nowarn (tree type)
1663 if (TREE_CODE (type) == FUNCTION_TYPE
1664 || TREE_CODE (type) == VOID_TYPE
1665 || TREE_CODE (type) == ERROR_MARK)
1666 return size_one_node;
1667 else if (!COMPLETE_TYPE_P (type))
1668 return size_zero_node;
1670 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1673 /* Process a sizeof expression where the operand is an expression. */
1676 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1678 if (e == error_mark_node)
1679 return error_mark_node;
1681 if (processing_template_decl)
1683 e = build_min (SIZEOF_EXPR, size_type_node, e);
1684 TREE_SIDE_EFFECTS (e) = 0;
1685 TREE_READONLY (e) = 1;
1690 /* To get the size of a static data member declared as an array of
1691 unknown bound, we need to instantiate it. */
1692 if (TREE_CODE (e) == VAR_DECL
1693 && VAR_HAD_UNKNOWN_BOUND (e)
1694 && DECL_TEMPLATE_INSTANTIATION (e))
1695 instantiate_decl (e, /*defer_ok*/true, /*expl_inst_mem*/false);
1697 e = mark_type_use (e);
1699 if (TREE_CODE (e) == COMPONENT_REF
1700 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1701 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1703 if (complain & tf_error)
1704 error ("invalid application of %<sizeof%> to a bit-field");
1706 return error_mark_node;
1709 else if (is_overloaded_fn (e))
1711 if (complain & tf_error)
1712 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1715 return error_mark_node;
1718 else if (type_unknown_p (e))
1720 if (complain & tf_error)
1721 cxx_incomplete_type_error (e, TREE_TYPE (e));
1723 return error_mark_node;
1729 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1732 /* Implement the __alignof keyword: Return the minimum required
1733 alignment of E, measured in bytes. For VAR_DECL's and
1734 FIELD_DECL's return DECL_ALIGN (which can be set from an
1735 "aligned" __attribute__ specification). */
1738 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1742 if (e == error_mark_node)
1743 return error_mark_node;
1745 if (processing_template_decl)
1747 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1748 TREE_SIDE_EFFECTS (e) = 0;
1749 TREE_READONLY (e) = 1;
1754 e = mark_type_use (e);
1756 if (TREE_CODE (e) == VAR_DECL)
1757 t = size_int (DECL_ALIGN_UNIT (e));
1758 else if (TREE_CODE (e) == COMPONENT_REF
1759 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1760 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1762 if (complain & tf_error)
1763 error ("invalid application of %<__alignof%> to a bit-field");
1765 return error_mark_node;
1768 else if (TREE_CODE (e) == COMPONENT_REF
1769 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1770 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1771 else if (is_overloaded_fn (e))
1773 if (complain & tf_error)
1774 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1777 return error_mark_node;
1778 if (TREE_CODE (e) == FUNCTION_DECL)
1779 t = size_int (DECL_ALIGN_UNIT (e));
1783 else if (type_unknown_p (e))
1785 if (complain & tf_error)
1786 cxx_incomplete_type_error (e, TREE_TYPE (e));
1788 return error_mark_node;
1792 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1793 complain & tf_error);
1795 return fold_convert (size_type_node, t);
1798 /* Process a sizeof or alignof expression E with code OP where the operand
1799 is an expression. */
1802 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1804 if (op == SIZEOF_EXPR)
1805 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1807 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1810 /* EXPR is being used in a context that is not a function call.
1815 The expression can be used only as the left-hand operand of a
1816 member function call.
1818 [expr.mptr.operator]
1820 If the result of .* or ->* is a function, then that result can be
1821 used only as the operand for the function call operator ().
1823 by issuing an error message if appropriate. Returns true iff EXPR
1824 violates these rules. */
1827 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1829 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1831 if (complain & tf_error)
1832 error ("invalid use of non-static member function");
1838 /* If EXP is a reference to a bitfield, and the type of EXP does not
1839 match the declared type of the bitfield, return the declared type
1840 of the bitfield. Otherwise, return NULL_TREE. */
1843 is_bitfield_expr_with_lowered_type (const_tree exp)
1845 switch (TREE_CODE (exp))
1848 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1849 ? TREE_OPERAND (exp, 1)
1850 : TREE_OPERAND (exp, 0)))
1852 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1855 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1859 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1865 field = TREE_OPERAND (exp, 1);
1866 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1868 if (same_type_ignoring_top_level_qualifiers_p
1869 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1871 return DECL_BIT_FIELD_TYPE (field);
1875 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1876 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1877 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1885 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1886 bitfield with a lowered type, the type of EXP is returned, rather
1890 unlowered_expr_type (const_tree exp)
1894 type = is_bitfield_expr_with_lowered_type (exp);
1896 type = TREE_TYPE (exp);
1901 /* Perform the conversions in [expr] that apply when an lvalue appears
1902 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1903 function-to-pointer conversions. In addition, manifest constants
1904 are replaced by their values, and bitfield references are converted
1905 to their declared types. Note that this function does not perform the
1906 lvalue-to-rvalue conversion for class types. If you need that conversion
1907 to for class types, then you probably need to use force_rvalue.
1909 Although the returned value is being used as an rvalue, this
1910 function does not wrap the returned expression in a
1911 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1912 that the return value is no longer an lvalue. */
1915 decay_conversion (tree exp)
1918 enum tree_code code;
1920 type = TREE_TYPE (exp);
1921 if (type == error_mark_node)
1922 return error_mark_node;
1924 exp = mark_rvalue_use (exp);
1926 exp = resolve_nondeduced_context (exp);
1927 if (type_unknown_p (exp))
1929 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1930 return error_mark_node;
1933 exp = decl_constant_value (exp);
1934 if (error_operand_p (exp))
1935 return error_mark_node;
1937 if (NULLPTR_TYPE_P (type))
1938 return nullptr_node;
1940 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1941 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1942 code = TREE_CODE (type);
1943 if (code == VOID_TYPE)
1945 error ("void value not ignored as it ought to be");
1946 return error_mark_node;
1948 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1949 return error_mark_node;
1950 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1951 return cp_build_addr_expr (exp, tf_warning_or_error);
1952 if (code == ARRAY_TYPE)
1957 if (TREE_CODE (exp) == INDIRECT_REF)
1958 return build_nop (build_pointer_type (TREE_TYPE (type)),
1959 TREE_OPERAND (exp, 0));
1961 if (TREE_CODE (exp) == COMPOUND_EXPR)
1963 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1964 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1965 TREE_OPERAND (exp, 0), op1);
1969 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1971 error ("invalid use of non-lvalue array");
1972 return error_mark_node;
1975 ptrtype = build_pointer_type (TREE_TYPE (type));
1977 if (TREE_CODE (exp) == VAR_DECL)
1979 if (!cxx_mark_addressable (exp))
1980 return error_mark_node;
1981 adr = build_nop (ptrtype, build_address (exp));
1984 /* This way is better for a COMPONENT_REF since it can
1985 simplify the offset for a component. */
1986 adr = cp_build_addr_expr (exp, tf_warning_or_error);
1987 return cp_convert (ptrtype, adr);
1990 /* If a bitfield is used in a context where integral promotion
1991 applies, then the caller is expected to have used
1992 default_conversion. That function promotes bitfields correctly
1993 before calling this function. At this point, if we have a
1994 bitfield referenced, we may assume that is not subject to
1995 promotion, and that, therefore, the type of the resulting rvalue
1996 is the declared type of the bitfield. */
1997 exp = convert_bitfield_to_declared_type (exp);
1999 /* We do not call rvalue() here because we do not want to wrap EXP
2000 in a NON_LVALUE_EXPR. */
2004 Non-class rvalues always have cv-unqualified types. */
2005 type = TREE_TYPE (exp);
2006 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
2007 exp = build_nop (cv_unqualified (type), exp);
2012 /* Perform preparatory conversions, as part of the "usual arithmetic
2013 conversions". In particular, as per [expr]:
2015 Whenever an lvalue expression appears as an operand of an
2016 operator that expects the rvalue for that operand, the
2017 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2018 standard conversions are applied to convert the expression to an
2021 In addition, we perform integral promotions here, as those are
2022 applied to both operands to a binary operator before determining
2023 what additional conversions should apply. */
2026 default_conversion (tree exp)
2028 /* Check for target-specific promotions. */
2029 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
2031 exp = cp_convert (promoted_type, exp);
2032 /* Perform the integral promotions first so that bitfield
2033 expressions (which may promote to "int", even if the bitfield is
2034 declared "unsigned") are promoted correctly. */
2035 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
2036 exp = perform_integral_promotions (exp);
2037 /* Perform the other conversions. */
2038 exp = decay_conversion (exp);
2043 /* EXPR is an expression with an integral or enumeration type.
2044 Perform the integral promotions in [conv.prom], and return the
2048 perform_integral_promotions (tree expr)
2053 expr = mark_rvalue_use (expr);
2057 If the bitfield has an enumerated type, it is treated as any
2058 other value of that type for promotion purposes. */
2059 type = is_bitfield_expr_with_lowered_type (expr);
2060 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
2061 type = TREE_TYPE (expr);
2062 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
2063 promoted_type = type_promotes_to (type);
2064 if (type != promoted_type)
2065 expr = cp_convert (promoted_type, expr);
2069 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2070 decay_conversion to one. */
2073 string_conv_p (const_tree totype, const_tree exp, int warn)
2077 if (TREE_CODE (totype) != POINTER_TYPE)
2080 t = TREE_TYPE (totype);
2081 if (!same_type_p (t, char_type_node)
2082 && !same_type_p (t, char16_type_node)
2083 && !same_type_p (t, char32_type_node)
2084 && !same_type_p (t, wchar_type_node))
2087 if (TREE_CODE (exp) == STRING_CST)
2089 /* Make sure that we don't try to convert between char and wide chars. */
2090 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
2095 /* Is this a string constant which has decayed to 'const char *'? */
2096 t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
2097 if (!same_type_p (TREE_TYPE (exp), t))
2100 if (TREE_CODE (exp) != ADDR_EXPR
2101 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
2105 /* This warning is not very useful, as it complains about printf. */
2107 warning (OPT_Wwrite_strings,
2108 "deprecated conversion from string constant to %qT",
2114 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2115 can, for example, use as an lvalue. This code used to be in
2116 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2117 expressions, where we're dealing with aggregates. But now it's again only
2118 called from unary_complex_lvalue. The case (in particular) that led to
2119 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2123 rationalize_conditional_expr (enum tree_code code, tree t,
2124 tsubst_flags_t complain)
2126 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2127 the first operand is always the one to be used if both operands
2128 are equal, so we know what conditional expression this used to be. */
2129 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2131 tree op0 = TREE_OPERAND (t, 0);
2132 tree op1 = TREE_OPERAND (t, 1);
2134 /* The following code is incorrect if either operand side-effects. */
2135 gcc_assert (!TREE_SIDE_EFFECTS (op0)
2136 && !TREE_SIDE_EFFECTS (op1));
2138 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
2139 ? LE_EXPR : GE_EXPR),
2140 op0, TREE_CODE (op0),
2141 op1, TREE_CODE (op1),
2142 /*overloaded_p=*/NULL,
2144 cp_build_unary_op (code, op0, 0, complain),
2145 cp_build_unary_op (code, op1, 0, complain),
2150 build_conditional_expr (TREE_OPERAND (t, 0),
2151 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
2153 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
2158 /* Given the TYPE of an anonymous union field inside T, return the
2159 FIELD_DECL for the field. If not found return NULL_TREE. Because
2160 anonymous unions can nest, we must also search all anonymous unions
2161 that are directly reachable. */
2164 lookup_anon_field (tree t, tree type)
2168 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
2170 if (TREE_STATIC (field))
2172 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
2175 /* If we find it directly, return the field. */
2176 if (DECL_NAME (field) == NULL_TREE
2177 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
2182 /* Otherwise, it could be nested, search harder. */
2183 if (DECL_NAME (field) == NULL_TREE
2184 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2186 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2194 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2195 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2196 non-NULL, it indicates the path to the base used to name MEMBER.
2197 If PRESERVE_REFERENCE is true, the expression returned will have
2198 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2199 returned will have the type referred to by the reference.
2201 This function does not perform access control; that is either done
2202 earlier by the parser when the name of MEMBER is resolved to MEMBER
2203 itself, or later when overload resolution selects one of the
2204 functions indicated by MEMBER. */
2207 build_class_member_access_expr (tree object, tree member,
2208 tree access_path, bool preserve_reference,
2209 tsubst_flags_t complain)
2213 tree result = NULL_TREE;
2215 if (error_operand_p (object) || error_operand_p (member))
2216 return error_mark_node;
2218 gcc_assert (DECL_P (member) || BASELINK_P (member));
2222 The type of the first expression shall be "class object" (of a
2224 object_type = TREE_TYPE (object);
2225 if (!currently_open_class (object_type)
2226 && !complete_type_or_maybe_complain (object_type, object, complain))
2227 return error_mark_node;
2228 if (!CLASS_TYPE_P (object_type))
2230 if (complain & tf_error)
2231 error ("request for member %qD in %qE, which is of non-class type %qT",
2232 member, object, object_type);
2233 return error_mark_node;
2236 /* The standard does not seem to actually say that MEMBER must be a
2237 member of OBJECT_TYPE. However, that is clearly what is
2239 if (DECL_P (member))
2241 member_scope = DECL_CLASS_CONTEXT (member);
2243 if (TREE_DEPRECATED (member))
2244 warn_deprecated_use (member, NULL_TREE);
2247 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2248 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2249 presently be the anonymous union. Go outwards until we find a
2250 type related to OBJECT_TYPE. */
2251 while (ANON_AGGR_TYPE_P (member_scope)
2252 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2254 member_scope = TYPE_CONTEXT (member_scope);
2255 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2257 if (complain & tf_error)
2259 if (TREE_CODE (member) == FIELD_DECL)
2260 error ("invalid use of nonstatic data member %qE", member);
2262 error ("%qD is not a member of %qT", member, object_type);
2264 return error_mark_node;
2267 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2268 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2269 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2271 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2273 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2276 /* In [expr.ref], there is an explicit list of the valid choices for
2277 MEMBER. We check for each of those cases here. */
2278 if (TREE_CODE (member) == VAR_DECL)
2280 /* A static data member. */
2282 mark_exp_read (object);
2283 /* If OBJECT has side-effects, they are supposed to occur. */
2284 if (TREE_SIDE_EFFECTS (object))
2285 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2287 else if (TREE_CODE (member) == FIELD_DECL)
2289 /* A non-static data member. */
2294 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2295 && integer_zerop (TREE_OPERAND (object, 0)));
2297 /* Convert OBJECT to the type of MEMBER. */
2298 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2299 TYPE_MAIN_VARIANT (member_scope)))
2304 binfo = lookup_base (access_path ? access_path : object_type,
2305 member_scope, ba_unique, &kind);
2306 if (binfo == error_mark_node)
2307 return error_mark_node;
2309 /* It is invalid to try to get to a virtual base of a
2310 NULL object. The most common cause is invalid use of
2312 if (null_object_p && kind == bk_via_virtual)
2314 if (complain & tf_error)
2316 error ("invalid access to non-static data member %qD of "
2319 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2321 return error_mark_node;
2324 /* Convert to the base. */
2325 object = build_base_path (PLUS_EXPR, object, binfo,
2327 /* If we found the base successfully then we should be able
2328 to convert to it successfully. */
2329 gcc_assert (object != error_mark_node);
2332 /* Complain about other invalid uses of offsetof, even though they will
2333 give the right answer. Note that we complain whether or not they
2334 actually used the offsetof macro, since there's no way to know at this
2335 point. So we just give a warning, instead of a pedwarn. */
2336 /* Do not produce this warning for base class field references, because
2337 we know for a fact that didn't come from offsetof. This does occur
2338 in various testsuite cases where a null object is passed where a
2339 vtable access is required. */
2340 if (null_object_p && warn_invalid_offsetof
2341 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2342 && !DECL_FIELD_IS_BASE (member)
2343 && cp_unevaluated_operand == 0
2344 && (complain & tf_warning))
2346 warning (OPT_Winvalid_offsetof,
2347 "invalid access to non-static data member %qD "
2348 " of NULL object", member);
2349 warning (OPT_Winvalid_offsetof,
2350 "(perhaps the %<offsetof%> macro was used incorrectly)");
2353 /* If MEMBER is from an anonymous aggregate, we have converted
2354 OBJECT so that it refers to the class containing the
2355 anonymous union. Generate a reference to the anonymous union
2356 itself, and recur to find MEMBER. */
2357 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2358 /* When this code is called from build_field_call, the
2359 object already has the type of the anonymous union.
2360 That is because the COMPONENT_REF was already
2361 constructed, and was then disassembled before calling
2362 build_field_call. After the function-call code is
2363 cleaned up, this waste can be eliminated. */
2364 && (!same_type_ignoring_top_level_qualifiers_p
2365 (TREE_TYPE (object), DECL_CONTEXT (member))))
2367 tree anonymous_union;
2369 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2370 DECL_CONTEXT (member));
2371 object = build_class_member_access_expr (object,
2373 /*access_path=*/NULL_TREE,
2378 /* Compute the type of the field, as described in [expr.ref]. */
2379 type_quals = TYPE_UNQUALIFIED;
2380 member_type = TREE_TYPE (member);
2381 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2383 type_quals = (cp_type_quals (member_type)
2384 | cp_type_quals (object_type));
2386 /* A field is const (volatile) if the enclosing object, or the
2387 field itself, is const (volatile). But, a mutable field is
2388 not const, even within a const object. */
2389 if (DECL_MUTABLE_P (member))
2390 type_quals &= ~TYPE_QUAL_CONST;
2391 member_type = cp_build_qualified_type (member_type, type_quals);
2394 result = build3 (COMPONENT_REF, member_type, object, member,
2396 result = fold_if_not_in_template (result);
2398 /* Mark the expression const or volatile, as appropriate. Even
2399 though we've dealt with the type above, we still have to mark the
2400 expression itself. */
2401 if (type_quals & TYPE_QUAL_CONST)
2402 TREE_READONLY (result) = 1;
2403 if (type_quals & TYPE_QUAL_VOLATILE)
2404 TREE_THIS_VOLATILE (result) = 1;
2406 else if (BASELINK_P (member))
2408 /* The member is a (possibly overloaded) member function. */
2412 /* If the MEMBER is exactly one static member function, then we
2413 know the type of the expression. Otherwise, we must wait
2414 until overload resolution has been performed. */
2415 functions = BASELINK_FUNCTIONS (member);
2416 if (TREE_CODE (functions) == FUNCTION_DECL
2417 && DECL_STATIC_FUNCTION_P (functions))
2418 type = TREE_TYPE (functions);
2420 type = unknown_type_node;
2421 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2422 base. That will happen when the function is called. */
2423 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2425 else if (TREE_CODE (member) == CONST_DECL)
2427 /* The member is an enumerator. */
2429 /* If OBJECT has side-effects, they are supposed to occur. */
2430 if (TREE_SIDE_EFFECTS (object))
2431 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2436 if (complain & tf_error)
2437 error ("invalid use of %qD", member);
2438 return error_mark_node;
2441 if (!preserve_reference)
2444 If E2 is declared to have type "reference to T", then ... the
2445 type of E1.E2 is T. */
2446 result = convert_from_reference (result);
2451 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2452 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2455 lookup_destructor (tree object, tree scope, tree dtor_name)
2457 tree object_type = TREE_TYPE (object);
2458 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2461 if (scope && !check_dtor_name (scope, dtor_type))
2463 error ("qualified type %qT does not match destructor name ~%qT",
2465 return error_mark_node;
2467 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2469 /* In a template, names we can't find a match for are still accepted
2470 destructor names, and we check them here. */
2471 if (check_dtor_name (object_type, dtor_type))
2472 dtor_type = object_type;
2475 error ("object type %qT does not match destructor name ~%qT",
2476 object_type, dtor_type);
2477 return error_mark_node;
2481 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2483 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2484 TYPE_MAIN_VARIANT (object_type), dtor_type);
2485 return error_mark_node;
2487 expr = lookup_member (dtor_type, complete_dtor_identifier,
2488 /*protect=*/1, /*want_type=*/false);
2489 expr = (adjust_result_of_qualified_name_lookup
2490 (expr, dtor_type, object_type));
2494 /* An expression of the form "A::template B" has been resolved to
2495 DECL. Issue a diagnostic if B is not a template or template
2499 check_template_keyword (tree decl)
2501 /* The standard says:
2505 If a name prefixed by the keyword template is not a member
2506 template, the program is ill-formed.
2508 DR 228 removed the restriction that the template be a member
2511 DR 96, if accepted would add the further restriction that explicit
2512 template arguments must be provided if the template keyword is
2513 used, but, as of 2005-10-16, that DR is still in "drafting". If
2514 this DR is accepted, then the semantic checks here can be
2515 simplified, as the entity named must in fact be a template
2516 specialization, rather than, as at present, a set of overloaded
2517 functions containing at least one template function. */
2518 if (TREE_CODE (decl) != TEMPLATE_DECL
2519 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2521 if (!is_overloaded_fn (decl))
2522 permerror (input_location, "%qD is not a template", decl);
2527 if (BASELINK_P (fns))
2528 fns = BASELINK_FUNCTIONS (fns);
2531 tree fn = OVL_CURRENT (fns);
2532 if (TREE_CODE (fn) == TEMPLATE_DECL
2533 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2535 if (TREE_CODE (fn) == FUNCTION_DECL
2536 && DECL_USE_TEMPLATE (fn)
2537 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2539 fns = OVL_NEXT (fns);
2542 permerror (input_location, "%qD is not a template", decl);
2547 /* This function is called by the parser to process a class member
2548 access expression of the form OBJECT.NAME. NAME is a node used by
2549 the parser to represent a name; it is not yet a DECL. It may,
2550 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2551 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2552 there is no reason to do the lookup twice, so the parser keeps the
2553 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2554 be a template via the use of the "A::template B" syntax. */
2557 finish_class_member_access_expr (tree object, tree name, bool template_p,
2558 tsubst_flags_t complain)
2563 tree access_path = NULL_TREE;
2564 tree orig_object = object;
2565 tree orig_name = name;
2567 if (object == error_mark_node || name == error_mark_node)
2568 return error_mark_node;
2570 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2571 if (!objc_is_public (object, name))
2572 return error_mark_node;
2574 object_type = TREE_TYPE (object);
2576 if (processing_template_decl)
2578 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2579 dependent_type_p (object_type)
2580 /* If NAME is just an IDENTIFIER_NODE, then the expression
2582 || TREE_CODE (object) == IDENTIFIER_NODE
2583 /* If NAME is "f<args>", where either 'f' or 'args' is
2584 dependent, then the expression is dependent. */
2585 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2586 && dependent_template_id_p (TREE_OPERAND (name, 0),
2587 TREE_OPERAND (name, 1)))
2588 /* If NAME is "T::X" where "T" is dependent, then the
2589 expression is dependent. */
2590 || (TREE_CODE (name) == SCOPE_REF
2591 && TYPE_P (TREE_OPERAND (name, 0))
2592 && dependent_type_p (TREE_OPERAND (name, 0))))
2593 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2594 object = build_non_dependent_expr (object);
2596 else if (c_dialect_objc ()
2597 && TREE_CODE (name) == IDENTIFIER_NODE
2598 && (expr = objc_maybe_build_component_ref (object, name)))
2603 The type of the first expression shall be "class object" (of a
2605 if (!currently_open_class (object_type)
2606 && !complete_type_or_maybe_complain (object_type, object, complain))
2607 return error_mark_node;
2608 if (!CLASS_TYPE_P (object_type))
2610 if (complain & tf_error)
2611 error ("request for member %qD in %qE, which is of non-class type %qT",
2612 name, object, object_type);
2613 return error_mark_node;
2616 if (BASELINK_P (name))
2617 /* A member function that has already been looked up. */
2621 bool is_template_id = false;
2622 tree template_args = NULL_TREE;
2625 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2627 is_template_id = true;
2628 template_args = TREE_OPERAND (name, 1);
2629 name = TREE_OPERAND (name, 0);
2631 if (TREE_CODE (name) == OVERLOAD)
2632 name = DECL_NAME (get_first_fn (name));
2633 else if (DECL_P (name))
2634 name = DECL_NAME (name);
2637 if (TREE_CODE (name) == SCOPE_REF)
2639 /* A qualified name. The qualifying class or namespace `S'
2640 has already been looked up; it is either a TYPE or a
2642 scope = TREE_OPERAND (name, 0);
2643 name = TREE_OPERAND (name, 1);
2645 /* If SCOPE is a namespace, then the qualified name does not
2646 name a member of OBJECT_TYPE. */
2647 if (TREE_CODE (scope) == NAMESPACE_DECL)
2649 if (complain & tf_error)
2650 error ("%<%D::%D%> is not a member of %qT",
2651 scope, name, object_type);
2652 return error_mark_node;
2655 gcc_assert (CLASS_TYPE_P (scope));
2656 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2657 || TREE_CODE (name) == BIT_NOT_EXPR);
2659 if (constructor_name_p (name, scope))
2661 if (complain & tf_error)
2662 error ("cannot call constructor %<%T::%D%> directly",
2664 return error_mark_node;
2667 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2668 access_path = lookup_base (object_type, scope, ba_check, NULL);
2669 if (access_path == error_mark_node)
2670 return error_mark_node;
2673 if (complain & tf_error)
2674 error ("%qT is not a base of %qT", scope, object_type);
2675 return error_mark_node;
2681 access_path = object_type;
2684 if (TREE_CODE (name) == BIT_NOT_EXPR)
2685 member = lookup_destructor (object, scope, name);
2688 /* Look up the member. */
2689 member = lookup_member (access_path, name, /*protect=*/1,
2690 /*want_type=*/false);
2691 if (member == NULL_TREE)
2693 if (complain & tf_error)
2694 error ("%qD has no member named %qE", object_type, name);
2695 return error_mark_node;
2697 if (member == error_mark_node)
2698 return error_mark_node;
2703 tree templ = member;
2705 if (BASELINK_P (templ))
2706 templ = lookup_template_function (templ, template_args);
2709 if (complain & tf_error)
2710 error ("%qD is not a member template function", name);
2711 return error_mark_node;
2716 if (TREE_DEPRECATED (member))
2717 warn_deprecated_use (member, NULL_TREE);
2720 check_template_keyword (member);
2722 expr = build_class_member_access_expr (object, member, access_path,
2723 /*preserve_reference=*/false,
2725 if (processing_template_decl && expr != error_mark_node)
2727 if (BASELINK_P (member))
2729 if (TREE_CODE (orig_name) == SCOPE_REF)
2730 BASELINK_QUALIFIED_P (member) = 1;
2733 return build_min_non_dep (COMPONENT_REF, expr,
2734 orig_object, orig_name,
2741 /* Return an expression for the MEMBER_NAME field in the internal
2742 representation of PTRMEM, a pointer-to-member function. (Each
2743 pointer-to-member function type gets its own RECORD_TYPE so it is
2744 more convenient to access the fields by name than by FIELD_DECL.)
2745 This routine converts the NAME to a FIELD_DECL and then creates the
2746 node for the complete expression. */
2749 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2755 /* This code is a stripped down version of
2756 build_class_member_access_expr. It does not work to use that
2757 routine directly because it expects the object to be of class
2759 ptrmem_type = TREE_TYPE (ptrmem);
2760 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2761 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2762 /*want_type=*/false);
2763 member_type = cp_build_qualified_type (TREE_TYPE (member),
2764 cp_type_quals (ptrmem_type));
2765 return fold_build3_loc (input_location,
2766 COMPONENT_REF, member_type,
2767 ptrmem, member, NULL_TREE);
2770 /* Given an expression PTR for a pointer, return an expression
2771 for the value pointed to.
2772 ERRORSTRING is the name of the operator to appear in error messages.
2774 This function may need to overload OPERATOR_FNNAME.
2775 Must also handle REFERENCE_TYPEs for C++. */
2778 build_x_indirect_ref (tree expr, ref_operator errorstring,
2779 tsubst_flags_t complain)
2781 tree orig_expr = expr;
2784 if (processing_template_decl)
2786 /* Retain the type if we know the operand is a pointer so that
2787 describable_type doesn't make auto deduction break. */
2788 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2789 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2790 if (type_dependent_expression_p (expr))
2791 return build_min_nt (INDIRECT_REF, expr);
2792 expr = build_non_dependent_expr (expr);
2795 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2796 NULL_TREE, /*overloaded_p=*/NULL, complain);
2798 rval = cp_build_indirect_ref (expr, errorstring, complain);
2800 if (processing_template_decl && rval != error_mark_node)
2801 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2806 /* Helper function called from c-common. */
2808 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2809 tree ptr, ref_operator errorstring)
2811 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2815 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2816 tsubst_flags_t complain)
2820 if (ptr == error_mark_node)
2821 return error_mark_node;
2823 if (ptr == current_class_ptr)
2824 return current_class_ref;
2826 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2827 ? ptr : decay_conversion (ptr));
2828 type = TREE_TYPE (pointer);
2830 if (POINTER_TYPE_P (type))
2834 If the type of the expression is "pointer to T," the type
2835 of the result is "T." */
2836 tree t = TREE_TYPE (type);
2838 if (CONVERT_EXPR_P (ptr)
2839 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2841 /* If a warning is issued, mark it to avoid duplicates from
2842 the backend. This only needs to be done at
2843 warn_strict_aliasing > 2. */
2844 if (warn_strict_aliasing > 2)
2845 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2846 type, TREE_OPERAND (ptr, 0)))
2847 TREE_NO_WARNING (ptr) = 1;
2850 if (VOID_TYPE_P (t))
2852 /* A pointer to incomplete type (other than cv void) can be
2853 dereferenced [expr.unary.op]/1 */
2854 if (complain & tf_error)
2855 error ("%qT is not a pointer-to-object type", type);
2856 return error_mark_node;
2858 else if (TREE_CODE (pointer) == ADDR_EXPR
2859 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2860 /* The POINTER was something like `&x'. We simplify `*&x' to
2862 return TREE_OPERAND (pointer, 0);
2865 tree ref = build1 (INDIRECT_REF, t, pointer);
2867 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2868 so that we get the proper error message if the result is used
2869 to assign to. Also, &* is supposed to be a no-op. */
2870 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2871 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2872 TREE_SIDE_EFFECTS (ref)
2873 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2877 else if (!(complain & tf_error))
2878 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2880 /* `pointer' won't be an error_mark_node if we were given a
2881 pointer to member, so it's cool to check for this here. */
2882 else if (TYPE_PTR_TO_MEMBER_P (type))
2883 switch (errorstring)
2885 case RO_ARRAY_INDEXING:
2886 error ("invalid use of array indexing on pointer to member");
2889 error ("invalid use of unary %<*%> on pointer to member");
2891 case RO_IMPLICIT_CONVERSION:
2892 error ("invalid use of implicit conversion on pointer to member");
2897 else if (pointer != error_mark_node)
2898 switch (errorstring)
2901 error ("invalid type argument");
2903 case RO_ARRAY_INDEXING:
2904 error ("invalid type argument of array indexing");
2907 error ("invalid type argument of unary %<*%>");
2909 case RO_IMPLICIT_CONVERSION:
2910 error ("invalid type argument of implicit conversion");
2915 return error_mark_node;
2918 /* This handles expressions of the form "a[i]", which denotes
2921 This is logically equivalent in C to *(a+i), but we may do it differently.
2922 If A is a variable or a member, we generate a primitive ARRAY_REF.
2923 This avoids forcing the array out of registers, and can work on
2924 arrays that are not lvalues (for example, members of structures returned
2927 If INDEX is of some user-defined type, it must be converted to
2928 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2929 will inherit the type of the array, which will be some pointer type.
2931 LOC is the location to use in building the array reference. */
2934 cp_build_array_ref (location_t loc, tree array, tree idx,
2935 tsubst_flags_t complain)
2941 if (complain & tf_error)
2942 error_at (loc, "subscript missing in array reference");
2943 return error_mark_node;
2946 if (TREE_TYPE (array) == error_mark_node
2947 || TREE_TYPE (idx) == error_mark_node)
2948 return error_mark_node;
2950 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2952 switch (TREE_CODE (array))
2956 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2958 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2959 TREE_OPERAND (array, 0), value);
2960 SET_EXPR_LOCATION (ret, loc);
2965 ret = build_conditional_expr
2966 (TREE_OPERAND (array, 0),
2967 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2969 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
2971 tf_warning_or_error);
2972 protected_set_expr_location (ret, loc);
2979 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2983 warn_array_subscript_with_type_char (idx);
2985 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2987 if (complain & tf_error)
2988 error_at (loc, "array subscript is not an integer");
2989 return error_mark_node;
2992 /* Apply integral promotions *after* noticing character types.
2993 (It is unclear why we do these promotions -- the standard
2994 does not say that we should. In fact, the natural thing would
2995 seem to be to convert IDX to ptrdiff_t; we're performing
2996 pointer arithmetic.) */
2997 idx = perform_integral_promotions (idx);
2999 /* An array that is indexed by a non-constant
3000 cannot be stored in a register; we must be able to do
3001 address arithmetic on its address.
3002 Likewise an array of elements of variable size. */
3003 if (TREE_CODE (idx) != INTEGER_CST
3004 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
3005 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
3008 if (!cxx_mark_addressable (array))
3009 return error_mark_node;
3012 /* An array that is indexed by a constant value which is not within
3013 the array bounds cannot be stored in a register either; because we
3014 would get a crash in store_bit_field/extract_bit_field when trying
3015 to access a non-existent part of the register. */
3016 if (TREE_CODE (idx) == INTEGER_CST
3017 && TYPE_DOMAIN (TREE_TYPE (array))
3018 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
3020 if (!cxx_mark_addressable (array))
3021 return error_mark_node;
3024 if (!lvalue_p (array) && (complain & tf_error))
3025 pedwarn (loc, OPT_pedantic,
3026 "ISO C++ forbids subscripting non-lvalue array");
3028 /* Note in C++ it is valid to subscript a `register' array, since
3029 it is valid to take the address of something with that
3030 storage specification. */
3034 while (TREE_CODE (foo) == COMPONENT_REF)
3035 foo = TREE_OPERAND (foo, 0);
3036 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)
3037 && (complain & tf_warning))
3038 warning_at (loc, OPT_Wextra,
3039 "subscripting array declared %<register%>");
3042 type = TREE_TYPE (TREE_TYPE (array));
3043 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
3044 /* Array ref is const/volatile if the array elements are
3045 or if the array is.. */
3046 TREE_READONLY (rval)
3047 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
3048 TREE_SIDE_EFFECTS (rval)
3049 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
3050 TREE_THIS_VOLATILE (rval)
3051 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
3052 ret = require_complete_type_sfinae (fold_if_not_in_template (rval),
3054 protected_set_expr_location (ret, loc);
3059 tree ar = default_conversion (array);
3060 tree ind = default_conversion (idx);
3062 /* Put the integer in IND to simplify error checking. */
3063 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
3070 if (ar == error_mark_node)
3073 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
3075 if (complain & tf_error)
3076 error_at (loc, "subscripted value is neither array nor pointer");
3077 return error_mark_node;
3079 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
3081 if (complain & tf_error)
3082 error_at (loc, "array subscript is not an integer");
3083 return error_mark_node;
3086 warn_array_subscript_with_type_char (idx);
3088 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
3093 protected_set_expr_location (ret, loc);
3098 /* Entry point for Obj-C++. */
3101 build_array_ref (location_t loc, tree array, tree idx)
3103 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
3106 /* Resolve a pointer to member function. INSTANCE is the object
3107 instance to use, if the member points to a virtual member.
3109 This used to avoid checking for virtual functions if basetype
3110 has no virtual functions, according to an earlier ANSI draft.
3111 With the final ISO C++ rules, such an optimization is
3112 incorrect: A pointer to a derived member can be static_cast
3113 to pointer-to-base-member, as long as the dynamic object
3114 later has the right member. */
3117 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
3119 if (TREE_CODE (function) == OFFSET_REF)
3120 function = TREE_OPERAND (function, 1);
3122 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
3124 tree idx, delta, e1, e2, e3, vtbl, basetype;
3125 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
3127 tree instance_ptr = *instance_ptrptr;
3128 tree instance_save_expr = 0;
3129 if (instance_ptr == error_mark_node)
3131 if (TREE_CODE (function) == PTRMEM_CST)
3133 /* Extracting the function address from a pmf is only
3134 allowed with -Wno-pmf-conversions. It only works for
3136 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
3137 e1 = convert (fntype, e1);
3142 error ("object missing in use of %qE", function);
3143 return error_mark_node;
3147 if (TREE_SIDE_EFFECTS (instance_ptr))
3148 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3150 if (TREE_SIDE_EFFECTS (function))
3151 function = save_expr (function);
3153 /* Start by extracting all the information from the PMF itself. */
3154 e3 = pfn_from_ptrmemfunc (function);
3155 delta = delta_from_ptrmemfunc (function);
3156 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3157 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3159 case ptrmemfunc_vbit_in_pfn:
3160 e1 = cp_build_binary_op (input_location,
3161 BIT_AND_EXPR, idx, integer_one_node,
3162 tf_warning_or_error);
3163 idx = cp_build_binary_op (input_location,
3164 MINUS_EXPR, idx, integer_one_node,
3165 tf_warning_or_error);
3168 case ptrmemfunc_vbit_in_delta:
3169 e1 = cp_build_binary_op (input_location,
3170 BIT_AND_EXPR, delta, integer_one_node,
3171 tf_warning_or_error);
3172 delta = cp_build_binary_op (input_location,
3173 RSHIFT_EXPR, delta, integer_one_node,
3174 tf_warning_or_error);
3181 /* Convert down to the right base before using the instance. A
3182 special case is that in a pointer to member of class C, C may
3183 be incomplete. In that case, the function will of course be
3184 a member of C, and no conversion is required. In fact,
3185 lookup_base will fail in that case, because incomplete
3186 classes do not have BINFOs. */
3187 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3188 if (!same_type_ignoring_top_level_qualifiers_p
3189 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3191 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3192 basetype, ba_check, NULL);
3193 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3195 if (instance_ptr == error_mark_node)
3196 return error_mark_node;
3198 /* ...and then the delta in the PMF. */
3199 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
3200 instance_ptr, fold_convert (sizetype, delta));
3202 /* Hand back the adjusted 'this' argument to our caller. */
3203 *instance_ptrptr = instance_ptr;
3205 /* Next extract the vtable pointer from the object. */
3206 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3208 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, tf_warning_or_error);
3209 /* If the object is not dynamic the access invokes undefined
3210 behavior. As it is not executed in this case silence the
3211 spurious warnings it may provoke. */
3212 TREE_NO_WARNING (vtbl) = 1;
3214 /* Finally, extract the function pointer from the vtable. */
3215 e2 = fold_build2_loc (input_location,
3216 POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
3217 fold_convert (sizetype, idx));
3218 e2 = cp_build_indirect_ref (e2, RO_NULL, tf_warning_or_error);
3219 TREE_CONSTANT (e2) = 1;
3221 /* When using function descriptors, the address of the
3222 vtable entry is treated as a function pointer. */
3223 if (TARGET_VTABLE_USES_DESCRIPTORS)
3224 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3225 cp_build_addr_expr (e2, tf_warning_or_error));
3227 e2 = fold_convert (TREE_TYPE (e3), e2);
3228 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
3230 /* Make sure this doesn't get evaluated first inside one of the
3231 branches of the COND_EXPR. */
3232 if (instance_save_expr)
3233 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3234 instance_save_expr, e1);
3241 /* Used by the C-common bits. */
3243 build_function_call (location_t loc ATTRIBUTE_UNUSED,
3244 tree function, tree params)
3246 return cp_build_function_call (function, params, tf_warning_or_error);
3249 /* Used by the C-common bits. */
3251 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
3252 tree function, VEC(tree,gc) *params,
3253 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
3255 VEC(tree,gc) *orig_params = params;
3256 tree ret = cp_build_function_call_vec (function, ¶ms,
3257 tf_warning_or_error);
3259 /* cp_build_function_call_vec can reallocate PARAMS by adding
3260 default arguments. That should never happen here. Verify
3262 gcc_assert (params == orig_params);
3267 /* Build a function call using a tree list of arguments. */
3270 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3275 vec = make_tree_vector ();
3276 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3277 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3278 ret = cp_build_function_call_vec (function, &vec, complain);
3279 release_tree_vector (vec);
3283 /* Build a function call using varargs. */
3286 cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
3292 vec = make_tree_vector ();
3293 va_start (args, complain);
3294 for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
3295 VEC_safe_push (tree, gc, vec, t);
3297 ret = cp_build_function_call_vec (function, &vec, complain);
3298 release_tree_vector (vec);
3302 /* Build a function call using a vector of arguments. PARAMS may be
3303 NULL if there are no parameters. This changes the contents of
3307 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3308 tsubst_flags_t complain)
3310 tree fntype, fndecl;
3312 tree original = function;
3316 VEC(tree,gc) *allocated = NULL;
3319 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3320 expressions, like those used for ObjC messenger dispatches. */
3321 if (params != NULL && !VEC_empty (tree, *params))
3322 function = objc_rewrite_function_call (function,
3323 VEC_index (tree, *params, 0));
3325 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3326 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3327 if (TREE_CODE (function) == NOP_EXPR
3328 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3329 function = TREE_OPERAND (function, 0);
3331 if (TREE_CODE (function) == FUNCTION_DECL)
3333 mark_used (function);
3336 /* Convert anything with function type to a pointer-to-function. */
3337 if (DECL_MAIN_P (function) && (complain & tf_error))
3338 pedwarn (input_location, OPT_pedantic,
3339 "ISO C++ forbids calling %<::main%> from within program");
3341 function = build_addr_func (function);
3347 function = build_addr_func (function);
3350 if (function == error_mark_node)
3351 return error_mark_node;
3353 fntype = TREE_TYPE (function);
3355 if (TYPE_PTRMEMFUNC_P (fntype))
3357 if (complain & tf_error)
3358 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3359 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3360 original, original);
3361 return error_mark_node;
3364 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3365 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3367 if (!((TREE_CODE (fntype) == POINTER_TYPE
3368 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3370 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3372 if (complain & tf_error)
3373 error ("%qE cannot be used as a function", original);
3374 return error_mark_node;
3377 /* fntype now gets the type of function pointed to. */
3378 fntype = TREE_TYPE (fntype);
3379 parm_types = TYPE_ARG_TYPES (fntype);
3383 allocated = make_tree_vector ();
3384 params = &allocated;
3387 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3390 return error_mark_node;
3392 argarray = VEC_address (tree, *params);
3394 /* Check for errors in format strings and inappropriately
3396 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
3399 ret = build_cxx_call (function, nargs, argarray);
3401 if (allocated != NULL)
3402 release_tree_vector (allocated);
3407 /* Subroutine of convert_arguments.
3408 Warn about wrong number of args are genereted. */
3411 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3415 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3417 if (DECL_NAME (fndecl) == NULL_TREE
3418 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3421 ? G_("too many arguments to constructor %q#D")
3422 : G_("too few arguments to constructor %q#D"),
3427 ? G_("too many arguments to member function %q#D")
3428 : G_("too few arguments to member function %q#D"),
3434 ? G_("too many arguments to function %q#D")
3435 : G_("too few arguments to function %q#D"),
3437 inform (DECL_SOURCE_LOCATION (fndecl),
3442 if (c_dialect_objc () && objc_message_selector ())
3445 ? G_("too many arguments to method %q#D")
3446 : G_("too few arguments to method %q#D"),
3447 objc_message_selector ());
3449 error_at (loc, too_many_p ? G_("too many arguments to function")
3450 : G_("too few arguments to function"));
3454 /* Convert the actual parameter expressions in the list VALUES to the
3455 types in the list TYPELIST. The converted expressions are stored
3456 back in the VALUES vector.
3457 If parmdecls is exhausted, or when an element has NULL as its type,
3458 perform the default conversions.
3460 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3462 This is also where warnings about wrong number of args are generated.
3464 Returns the actual number of arguments processed (which might be less
3465 than the length of the vector), or -1 on error.
3467 In C++, unspecified trailing parameters can be filled in with their
3468 default arguments, if such were specified. Do so here. */
3471 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3472 int flags, tsubst_flags_t complain)
3477 /* Argument passing is always copy-initialization. */
3478 flags |= LOOKUP_ONLYCONVERTING;
3480 for (i = 0, typetail = typelist;
3481 i < VEC_length (tree, *values);
3484 tree type = typetail ? TREE_VALUE (typetail) : 0;
3485 tree val = VEC_index (tree, *values, i);
3487 if (val == error_mark_node || type == error_mark_node)
3490 if (type == void_type_node)
3492 if (complain & tf_error)
3494 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3501 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3502 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3503 if (TREE_CODE (val) == NOP_EXPR
3504 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3505 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3506 val = TREE_OPERAND (val, 0);
3508 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3510 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3511 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3512 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3513 val = decay_conversion (val);
3516 if (val == error_mark_node)
3521 /* Formal parm type is specified by a function prototype. */
3524 if (!COMPLETE_TYPE_P (complete_type (type)))
3526 if (complain & tf_error)
3529 error ("parameter %P of %qD has incomplete type %qT",
3532 error ("parameter %P has incomplete type %qT", i, type);
3534 parmval = error_mark_node;
3538 parmval = convert_for_initialization
3539 (NULL_TREE, type, val, flags,
3540 ICR_ARGPASS, fndecl, i, complain);
3541 parmval = convert_for_arg_passing (type, parmval);
3544 if (parmval == error_mark_node)
3547 VEC_replace (tree, *values, i, parmval);
3551 if (fndecl && DECL_BUILT_IN (fndecl)
3552 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3553 /* Don't do ellipsis conversion for __built_in_constant_p
3554 as this will result in spurious errors for non-trivial
3556 val = require_complete_type_sfinae (val, complain);
3558 val = convert_arg_to_ellipsis (val);
3560 VEC_replace (tree, *values, i, val);
3564 typetail = TREE_CHAIN (typetail);
3567 if (typetail != 0 && typetail != void_list_node)
3569 /* See if there are default arguments that can be used. Because
3570 we hold default arguments in the FUNCTION_TYPE (which is so
3571 wrong), we can see default parameters here from deduced
3572 contexts (and via typeof) for indirect function calls.
3573 Fortunately we know whether we have a function decl to
3574 provide default arguments in a language conformant
3576 if (fndecl && TREE_PURPOSE (typetail)
3577 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3579 for (; typetail != void_list_node; ++i)
3582 = convert_default_arg (TREE_VALUE (typetail),
3583 TREE_PURPOSE (typetail),
3586 if (parmval == error_mark_node)
3589 VEC_safe_push (tree, gc, *values, parmval);
3590 typetail = TREE_CHAIN (typetail);
3591 /* ends with `...'. */
3592 if (typetail == NULL_TREE)
3598 if (complain & tf_error)
3599 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3607 /* Build a binary-operation expression, after performing default
3608 conversions on the operands. CODE is the kind of expression to
3609 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3610 are the tree codes which correspond to ARG1 and ARG2 when issuing
3611 warnings about possibly misplaced parentheses. They may differ
3612 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3613 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3614 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3615 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3616 ARG2_CODE as ERROR_MARK. */
3619 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3620 tree arg2, enum tree_code arg2_code, bool *overloaded_p,
3621 tsubst_flags_t complain)
3630 if (processing_template_decl)
3632 if (type_dependent_expression_p (arg1)
3633 || type_dependent_expression_p (arg2))
3634 return build_min_nt (code, arg1, arg2);
3635 arg1 = build_non_dependent_expr (arg1);
3636 arg2 = build_non_dependent_expr (arg2);
3639 if (code == DOTSTAR_EXPR)
3640 expr = build_m_component_ref (arg1, arg2);
3642 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3643 overloaded_p, complain);
3645 /* Check for cases such as x+y<<z which users are likely to
3646 misinterpret. But don't warn about obj << x + y, since that is a
3647 common idiom for I/O. */
3648 if (warn_parentheses
3649 && (complain & tf_warning)
3650 && !processing_template_decl
3651 && !error_operand_p (arg1)
3652 && !error_operand_p (arg2)
3653 && (code != LSHIFT_EXPR
3654 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3655 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3657 if (processing_template_decl && expr != error_mark_node)
3658 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3663 /* Build and return an ARRAY_REF expression. */
3666 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3668 tree orig_arg1 = arg1;
3669 tree orig_arg2 = arg2;
3672 if (processing_template_decl)
3674 if (type_dependent_expression_p (arg1)
3675 || type_dependent_expression_p (arg2))
3676 return build_min_nt (ARRAY_REF, arg1, arg2,
3677 NULL_TREE, NULL_TREE);
3678 arg1 = build_non_dependent_expr (arg1);
3679 arg2 = build_non_dependent_expr (arg2);
3682 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3683 /*overloaded_p=*/NULL, complain);
3685 if (processing_template_decl && expr != error_mark_node)
3686 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3687 NULL_TREE, NULL_TREE);
3691 /* For the c-common bits. */
3693 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3694 int convert_p ATTRIBUTE_UNUSED)
3696 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3700 /* Build a binary-operation expression without default conversions.
3701 CODE is the kind of expression to build.
3702 LOCATION is the location_t of the operator in the source code.
3703 This function differs from `build' in several ways:
3704 the data type of the result is computed and recorded in it,
3705 warnings are generated if arg data types are invalid,
3706 special handling for addition and subtraction of pointers is known,
3707 and some optimization is done (operations on narrow ints
3708 are done in the narrower type when that gives the same result).
3709 Constant folding is also done before the result is returned.
3711 Note that the operands will never have enumeral types
3712 because either they have just had the default conversions performed
3713 or they have both just been converted to some other type in which
3714 the arithmetic is to be done.
3716 C++: must do special pointer arithmetic when implementing
3717 multiple inheritance, and deal with pointer to member functions. */
3720 cp_build_binary_op (location_t location,
3721 enum tree_code code, tree orig_op0, tree orig_op1,
3722 tsubst_flags_t complain)
3725 enum tree_code code0, code1;
3727 const char *invalid_op_diag;
3729 /* Expression code to give to the expression when it is built.
3730 Normally this is CODE, which is what the caller asked for,
3731 but in some special cases we change it. */
3732 enum tree_code resultcode = code;
3734 /* Data type in which the computation is to be performed.
3735 In the simplest cases this is the common type of the arguments. */
3736 tree result_type = NULL;
3738 /* Nonzero means operands have already been type-converted
3739 in whatever way is necessary.
3740 Zero means they need to be converted to RESULT_TYPE. */
3743 /* Nonzero means create the expression with this type, rather than
3745 tree build_type = 0;
3747 /* Nonzero means after finally constructing the expression
3748 convert it to this type. */
3749 tree final_type = 0;
3753 /* Nonzero if this is an operation like MIN or MAX which can
3754 safely be computed in short if both args are promoted shorts.
3755 Also implies COMMON.
3756 -1 indicates a bitwise operation; this makes a difference
3757 in the exact conditions for when it is safe to do the operation
3758 in a narrower mode. */
3761 /* Nonzero if this is a comparison operation;
3762 if both args are promoted shorts, compare the original shorts.
3763 Also implies COMMON. */
3764 int short_compare = 0;
3766 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3769 /* True if both operands have arithmetic type. */
3770 bool arithmetic_types_p;
3772 /* Apply default conversions. */
3776 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3777 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3778 || code == TRUTH_XOR_EXPR)
3780 if (!really_overloaded_fn (op0))
3781 op0 = decay_conversion (op0);
3782 if (!really_overloaded_fn (op1))
3783 op1 = decay_conversion (op1);
3787 if (!really_overloaded_fn (op0))
3788 op0 = default_conversion (op0);
3789 if (!really_overloaded_fn (op1))
3790 op1 = default_conversion (op1);
3793 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3794 STRIP_TYPE_NOPS (op0);
3795 STRIP_TYPE_NOPS (op1);
3797 /* DTRT if one side is an overloaded function, but complain about it. */
3798 if (type_unknown_p (op0))
3800 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3801 if (t != error_mark_node)
3803 if (complain & tf_error)
3804 permerror (input_location, "assuming cast to type %qT from overloaded function",
3809 if (type_unknown_p (op1))
3811 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3812 if (t != error_mark_node)
3814 if (complain & tf_error)
3815 permerror (input_location, "assuming cast to type %qT from overloaded function",
3821 type0 = TREE_TYPE (op0);
3822 type1 = TREE_TYPE (op1);
3824 /* The expression codes of the data types of the arguments tell us
3825 whether the arguments are integers, floating, pointers, etc. */
3826 code0 = TREE_CODE (type0);
3827 code1 = TREE_CODE (type1);
3829 /* If an error was already reported for one of the arguments,
3830 avoid reporting another error. */
3831 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3832 return error_mark_node;
3834 if ((invalid_op_diag
3835 = targetm.invalid_binary_op (code, type0, type1)))
3837 error (invalid_op_diag);
3838 return error_mark_node;
3841 /* Issue warnings about peculiar, but valid, uses of NULL. */
3842 if ((orig_op0 == null_node || orig_op1 == null_node)
3843 /* It's reasonable to use pointer values as operands of &&
3844 and ||, so NULL is no exception. */
3845 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3846 && ( /* Both are NULL (or 0) and the operation was not a
3847 comparison or a pointer subtraction. */
3848 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3849 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3850 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3851 || (!null_ptr_cst_p (orig_op0)
3852 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3853 || (!null_ptr_cst_p (orig_op1)
3854 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3855 && (complain & tf_warning))
3856 /* Some sort of arithmetic operation involving NULL was
3858 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3863 /* Subtraction of two similar pointers.
3864 We must subtract them as integers, then divide by object size. */
3865 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3866 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3868 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3869 /* In all other cases except pointer - int, the usual arithmetic
3871 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3876 /* The pointer - int case is just like pointer + int; fall
3879 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3880 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3884 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3885 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3886 if (processing_template_decl)
3888 result_type = TREE_TYPE (ptr_operand);
3891 return cp_pointer_int_sum (code,
3902 case TRUNC_DIV_EXPR:
3904 case FLOOR_DIV_EXPR:
3905 case ROUND_DIV_EXPR:
3906 case EXACT_DIV_EXPR:
3907 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3908 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3909 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3910 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3912 enum tree_code tcode0 = code0, tcode1 = code1;
3914 warn_for_div_by_zero (location, op1);
3916 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3917 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3918 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3919 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3921 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3922 resultcode = RDIV_EXPR;
3924 /* When dividing two signed integers, we have to promote to int.
3925 unless we divide by a constant != -1. Note that default
3926 conversion will have been performed on the operands at this
3927 point, so we have to dig out the original type to find out if
3929 shorten = ((TREE_CODE (op0) == NOP_EXPR
3930 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3931 || (TREE_CODE (op1) == INTEGER_CST
3932 && ! integer_all_onesp (op1)));
3941 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3942 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3943 && !VECTOR_FLOAT_TYPE_P (type0)
3944 && !VECTOR_FLOAT_TYPE_P (type1)))
3948 case TRUNC_MOD_EXPR:
3949 case FLOOR_MOD_EXPR:
3950 warn_for_div_by_zero (location, op1);
3952 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3953 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3954 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3956 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3958 /* Although it would be tempting to shorten always here, that loses
3959 on some targets, since the modulo instruction is undefined if the
3960 quotient can't be represented in the computation mode. We shorten
3961 only if unsigned or if dividing by something we know != -1. */
3962 shorten = ((TREE_CODE (op0) == NOP_EXPR
3963 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3964 || (TREE_CODE (op1) == INTEGER_CST
3965 && ! integer_all_onesp (op1)));
3970 case TRUTH_ANDIF_EXPR:
3971 case TRUTH_ORIF_EXPR:
3972 case TRUTH_AND_EXPR:
3974 result_type = boolean_type_node;
3977 /* Shift operations: result has same type as first operand;
3978 always convert second operand to int.
3979 Also set SHORT_SHIFT if shifting rightward. */
3982 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3984 result_type = type0;
3985 if (TREE_CODE (op1) == INTEGER_CST)
3987 if (tree_int_cst_lt (op1, integer_zero_node))
3989 if ((complain & tf_warning)
3990 && c_inhibit_evaluation_warnings == 0)
3991 warning (0, "right shift count is negative");
3995 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3996 && (complain & tf_warning)
3997 && c_inhibit_evaluation_warnings == 0)
3998 warning (0, "right shift count >= width of type");
4001 /* Convert the shift-count to an integer, regardless of
4002 size of value being shifted. */
4003 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
4004 op1 = cp_convert (integer_type_node, op1);
4005 /* Avoid converting op1 to result_type later. */
4011 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4013 result_type = type0;
4014 if (TREE_CODE (op1) == INTEGER_CST)
4016 if (tree_int_cst_lt (op1, integer_zero_node))
4018 if ((complain & tf_warning)
4019 && c_inhibit_evaluation_warnings == 0)
4020 warning (0, "left shift count is negative");
4022 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
4024 if ((complain & tf_warning)
4025 && c_inhibit_evaluation_warnings == 0)
4026 warning (0, "left shift count >= width of type");
4029 /* Convert the shift-count to an integer, regardless of
4030 size of value being shifted. */
4031 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
4032 op1 = cp_convert (integer_type_node, op1);
4033 /* Avoid converting op1 to result_type later. */
4040 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4042 result_type = type0;
4043 if (TREE_CODE (op1) == INTEGER_CST)
4045 if (tree_int_cst_lt (op1, integer_zero_node))
4047 if (complain & tf_warning)
4048 warning (0, (code == LROTATE_EXPR)
4049 ? G_("left rotate count is negative")
4050 : G_("right rotate count is negative"));
4052 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
4054 if (complain & tf_warning)
4055 warning (0, (code == LROTATE_EXPR)
4056 ? G_("left rotate count >= width of type")
4057 : G_("right rotate count >= width of type"));
4060 /* Convert the shift-count to an integer, regardless of
4061 size of value being shifted. */
4062 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
4063 op1 = cp_convert (integer_type_node, op1);
4069 if ((complain & tf_warning)
4070 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
4071 warning (OPT_Wfloat_equal,
4072 "comparing floating point with == or != is unsafe");
4073 if ((complain & tf_warning)
4074 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
4075 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
4076 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4078 build_type = boolean_type_node;
4079 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4080 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
4081 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4082 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
4084 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4085 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
4086 result_type = composite_pointer_type (type0, type1, op0, op1,
4087 CPO_COMPARISON, complain);
4088 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
4089 && null_ptr_cst_p (op1))
4091 if (TREE_CODE (op0) == ADDR_EXPR
4092 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
4094 if (complain & tf_warning)
4095 warning (OPT_Waddress, "the address of %qD will never be NULL",
4096 TREE_OPERAND (op0, 0));
4098 result_type = type0;
4100 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
4101 && null_ptr_cst_p (op0))
4103 if (TREE_CODE (op1) == ADDR_EXPR
4104 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
4106 if (complain & tf_warning)
4107 warning (OPT_Waddress, "the address of %qD will never be NULL",
4108 TREE_OPERAND (op1, 0));
4110 result_type = type1;
4112 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4113 /* One of the operands must be of nullptr_t type. */
4114 result_type = TREE_TYPE (nullptr_node);
4115 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4117 result_type = type0;
4118 if (complain & tf_error)
4119 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4121 return error_mark_node;
4123 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4125 result_type = type1;
4126 if (complain & tf_error)
4127 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4129 return error_mark_node;
4131 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4133 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4134 == ptrmemfunc_vbit_in_delta)
4136 tree pfn0 = pfn_from_ptrmemfunc (op0);
4137 tree delta0 = delta_from_ptrmemfunc (op0);
4138 tree e1 = cp_build_binary_op (location,
4141 fold_convert (TREE_TYPE (pfn0),
4144 tree e2 = cp_build_binary_op (location,
4149 e2 = cp_build_binary_op (location,
4150 EQ_EXPR, e2, integer_zero_node,
4152 op0 = cp_build_binary_op (location,
4153 TRUTH_ANDIF_EXPR, e1, e2,
4155 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
4159 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4160 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
4162 result_type = TREE_TYPE (op0);
4164 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4165 return cp_build_binary_op (location, code, op1, op0, complain);
4166 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4169 /* E will be the final comparison. */
4171 /* E1 and E2 are for scratch. */
4179 type = composite_pointer_type (type0, type1, op0, op1,
4180 CPO_COMPARISON, complain);
4182 if (!same_type_p (TREE_TYPE (op0), type))
4183 op0 = cp_convert_and_check (type, op0);
4184 if (!same_type_p (TREE_TYPE (op1), type))
4185 op1 = cp_convert_and_check (type, op1);
4187 if (op0 == error_mark_node || op1 == error_mark_node)
4188 return error_mark_node;
4190 if (TREE_SIDE_EFFECTS (op0))
4191 op0 = save_expr (op0);
4192 if (TREE_SIDE_EFFECTS (op1))
4193 op1 = save_expr (op1);
4195 pfn0 = pfn_from_ptrmemfunc (op0);
4196 pfn1 = pfn_from_ptrmemfunc (op1);
4197 delta0 = delta_from_ptrmemfunc (op0);
4198 delta1 = delta_from_ptrmemfunc (op1);
4199 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4200 == ptrmemfunc_vbit_in_delta)
4205 && ((op0.delta == op1.delta)
4206 || (!op0.pfn && op0.delta & 1 == 0
4207 && op1.delta & 1 == 0))
4209 The reason for the `!op0.pfn' bit is that a NULL
4210 pointer-to-member is any member with a zero PFN and
4211 LSB of the DELTA field is 0. */
4213 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4217 e1 = cp_build_binary_op (location,
4218 EQ_EXPR, e1, integer_zero_node,
4220 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4224 e2 = cp_build_binary_op (location,
4225 EQ_EXPR, e2, integer_zero_node,
4227 e1 = cp_build_binary_op (location,
4228 TRUTH_ANDIF_EXPR, e2, e1,
4230 e2 = cp_build_binary_op (location, EQ_EXPR,
4232 fold_convert (TREE_TYPE (pfn0),
4235 e2 = cp_build_binary_op (location,
4236 TRUTH_ANDIF_EXPR, e2, e1, complain);
4237 e1 = cp_build_binary_op (location,
4238 EQ_EXPR, delta0, delta1, complain);
4239 e1 = cp_build_binary_op (location,
4240 TRUTH_ORIF_EXPR, e1, e2, complain);
4247 && (!op0.pfn || op0.delta == op1.delta))
4249 The reason for the `!op0.pfn' bit is that a NULL
4250 pointer-to-member is any member with a zero PFN; the
4251 DELTA field is unspecified. */
4253 e1 = cp_build_binary_op (location,
4254 EQ_EXPR, delta0, delta1, complain);
4255 e2 = cp_build_binary_op (location,
4258 fold_convert (TREE_TYPE (pfn0),
4261 e1 = cp_build_binary_op (location,
4262 TRUTH_ORIF_EXPR, e1, e2, complain);
4264 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4265 e = cp_build_binary_op (location,
4266 TRUTH_ANDIF_EXPR, e2, e1, complain);
4267 if (code == EQ_EXPR)
4269 return cp_build_binary_op (location,
4270 EQ_EXPR, e, integer_zero_node, complain);
4274 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4275 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4277 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4278 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4286 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4287 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4289 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4290 result_type = composite_pointer_type (type0, type1, op0, op1,
4291 CPO_COMPARISON, complain);
4298 if (TREE_CODE (orig_op0) == STRING_CST
4299 || TREE_CODE (orig_op1) == STRING_CST)
4301 if (complain & tf_warning)
4302 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4305 build_type = boolean_type_node;
4306 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4307 || code0 == ENUMERAL_TYPE)
4308 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4309 || code1 == ENUMERAL_TYPE))
4311 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4312 result_type = composite_pointer_type (type0, type1, op0, op1,
4313 CPO_COMPARISON, complain);
4314 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4315 result_type = type0;
4316 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4317 result_type = type1;
4318 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4319 /* One of the operands must be of nullptr_t type. */
4320 result_type = TREE_TYPE (nullptr_node);
4321 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4323 result_type = type0;
4324 if (complain & tf_error)
4325 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4327 return error_mark_node;
4329 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4331 result_type = type1;
4332 if (complain & tf_error)
4333 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4335 return error_mark_node;
4339 case UNORDERED_EXPR:
4346 build_type = integer_type_node;
4347 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4349 if (complain & tf_error)
4350 error ("unordered comparison on non-floating point argument");
4351 return error_mark_node;
4360 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4361 || code0 == ENUMERAL_TYPE)
4362 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4363 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4364 arithmetic_types_p = 1;
4367 arithmetic_types_p = 0;
4368 /* Vector arithmetic is only allowed when both sides are vectors. */
4369 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4371 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4372 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4375 binary_op_error (location, code, type0, type1);
4376 return error_mark_node;
4378 arithmetic_types_p = 1;
4381 /* Determine the RESULT_TYPE, if it is not already known. */
4383 && arithmetic_types_p
4384 && (shorten || common || short_compare))
4386 result_type = cp_common_type (type0, type1);
4387 do_warn_double_promotion (result_type, type0, type1,
4388 "implicit conversion from %qT to %qT "
4389 "to match other operand of binary "
4396 if (complain & tf_error)
4397 error ("invalid operands of types %qT and %qT to binary %qO",
4398 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4399 return error_mark_node;
4402 /* If we're in a template, the only thing we need to know is the
4404 if (processing_template_decl)
4406 /* Since the middle-end checks the type when doing a build2, we
4407 need to build the tree in pieces. This built tree will never
4408 get out of the front-end as we replace it when instantiating
4410 tree tmp = build2 (resultcode,
4411 build_type ? build_type : result_type,
4413 TREE_OPERAND (tmp, 0) = op0;
4417 if (arithmetic_types_p)
4419 bool first_complex = (code0 == COMPLEX_TYPE);
4420 bool second_complex = (code1 == COMPLEX_TYPE);
4421 int none_complex = (!first_complex && !second_complex);
4423 /* Adapted from patch for c/24581. */
4424 if (first_complex != second_complex
4425 && (code == PLUS_EXPR
4426 || code == MINUS_EXPR
4427 || code == MULT_EXPR
4428 || (code == TRUNC_DIV_EXPR && first_complex))
4429 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4430 && flag_signed_zeros)
4432 /* An operation on mixed real/complex operands must be
4433 handled specially, but the language-independent code can
4434 more easily optimize the plain complex arithmetic if
4435 -fno-signed-zeros. */
4436 tree real_type = TREE_TYPE (result_type);
4440 if (TREE_TYPE (op0) != result_type)
4441 op0 = cp_convert_and_check (result_type, op0);
4442 if (TREE_TYPE (op1) != real_type)
4443 op1 = cp_convert_and_check (real_type, op1);
4447 if (TREE_TYPE (op0) != real_type)
4448 op0 = cp_convert_and_check (real_type, op0);
4449 if (TREE_TYPE (op1) != result_type)
4450 op1 = cp_convert_and_check (result_type, op1);
4452 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4453 return error_mark_node;
4456 op0 = save_expr (op0);
4457 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4458 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4462 case TRUNC_DIV_EXPR:
4463 imag = build2 (resultcode, real_type, imag, op1);
4467 real = build2 (resultcode, real_type, real, op1);
4475 op1 = save_expr (op1);
4476 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4477 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4481 imag = build2 (resultcode, real_type, op0, imag);
4484 real = build2 (resultcode, real_type, op0, real);
4487 real = build2 (resultcode, real_type, op0, real);
4488 imag = build1 (NEGATE_EXPR, real_type, imag);
4494 return build2 (COMPLEX_EXPR, result_type, real, imag);
4497 /* For certain operations (which identify themselves by shorten != 0)
4498 if both args were extended from the same smaller type,
4499 do the arithmetic in that type and then extend.
4501 shorten !=0 and !=1 indicates a bitwise operation.
4502 For them, this optimization is safe only if
4503 both args are zero-extended or both are sign-extended.
4504 Otherwise, we might change the result.
4505 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4506 but calculated in (unsigned short) it would be (unsigned short)-1. */
4508 if (shorten && none_complex)
4510 final_type = result_type;
4511 result_type = shorten_binary_op (result_type, op0, op1,
4515 /* Comparison operations are shortened too but differently.
4516 They identify themselves by setting short_compare = 1. */
4520 /* Don't write &op0, etc., because that would prevent op0
4521 from being kept in a register.
4522 Instead, make copies of the our local variables and
4523 pass the copies by reference, then copy them back afterward. */
4524 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4525 enum tree_code xresultcode = resultcode;
4527 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4529 return cp_convert (boolean_type_node, val);
4530 op0 = xop0, op1 = xop1;
4532 resultcode = xresultcode;
4535 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4536 && warn_sign_compare
4537 && !TREE_NO_WARNING (orig_op0)
4538 && !TREE_NO_WARNING (orig_op1)
4539 /* Do not warn until the template is instantiated; we cannot
4540 bound the ranges of the arguments until that point. */
4541 && !processing_template_decl
4542 && (complain & tf_warning)
4543 && c_inhibit_evaluation_warnings == 0)
4545 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4546 result_type, resultcode);
4550 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4551 Then the expression will be built.
4552 It will be given type FINAL_TYPE if that is nonzero;
4553 otherwise, it will be given type RESULT_TYPE. */
4556 if (TREE_TYPE (op0) != result_type)
4557 op0 = cp_convert_and_check (result_type, op0);
4558 if (TREE_TYPE (op1) != result_type)
4559 op1 = cp_convert_and_check (result_type, op1);
4561 if (op0 == error_mark_node || op1 == error_mark_node)
4562 return error_mark_node;
4565 if (build_type == NULL_TREE)
4566 build_type = result_type;
4568 result = build2 (resultcode, build_type, op0, op1);
4569 result = fold_if_not_in_template (result);
4570 if (final_type != 0)
4571 result = cp_convert (final_type, result);
4573 if (TREE_OVERFLOW_P (result)
4574 && !TREE_OVERFLOW_P (op0)
4575 && !TREE_OVERFLOW_P (op1))
4576 overflow_warning (location, result);
4581 /* Return a tree for the sum or difference (RESULTCODE says which)
4582 of pointer PTROP and integer INTOP. */
4585 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4587 tree res_type = TREE_TYPE (ptrop);
4589 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4590 in certain circumstance (when it's valid to do so). So we need
4591 to make sure it's complete. We don't need to check here, if we
4592 can actually complete it at all, as those checks will be done in
4593 pointer_int_sum() anyway. */
4594 complete_type (TREE_TYPE (res_type));
4596 return pointer_int_sum (input_location, resultcode, ptrop,
4597 fold_if_not_in_template (intop));
4600 /* Return a tree for the difference of pointers OP0 and OP1.
4601 The resulting tree has type int. */
4604 pointer_diff (tree op0, tree op1, tree ptrtype)
4607 tree restype = ptrdiff_type_node;
4608 tree target_type = TREE_TYPE (ptrtype);
4610 if (!complete_type_or_else (target_type, NULL_TREE))
4611 return error_mark_node;
4613 if (TREE_CODE (target_type) == VOID_TYPE)
4614 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4615 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4616 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4617 if (TREE_CODE (target_type) == METHOD_TYPE)
4618 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4620 /* First do the subtraction as integers;
4621 then drop through to build the divide operator. */
4623 op0 = cp_build_binary_op (input_location,
4625 cp_convert (restype, op0),
4626 cp_convert (restype, op1),
4627 tf_warning_or_error);
4629 /* This generates an error if op1 is a pointer to an incomplete type. */
4630 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4631 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4633 op1 = (TYPE_PTROB_P (ptrtype)
4634 ? size_in_bytes (target_type)
4635 : integer_one_node);
4637 /* Do the division. */
4639 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4640 return fold_if_not_in_template (result);
4643 /* Construct and perhaps optimize a tree representation
4644 for a unary operation. CODE, a tree_code, specifies the operation
4645 and XARG is the operand. */
4648 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4650 tree orig_expr = xarg;
4654 if (processing_template_decl)
4656 if (type_dependent_expression_p (xarg))
4657 return build_min_nt (code, xarg, NULL_TREE);
4659 xarg = build_non_dependent_expr (xarg);
4664 /* [expr.unary.op] says:
4666 The address of an object of incomplete type can be taken.
4668 (And is just the ordinary address operator, not an overloaded
4669 "operator &".) However, if the type is a template
4670 specialization, we must complete the type at this point so that
4671 an overloaded "operator &" will be available if required. */
4672 if (code == ADDR_EXPR
4673 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4674 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4675 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4676 || (TREE_CODE (xarg) == OFFSET_REF)))
4677 /* Don't look for a function. */;
4679 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4680 /*overloaded_p=*/NULL, complain);
4681 if (!exp && code == ADDR_EXPR)
4683 if (is_overloaded_fn (xarg))
4685 tree fn = get_first_fn (xarg);
4686 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4688 error (DECL_CONSTRUCTOR_P (fn)
4689 ? G_("taking address of constructor %qE")
4690 : G_("taking address of destructor %qE"),
4692 return error_mark_node;
4696 /* A pointer to member-function can be formed only by saying
4698 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4699 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4701 if (TREE_CODE (xarg) != OFFSET_REF
4702 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4704 error ("invalid use of %qE to form a pointer-to-member-function",
4706 if (TREE_CODE (xarg) != OFFSET_REF)
4707 inform (input_location, " a qualified-id is required");
4708 return error_mark_node;
4712 error ("parentheses around %qE cannot be used to form a"
4713 " pointer-to-member-function",
4715 PTRMEM_OK_P (xarg) = 1;
4719 if (TREE_CODE (xarg) == OFFSET_REF)
4721 ptrmem = PTRMEM_OK_P (xarg);
4723 if (!ptrmem && !flag_ms_extensions
4724 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4726 /* A single non-static member, make sure we don't allow a
4727 pointer-to-member. */
4728 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4729 TREE_OPERAND (xarg, 0),
4730 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4731 PTRMEM_OK_P (xarg) = ptrmem;
4735 exp = cp_build_addr_expr_strict (xarg, complain);
4738 if (processing_template_decl && exp != error_mark_node)
4739 exp = build_min_non_dep (code, exp, orig_expr,
4740 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4741 if (TREE_CODE (exp) == ADDR_EXPR)
4742 PTRMEM_OK_P (exp) = ptrmem;
4746 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4747 constants, where a null value is represented by an INTEGER_CST of
4751 cp_truthvalue_conversion (tree expr)
4753 tree type = TREE_TYPE (expr);
4754 if (TYPE_PTRMEM_P (type))
4755 return build_binary_op (EXPR_LOCATION (expr),
4756 NE_EXPR, expr, integer_zero_node, 1);
4758 return c_common_truthvalue_conversion (input_location, expr);
4761 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4764 condition_conversion (tree expr)
4767 if (processing_template_decl)
4769 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4770 tf_warning_or_error, LOOKUP_NORMAL);
4771 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4775 /* Returns the address of T. This function will fold away
4776 ADDR_EXPR of INDIRECT_REF. */
4779 build_address (tree t)
4781 if (error_operand_p (t) || !cxx_mark_addressable (t))
4782 return error_mark_node;
4783 t = build_fold_addr_expr (t);
4784 if (TREE_CODE (t) != ADDR_EXPR)
4789 /* Returns the address of T with type TYPE. */
4792 build_typed_address (tree t, tree type)
4794 if (error_operand_p (t) || !cxx_mark_addressable (t))
4795 return error_mark_node;
4796 t = build_fold_addr_expr_with_type (t, type);
4797 if (TREE_CODE (t) != ADDR_EXPR)
4802 /* Return a NOP_EXPR converting EXPR to TYPE. */
4805 build_nop (tree type, tree expr)
4807 if (type == error_mark_node || error_operand_p (expr))
4809 return build1 (NOP_EXPR, type, expr);
4812 /* Take the address of ARG, whatever that means under C++ semantics.
4813 If STRICT_LVALUE is true, require an lvalue; otherwise, allow xvalues
4814 and class rvalues as well.
4816 Nothing should call this function directly; instead, callers should use
4817 cp_build_addr_expr or cp_build_addr_expr_strict. */
4820 cp_build_addr_expr_1 (tree arg, bool strict_lvalue, tsubst_flags_t complain)
4825 if (!arg || error_operand_p (arg))
4826 return error_mark_node;
4828 arg = mark_lvalue_use (arg);
4829 argtype = lvalue_type (arg);
4831 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4832 || !IDENTIFIER_OPNAME_P (arg));
4834 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4835 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4837 /* They're trying to take the address of a unique non-static
4838 member function. This is ill-formed (except in MS-land),
4839 but let's try to DTRT.
4840 Note: We only handle unique functions here because we don't
4841 want to complain if there's a static overload; non-unique
4842 cases will be handled by instantiate_type. But we need to
4843 handle this case here to allow casts on the resulting PMF.
4844 We could defer this in non-MS mode, but it's easier to give
4845 a useful error here. */
4847 /* Inside constant member functions, the `this' pointer
4848 contains an extra const qualifier. TYPE_MAIN_VARIANT
4849 is used here to remove this const from the diagnostics
4850 and the created OFFSET_REF. */
4851 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4852 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4855 if (! flag_ms_extensions)
4857 tree name = DECL_NAME (fn);
4858 if (!(complain & tf_error))
4859 return error_mark_node;
4860 else if (current_class_type
4861 && TREE_OPERAND (arg, 0) == current_class_ref)
4862 /* An expression like &memfn. */
4863 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4864 " or parenthesized non-static member function to form"
4865 " a pointer to member function. Say %<&%T::%D%>",
4868 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4869 " function to form a pointer to member function."
4873 arg = build_offset_ref (base, fn, /*address_p=*/true);
4876 /* Uninstantiated types are all functions. Taking the
4877 address of a function is a no-op, so just return the
4879 if (type_unknown_p (arg))
4880 return build1 (ADDR_EXPR, unknown_type_node, arg);
4882 if (TREE_CODE (arg) == OFFSET_REF)
4883 /* We want a pointer to member; bypass all the code for actually taking
4884 the address of something. */
4887 /* Anything not already handled and not a true memory reference
4889 if (TREE_CODE (argtype) != FUNCTION_TYPE
4890 && TREE_CODE (argtype) != METHOD_TYPE)
4892 cp_lvalue_kind kind = lvalue_kind (arg);
4893 if (kind == clk_none)
4895 if (complain & tf_error)
4896 lvalue_error (lv_addressof);
4897 return error_mark_node;
4899 if (strict_lvalue && (kind & (clk_rvalueref|clk_class)))
4901 if (!(complain & tf_error))
4902 return error_mark_node;
4903 if (kind & clk_class)
4904 /* Make this a permerror because we used to accept it. */
4905 permerror (input_location, "taking address of temporary");
4907 error ("taking address of xvalue (rvalue reference)");
4911 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4913 tree type = build_pointer_type (TREE_TYPE (argtype));
4914 arg = build1 (CONVERT_EXPR, type, arg);
4917 else if (pedantic && DECL_MAIN_P (arg))
4920 /* Apparently a lot of autoconf scripts for C++ packages do this,
4921 so only complain if -pedantic. */
4922 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4923 pedwarn (input_location, OPT_pedantic,
4924 "ISO C++ forbids taking address of function %<::main%>");
4925 else if (flag_pedantic_errors)
4926 return error_mark_node;
4929 /* Let &* cancel out to simplify resulting code. */
4930 if (TREE_CODE (arg) == INDIRECT_REF)
4932 /* We don't need to have `current_class_ptr' wrapped in a
4933 NON_LVALUE_EXPR node. */
4934 if (arg == current_class_ref)
4935 return current_class_ptr;
4937 arg = TREE_OPERAND (arg, 0);
4938 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4940 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4941 arg = build1 (CONVERT_EXPR, type, arg);
4944 /* Don't let this be an lvalue. */
4949 /* ??? Cope with user tricks that amount to offsetof. */
4950 if (TREE_CODE (argtype) != FUNCTION_TYPE
4951 && TREE_CODE (argtype) != METHOD_TYPE
4952 && argtype != unknown_type_node
4953 && (val = get_base_address (arg))
4954 && COMPLETE_TYPE_P (TREE_TYPE (val))
4955 && TREE_CODE (val) == INDIRECT_REF
4956 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
4958 tree type = build_pointer_type (argtype);
4959 tree op0 = fold_convert (type, TREE_OPERAND (val, 0));
4960 tree op1 = fold_convert (sizetype, fold_offsetof (arg, val));
4961 return fold_build2 (POINTER_PLUS_EXPR, type, op0, op1);
4964 /* Handle complex lvalues (when permitted)
4965 by reduction to simpler cases. */
4966 val = unary_complex_lvalue (ADDR_EXPR, arg);
4970 switch (TREE_CODE (arg))
4974 case FIX_TRUNC_EXPR:
4975 /* Even if we're not being pedantic, we cannot allow this
4976 extension when we're instantiating in a SFINAE
4978 if (! lvalue_p (arg) && complain == tf_none)
4980 if (complain & tf_error)
4981 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4983 return error_mark_node;
4988 arg = BASELINK_FUNCTIONS (arg);
4992 arg = OVL_CURRENT (arg);
4997 /* Turn a reference to a non-static data member into a
4998 pointer-to-member. */
5003 gcc_assert (PTRMEM_OK_P (arg));
5005 t = TREE_OPERAND (arg, 1);
5006 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
5008 if (complain & tf_error)
5009 error ("cannot create pointer to reference member %qD", t);
5010 return error_mark_node;
5013 type = build_ptrmem_type (context_for_name_lookup (t),
5015 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
5023 if (argtype != error_mark_node)
5024 argtype = build_pointer_type (argtype);
5026 /* In a template, we are processing a non-dependent expression
5027 so we can just form an ADDR_EXPR with the correct type. */
5028 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
5030 val = build_address (arg);
5031 if (TREE_CODE (arg) == OFFSET_REF)
5032 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
5034 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
5036 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
5038 /* We can only get here with a single static member
5040 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
5041 && DECL_STATIC_FUNCTION_P (fn));
5043 val = build_address (fn);
5044 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
5045 /* Do not lose object's side effects. */
5046 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
5047 TREE_OPERAND (arg, 0), val);
5049 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
5051 if (complain & tf_error)
5052 error ("attempt to take address of bit-field structure member %qD",
5053 TREE_OPERAND (arg, 1));
5054 return error_mark_node;
5058 tree object = TREE_OPERAND (arg, 0);
5059 tree field = TREE_OPERAND (arg, 1);
5060 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5061 (TREE_TYPE (object), decl_type_context (field)));
5062 val = build_address (arg);
5065 if (TREE_CODE (argtype) == POINTER_TYPE
5066 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
5068 build_ptrmemfunc_type (argtype);
5069 val = build_ptrmemfunc (argtype, val, 0,
5071 tf_warning_or_error);
5077 /* Take the address of ARG if it has one, even if it's an rvalue. */
5080 cp_build_addr_expr (tree arg, tsubst_flags_t complain)
5082 return cp_build_addr_expr_1 (arg, 0, complain);
5085 /* Take the address of ARG, but only if it's an lvalue. */
5088 cp_build_addr_expr_strict (tree arg, tsubst_flags_t complain)
5090 return cp_build_addr_expr_1 (arg, 1, complain);
5093 /* C++: Must handle pointers to members.
5095 Perhaps type instantiation should be extended to handle conversion
5096 from aggregates to types we don't yet know we want? (Or are those
5097 cases typically errors which should be reported?)
5099 NOCONVERT nonzero suppresses the default promotions
5100 (such as from short to int). */
5103 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
5104 tsubst_flags_t complain)
5106 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
5109 const char *errstring = NULL;
5111 const char *invalid_op_diag;
5113 if (!arg || error_operand_p (arg))
5114 return error_mark_node;
5116 if ((invalid_op_diag
5117 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
5122 error (invalid_op_diag);
5123 return error_mark_node;
5128 case UNARY_PLUS_EXPR:
5131 int flags = WANT_ARITH | WANT_ENUM;
5132 /* Unary plus (but not unary minus) is allowed on pointers. */
5133 if (code == UNARY_PLUS_EXPR)
5134 flags |= WANT_POINTER;
5135 arg = build_expr_type_conversion (flags, arg, true);
5137 errstring = (code == NEGATE_EXPR
5138 ? _("wrong type argument to unary minus")
5139 : _("wrong type argument to unary plus"));
5142 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5143 arg = perform_integral_promotions (arg);
5145 /* Make sure the result is not an lvalue: a unary plus or minus
5146 expression is always a rvalue. */
5153 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5157 arg = default_conversion (arg);
5159 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
5160 | WANT_VECTOR_OR_COMPLEX,
5162 errstring = _("wrong type argument to bit-complement");
5163 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
5164 arg = perform_integral_promotions (arg);
5168 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5169 errstring = _("wrong type argument to abs");
5170 else if (!noconvert)
5171 arg = default_conversion (arg);
5175 /* Conjugating a real value is a no-op, but allow it anyway. */
5176 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
5177 errstring = _("wrong type argument to conjugation");
5178 else if (!noconvert)
5179 arg = default_conversion (arg);
5182 case TRUTH_NOT_EXPR:
5183 arg = perform_implicit_conversion (boolean_type_node, arg,
5185 val = invert_truthvalue_loc (input_location, arg);
5186 if (arg != error_mark_node)
5188 errstring = _("in argument to unary !");
5195 if (TREE_CODE (arg) == COMPLEX_CST)
5196 return TREE_REALPART (arg);
5197 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5199 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
5200 return fold_if_not_in_template (arg);
5206 if (TREE_CODE (arg) == COMPLEX_CST)
5207 return TREE_IMAGPART (arg);
5208 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5210 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
5211 return fold_if_not_in_template (arg);
5214 return cp_convert (TREE_TYPE (arg), integer_zero_node);
5216 case PREINCREMENT_EXPR:
5217 case POSTINCREMENT_EXPR:
5218 case PREDECREMENT_EXPR:
5219 case POSTDECREMENT_EXPR:
5220 /* Handle complex lvalues (when permitted)
5221 by reduction to simpler cases. */
5223 val = unary_complex_lvalue (code, arg);
5227 arg = mark_lvalue_use (arg);
5229 /* Increment or decrement the real part of the value,
5230 and don't change the imaginary part. */
5231 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
5235 arg = stabilize_reference (arg);
5236 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
5237 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
5238 real = cp_build_unary_op (code, real, 1, complain);
5239 if (real == error_mark_node || imag == error_mark_node)
5240 return error_mark_node;
5241 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
5245 /* Report invalid types. */
5247 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
5250 if (code == PREINCREMENT_EXPR)
5251 errstring = _("no pre-increment operator for type");
5252 else if (code == POSTINCREMENT_EXPR)
5253 errstring = _("no post-increment operator for type");
5254 else if (code == PREDECREMENT_EXPR)
5255 errstring = _("no pre-decrement operator for type");
5257 errstring = _("no post-decrement operator for type");
5260 else if (arg == error_mark_node)
5261 return error_mark_node;
5263 /* Report something read-only. */
5265 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
5266 || TREE_READONLY (arg))
5268 if (complain & tf_error)
5269 readonly_error (arg, ((code == PREINCREMENT_EXPR
5270 || code == POSTINCREMENT_EXPR)
5271 ? REK_INCREMENT : REK_DECREMENT));
5273 return error_mark_node;
5278 tree declared_type = unlowered_expr_type (arg);
5280 argtype = TREE_TYPE (arg);
5282 /* ARM $5.2.5 last annotation says this should be forbidden. */
5283 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
5285 if (complain & tf_error)
5286 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
5287 ? G_("ISO C++ forbids incrementing an enum")
5288 : G_("ISO C++ forbids decrementing an enum"));
5290 return error_mark_node;
5293 /* Compute the increment. */
5295 if (TREE_CODE (argtype) == POINTER_TYPE)
5297 tree type = complete_type (TREE_TYPE (argtype));
5299 if (!COMPLETE_OR_VOID_TYPE_P (type))
5301 if (complain & tf_error)
5302 error (((code == PREINCREMENT_EXPR
5303 || code == POSTINCREMENT_EXPR))
5304 ? G_("cannot increment a pointer to incomplete type %qT")
5305 : G_("cannot decrement a pointer to incomplete type %qT"),
5306 TREE_TYPE (argtype));
5308 return error_mark_node;
5310 else if ((pedantic || warn_pointer_arith)
5311 && !TYPE_PTROB_P (argtype))
5313 if (complain & tf_error)
5314 permerror (input_location, (code == PREINCREMENT_EXPR
5315 || code == POSTINCREMENT_EXPR)
5316 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5317 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5320 return error_mark_node;
5323 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
5326 inc = integer_one_node;
5328 inc = cp_convert (argtype, inc);
5330 /* Complain about anything else that is not a true lvalue. */
5331 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
5332 || code == POSTINCREMENT_EXPR)
5333 ? lv_increment : lv_decrement),
5335 return error_mark_node;
5337 /* Forbid using -- on `bool'. */
5338 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
5340 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
5342 if (complain & tf_error)
5343 error ("invalid use of Boolean expression as operand "
5344 "to %<operator--%>");
5345 return error_mark_node;
5347 val = boolean_increment (code, arg);
5350 val = build2 (code, TREE_TYPE (arg), arg, inc);
5352 TREE_SIDE_EFFECTS (val) = 1;
5357 /* Note that this operation never does default_conversion
5358 regardless of NOCONVERT. */
5359 return cp_build_addr_expr (arg, complain);
5368 argtype = TREE_TYPE (arg);
5369 return fold_if_not_in_template (build1 (code, argtype, arg));
5372 if (complain & tf_error)
5373 error ("%s", errstring);
5374 return error_mark_node;
5377 /* Hook for the c-common bits that build a unary op. */
5379 build_unary_op (location_t location ATTRIBUTE_UNUSED,
5380 enum tree_code code, tree xarg, int noconvert)
5382 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5385 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5386 for certain kinds of expressions which are not really lvalues
5387 but which we can accept as lvalues.
5389 If ARG is not a kind of expression we can handle, return
5393 unary_complex_lvalue (enum tree_code code, tree arg)
5395 /* Inside a template, making these kinds of adjustments is
5396 pointless; we are only concerned with the type of the
5398 if (processing_template_decl)
5401 /* Handle (a, b) used as an "lvalue". */
5402 if (TREE_CODE (arg) == COMPOUND_EXPR)
5404 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5405 tf_warning_or_error);
5406 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5407 TREE_OPERAND (arg, 0), real_result);
5410 /* Handle (a ? b : c) used as an "lvalue". */
5411 if (TREE_CODE (arg) == COND_EXPR
5412 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5413 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5415 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5416 if (TREE_CODE (arg) == MODIFY_EXPR
5417 || TREE_CODE (arg) == PREINCREMENT_EXPR
5418 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5420 tree lvalue = TREE_OPERAND (arg, 0);
5421 if (TREE_SIDE_EFFECTS (lvalue))
5423 lvalue = stabilize_reference (lvalue);
5424 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5425 lvalue, TREE_OPERAND (arg, 1));
5427 return unary_complex_lvalue
5428 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5431 if (code != ADDR_EXPR)
5434 /* Handle (a = b) used as an "lvalue" for `&'. */
5435 if (TREE_CODE (arg) == MODIFY_EXPR
5436 || TREE_CODE (arg) == INIT_EXPR)
5438 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5439 tf_warning_or_error);
5440 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5442 TREE_NO_WARNING (arg) = 1;
5446 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5447 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5448 || TREE_CODE (arg) == OFFSET_REF)
5451 /* We permit compiler to make function calls returning
5452 objects of aggregate type look like lvalues. */
5456 if (TREE_CODE (targ) == SAVE_EXPR)
5457 targ = TREE_OPERAND (targ, 0);
5459 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5461 if (TREE_CODE (arg) == SAVE_EXPR)
5464 targ = build_cplus_new (TREE_TYPE (arg), arg);
5465 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5468 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5469 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5470 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5473 /* Don't let anything else be handled specially. */
5477 /* Mark EXP saying that we need to be able to take the
5478 address of it; it should not be allocated in a register.
5479 Value is true if successful.
5481 C++: we do not allow `current_class_ptr' to be addressable. */
5484 cxx_mark_addressable (tree exp)
5489 switch (TREE_CODE (x))
5496 x = TREE_OPERAND (x, 0);
5500 if (x == current_class_ptr)
5502 error ("cannot take the address of %<this%>, which is an rvalue expression");
5503 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5509 /* Caller should not be trying to mark initialized
5510 constant fields addressable. */
5511 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5512 || DECL_IN_AGGR_P (x) == 0
5514 || DECL_EXTERNAL (x));
5519 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5520 && !DECL_ARTIFICIAL (x))
5522 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5525 ("address of explicit register variable %qD requested", x);
5528 else if (extra_warnings)
5530 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5532 TREE_ADDRESSABLE (x) = 1;
5536 TREE_ADDRESSABLE (x) = 1;
5540 TREE_ADDRESSABLE (x) = 1;
5544 TREE_ADDRESSABLE (x) = 1;
5545 cxx_mark_addressable (TREE_OPERAND (x, 0));
5553 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5556 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5557 tsubst_flags_t complain)
5559 tree orig_ifexp = ifexp;
5560 tree orig_op1 = op1;
5561 tree orig_op2 = op2;
5564 if (processing_template_decl)
5566 /* The standard says that the expression is type-dependent if
5567 IFEXP is type-dependent, even though the eventual type of the
5568 expression doesn't dependent on IFEXP. */
5569 if (type_dependent_expression_p (ifexp)
5570 /* As a GNU extension, the middle operand may be omitted. */
5571 || (op1 && type_dependent_expression_p (op1))
5572 || type_dependent_expression_p (op2))
5573 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5574 ifexp = build_non_dependent_expr (ifexp);
5576 op1 = build_non_dependent_expr (op1);
5577 op2 = build_non_dependent_expr (op2);
5580 expr = build_conditional_expr (ifexp, op1, op2, complain);
5581 if (processing_template_decl && expr != error_mark_node)
5582 return build_min_non_dep (COND_EXPR, expr,
5583 orig_ifexp, orig_op1, orig_op2);
5587 /* Given a list of expressions, return a compound expression
5588 that performs them all and returns the value of the last of them. */
5591 build_x_compound_expr_from_list (tree list, expr_list_kind exp,
5592 tsubst_flags_t complain)
5594 tree expr = TREE_VALUE (list);
5596 if (TREE_CHAIN (list))
5598 if (complain & tf_error)
5602 permerror (input_location, "expression list treated as compound "
5603 "expression in initializer");
5606 permerror (input_location, "expression list treated as compound "
5607 "expression in mem-initializer");
5610 permerror (input_location, "expression list treated as compound "
5611 "expression in functional cast");
5617 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5618 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5625 /* Like build_x_compound_expr_from_list, but using a VEC. */
5628 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5630 if (VEC_empty (tree, vec))
5632 else if (VEC_length (tree, vec) == 1)
5633 return VEC_index (tree, vec, 0);
5641 permerror (input_location,
5642 "%s expression list treated as compound expression",
5645 expr = VEC_index (tree, vec, 0);
5646 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5647 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5653 /* Handle overloading of the ',' operator when needed. */
5656 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5659 tree orig_op1 = op1;
5660 tree orig_op2 = op2;
5662 if (processing_template_decl)
5664 if (type_dependent_expression_p (op1)
5665 || type_dependent_expression_p (op2))
5666 return build_min_nt (COMPOUND_EXPR, op1, op2);
5667 op1 = build_non_dependent_expr (op1);
5668 op2 = build_non_dependent_expr (op2);
5671 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5672 /*overloaded_p=*/NULL, complain);
5674 result = cp_build_compound_expr (op1, op2, complain);
5676 if (processing_template_decl && result != error_mark_node)
5677 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5682 /* Like cp_build_compound_expr, but for the c-common bits. */
5685 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5687 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5690 /* Build a compound expression. */
5693 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5695 lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
5697 if (lhs == error_mark_node || rhs == error_mark_node)
5698 return error_mark_node;
5700 if (TREE_CODE (rhs) == TARGET_EXPR)
5702 /* If the rhs is a TARGET_EXPR, then build the compound
5703 expression inside the target_expr's initializer. This
5704 helps the compiler to eliminate unnecessary temporaries. */
5705 tree init = TREE_OPERAND (rhs, 1);
5707 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5708 TREE_OPERAND (rhs, 1) = init;
5713 if (type_unknown_p (rhs))
5715 error ("no context to resolve type of %qE", rhs);
5716 return error_mark_node;
5719 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5722 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5723 casts away constness. CAST gives the type of cast.
5725 ??? This function warns for casting away any qualifier not just
5726 const. We would like to specify exactly what qualifiers are casted
5731 check_for_casting_away_constness (tree src_type, tree dest_type,
5732 enum tree_code cast)
5734 /* C-style casts are allowed to cast away constness. With
5735 WARN_CAST_QUAL, we still want to issue a warning. */
5736 if (cast == CAST_EXPR && !warn_cast_qual)
5739 if (!casts_away_constness (src_type, dest_type))
5745 warning (OPT_Wcast_qual,
5746 "cast from type %qT to type %qT casts away qualifiers",
5747 src_type, dest_type);
5750 case STATIC_CAST_EXPR:
5751 error ("static_cast from type %qT to type %qT casts away qualifiers",
5752 src_type, dest_type);
5755 case REINTERPRET_CAST_EXPR:
5756 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5757 src_type, dest_type);
5764 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5765 (another pointer-to-member type in the same hierarchy) and return
5766 the converted expression. If ALLOW_INVERSE_P is permitted, a
5767 pointer-to-derived may be converted to pointer-to-base; otherwise,
5768 only the other direction is permitted. If C_CAST_P is true, this
5769 conversion is taking place as part of a C-style cast. */
5772 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5773 bool c_cast_p, tsubst_flags_t complain)
5775 if (TYPE_PTRMEM_P (type))
5779 if (TREE_CODE (expr) == PTRMEM_CST)
5780 expr = cplus_expand_constant (expr);
5781 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5782 TYPE_PTRMEM_CLASS_TYPE (type),
5784 c_cast_p, complain);
5785 if (delta == error_mark_node)
5786 return error_mark_node;
5788 if (!integer_zerop (delta))
5790 tree cond, op1, op2;
5792 cond = cp_build_binary_op (input_location,
5795 build_int_cst (TREE_TYPE (expr), -1),
5796 tf_warning_or_error);
5797 op1 = build_nop (ptrdiff_type_node, expr);
5798 op2 = cp_build_binary_op (input_location,
5799 PLUS_EXPR, op1, delta,
5800 tf_warning_or_error);
5802 expr = fold_build3_loc (input_location,
5803 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5807 return build_nop (type, expr);
5810 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5811 allow_inverse_p, c_cast_p, complain);
5814 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5815 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5816 Otherwise, return EXPR unchanged. */
5819 ignore_overflows (tree expr, tree orig)
5821 if (TREE_CODE (expr) == INTEGER_CST
5822 && CONSTANT_CLASS_P (orig)
5823 && TREE_CODE (orig) != STRING_CST
5824 && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig))
5826 if (!TREE_OVERFLOW (orig))
5827 /* Ensure constant sharing. */
5828 expr = build_int_cst_wide (TREE_TYPE (expr),
5829 TREE_INT_CST_LOW (expr),
5830 TREE_INT_CST_HIGH (expr));
5833 /* Avoid clobbering a shared constant. */
5834 expr = copy_node (expr);
5835 TREE_OVERFLOW (expr) = TREE_OVERFLOW (orig);
5841 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5842 this static_cast is being attempted as one of the possible casts
5843 allowed by a C-style cast. (In that case, accessibility of base
5844 classes is not considered, and it is OK to cast away
5845 constness.) Return the result of the cast. *VALID_P is set to
5846 indicate whether or not the cast was valid. */
5849 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5850 bool *valid_p, tsubst_flags_t complain)
5856 /* Assume the cast is valid. */
5859 intype = TREE_TYPE (expr);
5861 /* Save casted types in the function's used types hash table. */
5862 used_types_insert (type);
5864 /* [expr.static.cast]
5866 An lvalue of type "cv1 B", where B is a class type, can be cast
5867 to type "reference to cv2 D", where D is a class derived (clause
5868 _class.derived_) from B, if a valid standard conversion from
5869 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5870 same cv-qualification as, or greater cv-qualification than, cv1,
5871 and B is not a virtual base class of D. */
5872 /* We check this case before checking the validity of "TYPE t =
5873 EXPR;" below because for this case:
5876 struct D : public B { D(const B&); };
5878 void f() { static_cast<const D&>(b); }
5880 we want to avoid constructing a new D. The standard is not
5881 completely clear about this issue, but our interpretation is
5882 consistent with other compilers. */
5883 if (TREE_CODE (type) == REFERENCE_TYPE
5884 && CLASS_TYPE_P (TREE_TYPE (type))
5885 && CLASS_TYPE_P (intype)
5886 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5887 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5888 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5889 build_pointer_type (TYPE_MAIN_VARIANT
5890 (TREE_TYPE (type))))
5892 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5896 /* There is a standard conversion from "D*" to "B*" even if "B"
5897 is ambiguous or inaccessible. If this is really a
5898 static_cast, then we check both for inaccessibility and
5899 ambiguity. However, if this is a static_cast being performed
5900 because the user wrote a C-style cast, then accessibility is
5902 base = lookup_base (TREE_TYPE (type), intype,
5903 c_cast_p ? ba_unique : ba_check,
5906 /* Convert from "B*" to "D*". This function will check that "B"
5907 is not a virtual base of "D". */
5908 expr = build_base_path (MINUS_EXPR, build_address (expr),
5909 base, /*nonnull=*/false);
5910 /* Convert the pointer to a reference -- but then remember that
5911 there are no expressions with reference type in C++. */
5912 return convert_from_reference (cp_fold_convert (type, expr));
5915 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5916 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5917 if (TREE_CODE (type) == REFERENCE_TYPE
5918 && TYPE_REF_IS_RVALUE (type)
5919 && real_lvalue_p (expr)
5920 && reference_related_p (TREE_TYPE (type), intype)
5921 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5923 expr = build_typed_address (expr, type);
5924 return convert_from_reference (expr);
5929 /* Resolve overloaded address here rather than once in
5930 implicit_conversion and again in the inverse code below. */
5931 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5933 expr = instantiate_type (type, expr, complain);
5934 intype = TREE_TYPE (expr);
5937 /* [expr.static.cast]
5939 An expression e can be explicitly converted to a type T using a
5940 static_cast of the form static_cast<T>(e) if the declaration T
5941 t(e);" is well-formed, for some invented temporary variable
5943 result = perform_direct_initialization_if_possible (type, expr,
5944 c_cast_p, complain);
5947 result = convert_from_reference (result);
5949 /* Ignore any integer overflow caused by the cast. */
5950 result = ignore_overflows (result, orig);
5952 /* [expr.static.cast]
5954 If T is a reference type, the result is an lvalue; otherwise,
5955 the result is an rvalue. */
5956 if (TREE_CODE (type) != REFERENCE_TYPE)
5957 result = rvalue (result);
5961 /* [expr.static.cast]
5963 Any expression can be explicitly converted to type cv void. */
5964 if (TREE_CODE (type) == VOID_TYPE)
5965 return convert_to_void (expr, ICV_CAST, complain);
5967 /* [expr.static.cast]
5969 The inverse of any standard conversion sequence (clause _conv_),
5970 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5971 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5972 (_conv.bool_) conversions, can be performed explicitly using
5973 static_cast subject to the restriction that the explicit
5974 conversion does not cast away constness (_expr.const.cast_), and
5975 the following additional rules for specific cases: */
5976 /* For reference, the conversions not excluded are: integral
5977 promotions, floating point promotion, integral conversions,
5978 floating point conversions, floating-integral conversions,
5979 pointer conversions, and pointer to member conversions. */
5982 A value of integral _or enumeration_ type can be explicitly
5983 converted to an enumeration type. */
5984 /* The effect of all that is that any conversion between any two
5985 types which are integral, floating, or enumeration types can be
5987 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5988 || SCALAR_FLOAT_TYPE_P (type))
5989 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5990 || SCALAR_FLOAT_TYPE_P (intype)))
5992 expr = ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5994 /* Ignore any integer overflow caused by the cast. */
5995 expr = ignore_overflows (expr, orig);
5999 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
6000 && CLASS_TYPE_P (TREE_TYPE (type))
6001 && CLASS_TYPE_P (TREE_TYPE (intype))
6002 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
6003 (TREE_TYPE (intype))),
6004 build_pointer_type (TYPE_MAIN_VARIANT
6005 (TREE_TYPE (type)))))
6010 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
6011 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
6012 c_cast_p ? ba_unique : ba_check,
6014 return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
6017 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6018 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6025 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
6026 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
6028 if (TYPE_PTRMEM_P (type))
6030 t1 = (build_ptrmem_type
6032 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
6033 t2 = (build_ptrmem_type
6035 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
6042 if (can_convert (t1, t2) || can_convert (t2, t1))
6045 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
6046 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
6047 c_cast_p, tf_warning_or_error);
6051 /* [expr.static.cast]
6053 An rvalue of type "pointer to cv void" can be explicitly
6054 converted to a pointer to object type. A value of type pointer
6055 to object converted to "pointer to cv void" and back to the
6056 original pointer type will have its original value. */
6057 if (TREE_CODE (intype) == POINTER_TYPE
6058 && VOID_TYPE_P (TREE_TYPE (intype))
6059 && TYPE_PTROB_P (type))
6062 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
6063 return build_nop (type, expr);
6067 return error_mark_node;
6070 /* Return an expression representing static_cast<TYPE>(EXPR). */
6073 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
6078 if (type == error_mark_node || expr == error_mark_node)
6079 return error_mark_node;
6081 if (processing_template_decl)
6083 expr = build_min (STATIC_CAST_EXPR, type, expr);
6084 /* We don't know if it will or will not have side effects. */
6085 TREE_SIDE_EFFECTS (expr) = 1;
6086 return convert_from_reference (expr);
6089 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6090 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6091 if (TREE_CODE (type) != REFERENCE_TYPE
6092 && TREE_CODE (expr) == NOP_EXPR
6093 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6094 expr = TREE_OPERAND (expr, 0);
6096 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
6101 if (complain & tf_error)
6102 error ("invalid static_cast from type %qT to type %qT",
6103 TREE_TYPE (expr), type);
6104 return error_mark_node;
6107 /* EXPR is an expression with member function or pointer-to-member
6108 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6109 not permitted by ISO C++, but we accept it in some modes. If we
6110 are not in one of those modes, issue a diagnostic. Return the
6111 converted expression. */
6114 convert_member_func_to_ptr (tree type, tree expr)
6119 intype = TREE_TYPE (expr);
6120 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
6121 || TREE_CODE (intype) == METHOD_TYPE);
6123 if (pedantic || warn_pmf2ptr)
6124 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
6125 "converting from %qT to %qT", intype, type);
6127 if (TREE_CODE (intype) == METHOD_TYPE)
6128 expr = build_addr_func (expr);
6129 else if (TREE_CODE (expr) == PTRMEM_CST)
6130 expr = build_address (PTRMEM_CST_MEMBER (expr));
6133 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
6134 decl = build_address (decl);
6135 expr = get_member_function_from_ptrfunc (&decl, expr);
6138 return build_nop (type, expr);
6141 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6142 If C_CAST_P is true, this reinterpret cast is being done as part of
6143 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6144 indicate whether or not reinterpret_cast was valid. */
6147 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
6148 bool *valid_p, tsubst_flags_t complain)
6152 /* Assume the cast is invalid. */
6156 if (type == error_mark_node || error_operand_p (expr))
6157 return error_mark_node;
6159 intype = TREE_TYPE (expr);
6161 /* Save casted types in the function's used types hash table. */
6162 used_types_insert (type);
6164 /* [expr.reinterpret.cast]
6165 An lvalue expression of type T1 can be cast to the type
6166 "reference to T2" if an expression of type "pointer to T1" can be
6167 explicitly converted to the type "pointer to T2" using a
6168 reinterpret_cast. */
6169 if (TREE_CODE (type) == REFERENCE_TYPE)
6171 if (! real_lvalue_p (expr))
6173 if (complain & tf_error)
6174 error ("invalid cast of an rvalue expression of type "
6177 return error_mark_node;
6180 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6181 "B" are related class types; the reinterpret_cast does not
6182 adjust the pointer. */
6183 if (TYPE_PTR_P (intype)
6184 && (complain & tf_warning)
6185 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6186 COMPARE_BASE | COMPARE_DERIVED)))
6187 warning (0, "casting %qT to %qT does not dereference pointer",
6190 expr = cp_build_addr_expr (expr, complain);
6192 if (warn_strict_aliasing > 2)
6193 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6195 if (expr != error_mark_node)
6196 expr = build_reinterpret_cast_1
6197 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6199 if (expr != error_mark_node)
6200 /* cp_build_indirect_ref isn't right for rvalue refs. */
6201 expr = convert_from_reference (fold_convert (type, expr));
6205 /* As a G++ extension, we consider conversions from member
6206 functions, and pointers to member functions to
6207 pointer-to-function and pointer-to-void types. If
6208 -Wno-pmf-conversions has not been specified,
6209 convert_member_func_to_ptr will issue an error message. */
6210 if ((TYPE_PTRMEMFUNC_P (intype)
6211 || TREE_CODE (intype) == METHOD_TYPE)
6212 && TYPE_PTR_P (type)
6213 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6214 || VOID_TYPE_P (TREE_TYPE (type))))
6215 return convert_member_func_to_ptr (type, expr);
6217 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6218 array-to-pointer, and function-to-pointer conversions are
6220 expr = decay_conversion (expr);
6222 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6223 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6224 if (TREE_CODE (expr) == NOP_EXPR
6225 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6226 expr = TREE_OPERAND (expr, 0);
6228 if (error_operand_p (expr))
6229 return error_mark_node;
6231 intype = TREE_TYPE (expr);
6233 /* [expr.reinterpret.cast]
6234 A pointer can be converted to any integral type large enough to
6235 hold it. ... A value of type std::nullptr_t can be converted to
6236 an integral type; the conversion has the same meaning and
6237 validity as a conversion of (void*)0 to the integral type. */
6238 if (CP_INTEGRAL_TYPE_P (type)
6239 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6241 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6243 if (complain & tf_error)
6244 permerror (input_location, "cast from %qT to %qT loses precision",
6247 return error_mark_node;
6249 if (NULLPTR_TYPE_P (intype))
6250 return build_int_cst (type, 0);
6252 /* [expr.reinterpret.cast]
6253 A value of integral or enumeration type can be explicitly
6254 converted to a pointer. */
6255 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6258 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6259 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6260 return fold_if_not_in_template (build_nop (type, expr));
6261 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6262 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6267 check_for_casting_away_constness (intype, type, REINTERPRET_CAST_EXPR);
6268 /* Warn about possible alignment problems. */
6269 if (STRICT_ALIGNMENT && warn_cast_align
6270 && (complain & tf_warning)
6271 && !VOID_TYPE_P (type)
6272 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6273 && COMPLETE_TYPE_P (TREE_TYPE (type))
6274 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6275 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6276 warning (OPT_Wcast_align, "cast from %qT to %qT "
6277 "increases required alignment of target type", intype, type);
6279 /* We need to strip nops here, because the front end likes to
6280 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6282 if (warn_strict_aliasing <= 2)
6283 strict_aliasing_warning (intype, type, sexpr);
6285 return fold_if_not_in_template (build_nop (type, expr));
6287 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6288 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6290 if (pedantic && (complain & tf_warning))
6291 /* Only issue a warning, as we have always supported this
6292 where possible, and it is necessary in some cases. DR 195
6293 addresses this issue, but as of 2004/10/26 is still in
6295 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6296 return fold_if_not_in_template (build_nop (type, expr));
6298 else if (TREE_CODE (type) == VECTOR_TYPE)
6299 return fold_if_not_in_template (convert_to_vector (type, expr));
6300 else if (TREE_CODE (intype) == VECTOR_TYPE
6301 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6302 return fold_if_not_in_template (convert_to_integer (type, expr));
6307 if (complain & tf_error)
6308 error ("invalid cast from type %qT to type %qT", intype, type);
6309 return error_mark_node;
6312 return cp_convert (type, expr);
6316 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6318 if (type == error_mark_node || expr == error_mark_node)
6319 return error_mark_node;
6321 if (processing_template_decl)
6323 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6325 if (!TREE_SIDE_EFFECTS (t)
6326 && type_dependent_expression_p (expr))
6327 /* There might turn out to be side effects inside expr. */
6328 TREE_SIDE_EFFECTS (t) = 1;
6329 return convert_from_reference (t);
6332 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6333 /*valid_p=*/NULL, complain);
6336 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6337 return an appropriate expression. Otherwise, return
6338 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6339 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6340 performing a C-style cast, its value upon return will indicate
6341 whether or not the conversion succeeded. */
6344 build_const_cast_1 (tree dst_type, tree expr, bool complain,
6348 tree reference_type;
6350 /* Callers are responsible for handling error_mark_node as a
6351 destination type. */
6352 gcc_assert (dst_type != error_mark_node);
6353 /* In a template, callers should be building syntactic
6354 representations of casts, not using this machinery. */
6355 gcc_assert (!processing_template_decl);
6357 /* Assume the conversion is invalid. */
6361 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
6364 error ("invalid use of const_cast with type %qT, "
6365 "which is not a pointer, "
6366 "reference, nor a pointer-to-data-member type", dst_type);
6367 return error_mark_node;
6370 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
6373 error ("invalid use of const_cast with type %qT, which is a pointer "
6374 "or reference to a function type", dst_type);
6375 return error_mark_node;
6378 /* Save casted types in the function's used types hash table. */
6379 used_types_insert (dst_type);
6381 src_type = TREE_TYPE (expr);
6382 /* Expressions do not really have reference types. */
6383 if (TREE_CODE (src_type) == REFERENCE_TYPE)
6384 src_type = TREE_TYPE (src_type);
6386 /* [expr.const.cast]
6388 An lvalue of type T1 can be explicitly converted to an lvalue of
6389 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6390 types) if a pointer to T1 can be explicitly converted to the type
6391 pointer to T2 using a const_cast. */
6392 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
6394 reference_type = dst_type;
6395 if (! real_lvalue_p (expr))
6398 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6399 src_type, dst_type);
6400 return error_mark_node;
6402 dst_type = build_pointer_type (TREE_TYPE (dst_type));
6403 src_type = build_pointer_type (src_type);
6407 reference_type = NULL_TREE;
6408 /* If the destination type is not a reference type, the
6409 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6410 conversions are performed. */
6411 src_type = type_decays_to (src_type);
6412 if (src_type == error_mark_node)
6413 return error_mark_node;
6416 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
6417 && comp_ptr_ttypes_const (dst_type, src_type))
6422 /* This cast is actually a C-style cast. Issue a warning if
6423 the user is making a potentially unsafe cast. */
6424 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR);
6428 expr = cp_build_addr_expr (expr,
6429 complain ? tf_warning_or_error : tf_none);
6430 expr = build_nop (reference_type, expr);
6431 return convert_from_reference (expr);
6435 expr = decay_conversion (expr);
6436 /* build_c_cast puts on a NOP_EXPR to make the result not an
6437 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6438 non-lvalue context. */
6439 if (TREE_CODE (expr) == NOP_EXPR
6440 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6441 expr = TREE_OPERAND (expr, 0);
6442 return build_nop (dst_type, expr);
6447 error ("invalid const_cast from type %qT to type %qT",
6448 src_type, dst_type);
6449 return error_mark_node;
6453 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
6455 if (type == error_mark_node || error_operand_p (expr))
6456 return error_mark_node;
6458 if (processing_template_decl)
6460 tree t = build_min (CONST_CAST_EXPR, type, expr);
6462 if (!TREE_SIDE_EFFECTS (t)
6463 && type_dependent_expression_p (expr))
6464 /* There might turn out to be side effects inside expr. */
6465 TREE_SIDE_EFFECTS (t) = 1;
6466 return convert_from_reference (t);
6469 return build_const_cast_1 (type, expr, complain & tf_error,
6473 /* Like cp_build_c_cast, but for the c-common bits. */
6476 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
6478 return cp_build_c_cast (type, expr, tf_warning_or_error);
6481 /* Build an expression representing an explicit C-style cast to type
6482 TYPE of expression EXPR. */
6485 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
6491 if (type == error_mark_node || error_operand_p (expr))
6492 return error_mark_node;
6494 if (processing_template_decl)
6496 tree t = build_min (CAST_EXPR, type,
6497 tree_cons (NULL_TREE, value, NULL_TREE));
6498 /* We don't know if it will or will not have side effects. */
6499 TREE_SIDE_EFFECTS (t) = 1;
6500 return convert_from_reference (t);
6503 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6504 'Class') should always be retained, because this information aids
6505 in method lookup. */
6506 if (objc_is_object_ptr (type)
6507 && objc_is_object_ptr (TREE_TYPE (expr)))
6508 return build_nop (type, expr);
6510 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6511 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6512 if (TREE_CODE (type) != REFERENCE_TYPE
6513 && TREE_CODE (value) == NOP_EXPR
6514 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6515 value = TREE_OPERAND (value, 0);
6517 if (TREE_CODE (type) == ARRAY_TYPE)
6519 /* Allow casting from T1* to T2[] because Cfront allows it.
6520 NIHCL uses it. It is not valid ISO C++ however. */
6521 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6523 if (complain & tf_error)
6524 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6526 return error_mark_node;
6527 type = build_pointer_type (TREE_TYPE (type));
6531 if (complain & tf_error)
6532 error ("ISO C++ forbids casting to an array type %qT", type);
6533 return error_mark_node;
6537 if (TREE_CODE (type) == FUNCTION_TYPE
6538 || TREE_CODE (type) == METHOD_TYPE)
6540 if (complain & tf_error)
6541 error ("invalid cast to function type %qT", type);
6542 return error_mark_node;
6545 if (TREE_CODE (type) == POINTER_TYPE
6546 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
6547 /* Casting to an integer of smaller size is an error detected elsewhere. */
6548 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
6549 /* Don't warn about converting any constant. */
6550 && !TREE_CONSTANT (value))
6551 warning_at (input_location, OPT_Wint_to_pointer_cast,
6552 "cast to pointer from integer of different size");
6554 /* A C-style cast can be a const_cast. */
6555 result = build_const_cast_1 (type, value, /*complain=*/false,
6560 /* Or a static cast. */
6561 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6562 &valid_p, complain);
6563 /* Or a reinterpret_cast. */
6565 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6566 &valid_p, complain);
6567 /* The static_cast or reinterpret_cast may be followed by a
6570 /* A valid cast may result in errors if, for example, a
6571 conversion to am ambiguous base class is required. */
6572 && !error_operand_p (result))
6576 /* Non-class rvalues always have cv-unqualified type. */
6577 if (!CLASS_TYPE_P (type))
6578 type = TYPE_MAIN_VARIANT (type);
6579 result_type = TREE_TYPE (result);
6580 if (!CLASS_TYPE_P (result_type))
6581 result_type = TYPE_MAIN_VARIANT (result_type);
6582 /* If the type of RESULT does not match TYPE, perform a
6583 const_cast to make it match. If the static_cast or
6584 reinterpret_cast succeeded, we will differ by at most
6585 cv-qualification, so the follow-on const_cast is guaranteed
6587 if (!same_type_p (non_reference (type), non_reference (result_type)))
6589 result = build_const_cast_1 (type, result, false, &valid_p);
6590 gcc_assert (valid_p);
6595 return error_mark_node;
6598 /* For use from the C common bits. */
6600 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6601 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6602 enum tree_code modifycode,
6603 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6604 tree rhs_origtype ATTRIBUTE_UNUSED)
6606 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6609 /* Build an assignment expression of lvalue LHS from value RHS.
6610 MODIFYCODE is the code for a binary operator that we use
6611 to combine the old value of LHS with RHS to get the new value.
6612 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6614 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6617 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6618 tsubst_flags_t complain)
6622 tree lhstype = TREE_TYPE (lhs);
6623 tree olhstype = lhstype;
6624 bool plain_assign = (modifycode == NOP_EXPR);
6626 /* Avoid duplicate error messages from operands that had errors. */
6627 if (error_operand_p (lhs) || error_operand_p (rhs))
6628 return error_mark_node;
6630 /* Handle control structure constructs used as "lvalues". */
6631 switch (TREE_CODE (lhs))
6633 /* Handle --foo = 5; as these are valid constructs in C++. */
6634 case PREDECREMENT_EXPR:
6635 case PREINCREMENT_EXPR:
6636 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6637 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6638 stabilize_reference (TREE_OPERAND (lhs, 0)),
6639 TREE_OPERAND (lhs, 1));
6640 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6641 modifycode, rhs, complain);
6642 if (newrhs == error_mark_node)
6643 return error_mark_node;
6644 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6646 /* Handle (a, b) used as an "lvalue". */
6648 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6649 modifycode, rhs, complain);
6650 if (newrhs == error_mark_node)
6651 return error_mark_node;
6652 return build2 (COMPOUND_EXPR, lhstype,
6653 TREE_OPERAND (lhs, 0), newrhs);
6656 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6657 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6658 stabilize_reference (TREE_OPERAND (lhs, 0)),
6659 TREE_OPERAND (lhs, 1));
6660 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6662 if (newrhs == error_mark_node)
6663 return error_mark_node;
6664 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6668 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6669 when neither operand has side-effects. */
6670 if (!lvalue_or_else (lhs, lv_assign, complain))
6671 return error_mark_node;
6673 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6674 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6676 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6677 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6679 TREE_OPERAND (lhs, 0),
6680 TREE_OPERAND (lhs, 1)),
6681 TREE_OPERAND (lhs, 0),
6682 TREE_OPERAND (lhs, 1));
6685 /* Handle (a ? b : c) used as an "lvalue". */
6688 /* Produce (a ? (b = rhs) : (c = rhs))
6689 except that the RHS goes through a save-expr
6690 so the code to compute it is only emitted once. */
6692 tree preeval = NULL_TREE;
6694 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6696 if (complain & tf_error)
6697 error ("void value not ignored as it ought to be");
6698 return error_mark_node;
6701 rhs = stabilize_expr (rhs, &preeval);
6703 /* Check this here to avoid odd errors when trying to convert
6704 a throw to the type of the COND_EXPR. */
6705 if (!lvalue_or_else (lhs, lv_assign, complain))
6706 return error_mark_node;
6708 cond = build_conditional_expr
6709 (TREE_OPERAND (lhs, 0),
6710 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6711 modifycode, rhs, complain),
6712 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6713 modifycode, rhs, complain),
6716 if (cond == error_mark_node)
6718 /* Make sure the code to compute the rhs comes out
6719 before the split. */
6721 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6729 if (modifycode == INIT_EXPR)
6731 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6732 /* Do the default thing. */;
6733 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6735 /* Compound literal. */
6736 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6737 /* Call convert to generate an error; see PR 11063. */
6738 rhs = convert (lhstype, rhs);
6739 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6740 TREE_SIDE_EFFECTS (result) = 1;
6743 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6744 /* Do the default thing. */;
6747 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6748 result = build_special_member_call (lhs, complete_ctor_identifier,
6749 &rhs_vec, lhstype, LOOKUP_NORMAL,
6751 release_tree_vector (rhs_vec);
6752 if (result == NULL_TREE)
6753 return error_mark_node;
6759 lhs = require_complete_type_sfinae (lhs, complain);
6760 if (lhs == error_mark_node)
6761 return error_mark_node;
6763 if (modifycode == NOP_EXPR)
6765 if (c_dialect_objc ())
6767 result = objc_maybe_build_modify_expr (lhs, rhs);
6772 /* `operator=' is not an inheritable operator. */
6773 if (! MAYBE_CLASS_TYPE_P (lhstype))
6774 /* Do the default thing. */;
6777 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6778 lhs, rhs, make_node (NOP_EXPR),
6779 /*overloaded_p=*/NULL,
6781 if (result == NULL_TREE)
6782 return error_mark_node;
6789 /* A binary op has been requested. Combine the old LHS
6790 value with the RHS producing the value we should actually
6791 store into the LHS. */
6792 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6793 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6794 || MAYBE_CLASS_TYPE_P (lhstype)));
6796 lhs = stabilize_reference (lhs);
6797 newrhs = cp_build_binary_op (input_location,
6798 modifycode, lhs, rhs,
6800 if (newrhs == error_mark_node)
6802 if (complain & tf_error)
6803 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6804 TREE_TYPE (lhs), TREE_TYPE (rhs));
6805 return error_mark_node;
6808 /* Now it looks like a plain assignment. */
6809 modifycode = NOP_EXPR;
6810 if (c_dialect_objc ())
6812 result = objc_maybe_build_modify_expr (lhs, newrhs);
6817 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6818 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6821 /* The left-hand side must be an lvalue. */
6822 if (!lvalue_or_else (lhs, lv_assign, complain))
6823 return error_mark_node;
6825 /* Warn about modifying something that is `const'. Don't warn if
6826 this is initialization. */
6827 if (modifycode != INIT_EXPR
6828 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6829 /* Functions are not modifiable, even though they are
6831 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6832 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6833 /* If it's an aggregate and any field is const, then it is
6834 effectively const. */
6835 || (CLASS_TYPE_P (lhstype)
6836 && C_TYPE_FIELDS_READONLY (lhstype))))
6838 if (complain & tf_error)
6839 readonly_error (lhs, REK_ASSIGNMENT);
6841 return error_mark_node;
6844 /* If storing into a structure or union member, it may have been given a
6845 lowered bitfield type. We need to convert to the declared type first,
6846 so retrieve it now. */
6848 olhstype = unlowered_expr_type (lhs);
6850 /* Convert new value to destination type. */
6852 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6856 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
6858 if (modifycode != INIT_EXPR)
6860 if (complain & tf_error)
6861 error ("assigning to an array from an initializer list");
6862 return error_mark_node;
6864 if (check_array_initializer (lhs, lhstype, newrhs))
6865 return error_mark_node;
6866 newrhs = digest_init (lhstype, newrhs);
6869 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6870 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
6872 if (complain & tf_error)
6873 error ("incompatible types in assignment of %qT to %qT",
6874 TREE_TYPE (rhs), lhstype);
6875 return error_mark_node;
6878 /* Allow array assignment in compiler-generated code. */
6879 else if (!current_function_decl
6880 || !DECL_ARTIFICIAL (current_function_decl))
6882 /* This routine is used for both initialization and assignment.
6883 Make sure the diagnostic message differentiates the context. */
6884 if (complain & tf_error)
6886 if (modifycode == INIT_EXPR)
6887 error ("array used as initializer");
6889 error ("invalid array assignment");
6891 return error_mark_node;
6894 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6895 ? 1 + (modifycode != INIT_EXPR): 0;
6896 return build_vec_init (lhs, NULL_TREE, newrhs,
6897 /*explicit_value_init_p=*/false,
6898 from_array, complain);
6901 if (modifycode == INIT_EXPR)
6902 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6903 LOOKUP_ONLYCONVERTING. */
6904 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6905 ICR_INIT, NULL_TREE, 0,
6908 newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
6909 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6911 if (!same_type_p (lhstype, olhstype))
6912 newrhs = cp_convert_and_check (lhstype, newrhs);
6914 if (modifycode != INIT_EXPR)
6916 if (TREE_CODE (newrhs) == CALL_EXPR
6917 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6918 newrhs = build_cplus_new (lhstype, newrhs);
6920 /* Can't initialize directly from a TARGET_EXPR, since that would
6921 cause the lhs to be constructed twice, and possibly result in
6922 accidental self-initialization. So we force the TARGET_EXPR to be
6923 expanded without a target. */
6924 if (TREE_CODE (newrhs) == TARGET_EXPR)
6925 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6926 TREE_OPERAND (newrhs, 0));
6929 if (newrhs == error_mark_node)
6930 return error_mark_node;
6932 if (c_dialect_objc () && flag_objc_gc)
6934 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6940 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6941 lhstype, lhs, newrhs);
6943 TREE_SIDE_EFFECTS (result) = 1;
6945 TREE_NO_WARNING (result) = 1;
6951 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6952 tsubst_flags_t complain)
6954 if (processing_template_decl)
6955 return build_min_nt (MODOP_EXPR, lhs,
6956 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6958 if (modifycode != NOP_EXPR)
6960 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6961 make_node (modifycode),
6962 /*overloaded_p=*/NULL,
6966 TREE_NO_WARNING (rval) = 1;
6970 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6973 /* Helper function for get_delta_difference which assumes FROM is a base
6974 class of TO. Returns a delta for the conversion of pointer-to-member
6975 of FROM to pointer-to-member of TO. If the conversion is invalid and
6976 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6977 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6978 If C_CAST_P is true, this conversion is taking place as part of a
6982 get_delta_difference_1 (tree from, tree to, bool c_cast_p,
6983 tsubst_flags_t complain)
6987 base_access access = c_cast_p ? ba_unique : ba_check;
6989 /* Note: ba_quiet does not distinguish between access control and
6991 if (!(complain & tf_error))
6994 binfo = lookup_base (to, from, access, &kind);
6996 if (kind == bk_inaccessible || kind == bk_ambig)
6998 if (!(complain & tf_error))
6999 return error_mark_node;
7001 error (" in pointer to member function conversion");
7002 return size_zero_node;
7006 if (kind != bk_via_virtual)
7007 return BINFO_OFFSET (binfo);
7009 /* FROM is a virtual base class of TO. Issue an error or warning
7010 depending on whether or not this is a reinterpret cast. */
7012 if (!(complain & tf_error))
7013 return error_mark_node;
7015 error ("pointer to member conversion via virtual base %qT",
7016 BINFO_TYPE (binfo_from_vbase (binfo)));
7018 return size_zero_node;
7025 /* Get difference in deltas for different pointer to member function
7026 types. If the conversion is invalid and tf_error is not set in
7027 COMPLAIN, returns error_mark_node, otherwise returns an integer
7028 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
7029 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
7030 conversions as well. If C_CAST_P is true this conversion is taking
7031 place as part of a C-style cast.
7033 Note that the naming of FROM and TO is kind of backwards; the return
7034 value is what we add to a TO in order to get a FROM. They are named
7035 this way because we call this function to find out how to convert from
7036 a pointer to member of FROM to a pointer to member of TO. */
7039 get_delta_difference (tree from, tree to,
7040 bool allow_inverse_p,
7041 bool c_cast_p, tsubst_flags_t complain)
7045 if (same_type_ignoring_top_level_qualifiers_p (from, to))
7046 /* Pointer to member of incomplete class is permitted*/
7047 result = size_zero_node;
7049 result = get_delta_difference_1 (from, to, c_cast_p, complain);
7051 if (result == error_mark_node)
7052 return error_mark_node;
7056 if (!allow_inverse_p)
7058 if (!(complain & tf_error))
7059 return error_mark_node;
7061 error_not_base_type (from, to);
7062 error (" in pointer to member conversion");
7063 result = size_zero_node;
7067 result = get_delta_difference_1 (to, from, c_cast_p, complain);
7069 if (result == error_mark_node)
7070 return error_mark_node;
7073 result = size_diffop_loc (input_location,
7074 size_zero_node, result);
7077 if (!(complain & tf_error))
7078 return error_mark_node;
7080 error_not_base_type (from, to);
7081 error (" in pointer to member conversion");
7082 result = size_zero_node;
7087 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
7091 /* Return a constructor for the pointer-to-member-function TYPE using
7092 the other components as specified. */
7095 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
7100 VEC(constructor_elt, gc) *v;
7102 /* Pull the FIELD_DECLs out of the type. */
7103 pfn_field = TYPE_FIELDS (type);
7104 delta_field = DECL_CHAIN (pfn_field);
7106 /* Make sure DELTA has the type we want. */
7107 delta = convert_and_check (delta_type_node, delta);
7109 /* Convert to the correct target type if necessary. */
7110 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
7112 /* Finish creating the initializer. */
7113 v = VEC_alloc(constructor_elt, gc, 2);
7114 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
7115 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
7116 u = build_constructor (type, v);
7117 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
7118 TREE_STATIC (u) = (TREE_CONSTANT (u)
7119 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
7121 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
7126 /* Build a constructor for a pointer to member function. It can be
7127 used to initialize global variables, local variable, or used
7128 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7131 If FORCE is nonzero, then force this conversion, even if
7132 we would rather not do it. Usually set when using an explicit
7133 cast. A C-style cast is being processed iff C_CAST_P is true.
7135 Return error_mark_node, if something goes wrong. */
7138 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
7139 tsubst_flags_t complain)
7145 if (error_operand_p (pfn))
7146 return error_mark_node;
7148 pfn_type = TREE_TYPE (pfn);
7149 to_type = build_ptrmemfunc_type (type);
7151 /* Handle multiple conversions of pointer to member functions. */
7152 if (TYPE_PTRMEMFUNC_P (pfn_type))
7154 tree delta = NULL_TREE;
7155 tree npfn = NULL_TREE;
7159 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
7160 error ("invalid conversion to type %qT from type %qT",
7163 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
7164 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
7166 c_cast_p, complain);
7167 if (n == error_mark_node)
7168 return error_mark_node;
7170 /* We don't have to do any conversion to convert a
7171 pointer-to-member to its own type. But, we don't want to
7172 just return a PTRMEM_CST if there's an explicit cast; that
7173 cast should make the expression an invalid template argument. */
7174 if (TREE_CODE (pfn) != PTRMEM_CST)
7176 if (same_type_p (to_type, pfn_type))
7178 else if (integer_zerop (n))
7179 return build_reinterpret_cast (to_type, pfn,
7180 tf_warning_or_error);
7183 if (TREE_SIDE_EFFECTS (pfn))
7184 pfn = save_expr (pfn);
7186 /* Obtain the function pointer and the current DELTA. */
7187 if (TREE_CODE (pfn) == PTRMEM_CST)
7188 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
7191 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
7192 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
7195 /* Just adjust the DELTA field. */
7196 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7197 (TREE_TYPE (delta), ptrdiff_type_node));
7198 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
7199 n = cp_build_binary_op (input_location,
7200 LSHIFT_EXPR, n, integer_one_node,
7201 tf_warning_or_error);
7202 delta = cp_build_binary_op (input_location,
7203 PLUS_EXPR, delta, n, tf_warning_or_error);
7204 return build_ptrmemfunc1 (to_type, delta, npfn);
7207 /* Handle null pointer to member function conversions. */
7208 if (null_ptr_cst_p (pfn))
7210 pfn = build_c_cast (input_location, type, integer_zero_node);
7211 return build_ptrmemfunc1 (to_type,
7216 if (type_unknown_p (pfn))
7217 return instantiate_type (type, pfn, tf_warning_or_error);
7219 fn = TREE_OPERAND (pfn, 0);
7220 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7221 /* In a template, we will have preserved the
7223 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7224 return make_ptrmem_cst (to_type, fn);
7227 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7230 ??? There is no consistency as to the types returned for the above
7231 values. Some code acts as if it were a sizetype and some as if it were
7232 integer_type_node. */
7235 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7237 tree type = TREE_TYPE (cst);
7238 tree fn = PTRMEM_CST_MEMBER (cst);
7239 tree ptr_class, fn_class;
7241 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7243 /* The class that the function belongs to. */
7244 fn_class = DECL_CONTEXT (fn);
7246 /* The class that we're creating a pointer to member of. */
7247 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7249 /* First, calculate the adjustment to the function's class. */
7250 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7251 /*c_cast_p=*/0, tf_warning_or_error);
7253 if (!DECL_VIRTUAL_P (fn))
7254 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
7257 /* If we're dealing with a virtual function, we have to adjust 'this'
7258 again, to point to the base which provides the vtable entry for
7259 fn; the call will do the opposite adjustment. */
7260 tree orig_class = DECL_CONTEXT (fn);
7261 tree binfo = binfo_or_else (orig_class, fn_class);
7262 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7263 *delta, BINFO_OFFSET (binfo));
7264 *delta = fold_if_not_in_template (*delta);
7266 /* We set PFN to the vtable offset at which the function can be
7267 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7268 case delta is shifted left, and then incremented). */
7269 *pfn = DECL_VINDEX (fn);
7270 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7271 TYPE_SIZE_UNIT (vtable_entry_type));
7272 *pfn = fold_if_not_in_template (*pfn);
7274 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7276 case ptrmemfunc_vbit_in_pfn:
7277 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7279 *pfn = fold_if_not_in_template (*pfn);
7282 case ptrmemfunc_vbit_in_delta:
7283 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7284 *delta, integer_one_node);
7285 *delta = fold_if_not_in_template (*delta);
7286 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7287 *delta, integer_one_node);
7288 *delta = fold_if_not_in_template (*delta);
7295 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
7296 *pfn = fold_if_not_in_template (*pfn);
7300 /* Return an expression for PFN from the pointer-to-member function
7304 pfn_from_ptrmemfunc (tree t)
7306 if (TREE_CODE (t) == PTRMEM_CST)
7311 expand_ptrmemfunc_cst (t, &delta, &pfn);
7316 return build_ptrmemfunc_access_expr (t, pfn_identifier);
7319 /* Return an expression for DELTA from the pointer-to-member function
7323 delta_from_ptrmemfunc (tree t)
7325 if (TREE_CODE (t) == PTRMEM_CST)
7330 expand_ptrmemfunc_cst (t, &delta, &pfn);
7335 return build_ptrmemfunc_access_expr (t, delta_identifier);
7338 /* Convert value RHS to type TYPE as preparation for an assignment to
7339 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7340 implicit conversion is. If FNDECL is non-NULL, we are doing the
7341 conversion in order to pass the PARMNUMth argument of FNDECL.
7342 If FNDECL is NULL, we are doing the conversion in function pointer
7343 argument passing, conversion in initialization, etc. */
7346 convert_for_assignment (tree type, tree rhs,
7347 impl_conv_rhs errtype, tree fndecl, int parmnum,
7348 tsubst_flags_t complain, int flags)
7351 enum tree_code coder;
7353 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7354 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
7355 rhs = TREE_OPERAND (rhs, 0);
7357 rhstype = TREE_TYPE (rhs);
7358 coder = TREE_CODE (rhstype);
7360 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
7361 && vector_types_convertible_p (type, rhstype, true))
7363 rhs = mark_rvalue_use (rhs);
7364 return convert (type, rhs);
7367 if (rhs == error_mark_node || rhstype == error_mark_node)
7368 return error_mark_node;
7369 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
7370 return error_mark_node;
7372 /* The RHS of an assignment cannot have void type. */
7373 if (coder == VOID_TYPE)
7375 if (complain & tf_error)
7376 error ("void value not ignored as it ought to be");
7377 return error_mark_node;
7380 /* Simplify the RHS if possible. */
7381 if (TREE_CODE (rhs) == CONST_DECL)
7382 rhs = DECL_INITIAL (rhs);
7384 if (c_dialect_objc ())
7388 tree rname = fndecl;
7399 selector = objc_message_selector ();
7401 if (selector && parmno > 1)
7408 if (objc_compare_types (type, rhstype, parmno, rname))
7410 rhs = mark_rvalue_use (rhs);
7411 return convert (type, rhs);
7417 The expression is implicitly converted (clause _conv_) to the
7418 cv-unqualified type of the left operand.
7420 We allow bad conversions here because by the time we get to this point
7421 we are committed to doing the conversion. If we end up doing a bad
7422 conversion, convert_like will complain. */
7423 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
7425 /* When -Wno-pmf-conversions is use, we just silently allow
7426 conversions from pointers-to-members to plain pointers. If
7427 the conversion doesn't work, cp_convert will complain. */
7429 && TYPE_PTR_P (type)
7430 && TYPE_PTRMEMFUNC_P (rhstype))
7431 rhs = cp_convert (strip_top_quals (type), rhs);
7434 if (complain & tf_error)
7436 /* If the right-hand side has unknown type, then it is an
7437 overloaded function. Call instantiate_type to get error
7439 if (rhstype == unknown_type_node)
7440 instantiate_type (type, rhs, tf_warning_or_error);
7442 error ("cannot convert %qT to %qT for argument %qP to %qD",
7443 rhstype, type, parmnum, fndecl);
7447 case ICR_DEFAULT_ARGUMENT:
7448 error ("cannot convert %qT to %qT in default argument",
7452 error ("cannot convert %qT to %qT in argument passing",
7455 case ICR_CONVERTING:
7456 error ("cannot convert %qT to %qT",
7460 error ("cannot convert %qT to %qT in initialization",
7464 error ("cannot convert %qT to %qT in return",
7468 error ("cannot convert %qT to %qT in assignment",
7475 return error_mark_node;
7478 if (warn_missing_format_attribute)
7480 const enum tree_code codel = TREE_CODE (type);
7481 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7483 && check_missing_format_attribute (type, rhstype)
7484 && (complain & tf_warning))
7488 case ICR_DEFAULT_ARGUMENT:
7490 warning (OPT_Wmissing_format_attribute,
7491 "parameter %qP of %qD might be a candidate "
7492 "for a format attribute", parmnum, fndecl);
7494 warning (OPT_Wmissing_format_attribute,
7495 "parameter might be a candidate "
7496 "for a format attribute");
7498 case ICR_CONVERTING:
7499 warning (OPT_Wmissing_format_attribute,
7500 "target of conversion might be might be a candidate "
7501 "for a format attribute");
7504 warning (OPT_Wmissing_format_attribute,
7505 "target of initialization might be a candidate "
7506 "for a format attribute");
7509 warning (OPT_Wmissing_format_attribute,
7510 "return type might be a candidate "
7511 "for a format attribute");
7514 warning (OPT_Wmissing_format_attribute,
7515 "left-hand side of assignment might be a candidate "
7516 "for a format attribute");
7523 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7525 if (warn_parentheses
7526 && TREE_CODE (type) == BOOLEAN_TYPE
7527 && TREE_CODE (rhs) == MODIFY_EXPR
7528 && !TREE_NO_WARNING (rhs)
7529 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
7530 && (complain & tf_warning))
7532 location_t loc = EXPR_HAS_LOCATION (rhs)
7533 ? EXPR_LOCATION (rhs) : input_location;
7535 warning_at (loc, OPT_Wparentheses,
7536 "suggest parentheses around assignment used as truth value");
7537 TREE_NO_WARNING (rhs) = 1;
7540 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
7544 /* Convert RHS to be of type TYPE.
7545 If EXP is nonzero, it is the target of the initialization.
7546 ERRTYPE indicates what kind of error the implicit conversion is.
7548 Two major differences between the behavior of
7549 `convert_for_assignment' and `convert_for_initialization'
7550 are that references are bashed in the former, while
7551 copied in the latter, and aggregates are assigned in
7552 the former (operator=) while initialized in the
7555 If using constructor make sure no conversion operator exists, if one does
7556 exist, an ambiguity exists.
7558 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7561 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
7562 impl_conv_rhs errtype, tree fndecl, int parmnum,
7563 tsubst_flags_t complain)
7565 enum tree_code codel = TREE_CODE (type);
7567 enum tree_code coder;
7569 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7570 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7571 if (TREE_CODE (rhs) == NOP_EXPR
7572 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
7573 && codel != REFERENCE_TYPE)
7574 rhs = TREE_OPERAND (rhs, 0);
7576 if (type == error_mark_node
7577 || rhs == error_mark_node
7578 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
7579 return error_mark_node;
7581 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
7582 && TREE_CODE (type) != ARRAY_TYPE
7583 && (TREE_CODE (type) != REFERENCE_TYPE
7584 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
7585 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
7586 && (TREE_CODE (type) != REFERENCE_TYPE
7587 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
7588 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
7589 rhs = decay_conversion (rhs);
7591 rhstype = TREE_TYPE (rhs);
7592 coder = TREE_CODE (rhstype);
7594 if (coder == ERROR_MARK)
7595 return error_mark_node;
7597 /* We accept references to incomplete types, so we can
7598 return here before checking if RHS is of complete type. */
7600 if (codel == REFERENCE_TYPE)
7602 /* This should eventually happen in convert_arguments. */
7603 int savew = 0, savee = 0;
7606 savew = warningcount, savee = errorcount;
7607 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
7608 /*cleanup=*/NULL, complain);
7611 if (warningcount > savew)
7612 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
7613 else if (errorcount > savee)
7614 error ("in passing argument %P of %q+D", parmnum, fndecl);
7620 exp = require_complete_type_sfinae (exp, complain);
7621 if (exp == error_mark_node)
7622 return error_mark_node;
7624 rhstype = non_reference (rhstype);
7626 type = complete_type (type);
7628 if (DIRECT_INIT_EXPR_P (type, rhs))
7629 /* Don't try to do copy-initialization if we already have
7630 direct-initialization. */
7633 if (MAYBE_CLASS_TYPE_P (type))
7634 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
7636 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7640 /* If RETVAL is the address of, or a reference to, a local variable or
7641 temporary give an appropriate warning. */
7644 maybe_warn_about_returning_address_of_local (tree retval)
7646 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7647 tree whats_returned = retval;
7651 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7652 whats_returned = TREE_OPERAND (whats_returned, 1);
7653 else if (CONVERT_EXPR_P (whats_returned)
7654 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7655 whats_returned = TREE_OPERAND (whats_returned, 0);
7660 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7662 whats_returned = TREE_OPERAND (whats_returned, 0);
7664 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7666 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7667 || TREE_CODE (whats_returned) == TARGET_EXPR)
7669 warning (0, "returning reference to temporary");
7672 if (TREE_CODE (whats_returned) == VAR_DECL
7673 && DECL_NAME (whats_returned)
7674 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7676 warning (0, "reference to non-lvalue returned");
7681 while (TREE_CODE (whats_returned) == COMPONENT_REF
7682 || TREE_CODE (whats_returned) == ARRAY_REF)
7683 whats_returned = TREE_OPERAND (whats_returned, 0);
7685 if (DECL_P (whats_returned)
7686 && DECL_NAME (whats_returned)
7687 && DECL_FUNCTION_SCOPE_P (whats_returned)
7688 && !(TREE_STATIC (whats_returned)
7689 || TREE_PUBLIC (whats_returned)))
7691 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7692 warning (0, "reference to local variable %q+D returned",
7695 warning (0, "address of local variable %q+D returned",
7701 /* Check that returning RETVAL from the current function is valid.
7702 Return an expression explicitly showing all conversions required to
7703 change RETVAL into the function return type, and to assign it to
7704 the DECL_RESULT for the function. Set *NO_WARNING to true if
7705 code reaches end of non-void function warning shouldn't be issued
7706 on this RETURN_EXPR. */
7709 check_return_expr (tree retval, bool *no_warning)
7712 /* The type actually returned by the function, after any
7715 int fn_returns_value_p;
7716 bool named_return_value_okay_p;
7718 *no_warning = false;
7720 /* A `volatile' function is one that isn't supposed to return, ever.
7721 (This is a G++ extension, used to get better code for functions
7722 that call the `volatile' function.) */
7723 if (TREE_THIS_VOLATILE (current_function_decl))
7724 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7726 /* Check for various simple errors. */
7727 if (DECL_DESTRUCTOR_P (current_function_decl))
7730 error ("returning a value from a destructor");
7733 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7735 if (in_function_try_handler)
7736 /* If a return statement appears in a handler of the
7737 function-try-block of a constructor, the program is ill-formed. */
7738 error ("cannot return from a handler of a function-try-block of a constructor");
7740 /* You can't return a value from a constructor. */
7741 error ("returning a value from a constructor");
7745 /* As an extension, deduce lambda return type from a return statement
7746 anywhere in the body. */
7747 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7749 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7750 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7752 tree type = lambda_return_type (retval);
7753 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7755 if (VOID_TYPE_P (type))
7757 else if (oldtype == NULL_TREE)
7759 pedwarn (input_location, OPT_pedantic, "lambda return type "
7760 "can only be deduced when the return statement is "
7761 "the only statement in the function body");
7762 apply_lambda_return_type (lambda, type);
7764 else if (!same_type_p (type, oldtype))
7765 error ("inconsistent types %qT and %qT deduced for "
7766 "lambda return type", type, oldtype);
7770 if (processing_template_decl)
7772 current_function_returns_value = 1;
7773 if (check_for_bare_parameter_packs (retval))
7774 retval = error_mark_node;
7778 /* When no explicit return-value is given in a function with a named
7779 return value, the named return value is used. */
7780 result = DECL_RESULT (current_function_decl);
7781 valtype = TREE_TYPE (result);
7782 gcc_assert (valtype != NULL_TREE);
7783 fn_returns_value_p = !VOID_TYPE_P (valtype);
7784 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7787 /* Check for a return statement with no return value in a function
7788 that's supposed to return a value. */
7789 if (!retval && fn_returns_value_p)
7791 permerror (input_location, "return-statement with no value, in function returning %qT",
7793 /* Clear this, so finish_function won't say that we reach the
7794 end of a non-void function (which we don't, we gave a
7796 current_function_returns_null = 0;
7797 /* And signal caller that TREE_NO_WARNING should be set on the
7798 RETURN_EXPR to avoid control reaches end of non-void function
7799 warnings in tree-cfg.c. */
7802 /* Check for a return statement with a value in a function that
7803 isn't supposed to return a value. */
7804 else if (retval && !fn_returns_value_p)
7806 if (VOID_TYPE_P (TREE_TYPE (retval)))
7807 /* You can return a `void' value from a function of `void'
7808 type. In that case, we have to evaluate the expression for
7809 its side-effects. */
7810 finish_expr_stmt (retval);
7812 permerror (input_location, "return-statement with a value, in function "
7813 "returning 'void'");
7814 current_function_returns_null = 1;
7816 /* There's really no value to return, after all. */
7820 /* Remember that this function can sometimes return without a
7822 current_function_returns_null = 1;
7824 /* Remember that this function did return a value. */
7825 current_function_returns_value = 1;
7827 /* Check for erroneous operands -- but after giving ourselves a
7828 chance to provide an error about returning a value from a void
7830 if (error_operand_p (retval))
7832 current_function_return_value = error_mark_node;
7833 return error_mark_node;
7836 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7837 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7838 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7839 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7841 && retval && null_ptr_cst_p (retval))
7842 warning (0, "%<operator new%> must not return NULL unless it is "
7843 "declared %<throw()%> (or -fcheck-new is in effect)");
7845 /* Effective C++ rule 15. See also start_function. */
7847 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7851 /* The function return type must be a reference to the current
7853 if (TREE_CODE (valtype) == REFERENCE_TYPE
7854 && same_type_ignoring_top_level_qualifiers_p
7855 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7857 /* Returning '*this' is obviously OK. */
7858 if (retval == current_class_ref)
7860 /* If we are calling a function whose return type is the same of
7861 the current class reference, it is ok. */
7862 else if (TREE_CODE (retval) == INDIRECT_REF
7863 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7868 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7871 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7873 [...] For a function with a class return type, if the expression
7874 in the return statement is the name of a local object, and the cv-
7875 unqualified type of the local object is the same as the function
7876 return type, an implementation is permitted to omit creating the tem-
7877 porary object to hold the function return value [...]
7879 So, if this is a value-returning function that always returns the same
7880 local variable, remember it.
7882 It might be nice to be more flexible, and choose the first suitable
7883 variable even if the function sometimes returns something else, but
7884 then we run the risk of clobbering the variable we chose if the other
7885 returned expression uses the chosen variable somehow. And people expect
7886 this restriction, anyway. (jason 2000-11-19)
7888 See finish_function and finalize_nrv for the rest of this optimization. */
7890 named_return_value_okay_p =
7891 (retval != NULL_TREE
7892 /* Must be a local, automatic variable. */
7893 && TREE_CODE (retval) == VAR_DECL
7894 && DECL_CONTEXT (retval) == current_function_decl
7895 && ! TREE_STATIC (retval)
7896 && ! DECL_ANON_UNION_VAR_P (retval)
7897 && (DECL_ALIGN (retval)
7898 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7899 /* The cv-unqualified type of the returned value must be the
7900 same as the cv-unqualified return type of the
7902 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7904 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7905 /* And the returned value must be non-volatile. */
7906 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7908 if (fn_returns_value_p && flag_elide_constructors)
7910 if (named_return_value_okay_p
7911 && (current_function_return_value == NULL_TREE
7912 || current_function_return_value == retval))
7913 current_function_return_value = retval;
7915 current_function_return_value = error_mark_node;
7918 /* We don't need to do any conversions when there's nothing being
7923 /* Do any required conversions. */
7924 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7925 /* No conversions are required. */
7929 /* The type the function is declared to return. */
7930 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7931 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7933 /* The functype's return type will have been set to void, if it
7934 was an incomplete type. Just treat this as 'return;' */
7935 if (VOID_TYPE_P (functype))
7936 return error_mark_node;
7938 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7939 treated as an rvalue for the purposes of overload resolution to
7940 favor move constructors over copy constructors. */
7941 if ((cxx_dialect != cxx98)
7942 && named_return_value_okay_p
7943 /* The variable must not have the `volatile' qualifier. */
7944 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval))
7945 /* The return type must be a class type. */
7946 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7947 flags = flags | LOOKUP_PREFER_RVALUE;
7949 /* First convert the value to the function's return type, then
7950 to the type of return value's location to handle the
7951 case that functype is smaller than the valtype. */
7952 retval = convert_for_initialization
7953 (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
7954 tf_warning_or_error);
7955 retval = convert (valtype, retval);
7957 /* If the conversion failed, treat this just like `return;'. */
7958 if (retval == error_mark_node)
7960 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7961 else if (! cfun->returns_struct
7962 && TREE_CODE (retval) == TARGET_EXPR
7963 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7964 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7965 TREE_OPERAND (retval, 0));
7967 maybe_warn_about_returning_address_of_local (retval);
7970 /* Actually copy the value returned into the appropriate location. */
7971 if (retval && retval != result)
7972 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7978 /* Returns nonzero if the pointer-type FROM can be converted to the
7979 pointer-type TO via a qualification conversion. If CONSTP is -1,
7980 then we return nonzero if the pointers are similar, and the
7981 cv-qualification signature of FROM is a proper subset of that of TO.
7983 If CONSTP is positive, then all outer pointers have been
7987 comp_ptr_ttypes_real (tree to, tree from, int constp)
7989 bool to_more_cv_qualified = false;
7990 bool is_opaque_pointer = false;
7992 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7994 if (TREE_CODE (to) != TREE_CODE (from))
7997 if (TREE_CODE (from) == OFFSET_TYPE
7998 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7999 TYPE_OFFSET_BASETYPE (to)))
8002 /* Const and volatile mean something different for function types,
8003 so the usual checks are not appropriate. */
8004 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
8006 /* In Objective-C++, some types may have been 'volatilized' by
8007 the compiler for EH; when comparing them here, the volatile
8008 qualification must be ignored. */
8009 tree nv_to = objc_non_volatilized_type (to);
8010 tree nv_from = objc_non_volatilized_type (from);
8012 if (!at_least_as_qualified_p (nv_to, nv_from))
8015 if (!at_least_as_qualified_p (nv_from, nv_to))
8019 to_more_cv_qualified = true;
8023 constp &= TYPE_READONLY (nv_to);
8026 if (TREE_CODE (to) == VECTOR_TYPE)
8027 is_opaque_pointer = vector_targets_convertible_p (to, from);
8029 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
8030 return ((constp >= 0 || to_more_cv_qualified)
8031 && (is_opaque_pointer
8032 || same_type_ignoring_top_level_qualifiers_p (to, from)));
8036 /* When comparing, say, char ** to char const **, this function takes
8037 the 'char *' and 'char const *'. Do not pass non-pointer/reference
8038 types to this function. */
8041 comp_ptr_ttypes (tree to, tree from)
8043 return comp_ptr_ttypes_real (to, from, 1);
8046 /* Returns true iff FNTYPE is a non-class type that involves
8047 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
8048 if a parameter type is ill-formed. */
8051 error_type_p (const_tree type)
8055 switch (TREE_CODE (type))
8061 case REFERENCE_TYPE:
8063 return error_type_p (TREE_TYPE (type));
8067 if (error_type_p (TREE_TYPE (type)))
8069 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
8070 if (error_type_p (TREE_VALUE (t)))
8075 if (TYPE_PTRMEMFUNC_P (type))
8076 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
8084 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
8085 type or inheritance-related types, regardless of cv-quals. */
8088 ptr_reasonably_similar (const_tree to, const_tree from)
8090 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8092 /* Any target type is similar enough to void. */
8093 if (TREE_CODE (to) == VOID_TYPE)
8094 return !error_type_p (from);
8095 if (TREE_CODE (from) == VOID_TYPE)
8096 return !error_type_p (to);
8098 if (TREE_CODE (to) != TREE_CODE (from))
8101 if (TREE_CODE (from) == OFFSET_TYPE
8102 && comptypes (TYPE_OFFSET_BASETYPE (to),
8103 TYPE_OFFSET_BASETYPE (from),
8104 COMPARE_BASE | COMPARE_DERIVED))
8107 if (TREE_CODE (to) == VECTOR_TYPE
8108 && vector_types_convertible_p (to, from, false))
8111 if (TREE_CODE (to) == INTEGER_TYPE
8112 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
8115 if (TREE_CODE (to) == FUNCTION_TYPE)
8116 return !error_type_p (to) && !error_type_p (from);
8118 if (TREE_CODE (to) != POINTER_TYPE)
8120 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
8121 COMPARE_BASE | COMPARE_DERIVED);
8125 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8126 pointer-to-member types) are the same, ignoring cv-qualification at
8130 comp_ptr_ttypes_const (tree to, tree from)
8132 bool is_opaque_pointer = false;
8134 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8136 if (TREE_CODE (to) != TREE_CODE (from))
8139 if (TREE_CODE (from) == OFFSET_TYPE
8140 && same_type_p (TYPE_OFFSET_BASETYPE (from),
8141 TYPE_OFFSET_BASETYPE (to)))
8144 if (TREE_CODE (to) == VECTOR_TYPE)
8145 is_opaque_pointer = vector_targets_convertible_p (to, from);
8147 if (TREE_CODE (to) != POINTER_TYPE)
8148 return (is_opaque_pointer
8149 || same_type_ignoring_top_level_qualifiers_p (to, from));
8153 /* Returns the type qualifiers for this type, including the qualifiers on the
8154 elements for an array type. */
8157 cp_type_quals (const_tree type)
8160 /* This CONST_CAST is okay because strip_array_types returns its
8161 argument unmodified and we assign it to a const_tree. */
8162 type = strip_array_types (CONST_CAST_TREE (type));
8163 if (type == error_mark_node
8164 /* Quals on a FUNCTION_TYPE are memfn quals. */
8165 || TREE_CODE (type) == FUNCTION_TYPE)
8166 return TYPE_UNQUALIFIED;
8167 quals = TYPE_QUALS (type);
8168 /* METHOD and REFERENCE_TYPEs should never have quals. */
8169 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
8170 && TREE_CODE (type) != REFERENCE_TYPE)
8171 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
8172 == TYPE_UNQUALIFIED));
8176 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8180 type_memfn_quals (const_tree type)
8182 if (TREE_CODE (type) == FUNCTION_TYPE)
8183 return TYPE_QUALS (type);
8184 else if (TREE_CODE (type) == METHOD_TYPE)
8185 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))));
8190 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8194 apply_memfn_quals (tree type, cp_cv_quals memfn_quals)
8196 /* Could handle METHOD_TYPE here if necessary. */
8197 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8198 if (TYPE_QUALS (type) == memfn_quals)
8200 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8202 return build_qualified_type (type, memfn_quals);
8205 /* Returns nonzero if TYPE is const or volatile. */
8208 cv_qualified_p (const_tree type)
8210 int quals = cp_type_quals (type);
8211 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
8214 /* Returns nonzero if the TYPE contains a mutable member. */
8217 cp_has_mutable_p (const_tree type)
8219 /* This CONST_CAST is okay because strip_array_types returns its
8220 argument unmodified and we assign it to a const_tree. */
8221 type = strip_array_types (CONST_CAST_TREE(type));
8223 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
8226 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8227 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8228 approximation. In particular, consider:
8231 struct S { int i; };
8232 const S s = { f(); }
8234 Here, we will make "s" as TREE_READONLY (because it is declared
8235 "const") -- only to reverse ourselves upon seeing that the
8236 initializer is non-constant. */
8239 cp_apply_type_quals_to_decl (int type_quals, tree decl)
8241 tree type = TREE_TYPE (decl);
8243 if (type == error_mark_node)
8246 if (TREE_CODE (decl) == TYPE_DECL)
8249 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
8250 && type_quals != TYPE_UNQUALIFIED));
8252 /* Avoid setting TREE_READONLY incorrectly. */
8253 if (/* If the object has a constructor, the constructor may modify
8255 TYPE_NEEDS_CONSTRUCTING (type)
8256 /* If the type isn't complete, we don't know yet if it will need
8258 || !COMPLETE_TYPE_P (type)
8259 /* If the type has a mutable component, that component might be
8261 || TYPE_HAS_MUTABLE_P (type))
8262 type_quals &= ~TYPE_QUAL_CONST;
8264 c_apply_type_quals_to_decl (type_quals, decl);
8267 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8268 exemplar types such that casting T1 to T2 is casting away constness
8269 if and only if there is no implicit conversion from T1 to T2. */
8272 casts_away_constness_r (tree *t1, tree *t2)
8277 /* [expr.const.cast]
8279 For multi-level pointer to members and multi-level mixed pointers
8280 and pointers to members (conv.qual), the "member" aspect of a
8281 pointer to member level is ignored when determining if a const
8282 cv-qualifier has been cast away. */
8283 /* [expr.const.cast]
8285 For two pointer types:
8287 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8288 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8291 casting from X1 to X2 casts away constness if, for a non-pointer
8292 type T there does not exist an implicit conversion (clause
8295 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8299 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8300 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
8301 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
8303 *t1 = cp_build_qualified_type (void_type_node,
8304 cp_type_quals (*t1));
8305 *t2 = cp_build_qualified_type (void_type_node,
8306 cp_type_quals (*t2));
8310 quals1 = cp_type_quals (*t1);
8311 quals2 = cp_type_quals (*t2);
8313 if (TYPE_PTRMEM_P (*t1))
8314 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
8316 *t1 = TREE_TYPE (*t1);
8317 if (TYPE_PTRMEM_P (*t2))
8318 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
8320 *t2 = TREE_TYPE (*t2);
8322 casts_away_constness_r (t1, t2);
8323 *t1 = build_pointer_type (*t1);
8324 *t2 = build_pointer_type (*t2);
8325 *t1 = cp_build_qualified_type (*t1, quals1);
8326 *t2 = cp_build_qualified_type (*t2, quals2);
8329 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8332 ??? This function returns non-zero if casting away qualifiers not
8333 just const. We would like to return to the caller exactly which
8334 qualifiers are casted away to give more accurate diagnostics.
8338 casts_away_constness (tree t1, tree t2)
8340 if (TREE_CODE (t2) == REFERENCE_TYPE)
8342 /* [expr.const.cast]
8344 Casting from an lvalue of type T1 to an lvalue of type T2
8345 using a reference cast casts away constness if a cast from an
8346 rvalue of type "pointer to T1" to the type "pointer to T2"
8347 casts away constness. */
8348 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
8349 return casts_away_constness (build_pointer_type (t1),
8350 build_pointer_type (TREE_TYPE (t2)));
8353 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
8354 /* [expr.const.cast]
8356 Casting from an rvalue of type "pointer to data member of X
8357 of type T1" to the type "pointer to data member of Y of type
8358 T2" casts away constness if a cast from an rvalue of type
8359 "pointer to T1" to the type "pointer to T2" casts away
8361 return casts_away_constness
8362 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
8363 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
8365 /* Casting away constness is only something that makes sense for
8366 pointer or reference types. */
8367 if (TREE_CODE (t1) != POINTER_TYPE
8368 || TREE_CODE (t2) != POINTER_TYPE)
8371 /* Top-level qualifiers don't matter. */
8372 t1 = TYPE_MAIN_VARIANT (t1);
8373 t2 = TYPE_MAIN_VARIANT (t2);
8374 casts_away_constness_r (&t1, &t2);
8375 if (!can_convert (t2, t1))
8381 /* If T is a REFERENCE_TYPE return the type to which T refers.
8382 Otherwise, return T itself. */
8385 non_reference (tree t)
8387 if (TREE_CODE (t) == REFERENCE_TYPE)
8393 /* Return nonzero if REF is an lvalue valid for this language;
8394 otherwise, print an error message and return zero. USE says
8395 how the lvalue is being used and so selects the error message. */
8398 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
8400 cp_lvalue_kind kind = lvalue_kind (ref);
8402 if (kind == clk_none)
8404 if (complain & tf_error)
8408 else if (kind & (clk_rvalueref|clk_class))
8410 if (!(complain & tf_error))
8412 if (kind & clk_class)
8413 /* Make this a permerror because we used to accept it. */
8414 permerror (input_location, "using temporary as lvalue");
8416 error ("using xvalue (rvalue reference) as lvalue");