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 the error_mark_node if the VALUE does not have
68 complete type when this function returns. */
71 require_complete_type (tree value)
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_else (type, value))
93 return error_mark_node;
96 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
97 a template instantiation, do the instantiation. Returns TYPE,
98 whether or not it could be completed, unless something goes
99 horribly wrong, in which case the error_mark_node is returned. */
102 complete_type (tree type)
104 if (type == NULL_TREE)
105 /* Rather than crash, we return something sure to cause an error
107 return error_mark_node;
109 if (type == error_mark_node || COMPLETE_TYPE_P (type))
111 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
113 tree t = complete_type (TREE_TYPE (type));
114 unsigned int needs_constructing, has_nontrivial_dtor;
115 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
118 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
120 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
121 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
123 TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
124 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
127 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
128 instantiate_class_template (TYPE_MAIN_VARIANT (type));
133 /* Like complete_type, but issue an error if the TYPE cannot be completed.
134 VALUE is used for informative diagnostics.
135 Returns NULL_TREE if the type cannot be made complete. */
138 complete_type_or_else (tree type, tree value)
140 type = complete_type (type);
141 if (type == error_mark_node)
142 /* We already issued an error. */
144 else if (!COMPLETE_TYPE_P (type))
146 cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
153 /* Return truthvalue of whether type of EXP is instantiated. */
156 type_unknown_p (const_tree exp)
158 return (TREE_CODE (exp) == TREE_LIST
159 || TREE_TYPE (exp) == unknown_type_node);
163 /* Return the common type of two parameter lists.
164 We assume that comptypes has already been done and returned 1;
165 if that isn't so, this may crash.
167 As an optimization, free the space we allocate if the parameter
168 lists are already common. */
171 commonparms (tree p1, tree p2)
173 tree oldargs = p1, newargs, n;
177 len = list_length (p1);
178 newargs = tree_last (p1);
180 if (newargs == void_list_node)
189 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
194 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
196 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
198 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
201 else if (! TREE_PURPOSE (p1))
203 if (TREE_PURPOSE (p2))
205 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
211 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
213 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
215 if (TREE_VALUE (p1) != TREE_VALUE (p2))
218 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
221 TREE_VALUE (n) = TREE_VALUE (p1);
229 /* Given a type, perhaps copied for a typedef,
230 find the "original" version of it. */
232 original_type (tree t)
234 int quals = cp_type_quals (t);
235 while (t != error_mark_node
236 && TYPE_NAME (t) != NULL_TREE)
238 tree x = TYPE_NAME (t);
239 if (TREE_CODE (x) != TYPE_DECL)
241 x = DECL_ORIGINAL_TYPE (x);
246 return cp_build_qualified_type (t, quals);
249 /* Return the common type for two arithmetic types T1 and T2 under the
250 usual arithmetic conversions. The default conversions have already
251 been applied, and enumerated types converted to their compatible
255 cp_common_type (tree t1, tree t2)
257 enum tree_code code1 = TREE_CODE (t1);
258 enum tree_code code2 = TREE_CODE (t2);
261 /* In what follows, we slightly generalize the rules given in [expr] so
262 as to deal with `long long' and `complex'. First, merge the
264 attributes = (*targetm.merge_type_attributes) (t1, t2);
266 if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
268 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
269 return build_type_attribute_variant (t1, attributes);
274 /* FIXME: Attributes. */
275 gcc_assert (ARITHMETIC_TYPE_P (t1)
276 || TREE_CODE (t1) == VECTOR_TYPE
277 || UNSCOPED_ENUM_P (t1));
278 gcc_assert (ARITHMETIC_TYPE_P (t2)
279 || TREE_CODE (t2) == VECTOR_TYPE
280 || UNSCOPED_ENUM_P (t2));
282 /* If one type is complex, form the common type of the non-complex
283 components, then make that complex. Use T1 or T2 if it is the
285 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
287 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
288 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
290 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
292 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
293 return build_type_attribute_variant (t1, attributes);
294 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
295 return build_type_attribute_variant (t2, attributes);
297 return build_type_attribute_variant (build_complex_type (subtype),
301 if (code1 == VECTOR_TYPE)
303 /* When we get here we should have two vectors of the same size.
304 Just prefer the unsigned one if present. */
305 if (TYPE_UNSIGNED (t1))
306 return build_type_attribute_variant (t1, attributes);
308 return build_type_attribute_variant (t2, attributes);
311 /* If only one is real, use it as the result. */
312 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
313 return build_type_attribute_variant (t1, attributes);
314 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
315 return build_type_attribute_variant (t2, attributes);
317 /* Both real or both integers; use the one with greater precision. */
318 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
319 return build_type_attribute_variant (t1, attributes);
320 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
321 return build_type_attribute_variant (t2, attributes);
323 /* The types are the same; no need to do anything fancy. */
324 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
325 return build_type_attribute_variant (t1, attributes);
327 if (code1 != REAL_TYPE)
329 /* If one is unsigned long long, then convert the other to unsigned
331 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
332 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
333 return build_type_attribute_variant (long_long_unsigned_type_node,
335 /* If one is a long long, and the other is an unsigned long, and
336 long long can represent all the values of an unsigned long, then
337 convert to a long long. Otherwise, convert to an unsigned long
338 long. Otherwise, if either operand is long long, convert the
341 Since we're here, we know the TYPE_PRECISION is the same;
342 therefore converting to long long cannot represent all the values
343 of an unsigned long, so we choose unsigned long long in that
345 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
346 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
348 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
349 ? long_long_unsigned_type_node
350 : long_long_integer_type_node);
351 return build_type_attribute_variant (t, attributes);
353 if (int128_integer_type_node != NULL_TREE
354 && (same_type_p (TYPE_MAIN_VARIANT (t1),
355 int128_integer_type_node)
356 || same_type_p (TYPE_MAIN_VARIANT (t2),
357 int128_integer_type_node)))
359 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
360 ? int128_unsigned_type_node
361 : int128_integer_type_node);
362 return build_type_attribute_variant (t, attributes);
365 /* Go through the same procedure, but for longs. */
366 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
367 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
368 return build_type_attribute_variant (long_unsigned_type_node,
370 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
371 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
373 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
374 ? long_unsigned_type_node : long_integer_type_node);
375 return build_type_attribute_variant (t, attributes);
377 /* Otherwise prefer the unsigned one. */
378 if (TYPE_UNSIGNED (t1))
379 return build_type_attribute_variant (t1, attributes);
381 return build_type_attribute_variant (t2, attributes);
385 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
386 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
387 return build_type_attribute_variant (long_double_type_node,
389 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
390 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
391 return build_type_attribute_variant (double_type_node,
393 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
394 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
395 return build_type_attribute_variant (float_type_node,
398 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
399 the standard C++ floating-point types. Logic earlier in this
400 function has already eliminated the possibility that
401 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
402 compelling reason to choose one or the other. */
403 return build_type_attribute_variant (t1, attributes);
407 /* T1 and T2 are arithmetic or enumeration types. Return the type
408 that will result from the "usual arithmetic conversions" on T1 and
409 T2 as described in [expr]. */
412 type_after_usual_arithmetic_conversions (tree t1, tree t2)
414 gcc_assert (ARITHMETIC_TYPE_P (t1)
415 || TREE_CODE (t1) == VECTOR_TYPE
416 || UNSCOPED_ENUM_P (t1));
417 gcc_assert (ARITHMETIC_TYPE_P (t2)
418 || TREE_CODE (t2) == VECTOR_TYPE
419 || UNSCOPED_ENUM_P (t2));
421 /* Perform the integral promotions. We do not promote real types here. */
422 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
423 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
425 t1 = type_promotes_to (t1);
426 t2 = type_promotes_to (t2);
429 return cp_common_type (t1, t2);
432 /* Subroutine of composite_pointer_type to implement the recursive
433 case. See that function for documentation of the parameters. */
436 composite_pointer_type_r (tree t1, tree t2,
437 composite_pointer_operation operation,
438 tsubst_flags_t complain)
445 /* Determine the types pointed to by T1 and T2. */
446 if (TREE_CODE (t1) == POINTER_TYPE)
448 pointee1 = TREE_TYPE (t1);
449 pointee2 = TREE_TYPE (t2);
453 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
454 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
459 Otherwise, the composite pointer type is a pointer type
460 similar (_conv.qual_) to the type of one of the operands,
461 with a cv-qualification signature (_conv.qual_) that is the
462 union of the cv-qualification signatures of the operand
464 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
465 result_type = pointee1;
466 else if ((TREE_CODE (pointee1) == POINTER_TYPE
467 && TREE_CODE (pointee2) == POINTER_TYPE)
468 || (TYPE_PTR_TO_MEMBER_P (pointee1)
469 && TYPE_PTR_TO_MEMBER_P (pointee2)))
470 result_type = composite_pointer_type_r (pointee1, pointee2, operation,
474 if (complain & tf_error)
479 permerror (input_location, "comparison between "
480 "distinct pointer types %qT and %qT lacks a cast",
484 permerror (input_location, "conversion between "
485 "distinct pointer types %qT and %qT lacks a cast",
488 case CPO_CONDITIONAL_EXPR:
489 permerror (input_location, "conditional expression between "
490 "distinct pointer types %qT and %qT lacks a cast",
497 result_type = void_type_node;
499 result_type = cp_build_qualified_type (result_type,
500 (cp_type_quals (pointee1)
501 | cp_type_quals (pointee2)));
502 /* If the original types were pointers to members, so is the
504 if (TYPE_PTR_TO_MEMBER_P (t1))
506 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
507 TYPE_PTRMEM_CLASS_TYPE (t2))
508 && (complain & tf_error))
513 permerror (input_location, "comparison between "
514 "distinct pointer types %qT and %qT lacks a cast",
518 permerror (input_location, "conversion between "
519 "distinct pointer types %qT and %qT lacks a cast",
522 case CPO_CONDITIONAL_EXPR:
523 permerror (input_location, "conditional expression between "
524 "distinct pointer types %qT and %qT lacks a cast",
531 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
535 result_type = build_pointer_type (result_type);
537 /* Merge the attributes. */
538 attributes = (*targetm.merge_type_attributes) (t1, t2);
539 return build_type_attribute_variant (result_type, attributes);
542 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
543 ARG1 and ARG2 are the values with those types. The OPERATION is to
544 describe the operation between the pointer types,
545 in case an error occurs.
547 This routine also implements the computation of a common type for
548 pointers-to-members as per [expr.eq]. */
551 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
552 composite_pointer_operation operation,
553 tsubst_flags_t complain)
560 If one operand is a null pointer constant, the composite pointer
561 type is the type of the other operand. */
562 if (null_ptr_cst_p (arg1))
564 if (null_ptr_cst_p (arg2))
571 If one of the operands has type "pointer to cv1 void*", then
572 the other has type "pointer to cv2T", and the composite pointer
573 type is "pointer to cv12 void", where cv12 is the union of cv1
576 If either type is a pointer to void, make sure it is T1. */
577 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
585 /* Now, if T1 is a pointer to void, merge the qualifiers. */
586 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
591 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
596 pedwarn (input_location, OPT_pedantic,
597 "ISO C++ forbids comparison between "
598 "pointer of type %<void *%> and pointer-to-function");
601 pedwarn (input_location, OPT_pedantic,
602 "ISO C++ forbids conversion between "
603 "pointer of type %<void *%> and pointer-to-function");
605 case CPO_CONDITIONAL_EXPR:
606 pedwarn (input_location, OPT_pedantic,
607 "ISO C++ forbids conditional expression between "
608 "pointer of type %<void *%> and pointer-to-function");
615 = cp_build_qualified_type (void_type_node,
616 (cp_type_quals (TREE_TYPE (t1))
617 | cp_type_quals (TREE_TYPE (t2))));
618 result_type = build_pointer_type (result_type);
619 /* Merge the attributes. */
620 attributes = (*targetm.merge_type_attributes) (t1, t2);
621 return build_type_attribute_variant (result_type, attributes);
624 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
625 && TREE_CODE (t2) == POINTER_TYPE)
627 if (objc_compare_types (t1, t2, -3, NULL_TREE))
631 /* [expr.eq] permits the application of a pointer conversion to
632 bring the pointers to a common type. */
633 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
634 && CLASS_TYPE_P (TREE_TYPE (t1))
635 && CLASS_TYPE_P (TREE_TYPE (t2))
636 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
639 class1 = TREE_TYPE (t1);
640 class2 = TREE_TYPE (t2);
642 if (DERIVED_FROM_P (class1, class2))
643 t2 = (build_pointer_type
644 (cp_build_qualified_type (class1, cp_type_quals (class2))));
645 else if (DERIVED_FROM_P (class2, class1))
646 t1 = (build_pointer_type
647 (cp_build_qualified_type (class2, cp_type_quals (class1))));
650 if (complain & tf_error)
654 error ("comparison between distinct "
655 "pointer types %qT and %qT lacks a cast", t1, t2);
658 error ("conversion between distinct "
659 "pointer types %qT and %qT lacks a cast", t1, t2);
661 case CPO_CONDITIONAL_EXPR:
662 error ("conditional expression between distinct "
663 "pointer types %qT and %qT lacks a cast", t1, t2);
668 return error_mark_node;
671 /* [expr.eq] permits the application of a pointer-to-member
672 conversion to change the class type of one of the types. */
673 else if (TYPE_PTR_TO_MEMBER_P (t1)
674 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
675 TYPE_PTRMEM_CLASS_TYPE (t2)))
677 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
678 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
680 if (DERIVED_FROM_P (class1, class2))
681 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
682 else if (DERIVED_FROM_P (class2, class1))
683 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
686 if (complain & tf_error)
690 error ("comparison between distinct "
691 "pointer-to-member types %qT and %qT lacks a cast",
695 error ("conversion between distinct "
696 "pointer-to-member types %qT and %qT lacks a cast",
699 case CPO_CONDITIONAL_EXPR:
700 error ("conditional expression between distinct "
701 "pointer-to-member types %qT and %qT lacks a cast",
707 return error_mark_node;
711 return composite_pointer_type_r (t1, t2, operation, complain);
714 /* Return the merged type of two types.
715 We assume that comptypes has already been done and returned 1;
716 if that isn't so, this may crash.
718 This just combines attributes and default arguments; any other
719 differences would cause the two types to compare unalike. */
722 merge_types (tree t1, tree t2)
724 enum tree_code code1;
725 enum tree_code code2;
728 /* Save time if the two types are the same. */
731 if (original_type (t1) == original_type (t2))
734 /* If one type is nonsense, use the other. */
735 if (t1 == error_mark_node)
737 if (t2 == error_mark_node)
740 /* Merge the attributes. */
741 attributes = (*targetm.merge_type_attributes) (t1, t2);
743 if (TYPE_PTRMEMFUNC_P (t1))
744 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
745 if (TYPE_PTRMEMFUNC_P (t2))
746 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
748 code1 = TREE_CODE (t1);
749 code2 = TREE_CODE (t2);
752 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
753 if (code1 == TYPENAME_TYPE)
755 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
756 code1 = TREE_CODE (t1);
760 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
761 code2 = TREE_CODE (t2);
769 /* For two pointers, do this recursively on the target type. */
771 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
772 int quals = cp_type_quals (t1);
774 if (code1 == POINTER_TYPE)
775 t1 = build_pointer_type (target);
777 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
778 t1 = build_type_attribute_variant (t1, attributes);
779 t1 = cp_build_qualified_type (t1, quals);
781 if (TREE_CODE (target) == METHOD_TYPE)
782 t1 = build_ptrmemfunc_type (t1);
791 quals = cp_type_quals (t1);
792 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
793 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
794 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
796 t1 = cp_build_qualified_type (t1, quals);
802 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
803 /* Save space: see if the result is identical to one of the args. */
804 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
805 return build_type_attribute_variant (t1, attributes);
806 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
807 return build_type_attribute_variant (t2, attributes);
808 /* Merge the element types, and have a size if either arg has one. */
809 t1 = build_cplus_array_type
810 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
815 /* Function types: prefer the one that specified arg types.
816 If both do, merge the arg types. Also merge the return types. */
818 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
819 tree p1 = TYPE_ARG_TYPES (t1);
820 tree p2 = TYPE_ARG_TYPES (t2);
824 /* Save space: see if the result is identical to one of the args. */
825 if (valtype == TREE_TYPE (t1) && ! p2)
826 return cp_build_type_attribute_variant (t1, attributes);
827 if (valtype == TREE_TYPE (t2) && ! p1)
828 return cp_build_type_attribute_variant (t2, attributes);
830 /* Simple way if one arg fails to specify argument types. */
831 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
833 else if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
836 parms = commonparms (p1, p2);
838 rval = build_function_type (valtype, parms);
839 gcc_assert (type_memfn_quals (t1) == type_memfn_quals (t2));
840 rval = apply_memfn_quals (rval, type_memfn_quals (t1));
841 raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
842 TYPE_RAISES_EXCEPTIONS (t2));
843 t1 = build_exception_variant (rval, raises);
849 /* Get this value the long way, since TYPE_METHOD_BASETYPE
850 is just the main variant of this. */
851 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
852 tree raises = merge_exception_specifiers (TYPE_RAISES_EXCEPTIONS (t1),
853 TYPE_RAISES_EXCEPTIONS (t2));
856 /* If this was a member function type, get back to the
857 original type of type member function (i.e., without
858 the class instance variable up front. */
859 t1 = build_function_type (TREE_TYPE (t1),
860 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
861 t2 = build_function_type (TREE_TYPE (t2),
862 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
863 t3 = merge_types (t1, t2);
864 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
865 TYPE_ARG_TYPES (t3));
866 t1 = build_exception_variant (t3, raises);
871 /* There is no need to merge attributes into a TYPENAME_TYPE.
872 When the type is instantiated it will have whatever
873 attributes result from the instantiation. */
879 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
881 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
884 return cp_build_type_attribute_variant (t1, attributes);
887 /* Return the ARRAY_TYPE type without its domain. */
890 strip_array_domain (tree type)
893 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
894 if (TYPE_DOMAIN (type) == NULL_TREE)
896 t2 = build_cplus_array_type (TREE_TYPE (type), NULL_TREE);
897 return cp_build_type_attribute_variant (t2, TYPE_ATTRIBUTES (type));
900 /* Wrapper around cp_common_type that is used by c-common.c and other
901 front end optimizations that remove promotions.
903 Return the common type for two arithmetic types T1 and T2 under the
904 usual arithmetic conversions. The default conversions have already
905 been applied, and enumerated types converted to their compatible
909 common_type (tree t1, tree t2)
911 /* If one type is nonsense, use the other */
912 if (t1 == error_mark_node)
914 if (t2 == error_mark_node)
917 return cp_common_type (t1, t2);
920 /* Return the common type of two pointer types T1 and T2. This is the
921 type for the result of most arithmetic operations if the operands
922 have the given two types.
924 We assume that comp_target_types has already been done and returned
925 nonzero; if that isn't so, this may crash. */
928 common_pointer_type (tree t1, tree t2)
930 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
931 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
932 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
934 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
935 CPO_CONVERSION, tf_warning_or_error);
938 /* Compare two exception specifier types for exactness or subsetness, if
939 allowed. Returns false for mismatch, true for match (same, or
942 [except.spec] "If a class X ... objects of class X or any class publicly
943 and unambiguously derived from X. Similarly, if a pointer type Y * ...
944 exceptions of type Y * or that are pointers to any type publicly and
945 unambiguously derived from Y. Otherwise a function only allows exceptions
946 that have the same type ..."
947 This does not mention cv qualifiers and is different to what throw
948 [except.throw] and catch [except.catch] will do. They will ignore the
949 top level cv qualifiers, and allow qualifiers in the pointer to class
952 We implement the letter of the standard. */
955 comp_except_types (tree a, tree b, bool exact)
957 if (same_type_p (a, b))
961 if (cp_type_quals (a) || cp_type_quals (b))
964 if (TREE_CODE (a) == POINTER_TYPE
965 && TREE_CODE (b) == POINTER_TYPE)
969 if (cp_type_quals (a) || cp_type_quals (b))
973 if (TREE_CODE (a) != RECORD_TYPE
974 || TREE_CODE (b) != RECORD_TYPE)
977 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
983 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
984 If EXACT is ce_derived, T2 can be stricter than T1 (according to 15.4/5).
985 If EXACT is ce_normal, the compatibility rules in 15.4/3 apply.
986 If EXACT is ce_exact, the specs must be exactly the same. Exception lists
987 are unordered, but we've already filtered out duplicates. Most lists will
988 be in order, we should try to make use of that. */
991 comp_except_specs (const_tree t1, const_tree t2, int exact)
1000 /* First handle noexcept. */
1001 if (exact < ce_exact)
1003 /* noexcept(false) is compatible with any throwing dynamic-exc-spec
1004 and stricter than any spec. */
1005 if (t1 == noexcept_false_spec)
1006 return !nothrow_spec_p (t2) || exact == ce_derived;
1007 /* Even a derived noexcept(false) is compatible with a throwing
1009 if (t2 == noexcept_false_spec)
1010 return !nothrow_spec_p (t1);
1012 /* Otherwise, if we aren't looking for an exact match, noexcept is
1013 equivalent to throw(). */
1014 if (t1 == noexcept_true_spec)
1015 t1 = empty_except_spec;
1016 if (t2 == noexcept_true_spec)
1017 t2 = empty_except_spec;
1020 /* If any noexcept is left, it is only comparable to itself;
1021 either we're looking for an exact match or we're redeclaring a
1022 template with dependent noexcept. */
1023 if ((t1 && TREE_PURPOSE (t1))
1024 || (t2 && TREE_PURPOSE (t2)))
1026 && cp_tree_equal (TREE_PURPOSE (t1), TREE_PURPOSE (t2)));
1028 if (t1 == NULL_TREE) /* T1 is ... */
1029 return t2 == NULL_TREE || exact == ce_derived;
1030 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
1031 return t2 != NULL_TREE && !TREE_VALUE (t2);
1032 if (t2 == NULL_TREE) /* T2 is ... */
1034 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
1035 return exact == ce_derived;
1037 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
1038 Count how many we find, to determine exactness. For exact matching and
1039 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
1041 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
1043 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
1045 tree a = TREE_VALUE (probe);
1046 tree b = TREE_VALUE (t2);
1048 if (comp_except_types (a, b, exact))
1050 if (probe == base && exact > ce_derived)
1051 base = TREE_CHAIN (probe);
1056 if (probe == NULL_TREE)
1059 return exact == ce_derived || base == NULL_TREE || length == list_length (t1);
1062 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1063 [] can match [size]. */
1066 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1075 /* The type of the array elements must be the same. */
1076 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1079 d1 = TYPE_DOMAIN (t1);
1080 d2 = TYPE_DOMAIN (t2);
1085 /* If one of the arrays is dimensionless, and the other has a
1086 dimension, they are of different types. However, it is valid to
1094 declarations for an array object can specify
1095 array types that differ by the presence or absence of a major
1096 array bound (_dcl.array_). */
1098 return allow_redeclaration;
1100 /* Check that the dimensions are the same. */
1102 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1104 max1 = TYPE_MAX_VALUE (d1);
1105 max2 = TYPE_MAX_VALUE (d2);
1106 if (processing_template_decl && !abi_version_at_least (2)
1107 && !value_dependent_expression_p (max1)
1108 && !value_dependent_expression_p (max2))
1110 /* With abi-1 we do not fold non-dependent array bounds, (and
1111 consequently mangle them incorrectly). We must therefore
1112 fold them here, to verify the domains have the same
1118 if (!cp_tree_equal (max1, max2))
1124 /* Compare the relative position of T1 and T2 into their respective
1125 template parameter list.
1126 T1 and T2 must be template parameter types.
1127 Return TRUE if T1 and T2 have the same position, FALSE otherwise. */
1130 comp_template_parms_position (tree t1, tree t2)
1132 gcc_assert (t1 && t2
1133 && TREE_CODE (t1) == TREE_CODE (t2)
1134 && (TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM
1135 || TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM
1136 || TREE_CODE (t1) == TEMPLATE_TYPE_PARM));
1138 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1139 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1140 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1141 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1147 /* Subroutine of incompatible_dependent_types_p.
1148 Return the template parameter of the dependent type T.
1149 If T is a typedef, return the template parameters of
1150 the _decl_ of the typedef. T must be a dependent type. */
1153 get_template_parms_of_dependent_type (tree t)
1155 tree tinfo = NULL_TREE, tparms = NULL_TREE;
1157 /* First, try the obvious case of getting the
1158 template info from T itself. */
1159 if ((tinfo = get_template_info (t)))
1161 else if (TREE_CODE (t) == TEMPLATE_TYPE_PARM)
1162 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (t);
1163 else if (typedef_variant_p (t)
1164 && !NAMESPACE_SCOPE_P (TYPE_NAME (t)))
1165 tinfo = get_template_info (DECL_CONTEXT (TYPE_NAME (t)));
1166 /* If T is a TYPENAME_TYPE which context is a template type
1167 parameter, get the template parameters from that context. */
1168 else if (TYPE_CONTEXT (t)
1169 && TREE_CODE (TYPE_CONTEXT (t)) == TEMPLATE_TYPE_PARM)
1170 return TEMPLATE_TYPE_PARM_SIBLING_PARMS (TYPE_CONTEXT (t));
1171 else if (TYPE_CONTEXT (t)
1172 && !NAMESPACE_SCOPE_P (t))
1173 tinfo = get_template_info (TYPE_CONTEXT (t));
1176 tparms = DECL_TEMPLATE_PARMS (TI_TEMPLATE (tinfo));
1181 /* Subroutine of structural_comptypes.
1182 Compare the dependent types T1 and T2.
1183 Return TRUE if we are sure they can't be equal, FALSE otherwise.
1184 The whole point of this function is to support cases where either T1 or
1185 T2 is a typedef. In those cases, we need to compare the template parameters
1186 of the _decl_ of the typedef. If those don't match then we know T1
1187 and T2 cannot be equal. */
1190 incompatible_dependent_types_p (tree t1, tree t2)
1192 tree tparms1 = NULL_TREE, tparms2 = NULL_TREE;
1193 bool t1_typedef_variant_p, t2_typedef_variant_p;
1195 if (!uses_template_parms (t1) || !uses_template_parms (t2))
1198 if (TREE_CODE (t1) == TEMPLATE_TYPE_PARM)
1200 /* If T1 and T2 don't have the same relative position in their
1201 template parameters set, they can't be equal. */
1202 if (!comp_template_parms_position (t1, t2))
1206 t1_typedef_variant_p = typedef_variant_p (t1);
1207 t2_typedef_variant_p = typedef_variant_p (t2);
1209 /* Either T1 or T2 must be a typedef. */
1210 if (!t1_typedef_variant_p && !t2_typedef_variant_p)
1213 if (!t1_typedef_variant_p || !t2_typedef_variant_p)
1214 /* Either T1 or T2 is not a typedef so we cannot compare the
1215 the template parms of the typedefs of T1 and T2.
1216 At this point, if the main variant type of T1 and T2 are equal
1217 it means the two types can't be incompatible, from the perspective
1218 of this function. */
1219 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1222 /* So if we reach this point, it means either T1 or T2 is a typedef variant.
1223 Let's compare their template parameters. */
1225 tparms1 = get_template_parms_of_dependent_type (t1);
1226 tparms2 = get_template_parms_of_dependent_type (t2);
1228 /* If T2 is a template type parm and if we could not get the template
1229 parms it belongs to, that means we have not finished parsing the
1230 full set of template parameters of the template declaration it
1231 belongs to yet. If we could get the template parms T1 belongs to,
1232 that mostly means T1 and T2 belongs to templates that are
1233 different and incompatible. */
1234 if (TREE_CODE (t1) == TEMPLATE_TYPE_PARM
1235 && (tparms1 == NULL_TREE || tparms2 == NULL_TREE)
1236 && tparms1 != tparms2)
1239 if (tparms1 == NULL_TREE
1240 || tparms2 == NULL_TREE
1241 || tparms1 == tparms2)
1244 /* And now compare the mighty template parms! */
1245 return !comp_template_parms (tparms1, tparms2);
1248 /* Subroutine in comptypes. */
1251 structural_comptypes (tree t1, tree t2, int strict)
1256 /* Suppress errors caused by previously reported errors. */
1257 if (t1 == error_mark_node || t2 == error_mark_node)
1260 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1262 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1263 current instantiation. */
1264 if (TREE_CODE (t1) == TYPENAME_TYPE)
1265 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1267 if (TREE_CODE (t2) == TYPENAME_TYPE)
1268 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1270 if (TYPE_PTRMEMFUNC_P (t1))
1271 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1272 if (TYPE_PTRMEMFUNC_P (t2))
1273 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1275 /* Different classes of types can't be compatible. */
1276 if (TREE_CODE (t1) != TREE_CODE (t2))
1279 /* Qualifiers must match. For array types, we will check when we
1280 recur on the array element types. */
1281 if (TREE_CODE (t1) != ARRAY_TYPE
1282 && cp_type_quals (t1) != cp_type_quals (t2))
1284 if (TREE_CODE (t1) == FUNCTION_TYPE
1285 && type_memfn_quals (t1) != type_memfn_quals (t2))
1287 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1290 /* If T1 and T2 are dependent typedefs then check upfront that
1291 the template parameters of their typedef DECLs match before
1292 going down checking their subtypes. */
1293 if (incompatible_dependent_types_p (t1, t2))
1296 /* Allow for two different type nodes which have essentially the same
1297 definition. Note that we already checked for equality of the type
1298 qualifiers (just above). */
1300 if (TREE_CODE (t1) != ARRAY_TYPE
1301 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1305 /* Compare the types. Break out if they could be the same. */
1306 switch (TREE_CODE (t1))
1310 /* All void and bool types are the same. */
1314 case FIXED_POINT_TYPE:
1316 /* With these nodes, we can't determine type equivalence by
1317 looking at what is stored in the nodes themselves, because
1318 two nodes might have different TYPE_MAIN_VARIANTs but still
1319 represent the same type. For example, wchar_t and int could
1320 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1321 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1322 and are distinct types. On the other hand, int and the
1325 typedef int INT __attribute((may_alias));
1327 have identical properties, different TYPE_MAIN_VARIANTs, but
1328 represent the same type. The canonical type system keeps
1329 track of equivalence in this case, so we fall back on it. */
1330 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1332 case TEMPLATE_TEMPLATE_PARM:
1333 case BOUND_TEMPLATE_TEMPLATE_PARM:
1334 if (!comp_template_parms_position (t1, t2))
1336 if (!comp_template_parms
1337 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1338 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1340 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1342 /* Don't check inheritance. */
1343 strict = COMPARE_STRICT;
1348 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1349 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1350 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1351 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1354 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1356 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1362 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1363 strict & ~COMPARE_REDECLARATION))
1365 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1369 case REFERENCE_TYPE:
1370 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1372 /* fall through to checks for pointer types */
1375 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1376 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1377 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1383 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1385 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1390 /* Target types must match incl. qualifiers. */
1391 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1395 case TEMPLATE_TYPE_PARM:
1396 /* If incompatible_dependent_types_p called earlier didn't decide
1397 T1 and T2 were different, they might be equal. */
1401 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1402 TYPENAME_TYPE_FULLNAME (t2)))
1404 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1408 case UNBOUND_CLASS_TEMPLATE:
1409 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1411 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1416 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1421 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1422 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1426 case TYPE_PACK_EXPANSION:
1427 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1428 PACK_EXPANSION_PATTERN (t2));
1431 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1432 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1433 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1434 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1435 || (DECLTYPE_FOR_LAMBDA_RETURN (t1)
1436 != DECLTYPE_FOR_LAMBDA_RETURN (t2))
1437 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1438 DECLTYPE_TYPE_EXPR (t2)))
1446 /* If we get here, we know that from a target independent POV the
1447 types are the same. Make sure the target attributes are also
1449 return targetm.comp_type_attributes (t1, t2);
1452 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1453 is a bitwise-or of the COMPARE_* flags. */
1456 comptypes (tree t1, tree t2, int strict)
1458 if (strict == COMPARE_STRICT)
1463 if (t1 == error_mark_node || t2 == error_mark_node)
1466 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1467 /* At least one of the types requires structural equality, so
1468 perform a deep check. */
1469 return structural_comptypes (t1, t2, strict);
1471 #ifdef ENABLE_CHECKING
1472 if (USE_CANONICAL_TYPES)
1474 bool result = structural_comptypes (t1, t2, strict);
1476 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1477 /* The two types are structurally equivalent, but their
1478 canonical types were different. This is a failure of the
1479 canonical type propagation code.*/
1481 ("canonical types differ for identical types %T and %T",
1483 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1484 /* Two types are structurally different, but the canonical
1485 types are the same. This means we were over-eager in
1486 assigning canonical types. */
1488 ("same canonical type node for different types %T and %T",
1494 if (USE_CANONICAL_TYPES)
1495 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1498 return structural_comptypes (t1, t2, strict);
1500 else if (strict == COMPARE_STRUCTURAL)
1501 return structural_comptypes (t1, t2, COMPARE_STRICT);
1503 return structural_comptypes (t1, t2, strict);
1506 /* Returns nonzero iff TYPE1 and TYPE2 are the same type, ignoring
1507 top-level qualifiers. */
1510 same_type_ignoring_top_level_qualifiers_p (tree type1, tree type2)
1512 if (type1 == error_mark_node || type2 == error_mark_node)
1515 return same_type_p (TYPE_MAIN_VARIANT (type1), TYPE_MAIN_VARIANT (type2));
1518 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1521 at_least_as_qualified_p (const_tree type1, const_tree type2)
1523 int q1 = cp_type_quals (type1);
1524 int q2 = cp_type_quals (type2);
1526 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1527 return (q1 & q2) == q2;
1530 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1531 more cv-qualified that TYPE1, and 0 otherwise. */
1534 comp_cv_qualification (const_tree type1, const_tree type2)
1536 int q1 = cp_type_quals (type1);
1537 int q2 = cp_type_quals (type2);
1542 if ((q1 & q2) == q2)
1544 else if ((q1 & q2) == q1)
1550 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1551 subset of the cv-qualification signature of TYPE2, and the types
1552 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1555 comp_cv_qual_signature (tree type1, tree type2)
1557 if (comp_ptr_ttypes_real (type2, type1, -1))
1559 else if (comp_ptr_ttypes_real (type1, type2, -1))
1565 /* Subroutines of `comptypes'. */
1567 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1568 equivalent in the sense that functions with those parameter types
1569 can have equivalent types. The two lists must be equivalent,
1570 element by element. */
1573 compparms (const_tree parms1, const_tree parms2)
1577 /* An unspecified parmlist matches any specified parmlist
1578 whose argument types don't need default promotions. */
1580 for (t1 = parms1, t2 = parms2;
1582 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1584 /* If one parmlist is shorter than the other,
1585 they fail to match. */
1588 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1595 /* Process a sizeof or alignof expression where the operand is a
1599 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1604 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1605 if (type == error_mark_node)
1606 return error_mark_node;
1608 type = non_reference (type);
1609 if (TREE_CODE (type) == METHOD_TYPE)
1612 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1613 "invalid application of %qs to a member function",
1614 operator_name_info[(int) op].name);
1615 value = size_one_node;
1618 dependent_p = dependent_type_p (type);
1620 complete_type (type);
1622 /* VLA types will have a non-constant size. In the body of an
1623 uninstantiated template, we don't need to try to compute the
1624 value, because the sizeof expression is not an integral
1625 constant expression in that case. And, if we do try to
1626 compute the value, we'll likely end up with SAVE_EXPRs, which
1627 the template substitution machinery does not expect to see. */
1628 || (processing_template_decl
1629 && COMPLETE_TYPE_P (type)
1630 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1632 value = build_min (op, size_type_node, type);
1633 TREE_READONLY (value) = 1;
1637 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1642 /* Return the size of the type, without producing any warnings for
1643 types whose size cannot be taken. This routine should be used only
1644 in some other routine that has already produced a diagnostic about
1645 using the size of such a type. */
1647 cxx_sizeof_nowarn (tree type)
1649 if (TREE_CODE (type) == FUNCTION_TYPE
1650 || TREE_CODE (type) == VOID_TYPE
1651 || TREE_CODE (type) == ERROR_MARK)
1652 return size_one_node;
1653 else if (!COMPLETE_TYPE_P (type))
1654 return size_zero_node;
1656 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1659 /* Process a sizeof expression where the operand is an expression. */
1662 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1664 if (e == error_mark_node)
1665 return error_mark_node;
1667 if (processing_template_decl)
1669 e = build_min (SIZEOF_EXPR, size_type_node, e);
1670 TREE_SIDE_EFFECTS (e) = 0;
1671 TREE_READONLY (e) = 1;
1676 /* To get the size of a static data member declared as an array of
1677 unknown bound, we need to instantiate it. */
1678 if (TREE_CODE (e) == VAR_DECL
1679 && VAR_HAD_UNKNOWN_BOUND (e)
1680 && DECL_TEMPLATE_INSTANTIATION (e))
1681 instantiate_decl (e, /*defer_ok*/true, /*expl_inst_mem*/false);
1683 e = mark_type_use (e);
1685 if (TREE_CODE (e) == COMPONENT_REF
1686 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1687 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1689 if (complain & tf_error)
1690 error ("invalid application of %<sizeof%> to a bit-field");
1692 return error_mark_node;
1695 else if (is_overloaded_fn (e))
1697 if (complain & tf_error)
1698 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1701 return error_mark_node;
1704 else if (type_unknown_p (e))
1706 if (complain & tf_error)
1707 cxx_incomplete_type_error (e, TREE_TYPE (e));
1709 return error_mark_node;
1715 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1718 /* Implement the __alignof keyword: Return the minimum required
1719 alignment of E, measured in bytes. For VAR_DECL's and
1720 FIELD_DECL's return DECL_ALIGN (which can be set from an
1721 "aligned" __attribute__ specification). */
1724 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1728 if (e == error_mark_node)
1729 return error_mark_node;
1731 if (processing_template_decl)
1733 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1734 TREE_SIDE_EFFECTS (e) = 0;
1735 TREE_READONLY (e) = 1;
1740 e = mark_type_use (e);
1742 if (TREE_CODE (e) == VAR_DECL)
1743 t = size_int (DECL_ALIGN_UNIT (e));
1744 else if (TREE_CODE (e) == COMPONENT_REF
1745 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1746 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1748 if (complain & tf_error)
1749 error ("invalid application of %<__alignof%> to a bit-field");
1751 return error_mark_node;
1754 else if (TREE_CODE (e) == COMPONENT_REF
1755 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1756 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1757 else if (is_overloaded_fn (e))
1759 if (complain & tf_error)
1760 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1763 return error_mark_node;
1764 if (TREE_CODE (e) == FUNCTION_DECL)
1765 t = size_int (DECL_ALIGN_UNIT (e));
1769 else if (type_unknown_p (e))
1771 if (complain & tf_error)
1772 cxx_incomplete_type_error (e, TREE_TYPE (e));
1774 return error_mark_node;
1778 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1779 complain & tf_error);
1781 return fold_convert (size_type_node, t);
1784 /* Process a sizeof or alignof expression E with code OP where the operand
1785 is an expression. */
1788 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1790 if (op == SIZEOF_EXPR)
1791 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1793 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1796 /* EXPR is being used in a context that is not a function call.
1801 The expression can be used only as the left-hand operand of a
1802 member function call.
1804 [expr.mptr.operator]
1806 If the result of .* or ->* is a function, then that result can be
1807 used only as the operand for the function call operator ().
1809 by issuing an error message if appropriate. Returns true iff EXPR
1810 violates these rules. */
1813 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1815 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1817 if (complain & tf_error)
1818 error ("invalid use of non-static member function");
1824 /* If EXP is a reference to a bitfield, and the type of EXP does not
1825 match the declared type of the bitfield, return the declared type
1826 of the bitfield. Otherwise, return NULL_TREE. */
1829 is_bitfield_expr_with_lowered_type (const_tree exp)
1831 switch (TREE_CODE (exp))
1834 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1835 ? TREE_OPERAND (exp, 1)
1836 : TREE_OPERAND (exp, 0)))
1838 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1841 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1845 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1851 field = TREE_OPERAND (exp, 1);
1852 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1854 if (same_type_ignoring_top_level_qualifiers_p
1855 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1857 return DECL_BIT_FIELD_TYPE (field);
1861 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1862 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1863 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1871 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1872 bitfield with a lowered type, the type of EXP is returned, rather
1876 unlowered_expr_type (const_tree exp)
1880 type = is_bitfield_expr_with_lowered_type (exp);
1882 type = TREE_TYPE (exp);
1887 /* Perform the conversions in [expr] that apply when an lvalue appears
1888 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1889 function-to-pointer conversions. In addition, manifest constants
1890 are replaced by their values, and bitfield references are converted
1891 to their declared types. Note that this function does not perform the
1892 lvalue-to-rvalue conversion for class types. If you need that conversion
1893 to for class types, then you probably need to use force_rvalue.
1895 Although the returned value is being used as an rvalue, this
1896 function does not wrap the returned expression in a
1897 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1898 that the return value is no longer an lvalue. */
1901 decay_conversion (tree exp)
1904 enum tree_code code;
1906 type = TREE_TYPE (exp);
1907 if (type == error_mark_node)
1908 return error_mark_node;
1910 exp = mark_rvalue_use (exp);
1912 exp = resolve_nondeduced_context (exp);
1913 if (type_unknown_p (exp))
1915 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1916 return error_mark_node;
1919 exp = decl_constant_value (exp);
1920 if (error_operand_p (exp))
1921 return error_mark_node;
1923 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1924 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1925 code = TREE_CODE (type);
1926 if (code == VOID_TYPE)
1928 error ("void value not ignored as it ought to be");
1929 return error_mark_node;
1931 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1932 return error_mark_node;
1933 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1934 return cp_build_unary_op (ADDR_EXPR, exp, 0, tf_warning_or_error);
1935 if (code == ARRAY_TYPE)
1940 if (TREE_CODE (exp) == INDIRECT_REF)
1941 return build_nop (build_pointer_type (TREE_TYPE (type)),
1942 TREE_OPERAND (exp, 0));
1944 if (TREE_CODE (exp) == COMPOUND_EXPR)
1946 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1947 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1948 TREE_OPERAND (exp, 0), op1);
1952 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1954 error ("invalid use of non-lvalue array");
1955 return error_mark_node;
1958 ptrtype = build_pointer_type (TREE_TYPE (type));
1960 if (TREE_CODE (exp) == VAR_DECL)
1962 if (!cxx_mark_addressable (exp))
1963 return error_mark_node;
1964 adr = build_nop (ptrtype, build_address (exp));
1967 /* This way is better for a COMPONENT_REF since it can
1968 simplify the offset for a component. */
1969 adr = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
1970 return cp_convert (ptrtype, adr);
1973 /* If a bitfield is used in a context where integral promotion
1974 applies, then the caller is expected to have used
1975 default_conversion. That function promotes bitfields correctly
1976 before calling this function. At this point, if we have a
1977 bitfield referenced, we may assume that is not subject to
1978 promotion, and that, therefore, the type of the resulting rvalue
1979 is the declared type of the bitfield. */
1980 exp = convert_bitfield_to_declared_type (exp);
1982 /* We do not call rvalue() here because we do not want to wrap EXP
1983 in a NON_LVALUE_EXPR. */
1987 Non-class rvalues always have cv-unqualified types. */
1988 type = TREE_TYPE (exp);
1989 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
1990 exp = build_nop (cv_unqualified (type), exp);
1995 /* Perform preparatory conversions, as part of the "usual arithmetic
1996 conversions". In particular, as per [expr]:
1998 Whenever an lvalue expression appears as an operand of an
1999 operator that expects the rvalue for that operand, the
2000 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
2001 standard conversions are applied to convert the expression to an
2004 In addition, we perform integral promotions here, as those are
2005 applied to both operands to a binary operator before determining
2006 what additional conversions should apply. */
2009 default_conversion (tree exp)
2011 /* Check for target-specific promotions. */
2012 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
2014 exp = cp_convert (promoted_type, exp);
2015 /* Perform the integral promotions first so that bitfield
2016 expressions (which may promote to "int", even if the bitfield is
2017 declared "unsigned") are promoted correctly. */
2018 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
2019 exp = perform_integral_promotions (exp);
2020 /* Perform the other conversions. */
2021 exp = decay_conversion (exp);
2026 /* EXPR is an expression with an integral or enumeration type.
2027 Perform the integral promotions in [conv.prom], and return the
2031 perform_integral_promotions (tree expr)
2036 expr = mark_rvalue_use (expr);
2040 If the bitfield has an enumerated type, it is treated as any
2041 other value of that type for promotion purposes. */
2042 type = is_bitfield_expr_with_lowered_type (expr);
2043 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
2044 type = TREE_TYPE (expr);
2045 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
2046 promoted_type = type_promotes_to (type);
2047 if (type != promoted_type)
2048 expr = cp_convert (promoted_type, expr);
2052 /* Returns nonzero iff exp is a STRING_CST or the result of applying
2053 decay_conversion to one. */
2056 string_conv_p (const_tree totype, const_tree exp, int warn)
2060 if (TREE_CODE (totype) != POINTER_TYPE)
2063 t = TREE_TYPE (totype);
2064 if (!same_type_p (t, char_type_node)
2065 && !same_type_p (t, char16_type_node)
2066 && !same_type_p (t, char32_type_node)
2067 && !same_type_p (t, wchar_type_node))
2070 if (TREE_CODE (exp) == STRING_CST)
2072 /* Make sure that we don't try to convert between char and wide chars. */
2073 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
2078 /* Is this a string constant which has decayed to 'const char *'? */
2079 t = build_pointer_type (cp_build_qualified_type (t, TYPE_QUAL_CONST));
2080 if (!same_type_p (TREE_TYPE (exp), t))
2083 if (TREE_CODE (exp) != ADDR_EXPR
2084 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
2088 /* This warning is not very useful, as it complains about printf. */
2090 warning (OPT_Wwrite_strings,
2091 "deprecated conversion from string constant to %qT",
2097 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
2098 can, for example, use as an lvalue. This code used to be in
2099 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
2100 expressions, where we're dealing with aggregates. But now it's again only
2101 called from unary_complex_lvalue. The case (in particular) that led to
2102 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
2106 rationalize_conditional_expr (enum tree_code code, tree t,
2107 tsubst_flags_t complain)
2109 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
2110 the first operand is always the one to be used if both operands
2111 are equal, so we know what conditional expression this used to be. */
2112 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
2114 tree op0 = TREE_OPERAND (t, 0);
2115 tree op1 = TREE_OPERAND (t, 1);
2117 /* The following code is incorrect if either operand side-effects. */
2118 gcc_assert (!TREE_SIDE_EFFECTS (op0)
2119 && !TREE_SIDE_EFFECTS (op1));
2121 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
2122 ? LE_EXPR : GE_EXPR),
2123 op0, TREE_CODE (op0),
2124 op1, TREE_CODE (op1),
2125 /*overloaded_p=*/NULL,
2127 cp_build_unary_op (code, op0, 0, complain),
2128 cp_build_unary_op (code, op1, 0, complain),
2133 build_conditional_expr (TREE_OPERAND (t, 0),
2134 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
2136 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
2141 /* Given the TYPE of an anonymous union field inside T, return the
2142 FIELD_DECL for the field. If not found return NULL_TREE. Because
2143 anonymous unions can nest, we must also search all anonymous unions
2144 that are directly reachable. */
2147 lookup_anon_field (tree t, tree type)
2151 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
2153 if (TREE_STATIC (field))
2155 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
2158 /* If we find it directly, return the field. */
2159 if (DECL_NAME (field) == NULL_TREE
2160 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
2165 /* Otherwise, it could be nested, search harder. */
2166 if (DECL_NAME (field) == NULL_TREE
2167 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2169 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
2177 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
2178 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
2179 non-NULL, it indicates the path to the base used to name MEMBER.
2180 If PRESERVE_REFERENCE is true, the expression returned will have
2181 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
2182 returned will have the type referred to by the reference.
2184 This function does not perform access control; that is either done
2185 earlier by the parser when the name of MEMBER is resolved to MEMBER
2186 itself, or later when overload resolution selects one of the
2187 functions indicated by MEMBER. */
2190 build_class_member_access_expr (tree object, tree member,
2191 tree access_path, bool preserve_reference,
2192 tsubst_flags_t complain)
2196 tree result = NULL_TREE;
2198 if (error_operand_p (object) || error_operand_p (member))
2199 return error_mark_node;
2201 gcc_assert (DECL_P (member) || BASELINK_P (member));
2205 The type of the first expression shall be "class object" (of a
2207 object_type = TREE_TYPE (object);
2208 if (!currently_open_class (object_type)
2209 && !complete_type_or_else (object_type, object))
2210 return error_mark_node;
2211 if (!CLASS_TYPE_P (object_type))
2213 if (complain & tf_error)
2214 error ("request for member %qD in %qE, which is of non-class type %qT",
2215 member, object, object_type);
2216 return error_mark_node;
2219 /* The standard does not seem to actually say that MEMBER must be a
2220 member of OBJECT_TYPE. However, that is clearly what is
2222 if (DECL_P (member))
2224 member_scope = DECL_CLASS_CONTEXT (member);
2226 if (TREE_DEPRECATED (member))
2227 warn_deprecated_use (member, NULL_TREE);
2230 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2231 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2232 presently be the anonymous union. Go outwards until we find a
2233 type related to OBJECT_TYPE. */
2234 while (ANON_AGGR_TYPE_P (member_scope)
2235 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2237 member_scope = TYPE_CONTEXT (member_scope);
2238 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2240 if (complain & tf_error)
2242 if (TREE_CODE (member) == FIELD_DECL)
2243 error ("invalid use of nonstatic data member %qE", member);
2245 error ("%qD is not a member of %qT", member, object_type);
2247 return error_mark_node;
2250 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2251 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2252 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2254 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2256 object = cp_build_indirect_ref (temp, RO_NULL, complain);
2259 /* In [expr.ref], there is an explicit list of the valid choices for
2260 MEMBER. We check for each of those cases here. */
2261 if (TREE_CODE (member) == VAR_DECL)
2263 /* A static data member. */
2265 mark_exp_read (object);
2266 /* If OBJECT has side-effects, they are supposed to occur. */
2267 if (TREE_SIDE_EFFECTS (object))
2268 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2270 else if (TREE_CODE (member) == FIELD_DECL)
2272 /* A non-static data member. */
2277 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2278 && integer_zerop (TREE_OPERAND (object, 0)));
2280 /* Convert OBJECT to the type of MEMBER. */
2281 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2282 TYPE_MAIN_VARIANT (member_scope)))
2287 binfo = lookup_base (access_path ? access_path : object_type,
2288 member_scope, ba_unique, &kind);
2289 if (binfo == error_mark_node)
2290 return error_mark_node;
2292 /* It is invalid to try to get to a virtual base of a
2293 NULL object. The most common cause is invalid use of
2295 if (null_object_p && kind == bk_via_virtual)
2297 if (complain & tf_error)
2299 error ("invalid access to non-static data member %qD of "
2302 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2304 return error_mark_node;
2307 /* Convert to the base. */
2308 object = build_base_path (PLUS_EXPR, object, binfo,
2310 /* If we found the base successfully then we should be able
2311 to convert to it successfully. */
2312 gcc_assert (object != error_mark_node);
2315 /* Complain about other invalid uses of offsetof, even though they will
2316 give the right answer. Note that we complain whether or not they
2317 actually used the offsetof macro, since there's no way to know at this
2318 point. So we just give a warning, instead of a pedwarn. */
2319 /* Do not produce this warning for base class field references, because
2320 we know for a fact that didn't come from offsetof. This does occur
2321 in various testsuite cases where a null object is passed where a
2322 vtable access is required. */
2323 if (null_object_p && warn_invalid_offsetof
2324 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2325 && !DECL_FIELD_IS_BASE (member)
2326 && cp_unevaluated_operand == 0
2327 && (complain & tf_warning))
2329 warning (OPT_Winvalid_offsetof,
2330 "invalid access to non-static data member %qD "
2331 " of NULL object", member);
2332 warning (OPT_Winvalid_offsetof,
2333 "(perhaps the %<offsetof%> macro was used incorrectly)");
2336 /* If MEMBER is from an anonymous aggregate, we have converted
2337 OBJECT so that it refers to the class containing the
2338 anonymous union. Generate a reference to the anonymous union
2339 itself, and recur to find MEMBER. */
2340 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2341 /* When this code is called from build_field_call, the
2342 object already has the type of the anonymous union.
2343 That is because the COMPONENT_REF was already
2344 constructed, and was then disassembled before calling
2345 build_field_call. After the function-call code is
2346 cleaned up, this waste can be eliminated. */
2347 && (!same_type_ignoring_top_level_qualifiers_p
2348 (TREE_TYPE (object), DECL_CONTEXT (member))))
2350 tree anonymous_union;
2352 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2353 DECL_CONTEXT (member));
2354 object = build_class_member_access_expr (object,
2356 /*access_path=*/NULL_TREE,
2361 /* Compute the type of the field, as described in [expr.ref]. */
2362 type_quals = TYPE_UNQUALIFIED;
2363 member_type = TREE_TYPE (member);
2364 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2366 type_quals = (cp_type_quals (member_type)
2367 | cp_type_quals (object_type));
2369 /* A field is const (volatile) if the enclosing object, or the
2370 field itself, is const (volatile). But, a mutable field is
2371 not const, even within a const object. */
2372 if (DECL_MUTABLE_P (member))
2373 type_quals &= ~TYPE_QUAL_CONST;
2374 member_type = cp_build_qualified_type (member_type, type_quals);
2377 result = build3 (COMPONENT_REF, member_type, object, member,
2379 result = fold_if_not_in_template (result);
2381 /* Mark the expression const or volatile, as appropriate. Even
2382 though we've dealt with the type above, we still have to mark the
2383 expression itself. */
2384 if (type_quals & TYPE_QUAL_CONST)
2385 TREE_READONLY (result) = 1;
2386 if (type_quals & TYPE_QUAL_VOLATILE)
2387 TREE_THIS_VOLATILE (result) = 1;
2389 else if (BASELINK_P (member))
2391 /* The member is a (possibly overloaded) member function. */
2395 /* If the MEMBER is exactly one static member function, then we
2396 know the type of the expression. Otherwise, we must wait
2397 until overload resolution has been performed. */
2398 functions = BASELINK_FUNCTIONS (member);
2399 if (TREE_CODE (functions) == FUNCTION_DECL
2400 && DECL_STATIC_FUNCTION_P (functions))
2401 type = TREE_TYPE (functions);
2403 type = unknown_type_node;
2404 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2405 base. That will happen when the function is called. */
2406 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2408 else if (TREE_CODE (member) == CONST_DECL)
2410 /* The member is an enumerator. */
2412 /* If OBJECT has side-effects, they are supposed to occur. */
2413 if (TREE_SIDE_EFFECTS (object))
2414 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2419 if (complain & tf_error)
2420 error ("invalid use of %qD", member);
2421 return error_mark_node;
2424 if (!preserve_reference)
2427 If E2 is declared to have type "reference to T", then ... the
2428 type of E1.E2 is T. */
2429 result = convert_from_reference (result);
2434 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2435 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2438 lookup_destructor (tree object, tree scope, tree dtor_name)
2440 tree object_type = TREE_TYPE (object);
2441 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2444 if (scope && !check_dtor_name (scope, dtor_type))
2446 error ("qualified type %qT does not match destructor name ~%qT",
2448 return error_mark_node;
2450 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2452 /* In a template, names we can't find a match for are still accepted
2453 destructor names, and we check them here. */
2454 if (check_dtor_name (object_type, dtor_type))
2455 dtor_type = object_type;
2458 error ("object type %qT does not match destructor name ~%qT",
2459 object_type, dtor_type);
2460 return error_mark_node;
2464 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2466 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2467 TYPE_MAIN_VARIANT (object_type), dtor_type);
2468 return error_mark_node;
2470 expr = lookup_member (dtor_type, complete_dtor_identifier,
2471 /*protect=*/1, /*want_type=*/false);
2472 expr = (adjust_result_of_qualified_name_lookup
2473 (expr, dtor_type, object_type));
2477 /* An expression of the form "A::template B" has been resolved to
2478 DECL. Issue a diagnostic if B is not a template or template
2482 check_template_keyword (tree decl)
2484 /* The standard says:
2488 If a name prefixed by the keyword template is not a member
2489 template, the program is ill-formed.
2491 DR 228 removed the restriction that the template be a member
2494 DR 96, if accepted would add the further restriction that explicit
2495 template arguments must be provided if the template keyword is
2496 used, but, as of 2005-10-16, that DR is still in "drafting". If
2497 this DR is accepted, then the semantic checks here can be
2498 simplified, as the entity named must in fact be a template
2499 specialization, rather than, as at present, a set of overloaded
2500 functions containing at least one template function. */
2501 if (TREE_CODE (decl) != TEMPLATE_DECL
2502 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2504 if (!is_overloaded_fn (decl))
2505 permerror (input_location, "%qD is not a template", decl);
2510 if (BASELINK_P (fns))
2511 fns = BASELINK_FUNCTIONS (fns);
2514 tree fn = OVL_CURRENT (fns);
2515 if (TREE_CODE (fn) == TEMPLATE_DECL
2516 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2518 if (TREE_CODE (fn) == FUNCTION_DECL
2519 && DECL_USE_TEMPLATE (fn)
2520 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2522 fns = OVL_NEXT (fns);
2525 permerror (input_location, "%qD is not a template", decl);
2530 /* This function is called by the parser to process a class member
2531 access expression of the form OBJECT.NAME. NAME is a node used by
2532 the parser to represent a name; it is not yet a DECL. It may,
2533 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2534 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2535 there is no reason to do the lookup twice, so the parser keeps the
2536 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2537 be a template via the use of the "A::template B" syntax. */
2540 finish_class_member_access_expr (tree object, tree name, bool template_p,
2541 tsubst_flags_t complain)
2546 tree access_path = NULL_TREE;
2547 tree orig_object = object;
2548 tree orig_name = name;
2550 if (object == error_mark_node || name == error_mark_node)
2551 return error_mark_node;
2553 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2554 if (!objc_is_public (object, name))
2555 return error_mark_node;
2557 object_type = TREE_TYPE (object);
2559 if (processing_template_decl)
2561 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2562 dependent_type_p (object_type)
2563 /* If NAME is just an IDENTIFIER_NODE, then the expression
2565 || TREE_CODE (object) == IDENTIFIER_NODE
2566 /* If NAME is "f<args>", where either 'f' or 'args' is
2567 dependent, then the expression is dependent. */
2568 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2569 && dependent_template_id_p (TREE_OPERAND (name, 0),
2570 TREE_OPERAND (name, 1)))
2571 /* If NAME is "T::X" where "T" is dependent, then the
2572 expression is dependent. */
2573 || (TREE_CODE (name) == SCOPE_REF
2574 && TYPE_P (TREE_OPERAND (name, 0))
2575 && dependent_type_p (TREE_OPERAND (name, 0))))
2576 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2577 object = build_non_dependent_expr (object);
2582 The type of the first expression shall be "class object" (of a
2584 if (!currently_open_class (object_type)
2585 && !complete_type_or_else (object_type, object))
2586 return error_mark_node;
2587 if (!CLASS_TYPE_P (object_type))
2589 if (complain & tf_error)
2590 error ("request for member %qD in %qE, which is of non-class type %qT",
2591 name, object, object_type);
2592 return error_mark_node;
2595 if (BASELINK_P (name))
2596 /* A member function that has already been looked up. */
2600 bool is_template_id = false;
2601 tree template_args = NULL_TREE;
2604 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2606 is_template_id = true;
2607 template_args = TREE_OPERAND (name, 1);
2608 name = TREE_OPERAND (name, 0);
2610 if (TREE_CODE (name) == OVERLOAD)
2611 name = DECL_NAME (get_first_fn (name));
2612 else if (DECL_P (name))
2613 name = DECL_NAME (name);
2616 if (TREE_CODE (name) == SCOPE_REF)
2618 /* A qualified name. The qualifying class or namespace `S'
2619 has already been looked up; it is either a TYPE or a
2621 scope = TREE_OPERAND (name, 0);
2622 name = TREE_OPERAND (name, 1);
2624 /* If SCOPE is a namespace, then the qualified name does not
2625 name a member of OBJECT_TYPE. */
2626 if (TREE_CODE (scope) == NAMESPACE_DECL)
2628 if (complain & tf_error)
2629 error ("%<%D::%D%> is not a member of %qT",
2630 scope, name, object_type);
2631 return error_mark_node;
2634 gcc_assert (CLASS_TYPE_P (scope));
2635 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2636 || TREE_CODE (name) == BIT_NOT_EXPR);
2638 if (constructor_name_p (name, scope))
2640 if (complain & tf_error)
2641 error ("cannot call constructor %<%T::%D%> directly",
2643 return error_mark_node;
2646 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2647 access_path = lookup_base (object_type, scope, ba_check, NULL);
2648 if (access_path == error_mark_node)
2649 return error_mark_node;
2652 if (complain & tf_error)
2653 error ("%qT is not a base of %qT", scope, object_type);
2654 return error_mark_node;
2660 access_path = object_type;
2663 if (TREE_CODE (name) == BIT_NOT_EXPR)
2664 member = lookup_destructor (object, scope, name);
2667 /* Look up the member. */
2668 member = lookup_member (access_path, name, /*protect=*/1,
2669 /*want_type=*/false);
2670 if (member == NULL_TREE)
2672 if (complain & tf_error)
2673 error ("%qD has no member named %qE", object_type, name);
2674 return error_mark_node;
2676 if (member == error_mark_node)
2677 return error_mark_node;
2682 tree templ = member;
2684 if (BASELINK_P (templ))
2685 templ = lookup_template_function (templ, template_args);
2688 if (complain & tf_error)
2689 error ("%qD is not a member template function", name);
2690 return error_mark_node;
2695 if (TREE_DEPRECATED (member))
2696 warn_deprecated_use (member, NULL_TREE);
2699 check_template_keyword (member);
2701 expr = build_class_member_access_expr (object, member, access_path,
2702 /*preserve_reference=*/false,
2704 if (processing_template_decl && expr != error_mark_node)
2706 if (BASELINK_P (member))
2708 if (TREE_CODE (orig_name) == SCOPE_REF)
2709 BASELINK_QUALIFIED_P (member) = 1;
2712 return build_min_non_dep (COMPONENT_REF, expr,
2713 orig_object, orig_name,
2720 /* Return an expression for the MEMBER_NAME field in the internal
2721 representation of PTRMEM, a pointer-to-member function. (Each
2722 pointer-to-member function type gets its own RECORD_TYPE so it is
2723 more convenient to access the fields by name than by FIELD_DECL.)
2724 This routine converts the NAME to a FIELD_DECL and then creates the
2725 node for the complete expression. */
2728 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2734 /* This code is a stripped down version of
2735 build_class_member_access_expr. It does not work to use that
2736 routine directly because it expects the object to be of class
2738 ptrmem_type = TREE_TYPE (ptrmem);
2739 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2740 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2741 /*want_type=*/false);
2742 member_type = cp_build_qualified_type (TREE_TYPE (member),
2743 cp_type_quals (ptrmem_type));
2744 return fold_build3_loc (input_location,
2745 COMPONENT_REF, member_type,
2746 ptrmem, member, NULL_TREE);
2749 /* Given an expression PTR for a pointer, return an expression
2750 for the value pointed to.
2751 ERRORSTRING is the name of the operator to appear in error messages.
2753 This function may need to overload OPERATOR_FNNAME.
2754 Must also handle REFERENCE_TYPEs for C++. */
2757 build_x_indirect_ref (tree expr, ref_operator errorstring,
2758 tsubst_flags_t complain)
2760 tree orig_expr = expr;
2763 if (processing_template_decl)
2765 /* Retain the type if we know the operand is a pointer so that
2766 describable_type doesn't make auto deduction break. */
2767 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2768 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2769 if (type_dependent_expression_p (expr))
2770 return build_min_nt (INDIRECT_REF, expr);
2771 expr = build_non_dependent_expr (expr);
2774 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2775 NULL_TREE, /*overloaded_p=*/NULL, complain);
2777 rval = cp_build_indirect_ref (expr, errorstring, complain);
2779 if (processing_template_decl && rval != error_mark_node)
2780 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2785 /* Helper function called from c-common. */
2787 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2788 tree ptr, ref_operator errorstring)
2790 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2794 cp_build_indirect_ref (tree ptr, ref_operator errorstring,
2795 tsubst_flags_t complain)
2799 if (ptr == error_mark_node)
2800 return error_mark_node;
2802 if (ptr == current_class_ptr)
2803 return current_class_ref;
2805 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2806 ? ptr : decay_conversion (ptr));
2807 type = TREE_TYPE (pointer);
2809 if (POINTER_TYPE_P (type))
2813 If the type of the expression is "pointer to T," the type
2814 of the result is "T." */
2815 tree t = TREE_TYPE (type);
2817 if (CONVERT_EXPR_P (ptr)
2818 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2820 /* If a warning is issued, mark it to avoid duplicates from
2821 the backend. This only needs to be done at
2822 warn_strict_aliasing > 2. */
2823 if (warn_strict_aliasing > 2)
2824 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2825 type, TREE_OPERAND (ptr, 0)))
2826 TREE_NO_WARNING (ptr) = 1;
2829 if (VOID_TYPE_P (t))
2831 /* A pointer to incomplete type (other than cv void) can be
2832 dereferenced [expr.unary.op]/1 */
2833 if (complain & tf_error)
2834 error ("%qT is not a pointer-to-object type", type);
2835 return error_mark_node;
2837 else if (TREE_CODE (pointer) == ADDR_EXPR
2838 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2839 /* The POINTER was something like `&x'. We simplify `*&x' to
2841 return TREE_OPERAND (pointer, 0);
2844 tree ref = build1 (INDIRECT_REF, t, pointer);
2846 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2847 so that we get the proper error message if the result is used
2848 to assign to. Also, &* is supposed to be a no-op. */
2849 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2850 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2851 TREE_SIDE_EFFECTS (ref)
2852 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2856 else if (!(complain & tf_error))
2857 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2859 /* `pointer' won't be an error_mark_node if we were given a
2860 pointer to member, so it's cool to check for this here. */
2861 else if (TYPE_PTR_TO_MEMBER_P (type))
2862 switch (errorstring)
2864 case RO_ARRAY_INDEXING:
2865 error ("invalid use of array indexing on pointer to member");
2868 error ("invalid use of unary %<*%> on pointer to member");
2870 case RO_IMPLICIT_CONVERSION:
2871 error ("invalid use of implicit conversion on pointer to member");
2876 else if (pointer != error_mark_node)
2877 switch (errorstring)
2880 error ("invalid type argument");
2882 case RO_ARRAY_INDEXING:
2883 error ("invalid type argument of array indexing");
2886 error ("invalid type argument of unary %<*%>");
2888 case RO_IMPLICIT_CONVERSION:
2889 error ("invalid type argument of implicit conversion");
2894 return error_mark_node;
2897 /* This handles expressions of the form "a[i]", which denotes
2900 This is logically equivalent in C to *(a+i), but we may do it differently.
2901 If A is a variable or a member, we generate a primitive ARRAY_REF.
2902 This avoids forcing the array out of registers, and can work on
2903 arrays that are not lvalues (for example, members of structures returned
2906 If INDEX is of some user-defined type, it must be converted to
2907 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2908 will inherit the type of the array, which will be some pointer type.
2910 LOC is the location to use in building the array reference. */
2913 cp_build_array_ref (location_t loc, tree array, tree idx,
2914 tsubst_flags_t complain)
2920 if (complain & tf_error)
2921 error_at (loc, "subscript missing in array reference");
2922 return error_mark_node;
2925 if (TREE_TYPE (array) == error_mark_node
2926 || TREE_TYPE (idx) == error_mark_node)
2927 return error_mark_node;
2929 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2931 switch (TREE_CODE (array))
2935 tree value = cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2937 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2938 TREE_OPERAND (array, 0), value);
2939 SET_EXPR_LOCATION (ret, loc);
2944 ret = build_conditional_expr
2945 (TREE_OPERAND (array, 0),
2946 cp_build_array_ref (loc, TREE_OPERAND (array, 1), idx,
2948 cp_build_array_ref (loc, TREE_OPERAND (array, 2), idx,
2950 tf_warning_or_error);
2951 protected_set_expr_location (ret, loc);
2958 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2962 warn_array_subscript_with_type_char (idx);
2964 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2966 if (complain & tf_error)
2967 error_at (loc, "array subscript is not an integer");
2968 return error_mark_node;
2971 /* Apply integral promotions *after* noticing character types.
2972 (It is unclear why we do these promotions -- the standard
2973 does not say that we should. In fact, the natural thing would
2974 seem to be to convert IDX to ptrdiff_t; we're performing
2975 pointer arithmetic.) */
2976 idx = perform_integral_promotions (idx);
2978 /* An array that is indexed by a non-constant
2979 cannot be stored in a register; we must be able to do
2980 address arithmetic on its address.
2981 Likewise an array of elements of variable size. */
2982 if (TREE_CODE (idx) != INTEGER_CST
2983 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2984 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2987 if (!cxx_mark_addressable (array))
2988 return error_mark_node;
2991 /* An array that is indexed by a constant value which is not within
2992 the array bounds cannot be stored in a register either; because we
2993 would get a crash in store_bit_field/extract_bit_field when trying
2994 to access a non-existent part of the register. */
2995 if (TREE_CODE (idx) == INTEGER_CST
2996 && TYPE_DOMAIN (TREE_TYPE (array))
2997 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2999 if (!cxx_mark_addressable (array))
3000 return error_mark_node;
3003 if (!lvalue_p (array) && (complain & tf_error))
3004 pedwarn (loc, OPT_pedantic,
3005 "ISO C++ forbids subscripting non-lvalue array");
3007 /* Note in C++ it is valid to subscript a `register' array, since
3008 it is valid to take the address of something with that
3009 storage specification. */
3013 while (TREE_CODE (foo) == COMPONENT_REF)
3014 foo = TREE_OPERAND (foo, 0);
3015 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo)
3016 && (complain & tf_warning))
3017 warning_at (loc, OPT_Wextra,
3018 "subscripting array declared %<register%>");
3021 type = TREE_TYPE (TREE_TYPE (array));
3022 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
3023 /* Array ref is const/volatile if the array elements are
3024 or if the array is.. */
3025 TREE_READONLY (rval)
3026 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
3027 TREE_SIDE_EFFECTS (rval)
3028 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
3029 TREE_THIS_VOLATILE (rval)
3030 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
3031 ret = require_complete_type (fold_if_not_in_template (rval));
3032 protected_set_expr_location (ret, loc);
3037 tree ar = default_conversion (array);
3038 tree ind = default_conversion (idx);
3040 /* Put the integer in IND to simplify error checking. */
3041 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
3048 if (ar == error_mark_node)
3051 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
3053 if (complain & tf_error)
3054 error_at (loc, "subscripted value is neither array nor pointer");
3055 return error_mark_node;
3057 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
3059 if (complain & tf_error)
3060 error_at (loc, "array subscript is not an integer");
3061 return error_mark_node;
3064 warn_array_subscript_with_type_char (idx);
3066 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
3071 protected_set_expr_location (ret, loc);
3076 /* Entry point for Obj-C++. */
3079 build_array_ref (location_t loc, tree array, tree idx)
3081 return cp_build_array_ref (loc, array, idx, tf_warning_or_error);
3084 /* Resolve a pointer to member function. INSTANCE is the object
3085 instance to use, if the member points to a virtual member.
3087 This used to avoid checking for virtual functions if basetype
3088 has no virtual functions, according to an earlier ANSI draft.
3089 With the final ISO C++ rules, such an optimization is
3090 incorrect: A pointer to a derived member can be static_cast
3091 to pointer-to-base-member, as long as the dynamic object
3092 later has the right member. */
3095 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
3097 if (TREE_CODE (function) == OFFSET_REF)
3098 function = TREE_OPERAND (function, 1);
3100 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
3102 tree idx, delta, e1, e2, e3, vtbl, basetype;
3103 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
3105 tree instance_ptr = *instance_ptrptr;
3106 tree instance_save_expr = 0;
3107 if (instance_ptr == error_mark_node)
3109 if (TREE_CODE (function) == PTRMEM_CST)
3111 /* Extracting the function address from a pmf is only
3112 allowed with -Wno-pmf-conversions. It only works for
3114 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
3115 e1 = convert (fntype, e1);
3120 error ("object missing in use of %qE", function);
3121 return error_mark_node;
3125 if (TREE_SIDE_EFFECTS (instance_ptr))
3126 instance_ptr = instance_save_expr = save_expr (instance_ptr);
3128 if (TREE_SIDE_EFFECTS (function))
3129 function = save_expr (function);
3131 /* Start by extracting all the information from the PMF itself. */
3132 e3 = pfn_from_ptrmemfunc (function);
3133 delta = delta_from_ptrmemfunc (function);
3134 idx = build1 (NOP_EXPR, vtable_index_type, e3);
3135 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
3137 case ptrmemfunc_vbit_in_pfn:
3138 e1 = cp_build_binary_op (input_location,
3139 BIT_AND_EXPR, idx, integer_one_node,
3140 tf_warning_or_error);
3141 idx = cp_build_binary_op (input_location,
3142 MINUS_EXPR, idx, integer_one_node,
3143 tf_warning_or_error);
3146 case ptrmemfunc_vbit_in_delta:
3147 e1 = cp_build_binary_op (input_location,
3148 BIT_AND_EXPR, delta, integer_one_node,
3149 tf_warning_or_error);
3150 delta = cp_build_binary_op (input_location,
3151 RSHIFT_EXPR, delta, integer_one_node,
3152 tf_warning_or_error);
3159 /* Convert down to the right base before using the instance. A
3160 special case is that in a pointer to member of class C, C may
3161 be incomplete. In that case, the function will of course be
3162 a member of C, and no conversion is required. In fact,
3163 lookup_base will fail in that case, because incomplete
3164 classes do not have BINFOs. */
3165 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
3166 if (!same_type_ignoring_top_level_qualifiers_p
3167 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
3169 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
3170 basetype, ba_check, NULL);
3171 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
3173 if (instance_ptr == error_mark_node)
3174 return error_mark_node;
3176 /* ...and then the delta in the PMF. */
3177 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
3178 instance_ptr, fold_convert (sizetype, delta));
3180 /* Hand back the adjusted 'this' argument to our caller. */
3181 *instance_ptrptr = instance_ptr;
3183 /* Next extract the vtable pointer from the object. */
3184 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
3186 vtbl = cp_build_indirect_ref (vtbl, RO_NULL, tf_warning_or_error);
3187 /* If the object is not dynamic the access invokes undefined
3188 behavior. As it is not executed in this case silence the
3189 spurious warnings it may provoke. */
3190 TREE_NO_WARNING (vtbl) = 1;
3192 /* Finally, extract the function pointer from the vtable. */
3193 e2 = fold_build2_loc (input_location,
3194 POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
3195 fold_convert (sizetype, idx));
3196 e2 = cp_build_indirect_ref (e2, RO_NULL, tf_warning_or_error);
3197 TREE_CONSTANT (e2) = 1;
3199 /* When using function descriptors, the address of the
3200 vtable entry is treated as a function pointer. */
3201 if (TARGET_VTABLE_USES_DESCRIPTORS)
3202 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
3203 cp_build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1,
3204 tf_warning_or_error));
3206 e2 = fold_convert (TREE_TYPE (e3), e2);
3207 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
3209 /* Make sure this doesn't get evaluated first inside one of the
3210 branches of the COND_EXPR. */
3211 if (instance_save_expr)
3212 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
3213 instance_save_expr, e1);
3220 /* Used by the C-common bits. */
3222 build_function_call (location_t loc ATTRIBUTE_UNUSED,
3223 tree function, tree params)
3225 return cp_build_function_call (function, params, tf_warning_or_error);
3228 /* Used by the C-common bits. */
3230 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
3231 tree function, VEC(tree,gc) *params,
3232 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
3234 VEC(tree,gc) *orig_params = params;
3235 tree ret = cp_build_function_call_vec (function, ¶ms,
3236 tf_warning_or_error);
3238 /* cp_build_function_call_vec can reallocate PARAMS by adding
3239 default arguments. That should never happen here. Verify
3241 gcc_assert (params == orig_params);
3246 /* Build a function call using a tree list of arguments. */
3249 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
3254 vec = make_tree_vector ();
3255 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3256 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3257 ret = cp_build_function_call_vec (function, &vec, complain);
3258 release_tree_vector (vec);
3262 /* Build a function call using varargs. */
3265 cp_build_function_call_nary (tree function, tsubst_flags_t complain, ...)
3271 vec = make_tree_vector ();
3272 va_start (args, complain);
3273 for (t = va_arg (args, tree); t != NULL_TREE; t = va_arg (args, tree))
3274 VEC_safe_push (tree, gc, vec, t);
3276 ret = cp_build_function_call_vec (function, &vec, complain);
3277 release_tree_vector (vec);
3281 /* Build a function call using a vector of arguments. PARAMS may be
3282 NULL if there are no parameters. This changes the contents of
3286 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3287 tsubst_flags_t complain)
3289 tree fntype, fndecl;
3291 tree original = function;
3295 VEC(tree,gc) *allocated = NULL;
3298 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3299 expressions, like those used for ObjC messenger dispatches. */
3300 if (params != NULL && !VEC_empty (tree, *params))
3301 function = objc_rewrite_function_call (function,
3302 VEC_index (tree, *params, 0));
3304 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3305 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3306 if (TREE_CODE (function) == NOP_EXPR
3307 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3308 function = TREE_OPERAND (function, 0);
3310 if (TREE_CODE (function) == FUNCTION_DECL)
3312 mark_used (function);
3315 /* Convert anything with function type to a pointer-to-function. */
3316 if (DECL_MAIN_P (function) && (complain & tf_error))
3317 pedwarn (input_location, OPT_pedantic,
3318 "ISO C++ forbids calling %<::main%> from within program");
3320 function = build_addr_func (function);
3326 function = build_addr_func (function);
3329 if (function == error_mark_node)
3330 return error_mark_node;
3332 fntype = TREE_TYPE (function);
3334 if (TYPE_PTRMEMFUNC_P (fntype))
3336 if (complain & tf_error)
3337 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3338 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3339 original, original);
3340 return error_mark_node;
3343 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3344 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3346 if (!((TREE_CODE (fntype) == POINTER_TYPE
3347 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3349 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3351 if (complain & tf_error)
3352 error ("%qE cannot be used as a function", original);
3353 return error_mark_node;
3356 /* fntype now gets the type of function pointed to. */
3357 fntype = TREE_TYPE (fntype);
3358 parm_types = TYPE_ARG_TYPES (fntype);
3362 allocated = make_tree_vector ();
3363 params = &allocated;
3366 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3369 return error_mark_node;
3371 argarray = VEC_address (tree, *params);
3373 /* Check for errors in format strings and inappropriately
3375 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
3378 ret = build_cxx_call (function, nargs, argarray);
3380 if (allocated != NULL)
3381 release_tree_vector (allocated);
3386 /* Subroutine of convert_arguments.
3387 Warn about wrong number of args are genereted. */
3390 warn_args_num (location_t loc, tree fndecl, bool too_many_p)
3394 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3396 if (DECL_NAME (fndecl) == NULL_TREE
3397 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3400 ? G_("too many arguments to constructor %q#D")
3401 : G_("too few arguments to constructor %q#D"),
3406 ? G_("too many arguments to member function %q#D")
3407 : G_("too few arguments to member function %q#D"),
3413 ? G_("too many arguments to function %q#D")
3414 : G_("too few arguments to function %q#D"),
3416 inform (DECL_SOURCE_LOCATION (fndecl),
3420 error_at (loc, too_many_p ? G_("too many arguments to function")
3421 : G_("too few arguments to function"));
3424 /* Convert the actual parameter expressions in the list VALUES to the
3425 types in the list TYPELIST. The converted expressions are stored
3426 back in the VALUES vector.
3427 If parmdecls is exhausted, or when an element has NULL as its type,
3428 perform the default conversions.
3430 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3432 This is also where warnings about wrong number of args are generated.
3434 Returns the actual number of arguments processed (which might be less
3435 than the length of the vector), or -1 on error.
3437 In C++, unspecified trailing parameters can be filled in with their
3438 default arguments, if such were specified. Do so here. */
3441 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3442 int flags, tsubst_flags_t complain)
3447 /* Argument passing is always copy-initialization. */
3448 flags |= LOOKUP_ONLYCONVERTING;
3450 for (i = 0, typetail = typelist;
3451 i < VEC_length (tree, *values);
3454 tree type = typetail ? TREE_VALUE (typetail) : 0;
3455 tree val = VEC_index (tree, *values, i);
3457 if (val == error_mark_node || type == error_mark_node)
3460 if (type == void_type_node)
3462 if (complain & tf_error)
3464 warn_args_num (input_location, fndecl, /*too_many_p=*/true);
3471 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3472 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3473 if (TREE_CODE (val) == NOP_EXPR
3474 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3475 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3476 val = TREE_OPERAND (val, 0);
3478 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3480 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3481 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3482 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3483 val = decay_conversion (val);
3486 if (val == error_mark_node)
3491 /* Formal parm type is specified by a function prototype. */
3494 if (!COMPLETE_TYPE_P (complete_type (type)))
3496 if (complain & tf_error)
3499 error ("parameter %P of %qD has incomplete type %qT",
3502 error ("parameter %P has incomplete type %qT", i, type);
3504 parmval = error_mark_node;
3508 parmval = convert_for_initialization
3509 (NULL_TREE, type, val, flags,
3510 ICR_ARGPASS, fndecl, i, complain);
3511 parmval = convert_for_arg_passing (type, parmval);
3514 if (parmval == error_mark_node)
3517 VEC_replace (tree, *values, i, parmval);
3521 if (fndecl && DECL_BUILT_IN (fndecl)
3522 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3523 /* Don't do ellipsis conversion for __built_in_constant_p
3524 as this will result in spurious errors for non-trivial
3526 val = require_complete_type (val);
3528 val = convert_arg_to_ellipsis (val);
3530 VEC_replace (tree, *values, i, val);
3534 typetail = TREE_CHAIN (typetail);
3537 if (typetail != 0 && typetail != void_list_node)
3539 /* See if there are default arguments that can be used. Because
3540 we hold default arguments in the FUNCTION_TYPE (which is so
3541 wrong), we can see default parameters here from deduced
3542 contexts (and via typeof) for indirect function calls.
3543 Fortunately we know whether we have a function decl to
3544 provide default arguments in a language conformant
3546 if (fndecl && TREE_PURPOSE (typetail)
3547 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3549 for (; typetail != void_list_node; ++i)
3552 = convert_default_arg (TREE_VALUE (typetail),
3553 TREE_PURPOSE (typetail),
3556 if (parmval == error_mark_node)
3559 VEC_safe_push (tree, gc, *values, parmval);
3560 typetail = TREE_CHAIN (typetail);
3561 /* ends with `...'. */
3562 if (typetail == NULL_TREE)
3568 if (complain & tf_error)
3569 warn_args_num (input_location, fndecl, /*too_many_p=*/false);
3577 /* Build a binary-operation expression, after performing default
3578 conversions on the operands. CODE is the kind of expression to
3579 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3580 are the tree codes which correspond to ARG1 and ARG2 when issuing
3581 warnings about possibly misplaced parentheses. They may differ
3582 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3583 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3584 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3585 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3586 ARG2_CODE as ERROR_MARK. */
3589 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3590 tree arg2, enum tree_code arg2_code, bool *overloaded_p,
3591 tsubst_flags_t complain)
3600 if (processing_template_decl)
3602 if (type_dependent_expression_p (arg1)
3603 || type_dependent_expression_p (arg2))
3604 return build_min_nt (code, arg1, arg2);
3605 arg1 = build_non_dependent_expr (arg1);
3606 arg2 = build_non_dependent_expr (arg2);
3609 if (code == DOTSTAR_EXPR)
3610 expr = build_m_component_ref (arg1, arg2);
3612 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3613 overloaded_p, complain);
3615 /* Check for cases such as x+y<<z which users are likely to
3616 misinterpret. But don't warn about obj << x + y, since that is a
3617 common idiom for I/O. */
3618 if (warn_parentheses
3619 && (complain & tf_warning)
3620 && !processing_template_decl
3621 && !error_operand_p (arg1)
3622 && !error_operand_p (arg2)
3623 && (code != LSHIFT_EXPR
3624 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3625 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3627 if (processing_template_decl && expr != error_mark_node)
3628 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3633 /* Build and return an ARRAY_REF expression. */
3636 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3638 tree orig_arg1 = arg1;
3639 tree orig_arg2 = arg2;
3642 if (processing_template_decl)
3644 if (type_dependent_expression_p (arg1)
3645 || type_dependent_expression_p (arg2))
3646 return build_min_nt (ARRAY_REF, arg1, arg2,
3647 NULL_TREE, NULL_TREE);
3648 arg1 = build_non_dependent_expr (arg1);
3649 arg2 = build_non_dependent_expr (arg2);
3652 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3653 /*overloaded_p=*/NULL, complain);
3655 if (processing_template_decl && expr != error_mark_node)
3656 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3657 NULL_TREE, NULL_TREE);
3661 /* For the c-common bits. */
3663 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3664 int convert_p ATTRIBUTE_UNUSED)
3666 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3670 /* Build a binary-operation expression without default conversions.
3671 CODE is the kind of expression to build.
3672 LOCATION is the location_t of the operator in the source code.
3673 This function differs from `build' in several ways:
3674 the data type of the result is computed and recorded in it,
3675 warnings are generated if arg data types are invalid,
3676 special handling for addition and subtraction of pointers is known,
3677 and some optimization is done (operations on narrow ints
3678 are done in the narrower type when that gives the same result).
3679 Constant folding is also done before the result is returned.
3681 Note that the operands will never have enumeral types
3682 because either they have just had the default conversions performed
3683 or they have both just been converted to some other type in which
3684 the arithmetic is to be done.
3686 C++: must do special pointer arithmetic when implementing
3687 multiple inheritance, and deal with pointer to member functions. */
3690 cp_build_binary_op (location_t location,
3691 enum tree_code code, tree orig_op0, tree orig_op1,
3692 tsubst_flags_t complain)
3695 enum tree_code code0, code1;
3697 const char *invalid_op_diag;
3699 /* Expression code to give to the expression when it is built.
3700 Normally this is CODE, which is what the caller asked for,
3701 but in some special cases we change it. */
3702 enum tree_code resultcode = code;
3704 /* Data type in which the computation is to be performed.
3705 In the simplest cases this is the common type of the arguments. */
3706 tree result_type = NULL;
3708 /* Nonzero means operands have already been type-converted
3709 in whatever way is necessary.
3710 Zero means they need to be converted to RESULT_TYPE. */
3713 /* Nonzero means create the expression with this type, rather than
3715 tree build_type = 0;
3717 /* Nonzero means after finally constructing the expression
3718 convert it to this type. */
3719 tree final_type = 0;
3723 /* Nonzero if this is an operation like MIN or MAX which can
3724 safely be computed in short if both args are promoted shorts.
3725 Also implies COMMON.
3726 -1 indicates a bitwise operation; this makes a difference
3727 in the exact conditions for when it is safe to do the operation
3728 in a narrower mode. */
3731 /* Nonzero if this is a comparison operation;
3732 if both args are promoted shorts, compare the original shorts.
3733 Also implies COMMON. */
3734 int short_compare = 0;
3736 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3739 /* True if both operands have arithmetic type. */
3740 bool arithmetic_types_p;
3742 /* Apply default conversions. */
3746 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3747 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3748 || code == TRUTH_XOR_EXPR)
3750 if (!really_overloaded_fn (op0))
3751 op0 = decay_conversion (op0);
3752 if (!really_overloaded_fn (op1))
3753 op1 = decay_conversion (op1);
3757 if (!really_overloaded_fn (op0))
3758 op0 = default_conversion (op0);
3759 if (!really_overloaded_fn (op1))
3760 op1 = default_conversion (op1);
3763 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3764 STRIP_TYPE_NOPS (op0);
3765 STRIP_TYPE_NOPS (op1);
3767 /* DTRT if one side is an overloaded function, but complain about it. */
3768 if (type_unknown_p (op0))
3770 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3771 if (t != error_mark_node)
3773 if (complain & tf_error)
3774 permerror (input_location, "assuming cast to type %qT from overloaded function",
3779 if (type_unknown_p (op1))
3781 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3782 if (t != error_mark_node)
3784 if (complain & tf_error)
3785 permerror (input_location, "assuming cast to type %qT from overloaded function",
3791 type0 = TREE_TYPE (op0);
3792 type1 = TREE_TYPE (op1);
3794 /* The expression codes of the data types of the arguments tell us
3795 whether the arguments are integers, floating, pointers, etc. */
3796 code0 = TREE_CODE (type0);
3797 code1 = TREE_CODE (type1);
3799 /* If an error was already reported for one of the arguments,
3800 avoid reporting another error. */
3801 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3802 return error_mark_node;
3804 if ((invalid_op_diag
3805 = targetm.invalid_binary_op (code, type0, type1)))
3807 error (invalid_op_diag);
3808 return error_mark_node;
3811 /* Issue warnings about peculiar, but valid, uses of NULL. */
3812 if ((orig_op0 == null_node || orig_op1 == null_node)
3813 /* It's reasonable to use pointer values as operands of &&
3814 and ||, so NULL is no exception. */
3815 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3816 && ( /* Both are NULL (or 0) and the operation was not a
3817 comparison or a pointer subtraction. */
3818 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3819 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3820 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3821 || (!null_ptr_cst_p (orig_op0)
3822 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3823 || (!null_ptr_cst_p (orig_op1)
3824 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3825 && (complain & tf_warning))
3826 /* Some sort of arithmetic operation involving NULL was
3828 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3833 /* Subtraction of two similar pointers.
3834 We must subtract them as integers, then divide by object size. */
3835 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3836 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3838 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3839 /* In all other cases except pointer - int, the usual arithmetic
3841 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3846 /* The pointer - int case is just like pointer + int; fall
3849 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3850 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3854 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3855 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3856 if (processing_template_decl)
3858 result_type = TREE_TYPE (ptr_operand);
3861 return cp_pointer_int_sum (code,
3872 case TRUNC_DIV_EXPR:
3874 case FLOOR_DIV_EXPR:
3875 case ROUND_DIV_EXPR:
3876 case EXACT_DIV_EXPR:
3877 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3878 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3879 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3880 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3882 enum tree_code tcode0 = code0, tcode1 = code1;
3884 warn_for_div_by_zero (location, op1);
3886 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3887 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3888 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3889 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3891 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3892 resultcode = RDIV_EXPR;
3894 /* When dividing two signed integers, we have to promote to int.
3895 unless we divide by a constant != -1. Note that default
3896 conversion will have been performed on the operands at this
3897 point, so we have to dig out the original type to find out if
3899 shorten = ((TREE_CODE (op0) == NOP_EXPR
3900 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3901 || (TREE_CODE (op1) == INTEGER_CST
3902 && ! integer_all_onesp (op1)));
3911 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3912 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3913 && !VECTOR_FLOAT_TYPE_P (type0)
3914 && !VECTOR_FLOAT_TYPE_P (type1)))
3918 case TRUNC_MOD_EXPR:
3919 case FLOOR_MOD_EXPR:
3920 warn_for_div_by_zero (location, op1);
3922 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3923 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3924 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3926 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3928 /* Although it would be tempting to shorten always here, that loses
3929 on some targets, since the modulo instruction is undefined if the
3930 quotient can't be represented in the computation mode. We shorten
3931 only if unsigned or if dividing by something we know != -1. */
3932 shorten = ((TREE_CODE (op0) == NOP_EXPR
3933 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3934 || (TREE_CODE (op1) == INTEGER_CST
3935 && ! integer_all_onesp (op1)));
3940 case TRUTH_ANDIF_EXPR:
3941 case TRUTH_ORIF_EXPR:
3942 case TRUTH_AND_EXPR:
3944 result_type = boolean_type_node;
3947 /* Shift operations: result has same type as first operand;
3948 always convert second operand to int.
3949 Also set SHORT_SHIFT if shifting rightward. */
3952 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3954 result_type = type0;
3955 if (TREE_CODE (op1) == INTEGER_CST)
3957 if (tree_int_cst_lt (op1, integer_zero_node))
3959 if ((complain & tf_warning)
3960 && c_inhibit_evaluation_warnings == 0)
3961 warning (0, "right shift count is negative");
3965 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3966 && (complain & tf_warning)
3967 && c_inhibit_evaluation_warnings == 0)
3968 warning (0, "right shift count >= width of type");
3971 /* Convert the shift-count to an integer, regardless of
3972 size of value being shifted. */
3973 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3974 op1 = cp_convert (integer_type_node, op1);
3975 /* Avoid converting op1 to result_type later. */
3981 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3983 result_type = type0;
3984 if (TREE_CODE (op1) == INTEGER_CST)
3986 if (tree_int_cst_lt (op1, integer_zero_node))
3988 if ((complain & tf_warning)
3989 && c_inhibit_evaluation_warnings == 0)
3990 warning (0, "left shift count is negative");
3992 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3994 if ((complain & tf_warning)
3995 && c_inhibit_evaluation_warnings == 0)
3996 warning (0, "left shift count >= width of type");
3999 /* Convert the shift-count to an integer, regardless of
4000 size of value being shifted. */
4001 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
4002 op1 = cp_convert (integer_type_node, op1);
4003 /* Avoid converting op1 to result_type later. */
4010 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
4012 result_type = type0;
4013 if (TREE_CODE (op1) == INTEGER_CST)
4015 if (tree_int_cst_lt (op1, integer_zero_node))
4017 if (complain & tf_warning)
4018 warning (0, (code == LROTATE_EXPR)
4019 ? G_("left rotate count is negative")
4020 : G_("right rotate count is negative"));
4022 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
4024 if (complain & tf_warning)
4025 warning (0, (code == LROTATE_EXPR)
4026 ? G_("left rotate count >= width of type")
4027 : G_("right rotate count >= width of type"));
4030 /* Convert the shift-count to an integer, regardless of
4031 size of value being shifted. */
4032 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
4033 op1 = cp_convert (integer_type_node, op1);
4039 if ((complain & tf_warning)
4040 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
4041 warning (OPT_Wfloat_equal,
4042 "comparing floating point with == or != is unsafe");
4043 if ((complain & tf_warning)
4044 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
4045 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
4046 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4048 build_type = boolean_type_node;
4049 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4050 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
4051 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4052 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
4054 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4055 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
4056 result_type = composite_pointer_type (type0, type1, op0, op1,
4057 CPO_COMPARISON, complain);
4058 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
4059 && null_ptr_cst_p (op1))
4061 if (TREE_CODE (op0) == ADDR_EXPR
4062 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
4064 if (complain & tf_warning)
4065 warning (OPT_Waddress, "the address of %qD will never be NULL",
4066 TREE_OPERAND (op0, 0));
4068 result_type = type0;
4070 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
4071 && null_ptr_cst_p (op0))
4073 if (TREE_CODE (op1) == ADDR_EXPR
4074 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
4076 if (complain & tf_warning)
4077 warning (OPT_Waddress, "the address of %qD will never be NULL",
4078 TREE_OPERAND (op1, 0));
4080 result_type = type1;
4082 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4083 /* One of the operands must be of nullptr_t type. */
4084 result_type = TREE_TYPE (nullptr_node);
4085 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4087 result_type = type0;
4088 if (complain & tf_error)
4089 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4091 return error_mark_node;
4093 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4095 result_type = type1;
4096 if (complain & tf_error)
4097 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4099 return error_mark_node;
4101 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
4103 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4104 == ptrmemfunc_vbit_in_delta)
4106 tree pfn0 = pfn_from_ptrmemfunc (op0);
4107 tree delta0 = delta_from_ptrmemfunc (op0);
4108 tree e1 = cp_build_binary_op (location,
4111 fold_convert (TREE_TYPE (pfn0),
4114 tree e2 = cp_build_binary_op (location,
4119 e2 = cp_build_binary_op (location,
4120 EQ_EXPR, e2, integer_zero_node,
4122 op0 = cp_build_binary_op (location,
4123 TRUTH_ANDIF_EXPR, e1, e2,
4125 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
4129 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
4130 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
4132 result_type = TREE_TYPE (op0);
4134 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
4135 return cp_build_binary_op (location, code, op1, op0, complain);
4136 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
4139 /* E will be the final comparison. */
4141 /* E1 and E2 are for scratch. */
4149 type = composite_pointer_type (type0, type1, op0, op1,
4150 CPO_COMPARISON, complain);
4152 if (!same_type_p (TREE_TYPE (op0), type))
4153 op0 = cp_convert_and_check (type, op0);
4154 if (!same_type_p (TREE_TYPE (op1), type))
4155 op1 = cp_convert_and_check (type, op1);
4157 if (op0 == error_mark_node || op1 == error_mark_node)
4158 return error_mark_node;
4160 if (TREE_SIDE_EFFECTS (op0))
4161 op0 = save_expr (op0);
4162 if (TREE_SIDE_EFFECTS (op1))
4163 op1 = save_expr (op1);
4165 pfn0 = pfn_from_ptrmemfunc (op0);
4166 pfn1 = pfn_from_ptrmemfunc (op1);
4167 delta0 = delta_from_ptrmemfunc (op0);
4168 delta1 = delta_from_ptrmemfunc (op1);
4169 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
4170 == ptrmemfunc_vbit_in_delta)
4175 && ((op0.delta == op1.delta)
4176 || (!op0.pfn && op0.delta & 1 == 0
4177 && op1.delta & 1 == 0))
4179 The reason for the `!op0.pfn' bit is that a NULL
4180 pointer-to-member is any member with a zero PFN and
4181 LSB of the DELTA field is 0. */
4183 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
4187 e1 = cp_build_binary_op (location,
4188 EQ_EXPR, e1, integer_zero_node,
4190 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
4194 e2 = cp_build_binary_op (location,
4195 EQ_EXPR, e2, integer_zero_node,
4197 e1 = cp_build_binary_op (location,
4198 TRUTH_ANDIF_EXPR, e2, e1,
4200 e2 = cp_build_binary_op (location, EQ_EXPR,
4202 fold_convert (TREE_TYPE (pfn0),
4205 e2 = cp_build_binary_op (location,
4206 TRUTH_ANDIF_EXPR, e2, e1, complain);
4207 e1 = cp_build_binary_op (location,
4208 EQ_EXPR, delta0, delta1, complain);
4209 e1 = cp_build_binary_op (location,
4210 TRUTH_ORIF_EXPR, e1, e2, complain);
4217 && (!op0.pfn || op0.delta == op1.delta))
4219 The reason for the `!op0.pfn' bit is that a NULL
4220 pointer-to-member is any member with a zero PFN; the
4221 DELTA field is unspecified. */
4223 e1 = cp_build_binary_op (location,
4224 EQ_EXPR, delta0, delta1, complain);
4225 e2 = cp_build_binary_op (location,
4228 fold_convert (TREE_TYPE (pfn0),
4231 e1 = cp_build_binary_op (location,
4232 TRUTH_ORIF_EXPR, e1, e2, complain);
4234 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
4235 e = cp_build_binary_op (location,
4236 TRUTH_ANDIF_EXPR, e2, e1, complain);
4237 if (code == EQ_EXPR)
4239 return cp_build_binary_op (location,
4240 EQ_EXPR, e, integer_zero_node, complain);
4244 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
4245 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
4247 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
4248 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
4256 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
4257 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
4259 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4260 result_type = composite_pointer_type (type0, type1, op0, op1,
4261 CPO_COMPARISON, complain);
4268 if (TREE_CODE (orig_op0) == STRING_CST
4269 || TREE_CODE (orig_op1) == STRING_CST)
4271 if (complain & tf_warning)
4272 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
4275 build_type = boolean_type_node;
4276 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
4277 || code0 == ENUMERAL_TYPE)
4278 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4279 || code1 == ENUMERAL_TYPE))
4281 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
4282 result_type = composite_pointer_type (type0, type1, op0, op1,
4283 CPO_COMPARISON, complain);
4284 else if (code0 == POINTER_TYPE && null_ptr_cst_p (op1))
4285 result_type = type0;
4286 else if (code1 == POINTER_TYPE && null_ptr_cst_p (op0))
4287 result_type = type1;
4288 else if (null_ptr_cst_p (op0) && null_ptr_cst_p (op1))
4289 /* One of the operands must be of nullptr_t type. */
4290 result_type = TREE_TYPE (nullptr_node);
4291 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4293 result_type = type0;
4294 if (complain & tf_error)
4295 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4297 return error_mark_node;
4299 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4301 result_type = type1;
4302 if (complain & tf_error)
4303 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4305 return error_mark_node;
4309 case UNORDERED_EXPR:
4316 build_type = integer_type_node;
4317 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4319 if (complain & tf_error)
4320 error ("unordered comparison on non-floating point argument");
4321 return error_mark_node;
4330 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4331 || code0 == ENUMERAL_TYPE)
4332 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4333 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4334 arithmetic_types_p = 1;
4337 arithmetic_types_p = 0;
4338 /* Vector arithmetic is only allowed when both sides are vectors. */
4339 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4341 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4342 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4345 binary_op_error (location, code, type0, type1);
4346 return error_mark_node;
4348 arithmetic_types_p = 1;
4351 /* Determine the RESULT_TYPE, if it is not already known. */
4353 && arithmetic_types_p
4354 && (shorten || common || short_compare))
4355 result_type = cp_common_type (type0, type1);
4359 if (complain & tf_error)
4360 error ("invalid operands of types %qT and %qT to binary %qO",
4361 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4362 return error_mark_node;
4365 /* If we're in a template, the only thing we need to know is the
4367 if (processing_template_decl)
4369 /* Since the middle-end checks the type when doing a build2, we
4370 need to build the tree in pieces. This built tree will never
4371 get out of the front-end as we replace it when instantiating
4373 tree tmp = build2 (resultcode,
4374 build_type ? build_type : result_type,
4376 TREE_OPERAND (tmp, 0) = op0;
4380 if (arithmetic_types_p)
4382 bool first_complex = (code0 == COMPLEX_TYPE);
4383 bool second_complex = (code1 == COMPLEX_TYPE);
4384 int none_complex = (!first_complex && !second_complex);
4386 /* Adapted from patch for c/24581. */
4387 if (first_complex != second_complex
4388 && (code == PLUS_EXPR
4389 || code == MINUS_EXPR
4390 || code == MULT_EXPR
4391 || (code == TRUNC_DIV_EXPR && first_complex))
4392 && TREE_CODE (TREE_TYPE (result_type)) == REAL_TYPE
4393 && flag_signed_zeros)
4395 /* An operation on mixed real/complex operands must be
4396 handled specially, but the language-independent code can
4397 more easily optimize the plain complex arithmetic if
4398 -fno-signed-zeros. */
4399 tree real_type = TREE_TYPE (result_type);
4403 if (TREE_TYPE (op0) != result_type)
4404 op0 = cp_convert_and_check (result_type, op0);
4405 if (TREE_TYPE (op1) != real_type)
4406 op1 = cp_convert_and_check (real_type, op1);
4410 if (TREE_TYPE (op0) != real_type)
4411 op0 = cp_convert_and_check (real_type, op0);
4412 if (TREE_TYPE (op1) != result_type)
4413 op1 = cp_convert_and_check (result_type, op1);
4415 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
4416 return error_mark_node;
4419 op0 = save_expr (op0);
4420 real = cp_build_unary_op (REALPART_EXPR, op0, 1, complain);
4421 imag = cp_build_unary_op (IMAGPART_EXPR, op0, 1, complain);
4425 case TRUNC_DIV_EXPR:
4426 imag = build2 (resultcode, real_type, imag, op1);
4430 real = build2 (resultcode, real_type, real, op1);
4438 op1 = save_expr (op1);
4439 real = cp_build_unary_op (REALPART_EXPR, op1, 1, complain);
4440 imag = cp_build_unary_op (IMAGPART_EXPR, op1, 1, complain);
4444 imag = build2 (resultcode, real_type, op0, imag);
4447 real = build2 (resultcode, real_type, op0, real);
4450 real = build2 (resultcode, real_type, op0, real);
4451 imag = build1 (NEGATE_EXPR, real_type, imag);
4457 return build2 (COMPLEX_EXPR, result_type, real, imag);
4460 /* For certain operations (which identify themselves by shorten != 0)
4461 if both args were extended from the same smaller type,
4462 do the arithmetic in that type and then extend.
4464 shorten !=0 and !=1 indicates a bitwise operation.
4465 For them, this optimization is safe only if
4466 both args are zero-extended or both are sign-extended.
4467 Otherwise, we might change the result.
4468 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4469 but calculated in (unsigned short) it would be (unsigned short)-1. */
4471 if (shorten && none_complex)
4473 final_type = result_type;
4474 result_type = shorten_binary_op (result_type, op0, op1,
4478 /* Comparison operations are shortened too but differently.
4479 They identify themselves by setting short_compare = 1. */
4483 /* Don't write &op0, etc., because that would prevent op0
4484 from being kept in a register.
4485 Instead, make copies of the our local variables and
4486 pass the copies by reference, then copy them back afterward. */
4487 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4488 enum tree_code xresultcode = resultcode;
4490 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4492 return cp_convert (boolean_type_node, val);
4493 op0 = xop0, op1 = xop1;
4495 resultcode = xresultcode;
4498 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4499 && warn_sign_compare
4500 && !TREE_NO_WARNING (orig_op0)
4501 && !TREE_NO_WARNING (orig_op1)
4502 /* Do not warn until the template is instantiated; we cannot
4503 bound the ranges of the arguments until that point. */
4504 && !processing_template_decl
4505 && (complain & tf_warning)
4506 && c_inhibit_evaluation_warnings == 0)
4508 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4509 result_type, resultcode);
4513 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4514 Then the expression will be built.
4515 It will be given type FINAL_TYPE if that is nonzero;
4516 otherwise, it will be given type RESULT_TYPE. */
4519 if (TREE_TYPE (op0) != result_type)
4520 op0 = cp_convert_and_check (result_type, op0);
4521 if (TREE_TYPE (op1) != result_type)
4522 op1 = cp_convert_and_check (result_type, op1);
4524 if (op0 == error_mark_node || op1 == error_mark_node)
4525 return error_mark_node;
4528 if (build_type == NULL_TREE)
4529 build_type = result_type;
4531 result = build2 (resultcode, build_type, op0, op1);
4532 result = fold_if_not_in_template (result);
4533 if (final_type != 0)
4534 result = cp_convert (final_type, result);
4536 if (TREE_OVERFLOW_P (result)
4537 && !TREE_OVERFLOW_P (op0)
4538 && !TREE_OVERFLOW_P (op1))
4539 overflow_warning (location, result);
4544 /* Return a tree for the sum or difference (RESULTCODE says which)
4545 of pointer PTROP and integer INTOP. */
4548 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4550 tree res_type = TREE_TYPE (ptrop);
4552 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4553 in certain circumstance (when it's valid to do so). So we need
4554 to make sure it's complete. We don't need to check here, if we
4555 can actually complete it at all, as those checks will be done in
4556 pointer_int_sum() anyway. */
4557 complete_type (TREE_TYPE (res_type));
4559 return pointer_int_sum (input_location, resultcode, ptrop,
4560 fold_if_not_in_template (intop));
4563 /* Return a tree for the difference of pointers OP0 and OP1.
4564 The resulting tree has type int. */
4567 pointer_diff (tree op0, tree op1, tree ptrtype)
4570 tree restype = ptrdiff_type_node;
4571 tree target_type = TREE_TYPE (ptrtype);
4573 if (!complete_type_or_else (target_type, NULL_TREE))
4574 return error_mark_node;
4576 if (TREE_CODE (target_type) == VOID_TYPE)
4577 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4578 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4579 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4580 if (TREE_CODE (target_type) == METHOD_TYPE)
4581 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4583 /* First do the subtraction as integers;
4584 then drop through to build the divide operator. */
4586 op0 = cp_build_binary_op (input_location,
4588 cp_convert (restype, op0),
4589 cp_convert (restype, op1),
4590 tf_warning_or_error);
4592 /* This generates an error if op1 is a pointer to an incomplete type. */
4593 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4594 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4596 op1 = (TYPE_PTROB_P (ptrtype)
4597 ? size_in_bytes (target_type)
4598 : integer_one_node);
4600 /* Do the division. */
4602 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4603 return fold_if_not_in_template (result);
4606 /* Construct and perhaps optimize a tree representation
4607 for a unary operation. CODE, a tree_code, specifies the operation
4608 and XARG is the operand. */
4611 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4613 tree orig_expr = xarg;
4617 if (processing_template_decl)
4619 if (type_dependent_expression_p (xarg))
4620 return build_min_nt (code, xarg, NULL_TREE);
4622 xarg = build_non_dependent_expr (xarg);
4627 /* [expr.unary.op] says:
4629 The address of an object of incomplete type can be taken.
4631 (And is just the ordinary address operator, not an overloaded
4632 "operator &".) However, if the type is a template
4633 specialization, we must complete the type at this point so that
4634 an overloaded "operator &" will be available if required. */
4635 if (code == ADDR_EXPR
4636 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4637 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4638 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4639 || (TREE_CODE (xarg) == OFFSET_REF)))
4640 /* Don't look for a function. */;
4642 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4643 /*overloaded_p=*/NULL, complain);
4644 if (!exp && code == ADDR_EXPR)
4646 if (is_overloaded_fn (xarg))
4648 tree fn = get_first_fn (xarg);
4649 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4651 error (DECL_CONSTRUCTOR_P (fn)
4652 ? G_("taking address of constructor %qE")
4653 : G_("taking address of destructor %qE"),
4655 return error_mark_node;
4659 /* A pointer to member-function can be formed only by saying
4661 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4662 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4664 if (TREE_CODE (xarg) != OFFSET_REF
4665 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4667 error ("invalid use of %qE to form a pointer-to-member-function",
4669 if (TREE_CODE (xarg) != OFFSET_REF)
4670 inform (input_location, " a qualified-id is required");
4671 return error_mark_node;
4675 error ("parentheses around %qE cannot be used to form a"
4676 " pointer-to-member-function",
4678 PTRMEM_OK_P (xarg) = 1;
4682 if (TREE_CODE (xarg) == OFFSET_REF)
4684 ptrmem = PTRMEM_OK_P (xarg);
4686 if (!ptrmem && !flag_ms_extensions
4687 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4689 /* A single non-static member, make sure we don't allow a
4690 pointer-to-member. */
4691 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4692 TREE_OPERAND (xarg, 0),
4693 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4694 PTRMEM_OK_P (xarg) = ptrmem;
4697 else if (TREE_CODE (xarg) == TARGET_EXPR && (complain & tf_warning))
4698 warning (0, "taking address of temporary");
4699 exp = cp_build_unary_op (ADDR_EXPR, xarg, 0, complain);
4702 if (processing_template_decl && exp != error_mark_node)
4703 exp = build_min_non_dep (code, exp, orig_expr,
4704 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4705 if (TREE_CODE (exp) == ADDR_EXPR)
4706 PTRMEM_OK_P (exp) = ptrmem;
4710 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4711 constants, where a null value is represented by an INTEGER_CST of
4715 cp_truthvalue_conversion (tree expr)
4717 tree type = TREE_TYPE (expr);
4718 if (TYPE_PTRMEM_P (type))
4719 return build_binary_op (EXPR_LOCATION (expr),
4720 NE_EXPR, expr, integer_zero_node, 1);
4722 return c_common_truthvalue_conversion (input_location, expr);
4725 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4728 condition_conversion (tree expr)
4731 if (processing_template_decl)
4733 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4734 tf_warning_or_error, LOOKUP_NORMAL);
4735 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4739 /* Returns the address of T. This function will fold away
4740 ADDR_EXPR of INDIRECT_REF. */
4743 build_address (tree t)
4745 if (error_operand_p (t) || !cxx_mark_addressable (t))
4746 return error_mark_node;
4747 t = build_fold_addr_expr (t);
4748 if (TREE_CODE (t) != ADDR_EXPR)
4753 /* Returns the address of T with type TYPE. */
4756 build_typed_address (tree t, tree type)
4758 if (error_operand_p (t) || !cxx_mark_addressable (t))
4759 return error_mark_node;
4760 t = build_fold_addr_expr_with_type (t, type);
4761 if (TREE_CODE (t) != ADDR_EXPR)
4766 /* Return a NOP_EXPR converting EXPR to TYPE. */
4769 build_nop (tree type, tree expr)
4771 if (type == error_mark_node || error_operand_p (expr))
4773 return build1 (NOP_EXPR, type, expr);
4776 /* C++: Must handle pointers to members.
4778 Perhaps type instantiation should be extended to handle conversion
4779 from aggregates to types we don't yet know we want? (Or are those
4780 cases typically errors which should be reported?)
4782 NOCONVERT nonzero suppresses the default promotions
4783 (such as from short to int). */
4786 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
4787 tsubst_flags_t complain)
4789 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4792 const char *errstring = NULL;
4794 const char *invalid_op_diag;
4796 if (!arg || error_operand_p (arg))
4797 return error_mark_node;
4799 if ((invalid_op_diag
4800 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
4805 error (invalid_op_diag);
4806 return error_mark_node;
4811 case UNARY_PLUS_EXPR:
4814 int flags = WANT_ARITH | WANT_ENUM;
4815 /* Unary plus (but not unary minus) is allowed on pointers. */
4816 if (code == UNARY_PLUS_EXPR)
4817 flags |= WANT_POINTER;
4818 arg = build_expr_type_conversion (flags, arg, true);
4820 errstring = (code == NEGATE_EXPR
4821 ? _("wrong type argument to unary minus")
4822 : _("wrong type argument to unary plus"));
4825 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4826 arg = perform_integral_promotions (arg);
4828 /* Make sure the result is not an lvalue: a unary plus or minus
4829 expression is always a rvalue. */
4836 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4840 arg = default_conversion (arg);
4842 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
4843 | WANT_VECTOR_OR_COMPLEX,
4845 errstring = _("wrong type argument to bit-complement");
4846 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4847 arg = perform_integral_promotions (arg);
4851 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4852 errstring = _("wrong type argument to abs");
4853 else if (!noconvert)
4854 arg = default_conversion (arg);
4858 /* Conjugating a real value is a no-op, but allow it anyway. */
4859 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4860 errstring = _("wrong type argument to conjugation");
4861 else if (!noconvert)
4862 arg = default_conversion (arg);
4865 case TRUTH_NOT_EXPR:
4866 arg = perform_implicit_conversion (boolean_type_node, arg,
4868 val = invert_truthvalue_loc (input_location, arg);
4869 if (arg != error_mark_node)
4871 errstring = _("in argument to unary !");
4878 if (TREE_CODE (arg) == COMPLEX_CST)
4879 return TREE_REALPART (arg);
4880 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4882 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4883 return fold_if_not_in_template (arg);
4889 if (TREE_CODE (arg) == COMPLEX_CST)
4890 return TREE_IMAGPART (arg);
4891 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4893 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4894 return fold_if_not_in_template (arg);
4897 return cp_convert (TREE_TYPE (arg), integer_zero_node);
4899 case PREINCREMENT_EXPR:
4900 case POSTINCREMENT_EXPR:
4901 case PREDECREMENT_EXPR:
4902 case POSTDECREMENT_EXPR:
4903 /* Handle complex lvalues (when permitted)
4904 by reduction to simpler cases. */
4906 val = unary_complex_lvalue (code, arg);
4910 arg = mark_lvalue_use (arg);
4912 /* Increment or decrement the real part of the value,
4913 and don't change the imaginary part. */
4914 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4918 arg = stabilize_reference (arg);
4919 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
4920 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
4921 real = cp_build_unary_op (code, real, 1, complain);
4922 if (real == error_mark_node || imag == error_mark_node)
4923 return error_mark_node;
4924 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
4928 /* Report invalid types. */
4930 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4933 if (code == PREINCREMENT_EXPR)
4934 errstring = _("no pre-increment operator for type");
4935 else if (code == POSTINCREMENT_EXPR)
4936 errstring = _("no post-increment operator for type");
4937 else if (code == PREDECREMENT_EXPR)
4938 errstring = _("no pre-decrement operator for type");
4940 errstring = _("no post-decrement operator for type");
4943 else if (arg == error_mark_node)
4944 return error_mark_node;
4946 /* Report something read-only. */
4948 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
4949 || TREE_READONLY (arg))
4951 if (complain & tf_error)
4952 readonly_error (arg, ((code == PREINCREMENT_EXPR
4953 || code == POSTINCREMENT_EXPR)
4954 ? REK_INCREMENT : REK_DECREMENT));
4956 return error_mark_node;
4961 tree declared_type = unlowered_expr_type (arg);
4963 argtype = TREE_TYPE (arg);
4965 /* ARM $5.2.5 last annotation says this should be forbidden. */
4966 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4968 if (complain & tf_error)
4969 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4970 ? G_("ISO C++ forbids incrementing an enum")
4971 : G_("ISO C++ forbids decrementing an enum"));
4973 return error_mark_node;
4976 /* Compute the increment. */
4978 if (TREE_CODE (argtype) == POINTER_TYPE)
4980 tree type = complete_type (TREE_TYPE (argtype));
4982 if (!COMPLETE_OR_VOID_TYPE_P (type))
4984 if (complain & tf_error)
4985 error (((code == PREINCREMENT_EXPR
4986 || code == POSTINCREMENT_EXPR))
4987 ? G_("cannot increment a pointer to incomplete type %qT")
4988 : G_("cannot decrement a pointer to incomplete type %qT"),
4989 TREE_TYPE (argtype));
4991 return error_mark_node;
4993 else if ((pedantic || warn_pointer_arith)
4994 && !TYPE_PTROB_P (argtype))
4996 if (complain & tf_error)
4997 permerror (input_location, (code == PREINCREMENT_EXPR
4998 || code == POSTINCREMENT_EXPR)
4999 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
5000 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
5003 return error_mark_node;
5006 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
5009 inc = integer_one_node;
5011 inc = cp_convert (argtype, inc);
5013 /* Complain about anything else that is not a true lvalue. */
5014 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
5015 || code == POSTINCREMENT_EXPR)
5016 ? lv_increment : lv_decrement),
5018 return error_mark_node;
5020 /* Forbid using -- on `bool'. */
5021 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
5023 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
5025 if (complain & tf_error)
5026 error ("invalid use of Boolean expression as operand "
5027 "to %<operator--%>");
5028 return error_mark_node;
5030 val = boolean_increment (code, arg);
5033 val = build2 (code, TREE_TYPE (arg), arg, inc);
5035 TREE_SIDE_EFFECTS (val) = 1;
5040 /* Note that this operation never does default_conversion
5041 regardless of NOCONVERT. */
5043 argtype = lvalue_type (arg);
5045 arg = mark_lvalue_use (arg);
5047 if (TREE_CODE (arg) == OFFSET_REF)
5050 if (TREE_CODE (argtype) == REFERENCE_TYPE)
5052 tree type = build_pointer_type (TREE_TYPE (argtype));
5053 arg = build1 (CONVERT_EXPR, type, arg);
5056 else if (pedantic && DECL_MAIN_P (arg))
5059 /* Apparently a lot of autoconf scripts for C++ packages do this,
5060 so only complain if -pedantic. */
5061 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
5062 pedwarn (input_location, OPT_pedantic,
5063 "ISO C++ forbids taking address of function %<::main%>");
5064 else if (flag_pedantic_errors)
5065 return error_mark_node;
5068 /* Let &* cancel out to simplify resulting code. */
5069 if (TREE_CODE (arg) == INDIRECT_REF)
5071 /* We don't need to have `current_class_ptr' wrapped in a
5072 NON_LVALUE_EXPR node. */
5073 if (arg == current_class_ref)
5074 return current_class_ptr;
5076 arg = TREE_OPERAND (arg, 0);
5077 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
5079 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
5080 arg = build1 (CONVERT_EXPR, type, arg);
5083 /* Don't let this be an lvalue. */
5088 /* ??? Cope with user tricks that amount to offsetof. */
5089 if (TREE_CODE (argtype) != FUNCTION_TYPE
5090 && TREE_CODE (argtype) != METHOD_TYPE
5091 && argtype != unknown_type_node
5092 && (val = get_base_address (arg))
5093 && TREE_CODE (val) == INDIRECT_REF
5094 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
5096 tree type = build_pointer_type (argtype);
5097 tree op0 = fold_convert (type, TREE_OPERAND (val, 0));
5098 tree op1 = fold_convert (sizetype, fold_offsetof (arg, val));
5099 return fold_build2 (POINTER_PLUS_EXPR, type, op0, op1);
5102 /* Uninstantiated types are all functions. Taking the
5103 address of a function is a no-op, so just return the
5106 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
5107 || !IDENTIFIER_OPNAME_P (arg));
5109 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
5110 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
5112 /* They're trying to take the address of a unique non-static
5113 member function. This is ill-formed (except in MS-land),
5114 but let's try to DTRT.
5115 Note: We only handle unique functions here because we don't
5116 want to complain if there's a static overload; non-unique
5117 cases will be handled by instantiate_type. But we need to
5118 handle this case here to allow casts on the resulting PMF.
5119 We could defer this in non-MS mode, but it's easier to give
5120 a useful error here. */
5122 /* Inside constant member functions, the `this' pointer
5123 contains an extra const qualifier. TYPE_MAIN_VARIANT
5124 is used here to remove this const from the diagnostics
5125 and the created OFFSET_REF. */
5126 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
5127 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
5130 if (! flag_ms_extensions)
5132 tree name = DECL_NAME (fn);
5133 if (!(complain & tf_error))
5134 return error_mark_node;
5135 else if (current_class_type
5136 && TREE_OPERAND (arg, 0) == current_class_ref)
5137 /* An expression like &memfn. */
5138 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
5139 " or parenthesized non-static member function to form"
5140 " a pointer to member function. Say %<&%T::%D%>",
5143 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
5144 " function to form a pointer to member function."
5148 arg = build_offset_ref (base, fn, /*address_p=*/true);
5152 if (type_unknown_p (arg))
5153 return build1 (ADDR_EXPR, unknown_type_node, arg);
5155 /* Handle complex lvalues (when permitted)
5156 by reduction to simpler cases. */
5157 val = unary_complex_lvalue (code, arg);
5161 switch (TREE_CODE (arg))
5165 case FIX_TRUNC_EXPR:
5166 /* Even if we're not being pedantic, we cannot allow this
5167 extension when we're instantiating in a SFINAE
5169 if (! lvalue_p (arg) && complain == tf_none)
5171 if (complain & tf_error)
5172 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
5174 return error_mark_node;
5179 arg = BASELINK_FUNCTIONS (arg);
5183 arg = OVL_CURRENT (arg);
5187 /* Turn a reference to a non-static data member into a
5188 pointer-to-member. */
5193 if (!PTRMEM_OK_P (arg))
5194 return cp_build_unary_op (code, arg, 0, complain);
5196 t = TREE_OPERAND (arg, 1);
5197 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
5199 if (complain & tf_error)
5200 error ("cannot create pointer to reference member %qD", t);
5201 return error_mark_node;
5204 type = build_ptrmem_type (context_for_name_lookup (t),
5206 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
5214 /* Anything not already handled and not a true memory reference
5216 if (TREE_CODE (argtype) != FUNCTION_TYPE
5217 && TREE_CODE (argtype) != METHOD_TYPE
5218 && TREE_CODE (arg) != OFFSET_REF
5219 && !lvalue_or_else (arg, lv_addressof, complain))
5220 return error_mark_node;
5222 if (argtype != error_mark_node)
5223 argtype = build_pointer_type (argtype);
5225 /* In a template, we are processing a non-dependent expression
5226 so we can just form an ADDR_EXPR with the correct type. */
5227 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
5229 val = build_address (arg);
5230 if (TREE_CODE (arg) == OFFSET_REF)
5231 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
5233 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
5235 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
5237 /* We can only get here with a single static member
5239 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
5240 && DECL_STATIC_FUNCTION_P (fn));
5242 val = build_address (fn);
5243 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
5244 /* Do not lose object's side effects. */
5245 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
5246 TREE_OPERAND (arg, 0), val);
5248 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
5250 if (complain & tf_error)
5251 error ("attempt to take address of bit-field structure member %qD",
5252 TREE_OPERAND (arg, 1));
5253 return error_mark_node;
5257 tree object = TREE_OPERAND (arg, 0);
5258 tree field = TREE_OPERAND (arg, 1);
5259 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5260 (TREE_TYPE (object), decl_type_context (field)));
5261 val = build_address (arg);
5264 if (TREE_CODE (argtype) == POINTER_TYPE
5265 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
5267 build_ptrmemfunc_type (argtype);
5268 val = build_ptrmemfunc (argtype, val, 0,
5270 tf_warning_or_error);
5282 argtype = TREE_TYPE (arg);
5283 return fold_if_not_in_template (build1 (code, argtype, arg));
5286 if (complain & tf_error)
5287 error ("%s", errstring);
5288 return error_mark_node;
5291 /* Hook for the c-common bits that build a unary op. */
5293 build_unary_op (location_t location ATTRIBUTE_UNUSED,
5294 enum tree_code code, tree xarg, int noconvert)
5296 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
5299 /* Apply unary lvalue-demanding operator CODE to the expression ARG
5300 for certain kinds of expressions which are not really lvalues
5301 but which we can accept as lvalues.
5303 If ARG is not a kind of expression we can handle, return
5307 unary_complex_lvalue (enum tree_code code, tree arg)
5309 /* Inside a template, making these kinds of adjustments is
5310 pointless; we are only concerned with the type of the
5312 if (processing_template_decl)
5315 /* Handle (a, b) used as an "lvalue". */
5316 if (TREE_CODE (arg) == COMPOUND_EXPR)
5318 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
5319 tf_warning_or_error);
5320 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5321 TREE_OPERAND (arg, 0), real_result);
5324 /* Handle (a ? b : c) used as an "lvalue". */
5325 if (TREE_CODE (arg) == COND_EXPR
5326 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
5327 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
5329 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
5330 if (TREE_CODE (arg) == MODIFY_EXPR
5331 || TREE_CODE (arg) == PREINCREMENT_EXPR
5332 || TREE_CODE (arg) == PREDECREMENT_EXPR)
5334 tree lvalue = TREE_OPERAND (arg, 0);
5335 if (TREE_SIDE_EFFECTS (lvalue))
5337 lvalue = stabilize_reference (lvalue);
5338 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
5339 lvalue, TREE_OPERAND (arg, 1));
5341 return unary_complex_lvalue
5342 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
5345 if (code != ADDR_EXPR)
5348 /* Handle (a = b) used as an "lvalue" for `&'. */
5349 if (TREE_CODE (arg) == MODIFY_EXPR
5350 || TREE_CODE (arg) == INIT_EXPR)
5352 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
5353 tf_warning_or_error);
5354 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
5356 TREE_NO_WARNING (arg) = 1;
5360 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
5361 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
5362 || TREE_CODE (arg) == OFFSET_REF)
5365 /* We permit compiler to make function calls returning
5366 objects of aggregate type look like lvalues. */
5370 if (TREE_CODE (targ) == SAVE_EXPR)
5371 targ = TREE_OPERAND (targ, 0);
5373 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
5375 if (TREE_CODE (arg) == SAVE_EXPR)
5378 targ = build_cplus_new (TREE_TYPE (arg), arg);
5379 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5382 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5383 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5384 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5387 /* Don't let anything else be handled specially. */
5391 /* Mark EXP saying that we need to be able to take the
5392 address of it; it should not be allocated in a register.
5393 Value is true if successful.
5395 C++: we do not allow `current_class_ptr' to be addressable. */
5398 cxx_mark_addressable (tree exp)
5403 switch (TREE_CODE (x))
5410 x = TREE_OPERAND (x, 0);
5414 if (x == current_class_ptr)
5416 error ("cannot take the address of %<this%>, which is an rvalue expression");
5417 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5423 /* Caller should not be trying to mark initialized
5424 constant fields addressable. */
5425 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5426 || DECL_IN_AGGR_P (x) == 0
5428 || DECL_EXTERNAL (x));
5433 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5434 && !DECL_ARTIFICIAL (x))
5436 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5439 ("address of explicit register variable %qD requested", x);
5442 else if (extra_warnings)
5444 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5446 TREE_ADDRESSABLE (x) = 1;
5450 TREE_ADDRESSABLE (x) = 1;
5454 TREE_ADDRESSABLE (x) = 1;
5458 TREE_ADDRESSABLE (x) = 1;
5459 cxx_mark_addressable (TREE_OPERAND (x, 0));
5467 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5470 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5471 tsubst_flags_t complain)
5473 tree orig_ifexp = ifexp;
5474 tree orig_op1 = op1;
5475 tree orig_op2 = op2;
5478 if (processing_template_decl)
5480 /* The standard says that the expression is type-dependent if
5481 IFEXP is type-dependent, even though the eventual type of the
5482 expression doesn't dependent on IFEXP. */
5483 if (type_dependent_expression_p (ifexp)
5484 /* As a GNU extension, the middle operand may be omitted. */
5485 || (op1 && type_dependent_expression_p (op1))
5486 || type_dependent_expression_p (op2))
5487 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5488 ifexp = build_non_dependent_expr (ifexp);
5490 op1 = build_non_dependent_expr (op1);
5491 op2 = build_non_dependent_expr (op2);
5494 expr = build_conditional_expr (ifexp, op1, op2, complain);
5495 if (processing_template_decl && expr != error_mark_node)
5496 return build_min_non_dep (COND_EXPR, expr,
5497 orig_ifexp, orig_op1, orig_op2);
5501 /* Given a list of expressions, return a compound expression
5502 that performs them all and returns the value of the last of them. */
5505 build_x_compound_expr_from_list (tree list, expr_list_kind exp,
5506 tsubst_flags_t complain)
5508 tree expr = TREE_VALUE (list);
5510 if (TREE_CHAIN (list))
5512 if (complain & tf_error)
5516 permerror (input_location, "expression list treated as compound "
5517 "expression in initializer");
5520 permerror (input_location, "expression list treated as compound "
5521 "expression in mem-initializer");
5524 permerror (input_location, "expression list treated as compound "
5525 "expression in functional cast");
5531 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5532 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5539 /* Like build_x_compound_expr_from_list, but using a VEC. */
5542 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5544 if (VEC_empty (tree, vec))
5546 else if (VEC_length (tree, vec) == 1)
5547 return VEC_index (tree, vec, 0);
5555 permerror (input_location,
5556 "%s expression list treated as compound expression",
5559 expr = VEC_index (tree, vec, 0);
5560 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5561 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5567 /* Handle overloading of the ',' operator when needed. */
5570 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5573 tree orig_op1 = op1;
5574 tree orig_op2 = op2;
5576 if (processing_template_decl)
5578 if (type_dependent_expression_p (op1)
5579 || type_dependent_expression_p (op2))
5580 return build_min_nt (COMPOUND_EXPR, op1, op2);
5581 op1 = build_non_dependent_expr (op1);
5582 op2 = build_non_dependent_expr (op2);
5585 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5586 /*overloaded_p=*/NULL, complain);
5588 result = cp_build_compound_expr (op1, op2, complain);
5590 if (processing_template_decl && result != error_mark_node)
5591 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5596 /* Like cp_build_compound_expr, but for the c-common bits. */
5599 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5601 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5604 /* Build a compound expression. */
5607 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5609 lhs = convert_to_void (lhs, ICV_LEFT_OF_COMMA, complain);
5611 if (lhs == error_mark_node || rhs == error_mark_node)
5612 return error_mark_node;
5614 if (TREE_CODE (rhs) == TARGET_EXPR)
5616 /* If the rhs is a TARGET_EXPR, then build the compound
5617 expression inside the target_expr's initializer. This
5618 helps the compiler to eliminate unnecessary temporaries. */
5619 tree init = TREE_OPERAND (rhs, 1);
5621 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5622 TREE_OPERAND (rhs, 1) = init;
5627 if (type_unknown_p (rhs))
5629 error ("no context to resolve type of %qE", rhs);
5630 return error_mark_node;
5633 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5636 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5637 casts away constness. CAST gives the type of cast.
5639 ??? This function warns for casting away any qualifier not just
5640 const. We would like to specify exactly what qualifiers are casted
5645 check_for_casting_away_constness (tree src_type, tree dest_type,
5646 enum tree_code cast)
5648 /* C-style casts are allowed to cast away constness. With
5649 WARN_CAST_QUAL, we still want to issue a warning. */
5650 if (cast == CAST_EXPR && !warn_cast_qual)
5653 if (!casts_away_constness (src_type, dest_type))
5659 warning (OPT_Wcast_qual,
5660 "cast from type %qT to type %qT casts away qualifiers",
5661 src_type, dest_type);
5664 case STATIC_CAST_EXPR:
5665 error ("static_cast from type %qT to type %qT casts away qualifiers",
5666 src_type, dest_type);
5669 case REINTERPRET_CAST_EXPR:
5670 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5671 src_type, dest_type);
5678 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5679 (another pointer-to-member type in the same hierarchy) and return
5680 the converted expression. If ALLOW_INVERSE_P is permitted, a
5681 pointer-to-derived may be converted to pointer-to-base; otherwise,
5682 only the other direction is permitted. If C_CAST_P is true, this
5683 conversion is taking place as part of a C-style cast. */
5686 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5687 bool c_cast_p, tsubst_flags_t complain)
5689 if (TYPE_PTRMEM_P (type))
5693 if (TREE_CODE (expr) == PTRMEM_CST)
5694 expr = cplus_expand_constant (expr);
5695 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5696 TYPE_PTRMEM_CLASS_TYPE (type),
5698 c_cast_p, complain);
5699 if (delta == error_mark_node)
5700 return error_mark_node;
5702 if (!integer_zerop (delta))
5704 tree cond, op1, op2;
5706 cond = cp_build_binary_op (input_location,
5709 build_int_cst (TREE_TYPE (expr), -1),
5710 tf_warning_or_error);
5711 op1 = build_nop (ptrdiff_type_node, expr);
5712 op2 = cp_build_binary_op (input_location,
5713 PLUS_EXPR, op1, delta,
5714 tf_warning_or_error);
5716 expr = fold_build3_loc (input_location,
5717 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5721 return build_nop (type, expr);
5724 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5725 allow_inverse_p, c_cast_p, complain);
5728 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5729 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5730 Otherwise, return EXPR unchanged. */
5733 ignore_overflows (tree expr, tree orig)
5735 if (TREE_CODE (expr) == INTEGER_CST
5736 && CONSTANT_CLASS_P (orig)
5737 && TREE_CODE (orig) != STRING_CST
5738 && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig))
5740 if (!TREE_OVERFLOW (orig))
5741 /* Ensure constant sharing. */
5742 expr = build_int_cst_wide (TREE_TYPE (expr),
5743 TREE_INT_CST_LOW (expr),
5744 TREE_INT_CST_HIGH (expr));
5747 /* Avoid clobbering a shared constant. */
5748 expr = copy_node (expr);
5749 TREE_OVERFLOW (expr) = TREE_OVERFLOW (orig);
5755 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5756 this static_cast is being attempted as one of the possible casts
5757 allowed by a C-style cast. (In that case, accessibility of base
5758 classes is not considered, and it is OK to cast away
5759 constness.) Return the result of the cast. *VALID_P is set to
5760 indicate whether or not the cast was valid. */
5763 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5764 bool *valid_p, tsubst_flags_t complain)
5770 /* Assume the cast is valid. */
5773 intype = TREE_TYPE (expr);
5775 /* Save casted types in the function's used types hash table. */
5776 used_types_insert (type);
5778 /* [expr.static.cast]
5780 An lvalue of type "cv1 B", where B is a class type, can be cast
5781 to type "reference to cv2 D", where D is a class derived (clause
5782 _class.derived_) from B, if a valid standard conversion from
5783 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5784 same cv-qualification as, or greater cv-qualification than, cv1,
5785 and B is not a virtual base class of D. */
5786 /* We check this case before checking the validity of "TYPE t =
5787 EXPR;" below because for this case:
5790 struct D : public B { D(const B&); };
5792 void f() { static_cast<const D&>(b); }
5794 we want to avoid constructing a new D. The standard is not
5795 completely clear about this issue, but our interpretation is
5796 consistent with other compilers. */
5797 if (TREE_CODE (type) == REFERENCE_TYPE
5798 && CLASS_TYPE_P (TREE_TYPE (type))
5799 && CLASS_TYPE_P (intype)
5800 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5801 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5802 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5803 build_pointer_type (TYPE_MAIN_VARIANT
5804 (TREE_TYPE (type))))
5806 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5810 /* There is a standard conversion from "D*" to "B*" even if "B"
5811 is ambiguous or inaccessible. If this is really a
5812 static_cast, then we check both for inaccessibility and
5813 ambiguity. However, if this is a static_cast being performed
5814 because the user wrote a C-style cast, then accessibility is
5816 base = lookup_base (TREE_TYPE (type), intype,
5817 c_cast_p ? ba_unique : ba_check,
5820 /* Convert from "B*" to "D*". This function will check that "B"
5821 is not a virtual base of "D". */
5822 expr = build_base_path (MINUS_EXPR, build_address (expr),
5823 base, /*nonnull=*/false);
5824 /* Convert the pointer to a reference -- but then remember that
5825 there are no expressions with reference type in C++. */
5826 return convert_from_reference (cp_fold_convert (type, expr));
5829 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5830 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5831 if (TREE_CODE (type) == REFERENCE_TYPE
5832 && TYPE_REF_IS_RVALUE (type)
5833 && real_lvalue_p (expr)
5834 && reference_related_p (TREE_TYPE (type), intype)
5835 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5837 expr = build_typed_address (expr, type);
5838 return convert_from_reference (expr);
5843 /* Resolve overloaded address here rather than once in
5844 implicit_conversion and again in the inverse code below. */
5845 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5847 expr = instantiate_type (type, expr, complain);
5848 intype = TREE_TYPE (expr);
5851 /* [expr.static.cast]
5853 An expression e can be explicitly converted to a type T using a
5854 static_cast of the form static_cast<T>(e) if the declaration T
5855 t(e);" is well-formed, for some invented temporary variable
5857 result = perform_direct_initialization_if_possible (type, expr,
5858 c_cast_p, complain);
5861 result = convert_from_reference (result);
5863 /* Ignore any integer overflow caused by the cast. */
5864 result = ignore_overflows (result, orig);
5866 /* [expr.static.cast]
5868 If T is a reference type, the result is an lvalue; otherwise,
5869 the result is an rvalue. */
5870 if (TREE_CODE (type) != REFERENCE_TYPE)
5871 result = rvalue (result);
5875 /* [expr.static.cast]
5877 Any expression can be explicitly converted to type cv void. */
5878 if (TREE_CODE (type) == VOID_TYPE)
5879 return convert_to_void (expr, ICV_CAST, complain);
5881 /* [expr.static.cast]
5883 The inverse of any standard conversion sequence (clause _conv_),
5884 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5885 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5886 (_conv.bool_) conversions, can be performed explicitly using
5887 static_cast subject to the restriction that the explicit
5888 conversion does not cast away constness (_expr.const.cast_), and
5889 the following additional rules for specific cases: */
5890 /* For reference, the conversions not excluded are: integral
5891 promotions, floating point promotion, integral conversions,
5892 floating point conversions, floating-integral conversions,
5893 pointer conversions, and pointer to member conversions. */
5896 A value of integral _or enumeration_ type can be explicitly
5897 converted to an enumeration type. */
5898 /* The effect of all that is that any conversion between any two
5899 types which are integral, floating, or enumeration types can be
5901 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5902 || SCALAR_FLOAT_TYPE_P (type))
5903 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5904 || SCALAR_FLOAT_TYPE_P (intype)))
5906 expr = ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5908 /* Ignore any integer overflow caused by the cast. */
5909 expr = ignore_overflows (expr, orig);
5913 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5914 && CLASS_TYPE_P (TREE_TYPE (type))
5915 && CLASS_TYPE_P (TREE_TYPE (intype))
5916 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5917 (TREE_TYPE (intype))),
5918 build_pointer_type (TYPE_MAIN_VARIANT
5919 (TREE_TYPE (type)))))
5924 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5925 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5926 c_cast_p ? ba_unique : ba_check,
5928 return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
5931 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5932 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5939 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5940 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5942 if (TYPE_PTRMEM_P (type))
5944 t1 = (build_ptrmem_type
5946 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5947 t2 = (build_ptrmem_type
5949 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5956 if (can_convert (t1, t2) || can_convert (t2, t1))
5959 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5960 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5961 c_cast_p, tf_warning_or_error);
5965 /* [expr.static.cast]
5967 An rvalue of type "pointer to cv void" can be explicitly
5968 converted to a pointer to object type. A value of type pointer
5969 to object converted to "pointer to cv void" and back to the
5970 original pointer type will have its original value. */
5971 if (TREE_CODE (intype) == POINTER_TYPE
5972 && VOID_TYPE_P (TREE_TYPE (intype))
5973 && TYPE_PTROB_P (type))
5976 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5977 return build_nop (type, expr);
5981 return error_mark_node;
5984 /* Return an expression representing static_cast<TYPE>(EXPR). */
5987 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5992 if (type == error_mark_node || expr == error_mark_node)
5993 return error_mark_node;
5995 if (processing_template_decl)
5997 expr = build_min (STATIC_CAST_EXPR, type, expr);
5998 /* We don't know if it will or will not have side effects. */
5999 TREE_SIDE_EFFECTS (expr) = 1;
6000 return convert_from_reference (expr);
6003 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6004 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6005 if (TREE_CODE (type) != REFERENCE_TYPE
6006 && TREE_CODE (expr) == NOP_EXPR
6007 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6008 expr = TREE_OPERAND (expr, 0);
6010 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
6015 if (complain & tf_error)
6016 error ("invalid static_cast from type %qT to type %qT",
6017 TREE_TYPE (expr), type);
6018 return error_mark_node;
6021 /* EXPR is an expression with member function or pointer-to-member
6022 function type. TYPE is a pointer type. Converting EXPR to TYPE is
6023 not permitted by ISO C++, but we accept it in some modes. If we
6024 are not in one of those modes, issue a diagnostic. Return the
6025 converted expression. */
6028 convert_member_func_to_ptr (tree type, tree expr)
6033 intype = TREE_TYPE (expr);
6034 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
6035 || TREE_CODE (intype) == METHOD_TYPE);
6037 if (pedantic || warn_pmf2ptr)
6038 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
6039 "converting from %qT to %qT", intype, type);
6041 if (TREE_CODE (intype) == METHOD_TYPE)
6042 expr = build_addr_func (expr);
6043 else if (TREE_CODE (expr) == PTRMEM_CST)
6044 expr = build_address (PTRMEM_CST_MEMBER (expr));
6047 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
6048 decl = build_address (decl);
6049 expr = get_member_function_from_ptrfunc (&decl, expr);
6052 return build_nop (type, expr);
6055 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
6056 If C_CAST_P is true, this reinterpret cast is being done as part of
6057 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
6058 indicate whether or not reinterpret_cast was valid. */
6061 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
6062 bool *valid_p, tsubst_flags_t complain)
6066 /* Assume the cast is invalid. */
6070 if (type == error_mark_node || error_operand_p (expr))
6071 return error_mark_node;
6073 intype = TREE_TYPE (expr);
6075 /* Save casted types in the function's used types hash table. */
6076 used_types_insert (type);
6078 /* [expr.reinterpret.cast]
6079 An lvalue expression of type T1 can be cast to the type
6080 "reference to T2" if an expression of type "pointer to T1" can be
6081 explicitly converted to the type "pointer to T2" using a
6082 reinterpret_cast. */
6083 if (TREE_CODE (type) == REFERENCE_TYPE)
6085 if (! real_lvalue_p (expr))
6087 if (complain & tf_error)
6088 error ("invalid cast of an rvalue expression of type "
6091 return error_mark_node;
6094 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
6095 "B" are related class types; the reinterpret_cast does not
6096 adjust the pointer. */
6097 if (TYPE_PTR_P (intype)
6098 && (complain & tf_warning)
6099 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
6100 COMPARE_BASE | COMPARE_DERIVED)))
6101 warning (0, "casting %qT to %qT does not dereference pointer",
6104 expr = cp_build_unary_op (ADDR_EXPR, expr, 0, complain);
6106 if (warn_strict_aliasing > 2)
6107 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
6109 if (expr != error_mark_node)
6110 expr = build_reinterpret_cast_1
6111 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
6113 if (expr != error_mark_node)
6114 /* cp_build_indirect_ref isn't right for rvalue refs. */
6115 expr = convert_from_reference (fold_convert (type, expr));
6119 /* As a G++ extension, we consider conversions from member
6120 functions, and pointers to member functions to
6121 pointer-to-function and pointer-to-void types. If
6122 -Wno-pmf-conversions has not been specified,
6123 convert_member_func_to_ptr will issue an error message. */
6124 if ((TYPE_PTRMEMFUNC_P (intype)
6125 || TREE_CODE (intype) == METHOD_TYPE)
6126 && TYPE_PTR_P (type)
6127 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
6128 || VOID_TYPE_P (TREE_TYPE (type))))
6129 return convert_member_func_to_ptr (type, expr);
6131 /* If the cast is not to a reference type, the lvalue-to-rvalue,
6132 array-to-pointer, and function-to-pointer conversions are
6134 expr = decay_conversion (expr);
6136 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6137 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6138 if (TREE_CODE (expr) == NOP_EXPR
6139 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6140 expr = TREE_OPERAND (expr, 0);
6142 if (error_operand_p (expr))
6143 return error_mark_node;
6145 intype = TREE_TYPE (expr);
6147 /* [expr.reinterpret.cast]
6148 A pointer can be converted to any integral type large enough to
6149 hold it. ... A value of type std::nullptr_t can be converted to
6150 an integral type; the conversion has the same meaning and
6151 validity as a conversion of (void*)0 to the integral type. */
6152 if (CP_INTEGRAL_TYPE_P (type)
6153 && (TYPE_PTR_P (intype) || NULLPTR_TYPE_P (intype)))
6155 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
6157 if (complain & tf_error)
6158 permerror (input_location, "cast from %qT to %qT loses precision",
6161 return error_mark_node;
6163 if (NULLPTR_TYPE_P (intype))
6164 return build_int_cst (type, 0);
6166 /* [expr.reinterpret.cast]
6167 A value of integral or enumeration type can be explicitly
6168 converted to a pointer. */
6169 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
6172 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
6173 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
6174 return fold_if_not_in_template (build_nop (type, expr));
6175 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
6176 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
6181 check_for_casting_away_constness (intype, type, REINTERPRET_CAST_EXPR);
6182 /* Warn about possible alignment problems. */
6183 if (STRICT_ALIGNMENT && warn_cast_align
6184 && (complain & tf_warning)
6185 && !VOID_TYPE_P (type)
6186 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
6187 && COMPLETE_TYPE_P (TREE_TYPE (type))
6188 && COMPLETE_TYPE_P (TREE_TYPE (intype))
6189 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
6190 warning (OPT_Wcast_align, "cast from %qT to %qT "
6191 "increases required alignment of target type", intype, type);
6193 /* We need to strip nops here, because the front end likes to
6194 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
6196 if (warn_strict_aliasing <= 2)
6197 strict_aliasing_warning (intype, type, sexpr);
6199 return fold_if_not_in_template (build_nop (type, expr));
6201 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
6202 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
6204 if (pedantic && (complain & tf_warning))
6205 /* Only issue a warning, as we have always supported this
6206 where possible, and it is necessary in some cases. DR 195
6207 addresses this issue, but as of 2004/10/26 is still in
6209 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
6210 return fold_if_not_in_template (build_nop (type, expr));
6212 else if (TREE_CODE (type) == VECTOR_TYPE)
6213 return fold_if_not_in_template (convert_to_vector (type, expr));
6214 else if (TREE_CODE (intype) == VECTOR_TYPE
6215 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6216 return fold_if_not_in_template (convert_to_integer (type, expr));
6221 if (complain & tf_error)
6222 error ("invalid cast from type %qT to type %qT", intype, type);
6223 return error_mark_node;
6226 return cp_convert (type, expr);
6230 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
6232 if (type == error_mark_node || expr == error_mark_node)
6233 return error_mark_node;
6235 if (processing_template_decl)
6237 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
6239 if (!TREE_SIDE_EFFECTS (t)
6240 && type_dependent_expression_p (expr))
6241 /* There might turn out to be side effects inside expr. */
6242 TREE_SIDE_EFFECTS (t) = 1;
6243 return convert_from_reference (t);
6246 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
6247 /*valid_p=*/NULL, complain);
6250 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
6251 return an appropriate expression. Otherwise, return
6252 error_mark_node. If the cast is not valid, and COMPLAIN is true,
6253 then a diagnostic will be issued. If VALID_P is non-NULL, we are
6254 performing a C-style cast, its value upon return will indicate
6255 whether or not the conversion succeeded. */
6258 build_const_cast_1 (tree dst_type, tree expr, bool complain,
6262 tree reference_type;
6264 /* Callers are responsible for handling error_mark_node as a
6265 destination type. */
6266 gcc_assert (dst_type != error_mark_node);
6267 /* In a template, callers should be building syntactic
6268 representations of casts, not using this machinery. */
6269 gcc_assert (!processing_template_decl);
6271 /* Assume the conversion is invalid. */
6275 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
6278 error ("invalid use of const_cast with type %qT, "
6279 "which is not a pointer, "
6280 "reference, nor a pointer-to-data-member type", dst_type);
6281 return error_mark_node;
6284 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
6287 error ("invalid use of const_cast with type %qT, which is a pointer "
6288 "or reference to a function type", dst_type);
6289 return error_mark_node;
6292 /* Save casted types in the function's used types hash table. */
6293 used_types_insert (dst_type);
6295 src_type = TREE_TYPE (expr);
6296 /* Expressions do not really have reference types. */
6297 if (TREE_CODE (src_type) == REFERENCE_TYPE)
6298 src_type = TREE_TYPE (src_type);
6300 /* [expr.const.cast]
6302 An lvalue of type T1 can be explicitly converted to an lvalue of
6303 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
6304 types) if a pointer to T1 can be explicitly converted to the type
6305 pointer to T2 using a const_cast. */
6306 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
6308 reference_type = dst_type;
6309 if (! real_lvalue_p (expr))
6312 error ("invalid const_cast of an rvalue of type %qT to type %qT",
6313 src_type, dst_type);
6314 return error_mark_node;
6316 dst_type = build_pointer_type (TREE_TYPE (dst_type));
6317 src_type = build_pointer_type (src_type);
6321 reference_type = NULL_TREE;
6322 /* If the destination type is not a reference type, the
6323 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6324 conversions are performed. */
6325 src_type = type_decays_to (src_type);
6326 if (src_type == error_mark_node)
6327 return error_mark_node;
6330 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
6331 && comp_ptr_ttypes_const (dst_type, src_type))
6336 /* This cast is actually a C-style cast. Issue a warning if
6337 the user is making a potentially unsafe cast. */
6338 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR);
6342 expr = cp_build_unary_op (ADDR_EXPR, expr, 0,
6343 complain? tf_warning_or_error : tf_none);
6344 expr = build_nop (reference_type, expr);
6345 return convert_from_reference (expr);
6349 expr = decay_conversion (expr);
6350 /* build_c_cast puts on a NOP_EXPR to make the result not an
6351 lvalue. Strip such NOP_EXPRs if VALUE is being used in
6352 non-lvalue context. */
6353 if (TREE_CODE (expr) == NOP_EXPR
6354 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
6355 expr = TREE_OPERAND (expr, 0);
6356 return build_nop (dst_type, expr);
6361 error ("invalid const_cast from type %qT to type %qT",
6362 src_type, dst_type);
6363 return error_mark_node;
6367 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
6369 if (type == error_mark_node || error_operand_p (expr))
6370 return error_mark_node;
6372 if (processing_template_decl)
6374 tree t = build_min (CONST_CAST_EXPR, type, expr);
6376 if (!TREE_SIDE_EFFECTS (t)
6377 && type_dependent_expression_p (expr))
6378 /* There might turn out to be side effects inside expr. */
6379 TREE_SIDE_EFFECTS (t) = 1;
6380 return convert_from_reference (t);
6383 return build_const_cast_1 (type, expr, complain & tf_error,
6387 /* Like cp_build_c_cast, but for the c-common bits. */
6390 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
6392 return cp_build_c_cast (type, expr, tf_warning_or_error);
6395 /* Build an expression representing an explicit C-style cast to type
6396 TYPE of expression EXPR. */
6399 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
6405 if (type == error_mark_node || error_operand_p (expr))
6406 return error_mark_node;
6408 if (processing_template_decl)
6410 tree t = build_min (CAST_EXPR, type,
6411 tree_cons (NULL_TREE, value, NULL_TREE));
6412 /* We don't know if it will or will not have side effects. */
6413 TREE_SIDE_EFFECTS (t) = 1;
6414 return convert_from_reference (t);
6417 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6418 'Class') should always be retained, because this information aids
6419 in method lookup. */
6420 if (objc_is_object_ptr (type)
6421 && objc_is_object_ptr (TREE_TYPE (expr)))
6422 return build_nop (type, expr);
6424 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6425 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6426 if (TREE_CODE (type) != REFERENCE_TYPE
6427 && TREE_CODE (value) == NOP_EXPR
6428 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6429 value = TREE_OPERAND (value, 0);
6431 if (TREE_CODE (type) == ARRAY_TYPE)
6433 /* Allow casting from T1* to T2[] because Cfront allows it.
6434 NIHCL uses it. It is not valid ISO C++ however. */
6435 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6437 if (complain & tf_error)
6438 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6440 return error_mark_node;
6441 type = build_pointer_type (TREE_TYPE (type));
6445 if (complain & tf_error)
6446 error ("ISO C++ forbids casting to an array type %qT", type);
6447 return error_mark_node;
6451 if (TREE_CODE (type) == FUNCTION_TYPE
6452 || TREE_CODE (type) == METHOD_TYPE)
6454 if (complain & tf_error)
6455 error ("invalid cast to function type %qT", type);
6456 return error_mark_node;
6459 if (TREE_CODE (type) == POINTER_TYPE
6460 && TREE_CODE (TREE_TYPE (value)) == INTEGER_TYPE
6461 /* Casting to an integer of smaller size is an error detected elsewhere. */
6462 && TYPE_PRECISION (type) > TYPE_PRECISION (TREE_TYPE (value))
6463 /* Don't warn about converting any constant. */
6464 && !TREE_CONSTANT (value))
6465 warning_at (input_location, OPT_Wint_to_pointer_cast,
6466 "cast to pointer from integer of different size");
6468 /* A C-style cast can be a const_cast. */
6469 result = build_const_cast_1 (type, value, /*complain=*/false,
6474 /* Or a static cast. */
6475 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6476 &valid_p, complain);
6477 /* Or a reinterpret_cast. */
6479 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6480 &valid_p, complain);
6481 /* The static_cast or reinterpret_cast may be followed by a
6484 /* A valid cast may result in errors if, for example, a
6485 conversion to am ambiguous base class is required. */
6486 && !error_operand_p (result))
6490 /* Non-class rvalues always have cv-unqualified type. */
6491 if (!CLASS_TYPE_P (type))
6492 type = TYPE_MAIN_VARIANT (type);
6493 result_type = TREE_TYPE (result);
6494 if (!CLASS_TYPE_P (result_type))
6495 result_type = TYPE_MAIN_VARIANT (result_type);
6496 /* If the type of RESULT does not match TYPE, perform a
6497 const_cast to make it match. If the static_cast or
6498 reinterpret_cast succeeded, we will differ by at most
6499 cv-qualification, so the follow-on const_cast is guaranteed
6501 if (!same_type_p (non_reference (type), non_reference (result_type)))
6503 result = build_const_cast_1 (type, result, false, &valid_p);
6504 gcc_assert (valid_p);
6509 return error_mark_node;
6512 /* For use from the C common bits. */
6514 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6515 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6516 enum tree_code modifycode,
6517 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6518 tree rhs_origtype ATTRIBUTE_UNUSED)
6520 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6523 /* Build an assignment expression of lvalue LHS from value RHS.
6524 MODIFYCODE is the code for a binary operator that we use
6525 to combine the old value of LHS with RHS to get the new value.
6526 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6528 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6531 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6532 tsubst_flags_t complain)
6536 tree lhstype = TREE_TYPE (lhs);
6537 tree olhstype = lhstype;
6538 bool plain_assign = (modifycode == NOP_EXPR);
6540 /* Avoid duplicate error messages from operands that had errors. */
6541 if (error_operand_p (lhs) || error_operand_p (rhs))
6542 return error_mark_node;
6544 /* Handle control structure constructs used as "lvalues". */
6545 switch (TREE_CODE (lhs))
6547 /* Handle --foo = 5; as these are valid constructs in C++. */
6548 case PREDECREMENT_EXPR:
6549 case PREINCREMENT_EXPR:
6550 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6551 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6552 stabilize_reference (TREE_OPERAND (lhs, 0)),
6553 TREE_OPERAND (lhs, 1));
6554 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6555 modifycode, rhs, complain);
6556 if (newrhs == error_mark_node)
6557 return error_mark_node;
6558 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6560 /* Handle (a, b) used as an "lvalue". */
6562 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6563 modifycode, rhs, complain);
6564 if (newrhs == error_mark_node)
6565 return error_mark_node;
6566 return build2 (COMPOUND_EXPR, lhstype,
6567 TREE_OPERAND (lhs, 0), newrhs);
6570 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6571 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6572 stabilize_reference (TREE_OPERAND (lhs, 0)),
6573 TREE_OPERAND (lhs, 1));
6574 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6576 if (newrhs == error_mark_node)
6577 return error_mark_node;
6578 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6582 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6583 when neither operand has side-effects. */
6584 if (!lvalue_or_else (lhs, lv_assign, complain))
6585 return error_mark_node;
6587 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6588 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6590 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6591 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6593 TREE_OPERAND (lhs, 0),
6594 TREE_OPERAND (lhs, 1)),
6595 TREE_OPERAND (lhs, 0),
6596 TREE_OPERAND (lhs, 1));
6599 /* Handle (a ? b : c) used as an "lvalue". */
6602 /* Produce (a ? (b = rhs) : (c = rhs))
6603 except that the RHS goes through a save-expr
6604 so the code to compute it is only emitted once. */
6606 tree preeval = NULL_TREE;
6608 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6610 if (complain & tf_error)
6611 error ("void value not ignored as it ought to be");
6612 return error_mark_node;
6615 rhs = stabilize_expr (rhs, &preeval);
6617 /* Check this here to avoid odd errors when trying to convert
6618 a throw to the type of the COND_EXPR. */
6619 if (!lvalue_or_else (lhs, lv_assign, complain))
6620 return error_mark_node;
6622 cond = build_conditional_expr
6623 (TREE_OPERAND (lhs, 0),
6624 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6625 modifycode, rhs, complain),
6626 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6627 modifycode, rhs, complain),
6630 if (cond == error_mark_node)
6632 /* Make sure the code to compute the rhs comes out
6633 before the split. */
6635 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6643 if (modifycode == INIT_EXPR)
6645 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6646 /* Do the default thing. */;
6647 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6649 /* Compound literal. */
6650 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6651 /* Call convert to generate an error; see PR 11063. */
6652 rhs = convert (lhstype, rhs);
6653 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6654 TREE_SIDE_EFFECTS (result) = 1;
6657 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6658 /* Do the default thing. */;
6661 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6662 result = build_special_member_call (lhs, complete_ctor_identifier,
6663 &rhs_vec, lhstype, LOOKUP_NORMAL,
6665 release_tree_vector (rhs_vec);
6666 if (result == NULL_TREE)
6667 return error_mark_node;
6673 lhs = require_complete_type (lhs);
6674 if (lhs == error_mark_node)
6675 return error_mark_node;
6677 if (modifycode == NOP_EXPR)
6679 /* `operator=' is not an inheritable operator. */
6680 if (! MAYBE_CLASS_TYPE_P (lhstype))
6681 /* Do the default thing. */;
6684 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6685 lhs, rhs, make_node (NOP_EXPR),
6686 /*overloaded_p=*/NULL,
6688 if (result == NULL_TREE)
6689 return error_mark_node;
6696 /* A binary op has been requested. Combine the old LHS
6697 value with the RHS producing the value we should actually
6698 store into the LHS. */
6699 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6700 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6701 || MAYBE_CLASS_TYPE_P (lhstype)));
6703 lhs = stabilize_reference (lhs);
6704 newrhs = cp_build_binary_op (input_location,
6705 modifycode, lhs, rhs,
6707 if (newrhs == error_mark_node)
6709 if (complain & tf_error)
6710 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6711 TREE_TYPE (lhs), TREE_TYPE (rhs));
6712 return error_mark_node;
6715 /* Now it looks like a plain assignment. */
6716 modifycode = NOP_EXPR;
6718 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6719 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6722 /* The left-hand side must be an lvalue. */
6723 if (!lvalue_or_else (lhs, lv_assign, complain))
6724 return error_mark_node;
6726 /* Warn about modifying something that is `const'. Don't warn if
6727 this is initialization. */
6728 if (modifycode != INIT_EXPR
6729 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6730 /* Functions are not modifiable, even though they are
6732 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6733 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6734 /* If it's an aggregate and any field is const, then it is
6735 effectively const. */
6736 || (CLASS_TYPE_P (lhstype)
6737 && C_TYPE_FIELDS_READONLY (lhstype))))
6739 if (complain & tf_error)
6740 readonly_error (lhs, REK_ASSIGNMENT);
6742 return error_mark_node;
6745 /* If storing into a structure or union member, it may have been given a
6746 lowered bitfield type. We need to convert to the declared type first,
6747 so retrieve it now. */
6749 olhstype = unlowered_expr_type (lhs);
6751 /* Convert new value to destination type. */
6753 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6757 if (BRACE_ENCLOSED_INITIALIZER_P (newrhs))
6759 if (modifycode != INIT_EXPR)
6761 if (complain & tf_error)
6762 error ("assigning to an array from an initializer list");
6763 return error_mark_node;
6765 if (check_array_initializer (lhs, lhstype, newrhs))
6766 return error_mark_node;
6767 newrhs = digest_init (lhstype, newrhs);
6770 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6771 TYPE_MAIN_VARIANT (TREE_TYPE (newrhs))))
6773 if (complain & tf_error)
6774 error ("incompatible types in assignment of %qT to %qT",
6775 TREE_TYPE (rhs), lhstype);
6776 return error_mark_node;
6779 /* Allow array assignment in compiler-generated code. */
6780 else if (!current_function_decl
6781 || !DECL_ARTIFICIAL (current_function_decl))
6783 /* This routine is used for both initialization and assignment.
6784 Make sure the diagnostic message differentiates the context. */
6785 if (complain & tf_error)
6787 if (modifycode == INIT_EXPR)
6788 error ("array used as initializer");
6790 error ("invalid array assignment");
6792 return error_mark_node;
6795 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6796 ? 1 + (modifycode != INIT_EXPR): 0;
6797 return build_vec_init (lhs, NULL_TREE, newrhs,
6798 /*explicit_value_init_p=*/false,
6799 from_array, complain);
6802 if (modifycode == INIT_EXPR)
6803 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6804 LOOKUP_ONLYCONVERTING. */
6805 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6806 ICR_INIT, NULL_TREE, 0,
6809 newrhs = convert_for_assignment (olhstype, newrhs, ICR_ASSIGN,
6810 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6812 if (!same_type_p (lhstype, olhstype))
6813 newrhs = cp_convert_and_check (lhstype, newrhs);
6815 if (modifycode != INIT_EXPR)
6817 if (TREE_CODE (newrhs) == CALL_EXPR
6818 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6819 newrhs = build_cplus_new (lhstype, newrhs);
6821 /* Can't initialize directly from a TARGET_EXPR, since that would
6822 cause the lhs to be constructed twice, and possibly result in
6823 accidental self-initialization. So we force the TARGET_EXPR to be
6824 expanded without a target. */
6825 if (TREE_CODE (newrhs) == TARGET_EXPR)
6826 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6827 TREE_OPERAND (newrhs, 0));
6830 if (newrhs == error_mark_node)
6831 return error_mark_node;
6833 if (c_dialect_objc () && flag_objc_gc)
6835 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6841 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6842 lhstype, lhs, newrhs);
6844 TREE_SIDE_EFFECTS (result) = 1;
6846 TREE_NO_WARNING (result) = 1;
6852 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6853 tsubst_flags_t complain)
6855 if (processing_template_decl)
6856 return build_min_nt (MODOP_EXPR, lhs,
6857 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6859 if (modifycode != NOP_EXPR)
6861 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6862 make_node (modifycode),
6863 /*overloaded_p=*/NULL,
6867 TREE_NO_WARNING (rval) = 1;
6871 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6874 /* Helper function for get_delta_difference which assumes FROM is a base
6875 class of TO. Returns a delta for the conversion of pointer-to-member
6876 of FROM to pointer-to-member of TO. If the conversion is invalid and
6877 tf_error is not set in COMPLAIN returns error_mark_node, otherwise
6878 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6879 If C_CAST_P is true, this conversion is taking place as part of a
6883 get_delta_difference_1 (tree from, tree to, bool c_cast_p,
6884 tsubst_flags_t complain)
6888 base_access access = c_cast_p ? ba_unique : ba_check;
6890 /* Note: ba_quiet does not distinguish between access control and
6892 if (!(complain & tf_error))
6895 binfo = lookup_base (to, from, access, &kind);
6897 if (kind == bk_inaccessible || kind == bk_ambig)
6899 if (!(complain & tf_error))
6900 return error_mark_node;
6902 error (" in pointer to member function conversion");
6903 return size_zero_node;
6907 if (kind != bk_via_virtual)
6908 return BINFO_OFFSET (binfo);
6910 /* FROM is a virtual base class of TO. Issue an error or warning
6911 depending on whether or not this is a reinterpret cast. */
6913 if (!(complain & tf_error))
6914 return error_mark_node;
6916 error ("pointer to member conversion via virtual base %qT",
6917 BINFO_TYPE (binfo_from_vbase (binfo)));
6919 return size_zero_node;
6926 /* Get difference in deltas for different pointer to member function
6927 types. If the conversion is invalid and tf_error is not set in
6928 COMPLAIN, returns error_mark_node, otherwise returns an integer
6929 constant of type PTRDIFF_TYPE_NODE and its value is zero if the
6930 conversion is invalid. If ALLOW_INVERSE_P is true, then allow reverse
6931 conversions as well. If C_CAST_P is true this conversion is taking
6932 place as part of a C-style cast.
6934 Note that the naming of FROM and TO is kind of backwards; the return
6935 value is what we add to a TO in order to get a FROM. They are named
6936 this way because we call this function to find out how to convert from
6937 a pointer to member of FROM to a pointer to member of TO. */
6940 get_delta_difference (tree from, tree to,
6941 bool allow_inverse_p,
6942 bool c_cast_p, tsubst_flags_t complain)
6946 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6947 /* Pointer to member of incomplete class is permitted*/
6948 result = size_zero_node;
6950 result = get_delta_difference_1 (from, to, c_cast_p, complain);
6952 if (result == error_mark_node)
6953 return error_mark_node;
6957 if (!allow_inverse_p)
6959 if (!(complain & tf_error))
6960 return error_mark_node;
6962 error_not_base_type (from, to);
6963 error (" in pointer to member conversion");
6964 result = size_zero_node;
6968 result = get_delta_difference_1 (to, from, c_cast_p, complain);
6970 if (result == error_mark_node)
6971 return error_mark_node;
6974 result = size_diffop_loc (input_location,
6975 size_zero_node, result);
6978 if (!(complain & tf_error))
6979 return error_mark_node;
6981 error_not_base_type (from, to);
6982 error (" in pointer to member conversion");
6983 result = size_zero_node;
6988 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
6992 /* Return a constructor for the pointer-to-member-function TYPE using
6993 the other components as specified. */
6996 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
7001 VEC(constructor_elt, gc) *v;
7003 /* Pull the FIELD_DECLs out of the type. */
7004 pfn_field = TYPE_FIELDS (type);
7005 delta_field = DECL_CHAIN (pfn_field);
7007 /* Make sure DELTA has the type we want. */
7008 delta = convert_and_check (delta_type_node, delta);
7010 /* Convert to the correct target type if necessary. */
7011 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
7013 /* Finish creating the initializer. */
7014 v = VEC_alloc(constructor_elt, gc, 2);
7015 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
7016 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
7017 u = build_constructor (type, v);
7018 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
7019 TREE_STATIC (u) = (TREE_CONSTANT (u)
7020 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
7022 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
7027 /* Build a constructor for a pointer to member function. It can be
7028 used to initialize global variables, local variable, or used
7029 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
7032 If FORCE is nonzero, then force this conversion, even if
7033 we would rather not do it. Usually set when using an explicit
7034 cast. A C-style cast is being processed iff C_CAST_P is true.
7036 Return error_mark_node, if something goes wrong. */
7039 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p,
7040 tsubst_flags_t complain)
7046 if (error_operand_p (pfn))
7047 return error_mark_node;
7049 pfn_type = TREE_TYPE (pfn);
7050 to_type = build_ptrmemfunc_type (type);
7052 /* Handle multiple conversions of pointer to member functions. */
7053 if (TYPE_PTRMEMFUNC_P (pfn_type))
7055 tree delta = NULL_TREE;
7056 tree npfn = NULL_TREE;
7060 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
7061 error ("invalid conversion to type %qT from type %qT",
7064 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
7065 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
7067 c_cast_p, complain);
7068 if (n == error_mark_node)
7069 return error_mark_node;
7071 /* We don't have to do any conversion to convert a
7072 pointer-to-member to its own type. But, we don't want to
7073 just return a PTRMEM_CST if there's an explicit cast; that
7074 cast should make the expression an invalid template argument. */
7075 if (TREE_CODE (pfn) != PTRMEM_CST)
7077 if (same_type_p (to_type, pfn_type))
7079 else if (integer_zerop (n))
7080 return build_reinterpret_cast (to_type, pfn,
7081 tf_warning_or_error);
7084 if (TREE_SIDE_EFFECTS (pfn))
7085 pfn = save_expr (pfn);
7087 /* Obtain the function pointer and the current DELTA. */
7088 if (TREE_CODE (pfn) == PTRMEM_CST)
7089 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
7092 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
7093 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
7096 /* Just adjust the DELTA field. */
7097 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7098 (TREE_TYPE (delta), ptrdiff_type_node));
7099 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
7100 n = cp_build_binary_op (input_location,
7101 LSHIFT_EXPR, n, integer_one_node,
7102 tf_warning_or_error);
7103 delta = cp_build_binary_op (input_location,
7104 PLUS_EXPR, delta, n, tf_warning_or_error);
7105 return build_ptrmemfunc1 (to_type, delta, npfn);
7108 /* Handle null pointer to member function conversions. */
7109 if (null_ptr_cst_p (pfn))
7111 pfn = build_c_cast (input_location, type, integer_zero_node);
7112 return build_ptrmemfunc1 (to_type,
7117 if (type_unknown_p (pfn))
7118 return instantiate_type (type, pfn, tf_warning_or_error);
7120 fn = TREE_OPERAND (pfn, 0);
7121 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
7122 /* In a template, we will have preserved the
7124 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
7125 return make_ptrmem_cst (to_type, fn);
7128 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
7131 ??? There is no consistency as to the types returned for the above
7132 values. Some code acts as if it were a sizetype and some as if it were
7133 integer_type_node. */
7136 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
7138 tree type = TREE_TYPE (cst);
7139 tree fn = PTRMEM_CST_MEMBER (cst);
7140 tree ptr_class, fn_class;
7142 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
7144 /* The class that the function belongs to. */
7145 fn_class = DECL_CONTEXT (fn);
7147 /* The class that we're creating a pointer to member of. */
7148 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
7150 /* First, calculate the adjustment to the function's class. */
7151 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
7152 /*c_cast_p=*/0, tf_warning_or_error);
7154 if (!DECL_VIRTUAL_P (fn))
7155 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
7158 /* If we're dealing with a virtual function, we have to adjust 'this'
7159 again, to point to the base which provides the vtable entry for
7160 fn; the call will do the opposite adjustment. */
7161 tree orig_class = DECL_CONTEXT (fn);
7162 tree binfo = binfo_or_else (orig_class, fn_class);
7163 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7164 *delta, BINFO_OFFSET (binfo));
7165 *delta = fold_if_not_in_template (*delta);
7167 /* We set PFN to the vtable offset at which the function can be
7168 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
7169 case delta is shifted left, and then incremented). */
7170 *pfn = DECL_VINDEX (fn);
7171 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
7172 TYPE_SIZE_UNIT (vtable_entry_type));
7173 *pfn = fold_if_not_in_template (*pfn);
7175 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
7177 case ptrmemfunc_vbit_in_pfn:
7178 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
7180 *pfn = fold_if_not_in_template (*pfn);
7183 case ptrmemfunc_vbit_in_delta:
7184 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
7185 *delta, integer_one_node);
7186 *delta = fold_if_not_in_template (*delta);
7187 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
7188 *delta, integer_one_node);
7189 *delta = fold_if_not_in_template (*delta);
7196 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
7197 *pfn = fold_if_not_in_template (*pfn);
7201 /* Return an expression for PFN from the pointer-to-member function
7205 pfn_from_ptrmemfunc (tree t)
7207 if (TREE_CODE (t) == PTRMEM_CST)
7212 expand_ptrmemfunc_cst (t, &delta, &pfn);
7217 return build_ptrmemfunc_access_expr (t, pfn_identifier);
7220 /* Return an expression for DELTA from the pointer-to-member function
7224 delta_from_ptrmemfunc (tree t)
7226 if (TREE_CODE (t) == PTRMEM_CST)
7231 expand_ptrmemfunc_cst (t, &delta, &pfn);
7236 return build_ptrmemfunc_access_expr (t, delta_identifier);
7239 /* Convert value RHS to type TYPE as preparation for an assignment to
7240 an lvalue of type TYPE. ERRTYPE indicates what kind of error the
7241 implicit conversion is. If FNDECL is non-NULL, we are doing the
7242 conversion in order to pass the PARMNUMth argument of FNDECL.
7243 If FNDECL is NULL, we are doing the conversion in function pointer
7244 argument passing, conversion in initialization, etc. */
7247 convert_for_assignment (tree type, tree rhs,
7248 impl_conv_rhs errtype, tree fndecl, int parmnum,
7249 tsubst_flags_t complain, int flags)
7252 enum tree_code coder;
7254 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
7255 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
7256 rhs = TREE_OPERAND (rhs, 0);
7258 rhstype = TREE_TYPE (rhs);
7259 coder = TREE_CODE (rhstype);
7261 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
7262 && vector_types_convertible_p (type, rhstype, true))
7264 rhs = mark_rvalue_use (rhs);
7265 return convert (type, rhs);
7268 if (rhs == error_mark_node || rhstype == error_mark_node)
7269 return error_mark_node;
7270 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
7271 return error_mark_node;
7273 /* The RHS of an assignment cannot have void type. */
7274 if (coder == VOID_TYPE)
7276 if (complain & tf_error)
7277 error ("void value not ignored as it ought to be");
7278 return error_mark_node;
7281 /* Simplify the RHS if possible. */
7282 if (TREE_CODE (rhs) == CONST_DECL)
7283 rhs = DECL_INITIAL (rhs);
7285 if (c_dialect_objc ())
7289 tree rname = fndecl;
7300 selector = objc_message_selector ();
7302 if (selector && parmno > 1)
7309 if (objc_compare_types (type, rhstype, parmno, rname))
7311 rhs = mark_rvalue_use (rhs);
7312 return convert (type, rhs);
7318 The expression is implicitly converted (clause _conv_) to the
7319 cv-unqualified type of the left operand.
7321 We allow bad conversions here because by the time we get to this point
7322 we are committed to doing the conversion. If we end up doing a bad
7323 conversion, convert_like will complain. */
7324 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
7326 /* When -Wno-pmf-conversions is use, we just silently allow
7327 conversions from pointers-to-members to plain pointers. If
7328 the conversion doesn't work, cp_convert will complain. */
7330 && TYPE_PTR_P (type)
7331 && TYPE_PTRMEMFUNC_P (rhstype))
7332 rhs = cp_convert (strip_top_quals (type), rhs);
7335 if (complain & tf_error)
7337 /* If the right-hand side has unknown type, then it is an
7338 overloaded function. Call instantiate_type to get error
7340 if (rhstype == unknown_type_node)
7341 instantiate_type (type, rhs, tf_warning_or_error);
7343 error ("cannot convert %qT to %qT for argument %qP to %qD",
7344 rhstype, type, parmnum, fndecl);
7348 case ICR_DEFAULT_ARGUMENT:
7349 error ("cannot convert %qT to %qT in default argument",
7353 error ("cannot convert %qT to %qT in argument passing",
7356 case ICR_CONVERTING:
7357 error ("cannot convert %qT to %qT",
7361 error ("cannot convert %qT to %qT in initialization",
7365 error ("cannot convert %qT to %qT in return",
7369 error ("cannot convert %qT to %qT in assignment",
7376 return error_mark_node;
7379 if (warn_missing_format_attribute)
7381 const enum tree_code codel = TREE_CODE (type);
7382 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
7384 && check_missing_format_attribute (type, rhstype)
7385 && (complain & tf_warning))
7389 case ICR_DEFAULT_ARGUMENT:
7391 warning (OPT_Wmissing_format_attribute,
7392 "parameter %qP of %qD might be a candidate "
7393 "for a format attribute", parmnum, fndecl);
7395 warning (OPT_Wmissing_format_attribute,
7396 "parameter might be a candidate "
7397 "for a format attribute");
7399 case ICR_CONVERTING:
7400 warning (OPT_Wmissing_format_attribute,
7401 "target of conversion might be might be a candidate "
7402 "for a format attribute");
7405 warning (OPT_Wmissing_format_attribute,
7406 "target of initialization might be a candidate "
7407 "for a format attribute");
7410 warning (OPT_Wmissing_format_attribute,
7411 "return type might be a candidate "
7412 "for a format attribute");
7415 warning (OPT_Wmissing_format_attribute,
7416 "left-hand side of assignment might be a candidate "
7417 "for a format attribute");
7424 /* If -Wparentheses, warn about a = b = c when a has type bool and b
7426 if (warn_parentheses
7427 && TREE_CODE (type) == BOOLEAN_TYPE
7428 && TREE_CODE (rhs) == MODIFY_EXPR
7429 && !TREE_NO_WARNING (rhs)
7430 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
7431 && (complain & tf_warning))
7433 location_t loc = EXPR_HAS_LOCATION (rhs)
7434 ? EXPR_LOCATION (rhs) : input_location;
7436 warning_at (loc, OPT_Wparentheses,
7437 "suggest parentheses around assignment used as truth value");
7438 TREE_NO_WARNING (rhs) = 1;
7441 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
7445 /* Convert RHS to be of type TYPE.
7446 If EXP is nonzero, it is the target of the initialization.
7447 ERRTYPE indicates what kind of error the implicit conversion is.
7449 Two major differences between the behavior of
7450 `convert_for_assignment' and `convert_for_initialization'
7451 are that references are bashed in the former, while
7452 copied in the latter, and aggregates are assigned in
7453 the former (operator=) while initialized in the
7456 If using constructor make sure no conversion operator exists, if one does
7457 exist, an ambiguity exists.
7459 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7462 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
7463 impl_conv_rhs errtype, tree fndecl, int parmnum,
7464 tsubst_flags_t complain)
7466 enum tree_code codel = TREE_CODE (type);
7468 enum tree_code coder;
7470 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7471 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7472 if (TREE_CODE (rhs) == NOP_EXPR
7473 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
7474 && codel != REFERENCE_TYPE)
7475 rhs = TREE_OPERAND (rhs, 0);
7477 if (type == error_mark_node
7478 || rhs == error_mark_node
7479 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
7480 return error_mark_node;
7482 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
7483 && TREE_CODE (type) != ARRAY_TYPE
7484 && (TREE_CODE (type) != REFERENCE_TYPE
7485 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
7486 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
7487 && (TREE_CODE (type) != REFERENCE_TYPE
7488 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
7489 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
7490 rhs = decay_conversion (rhs);
7492 rhstype = TREE_TYPE (rhs);
7493 coder = TREE_CODE (rhstype);
7495 if (coder == ERROR_MARK)
7496 return error_mark_node;
7498 /* We accept references to incomplete types, so we can
7499 return here before checking if RHS is of complete type. */
7501 if (codel == REFERENCE_TYPE)
7503 /* This should eventually happen in convert_arguments. */
7504 int savew = 0, savee = 0;
7507 savew = warningcount, savee = errorcount;
7508 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
7509 /*cleanup=*/NULL, complain);
7512 if (warningcount > savew)
7513 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
7514 else if (errorcount > savee)
7515 error ("in passing argument %P of %q+D", parmnum, fndecl);
7521 exp = require_complete_type (exp);
7522 if (exp == error_mark_node)
7523 return error_mark_node;
7525 rhstype = non_reference (rhstype);
7527 type = complete_type (type);
7529 if (DIRECT_INIT_EXPR_P (type, rhs))
7530 /* Don't try to do copy-initialization if we already have
7531 direct-initialization. */
7534 if (MAYBE_CLASS_TYPE_P (type))
7535 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
7537 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7541 /* If RETVAL is the address of, or a reference to, a local variable or
7542 temporary give an appropriate warning. */
7545 maybe_warn_about_returning_address_of_local (tree retval)
7547 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7548 tree whats_returned = retval;
7552 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7553 whats_returned = TREE_OPERAND (whats_returned, 1);
7554 else if (CONVERT_EXPR_P (whats_returned)
7555 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7556 whats_returned = TREE_OPERAND (whats_returned, 0);
7561 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7563 whats_returned = TREE_OPERAND (whats_returned, 0);
7565 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7567 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7568 || TREE_CODE (whats_returned) == TARGET_EXPR)
7570 warning (0, "returning reference to temporary");
7573 if (TREE_CODE (whats_returned) == VAR_DECL
7574 && DECL_NAME (whats_returned)
7575 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7577 warning (0, "reference to non-lvalue returned");
7582 while (TREE_CODE (whats_returned) == COMPONENT_REF
7583 || TREE_CODE (whats_returned) == ARRAY_REF)
7584 whats_returned = TREE_OPERAND (whats_returned, 0);
7586 if (DECL_P (whats_returned)
7587 && DECL_NAME (whats_returned)
7588 && DECL_FUNCTION_SCOPE_P (whats_returned)
7589 && !(TREE_STATIC (whats_returned)
7590 || TREE_PUBLIC (whats_returned)))
7592 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7593 warning (0, "reference to local variable %q+D returned",
7596 warning (0, "address of local variable %q+D returned",
7602 /* Check that returning RETVAL from the current function is valid.
7603 Return an expression explicitly showing all conversions required to
7604 change RETVAL into the function return type, and to assign it to
7605 the DECL_RESULT for the function. Set *NO_WARNING to true if
7606 code reaches end of non-void function warning shouldn't be issued
7607 on this RETURN_EXPR. */
7610 check_return_expr (tree retval, bool *no_warning)
7613 /* The type actually returned by the function, after any
7616 int fn_returns_value_p;
7617 bool named_return_value_okay_p;
7619 *no_warning = false;
7621 /* A `volatile' function is one that isn't supposed to return, ever.
7622 (This is a G++ extension, used to get better code for functions
7623 that call the `volatile' function.) */
7624 if (TREE_THIS_VOLATILE (current_function_decl))
7625 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7627 /* Check for various simple errors. */
7628 if (DECL_DESTRUCTOR_P (current_function_decl))
7631 error ("returning a value from a destructor");
7634 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7636 if (in_function_try_handler)
7637 /* If a return statement appears in a handler of the
7638 function-try-block of a constructor, the program is ill-formed. */
7639 error ("cannot return from a handler of a function-try-block of a constructor");
7641 /* You can't return a value from a constructor. */
7642 error ("returning a value from a constructor");
7646 /* As an extension, deduce lambda return type from a return statement
7647 anywhere in the body. */
7648 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7650 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7651 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7653 tree type = lambda_return_type (retval);
7654 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7656 if (VOID_TYPE_P (type))
7658 else if (oldtype == NULL_TREE)
7660 pedwarn (input_location, OPT_pedantic, "lambda return type "
7661 "can only be deduced when the return statement is "
7662 "the only statement in the function body");
7663 apply_lambda_return_type (lambda, type);
7665 else if (!same_type_p (type, oldtype))
7666 error ("inconsistent types %qT and %qT deduced for "
7667 "lambda return type", type, oldtype);
7671 if (processing_template_decl)
7673 current_function_returns_value = 1;
7674 if (check_for_bare_parameter_packs (retval))
7675 retval = error_mark_node;
7679 /* When no explicit return-value is given in a function with a named
7680 return value, the named return value is used. */
7681 result = DECL_RESULT (current_function_decl);
7682 valtype = TREE_TYPE (result);
7683 gcc_assert (valtype != NULL_TREE);
7684 fn_returns_value_p = !VOID_TYPE_P (valtype);
7685 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7688 /* Check for a return statement with no return value in a function
7689 that's supposed to return a value. */
7690 if (!retval && fn_returns_value_p)
7692 permerror (input_location, "return-statement with no value, in function returning %qT",
7694 /* Clear this, so finish_function won't say that we reach the
7695 end of a non-void function (which we don't, we gave a
7697 current_function_returns_null = 0;
7698 /* And signal caller that TREE_NO_WARNING should be set on the
7699 RETURN_EXPR to avoid control reaches end of non-void function
7700 warnings in tree-cfg.c. */
7703 /* Check for a return statement with a value in a function that
7704 isn't supposed to return a value. */
7705 else if (retval && !fn_returns_value_p)
7707 if (VOID_TYPE_P (TREE_TYPE (retval)))
7708 /* You can return a `void' value from a function of `void'
7709 type. In that case, we have to evaluate the expression for
7710 its side-effects. */
7711 finish_expr_stmt (retval);
7713 permerror (input_location, "return-statement with a value, in function "
7714 "returning 'void'");
7715 current_function_returns_null = 1;
7717 /* There's really no value to return, after all. */
7721 /* Remember that this function can sometimes return without a
7723 current_function_returns_null = 1;
7725 /* Remember that this function did return a value. */
7726 current_function_returns_value = 1;
7728 /* Check for erroneous operands -- but after giving ourselves a
7729 chance to provide an error about returning a value from a void
7731 if (error_operand_p (retval))
7733 current_function_return_value = error_mark_node;
7734 return error_mark_node;
7737 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7738 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7739 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7740 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7742 && retval && null_ptr_cst_p (retval))
7743 warning (0, "%<operator new%> must not return NULL unless it is "
7744 "declared %<throw()%> (or -fcheck-new is in effect)");
7746 /* Effective C++ rule 15. See also start_function. */
7748 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7752 /* The function return type must be a reference to the current
7754 if (TREE_CODE (valtype) == REFERENCE_TYPE
7755 && same_type_ignoring_top_level_qualifiers_p
7756 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7758 /* Returning '*this' is obviously OK. */
7759 if (retval == current_class_ref)
7761 /* If we are calling a function whose return type is the same of
7762 the current class reference, it is ok. */
7763 else if (TREE_CODE (retval) == INDIRECT_REF
7764 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7769 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7772 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7774 [...] For a function with a class return type, if the expression
7775 in the return statement is the name of a local object, and the cv-
7776 unqualified type of the local object is the same as the function
7777 return type, an implementation is permitted to omit creating the tem-
7778 porary object to hold the function return value [...]
7780 So, if this is a value-returning function that always returns the same
7781 local variable, remember it.
7783 It might be nice to be more flexible, and choose the first suitable
7784 variable even if the function sometimes returns something else, but
7785 then we run the risk of clobbering the variable we chose if the other
7786 returned expression uses the chosen variable somehow. And people expect
7787 this restriction, anyway. (jason 2000-11-19)
7789 See finish_function and finalize_nrv for the rest of this optimization. */
7791 named_return_value_okay_p =
7792 (retval != NULL_TREE
7793 /* Must be a local, automatic variable. */
7794 && TREE_CODE (retval) == VAR_DECL
7795 && DECL_CONTEXT (retval) == current_function_decl
7796 && ! TREE_STATIC (retval)
7797 && ! DECL_ANON_UNION_VAR_P (retval)
7798 && (DECL_ALIGN (retval)
7799 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7800 /* The cv-unqualified type of the returned value must be the
7801 same as the cv-unqualified return type of the
7803 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7805 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7806 /* And the returned value must be non-volatile. */
7807 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7809 if (fn_returns_value_p && flag_elide_constructors)
7811 if (named_return_value_okay_p
7812 && (current_function_return_value == NULL_TREE
7813 || current_function_return_value == retval))
7814 current_function_return_value = retval;
7816 current_function_return_value = error_mark_node;
7819 /* We don't need to do any conversions when there's nothing being
7824 /* Do any required conversions. */
7825 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7826 /* No conversions are required. */
7830 /* The type the function is declared to return. */
7831 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7832 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7834 /* The functype's return type will have been set to void, if it
7835 was an incomplete type. Just treat this as 'return;' */
7836 if (VOID_TYPE_P (functype))
7837 return error_mark_node;
7839 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7840 treated as an rvalue for the purposes of overload resolution to
7841 favor move constructors over copy constructors. */
7842 if ((cxx_dialect != cxx98)
7843 && named_return_value_okay_p
7844 /* The variable must not have the `volatile' qualifier. */
7845 && !CP_TYPE_VOLATILE_P (TREE_TYPE (retval))
7846 /* The return type must be a class type. */
7847 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7848 flags = flags | LOOKUP_PREFER_RVALUE;
7850 /* First convert the value to the function's return type, then
7851 to the type of return value's location to handle the
7852 case that functype is smaller than the valtype. */
7853 retval = convert_for_initialization
7854 (NULL_TREE, functype, retval, flags, ICR_RETURN, NULL_TREE, 0,
7855 tf_warning_or_error);
7856 retval = convert (valtype, retval);
7858 /* If the conversion failed, treat this just like `return;'. */
7859 if (retval == error_mark_node)
7861 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7862 else if (! cfun->returns_struct
7863 && TREE_CODE (retval) == TARGET_EXPR
7864 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7865 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7866 TREE_OPERAND (retval, 0));
7868 maybe_warn_about_returning_address_of_local (retval);
7871 /* Actually copy the value returned into the appropriate location. */
7872 if (retval && retval != result)
7873 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7879 /* Returns nonzero if the pointer-type FROM can be converted to the
7880 pointer-type TO via a qualification conversion. If CONSTP is -1,
7881 then we return nonzero if the pointers are similar, and the
7882 cv-qualification signature of FROM is a proper subset of that of TO.
7884 If CONSTP is positive, then all outer pointers have been
7888 comp_ptr_ttypes_real (tree to, tree from, int constp)
7890 bool to_more_cv_qualified = false;
7891 bool is_opaque_pointer = false;
7893 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7895 if (TREE_CODE (to) != TREE_CODE (from))
7898 if (TREE_CODE (from) == OFFSET_TYPE
7899 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7900 TYPE_OFFSET_BASETYPE (to)))
7903 /* Const and volatile mean something different for function types,
7904 so the usual checks are not appropriate. */
7905 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7907 /* In Objective-C++, some types may have been 'volatilized' by
7908 the compiler for EH; when comparing them here, the volatile
7909 qualification must be ignored. */
7910 bool objc_quals_match = objc_type_quals_match (to, from);
7912 if (!at_least_as_qualified_p (to, from) && !objc_quals_match)
7915 if (!at_least_as_qualified_p (from, to) && !objc_quals_match)
7919 to_more_cv_qualified = true;
7923 constp &= TYPE_READONLY (to);
7926 if (TREE_CODE (to) == VECTOR_TYPE)
7927 is_opaque_pointer = vector_targets_convertible_p (to, from);
7929 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7930 return ((constp >= 0 || to_more_cv_qualified)
7931 && (is_opaque_pointer
7932 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7936 /* When comparing, say, char ** to char const **, this function takes
7937 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7938 types to this function. */
7941 comp_ptr_ttypes (tree to, tree from)
7943 return comp_ptr_ttypes_real (to, from, 1);
7946 /* Returns true iff FNTYPE is a non-class type that involves
7947 error_mark_node. We can get FUNCTION_TYPE with buried error_mark_node
7948 if a parameter type is ill-formed. */
7951 error_type_p (const_tree type)
7955 switch (TREE_CODE (type))
7961 case REFERENCE_TYPE:
7963 return error_type_p (TREE_TYPE (type));
7967 if (error_type_p (TREE_TYPE (type)))
7969 for (t = TYPE_ARG_TYPES (type); t; t = TREE_CHAIN (t))
7970 if (error_type_p (TREE_VALUE (t)))
7975 if (TYPE_PTRMEMFUNC_P (type))
7976 return error_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type));
7984 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7985 type or inheritance-related types, regardless of cv-quals. */
7988 ptr_reasonably_similar (const_tree to, const_tree from)
7990 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7992 /* Any target type is similar enough to void. */
7993 if (TREE_CODE (to) == VOID_TYPE)
7994 return !error_type_p (from);
7995 if (TREE_CODE (from) == VOID_TYPE)
7996 return !error_type_p (to);
7998 if (TREE_CODE (to) != TREE_CODE (from))
8001 if (TREE_CODE (from) == OFFSET_TYPE
8002 && comptypes (TYPE_OFFSET_BASETYPE (to),
8003 TYPE_OFFSET_BASETYPE (from),
8004 COMPARE_BASE | COMPARE_DERIVED))
8007 if (TREE_CODE (to) == VECTOR_TYPE
8008 && vector_types_convertible_p (to, from, false))
8011 if (TREE_CODE (to) == INTEGER_TYPE
8012 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
8015 if (TREE_CODE (to) == FUNCTION_TYPE)
8016 return !error_type_p (to) && !error_type_p (from);
8018 if (TREE_CODE (to) != POINTER_TYPE)
8020 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
8021 COMPARE_BASE | COMPARE_DERIVED);
8025 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
8026 pointer-to-member types) are the same, ignoring cv-qualification at
8030 comp_ptr_ttypes_const (tree to, tree from)
8032 bool is_opaque_pointer = false;
8034 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
8036 if (TREE_CODE (to) != TREE_CODE (from))
8039 if (TREE_CODE (from) == OFFSET_TYPE
8040 && same_type_p (TYPE_OFFSET_BASETYPE (from),
8041 TYPE_OFFSET_BASETYPE (to)))
8044 if (TREE_CODE (to) == VECTOR_TYPE)
8045 is_opaque_pointer = vector_targets_convertible_p (to, from);
8047 if (TREE_CODE (to) != POINTER_TYPE)
8048 return (is_opaque_pointer
8049 || same_type_ignoring_top_level_qualifiers_p (to, from));
8053 /* Returns the type qualifiers for this type, including the qualifiers on the
8054 elements for an array type. */
8057 cp_type_quals (const_tree type)
8060 /* This CONST_CAST is okay because strip_array_types returns its
8061 argument unmodified and we assign it to a const_tree. */
8062 type = strip_array_types (CONST_CAST_TREE (type));
8063 if (type == error_mark_node
8064 /* Quals on a FUNCTION_TYPE are memfn quals. */
8065 || TREE_CODE (type) == FUNCTION_TYPE)
8066 return TYPE_UNQUALIFIED;
8067 quals = TYPE_QUALS (type);
8068 /* METHOD and REFERENCE_TYPEs should never have quals. */
8069 gcc_assert ((TREE_CODE (type) != METHOD_TYPE
8070 && TREE_CODE (type) != REFERENCE_TYPE)
8071 || ((quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE))
8072 == TYPE_UNQUALIFIED));
8076 /* Returns the function-cv-quals for TYPE, which must be a FUNCTION_TYPE or
8080 type_memfn_quals (const_tree type)
8082 if (TREE_CODE (type) == FUNCTION_TYPE)
8083 return TYPE_QUALS (type);
8084 else if (TREE_CODE (type) == METHOD_TYPE)
8085 return cp_type_quals (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))));
8090 /* Returns the FUNCTION_TYPE TYPE with its function-cv-quals changed to
8094 apply_memfn_quals (tree type, cp_cv_quals memfn_quals)
8096 /* Could handle METHOD_TYPE here if necessary. */
8097 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
8098 if (TYPE_QUALS (type) == memfn_quals)
8100 /* This should really have a different TYPE_MAIN_VARIANT, but that gets
8102 return build_qualified_type (type, memfn_quals);
8105 /* Returns nonzero if TYPE is const or volatile. */
8108 cv_qualified_p (const_tree type)
8110 int quals = cp_type_quals (type);
8111 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
8114 /* Returns nonzero if the TYPE contains a mutable member. */
8117 cp_has_mutable_p (const_tree type)
8119 /* This CONST_CAST is okay because strip_array_types returns its
8120 argument unmodified and we assign it to a const_tree. */
8121 type = strip_array_types (CONST_CAST_TREE(type));
8123 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
8126 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
8127 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
8128 approximation. In particular, consider:
8131 struct S { int i; };
8132 const S s = { f(); }
8134 Here, we will make "s" as TREE_READONLY (because it is declared
8135 "const") -- only to reverse ourselves upon seeing that the
8136 initializer is non-constant. */
8139 cp_apply_type_quals_to_decl (int type_quals, tree decl)
8141 tree type = TREE_TYPE (decl);
8143 if (type == error_mark_node)
8146 if (TREE_CODE (decl) == TYPE_DECL)
8149 gcc_assert (!(TREE_CODE (type) == FUNCTION_TYPE
8150 && type_quals != TYPE_UNQUALIFIED));
8152 /* Avoid setting TREE_READONLY incorrectly. */
8153 if (/* If the object has a constructor, the constructor may modify
8155 TYPE_NEEDS_CONSTRUCTING (type)
8156 /* If the type isn't complete, we don't know yet if it will need
8158 || !COMPLETE_TYPE_P (type)
8159 /* If the type has a mutable component, that component might be
8161 || TYPE_HAS_MUTABLE_P (type))
8162 type_quals &= ~TYPE_QUAL_CONST;
8164 c_apply_type_quals_to_decl (type_quals, decl);
8167 /* Subroutine of casts_away_constness. Make T1 and T2 point at
8168 exemplar types such that casting T1 to T2 is casting away constness
8169 if and only if there is no implicit conversion from T1 to T2. */
8172 casts_away_constness_r (tree *t1, tree *t2)
8177 /* [expr.const.cast]
8179 For multi-level pointer to members and multi-level mixed pointers
8180 and pointers to members (conv.qual), the "member" aspect of a
8181 pointer to member level is ignored when determining if a const
8182 cv-qualifier has been cast away. */
8183 /* [expr.const.cast]
8185 For two pointer types:
8187 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
8188 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
8191 casting from X1 to X2 casts away constness if, for a non-pointer
8192 type T there does not exist an implicit conversion (clause
8195 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
8199 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
8200 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
8201 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
8203 *t1 = cp_build_qualified_type (void_type_node,
8204 cp_type_quals (*t1));
8205 *t2 = cp_build_qualified_type (void_type_node,
8206 cp_type_quals (*t2));
8210 quals1 = cp_type_quals (*t1);
8211 quals2 = cp_type_quals (*t2);
8213 if (TYPE_PTRMEM_P (*t1))
8214 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
8216 *t1 = TREE_TYPE (*t1);
8217 if (TYPE_PTRMEM_P (*t2))
8218 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
8220 *t2 = TREE_TYPE (*t2);
8222 casts_away_constness_r (t1, t2);
8223 *t1 = build_pointer_type (*t1);
8224 *t2 = build_pointer_type (*t2);
8225 *t1 = cp_build_qualified_type (*t1, quals1);
8226 *t2 = cp_build_qualified_type (*t2, quals2);
8229 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
8232 ??? This function returns non-zero if casting away qualifiers not
8233 just const. We would like to return to the caller exactly which
8234 qualifiers are casted away to give more accurate diagnostics.
8238 casts_away_constness (tree t1, tree t2)
8240 if (TREE_CODE (t2) == REFERENCE_TYPE)
8242 /* [expr.const.cast]
8244 Casting from an lvalue of type T1 to an lvalue of type T2
8245 using a reference cast casts away constness if a cast from an
8246 rvalue of type "pointer to T1" to the type "pointer to T2"
8247 casts away constness. */
8248 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
8249 return casts_away_constness (build_pointer_type (t1),
8250 build_pointer_type (TREE_TYPE (t2)));
8253 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
8254 /* [expr.const.cast]
8256 Casting from an rvalue of type "pointer to data member of X
8257 of type T1" to the type "pointer to data member of Y of type
8258 T2" casts away constness if a cast from an rvalue of type
8259 "pointer to T1" to the type "pointer to T2" casts away
8261 return casts_away_constness
8262 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
8263 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
8265 /* Casting away constness is only something that makes sense for
8266 pointer or reference types. */
8267 if (TREE_CODE (t1) != POINTER_TYPE
8268 || TREE_CODE (t2) != POINTER_TYPE)
8271 /* Top-level qualifiers don't matter. */
8272 t1 = TYPE_MAIN_VARIANT (t1);
8273 t2 = TYPE_MAIN_VARIANT (t2);
8274 casts_away_constness_r (&t1, &t2);
8275 if (!can_convert (t2, t1))
8281 /* If T is a REFERENCE_TYPE return the type to which T refers.
8282 Otherwise, return T itself. */
8285 non_reference (tree t)
8287 if (TREE_CODE (t) == REFERENCE_TYPE)
8293 /* Return nonzero if REF is an lvalue valid for this language;
8294 otherwise, print an error message and return zero. USE says
8295 how the lvalue is being used and so selects the error message. */
8298 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
8300 int win = lvalue_p (ref);
8302 if (!win && (complain & tf_error))