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
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"
41 #include "diagnostic.h"
48 static tree pfn_from_ptrmemfunc (tree);
49 static tree delta_from_ptrmemfunc (tree);
50 static tree convert_for_assignment (tree, tree, const char *, tree, int,
52 static tree cp_pointer_int_sum (enum tree_code, tree, tree);
53 static tree rationalize_conditional_expr (enum tree_code, tree,
55 static int comp_ptr_ttypes_real (tree, tree, int);
56 static bool comp_except_types (tree, tree, bool);
57 static bool comp_array_types (const_tree, const_tree, bool);
58 static tree pointer_diff (tree, tree, tree);
59 static tree get_delta_difference (tree, tree, bool, bool);
60 static void casts_away_constness_r (tree *, tree *);
61 static bool casts_away_constness (tree, tree);
62 static void maybe_warn_about_returning_address_of_local (tree);
63 static tree lookup_destructor (tree, tree, tree);
64 static int convert_arguments (tree, VEC(tree,gc) **, tree, int,
67 /* Do `exp = require_complete_type (exp);' to make sure exp
68 does not have an incomplete type. (That includes void types.)
69 Returns the error_mark_node if the VALUE does not have
70 complete type when this function returns. */
73 require_complete_type (tree value)
77 if (processing_template_decl || value == error_mark_node)
80 if (TREE_CODE (value) == OVERLOAD)
81 type = unknown_type_node;
83 type = TREE_TYPE (value);
85 if (type == error_mark_node)
86 return error_mark_node;
88 /* First, detect a valid value with a complete type. */
89 if (COMPLETE_TYPE_P (type))
92 if (complete_type_or_else (type, value))
95 return error_mark_node;
98 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
99 a template instantiation, do the instantiation. Returns TYPE,
100 whether or not it could be completed, unless something goes
101 horribly wrong, in which case the error_mark_node is returned. */
104 complete_type (tree type)
106 if (type == NULL_TREE)
107 /* Rather than crash, we return something sure to cause an error
109 return error_mark_node;
111 if (type == error_mark_node || COMPLETE_TYPE_P (type))
113 else if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type))
115 tree t = complete_type (TREE_TYPE (type));
116 unsigned int needs_constructing, has_nontrivial_dtor;
117 if (COMPLETE_TYPE_P (t) && !dependent_type_p (type))
120 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t));
122 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t));
123 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
125 TYPE_NEEDS_CONSTRUCTING (t) = needs_constructing;
126 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (t) = has_nontrivial_dtor;
129 else if (CLASS_TYPE_P (type) && CLASSTYPE_TEMPLATE_INSTANTIATION (type))
130 instantiate_class_template (TYPE_MAIN_VARIANT (type));
135 /* Like complete_type, but issue an error if the TYPE cannot be completed.
136 VALUE is used for informative diagnostics.
137 Returns NULL_TREE if the type cannot be made complete. */
140 complete_type_or_else (tree type, tree value)
142 type = complete_type (type);
143 if (type == error_mark_node)
144 /* We already issued an error. */
146 else if (!COMPLETE_TYPE_P (type))
148 cxx_incomplete_type_diagnostic (value, type, DK_ERROR);
155 /* Return truthvalue of whether type of EXP is instantiated. */
158 type_unknown_p (const_tree exp)
160 return (TREE_CODE (exp) == TREE_LIST
161 || TREE_TYPE (exp) == unknown_type_node);
165 /* Return the common type of two parameter lists.
166 We assume that comptypes has already been done and returned 1;
167 if that isn't so, this may crash.
169 As an optimization, free the space we allocate if the parameter
170 lists are already common. */
173 commonparms (tree p1, tree p2)
175 tree oldargs = p1, newargs, n;
179 len = list_length (p1);
180 newargs = tree_last (p1);
182 if (newargs == void_list_node)
191 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
196 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n), i++)
198 if (TREE_PURPOSE (p1) && !TREE_PURPOSE (p2))
200 TREE_PURPOSE (n) = TREE_PURPOSE (p1);
203 else if (! TREE_PURPOSE (p1))
205 if (TREE_PURPOSE (p2))
207 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
213 if (1 != simple_cst_equal (TREE_PURPOSE (p1), TREE_PURPOSE (p2)))
215 TREE_PURPOSE (n) = TREE_PURPOSE (p2);
217 if (TREE_VALUE (p1) != TREE_VALUE (p2))
220 TREE_VALUE (n) = merge_types (TREE_VALUE (p1), TREE_VALUE (p2));
223 TREE_VALUE (n) = TREE_VALUE (p1);
231 /* Given a type, perhaps copied for a typedef,
232 find the "original" version of it. */
234 original_type (tree t)
236 int quals = cp_type_quals (t);
237 while (t != error_mark_node
238 && TYPE_NAME (t) != NULL_TREE)
240 tree x = TYPE_NAME (t);
241 if (TREE_CODE (x) != TYPE_DECL)
243 x = DECL_ORIGINAL_TYPE (x);
248 return cp_build_qualified_type (t, quals);
251 /* Return the common type for two arithmetic types T1 and T2 under the
252 usual arithmetic conversions. The default conversions have already
253 been applied, and enumerated types converted to their compatible
257 cp_common_type (tree t1, tree t2)
259 enum tree_code code1 = TREE_CODE (t1);
260 enum tree_code code2 = TREE_CODE (t2);
263 /* In what follows, we slightly generalize the rules given in [expr] so
264 as to deal with `long long' and `complex'. First, merge the
266 attributes = (*targetm.merge_type_attributes) (t1, t2);
268 if (SCOPED_ENUM_P (t1) || SCOPED_ENUM_P (t2))
270 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
271 return build_type_attribute_variant (t1, attributes);
276 /* FIXME: Attributes. */
277 gcc_assert (ARITHMETIC_TYPE_P (t1)
278 || TREE_CODE (t1) == VECTOR_TYPE
279 || UNSCOPED_ENUM_P (t1));
280 gcc_assert (ARITHMETIC_TYPE_P (t2)
281 || TREE_CODE (t2) == VECTOR_TYPE
282 || UNSCOPED_ENUM_P (t2));
284 /* If one type is complex, form the common type of the non-complex
285 components, then make that complex. Use T1 or T2 if it is the
287 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
289 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
290 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
292 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
294 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
295 return build_type_attribute_variant (t1, attributes);
296 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
297 return build_type_attribute_variant (t2, attributes);
299 return build_type_attribute_variant (build_complex_type (subtype),
303 if (code1 == VECTOR_TYPE)
305 /* When we get here we should have two vectors of the same size.
306 Just prefer the unsigned one if present. */
307 if (TYPE_UNSIGNED (t1))
308 return build_type_attribute_variant (t1, attributes);
310 return build_type_attribute_variant (t2, attributes);
313 /* If only one is real, use it as the result. */
314 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
315 return build_type_attribute_variant (t1, attributes);
316 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
317 return build_type_attribute_variant (t2, attributes);
319 /* Both real or both integers; use the one with greater precision. */
320 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
321 return build_type_attribute_variant (t1, attributes);
322 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
323 return build_type_attribute_variant (t2, attributes);
325 /* The types are the same; no need to do anything fancy. */
326 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
327 return build_type_attribute_variant (t1, attributes);
329 if (code1 != REAL_TYPE)
331 /* If one is unsigned long long, then convert the other to unsigned
333 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
334 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
335 return build_type_attribute_variant (long_long_unsigned_type_node,
337 /* If one is a long long, and the other is an unsigned long, and
338 long long can represent all the values of an unsigned long, then
339 convert to a long long. Otherwise, convert to an unsigned long
340 long. Otherwise, if either operand is long long, convert the
343 Since we're here, we know the TYPE_PRECISION is the same;
344 therefore converting to long long cannot represent all the values
345 of an unsigned long, so we choose unsigned long long in that
347 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
348 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
350 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
351 ? long_long_unsigned_type_node
352 : long_long_integer_type_node);
353 return build_type_attribute_variant (t, attributes);
356 /* Go through the same procedure, but for longs. */
357 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
358 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
359 return build_type_attribute_variant (long_unsigned_type_node,
361 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
362 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
364 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
365 ? long_unsigned_type_node : long_integer_type_node);
366 return build_type_attribute_variant (t, attributes);
368 /* Otherwise prefer the unsigned one. */
369 if (TYPE_UNSIGNED (t1))
370 return build_type_attribute_variant (t1, attributes);
372 return build_type_attribute_variant (t2, attributes);
376 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
377 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
378 return build_type_attribute_variant (long_double_type_node,
380 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
381 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
382 return build_type_attribute_variant (double_type_node,
384 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
385 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
386 return build_type_attribute_variant (float_type_node,
389 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
390 the standard C++ floating-point types. Logic earlier in this
391 function has already eliminated the possibility that
392 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
393 compelling reason to choose one or the other. */
394 return build_type_attribute_variant (t1, attributes);
398 /* T1 and T2 are arithmetic or enumeration types. Return the type
399 that will result from the "usual arithmetic conversions" on T1 and
400 T2 as described in [expr]. */
403 type_after_usual_arithmetic_conversions (tree t1, tree t2)
405 gcc_assert (ARITHMETIC_TYPE_P (t1)
406 || TREE_CODE (t1) == VECTOR_TYPE
407 || UNSCOPED_ENUM_P (t1));
408 gcc_assert (ARITHMETIC_TYPE_P (t2)
409 || TREE_CODE (t2) == VECTOR_TYPE
410 || UNSCOPED_ENUM_P (t2));
412 /* Perform the integral promotions. We do not promote real types here. */
413 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
414 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
416 t1 = type_promotes_to (t1);
417 t2 = type_promotes_to (t2);
420 return cp_common_type (t1, t2);
423 /* Subroutine of composite_pointer_type to implement the recursive
424 case. See that function for documentation of the parameters. */
427 composite_pointer_type_r (tree t1, tree t2,
428 composite_pointer_operation operation,
429 tsubst_flags_t complain)
436 /* Determine the types pointed to by T1 and T2. */
437 if (TREE_CODE (t1) == POINTER_TYPE)
439 pointee1 = TREE_TYPE (t1);
440 pointee2 = TREE_TYPE (t2);
444 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
445 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
450 Otherwise, the composite pointer type is a pointer type
451 similar (_conv.qual_) to the type of one of the operands,
452 with a cv-qualification signature (_conv.qual_) that is the
453 union of the cv-qualification signatures of the operand
455 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
456 result_type = pointee1;
457 else if ((TREE_CODE (pointee1) == POINTER_TYPE
458 && TREE_CODE (pointee2) == POINTER_TYPE)
459 || (TYPE_PTR_TO_MEMBER_P (pointee1)
460 && TYPE_PTR_TO_MEMBER_P (pointee2)))
461 result_type = composite_pointer_type_r (pointee1, pointee2, operation,
465 if (complain & tf_error)
470 permerror (input_location, "comparison between "
471 "distinct pointer types %qT and %qT lacks a cast",
475 permerror (input_location, "conversion between "
476 "distinct pointer types %qT and %qT lacks a cast",
479 case CPO_CONDITIONAL_EXPR:
480 permerror (input_location, "conditional expression between "
481 "distinct pointer types %qT and %qT lacks a cast",
488 result_type = void_type_node;
490 result_type = cp_build_qualified_type (result_type,
491 (cp_type_quals (pointee1)
492 | cp_type_quals (pointee2)));
493 /* If the original types were pointers to members, so is the
495 if (TYPE_PTR_TO_MEMBER_P (t1))
497 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
498 TYPE_PTRMEM_CLASS_TYPE (t2))
499 && (complain & tf_error))
504 permerror (input_location, "comparison between "
505 "distinct pointer types %qT and %qT lacks a cast",
509 permerror (input_location, "conversion between "
510 "distinct pointer types %qT and %qT lacks a cast",
513 case CPO_CONDITIONAL_EXPR:
514 permerror (input_location, "conditional expression between "
515 "distinct pointer types %qT and %qT lacks a cast",
522 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
526 result_type = build_pointer_type (result_type);
528 /* Merge the attributes. */
529 attributes = (*targetm.merge_type_attributes) (t1, t2);
530 return build_type_attribute_variant (result_type, attributes);
533 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
534 ARG1 and ARG2 are the values with those types. The OPERATION is to
535 describe the operation between the pointer types,
536 in case an error occurs.
538 This routine also implements the computation of a common type for
539 pointers-to-members as per [expr.eq]. */
542 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
543 composite_pointer_operation operation,
544 tsubst_flags_t complain)
551 If one operand is a null pointer constant, the composite pointer
552 type is the type of the other operand. */
553 if (null_ptr_cst_p (arg1))
555 if (null_ptr_cst_p (arg2))
562 If one of the operands has type "pointer to cv1 void*", then
563 the other has type "pointer to cv2T", and the composite pointer
564 type is "pointer to cv12 void", where cv12 is the union of cv1
567 If either type is a pointer to void, make sure it is T1. */
568 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
576 /* Now, if T1 is a pointer to void, merge the qualifiers. */
577 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
582 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
587 pedwarn (input_location, OPT_pedantic,
588 "ISO C++ forbids comparison between "
589 "pointer of type %<void *%> and pointer-to-function");
592 pedwarn (input_location, OPT_pedantic,
593 "ISO C++ forbids conversion between "
594 "pointer of type %<void *%> and pointer-to-function");
596 case CPO_CONDITIONAL_EXPR:
597 pedwarn (input_location, OPT_pedantic,
598 "ISO C++ forbids conditional expression between "
599 "pointer of type %<void *%> and pointer-to-function");
606 = cp_build_qualified_type (void_type_node,
607 (cp_type_quals (TREE_TYPE (t1))
608 | cp_type_quals (TREE_TYPE (t2))));
609 result_type = build_pointer_type (result_type);
610 /* Merge the attributes. */
611 attributes = (*targetm.merge_type_attributes) (t1, t2);
612 return build_type_attribute_variant (result_type, attributes);
615 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
616 && TREE_CODE (t2) == POINTER_TYPE)
618 if (objc_compare_types (t1, t2, -3, NULL_TREE))
622 /* [expr.eq] permits the application of a pointer conversion to
623 bring the pointers to a common type. */
624 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
625 && CLASS_TYPE_P (TREE_TYPE (t1))
626 && CLASS_TYPE_P (TREE_TYPE (t2))
627 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
630 class1 = TREE_TYPE (t1);
631 class2 = TREE_TYPE (t2);
633 if (DERIVED_FROM_P (class1, class2))
634 t2 = (build_pointer_type
635 (cp_build_qualified_type (class1, TYPE_QUALS (class2))));
636 else if (DERIVED_FROM_P (class2, class1))
637 t1 = (build_pointer_type
638 (cp_build_qualified_type (class2, TYPE_QUALS (class1))));
641 if (complain & tf_error)
645 error ("comparison between distinct "
646 "pointer types %qT and %qT lacks a cast", t1, t2);
649 error ("conversion between distinct "
650 "pointer types %qT and %qT lacks a cast", t1, t2);
652 case CPO_CONDITIONAL_EXPR:
653 error ("conditional expression between distinct "
654 "pointer types %qT and %qT lacks a cast", t1, t2);
659 return error_mark_node;
662 /* [expr.eq] permits the application of a pointer-to-member
663 conversion to change the class type of one of the types. */
664 else if (TYPE_PTR_TO_MEMBER_P (t1)
665 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
666 TYPE_PTRMEM_CLASS_TYPE (t2)))
668 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
669 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
671 if (DERIVED_FROM_P (class1, class2))
672 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
673 else if (DERIVED_FROM_P (class2, class1))
674 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
677 if (complain & tf_error)
681 error ("comparison between distinct "
682 "pointer-to-member types %qT and %qT lacks a cast",
686 error ("conversion between distinct "
687 "pointer-to-member types %qT and %qT lacks a cast",
690 case CPO_CONDITIONAL_EXPR:
691 error ("conditional expression between distinct "
692 "pointer-to-member types %qT and %qT lacks a cast",
698 return error_mark_node;
702 return composite_pointer_type_r (t1, t2, operation, complain);
705 /* Return the merged type of two types.
706 We assume that comptypes has already been done and returned 1;
707 if that isn't so, this may crash.
709 This just combines attributes and default arguments; any other
710 differences would cause the two types to compare unalike. */
713 merge_types (tree t1, tree t2)
715 enum tree_code code1;
716 enum tree_code code2;
719 /* Save time if the two types are the same. */
722 if (original_type (t1) == original_type (t2))
725 /* If one type is nonsense, use the other. */
726 if (t1 == error_mark_node)
728 if (t2 == error_mark_node)
731 /* Merge the attributes. */
732 attributes = (*targetm.merge_type_attributes) (t1, t2);
734 if (TYPE_PTRMEMFUNC_P (t1))
735 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
736 if (TYPE_PTRMEMFUNC_P (t2))
737 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
739 code1 = TREE_CODE (t1);
740 code2 = TREE_CODE (t2);
743 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
744 if (code1 == TYPENAME_TYPE)
746 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
747 code1 = TREE_CODE (t1);
751 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
752 code2 = TREE_CODE (t2);
760 /* For two pointers, do this recursively on the target type. */
762 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
763 int quals = cp_type_quals (t1);
765 if (code1 == POINTER_TYPE)
766 t1 = build_pointer_type (target);
768 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
769 t1 = build_type_attribute_variant (t1, attributes);
770 t1 = cp_build_qualified_type (t1, quals);
772 if (TREE_CODE (target) == METHOD_TYPE)
773 t1 = build_ptrmemfunc_type (t1);
782 quals = cp_type_quals (t1);
783 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
784 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
785 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
787 t1 = cp_build_qualified_type (t1, quals);
793 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
794 /* Save space: see if the result is identical to one of the args. */
795 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
796 return build_type_attribute_variant (t1, attributes);
797 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
798 return build_type_attribute_variant (t2, attributes);
799 /* Merge the element types, and have a size if either arg has one. */
800 t1 = build_cplus_array_type
801 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
806 /* Function types: prefer the one that specified arg types.
807 If both do, merge the arg types. Also merge the return types. */
809 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
810 tree p1 = TYPE_ARG_TYPES (t1);
811 tree p2 = TYPE_ARG_TYPES (t2);
814 /* Save space: see if the result is identical to one of the args. */
815 if (valtype == TREE_TYPE (t1) && ! p2)
816 return cp_build_type_attribute_variant (t1, attributes);
817 if (valtype == TREE_TYPE (t2) && ! p1)
818 return cp_build_type_attribute_variant (t2, attributes);
820 /* Simple way if one arg fails to specify argument types. */
821 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
823 rval = build_function_type (valtype, p2);
824 if ((raises = TYPE_RAISES_EXCEPTIONS (t2)))
825 rval = build_exception_variant (rval, raises);
826 return cp_build_type_attribute_variant (rval, attributes);
828 raises = TYPE_RAISES_EXCEPTIONS (t1);
829 if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
831 rval = build_function_type (valtype, p1);
833 rval = build_exception_variant (rval, raises);
834 return cp_build_type_attribute_variant (rval, attributes);
837 rval = build_function_type (valtype, commonparms (p1, p2));
838 t1 = build_exception_variant (rval, raises);
844 /* Get this value the long way, since TYPE_METHOD_BASETYPE
845 is just the main variant of this. */
846 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
847 tree raises = TYPE_RAISES_EXCEPTIONS (t1);
850 /* If this was a member function type, get back to the
851 original type of type member function (i.e., without
852 the class instance variable up front. */
853 t1 = build_function_type (TREE_TYPE (t1),
854 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
855 t2 = build_function_type (TREE_TYPE (t2),
856 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
857 t3 = merge_types (t1, t2);
858 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
859 TYPE_ARG_TYPES (t3));
860 t1 = build_exception_variant (t3, raises);
865 /* There is no need to merge attributes into a TYPENAME_TYPE.
866 When the type is instantiated it will have whatever
867 attributes result from the instantiation. */
873 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
875 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
878 return cp_build_type_attribute_variant (t1, attributes);
881 /* Wrapper around cp_common_type that is used by c-common.c and other
882 front end optimizations that remove promotions.
884 Return the common type for two arithmetic types T1 and T2 under the
885 usual arithmetic conversions. The default conversions have already
886 been applied, and enumerated types converted to their compatible
890 common_type (tree t1, tree t2)
892 /* If one type is nonsense, use the other */
893 if (t1 == error_mark_node)
895 if (t2 == error_mark_node)
898 return cp_common_type (t1, t2);
901 /* Return the common type of two pointer types T1 and T2. This is the
902 type for the result of most arithmetic operations if the operands
903 have the given two types.
905 We assume that comp_target_types has already been done and returned
906 nonzero; if that isn't so, this may crash. */
909 common_pointer_type (tree t1, tree t2)
911 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
912 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
913 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
915 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
916 CPO_CONVERSION, tf_warning_or_error);
919 /* Compare two exception specifier types for exactness or subsetness, if
920 allowed. Returns false for mismatch, true for match (same, or
923 [except.spec] "If a class X ... objects of class X or any class publicly
924 and unambiguously derived from X. Similarly, if a pointer type Y * ...
925 exceptions of type Y * or that are pointers to any type publicly and
926 unambiguously derived from Y. Otherwise a function only allows exceptions
927 that have the same type ..."
928 This does not mention cv qualifiers and is different to what throw
929 [except.throw] and catch [except.catch] will do. They will ignore the
930 top level cv qualifiers, and allow qualifiers in the pointer to class
933 We implement the letter of the standard. */
936 comp_except_types (tree a, tree b, bool exact)
938 if (same_type_p (a, b))
942 if (cp_type_quals (a) || cp_type_quals (b))
945 if (TREE_CODE (a) == POINTER_TYPE
946 && TREE_CODE (b) == POINTER_TYPE)
950 if (cp_type_quals (a) || cp_type_quals (b))
954 if (TREE_CODE (a) != RECORD_TYPE
955 || TREE_CODE (b) != RECORD_TYPE)
958 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
964 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
965 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
966 otherwise it must be exact. Exception lists are unordered, but
967 we've already filtered out duplicates. Most lists will be in order,
968 we should try to make use of that. */
971 comp_except_specs (const_tree t1, const_tree t2, bool exact)
980 if (t1 == NULL_TREE) /* T1 is ... */
981 return t2 == NULL_TREE || !exact;
982 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
983 return t2 != NULL_TREE && !TREE_VALUE (t2);
984 if (t2 == NULL_TREE) /* T2 is ... */
986 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
989 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
990 Count how many we find, to determine exactness. For exact matching and
991 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
993 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
995 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
997 tree a = TREE_VALUE (probe);
998 tree b = TREE_VALUE (t2);
1000 if (comp_except_types (a, b, exact))
1002 if (probe == base && exact)
1003 base = TREE_CHAIN (probe);
1008 if (probe == NULL_TREE)
1011 return !exact || base == NULL_TREE || length == list_length (t1);
1014 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
1015 [] can match [size]. */
1018 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
1027 /* The type of the array elements must be the same. */
1028 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1031 d1 = TYPE_DOMAIN (t1);
1032 d2 = TYPE_DOMAIN (t2);
1037 /* If one of the arrays is dimensionless, and the other has a
1038 dimension, they are of different types. However, it is valid to
1046 declarations for an array object can specify
1047 array types that differ by the presence or absence of a major
1048 array bound (_dcl.array_). */
1050 return allow_redeclaration;
1052 /* Check that the dimensions are the same. */
1054 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
1056 max1 = TYPE_MAX_VALUE (d1);
1057 max2 = TYPE_MAX_VALUE (d2);
1058 if (processing_template_decl && !abi_version_at_least (2)
1059 && !value_dependent_expression_p (max1)
1060 && !value_dependent_expression_p (max2))
1062 /* With abi-1 we do not fold non-dependent array bounds, (and
1063 consequently mangle them incorrectly). We must therefore
1064 fold them here, to verify the domains have the same
1070 if (!cp_tree_equal (max1, max2))
1076 /* Subroutine in comptypes. */
1079 structural_comptypes (tree t1, tree t2, int strict)
1084 /* Suppress errors caused by previously reported errors. */
1085 if (t1 == error_mark_node || t2 == error_mark_node)
1088 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
1090 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
1091 current instantiation. */
1092 if (TREE_CODE (t1) == TYPENAME_TYPE)
1093 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
1095 if (TREE_CODE (t2) == TYPENAME_TYPE)
1096 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
1098 if (TYPE_PTRMEMFUNC_P (t1))
1099 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
1100 if (TYPE_PTRMEMFUNC_P (t2))
1101 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1103 /* Different classes of types can't be compatible. */
1104 if (TREE_CODE (t1) != TREE_CODE (t2))
1107 /* Qualifiers must match. For array types, we will check when we
1108 recur on the array element types. */
1109 if (TREE_CODE (t1) != ARRAY_TYPE
1110 && TYPE_QUALS (t1) != TYPE_QUALS (t2))
1112 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1115 /* Allow for two different type nodes which have essentially the same
1116 definition. Note that we already checked for equality of the type
1117 qualifiers (just above). */
1119 if (TREE_CODE (t1) != ARRAY_TYPE
1120 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1123 /* Compare the types. Break out if they could be the same. */
1124 switch (TREE_CODE (t1))
1128 /* All void and bool types are the same. */
1132 case FIXED_POINT_TYPE:
1134 /* With these nodes, we can't determine type equivalence by
1135 looking at what is stored in the nodes themselves, because
1136 two nodes might have different TYPE_MAIN_VARIANTs but still
1137 represent the same type. For example, wchar_t and int could
1138 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1139 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1140 and are distinct types. On the other hand, int and the
1143 typedef int INT __attribute((may_alias));
1145 have identical properties, different TYPE_MAIN_VARIANTs, but
1146 represent the same type. The canonical type system keeps
1147 track of equivalence in this case, so we fall back on it. */
1148 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1150 case TEMPLATE_TEMPLATE_PARM:
1151 case BOUND_TEMPLATE_TEMPLATE_PARM:
1152 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1153 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1154 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1155 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1157 if (!comp_template_parms
1158 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1159 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1161 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1163 /* Don't check inheritance. */
1164 strict = COMPARE_STRICT;
1169 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1170 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1171 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1172 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1175 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1177 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1183 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1184 strict & ~COMPARE_REDECLARATION))
1186 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1190 case REFERENCE_TYPE:
1191 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1193 /* fall through to checks for pointer types */
1196 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1197 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1198 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1204 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1206 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1211 /* Target types must match incl. qualifiers. */
1212 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1216 case TEMPLATE_TYPE_PARM:
1217 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1218 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1219 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1220 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1225 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1226 TYPENAME_TYPE_FULLNAME (t2)))
1228 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1232 case UNBOUND_CLASS_TEMPLATE:
1233 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1235 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1240 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1245 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1246 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1250 case TYPE_PACK_EXPANSION:
1251 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1252 PACK_EXPANSION_PATTERN (t2));
1255 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1256 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1257 || (DECLTYPE_FOR_LAMBDA_CAPTURE (t1)
1258 != DECLTYPE_FOR_LAMBDA_CAPTURE (t2))
1259 || (DECLTYPE_FOR_LAMBDA_RETURN (t1)
1260 != DECLTYPE_FOR_LAMBDA_RETURN (t2))
1261 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1262 DECLTYPE_TYPE_EXPR (t2)))
1270 /* If we get here, we know that from a target independent POV the
1271 types are the same. Make sure the target attributes are also
1273 return targetm.comp_type_attributes (t1, t2);
1276 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1277 is a bitwise-or of the COMPARE_* flags. */
1280 comptypes (tree t1, tree t2, int strict)
1282 if (strict == COMPARE_STRICT)
1287 if (t1 == error_mark_node || t2 == error_mark_node)
1290 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1291 /* At least one of the types requires structural equality, so
1292 perform a deep check. */
1293 return structural_comptypes (t1, t2, strict);
1295 #ifdef ENABLE_CHECKING
1296 if (USE_CANONICAL_TYPES)
1298 bool result = structural_comptypes (t1, t2, strict);
1300 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1301 /* The two types are structurally equivalent, but their
1302 canonical types were different. This is a failure of the
1303 canonical type propagation code.*/
1305 ("canonical types differ for identical types %T and %T",
1307 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1308 /* Two types are structurally different, but the canonical
1309 types are the same. This means we were over-eager in
1310 assigning canonical types. */
1312 ("same canonical type node for different types %T and %T",
1318 if (USE_CANONICAL_TYPES)
1319 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1322 return structural_comptypes (t1, t2, strict);
1324 else if (strict == COMPARE_STRUCTURAL)
1325 return structural_comptypes (t1, t2, COMPARE_STRICT);
1327 return structural_comptypes (t1, t2, strict);
1330 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1333 at_least_as_qualified_p (const_tree type1, const_tree type2)
1335 int q1 = cp_type_quals (type1);
1336 int q2 = cp_type_quals (type2);
1338 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1339 return (q1 & q2) == q2;
1342 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1343 more cv-qualified that TYPE1, and 0 otherwise. */
1346 comp_cv_qualification (const_tree type1, const_tree type2)
1348 int q1 = cp_type_quals (type1);
1349 int q2 = cp_type_quals (type2);
1354 if ((q1 & q2) == q2)
1356 else if ((q1 & q2) == q1)
1362 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1363 subset of the cv-qualification signature of TYPE2, and the types
1364 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1367 comp_cv_qual_signature (tree type1, tree type2)
1369 if (comp_ptr_ttypes_real (type2, type1, -1))
1371 else if (comp_ptr_ttypes_real (type1, type2, -1))
1377 /* Subroutines of `comptypes'. */
1379 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1380 equivalent in the sense that functions with those parameter types
1381 can have equivalent types. The two lists must be equivalent,
1382 element by element. */
1385 compparms (const_tree parms1, const_tree parms2)
1389 /* An unspecified parmlist matches any specified parmlist
1390 whose argument types don't need default promotions. */
1392 for (t1 = parms1, t2 = parms2;
1394 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1396 /* If one parmlist is shorter than the other,
1397 they fail to match. */
1400 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1407 /* Process a sizeof or alignof expression where the operand is a
1411 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1416 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1417 if (type == error_mark_node)
1418 return error_mark_node;
1420 type = non_reference (type);
1421 if (TREE_CODE (type) == METHOD_TYPE)
1424 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1425 "invalid application of %qs to a member function",
1426 operator_name_info[(int) op].name);
1427 value = size_one_node;
1430 dependent_p = dependent_type_p (type);
1432 complete_type (type);
1434 /* VLA types will have a non-constant size. In the body of an
1435 uninstantiated template, we don't need to try to compute the
1436 value, because the sizeof expression is not an integral
1437 constant expression in that case. And, if we do try to
1438 compute the value, we'll likely end up with SAVE_EXPRs, which
1439 the template substitution machinery does not expect to see. */
1440 || (processing_template_decl
1441 && COMPLETE_TYPE_P (type)
1442 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1444 value = build_min (op, size_type_node, type);
1445 TREE_READONLY (value) = 1;
1449 return c_sizeof_or_alignof_type (input_location, complete_type (type),
1454 /* Return the size of the type, without producing any warnings for
1455 types whose size cannot be taken. This routine should be used only
1456 in some other routine that has already produced a diagnostic about
1457 using the size of such a type. */
1459 cxx_sizeof_nowarn (tree type)
1461 if (TREE_CODE (type) == FUNCTION_TYPE
1462 || TREE_CODE (type) == VOID_TYPE
1463 || TREE_CODE (type) == ERROR_MARK)
1464 return size_one_node;
1465 else if (!COMPLETE_TYPE_P (type))
1466 return size_zero_node;
1468 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1471 /* Process a sizeof expression where the operand is an expression. */
1474 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1476 if (e == error_mark_node)
1477 return error_mark_node;
1479 if (processing_template_decl)
1481 e = build_min (SIZEOF_EXPR, size_type_node, e);
1482 TREE_SIDE_EFFECTS (e) = 0;
1483 TREE_READONLY (e) = 1;
1488 if (TREE_CODE (e) == COMPONENT_REF
1489 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1490 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1492 if (complain & tf_error)
1493 error ("invalid application of %<sizeof%> to a bit-field");
1495 return error_mark_node;
1498 else if (is_overloaded_fn (e))
1500 if (complain & tf_error)
1501 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1504 return error_mark_node;
1507 else if (type_unknown_p (e))
1509 if (complain & tf_error)
1510 cxx_incomplete_type_error (e, TREE_TYPE (e));
1512 return error_mark_node;
1518 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1521 /* Implement the __alignof keyword: Return the minimum required
1522 alignment of E, measured in bytes. For VAR_DECL's and
1523 FIELD_DECL's return DECL_ALIGN (which can be set from an
1524 "aligned" __attribute__ specification). */
1527 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1531 if (e == error_mark_node)
1532 return error_mark_node;
1534 if (processing_template_decl)
1536 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1537 TREE_SIDE_EFFECTS (e) = 0;
1538 TREE_READONLY (e) = 1;
1543 if (TREE_CODE (e) == VAR_DECL)
1544 t = size_int (DECL_ALIGN_UNIT (e));
1545 else if (TREE_CODE (e) == COMPONENT_REF
1546 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1547 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1549 if (complain & tf_error)
1550 error ("invalid application of %<__alignof%> to a bit-field");
1552 return error_mark_node;
1555 else if (TREE_CODE (e) == COMPONENT_REF
1556 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1557 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1558 else if (is_overloaded_fn (e))
1560 if (complain & tf_error)
1561 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1564 return error_mark_node;
1565 if (TREE_CODE (e) == FUNCTION_DECL)
1566 t = size_int (DECL_ALIGN_UNIT (e));
1570 else if (type_unknown_p (e))
1572 if (complain & tf_error)
1573 cxx_incomplete_type_error (e, TREE_TYPE (e));
1575 return error_mark_node;
1579 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1580 complain & tf_error);
1582 return fold_convert (size_type_node, t);
1585 /* Process a sizeof or alignof expression E with code OP where the operand
1586 is an expression. */
1589 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1591 if (op == SIZEOF_EXPR)
1592 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1594 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1597 /* EXPR is being used in a context that is not a function call.
1602 The expression can be used only as the left-hand operand of a
1603 member function call.
1605 [expr.mptr.operator]
1607 If the result of .* or ->* is a function, then that result can be
1608 used only as the operand for the function call operator ().
1610 by issuing an error message if appropriate. Returns true iff EXPR
1611 violates these rules. */
1614 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1616 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1618 if (complain & tf_error)
1619 error ("invalid use of non-static member function");
1625 /* If EXP is a reference to a bitfield, and the type of EXP does not
1626 match the declared type of the bitfield, return the declared type
1627 of the bitfield. Otherwise, return NULL_TREE. */
1630 is_bitfield_expr_with_lowered_type (const_tree exp)
1632 switch (TREE_CODE (exp))
1635 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1636 ? TREE_OPERAND (exp, 1)
1637 : TREE_OPERAND (exp, 0)))
1639 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1642 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1646 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1652 field = TREE_OPERAND (exp, 1);
1653 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1655 if (same_type_ignoring_top_level_qualifiers_p
1656 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1658 return DECL_BIT_FIELD_TYPE (field);
1662 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1663 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1664 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1672 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1673 bitfield with a lowered type, the type of EXP is returned, rather
1677 unlowered_expr_type (const_tree exp)
1681 type = is_bitfield_expr_with_lowered_type (exp);
1683 type = TREE_TYPE (exp);
1688 /* Perform the conversions in [expr] that apply when an lvalue appears
1689 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1690 function-to-pointer conversions. In addition, manifest constants
1691 are replaced by their values, and bitfield references are converted
1692 to their declared types.
1694 Although the returned value is being used as an rvalue, this
1695 function does not wrap the returned expression in a
1696 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1697 that the return value is no longer an lvalue. */
1700 decay_conversion (tree exp)
1703 enum tree_code code;
1705 type = TREE_TYPE (exp);
1706 if (type == error_mark_node)
1707 return error_mark_node;
1709 exp = resolve_nondeduced_context (exp);
1710 if (type_unknown_p (exp))
1712 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1713 return error_mark_node;
1716 exp = decl_constant_value (exp);
1717 if (error_operand_p (exp))
1718 return error_mark_node;
1720 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1721 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1722 code = TREE_CODE (type);
1723 if (code == VOID_TYPE)
1725 error ("void value not ignored as it ought to be");
1726 return error_mark_node;
1728 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1729 return error_mark_node;
1730 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1731 return cp_build_unary_op (ADDR_EXPR, exp, 0, tf_warning_or_error);
1732 if (code == ARRAY_TYPE)
1737 if (TREE_CODE (exp) == INDIRECT_REF)
1738 return build_nop (build_pointer_type (TREE_TYPE (type)),
1739 TREE_OPERAND (exp, 0));
1741 if (TREE_CODE (exp) == COMPOUND_EXPR)
1743 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1744 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1745 TREE_OPERAND (exp, 0), op1);
1749 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1751 error ("invalid use of non-lvalue array");
1752 return error_mark_node;
1755 ptrtype = build_pointer_type (TREE_TYPE (type));
1757 if (TREE_CODE (exp) == VAR_DECL)
1759 if (!cxx_mark_addressable (exp))
1760 return error_mark_node;
1761 adr = build_nop (ptrtype, build_address (exp));
1764 /* This way is better for a COMPONENT_REF since it can
1765 simplify the offset for a component. */
1766 adr = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
1767 return cp_convert (ptrtype, adr);
1770 /* If a bitfield is used in a context where integral promotion
1771 applies, then the caller is expected to have used
1772 default_conversion. That function promotes bitfields correctly
1773 before calling this function. At this point, if we have a
1774 bitfield referenced, we may assume that is not subject to
1775 promotion, and that, therefore, the type of the resulting rvalue
1776 is the declared type of the bitfield. */
1777 exp = convert_bitfield_to_declared_type (exp);
1779 /* We do not call rvalue() here because we do not want to wrap EXP
1780 in a NON_LVALUE_EXPR. */
1784 Non-class rvalues always have cv-unqualified types. */
1785 type = TREE_TYPE (exp);
1786 if (!CLASS_TYPE_P (type) && cv_qualified_p (type))
1787 exp = build_nop (cv_unqualified (type), exp);
1792 /* Perform preparatory conversions, as part of the "usual arithmetic
1793 conversions". In particular, as per [expr]:
1795 Whenever an lvalue expression appears as an operand of an
1796 operator that expects the rvalue for that operand, the
1797 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1798 standard conversions are applied to convert the expression to an
1801 In addition, we perform integral promotions here, as those are
1802 applied to both operands to a binary operator before determining
1803 what additional conversions should apply. */
1806 default_conversion (tree exp)
1808 /* Check for target-specific promotions. */
1809 tree promoted_type = targetm.promoted_type (TREE_TYPE (exp));
1811 exp = cp_convert (promoted_type, exp);
1812 /* Perform the integral promotions first so that bitfield
1813 expressions (which may promote to "int", even if the bitfield is
1814 declared "unsigned") are promoted correctly. */
1815 else if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1816 exp = perform_integral_promotions (exp);
1817 /* Perform the other conversions. */
1818 exp = decay_conversion (exp);
1823 /* EXPR is an expression with an integral or enumeration type.
1824 Perform the integral promotions in [conv.prom], and return the
1828 perform_integral_promotions (tree expr)
1835 If the bitfield has an enumerated type, it is treated as any
1836 other value of that type for promotion purposes. */
1837 type = is_bitfield_expr_with_lowered_type (expr);
1838 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
1839 type = TREE_TYPE (expr);
1840 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1841 promoted_type = type_promotes_to (type);
1842 if (type != promoted_type)
1843 expr = cp_convert (promoted_type, expr);
1847 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1848 decay_conversion to one. */
1851 string_conv_p (const_tree totype, const_tree exp, int warn)
1855 if (TREE_CODE (totype) != POINTER_TYPE)
1858 t = TREE_TYPE (totype);
1859 if (!same_type_p (t, char_type_node)
1860 && !same_type_p (t, char16_type_node)
1861 && !same_type_p (t, char32_type_node)
1862 && !same_type_p (t, wchar_type_node))
1865 if (TREE_CODE (exp) == STRING_CST)
1867 /* Make sure that we don't try to convert between char and wide chars. */
1868 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1873 /* Is this a string constant which has decayed to 'const char *'? */
1874 t = build_pointer_type (build_qualified_type (t, TYPE_QUAL_CONST));
1875 if (!same_type_p (TREE_TYPE (exp), t))
1878 if (TREE_CODE (exp) != ADDR_EXPR
1879 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
1883 /* This warning is not very useful, as it complains about printf. */
1885 warning (OPT_Wwrite_strings,
1886 "deprecated conversion from string constant to %qT",
1892 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1893 can, for example, use as an lvalue. This code used to be in
1894 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1895 expressions, where we're dealing with aggregates. But now it's again only
1896 called from unary_complex_lvalue. The case (in particular) that led to
1897 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1901 rationalize_conditional_expr (enum tree_code code, tree t,
1902 tsubst_flags_t complain)
1904 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1905 the first operand is always the one to be used if both operands
1906 are equal, so we know what conditional expression this used to be. */
1907 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
1909 tree op0 = TREE_OPERAND (t, 0);
1910 tree op1 = TREE_OPERAND (t, 1);
1912 /* The following code is incorrect if either operand side-effects. */
1913 gcc_assert (!TREE_SIDE_EFFECTS (op0)
1914 && !TREE_SIDE_EFFECTS (op1));
1916 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
1917 ? LE_EXPR : GE_EXPR),
1918 op0, TREE_CODE (op0),
1919 op1, TREE_CODE (op1),
1920 /*overloaded_p=*/NULL,
1922 cp_build_unary_op (code, op0, 0, complain),
1923 cp_build_unary_op (code, op1, 0, complain),
1928 build_conditional_expr (TREE_OPERAND (t, 0),
1929 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
1931 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
1936 /* Given the TYPE of an anonymous union field inside T, return the
1937 FIELD_DECL for the field. If not found return NULL_TREE. Because
1938 anonymous unions can nest, we must also search all anonymous unions
1939 that are directly reachable. */
1942 lookup_anon_field (tree t, tree type)
1946 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
1948 if (TREE_STATIC (field))
1950 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
1953 /* If we find it directly, return the field. */
1954 if (DECL_NAME (field) == NULL_TREE
1955 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
1960 /* Otherwise, it could be nested, search harder. */
1961 if (DECL_NAME (field) == NULL_TREE
1962 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1964 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
1972 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1973 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1974 non-NULL, it indicates the path to the base used to name MEMBER.
1975 If PRESERVE_REFERENCE is true, the expression returned will have
1976 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1977 returned will have the type referred to by the reference.
1979 This function does not perform access control; that is either done
1980 earlier by the parser when the name of MEMBER is resolved to MEMBER
1981 itself, or later when overload resolution selects one of the
1982 functions indicated by MEMBER. */
1985 build_class_member_access_expr (tree object, tree member,
1986 tree access_path, bool preserve_reference,
1987 tsubst_flags_t complain)
1991 tree result = NULL_TREE;
1993 if (error_operand_p (object) || error_operand_p (member))
1994 return error_mark_node;
1996 gcc_assert (DECL_P (member) || BASELINK_P (member));
2000 The type of the first expression shall be "class object" (of a
2002 object_type = TREE_TYPE (object);
2003 if (!currently_open_class (object_type)
2004 && !complete_type_or_else (object_type, object))
2005 return error_mark_node;
2006 if (!CLASS_TYPE_P (object_type))
2008 if (complain & tf_error)
2009 error ("request for member %qD in %qE, which is of non-class type %qT",
2010 member, object, object_type);
2011 return error_mark_node;
2014 /* The standard does not seem to actually say that MEMBER must be a
2015 member of OBJECT_TYPE. However, that is clearly what is
2017 if (DECL_P (member))
2019 member_scope = DECL_CLASS_CONTEXT (member);
2021 if (TREE_DEPRECATED (member))
2022 warn_deprecated_use (member, NULL_TREE);
2025 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
2026 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
2027 presently be the anonymous union. Go outwards until we find a
2028 type related to OBJECT_TYPE. */
2029 while (ANON_AGGR_TYPE_P (member_scope)
2030 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
2032 member_scope = TYPE_CONTEXT (member_scope);
2033 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
2035 if (complain & tf_error)
2037 if (TREE_CODE (member) == FIELD_DECL)
2038 error ("invalid use of nonstatic data member %qE", member);
2040 error ("%qD is not a member of %qT", member, object_type);
2042 return error_mark_node;
2045 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
2046 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
2047 in the front end; only _DECLs and _REFs are lvalues in the back end. */
2049 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
2051 object = cp_build_indirect_ref (temp, NULL, complain);
2054 /* In [expr.ref], there is an explicit list of the valid choices for
2055 MEMBER. We check for each of those cases here. */
2056 if (TREE_CODE (member) == VAR_DECL)
2058 /* A static data member. */
2060 /* If OBJECT has side-effects, they are supposed to occur. */
2061 if (TREE_SIDE_EFFECTS (object))
2062 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
2064 else if (TREE_CODE (member) == FIELD_DECL)
2066 /* A non-static data member. */
2071 null_object_p = (TREE_CODE (object) == INDIRECT_REF
2072 && integer_zerop (TREE_OPERAND (object, 0)));
2074 /* Convert OBJECT to the type of MEMBER. */
2075 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
2076 TYPE_MAIN_VARIANT (member_scope)))
2081 binfo = lookup_base (access_path ? access_path : object_type,
2082 member_scope, ba_unique, &kind);
2083 if (binfo == error_mark_node)
2084 return error_mark_node;
2086 /* It is invalid to try to get to a virtual base of a
2087 NULL object. The most common cause is invalid use of
2089 if (null_object_p && kind == bk_via_virtual)
2091 if (complain & tf_error)
2093 error ("invalid access to non-static data member %qD of "
2096 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
2098 return error_mark_node;
2101 /* Convert to the base. */
2102 object = build_base_path (PLUS_EXPR, object, binfo,
2104 /* If we found the base successfully then we should be able
2105 to convert to it successfully. */
2106 gcc_assert (object != error_mark_node);
2109 /* Complain about other invalid uses of offsetof, even though they will
2110 give the right answer. Note that we complain whether or not they
2111 actually used the offsetof macro, since there's no way to know at this
2112 point. So we just give a warning, instead of a pedwarn. */
2113 /* Do not produce this warning for base class field references, because
2114 we know for a fact that didn't come from offsetof. This does occur
2115 in various testsuite cases where a null object is passed where a
2116 vtable access is required. */
2117 if (null_object_p && warn_invalid_offsetof
2118 && CLASSTYPE_NON_STD_LAYOUT (object_type)
2119 && !DECL_FIELD_IS_BASE (member)
2120 && cp_unevaluated_operand == 0
2121 && (complain & tf_warning))
2123 warning (OPT_Winvalid_offsetof,
2124 "invalid access to non-static data member %qD "
2125 " of NULL object", member);
2126 warning (OPT_Winvalid_offsetof,
2127 "(perhaps the %<offsetof%> macro was used incorrectly)");
2130 /* If MEMBER is from an anonymous aggregate, we have converted
2131 OBJECT so that it refers to the class containing the
2132 anonymous union. Generate a reference to the anonymous union
2133 itself, and recur to find MEMBER. */
2134 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2135 /* When this code is called from build_field_call, the
2136 object already has the type of the anonymous union.
2137 That is because the COMPONENT_REF was already
2138 constructed, and was then disassembled before calling
2139 build_field_call. After the function-call code is
2140 cleaned up, this waste can be eliminated. */
2141 && (!same_type_ignoring_top_level_qualifiers_p
2142 (TREE_TYPE (object), DECL_CONTEXT (member))))
2144 tree anonymous_union;
2146 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2147 DECL_CONTEXT (member));
2148 object = build_class_member_access_expr (object,
2150 /*access_path=*/NULL_TREE,
2155 /* Compute the type of the field, as described in [expr.ref]. */
2156 type_quals = TYPE_UNQUALIFIED;
2157 member_type = TREE_TYPE (member);
2158 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2160 type_quals = (cp_type_quals (member_type)
2161 | cp_type_quals (object_type));
2163 /* A field is const (volatile) if the enclosing object, or the
2164 field itself, is const (volatile). But, a mutable field is
2165 not const, even within a const object. */
2166 if (DECL_MUTABLE_P (member))
2167 type_quals &= ~TYPE_QUAL_CONST;
2168 member_type = cp_build_qualified_type (member_type, type_quals);
2171 result = build3 (COMPONENT_REF, member_type, object, member,
2173 result = fold_if_not_in_template (result);
2175 /* Mark the expression const or volatile, as appropriate. Even
2176 though we've dealt with the type above, we still have to mark the
2177 expression itself. */
2178 if (type_quals & TYPE_QUAL_CONST)
2179 TREE_READONLY (result) = 1;
2180 if (type_quals & TYPE_QUAL_VOLATILE)
2181 TREE_THIS_VOLATILE (result) = 1;
2183 else if (BASELINK_P (member))
2185 /* The member is a (possibly overloaded) member function. */
2189 /* If the MEMBER is exactly one static member function, then we
2190 know the type of the expression. Otherwise, we must wait
2191 until overload resolution has been performed. */
2192 functions = BASELINK_FUNCTIONS (member);
2193 if (TREE_CODE (functions) == FUNCTION_DECL
2194 && DECL_STATIC_FUNCTION_P (functions))
2195 type = TREE_TYPE (functions);
2197 type = unknown_type_node;
2198 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2199 base. That will happen when the function is called. */
2200 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2202 else if (TREE_CODE (member) == CONST_DECL)
2204 /* The member is an enumerator. */
2206 /* If OBJECT has side-effects, they are supposed to occur. */
2207 if (TREE_SIDE_EFFECTS (object))
2208 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2213 if (complain & tf_error)
2214 error ("invalid use of %qD", member);
2215 return error_mark_node;
2218 if (!preserve_reference)
2221 If E2 is declared to have type "reference to T", then ... the
2222 type of E1.E2 is T. */
2223 result = convert_from_reference (result);
2228 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2229 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2232 lookup_destructor (tree object, tree scope, tree dtor_name)
2234 tree object_type = TREE_TYPE (object);
2235 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2238 if (scope && !check_dtor_name (scope, dtor_type))
2240 error ("qualified type %qT does not match destructor name ~%qT",
2242 return error_mark_node;
2244 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2246 /* In a template, names we can't find a match for are still accepted
2247 destructor names, and we check them here. */
2248 if (check_dtor_name (object_type, dtor_type))
2249 dtor_type = object_type;
2252 error ("object type %qT does not match destructor name ~%qT",
2253 object_type, dtor_type);
2254 return error_mark_node;
2258 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2260 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2261 TYPE_MAIN_VARIANT (object_type), dtor_type);
2262 return error_mark_node;
2264 expr = lookup_member (dtor_type, complete_dtor_identifier,
2265 /*protect=*/1, /*want_type=*/false);
2266 expr = (adjust_result_of_qualified_name_lookup
2267 (expr, dtor_type, object_type));
2271 /* An expression of the form "A::template B" has been resolved to
2272 DECL. Issue a diagnostic if B is not a template or template
2276 check_template_keyword (tree decl)
2278 /* The standard says:
2282 If a name prefixed by the keyword template is not a member
2283 template, the program is ill-formed.
2285 DR 228 removed the restriction that the template be a member
2288 DR 96, if accepted would add the further restriction that explicit
2289 template arguments must be provided if the template keyword is
2290 used, but, as of 2005-10-16, that DR is still in "drafting". If
2291 this DR is accepted, then the semantic checks here can be
2292 simplified, as the entity named must in fact be a template
2293 specialization, rather than, as at present, a set of overloaded
2294 functions containing at least one template function. */
2295 if (TREE_CODE (decl) != TEMPLATE_DECL
2296 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2298 if (!is_overloaded_fn (decl))
2299 permerror (input_location, "%qD is not a template", decl);
2304 if (BASELINK_P (fns))
2305 fns = BASELINK_FUNCTIONS (fns);
2308 tree fn = OVL_CURRENT (fns);
2309 if (TREE_CODE (fn) == TEMPLATE_DECL
2310 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2312 if (TREE_CODE (fn) == FUNCTION_DECL
2313 && DECL_USE_TEMPLATE (fn)
2314 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2316 fns = OVL_NEXT (fns);
2319 permerror (input_location, "%qD is not a template", decl);
2324 /* This function is called by the parser to process a class member
2325 access expression of the form OBJECT.NAME. NAME is a node used by
2326 the parser to represent a name; it is not yet a DECL. It may,
2327 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2328 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2329 there is no reason to do the lookup twice, so the parser keeps the
2330 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2331 be a template via the use of the "A::template B" syntax. */
2334 finish_class_member_access_expr (tree object, tree name, bool template_p,
2335 tsubst_flags_t complain)
2340 tree access_path = NULL_TREE;
2341 tree orig_object = object;
2342 tree orig_name = name;
2344 if (object == error_mark_node || name == error_mark_node)
2345 return error_mark_node;
2347 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2348 if (!objc_is_public (object, name))
2349 return error_mark_node;
2351 object_type = TREE_TYPE (object);
2353 if (processing_template_decl)
2355 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2356 dependent_type_p (object_type)
2357 /* If NAME is just an IDENTIFIER_NODE, then the expression
2359 || TREE_CODE (object) == IDENTIFIER_NODE
2360 /* If NAME is "f<args>", where either 'f' or 'args' is
2361 dependent, then the expression is dependent. */
2362 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2363 && dependent_template_id_p (TREE_OPERAND (name, 0),
2364 TREE_OPERAND (name, 1)))
2365 /* If NAME is "T::X" where "T" is dependent, then the
2366 expression is dependent. */
2367 || (TREE_CODE (name) == SCOPE_REF
2368 && TYPE_P (TREE_OPERAND (name, 0))
2369 && dependent_type_p (TREE_OPERAND (name, 0))))
2370 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2371 object = build_non_dependent_expr (object);
2376 The type of the first expression shall be "class object" (of a
2378 if (!currently_open_class (object_type)
2379 && !complete_type_or_else (object_type, object))
2380 return error_mark_node;
2381 if (!CLASS_TYPE_P (object_type))
2383 if (complain & tf_error)
2384 error ("request for member %qD in %qE, which is of non-class type %qT",
2385 name, object, object_type);
2386 return error_mark_node;
2389 if (BASELINK_P (name))
2390 /* A member function that has already been looked up. */
2394 bool is_template_id = false;
2395 tree template_args = NULL_TREE;
2398 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2400 is_template_id = true;
2401 template_args = TREE_OPERAND (name, 1);
2402 name = TREE_OPERAND (name, 0);
2404 if (TREE_CODE (name) == OVERLOAD)
2405 name = DECL_NAME (get_first_fn (name));
2406 else if (DECL_P (name))
2407 name = DECL_NAME (name);
2410 if (TREE_CODE (name) == SCOPE_REF)
2412 /* A qualified name. The qualifying class or namespace `S'
2413 has already been looked up; it is either a TYPE or a
2415 scope = TREE_OPERAND (name, 0);
2416 name = TREE_OPERAND (name, 1);
2418 /* If SCOPE is a namespace, then the qualified name does not
2419 name a member of OBJECT_TYPE. */
2420 if (TREE_CODE (scope) == NAMESPACE_DECL)
2422 if (complain & tf_error)
2423 error ("%<%D::%D%> is not a member of %qT",
2424 scope, name, object_type);
2425 return error_mark_node;
2428 gcc_assert (CLASS_TYPE_P (scope));
2429 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2430 || TREE_CODE (name) == BIT_NOT_EXPR);
2432 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2433 access_path = lookup_base (object_type, scope, ba_check, NULL);
2434 if (access_path == error_mark_node)
2435 return error_mark_node;
2438 if (complain & tf_error)
2439 error ("%qT is not a base of %qT", scope, object_type);
2440 return error_mark_node;
2446 access_path = object_type;
2449 if (TREE_CODE (name) == BIT_NOT_EXPR)
2450 member = lookup_destructor (object, scope, name);
2453 /* Look up the member. */
2454 member = lookup_member (access_path, name, /*protect=*/1,
2455 /*want_type=*/false);
2456 if (member == NULL_TREE)
2458 if (complain & tf_error)
2459 error ("%qD has no member named %qE", object_type, name);
2460 return error_mark_node;
2462 if (member == error_mark_node)
2463 return error_mark_node;
2468 tree templ = member;
2470 if (BASELINK_P (templ))
2471 templ = lookup_template_function (templ, template_args);
2474 if (complain & tf_error)
2475 error ("%qD is not a member template function", name);
2476 return error_mark_node;
2481 if (TREE_DEPRECATED (member))
2482 warn_deprecated_use (member, NULL_TREE);
2485 check_template_keyword (member);
2487 expr = build_class_member_access_expr (object, member, access_path,
2488 /*preserve_reference=*/false,
2490 if (processing_template_decl && expr != error_mark_node)
2492 if (BASELINK_P (member))
2494 if (TREE_CODE (orig_name) == SCOPE_REF)
2495 BASELINK_QUALIFIED_P (member) = 1;
2498 return build_min_non_dep (COMPONENT_REF, expr,
2499 orig_object, orig_name,
2506 /* Return an expression for the MEMBER_NAME field in the internal
2507 representation of PTRMEM, a pointer-to-member function. (Each
2508 pointer-to-member function type gets its own RECORD_TYPE so it is
2509 more convenient to access the fields by name than by FIELD_DECL.)
2510 This routine converts the NAME to a FIELD_DECL and then creates the
2511 node for the complete expression. */
2514 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2520 /* This code is a stripped down version of
2521 build_class_member_access_expr. It does not work to use that
2522 routine directly because it expects the object to be of class
2524 ptrmem_type = TREE_TYPE (ptrmem);
2525 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2526 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2527 /*want_type=*/false);
2528 member_type = cp_build_qualified_type (TREE_TYPE (member),
2529 cp_type_quals (ptrmem_type));
2530 return fold_build3_loc (input_location,
2531 COMPONENT_REF, member_type,
2532 ptrmem, member, NULL_TREE);
2535 /* Given an expression PTR for a pointer, return an expression
2536 for the value pointed to.
2537 ERRORSTRING is the name of the operator to appear in error messages.
2539 This function may need to overload OPERATOR_FNNAME.
2540 Must also handle REFERENCE_TYPEs for C++. */
2543 build_x_indirect_ref (tree expr, const char *errorstring,
2544 tsubst_flags_t complain)
2546 tree orig_expr = expr;
2549 if (processing_template_decl)
2551 /* Retain the type if we know the operand is a pointer so that
2552 describable_type doesn't make auto deduction break. */
2553 if (TREE_TYPE (expr) && POINTER_TYPE_P (TREE_TYPE (expr)))
2554 return build_min (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr);
2555 if (type_dependent_expression_p (expr))
2556 return build_min_nt (INDIRECT_REF, expr);
2557 expr = build_non_dependent_expr (expr);
2560 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2561 NULL_TREE, /*overloaded_p=*/NULL, complain);
2563 rval = cp_build_indirect_ref (expr, errorstring, complain);
2565 if (processing_template_decl && rval != error_mark_node)
2566 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2571 /* Helper function called from c-common. */
2573 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2574 tree ptr, const char *errorstring)
2576 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2580 cp_build_indirect_ref (tree ptr, const char *errorstring,
2581 tsubst_flags_t complain)
2585 if (ptr == error_mark_node)
2586 return error_mark_node;
2588 if (ptr == current_class_ptr)
2589 return current_class_ref;
2591 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2592 ? ptr : decay_conversion (ptr));
2593 type = TREE_TYPE (pointer);
2595 if (POINTER_TYPE_P (type))
2599 If the type of the expression is "pointer to T," the type
2600 of the result is "T." */
2601 tree t = TREE_TYPE (type);
2603 if (CONVERT_EXPR_P (ptr)
2604 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2606 /* If a warning is issued, mark it to avoid duplicates from
2607 the backend. This only needs to be done at
2608 warn_strict_aliasing > 2. */
2609 if (warn_strict_aliasing > 2)
2610 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2611 type, TREE_OPERAND (ptr, 0)))
2612 TREE_NO_WARNING (ptr) = 1;
2615 if (VOID_TYPE_P (t))
2617 /* A pointer to incomplete type (other than cv void) can be
2618 dereferenced [expr.unary.op]/1 */
2619 if (complain & tf_error)
2620 error ("%qT is not a pointer-to-object type", type);
2621 return error_mark_node;
2623 else if (TREE_CODE (pointer) == ADDR_EXPR
2624 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2625 /* The POINTER was something like `&x'. We simplify `*&x' to
2627 return TREE_OPERAND (pointer, 0);
2630 tree ref = build1 (INDIRECT_REF, t, pointer);
2632 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2633 so that we get the proper error message if the result is used
2634 to assign to. Also, &* is supposed to be a no-op. */
2635 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2636 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2637 TREE_SIDE_EFFECTS (ref)
2638 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2642 else if (!(complain & tf_error))
2643 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2645 /* `pointer' won't be an error_mark_node if we were given a
2646 pointer to member, so it's cool to check for this here. */
2647 else if (TYPE_PTR_TO_MEMBER_P (type))
2648 error ("invalid use of %qs on pointer to member", errorstring);
2649 else if (pointer != error_mark_node)
2652 error ("invalid type argument of %qs", errorstring);
2654 error ("invalid type argument");
2656 return error_mark_node;
2659 /* This handles expressions of the form "a[i]", which denotes
2662 This is logically equivalent in C to *(a+i), but we may do it differently.
2663 If A is a variable or a member, we generate a primitive ARRAY_REF.
2664 This avoids forcing the array out of registers, and can work on
2665 arrays that are not lvalues (for example, members of structures returned
2668 If INDEX is of some user-defined type, it must be converted to
2669 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2670 will inherit the type of the array, which will be some pointer type.
2672 LOC is the location to use in building the array reference. */
2675 build_array_ref (location_t loc, tree array, tree idx)
2681 error_at (loc, "subscript missing in array reference");
2682 return error_mark_node;
2685 if (TREE_TYPE (array) == error_mark_node
2686 || TREE_TYPE (idx) == error_mark_node)
2687 return error_mark_node;
2689 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2691 switch (TREE_CODE (array))
2695 tree value = build_array_ref (loc, TREE_OPERAND (array, 1), idx);
2696 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2697 TREE_OPERAND (array, 0), value);
2698 SET_EXPR_LOCATION (ret, loc);
2703 ret = build_conditional_expr
2704 (TREE_OPERAND (array, 0),
2705 build_array_ref (loc, TREE_OPERAND (array, 1), idx),
2706 build_array_ref (loc, TREE_OPERAND (array, 2), idx),
2707 tf_warning_or_error);
2708 protected_set_expr_location (ret, loc);
2715 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2719 warn_array_subscript_with_type_char (idx);
2721 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2723 error_at (loc, "array subscript is not an integer");
2724 return error_mark_node;
2727 /* Apply integral promotions *after* noticing character types.
2728 (It is unclear why we do these promotions -- the standard
2729 does not say that we should. In fact, the natural thing would
2730 seem to be to convert IDX to ptrdiff_t; we're performing
2731 pointer arithmetic.) */
2732 idx = perform_integral_promotions (idx);
2734 /* An array that is indexed by a non-constant
2735 cannot be stored in a register; we must be able to do
2736 address arithmetic on its address.
2737 Likewise an array of elements of variable size. */
2738 if (TREE_CODE (idx) != INTEGER_CST
2739 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2740 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2743 if (!cxx_mark_addressable (array))
2744 return error_mark_node;
2747 /* An array that is indexed by a constant value which is not within
2748 the array bounds cannot be stored in a register either; because we
2749 would get a crash in store_bit_field/extract_bit_field when trying
2750 to access a non-existent part of the register. */
2751 if (TREE_CODE (idx) == INTEGER_CST
2752 && TYPE_DOMAIN (TREE_TYPE (array))
2753 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2755 if (!cxx_mark_addressable (array))
2756 return error_mark_node;
2759 if (!lvalue_p (array))
2760 pedwarn (loc, OPT_pedantic,
2761 "ISO C++ forbids subscripting non-lvalue array");
2763 /* Note in C++ it is valid to subscript a `register' array, since
2764 it is valid to take the address of something with that
2765 storage specification. */
2769 while (TREE_CODE (foo) == COMPONENT_REF)
2770 foo = TREE_OPERAND (foo, 0);
2771 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
2772 warning_at (loc, OPT_Wextra,
2773 "subscripting array declared %<register%>");
2776 type = TREE_TYPE (TREE_TYPE (array));
2777 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2778 /* Array ref is const/volatile if the array elements are
2779 or if the array is.. */
2780 TREE_READONLY (rval)
2781 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2782 TREE_SIDE_EFFECTS (rval)
2783 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2784 TREE_THIS_VOLATILE (rval)
2785 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2786 ret = require_complete_type (fold_if_not_in_template (rval));
2787 protected_set_expr_location (ret, loc);
2792 tree ar = default_conversion (array);
2793 tree ind = default_conversion (idx);
2795 /* Put the integer in IND to simplify error checking. */
2796 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2803 if (ar == error_mark_node)
2806 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2808 error_at (loc, "subscripted value is neither array nor pointer");
2809 return error_mark_node;
2811 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2813 error_at (loc, "array subscript is not an integer");
2814 return error_mark_node;
2817 warn_array_subscript_with_type_char (idx);
2819 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
2821 tf_warning_or_error),
2823 tf_warning_or_error);
2824 protected_set_expr_location (ret, loc);
2829 /* Resolve a pointer to member function. INSTANCE is the object
2830 instance to use, if the member points to a virtual member.
2832 This used to avoid checking for virtual functions if basetype
2833 has no virtual functions, according to an earlier ANSI draft.
2834 With the final ISO C++ rules, such an optimization is
2835 incorrect: A pointer to a derived member can be static_cast
2836 to pointer-to-base-member, as long as the dynamic object
2837 later has the right member. */
2840 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
2842 if (TREE_CODE (function) == OFFSET_REF)
2843 function = TREE_OPERAND (function, 1);
2845 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2847 tree idx, delta, e1, e2, e3, vtbl, basetype;
2848 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2850 tree instance_ptr = *instance_ptrptr;
2851 tree instance_save_expr = 0;
2852 if (instance_ptr == error_mark_node)
2854 if (TREE_CODE (function) == PTRMEM_CST)
2856 /* Extracting the function address from a pmf is only
2857 allowed with -Wno-pmf-conversions. It only works for
2859 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
2860 e1 = convert (fntype, e1);
2865 error ("object missing in use of %qE", function);
2866 return error_mark_node;
2870 if (TREE_SIDE_EFFECTS (instance_ptr))
2871 instance_ptr = instance_save_expr = save_expr (instance_ptr);
2873 if (TREE_SIDE_EFFECTS (function))
2874 function = save_expr (function);
2876 /* Start by extracting all the information from the PMF itself. */
2877 e3 = pfn_from_ptrmemfunc (function);
2878 delta = delta_from_ptrmemfunc (function);
2879 idx = build1 (NOP_EXPR, vtable_index_type, e3);
2880 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
2882 case ptrmemfunc_vbit_in_pfn:
2883 e1 = cp_build_binary_op (input_location,
2884 BIT_AND_EXPR, idx, integer_one_node,
2885 tf_warning_or_error);
2886 idx = cp_build_binary_op (input_location,
2887 MINUS_EXPR, idx, integer_one_node,
2888 tf_warning_or_error);
2891 case ptrmemfunc_vbit_in_delta:
2892 e1 = cp_build_binary_op (input_location,
2893 BIT_AND_EXPR, delta, integer_one_node,
2894 tf_warning_or_error);
2895 delta = cp_build_binary_op (input_location,
2896 RSHIFT_EXPR, delta, integer_one_node,
2897 tf_warning_or_error);
2904 /* Convert down to the right base before using the instance. A
2905 special case is that in a pointer to member of class C, C may
2906 be incomplete. In that case, the function will of course be
2907 a member of C, and no conversion is required. In fact,
2908 lookup_base will fail in that case, because incomplete
2909 classes do not have BINFOs. */
2910 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
2911 if (!same_type_ignoring_top_level_qualifiers_p
2912 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
2914 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
2915 basetype, ba_check, NULL);
2916 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
2918 if (instance_ptr == error_mark_node)
2919 return error_mark_node;
2921 /* ...and then the delta in the PMF. */
2922 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
2923 instance_ptr, fold_convert (sizetype, delta));
2925 /* Hand back the adjusted 'this' argument to our caller. */
2926 *instance_ptrptr = instance_ptr;
2928 /* Next extract the vtable pointer from the object. */
2929 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
2931 vtbl = cp_build_indirect_ref (vtbl, NULL, tf_warning_or_error);
2932 /* If the object is not dynamic the access invokes undefined
2933 behavior. As it is not executed in this case silence the
2934 spurious warnings it may provoke. */
2935 TREE_NO_WARNING (vtbl) = 1;
2937 /* Finally, extract the function pointer from the vtable. */
2938 e2 = fold_build2_loc (input_location,
2939 POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
2940 fold_convert (sizetype, idx));
2941 e2 = cp_build_indirect_ref (e2, NULL, tf_warning_or_error);
2942 TREE_CONSTANT (e2) = 1;
2944 /* When using function descriptors, the address of the
2945 vtable entry is treated as a function pointer. */
2946 if (TARGET_VTABLE_USES_DESCRIPTORS)
2947 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
2948 cp_build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1,
2949 tf_warning_or_error));
2951 e2 = fold_convert (TREE_TYPE (e3), e2);
2952 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
2954 /* Make sure this doesn't get evaluated first inside one of the
2955 branches of the COND_EXPR. */
2956 if (instance_save_expr)
2957 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
2958 instance_save_expr, e1);
2965 /* Used by the C-common bits. */
2967 build_function_call (location_t loc ATTRIBUTE_UNUSED,
2968 tree function, tree params)
2970 return cp_build_function_call (function, params, tf_warning_or_error);
2973 /* Used by the C-common bits. */
2975 build_function_call_vec (location_t loc ATTRIBUTE_UNUSED,
2976 tree function, VEC(tree,gc) *params,
2977 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
2979 VEC(tree,gc) *orig_params = params;
2980 tree ret = cp_build_function_call_vec (function, ¶ms,
2981 tf_warning_or_error);
2983 /* cp_build_function_call_vec can reallocate PARAMS by adding
2984 default arguments. That should never happen here. Verify
2986 gcc_assert (params == orig_params);
2991 /* Build a function call using a tree list of arguments. */
2994 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
2999 vec = make_tree_vector ();
3000 for (; params != NULL_TREE; params = TREE_CHAIN (params))
3001 VEC_safe_push (tree, gc, vec, TREE_VALUE (params));
3002 ret = cp_build_function_call_vec (function, &vec, complain);
3003 release_tree_vector (vec);
3007 /* Build a function call using a vector of arguments. PARAMS may be
3008 NULL if there are no parameters. This changes the contents of
3012 cp_build_function_call_vec (tree function, VEC(tree,gc) **params,
3013 tsubst_flags_t complain)
3015 tree fntype, fndecl;
3016 tree name = NULL_TREE;
3018 tree original = function;
3022 VEC(tree,gc) *allocated = NULL;
3025 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
3026 expressions, like those used for ObjC messenger dispatches. */
3027 if (params != NULL && !VEC_empty (tree, *params))
3028 function = objc_rewrite_function_call (function,
3029 VEC_index (tree, *params, 0));
3031 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3032 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
3033 if (TREE_CODE (function) == NOP_EXPR
3034 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
3035 function = TREE_OPERAND (function, 0);
3037 if (TREE_CODE (function) == FUNCTION_DECL)
3039 name = DECL_NAME (function);
3041 mark_used (function);
3044 /* Convert anything with function type to a pointer-to-function. */
3045 if (DECL_MAIN_P (function) && (complain & tf_error))
3046 pedwarn (input_location, OPT_pedantic,
3047 "ISO C++ forbids calling %<::main%> from within program");
3049 function = build_addr_func (function);
3055 function = build_addr_func (function);
3058 if (function == error_mark_node)
3059 return error_mark_node;
3061 fntype = TREE_TYPE (function);
3063 if (TYPE_PTRMEMFUNC_P (fntype))
3065 if (complain & tf_error)
3066 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
3067 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
3068 original, original);
3069 return error_mark_node;
3072 is_method = (TREE_CODE (fntype) == POINTER_TYPE
3073 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
3075 if (!((TREE_CODE (fntype) == POINTER_TYPE
3076 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
3078 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
3080 if (complain & tf_error)
3081 error ("%qE cannot be used as a function", original);
3082 return error_mark_node;
3085 /* fntype now gets the type of function pointed to. */
3086 fntype = TREE_TYPE (fntype);
3087 parm_types = TYPE_ARG_TYPES (fntype);
3091 allocated = make_tree_vector ();
3092 params = &allocated;
3095 nargs = convert_arguments (parm_types, params, fndecl, LOOKUP_NORMAL,
3098 return error_mark_node;
3100 argarray = VEC_address (tree, *params);
3102 /* Check for errors in format strings and inappropriately
3104 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
3107 ret = build_cxx_call (function, nargs, argarray);
3109 if (allocated != NULL)
3110 release_tree_vector (allocated);
3115 /* Convert the actual parameter expressions in the list VALUES to the
3116 types in the list TYPELIST. The converted expressions are stored
3117 back in the VALUES vector.
3118 If parmdecls is exhausted, or when an element has NULL as its type,
3119 perform the default conversions.
3121 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
3123 This is also where warnings about wrong number of args are generated.
3125 Returns the actual number of arguments processed (which might be less
3126 than the length of the vector), or -1 on error.
3128 In C++, unspecified trailing parameters can be filled in with their
3129 default arguments, if such were specified. Do so here. */
3132 convert_arguments (tree typelist, VEC(tree,gc) **values, tree fndecl,
3133 int flags, tsubst_flags_t complain)
3136 const char *called_thing = 0;
3139 /* Argument passing is always copy-initialization. */
3140 flags |= LOOKUP_ONLYCONVERTING;
3144 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3146 if (DECL_NAME (fndecl) == NULL_TREE
3147 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3148 called_thing = "constructor";
3150 called_thing = "member function";
3153 called_thing = "function";
3156 for (i = 0, typetail = typelist;
3157 i < VEC_length (tree, *values);
3160 tree type = typetail ? TREE_VALUE (typetail) : 0;
3161 tree val = VEC_index (tree, *values, i);
3163 if (val == error_mark_node || type == error_mark_node)
3166 if (type == void_type_node)
3168 if (complain & tf_error)
3172 error ("too many arguments to %s %q+#D",
3173 called_thing, fndecl);
3174 error ("at this point in file");
3177 error ("too many arguments to function");
3184 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3185 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3186 if (TREE_CODE (val) == NOP_EXPR
3187 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3188 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3189 val = TREE_OPERAND (val, 0);
3191 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3193 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3194 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3195 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3196 val = decay_conversion (val);
3199 if (val == error_mark_node)
3204 /* Formal parm type is specified by a function prototype. */
3207 if (!COMPLETE_TYPE_P (complete_type (type)))
3209 if (complain & tf_error)
3212 error ("parameter %P of %qD has incomplete type %qT",
3215 error ("parameter %P has incomplete type %qT", i, type);
3217 parmval = error_mark_node;
3221 parmval = convert_for_initialization
3222 (NULL_TREE, type, val, flags,
3223 "argument passing", fndecl, i, complain);
3224 parmval = convert_for_arg_passing (type, parmval);
3227 if (parmval == error_mark_node)
3230 VEC_replace (tree, *values, i, parmval);
3234 if (fndecl && DECL_BUILT_IN (fndecl)
3235 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3236 /* Don't do ellipsis conversion for __built_in_constant_p
3237 as this will result in spurious errors for non-trivial
3239 val = require_complete_type (val);
3241 val = convert_arg_to_ellipsis (val);
3243 VEC_replace (tree, *values, i, val);
3247 typetail = TREE_CHAIN (typetail);
3250 if (typetail != 0 && typetail != void_list_node)
3252 /* See if there are default arguments that can be used. Because
3253 we hold default arguments in the FUNCTION_TYPE (which is so
3254 wrong), we can see default parameters here from deduced
3255 contexts (and via typeof) for indirect function calls.
3256 Fortunately we know whether we have a function decl to
3257 provide default arguments in a language conformant
3259 if (fndecl && TREE_PURPOSE (typetail)
3260 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3262 for (; typetail != void_list_node; ++i)
3265 = convert_default_arg (TREE_VALUE (typetail),
3266 TREE_PURPOSE (typetail),
3269 if (parmval == error_mark_node)
3272 VEC_safe_push (tree, gc, *values, parmval);
3273 typetail = TREE_CHAIN (typetail);
3274 /* ends with `...'. */
3275 if (typetail == NULL_TREE)
3281 if (complain & tf_error)
3285 error ("too few arguments to %s %q+#D",
3286 called_thing, fndecl);
3287 error ("at this point in file");
3290 error ("too few arguments to function");
3299 /* Build a binary-operation expression, after performing default
3300 conversions on the operands. CODE is the kind of expression to
3301 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3302 are the tree codes which correspond to ARG1 and ARG2 when issuing
3303 warnings about possibly misplaced parentheses. They may differ
3304 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3305 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3306 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3307 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3308 ARG2_CODE as ERROR_MARK. */
3311 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3312 tree arg2, enum tree_code arg2_code, bool *overloaded_p,
3313 tsubst_flags_t complain)
3322 if (processing_template_decl)
3324 if (type_dependent_expression_p (arg1)
3325 || type_dependent_expression_p (arg2))
3326 return build_min_nt (code, arg1, arg2);
3327 arg1 = build_non_dependent_expr (arg1);
3328 arg2 = build_non_dependent_expr (arg2);
3331 if (code == DOTSTAR_EXPR)
3332 expr = build_m_component_ref (arg1, arg2);
3334 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3335 overloaded_p, complain);
3337 /* Check for cases such as x+y<<z which users are likely to
3338 misinterpret. But don't warn about obj << x + y, since that is a
3339 common idiom for I/O. */
3340 if (warn_parentheses
3341 && (complain & tf_warning)
3342 && !processing_template_decl
3343 && !error_operand_p (arg1)
3344 && !error_operand_p (arg2)
3345 && (code != LSHIFT_EXPR
3346 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3347 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3349 if (processing_template_decl && expr != error_mark_node)
3350 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3355 /* Build and return an ARRAY_REF expression. */
3358 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3360 tree orig_arg1 = arg1;
3361 tree orig_arg2 = arg2;
3364 if (processing_template_decl)
3366 if (type_dependent_expression_p (arg1)
3367 || type_dependent_expression_p (arg2))
3368 return build_min_nt (ARRAY_REF, arg1, arg2,
3369 NULL_TREE, NULL_TREE);
3370 arg1 = build_non_dependent_expr (arg1);
3371 arg2 = build_non_dependent_expr (arg2);
3374 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3375 /*overloaded_p=*/NULL, complain);
3377 if (processing_template_decl && expr != error_mark_node)
3378 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3379 NULL_TREE, NULL_TREE);
3383 /* For the c-common bits. */
3385 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3386 int convert_p ATTRIBUTE_UNUSED)
3388 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3392 /* Build a binary-operation expression without default conversions.
3393 CODE is the kind of expression to build.
3394 LOCATION is the location_t of the operator in the source code.
3395 This function differs from `build' in several ways:
3396 the data type of the result is computed and recorded in it,
3397 warnings are generated if arg data types are invalid,
3398 special handling for addition and subtraction of pointers is known,
3399 and some optimization is done (operations on narrow ints
3400 are done in the narrower type when that gives the same result).
3401 Constant folding is also done before the result is returned.
3403 Note that the operands will never have enumeral types
3404 because either they have just had the default conversions performed
3405 or they have both just been converted to some other type in which
3406 the arithmetic is to be done.
3408 C++: must do special pointer arithmetic when implementing
3409 multiple inheritance, and deal with pointer to member functions. */
3412 cp_build_binary_op (location_t location,
3413 enum tree_code code, tree orig_op0, tree orig_op1,
3414 tsubst_flags_t complain)
3417 enum tree_code code0, code1;
3419 const char *invalid_op_diag;
3421 /* Expression code to give to the expression when it is built.
3422 Normally this is CODE, which is what the caller asked for,
3423 but in some special cases we change it. */
3424 enum tree_code resultcode = code;
3426 /* Data type in which the computation is to be performed.
3427 In the simplest cases this is the common type of the arguments. */
3428 tree result_type = NULL;
3430 /* Nonzero means operands have already been type-converted
3431 in whatever way is necessary.
3432 Zero means they need to be converted to RESULT_TYPE. */
3435 /* Nonzero means create the expression with this type, rather than
3437 tree build_type = 0;
3439 /* Nonzero means after finally constructing the expression
3440 convert it to this type. */
3441 tree final_type = 0;
3445 /* Nonzero if this is an operation like MIN or MAX which can
3446 safely be computed in short if both args are promoted shorts.
3447 Also implies COMMON.
3448 -1 indicates a bitwise operation; this makes a difference
3449 in the exact conditions for when it is safe to do the operation
3450 in a narrower mode. */
3453 /* Nonzero if this is a comparison operation;
3454 if both args are promoted shorts, compare the original shorts.
3455 Also implies COMMON. */
3456 int short_compare = 0;
3458 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3461 /* True if both operands have arithmetic type. */
3462 bool arithmetic_types_p;
3464 /* Apply default conversions. */
3468 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3469 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3470 || code == TRUTH_XOR_EXPR)
3472 if (!really_overloaded_fn (op0))
3473 op0 = decay_conversion (op0);
3474 if (!really_overloaded_fn (op1))
3475 op1 = decay_conversion (op1);
3479 if (!really_overloaded_fn (op0))
3480 op0 = default_conversion (op0);
3481 if (!really_overloaded_fn (op1))
3482 op1 = default_conversion (op1);
3485 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3486 STRIP_TYPE_NOPS (op0);
3487 STRIP_TYPE_NOPS (op1);
3489 /* DTRT if one side is an overloaded function, but complain about it. */
3490 if (type_unknown_p (op0))
3492 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3493 if (t != error_mark_node)
3495 if (complain & tf_error)
3496 permerror (input_location, "assuming cast to type %qT from overloaded function",
3501 if (type_unknown_p (op1))
3503 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3504 if (t != error_mark_node)
3506 if (complain & tf_error)
3507 permerror (input_location, "assuming cast to type %qT from overloaded function",
3513 type0 = TREE_TYPE (op0);
3514 type1 = TREE_TYPE (op1);
3516 /* The expression codes of the data types of the arguments tell us
3517 whether the arguments are integers, floating, pointers, etc. */
3518 code0 = TREE_CODE (type0);
3519 code1 = TREE_CODE (type1);
3521 /* If an error was already reported for one of the arguments,
3522 avoid reporting another error. */
3523 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3524 return error_mark_node;
3526 if ((invalid_op_diag
3527 = targetm.invalid_binary_op (code, type0, type1)))
3529 error (invalid_op_diag);
3530 return error_mark_node;
3533 /* Issue warnings about peculiar, but valid, uses of NULL. */
3534 if ((orig_op0 == null_node || orig_op1 == null_node)
3535 /* It's reasonable to use pointer values as operands of &&
3536 and ||, so NULL is no exception. */
3537 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3538 && ( /* Both are NULL (or 0) and the operation was not a
3539 comparison or a pointer subtraction. */
3540 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3541 && code != EQ_EXPR && code != NE_EXPR && code != MINUS_EXPR)
3542 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
3543 || (!null_ptr_cst_p (orig_op0)
3544 && !TYPE_PTR_P (type0) && !TYPE_PTR_TO_MEMBER_P (type0))
3545 || (!null_ptr_cst_p (orig_op1)
3546 && !TYPE_PTR_P (type1) && !TYPE_PTR_TO_MEMBER_P (type1)))
3547 && (complain & tf_warning))
3548 /* Some sort of arithmetic operation involving NULL was
3550 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
3555 /* Subtraction of two similar pointers.
3556 We must subtract them as integers, then divide by object size. */
3557 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3558 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3560 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3561 /* In all other cases except pointer - int, the usual arithmetic
3563 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3568 /* The pointer - int case is just like pointer + int; fall
3571 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3572 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3576 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3577 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3578 if (processing_template_decl)
3580 result_type = TREE_TYPE (ptr_operand);
3583 return cp_pointer_int_sum (code,
3594 case TRUNC_DIV_EXPR:
3596 case FLOOR_DIV_EXPR:
3597 case ROUND_DIV_EXPR:
3598 case EXACT_DIV_EXPR:
3599 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3600 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3601 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3602 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3604 enum tree_code tcode0 = code0, tcode1 = code1;
3606 warn_for_div_by_zero (location, op1);
3608 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3609 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3610 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3611 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3613 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3614 resultcode = RDIV_EXPR;
3616 /* When dividing two signed integers, we have to promote to int.
3617 unless we divide by a constant != -1. Note that default
3618 conversion will have been performed on the operands at this
3619 point, so we have to dig out the original type to find out if
3621 shorten = ((TREE_CODE (op0) == NOP_EXPR
3622 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3623 || (TREE_CODE (op1) == INTEGER_CST
3624 && ! integer_all_onesp (op1)));
3633 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3634 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3635 && !VECTOR_FLOAT_TYPE_P (type0)
3636 && !VECTOR_FLOAT_TYPE_P (type1)))
3640 case TRUNC_MOD_EXPR:
3641 case FLOOR_MOD_EXPR:
3642 warn_for_div_by_zero (location, op1);
3644 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3645 && TREE_CODE (TREE_TYPE (type0)) == INTEGER_TYPE
3646 && TREE_CODE (TREE_TYPE (type1)) == INTEGER_TYPE)
3648 else if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3650 /* Although it would be tempting to shorten always here, that loses
3651 on some targets, since the modulo instruction is undefined if the
3652 quotient can't be represented in the computation mode. We shorten
3653 only if unsigned or if dividing by something we know != -1. */
3654 shorten = ((TREE_CODE (op0) == NOP_EXPR
3655 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3656 || (TREE_CODE (op1) == INTEGER_CST
3657 && ! integer_all_onesp (op1)));
3662 case TRUTH_ANDIF_EXPR:
3663 case TRUTH_ORIF_EXPR:
3664 case TRUTH_AND_EXPR:
3666 result_type = boolean_type_node;
3669 /* Shift operations: result has same type as first operand;
3670 always convert second operand to int.
3671 Also set SHORT_SHIFT if shifting rightward. */
3674 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3676 result_type = type0;
3677 if (TREE_CODE (op1) == INTEGER_CST)
3679 if (tree_int_cst_lt (op1, integer_zero_node))
3681 if ((complain & tf_warning)
3682 && c_inhibit_evaluation_warnings == 0)
3683 warning (0, "right shift count is negative");
3687 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3688 && (complain & tf_warning)
3689 && c_inhibit_evaluation_warnings == 0)
3690 warning (0, "right shift count >= width of type");
3693 /* Convert the shift-count to an integer, regardless of
3694 size of value being shifted. */
3695 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3696 op1 = cp_convert (integer_type_node, op1);
3697 /* Avoid converting op1 to result_type later. */
3703 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3705 result_type = type0;
3706 if (TREE_CODE (op1) == INTEGER_CST)
3708 if (tree_int_cst_lt (op1, integer_zero_node))
3710 if ((complain & tf_warning)
3711 && c_inhibit_evaluation_warnings == 0)
3712 warning (0, "left shift count is negative");
3714 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3716 if ((complain & tf_warning)
3717 && c_inhibit_evaluation_warnings == 0)
3718 warning (0, "left shift count >= width of type");
3721 /* Convert the shift-count to an integer, regardless of
3722 size of value being shifted. */
3723 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3724 op1 = cp_convert (integer_type_node, op1);
3725 /* Avoid converting op1 to result_type later. */
3732 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3734 result_type = type0;
3735 if (TREE_CODE (op1) == INTEGER_CST)
3737 if (tree_int_cst_lt (op1, integer_zero_node))
3739 if (complain & tf_warning)
3740 warning (0, (code == LROTATE_EXPR)
3741 ? G_("left rotate count is negative")
3742 : G_("right rotate count is negative"));
3744 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3746 if (complain & tf_warning)
3747 warning (0, (code == LROTATE_EXPR)
3748 ? G_("left rotate count >= width of type")
3749 : G_("right rotate count >= width of type"));
3752 /* Convert the shift-count to an integer, regardless of
3753 size of value being shifted. */
3754 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3755 op1 = cp_convert (integer_type_node, op1);
3761 if ((complain & tf_warning)
3762 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3763 warning (OPT_Wfloat_equal,
3764 "comparing floating point with == or != is unsafe");
3765 if ((complain & tf_warning)
3766 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3767 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3768 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3770 build_type = boolean_type_node;
3771 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3772 || code0 == COMPLEX_TYPE || code0 == ENUMERAL_TYPE)
3773 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3774 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE))
3776 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3777 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3778 result_type = composite_pointer_type (type0, type1, op0, op1,
3779 CPO_COMPARISON, complain);
3780 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3781 && null_ptr_cst_p (op1))
3783 if (TREE_CODE (op0) == ADDR_EXPR
3784 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
3786 if (complain & tf_warning)
3787 warning (OPT_Waddress, "the address of %qD will never be NULL",
3788 TREE_OPERAND (op0, 0));
3790 result_type = type0;
3792 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3793 && null_ptr_cst_p (op0))
3795 if (TREE_CODE (op1) == ADDR_EXPR
3796 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
3798 if (complain & tf_warning)
3799 warning (OPT_Waddress, "the address of %qD will never be NULL",
3800 TREE_OPERAND (op1, 0));
3802 result_type = type1;
3804 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3806 result_type = type0;
3807 if (complain & tf_error)
3808 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3810 return error_mark_node;
3812 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3814 result_type = type1;
3815 if (complain & tf_error)
3816 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3818 return error_mark_node;
3820 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
3822 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3823 == ptrmemfunc_vbit_in_delta)
3825 tree pfn0 = pfn_from_ptrmemfunc (op0);
3826 tree delta0 = delta_from_ptrmemfunc (op0);
3827 tree e1 = cp_build_binary_op (location,
3830 fold_convert (TREE_TYPE (pfn0),
3833 tree e2 = cp_build_binary_op (location,
3838 e2 = cp_build_binary_op (location,
3839 EQ_EXPR, e2, integer_zero_node,
3841 op0 = cp_build_binary_op (location,
3842 TRUTH_ANDIF_EXPR, e1, e2,
3844 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
3848 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
3849 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
3851 result_type = TREE_TYPE (op0);
3853 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
3854 return cp_build_binary_op (location, code, op1, op0, complain);
3855 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
3858 /* E will be the final comparison. */
3860 /* E1 and E2 are for scratch. */
3868 type = composite_pointer_type (type0, type1, op0, op1,
3869 CPO_COMPARISON, complain);
3871 if (!same_type_p (TREE_TYPE (op0), type))
3872 op0 = cp_convert_and_check (type, op0);
3873 if (!same_type_p (TREE_TYPE (op1), type))
3874 op1 = cp_convert_and_check (type, op1);
3876 if (op0 == error_mark_node || op1 == error_mark_node)
3877 return error_mark_node;
3879 if (TREE_SIDE_EFFECTS (op0))
3880 op0 = save_expr (op0);
3881 if (TREE_SIDE_EFFECTS (op1))
3882 op1 = save_expr (op1);
3884 pfn0 = pfn_from_ptrmemfunc (op0);
3885 pfn1 = pfn_from_ptrmemfunc (op1);
3886 delta0 = delta_from_ptrmemfunc (op0);
3887 delta1 = delta_from_ptrmemfunc (op1);
3888 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3889 == ptrmemfunc_vbit_in_delta)
3894 && ((op0.delta == op1.delta)
3895 || (!op0.pfn && op0.delta & 1 == 0
3896 && op1.delta & 1 == 0))
3898 The reason for the `!op0.pfn' bit is that a NULL
3899 pointer-to-member is any member with a zero PFN and
3900 LSB of the DELTA field is 0. */
3902 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
3906 e1 = cp_build_binary_op (location,
3907 EQ_EXPR, e1, integer_zero_node,
3909 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
3913 e2 = cp_build_binary_op (location,
3914 EQ_EXPR, e2, integer_zero_node,
3916 e1 = cp_build_binary_op (location,
3917 TRUTH_ANDIF_EXPR, e2, e1,
3919 e2 = cp_build_binary_op (location, EQ_EXPR,
3921 fold_convert (TREE_TYPE (pfn0),
3924 e2 = cp_build_binary_op (location,
3925 TRUTH_ANDIF_EXPR, e2, e1, complain);
3926 e1 = cp_build_binary_op (location,
3927 EQ_EXPR, delta0, delta1, complain);
3928 e1 = cp_build_binary_op (location,
3929 TRUTH_ORIF_EXPR, e1, e2, complain);
3936 && (!op0.pfn || op0.delta == op1.delta))
3938 The reason for the `!op0.pfn' bit is that a NULL
3939 pointer-to-member is any member with a zero PFN; the
3940 DELTA field is unspecified. */
3942 e1 = cp_build_binary_op (location,
3943 EQ_EXPR, delta0, delta1, complain);
3944 e2 = cp_build_binary_op (location,
3947 fold_convert (TREE_TYPE (pfn0),
3950 e1 = cp_build_binary_op (location,
3951 TRUTH_ORIF_EXPR, e1, e2, complain);
3953 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3954 e = cp_build_binary_op (location,
3955 TRUTH_ANDIF_EXPR, e2, e1, complain);
3956 if (code == EQ_EXPR)
3958 return cp_build_binary_op (location,
3959 EQ_EXPR, e, integer_zero_node, complain);
3963 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
3964 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
3966 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
3967 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
3975 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3976 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3978 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3979 result_type = composite_pointer_type (type0, type1, op0, op1,
3980 CPO_COMPARISON, complain);
3987 if (TREE_CODE (orig_op0) == STRING_CST
3988 || TREE_CODE (orig_op1) == STRING_CST)
3990 if (complain & tf_warning)
3991 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3994 build_type = boolean_type_node;
3995 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3996 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3998 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3999 result_type = composite_pointer_type (type0, type1, op0, op1,
4000 CPO_COMPARISON, complain);
4001 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
4002 && integer_zerop (op1))
4003 result_type = type0;
4004 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
4005 && integer_zerop (op0))
4006 result_type = type1;
4007 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
4009 result_type = type0;
4010 if (complain & tf_error)
4011 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4013 return error_mark_node;
4015 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
4017 result_type = type1;
4018 if (complain & tf_error)
4019 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
4021 return error_mark_node;
4025 case UNORDERED_EXPR:
4032 build_type = integer_type_node;
4033 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
4035 if (complain & tf_error)
4036 error ("unordered comparison on non-floating point argument");
4037 return error_mark_node;
4046 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
4047 || code0 == ENUMERAL_TYPE)
4048 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
4049 || code1 == COMPLEX_TYPE || code1 == ENUMERAL_TYPE)))
4050 arithmetic_types_p = 1;
4053 arithmetic_types_p = 0;
4054 /* Vector arithmetic is only allowed when both sides are vectors. */
4055 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
4057 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
4058 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
4061 binary_op_error (location, code, type0, type1);
4062 return error_mark_node;
4064 arithmetic_types_p = 1;
4067 /* Determine the RESULT_TYPE, if it is not already known. */
4069 && arithmetic_types_p
4070 && (shorten || common || short_compare))
4071 result_type = cp_common_type (type0, type1);
4075 if (complain & tf_error)
4076 error ("invalid operands of types %qT and %qT to binary %qO",
4077 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
4078 return error_mark_node;
4081 /* If we're in a template, the only thing we need to know is the
4083 if (processing_template_decl)
4085 /* Since the middle-end checks the type when doing a build2, we
4086 need to build the tree in pieces. This built tree will never
4087 get out of the front-end as we replace it when instantiating
4089 tree tmp = build2 (resultcode,
4090 build_type ? build_type : result_type,
4092 TREE_OPERAND (tmp, 0) = op0;
4096 if (arithmetic_types_p)
4098 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
4100 /* For certain operations (which identify themselves by shorten != 0)
4101 if both args were extended from the same smaller type,
4102 do the arithmetic in that type and then extend.
4104 shorten !=0 and !=1 indicates a bitwise operation.
4105 For them, this optimization is safe only if
4106 both args are zero-extended or both are sign-extended.
4107 Otherwise, we might change the result.
4108 E.g., (short)-1 | (unsigned short)-1 is (int)-1
4109 but calculated in (unsigned short) it would be (unsigned short)-1. */
4111 if (shorten && none_complex)
4113 final_type = result_type;
4114 result_type = shorten_binary_op (result_type, op0, op1,
4118 /* Comparison operations are shortened too but differently.
4119 They identify themselves by setting short_compare = 1. */
4123 /* Don't write &op0, etc., because that would prevent op0
4124 from being kept in a register.
4125 Instead, make copies of the our local variables and
4126 pass the copies by reference, then copy them back afterward. */
4127 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
4128 enum tree_code xresultcode = resultcode;
4130 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
4132 return cp_convert (boolean_type_node, val);
4133 op0 = xop0, op1 = xop1;
4135 resultcode = xresultcode;
4138 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
4139 && warn_sign_compare
4140 && !TREE_NO_WARNING (orig_op0)
4141 && !TREE_NO_WARNING (orig_op1)
4142 /* Do not warn until the template is instantiated; we cannot
4143 bound the ranges of the arguments until that point. */
4144 && !processing_template_decl
4145 && (complain & tf_warning)
4146 && c_inhibit_evaluation_warnings == 0)
4148 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
4149 result_type, resultcode);
4153 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4154 Then the expression will be built.
4155 It will be given type FINAL_TYPE if that is nonzero;
4156 otherwise, it will be given type RESULT_TYPE. */
4159 if (TREE_TYPE (op0) != result_type)
4160 op0 = cp_convert_and_check (result_type, op0);
4161 if (TREE_TYPE (op1) != result_type)
4162 op1 = cp_convert_and_check (result_type, op1);
4164 if (op0 == error_mark_node || op1 == error_mark_node)
4165 return error_mark_node;
4168 if (build_type == NULL_TREE)
4169 build_type = result_type;
4171 result = build2 (resultcode, build_type, op0, op1);
4172 result = fold_if_not_in_template (result);
4173 if (final_type != 0)
4174 result = cp_convert (final_type, result);
4176 if (TREE_OVERFLOW_P (result)
4177 && !TREE_OVERFLOW_P (op0)
4178 && !TREE_OVERFLOW_P (op1))
4179 overflow_warning (location, result);
4184 /* Return a tree for the sum or difference (RESULTCODE says which)
4185 of pointer PTROP and integer INTOP. */
4188 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4190 tree res_type = TREE_TYPE (ptrop);
4192 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4193 in certain circumstance (when it's valid to do so). So we need
4194 to make sure it's complete. We don't need to check here, if we
4195 can actually complete it at all, as those checks will be done in
4196 pointer_int_sum() anyway. */
4197 complete_type (TREE_TYPE (res_type));
4199 return pointer_int_sum (input_location, resultcode, ptrop,
4200 fold_if_not_in_template (intop));
4203 /* Return a tree for the difference of pointers OP0 and OP1.
4204 The resulting tree has type int. */
4207 pointer_diff (tree op0, tree op1, tree ptrtype)
4210 tree restype = ptrdiff_type_node;
4211 tree target_type = TREE_TYPE (ptrtype);
4213 if (!complete_type_or_else (target_type, NULL_TREE))
4214 return error_mark_node;
4216 if (TREE_CODE (target_type) == VOID_TYPE)
4217 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4218 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4219 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4220 if (TREE_CODE (target_type) == METHOD_TYPE)
4221 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4223 /* First do the subtraction as integers;
4224 then drop through to build the divide operator. */
4226 op0 = cp_build_binary_op (input_location,
4228 cp_convert (restype, op0),
4229 cp_convert (restype, op1),
4230 tf_warning_or_error);
4232 /* This generates an error if op1 is a pointer to an incomplete type. */
4233 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4234 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4236 op1 = (TYPE_PTROB_P (ptrtype)
4237 ? size_in_bytes (target_type)
4238 : integer_one_node);
4240 /* Do the division. */
4242 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4243 return fold_if_not_in_template (result);
4246 /* Construct and perhaps optimize a tree representation
4247 for a unary operation. CODE, a tree_code, specifies the operation
4248 and XARG is the operand. */
4251 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4253 tree orig_expr = xarg;
4257 if (processing_template_decl)
4259 if (type_dependent_expression_p (xarg))
4260 return build_min_nt (code, xarg, NULL_TREE);
4262 xarg = build_non_dependent_expr (xarg);
4267 /* [expr.unary.op] says:
4269 The address of an object of incomplete type can be taken.
4271 (And is just the ordinary address operator, not an overloaded
4272 "operator &".) However, if the type is a template
4273 specialization, we must complete the type at this point so that
4274 an overloaded "operator &" will be available if required. */
4275 if (code == ADDR_EXPR
4276 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4277 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4278 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4279 || (TREE_CODE (xarg) == OFFSET_REF)))
4280 /* Don't look for a function. */;
4282 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4283 /*overloaded_p=*/NULL, complain);
4284 if (!exp && code == ADDR_EXPR)
4286 if (is_overloaded_fn (xarg))
4288 tree fn = get_first_fn (xarg);
4289 if (DECL_CONSTRUCTOR_P (fn) || DECL_DESTRUCTOR_P (fn))
4292 (DECL_CONSTRUCTOR_P (fn) ? "constructor" : "destructor");
4293 error ("taking address of %s %qE", type, xarg);
4294 return error_mark_node;
4298 /* A pointer to member-function can be formed only by saying
4300 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4301 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4303 if (TREE_CODE (xarg) != OFFSET_REF
4304 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4306 error ("invalid use of %qE to form a pointer-to-member-function",
4308 if (TREE_CODE (xarg) != OFFSET_REF)
4309 inform (input_location, " a qualified-id is required");
4310 return error_mark_node;
4314 error ("parentheses around %qE cannot be used to form a"
4315 " pointer-to-member-function",
4317 PTRMEM_OK_P (xarg) = 1;
4321 if (TREE_CODE (xarg) == OFFSET_REF)
4323 ptrmem = PTRMEM_OK_P (xarg);
4325 if (!ptrmem && !flag_ms_extensions
4326 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4328 /* A single non-static member, make sure we don't allow a
4329 pointer-to-member. */
4330 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4331 TREE_OPERAND (xarg, 0),
4332 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4333 PTRMEM_OK_P (xarg) = ptrmem;
4336 else if (TREE_CODE (xarg) == TARGET_EXPR && (complain & tf_warning))
4337 warning (0, "taking address of temporary");
4338 exp = cp_build_unary_op (ADDR_EXPR, xarg, 0, complain);
4341 if (processing_template_decl && exp != error_mark_node)
4342 exp = build_min_non_dep (code, exp, orig_expr,
4343 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4344 if (TREE_CODE (exp) == ADDR_EXPR)
4345 PTRMEM_OK_P (exp) = ptrmem;
4349 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4350 constants, where a null value is represented by an INTEGER_CST of
4354 cp_truthvalue_conversion (tree expr)
4356 tree type = TREE_TYPE (expr);
4357 if (TYPE_PTRMEM_P (type))
4358 return build_binary_op (EXPR_LOCATION (expr),
4359 NE_EXPR, expr, integer_zero_node, 1);
4361 return c_common_truthvalue_conversion (input_location, expr);
4364 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4367 condition_conversion (tree expr)
4370 if (processing_template_decl)
4372 t = perform_implicit_conversion_flags (boolean_type_node, expr,
4373 tf_warning_or_error, LOOKUP_NORMAL);
4374 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4378 /* Returns the address of T. This function will fold away
4379 ADDR_EXPR of INDIRECT_REF. */
4382 build_address (tree t)
4384 if (error_operand_p (t) || !cxx_mark_addressable (t))
4385 return error_mark_node;
4386 t = build_fold_addr_expr (t);
4387 if (TREE_CODE (t) != ADDR_EXPR)
4392 /* Returns the address of T with type TYPE. */
4395 build_typed_address (tree t, tree type)
4397 if (error_operand_p (t) || !cxx_mark_addressable (t))
4398 return error_mark_node;
4399 t = build_fold_addr_expr_with_type (t, type);
4400 if (TREE_CODE (t) != ADDR_EXPR)
4405 /* Return a NOP_EXPR converting EXPR to TYPE. */
4408 build_nop (tree type, tree expr)
4410 if (type == error_mark_node || error_operand_p (expr))
4412 return build1 (NOP_EXPR, type, expr);
4415 /* C++: Must handle pointers to members.
4417 Perhaps type instantiation should be extended to handle conversion
4418 from aggregates to types we don't yet know we want? (Or are those
4419 cases typically errors which should be reported?)
4421 NOCONVERT nonzero suppresses the default promotions
4422 (such as from short to int). */
4425 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
4426 tsubst_flags_t complain)
4428 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4431 const char *errstring = NULL;
4433 const char *invalid_op_diag;
4435 if (error_operand_p (arg))
4436 return error_mark_node;
4438 if ((invalid_op_diag
4439 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
4444 error (invalid_op_diag);
4445 return error_mark_node;
4450 case UNARY_PLUS_EXPR:
4453 int flags = WANT_ARITH | WANT_ENUM;
4454 /* Unary plus (but not unary minus) is allowed on pointers. */
4455 if (code == UNARY_PLUS_EXPR)
4456 flags |= WANT_POINTER;
4457 arg = build_expr_type_conversion (flags, arg, true);
4459 errstring = (code == NEGATE_EXPR
4460 ? "wrong type argument to unary minus"
4461 : "wrong type argument to unary plus");
4464 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4465 arg = perform_integral_promotions (arg);
4467 /* Make sure the result is not an lvalue: a unary plus or minus
4468 expression is always a rvalue. */
4475 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4479 arg = default_conversion (arg);
4481 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
4484 errstring = "wrong type argument to bit-complement";
4485 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4486 arg = perform_integral_promotions (arg);
4490 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4491 errstring = "wrong type argument to abs";
4492 else if (!noconvert)
4493 arg = default_conversion (arg);
4497 /* Conjugating a real value is a no-op, but allow it anyway. */
4498 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4499 errstring = "wrong type argument to conjugation";
4500 else if (!noconvert)
4501 arg = default_conversion (arg);
4504 case TRUTH_NOT_EXPR:
4505 arg = perform_implicit_conversion (boolean_type_node, arg,
4507 val = invert_truthvalue_loc (input_location, arg);
4508 if (arg != error_mark_node)
4510 errstring = "in argument to unary !";
4517 if (TREE_CODE (arg) == COMPLEX_CST)
4518 return TREE_REALPART (arg);
4519 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4521 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4522 return fold_if_not_in_template (arg);
4528 if (TREE_CODE (arg) == COMPLEX_CST)
4529 return TREE_IMAGPART (arg);
4530 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4532 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4533 return fold_if_not_in_template (arg);
4536 return cp_convert (TREE_TYPE (arg), integer_zero_node);
4538 case PREINCREMENT_EXPR:
4539 case POSTINCREMENT_EXPR:
4540 case PREDECREMENT_EXPR:
4541 case POSTDECREMENT_EXPR:
4542 /* Handle complex lvalues (when permitted)
4543 by reduction to simpler cases. */
4545 val = unary_complex_lvalue (code, arg);
4549 /* Increment or decrement the real part of the value,
4550 and don't change the imaginary part. */
4551 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4555 arg = stabilize_reference (arg);
4556 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
4557 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
4558 real = cp_build_unary_op (code, real, 1, complain);
4559 if (real == error_mark_node || imag == error_mark_node)
4560 return error_mark_node;
4561 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
4565 /* Report invalid types. */
4567 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4570 if (code == PREINCREMENT_EXPR)
4571 errstring ="no pre-increment operator for type";
4572 else if (code == POSTINCREMENT_EXPR)
4573 errstring ="no post-increment operator for type";
4574 else if (code == PREDECREMENT_EXPR)
4575 errstring ="no pre-decrement operator for type";
4577 errstring ="no post-decrement operator for type";
4580 else if (arg == error_mark_node)
4581 return error_mark_node;
4583 /* Report something read-only. */
4585 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
4586 || TREE_READONLY (arg))
4588 if (complain & tf_error)
4589 readonly_error (arg, ((code == PREINCREMENT_EXPR
4590 || code == POSTINCREMENT_EXPR)
4591 ? "increment" : "decrement"));
4593 return error_mark_node;
4598 tree declared_type = unlowered_expr_type (arg);
4600 argtype = TREE_TYPE (arg);
4602 /* ARM $5.2.5 last annotation says this should be forbidden. */
4603 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4605 if (complain & tf_error)
4606 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4607 ? G_("ISO C++ forbids incrementing an enum")
4608 : G_("ISO C++ forbids decrementing an enum"));
4610 return error_mark_node;
4613 /* Compute the increment. */
4615 if (TREE_CODE (argtype) == POINTER_TYPE)
4617 tree type = complete_type (TREE_TYPE (argtype));
4619 if (!COMPLETE_OR_VOID_TYPE_P (type))
4621 if (complain & tf_error)
4622 error (((code == PREINCREMENT_EXPR
4623 || code == POSTINCREMENT_EXPR))
4624 ? G_("cannot increment a pointer to incomplete type %qT")
4625 : G_("cannot decrement a pointer to incomplete type %qT"),
4626 TREE_TYPE (argtype));
4628 return error_mark_node;
4630 else if ((pedantic || warn_pointer_arith)
4631 && !TYPE_PTROB_P (argtype))
4633 if (complain & tf_error)
4634 permerror (input_location, (code == PREINCREMENT_EXPR
4635 || code == POSTINCREMENT_EXPR)
4636 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4637 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4640 return error_mark_node;
4643 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
4646 inc = integer_one_node;
4648 inc = cp_convert (argtype, inc);
4650 /* Complain about anything else that is not a true lvalue. */
4651 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
4652 || code == POSTINCREMENT_EXPR)
4653 ? lv_increment : lv_decrement),
4655 return error_mark_node;
4657 /* Forbid using -- on `bool'. */
4658 if (TREE_CODE (declared_type) == BOOLEAN_TYPE)
4660 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
4662 if (complain & tf_error)
4663 error ("invalid use of Boolean expression as operand "
4664 "to %<operator--%>");
4665 return error_mark_node;
4667 val = boolean_increment (code, arg);
4670 val = build2 (code, TREE_TYPE (arg), arg, inc);
4672 TREE_SIDE_EFFECTS (val) = 1;
4677 /* Note that this operation never does default_conversion
4678 regardless of NOCONVERT. */
4680 argtype = lvalue_type (arg);
4682 if (TREE_CODE (arg) == OFFSET_REF)
4685 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4687 tree type = build_pointer_type (TREE_TYPE (argtype));
4688 arg = build1 (CONVERT_EXPR, type, arg);
4691 else if (pedantic && DECL_MAIN_P (arg))
4694 /* Apparently a lot of autoconf scripts for C++ packages do this,
4695 so only complain if -pedantic. */
4696 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4697 pedwarn (input_location, OPT_pedantic,
4698 "ISO C++ forbids taking address of function %<::main%>");
4699 else if (flag_pedantic_errors)
4700 return error_mark_node;
4703 /* Let &* cancel out to simplify resulting code. */
4704 if (TREE_CODE (arg) == INDIRECT_REF)
4706 /* We don't need to have `current_class_ptr' wrapped in a
4707 NON_LVALUE_EXPR node. */
4708 if (arg == current_class_ref)
4709 return current_class_ptr;
4711 arg = TREE_OPERAND (arg, 0);
4712 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4714 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4715 arg = build1 (CONVERT_EXPR, type, arg);
4718 /* Don't let this be an lvalue. */
4723 /* Uninstantiated types are all functions. Taking the
4724 address of a function is a no-op, so just return the
4727 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4728 || !IDENTIFIER_OPNAME_P (arg));
4730 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4731 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4733 /* They're trying to take the address of a unique non-static
4734 member function. This is ill-formed (except in MS-land),
4735 but let's try to DTRT.
4736 Note: We only handle unique functions here because we don't
4737 want to complain if there's a static overload; non-unique
4738 cases will be handled by instantiate_type. But we need to
4739 handle this case here to allow casts on the resulting PMF.
4740 We could defer this in non-MS mode, but it's easier to give
4741 a useful error here. */
4743 /* Inside constant member functions, the `this' pointer
4744 contains an extra const qualifier. TYPE_MAIN_VARIANT
4745 is used here to remove this const from the diagnostics
4746 and the created OFFSET_REF. */
4747 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4748 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4751 if (! flag_ms_extensions)
4753 tree name = DECL_NAME (fn);
4754 if (!(complain & tf_error))
4755 return error_mark_node;
4756 else if (current_class_type
4757 && TREE_OPERAND (arg, 0) == current_class_ref)
4758 /* An expression like &memfn. */
4759 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4760 " or parenthesized non-static member function to form"
4761 " a pointer to member function. Say %<&%T::%D%>",
4764 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4765 " function to form a pointer to member function."
4769 arg = build_offset_ref (base, fn, /*address_p=*/true);
4773 if (type_unknown_p (arg))
4774 return build1 (ADDR_EXPR, unknown_type_node, arg);
4776 /* Handle complex lvalues (when permitted)
4777 by reduction to simpler cases. */
4778 val = unary_complex_lvalue (code, arg);
4782 switch (TREE_CODE (arg))
4786 case FIX_TRUNC_EXPR:
4787 /* Even if we're not being pedantic, we cannot allow this
4788 extension when we're instantiating in a SFINAE
4790 if (! lvalue_p (arg) && complain == tf_none)
4792 if (complain & tf_error)
4793 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4795 return error_mark_node;
4800 arg = BASELINK_FUNCTIONS (arg);
4804 arg = OVL_CURRENT (arg);
4808 /* Turn a reference to a non-static data member into a
4809 pointer-to-member. */
4814 if (!PTRMEM_OK_P (arg))
4815 return cp_build_unary_op (code, arg, 0, complain);
4817 t = TREE_OPERAND (arg, 1);
4818 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4820 if (complain & tf_error)
4821 error ("cannot create pointer to reference member %qD", t);
4822 return error_mark_node;
4825 type = build_ptrmem_type (context_for_name_lookup (t),
4827 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4835 /* Anything not already handled and not a true memory reference
4837 if (TREE_CODE (argtype) != FUNCTION_TYPE
4838 && TREE_CODE (argtype) != METHOD_TYPE
4839 && TREE_CODE (arg) != OFFSET_REF
4840 && !lvalue_or_else (arg, lv_addressof, complain))
4841 return error_mark_node;
4843 if (argtype != error_mark_node)
4844 argtype = build_pointer_type (argtype);
4846 /* In a template, we are processing a non-dependent expression
4847 so we can just form an ADDR_EXPR with the correct type. */
4848 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
4850 val = build_address (arg);
4851 if (TREE_CODE (arg) == OFFSET_REF)
4852 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4854 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
4856 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4858 /* We can only get here with a single static member
4860 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4861 && DECL_STATIC_FUNCTION_P (fn));
4863 val = build_address (fn);
4864 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4865 /* Do not lose object's side effects. */
4866 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4867 TREE_OPERAND (arg, 0), val);
4869 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4871 if (complain & tf_error)
4872 error ("attempt to take address of bit-field structure member %qD",
4873 TREE_OPERAND (arg, 1));
4874 return error_mark_node;
4878 tree object = TREE_OPERAND (arg, 0);
4879 tree field = TREE_OPERAND (arg, 1);
4880 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4881 (TREE_TYPE (object), decl_type_context (field)));
4882 val = build_address (arg);
4885 if (TREE_CODE (argtype) == POINTER_TYPE
4886 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4888 build_ptrmemfunc_type (argtype);
4889 val = build_ptrmemfunc (argtype, val, 0,
4890 /*c_cast_p=*/false);
4902 argtype = TREE_TYPE (arg);
4903 return fold_if_not_in_template (build1 (code, argtype, arg));
4906 if (complain & tf_error)
4907 error ("%s", errstring);
4908 return error_mark_node;
4911 /* Hook for the c-common bits that build a unary op. */
4913 build_unary_op (location_t location ATTRIBUTE_UNUSED,
4914 enum tree_code code, tree xarg, int noconvert)
4916 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
4919 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4920 for certain kinds of expressions which are not really lvalues
4921 but which we can accept as lvalues.
4923 If ARG is not a kind of expression we can handle, return
4927 unary_complex_lvalue (enum tree_code code, tree arg)
4929 /* Inside a template, making these kinds of adjustments is
4930 pointless; we are only concerned with the type of the
4932 if (processing_template_decl)
4935 /* Handle (a, b) used as an "lvalue". */
4936 if (TREE_CODE (arg) == COMPOUND_EXPR)
4938 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
4939 tf_warning_or_error);
4940 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4941 TREE_OPERAND (arg, 0), real_result);
4944 /* Handle (a ? b : c) used as an "lvalue". */
4945 if (TREE_CODE (arg) == COND_EXPR
4946 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
4947 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
4949 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4950 if (TREE_CODE (arg) == MODIFY_EXPR
4951 || TREE_CODE (arg) == PREINCREMENT_EXPR
4952 || TREE_CODE (arg) == PREDECREMENT_EXPR)
4954 tree lvalue = TREE_OPERAND (arg, 0);
4955 if (TREE_SIDE_EFFECTS (lvalue))
4957 lvalue = stabilize_reference (lvalue);
4958 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
4959 lvalue, TREE_OPERAND (arg, 1));
4961 return unary_complex_lvalue
4962 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
4965 if (code != ADDR_EXPR)
4968 /* Handle (a = b) used as an "lvalue" for `&'. */
4969 if (TREE_CODE (arg) == MODIFY_EXPR
4970 || TREE_CODE (arg) == INIT_EXPR)
4972 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
4973 tf_warning_or_error);
4974 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4976 TREE_NO_WARNING (arg) = 1;
4980 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
4981 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
4982 || TREE_CODE (arg) == OFFSET_REF)
4985 /* We permit compiler to make function calls returning
4986 objects of aggregate type look like lvalues. */
4990 if (TREE_CODE (targ) == SAVE_EXPR)
4991 targ = TREE_OPERAND (targ, 0);
4993 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
4995 if (TREE_CODE (arg) == SAVE_EXPR)
4998 targ = build_cplus_new (TREE_TYPE (arg), arg);
4999 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
5002 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
5003 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
5004 TREE_OPERAND (targ, 0), current_function_decl, NULL);
5007 /* Don't let anything else be handled specially. */
5011 /* Mark EXP saying that we need to be able to take the
5012 address of it; it should not be allocated in a register.
5013 Value is true if successful.
5015 C++: we do not allow `current_class_ptr' to be addressable. */
5018 cxx_mark_addressable (tree exp)
5023 switch (TREE_CODE (x))
5030 x = TREE_OPERAND (x, 0);
5034 if (x == current_class_ptr)
5036 error ("cannot take the address of %<this%>, which is an rvalue expression");
5037 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
5043 /* Caller should not be trying to mark initialized
5044 constant fields addressable. */
5045 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
5046 || DECL_IN_AGGR_P (x) == 0
5048 || DECL_EXTERNAL (x));
5053 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
5054 && !DECL_ARTIFICIAL (x))
5056 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
5059 ("address of explicit register variable %qD requested", x);
5062 else if (extra_warnings)
5064 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
5066 TREE_ADDRESSABLE (x) = 1;
5070 TREE_ADDRESSABLE (x) = 1;
5074 TREE_ADDRESSABLE (x) = 1;
5078 TREE_ADDRESSABLE (x) = 1;
5079 cxx_mark_addressable (TREE_OPERAND (x, 0));
5087 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
5090 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
5091 tsubst_flags_t complain)
5093 tree orig_ifexp = ifexp;
5094 tree orig_op1 = op1;
5095 tree orig_op2 = op2;
5098 if (processing_template_decl)
5100 /* The standard says that the expression is type-dependent if
5101 IFEXP is type-dependent, even though the eventual type of the
5102 expression doesn't dependent on IFEXP. */
5103 if (type_dependent_expression_p (ifexp)
5104 /* As a GNU extension, the middle operand may be omitted. */
5105 || (op1 && type_dependent_expression_p (op1))
5106 || type_dependent_expression_p (op2))
5107 return build_min_nt (COND_EXPR, ifexp, op1, op2);
5108 ifexp = build_non_dependent_expr (ifexp);
5110 op1 = build_non_dependent_expr (op1);
5111 op2 = build_non_dependent_expr (op2);
5114 expr = build_conditional_expr (ifexp, op1, op2, complain);
5115 if (processing_template_decl && expr != error_mark_node)
5116 return build_min_non_dep (COND_EXPR, expr,
5117 orig_ifexp, orig_op1, orig_op2);
5121 /* Given a list of expressions, return a compound expression
5122 that performs them all and returns the value of the last of them. */
5124 tree build_x_compound_expr_from_list (tree list, const char *msg)
5126 tree expr = TREE_VALUE (list);
5128 if (TREE_CHAIN (list))
5131 permerror (input_location, "%s expression list treated as compound expression", msg);
5133 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
5134 expr = build_x_compound_expr (expr, TREE_VALUE (list),
5135 tf_warning_or_error);
5141 /* Like build_x_compound_expr_from_list, but using a VEC. */
5144 build_x_compound_expr_from_vec (VEC(tree,gc) *vec, const char *msg)
5146 if (VEC_empty (tree, vec))
5148 else if (VEC_length (tree, vec) == 1)
5149 return VEC_index (tree, vec, 0);
5157 permerror (input_location,
5158 "%s expression list treated as compound expression",
5161 expr = VEC_index (tree, vec, 0);
5162 for (ix = 1; VEC_iterate (tree, vec, ix, t); ++ix)
5163 expr = build_x_compound_expr (expr, t, tf_warning_or_error);
5169 /* Handle overloading of the ',' operator when needed. */
5172 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
5175 tree orig_op1 = op1;
5176 tree orig_op2 = op2;
5178 if (processing_template_decl)
5180 if (type_dependent_expression_p (op1)
5181 || type_dependent_expression_p (op2))
5182 return build_min_nt (COMPOUND_EXPR, op1, op2);
5183 op1 = build_non_dependent_expr (op1);
5184 op2 = build_non_dependent_expr (op2);
5187 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
5188 /*overloaded_p=*/NULL, complain);
5190 result = cp_build_compound_expr (op1, op2, complain);
5192 if (processing_template_decl && result != error_mark_node)
5193 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5198 /* Like cp_build_compound_expr, but for the c-common bits. */
5201 build_compound_expr (location_t loc ATTRIBUTE_UNUSED, tree lhs, tree rhs)
5203 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5206 /* Build a compound expression. */
5209 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5211 lhs = convert_to_void (lhs, "left-hand operand of comma", complain);
5213 if (lhs == error_mark_node || rhs == error_mark_node)
5214 return error_mark_node;
5216 if (TREE_CODE (rhs) == TARGET_EXPR)
5218 /* If the rhs is a TARGET_EXPR, then build the compound
5219 expression inside the target_expr's initializer. This
5220 helps the compiler to eliminate unnecessary temporaries. */
5221 tree init = TREE_OPERAND (rhs, 1);
5223 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5224 TREE_OPERAND (rhs, 1) = init;
5229 if (type_unknown_p (rhs))
5231 error ("no context to resolve type of %qE", rhs);
5232 return error_mark_node;
5235 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5238 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5239 casts away constness. CAST gives the type of cast.
5241 ??? This function warns for casting away any qualifier not just
5242 const. We would like to specify exactly what qualifiers are casted
5247 check_for_casting_away_constness (tree src_type, tree dest_type,
5248 enum tree_code cast)
5250 /* C-style casts are allowed to cast away constness. With
5251 WARN_CAST_QUAL, we still want to issue a warning. */
5252 if (cast == CAST_EXPR && !warn_cast_qual)
5255 if (!casts_away_constness (src_type, dest_type))
5261 warning (OPT_Wcast_qual,
5262 "cast from type %qT to type %qT casts away qualifiers",
5263 src_type, dest_type);
5266 case STATIC_CAST_EXPR:
5267 error ("static_cast from type %qT to type %qT casts away qualifiers",
5268 src_type, dest_type);
5271 case REINTERPRET_CAST_EXPR:
5272 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5273 src_type, dest_type);
5280 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5281 (another pointer-to-member type in the same hierarchy) and return
5282 the converted expression. If ALLOW_INVERSE_P is permitted, a
5283 pointer-to-derived may be converted to pointer-to-base; otherwise,
5284 only the other direction is permitted. If C_CAST_P is true, this
5285 conversion is taking place as part of a C-style cast. */
5288 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5291 if (TYPE_PTRMEM_P (type))
5295 if (TREE_CODE (expr) == PTRMEM_CST)
5296 expr = cplus_expand_constant (expr);
5297 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5298 TYPE_PTRMEM_CLASS_TYPE (type),
5301 if (!integer_zerop (delta))
5303 tree cond, op1, op2;
5305 cond = cp_build_binary_op (input_location,
5308 build_int_cst (TREE_TYPE (expr), -1),
5309 tf_warning_or_error);
5310 op1 = build_nop (ptrdiff_type_node, expr);
5311 op2 = cp_build_binary_op (input_location,
5312 PLUS_EXPR, op1, delta,
5313 tf_warning_or_error);
5315 expr = fold_build3_loc (input_location,
5316 COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5320 return build_nop (type, expr);
5323 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5324 allow_inverse_p, c_cast_p);
5327 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5328 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5329 Otherwise, return EXPR unchanged. */
5332 ignore_overflows (tree expr, tree orig)
5334 if (TREE_CODE (expr) == INTEGER_CST
5335 && CONSTANT_CLASS_P (orig)
5336 && TREE_CODE (orig) != STRING_CST
5337 && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig))
5339 if (!TREE_OVERFLOW (orig))
5340 /* Ensure constant sharing. */
5341 expr = build_int_cst_wide (TREE_TYPE (expr),
5342 TREE_INT_CST_LOW (expr),
5343 TREE_INT_CST_HIGH (expr));
5346 /* Avoid clobbering a shared constant. */
5347 expr = copy_node (expr);
5348 TREE_OVERFLOW (expr) = TREE_OVERFLOW (orig);
5354 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5355 this static_cast is being attempted as one of the possible casts
5356 allowed by a C-style cast. (In that case, accessibility of base
5357 classes is not considered, and it is OK to cast away
5358 constness.) Return the result of the cast. *VALID_P is set to
5359 indicate whether or not the cast was valid. */
5362 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5363 bool *valid_p, tsubst_flags_t complain)
5369 /* Assume the cast is valid. */
5372 intype = TREE_TYPE (expr);
5374 /* Save casted types in the function's used types hash table. */
5375 used_types_insert (type);
5377 /* [expr.static.cast]
5379 An lvalue of type "cv1 B", where B is a class type, can be cast
5380 to type "reference to cv2 D", where D is a class derived (clause
5381 _class.derived_) from B, if a valid standard conversion from
5382 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5383 same cv-qualification as, or greater cv-qualification than, cv1,
5384 and B is not a virtual base class of D. */
5385 /* We check this case before checking the validity of "TYPE t =
5386 EXPR;" below because for this case:
5389 struct D : public B { D(const B&); };
5391 void f() { static_cast<const D&>(b); }
5393 we want to avoid constructing a new D. The standard is not
5394 completely clear about this issue, but our interpretation is
5395 consistent with other compilers. */
5396 if (TREE_CODE (type) == REFERENCE_TYPE
5397 && CLASS_TYPE_P (TREE_TYPE (type))
5398 && CLASS_TYPE_P (intype)
5399 && (TYPE_REF_IS_RVALUE (type) || real_lvalue_p (expr))
5400 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5401 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5402 build_pointer_type (TYPE_MAIN_VARIANT
5403 (TREE_TYPE (type))))
5405 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5409 /* There is a standard conversion from "D*" to "B*" even if "B"
5410 is ambiguous or inaccessible. If this is really a
5411 static_cast, then we check both for inaccessibility and
5412 ambiguity. However, if this is a static_cast being performed
5413 because the user wrote a C-style cast, then accessibility is
5415 base = lookup_base (TREE_TYPE (type), intype,
5416 c_cast_p ? ba_unique : ba_check,
5419 /* Convert from "B*" to "D*". This function will check that "B"
5420 is not a virtual base of "D". */
5421 expr = build_base_path (MINUS_EXPR, build_address (expr),
5422 base, /*nonnull=*/false);
5423 /* Convert the pointer to a reference -- but then remember that
5424 there are no expressions with reference type in C++. */
5425 return convert_from_reference (cp_fold_convert (type, expr));
5428 /* "An lvalue of type cv1 T1 can be cast to type rvalue reference to
5429 cv2 T2 if cv2 T2 is reference-compatible with cv1 T1 (8.5.3)." */
5430 if (TREE_CODE (type) == REFERENCE_TYPE
5431 && TYPE_REF_IS_RVALUE (type)
5432 && real_lvalue_p (expr)
5433 && reference_related_p (TREE_TYPE (type), intype)
5434 && (c_cast_p || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5436 expr = build_typed_address (expr, type);
5437 return convert_from_reference (expr);
5442 /* Resolve overloaded address here rather than once in
5443 implicit_conversion and again in the inverse code below. */
5444 if (TYPE_PTRMEMFUNC_P (type) && type_unknown_p (expr))
5446 expr = instantiate_type (type, expr, complain);
5447 intype = TREE_TYPE (expr);
5450 /* [expr.static.cast]
5452 An expression e can be explicitly converted to a type T using a
5453 static_cast of the form static_cast<T>(e) if the declaration T
5454 t(e);" is well-formed, for some invented temporary variable
5456 result = perform_direct_initialization_if_possible (type, expr,
5457 c_cast_p, complain);
5460 result = convert_from_reference (result);
5462 /* Ignore any integer overflow caused by the cast. */
5463 result = ignore_overflows (result, orig);
5465 /* [expr.static.cast]
5467 If T is a reference type, the result is an lvalue; otherwise,
5468 the result is an rvalue. */
5469 if (TREE_CODE (type) != REFERENCE_TYPE)
5470 result = rvalue (result);
5474 /* [expr.static.cast]
5476 Any expression can be explicitly converted to type cv void. */
5477 if (TREE_CODE (type) == VOID_TYPE)
5478 return convert_to_void (expr, /*implicit=*/NULL, complain);
5480 /* [expr.static.cast]
5482 The inverse of any standard conversion sequence (clause _conv_),
5483 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5484 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5485 (_conv.bool_) conversions, can be performed explicitly using
5486 static_cast subject to the restriction that the explicit
5487 conversion does not cast away constness (_expr.const.cast_), and
5488 the following additional rules for specific cases: */
5489 /* For reference, the conversions not excluded are: integral
5490 promotions, floating point promotion, integral conversions,
5491 floating point conversions, floating-integral conversions,
5492 pointer conversions, and pointer to member conversions. */
5495 A value of integral _or enumeration_ type can be explicitly
5496 converted to an enumeration type. */
5497 /* The effect of all that is that any conversion between any two
5498 types which are integral, floating, or enumeration types can be
5500 if ((INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5501 || SCALAR_FLOAT_TYPE_P (type))
5502 && (INTEGRAL_OR_ENUMERATION_TYPE_P (intype)
5503 || SCALAR_FLOAT_TYPE_P (intype)))
5505 expr = ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5507 /* Ignore any integer overflow caused by the cast. */
5508 expr = ignore_overflows (expr, orig);
5512 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5513 && CLASS_TYPE_P (TREE_TYPE (type))
5514 && CLASS_TYPE_P (TREE_TYPE (intype))
5515 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5516 (TREE_TYPE (intype))),
5517 build_pointer_type (TYPE_MAIN_VARIANT
5518 (TREE_TYPE (type)))))
5523 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5524 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5525 c_cast_p ? ba_unique : ba_check,
5527 return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
5530 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5531 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5538 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5539 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5541 if (TYPE_PTRMEM_P (type))
5543 t1 = (build_ptrmem_type
5545 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5546 t2 = (build_ptrmem_type
5548 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5555 if (can_convert (t1, t2) || can_convert (t2, t1))
5558 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5559 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5564 /* [expr.static.cast]
5566 An rvalue of type "pointer to cv void" can be explicitly
5567 converted to a pointer to object type. A value of type pointer
5568 to object converted to "pointer to cv void" and back to the
5569 original pointer type will have its original value. */
5570 if (TREE_CODE (intype) == POINTER_TYPE
5571 && VOID_TYPE_P (TREE_TYPE (intype))
5572 && TYPE_PTROB_P (type))
5575 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5576 return build_nop (type, expr);
5580 return error_mark_node;
5583 /* Return an expression representing static_cast<TYPE>(EXPR). */
5586 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5591 if (type == error_mark_node || expr == error_mark_node)
5592 return error_mark_node;
5594 if (processing_template_decl)
5596 expr = build_min (STATIC_CAST_EXPR, type, expr);
5597 /* We don't know if it will or will not have side effects. */
5598 TREE_SIDE_EFFECTS (expr) = 1;
5599 return convert_from_reference (expr);
5602 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5603 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5604 if (TREE_CODE (type) != REFERENCE_TYPE
5605 && TREE_CODE (expr) == NOP_EXPR
5606 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5607 expr = TREE_OPERAND (expr, 0);
5609 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
5614 if (complain & tf_error)
5615 error ("invalid static_cast from type %qT to type %qT",
5616 TREE_TYPE (expr), type);
5617 return error_mark_node;
5620 /* EXPR is an expression with member function or pointer-to-member
5621 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5622 not permitted by ISO C++, but we accept it in some modes. If we
5623 are not in one of those modes, issue a diagnostic. Return the
5624 converted expression. */
5627 convert_member_func_to_ptr (tree type, tree expr)
5632 intype = TREE_TYPE (expr);
5633 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
5634 || TREE_CODE (intype) == METHOD_TYPE);
5636 if (pedantic || warn_pmf2ptr)
5637 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
5638 "converting from %qT to %qT", intype, type);
5640 if (TREE_CODE (intype) == METHOD_TYPE)
5641 expr = build_addr_func (expr);
5642 else if (TREE_CODE (expr) == PTRMEM_CST)
5643 expr = build_address (PTRMEM_CST_MEMBER (expr));
5646 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
5647 decl = build_address (decl);
5648 expr = get_member_function_from_ptrfunc (&decl, expr);
5651 return build_nop (type, expr);
5654 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5655 If C_CAST_P is true, this reinterpret cast is being done as part of
5656 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5657 indicate whether or not reinterpret_cast was valid. */
5660 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
5661 bool *valid_p, tsubst_flags_t complain)
5665 /* Assume the cast is invalid. */
5669 if (type == error_mark_node || error_operand_p (expr))
5670 return error_mark_node;
5672 intype = TREE_TYPE (expr);
5674 /* Save casted types in the function's used types hash table. */
5675 used_types_insert (type);
5677 /* [expr.reinterpret.cast]
5678 An lvalue expression of type T1 can be cast to the type
5679 "reference to T2" if an expression of type "pointer to T1" can be
5680 explicitly converted to the type "pointer to T2" using a
5681 reinterpret_cast. */
5682 if (TREE_CODE (type) == REFERENCE_TYPE)
5684 if (! real_lvalue_p (expr))
5686 if (complain & tf_error)
5687 error ("invalid cast of an rvalue expression of type "
5690 return error_mark_node;
5693 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5694 "B" are related class types; the reinterpret_cast does not
5695 adjust the pointer. */
5696 if (TYPE_PTR_P (intype)
5697 && (complain & tf_warning)
5698 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
5699 COMPARE_BASE | COMPARE_DERIVED)))
5700 warning (0, "casting %qT to %qT does not dereference pointer",
5703 expr = cp_build_unary_op (ADDR_EXPR, expr, 0, complain);
5705 if (warn_strict_aliasing > 2)
5706 strict_aliasing_warning (TREE_TYPE (expr), type, expr);
5708 if (expr != error_mark_node)
5709 expr = build_reinterpret_cast_1
5710 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
5712 if (expr != error_mark_node)
5713 /* cp_build_indirect_ref isn't right for rvalue refs. */
5714 expr = convert_from_reference (fold_convert (type, expr));
5718 /* As a G++ extension, we consider conversions from member
5719 functions, and pointers to member functions to
5720 pointer-to-function and pointer-to-void types. If
5721 -Wno-pmf-conversions has not been specified,
5722 convert_member_func_to_ptr will issue an error message. */
5723 if ((TYPE_PTRMEMFUNC_P (intype)
5724 || TREE_CODE (intype) == METHOD_TYPE)
5725 && TYPE_PTR_P (type)
5726 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
5727 || VOID_TYPE_P (TREE_TYPE (type))))
5728 return convert_member_func_to_ptr (type, expr);
5730 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5731 array-to-pointer, and function-to-pointer conversions are
5733 expr = decay_conversion (expr);
5735 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5736 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5737 if (TREE_CODE (expr) == NOP_EXPR
5738 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5739 expr = TREE_OPERAND (expr, 0);
5741 if (error_operand_p (expr))
5742 return error_mark_node;
5744 intype = TREE_TYPE (expr);
5746 /* [expr.reinterpret.cast]
5747 A pointer can be converted to any integral type large enough to
5749 if (CP_INTEGRAL_TYPE_P (type) && TYPE_PTR_P (intype))
5751 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
5753 if (complain & tf_error)
5754 permerror (input_location, "cast from %qT to %qT loses precision",
5757 return error_mark_node;
5760 /* [expr.reinterpret.cast]
5761 A value of integral or enumeration type can be explicitly
5762 converted to a pointer. */
5763 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
5766 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
5767 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5768 return fold_if_not_in_template (build_nop (type, expr));
5769 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5770 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
5775 check_for_casting_away_constness (intype, type, REINTERPRET_CAST_EXPR);
5776 /* Warn about possible alignment problems. */
5777 if (STRICT_ALIGNMENT && warn_cast_align
5778 && (complain & tf_warning)
5779 && !VOID_TYPE_P (type)
5780 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
5781 && COMPLETE_TYPE_P (TREE_TYPE (type))
5782 && COMPLETE_TYPE_P (TREE_TYPE (intype))
5783 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
5784 warning (OPT_Wcast_align, "cast from %qT to %qT "
5785 "increases required alignment of target type", intype, type);
5787 /* We need to strip nops here, because the front end likes to
5788 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
5790 if (warn_strict_aliasing <= 2)
5791 strict_aliasing_warning (intype, type, sexpr);
5793 return fold_if_not_in_template (build_nop (type, expr));
5795 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
5796 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
5798 if (pedantic && (complain & tf_warning))
5799 /* Only issue a warning, as we have always supported this
5800 where possible, and it is necessary in some cases. DR 195
5801 addresses this issue, but as of 2004/10/26 is still in
5803 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5804 return fold_if_not_in_template (build_nop (type, expr));
5806 else if (TREE_CODE (type) == VECTOR_TYPE)
5807 return fold_if_not_in_template (convert_to_vector (type, expr));
5808 else if (TREE_CODE (intype) == VECTOR_TYPE
5809 && INTEGRAL_OR_ENUMERATION_TYPE_P (type))
5810 return fold_if_not_in_template (convert_to_integer (type, expr));
5815 if (complain & tf_error)
5816 error ("invalid cast from type %qT to type %qT", intype, type);
5817 return error_mark_node;
5820 return cp_convert (type, expr);
5824 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
5826 if (type == error_mark_node || expr == error_mark_node)
5827 return error_mark_node;
5829 if (processing_template_decl)
5831 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
5833 if (!TREE_SIDE_EFFECTS (t)
5834 && type_dependent_expression_p (expr))
5835 /* There might turn out to be side effects inside expr. */
5836 TREE_SIDE_EFFECTS (t) = 1;
5837 return convert_from_reference (t);
5840 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
5841 /*valid_p=*/NULL, complain);
5844 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
5845 return an appropriate expression. Otherwise, return
5846 error_mark_node. If the cast is not valid, and COMPLAIN is true,
5847 then a diagnostic will be issued. If VALID_P is non-NULL, we are
5848 performing a C-style cast, its value upon return will indicate
5849 whether or not the conversion succeeded. */
5852 build_const_cast_1 (tree dst_type, tree expr, bool complain,
5856 tree reference_type;
5858 /* Callers are responsible for handling error_mark_node as a
5859 destination type. */
5860 gcc_assert (dst_type != error_mark_node);
5861 /* In a template, callers should be building syntactic
5862 representations of casts, not using this machinery. */
5863 gcc_assert (!processing_template_decl);
5865 /* Assume the conversion is invalid. */
5869 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
5872 error ("invalid use of const_cast with type %qT, "
5873 "which is not a pointer, "
5874 "reference, nor a pointer-to-data-member type", dst_type);
5875 return error_mark_node;
5878 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
5881 error ("invalid use of const_cast with type %qT, which is a pointer "
5882 "or reference to a function type", dst_type);
5883 return error_mark_node;
5886 /* Save casted types in the function's used types hash table. */
5887 used_types_insert (dst_type);
5889 src_type = TREE_TYPE (expr);
5890 /* Expressions do not really have reference types. */
5891 if (TREE_CODE (src_type) == REFERENCE_TYPE)
5892 src_type = TREE_TYPE (src_type);
5894 /* [expr.const.cast]
5896 An lvalue of type T1 can be explicitly converted to an lvalue of
5897 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
5898 types) if a pointer to T1 can be explicitly converted to the type
5899 pointer to T2 using a const_cast. */
5900 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
5902 reference_type = dst_type;
5903 if (! real_lvalue_p (expr))
5906 error ("invalid const_cast of an rvalue of type %qT to type %qT",
5907 src_type, dst_type);
5908 return error_mark_node;
5910 dst_type = build_pointer_type (TREE_TYPE (dst_type));
5911 src_type = build_pointer_type (src_type);
5915 reference_type = NULL_TREE;
5916 /* If the destination type is not a reference type, the
5917 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5918 conversions are performed. */
5919 src_type = type_decays_to (src_type);
5920 if (src_type == error_mark_node)
5921 return error_mark_node;
5924 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
5925 && comp_ptr_ttypes_const (dst_type, src_type))
5930 /* This cast is actually a C-style cast. Issue a warning if
5931 the user is making a potentially unsafe cast. */
5932 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR);
5936 expr = cp_build_unary_op (ADDR_EXPR, expr, 0,
5937 complain? tf_warning_or_error : tf_none);
5938 expr = build_nop (reference_type, expr);
5939 return convert_from_reference (expr);
5943 expr = decay_conversion (expr);
5944 /* build_c_cast puts on a NOP_EXPR to make the result not an
5945 lvalue. Strip such NOP_EXPRs if VALUE is being used in
5946 non-lvalue context. */
5947 if (TREE_CODE (expr) == NOP_EXPR
5948 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5949 expr = TREE_OPERAND (expr, 0);
5950 return build_nop (dst_type, expr);
5955 error ("invalid const_cast from type %qT to type %qT",
5956 src_type, dst_type);
5957 return error_mark_node;
5961 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
5963 if (type == error_mark_node || error_operand_p (expr))
5964 return error_mark_node;
5966 if (processing_template_decl)
5968 tree t = build_min (CONST_CAST_EXPR, type, expr);
5970 if (!TREE_SIDE_EFFECTS (t)
5971 && type_dependent_expression_p (expr))
5972 /* There might turn out to be side effects inside expr. */
5973 TREE_SIDE_EFFECTS (t) = 1;
5974 return convert_from_reference (t);
5977 return build_const_cast_1 (type, expr, complain & tf_error,
5981 /* Like cp_build_c_cast, but for the c-common bits. */
5984 build_c_cast (location_t loc ATTRIBUTE_UNUSED, tree type, tree expr)
5986 return cp_build_c_cast (type, expr, tf_warning_or_error);
5989 /* Build an expression representing an explicit C-style cast to type
5990 TYPE of expression EXPR. */
5993 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
5999 if (type == error_mark_node || error_operand_p (expr))
6000 return error_mark_node;
6002 if (processing_template_decl)
6004 tree t = build_min (CAST_EXPR, type,
6005 tree_cons (NULL_TREE, value, NULL_TREE));
6006 /* We don't know if it will or will not have side effects. */
6007 TREE_SIDE_EFFECTS (t) = 1;
6008 return convert_from_reference (t);
6011 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
6012 'Class') should always be retained, because this information aids
6013 in method lookup. */
6014 if (objc_is_object_ptr (type)
6015 && objc_is_object_ptr (TREE_TYPE (expr)))
6016 return build_nop (type, expr);
6018 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6019 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
6020 if (TREE_CODE (type) != REFERENCE_TYPE
6021 && TREE_CODE (value) == NOP_EXPR
6022 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
6023 value = TREE_OPERAND (value, 0);
6025 if (TREE_CODE (type) == ARRAY_TYPE)
6027 /* Allow casting from T1* to T2[] because Cfront allows it.
6028 NIHCL uses it. It is not valid ISO C++ however. */
6029 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
6031 if (complain & tf_error)
6032 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
6034 return error_mark_node;
6035 type = build_pointer_type (TREE_TYPE (type));
6039 if (complain & tf_error)
6040 error ("ISO C++ forbids casting to an array type %qT", type);
6041 return error_mark_node;
6045 if (TREE_CODE (type) == FUNCTION_TYPE
6046 || TREE_CODE (type) == METHOD_TYPE)
6048 if (complain & tf_error)
6049 error ("invalid cast to function type %qT", type);
6050 return error_mark_node;
6053 /* A C-style cast can be a const_cast. */
6054 result = build_const_cast_1 (type, value, /*complain=*/false,
6059 /* Or a static cast. */
6060 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
6061 &valid_p, complain);
6062 /* Or a reinterpret_cast. */
6064 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
6065 &valid_p, complain);
6066 /* The static_cast or reinterpret_cast may be followed by a
6069 /* A valid cast may result in errors if, for example, a
6070 conversion to am ambiguous base class is required. */
6071 && !error_operand_p (result))
6075 /* Non-class rvalues always have cv-unqualified type. */
6076 if (!CLASS_TYPE_P (type))
6077 type = TYPE_MAIN_VARIANT (type);
6078 result_type = TREE_TYPE (result);
6079 if (!CLASS_TYPE_P (result_type))
6080 result_type = TYPE_MAIN_VARIANT (result_type);
6081 /* If the type of RESULT does not match TYPE, perform a
6082 const_cast to make it match. If the static_cast or
6083 reinterpret_cast succeeded, we will differ by at most
6084 cv-qualification, so the follow-on const_cast is guaranteed
6086 if (!same_type_p (non_reference (type), non_reference (result_type)))
6088 result = build_const_cast_1 (type, result, false, &valid_p);
6089 gcc_assert (valid_p);
6094 return error_mark_node;
6097 /* For use from the C common bits. */
6099 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
6100 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
6101 enum tree_code modifycode,
6102 location_t rhs_location ATTRIBUTE_UNUSED, tree rhs,
6103 tree rhs_origtype ATTRIBUTE_UNUSED)
6105 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
6108 /* Build an assignment expression of lvalue LHS from value RHS.
6109 MODIFYCODE is the code for a binary operator that we use
6110 to combine the old value of LHS with RHS to get the new value.
6111 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
6113 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
6116 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6117 tsubst_flags_t complain)
6121 tree lhstype = TREE_TYPE (lhs);
6122 tree olhstype = lhstype;
6123 bool plain_assign = (modifycode == NOP_EXPR);
6125 /* Avoid duplicate error messages from operands that had errors. */
6126 if (error_operand_p (lhs) || error_operand_p (rhs))
6127 return error_mark_node;
6129 /* Handle control structure constructs used as "lvalues". */
6130 switch (TREE_CODE (lhs))
6132 /* Handle --foo = 5; as these are valid constructs in C++. */
6133 case PREDECREMENT_EXPR:
6134 case PREINCREMENT_EXPR:
6135 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6136 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6137 stabilize_reference (TREE_OPERAND (lhs, 0)),
6138 TREE_OPERAND (lhs, 1));
6139 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
6140 modifycode, rhs, complain);
6141 if (newrhs == error_mark_node)
6142 return error_mark_node;
6143 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6145 /* Handle (a, b) used as an "lvalue". */
6147 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6148 modifycode, rhs, complain);
6149 if (newrhs == error_mark_node)
6150 return error_mark_node;
6151 return build2 (COMPOUND_EXPR, lhstype,
6152 TREE_OPERAND (lhs, 0), newrhs);
6155 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
6156 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
6157 stabilize_reference (TREE_OPERAND (lhs, 0)),
6158 TREE_OPERAND (lhs, 1));
6159 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
6161 if (newrhs == error_mark_node)
6162 return error_mark_node;
6163 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
6167 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
6168 when neither operand has side-effects. */
6169 if (!lvalue_or_else (lhs, lv_assign, complain))
6170 return error_mark_node;
6172 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
6173 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
6175 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
6176 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
6178 TREE_OPERAND (lhs, 0),
6179 TREE_OPERAND (lhs, 1)),
6180 TREE_OPERAND (lhs, 0),
6181 TREE_OPERAND (lhs, 1));
6184 /* Handle (a ? b : c) used as an "lvalue". */
6187 /* Produce (a ? (b = rhs) : (c = rhs))
6188 except that the RHS goes through a save-expr
6189 so the code to compute it is only emitted once. */
6191 tree preeval = NULL_TREE;
6193 if (VOID_TYPE_P (TREE_TYPE (rhs)))
6195 if (complain & tf_error)
6196 error ("void value not ignored as it ought to be");
6197 return error_mark_node;
6200 rhs = stabilize_expr (rhs, &preeval);
6202 /* Check this here to avoid odd errors when trying to convert
6203 a throw to the type of the COND_EXPR. */
6204 if (!lvalue_or_else (lhs, lv_assign, complain))
6205 return error_mark_node;
6207 cond = build_conditional_expr
6208 (TREE_OPERAND (lhs, 0),
6209 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
6210 modifycode, rhs, complain),
6211 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
6212 modifycode, rhs, complain),
6215 if (cond == error_mark_node)
6217 /* Make sure the code to compute the rhs comes out
6218 before the split. */
6220 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6228 if (modifycode == INIT_EXPR)
6230 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6231 /* Do the default thing. */;
6232 else if (TREE_CODE (rhs) == CONSTRUCTOR)
6234 /* Compound literal. */
6235 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6236 /* Call convert to generate an error; see PR 11063. */
6237 rhs = convert (lhstype, rhs);
6238 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6239 TREE_SIDE_EFFECTS (result) = 1;
6242 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6243 /* Do the default thing. */;
6246 VEC(tree,gc) *rhs_vec = make_tree_vector_single (rhs);
6247 result = build_special_member_call (lhs, complete_ctor_identifier,
6248 &rhs_vec, lhstype, LOOKUP_NORMAL,
6250 release_tree_vector (rhs_vec);
6251 if (result == NULL_TREE)
6252 return error_mark_node;
6258 lhs = require_complete_type (lhs);
6259 if (lhs == error_mark_node)
6260 return error_mark_node;
6262 if (modifycode == NOP_EXPR)
6264 /* `operator=' is not an inheritable operator. */
6265 if (! MAYBE_CLASS_TYPE_P (lhstype))
6266 /* Do the default thing. */;
6269 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6270 lhs, rhs, make_node (NOP_EXPR),
6271 /*overloaded_p=*/NULL,
6273 if (result == NULL_TREE)
6274 return error_mark_node;
6281 /* A binary op has been requested. Combine the old LHS
6282 value with the RHS producing the value we should actually
6283 store into the LHS. */
6284 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6285 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6286 || MAYBE_CLASS_TYPE_P (lhstype)));
6288 lhs = stabilize_reference (lhs);
6289 newrhs = cp_build_binary_op (input_location,
6290 modifycode, lhs, rhs,
6292 if (newrhs == error_mark_node)
6294 if (complain & tf_error)
6295 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6296 TREE_TYPE (lhs), TREE_TYPE (rhs));
6297 return error_mark_node;
6300 /* Now it looks like a plain assignment. */
6301 modifycode = NOP_EXPR;
6303 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6304 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6307 /* The left-hand side must be an lvalue. */
6308 if (!lvalue_or_else (lhs, lv_assign, complain))
6309 return error_mark_node;
6311 /* Warn about modifying something that is `const'. Don't warn if
6312 this is initialization. */
6313 if (modifycode != INIT_EXPR
6314 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6315 /* Functions are not modifiable, even though they are
6317 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6318 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6319 /* If it's an aggregate and any field is const, then it is
6320 effectively const. */
6321 || (CLASS_TYPE_P (lhstype)
6322 && C_TYPE_FIELDS_READONLY (lhstype))))
6324 if (complain & tf_error)
6325 readonly_error (lhs, "assignment");
6327 return error_mark_node;
6330 /* If storing into a structure or union member, it may have been given a
6331 lowered bitfield type. We need to convert to the declared type first,
6332 so retrieve it now. */
6334 olhstype = unlowered_expr_type (lhs);
6336 /* Convert new value to destination type. */
6338 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6342 if (BRACE_ENCLOSED_INITIALIZER_P (rhs))
6344 if (check_array_initializer (lhs, lhstype, rhs))
6345 return error_mark_node;
6346 rhs = digest_init (lhstype, rhs);
6349 else if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6350 TYPE_MAIN_VARIANT (TREE_TYPE (rhs))))
6352 if (complain & tf_error)
6353 error ("incompatible types in assignment of %qT to %qT",
6354 TREE_TYPE (rhs), lhstype);
6355 return error_mark_node;
6358 /* Allow array assignment in compiler-generated code. */
6359 else if (!current_function_decl
6360 || !DECL_ARTIFICIAL (current_function_decl))
6362 /* This routine is used for both initialization and assignment.
6363 Make sure the diagnostic message differentiates the context. */
6364 if (complain & tf_error)
6366 if (modifycode == INIT_EXPR)
6367 error ("array used as initializer");
6369 error ("invalid array assignment");
6371 return error_mark_node;
6374 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6375 ? 1 + (modifycode != INIT_EXPR): 0;
6376 return build_vec_init (lhs, NULL_TREE, newrhs,
6377 /*explicit_value_init_p=*/false,
6378 from_array, complain);
6381 if (modifycode == INIT_EXPR)
6382 /* Calls with INIT_EXPR are all direct-initialization, so don't set
6383 LOOKUP_ONLYCONVERTING. */
6384 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6385 "initialization", NULL_TREE, 0,
6388 newrhs = convert_for_assignment (olhstype, newrhs, "assignment",
6389 NULL_TREE, 0, complain, LOOKUP_IMPLICIT);
6391 if (!same_type_p (lhstype, olhstype))
6392 newrhs = cp_convert_and_check (lhstype, newrhs);
6394 if (modifycode != INIT_EXPR)
6396 if (TREE_CODE (newrhs) == CALL_EXPR
6397 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6398 newrhs = build_cplus_new (lhstype, newrhs);
6400 /* Can't initialize directly from a TARGET_EXPR, since that would
6401 cause the lhs to be constructed twice, and possibly result in
6402 accidental self-initialization. So we force the TARGET_EXPR to be
6403 expanded without a target. */
6404 if (TREE_CODE (newrhs) == TARGET_EXPR)
6405 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6406 TREE_OPERAND (newrhs, 0));
6409 if (newrhs == error_mark_node)
6410 return error_mark_node;
6412 if (c_dialect_objc () && flag_objc_gc)
6414 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6420 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6421 lhstype, lhs, newrhs);
6423 TREE_SIDE_EFFECTS (result) = 1;
6425 TREE_NO_WARNING (result) = 1;
6431 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6432 tsubst_flags_t complain)
6434 if (processing_template_decl)
6435 return build_min_nt (MODOP_EXPR, lhs,
6436 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6438 if (modifycode != NOP_EXPR)
6440 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6441 make_node (modifycode),
6442 /*overloaded_p=*/NULL,
6446 TREE_NO_WARNING (rval) = 1;
6450 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6453 /* Helper function for get_delta_difference which assumes FROM is a base
6454 class of TO. Returns a delta for the conversion of pointer-to-member
6455 of FROM to pointer-to-member of TO. If the conversion is invalid,
6456 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6457 If C_CAST_P is true, this conversion is taking place as part of a C-style
6461 get_delta_difference_1 (tree from, tree to, bool c_cast_p)
6466 binfo = lookup_base (to, from, c_cast_p ? ba_unique : ba_check, &kind);
6467 if (kind == bk_inaccessible || kind == bk_ambig)
6469 error (" in pointer to member function conversion");
6470 return size_zero_node;
6474 if (kind != bk_via_virtual)
6475 return BINFO_OFFSET (binfo);
6477 /* FROM is a virtual base class of TO. Issue an error or warning
6478 depending on whether or not this is a reinterpret cast. */
6480 error ("pointer to member conversion via virtual base %qT",
6481 BINFO_TYPE (binfo_from_vbase (binfo)));
6483 return size_zero_node;
6490 /* Get difference in deltas for different pointer to member function
6491 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6492 the conversion is invalid, the constant is zero. If
6493 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6494 If C_CAST_P is true this conversion is taking place as part of a
6497 Note that the naming of FROM and TO is kind of backwards; the return
6498 value is what we add to a TO in order to get a FROM. They are named
6499 this way because we call this function to find out how to convert from
6500 a pointer to member of FROM to a pointer to member of TO. */
6503 get_delta_difference (tree from, tree to,
6504 bool allow_inverse_p,
6509 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6510 /* Pointer to member of incomplete class is permitted*/
6511 result = size_zero_node;
6513 result = get_delta_difference_1 (from, to, c_cast_p);
6517 if (!allow_inverse_p)
6519 error_not_base_type (from, to);
6520 error (" in pointer to member conversion");
6521 result = size_zero_node;
6525 result = get_delta_difference_1 (to, from, c_cast_p);
6528 result = size_diffop_loc (input_location,
6529 size_zero_node, result);
6532 error_not_base_type (from, to);
6533 error (" in pointer to member conversion");
6534 result = size_zero_node;
6539 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
6543 /* Return a constructor for the pointer-to-member-function TYPE using
6544 the other components as specified. */
6547 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
6552 VEC(constructor_elt, gc) *v;
6554 /* Pull the FIELD_DECLs out of the type. */
6555 pfn_field = TYPE_FIELDS (type);
6556 delta_field = TREE_CHAIN (pfn_field);
6558 /* Make sure DELTA has the type we want. */
6559 delta = convert_and_check (delta_type_node, delta);
6561 /* Convert to the correct target type if necessary. */
6562 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
6564 /* Finish creating the initializer. */
6565 v = VEC_alloc(constructor_elt, gc, 2);
6566 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
6567 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
6568 u = build_constructor (type, v);
6569 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
6570 TREE_STATIC (u) = (TREE_CONSTANT (u)
6571 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6573 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
6578 /* Build a constructor for a pointer to member function. It can be
6579 used to initialize global variables, local variable, or used
6580 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6583 If FORCE is nonzero, then force this conversion, even if
6584 we would rather not do it. Usually set when using an explicit
6585 cast. A C-style cast is being processed iff C_CAST_P is true.
6587 Return error_mark_node, if something goes wrong. */
6590 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p)
6596 if (error_operand_p (pfn))
6597 return error_mark_node;
6599 pfn_type = TREE_TYPE (pfn);
6600 to_type = build_ptrmemfunc_type (type);
6602 /* Handle multiple conversions of pointer to member functions. */
6603 if (TYPE_PTRMEMFUNC_P (pfn_type))
6605 tree delta = NULL_TREE;
6606 tree npfn = NULL_TREE;
6610 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
6611 error ("invalid conversion to type %qT from type %qT",
6614 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
6615 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
6619 /* We don't have to do any conversion to convert a
6620 pointer-to-member to its own type. But, we don't want to
6621 just return a PTRMEM_CST if there's an explicit cast; that
6622 cast should make the expression an invalid template argument. */
6623 if (TREE_CODE (pfn) != PTRMEM_CST)
6625 if (same_type_p (to_type, pfn_type))
6627 else if (integer_zerop (n))
6628 return build_reinterpret_cast (to_type, pfn,
6629 tf_warning_or_error);
6632 if (TREE_SIDE_EFFECTS (pfn))
6633 pfn = save_expr (pfn);
6635 /* Obtain the function pointer and the current DELTA. */
6636 if (TREE_CODE (pfn) == PTRMEM_CST)
6637 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
6640 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
6641 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
6644 /* Just adjust the DELTA field. */
6645 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6646 (TREE_TYPE (delta), ptrdiff_type_node));
6647 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
6648 n = cp_build_binary_op (input_location,
6649 LSHIFT_EXPR, n, integer_one_node,
6650 tf_warning_or_error);
6651 delta = cp_build_binary_op (input_location,
6652 PLUS_EXPR, delta, n, tf_warning_or_error);
6653 return build_ptrmemfunc1 (to_type, delta, npfn);
6656 /* Handle null pointer to member function conversions. */
6657 if (integer_zerop (pfn))
6659 pfn = build_c_cast (input_location, type, integer_zero_node);
6660 return build_ptrmemfunc1 (to_type,
6665 if (type_unknown_p (pfn))
6666 return instantiate_type (type, pfn, tf_warning_or_error);
6668 fn = TREE_OPERAND (pfn, 0);
6669 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
6670 /* In a template, we will have preserved the
6672 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
6673 return make_ptrmem_cst (to_type, fn);
6676 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6679 ??? There is no consistency as to the types returned for the above
6680 values. Some code acts as if it were a sizetype and some as if it were
6681 integer_type_node. */
6684 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
6686 tree type = TREE_TYPE (cst);
6687 tree fn = PTRMEM_CST_MEMBER (cst);
6688 tree ptr_class, fn_class;
6690 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6692 /* The class that the function belongs to. */
6693 fn_class = DECL_CONTEXT (fn);
6695 /* The class that we're creating a pointer to member of. */
6696 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
6698 /* First, calculate the adjustment to the function's class. */
6699 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
6702 if (!DECL_VIRTUAL_P (fn))
6703 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
6706 /* If we're dealing with a virtual function, we have to adjust 'this'
6707 again, to point to the base which provides the vtable entry for
6708 fn; the call will do the opposite adjustment. */
6709 tree orig_class = DECL_CONTEXT (fn);
6710 tree binfo = binfo_or_else (orig_class, fn_class);
6711 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6712 *delta, BINFO_OFFSET (binfo));
6713 *delta = fold_if_not_in_template (*delta);
6715 /* We set PFN to the vtable offset at which the function can be
6716 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6717 case delta is shifted left, and then incremented). */
6718 *pfn = DECL_VINDEX (fn);
6719 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
6720 TYPE_SIZE_UNIT (vtable_entry_type));
6721 *pfn = fold_if_not_in_template (*pfn);
6723 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
6725 case ptrmemfunc_vbit_in_pfn:
6726 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
6728 *pfn = fold_if_not_in_template (*pfn);
6731 case ptrmemfunc_vbit_in_delta:
6732 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
6733 *delta, integer_one_node);
6734 *delta = fold_if_not_in_template (*delta);
6735 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6736 *delta, integer_one_node);
6737 *delta = fold_if_not_in_template (*delta);
6744 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
6745 *pfn = fold_if_not_in_template (*pfn);
6749 /* Return an expression for PFN from the pointer-to-member function
6753 pfn_from_ptrmemfunc (tree t)
6755 if (TREE_CODE (t) == PTRMEM_CST)
6760 expand_ptrmemfunc_cst (t, &delta, &pfn);
6765 return build_ptrmemfunc_access_expr (t, pfn_identifier);
6768 /* Return an expression for DELTA from the pointer-to-member function
6772 delta_from_ptrmemfunc (tree t)
6774 if (TREE_CODE (t) == PTRMEM_CST)
6779 expand_ptrmemfunc_cst (t, &delta, &pfn);
6784 return build_ptrmemfunc_access_expr (t, delta_identifier);
6787 /* Convert value RHS to type TYPE as preparation for an assignment to
6788 an lvalue of type TYPE. ERRTYPE is a string to use in error
6789 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6790 are doing the conversion in order to pass the PARMNUMth argument of
6794 convert_for_assignment (tree type, tree rhs,
6795 const char *errtype, tree fndecl, int parmnum,
6796 tsubst_flags_t complain, int flags)
6799 enum tree_code coder;
6801 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6802 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
6803 rhs = TREE_OPERAND (rhs, 0);
6805 rhstype = TREE_TYPE (rhs);
6806 coder = TREE_CODE (rhstype);
6808 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
6809 && vector_types_convertible_p (type, rhstype, true))
6810 return convert (type, rhs);
6812 if (rhs == error_mark_node || rhstype == error_mark_node)
6813 return error_mark_node;
6814 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
6815 return error_mark_node;
6817 /* The RHS of an assignment cannot have void type. */
6818 if (coder == VOID_TYPE)
6820 if (complain & tf_error)
6821 error ("void value not ignored as it ought to be");
6822 return error_mark_node;
6825 /* Simplify the RHS if possible. */
6826 if (TREE_CODE (rhs) == CONST_DECL)
6827 rhs = DECL_INITIAL (rhs);
6829 if (c_dialect_objc ())
6832 tree rname = fndecl;
6834 if (!strcmp (errtype, "assignment"))
6836 else if (!strcmp (errtype, "initialization"))
6840 tree selector = objc_message_selector ();
6844 if (selector && parmno > 1)
6851 if (objc_compare_types (type, rhstype, parmno, rname))
6852 return convert (type, rhs);
6857 The expression is implicitly converted (clause _conv_) to the
6858 cv-unqualified type of the left operand.
6860 We allow bad conversions here because by the time we get to this point
6861 we are committed to doing the conversion. If we end up doing a bad
6862 conversion, convert_like will complain. */
6863 if (!can_convert_arg_bad (type, rhstype, rhs, flags))
6865 /* When -Wno-pmf-conversions is use, we just silently allow
6866 conversions from pointers-to-members to plain pointers. If
6867 the conversion doesn't work, cp_convert will complain. */
6869 && TYPE_PTR_P (type)
6870 && TYPE_PTRMEMFUNC_P (rhstype))
6871 rhs = cp_convert (strip_top_quals (type), rhs);
6874 if (complain & tf_error)
6876 /* If the right-hand side has unknown type, then it is an
6877 overloaded function. Call instantiate_type to get error
6879 if (rhstype == unknown_type_node)
6880 instantiate_type (type, rhs, tf_warning_or_error);
6882 error ("cannot convert %qT to %qT for argument %qP to %qD",
6883 rhstype, type, parmnum, fndecl);
6885 error ("cannot convert %qT to %qT in %s", rhstype, type,
6888 return error_mark_node;
6891 if (warn_missing_format_attribute)
6893 const enum tree_code codel = TREE_CODE (type);
6894 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
6896 && check_missing_format_attribute (type, rhstype)
6897 && (complain & tf_warning))
6898 warning (OPT_Wmissing_format_attribute,
6899 "%s might be a candidate for a format attribute",
6903 /* If -Wparentheses, warn about a = b = c when a has type bool and b
6905 if (warn_parentheses
6906 && TREE_CODE (type) == BOOLEAN_TYPE
6907 && TREE_CODE (rhs) == MODIFY_EXPR
6908 && !TREE_NO_WARNING (rhs)
6909 && TREE_CODE (TREE_TYPE (rhs)) != BOOLEAN_TYPE
6910 && (complain & tf_warning))
6912 location_t loc = EXPR_HAS_LOCATION (rhs)
6913 ? EXPR_LOCATION (rhs) : input_location;
6915 warning_at (loc, OPT_Wparentheses,
6916 "suggest parentheses around assignment used as truth value");
6917 TREE_NO_WARNING (rhs) = 1;
6920 return perform_implicit_conversion_flags (strip_top_quals (type), rhs,
6924 /* Convert RHS to be of type TYPE.
6925 If EXP is nonzero, it is the target of the initialization.
6926 ERRTYPE is a string to use in error messages.
6928 Two major differences between the behavior of
6929 `convert_for_assignment' and `convert_for_initialization'
6930 are that references are bashed in the former, while
6931 copied in the latter, and aggregates are assigned in
6932 the former (operator=) while initialized in the
6935 If using constructor make sure no conversion operator exists, if one does
6936 exist, an ambiguity exists.
6938 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6941 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
6942 const char *errtype, tree fndecl, int parmnum,
6943 tsubst_flags_t complain)
6945 enum tree_code codel = TREE_CODE (type);
6947 enum tree_code coder;
6949 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6950 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6951 if (TREE_CODE (rhs) == NOP_EXPR
6952 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
6953 && codel != REFERENCE_TYPE)
6954 rhs = TREE_OPERAND (rhs, 0);
6956 if (type == error_mark_node
6957 || rhs == error_mark_node
6958 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
6959 return error_mark_node;
6961 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
6962 && TREE_CODE (type) != ARRAY_TYPE
6963 && (TREE_CODE (type) != REFERENCE_TYPE
6964 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
6965 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
6966 && (TREE_CODE (type) != REFERENCE_TYPE
6967 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
6968 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
6969 rhs = decay_conversion (rhs);
6971 rhstype = TREE_TYPE (rhs);
6972 coder = TREE_CODE (rhstype);
6974 if (coder == ERROR_MARK)
6975 return error_mark_node;
6977 /* We accept references to incomplete types, so we can
6978 return here before checking if RHS is of complete type. */
6980 if (codel == REFERENCE_TYPE)
6982 /* This should eventually happen in convert_arguments. */
6983 int savew = 0, savee = 0;
6986 savew = warningcount, savee = errorcount;
6987 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
6988 /*cleanup=*/NULL, complain);
6991 if (warningcount > savew)
6992 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
6993 else if (errorcount > savee)
6994 error ("in passing argument %P of %q+D", parmnum, fndecl);
7000 exp = require_complete_type (exp);
7001 if (exp == error_mark_node)
7002 return error_mark_node;
7004 rhstype = non_reference (rhstype);
7006 type = complete_type (type);
7008 if (DIRECT_INIT_EXPR_P (type, rhs))
7009 /* Don't try to do copy-initialization if we already have
7010 direct-initialization. */
7013 if (MAYBE_CLASS_TYPE_P (type))
7014 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
7016 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
7020 /* If RETVAL is the address of, or a reference to, a local variable or
7021 temporary give an appropriate warning. */
7024 maybe_warn_about_returning_address_of_local (tree retval)
7026 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
7027 tree whats_returned = retval;
7031 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
7032 whats_returned = TREE_OPERAND (whats_returned, 1);
7033 else if (CONVERT_EXPR_P (whats_returned)
7034 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
7035 whats_returned = TREE_OPERAND (whats_returned, 0);
7040 if (TREE_CODE (whats_returned) != ADDR_EXPR)
7042 whats_returned = TREE_OPERAND (whats_returned, 0);
7044 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7046 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
7047 || TREE_CODE (whats_returned) == TARGET_EXPR)
7049 warning (0, "returning reference to temporary");
7052 if (TREE_CODE (whats_returned) == VAR_DECL
7053 && DECL_NAME (whats_returned)
7054 && TEMP_NAME_P (DECL_NAME (whats_returned)))
7056 warning (0, "reference to non-lvalue returned");
7061 while (TREE_CODE (whats_returned) == COMPONENT_REF
7062 || TREE_CODE (whats_returned) == ARRAY_REF)
7063 whats_returned = TREE_OPERAND (whats_returned, 0);
7065 if (DECL_P (whats_returned)
7066 && DECL_NAME (whats_returned)
7067 && DECL_FUNCTION_SCOPE_P (whats_returned)
7068 && !(TREE_STATIC (whats_returned)
7069 || TREE_PUBLIC (whats_returned)))
7071 if (TREE_CODE (valtype) == REFERENCE_TYPE)
7072 warning (0, "reference to local variable %q+D returned",
7075 warning (0, "address of local variable %q+D returned",
7081 /* Check that returning RETVAL from the current function is valid.
7082 Return an expression explicitly showing all conversions required to
7083 change RETVAL into the function return type, and to assign it to
7084 the DECL_RESULT for the function. Set *NO_WARNING to true if
7085 code reaches end of non-void function warning shouldn't be issued
7086 on this RETURN_EXPR. */
7089 check_return_expr (tree retval, bool *no_warning)
7092 /* The type actually returned by the function, after any
7095 int fn_returns_value_p;
7096 bool named_return_value_okay_p;
7098 *no_warning = false;
7100 /* A `volatile' function is one that isn't supposed to return, ever.
7101 (This is a G++ extension, used to get better code for functions
7102 that call the `volatile' function.) */
7103 if (TREE_THIS_VOLATILE (current_function_decl))
7104 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7106 /* Check for various simple errors. */
7107 if (DECL_DESTRUCTOR_P (current_function_decl))
7110 error ("returning a value from a destructor");
7113 else if (DECL_CONSTRUCTOR_P (current_function_decl))
7115 if (in_function_try_handler)
7116 /* If a return statement appears in a handler of the
7117 function-try-block of a constructor, the program is ill-formed. */
7118 error ("cannot return from a handler of a function-try-block of a constructor");
7120 /* You can't return a value from a constructor. */
7121 error ("returning a value from a constructor");
7125 /* As an extension, deduce lambda return type from a return statement
7126 anywhere in the body. */
7127 if (retval && LAMBDA_FUNCTION_P (current_function_decl))
7129 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
7130 if (LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda))
7132 tree type = lambda_return_type (retval);
7133 tree oldtype = LAMBDA_EXPR_RETURN_TYPE (lambda);
7135 if (VOID_TYPE_P (type))
7137 else if (oldtype == NULL_TREE)
7139 pedwarn (input_location, OPT_pedantic, "lambda return type "
7140 "can only be deduced when the return statement is "
7141 "the only statement in the function body");
7142 apply_lambda_return_type (lambda, type);
7144 else if (!same_type_p (type, oldtype))
7145 error ("inconsistent types %qT and %qT deduced for "
7146 "lambda return type", type, oldtype);
7150 if (processing_template_decl)
7152 current_function_returns_value = 1;
7153 if (check_for_bare_parameter_packs (retval))
7154 retval = error_mark_node;
7158 /* When no explicit return-value is given in a function with a named
7159 return value, the named return value is used. */
7160 result = DECL_RESULT (current_function_decl);
7161 valtype = TREE_TYPE (result);
7162 gcc_assert (valtype != NULL_TREE);
7163 fn_returns_value_p = !VOID_TYPE_P (valtype);
7164 if (!retval && DECL_NAME (result) && fn_returns_value_p)
7167 /* Check for a return statement with no return value in a function
7168 that's supposed to return a value. */
7169 if (!retval && fn_returns_value_p)
7171 permerror (input_location, "return-statement with no value, in function returning %qT",
7173 /* Clear this, so finish_function won't say that we reach the
7174 end of a non-void function (which we don't, we gave a
7176 current_function_returns_null = 0;
7177 /* And signal caller that TREE_NO_WARNING should be set on the
7178 RETURN_EXPR to avoid control reaches end of non-void function
7179 warnings in tree-cfg.c. */
7182 /* Check for a return statement with a value in a function that
7183 isn't supposed to return a value. */
7184 else if (retval && !fn_returns_value_p)
7186 if (VOID_TYPE_P (TREE_TYPE (retval)))
7187 /* You can return a `void' value from a function of `void'
7188 type. In that case, we have to evaluate the expression for
7189 its side-effects. */
7190 finish_expr_stmt (retval);
7192 permerror (input_location, "return-statement with a value, in function "
7193 "returning 'void'");
7194 current_function_returns_null = 1;
7196 /* There's really no value to return, after all. */
7200 /* Remember that this function can sometimes return without a
7202 current_function_returns_null = 1;
7204 /* Remember that this function did return a value. */
7205 current_function_returns_value = 1;
7207 /* Check for erroneous operands -- but after giving ourselves a
7208 chance to provide an error about returning a value from a void
7210 if (error_operand_p (retval))
7212 current_function_return_value = error_mark_node;
7213 return error_mark_node;
7216 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
7217 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
7218 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
7219 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
7221 && retval && null_ptr_cst_p (retval))
7222 warning (0, "%<operator new%> must not return NULL unless it is "
7223 "declared %<throw()%> (or -fcheck-new is in effect)");
7225 /* Effective C++ rule 15. See also start_function. */
7227 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
7231 /* The function return type must be a reference to the current
7233 if (TREE_CODE (valtype) == REFERENCE_TYPE
7234 && same_type_ignoring_top_level_qualifiers_p
7235 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
7237 /* Returning '*this' is obviously OK. */
7238 if (retval == current_class_ref)
7240 /* If we are calling a function whose return type is the same of
7241 the current class reference, it is ok. */
7242 else if (TREE_CODE (retval) == INDIRECT_REF
7243 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
7248 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
7251 /* The fabled Named Return Value optimization, as per [class.copy]/15:
7253 [...] For a function with a class return type, if the expression
7254 in the return statement is the name of a local object, and the cv-
7255 unqualified type of the local object is the same as the function
7256 return type, an implementation is permitted to omit creating the tem-
7257 porary object to hold the function return value [...]
7259 So, if this is a value-returning function that always returns the same
7260 local variable, remember it.
7262 It might be nice to be more flexible, and choose the first suitable
7263 variable even if the function sometimes returns something else, but
7264 then we run the risk of clobbering the variable we chose if the other
7265 returned expression uses the chosen variable somehow. And people expect
7266 this restriction, anyway. (jason 2000-11-19)
7268 See finish_function and finalize_nrv for the rest of this optimization. */
7270 named_return_value_okay_p =
7271 (retval != NULL_TREE
7272 /* Must be a local, automatic variable. */
7273 && TREE_CODE (retval) == VAR_DECL
7274 && DECL_CONTEXT (retval) == current_function_decl
7275 && ! TREE_STATIC (retval)
7276 && ! DECL_ANON_UNION_VAR_P (retval)
7277 && (DECL_ALIGN (retval)
7278 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7279 /* The cv-unqualified type of the returned value must be the
7280 same as the cv-unqualified return type of the
7282 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7284 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7285 /* And the returned value must be non-volatile. */
7286 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7288 if (fn_returns_value_p && flag_elide_constructors)
7290 if (named_return_value_okay_p
7291 && (current_function_return_value == NULL_TREE
7292 || current_function_return_value == retval))
7293 current_function_return_value = retval;
7295 current_function_return_value = error_mark_node;
7298 /* We don't need to do any conversions when there's nothing being
7303 /* Do any required conversions. */
7304 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7305 /* No conversions are required. */
7309 /* The type the function is declared to return. */
7310 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7311 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7313 /* The functype's return type will have been set to void, if it
7314 was an incomplete type. Just treat this as 'return;' */
7315 if (VOID_TYPE_P (functype))
7316 return error_mark_node;
7318 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7319 treated as an rvalue for the purposes of overload resolution to
7320 favor move constructors over copy constructors. */
7321 if ((cxx_dialect != cxx98)
7322 && named_return_value_okay_p
7323 /* The variable must not have the `volatile' qualifier. */
7324 && !(cp_type_quals (TREE_TYPE (retval)) & TYPE_QUAL_VOLATILE)
7325 /* The return type must be a class type. */
7326 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7327 flags = flags | LOOKUP_PREFER_RVALUE;
7329 /* First convert the value to the function's return type, then
7330 to the type of return value's location to handle the
7331 case that functype is smaller than the valtype. */
7332 retval = convert_for_initialization
7333 (NULL_TREE, functype, retval, flags, "return", NULL_TREE, 0,
7334 tf_warning_or_error);
7335 retval = convert (valtype, retval);
7337 /* If the conversion failed, treat this just like `return;'. */
7338 if (retval == error_mark_node)
7340 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7341 else if (! cfun->returns_struct
7342 && TREE_CODE (retval) == TARGET_EXPR
7343 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7344 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7345 TREE_OPERAND (retval, 0));
7347 maybe_warn_about_returning_address_of_local (retval);
7350 /* Actually copy the value returned into the appropriate location. */
7351 if (retval && retval != result)
7352 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7358 /* Returns nonzero if the pointer-type FROM can be converted to the
7359 pointer-type TO via a qualification conversion. If CONSTP is -1,
7360 then we return nonzero if the pointers are similar, and the
7361 cv-qualification signature of FROM is a proper subset of that of TO.
7363 If CONSTP is positive, then all outer pointers have been
7367 comp_ptr_ttypes_real (tree to, tree from, int constp)
7369 bool to_more_cv_qualified = false;
7370 bool is_opaque_pointer = false;
7372 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7374 if (TREE_CODE (to) != TREE_CODE (from))
7377 if (TREE_CODE (from) == OFFSET_TYPE
7378 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7379 TYPE_OFFSET_BASETYPE (to)))
7382 /* Const and volatile mean something different for function types,
7383 so the usual checks are not appropriate. */
7384 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7386 /* In Objective-C++, some types may have been 'volatilized' by
7387 the compiler for EH; when comparing them here, the volatile
7388 qualification must be ignored. */
7389 bool objc_quals_match = objc_type_quals_match (to, from);
7391 if (!at_least_as_qualified_p (to, from) && !objc_quals_match)
7394 if (!at_least_as_qualified_p (from, to) && !objc_quals_match)
7398 to_more_cv_qualified = true;
7402 constp &= TYPE_READONLY (to);
7405 if (TREE_CODE (to) == VECTOR_TYPE)
7406 is_opaque_pointer = vector_targets_convertible_p (to, from);
7408 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7409 return ((constp >= 0 || to_more_cv_qualified)
7410 && (is_opaque_pointer
7411 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7415 /* When comparing, say, char ** to char const **, this function takes
7416 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7417 types to this function. */
7420 comp_ptr_ttypes (tree to, tree from)
7422 return comp_ptr_ttypes_real (to, from, 1);
7425 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7426 type or inheritance-related types, regardless of cv-quals. */
7429 ptr_reasonably_similar (const_tree to, const_tree from)
7431 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7433 /* Any target type is similar enough to void. */
7434 if (TREE_CODE (to) == VOID_TYPE
7435 || TREE_CODE (from) == VOID_TYPE)
7438 if (TREE_CODE (to) != TREE_CODE (from))
7441 if (TREE_CODE (from) == OFFSET_TYPE
7442 && comptypes (TYPE_OFFSET_BASETYPE (to),
7443 TYPE_OFFSET_BASETYPE (from),
7444 COMPARE_BASE | COMPARE_DERIVED))
7447 if (TREE_CODE (to) == VECTOR_TYPE
7448 && vector_types_convertible_p (to, from, false))
7451 if (TREE_CODE (to) == INTEGER_TYPE
7452 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
7455 if (TREE_CODE (to) == FUNCTION_TYPE)
7458 if (TREE_CODE (to) != POINTER_TYPE)
7460 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
7461 COMPARE_BASE | COMPARE_DERIVED);
7465 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7466 pointer-to-member types) are the same, ignoring cv-qualification at
7470 comp_ptr_ttypes_const (tree to, tree from)
7472 bool is_opaque_pointer = false;
7474 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7476 if (TREE_CODE (to) != TREE_CODE (from))
7479 if (TREE_CODE (from) == OFFSET_TYPE
7480 && same_type_p (TYPE_OFFSET_BASETYPE (from),
7481 TYPE_OFFSET_BASETYPE (to)))
7484 if (TREE_CODE (to) == VECTOR_TYPE)
7485 is_opaque_pointer = vector_targets_convertible_p (to, from);
7487 if (TREE_CODE (to) != POINTER_TYPE)
7488 return (is_opaque_pointer
7489 || same_type_ignoring_top_level_qualifiers_p (to, from));
7493 /* Returns the type qualifiers for this type, including the qualifiers on the
7494 elements for an array type. */
7497 cp_type_quals (const_tree type)
7499 /* This CONST_CAST is okay because strip_array_types returns its
7500 argument unmodified and we assign it to a const_tree. */
7501 type = strip_array_types (CONST_CAST_TREE(type));
7502 if (type == error_mark_node)
7503 return TYPE_UNQUALIFIED;
7504 return TYPE_QUALS (type);
7507 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7511 cp_type_readonly (const_tree type)
7513 /* This CONST_CAST is okay because strip_array_types returns its
7514 argument unmodified and we assign it to a const_tree. */
7515 type = strip_array_types (CONST_CAST_TREE(type));
7516 return TYPE_READONLY (type);
7519 /* Returns nonzero if TYPE is const or volatile. */
7522 cv_qualified_p (const_tree type)
7524 int quals = cp_type_quals (type);
7525 return (quals & (TYPE_QUAL_CONST|TYPE_QUAL_VOLATILE)) != 0;
7528 /* Returns nonzero if the TYPE contains a mutable member. */
7531 cp_has_mutable_p (const_tree type)
7533 /* This CONST_CAST is okay because strip_array_types returns its
7534 argument unmodified and we assign it to a const_tree. */
7535 type = strip_array_types (CONST_CAST_TREE(type));
7537 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
7540 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7541 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7542 approximation. In particular, consider:
7545 struct S { int i; };
7546 const S s = { f(); }
7548 Here, we will make "s" as TREE_READONLY (because it is declared
7549 "const") -- only to reverse ourselves upon seeing that the
7550 initializer is non-constant. */
7553 cp_apply_type_quals_to_decl (int type_quals, tree decl)
7555 tree type = TREE_TYPE (decl);
7557 if (type == error_mark_node)
7560 if (TREE_CODE (decl) == TYPE_DECL)
7563 if (TREE_CODE (type) == FUNCTION_TYPE
7564 && type_quals != TYPE_UNQUALIFIED)
7566 /* This was an error in C++98 (cv-qualifiers cannot be added to
7567 a function type), but DR 295 makes the code well-formed by
7568 dropping the extra qualifiers. */
7571 tree bad_type = build_qualified_type (type, type_quals);
7572 pedwarn (input_location, OPT_pedantic,
7573 "ignoring %qV qualifiers added to function type %qT",
7577 TREE_TYPE (decl) = TYPE_MAIN_VARIANT (type);
7581 /* Avoid setting TREE_READONLY incorrectly. */
7582 if (/* If the object has a constructor, the constructor may modify
7584 TYPE_NEEDS_CONSTRUCTING (type)
7585 /* If the type isn't complete, we don't know yet if it will need
7587 || !COMPLETE_TYPE_P (type)
7588 /* If the type has a mutable component, that component might be
7590 || TYPE_HAS_MUTABLE_P (type))
7591 type_quals &= ~TYPE_QUAL_CONST;
7593 c_apply_type_quals_to_decl (type_quals, decl);
7596 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7597 exemplar types such that casting T1 to T2 is casting away constness
7598 if and only if there is no implicit conversion from T1 to T2. */
7601 casts_away_constness_r (tree *t1, tree *t2)
7606 /* [expr.const.cast]
7608 For multi-level pointer to members and multi-level mixed pointers
7609 and pointers to members (conv.qual), the "member" aspect of a
7610 pointer to member level is ignored when determining if a const
7611 cv-qualifier has been cast away. */
7612 /* [expr.const.cast]
7614 For two pointer types:
7616 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7617 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7620 casting from X1 to X2 casts away constness if, for a non-pointer
7621 type T there does not exist an implicit conversion (clause
7624 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7628 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7629 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
7630 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
7632 *t1 = cp_build_qualified_type (void_type_node,
7633 cp_type_quals (*t1));
7634 *t2 = cp_build_qualified_type (void_type_node,
7635 cp_type_quals (*t2));
7639 quals1 = cp_type_quals (*t1);
7640 quals2 = cp_type_quals (*t2);
7642 if (TYPE_PTRMEM_P (*t1))
7643 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
7645 *t1 = TREE_TYPE (*t1);
7646 if (TYPE_PTRMEM_P (*t2))
7647 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
7649 *t2 = TREE_TYPE (*t2);
7651 casts_away_constness_r (t1, t2);
7652 *t1 = build_pointer_type (*t1);
7653 *t2 = build_pointer_type (*t2);
7654 *t1 = cp_build_qualified_type (*t1, quals1);
7655 *t2 = cp_build_qualified_type (*t2, quals2);
7658 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7661 ??? This function returns non-zero if casting away qualifiers not
7662 just const. We would like to return to the caller exactly which
7663 qualifiers are casted away to give more accurate diagnostics.
7667 casts_away_constness (tree t1, tree t2)
7669 if (TREE_CODE (t2) == REFERENCE_TYPE)
7671 /* [expr.const.cast]
7673 Casting from an lvalue of type T1 to an lvalue of type T2
7674 using a reference cast casts away constness if a cast from an
7675 rvalue of type "pointer to T1" to the type "pointer to T2"
7676 casts away constness. */
7677 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
7678 return casts_away_constness (build_pointer_type (t1),
7679 build_pointer_type (TREE_TYPE (t2)));
7682 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
7683 /* [expr.const.cast]
7685 Casting from an rvalue of type "pointer to data member of X
7686 of type T1" to the type "pointer to data member of Y of type
7687 T2" casts away constness if a cast from an rvalue of type
7688 "pointer to T1" to the type "pointer to T2" casts away
7690 return casts_away_constness
7691 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
7692 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
7694 /* Casting away constness is only something that makes sense for
7695 pointer or reference types. */
7696 if (TREE_CODE (t1) != POINTER_TYPE
7697 || TREE_CODE (t2) != POINTER_TYPE)
7700 /* Top-level qualifiers don't matter. */
7701 t1 = TYPE_MAIN_VARIANT (t1);
7702 t2 = TYPE_MAIN_VARIANT (t2);
7703 casts_away_constness_r (&t1, &t2);
7704 if (!can_convert (t2, t1))
7710 /* If T is a REFERENCE_TYPE return the type to which T refers.
7711 Otherwise, return T itself. */
7714 non_reference (tree t)
7716 if (TREE_CODE (t) == REFERENCE_TYPE)
7722 /* Return nonzero if REF is an lvalue valid for this language;
7723 otherwise, print an error message and return zero. USE says
7724 how the lvalue is being used and so selects the error message. */
7727 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
7729 int win = lvalue_p (ref);
7731 if (!win && (complain & tf_error))