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 (int, tree *, tree, tree, 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 /* FIXME: Attributes. */
264 gcc_assert (ARITHMETIC_TYPE_P (t1)
265 || TREE_CODE (t1) == VECTOR_TYPE
266 || UNSCOPED_ENUM_P (t1));
267 gcc_assert (ARITHMETIC_TYPE_P (t2)
268 || TREE_CODE (t2) == VECTOR_TYPE
269 || UNSCOPED_ENUM_P (t2));
271 /* In what follows, we slightly generalize the rules given in [expr] so
272 as to deal with `long long' and `complex'. First, merge the
274 attributes = (*targetm.merge_type_attributes) (t1, t2);
276 /* If one type is complex, form the common type of the non-complex
277 components, then make that complex. Use T1 or T2 if it is the
279 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
281 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
282 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
284 = type_after_usual_arithmetic_conversions (subtype1, subtype2);
286 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
287 return build_type_attribute_variant (t1, attributes);
288 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
289 return build_type_attribute_variant (t2, attributes);
291 return build_type_attribute_variant (build_complex_type (subtype),
295 if (code1 == VECTOR_TYPE)
297 /* When we get here we should have two vectors of the same size.
298 Just prefer the unsigned one if present. */
299 if (TYPE_UNSIGNED (t1))
300 return build_type_attribute_variant (t1, attributes);
302 return build_type_attribute_variant (t2, attributes);
305 /* If only one is real, use it as the result. */
306 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
307 return build_type_attribute_variant (t1, attributes);
308 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
309 return build_type_attribute_variant (t2, attributes);
311 /* Both real or both integers; use the one with greater precision. */
312 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
313 return build_type_attribute_variant (t1, attributes);
314 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
315 return build_type_attribute_variant (t2, attributes);
317 /* The types are the same; no need to do anything fancy. */
318 if (TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
319 return build_type_attribute_variant (t1, attributes);
321 if (code1 != REAL_TYPE)
323 /* If one is unsigned long long, then convert the other to unsigned
325 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_unsigned_type_node)
326 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_unsigned_type_node))
327 return build_type_attribute_variant (long_long_unsigned_type_node,
329 /* If one is a long long, and the other is an unsigned long, and
330 long long can represent all the values of an unsigned long, then
331 convert to a long long. Otherwise, convert to an unsigned long
332 long. Otherwise, if either operand is long long, convert the
335 Since we're here, we know the TYPE_PRECISION is the same;
336 therefore converting to long long cannot represent all the values
337 of an unsigned long, so we choose unsigned long long in that
339 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_long_integer_type_node)
340 || same_type_p (TYPE_MAIN_VARIANT (t2), long_long_integer_type_node))
342 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
343 ? long_long_unsigned_type_node
344 : long_long_integer_type_node);
345 return build_type_attribute_variant (t, attributes);
348 /* Go through the same procedure, but for longs. */
349 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_unsigned_type_node)
350 || same_type_p (TYPE_MAIN_VARIANT (t2), long_unsigned_type_node))
351 return build_type_attribute_variant (long_unsigned_type_node,
353 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_integer_type_node)
354 || same_type_p (TYPE_MAIN_VARIANT (t2), long_integer_type_node))
356 tree t = ((TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
357 ? long_unsigned_type_node : long_integer_type_node);
358 return build_type_attribute_variant (t, attributes);
360 /* Otherwise prefer the unsigned one. */
361 if (TYPE_UNSIGNED (t1))
362 return build_type_attribute_variant (t1, attributes);
364 return build_type_attribute_variant (t2, attributes);
368 if (same_type_p (TYPE_MAIN_VARIANT (t1), long_double_type_node)
369 || same_type_p (TYPE_MAIN_VARIANT (t2), long_double_type_node))
370 return build_type_attribute_variant (long_double_type_node,
372 if (same_type_p (TYPE_MAIN_VARIANT (t1), double_type_node)
373 || same_type_p (TYPE_MAIN_VARIANT (t2), double_type_node))
374 return build_type_attribute_variant (double_type_node,
376 if (same_type_p (TYPE_MAIN_VARIANT (t1), float_type_node)
377 || same_type_p (TYPE_MAIN_VARIANT (t2), float_type_node))
378 return build_type_attribute_variant (float_type_node,
381 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
382 the standard C++ floating-point types. Logic earlier in this
383 function has already eliminated the possibility that
384 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
385 compelling reason to choose one or the other. */
386 return build_type_attribute_variant (t1, attributes);
390 /* T1 and T2 are arithmetic or enumeration types. Return the type
391 that will result from the "usual arithmetic conversions" on T1 and
392 T2 as described in [expr]. */
395 type_after_usual_arithmetic_conversions (tree t1, tree t2)
397 gcc_assert (ARITHMETIC_TYPE_P (t1)
398 || TREE_CODE (t1) == VECTOR_TYPE
399 || UNSCOPED_ENUM_P (t1));
400 gcc_assert (ARITHMETIC_TYPE_P (t2)
401 || TREE_CODE (t2) == VECTOR_TYPE
402 || UNSCOPED_ENUM_P (t2));
404 /* Perform the integral promotions. We do not promote real types here. */
405 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t1)
406 && INTEGRAL_OR_ENUMERATION_TYPE_P (t2))
408 t1 = type_promotes_to (t1);
409 t2 = type_promotes_to (t2);
412 return cp_common_type (t1, t2);
415 /* Subroutine of composite_pointer_type to implement the recursive
416 case. See that function for documentation fo the parameters. */
419 composite_pointer_type_r (tree t1, tree t2, const char* location,
420 tsubst_flags_t complain)
427 /* Determine the types pointed to by T1 and T2. */
428 if (TREE_CODE (t1) == POINTER_TYPE)
430 pointee1 = TREE_TYPE (t1);
431 pointee2 = TREE_TYPE (t2);
435 pointee1 = TYPE_PTRMEM_POINTED_TO_TYPE (t1);
436 pointee2 = TYPE_PTRMEM_POINTED_TO_TYPE (t2);
441 Otherwise, the composite pointer type is a pointer type
442 similar (_conv.qual_) to the type of one of the operands,
443 with a cv-qualification signature (_conv.qual_) that is the
444 union of the cv-qualification signatures of the operand
446 if (same_type_ignoring_top_level_qualifiers_p (pointee1, pointee2))
447 result_type = pointee1;
448 else if ((TREE_CODE (pointee1) == POINTER_TYPE
449 && TREE_CODE (pointee2) == POINTER_TYPE)
450 || (TYPE_PTR_TO_MEMBER_P (pointee1)
451 && TYPE_PTR_TO_MEMBER_P (pointee2)))
452 result_type = composite_pointer_type_r (pointee1, pointee2, location,
456 if (complain & tf_error)
457 permerror (input_location, "%s between distinct pointer types %qT and %qT "
460 result_type = void_type_node;
462 result_type = cp_build_qualified_type (result_type,
463 (cp_type_quals (pointee1)
464 | cp_type_quals (pointee2)));
465 /* If the original types were pointers to members, so is the
467 if (TYPE_PTR_TO_MEMBER_P (t1))
469 if (!same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
470 TYPE_PTRMEM_CLASS_TYPE (t2))
471 && (complain & tf_error))
472 permerror (input_location, "%s between distinct pointer types %qT and %qT "
475 result_type = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
479 result_type = build_pointer_type (result_type);
481 /* Merge the attributes. */
482 attributes = (*targetm.merge_type_attributes) (t1, t2);
483 return build_type_attribute_variant (result_type, attributes);
486 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
487 ARG1 and ARG2 are the values with those types. The LOCATION is a
488 string describing the current location, in case an error occurs.
490 This routine also implements the computation of a common type for
491 pointers-to-members as per [expr.eq]. */
494 composite_pointer_type (tree t1, tree t2, tree arg1, tree arg2,
495 const char* location, tsubst_flags_t complain)
502 If one operand is a null pointer constant, the composite pointer
503 type is the type of the other operand. */
504 if (null_ptr_cst_p (arg1))
506 if (null_ptr_cst_p (arg2))
513 If one of the operands has type "pointer to cv1 void*", then
514 the other has type "pointer to cv2T", and the composite pointer
515 type is "pointer to cv12 void", where cv12 is the union of cv1
518 If either type is a pointer to void, make sure it is T1. */
519 if (TREE_CODE (t2) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t2)))
527 /* Now, if T1 is a pointer to void, merge the qualifiers. */
528 if (TREE_CODE (t1) == POINTER_TYPE && VOID_TYPE_P (TREE_TYPE (t1)))
533 if (TYPE_PTRFN_P (t2) && (complain & tf_error))
534 pedwarn (input_location, OPT_pedantic, "ISO C++ forbids %s "
535 "between pointer of type %<void *%> and pointer-to-function",
538 = cp_build_qualified_type (void_type_node,
539 (cp_type_quals (TREE_TYPE (t1))
540 | cp_type_quals (TREE_TYPE (t2))));
541 result_type = build_pointer_type (result_type);
542 /* Merge the attributes. */
543 attributes = (*targetm.merge_type_attributes) (t1, t2);
544 return build_type_attribute_variant (result_type, attributes);
547 if (c_dialect_objc () && TREE_CODE (t1) == POINTER_TYPE
548 && TREE_CODE (t2) == POINTER_TYPE)
550 if (objc_compare_types (t1, t2, -3, NULL_TREE))
554 /* [expr.eq] permits the application of a pointer conversion to
555 bring the pointers to a common type. */
556 if (TREE_CODE (t1) == POINTER_TYPE && TREE_CODE (t2) == POINTER_TYPE
557 && CLASS_TYPE_P (TREE_TYPE (t1))
558 && CLASS_TYPE_P (TREE_TYPE (t2))
559 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (t1),
562 class1 = TREE_TYPE (t1);
563 class2 = TREE_TYPE (t2);
565 if (DERIVED_FROM_P (class1, class2))
566 t2 = (build_pointer_type
567 (cp_build_qualified_type (class1, TYPE_QUALS (class2))));
568 else if (DERIVED_FROM_P (class2, class1))
569 t1 = (build_pointer_type
570 (cp_build_qualified_type (class2, TYPE_QUALS (class1))));
573 if (complain & tf_error)
574 error ("%s between distinct pointer types %qT and %qT "
575 "lacks a cast", location, t1, t2);
576 return error_mark_node;
579 /* [expr.eq] permits the application of a pointer-to-member
580 conversion to change the class type of one of the types. */
581 else if (TYPE_PTR_TO_MEMBER_P (t1)
582 && !same_type_p (TYPE_PTRMEM_CLASS_TYPE (t1),
583 TYPE_PTRMEM_CLASS_TYPE (t2)))
585 class1 = TYPE_PTRMEM_CLASS_TYPE (t1);
586 class2 = TYPE_PTRMEM_CLASS_TYPE (t2);
588 if (DERIVED_FROM_P (class1, class2))
589 t1 = build_ptrmem_type (class2, TYPE_PTRMEM_POINTED_TO_TYPE (t1));
590 else if (DERIVED_FROM_P (class2, class1))
591 t2 = build_ptrmem_type (class1, TYPE_PTRMEM_POINTED_TO_TYPE (t2));
594 if (complain & tf_error)
595 error ("%s between distinct pointer-to-member types %qT and %qT "
596 "lacks a cast", location, t1, t2);
597 return error_mark_node;
601 return composite_pointer_type_r (t1, t2, location, complain);
604 /* Return the merged type of two types.
605 We assume that comptypes has already been done and returned 1;
606 if that isn't so, this may crash.
608 This just combines attributes and default arguments; any other
609 differences would cause the two types to compare unalike. */
612 merge_types (tree t1, tree t2)
614 enum tree_code code1;
615 enum tree_code code2;
618 /* Save time if the two types are the same. */
621 if (original_type (t1) == original_type (t2))
624 /* If one type is nonsense, use the other. */
625 if (t1 == error_mark_node)
627 if (t2 == error_mark_node)
630 /* Merge the attributes. */
631 attributes = (*targetm.merge_type_attributes) (t1, t2);
633 if (TYPE_PTRMEMFUNC_P (t1))
634 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
635 if (TYPE_PTRMEMFUNC_P (t2))
636 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
638 code1 = TREE_CODE (t1);
639 code2 = TREE_CODE (t2);
642 gcc_assert (code1 == TYPENAME_TYPE || code2 == TYPENAME_TYPE);
643 if (code1 == TYPENAME_TYPE)
645 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
646 code1 = TREE_CODE (t1);
650 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
651 code2 = TREE_CODE (t2);
659 /* For two pointers, do this recursively on the target type. */
661 tree target = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
662 int quals = cp_type_quals (t1);
664 if (code1 == POINTER_TYPE)
665 t1 = build_pointer_type (target);
667 t1 = cp_build_reference_type (target, TYPE_REF_IS_RVALUE (t1));
668 t1 = build_type_attribute_variant (t1, attributes);
669 t1 = cp_build_qualified_type (t1, quals);
671 if (TREE_CODE (target) == METHOD_TYPE)
672 t1 = build_ptrmemfunc_type (t1);
681 quals = cp_type_quals (t1);
682 pointee = merge_types (TYPE_PTRMEM_POINTED_TO_TYPE (t1),
683 TYPE_PTRMEM_POINTED_TO_TYPE (t2));
684 t1 = build_ptrmem_type (TYPE_PTRMEM_CLASS_TYPE (t1),
686 t1 = cp_build_qualified_type (t1, quals);
692 tree elt = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
693 /* Save space: see if the result is identical to one of the args. */
694 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1))
695 return build_type_attribute_variant (t1, attributes);
696 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2))
697 return build_type_attribute_variant (t2, attributes);
698 /* Merge the element types, and have a size if either arg has one. */
699 t1 = build_cplus_array_type
700 (elt, TYPE_DOMAIN (TYPE_DOMAIN (t1) ? t1 : t2));
705 /* Function types: prefer the one that specified arg types.
706 If both do, merge the arg types. Also merge the return types. */
708 tree valtype = merge_types (TREE_TYPE (t1), TREE_TYPE (t2));
709 tree p1 = TYPE_ARG_TYPES (t1);
710 tree p2 = TYPE_ARG_TYPES (t2);
713 /* Save space: see if the result is identical to one of the args. */
714 if (valtype == TREE_TYPE (t1) && ! p2)
715 return cp_build_type_attribute_variant (t1, attributes);
716 if (valtype == TREE_TYPE (t2) && ! p1)
717 return cp_build_type_attribute_variant (t2, attributes);
719 /* Simple way if one arg fails to specify argument types. */
720 if (p1 == NULL_TREE || TREE_VALUE (p1) == void_type_node)
722 rval = build_function_type (valtype, p2);
723 if ((raises = TYPE_RAISES_EXCEPTIONS (t2)))
724 rval = build_exception_variant (rval, raises);
725 return cp_build_type_attribute_variant (rval, attributes);
727 raises = TYPE_RAISES_EXCEPTIONS (t1);
728 if (p2 == NULL_TREE || TREE_VALUE (p2) == void_type_node)
730 rval = build_function_type (valtype, p1);
732 rval = build_exception_variant (rval, raises);
733 return cp_build_type_attribute_variant (rval, attributes);
736 rval = build_function_type (valtype, commonparms (p1, p2));
737 t1 = build_exception_variant (rval, raises);
743 /* Get this value the long way, since TYPE_METHOD_BASETYPE
744 is just the main variant of this. */
745 tree basetype = TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2)));
746 tree raises = TYPE_RAISES_EXCEPTIONS (t1);
749 /* If this was a member function type, get back to the
750 original type of type member function (i.e., without
751 the class instance variable up front. */
752 t1 = build_function_type (TREE_TYPE (t1),
753 TREE_CHAIN (TYPE_ARG_TYPES (t1)));
754 t2 = build_function_type (TREE_TYPE (t2),
755 TREE_CHAIN (TYPE_ARG_TYPES (t2)));
756 t3 = merge_types (t1, t2);
757 t3 = build_method_type_directly (basetype, TREE_TYPE (t3),
758 TYPE_ARG_TYPES (t3));
759 t1 = build_exception_variant (t3, raises);
764 /* There is no need to merge attributes into a TYPENAME_TYPE.
765 When the type is instantiated it will have whatever
766 attributes result from the instantiation. */
772 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
774 else if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
777 return cp_build_type_attribute_variant (t1, attributes);
780 /* Wrapper around cp_common_type that is used by c-common.c and other
781 front end optimizations that remove promotions.
783 Return the common type for two arithmetic types T1 and T2 under the
784 usual arithmetic conversions. The default conversions have already
785 been applied, and enumerated types converted to their compatible
789 common_type (tree t1, tree t2)
791 /* If one type is nonsense, use the other */
792 if (t1 == error_mark_node)
794 if (t2 == error_mark_node)
797 return cp_common_type (t1, t2);
800 /* Return the common type of two pointer types T1 and T2. This is the
801 type for the result of most arithmetic operations if the operands
802 have the given two types.
804 We assume that comp_target_types has already been done and returned
805 nonzero; if that isn't so, this may crash. */
808 common_pointer_type (tree t1, tree t2)
810 gcc_assert ((TYPE_PTR_P (t1) && TYPE_PTR_P (t2))
811 || (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
812 || (TYPE_PTRMEMFUNC_P (t1) && TYPE_PTRMEMFUNC_P (t2)));
814 return composite_pointer_type (t1, t2, error_mark_node, error_mark_node,
815 "conversion", tf_warning_or_error);
818 /* Compare two exception specifier types for exactness or subsetness, if
819 allowed. Returns false for mismatch, true for match (same, or
822 [except.spec] "If a class X ... objects of class X or any class publicly
823 and unambiguously derived from X. Similarly, if a pointer type Y * ...
824 exceptions of type Y * or that are pointers to any type publicly and
825 unambiguously derived from Y. Otherwise a function only allows exceptions
826 that have the same type ..."
827 This does not mention cv qualifiers and is different to what throw
828 [except.throw] and catch [except.catch] will do. They will ignore the
829 top level cv qualifiers, and allow qualifiers in the pointer to class
832 We implement the letter of the standard. */
835 comp_except_types (tree a, tree b, bool exact)
837 if (same_type_p (a, b))
841 if (cp_type_quals (a) || cp_type_quals (b))
844 if (TREE_CODE (a) == POINTER_TYPE
845 && TREE_CODE (b) == POINTER_TYPE)
849 if (cp_type_quals (a) || cp_type_quals (b))
853 if (TREE_CODE (a) != RECORD_TYPE
854 || TREE_CODE (b) != RECORD_TYPE)
857 if (PUBLICLY_UNIQUELY_DERIVED_P (a, b))
863 /* Return true if TYPE1 and TYPE2 are equivalent exception specifiers.
864 If EXACT is false, T2 can be stricter than T1 (according to 15.4/7),
865 otherwise it must be exact. Exception lists are unordered, but
866 we've already filtered out duplicates. Most lists will be in order,
867 we should try to make use of that. */
870 comp_except_specs (const_tree t1, const_tree t2, bool exact)
879 if (t1 == NULL_TREE) /* T1 is ... */
880 return t2 == NULL_TREE || !exact;
881 if (!TREE_VALUE (t1)) /* t1 is EMPTY */
882 return t2 != NULL_TREE && !TREE_VALUE (t2);
883 if (t2 == NULL_TREE) /* T2 is ... */
885 if (TREE_VALUE (t1) && !TREE_VALUE (t2)) /* T2 is EMPTY, T1 is not */
888 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
889 Count how many we find, to determine exactness. For exact matching and
890 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
892 for (base = t1; t2 != NULL_TREE; t2 = TREE_CHAIN (t2))
894 for (probe = base; probe != NULL_TREE; probe = TREE_CHAIN (probe))
896 tree a = TREE_VALUE (probe);
897 tree b = TREE_VALUE (t2);
899 if (comp_except_types (a, b, exact))
901 if (probe == base && exact)
902 base = TREE_CHAIN (probe);
907 if (probe == NULL_TREE)
910 return !exact || base == NULL_TREE || length == list_length (t1);
913 /* Compare the array types T1 and T2. ALLOW_REDECLARATION is true if
914 [] can match [size]. */
917 comp_array_types (const_tree t1, const_tree t2, bool allow_redeclaration)
926 /* The type of the array elements must be the same. */
927 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
930 d1 = TYPE_DOMAIN (t1);
931 d2 = TYPE_DOMAIN (t2);
936 /* If one of the arrays is dimensionless, and the other has a
937 dimension, they are of different types. However, it is valid to
945 declarations for an array object can specify
946 array types that differ by the presence or absence of a major
947 array bound (_dcl.array_). */
949 return allow_redeclaration;
951 /* Check that the dimensions are the same. */
953 if (!cp_tree_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2)))
955 max1 = TYPE_MAX_VALUE (d1);
956 max2 = TYPE_MAX_VALUE (d2);
957 if (processing_template_decl && !abi_version_at_least (2)
958 && !value_dependent_expression_p (max1)
959 && !value_dependent_expression_p (max2))
961 /* With abi-1 we do not fold non-dependent array bounds, (and
962 consequently mangle them incorrectly). We must therefore
963 fold them here, to verify the domains have the same
969 if (!cp_tree_equal (max1, max2))
975 /* Subroutine in comptypes. */
978 structural_comptypes (tree t1, tree t2, int strict)
983 /* Suppress errors caused by previously reported errors. */
984 if (t1 == error_mark_node || t2 == error_mark_node)
987 gcc_assert (TYPE_P (t1) && TYPE_P (t2));
989 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
990 current instantiation. */
991 if (TREE_CODE (t1) == TYPENAME_TYPE)
992 t1 = resolve_typename_type (t1, /*only_current_p=*/true);
994 if (TREE_CODE (t2) == TYPENAME_TYPE)
995 t2 = resolve_typename_type (t2, /*only_current_p=*/true);
997 if (TYPE_PTRMEMFUNC_P (t1))
998 t1 = TYPE_PTRMEMFUNC_FN_TYPE (t1);
999 if (TYPE_PTRMEMFUNC_P (t2))
1000 t2 = TYPE_PTRMEMFUNC_FN_TYPE (t2);
1002 /* Different classes of types can't be compatible. */
1003 if (TREE_CODE (t1) != TREE_CODE (t2))
1006 /* Qualifiers must match. For array types, we will check when we
1007 recur on the array element types. */
1008 if (TREE_CODE (t1) != ARRAY_TYPE
1009 && TYPE_QUALS (t1) != TYPE_QUALS (t2))
1011 if (TYPE_FOR_JAVA (t1) != TYPE_FOR_JAVA (t2))
1014 /* Allow for two different type nodes which have essentially the same
1015 definition. Note that we already checked for equality of the type
1016 qualifiers (just above). */
1018 if (TREE_CODE (t1) != ARRAY_TYPE
1019 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
1022 /* Compare the types. Break out if they could be the same. */
1023 switch (TREE_CODE (t1))
1027 /* All void and bool types are the same. */
1031 case FIXED_POINT_TYPE:
1033 /* With these nodes, we can't determine type equivalence by
1034 looking at what is stored in the nodes themselves, because
1035 two nodes might have different TYPE_MAIN_VARIANTs but still
1036 represent the same type. For example, wchar_t and int could
1037 have the same properties (TYPE_PRECISION, TYPE_MIN_VALUE,
1038 TYPE_MAX_VALUE, etc.), but have different TYPE_MAIN_VARIANTs
1039 and are distinct types. On the other hand, int and the
1042 typedef int INT __attribute((may_alias));
1044 have identical properties, different TYPE_MAIN_VARIANTs, but
1045 represent the same type. The canonical type system keeps
1046 track of equivalence in this case, so we fall back on it. */
1047 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1049 case TEMPLATE_TEMPLATE_PARM:
1050 case BOUND_TEMPLATE_TEMPLATE_PARM:
1051 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1052 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1053 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1054 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1056 if (!comp_template_parms
1057 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1)),
1058 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2))))
1060 if (TREE_CODE (t1) == TEMPLATE_TEMPLATE_PARM)
1062 /* Don't check inheritance. */
1063 strict = COMPARE_STRICT;
1068 if (TYPE_TEMPLATE_INFO (t1) && TYPE_TEMPLATE_INFO (t2)
1069 && (TYPE_TI_TEMPLATE (t1) == TYPE_TI_TEMPLATE (t2)
1070 || TREE_CODE (t1) == BOUND_TEMPLATE_TEMPLATE_PARM)
1071 && comp_template_args (TYPE_TI_ARGS (t1), TYPE_TI_ARGS (t2)))
1074 if ((strict & COMPARE_BASE) && DERIVED_FROM_P (t1, t2))
1076 else if ((strict & COMPARE_DERIVED) && DERIVED_FROM_P (t2, t1))
1082 if (!comptypes (TYPE_OFFSET_BASETYPE (t1), TYPE_OFFSET_BASETYPE (t2),
1083 strict & ~COMPARE_REDECLARATION))
1085 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1089 case REFERENCE_TYPE:
1090 if (TYPE_REF_IS_RVALUE (t1) != TYPE_REF_IS_RVALUE (t2))
1092 /* fall through to checks for pointer types */
1095 if (TYPE_MODE (t1) != TYPE_MODE (t2)
1096 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2)
1097 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1103 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1105 if (!compparms (TYPE_ARG_TYPES (t1), TYPE_ARG_TYPES (t2)))
1110 /* Target types must match incl. qualifiers. */
1111 if (!comp_array_types (t1, t2, !!(strict & COMPARE_REDECLARATION)))
1115 case TEMPLATE_TYPE_PARM:
1116 if (TEMPLATE_TYPE_IDX (t1) != TEMPLATE_TYPE_IDX (t2)
1117 || TEMPLATE_TYPE_LEVEL (t1) != TEMPLATE_TYPE_LEVEL (t2)
1118 || (TEMPLATE_TYPE_PARAMETER_PACK (t1)
1119 != TEMPLATE_TYPE_PARAMETER_PACK (t2)))
1124 if (!cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1),
1125 TYPENAME_TYPE_FULLNAME (t2)))
1127 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1131 case UNBOUND_CLASS_TEMPLATE:
1132 if (!cp_tree_equal (TYPE_IDENTIFIER (t1), TYPE_IDENTIFIER (t2)))
1134 if (!same_type_p (TYPE_CONTEXT (t1), TYPE_CONTEXT (t2)))
1139 if (!same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1144 if (TYPE_VECTOR_SUBPARTS (t1) != TYPE_VECTOR_SUBPARTS (t2)
1145 || !same_type_p (TREE_TYPE (t1), TREE_TYPE (t2)))
1149 case TYPE_PACK_EXPANSION:
1150 return same_type_p (PACK_EXPANSION_PATTERN (t1),
1151 PACK_EXPANSION_PATTERN (t2));
1154 if (DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t1)
1155 != DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (t2)
1156 || !cp_tree_equal (DECLTYPE_TYPE_EXPR (t1),
1157 DECLTYPE_TYPE_EXPR (t2)))
1165 /* If we get here, we know that from a target independent POV the
1166 types are the same. Make sure the target attributes are also
1168 return targetm.comp_type_attributes (t1, t2);
1171 /* Return true if T1 and T2 are related as allowed by STRICT. STRICT
1172 is a bitwise-or of the COMPARE_* flags. */
1175 comptypes (tree t1, tree t2, int strict)
1177 if (strict == COMPARE_STRICT)
1182 if (t1 == error_mark_node || t2 == error_mark_node)
1185 if (TYPE_STRUCTURAL_EQUALITY_P (t1) || TYPE_STRUCTURAL_EQUALITY_P (t2))
1186 /* At least one of the types requires structural equality, so
1187 perform a deep check. */
1188 return structural_comptypes (t1, t2, strict);
1190 #ifdef ENABLE_CHECKING
1191 if (USE_CANONICAL_TYPES)
1193 bool result = structural_comptypes (t1, t2, strict);
1195 if (result && TYPE_CANONICAL (t1) != TYPE_CANONICAL (t2))
1196 /* The two types are structurally equivalent, but their
1197 canonical types were different. This is a failure of the
1198 canonical type propagation code.*/
1200 ("canonical types differ for identical types %T and %T",
1202 else if (!result && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
1203 /* Two types are structurally different, but the canonical
1204 types are the same. This means we were over-eager in
1205 assigning canonical types. */
1207 ("same canonical type node for different types %T and %T",
1213 if (USE_CANONICAL_TYPES)
1214 return TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2);
1217 return structural_comptypes (t1, t2, strict);
1219 else if (strict == COMPARE_STRUCTURAL)
1220 return structural_comptypes (t1, t2, COMPARE_STRICT);
1222 return structural_comptypes (t1, t2, strict);
1225 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1228 at_least_as_qualified_p (const_tree type1, const_tree type2)
1230 int q1 = cp_type_quals (type1);
1231 int q2 = cp_type_quals (type2);
1233 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1234 return (q1 & q2) == q2;
1237 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1238 more cv-qualified that TYPE1, and 0 otherwise. */
1241 comp_cv_qualification (const_tree type1, const_tree type2)
1243 int q1 = cp_type_quals (type1);
1244 int q2 = cp_type_quals (type2);
1249 if ((q1 & q2) == q2)
1251 else if ((q1 & q2) == q1)
1257 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1258 subset of the cv-qualification signature of TYPE2, and the types
1259 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1262 comp_cv_qual_signature (tree type1, tree type2)
1264 if (comp_ptr_ttypes_real (type2, type1, -1))
1266 else if (comp_ptr_ttypes_real (type1, type2, -1))
1272 /* Subroutines of `comptypes'. */
1274 /* Return true if two parameter type lists PARMS1 and PARMS2 are
1275 equivalent in the sense that functions with those parameter types
1276 can have equivalent types. The two lists must be equivalent,
1277 element by element. */
1280 compparms (const_tree parms1, const_tree parms2)
1284 /* An unspecified parmlist matches any specified parmlist
1285 whose argument types don't need default promotions. */
1287 for (t1 = parms1, t2 = parms2;
1289 t1 = TREE_CHAIN (t1), t2 = TREE_CHAIN (t2))
1291 /* If one parmlist is shorter than the other,
1292 they fail to match. */
1295 if (!same_type_p (TREE_VALUE (t1), TREE_VALUE (t2)))
1302 /* Process a sizeof or alignof expression where the operand is a
1306 cxx_sizeof_or_alignof_type (tree type, enum tree_code op, bool complain)
1311 gcc_assert (op == SIZEOF_EXPR || op == ALIGNOF_EXPR);
1312 if (type == error_mark_node)
1313 return error_mark_node;
1315 type = non_reference (type);
1316 if (TREE_CODE (type) == METHOD_TYPE)
1319 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
1320 "invalid application of %qs to a member function",
1321 operator_name_info[(int) op].name);
1322 value = size_one_node;
1325 dependent_p = dependent_type_p (type);
1327 complete_type (type);
1329 /* VLA types will have a non-constant size. In the body of an
1330 uninstantiated template, we don't need to try to compute the
1331 value, because the sizeof expression is not an integral
1332 constant expression in that case. And, if we do try to
1333 compute the value, we'll likely end up with SAVE_EXPRs, which
1334 the template substitution machinery does not expect to see. */
1335 || (processing_template_decl
1336 && COMPLETE_TYPE_P (type)
1337 && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST))
1339 value = build_min (op, size_type_node, type);
1340 TREE_READONLY (value) = 1;
1344 return c_sizeof_or_alignof_type (complete_type (type),
1349 /* Return the size of the type, without producing any warnings for
1350 types whose size cannot be taken. This routine should be used only
1351 in some other routine that has already produced a diagnostic about
1352 using the size of such a type. */
1354 cxx_sizeof_nowarn (tree type)
1356 if (TREE_CODE (type) == FUNCTION_TYPE
1357 || TREE_CODE (type) == VOID_TYPE
1358 || TREE_CODE (type) == ERROR_MARK)
1359 return size_one_node;
1360 else if (!COMPLETE_TYPE_P (type))
1361 return size_zero_node;
1363 return cxx_sizeof_or_alignof_type (type, SIZEOF_EXPR, false);
1366 /* Process a sizeof expression where the operand is an expression. */
1369 cxx_sizeof_expr (tree e, tsubst_flags_t complain)
1371 if (e == error_mark_node)
1372 return error_mark_node;
1374 if (processing_template_decl)
1376 e = build_min (SIZEOF_EXPR, size_type_node, e);
1377 TREE_SIDE_EFFECTS (e) = 0;
1378 TREE_READONLY (e) = 1;
1383 if (TREE_CODE (e) == COMPONENT_REF
1384 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1385 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1387 if (complain & tf_error)
1388 error ("invalid application of %<sizeof%> to a bit-field");
1390 return error_mark_node;
1393 else if (is_overloaded_fn (e))
1395 if (complain & tf_error)
1396 permerror (input_location, "ISO C++ forbids applying %<sizeof%> to an expression of "
1399 return error_mark_node;
1402 else if (type_unknown_p (e))
1404 if (complain & tf_error)
1405 cxx_incomplete_type_error (e, TREE_TYPE (e));
1407 return error_mark_node;
1413 return cxx_sizeof_or_alignof_type (e, SIZEOF_EXPR, complain & tf_error);
1416 /* Implement the __alignof keyword: Return the minimum required
1417 alignment of E, measured in bytes. For VAR_DECL's and
1418 FIELD_DECL's return DECL_ALIGN (which can be set from an
1419 "aligned" __attribute__ specification). */
1422 cxx_alignof_expr (tree e, tsubst_flags_t complain)
1426 if (e == error_mark_node)
1427 return error_mark_node;
1429 if (processing_template_decl)
1431 e = build_min (ALIGNOF_EXPR, size_type_node, e);
1432 TREE_SIDE_EFFECTS (e) = 0;
1433 TREE_READONLY (e) = 1;
1438 if (TREE_CODE (e) == VAR_DECL)
1439 t = size_int (DECL_ALIGN_UNIT (e));
1440 else if (TREE_CODE (e) == COMPONENT_REF
1441 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL
1442 && DECL_C_BIT_FIELD (TREE_OPERAND (e, 1)))
1444 if (complain & tf_error)
1445 error ("invalid application of %<__alignof%> to a bit-field");
1447 return error_mark_node;
1450 else if (TREE_CODE (e) == COMPONENT_REF
1451 && TREE_CODE (TREE_OPERAND (e, 1)) == FIELD_DECL)
1452 t = size_int (DECL_ALIGN_UNIT (TREE_OPERAND (e, 1)));
1453 else if (is_overloaded_fn (e))
1455 if (complain & tf_error)
1456 permerror (input_location, "ISO C++ forbids applying %<__alignof%> to an expression of "
1459 return error_mark_node;
1460 if (TREE_CODE (e) == FUNCTION_DECL)
1461 t = size_int (DECL_ALIGN_UNIT (e));
1465 else if (type_unknown_p (e))
1467 if (complain & tf_error)
1468 cxx_incomplete_type_error (e, TREE_TYPE (e));
1470 return error_mark_node;
1474 return cxx_sizeof_or_alignof_type (TREE_TYPE (e), ALIGNOF_EXPR,
1475 complain & tf_error);
1477 return fold_convert (size_type_node, t);
1480 /* Process a sizeof or alignof expression E with code OP where the operand
1481 is an expression. */
1484 cxx_sizeof_or_alignof_expr (tree e, enum tree_code op, bool complain)
1486 if (op == SIZEOF_EXPR)
1487 return cxx_sizeof_expr (e, complain? tf_warning_or_error : tf_none);
1489 return cxx_alignof_expr (e, complain? tf_warning_or_error : tf_none);
1492 /* EXPR is being used in a context that is not a function call.
1497 The expression can be used only as the left-hand operand of a
1498 member function call.
1500 [expr.mptr.operator]
1502 If the result of .* or ->* is a function, then that result can be
1503 used only as the operand for the function call operator ().
1505 by issuing an error message if appropriate. Returns true iff EXPR
1506 violates these rules. */
1509 invalid_nonstatic_memfn_p (const_tree expr, tsubst_flags_t complain)
1511 if (expr && DECL_NONSTATIC_MEMBER_FUNCTION_P (expr))
1513 if (complain & tf_error)
1514 error ("invalid use of non-static member function");
1520 /* If EXP is a reference to a bitfield, and the type of EXP does not
1521 match the declared type of the bitfield, return the declared type
1522 of the bitfield. Otherwise, return NULL_TREE. */
1525 is_bitfield_expr_with_lowered_type (const_tree exp)
1527 switch (TREE_CODE (exp))
1530 if (!is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1)
1531 ? TREE_OPERAND (exp, 1)
1532 : TREE_OPERAND (exp, 0)))
1534 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 2));
1537 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 1));
1541 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1547 field = TREE_OPERAND (exp, 1);
1548 if (TREE_CODE (field) != FIELD_DECL || !DECL_BIT_FIELD_TYPE (field))
1550 if (same_type_ignoring_top_level_qualifiers_p
1551 (TREE_TYPE (exp), DECL_BIT_FIELD_TYPE (field)))
1553 return DECL_BIT_FIELD_TYPE (field);
1557 if (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (exp, 0)))
1558 == TYPE_MAIN_VARIANT (TREE_TYPE (exp)))
1559 return is_bitfield_expr_with_lowered_type (TREE_OPERAND (exp, 0));
1567 /* Like is_bitfield_with_lowered_type, except that if EXP is not a
1568 bitfield with a lowered type, the type of EXP is returned, rather
1572 unlowered_expr_type (const_tree exp)
1576 type = is_bitfield_expr_with_lowered_type (exp);
1578 type = TREE_TYPE (exp);
1583 /* Perform the conversions in [expr] that apply when an lvalue appears
1584 in an rvalue context: the lvalue-to-rvalue, array-to-pointer, and
1585 function-to-pointer conversions. In addition, manifest constants
1586 are replaced by their values, and bitfield references are converted
1587 to their declared types.
1589 Although the returned value is being used as an rvalue, this
1590 function does not wrap the returned expression in a
1591 NON_LVALUE_EXPR; the caller is expected to be mindful of the fact
1592 that the return value is no longer an lvalue. */
1595 decay_conversion (tree exp)
1598 enum tree_code code;
1600 type = TREE_TYPE (exp);
1601 if (type == error_mark_node)
1602 return error_mark_node;
1604 if (type_unknown_p (exp))
1606 cxx_incomplete_type_error (exp, TREE_TYPE (exp));
1607 return error_mark_node;
1610 exp = decl_constant_value (exp);
1611 if (error_operand_p (exp))
1612 return error_mark_node;
1614 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1615 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1616 code = TREE_CODE (type);
1617 if (code == VOID_TYPE)
1619 error ("void value not ignored as it ought to be");
1620 return error_mark_node;
1622 if (invalid_nonstatic_memfn_p (exp, tf_warning_or_error))
1623 return error_mark_node;
1624 if (code == FUNCTION_TYPE || is_overloaded_fn (exp))
1625 return cp_build_unary_op (ADDR_EXPR, exp, 0, tf_warning_or_error);
1626 if (code == ARRAY_TYPE)
1631 if (TREE_CODE (exp) == INDIRECT_REF)
1632 return build_nop (build_pointer_type (TREE_TYPE (type)),
1633 TREE_OPERAND (exp, 0));
1635 if (TREE_CODE (exp) == COMPOUND_EXPR)
1637 tree op1 = decay_conversion (TREE_OPERAND (exp, 1));
1638 return build2 (COMPOUND_EXPR, TREE_TYPE (op1),
1639 TREE_OPERAND (exp, 0), op1);
1643 && ! (TREE_CODE (exp) == CONSTRUCTOR && TREE_STATIC (exp)))
1645 error ("invalid use of non-lvalue array");
1646 return error_mark_node;
1649 ptrtype = build_pointer_type (TREE_TYPE (type));
1651 if (TREE_CODE (exp) == VAR_DECL)
1653 if (!cxx_mark_addressable (exp))
1654 return error_mark_node;
1655 adr = build_nop (ptrtype, build_address (exp));
1658 /* This way is better for a COMPONENT_REF since it can
1659 simplify the offset for a component. */
1660 adr = cp_build_unary_op (ADDR_EXPR, exp, 1, tf_warning_or_error);
1661 return cp_convert (ptrtype, adr);
1664 /* If a bitfield is used in a context where integral promotion
1665 applies, then the caller is expected to have used
1666 default_conversion. That function promotes bitfields correctly
1667 before calling this function. At this point, if we have a
1668 bitfield referenced, we may assume that is not subject to
1669 promotion, and that, therefore, the type of the resulting rvalue
1670 is the declared type of the bitfield. */
1671 exp = convert_bitfield_to_declared_type (exp);
1673 /* We do not call rvalue() here because we do not want to wrap EXP
1674 in a NON_LVALUE_EXPR. */
1678 Non-class rvalues always have cv-unqualified types. */
1679 type = TREE_TYPE (exp);
1680 if (!CLASS_TYPE_P (type) && cp_type_quals (type))
1681 exp = build_nop (TYPE_MAIN_VARIANT (type), exp);
1686 /* Perform preparatory conversions, as part of the "usual arithmetic
1687 conversions". In particular, as per [expr]:
1689 Whenever an lvalue expression appears as an operand of an
1690 operator that expects the rvalue for that operand, the
1691 lvalue-to-rvalue, array-to-pointer, or function-to-pointer
1692 standard conversions are applied to convert the expression to an
1695 In addition, we perform integral promotions here, as those are
1696 applied to both operands to a binary operator before determining
1697 what additional conversions should apply. */
1700 default_conversion (tree exp)
1702 /* Perform the integral promotions first so that bitfield
1703 expressions (which may promote to "int", even if the bitfield is
1704 declared "unsigned") are promoted correctly. */
1705 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (exp)))
1706 exp = perform_integral_promotions (exp);
1707 /* Perform the other conversions. */
1708 exp = decay_conversion (exp);
1713 /* EXPR is an expression with an integral or enumeration type.
1714 Perform the integral promotions in [conv.prom], and return the
1718 perform_integral_promotions (tree expr)
1725 If the bitfield has an enumerated type, it is treated as any
1726 other value of that type for promotion purposes. */
1727 type = is_bitfield_expr_with_lowered_type (expr);
1728 if (!type || TREE_CODE (type) != ENUMERAL_TYPE)
1729 type = TREE_TYPE (expr);
1730 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type));
1731 promoted_type = type_promotes_to (type);
1732 if (type != promoted_type)
1733 expr = cp_convert (promoted_type, expr);
1737 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1738 decay_conversion to one. */
1741 string_conv_p (const_tree totype, const_tree exp, int warn)
1745 if (TREE_CODE (totype) != POINTER_TYPE)
1748 t = TREE_TYPE (totype);
1749 if (!same_type_p (t, char_type_node)
1750 && !same_type_p (t, char16_type_node)
1751 && !same_type_p (t, char32_type_node)
1752 && !same_type_p (t, wchar_type_node))
1755 if (TREE_CODE (exp) == STRING_CST)
1757 /* Make sure that we don't try to convert between char and wide chars. */
1758 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp))), t))
1763 /* Is this a string constant which has decayed to 'const char *'? */
1764 t = build_pointer_type (build_qualified_type (t, TYPE_QUAL_CONST));
1765 if (!same_type_p (TREE_TYPE (exp), t))
1768 if (TREE_CODE (exp) != ADDR_EXPR
1769 || TREE_CODE (TREE_OPERAND (exp, 0)) != STRING_CST)
1773 /* This warning is not very useful, as it complains about printf. */
1775 warning (OPT_Wwrite_strings,
1776 "deprecated conversion from string constant to %qT",
1782 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1783 can, for example, use as an lvalue. This code used to be in
1784 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1785 expressions, where we're dealing with aggregates. But now it's again only
1786 called from unary_complex_lvalue. The case (in particular) that led to
1787 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1791 rationalize_conditional_expr (enum tree_code code, tree t,
1792 tsubst_flags_t complain)
1794 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1795 the first operand is always the one to be used if both operands
1796 are equal, so we know what conditional expression this used to be. */
1797 if (TREE_CODE (t) == MIN_EXPR || TREE_CODE (t) == MAX_EXPR)
1799 tree op0 = TREE_OPERAND (t, 0);
1800 tree op1 = TREE_OPERAND (t, 1);
1802 /* The following code is incorrect if either operand side-effects. */
1803 gcc_assert (!TREE_SIDE_EFFECTS (op0)
1804 && !TREE_SIDE_EFFECTS (op1));
1806 build_conditional_expr (build_x_binary_op ((TREE_CODE (t) == MIN_EXPR
1807 ? LE_EXPR : GE_EXPR),
1808 op0, TREE_CODE (op0),
1809 op1, TREE_CODE (op1),
1810 /*overloaded_p=*/NULL,
1812 cp_build_unary_op (code, op0, 0, complain),
1813 cp_build_unary_op (code, op1, 0, complain),
1818 build_conditional_expr (TREE_OPERAND (t, 0),
1819 cp_build_unary_op (code, TREE_OPERAND (t, 1), 0,
1821 cp_build_unary_op (code, TREE_OPERAND (t, 2), 0,
1826 /* Given the TYPE of an anonymous union field inside T, return the
1827 FIELD_DECL for the field. If not found return NULL_TREE. Because
1828 anonymous unions can nest, we must also search all anonymous unions
1829 that are directly reachable. */
1832 lookup_anon_field (tree t, tree type)
1836 for (field = TYPE_FIELDS (t); field; field = TREE_CHAIN (field))
1838 if (TREE_STATIC (field))
1840 if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field))
1843 /* If we find it directly, return the field. */
1844 if (DECL_NAME (field) == NULL_TREE
1845 && type == TYPE_MAIN_VARIANT (TREE_TYPE (field)))
1850 /* Otherwise, it could be nested, search harder. */
1851 if (DECL_NAME (field) == NULL_TREE
1852 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1854 tree subfield = lookup_anon_field (TREE_TYPE (field), type);
1862 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1863 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1864 non-NULL, it indicates the path to the base used to name MEMBER.
1865 If PRESERVE_REFERENCE is true, the expression returned will have
1866 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1867 returned will have the type referred to by the reference.
1869 This function does not perform access control; that is either done
1870 earlier by the parser when the name of MEMBER is resolved to MEMBER
1871 itself, or later when overload resolution selects one of the
1872 functions indicated by MEMBER. */
1875 build_class_member_access_expr (tree object, tree member,
1876 tree access_path, bool preserve_reference,
1877 tsubst_flags_t complain)
1881 tree result = NULL_TREE;
1883 if (error_operand_p (object) || error_operand_p (member))
1884 return error_mark_node;
1886 gcc_assert (DECL_P (member) || BASELINK_P (member));
1890 The type of the first expression shall be "class object" (of a
1892 object_type = TREE_TYPE (object);
1893 if (!currently_open_class (object_type)
1894 && !complete_type_or_else (object_type, object))
1895 return error_mark_node;
1896 if (!CLASS_TYPE_P (object_type))
1898 if (complain & tf_error)
1899 error ("request for member %qD in %qE, which is of non-class type %qT",
1900 member, object, object_type);
1901 return error_mark_node;
1904 /* The standard does not seem to actually say that MEMBER must be a
1905 member of OBJECT_TYPE. However, that is clearly what is
1907 if (DECL_P (member))
1909 member_scope = DECL_CLASS_CONTEXT (member);
1911 if (TREE_DEPRECATED (member))
1912 warn_deprecated_use (member);
1915 member_scope = BINFO_TYPE (BASELINK_ACCESS_BINFO (member));
1916 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1917 presently be the anonymous union. Go outwards until we find a
1918 type related to OBJECT_TYPE. */
1919 while (ANON_AGGR_TYPE_P (member_scope)
1920 && !same_type_ignoring_top_level_qualifiers_p (member_scope,
1922 member_scope = TYPE_CONTEXT (member_scope);
1923 if (!member_scope || !DERIVED_FROM_P (member_scope, object_type))
1925 if (complain & tf_error)
1927 if (TREE_CODE (member) == FIELD_DECL)
1928 error ("invalid use of nonstatic data member %qE", member);
1930 error ("%qD is not a member of %qT", member, object_type);
1932 return error_mark_node;
1935 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1936 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1937 in the front end; only _DECLs and _REFs are lvalues in the back end. */
1939 tree temp = unary_complex_lvalue (ADDR_EXPR, object);
1941 object = cp_build_indirect_ref (temp, NULL, complain);
1944 /* In [expr.ref], there is an explicit list of the valid choices for
1945 MEMBER. We check for each of those cases here. */
1946 if (TREE_CODE (member) == VAR_DECL)
1948 /* A static data member. */
1950 /* If OBJECT has side-effects, they are supposed to occur. */
1951 if (TREE_SIDE_EFFECTS (object))
1952 result = build2 (COMPOUND_EXPR, TREE_TYPE (result), object, result);
1954 else if (TREE_CODE (member) == FIELD_DECL)
1956 /* A non-static data member. */
1961 null_object_p = (TREE_CODE (object) == INDIRECT_REF
1962 && integer_zerop (TREE_OPERAND (object, 0)));
1964 /* Convert OBJECT to the type of MEMBER. */
1965 if (!same_type_p (TYPE_MAIN_VARIANT (object_type),
1966 TYPE_MAIN_VARIANT (member_scope)))
1971 binfo = lookup_base (access_path ? access_path : object_type,
1972 member_scope, ba_unique, &kind);
1973 if (binfo == error_mark_node)
1974 return error_mark_node;
1976 /* It is invalid to try to get to a virtual base of a
1977 NULL object. The most common cause is invalid use of
1979 if (null_object_p && kind == bk_via_virtual)
1981 if (complain & tf_error)
1983 error ("invalid access to non-static data member %qD of "
1986 error ("(perhaps the %<offsetof%> macro was used incorrectly)");
1988 return error_mark_node;
1991 /* Convert to the base. */
1992 object = build_base_path (PLUS_EXPR, object, binfo,
1994 /* If we found the base successfully then we should be able
1995 to convert to it successfully. */
1996 gcc_assert (object != error_mark_node);
1999 /* Complain about other invalid uses of offsetof, even though they will
2000 give the right answer. Note that we complain whether or not they
2001 actually used the offsetof macro, since there's no way to know at this
2002 point. So we just give a warning, instead of a pedwarn. */
2003 /* Do not produce this warning for base class field references, because
2004 we know for a fact that didn't come from offsetof. This does occur
2005 in various testsuite cases where a null object is passed where a
2006 vtable access is required. */
2007 if (null_object_p && warn_invalid_offsetof
2008 && CLASSTYPE_NON_POD_P (object_type)
2009 && !DECL_FIELD_IS_BASE (member)
2011 && (complain & tf_warning))
2013 warning (OPT_Winvalid_offsetof,
2014 "invalid access to non-static data member %qD "
2015 " of NULL object", member);
2016 warning (OPT_Winvalid_offsetof,
2017 "(perhaps the %<offsetof%> macro was used incorrectly)");
2020 /* If MEMBER is from an anonymous aggregate, we have converted
2021 OBJECT so that it refers to the class containing the
2022 anonymous union. Generate a reference to the anonymous union
2023 itself, and recur to find MEMBER. */
2024 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member))
2025 /* When this code is called from build_field_call, the
2026 object already has the type of the anonymous union.
2027 That is because the COMPONENT_REF was already
2028 constructed, and was then disassembled before calling
2029 build_field_call. After the function-call code is
2030 cleaned up, this waste can be eliminated. */
2031 && (!same_type_ignoring_top_level_qualifiers_p
2032 (TREE_TYPE (object), DECL_CONTEXT (member))))
2034 tree anonymous_union;
2036 anonymous_union = lookup_anon_field (TREE_TYPE (object),
2037 DECL_CONTEXT (member));
2038 object = build_class_member_access_expr (object,
2040 /*access_path=*/NULL_TREE,
2045 /* Compute the type of the field, as described in [expr.ref]. */
2046 type_quals = TYPE_UNQUALIFIED;
2047 member_type = TREE_TYPE (member);
2048 if (TREE_CODE (member_type) != REFERENCE_TYPE)
2050 type_quals = (cp_type_quals (member_type)
2051 | cp_type_quals (object_type));
2053 /* A field is const (volatile) if the enclosing object, or the
2054 field itself, is const (volatile). But, a mutable field is
2055 not const, even within a const object. */
2056 if (DECL_MUTABLE_P (member))
2057 type_quals &= ~TYPE_QUAL_CONST;
2058 member_type = cp_build_qualified_type (member_type, type_quals);
2061 result = build3 (COMPONENT_REF, member_type, object, member,
2063 result = fold_if_not_in_template (result);
2065 /* Mark the expression const or volatile, as appropriate. Even
2066 though we've dealt with the type above, we still have to mark the
2067 expression itself. */
2068 if (type_quals & TYPE_QUAL_CONST)
2069 TREE_READONLY (result) = 1;
2070 if (type_quals & TYPE_QUAL_VOLATILE)
2071 TREE_THIS_VOLATILE (result) = 1;
2073 else if (BASELINK_P (member))
2075 /* The member is a (possibly overloaded) member function. */
2079 /* If the MEMBER is exactly one static member function, then we
2080 know the type of the expression. Otherwise, we must wait
2081 until overload resolution has been performed. */
2082 functions = BASELINK_FUNCTIONS (member);
2083 if (TREE_CODE (functions) == FUNCTION_DECL
2084 && DECL_STATIC_FUNCTION_P (functions))
2085 type = TREE_TYPE (functions);
2087 type = unknown_type_node;
2088 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2089 base. That will happen when the function is called. */
2090 result = build3 (COMPONENT_REF, type, object, member, NULL_TREE);
2092 else if (TREE_CODE (member) == CONST_DECL)
2094 /* The member is an enumerator. */
2096 /* If OBJECT has side-effects, they are supposed to occur. */
2097 if (TREE_SIDE_EFFECTS (object))
2098 result = build2 (COMPOUND_EXPR, TREE_TYPE (result),
2103 if (complain & tf_error)
2104 error ("invalid use of %qD", member);
2105 return error_mark_node;
2108 if (!preserve_reference)
2111 If E2 is declared to have type "reference to T", then ... the
2112 type of E1.E2 is T. */
2113 result = convert_from_reference (result);
2118 /* Return the destructor denoted by OBJECT.SCOPE::DTOR_NAME, or, if
2119 SCOPE is NULL, by OBJECT.DTOR_NAME, where DTOR_NAME is ~type. */
2122 lookup_destructor (tree object, tree scope, tree dtor_name)
2124 tree object_type = TREE_TYPE (object);
2125 tree dtor_type = TREE_OPERAND (dtor_name, 0);
2128 if (scope && !check_dtor_name (scope, dtor_type))
2130 error ("qualified type %qT does not match destructor name ~%qT",
2132 return error_mark_node;
2134 if (TREE_CODE (dtor_type) == IDENTIFIER_NODE)
2136 /* In a template, names we can't find a match for are still accepted
2137 destructor names, and we check them here. */
2138 if (check_dtor_name (object_type, dtor_type))
2139 dtor_type = object_type;
2142 error ("object type %qT does not match destructor name ~%qT",
2143 object_type, dtor_type);
2144 return error_mark_node;
2148 else if (!DERIVED_FROM_P (dtor_type, TYPE_MAIN_VARIANT (object_type)))
2150 error ("the type being destroyed is %qT, but the destructor refers to %qT",
2151 TYPE_MAIN_VARIANT (object_type), dtor_type);
2152 return error_mark_node;
2154 expr = lookup_member (dtor_type, complete_dtor_identifier,
2155 /*protect=*/1, /*want_type=*/false);
2156 expr = (adjust_result_of_qualified_name_lookup
2157 (expr, dtor_type, object_type));
2161 /* An expression of the form "A::template B" has been resolved to
2162 DECL. Issue a diagnostic if B is not a template or template
2166 check_template_keyword (tree decl)
2168 /* The standard says:
2172 If a name prefixed by the keyword template is not a member
2173 template, the program is ill-formed.
2175 DR 228 removed the restriction that the template be a member
2178 DR 96, if accepted would add the further restriction that explicit
2179 template arguments must be provided if the template keyword is
2180 used, but, as of 2005-10-16, that DR is still in "drafting". If
2181 this DR is accepted, then the semantic checks here can be
2182 simplified, as the entity named must in fact be a template
2183 specialization, rather than, as at present, a set of overloaded
2184 functions containing at least one template function. */
2185 if (TREE_CODE (decl) != TEMPLATE_DECL
2186 && TREE_CODE (decl) != TEMPLATE_ID_EXPR)
2188 if (!is_overloaded_fn (decl))
2189 permerror (input_location, "%qD is not a template", decl);
2194 if (BASELINK_P (fns))
2195 fns = BASELINK_FUNCTIONS (fns);
2198 tree fn = OVL_CURRENT (fns);
2199 if (TREE_CODE (fn) == TEMPLATE_DECL
2200 || TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2202 if (TREE_CODE (fn) == FUNCTION_DECL
2203 && DECL_USE_TEMPLATE (fn)
2204 && PRIMARY_TEMPLATE_P (DECL_TI_TEMPLATE (fn)))
2206 fns = OVL_NEXT (fns);
2209 permerror (input_location, "%qD is not a template", decl);
2214 /* This function is called by the parser to process a class member
2215 access expression of the form OBJECT.NAME. NAME is a node used by
2216 the parser to represent a name; it is not yet a DECL. It may,
2217 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2218 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2219 there is no reason to do the lookup twice, so the parser keeps the
2220 BASELINK. TEMPLATE_P is true iff NAME was explicitly declared to
2221 be a template via the use of the "A::template B" syntax. */
2224 finish_class_member_access_expr (tree object, tree name, bool template_p,
2225 tsubst_flags_t complain)
2230 tree access_path = NULL_TREE;
2231 tree orig_object = object;
2232 tree orig_name = name;
2234 if (object == error_mark_node || name == error_mark_node)
2235 return error_mark_node;
2237 /* If OBJECT is an ObjC class instance, we must obey ObjC access rules. */
2238 if (!objc_is_public (object, name))
2239 return error_mark_node;
2241 object_type = TREE_TYPE (object);
2243 if (processing_template_decl)
2245 if (/* If OBJECT_TYPE is dependent, so is OBJECT.NAME. */
2246 dependent_type_p (object_type)
2247 /* If NAME is just an IDENTIFIER_NODE, then the expression
2249 || TREE_CODE (object) == IDENTIFIER_NODE
2250 /* If NAME is "f<args>", where either 'f' or 'args' is
2251 dependent, then the expression is dependent. */
2252 || (TREE_CODE (name) == TEMPLATE_ID_EXPR
2253 && dependent_template_id_p (TREE_OPERAND (name, 0),
2254 TREE_OPERAND (name, 1)))
2255 /* If NAME is "T::X" where "T" is dependent, then the
2256 expression is dependent. */
2257 || (TREE_CODE (name) == SCOPE_REF
2258 && TYPE_P (TREE_OPERAND (name, 0))
2259 && dependent_type_p (TREE_OPERAND (name, 0))))
2260 return build_min_nt (COMPONENT_REF, object, name, NULL_TREE);
2261 object = build_non_dependent_expr (object);
2266 The type of the first expression shall be "class object" (of a
2268 if (!currently_open_class (object_type)
2269 && !complete_type_or_else (object_type, object))
2270 return error_mark_node;
2271 if (!CLASS_TYPE_P (object_type))
2273 if (complain & tf_error)
2274 error ("request for member %qD in %qE, which is of non-class type %qT",
2275 name, object, object_type);
2276 return error_mark_node;
2279 if (BASELINK_P (name))
2280 /* A member function that has already been looked up. */
2284 bool is_template_id = false;
2285 tree template_args = NULL_TREE;
2288 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
2290 is_template_id = true;
2291 template_args = TREE_OPERAND (name, 1);
2292 name = TREE_OPERAND (name, 0);
2294 if (TREE_CODE (name) == OVERLOAD)
2295 name = DECL_NAME (get_first_fn (name));
2296 else if (DECL_P (name))
2297 name = DECL_NAME (name);
2300 if (TREE_CODE (name) == SCOPE_REF)
2302 /* A qualified name. The qualifying class or namespace `S'
2303 has already been looked up; it is either a TYPE or a
2305 scope = TREE_OPERAND (name, 0);
2306 name = TREE_OPERAND (name, 1);
2308 /* If SCOPE is a namespace, then the qualified name does not
2309 name a member of OBJECT_TYPE. */
2310 if (TREE_CODE (scope) == NAMESPACE_DECL)
2312 if (complain & tf_error)
2313 error ("%<%D::%D%> is not a member of %qT",
2314 scope, name, object_type);
2315 return error_mark_node;
2318 gcc_assert (CLASS_TYPE_P (scope));
2319 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE
2320 || TREE_CODE (name) == BIT_NOT_EXPR);
2322 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2323 access_path = lookup_base (object_type, scope, ba_check, NULL);
2324 if (access_path == error_mark_node)
2325 return error_mark_node;
2328 if (complain & tf_error)
2329 error ("%qT is not a base of %qT", scope, object_type);
2330 return error_mark_node;
2336 access_path = object_type;
2339 if (TREE_CODE (name) == BIT_NOT_EXPR)
2340 member = lookup_destructor (object, scope, name);
2343 /* Look up the member. */
2344 member = lookup_member (access_path, name, /*protect=*/1,
2345 /*want_type=*/false);
2346 if (member == NULL_TREE)
2348 if (complain & tf_error)
2349 error ("%qD has no member named %qE", object_type, name);
2350 return error_mark_node;
2352 if (member == error_mark_node)
2353 return error_mark_node;
2358 tree templ = member;
2360 if (BASELINK_P (templ))
2361 templ = lookup_template_function (templ, template_args);
2364 if (complain & tf_error)
2365 error ("%qD is not a member template function", name);
2366 return error_mark_node;
2371 if (TREE_DEPRECATED (member))
2372 warn_deprecated_use (member);
2375 check_template_keyword (member);
2377 expr = build_class_member_access_expr (object, member, access_path,
2378 /*preserve_reference=*/false,
2380 if (processing_template_decl && expr != error_mark_node)
2382 if (BASELINK_P (member))
2384 if (TREE_CODE (orig_name) == SCOPE_REF)
2385 BASELINK_QUALIFIED_P (member) = 1;
2388 return build_min_non_dep (COMPONENT_REF, expr,
2389 orig_object, orig_name,
2396 /* Return an expression for the MEMBER_NAME field in the internal
2397 representation of PTRMEM, a pointer-to-member function. (Each
2398 pointer-to-member function type gets its own RECORD_TYPE so it is
2399 more convenient to access the fields by name than by FIELD_DECL.)
2400 This routine converts the NAME to a FIELD_DECL and then creates the
2401 node for the complete expression. */
2404 build_ptrmemfunc_access_expr (tree ptrmem, tree member_name)
2410 /* This code is a stripped down version of
2411 build_class_member_access_expr. It does not work to use that
2412 routine directly because it expects the object to be of class
2414 ptrmem_type = TREE_TYPE (ptrmem);
2415 gcc_assert (TYPE_PTRMEMFUNC_P (ptrmem_type));
2416 member = lookup_member (ptrmem_type, member_name, /*protect=*/0,
2417 /*want_type=*/false);
2418 member_type = cp_build_qualified_type (TREE_TYPE (member),
2419 cp_type_quals (ptrmem_type));
2420 return fold_build3 (COMPONENT_REF, member_type,
2421 ptrmem, member, NULL_TREE);
2424 /* Given an expression PTR for a pointer, return an expression
2425 for the value pointed to.
2426 ERRORSTRING is the name of the operator to appear in error messages.
2428 This function may need to overload OPERATOR_FNNAME.
2429 Must also handle REFERENCE_TYPEs for C++. */
2432 build_x_indirect_ref (tree expr, const char *errorstring,
2433 tsubst_flags_t complain)
2435 tree orig_expr = expr;
2438 if (processing_template_decl)
2440 if (type_dependent_expression_p (expr))
2441 return build_min_nt (INDIRECT_REF, expr);
2442 expr = build_non_dependent_expr (expr);
2445 rval = build_new_op (INDIRECT_REF, LOOKUP_NORMAL, expr, NULL_TREE,
2446 NULL_TREE, /*overloaded_p=*/NULL, complain);
2448 rval = cp_build_indirect_ref (expr, errorstring, complain);
2450 if (processing_template_decl && rval != error_mark_node)
2451 return build_min_non_dep (INDIRECT_REF, rval, orig_expr);
2456 /* Helper function called from c-common. */
2458 build_indirect_ref (location_t loc __attribute__ ((__unused__)),
2459 tree ptr, const char *errorstring)
2461 return cp_build_indirect_ref (ptr, errorstring, tf_warning_or_error);
2465 cp_build_indirect_ref (tree ptr, const char *errorstring,
2466 tsubst_flags_t complain)
2470 if (ptr == error_mark_node)
2471 return error_mark_node;
2473 if (ptr == current_class_ptr)
2474 return current_class_ref;
2476 pointer = (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
2477 ? ptr : decay_conversion (ptr));
2478 type = TREE_TYPE (pointer);
2480 if (POINTER_TYPE_P (type))
2484 If the type of the expression is "pointer to T," the type
2485 of the result is "T."
2487 We must use the canonical variant because certain parts of
2488 the back end, like fold, do pointer comparisons between
2490 tree t = canonical_type_variant (TREE_TYPE (type));
2492 if (CONVERT_EXPR_P (ptr)
2493 || TREE_CODE (ptr) == VIEW_CONVERT_EXPR)
2495 /* If a warning is issued, mark it to avoid duplicates from
2496 the backend. This only needs to be done at
2497 warn_strict_aliasing > 2. */
2498 if (warn_strict_aliasing > 2)
2499 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (ptr, 0)),
2500 type, TREE_OPERAND (ptr, 0)))
2501 TREE_NO_WARNING (ptr) = 1;
2504 if (VOID_TYPE_P (t))
2506 /* A pointer to incomplete type (other than cv void) can be
2507 dereferenced [expr.unary.op]/1 */
2508 if (complain & tf_error)
2509 error ("%qT is not a pointer-to-object type", type);
2510 return error_mark_node;
2512 else if (TREE_CODE (pointer) == ADDR_EXPR
2513 && same_type_p (t, TREE_TYPE (TREE_OPERAND (pointer, 0))))
2514 /* The POINTER was something like `&x'. We simplify `*&x' to
2516 return TREE_OPERAND (pointer, 0);
2519 tree ref = build1 (INDIRECT_REF, t, pointer);
2521 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2522 so that we get the proper error message if the result is used
2523 to assign to. Also, &* is supposed to be a no-op. */
2524 TREE_READONLY (ref) = CP_TYPE_CONST_P (t);
2525 TREE_THIS_VOLATILE (ref) = CP_TYPE_VOLATILE_P (t);
2526 TREE_SIDE_EFFECTS (ref)
2527 = (TREE_THIS_VOLATILE (ref) || TREE_SIDE_EFFECTS (pointer));
2531 else if (!(complain & tf_error))
2532 /* Don't emit any errors; we'll just return ERROR_MARK_NODE later. */
2534 /* `pointer' won't be an error_mark_node if we were given a
2535 pointer to member, so it's cool to check for this here. */
2536 else if (TYPE_PTR_TO_MEMBER_P (type))
2537 error ("invalid use of %qs on pointer to member", errorstring);
2538 else if (pointer != error_mark_node)
2541 error ("invalid type argument of %qs", errorstring);
2543 error ("invalid type argument");
2545 return error_mark_node;
2548 /* This handles expressions of the form "a[i]", which denotes
2551 This is logically equivalent in C to *(a+i), but we may do it differently.
2552 If A is a variable or a member, we generate a primitive ARRAY_REF.
2553 This avoids forcing the array out of registers, and can work on
2554 arrays that are not lvalues (for example, members of structures returned
2557 If INDEX is of some user-defined type, it must be converted to
2558 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2559 will inherit the type of the array, which will be some pointer type.
2561 LOC is the location to use in building the array reference. */
2564 build_array_ref (tree array, tree idx, location_t loc)
2570 error_at (loc, "subscript missing in array reference");
2571 return error_mark_node;
2574 if (TREE_TYPE (array) == error_mark_node
2575 || TREE_TYPE (idx) == error_mark_node)
2576 return error_mark_node;
2578 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2580 switch (TREE_CODE (array))
2584 tree value = build_array_ref (TREE_OPERAND (array, 1), idx, loc);
2585 ret = build2 (COMPOUND_EXPR, TREE_TYPE (value),
2586 TREE_OPERAND (array, 0), value);
2587 SET_EXPR_LOCATION (ret, loc);
2592 ret = build_conditional_expr
2593 (TREE_OPERAND (array, 0),
2594 build_array_ref (TREE_OPERAND (array, 1), idx, loc),
2595 build_array_ref (TREE_OPERAND (array, 2), idx, loc),
2596 tf_warning_or_error);
2597 protected_set_expr_location (ret, loc);
2604 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2608 warn_array_subscript_with_type_char (idx);
2610 if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (idx)))
2612 error_at (loc, "array subscript is not an integer");
2613 return error_mark_node;
2616 /* Apply integral promotions *after* noticing character types.
2617 (It is unclear why we do these promotions -- the standard
2618 does not say that we should. In fact, the natural thing would
2619 seem to be to convert IDX to ptrdiff_t; we're performing
2620 pointer arithmetic.) */
2621 idx = perform_integral_promotions (idx);
2623 /* An array that is indexed by a non-constant
2624 cannot be stored in a register; we must be able to do
2625 address arithmetic on its address.
2626 Likewise an array of elements of variable size. */
2627 if (TREE_CODE (idx) != INTEGER_CST
2628 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2629 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))))
2632 if (!cxx_mark_addressable (array))
2633 return error_mark_node;
2636 /* An array that is indexed by a constant value which is not within
2637 the array bounds cannot be stored in a register either; because we
2638 would get a crash in store_bit_field/extract_bit_field when trying
2639 to access a non-existent part of the register. */
2640 if (TREE_CODE (idx) == INTEGER_CST
2641 && TYPE_DOMAIN (TREE_TYPE (array))
2642 && ! int_fits_type_p (idx, TYPE_DOMAIN (TREE_TYPE (array))))
2644 if (!cxx_mark_addressable (array))
2645 return error_mark_node;
2648 if (!lvalue_p (array))
2649 pedwarn (loc, OPT_pedantic,
2650 "ISO C++ forbids subscripting non-lvalue array");
2652 /* Note in C++ it is valid to subscript a `register' array, since
2653 it is valid to take the address of something with that
2654 storage specification. */
2658 while (TREE_CODE (foo) == COMPONENT_REF)
2659 foo = TREE_OPERAND (foo, 0);
2660 if (TREE_CODE (foo) == VAR_DECL && DECL_REGISTER (foo))
2661 warning_at (loc, OPT_Wextra,
2662 "subscripting array declared %<register%>");
2665 type = TREE_TYPE (TREE_TYPE (array));
2666 rval = build4 (ARRAY_REF, type, array, idx, NULL_TREE, NULL_TREE);
2667 /* Array ref is const/volatile if the array elements are
2668 or if the array is.. */
2669 TREE_READONLY (rval)
2670 |= (CP_TYPE_CONST_P (type) | TREE_READONLY (array));
2671 TREE_SIDE_EFFECTS (rval)
2672 |= (CP_TYPE_VOLATILE_P (type) | TREE_SIDE_EFFECTS (array));
2673 TREE_THIS_VOLATILE (rval)
2674 |= (CP_TYPE_VOLATILE_P (type) | TREE_THIS_VOLATILE (array));
2675 ret = require_complete_type (fold_if_not_in_template (rval));
2676 protected_set_expr_location (ret, loc);
2681 tree ar = default_conversion (array);
2682 tree ind = default_conversion (idx);
2684 /* Put the integer in IND to simplify error checking. */
2685 if (TREE_CODE (TREE_TYPE (ar)) == INTEGER_TYPE)
2692 if (ar == error_mark_node)
2695 if (TREE_CODE (TREE_TYPE (ar)) != POINTER_TYPE)
2697 error_at (loc, "subscripted value is neither array nor pointer");
2698 return error_mark_node;
2700 if (TREE_CODE (TREE_TYPE (ind)) != INTEGER_TYPE)
2702 error_at (loc, "array subscript is not an integer");
2703 return error_mark_node;
2706 warn_array_subscript_with_type_char (idx);
2708 ret = cp_build_indirect_ref (cp_build_binary_op (input_location,
2710 tf_warning_or_error),
2712 tf_warning_or_error);
2713 protected_set_expr_location (ret, loc);
2718 /* Resolve a pointer to member function. INSTANCE is the object
2719 instance to use, if the member points to a virtual member.
2721 This used to avoid checking for virtual functions if basetype
2722 has no virtual functions, according to an earlier ANSI draft.
2723 With the final ISO C++ rules, such an optimization is
2724 incorrect: A pointer to a derived member can be static_cast
2725 to pointer-to-base-member, as long as the dynamic object
2726 later has the right member. */
2729 get_member_function_from_ptrfunc (tree *instance_ptrptr, tree function)
2731 if (TREE_CODE (function) == OFFSET_REF)
2732 function = TREE_OPERAND (function, 1);
2734 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function)))
2736 tree idx, delta, e1, e2, e3, vtbl, basetype;
2737 tree fntype = TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function));
2739 tree instance_ptr = *instance_ptrptr;
2740 tree instance_save_expr = 0;
2741 if (instance_ptr == error_mark_node)
2743 if (TREE_CODE (function) == PTRMEM_CST)
2745 /* Extracting the function address from a pmf is only
2746 allowed with -Wno-pmf-conversions. It only works for
2748 e1 = build_addr_func (PTRMEM_CST_MEMBER (function));
2749 e1 = convert (fntype, e1);
2754 error ("object missing in use of %qE", function);
2755 return error_mark_node;
2759 if (TREE_SIDE_EFFECTS (instance_ptr))
2760 instance_ptr = instance_save_expr = save_expr (instance_ptr);
2762 if (TREE_SIDE_EFFECTS (function))
2763 function = save_expr (function);
2765 /* Start by extracting all the information from the PMF itself. */
2766 e3 = pfn_from_ptrmemfunc (function);
2767 delta = delta_from_ptrmemfunc (function);
2768 idx = build1 (NOP_EXPR, vtable_index_type, e3);
2769 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
2771 case ptrmemfunc_vbit_in_pfn:
2772 e1 = cp_build_binary_op (input_location,
2773 BIT_AND_EXPR, idx, integer_one_node,
2774 tf_warning_or_error);
2775 idx = cp_build_binary_op (input_location,
2776 MINUS_EXPR, idx, integer_one_node,
2777 tf_warning_or_error);
2780 case ptrmemfunc_vbit_in_delta:
2781 e1 = cp_build_binary_op (input_location,
2782 BIT_AND_EXPR, delta, integer_one_node,
2783 tf_warning_or_error);
2784 delta = cp_build_binary_op (input_location,
2785 RSHIFT_EXPR, delta, integer_one_node,
2786 tf_warning_or_error);
2793 /* Convert down to the right base before using the instance. A
2794 special case is that in a pointer to member of class C, C may
2795 be incomplete. In that case, the function will of course be
2796 a member of C, and no conversion is required. In fact,
2797 lookup_base will fail in that case, because incomplete
2798 classes do not have BINFOs. */
2799 basetype = TYPE_METHOD_BASETYPE (TREE_TYPE (fntype));
2800 if (!same_type_ignoring_top_level_qualifiers_p
2801 (basetype, TREE_TYPE (TREE_TYPE (instance_ptr))))
2803 basetype = lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr)),
2804 basetype, ba_check, NULL);
2805 instance_ptr = build_base_path (PLUS_EXPR, instance_ptr, basetype,
2807 if (instance_ptr == error_mark_node)
2808 return error_mark_node;
2810 /* ...and then the delta in the PMF. */
2811 instance_ptr = build2 (POINTER_PLUS_EXPR, TREE_TYPE (instance_ptr),
2812 instance_ptr, fold_convert (sizetype, delta));
2814 /* Hand back the adjusted 'this' argument to our caller. */
2815 *instance_ptrptr = instance_ptr;
2817 /* Next extract the vtable pointer from the object. */
2818 vtbl = build1 (NOP_EXPR, build_pointer_type (vtbl_ptr_type_node),
2820 vtbl = cp_build_indirect_ref (vtbl, NULL, tf_warning_or_error);
2821 /* If the object is not dynamic the access invokes undefined
2822 behavior. As it is not executed in this case silence the
2823 spurious warnings it may provoke. */
2824 TREE_NO_WARNING (vtbl) = 1;
2826 /* Finally, extract the function pointer from the vtable. */
2827 e2 = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (vtbl), vtbl,
2828 fold_convert (sizetype, idx));
2829 e2 = cp_build_indirect_ref (e2, NULL, tf_warning_or_error);
2830 TREE_CONSTANT (e2) = 1;
2832 /* When using function descriptors, the address of the
2833 vtable entry is treated as a function pointer. */
2834 if (TARGET_VTABLE_USES_DESCRIPTORS)
2835 e2 = build1 (NOP_EXPR, TREE_TYPE (e2),
2836 cp_build_unary_op (ADDR_EXPR, e2, /*noconvert=*/1,
2837 tf_warning_or_error));
2839 e2 = fold_convert (TREE_TYPE (e3), e2);
2840 e1 = build_conditional_expr (e1, e2, e3, tf_warning_or_error);
2842 /* Make sure this doesn't get evaluated first inside one of the
2843 branches of the COND_EXPR. */
2844 if (instance_save_expr)
2845 e1 = build2 (COMPOUND_EXPR, TREE_TYPE (e1),
2846 instance_save_expr, e1);
2853 /* Used by the C-common bits. */
2855 build_function_call (tree function, tree params)
2857 return cp_build_function_call (function, params, tf_warning_or_error);
2860 /* Used by the C-common bits. */
2862 build_function_call_vec (tree function, VEC(tree,gc) *params,
2863 VEC(tree,gc) *origtypes ATTRIBUTE_UNUSED)
2870 /* FIXME: Should just change cp_build_function_call to use a
2874 for (i = 0; VEC_iterate (tree, params, i, t); ++i)
2876 *pp = build_tree_list (NULL, t);
2877 pp = &TREE_CHAIN (*pp);
2879 return cp_build_function_call (function, p, tf_warning_or_error);
2883 cp_build_function_call (tree function, tree params, tsubst_flags_t complain)
2885 tree fntype, fndecl;
2886 tree name = NULL_TREE;
2888 tree original = function;
2889 int nargs, parm_types_len;
2893 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2894 expressions, like those used for ObjC messenger dispatches. */
2895 if (params != NULL_TREE)
2896 function = objc_rewrite_function_call (function, TREE_VALUE (params));
2898 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2899 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2900 if (TREE_CODE (function) == NOP_EXPR
2901 && TREE_TYPE (function) == TREE_TYPE (TREE_OPERAND (function, 0)))
2902 function = TREE_OPERAND (function, 0);
2904 if (TREE_CODE (function) == FUNCTION_DECL)
2906 name = DECL_NAME (function);
2908 mark_used (function);
2911 /* Convert anything with function type to a pointer-to-function. */
2912 if (DECL_MAIN_P (function) && (complain & tf_error))
2913 pedwarn (input_location, OPT_pedantic,
2914 "ISO C++ forbids calling %<::main%> from within program");
2916 function = build_addr_func (function);
2922 function = build_addr_func (function);
2925 if (function == error_mark_node)
2926 return error_mark_node;
2928 fntype = TREE_TYPE (function);
2930 if (TYPE_PTRMEMFUNC_P (fntype))
2932 if (complain & tf_error)
2933 error ("must use %<.*%> or %<->*%> to call pointer-to-member "
2934 "function in %<%E (...)%>, e.g. %<(... ->* %E) (...)%>",
2935 original, original);
2936 return error_mark_node;
2939 is_method = (TREE_CODE (fntype) == POINTER_TYPE
2940 && TREE_CODE (TREE_TYPE (fntype)) == METHOD_TYPE);
2942 if (!((TREE_CODE (fntype) == POINTER_TYPE
2943 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE)
2945 || TREE_CODE (function) == TEMPLATE_ID_EXPR))
2947 if (complain & tf_error)
2948 error ("%qE cannot be used as a function", original);
2949 return error_mark_node;
2952 /* fntype now gets the type of function pointed to. */
2953 fntype = TREE_TYPE (fntype);
2954 parm_types = TYPE_ARG_TYPES (fntype);
2956 /* Allocate storage for converted arguments. */
2957 parm_types_len = list_length (parm_types);
2958 nargs = list_length (params);
2959 if (parm_types_len > nargs)
2960 nargs = parm_types_len;
2961 argarray = (tree *) alloca (nargs * sizeof (tree));
2963 /* Convert the parameters to the types declared in the
2964 function prototype, or apply default promotions. */
2965 nargs = convert_arguments (nargs, argarray, parm_types,
2966 params, fndecl, LOOKUP_NORMAL,
2969 return error_mark_node;
2971 /* Check for errors in format strings and inappropriately
2973 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2976 return build_cxx_call (function, nargs, argarray);
2979 /* Convert the actual parameter expressions in the list VALUES
2980 to the types in the list TYPELIST.
2981 If parmdecls is exhausted, or when an element has NULL as its type,
2982 perform the default conversions.
2984 Store the converted arguments in ARGARRAY. NARGS is the size of this array.
2986 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2988 This is also where warnings about wrong number of args are generated.
2990 Returns the actual number of arguments processed (which might be less
2991 than NARGS), or -1 on error.
2993 VALUES is a chain of TREE_LIST nodes with the elements of the list
2994 in the TREE_VALUE slots of those nodes.
2996 In C++, unspecified trailing parameters can be filled in with their
2997 default arguments, if such were specified. Do so here. */
3000 convert_arguments (int nargs, tree *argarray,
3001 tree typelist, tree values, tree fndecl, int flags,
3002 tsubst_flags_t complain)
3004 tree typetail, valtail;
3005 const char *called_thing = 0;
3008 /* Argument passing is always copy-initialization. */
3009 flags |= LOOKUP_ONLYCONVERTING;
3013 if (TREE_CODE (TREE_TYPE (fndecl)) == METHOD_TYPE)
3015 if (DECL_NAME (fndecl) == NULL_TREE
3016 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl)))
3017 called_thing = "constructor";
3019 called_thing = "member function";
3022 called_thing = "function";
3025 for (valtail = values, typetail = typelist;
3027 valtail = TREE_CHAIN (valtail), i++)
3029 tree type = typetail ? TREE_VALUE (typetail) : 0;
3030 tree val = TREE_VALUE (valtail);
3032 if (val == error_mark_node || type == error_mark_node)
3035 if (type == void_type_node)
3037 if (complain & tf_error)
3041 error ("too many arguments to %s %q+#D",
3042 called_thing, fndecl);
3043 error ("at this point in file");
3046 error ("too many arguments to function");
3053 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3054 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3055 if (TREE_CODE (val) == NOP_EXPR
3056 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0))
3057 && (type == 0 || TREE_CODE (type) != REFERENCE_TYPE))
3058 val = TREE_OPERAND (val, 0);
3060 if (type == 0 || TREE_CODE (type) != REFERENCE_TYPE)
3062 if (TREE_CODE (TREE_TYPE (val)) == ARRAY_TYPE
3063 || TREE_CODE (TREE_TYPE (val)) == FUNCTION_TYPE
3064 || TREE_CODE (TREE_TYPE (val)) == METHOD_TYPE)
3065 val = decay_conversion (val);
3068 if (val == error_mark_node)
3073 /* Formal parm type is specified by a function prototype. */
3076 if (!COMPLETE_TYPE_P (complete_type (type)))
3078 if (complain & tf_error)
3081 error ("parameter %P of %qD has incomplete type %qT",
3084 error ("parameter %P has incomplete type %qT", i, type);
3086 parmval = error_mark_node;
3090 parmval = convert_for_initialization
3091 (NULL_TREE, type, val, flags,
3092 "argument passing", fndecl, i, complain);
3093 parmval = convert_for_arg_passing (type, parmval);
3096 if (parmval == error_mark_node)
3099 argarray[i] = parmval;
3103 if (fndecl && DECL_BUILT_IN (fndecl)
3104 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_CONSTANT_P)
3105 /* Don't do ellipsis conversion for __built_in_constant_p
3106 as this will result in spurious warnings for non-POD
3108 val = require_complete_type (val);
3110 val = convert_arg_to_ellipsis (val);
3116 typetail = TREE_CHAIN (typetail);
3119 if (typetail != 0 && typetail != void_list_node)
3121 /* See if there are default arguments that can be used. Because
3122 we hold default arguments in the FUNCTION_TYPE (which is so
3123 wrong), we can see default parameters here from deduced
3124 contexts (and via typeof) for indirect function calls.
3125 Fortunately we know whether we have a function decl to
3126 provide default arguments in a language conformant
3128 if (fndecl && TREE_PURPOSE (typetail)
3129 && TREE_CODE (TREE_PURPOSE (typetail)) != DEFAULT_ARG)
3131 for (; typetail != void_list_node; ++i)
3134 = convert_default_arg (TREE_VALUE (typetail),
3135 TREE_PURPOSE (typetail),
3138 if (parmval == error_mark_node)
3141 argarray[i] = parmval;
3142 typetail = TREE_CHAIN (typetail);
3143 /* ends with `...'. */
3144 if (typetail == NULL_TREE)
3150 if (complain & tf_error)
3154 error ("too few arguments to %s %q+#D",
3155 called_thing, fndecl);
3156 error ("at this point in file");
3159 error ("too few arguments to function");
3165 gcc_assert (i <= nargs);
3169 /* Build a binary-operation expression, after performing default
3170 conversions on the operands. CODE is the kind of expression to
3171 build. ARG1 and ARG2 are the arguments. ARG1_CODE and ARG2_CODE
3172 are the tree codes which correspond to ARG1 and ARG2 when issuing
3173 warnings about possibly misplaced parentheses. They may differ
3174 from the TREE_CODE of ARG1 and ARG2 if the parser has done constant
3175 folding (e.g., if the parser sees "a | 1 + 1", it may call this
3176 routine with ARG2 being an INTEGER_CST and ARG2_CODE == PLUS_EXPR).
3177 To avoid issuing any parentheses warnings, pass ARG1_CODE and/or
3178 ARG2_CODE as ERROR_MARK. */
3181 build_x_binary_op (enum tree_code code, tree arg1, enum tree_code arg1_code,
3182 tree arg2, enum tree_code arg2_code, bool *overloaded_p,
3183 tsubst_flags_t complain)
3192 if (processing_template_decl)
3194 if (type_dependent_expression_p (arg1)
3195 || type_dependent_expression_p (arg2))
3196 return build_min_nt (code, arg1, arg2);
3197 arg1 = build_non_dependent_expr (arg1);
3198 arg2 = build_non_dependent_expr (arg2);
3201 if (code == DOTSTAR_EXPR)
3202 expr = build_m_component_ref (arg1, arg2);
3204 expr = build_new_op (code, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3205 overloaded_p, complain);
3207 /* Check for cases such as x+y<<z which users are likely to
3208 misinterpret. But don't warn about obj << x + y, since that is a
3209 common idiom for I/O. */
3210 if (warn_parentheses
3211 && !processing_template_decl
3212 && !error_operand_p (arg1)
3213 && !error_operand_p (arg2)
3214 && (code != LSHIFT_EXPR
3215 || !CLASS_TYPE_P (TREE_TYPE (arg1))))
3216 warn_about_parentheses (code, arg1_code, orig_arg1, arg2_code, orig_arg2);
3218 if (processing_template_decl && expr != error_mark_node)
3219 return build_min_non_dep (code, expr, orig_arg1, orig_arg2);
3224 /* Build and return an ARRAY_REF expression. */
3227 build_x_array_ref (tree arg1, tree arg2, tsubst_flags_t complain)
3229 tree orig_arg1 = arg1;
3230 tree orig_arg2 = arg2;
3233 if (processing_template_decl)
3235 if (type_dependent_expression_p (arg1)
3236 || type_dependent_expression_p (arg2))
3237 return build_min_nt (ARRAY_REF, arg1, arg2,
3238 NULL_TREE, NULL_TREE);
3239 arg1 = build_non_dependent_expr (arg1);
3240 arg2 = build_non_dependent_expr (arg2);
3243 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, arg1, arg2, NULL_TREE,
3244 /*overloaded_p=*/NULL, complain);
3246 if (processing_template_decl && expr != error_mark_node)
3247 return build_min_non_dep (ARRAY_REF, expr, orig_arg1, orig_arg2,
3248 NULL_TREE, NULL_TREE);
3252 /* For the c-common bits. */
3254 build_binary_op (location_t location, enum tree_code code, tree op0, tree op1,
3255 int convert_p ATTRIBUTE_UNUSED)
3257 return cp_build_binary_op (location, code, op0, op1, tf_warning_or_error);
3261 /* Build a binary-operation expression without default conversions.
3262 CODE is the kind of expression to build.
3263 LOCATION is the location_t of the operator in the source code.
3264 This function differs from `build' in several ways:
3265 the data type of the result is computed and recorded in it,
3266 warnings are generated if arg data types are invalid,
3267 special handling for addition and subtraction of pointers is known,
3268 and some optimization is done (operations on narrow ints
3269 are done in the narrower type when that gives the same result).
3270 Constant folding is also done before the result is returned.
3272 Note that the operands will never have enumeral types
3273 because either they have just had the default conversions performed
3274 or they have both just been converted to some other type in which
3275 the arithmetic is to be done.
3277 C++: must do special pointer arithmetic when implementing
3278 multiple inheritance, and deal with pointer to member functions. */
3281 cp_build_binary_op (location_t location,
3282 enum tree_code code, tree orig_op0, tree orig_op1,
3283 tsubst_flags_t complain)
3286 enum tree_code code0, code1;
3288 const char *invalid_op_diag;
3290 /* Expression code to give to the expression when it is built.
3291 Normally this is CODE, which is what the caller asked for,
3292 but in some special cases we change it. */
3293 enum tree_code resultcode = code;
3295 /* Data type in which the computation is to be performed.
3296 In the simplest cases this is the common type of the arguments. */
3297 tree result_type = NULL;
3299 /* Nonzero means operands have already been type-converted
3300 in whatever way is necessary.
3301 Zero means they need to be converted to RESULT_TYPE. */
3304 /* Nonzero means create the expression with this type, rather than
3306 tree build_type = 0;
3308 /* Nonzero means after finally constructing the expression
3309 convert it to this type. */
3310 tree final_type = 0;
3314 /* Nonzero if this is an operation like MIN or MAX which can
3315 safely be computed in short if both args are promoted shorts.
3316 Also implies COMMON.
3317 -1 indicates a bitwise operation; this makes a difference
3318 in the exact conditions for when it is safe to do the operation
3319 in a narrower mode. */
3322 /* Nonzero if this is a comparison operation;
3323 if both args are promoted shorts, compare the original shorts.
3324 Also implies COMMON. */
3325 int short_compare = 0;
3327 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3330 /* True if both operands have arithmetic type. */
3331 bool arithmetic_types_p;
3333 /* Apply default conversions. */
3337 if (code == TRUTH_AND_EXPR || code == TRUTH_ANDIF_EXPR
3338 || code == TRUTH_OR_EXPR || code == TRUTH_ORIF_EXPR
3339 || code == TRUTH_XOR_EXPR)
3341 if (!really_overloaded_fn (op0))
3342 op0 = decay_conversion (op0);
3343 if (!really_overloaded_fn (op1))
3344 op1 = decay_conversion (op1);
3348 if (!really_overloaded_fn (op0))
3349 op0 = default_conversion (op0);
3350 if (!really_overloaded_fn (op1))
3351 op1 = default_conversion (op1);
3354 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3355 STRIP_TYPE_NOPS (op0);
3356 STRIP_TYPE_NOPS (op1);
3358 /* DTRT if one side is an overloaded function, but complain about it. */
3359 if (type_unknown_p (op0))
3361 tree t = instantiate_type (TREE_TYPE (op1), op0, tf_none);
3362 if (t != error_mark_node)
3364 if (complain & tf_error)
3365 permerror (input_location, "assuming cast to type %qT from overloaded function",
3370 if (type_unknown_p (op1))
3372 tree t = instantiate_type (TREE_TYPE (op0), op1, tf_none);
3373 if (t != error_mark_node)
3375 if (complain & tf_error)
3376 permerror (input_location, "assuming cast to type %qT from overloaded function",
3382 type0 = TREE_TYPE (op0);
3383 type1 = TREE_TYPE (op1);
3385 /* The expression codes of the data types of the arguments tell us
3386 whether the arguments are integers, floating, pointers, etc. */
3387 code0 = TREE_CODE (type0);
3388 code1 = TREE_CODE (type1);
3390 /* If an error was already reported for one of the arguments,
3391 avoid reporting another error. */
3393 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
3394 return error_mark_node;
3396 if ((invalid_op_diag
3397 = targetm.invalid_binary_op (code, type0, type1)))
3399 error (invalid_op_diag);
3400 return error_mark_node;
3406 /* Subtraction of two similar pointers.
3407 We must subtract them as integers, then divide by object size. */
3408 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
3409 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (type0),
3411 return pointer_diff (op0, op1, common_pointer_type (type0, type1));
3412 /* In all other cases except pointer - int, the usual arithmetic
3414 else if (!(code0 == POINTER_TYPE && code1 == INTEGER_TYPE))
3419 /* The pointer - int case is just like pointer + int; fall
3422 if ((code0 == POINTER_TYPE || code1 == POINTER_TYPE)
3423 && (code0 == INTEGER_TYPE || code1 == INTEGER_TYPE))
3427 ptr_operand = ((code0 == POINTER_TYPE) ? op0 : op1);
3428 int_operand = ((code0 == INTEGER_TYPE) ? op0 : op1);
3429 if (processing_template_decl)
3431 result_type = TREE_TYPE (ptr_operand);
3434 return cp_pointer_int_sum (code,
3445 case TRUNC_DIV_EXPR:
3447 case FLOOR_DIV_EXPR:
3448 case ROUND_DIV_EXPR:
3449 case EXACT_DIV_EXPR:
3450 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3451 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
3452 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3453 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
3455 enum tree_code tcode0 = code0, tcode1 = code1;
3457 warn_for_div_by_zero (location, op1);
3459 if (tcode0 == COMPLEX_TYPE || tcode0 == VECTOR_TYPE)
3460 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
3461 if (tcode1 == COMPLEX_TYPE || tcode1 == VECTOR_TYPE)
3462 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
3464 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
3465 resultcode = RDIV_EXPR;
3467 /* When dividing two signed integers, we have to promote to int.
3468 unless we divide by a constant != -1. Note that default
3469 conversion will have been performed on the operands at this
3470 point, so we have to dig out the original type to find out if
3472 shorten = ((TREE_CODE (op0) == NOP_EXPR
3473 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3474 || (TREE_CODE (op1) == INTEGER_CST
3475 && ! integer_all_onesp (op1)));
3484 if ((code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3485 || (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
3486 && !VECTOR_FLOAT_TYPE_P (type0)
3487 && !VECTOR_FLOAT_TYPE_P (type1)))
3491 case TRUNC_MOD_EXPR:
3492 case FLOOR_MOD_EXPR:
3493 warn_for_div_by_zero (location, op1);
3495 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3497 /* Although it would be tempting to shorten always here, that loses
3498 on some targets, since the modulo instruction is undefined if the
3499 quotient can't be represented in the computation mode. We shorten
3500 only if unsigned or if dividing by something we know != -1. */
3501 shorten = ((TREE_CODE (op0) == NOP_EXPR
3502 && TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0, 0))))
3503 || (TREE_CODE (op1) == INTEGER_CST
3504 && ! integer_all_onesp (op1)));
3509 case TRUTH_ANDIF_EXPR:
3510 case TRUTH_ORIF_EXPR:
3511 case TRUTH_AND_EXPR:
3513 result_type = boolean_type_node;
3516 /* Shift operations: result has same type as first operand;
3517 always convert second operand to int.
3518 Also set SHORT_SHIFT if shifting rightward. */
3521 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3523 result_type = type0;
3524 if (TREE_CODE (op1) == INTEGER_CST)
3526 if (tree_int_cst_lt (op1, integer_zero_node))
3528 if (complain & tf_warning)
3529 warning (0, "right shift count is negative");
3533 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0
3534 && (complain & tf_warning))
3535 warning (0, "right shift count >= width of type");
3538 /* Convert the shift-count to an integer, regardless of
3539 size of value being shifted. */
3540 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3541 op1 = cp_convert (integer_type_node, op1);
3542 /* Avoid converting op1 to result_type later. */
3548 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3550 result_type = type0;
3551 if (TREE_CODE (op1) == INTEGER_CST)
3553 if (tree_int_cst_lt (op1, integer_zero_node))
3555 if (complain & tf_warning)
3556 warning (0, "left shift count is negative");
3558 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3560 if (complain & tf_warning)
3561 warning (0, "left shift count >= width of type");
3564 /* Convert the shift-count to an integer, regardless of
3565 size of value being shifted. */
3566 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3567 op1 = cp_convert (integer_type_node, op1);
3568 /* Avoid converting op1 to result_type later. */
3575 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
3577 result_type = type0;
3578 if (TREE_CODE (op1) == INTEGER_CST)
3580 if (tree_int_cst_lt (op1, integer_zero_node))
3582 if (complain & tf_warning)
3583 warning (0, (code == LROTATE_EXPR)
3584 ? G_("left rotate count is negative")
3585 : G_("right rotate count is negative"));
3587 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
3589 if (complain & tf_warning)
3590 warning (0, (code == LROTATE_EXPR)
3591 ? G_("left rotate count >= width of type")
3592 : G_("right rotate count >= width of type"));
3595 /* Convert the shift-count to an integer, regardless of
3596 size of value being shifted. */
3597 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
3598 op1 = cp_convert (integer_type_node, op1);
3604 if ((complain & tf_warning)
3605 && (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1)))
3606 warning (OPT_Wfloat_equal,
3607 "comparing floating point with == or != is unsafe");
3608 if ((complain & tf_warning)
3609 && ((TREE_CODE (orig_op0) == STRING_CST && !integer_zerop (op1))
3610 || (TREE_CODE (orig_op1) == STRING_CST && !integer_zerop (op0))))
3611 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3613 build_type = boolean_type_node;
3614 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
3615 || code0 == COMPLEX_TYPE)
3616 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3617 || code1 == COMPLEX_TYPE))
3619 else if ((code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3620 || (TYPE_PTRMEM_P (type0) && TYPE_PTRMEM_P (type1)))
3621 result_type = composite_pointer_type (type0, type1, op0, op1,
3622 "comparison", complain);
3623 else if ((code0 == POINTER_TYPE || TYPE_PTRMEM_P (type0))
3624 && null_ptr_cst_p (op1))
3626 if (TREE_CODE (op0) == ADDR_EXPR
3627 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
3629 if (complain & tf_warning)
3630 warning (OPT_Waddress, "the address of %qD will never be NULL",
3631 TREE_OPERAND (op0, 0));
3633 result_type = type0;
3635 else if ((code1 == POINTER_TYPE || TYPE_PTRMEM_P (type1))
3636 && null_ptr_cst_p (op0))
3638 if (TREE_CODE (op1) == ADDR_EXPR
3639 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
3641 if (complain & tf_warning)
3642 warning (OPT_Waddress, "the address of %qD will never be NULL",
3643 TREE_OPERAND (op1, 0));
3645 result_type = type1;
3647 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3649 result_type = type0;
3650 if (complain & tf_error)
3651 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3653 return error_mark_node;
3655 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3657 result_type = type1;
3658 if (complain & tf_error)
3659 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3661 return error_mark_node;
3663 else if (TYPE_PTRMEMFUNC_P (type0) && null_ptr_cst_p (op1))
3665 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3666 == ptrmemfunc_vbit_in_delta)
3668 tree pfn0 = pfn_from_ptrmemfunc (op0);
3669 tree delta0 = delta_from_ptrmemfunc (op0);
3670 tree e1 = cp_build_binary_op (location,
3673 fold_convert (TREE_TYPE (pfn0),
3676 tree e2 = cp_build_binary_op (location,
3681 e2 = cp_build_binary_op (location,
3682 EQ_EXPR, e2, integer_zero_node,
3684 op0 = cp_build_binary_op (location,
3685 TRUTH_ANDIF_EXPR, e1, e2,
3687 op1 = cp_convert (TREE_TYPE (op0), integer_one_node);
3691 op0 = build_ptrmemfunc_access_expr (op0, pfn_identifier);
3692 op1 = cp_convert (TREE_TYPE (op0), integer_zero_node);
3694 result_type = TREE_TYPE (op0);
3696 else if (TYPE_PTRMEMFUNC_P (type1) && null_ptr_cst_p (op0))
3697 return cp_build_binary_op (location, code, op1, op0, complain);
3698 else if (TYPE_PTRMEMFUNC_P (type0) && TYPE_PTRMEMFUNC_P (type1))
3701 /* E will be the final comparison. */
3703 /* E1 and E2 are for scratch. */
3711 type = composite_pointer_type (type0, type1, op0, op1, "comparison",
3714 if (!same_type_p (TREE_TYPE (op0), type))
3715 op0 = cp_convert_and_check (type, op0);
3716 if (!same_type_p (TREE_TYPE (op1), type))
3717 op1 = cp_convert_and_check (type, op1);
3719 if (op0 == error_mark_node || op1 == error_mark_node)
3720 return error_mark_node;
3722 if (TREE_SIDE_EFFECTS (op0))
3723 op0 = save_expr (op0);
3724 if (TREE_SIDE_EFFECTS (op1))
3725 op1 = save_expr (op1);
3727 pfn0 = pfn_from_ptrmemfunc (op0);
3728 pfn1 = pfn_from_ptrmemfunc (op1);
3729 delta0 = delta_from_ptrmemfunc (op0);
3730 delta1 = delta_from_ptrmemfunc (op1);
3731 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
3732 == ptrmemfunc_vbit_in_delta)
3737 && ((op0.delta == op1.delta)
3738 || (!op0.pfn && op0.delta & 1 == 0
3739 && op1.delta & 1 == 0))
3741 The reason for the `!op0.pfn' bit is that a NULL
3742 pointer-to-member is any member with a zero PFN and
3743 LSB of the DELTA field is 0. */
3745 e1 = cp_build_binary_op (location, BIT_AND_EXPR,
3749 e1 = cp_build_binary_op (location,
3750 EQ_EXPR, e1, integer_zero_node,
3752 e2 = cp_build_binary_op (location, BIT_AND_EXPR,
3756 e2 = cp_build_binary_op (location,
3757 EQ_EXPR, e2, integer_zero_node,
3759 e1 = cp_build_binary_op (location,
3760 TRUTH_ANDIF_EXPR, e2, e1,
3762 e2 = cp_build_binary_op (location, EQ_EXPR,
3764 fold_convert (TREE_TYPE (pfn0),
3767 e2 = cp_build_binary_op (location,
3768 TRUTH_ANDIF_EXPR, e2, e1, complain);
3769 e1 = cp_build_binary_op (location,
3770 EQ_EXPR, delta0, delta1, complain);
3771 e1 = cp_build_binary_op (location,
3772 TRUTH_ORIF_EXPR, e1, e2, complain);
3779 && (!op0.pfn || op0.delta == op1.delta))
3781 The reason for the `!op0.pfn' bit is that a NULL
3782 pointer-to-member is any member with a zero PFN; the
3783 DELTA field is unspecified. */
3785 e1 = cp_build_binary_op (location,
3786 EQ_EXPR, delta0, delta1, complain);
3787 e2 = cp_build_binary_op (location,
3790 fold_convert (TREE_TYPE (pfn0),
3793 e1 = cp_build_binary_op (location,
3794 TRUTH_ORIF_EXPR, e1, e2, complain);
3796 e2 = build2 (EQ_EXPR, boolean_type_node, pfn0, pfn1);
3797 e = cp_build_binary_op (location,
3798 TRUTH_ANDIF_EXPR, e2, e1, complain);
3799 if (code == EQ_EXPR)
3801 return cp_build_binary_op (location,
3802 EQ_EXPR, e, integer_zero_node, complain);
3806 gcc_assert (!TYPE_PTRMEMFUNC_P (type0)
3807 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0),
3809 gcc_assert (!TYPE_PTRMEMFUNC_P (type1)
3810 || !same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1),
3818 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3819 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3821 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3822 result_type = composite_pointer_type (type0, type1, op0, op1,
3823 "comparison", complain);
3830 if (TREE_CODE (orig_op0) == STRING_CST
3831 || TREE_CODE (orig_op1) == STRING_CST)
3833 if (complain & tf_warning)
3834 warning (OPT_Waddress, "comparison with string literal results in unspecified behaviour");
3837 build_type = boolean_type_node;
3838 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
3839 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
3841 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
3842 result_type = composite_pointer_type (type0, type1, op0, op1,
3843 "comparison", complain);
3844 else if (code0 == POINTER_TYPE && TREE_CODE (op1) == INTEGER_CST
3845 && integer_zerop (op1))
3846 result_type = type0;
3847 else if (code1 == POINTER_TYPE && TREE_CODE (op0) == INTEGER_CST
3848 && integer_zerop (op0))
3849 result_type = type1;
3850 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
3852 result_type = type0;
3853 if (complain & tf_error)
3854 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3856 return error_mark_node;
3858 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
3860 result_type = type1;
3861 if (complain & tf_error)
3862 permerror (input_location, "ISO C++ forbids comparison between pointer and integer");
3864 return error_mark_node;
3868 case UNORDERED_EXPR:
3875 build_type = integer_type_node;
3876 if (code0 != REAL_TYPE || code1 != REAL_TYPE)
3878 if (complain & tf_error)
3879 error ("unordered comparison on non-floating point argument");
3880 return error_mark_node;
3889 if (((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
3890 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3891 || code1 == COMPLEX_TYPE)))
3892 arithmetic_types_p = 1;
3895 arithmetic_types_p = 0;
3896 /* Vector arithmetic is only allowed when both sides are vectors. */
3897 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
3899 if (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
3900 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
3903 binary_op_error (location, code, type0, type1);
3904 return error_mark_node;
3906 arithmetic_types_p = 1;
3909 /* Determine the RESULT_TYPE, if it is not already known. */
3911 && arithmetic_types_p
3912 && (shorten || common || short_compare))
3913 result_type = cp_common_type (type0, type1);
3917 if (complain & tf_error)
3918 error ("invalid operands of types %qT and %qT to binary %qO",
3919 TREE_TYPE (orig_op0), TREE_TYPE (orig_op1), code);
3920 return error_mark_node;
3923 /* If we're in a template, the only thing we need to know is the
3925 if (processing_template_decl)
3927 /* Since the middle-end checks the type when doing a build2, we
3928 need to build the tree in pieces. This built tree will never
3929 get out of the front-end as we replace it when instantiating
3931 tree tmp = build2 (resultcode,
3932 build_type ? build_type : result_type,
3934 TREE_OPERAND (tmp, 0) = op0;
3938 if (arithmetic_types_p)
3940 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
3942 /* For certain operations (which identify themselves by shorten != 0)
3943 if both args were extended from the same smaller type,
3944 do the arithmetic in that type and then extend.
3946 shorten !=0 and !=1 indicates a bitwise operation.
3947 For them, this optimization is safe only if
3948 both args are zero-extended or both are sign-extended.
3949 Otherwise, we might change the result.
3950 E.g., (short)-1 | (unsigned short)-1 is (int)-1
3951 but calculated in (unsigned short) it would be (unsigned short)-1. */
3953 if (shorten && none_complex)
3955 final_type = result_type;
3956 result_type = shorten_binary_op (result_type, op0, op1,
3960 /* Comparison operations are shortened too but differently.
3961 They identify themselves by setting short_compare = 1. */
3965 /* Don't write &op0, etc., because that would prevent op0
3966 from being kept in a register.
3967 Instead, make copies of the our local variables and
3968 pass the copies by reference, then copy them back afterward. */
3969 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
3970 enum tree_code xresultcode = resultcode;
3972 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
3974 return cp_convert (boolean_type_node, val);
3975 op0 = xop0, op1 = xop1;
3977 resultcode = xresultcode;
3980 if ((short_compare || code == MIN_EXPR || code == MAX_EXPR)
3981 && warn_sign_compare
3982 /* Do not warn until the template is instantiated; we cannot
3983 bound the ranges of the arguments until that point. */
3984 && !processing_template_decl
3985 && (complain & tf_warning))
3987 warn_for_sign_compare (location, orig_op0, orig_op1, op0, op1,
3988 result_type, resultcode);
3992 /* Issue warnings about peculiar, but valid, uses of NULL. */
3993 if ((orig_op0 == null_node || orig_op1 == null_node)
3994 /* It's reasonable to use pointer values as operands of &&
3995 and ||, so NULL is no exception. */
3996 && code != TRUTH_ANDIF_EXPR && code != TRUTH_ORIF_EXPR
3997 && ( /* Both are NULL (or 0) and the operation was not a comparison. */
3998 (null_ptr_cst_p (orig_op0) && null_ptr_cst_p (orig_op1)
3999 && code != EQ_EXPR && code != NE_EXPR)
4000 /* Or if one of OP0 or OP1 is neither a pointer nor NULL. */
4001 || (!null_ptr_cst_p (orig_op0) && TREE_CODE (TREE_TYPE (op0)) != POINTER_TYPE)
4002 || (!null_ptr_cst_p (orig_op1) && TREE_CODE (TREE_TYPE (op1)) != POINTER_TYPE))
4003 && (complain & tf_warning))
4004 /* Some sort of arithmetic operation involving NULL was
4005 performed. Note that pointer-difference and pointer-addition
4006 have already been handled above, and so we don't end up here in
4008 warning (OPT_Wpointer_arith, "NULL used in arithmetic");
4011 /* If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
4012 Then the expression will be built.
4013 It will be given type FINAL_TYPE if that is nonzero;
4014 otherwise, it will be given type RESULT_TYPE. */
4017 if (TREE_TYPE (op0) != result_type)
4018 op0 = cp_convert_and_check (result_type, op0);
4019 if (TREE_TYPE (op1) != result_type)
4020 op1 = cp_convert_and_check (result_type, op1);
4022 if (op0 == error_mark_node || op1 == error_mark_node)
4023 return error_mark_node;
4026 if (build_type == NULL_TREE)
4027 build_type = result_type;
4029 result = build2 (resultcode, build_type, op0, op1);
4030 result = fold_if_not_in_template (result);
4031 if (final_type != 0)
4032 result = cp_convert (final_type, result);
4034 if (TREE_OVERFLOW_P (result)
4035 && !TREE_OVERFLOW_P (op0)
4036 && !TREE_OVERFLOW_P (op1))
4037 overflow_warning (result);
4042 /* Return a tree for the sum or difference (RESULTCODE says which)
4043 of pointer PTROP and integer INTOP. */
4046 cp_pointer_int_sum (enum tree_code resultcode, tree ptrop, tree intop)
4048 tree res_type = TREE_TYPE (ptrop);
4050 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
4051 in certain circumstance (when it's valid to do so). So we need
4052 to make sure it's complete. We don't need to check here, if we
4053 can actually complete it at all, as those checks will be done in
4054 pointer_int_sum() anyway. */
4055 complete_type (TREE_TYPE (res_type));
4057 return pointer_int_sum (input_location, resultcode, ptrop,
4058 fold_if_not_in_template (intop));
4061 /* Return a tree for the difference of pointers OP0 and OP1.
4062 The resulting tree has type int. */
4065 pointer_diff (tree op0, tree op1, tree ptrtype)
4068 tree restype = ptrdiff_type_node;
4069 tree target_type = TREE_TYPE (ptrtype);
4071 if (!complete_type_or_else (target_type, NULL_TREE))
4072 return error_mark_node;
4074 if (TREE_CODE (target_type) == VOID_TYPE)
4075 permerror (input_location, "ISO C++ forbids using pointer of type %<void *%> in subtraction");
4076 if (TREE_CODE (target_type) == FUNCTION_TYPE)
4077 permerror (input_location, "ISO C++ forbids using pointer to a function in subtraction");
4078 if (TREE_CODE (target_type) == METHOD_TYPE)
4079 permerror (input_location, "ISO C++ forbids using pointer to a method in subtraction");
4081 /* First do the subtraction as integers;
4082 then drop through to build the divide operator. */
4084 op0 = cp_build_binary_op (input_location,
4086 cp_convert (restype, op0),
4087 cp_convert (restype, op1),
4088 tf_warning_or_error);
4090 /* This generates an error if op1 is a pointer to an incomplete type. */
4091 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1))))
4092 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
4094 op1 = (TYPE_PTROB_P (ptrtype)
4095 ? size_in_bytes (target_type)
4096 : integer_one_node);
4098 /* Do the division. */
4100 result = build2 (EXACT_DIV_EXPR, restype, op0, cp_convert (restype, op1));
4101 return fold_if_not_in_template (result);
4104 /* Construct and perhaps optimize a tree representation
4105 for a unary operation. CODE, a tree_code, specifies the operation
4106 and XARG is the operand. */
4109 build_x_unary_op (enum tree_code code, tree xarg, tsubst_flags_t complain)
4111 tree orig_expr = xarg;
4115 if (processing_template_decl)
4117 if (type_dependent_expression_p (xarg))
4118 return build_min_nt (code, xarg, NULL_TREE);
4120 xarg = build_non_dependent_expr (xarg);
4125 /* [expr.unary.op] says:
4127 The address of an object of incomplete type can be taken.
4129 (And is just the ordinary address operator, not an overloaded
4130 "operator &".) However, if the type is a template
4131 specialization, we must complete the type at this point so that
4132 an overloaded "operator &" will be available if required. */
4133 if (code == ADDR_EXPR
4134 && TREE_CODE (xarg) != TEMPLATE_ID_EXPR
4135 && ((CLASS_TYPE_P (TREE_TYPE (xarg))
4136 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (xarg))))
4137 || (TREE_CODE (xarg) == OFFSET_REF)))
4138 /* Don't look for a function. */;
4140 exp = build_new_op (code, LOOKUP_NORMAL, xarg, NULL_TREE, NULL_TREE,
4141 /*overloaded_p=*/NULL, complain);
4142 if (!exp && code == ADDR_EXPR)
4144 /* A pointer to member-function can be formed only by saying
4146 if (!flag_ms_extensions && TREE_CODE (TREE_TYPE (xarg)) == METHOD_TYPE
4147 && (TREE_CODE (xarg) != OFFSET_REF || !PTRMEM_OK_P (xarg)))
4149 if (TREE_CODE (xarg) != OFFSET_REF
4150 || !TYPE_P (TREE_OPERAND (xarg, 0)))
4152 error ("invalid use of %qE to form a pointer-to-member-function",
4154 if (TREE_CODE (xarg) != OFFSET_REF)
4155 inform (input_location, " a qualified-id is required");
4156 return error_mark_node;
4160 error ("parentheses around %qE cannot be used to form a"
4161 " pointer-to-member-function",
4163 PTRMEM_OK_P (xarg) = 1;
4167 if (TREE_CODE (xarg) == OFFSET_REF)
4169 ptrmem = PTRMEM_OK_P (xarg);
4171 if (!ptrmem && !flag_ms_extensions
4172 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg, 1))) == METHOD_TYPE)
4174 /* A single non-static member, make sure we don't allow a
4175 pointer-to-member. */
4176 xarg = build2 (OFFSET_REF, TREE_TYPE (xarg),
4177 TREE_OPERAND (xarg, 0),
4178 ovl_cons (TREE_OPERAND (xarg, 1), NULL_TREE));
4179 PTRMEM_OK_P (xarg) = ptrmem;
4182 else if (TREE_CODE (xarg) == TARGET_EXPR && (complain & tf_warning))
4183 warning (0, "taking address of temporary");
4184 exp = cp_build_unary_op (ADDR_EXPR, xarg, 0, complain);
4187 if (processing_template_decl && exp != error_mark_node)
4188 exp = build_min_non_dep (code, exp, orig_expr,
4189 /*For {PRE,POST}{INC,DEC}REMENT_EXPR*/NULL_TREE);
4190 if (TREE_CODE (exp) == ADDR_EXPR)
4191 PTRMEM_OK_P (exp) = ptrmem;
4195 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4196 constants, where a null value is represented by an INTEGER_CST of
4200 cp_truthvalue_conversion (tree expr)
4202 tree type = TREE_TYPE (expr);
4203 if (TYPE_PTRMEM_P (type))
4204 return build_binary_op (EXPR_LOCATION (expr),
4205 NE_EXPR, expr, integer_zero_node, 1);
4207 return c_common_truthvalue_conversion (input_location, expr);
4210 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4213 condition_conversion (tree expr)
4216 if (processing_template_decl)
4218 t = perform_implicit_conversion (boolean_type_node, expr,
4219 tf_warning_or_error);
4220 t = fold_build_cleanup_point_expr (boolean_type_node, t);
4224 /* Return an ADDR_EXPR giving the address of T. This function
4225 attempts no optimizations or simplifications; it is a low-level
4229 build_address (tree t)
4233 if (error_operand_p (t) || !cxx_mark_addressable (t))
4234 return error_mark_node;
4236 addr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (t)), t);
4241 /* Return a NOP_EXPR converting EXPR to TYPE. */
4244 build_nop (tree type, tree expr)
4246 if (type == error_mark_node || error_operand_p (expr))
4248 return build1 (NOP_EXPR, type, expr);
4251 /* C++: Must handle pointers to members.
4253 Perhaps type instantiation should be extended to handle conversion
4254 from aggregates to types we don't yet know we want? (Or are those
4255 cases typically errors which should be reported?)
4257 NOCONVERT nonzero suppresses the default promotions
4258 (such as from short to int). */
4261 cp_build_unary_op (enum tree_code code, tree xarg, int noconvert,
4262 tsubst_flags_t complain)
4264 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4267 const char *errstring = NULL;
4269 const char *invalid_op_diag;
4271 if (error_operand_p (arg))
4272 return error_mark_node;
4274 if ((invalid_op_diag
4275 = targetm.invalid_unary_op ((code == UNARY_PLUS_EXPR
4280 error (invalid_op_diag);
4281 return error_mark_node;
4286 case UNARY_PLUS_EXPR:
4289 int flags = WANT_ARITH | WANT_ENUM;
4290 /* Unary plus (but not unary minus) is allowed on pointers. */
4291 if (code == UNARY_PLUS_EXPR)
4292 flags |= WANT_POINTER;
4293 arg = build_expr_type_conversion (flags, arg, true);
4295 errstring = (code == NEGATE_EXPR
4296 ? "wrong type argument to unary minus"
4297 : "wrong type argument to unary plus");
4300 if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4301 arg = perform_integral_promotions (arg);
4303 /* Make sure the result is not an lvalue: a unary plus or minus
4304 expression is always a rvalue. */
4311 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4315 arg = default_conversion (arg);
4317 else if (!(arg = build_expr_type_conversion (WANT_INT | WANT_ENUM
4320 errstring = "wrong type argument to bit-complement";
4321 else if (!noconvert && CP_INTEGRAL_TYPE_P (TREE_TYPE (arg)))
4322 arg = perform_integral_promotions (arg);
4326 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4327 errstring = "wrong type argument to abs";
4328 else if (!noconvert)
4329 arg = default_conversion (arg);
4333 /* Conjugating a real value is a no-op, but allow it anyway. */
4334 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_ENUM, arg, true)))
4335 errstring = "wrong type argument to conjugation";
4336 else if (!noconvert)
4337 arg = default_conversion (arg);
4340 case TRUTH_NOT_EXPR:
4341 arg = perform_implicit_conversion (boolean_type_node, arg,
4343 val = invert_truthvalue (arg);
4344 if (arg != error_mark_node)
4346 errstring = "in argument to unary !";
4353 if (TREE_CODE (arg) == COMPLEX_CST)
4354 return TREE_REALPART (arg);
4355 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4357 arg = build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4358 return fold_if_not_in_template (arg);
4364 if (TREE_CODE (arg) == COMPLEX_CST)
4365 return TREE_IMAGPART (arg);
4366 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4368 arg = build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
4369 return fold_if_not_in_template (arg);
4372 return cp_convert (TREE_TYPE (arg), integer_zero_node);
4374 case PREINCREMENT_EXPR:
4375 case POSTINCREMENT_EXPR:
4376 case PREDECREMENT_EXPR:
4377 case POSTDECREMENT_EXPR:
4378 /* Handle complex lvalues (when permitted)
4379 by reduction to simpler cases. */
4381 val = unary_complex_lvalue (code, arg);
4385 /* Increment or decrement the real part of the value,
4386 and don't change the imaginary part. */
4387 if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
4391 arg = stabilize_reference (arg);
4392 real = cp_build_unary_op (REALPART_EXPR, arg, 1, complain);
4393 imag = cp_build_unary_op (IMAGPART_EXPR, arg, 1, complain);
4394 real = cp_build_unary_op (code, real, 1, complain);
4395 if (real == error_mark_node || imag == error_mark_node)
4396 return error_mark_node;
4397 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
4401 /* Report invalid types. */
4403 if (!(arg = build_expr_type_conversion (WANT_ARITH | WANT_POINTER,
4406 if (code == PREINCREMENT_EXPR)
4407 errstring ="no pre-increment operator for type";
4408 else if (code == POSTINCREMENT_EXPR)
4409 errstring ="no post-increment operator for type";
4410 else if (code == PREDECREMENT_EXPR)
4411 errstring ="no pre-decrement operator for type";
4413 errstring ="no post-decrement operator for type";
4416 else if (arg == error_mark_node)
4417 return error_mark_node;
4419 /* Report something read-only. */
4421 if (CP_TYPE_CONST_P (TREE_TYPE (arg))
4422 || TREE_READONLY (arg))
4424 if (complain & tf_error)
4425 readonly_error (arg, ((code == PREINCREMENT_EXPR
4426 || code == POSTINCREMENT_EXPR)
4427 ? "increment" : "decrement"));
4429 return error_mark_node;
4434 tree declared_type = unlowered_expr_type (arg);
4436 argtype = TREE_TYPE (arg);
4438 /* ARM $5.2.5 last annotation says this should be forbidden. */
4439 if (TREE_CODE (argtype) == ENUMERAL_TYPE)
4441 if (complain & tf_error)
4442 permerror (input_location, (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
4443 ? G_("ISO C++ forbids incrementing an enum")
4444 : G_("ISO C++ forbids decrementing an enum"));
4446 return error_mark_node;
4449 /* Compute the increment. */
4451 if (TREE_CODE (argtype) == POINTER_TYPE)
4453 tree type = complete_type (TREE_TYPE (argtype));
4455 if (!COMPLETE_OR_VOID_TYPE_P (type))
4457 if (complain & tf_error)
4458 error (((code == PREINCREMENT_EXPR
4459 || code == POSTINCREMENT_EXPR))
4460 ? G_("cannot increment a pointer to incomplete type %qT")
4461 : G_("cannot decrement a pointer to incomplete type %qT"),
4462 TREE_TYPE (argtype));
4464 return error_mark_node;
4466 else if ((pedantic || warn_pointer_arith)
4467 && !TYPE_PTROB_P (argtype))
4469 if (complain & tf_error)
4470 permerror (input_location, (code == PREINCREMENT_EXPR
4471 || code == POSTINCREMENT_EXPR)
4472 ? G_("ISO C++ forbids incrementing a pointer of type %qT")
4473 : G_("ISO C++ forbids decrementing a pointer of type %qT"),
4476 return error_mark_node;
4479 inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));
4482 inc = integer_one_node;
4484 inc = cp_convert (argtype, inc);
4486 /* Complain about anything else that is not a true lvalue. */
4487 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
4488 || code == POSTINCREMENT_EXPR)
4489 ? lv_increment : lv_decrement),
4491 return error_mark_node;
4493 /* Forbid using -- on `bool'. */
4494 if (same_type_p (declared_type, boolean_type_node))
4496 if (code == POSTDECREMENT_EXPR || code == PREDECREMENT_EXPR)
4498 if (complain & tf_error)
4499 error ("invalid use of Boolean expression as operand "
4500 "to %<operator--%>");
4501 return error_mark_node;
4503 val = boolean_increment (code, arg);
4506 val = build2 (code, TREE_TYPE (arg), arg, inc);
4508 TREE_SIDE_EFFECTS (val) = 1;
4513 /* Note that this operation never does default_conversion
4514 regardless of NOCONVERT. */
4516 argtype = lvalue_type (arg);
4518 if (TREE_CODE (arg) == OFFSET_REF)
4521 if (TREE_CODE (argtype) == REFERENCE_TYPE)
4523 tree type = build_pointer_type (TREE_TYPE (argtype));
4524 arg = build1 (CONVERT_EXPR, type, arg);
4527 else if (pedantic && DECL_MAIN_P (arg))
4530 /* Apparently a lot of autoconf scripts for C++ packages do this,
4531 so only complain if -pedantic. */
4532 if (complain & (flag_pedantic_errors ? tf_error : tf_warning))
4533 pedwarn (input_location, OPT_pedantic,
4534 "ISO C++ forbids taking address of function %<::main%>");
4535 else if (flag_pedantic_errors)
4536 return error_mark_node;
4539 /* Let &* cancel out to simplify resulting code. */
4540 if (TREE_CODE (arg) == INDIRECT_REF)
4542 /* We don't need to have `current_class_ptr' wrapped in a
4543 NON_LVALUE_EXPR node. */
4544 if (arg == current_class_ref)
4545 return current_class_ptr;
4547 arg = TREE_OPERAND (arg, 0);
4548 if (TREE_CODE (TREE_TYPE (arg)) == REFERENCE_TYPE)
4550 tree type = build_pointer_type (TREE_TYPE (TREE_TYPE (arg)));
4551 arg = build1 (CONVERT_EXPR, type, arg);
4554 /* Don't let this be an lvalue. */
4559 /* Uninstantiated types are all functions. Taking the
4560 address of a function is a no-op, so just return the
4563 gcc_assert (TREE_CODE (arg) != IDENTIFIER_NODE
4564 || !IDENTIFIER_OPNAME_P (arg));
4566 if (TREE_CODE (arg) == COMPONENT_REF && type_unknown_p (arg)
4567 && !really_overloaded_fn (TREE_OPERAND (arg, 1)))
4569 /* They're trying to take the address of a unique non-static
4570 member function. This is ill-formed (except in MS-land),
4571 but let's try to DTRT.
4572 Note: We only handle unique functions here because we don't
4573 want to complain if there's a static overload; non-unique
4574 cases will be handled by instantiate_type. But we need to
4575 handle this case here to allow casts on the resulting PMF.
4576 We could defer this in non-MS mode, but it's easier to give
4577 a useful error here. */
4579 /* Inside constant member functions, the `this' pointer
4580 contains an extra const qualifier. TYPE_MAIN_VARIANT
4581 is used here to remove this const from the diagnostics
4582 and the created OFFSET_REF. */
4583 tree base = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg, 0)));
4584 tree fn = get_first_fn (TREE_OPERAND (arg, 1));
4587 if (! flag_ms_extensions)
4589 tree name = DECL_NAME (fn);
4590 if (!(complain & tf_error))
4591 return error_mark_node;
4592 else if (current_class_type
4593 && TREE_OPERAND (arg, 0) == current_class_ref)
4594 /* An expression like &memfn. */
4595 permerror (input_location, "ISO C++ forbids taking the address of an unqualified"
4596 " or parenthesized non-static member function to form"
4597 " a pointer to member function. Say %<&%T::%D%>",
4600 permerror (input_location, "ISO C++ forbids taking the address of a bound member"
4601 " function to form a pointer to member function."
4605 arg = build_offset_ref (base, fn, /*address_p=*/true);
4609 if (type_unknown_p (arg))
4610 return build1 (ADDR_EXPR, unknown_type_node, arg);
4612 /* Handle complex lvalues (when permitted)
4613 by reduction to simpler cases. */
4614 val = unary_complex_lvalue (code, arg);
4618 switch (TREE_CODE (arg))
4622 case FIX_TRUNC_EXPR:
4623 /* Even if we're not being pedantic, we cannot allow this
4624 extension when we're instantiating in a SFINAE
4626 if (! lvalue_p (arg) && complain == tf_none)
4628 if (complain & tf_error)
4629 permerror (input_location, "ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4631 return error_mark_node;
4636 arg = BASELINK_FUNCTIONS (arg);
4640 arg = OVL_CURRENT (arg);
4644 /* Turn a reference to a non-static data member into a
4645 pointer-to-member. */
4650 if (!PTRMEM_OK_P (arg))
4651 return cp_build_unary_op (code, arg, 0, complain);
4653 t = TREE_OPERAND (arg, 1);
4654 if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
4656 if (complain & tf_error)
4657 error ("cannot create pointer to reference member %qD", t);
4658 return error_mark_node;
4661 type = build_ptrmem_type (context_for_name_lookup (t),
4663 t = make_ptrmem_cst (type, TREE_OPERAND (arg, 1));
4671 /* Anything not already handled and not a true memory reference
4673 if (TREE_CODE (argtype) != FUNCTION_TYPE
4674 && TREE_CODE (argtype) != METHOD_TYPE
4675 && TREE_CODE (arg) != OFFSET_REF
4676 && !lvalue_or_else (arg, lv_addressof, complain))
4677 return error_mark_node;
4679 if (argtype != error_mark_node)
4680 argtype = build_pointer_type (argtype);
4682 /* In a template, we are processing a non-dependent expression
4683 so we can just form an ADDR_EXPR with the correct type. */
4684 if (processing_template_decl || TREE_CODE (arg) != COMPONENT_REF)
4686 val = build_address (arg);
4687 if (TREE_CODE (arg) == OFFSET_REF)
4688 PTRMEM_OK_P (val) = PTRMEM_OK_P (arg);
4690 else if (TREE_CODE (TREE_OPERAND (arg, 1)) == BASELINK)
4692 tree fn = BASELINK_FUNCTIONS (TREE_OPERAND (arg, 1));
4694 /* We can only get here with a single static member
4696 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
4697 && DECL_STATIC_FUNCTION_P (fn));
4699 val = build_address (fn);
4700 if (TREE_SIDE_EFFECTS (TREE_OPERAND (arg, 0)))
4701 /* Do not lose object's side effects. */
4702 val = build2 (COMPOUND_EXPR, TREE_TYPE (val),
4703 TREE_OPERAND (arg, 0), val);
4705 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)))
4707 if (complain & tf_error)
4708 error ("attempt to take address of bit-field structure member %qD",
4709 TREE_OPERAND (arg, 1));
4710 return error_mark_node;
4714 tree object = TREE_OPERAND (arg, 0);
4715 tree field = TREE_OPERAND (arg, 1);
4716 gcc_assert (same_type_ignoring_top_level_qualifiers_p
4717 (TREE_TYPE (object), decl_type_context (field)));
4718 val = build_address (arg);
4721 if (TREE_CODE (argtype) == POINTER_TYPE
4722 && TREE_CODE (TREE_TYPE (argtype)) == METHOD_TYPE)
4724 build_ptrmemfunc_type (argtype);
4725 val = build_ptrmemfunc (argtype, val, 0,
4726 /*c_cast_p=*/false);
4738 argtype = TREE_TYPE (arg);
4739 return fold_if_not_in_template (build1 (code, argtype, arg));
4742 if (complain & tf_error)
4743 error ("%s", errstring);
4744 return error_mark_node;
4747 /* Hook for the c-common bits that build a unary op. */
4749 build_unary_op (location_t location ATTRIBUTE_UNUSED,
4750 enum tree_code code, tree xarg, int noconvert)
4752 return cp_build_unary_op (code, xarg, noconvert, tf_warning_or_error);
4755 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4756 for certain kinds of expressions which are not really lvalues
4757 but which we can accept as lvalues.
4759 If ARG is not a kind of expression we can handle, return
4763 unary_complex_lvalue (enum tree_code code, tree arg)
4765 /* Inside a template, making these kinds of adjustments is
4766 pointless; we are only concerned with the type of the
4768 if (processing_template_decl)
4771 /* Handle (a, b) used as an "lvalue". */
4772 if (TREE_CODE (arg) == COMPOUND_EXPR)
4774 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 1), 0,
4775 tf_warning_or_error);
4776 return build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4777 TREE_OPERAND (arg, 0), real_result);
4780 /* Handle (a ? b : c) used as an "lvalue". */
4781 if (TREE_CODE (arg) == COND_EXPR
4782 || TREE_CODE (arg) == MIN_EXPR || TREE_CODE (arg) == MAX_EXPR)
4783 return rationalize_conditional_expr (code, arg, tf_warning_or_error);
4785 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4786 if (TREE_CODE (arg) == MODIFY_EXPR
4787 || TREE_CODE (arg) == PREINCREMENT_EXPR
4788 || TREE_CODE (arg) == PREDECREMENT_EXPR)
4790 tree lvalue = TREE_OPERAND (arg, 0);
4791 if (TREE_SIDE_EFFECTS (lvalue))
4793 lvalue = stabilize_reference (lvalue);
4794 arg = build2 (TREE_CODE (arg), TREE_TYPE (arg),
4795 lvalue, TREE_OPERAND (arg, 1));
4797 return unary_complex_lvalue
4798 (code, build2 (COMPOUND_EXPR, TREE_TYPE (lvalue), arg, lvalue));
4801 if (code != ADDR_EXPR)
4804 /* Handle (a = b) used as an "lvalue" for `&'. */
4805 if (TREE_CODE (arg) == MODIFY_EXPR
4806 || TREE_CODE (arg) == INIT_EXPR)
4808 tree real_result = cp_build_unary_op (code, TREE_OPERAND (arg, 0), 0,
4809 tf_warning_or_error);
4810 arg = build2 (COMPOUND_EXPR, TREE_TYPE (real_result),
4812 TREE_NO_WARNING (arg) = 1;
4816 if (TREE_CODE (TREE_TYPE (arg)) == FUNCTION_TYPE
4817 || TREE_CODE (TREE_TYPE (arg)) == METHOD_TYPE
4818 || TREE_CODE (arg) == OFFSET_REF)
4821 /* We permit compiler to make function calls returning
4822 objects of aggregate type look like lvalues. */
4826 if (TREE_CODE (targ) == SAVE_EXPR)
4827 targ = TREE_OPERAND (targ, 0);
4829 if (TREE_CODE (targ) == CALL_EXPR && MAYBE_CLASS_TYPE_P (TREE_TYPE (targ)))
4831 if (TREE_CODE (arg) == SAVE_EXPR)
4834 targ = build_cplus_new (TREE_TYPE (arg), arg);
4835 return build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (arg)), targ);
4838 if (TREE_CODE (arg) == SAVE_EXPR && TREE_CODE (targ) == INDIRECT_REF)
4839 return build3 (SAVE_EXPR, build_pointer_type (TREE_TYPE (arg)),
4840 TREE_OPERAND (targ, 0), current_function_decl, NULL);
4843 /* Don't let anything else be handled specially. */
4847 /* Mark EXP saying that we need to be able to take the
4848 address of it; it should not be allocated in a register.
4849 Value is true if successful.
4851 C++: we do not allow `current_class_ptr' to be addressable. */
4854 cxx_mark_addressable (tree exp)
4859 switch (TREE_CODE (x))
4866 x = TREE_OPERAND (x, 0);
4870 if (x == current_class_ptr)
4872 error ("cannot take the address of %<this%>, which is an rvalue expression");
4873 TREE_ADDRESSABLE (x) = 1; /* so compiler doesn't die later. */
4879 /* Caller should not be trying to mark initialized
4880 constant fields addressable. */
4881 gcc_assert (DECL_LANG_SPECIFIC (x) == 0
4882 || DECL_IN_AGGR_P (x) == 0
4884 || DECL_EXTERNAL (x));
4889 if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
4890 && !DECL_ARTIFICIAL (x))
4892 if (TREE_CODE (x) == VAR_DECL && DECL_HARD_REGISTER (x))
4895 ("address of explicit register variable %qD requested", x);
4898 else if (extra_warnings)
4900 (OPT_Wextra, "address requested for %qD, which is declared %<register%>", x);
4902 TREE_ADDRESSABLE (x) = 1;
4906 TREE_ADDRESSABLE (x) = 1;
4910 TREE_ADDRESSABLE (x) = 1;
4914 TREE_ADDRESSABLE (x) = 1;
4915 cxx_mark_addressable (TREE_OPERAND (x, 0));
4923 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4926 build_x_conditional_expr (tree ifexp, tree op1, tree op2,
4927 tsubst_flags_t complain)
4929 tree orig_ifexp = ifexp;
4930 tree orig_op1 = op1;
4931 tree orig_op2 = op2;
4934 if (processing_template_decl)
4936 /* The standard says that the expression is type-dependent if
4937 IFEXP is type-dependent, even though the eventual type of the
4938 expression doesn't dependent on IFEXP. */
4939 if (type_dependent_expression_p (ifexp)
4940 /* As a GNU extension, the middle operand may be omitted. */
4941 || (op1 && type_dependent_expression_p (op1))
4942 || type_dependent_expression_p (op2))
4943 return build_min_nt (COND_EXPR, ifexp, op1, op2);
4944 ifexp = build_non_dependent_expr (ifexp);
4946 op1 = build_non_dependent_expr (op1);
4947 op2 = build_non_dependent_expr (op2);
4950 expr = build_conditional_expr (ifexp, op1, op2, complain);
4951 if (processing_template_decl && expr != error_mark_node)
4952 return build_min_non_dep (COND_EXPR, expr,
4953 orig_ifexp, orig_op1, orig_op2);
4957 /* Given a list of expressions, return a compound expression
4958 that performs them all and returns the value of the last of them. */
4960 tree build_x_compound_expr_from_list (tree list, const char *msg)
4962 tree expr = TREE_VALUE (list);
4964 if (TREE_CHAIN (list))
4967 permerror (input_location, "%s expression list treated as compound expression", msg);
4969 for (list = TREE_CHAIN (list); list; list = TREE_CHAIN (list))
4970 expr = build_x_compound_expr (expr, TREE_VALUE (list),
4971 tf_warning_or_error);
4977 /* Handle overloading of the ',' operator when needed. */
4980 build_x_compound_expr (tree op1, tree op2, tsubst_flags_t complain)
4983 tree orig_op1 = op1;
4984 tree orig_op2 = op2;
4986 if (processing_template_decl)
4988 if (type_dependent_expression_p (op1)
4989 || type_dependent_expression_p (op2))
4990 return build_min_nt (COMPOUND_EXPR, op1, op2);
4991 op1 = build_non_dependent_expr (op1);
4992 op2 = build_non_dependent_expr (op2);
4995 result = build_new_op (COMPOUND_EXPR, LOOKUP_NORMAL, op1, op2, NULL_TREE,
4996 /*overloaded_p=*/NULL, complain);
4998 result = cp_build_compound_expr (op1, op2, complain);
5000 if (processing_template_decl && result != error_mark_node)
5001 return build_min_non_dep (COMPOUND_EXPR, result, orig_op1, orig_op2);
5006 /* Like cp_build_compound_expr, but for the c-common bits. */
5009 build_compound_expr (tree lhs, tree rhs)
5011 return cp_build_compound_expr (lhs, rhs, tf_warning_or_error);
5014 /* Build a compound expression. */
5017 cp_build_compound_expr (tree lhs, tree rhs, tsubst_flags_t complain)
5019 lhs = convert_to_void (lhs, "left-hand operand of comma", complain);
5021 if (lhs == error_mark_node || rhs == error_mark_node)
5022 return error_mark_node;
5024 if (TREE_CODE (rhs) == TARGET_EXPR)
5026 /* If the rhs is a TARGET_EXPR, then build the compound
5027 expression inside the target_expr's initializer. This
5028 helps the compiler to eliminate unnecessary temporaries. */
5029 tree init = TREE_OPERAND (rhs, 1);
5031 init = build2 (COMPOUND_EXPR, TREE_TYPE (init), lhs, init);
5032 TREE_OPERAND (rhs, 1) = init;
5037 return build2 (COMPOUND_EXPR, TREE_TYPE (rhs), lhs, rhs);
5040 /* Issue a diagnostic message if casting from SRC_TYPE to DEST_TYPE
5041 casts away constness. CAST gives the type of cast.
5043 ??? This function warns for casting away any qualifier not just
5044 const. We would like to specify exactly what qualifiers are casted
5049 check_for_casting_away_constness (tree src_type, tree dest_type,
5050 enum tree_code cast)
5052 /* C-style casts are allowed to cast away constness. With
5053 WARN_CAST_QUAL, we still want to issue a warning. */
5054 if (cast == CAST_EXPR && !warn_cast_qual)
5057 if (!casts_away_constness (src_type, dest_type))
5063 warning (OPT_Wcast_qual,
5064 "cast from type %qT to type %qT casts away qualifiers",
5065 src_type, dest_type);
5068 case STATIC_CAST_EXPR:
5069 error ("static_cast from type %qT to type %qT casts away qualifiers",
5070 src_type, dest_type);
5073 case REINTERPRET_CAST_EXPR:
5074 error ("reinterpret_cast from type %qT to type %qT casts away qualifiers",
5075 src_type, dest_type);
5082 /* Convert EXPR (an expression with pointer-to-member type) to TYPE
5083 (another pointer-to-member type in the same hierarchy) and return
5084 the converted expression. If ALLOW_INVERSE_P is permitted, a
5085 pointer-to-derived may be converted to pointer-to-base; otherwise,
5086 only the other direction is permitted. If C_CAST_P is true, this
5087 conversion is taking place as part of a C-style cast. */
5090 convert_ptrmem (tree type, tree expr, bool allow_inverse_p,
5093 if (TYPE_PTRMEM_P (type))
5097 if (TREE_CODE (expr) == PTRMEM_CST)
5098 expr = cplus_expand_constant (expr);
5099 delta = get_delta_difference (TYPE_PTRMEM_CLASS_TYPE (TREE_TYPE (expr)),
5100 TYPE_PTRMEM_CLASS_TYPE (type),
5103 if (!integer_zerop (delta))
5105 tree cond, op1, op2;
5107 cond = cp_build_binary_op (input_location,
5110 build_int_cst (TREE_TYPE (expr), -1),
5111 tf_warning_or_error);
5112 op1 = build_nop (ptrdiff_type_node, expr);
5113 op2 = cp_build_binary_op (input_location,
5114 PLUS_EXPR, op1, delta,
5115 tf_warning_or_error);
5117 expr = fold_build3 (COND_EXPR, ptrdiff_type_node, cond, op1, op2);
5121 return build_nop (type, expr);
5124 return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr,
5125 allow_inverse_p, c_cast_p);
5128 /* If EXPR is an INTEGER_CST and ORIG is an arithmetic constant, return
5129 a version of EXPR that has TREE_OVERFLOW set if it is set in ORIG.
5130 Otherwise, return EXPR unchanged. */
5133 ignore_overflows (tree expr, tree orig)
5135 if (TREE_CODE (expr) == INTEGER_CST
5136 && CONSTANT_CLASS_P (orig)
5137 && TREE_CODE (orig) != STRING_CST
5138 && TREE_OVERFLOW (expr) != TREE_OVERFLOW (orig))
5140 if (!TREE_OVERFLOW (orig))
5141 /* Ensure constant sharing. */
5142 expr = build_int_cst_wide (TREE_TYPE (expr),
5143 TREE_INT_CST_LOW (expr),
5144 TREE_INT_CST_HIGH (expr));
5147 /* Avoid clobbering a shared constant. */
5148 expr = copy_node (expr);
5149 TREE_OVERFLOW (expr) = TREE_OVERFLOW (orig);
5155 /* Perform a static_cast from EXPR to TYPE. When C_CAST_P is true,
5156 this static_cast is being attempted as one of the possible casts
5157 allowed by a C-style cast. (In that case, accessibility of base
5158 classes is not considered, and it is OK to cast away
5159 constness.) Return the result of the cast. *VALID_P is set to
5160 indicate whether or not the cast was valid. */
5163 build_static_cast_1 (tree type, tree expr, bool c_cast_p,
5164 bool *valid_p, tsubst_flags_t complain)
5170 /* Assume the cast is valid. */
5173 intype = TREE_TYPE (expr);
5175 /* Save casted types in the function's used types hash table. */
5176 used_types_insert (type);
5178 /* [expr.static.cast]
5180 An lvalue of type "cv1 B", where B is a class type, can be cast
5181 to type "reference to cv2 D", where D is a class derived (clause
5182 _class.derived_) from B, if a valid standard conversion from
5183 "pointer to D" to "pointer to B" exists (_conv.ptr_), cv2 is the
5184 same cv-qualification as, or greater cv-qualification than, cv1,
5185 and B is not a virtual base class of D. */
5186 /* We check this case before checking the validity of "TYPE t =
5187 EXPR;" below because for this case:
5190 struct D : public B { D(const B&); };
5192 void f() { static_cast<const D&>(b); }
5194 we want to avoid constructing a new D. The standard is not
5195 completely clear about this issue, but our interpretation is
5196 consistent with other compilers. */
5197 if (TREE_CODE (type) == REFERENCE_TYPE
5198 && CLASS_TYPE_P (TREE_TYPE (type))
5199 && CLASS_TYPE_P (intype)
5200 && real_lvalue_p (expr)
5201 && DERIVED_FROM_P (intype, TREE_TYPE (type))
5202 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT (intype)),
5203 build_pointer_type (TYPE_MAIN_VARIANT
5204 (TREE_TYPE (type))))
5206 || at_least_as_qualified_p (TREE_TYPE (type), intype)))
5210 /* There is a standard conversion from "D*" to "B*" even if "B"
5211 is ambiguous or inaccessible. If this is really a
5212 static_cast, then we check both for inaccessibility and
5213 ambiguity. However, if this is a static_cast being performed
5214 because the user wrote a C-style cast, then accessibility is
5216 base = lookup_base (TREE_TYPE (type), intype,
5217 c_cast_p ? ba_unique : ba_check,
5220 /* Convert from "B*" to "D*". This function will check that "B"
5221 is not a virtual base of "D". */
5222 expr = build_base_path (MINUS_EXPR, build_address (expr),
5223 base, /*nonnull=*/false);
5224 /* Convert the pointer to a reference -- but then remember that
5225 there are no expressions with reference type in C++. */
5226 return convert_from_reference (build_nop (type, expr));
5231 /* [expr.static.cast]
5233 An expression e can be explicitly converted to a type T using a
5234 static_cast of the form static_cast<T>(e) if the declaration T
5235 t(e);" is well-formed, for some invented temporary variable
5237 result = perform_direct_initialization_if_possible (type, expr,
5238 c_cast_p, complain);
5241 result = convert_from_reference (result);
5243 /* Ignore any integer overflow caused by the cast. */
5244 result = ignore_overflows (result, orig);
5246 /* [expr.static.cast]
5248 If T is a reference type, the result is an lvalue; otherwise,
5249 the result is an rvalue. */
5250 if (TREE_CODE (type) != REFERENCE_TYPE)
5251 result = rvalue (result);
5255 /* [expr.static.cast]
5257 Any expression can be explicitly converted to type cv void. */
5258 if (TREE_CODE (type) == VOID_TYPE)
5259 return convert_to_void (expr, /*implicit=*/NULL, complain);
5261 /* [expr.static.cast]
5263 The inverse of any standard conversion sequence (clause _conv_),
5264 other than the lvalue-to-rvalue (_conv.lval_), array-to-pointer
5265 (_conv.array_), function-to-pointer (_conv.func_), and boolean
5266 (_conv.bool_) conversions, can be performed explicitly using
5267 static_cast subject to the restriction that the explicit
5268 conversion does not cast away constness (_expr.const.cast_), and
5269 the following additional rules for specific cases: */
5270 /* For reference, the conversions not excluded are: integral
5271 promotions, floating point promotion, integral conversions,
5272 floating point conversions, floating-integral conversions,
5273 pointer conversions, and pointer to member conversions. */
5276 A value of integral _or enumeration_ type can be explicitly
5277 converted to an enumeration type. */
5278 /* The effect of all that is that any conversion between any two
5279 types which are integral, floating, or enumeration types can be
5281 if ((INTEGRAL_TYPE_P (type) || SCALAR_FLOAT_TYPE_P (type))
5282 && (INTEGRAL_TYPE_P (intype) || SCALAR_FLOAT_TYPE_P (intype)))
5284 expr = ocp_convert (type, expr, CONV_C_CAST, LOOKUP_NORMAL);
5286 /* Ignore any integer overflow caused by the cast. */
5287 expr = ignore_overflows (expr, orig);
5291 if (TYPE_PTR_P (type) && TYPE_PTR_P (intype)
5292 && CLASS_TYPE_P (TREE_TYPE (type))
5293 && CLASS_TYPE_P (TREE_TYPE (intype))
5294 && can_convert (build_pointer_type (TYPE_MAIN_VARIANT
5295 (TREE_TYPE (intype))),
5296 build_pointer_type (TYPE_MAIN_VARIANT
5297 (TREE_TYPE (type)))))
5302 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5303 base = lookup_base (TREE_TYPE (type), TREE_TYPE (intype),
5304 c_cast_p ? ba_unique : ba_check,
5306 return build_base_path (MINUS_EXPR, expr, base, /*nonnull=*/false);
5309 if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5310 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5317 c1 = TYPE_PTRMEM_CLASS_TYPE (intype);
5318 c2 = TYPE_PTRMEM_CLASS_TYPE (type);
5320 if (TYPE_PTRMEM_P (type))
5322 t1 = (build_ptrmem_type
5324 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (intype))));
5325 t2 = (build_ptrmem_type
5327 TYPE_MAIN_VARIANT (TYPE_PTRMEM_POINTED_TO_TYPE (type))));
5334 if (can_convert (t1, t2) || can_convert (t2, t1))
5337 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5338 return convert_ptrmem (type, expr, /*allow_inverse_p=*/1,
5343 /* [expr.static.cast]
5345 An rvalue of type "pointer to cv void" can be explicitly
5346 converted to a pointer to object type. A value of type pointer
5347 to object converted to "pointer to cv void" and back to the
5348 original pointer type will have its original value. */
5349 if (TREE_CODE (intype) == POINTER_TYPE
5350 && VOID_TYPE_P (TREE_TYPE (intype))
5351 && TYPE_PTROB_P (type))
5354 check_for_casting_away_constness (intype, type, STATIC_CAST_EXPR);
5355 return build_nop (type, expr);
5359 return error_mark_node;
5362 /* Return an expression representing static_cast<TYPE>(EXPR). */
5365 build_static_cast (tree type, tree expr, tsubst_flags_t complain)
5370 if (type == error_mark_node || expr == error_mark_node)
5371 return error_mark_node;
5373 if (processing_template_decl)
5375 expr = build_min (STATIC_CAST_EXPR, type, expr);
5376 /* We don't know if it will or will not have side effects. */
5377 TREE_SIDE_EFFECTS (expr) = 1;
5378 return convert_from_reference (expr);
5381 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5382 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5383 if (TREE_CODE (type) != REFERENCE_TYPE
5384 && TREE_CODE (expr) == NOP_EXPR
5385 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5386 expr = TREE_OPERAND (expr, 0);
5388 result = build_static_cast_1 (type, expr, /*c_cast_p=*/false, &valid_p,
5393 if (complain & tf_error)
5394 error ("invalid static_cast from type %qT to type %qT",
5395 TREE_TYPE (expr), type);
5396 return error_mark_node;
5399 /* EXPR is an expression with member function or pointer-to-member
5400 function type. TYPE is a pointer type. Converting EXPR to TYPE is
5401 not permitted by ISO C++, but we accept it in some modes. If we
5402 are not in one of those modes, issue a diagnostic. Return the
5403 converted expression. */
5406 convert_member_func_to_ptr (tree type, tree expr)
5411 intype = TREE_TYPE (expr);
5412 gcc_assert (TYPE_PTRMEMFUNC_P (intype)
5413 || TREE_CODE (intype) == METHOD_TYPE);
5415 if (pedantic || warn_pmf2ptr)
5416 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpmf_conversions,
5417 "converting from %qT to %qT", intype, type);
5419 if (TREE_CODE (intype) == METHOD_TYPE)
5420 expr = build_addr_func (expr);
5421 else if (TREE_CODE (expr) == PTRMEM_CST)
5422 expr = build_address (PTRMEM_CST_MEMBER (expr));
5425 decl = maybe_dummy_object (TYPE_PTRMEM_CLASS_TYPE (intype), 0);
5426 decl = build_address (decl);
5427 expr = get_member_function_from_ptrfunc (&decl, expr);
5430 return build_nop (type, expr);
5433 /* Return a representation for a reinterpret_cast from EXPR to TYPE.
5434 If C_CAST_P is true, this reinterpret cast is being done as part of
5435 a C-style cast. If VALID_P is non-NULL, *VALID_P is set to
5436 indicate whether or not reinterpret_cast was valid. */
5439 build_reinterpret_cast_1 (tree type, tree expr, bool c_cast_p,
5440 bool *valid_p, tsubst_flags_t complain)
5444 /* Assume the cast is invalid. */
5448 if (type == error_mark_node || error_operand_p (expr))
5449 return error_mark_node;
5451 intype = TREE_TYPE (expr);
5453 /* Save casted types in the function's used types hash table. */
5454 used_types_insert (type);
5456 /* [expr.reinterpret.cast]
5457 An lvalue expression of type T1 can be cast to the type
5458 "reference to T2" if an expression of type "pointer to T1" can be
5459 explicitly converted to the type "pointer to T2" using a
5460 reinterpret_cast. */
5461 if (TREE_CODE (type) == REFERENCE_TYPE)
5463 if (! real_lvalue_p (expr))
5465 if (complain & tf_error)
5466 error ("invalid cast of an rvalue expression of type "
5469 return error_mark_node;
5472 /* Warn about a reinterpret_cast from "A*" to "B&" if "A" and
5473 "B" are related class types; the reinterpret_cast does not
5474 adjust the pointer. */
5475 if (TYPE_PTR_P (intype)
5476 && (complain & tf_warning)
5477 && (comptypes (TREE_TYPE (intype), TREE_TYPE (type),
5478 COMPARE_BASE | COMPARE_DERIVED)))
5479 warning (0, "casting %qT to %qT does not dereference pointer",
5482 expr = cp_build_unary_op (ADDR_EXPR, expr, 0, complain);
5483 if (expr != error_mark_node)
5484 expr = build_reinterpret_cast_1
5485 (build_pointer_type (TREE_TYPE (type)), expr, c_cast_p,
5487 if (expr != error_mark_node)
5488 expr = cp_build_indirect_ref (expr, 0, complain);
5492 /* As a G++ extension, we consider conversions from member
5493 functions, and pointers to member functions to
5494 pointer-to-function and pointer-to-void types. If
5495 -Wno-pmf-conversions has not been specified,
5496 convert_member_func_to_ptr will issue an error message. */
5497 if ((TYPE_PTRMEMFUNC_P (intype)
5498 || TREE_CODE (intype) == METHOD_TYPE)
5499 && TYPE_PTR_P (type)
5500 && (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
5501 || VOID_TYPE_P (TREE_TYPE (type))))
5502 return convert_member_func_to_ptr (type, expr);
5504 /* If the cast is not to a reference type, the lvalue-to-rvalue,
5505 array-to-pointer, and function-to-pointer conversions are
5507 expr = decay_conversion (expr);
5509 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5510 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5511 if (TREE_CODE (expr) == NOP_EXPR
5512 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5513 expr = TREE_OPERAND (expr, 0);
5515 if (error_operand_p (expr))
5516 return error_mark_node;
5518 intype = TREE_TYPE (expr);
5520 /* [expr.reinterpret.cast]
5521 A pointer can be converted to any integral type large enough to
5523 if (CP_INTEGRAL_TYPE_P (type) && TYPE_PTR_P (intype))
5525 if (TYPE_PRECISION (type) < TYPE_PRECISION (intype))
5527 if (complain & tf_error)
5528 permerror (input_location, "cast from %qT to %qT loses precision",
5531 return error_mark_node;
5534 /* [expr.reinterpret.cast]
5535 A value of integral or enumeration type can be explicitly
5536 converted to a pointer. */
5537 else if (TYPE_PTR_P (type) && INTEGRAL_OR_ENUMERATION_TYPE_P (intype))
5540 else if ((TYPE_PTRFN_P (type) && TYPE_PTRFN_P (intype))
5541 || (TYPE_PTRMEMFUNC_P (type) && TYPE_PTRMEMFUNC_P (intype)))
5542 return fold_if_not_in_template (build_nop (type, expr));
5543 else if ((TYPE_PTRMEM_P (type) && TYPE_PTRMEM_P (intype))
5544 || (TYPE_PTROBV_P (type) && TYPE_PTROBV_P (intype)))
5549 check_for_casting_away_constness (intype, type, REINTERPRET_CAST_EXPR);
5550 /* Warn about possible alignment problems. */
5551 if (STRICT_ALIGNMENT && warn_cast_align
5552 && (complain & tf_warning)
5553 && !VOID_TYPE_P (type)
5554 && TREE_CODE (TREE_TYPE (intype)) != FUNCTION_TYPE
5555 && COMPLETE_TYPE_P (TREE_TYPE (type))
5556 && COMPLETE_TYPE_P (TREE_TYPE (intype))
5557 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (intype)))
5558 warning (OPT_Wcast_align, "cast from %qT to %qT "
5559 "increases required alignment of target type", intype, type);
5561 /* We need to strip nops here, because the front end likes to
5562 create (int *)&a for array-to-pointer decay, instead of &a[0]. */
5564 if (warn_strict_aliasing <= 2)
5565 strict_aliasing_warning (intype, type, sexpr);
5567 return fold_if_not_in_template (build_nop (type, expr));
5569 else if ((TYPE_PTRFN_P (type) && TYPE_PTROBV_P (intype))
5570 || (TYPE_PTRFN_P (intype) && TYPE_PTROBV_P (type)))
5572 if (pedantic && (complain & tf_warning))
5573 /* Only issue a warning, as we have always supported this
5574 where possible, and it is necessary in some cases. DR 195
5575 addresses this issue, but as of 2004/10/26 is still in
5577 warning (0, "ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5578 return fold_if_not_in_template (build_nop (type, expr));
5580 else if (TREE_CODE (type) == VECTOR_TYPE)
5581 return fold_if_not_in_template (convert_to_vector (type, expr));
5582 else if (TREE_CODE (intype) == VECTOR_TYPE && INTEGRAL_TYPE_P (type))
5583 return fold_if_not_in_template (convert_to_integer (type, expr));
5588 if (complain & tf_error)
5589 error ("invalid cast from type %qT to type %qT", intype, type);
5590 return error_mark_node;
5593 return cp_convert (type, expr);
5597 build_reinterpret_cast (tree type, tree expr, tsubst_flags_t complain)
5599 if (type == error_mark_node || expr == error_mark_node)
5600 return error_mark_node;
5602 if (processing_template_decl)
5604 tree t = build_min (REINTERPRET_CAST_EXPR, type, expr);
5606 if (!TREE_SIDE_EFFECTS (t)
5607 && type_dependent_expression_p (expr))
5608 /* There might turn out to be side effects inside expr. */
5609 TREE_SIDE_EFFECTS (t) = 1;
5610 return convert_from_reference (t);
5613 return build_reinterpret_cast_1 (type, expr, /*c_cast_p=*/false,
5614 /*valid_p=*/NULL, complain);
5617 /* Perform a const_cast from EXPR to TYPE. If the cast is valid,
5618 return an appropriate expression. Otherwise, return
5619 error_mark_node. If the cast is not valid, and COMPLAIN is true,
5620 then a diagnostic will be issued. If VALID_P is non-NULL, we are
5621 performing a C-style cast, its value upon return will indicate
5622 whether or not the conversion succeeded. */
5625 build_const_cast_1 (tree dst_type, tree expr, bool complain,
5629 tree reference_type;
5631 /* Callers are responsible for handling error_mark_node as a
5632 destination type. */
5633 gcc_assert (dst_type != error_mark_node);
5634 /* In a template, callers should be building syntactic
5635 representations of casts, not using this machinery. */
5636 gcc_assert (!processing_template_decl);
5638 /* Assume the conversion is invalid. */
5642 if (!POINTER_TYPE_P (dst_type) && !TYPE_PTRMEM_P (dst_type))
5645 error ("invalid use of const_cast with type %qT, "
5646 "which is not a pointer, "
5647 "reference, nor a pointer-to-data-member type", dst_type);
5648 return error_mark_node;
5651 if (TREE_CODE (TREE_TYPE (dst_type)) == FUNCTION_TYPE)
5654 error ("invalid use of const_cast with type %qT, which is a pointer "
5655 "or reference to a function type", dst_type);
5656 return error_mark_node;
5659 /* Save casted types in the function's used types hash table. */
5660 used_types_insert (dst_type);
5662 src_type = TREE_TYPE (expr);
5663 /* Expressions do not really have reference types. */
5664 if (TREE_CODE (src_type) == REFERENCE_TYPE)
5665 src_type = TREE_TYPE (src_type);
5667 /* [expr.const.cast]
5669 An lvalue of type T1 can be explicitly converted to an lvalue of
5670 type T2 using the cast const_cast<T2&> (where T1 and T2 are object
5671 types) if a pointer to T1 can be explicitly converted to the type
5672 pointer to T2 using a const_cast. */
5673 if (TREE_CODE (dst_type) == REFERENCE_TYPE)
5675 reference_type = dst_type;
5676 if (! real_lvalue_p (expr))
5679 error ("invalid const_cast of an rvalue of type %qT to type %qT",
5680 src_type, dst_type);
5681 return error_mark_node;
5683 dst_type = build_pointer_type (TREE_TYPE (dst_type));
5684 src_type = build_pointer_type (src_type);
5688 reference_type = NULL_TREE;
5689 /* If the destination type is not a reference type, the
5690 lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5691 conversions are performed. */
5692 src_type = type_decays_to (src_type);
5693 if (src_type == error_mark_node)
5694 return error_mark_node;
5697 if ((TYPE_PTR_P (src_type) || TYPE_PTRMEM_P (src_type))
5698 && comp_ptr_ttypes_const (dst_type, src_type))
5703 /* This cast is actually a C-style cast. Issue a warning if
5704 the user is making a potentially unsafe cast. */
5705 check_for_casting_away_constness (src_type, dst_type, CAST_EXPR);
5709 expr = cp_build_unary_op (ADDR_EXPR, expr, 0,
5710 complain? tf_warning_or_error : tf_none);
5711 expr = build_nop (reference_type, expr);
5712 return convert_from_reference (expr);
5716 expr = decay_conversion (expr);
5717 /* build_c_cast puts on a NOP_EXPR to make the result not an
5718 lvalue. Strip such NOP_EXPRs if VALUE is being used in
5719 non-lvalue context. */
5720 if (TREE_CODE (expr) == NOP_EXPR
5721 && TREE_TYPE (expr) == TREE_TYPE (TREE_OPERAND (expr, 0)))
5722 expr = TREE_OPERAND (expr, 0);
5723 return build_nop (dst_type, expr);
5728 error ("invalid const_cast from type %qT to type %qT",
5729 src_type, dst_type);
5730 return error_mark_node;
5734 build_const_cast (tree type, tree expr, tsubst_flags_t complain)
5736 if (type == error_mark_node || error_operand_p (expr))
5737 return error_mark_node;
5739 if (processing_template_decl)
5741 tree t = build_min (CONST_CAST_EXPR, type, expr);
5743 if (!TREE_SIDE_EFFECTS (t)
5744 && type_dependent_expression_p (expr))
5745 /* There might turn out to be side effects inside expr. */
5746 TREE_SIDE_EFFECTS (t) = 1;
5747 return convert_from_reference (t);
5750 return build_const_cast_1 (type, expr, complain & tf_error,
5754 /* Like cp_build_c_cast, but for the c-common bits. */
5757 build_c_cast (tree type, tree expr)
5759 return cp_build_c_cast (type, expr, tf_warning_or_error);
5762 /* Build an expression representing an explicit C-style cast to type
5763 TYPE of expression EXPR. */
5766 cp_build_c_cast (tree type, tree expr, tsubst_flags_t complain)
5772 if (type == error_mark_node || error_operand_p (expr))
5773 return error_mark_node;
5775 if (processing_template_decl)
5777 tree t = build_min (CAST_EXPR, type,
5778 tree_cons (NULL_TREE, value, NULL_TREE));
5779 /* We don't know if it will or will not have side effects. */
5780 TREE_SIDE_EFFECTS (t) = 1;
5781 return convert_from_reference (t);
5784 /* Casts to a (pointer to a) specific ObjC class (or 'id' or
5785 'Class') should always be retained, because this information aids
5786 in method lookup. */
5787 if (objc_is_object_ptr (type)
5788 && objc_is_object_ptr (TREE_TYPE (expr)))
5789 return build_nop (type, expr);
5791 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5792 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5793 if (TREE_CODE (type) != REFERENCE_TYPE
5794 && TREE_CODE (value) == NOP_EXPR
5795 && TREE_TYPE (value) == TREE_TYPE (TREE_OPERAND (value, 0)))
5796 value = TREE_OPERAND (value, 0);
5798 if (TREE_CODE (type) == ARRAY_TYPE)
5800 /* Allow casting from T1* to T2[] because Cfront allows it.
5801 NIHCL uses it. It is not valid ISO C++ however. */
5802 if (TREE_CODE (TREE_TYPE (expr)) == POINTER_TYPE)
5804 if (complain & tf_error)
5805 permerror (input_location, "ISO C++ forbids casting to an array type %qT", type);
5807 return error_mark_node;
5808 type = build_pointer_type (TREE_TYPE (type));
5812 if (complain & tf_error)
5813 error ("ISO C++ forbids casting to an array type %qT", type);
5814 return error_mark_node;
5818 if (TREE_CODE (type) == FUNCTION_TYPE
5819 || TREE_CODE (type) == METHOD_TYPE)
5821 if (complain & tf_error)
5822 error ("invalid cast to function type %qT", type);
5823 return error_mark_node;
5826 /* A C-style cast can be a const_cast. */
5827 result = build_const_cast_1 (type, value, /*complain=*/false,
5832 /* Or a static cast. */
5833 result = build_static_cast_1 (type, value, /*c_cast_p=*/true,
5834 &valid_p, complain);
5835 /* Or a reinterpret_cast. */
5837 result = build_reinterpret_cast_1 (type, value, /*c_cast_p=*/true,
5838 &valid_p, complain);
5839 /* The static_cast or reinterpret_cast may be followed by a
5842 /* A valid cast may result in errors if, for example, a
5843 conversion to am ambiguous base class is required. */
5844 && !error_operand_p (result))
5848 /* Non-class rvalues always have cv-unqualified type. */
5849 if (!CLASS_TYPE_P (type))
5850 type = TYPE_MAIN_VARIANT (type);
5851 result_type = TREE_TYPE (result);
5852 if (!CLASS_TYPE_P (result_type))
5853 result_type = TYPE_MAIN_VARIANT (result_type);
5854 /* If the type of RESULT does not match TYPE, perform a
5855 const_cast to make it match. If the static_cast or
5856 reinterpret_cast succeeded, we will differ by at most
5857 cv-qualification, so the follow-on const_cast is guaranteed
5859 if (!same_type_p (non_reference (type), non_reference (result_type)))
5861 result = build_const_cast_1 (type, result, false, &valid_p);
5862 gcc_assert (valid_p);
5867 return error_mark_node;
5870 /* For use from the C common bits. */
5872 build_modify_expr (location_t location ATTRIBUTE_UNUSED,
5873 tree lhs, tree lhs_origtype ATTRIBUTE_UNUSED,
5874 enum tree_code modifycode, tree rhs,
5875 tree rhs_origtype ATTRIBUTE_UNUSED)
5877 return cp_build_modify_expr (lhs, modifycode, rhs, tf_warning_or_error);
5880 /* Build an assignment expression of lvalue LHS from value RHS.
5881 MODIFYCODE is the code for a binary operator that we use
5882 to combine the old value of LHS with RHS to get the new value.
5883 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5885 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5888 cp_build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
5889 tsubst_flags_t complain)
5893 tree lhstype = TREE_TYPE (lhs);
5894 tree olhstype = lhstype;
5895 bool plain_assign = (modifycode == NOP_EXPR);
5897 /* Avoid duplicate error messages from operands that had errors. */
5898 if (error_operand_p (lhs) || error_operand_p (rhs))
5899 return error_mark_node;
5901 /* Handle control structure constructs used as "lvalues". */
5902 switch (TREE_CODE (lhs))
5904 /* Handle --foo = 5; as these are valid constructs in C++. */
5905 case PREDECREMENT_EXPR:
5906 case PREINCREMENT_EXPR:
5907 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5908 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
5909 stabilize_reference (TREE_OPERAND (lhs, 0)),
5910 TREE_OPERAND (lhs, 1));
5911 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0),
5912 modifycode, rhs, complain);
5913 if (newrhs == error_mark_node)
5914 return error_mark_node;
5915 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
5917 /* Handle (a, b) used as an "lvalue". */
5919 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 1),
5920 modifycode, rhs, complain);
5921 if (newrhs == error_mark_node)
5922 return error_mark_node;
5923 return build2 (COMPOUND_EXPR, lhstype,
5924 TREE_OPERAND (lhs, 0), newrhs);
5927 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0)))
5928 lhs = build2 (TREE_CODE (lhs), TREE_TYPE (lhs),
5929 stabilize_reference (TREE_OPERAND (lhs, 0)),
5930 TREE_OPERAND (lhs, 1));
5931 newrhs = cp_build_modify_expr (TREE_OPERAND (lhs, 0), modifycode, rhs,
5933 if (newrhs == error_mark_node)
5934 return error_mark_node;
5935 return build2 (COMPOUND_EXPR, lhstype, lhs, newrhs);
5939 /* MIN_EXPR and MAX_EXPR are currently only permitted as lvalues,
5940 when neither operand has side-effects. */
5941 if (!lvalue_or_else (lhs, lv_assign, complain))
5942 return error_mark_node;
5944 gcc_assert (!TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 0))
5945 && !TREE_SIDE_EFFECTS (TREE_OPERAND (lhs, 1)));
5947 lhs = build3 (COND_EXPR, TREE_TYPE (lhs),
5948 build2 (TREE_CODE (lhs) == MIN_EXPR ? LE_EXPR : GE_EXPR,
5950 TREE_OPERAND (lhs, 0),
5951 TREE_OPERAND (lhs, 1)),
5952 TREE_OPERAND (lhs, 0),
5953 TREE_OPERAND (lhs, 1));
5956 /* Handle (a ? b : c) used as an "lvalue". */
5959 /* Produce (a ? (b = rhs) : (c = rhs))
5960 except that the RHS goes through a save-expr
5961 so the code to compute it is only emitted once. */
5963 tree preeval = NULL_TREE;
5965 if (VOID_TYPE_P (TREE_TYPE (rhs)))
5967 if (complain & tf_error)
5968 error ("void value not ignored as it ought to be");
5969 return error_mark_node;
5972 rhs = stabilize_expr (rhs, &preeval);
5974 /* Check this here to avoid odd errors when trying to convert
5975 a throw to the type of the COND_EXPR. */
5976 if (!lvalue_or_else (lhs, lv_assign, complain))
5977 return error_mark_node;
5979 cond = build_conditional_expr
5980 (TREE_OPERAND (lhs, 0),
5981 cp_build_modify_expr (TREE_OPERAND (lhs, 1),
5982 modifycode, rhs, complain),
5983 cp_build_modify_expr (TREE_OPERAND (lhs, 2),
5984 modifycode, rhs, complain),
5987 if (cond == error_mark_node)
5989 /* Make sure the code to compute the rhs comes out
5990 before the split. */
5992 cond = build2 (COMPOUND_EXPR, TREE_TYPE (lhs), preeval, cond);
6000 if (modifycode == INIT_EXPR)
6002 if (TREE_CODE (rhs) == CONSTRUCTOR)
6004 if (! same_type_p (TREE_TYPE (rhs), lhstype))
6005 /* Call convert to generate an error; see PR 11063. */
6006 rhs = convert (lhstype, rhs);
6007 result = build2 (INIT_EXPR, lhstype, lhs, rhs);
6008 TREE_SIDE_EFFECTS (result) = 1;
6011 else if (! MAYBE_CLASS_TYPE_P (lhstype))
6012 /* Do the default thing. */;
6015 result = build_special_member_call (lhs, complete_ctor_identifier,
6016 build_tree_list (NULL_TREE, rhs),
6017 lhstype, LOOKUP_NORMAL,
6019 if (result == NULL_TREE)
6020 return error_mark_node;
6026 lhs = require_complete_type (lhs);
6027 if (lhs == error_mark_node)
6028 return error_mark_node;
6030 if (modifycode == NOP_EXPR)
6032 /* `operator=' is not an inheritable operator. */
6033 if (! MAYBE_CLASS_TYPE_P (lhstype))
6034 /* Do the default thing. */;
6037 result = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL,
6038 lhs, rhs, make_node (NOP_EXPR),
6039 /*overloaded_p=*/NULL,
6041 if (result == NULL_TREE)
6042 return error_mark_node;
6049 /* A binary op has been requested. Combine the old LHS
6050 value with the RHS producing the value we should actually
6051 store into the LHS. */
6052 gcc_assert (!((TREE_CODE (lhstype) == REFERENCE_TYPE
6053 && MAYBE_CLASS_TYPE_P (TREE_TYPE (lhstype)))
6054 || MAYBE_CLASS_TYPE_P (lhstype)));
6056 lhs = stabilize_reference (lhs);
6057 newrhs = cp_build_binary_op (input_location,
6058 modifycode, lhs, rhs,
6060 if (newrhs == error_mark_node)
6062 if (complain & tf_error)
6063 error (" in evaluation of %<%Q(%#T, %#T)%>", modifycode,
6064 TREE_TYPE (lhs), TREE_TYPE (rhs));
6065 return error_mark_node;
6068 /* Now it looks like a plain assignment. */
6069 modifycode = NOP_EXPR;
6071 gcc_assert (TREE_CODE (lhstype) != REFERENCE_TYPE);
6072 gcc_assert (TREE_CODE (TREE_TYPE (newrhs)) != REFERENCE_TYPE);
6075 /* The left-hand side must be an lvalue. */
6076 if (!lvalue_or_else (lhs, lv_assign, complain))
6077 return error_mark_node;
6079 /* Warn about modifying something that is `const'. Don't warn if
6080 this is initialization. */
6081 if (modifycode != INIT_EXPR
6082 && (TREE_READONLY (lhs) || CP_TYPE_CONST_P (lhstype)
6083 /* Functions are not modifiable, even though they are
6085 || TREE_CODE (TREE_TYPE (lhs)) == FUNCTION_TYPE
6086 || TREE_CODE (TREE_TYPE (lhs)) == METHOD_TYPE
6087 /* If it's an aggregate and any field is const, then it is
6088 effectively const. */
6089 || (CLASS_TYPE_P (lhstype)
6090 && C_TYPE_FIELDS_READONLY (lhstype))))
6092 if (complain & tf_error)
6093 readonly_error (lhs, "assignment");
6095 return error_mark_node;
6098 /* If storing into a structure or union member, it may have been given a
6099 lowered bitfield type. We need to convert to the declared type first,
6100 so retrieve it now. */
6102 olhstype = unlowered_expr_type (lhs);
6104 /* Convert new value to destination type. */
6106 if (TREE_CODE (lhstype) == ARRAY_TYPE)
6110 if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype),
6111 TYPE_MAIN_VARIANT (TREE_TYPE (rhs))))
6113 if (complain & tf_error)
6114 error ("incompatible types in assignment of %qT to %qT",
6115 TREE_TYPE (rhs), lhstype);
6116 return error_mark_node;
6119 /* Allow array assignment in compiler-generated code. */
6120 if (!current_function_decl || !DECL_ARTIFICIAL (current_function_decl))
6122 /* This routine is used for both initialization and assignment.
6123 Make sure the diagnostic message differentiates the context. */
6124 if (complain & tf_error)
6126 if (modifycode == INIT_EXPR)
6127 error ("array used as initializer");
6129 error ("invalid array assignment");
6131 return error_mark_node;
6134 from_array = TREE_CODE (TREE_TYPE (newrhs)) == ARRAY_TYPE
6135 ? 1 + (modifycode != INIT_EXPR): 0;
6136 return build_vec_init (lhs, NULL_TREE, newrhs,
6137 /*explicit_value_init_p=*/false,
6138 from_array, complain);
6141 if (modifycode == INIT_EXPR)
6142 newrhs = convert_for_initialization (lhs, olhstype, newrhs, LOOKUP_NORMAL,
6143 "initialization", NULL_TREE, 0,
6146 newrhs = convert_for_assignment (olhstype, newrhs, "assignment",
6147 NULL_TREE, 0, complain);
6149 if (!same_type_p (lhstype, olhstype))
6150 newrhs = cp_convert_and_check (lhstype, newrhs);
6152 if (modifycode != INIT_EXPR)
6154 if (TREE_CODE (newrhs) == CALL_EXPR
6155 && TYPE_NEEDS_CONSTRUCTING (lhstype))
6156 newrhs = build_cplus_new (lhstype, newrhs);
6158 /* Can't initialize directly from a TARGET_EXPR, since that would
6159 cause the lhs to be constructed twice, and possibly result in
6160 accidental self-initialization. So we force the TARGET_EXPR to be
6161 expanded without a target. */
6162 if (TREE_CODE (newrhs) == TARGET_EXPR)
6163 newrhs = build2 (COMPOUND_EXPR, TREE_TYPE (newrhs), newrhs,
6164 TREE_OPERAND (newrhs, 0));
6167 if (newrhs == error_mark_node)
6168 return error_mark_node;
6170 if (c_dialect_objc () && flag_objc_gc)
6172 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
6178 result = build2 (modifycode == NOP_EXPR ? MODIFY_EXPR : INIT_EXPR,
6179 lhstype, lhs, newrhs);
6181 TREE_SIDE_EFFECTS (result) = 1;
6183 TREE_NO_WARNING (result) = 1;
6189 build_x_modify_expr (tree lhs, enum tree_code modifycode, tree rhs,
6190 tsubst_flags_t complain)
6192 if (processing_template_decl)
6193 return build_min_nt (MODOP_EXPR, lhs,
6194 build_min_nt (modifycode, NULL_TREE, NULL_TREE), rhs);
6196 if (modifycode != NOP_EXPR)
6198 tree rval = build_new_op (MODIFY_EXPR, LOOKUP_NORMAL, lhs, rhs,
6199 make_node (modifycode),
6200 /*overloaded_p=*/NULL,
6204 TREE_NO_WARNING (rval) = 1;
6208 return cp_build_modify_expr (lhs, modifycode, rhs, complain);
6211 /* Helper function for get_delta_difference which assumes FROM is a base
6212 class of TO. Returns a delta for the conversion of pointer-to-member
6213 of FROM to pointer-to-member of TO. If the conversion is invalid,
6214 returns zero. If FROM is not a base class of TO, returns NULL_TREE.
6215 If C_CAST_P is true, this conversion is taking place as part of a C-style
6219 get_delta_difference_1 (tree from, tree to, bool c_cast_p)
6224 binfo = lookup_base (to, from, c_cast_p ? ba_unique : ba_check, &kind);
6225 if (kind == bk_inaccessible || kind == bk_ambig)
6227 error (" in pointer to member function conversion");
6228 return size_zero_node;
6232 if (kind != bk_via_virtual)
6233 return BINFO_OFFSET (binfo);
6235 /* FROM is a virtual base class of TO. Issue an error or warning
6236 depending on whether or not this is a reinterpret cast. */
6238 error ("pointer to member conversion via virtual base %qT",
6239 BINFO_TYPE (binfo_from_vbase (binfo)));
6241 return size_zero_node;
6248 /* Get difference in deltas for different pointer to member function
6249 types. Returns an integer constant of type PTRDIFF_TYPE_NODE. If
6250 the conversion is invalid, the constant is zero. If
6251 ALLOW_INVERSE_P is true, then allow reverse conversions as well.
6252 If C_CAST_P is true this conversion is taking place as part of a
6255 Note that the naming of FROM and TO is kind of backwards; the return
6256 value is what we add to a TO in order to get a FROM. They are named
6257 this way because we call this function to find out how to convert from
6258 a pointer to member of FROM to a pointer to member of TO. */
6261 get_delta_difference (tree from, tree to,
6262 bool allow_inverse_p,
6267 if (same_type_ignoring_top_level_qualifiers_p (from, to))
6268 /* Pointer to member of incomplete class is permitted*/
6269 result = size_zero_node;
6271 result = get_delta_difference_1 (from, to, c_cast_p);
6275 if (!allow_inverse_p)
6277 error_not_base_type (from, to);
6278 error (" in pointer to member conversion");
6279 result = size_zero_node;
6283 result = get_delta_difference_1 (to, from, c_cast_p);
6286 result = size_diffop (size_zero_node, result);
6289 error_not_base_type (from, to);
6290 error (" in pointer to member conversion");
6291 result = size_zero_node;
6296 return fold_if_not_in_template (convert_to_integer (ptrdiff_type_node,
6300 /* Return a constructor for the pointer-to-member-function TYPE using
6301 the other components as specified. */
6304 build_ptrmemfunc1 (tree type, tree delta, tree pfn)
6309 VEC(constructor_elt, gc) *v;
6311 /* Pull the FIELD_DECLs out of the type. */
6312 pfn_field = TYPE_FIELDS (type);
6313 delta_field = TREE_CHAIN (pfn_field);
6315 /* Make sure DELTA has the type we want. */
6316 delta = convert_and_check (delta_type_node, delta);
6318 /* Convert to the correct target type if necessary. */
6319 pfn = fold_convert (TREE_TYPE (pfn_field), pfn);
6321 /* Finish creating the initializer. */
6322 v = VEC_alloc(constructor_elt, gc, 2);
6323 CONSTRUCTOR_APPEND_ELT(v, pfn_field, pfn);
6324 CONSTRUCTOR_APPEND_ELT(v, delta_field, delta);
6325 u = build_constructor (type, v);
6326 TREE_CONSTANT (u) = TREE_CONSTANT (pfn) & TREE_CONSTANT (delta);
6327 TREE_STATIC (u) = (TREE_CONSTANT (u)
6328 && (initializer_constant_valid_p (pfn, TREE_TYPE (pfn))
6330 && (initializer_constant_valid_p (delta, TREE_TYPE (delta))
6335 /* Build a constructor for a pointer to member function. It can be
6336 used to initialize global variables, local variable, or used
6337 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6340 If FORCE is nonzero, then force this conversion, even if
6341 we would rather not do it. Usually set when using an explicit
6342 cast. A C-style cast is being processed iff C_CAST_P is true.
6344 Return error_mark_node, if something goes wrong. */
6347 build_ptrmemfunc (tree type, tree pfn, int force, bool c_cast_p)
6353 if (error_operand_p (pfn))
6354 return error_mark_node;
6356 pfn_type = TREE_TYPE (pfn);
6357 to_type = build_ptrmemfunc_type (type);
6359 /* Handle multiple conversions of pointer to member functions. */
6360 if (TYPE_PTRMEMFUNC_P (pfn_type))
6362 tree delta = NULL_TREE;
6363 tree npfn = NULL_TREE;
6367 && !can_convert_arg (to_type, TREE_TYPE (pfn), pfn, LOOKUP_NORMAL))
6368 error ("invalid conversion to type %qT from type %qT",
6371 n = get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type),
6372 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type),
6376 /* We don't have to do any conversion to convert a
6377 pointer-to-member to its own type. But, we don't want to
6378 just return a PTRMEM_CST if there's an explicit cast; that
6379 cast should make the expression an invalid template argument. */
6380 if (TREE_CODE (pfn) != PTRMEM_CST)
6382 if (same_type_p (to_type, pfn_type))
6384 else if (integer_zerop (n))
6385 return build_reinterpret_cast (to_type, pfn,
6386 tf_warning_or_error);
6389 if (TREE_SIDE_EFFECTS (pfn))
6390 pfn = save_expr (pfn);
6392 /* Obtain the function pointer and the current DELTA. */
6393 if (TREE_CODE (pfn) == PTRMEM_CST)
6394 expand_ptrmemfunc_cst (pfn, &delta, &npfn);
6397 npfn = build_ptrmemfunc_access_expr (pfn, pfn_identifier);
6398 delta = build_ptrmemfunc_access_expr (pfn, delta_identifier);
6401 /* Just adjust the DELTA field. */
6402 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6403 (TREE_TYPE (delta), ptrdiff_type_node));
6404 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_delta)
6405 n = cp_build_binary_op (input_location,
6406 LSHIFT_EXPR, n, integer_one_node,
6407 tf_warning_or_error);
6408 delta = cp_build_binary_op (input_location,
6409 PLUS_EXPR, delta, n, tf_warning_or_error);
6410 return build_ptrmemfunc1 (to_type, delta, npfn);
6413 /* Handle null pointer to member function conversions. */
6414 if (integer_zerop (pfn))
6416 pfn = build_c_cast (type, integer_zero_node);
6417 return build_ptrmemfunc1 (to_type,
6422 if (type_unknown_p (pfn))
6423 return instantiate_type (type, pfn, tf_warning_or_error);
6425 fn = TREE_OPERAND (pfn, 0);
6426 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL
6427 /* In a template, we will have preserved the
6429 || (processing_template_decl && TREE_CODE (fn) == OFFSET_REF));
6430 return make_ptrmem_cst (to_type, fn);
6433 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
6436 ??? There is no consistency as to the types returned for the above
6437 values. Some code acts as if it were a sizetype and some as if it were
6438 integer_type_node. */
6441 expand_ptrmemfunc_cst (tree cst, tree *delta, tree *pfn)
6443 tree type = TREE_TYPE (cst);
6444 tree fn = PTRMEM_CST_MEMBER (cst);
6445 tree ptr_class, fn_class;
6447 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
6449 /* The class that the function belongs to. */
6450 fn_class = DECL_CONTEXT (fn);
6452 /* The class that we're creating a pointer to member of. */
6453 ptr_class = TYPE_PTRMEMFUNC_OBJECT_TYPE (type);
6455 /* First, calculate the adjustment to the function's class. */
6456 *delta = get_delta_difference (fn_class, ptr_class, /*force=*/0,
6459 if (!DECL_VIRTUAL_P (fn))
6460 *pfn = convert (TYPE_PTRMEMFUNC_FN_TYPE (type), build_addr_func (fn));
6463 /* If we're dealing with a virtual function, we have to adjust 'this'
6464 again, to point to the base which provides the vtable entry for
6465 fn; the call will do the opposite adjustment. */
6466 tree orig_class = DECL_CONTEXT (fn);
6467 tree binfo = binfo_or_else (orig_class, fn_class);
6468 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6469 *delta, BINFO_OFFSET (binfo));
6470 *delta = fold_if_not_in_template (*delta);
6472 /* We set PFN to the vtable offset at which the function can be
6473 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
6474 case delta is shifted left, and then incremented). */
6475 *pfn = DECL_VINDEX (fn);
6476 *pfn = build2 (MULT_EXPR, integer_type_node, *pfn,
6477 TYPE_SIZE_UNIT (vtable_entry_type));
6478 *pfn = fold_if_not_in_template (*pfn);
6480 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION)
6482 case ptrmemfunc_vbit_in_pfn:
6483 *pfn = build2 (PLUS_EXPR, integer_type_node, *pfn,
6485 *pfn = fold_if_not_in_template (*pfn);
6488 case ptrmemfunc_vbit_in_delta:
6489 *delta = build2 (LSHIFT_EXPR, TREE_TYPE (*delta),
6490 *delta, integer_one_node);
6491 *delta = fold_if_not_in_template (*delta);
6492 *delta = build2 (PLUS_EXPR, TREE_TYPE (*delta),
6493 *delta, integer_one_node);
6494 *delta = fold_if_not_in_template (*delta);
6501 *pfn = build_nop (TYPE_PTRMEMFUNC_FN_TYPE (type), *pfn);
6502 *pfn = fold_if_not_in_template (*pfn);
6506 /* Return an expression for PFN from the pointer-to-member function
6510 pfn_from_ptrmemfunc (tree t)
6512 if (TREE_CODE (t) == PTRMEM_CST)
6517 expand_ptrmemfunc_cst (t, &delta, &pfn);
6522 return build_ptrmemfunc_access_expr (t, pfn_identifier);
6525 /* Return an expression for DELTA from the pointer-to-member function
6529 delta_from_ptrmemfunc (tree t)
6531 if (TREE_CODE (t) == PTRMEM_CST)
6536 expand_ptrmemfunc_cst (t, &delta, &pfn);
6541 return build_ptrmemfunc_access_expr (t, delta_identifier);
6544 /* Convert value RHS to type TYPE as preparation for an assignment to
6545 an lvalue of type TYPE. ERRTYPE is a string to use in error
6546 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6547 are doing the conversion in order to pass the PARMNUMth argument of
6551 convert_for_assignment (tree type, tree rhs,
6552 const char *errtype, tree fndecl, int parmnum,
6553 tsubst_flags_t complain)
6556 enum tree_code coder;
6558 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6559 if (TREE_CODE (rhs) == NON_LVALUE_EXPR)
6560 rhs = TREE_OPERAND (rhs, 0);
6562 rhstype = TREE_TYPE (rhs);
6563 coder = TREE_CODE (rhstype);
6565 if (TREE_CODE (type) == VECTOR_TYPE && coder == VECTOR_TYPE
6566 && vector_types_convertible_p (type, rhstype, true))
6567 return convert (type, rhs);
6569 if (rhs == error_mark_node || rhstype == error_mark_node)
6570 return error_mark_node;
6571 if (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node)
6572 return error_mark_node;
6574 /* The RHS of an assignment cannot have void type. */
6575 if (coder == VOID_TYPE)
6577 if (complain & tf_error)
6578 error ("void value not ignored as it ought to be");
6579 return error_mark_node;
6582 /* Simplify the RHS if possible. */
6583 if (TREE_CODE (rhs) == CONST_DECL)
6584 rhs = DECL_INITIAL (rhs);
6586 if (c_dialect_objc ())
6589 tree rname = fndecl;
6591 if (!strcmp (errtype, "assignment"))
6593 else if (!strcmp (errtype, "initialization"))
6597 tree selector = objc_message_selector ();
6601 if (selector && parmno > 1)
6608 if (objc_compare_types (type, rhstype, parmno, rname))
6609 return convert (type, rhs);
6614 The expression is implicitly converted (clause _conv_) to the
6615 cv-unqualified type of the left operand.
6617 We allow bad conversions here because by the time we get to this point
6618 we are committed to doing the conversion. If we end up doing a bad
6619 conversion, convert_like will complain. */
6620 if (!can_convert_arg_bad (type, rhstype, rhs))
6622 /* When -Wno-pmf-conversions is use, we just silently allow
6623 conversions from pointers-to-members to plain pointers. If
6624 the conversion doesn't work, cp_convert will complain. */
6626 && TYPE_PTR_P (type)
6627 && TYPE_PTRMEMFUNC_P (rhstype))
6628 rhs = cp_convert (strip_top_quals (type), rhs);
6631 if (complain & tf_error)
6633 /* If the right-hand side has unknown type, then it is an
6634 overloaded function. Call instantiate_type to get error
6636 if (rhstype == unknown_type_node)
6637 instantiate_type (type, rhs, tf_warning_or_error);
6639 error ("cannot convert %qT to %qT for argument %qP to %qD",
6640 rhstype, type, parmnum, fndecl);
6642 error ("cannot convert %qT to %qT in %s", rhstype, type,
6645 return error_mark_node;
6648 if (warn_missing_format_attribute)
6650 const enum tree_code codel = TREE_CODE (type);
6651 if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
6653 && check_missing_format_attribute (type, rhstype)
6654 && (complain & tf_warning))
6655 warning (OPT_Wmissing_format_attribute,
6656 "%s might be a candidate for a format attribute",
6660 /* If -Wparentheses, warn about a = b = c when a has type bool and b
6662 if (warn_parentheses
6663 && type == boolean_type_node
6664 && TREE_CODE (rhs) == MODIFY_EXPR
6665 && !TREE_NO_WARNING (rhs)
6666 && TREE_TYPE (rhs) != boolean_type_node
6667 && (complain & tf_warning))
6669 warning (OPT_Wparentheses,
6670 "suggest parentheses around assignment used as truth value");
6671 TREE_NO_WARNING (rhs) = 1;
6674 return perform_implicit_conversion (strip_top_quals (type), rhs, complain);
6677 /* Convert RHS to be of type TYPE.
6678 If EXP is nonzero, it is the target of the initialization.
6679 ERRTYPE is a string to use in error messages.
6681 Two major differences between the behavior of
6682 `convert_for_assignment' and `convert_for_initialization'
6683 are that references are bashed in the former, while
6684 copied in the latter, and aggregates are assigned in
6685 the former (operator=) while initialized in the
6688 If using constructor make sure no conversion operator exists, if one does
6689 exist, an ambiguity exists.
6691 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6694 convert_for_initialization (tree exp, tree type, tree rhs, int flags,
6695 const char *errtype, tree fndecl, int parmnum,
6696 tsubst_flags_t complain)
6698 enum tree_code codel = TREE_CODE (type);
6700 enum tree_code coder;
6702 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6703 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6704 if (TREE_CODE (rhs) == NOP_EXPR
6705 && TREE_TYPE (rhs) == TREE_TYPE (TREE_OPERAND (rhs, 0))
6706 && codel != REFERENCE_TYPE)
6707 rhs = TREE_OPERAND (rhs, 0);
6709 if (type == error_mark_node
6710 || rhs == error_mark_node
6711 || (TREE_CODE (rhs) == TREE_LIST && TREE_VALUE (rhs) == error_mark_node))
6712 return error_mark_node;
6714 if ((TREE_CODE (TREE_TYPE (rhs)) == ARRAY_TYPE
6715 && TREE_CODE (type) != ARRAY_TYPE
6716 && (TREE_CODE (type) != REFERENCE_TYPE
6717 || TREE_CODE (TREE_TYPE (type)) != ARRAY_TYPE))
6718 || (TREE_CODE (TREE_TYPE (rhs)) == FUNCTION_TYPE
6719 && (TREE_CODE (type) != REFERENCE_TYPE
6720 || TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE))
6721 || TREE_CODE (TREE_TYPE (rhs)) == METHOD_TYPE)
6722 rhs = decay_conversion (rhs);
6724 rhstype = TREE_TYPE (rhs);
6725 coder = TREE_CODE (rhstype);
6727 if (coder == ERROR_MARK)
6728 return error_mark_node;
6730 /* We accept references to incomplete types, so we can
6731 return here before checking if RHS is of complete type. */
6733 if (codel == REFERENCE_TYPE)
6735 /* This should eventually happen in convert_arguments. */
6736 int savew = 0, savee = 0;
6739 savew = warningcount, savee = errorcount;
6740 rhs = initialize_reference (type, rhs, /*decl=*/NULL_TREE,
6744 if (warningcount > savew)
6745 warning (0, "in passing argument %P of %q+D", parmnum, fndecl);
6746 else if (errorcount > savee)
6747 error ("in passing argument %P of %q+D", parmnum, fndecl);
6753 exp = require_complete_type (exp);
6754 if (exp == error_mark_node)
6755 return error_mark_node;
6757 rhstype = non_reference (rhstype);
6759 type = complete_type (type);
6761 if (MAYBE_CLASS_TYPE_P (type))
6762 return ocp_convert (type, rhs, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
6764 return convert_for_assignment (type, rhs, errtype, fndecl, parmnum,
6768 /* If RETVAL is the address of, or a reference to, a local variable or
6769 temporary give an appropriate warning. */
6772 maybe_warn_about_returning_address_of_local (tree retval)
6774 tree valtype = TREE_TYPE (DECL_RESULT (current_function_decl));
6775 tree whats_returned = retval;
6779 if (TREE_CODE (whats_returned) == COMPOUND_EXPR)
6780 whats_returned = TREE_OPERAND (whats_returned, 1);
6781 else if (CONVERT_EXPR_P (whats_returned)
6782 || TREE_CODE (whats_returned) == NON_LVALUE_EXPR)
6783 whats_returned = TREE_OPERAND (whats_returned, 0);
6788 if (TREE_CODE (whats_returned) != ADDR_EXPR)
6790 whats_returned = TREE_OPERAND (whats_returned, 0);
6792 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6794 if (TREE_CODE (whats_returned) == AGGR_INIT_EXPR
6795 || TREE_CODE (whats_returned) == TARGET_EXPR)
6797 warning (0, "returning reference to temporary");
6800 if (TREE_CODE (whats_returned) == VAR_DECL
6801 && DECL_NAME (whats_returned)
6802 && TEMP_NAME_P (DECL_NAME (whats_returned)))
6804 warning (0, "reference to non-lvalue returned");
6809 while (TREE_CODE (whats_returned) == COMPONENT_REF
6810 || TREE_CODE (whats_returned) == ARRAY_REF)
6811 whats_returned = TREE_OPERAND (whats_returned, 0);
6813 if (DECL_P (whats_returned)
6814 && DECL_NAME (whats_returned)
6815 && DECL_FUNCTION_SCOPE_P (whats_returned)
6816 && !(TREE_STATIC (whats_returned)
6817 || TREE_PUBLIC (whats_returned)))
6819 if (TREE_CODE (valtype) == REFERENCE_TYPE)
6820 warning (0, "reference to local variable %q+D returned",
6823 warning (0, "address of local variable %q+D returned",
6829 /* Check that returning RETVAL from the current function is valid.
6830 Return an expression explicitly showing all conversions required to
6831 change RETVAL into the function return type, and to assign it to
6832 the DECL_RESULT for the function. Set *NO_WARNING to true if
6833 code reaches end of non-void function warning shouldn't be issued
6834 on this RETURN_EXPR. */
6837 check_return_expr (tree retval, bool *no_warning)
6840 /* The type actually returned by the function, after any
6843 int fn_returns_value_p;
6844 bool named_return_value_okay_p;
6846 *no_warning = false;
6848 /* A `volatile' function is one that isn't supposed to return, ever.
6849 (This is a G++ extension, used to get better code for functions
6850 that call the `volatile' function.) */
6851 if (TREE_THIS_VOLATILE (current_function_decl))
6852 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6854 /* Check for various simple errors. */
6855 if (DECL_DESTRUCTOR_P (current_function_decl))
6858 error ("returning a value from a destructor");
6861 else if (DECL_CONSTRUCTOR_P (current_function_decl))
6863 if (in_function_try_handler)
6864 /* If a return statement appears in a handler of the
6865 function-try-block of a constructor, the program is ill-formed. */
6866 error ("cannot return from a handler of a function-try-block of a constructor");
6868 /* You can't return a value from a constructor. */
6869 error ("returning a value from a constructor");
6873 if (processing_template_decl)
6875 current_function_returns_value = 1;
6876 if (check_for_bare_parameter_packs (retval))
6877 retval = error_mark_node;
6881 /* When no explicit return-value is given in a function with a named
6882 return value, the named return value is used. */
6883 result = DECL_RESULT (current_function_decl);
6884 valtype = TREE_TYPE (result);
6885 gcc_assert (valtype != NULL_TREE);
6886 fn_returns_value_p = !VOID_TYPE_P (valtype);
6887 if (!retval && DECL_NAME (result) && fn_returns_value_p)
6890 /* Check for a return statement with no return value in a function
6891 that's supposed to return a value. */
6892 if (!retval && fn_returns_value_p)
6894 permerror (input_location, "return-statement with no value, in function returning %qT",
6896 /* Clear this, so finish_function won't say that we reach the
6897 end of a non-void function (which we don't, we gave a
6899 current_function_returns_null = 0;
6900 /* And signal caller that TREE_NO_WARNING should be set on the
6901 RETURN_EXPR to avoid control reaches end of non-void function
6902 warnings in tree-cfg.c. */
6905 /* Check for a return statement with a value in a function that
6906 isn't supposed to return a value. */
6907 else if (retval && !fn_returns_value_p)
6909 if (VOID_TYPE_P (TREE_TYPE (retval)))
6910 /* You can return a `void' value from a function of `void'
6911 type. In that case, we have to evaluate the expression for
6912 its side-effects. */
6913 finish_expr_stmt (retval);
6915 permerror (input_location, "return-statement with a value, in function "
6916 "returning 'void'");
6917 current_function_returns_null = 1;
6919 /* There's really no value to return, after all. */
6923 /* Remember that this function can sometimes return without a
6925 current_function_returns_null = 1;
6927 /* Remember that this function did return a value. */
6928 current_function_returns_value = 1;
6930 /* Check for erroneous operands -- but after giving ourselves a
6931 chance to provide an error about returning a value from a void
6933 if (error_operand_p (retval))
6935 current_function_return_value = error_mark_node;
6936 return error_mark_node;
6939 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6940 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl) == NEW_EXPR
6941 || DECL_OVERLOADED_OPERATOR_P (current_function_decl) == VEC_NEW_EXPR)
6942 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl))
6944 && retval && null_ptr_cst_p (retval))
6945 warning (0, "%<operator new%> must not return NULL unless it is "
6946 "declared %<throw()%> (or -fcheck-new is in effect)");
6948 /* Effective C++ rule 15. See also start_function. */
6950 && DECL_NAME (current_function_decl) == ansi_assopname(NOP_EXPR))
6954 /* The function return type must be a reference to the current
6956 if (TREE_CODE (valtype) == REFERENCE_TYPE
6957 && same_type_ignoring_top_level_qualifiers_p
6958 (TREE_TYPE (valtype), TREE_TYPE (current_class_ref)))
6960 /* Returning '*this' is obviously OK. */
6961 if (retval == current_class_ref)
6963 /* If we are calling a function whose return type is the same of
6964 the current class reference, it is ok. */
6965 else if (TREE_CODE (retval) == INDIRECT_REF
6966 && TREE_CODE (TREE_OPERAND (retval, 0)) == CALL_EXPR)
6971 warning (OPT_Weffc__, "%<operator=%> should return a reference to %<*this%>");
6974 /* The fabled Named Return Value optimization, as per [class.copy]/15:
6976 [...] For a function with a class return type, if the expression
6977 in the return statement is the name of a local object, and the cv-
6978 unqualified type of the local object is the same as the function
6979 return type, an implementation is permitted to omit creating the tem-
6980 porary object to hold the function return value [...]
6982 So, if this is a value-returning function that always returns the same
6983 local variable, remember it.
6985 It might be nice to be more flexible, and choose the first suitable
6986 variable even if the function sometimes returns something else, but
6987 then we run the risk of clobbering the variable we chose if the other
6988 returned expression uses the chosen variable somehow. And people expect
6989 this restriction, anyway. (jason 2000-11-19)
6991 See finish_function and finalize_nrv for the rest of this optimization. */
6993 named_return_value_okay_p =
6994 (retval != NULL_TREE
6995 /* Must be a local, automatic variable. */
6996 && TREE_CODE (retval) == VAR_DECL
6997 && DECL_CONTEXT (retval) == current_function_decl
6998 && ! TREE_STATIC (retval)
6999 && ! DECL_ANON_UNION_VAR_P (retval)
7000 && (DECL_ALIGN (retval)
7001 >= DECL_ALIGN (DECL_RESULT (current_function_decl)))
7002 /* The cv-unqualified type of the returned value must be the
7003 same as the cv-unqualified return type of the
7005 && same_type_p ((TYPE_MAIN_VARIANT (TREE_TYPE (retval))),
7007 (TREE_TYPE (TREE_TYPE (current_function_decl)))))
7008 /* And the returned value must be non-volatile. */
7009 && ! TYPE_VOLATILE (TREE_TYPE (retval)));
7011 if (fn_returns_value_p && flag_elide_constructors)
7013 if (named_return_value_okay_p
7014 && (current_function_return_value == NULL_TREE
7015 || current_function_return_value == retval))
7016 current_function_return_value = retval;
7018 current_function_return_value = error_mark_node;
7021 /* We don't need to do any conversions when there's nothing being
7026 /* Do any required conversions. */
7027 if (retval == result || DECL_CONSTRUCTOR_P (current_function_decl))
7028 /* No conversions are required. */
7032 /* The type the function is declared to return. */
7033 tree functype = TREE_TYPE (TREE_TYPE (current_function_decl));
7034 int flags = LOOKUP_NORMAL | LOOKUP_ONLYCONVERTING;
7036 /* The functype's return type will have been set to void, if it
7037 was an incomplete type. Just treat this as 'return;' */
7038 if (VOID_TYPE_P (functype))
7039 return error_mark_node;
7041 /* Under C++0x [12.8/16 class.copy], a returned lvalue is sometimes
7042 treated as an rvalue for the purposes of overload resolution to
7043 favor move constructors over copy constructors. */
7044 if ((cxx_dialect != cxx98)
7045 && named_return_value_okay_p
7046 /* The variable must not have the `volatile' qualifier. */
7047 && !(cp_type_quals (TREE_TYPE (retval)) & TYPE_QUAL_VOLATILE)
7048 /* The return type must be a class type. */
7049 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (current_function_decl))))
7050 flags = flags | LOOKUP_PREFER_RVALUE;
7052 /* First convert the value to the function's return type, then
7053 to the type of return value's location to handle the
7054 case that functype is smaller than the valtype. */
7055 retval = convert_for_initialization
7056 (NULL_TREE, functype, retval, flags, "return", NULL_TREE, 0,
7057 tf_warning_or_error);
7058 retval = convert (valtype, retval);
7060 /* If the conversion failed, treat this just like `return;'. */
7061 if (retval == error_mark_node)
7063 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7064 else if (! cfun->returns_struct
7065 && TREE_CODE (retval) == TARGET_EXPR
7066 && TREE_CODE (TREE_OPERAND (retval, 1)) == AGGR_INIT_EXPR)
7067 retval = build2 (COMPOUND_EXPR, TREE_TYPE (retval), retval,
7068 TREE_OPERAND (retval, 0));
7070 maybe_warn_about_returning_address_of_local (retval);
7073 /* Actually copy the value returned into the appropriate location. */
7074 if (retval && retval != result)
7075 retval = build2 (INIT_EXPR, TREE_TYPE (result), result, retval);
7081 /* Returns nonzero if the pointer-type FROM can be converted to the
7082 pointer-type TO via a qualification conversion. If CONSTP is -1,
7083 then we return nonzero if the pointers are similar, and the
7084 cv-qualification signature of FROM is a proper subset of that of TO.
7086 If CONSTP is positive, then all outer pointers have been
7090 comp_ptr_ttypes_real (tree to, tree from, int constp)
7092 bool to_more_cv_qualified = false;
7093 bool is_opaque_pointer = false;
7095 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7097 if (TREE_CODE (to) != TREE_CODE (from))
7100 if (TREE_CODE (from) == OFFSET_TYPE
7101 && !same_type_p (TYPE_OFFSET_BASETYPE (from),
7102 TYPE_OFFSET_BASETYPE (to)))
7105 /* Const and volatile mean something different for function types,
7106 so the usual checks are not appropriate. */
7107 if (TREE_CODE (to) != FUNCTION_TYPE && TREE_CODE (to) != METHOD_TYPE)
7109 /* In Objective-C++, some types may have been 'volatilized' by
7110 the compiler for EH; when comparing them here, the volatile
7111 qualification must be ignored. */
7112 bool objc_quals_match = objc_type_quals_match (to, from);
7114 if (!at_least_as_qualified_p (to, from) && !objc_quals_match)
7117 if (!at_least_as_qualified_p (from, to) && !objc_quals_match)
7121 to_more_cv_qualified = true;
7125 constp &= TYPE_READONLY (to);
7128 if (TREE_CODE (to) == VECTOR_TYPE)
7129 is_opaque_pointer = vector_targets_convertible_p (to, from);
7131 if (TREE_CODE (to) != POINTER_TYPE && !TYPE_PTRMEM_P (to))
7132 return ((constp >= 0 || to_more_cv_qualified)
7133 && (is_opaque_pointer
7134 || same_type_ignoring_top_level_qualifiers_p (to, from)));
7138 /* When comparing, say, char ** to char const **, this function takes
7139 the 'char *' and 'char const *'. Do not pass non-pointer/reference
7140 types to this function. */
7143 comp_ptr_ttypes (tree to, tree from)
7145 return comp_ptr_ttypes_real (to, from, 1);
7148 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7149 type or inheritance-related types, regardless of cv-quals. */
7152 ptr_reasonably_similar (const_tree to, const_tree from)
7154 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7156 /* Any target type is similar enough to void. */
7157 if (TREE_CODE (to) == VOID_TYPE
7158 || TREE_CODE (from) == VOID_TYPE)
7161 if (TREE_CODE (to) != TREE_CODE (from))
7164 if (TREE_CODE (from) == OFFSET_TYPE
7165 && comptypes (TYPE_OFFSET_BASETYPE (to),
7166 TYPE_OFFSET_BASETYPE (from),
7167 COMPARE_BASE | COMPARE_DERIVED))
7170 if (TREE_CODE (to) == VECTOR_TYPE
7171 && vector_types_convertible_p (to, from, false))
7174 if (TREE_CODE (to) == INTEGER_TYPE
7175 && TYPE_PRECISION (to) == TYPE_PRECISION (from))
7178 if (TREE_CODE (to) == FUNCTION_TYPE)
7181 if (TREE_CODE (to) != POINTER_TYPE)
7183 (TYPE_MAIN_VARIANT (to), TYPE_MAIN_VARIANT (from),
7184 COMPARE_BASE | COMPARE_DERIVED);
7188 /* Return true if TO and FROM (both of which are POINTER_TYPEs or
7189 pointer-to-member types) are the same, ignoring cv-qualification at
7193 comp_ptr_ttypes_const (tree to, tree from)
7195 bool is_opaque_pointer = false;
7197 for (; ; to = TREE_TYPE (to), from = TREE_TYPE (from))
7199 if (TREE_CODE (to) != TREE_CODE (from))
7202 if (TREE_CODE (from) == OFFSET_TYPE
7203 && same_type_p (TYPE_OFFSET_BASETYPE (from),
7204 TYPE_OFFSET_BASETYPE (to)))
7207 if (TREE_CODE (to) == VECTOR_TYPE)
7208 is_opaque_pointer = vector_targets_convertible_p (to, from);
7210 if (TREE_CODE (to) != POINTER_TYPE)
7211 return (is_opaque_pointer
7212 || same_type_ignoring_top_level_qualifiers_p (to, from));
7216 /* Returns the type qualifiers for this type, including the qualifiers on the
7217 elements for an array type. */
7220 cp_type_quals (const_tree type)
7222 /* This CONST_CAST is okay because strip_array_types returns its
7223 argument unmodified and we assign it to a const_tree. */
7224 type = strip_array_types (CONST_CAST_TREE(type));
7225 if (type == error_mark_node)
7226 return TYPE_UNQUALIFIED;
7227 return TYPE_QUALS (type);
7230 /* Returns nonzero if the TYPE is const from a C++ perspective: look inside
7234 cp_type_readonly (const_tree type)
7236 /* This CONST_CAST is okay because strip_array_types returns its
7237 argument unmodified and we assign it to a const_tree. */
7238 type = strip_array_types (CONST_CAST_TREE(type));
7239 return TYPE_READONLY (type);
7242 /* Returns nonzero if the TYPE contains a mutable member. */
7245 cp_has_mutable_p (const_tree type)
7247 /* This CONST_CAST is okay because strip_array_types returns its
7248 argument unmodified and we assign it to a const_tree. */
7249 type = strip_array_types (CONST_CAST_TREE(type));
7251 return CLASS_TYPE_P (type) && CLASSTYPE_HAS_MUTABLE (type);
7254 /* Set TREE_READONLY and TREE_VOLATILE on DECL as indicated by the
7255 TYPE_QUALS. For a VAR_DECL, this may be an optimistic
7256 approximation. In particular, consider:
7259 struct S { int i; };
7260 const S s = { f(); }
7262 Here, we will make "s" as TREE_READONLY (because it is declared
7263 "const") -- only to reverse ourselves upon seeing that the
7264 initializer is non-constant. */
7267 cp_apply_type_quals_to_decl (int type_quals, tree decl)
7269 tree type = TREE_TYPE (decl);
7271 if (type == error_mark_node)
7274 if (TREE_CODE (decl) == TYPE_DECL)
7277 if (TREE_CODE (type) == FUNCTION_TYPE
7278 && type_quals != TYPE_UNQUALIFIED)
7280 /* This was an error in C++98 (cv-qualifiers cannot be added to
7281 a function type), but DR 295 makes the code well-formed by
7282 dropping the extra qualifiers. */
7285 tree bad_type = build_qualified_type (type, type_quals);
7286 pedwarn (input_location, OPT_pedantic,
7287 "ignoring %qV qualifiers added to function type %qT",
7291 TREE_TYPE (decl) = TYPE_MAIN_VARIANT (type);
7295 /* Avoid setting TREE_READONLY incorrectly. */
7296 if (/* If the object has a constructor, the constructor may modify
7298 TYPE_NEEDS_CONSTRUCTING (type)
7299 /* If the type isn't complete, we don't know yet if it will need
7301 || !COMPLETE_TYPE_P (type)
7302 /* If the type has a mutable component, that component might be
7304 || TYPE_HAS_MUTABLE_P (type))
7305 type_quals &= ~TYPE_QUAL_CONST;
7307 c_apply_type_quals_to_decl (type_quals, decl);
7310 /* Subroutine of casts_away_constness. Make T1 and T2 point at
7311 exemplar types such that casting T1 to T2 is casting away constness
7312 if and only if there is no implicit conversion from T1 to T2. */
7315 casts_away_constness_r (tree *t1, tree *t2)
7320 /* [expr.const.cast]
7322 For multi-level pointer to members and multi-level mixed pointers
7323 and pointers to members (conv.qual), the "member" aspect of a
7324 pointer to member level is ignored when determining if a const
7325 cv-qualifier has been cast away. */
7326 /* [expr.const.cast]
7328 For two pointer types:
7330 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
7331 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
7334 casting from X1 to X2 casts away constness if, for a non-pointer
7335 type T there does not exist an implicit conversion (clause
7338 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
7342 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
7343 if ((!TYPE_PTR_P (*t1) && !TYPE_PTRMEM_P (*t1))
7344 || (!TYPE_PTR_P (*t2) && !TYPE_PTRMEM_P (*t2)))
7346 *t1 = cp_build_qualified_type (void_type_node,
7347 cp_type_quals (*t1));
7348 *t2 = cp_build_qualified_type (void_type_node,
7349 cp_type_quals (*t2));
7353 quals1 = cp_type_quals (*t1);
7354 quals2 = cp_type_quals (*t2);
7356 if (TYPE_PTRMEM_P (*t1))
7357 *t1 = TYPE_PTRMEM_POINTED_TO_TYPE (*t1);
7359 *t1 = TREE_TYPE (*t1);
7360 if (TYPE_PTRMEM_P (*t2))
7361 *t2 = TYPE_PTRMEM_POINTED_TO_TYPE (*t2);
7363 *t2 = TREE_TYPE (*t2);
7365 casts_away_constness_r (t1, t2);
7366 *t1 = build_pointer_type (*t1);
7367 *t2 = build_pointer_type (*t2);
7368 *t1 = cp_build_qualified_type (*t1, quals1);
7369 *t2 = cp_build_qualified_type (*t2, quals2);
7372 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
7375 ??? This function returns non-zero if casting away qualifiers not
7376 just const. We would like to return to the caller exactly which
7377 qualifiers are casted away to give more accurate diagnostics.
7381 casts_away_constness (tree t1, tree t2)
7383 if (TREE_CODE (t2) == REFERENCE_TYPE)
7385 /* [expr.const.cast]
7387 Casting from an lvalue of type T1 to an lvalue of type T2
7388 using a reference cast casts away constness if a cast from an
7389 rvalue of type "pointer to T1" to the type "pointer to T2"
7390 casts away constness. */
7391 t1 = (TREE_CODE (t1) == REFERENCE_TYPE ? TREE_TYPE (t1) : t1);
7392 return casts_away_constness (build_pointer_type (t1),
7393 build_pointer_type (TREE_TYPE (t2)));
7396 if (TYPE_PTRMEM_P (t1) && TYPE_PTRMEM_P (t2))
7397 /* [expr.const.cast]
7399 Casting from an rvalue of type "pointer to data member of X
7400 of type T1" to the type "pointer to data member of Y of type
7401 T2" casts away constness if a cast from an rvalue of type
7402 "pointer to T1" to the type "pointer to T2" casts away
7404 return casts_away_constness
7405 (build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t1)),
7406 build_pointer_type (TYPE_PTRMEM_POINTED_TO_TYPE (t2)));
7408 /* Casting away constness is only something that makes sense for
7409 pointer or reference types. */
7410 if (TREE_CODE (t1) != POINTER_TYPE
7411 || TREE_CODE (t2) != POINTER_TYPE)
7414 /* Top-level qualifiers don't matter. */
7415 t1 = TYPE_MAIN_VARIANT (t1);
7416 t2 = TYPE_MAIN_VARIANT (t2);
7417 casts_away_constness_r (&t1, &t2);
7418 if (!can_convert (t2, t1))
7424 /* If T is a REFERENCE_TYPE return the type to which T refers.
7425 Otherwise, return T itself. */
7428 non_reference (tree t)
7430 if (TREE_CODE (t) == REFERENCE_TYPE)
7436 /* Return nonzero if REF is an lvalue valid for this language;
7437 otherwise, print an error message and return zero. USE says
7438 how the lvalue is being used and so selects the error message. */
7441 lvalue_or_else (tree ref, enum lvalue_use use, tsubst_flags_t complain)
7443 int win = lvalue_p (ref);
7445 if (!win && (complain & tf_error))